{"id":"2308.05428","submitter":"Haozhe Wu","authors":"Haozhe Wu, Songtao Zhou, Jia Jia, Junliang Xing, Qi Wen, Xiang Wen","title":"Speech-Driven 3D Face Animation with Composite and Regional Facial\n  Movements","comments":"Accepted by MM 2023, 9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Speech-driven 3D face animation poses significant challenges due to the\nintricacy and variability inherent in human facial movements. This paper\nemphasizes the importance of considering both the composite and regional\nnatures of facial movements in speech-driven 3D face animation. The composite\nnature pertains to how speech-independent factors globally modulate\nspeech-driven facial movements along the temporal dimension. Meanwhile, the\nregional nature alludes to the notion that facial movements are not globally\ncorrelated but are actuated by local musculature along the spatial dimension.\nIt is thus indispensable to incorporate both natures for engendering vivid\nanimation. To address the composite nature, we introduce an adaptive modulation\nmodule that employs arbitrary facial movements to dynamically adjust\nspeech-driven facial movements across frames on a global scale. To accommodate\nthe regional nature, our approach ensures that each constituent of the facial\nfeatures for every frame focuses on the local spatial movements of 3D faces.\nMoreover, we present a non-autoregressive backbone for translating audio to 3D\nfacial movements, which maintains high-frequency nuances of facial movements\nand facilitates efficient inference. Comprehensive experiments and user studies\ndemonstrate that our method surpasses contemporary state-of-the-art approaches\nboth qualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:42:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wu","Haozhe",""],["Zhou","Songtao",""],["Jia","Jia",""],["Xing","Junliang",""],["Wen","Qi",""],["Wen","Xiang",""]]}
{"id":"2308.05429","submitter":"Johannes Zeitler","authors":"Johannes Zeitler, Simon Deniffel, Michael Krause, and Meinard M\\\"uller","title":"Stabilizing Training with Soft Dynamic Time Warping: A Case Study for\n  Pitch Class Estimation with Weakly Aligned Targets","comments":"Accepted for ISMIR 2023, Milano, Italy","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Soft dynamic time warping (SDTW) is a differentiable loss function that\nallows for training neural networks from weakly aligned data. Typically, SDTW\nis used to iteratively compute and refine soft alignments that compensate for\ntemporal deviations between the training data and its weakly annotated targets.\nOne major problem is that a mismatch between the estimated soft alignments and\nthe reference alignments in the early training stage leads to incorrect\nparameter updates, making the overall training procedure unstable. In this\npaper, we investigate such stability issues by considering the task of pitch\nclass estimation from music recordings as an illustrative case study. In\nparticular, we introduce and discuss three conceptually different strategies (a\nhyperparameter scheduling, a diagonal prior, and a sequence unfolding strategy)\nwith the objective of stabilizing intermediate soft alignment results. Finally,\nwe report on experiments that demonstrate the effectiveness of the strategies\nand discuss efficiency and implementation issues.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:42:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zeitler","Johannes",""],["Deniffel","Simon",""],["Krause","Michael",""],["M\u00fcller","Meinard",""]]}
{"id":"2308.05430","submitter":"Jyoti Kini","authors":"Jyoti Kini, Sarah Fleischer, Ishan Dave, Mubarak Shah","title":"Ensemble Modeling for Multimodal Visual Action Recognition","comments":"Technical Report accepted at the Multimodal Action Recognition\n  Challenge on the MECCANO Dataset - ICIAP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we propose an ensemble modeling approach for multimodal action\nrecognition. We independently train individual modality models using a variant\nof focal loss tailored to handle the long-tailed distribution of the MECCANO\n[21] dataset. Based on the underlying principle of focal loss, which captures\nthe relationship between tail (scarce) classes and their prediction\ndifficulties, we propose an exponentially decaying variant of focal loss for\nour current task. It initially emphasizes learning from the hard misclassified\nexamples and gradually adapts to the entire range of examples in the dataset.\nThis annealing process encourages the model to strike a balance between\nfocusing on the sparse set of hard samples, while still leveraging the\ninformation provided by the easier ones. Additionally, we opt for the late\nfusion strategy to combine the resultant probability distributions from RGB and\nDepth modalities for final action prediction. Experimental evaluations on the\nMECCANO dataset demonstrate the effectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:43:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kini","Jyoti",""],["Fleischer","Sarah",""],["Dave","Ishan",""],["Shah","Mubarak",""]]}
{"id":"2308.05431","submitter":"T. Jeremy P. Karpowski","authors":"T. Jeremy P. Karpowski, Federica Ferraro, Matthias Steinhausen,\n  Sebastian Popp, Christoph M. Arndt, Christian Kraus, Henning Bockhorn,\n  Wolfgang Meier, Christian Hasse","title":"Numerical Investigation of the Local Thermo-Chemical State in a\n  Thermo-Acoustically Unstable Dual Swirl Gas Turbine Model Combustor","comments":"Proceedings of the ASME Turbo Expo 2022 Turbomachinery Technical\n  Conference and Exposition. Volume 3B Combustion, Fuels, and Emissions.\n  Rotterdam, Netherlands. 2022 ASME","journal-ref":null,"doi":"10.1115/GT2022-83810","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, the thermo-acoustic instabilities of a gas turbine model\ncombustor, the so-called SFB606 combustor, are numerically investigated using\nLarge Eddy Simulation (LES) combined with tabulated chemistry and Artificial\nThickened Flame (ATF) approach. The main focus is a detailed analysis of the\nthermo-acoustic cycle and the accompanied equivalence ratio oscillations and\ntheir associated convective time delay. In particular, the variations of the\nthermo-chemical state and flame characteristics over the thermo-acoustic cycle\nare investigated. For the operating point flame B ($P_{th}=25\\,$kW), the burner\nexhibits thermo-acoustic instabilities with a dominant frequency of 392Hz, the\nacoustic eigenmode of the inner air inlet duct. These oscillations are\naccompanied by an equivalence ratio oscillation, which exhibits a convective\ntime delay between the injection in the inner swirler and the flame zone. Two\nLES, one adiabatic and one accounting for heat losses at the walls by\nprescribing the wall temperatures from experimental data and Conjugated Heat\nTransfer (CHT) simulations, are conducted. Results with the enthalpy-dependent\ntable are found to predict the time-averaged flow field in terms of velocity,\nmajor species, and temperature with higher accuracy than in the adiabatic case.\nFurther, they indicate, that heat losses should be accounted for to correctly\npredict the flame position. Subsequently, the thermo-chemical state variations\nover the thermo-acoustic cycle for the enthalpy-dependant case are analyzed in\ndetail and compared with experimental data in terms of phase-conditioned\naveraged profiles and conditional averages. An overall good prediction is\nobserved. The results provide a detailed quantitative analysis of the\nthermo-acoustic feedback mechanism of this burner.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:45:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Karpowski","T. Jeremy P.",""],["Ferraro","Federica",""],["Steinhausen","Matthias",""],["Popp","Sebastian",""],["Arndt","Christoph M.",""],["Kraus","Christian",""],["Bockhorn","Henning",""],["Meier","Wolfgang",""],["Hasse","Christian",""]]}
{"id":"2308.05432","submitter":"Ankit Anand","authors":"Ankit Anand","title":"Island in Warped AdS Black Holes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the Page curve in Warped Anti-de Sitter black holes\nusing the quantum extremal surface prescription. The findings reveal that in\nthe absence of an island, the entanglement entropy of Hawking radiation grows\nproportionally with time and becomes divergent at later times. However, when\nconsidering the island's emergence, which extends slightly beyond the event\nhorizon, the growth of the entanglement entropy of Hawking radiation comes to a\nconstant value. Eventually, the constant value is precisely twice the\nBekenstein-Hawking entropy. We have also discussed the Page time as well as the\nScrambling time.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:47:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Anand","Ankit",""]]}
{"id":"2308.05433","submitter":"Diego Gonzalez-Buitrago Dr.","authors":"D. H. Gonz\\'alez-Buitrago, Ma. T. Garc\\'ia-D\\'iaz, F. Pozo Nu\\~nez,\n  and Hengxiao Guo","title":"On the nature of the continuum reverberation of X-ray/UV and optical\n  emission of IRAS 09149-6206","comments":"10 pages, 11 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":"  We present the results of a continuum reverberation mapping study of the\nradio-quiet Seyfert 1 galaxy IRAS 09149-6206. The analysis was performed using\nX-ray, UV and optical observations made with the {\\em Swift} telescope between\nJanuary and December 2017. The time delays between different light curves were\nmeasured using three different algorithms: PyI$^2$CCF, PyROA and JAVELIN. Our\nresults show that the time delays increase with wavelength after $\\tau\\propto\n\\lambda^{4/3}$, as predicted for a geometrically thin and optically thick\naccretion disc, but only after accounting for significant diffuse continuum\nemission from the broad line region. However, the measured size of the\naccretion disc can be up to five times larger than that predicted by standard\ntheory. To our surprise, the strong increase in soft X-ray fluxes is delayed by\nabout 15 days compared to the optical UV fluctuations, which challenges the\nprediction of the lamp-post model. Our analysis of the X-ray variability\nreveals the presence of a non-variable spectral component at 0.3-6.0 keV along\nwith variable excess emission at 2.0-3.0 keV, which could be partly related to\nrelativistic reflection in the inner region of the accretion disc. IRAS\n09149-6206 joins the list of objects for which the traditional lamp-post model\ncannot explain the observed time delays. A scenario that incorporates other\ngeometric considerations into the lamp-post model, e.g. an extended corona\nalong a scattering source, might be better suited to explain the observed long\ntime delays\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:48:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gonz\u00e1lez-Buitrago","D. H.",""],["Garc\u00eda-D\u00edaz","Ma. T.",""],["Nu\u00f1ez","F. Pozo",""],["Guo","Hengxiao",""]]}
{"id":"2308.05434","submitter":"Bohayra Mortazavi","authors":"Bohayra Mortazavi, Yves Remond, Hongyuan Fang, Timon Rabczuk and\n  Xiaoying Zhuang","title":"Hexagonal boron-carbon fullerene heterostructures; Stable\n  two-dimensional semiconductors with remarkable stiffness, low thermal\n  conductivity and flat bands","comments":null,"journal-ref":"Materials Today Communications 2023","doi":"10.1016/j.mtcomm.2023.106856","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Among exciting recent advances in the field of two-dimensional (2D)\nmaterials, the successful fabrications of the C60 fullerene networks has been a\nparticularly inspiring accomplishment. Motivated by the recent achievements,\nherein we explore the stability and physical properties of novel hexagonal\nboron-carbon fullerene 2D heterostructures, on the basis of already synthesized\nB40 and C36 fullerenes. By performing extensive structural minimizations of\ndiverse atomic configurations using the density functional theory method, for\nthe first time, we could successfully detect thermally and dynamically stable\nboron-carbon fullerene 2D heterostructures. Density functional theory results\nconfirm that the herein predicted 2D networks exhibit very identical\nsemiconducting electronic natures with topological flat bands. Using the\nmachine learning interatomic potentials, we also investigated the mechanical\nand thermal transport properties. Despite of different bonding architectures,\nthe room temperature lattice thermal conductivity of the predicted nanoporous\nfullerene heterostructures was found to range between 4 to 10 W/mK.\nBoron-carbon fullerene heterostructures are predicted to show anisotropic but\nalso remarkable mechanical properties, with tensile strengths and elastic\nmodulus over 8 and 70 GPa, respectively. This study introduces the possibility\nof developing a novel class of 2D heterostructures based on the fullerene\ncages, with attractive electronic, thermal and mechanical features.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:49:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mortazavi","Bohayra",""],["Remond","Yves",""],["Fang","Hongyuan",""],["Rabczuk","Timon",""],["Zhuang","Xiaoying",""]]}
{"id":"2308.05435","submitter":"Tilo Wiklund","authors":"Tilo Wiklund","title":"Another look at binomial and related distributions exceeding values\n  close to their centre","comments":"19 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalise the known fact that for binomial $X_{n,k} \\sim \\mathrm{Bin}(n,\nk/n)$ one has $\\inf_{k>1,n} \\mathrm{P}(X_{n,k} \\geq k) \\geq \\lim_{k \\to\n1+}\\mathrm{P}(X_{2,k} \\geq k) = 1/4$ to cover probabilities of exceeding a\nconstant shift away from the mean. The proof is very short and the theorem\nyields the original result as a special case, as well as proving that an\nanalogous result holds for the Poisson distribution. We furthermore prove a\nsimilar property holds for the family of beta distributions near their mode.\nThanks to the connection between Binomial and Beta distributions, this allows\nus to shed some further light on the original result regarding Binomial\nprobabilities.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:49:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wiklund","Tilo",""]]}
{"id":"2308.05436","submitter":"Yuya Kusuki","authors":"Andreas Karch, Yuya Kusuki, Hirosi Ooguri, Hao-Yu Sun, Mianqi Wang","title":"Universality of Effective Central Charge in Interface CFTs","comments":"25 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"CALT-TH 2023-031, IPMU 23-0025, RIKEN-iTHEMS-Report-23","categories":"hep-th cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When an interface connects two CFTs, the entanglement entropy between the two\nCFTs is determined by a quantity called the effective central charge. The\neffective central charge does not have a simple form in terms of the central\ncharges of the two CFTs, but intricately depends on the transmissive properties\nof the interface. In this article, we examine universal properties of the\neffective central charge. We first clarify how the effective central charge\nappears when considering general subsystems of the interface CFT. Then using\nthis result and ideas used in the proof of the $c$-theorem, we provide a\nuniversal upper bound on the effective central charge.\n  In past studies, the effective central charge was defined only in two\ndimensions. We propose an analogue of the effective central charge in general\ndimensions possessing similar universal properties as in two dimensions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:49:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Karch","Andreas",""],["Kusuki","Yuya",""],["Ooguri","Hirosi",""],["Sun","Hao-Yu",""],["Wang","Mianqi",""]]}
{"id":"2308.05437","submitter":"Pratap Sahoo","authors":"Madhusmita Sahoo, Kalyan Ghosh, Swayamprakash Sahoo, Pratap K. Sahoo,\n  Tom Mathews, and Sandip Dhara","title":"Determination of Thermal Conductivity of phase pure 10H-SiC Thin Films\n  by non-destructive Raman Thermometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  10 H SiC thin films are potential candidates for devices that can be used in\nhigh temperature and high radiation environment. Measurement of thermal\nconductivity of thin films by a non-invasive method is very useful for such\ndevice fabrication. Micro-Raman method serves as an important tool in this\naspect and is known as Raman Thermometry. It utilises a steady-state heat\ntransfer model in a semi-infinite half space and provides for an effective\ntechnique to measure thermal conductivity of films as a function of film\nthickness and laser spot size. This method has two limiting conditions i.e.\nthick film limit and thin film limit. The limiting conditions of this model was\nexplored by simulating the model for different film thicknesses at constant\nlaser spot size. 10H SiC films of three different thicknesses i.e. 104, 135 and\n156 nm were chosen to validate the thin film limiting condition. It was found\nthat the ideal thickness at which this method can be utilised for calculating\nthermal conductivity is 156 nm. Thermal conductivity of 156 nm film is found to\nbe 102.385 $(Wm^{-1}K^{-1})$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:50:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sahoo","Madhusmita",""],["Ghosh","Kalyan",""],["Sahoo","Swayamprakash",""],["Sahoo","Pratap K.",""],["Mathews","Tom",""],["Dhara","Sandip",""]]}
{"id":"2308.05438","submitter":"Jun Zhou","authors":"Jun Zhou, Kai Chen, Linlin Xu, Qi Dou, Jing Qin","title":"Deep Fusion Transformer Network with Weighted Vector-Wise Keypoints\n  Voting for Robust 6D Object Pose Estimation","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":"  One critical challenge in 6D object pose estimation from a single RGBD image\nis efficient integration of two different modalities, i.e., color and depth. In\nthis work, we tackle this problem by a novel Deep Fusion Transformer~(DFTr)\nblock that can aggregate cross-modality features for improving pose estimation.\nUnlike existing fusion methods, the proposed DFTr can better model\ncross-modality semantic correlation by leveraging their semantic similarity,\nsuch that globally enhanced features from different modalities can be better\nintegrated for improved information extraction. Moreover, to further improve\nrobustness and efficiency, we introduce a novel weighted vector-wise voting\nalgorithm that employs a non-iterative global optimization strategy for precise\n3D keypoint localization while achieving near real-time inference. Extensive\nexperiments show the effectiveness and strong generalization capability of our\nproposed 3D keypoint voting algorithm. Results on four widely used benchmarks\nalso demonstrate that our method outperforms the state-of-the-art methods by\nlarge margins.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:52:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhou","Jun",""],["Chen","Kai",""],["Xu","Linlin",""],["Dou","Qi",""],["Qin","Jing",""]]}
{"id":"2308.05439","submitter":"Marko Gacesa","authors":"Marko Gacesa","title":"Elastic and inelastic cross sections for $^{12}$C+CO$_2$ and\n  $^{13}$C+CO$_2$ scattering at superthermal energies","comments":"9 pages, 9 figures; submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph physics.atom-ph physics.chem-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report elastic and inelastic cross sections for fast superthermal\n$^{12}$C($^3P$) and $^{13}$C($^3P$) atoms scattering on $^{12}$CO$_2$. The\ncross sections were computed using quantum-mechanical rotationally\nclose-coupling formalism with the electronic interaction described by a newly\nconstructed potential energy surface correlating to the lowest energy asymptote\nof the complex. State-to-state cross sections, differential cross sections, and\nderived transport properties of interest for energy relaxation are also\nreported. The computed elastic cross sections are strongly anisotropic, show\nsignificant energy dependence, and differ by up to 2% between the two isotopes\nof carbon.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:55:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gacesa","Marko",""]]}
{"id":"2308.05440","submitter":"Vittorio De Falco Dr","authors":"Vittorio De Falco, Salvatore Capozziello","title":"Static and spherically symmetric wormholes in metric-affine theories of\n  gravity","comments":"10 pages, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider static and spherically symmetric wormhole solutions in extended\nmetric-affine theories of gravity supposing that stability and traversability\nof these objects can be achieved by means of the geometric degrees of freedom.\nIn particular, we consider $f(R)$ metric, $f(T)$ teleparallel, and $f(Q)$\nsymmetric teleparallel models where curvature, torsion, and non-metricity rule\nentirely the background geometry without invoking any exotic energy-momentum\ntensor as matter field source. Starting from the flaring out and null energy\nconditions, we gather together a series of constraints which allow us to state\nthat stable and traversable wormholes can be derived in a purely geometric\napproach resorting to modified gravity theories with more degrees of freedom\nthan general relativity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:56:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["De Falco","Vittorio",""],["Capozziello","Salvatore",""]]}
{"id":"2308.05441","submitter":"Hao Liang","authors":"Hao Liang, Pietro Perona and Guha Balakrishnan","title":"Benchmarking Algorithmic Bias in Face Recognition: An Experimental\n  Approach Using Synthetic Faces and Human Evaluation","comments":"accepted to iccv2023; 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an experimental method for measuring bias in face recognition\nsystems. Existing methods to measure bias depend on benchmark datasets that are\ncollected in the wild and annotated for protected (e.g., race, gender) and\nnon-protected (e.g., pose, lighting) attributes. Such observational datasets\nonly permit correlational conclusions, e.g., \"Algorithm A's accuracy is\ndifferent on female and male faces in dataset X.\". By contrast, experimental\nmethods manipulate attributes individually and thus permit causal conclusions,\ne.g., \"Algorithm A's accuracy is affected by gender and skin color.\"\n  Our method is based on generating synthetic faces using a neural face\ngenerator, where each attribute of interest is modified independently while\nleaving all other attributes constant. Human observers crucially provide the\nground truth on perceptual identity similarity between synthetic image pairs.\nWe validate our method quantitatively by evaluating race and gender biases of\nthree research-grade face recognition models. Our synthetic pipeline reveals\nthat for these algorithms, accuracy is lower for Black and East Asian\npopulation subgroups. Our method can also quantify how perceptual changes in\nattributes affect face identity distances reported by these models. Our large\nsynthetic dataset, consisting of 48,000 synthetic face image pairs (10,200\nunique synthetic faces) and 555,000 human annotations (individual attributes\nand pairwise identity comparisons) is available to researchers in this\nimportant area.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:57:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liang","Hao",""],["Perona","Pietro",""],["Balakrishnan","Guha",""]]}
{"id":"2308.05442","submitter":"Di Wu","authors":"Rui Li, Di Wu, Jinfeng Li","title":"Optimal chromatic bound for ($P_3\\cup P_2$, house)-free graphs","comments":"arXiv admin note: text overlap with arXiv:2307.11946","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ and $H$ be two vertex disjoint graphs. The {\\em union} $G\\cup H$ is\nthe graph with $V(G\\cup H)=V(G)\\cup V(H)$ and $E(G\\cup H)=E(G)\\cup E(H)$. We\nuse $P_k$ to denote a {\\em path} on $k$ vertices, use {\\em house} to denote the\ncomplement of $P_5$. In this paper, we show that $\\chi(G)\\le2\\omega(G)$ if $G$\nis ($P_3\\cup P_2$, house)-free. Moreover, this bound is optimal when\n$\\omega(G)\\ge2$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:58:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Rui",""],["Wu","Di",""],["Li","Jinfeng",""]]}
{"id":"2308.05443","submitter":"Miguel Arturo Vega Torres","authors":"Miguel Arturo Vega Torres, Alexander Braun, Andr\\'e Borrmann","title":"Occupancy Grid Map to Pose Graph-based Map: Robust BIM-based 2D-LiDAR\n  Localization for Lifelong Indoor Navigation in Changing and Dynamic\n  Environments","comments":"8 pages, 5 figures, conference: eWork and eBusiness in Architecture,\n  Engineering and Construction: ECPPM 2022. booktitle: eWork and eBusiness in\n  Architecture, Engineering and Construction: ECPPM 2022,editors: Eilif\n  Hjelseth, Sujesh F. Sujan, and Raimar Scherer, publisher: CRC Press, year:\n  2022,month: Sep,isbn: 978-1-003-35422-2","journal-ref":null,"doi":"10.1201/9781003354222-72","report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several studies rely on the de facto standard Adaptive Monte Carlo\nLocalization (AMCL) method to localize a robot in an Occupancy Grid Map (OGM)\nextracted from a building information model (BIM model). However, most of these\nstudies assume that the BIM model precisely represents the real world, which is\nrarely true. Discrepancies between the reference BIM model and the real world\n(Scan-BIM deviations) are not only due to furniture or clutter but also the\nusual as-planned and as-built deviations that exist with any model created in\nthe design phase. These deviations affect the accuracy of AMCL drastically.\nThis paper proposes an open-source method to generate appropriate Pose\nGraph-based maps from BIM models for robust 2D-LiDAR localization in changing\nand dynamic environments. First, 2D OGMs are automatically generated from\ncomplex BIM models. These OGMs only represent structural elements allowing\nindoor autonomous robot navigation. Then, an efficient technique converts these\n2D OGMs into Pose Graph-based maps enabling more accurate robot pose tracking.\nFinally, we leverage the different map representations for accurate, robust\nlocalization with a combination of state-of-the-art algorithms. Moreover, we\nprovide a quantitative comparison of various state-of-the-art localization\nalgorithms in three simulated scenarios with varying levels of Scan-BIM\ndeviations and dynamic agents. More precisely, we compare two Particle Filter\n(PF) algorithms: AMCL and General Monte Carlo Localization (GMCL); and two\nGraph-based Localization (GBL) methods: Google's Cartographer and SLAM Toolbox,\nsolving the global localization and pose tracking problems. The numerous\nexperiments demonstrate that the proposed method contributes to a robust\nlocalization with an as-designed BIM model or a sparse OGM in changing and\ndynamic environments, outperforming the conventional AMCL in accuracy and\nrobustness.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:59:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Torres","Miguel Arturo Vega",""],["Braun","Alexander",""],["Borrmann","Andr\u00e9",""]]}
{"id":"2308.05444","submitter":"Barbara Bazzana","authors":"Barbara Bazzana, Henrik Andreasson, Giorgio Grisetti","title":"How-to Augmented Lagrangian on Factor Graphs","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Factor graphs are a very powerful graphical representation, used to model\nmany problems in robotics. They are widely spread in the areas of Simultaneous\nLocalization and Mapping (SLAM), computer vision, and localization. In this\npaper we describe an approach to fill the gap with other areas, such as optimal\ncontrol, by presenting an extension of Factor Graph Solvers to constrained\noptimization. The core idea of our method is to encapsulate the Augmented\nLagrangian (AL) method in factors of the graph that can be integrated\nstraightforwardly in existing factor graph solvers. We show the generality of\nour approach by addressing three applications, arising from different areas:\npose estimation, rotation synchronization and Model Predictive Control (MPC) of\na pseudo-omnidirectional platform. We implemented our approach using C++ and\nROS. Besides the generality of the approach, application results show that we\ncan favorably compare against domain specific approaches.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:01:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bazzana","Barbara",""],["Andreasson","Henrik",""],["Grisetti","Giorgio",""]]}
{"id":"2308.05445","submitter":"Kuan-Yu Lin","authors":"Kuan-Yu Lin, Yu-Chih Huang, and Yu-Pin Hsu","title":"Scheduling for Periodic Multi-Source Systems with Peak-Age Violation\n  Guarantees","comments":"32 pages, 11 figures. arXiv admin note: text overlap with\n  arXiv:2206.04303","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Age of information (AoI) is an effective performance metric measuring the\nfreshness of information and is particularly suitable for applications\ninvolving status update. In this paper, using the age violation probability as\nthe metric, scheduling for heterogeneous multi-source systems is studied. Two\nqueueing disciplines, namely the infinite packet queueing discipline and the\nsingle packet queueing discipline, are considered for scheduling packets within\neach source. A generalized round-robin (GRR) scheduling policy is then proposed\nto schedule the sources. Bounds on the exponential decay rate of the age\nviolation probability for the proposed GRR scheduling policy under each\nqueueing discipline are rigorously analyzed. Simulation results are provided,\nwhich show that the proposed GRR scheduling policy can efficiently serve many\nsources with heterogeneous arrivals and that our bounds can capture the true\ndecay rate quite accurately. When specialized to the homogeneous source\nsetting, the analysis concretizes the common belief that the single packet\nqueueing discipline has a better AoI performance than the infinite packet\nqueueing discipline. Moreover, simulations on this special case reveals that\nunder the proposed scheduling policy, the two disciplines would have similar\nasymptotic performance when the inter-arrival time is much larger than the\ntotal transmission time.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:05:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lin","Kuan-Yu",""],["Huang","Yu-Chih",""],["Hsu","Yu-Pin",""]]}
{"id":"2308.05446","submitter":"Mirco Piccinini","authors":"Mirco Piccinini","title":"A limiting case in partial regularity for quasiconvex functionals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Local minimizers of nonhomogeneous quasiconvex variational integrals with\nstandard $p$-growth of the type $$ w \\mapsto \\int \\left[F(Dw)-f\\cdot w\\right]dx\n$$ feature almost everywhere $\\mbox{BMO}$-regular gradient provided that $f$\nbelongs to the borderline Marcinkiewicz space $L(n,\\infty)$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:05:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Piccinini","Mirco",""]]}
{"id":"2308.05447","submitter":"Pan Mu","authors":"Pan Mu, Hanning Xu, Zheyuan Liu, Zheng Wang, Sixian Chan, Cong Bai","title":"A Generalized Physical-knowledge-guided Dynamic Model for Underwater\n  Image Enhancement","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Underwater images often suffer from color distortion and low contrast\nresulting in various image types, due to the scattering and absorption of light\nby water. While it is difficult to obtain high-quality paired training samples\nwith a generalized model. To tackle these challenges, we design a Generalized\nUnderwater image enhancement method via a Physical-knowledge-guided Dynamic\nModel (short for GUPDM), consisting of three parts: Atmosphere-based Dynamic\nStructure (ADS), Transmission-guided Dynamic Structure (TDS), and Prior-based\nMulti-scale Structure (PMS). In particular, to cover complex underwater scenes,\nthis study changes the global atmosphere light and the transmission to simulate\nvarious underwater image types (e.g., the underwater image color ranging from\nyellow to blue) through the formation model. We then design ADS and TDS that\nuse dynamic convolutions to adaptively extract prior information from\nunderwater images and generate parameters for PMS. These two modules enable the\nnetwork to select appropriate parameters for various water types adaptively.\nBesides, the multi-scale feature extraction module in PMS uses convolution\nblocks with different kernel sizes and obtains weights for each feature map via\nchannel attention block and fuses them to boost the receptive field of the\nnetwork. The source code will be available at\n\\href{https://github.com/shiningZZ/GUPDM}{https://github.com/shiningZZ/GUPDM}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:09:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mu","Pan",""],["Xu","Hanning",""],["Liu","Zheyuan",""],["Wang","Zheng",""],["Chan","Sixian",""],["Bai","Cong",""]]}
{"id":"2308.05448","submitter":"Natalia Bondarenko","authors":"Natalia P. Bondarenko","title":"Local solvability and stability of an inverse spectral problem for\n  higher-order differential operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we for the first time prove local solvability and stability of\nan inverse spectral problem for higher-order ($n > 3$) differential operators\nwith distribution coefficients. The inverse problem consists in the recovery of\ndifferential equation coefficients from $(n-1)$ spectra and the corresponding\nweight numbers. The proof method is constructive. It is based on the reduction\nof the nonlinear inverse problem to a linear equation in the Banach space of\ninfinite sequences. We prove that, under a small perturbation of the spectral\ndata, the main equation remains uniquely solvable and estimate the differences\nof the coefficients in the corresponding functional spaces.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:13:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bondarenko","Natalia P.",""]]}
{"id":"2308.05449","submitter":"Sahar Almahfouz Nasser","authors":"Sahar Almahfouz Nasser, Ashutosh Sharma, Anmol Saraf, Amruta Mahendra\n  Parulekar, Purvi Haria, and Amit Sethi","title":"Transforming Breast Cancer Diagnosis: Towards Real-Time Ultrasound to\n  Mammogram Conversion for Cost-Effective Diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultrasound (US) imaging is better suited for intraoperative settings because\nit is real-time and more portable than other imaging techniques, such as\nmammography. However, US images are characterized by lower spatial resolution\nnoise-like artifacts. This research aims to address these limitations by\nproviding surgeons with mammogram-like image quality in real-time from noisy US\nimages. Unlike previous approaches for improving US image quality that aim to\nreduce artifacts by treating them as (speckle noise), we recognize their value\nas informative wave interference pattern (WIP). To achieve this, we utilize the\nStride software to numerically solve the forward model, generating ultrasound\nimages from mammograms images by solving wave-equations. Additionally, we\nleverage the power of domain adaptation to enhance the realism of the simulated\nultrasound images. Then, we utilize generative adversarial networks (GANs) to\ntackle the inverse problem of generating mammogram-quality images from\nultrasound images. The resultant images have considerably more discernible\ndetails than the original US images.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:15:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nasser","Sahar Almahfouz",""],["Sharma","Ashutosh",""],["Saraf","Anmol",""],["Parulekar","Amruta Mahendra",""],["Haria","Purvi",""],["Sethi","Amit",""]]}
{"id":"2308.05450","submitter":"Martin Fraas","authors":"Martin Fraas","title":"Commuting Kraus operators are normal","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\{V_1, \\dots, V_n \\}$ be a set of mutually commuting matrices. We show\nthat if $V_1^* V_1 + \\cdots +V_n^* V_n = {\\rm Id}$ then the matrices are normal\nand, in particular, simultaneously diagonalizable.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:16:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fraas","Martin",""]]}
{"id":"2308.05451","submitter":"Feng Li","authors":"Feng Li","title":"A Forecaster's Review of Judea Pearl's Causality: Models, Reasoning and\n  Inference, Second Edition, 2009","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.LG stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the big popularity and success of Judea Pearl's original causality book,\nthis review covers the main topics updated in the second edition in 2009 and\nillustrates an easy-to-follow causal inference strategy in a forecast scenario.\nIt further discusses some potential benefits and challenges for causal\ninference with time series forecasting when modeling the counterfactuals,\nestimating the uncertainty and incorporating prior knowledge to estimate causal\neffects in different forecasting scenarios.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:17:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Li","Feng",""]]}
{"id":"2308.05452","submitter":"Muhammad Khalil","authors":"Muhammad I Khalil","title":"Optimizing Reconfigurable Intelligent Surfaces for Improved Space-based\n  Communication Amidst Phase Shift Errors","comments":"Ten pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Reconfigurable Intelligent Surfaces (RISs) have emerged as a promising\ntechnology for enhancing satellite communication systems by manipulating the\nphase of electromagnetic waves. This study addresses optimising phase shift\nvalues (\\phi_{R}) in RIS networks under both ideal and non-ideal conditions.\nFor ideal scenarios, we introduce a novel approach that simplifies the\ntraditional optimisation methods for determining the optimal value. Leveraging\ntrigonometric identities and the law of cosines, we create a more tractable\nformulation for the received power that allows for efficient optimisation of\n\\phi_{R}. However, practical applications often grapple with non-ideal\nconditions. These conditions can introduce phase errors, significantly\naffecting the received signal and overall system performance. To accommodate\nthese complexities, our optimisation framework extends to include phase errors,\nwhich are modelled as a uniform distribution. To solve this optimisation\nproblem, we propose a stochastic framework that harnesses the Monte Carlo\nmethod to consider all plausible phase error values. Furthermore, we employ the\nBroyden Fletcher Goldfarb Shanno (BFGS) algorithm, an iterative method known\nfor its efficacy. This algorithm systematically updates \\phi_{R} values,\nincorporating the gradient of the objective function and Hessian matrix\napproximations. The algorithm also monitors convergence to balance\ncomputational complexity and accuracy. The results of the theoretical analysis\nare illustrated with several examples. As herein demonstrated, the proposed\nsolution offers profound insights into the impacts of phase errors on RIS\nsystem performance. It also unveils innovative optimisation strategies for\nreal-world satellite communication scenarios under diverse conditions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:22:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Khalil","Muhammad I",""]]}
{"id":"2308.05453","submitter":"Hanieh Fattahi Dr","authors":"Soyeon Jun, Andreas Herbst, Kilian Scheffter, Nora John, Julia Kolb,\n  Daniel Wehner, Hanieh Fattahi","title":"Highly Nonlinear Dynamics of In Vivo Deep-Tissue Interaction with\n  Femtosecond Laser Pulses at 1030 nm","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":"  We report on the highly nonlinear behavior observed in the central nervous\nsystem tissue of zebrafish (Danio rerio) when exposed to femtosecond pulses at\n1030 nm. At this irradiation wavelength, photo damage becomes detectable only\nafter exceeding a specific peak intensity threshold, which is independent of\nthe photon flux and irradiation time, distinguishing it from irradiation at\nshorter wavelengths. Furthermore, we investigate and quantify the role of\nexcessive heat in reducing the damage threshold, particularly during\nhigh-repetition-rate operations, which are desirable for label-free and\nmulti-dimensional microscopy techniques. To verify our findings, we examined\ncellular responses to tissue damage, including apoptosis and the recruitment of\nmacrophages and fibroblasts at different time points post-irradiation. These\nfindings substantially contribute to advancing the emerging nonlinear optical\nmicroscopy techniques and provide a strategy for inducing deep-tissue, precise\nand localized injuries using near-infrared femtosecond laser pulses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:24:41 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:01:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jun","Soyeon",""],["Herbst","Andreas",""],["Scheffter","Kilian",""],["John","Nora",""],["Kolb","Julia",""],["Wehner","Daniel",""],["Fattahi","Hanieh",""]]}
{"id":"2308.05454","submitter":"Hai-Le Yan","authors":"Xue-Qian Wang, Ying Zhao, Hao-Xuan Liu, Shuchen Sun, Hongbo Yang,\n  Jiamin Zhong, Ganfeng Tu, Song Li, Hai-Le Yan, Liang Zuo","title":"Finite-temperature ductility-brittleness and electronic structures of\n  Al$_{n}$Sc (n=1, 2 and 3)","comments":"14 pages, 10 figures","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":"  Finite-temperature ductility-brittleness and electronic structures of\nAl$_3$Sc, Al$_2$Sc and AlSc are studied comparatively by first-principles\ncalculations and ab-initio molecular dynamics. Results show that Al$_3$Sc and\nAl$_2$Sc are inherently brittle at both ground state and finite temperatures.\nBy contrast, AlSc possesses a significantly superior ductility evaluated from\nall Pugh's, Pettifor's and Poisson's ductility-brittleness criteria. At ground\nstate, AlSc meets the criteria of ductile according to Pugh's and Poisson's\ntheories, while it is categorized as the brittle in the frame of Pettifor's\npicture. With the increasing temperature, the ductility of all the studied\ncompounds exhibits a noticeable improvement. In particular, as the temperature\nrises, the Cauchy pressure of AlSc undergoes a transition from negative to\npositive. Thus, at high temperatures (T > 600 K), AlSc is unequivocally\nclassified as the ductile from all criteria considered. In all Al$_3$Sc,\nAl$_2$Sc and AlSc, the Al-Al bond, originated from s-p and p-p orbital\nhybridizations, and the Al-Sc bond, dominated by p-d covalent hybridization,\nare the first and second strongest chemical bonds, respectively. To explain the\ndifference in mechanical properties of the studied compounds, the mean bond\nstrength (MBS) is evaluated. The weaker Al-Al bond in AlSc, leading to a\nsmaller MBS, could be the origin for the softer elastic stiffness and superior\nintrinsic ductility. The longer length of the Al-Al bond in AlSc is responsible\nfor its weaker bond strength. Furthermore, the enhanced metallicity of the\nAl-Al bond in AlSc would also contribute to its exceptional ductility.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:25:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Xue-Qian",""],["Zhao","Ying",""],["Liu","Hao-Xuan",""],["Sun","Shuchen",""],["Yang","Hongbo",""],["Zhong","Jiamin",""],["Tu","Ganfeng",""],["Li","Song",""],["Yan","Hai-Le",""],["Zuo","Liang",""]]}
{"id":"2308.05455","submitter":"Baksa Kolok","authors":"Baksa Kolok and Andr\\'as P\\'alyi","title":"Protocols to measure the non-Abelian Berry phase by pumping a spin qubit\n  through a quantum-dot loop","comments":"11 pages main text, +5 pages appendix and bibliography, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A quantum system constrained to a degenerate energy eigenspace can undergo a\nnontrival time evolution upon adiabatic driving, described by a non-Abelian\nBerry phase. This type of dynamics may provide logical gates in quantum\ncomputing that are robust against timing errors. A strong candidate to realize\nsuch holonomic quantum gates is an electron or hole spin qubit trapped in a\nspin-orbit-coupled semiconductor, whose twofold Kramers degeneracy is protected\nby time-reversal symmetry. Here, we propose and quantitatively analyze\nprotocols to measure the non-Abelian Berry phase by pumping a spin qubit\nthrough a loop of quantum dots. One of these protocols allows to characterize\nthe local internal Zeeman field directions in the dots of the loop. We expect a\nnear-term realisation of these protocols, as all key elements have been already\ndemonstrated in spin-qubit experiments. These experiments would be important to\nassess the potential of holonomic quantum gates for spin-based quantum\ninformation processing.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:26:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kolok","Baksa",""],["P\u00e1lyi","Andr\u00e1s",""]]}
{"id":"2308.05456","submitter":"Oliver Hines","authors":"Oliver Hines, Karla Diaz-Ordaz, Stijn Vansteelandt","title":"Optimally weighted average derivative effects","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":"  Inference for weighted average derivative effects (WADEs) usually relies on\nkernel density estimators, which introduce complicated bandwidth-dependant\nbiases. By considering a new class of Riesz representers, we propose WADEs\nwhich require estimating conditional expectations only, and derive an optimally\nefficient WADE, also connected to projection parameters in partially linear\nmodels. We derive efficient estimators under the nonparametric model, which are\namenable to machine learning of working models. We propose novel learning\nstrategies based on the R-learner strategy. We perform a simulation study and\napply our estimators to determine the effect of Warfarin dose on blood clotting\nfunction.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:27:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hines","Oliver",""],["Diaz-Ordaz","Karla",""],["Vansteelandt","Stijn",""]]}
{"id":"2308.05457","submitter":"Xu Chang","authors":"Shuo Yang, Ruijia Li, and Chang Xu","title":"Alpha-Clustering in Nuclei and Its Impact on Nuclear Symmetry Energy","comments":"6 pages, 5 figures, accepted for publication in Physical Review C","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nuclear symmetry energy is a fundamental quantity currently under intense\ninvestigation in both nuclear physics and astrophysics. The {\\it softness} or\n{\\it stiffness} of symmetry energy is still under debate and the extraction of\nsymmetry energy from neutron skin thickness $R_{\\rm skin}$ remains a challenge.\nParity-violating measurements PREX and CREX provide important opportunities for\nconstraining $R_{\\rm skin}$ in $^{208}$Pb and $^{48}$Ca. We investigate the\noccurrence of $\\alpha$-cluster at the surface of nuclei and its impact on the\nextraction of symmetry energy from $R_{\\rm skin}$. Our result indicates that\nthe $\\alpha$-clustering probability in $^{208}$Pb is small and the extracted\ndensity slope of symmetry energy $L$ is almost unaffected. In contrast, the\n$\\alpha$-clustering probability in $^{48}$Ca is sizeable and the corresponding\ncorrection to $L$ should be taken into account. This correction progressively\nincreases with the $\\alpha$-clustering probability, leading to a modification\nof the $L$-$R_{\\rm skin}$ correlation, a fact may have important implications\nin constraining nuclear symmetry energy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:31:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yang","Shuo",""],["Li","Ruijia",""],["Xu","Chang",""]]}
{"id":"2308.05458","submitter":"Tim R\\\"az","authors":"Tim R\\\"az","title":"Inter-Rater Reliability is Individual Fairness","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this note, a connection between inter-rater reliability and individual\nfairness is established. It is shown that inter-rater reliability is a special\ncase of individual fairness, a notion of fairness requiring that similar people\nare treated similarly.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:31:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["R\u00e4z","Tim",""]]}
{"id":"2308.05459","submitter":"Changkun Liu","authors":"Changkun Liu, Yukun Zhao, Tristan Braud","title":"KS-APR: Keyframe Selection for Robust Absolute Pose Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Markerless Mobile Augmented Reality (AR) aims to anchor digital content in\nthe physical world without using specific 2D or 3D objects. Absolute Pose\nRegressors (APR) are end-to-end machine learning solutions that infer the\ndevice's pose from a single monocular image. Thanks to their low computation\ncost, they can be directly executed on the constrained hardware of mobile AR\ndevices. However, APR methods tend to yield significant inaccuracies for input\nimages that are too distant from the training set. This paper introduces\nKS-APR, a pipeline that assesses the reliability of an estimated pose with\nminimal overhead by combining the inference results of the APR and the prior\nimages in the training set. Mobile AR systems tend to rely upon visual-inertial\nodometry to track the relative pose of the device during the experience. As\nsuch, KS-APR favours reliability over frequency, discarding unreliable poses.\nThis pipeline can integrate most existing APR methods to improve accuracy by\nfiltering unreliable images with their pose estimates. We implement the\npipeline on three types of APR models on indoor and outdoor datasets. The\nmedian error on position and orientation is reduced for all models, and the\nproportion of large errors is minimized across datasets. Our method enables\nstate-of-the-art APRs such as DFNetdm to outperform single-image and sequential\nAPR methods. These results demonstrate the scalability and effectiveness of\nKS-APR for visual localization tasks that do not require one-shot decisions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:32:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Changkun",""],["Zhao","Yukun",""],["Braud","Tristan",""]]}
{"id":"2308.05460","submitter":"Ken Yamamoto","authors":"Ken Yamamoto, Seiya Uezu, Keiichiro Kagawa, Yoshihiro Yamazaki, Takuma\n  Narizuka","title":"Statistical analysis of player and team ball possession time in football","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, the stochastic properties of player and team ball possession\ntimes in professional football matches are examined. Data analysis shows that\nplayer possession time follows a gamma distribution and the player count of a\nteam possession event follows a mixture of two geometric distributions. We\npropose a formula for expressing team possession time in terms of player\npossession time and player count in a team's possession, verifying its validity\nthrough data analysis. Furthermore, we calculate an approximate form of the\ndistribution of team possession time, and study its asymptotic property.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:34:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yamamoto","Ken",""],["Uezu","Seiya",""],["Kagawa","Keiichiro",""],["Yamazaki","Yoshihiro",""],["Narizuka","Takuma",""]]}
{"id":"2308.05461","submitter":"Giancarlo Rinaldo","authors":"Giancarlo Rinaldo, Francesco Romeo, Rajib Sarkar","title":"Level and pseudo-Gorenstein path polyominoes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify path polyominoes which are level and pseudo-Gorenstein. Moreover,\nwe compute all level and pseudo-Gorenstein simple thin polyominoes with rank\nless than or equal to 10 and we compute the regularity of the pseudo-Gorenstein\nsimple thin polyominoes in relation to their cardinality.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:36:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rinaldo","Giancarlo",""],["Romeo","Francesco",""],["Sarkar","Rajib",""]]}
{"id":"2308.05462","submitter":"Kristian Thijssen","authors":"Ryan R. Keogh, Timofey Kozhukhov, Kristian Thijssen, Tyler N. Shendruk","title":"Active Darcy's Law","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While bacterial swarms can exhibit active turbulence in vacant spaces, they\nnaturally inhabit crowded environments. We numerically show that driving\ndisorderly active fluids through porous media enhances Darcy's law. While\npurely active flows average to zero flux, hybrid active/driven flows display\ngreater drift than pure-driven fluids. This enhancement is non-monotonic with\nactivity, leading to an optimal activity to maximize flow rate. We incorporate\nthe active contribution into an active Darcy's law, which may serve to help\nunderstand anomalous transport of swarming in porous media.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:39:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Keogh","Ryan R.",""],["Kozhukhov","Timofey",""],["Thijssen","Kristian",""],["Shendruk","Tyler N.",""]]}
{"id":"2308.05463","submitter":"Qin Zhang","authors":"Qin Zhang, Zelin Shi, Xiaolin Zhang, Xiaojun Chen, Philippe\n  Fournier-Viger, Shirui Pan","title":"$\\mathcal{G}^2Pxy$: Generative Open-Set Node Classification on Graphs\n  with Proxy Unknowns","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Node classification is the task of predicting the labels of unlabeled nodes\nin a graph. State-of-the-art methods based on graph neural networks achieve\nexcellent performance when all labels are available during training. But in\nreal-life, models are often applied on data with new classes, which can lead to\nmassive misclassification and thus significantly degrade performance. Hence,\ndeveloping open-set classification methods is crucial to determine if a given\nsample belongs to a known class. Existing methods for open-set node\nclassification generally use transductive learning with part or all of the\nfeatures of real unseen class nodes to help with open-set classification. In\nthis paper, we propose a novel generative open-set node classification method,\ni.e. $\\mathcal{G}^2Pxy$, which follows a stricter inductive learning setting\nwhere no information about unknown classes is available during training and\nvalidation. Two kinds of proxy unknown nodes, inter-class unknown proxies and\nexternal unknown proxies are generated via mixup to efficiently anticipate the\ndistribution of novel classes. Using the generated proxies, a closed-set\nclassifier can be transformed into an open-set one, by augmenting it with an\nextra proxy classifier. Under the constraints of both cross entropy loss and\ncomplement entropy loss, $\\mathcal{G}^2Pxy$ achieves superior effectiveness for\nunknown class detection and known class classification, which is validated by\nexperiments on benchmark graph datasets. Moreover, $\\mathcal{G}^2Pxy$ does not\nhave specific requirement on the GNN architecture and shows good\ngeneralizations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:42:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhang","Qin",""],["Shi","Zelin",""],["Zhang","Xiaolin",""],["Chen","Xiaojun",""],["Fournier-Viger","Philippe",""],["Pan","Shirui",""]]}
{"id":"2308.05464","submitter":"Chenwei Wang","authors":"Chenwei Wang, Yulin Huang, Xiaoyu Liu, Jifang Pei, Yin Zhang, Jianyu\n  Yang","title":"Global in Local: A Convolutional Transformer for SAR ATR FSL","comments":null,"journal-ref":null,"doi":"10.1109/LGRS.2022.3183467","report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convolutional neural networks (CNNs) have dominated the synthetic aperture\nradar (SAR) automatic target recognition (ATR) for years. However, under the\nlimited SAR images, the width and depth of the CNN-based models are limited,\nand the widening of the received field for global features in images is\nhindered, which finally leads to the low performance of recognition. To address\nthese challenges, we propose a Convolutional Transformer (ConvT) for SAR ATR\nfew-shot learning (FSL). The proposed method focuses on constructing a\nhierarchical feature representation and capturing global dependencies of local\nfeatures in each layer, named global in local. A novel hybrid loss is proposed\nto interpret the few SAR images in the forms of recognition labels and\ncontrastive image pairs, construct abundant anchor-positive and anchor-negative\nimage pairs in one batch and provide sufficient loss for the optimization of\nthe ConvT to overcome the few sample effect. An auto augmentation is proposed\nto enhance and enrich the diversity and amount of the few training samples to\nexplore the hidden feature in a few SAR images and avoid the over-fitting in\nSAR ATR FSL. Experiments conducted on the Moving and Stationary Target\nAcquisition and Recognition dataset (MSTAR) have shown the effectiveness of our\nproposed ConvT for SAR ATR FSL. Different from existing SAR ATR FSL methods\nemploying additional training datasets, our method achieved pioneering\nperformance without other SAR target images in training.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:42:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Chenwei",""],["Huang","Yulin",""],["Liu","Xiaoyu",""],["Pei","Jifang",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.05465","submitter":"Verdi Vanreusel","authors":"Verdi Vanreusel, Alessia Gasparini, Federica Galante, Giulia Mariani,\n  Matteo Pacitti, Arnaud Colijn, Brigitte Reniers, Burak Yalvac, Dirk\n  Vandenbroucke, Marc Peeters, Paul Leblans, Giuseppe Felici, Dirk Verellen and\n  Luana de Freitas Nascimento","title":"Optically stimulated luminescence system as an alternative for\n  radiochromic film for 2D reference dosimetry in UHDR electron beams","comments":"Submitted to Physica Medica","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Radiotherapy is part of the treatment of over 50% of cancer patients. Its\nefficacy is limited by the radiotoxicity to the healthy tissue. FLASH-RT is\nbased on the biological effect that ultra-high dose rates (UHDR) and very short\ntreatment times strongly reduce normal tissue toxicity, while preserving the\nanti-tumoral effect. Despite many positive preclinical results, the translation\nof FLASH-RT to the clinic is hampered by the lack of accurate dosimetry for\nUHDR beams. To date radiochromic film is commonly used for dose assessment but\nhas the drawback of lengthy and cumbersome read out procedures. In this work,\nwe investigate the equivalence of a 2D OSL system to radiochromic film\ndosimetry in terms of dose rate independency. The comparison of both systems\nwas done using the ElectronFlash linac. We investigated the dose rate\ndependence by variation of the 1) modality, 2) pulse repetition frequency, 3)\npulse length and 4) source to surface distance. Additionally, we compared the\n2D characteristics by field size measurements. The OSL calibration showed\ntransferable between conventional and UHDR modality. Both systems are equally\nindependent of average dose rate, pulse length and instantaneous dose rate. The\nOSL system showed equivalent in field size determination within 3 sigma. We\nshow the promising nature of the 2D OSL system to serve as alternative for\nradiochromic film in UHDR electron beams. However, more in depth\ncharacterization is needed to assess its full potential.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:42:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Vanreusel","Verdi",""],["Gasparini","Alessia",""],["Galante","Federica",""],["Mariani","Giulia",""],["Pacitti","Matteo",""],["Colijn","Arnaud",""],["Reniers","Brigitte",""],["Yalvac","Burak",""],["Vandenbroucke","Dirk",""],["Peeters","Marc",""],["Leblans","Paul",""],["Felici","Giuseppe",""],["Verellen","Dirk",""],["Nascimento","Luana de Freitas",""]]}
{"id":"2308.05466","submitter":"Xu Chang","authors":"Qi Meng, Emiko Hiyama, Makoto Oka, Atsushi Hosaka, and Chang Xu","title":"Doubly heavy tetraquarks including one-pion exchange potential","comments":"7 pages, 10 figures, submitted to Physics Letters B","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectrum of the doubly heavy tetraquarks is studied in a constituent quark\nmodel including one-pion exchange (OPE) potential. Central and tensor forces\ninduced by OPE between two light quarks are considered. Our results show that\n$I(J^P)=0(1^+)$ compact bound states are shifted up because of the repulsive\ncentral force between $\\bar{q}\\bar{q}$. This effect possibly leads to the small\nbinding energy in $T_{cc}$. In addition, a $I(J^P)=1(1^+)$ resonant state is\nreported with $ E=10641 \\ \\rm{MeV},\\Gamma=15 \\ \\rm{MeV}$ and $ E=10640 \\\n\\rm{MeV},\\Gamma=15 \\ \\rm{MeV}$, without and with including OPE potential,\nrespectively. The repulsive central force and attractive tensor force almost\ncancel with each other and leave a small energy difference when OPE potential\nis included.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:43:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Meng","Qi",""],["Hiyama","Emiko",""],["Oka","Makoto",""],["Hosaka","Atsushi",""],["Xu","Chang",""]]}
{"id":"2308.05467","submitter":"Yuqi Deng","authors":"Yuqi Deng, Riku Kurimaru, Toshiki Matsusaka","title":"Arithmetic Dijkgraaf-Witten invariants for real quadratic fields,\n  quadratic residue graphs, and density formulas","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 compute Hirano's formula for the mod 2 arithmetic Dijkgraaf-Witten\ninvariant ${Z}_k$ for the ring of integers of the quadratic field\n$k=\\mathbb{Q}(\\sqrt{p_1\\cdots p_r})$, where ${p_i}$'s are distinct prime\nnumbers with $p_i \\equiv 1 \\pmod{4}$, and give a simple formula for $Z_k$ in\nterms of the graph obtained from quadratic residues among $p_1,\\cdots, p_r$.\nOur result answers the question posed by Ken Ono. We also give a density\nformula for mod 2 arithmetic Dijkgraaf-Witten invariants.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:45:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Deng","Yuqi",""],["Kurimaru","Riku",""],["Matsusaka","Toshiki",""]]}
{"id":"2308.05468","submitter":"Sudipta Dutta","authors":"Koushik R. Das and Sudipta Dutta","title":"Asymmetric Electronic Transport in Porphine: Role of Atomically Precise\n  Tip-Electrode","comments":"29 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electronic conductance through a single molecule is sensitive towards its\nstructural orientation between two electrodes, owing to the distribution of\nmolecular orbitals and their coupling to the electrode levels, that are\ngoverned by quantum confinement effects. Here, we vary the contact geometry of\nthe porphine molecule by attaching two Au tip electrodes that resemble the\nmechanical break junction, via thiol anchoring groups. We investigate the\ncurrent-voltage characteristics of all the contact geometries using\nnon-equilibrium Green's function formalism along with density functional theory\nand tight-binding framework. We observe varying current responses with changing\ncontact sites, originating from varied wave-function delocalization and quantum\ninterference effect. Our calculations show asymmetric current-voltage\ncharacteristics under forward and reverse biases due to structural asymmetry of\nthe tip electrodes in either sides of the molecule. We establish this\nphenomenon as a universal feature for any molecular electronic device,\nirrespective of the inherent structural symmetry of a molecule. This will\nprovide fundamental insights of electronic transport through single molecule in\nreal experimental setup. Furthermore, our observations of varying current\nresponse can further motivate the fabrication of sensor devices with porphine\nbased biomolecules that control important physiological activities, in view of\ntheir applications in advanced diagnostics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:48:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Das","Koushik R.",""],["Dutta","Sudipta",""]]}
{"id":"2308.05469","submitter":"Leonardo Figueroa","authors":"Leonardo E. Figueroa","title":"Weighted Sobolev orthogonal polynomials and approximation in the ball","comments":"24 pages","journal-ref":null,"doi":null,"report-no":"DIM 2023-08, CI^2MA 2023-18","categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish simultaneous approximation properties of weighted first-order\nSobolev orthogonal projectors onto spaces of polynomials of bounded total\ndegree in the Euclidean unit ball. The simultaneity is in the sense that we\nprovide bounds for the projection error in both a weighted $\\mathrm{L}^2$ norm\nand a weighted $\\mathrm{H}^1$ seminorm, both involving the same weight of the\ngeneralized Gegenbauer type $x \\mapsto (1-\\lVert x \\rVert^2)^\\alpha$, $\\alpha >\n-1$. The Sobolev orthogonal projectors producing the approximations are with\nrespect to an alternative yet equivalent inner product for the corresponding\nuniformly weighted $\\mathrm{H}^1$ space. In order to obtain our approximation\nbounds, we study the orthogonal polynomial structure of this alternative\nSobolev inner product obtaining, among other results, a characterization of its\northogonal polynomials as solutions of certain Sturm-Liouville problems. We do\nnot rely on any particular basis of orthogonal polynomials, which allows for a\nstreamlined and dimension-independent exposition.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:49:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Figueroa","Leonardo E.",""]]}
{"id":"2308.05470","submitter":"Arindam Dutta","authors":"Arindam Dutta and Anirban Pathak","title":"Collective attack free controlled quantum key agreement without quantum\n  memory","comments":"Protocols for quantum key agreement designed and analyzed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Here we present a new protocol for controlled quantum key agreement and\nanother protocol for key agreement with a specific focus on the security\nanalysis. Specifically, detailed security proof is provided against\nimpersonated fraudulent attack and collective attacks and it is established\nthat the proposed protocols are not only secure, but they also satisfy other\ndesired properties of such schemes (i.e., fairness and correctness). Further,\nthe proposed schemes are critically compared with a set of schemes for quantum\nkey agreement and an existing scheme for controlled quantum key agreement (Tang\net al.'s protocol) in terms of efficiency and the required quantum resources.\nEspecially, it is observed that in contrast to the existing schemes, the\npresent scheme does not require quantum memory. In addition, the protocol for\ncontrolled quantum key agreement proposed here is found to require quantum\nresources (Bell state and single photon state) that are easier to produce and\nmaintain compared to the quantum resources (GHZ states) required by the only\nknown existing protocol for the same purpose, i.e., Tang et al.'s protocol.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:51:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dutta","Arindam",""],["Pathak","Anirban",""]]}
{"id":"2308.05471","submitter":"Yuan Cheng","authors":"Yuan Cheng, Jing Yang, Yingbin Liang","title":"Provably Efficient Algorithm for Nonstationary Low-Rank MDPs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reinforcement learning (RL) under changing environment models many real-world\napplications via nonstationary Markov Decision Processes (MDPs), and hence\ngains considerable interest. However, theoretical studies on nonstationary MDPs\nin the literature have mainly focused on tabular and linear (mixture) MDPs,\nwhich do not capture the nature of unknown representation in deep RL. In this\npaper, we make the first effort to investigate nonstationary RL under episodic\nlow-rank MDPs, where both transition kernels and rewards may vary over time,\nand the low-rank model contains unknown representation in addition to the\nlinear state embedding function. We first propose a parameter-dependent policy\noptimization algorithm called PORTAL, and further improve PORTAL to its\nparameter-free version of Ada-PORTAL, which is able to tune its\nhyper-parameters adaptively without any prior knowledge of nonstationarity. For\nboth algorithms, we provide upper bounds on the average dynamic suboptimality\ngap, which show that as long as the nonstationarity is not significantly large,\nPORTAL and Ada-PORTAL are sample-efficient and can achieve arbitrarily small\naverage dynamic suboptimality gap with polynomial sample complexity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:52:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cheng","Yuan",""],["Yang","Jing",""],["Liang","Yingbin",""]]}
{"id":"2308.05472","submitter":"Mengfan Zheng","authors":"Mengfan Zheng and Cong Ling","title":"PAC Codes for Source and Joint Source-Channel Coding","comments":"6 pages, 6 figures. Submitted to GC 2023 Workshop - Channel Coding\n  Beyond 5G","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Polarization-adjusted convolutional (PAC) codes, as a concatenated coding\nscheme based on polar codes, is able to approach the finite-length bound of\nbinary-input AWGN channel at short blocklengths. In this paper, we extend PAC\ncodes to the fields of source coding and joint source-channel coding and show\nthat they can also approach the corresponding finite-length bounds at short\nblocklengths.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:55:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zheng","Mengfan",""],["Ling","Cong",""]]}
{"id":"2308.05473","submitter":"Vlatko Vedral","authors":"Vlatko Vedral","title":"Quantum mechanics with real numbers: entanglement, superselection rules\n  and gauges","comments":"7 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show how imaginary numbers in quantum physics can be eliminated by\nenlarging the Hilbert Space followed by an imposition of - what effectively\namounts to - a superselection rule. We illustrate this procedure with a qubit\nand apply it to the Mach-Zehnder interferometer. The procedure is somewhat\nreminiscent of the constrained quantization of the electromagnetic field,\nwhere, in order to manifestly comply with relativity, one enlargers the Hilbert\nSpace by quantizing the longitudinal and scalar modes, only to subsequently\nintroduce a constraint to make sure that they are actually not directly\nobservable.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:58:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Vedral","Vlatko",""]]}
{"id":"2308.05474","submitter":"Simon Dahan","authors":"Simon Dahan, Mariana da Silva, Daniel Rueckert, Emma C Robinson","title":"Surface Masked AutoEncoder: Self-Supervision for Cortical Imaging Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Self-supervision has been widely explored as a means of addressing the lack\nof inductive biases in vision transformer architectures, which limits\ngeneralisation when networks are trained on small datasets. This is crucial in\nthe context of cortical imaging, where phenotypes are complex and\nheterogeneous, but the available datasets are limited in size. This paper\nbuilds upon recent advancements in translating vision transformers to surface\nmeshes and investigates the potential of Masked AutoEncoder (MAE)\nself-supervision for cortical surface learning. By reconstructing surface data\nfrom a masked version of the input, the proposed method effectively models\ncortical structure to learn strong representations that translate to improved\nperformance in downstream tasks. We evaluate our approach on cortical phenotype\nregression using the developing Human Connectome Project (dHCP) and demonstrate\nthat pre-training leads to a 26\\% improvement in performance, with an 80\\%\nfaster convergence, compared to models trained from scratch. Furthermore, we\nestablish that pre-training vision transformer models on large datasets, such\nas the UK Biobank (UKB), enables the acquisition of robust representations for\nfinetuning in low-data scenarios. Our code and pre-trained models are publicly\navailable at \\url{https://github.com/metrics-lab/surface-vision-transformers}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:01:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dahan","Simon",""],["da Silva","Mariana",""],["Rueckert","Daniel",""],["Robinson","Emma C",""]]}
{"id":"2308.05475","submitter":"Tim Huege","authors":"Tim Huege and Maximilian Reininghaus (for the CORSIKA 8 Collaboration)","title":"The particle-shower simulation code CORSIKA 8","comments":"Proceedings of the 38th International Cosmic Ray Conference (ICRC) in\n  Nagoya, Japan","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":"  CORSIKA up to version 7 has been the most-used Monte Carlo code for\nsimulating extensive air showers for more than 20 years. Due to its monolithic,\nFortran-based software design and hand-optimized code, however, it has become\ndifficult to maintain, adapt to new computing paradigms and extend for more\ncomplex simulation needs. These limitations led to the CORSIKA 8 project, which\nconstitutes a complete rewrite of the CORSIKA 7 core functionality in a modern,\nmodular C++ framework. CORSIKA 8 has now reached a state that we consider\n\"physics-complete\" and a stability that already allows experts to engage in\ndevelopment for specific applications. It already supports the treatment of\nhadronic interactions with Sibyll 2.3d, QGSJet-II.04, EPOS-LHC and Pythia 8.3\nand the treatment of the electromagnetic cascade with PROPOSAL 7.6.2.\nParticular highlights are the support for multiple interaction media, including\ncross-media particle showers, and an advanced calculation of the radio emission\nfrom particle showers. In this contribution, we discuss the design principles\nof CORSIKA 8, give an overview of the functionality implemented to date, the\nvalidation of its simulation results, and the plans for its further\ndevelopment.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:02:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Huege","Tim","","for the CORSIKA 8 Collaboration"],["Reininghaus","Maximilian","","for the CORSIKA 8 Collaboration"]]}
{"id":"2308.05476","submitter":"Anusuya Krishnan Baby","authors":"Anusuya Krishnan","title":"Exploring Machine Learning and Transformer-based Approaches for\n  Deceptive Text Classification: A Comparative Analysis","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deceptive text classification is a critical task in natural language\nprocessing that aims to identify deceptive o fraudulent content. This study\npresents a comparative analysis of machine learning and transformer-based\napproaches for deceptive text classification. We investigate the effectiveness\nof traditional machine learning algorithms and state-of-the-art transformer\nmodels, such as BERT, XLNET, DistilBERT, and RoBERTa, in detecting deceptive\ntext. A labeled dataset consisting of deceptive and non-deceptive texts is used\nfor training and evaluation purposes. Through extensive experimentation, we\ncompare the performance metrics, including accuracy, precision, recall, and F1\nscore, of the different approaches. The results of this study shed light on the\nstrengths and limitations of machine learning and transformer-based methods for\ndeceptive text classification, enabling researchers and practitioners to make\ninformed decisions when dealing with deceptive content.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:07:00 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 02:50:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Krishnan","Anusuya",""]]}
{"id":"2308.05477","submitter":"Daniel Max Hoffmann","authors":"Alessandro Codenotti and Daniel Max Hoffmann","title":"Ranks in Ellis semigroups and model theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We slightly generalize a notion of rank introduced by Glasner and\nMegrelishvili, which captures the oscillations of elements of Ellis semigroups,\nso that it can be applied to any compact Hausdorff space instead of being\nlimited to the metric case. Then, we relate this rank to classical dividing\nlines in the model-theoretic stability hierarchy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:08:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Codenotti","Alessandro",""],["Hoffmann","Daniel Max",""]]}
{"id":"2308.05478","submitter":"Martin Krueger","authors":"Patrick Palmer and Martin Krueger and Richard Altendorfer and Ganesh\n  Adam and Torsten Bertram","title":"Reviewing 3D Object Detectors in the Context of High-Resolution 3+1D\n  Radar","comments":"Published at CVPR 2023 Workshop on 3D Vision and Robotics\n  (https://drive.google.com/file/d/1xj4R5ucH3PaR7QdRDJbbkjS-3iBUsruR/view)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent developments and the beginning market introduction of high-resolution\nimaging 4D (3+1D) radar sensors have initialized deep learning-based radar\nperception research. We investigate deep learning-based models operating on\nradar point clouds for 3D object detection. 3D object detection on lidar point\ncloud data is a mature area of 3D vision. Many different architectures have\nbeen proposed, each with strengths and weaknesses. Due to similarities between\n3D lidar point clouds and 3+1D radar point clouds, those existing 3D object\ndetectors are a natural basis to start deep learning-based 3D object detection\non radar data. Thus, the first step is to analyze the detection performance of\nthe existing models on the new data modality and evaluate them in depth. In\norder to apply existing 3D point cloud object detectors developed for lidar\npoint clouds to the radar domain, they need to be adapted first. While some\ndetectors, such as PointPillars, have already been adapted to be applicable to\nradar data, we have adapted others, e.g., Voxel R-CNN, SECOND, PointRCNN, and\nPV-RCNN. To this end, we conduct a cross-model validation (evaluating a set of\nmodels on one particular data set) as well as a cross-data set validation\n(evaluating all models in the model set on several data sets). The\nhigh-resolution radar data used are the View-of-Delft and Astyx data sets.\nFinally, we evaluate several adaptations of the models and their training\nprocedures. We also discuss major factors influencing the detection performance\non radar data and propose possible solutions indicating potential future\nresearch avenues.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:10:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Palmer","Patrick",""],["Krueger","Martin",""],["Altendorfer","Richard",""],["Adam","Ganesh",""],["Bertram","Torsten",""]]}
{"id":"2308.05479","submitter":"Sihui Zhong","authors":"Sihui Zhong, Valery M. Nakariakov, Yuhu Miao, Libo Fu, Ding Yuan","title":"30-min Decayless Kink Oscillations in a Very Long Bundle of Solar\n  Coronal Plasma Loops","comments":"15 pages, 5 figures, accepted by Scientific Reports","journal-ref":null,"doi":"10.1038/s41598-023-40063-2","report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The energy balance in the corona of the Sun is the key to the long-standing\ncoronal heating dilemma, which could be potentially revealed by observational\nstudies of decayless kink oscillations of coronal plasma loops. A bundle of\nvery long off-limb coronal loops with the length of $736\\pm80$ Mm and a\nlifetime of about 2 days are found to exhibit decayless kink oscillations. The\noscillations were observed for several hours. The oscillation amplitude was\nmeasured at 0.3-0.5 Mm, and the period at 28-33 min. The existence of 30-min\nperiodicity of decayless kink oscillations indicates that the mechanism\ncompensating the wave damping is still valid in such a massive plasma\nstructure. It provides important evidence for the non-resonant origin of\ndecayless kink oscillations with 2-6min periods, i.e., the lack of their link\nwith the leakage of photospheric and chromospheric oscillations into the corona\nand the likely role of the broadband energy sources. Magnetohydrodynamic\nseismology based on the reported detection of the kink oscillation, with the\nassistance of the differential emission measure analysis and a background\ncoronal model provides us with a comprehensive set of plasma and magnetic field\ndiagnostics, which is of interest as input parameters of space weather models.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:10:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhong","Sihui",""],["Nakariakov","Valery M.",""],["Miao","Yuhu",""],["Fu","Libo",""],["Yuan","Ding",""]]}
{"id":"2308.05480","submitter":"Yuming Chen","authors":"Yuming Chen, Xinbin Yuan, Ruiqi Wu, Jiabao Wang, Qibin Hou, Ming-Ming\n  Cheng","title":"YOLO-MS: Rethinking Multi-Scale Representation Learning for Real-time\n  Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We aim at providing the object detection community with an efficient and\nperformant object detector, termed YOLO-MS. The core design is based on a\nseries of investigations on how convolutions with different kernel sizes affect\nthe detection performance of objects at different scales. The outcome is a new\nstrategy that can strongly enhance multi-scale feature representations of\nreal-time object detectors. To verify the effectiveness of our strategy, we\nbuild a network architecture, termed YOLO-MS. We train our YOLO-MS on the MS\nCOCO dataset from scratch without relying on any other large-scale datasets,\nlike ImageNet, or pre-trained weights. Without bells and whistles, our YOLO-MS\noutperforms the recent state-of-the-art real-time object detectors, including\nYOLO-v7 and RTMDet, when using a comparable number of parameters and FLOPs.\nTaking the XS version of YOLO-MS as an example, with only 4.5M learnable\nparameters and 8.7G FLOPs, it can achieve an AP score of 43%+ on MS COCO, which\nis about 2%+ higher than RTMDet with the same model size. Moreover, our work\ncan also be used as a plug-and-play module for other YOLO models. Typically,\nour method significantly improves the AP of YOLOv8 from 37%+ to 40%+ with even\nfewer parameters and FLOPs. Code is available at\nhttps://github.com/FishAndWasabi/YOLO-MS.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:12:27 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Yuming",""],["Yuan","Xinbin",""],["Wu","Ruiqi",""],["Wang","Jiabao",""],["Hou","Qibin",""],["Cheng","Ming-Ming",""]]}
{"id":"2308.05481","submitter":"Xuanhe Zhou","authors":"Xuanhe Zhou, Guoliang Li, Zhiyuan Liu","title":"LLM As DBA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Database administrators (DBAs) play a crucial role in managing, maintaining\nand optimizing a database system to ensure data availability, performance, and\nreliability. However, it is hard and tedious for DBAs to manage a large number\nof database instances (e.g., millions of instances on the cloud databases).\nRecently large language models (LLMs) have shown great potential to understand\nvaluable documents and accordingly generate reasonable answers. Thus, we\npropose D-Bot, a LLM-based database administrator that can continuously acquire\ndatabase maintenance experience from textual sources, and provide reasonable,\nwell-founded, in-time diagnosis and optimization advice for target databases.\nThis paper presents a revolutionary LLM-centric framework for database\nmaintenance, including (i) database maintenance knowledge detection from\ndocuments and tools, (ii) tree of thought reasoning for root cause analysis,\nand (iii) collaborative diagnosis among multiple LLMs. Our preliminary\nexperimental results that D-Bot can efficiently and effectively diagnose the\nroot causes and our code is available at\ngithub.com/TsinghuaDatabaseGroup/DB-GPT.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:12:43 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 07:55:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhou","Xuanhe",""],["Li","Guoliang",""],["Liu","Zhiyuan",""]]}
{"id":"2308.05482","submitter":"Vojtech Kostal","authors":"Vojtech Kostal, Pavel Jungwirth, Hector Martinez-Seara","title":"Non-Aqueous Ion Pairing Exemplifies the Case for Including Electronic\n  Polarization in Molecular Dynamics Simulations","comments":"main text: 7 pages, 4 figures; supporting information: 6 pages, 5\n  figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inclusion of electronic polarization is of crucial importance in\nmolecular simulations of systems containing charged moieties. When neglected,\nas often done in force field simulations, charge-charge interactions in\nsolution may become severely overestimated leading to unrealistically strong\nbindings of ions to biomolecules. The electronic continuum correction\nintroduces electronic polarization in a mean-field way via scaling of charges\nby the reciprocal of the square root of the high-frequency dielectric constant\nof the solvent environment. Here, we use ab initio molecular dynamics\nsimulations to quantify the effect of electronic polarization on pairs of\nlike-charged ions in a model non-aqueous environment where electronic\npolarization is the only dielectric response. Our findings confirm the\nconceptual validity of the present approach, underlining its applicability to\ncomplex aqueous biomolecular systems. Simultaneously, the present results\njustify the potential employment of weaker charge scaling factors in force\nfield development.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:18:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kostal","Vojtech",""],["Jungwirth","Pavel",""],["Martinez-Seara","Hector",""]]}
{"id":"2308.05483","submitter":"Johann Huber","authors":"J. Huber, F. H\\'el\\'enon, M. Coninx, F. Ben Amar, S. Doncieux","title":"Quality Diversity under Sparse Reward and Sparse Interaction:\n  Application to Grasping in Robotics","comments":"37 pages, 17 figures. Draft version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quality-Diversity (QD) methods are algorithms that aim to generate a set of\ndiverse and high-performing solutions to a given problem. Originally developed\nfor evolutionary robotics, most QD studies are conducted on a limited set of\ndomains - mainly applied to locomotion, where the fitness and the behavior\nsignal are dense. Grasping is a crucial task for manipulation in robotics.\nDespite the efforts of many research communities, this task is yet to be\nsolved. Grasping cumulates unprecedented challenges in QD literature: it\nsuffers from reward sparsity, behavioral sparsity, and behavior space\nmisalignment. The present work studies how QD can address grasping. Experiments\nhave been conducted on 15 different methods on 10 grasping domains,\ncorresponding to 2 different robot-gripper setups and 5 standard objects. An\nevaluation framework that distinguishes the evaluation of an algorithm from its\ninternal components has also been proposed for a fair comparison. The obtained\nresults show that MAP-Elites variants that select successful solutions in\npriority outperform all the compared methods on the studied metrics by a large\nmargin. We also found experimental evidence that sparse interaction can lead to\ndeceptive novelty. To our knowledge, the ability to efficiently produce\nexamples of grasping trajectories demonstrated in this work has no precedent in\nthe literature.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:19:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Huber","J.",""],["H\u00e9l\u00e9non","F.",""],["Coninx","M.",""],["Amar","F. Ben",""],["Doncieux","S.",""]]}
{"id":"2308.05484","submitter":"Eviatar Bach","authors":"Eviatar Bach, Tim Colonius, Andrew Stuart","title":"Filtering Dynamical Systems Using Observations of Statistics","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.OC nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of filtering dynamical systems, possibly stochastic,\nusing observations of statistics. Thus the computational task is to estimate a\ntime-evolving density $\\rho(v, t)$ given noisy observations of $\\rho$; this\ncontrasts with the standard filtering problem based on observations of the\nstate $v$. The task is naturally formulated as an infinite-dimensional\nfiltering problem in the space of densities $\\rho$. However, for the purposes\nof tractability, we seek algorithms in state space; specifically we introduce a\nmean field state space model and, using interacting particle system\napproximations to this model, we propose an ensemble method. We refer to the\nresulting methodology as the ensemble Fokker-Planck filter (EnFPF).\n  Under certain restrictive assumptions we show that the EnFPF approximates the\nKalman-Bucy filter for the Fokker-Planck equation, which is the exact solution\nof the infinite-dimensional filtering problem; our numerical experiments show\nthat the methodology is useful beyond this restrictive setting. Specifically\nthe experiments show that the EnFPF is able to correct ensemble statistics, to\naccelerate convergence to the invariant density for autonomous systems, and to\naccelerate convergence to time-dependent invariant densities for non-autonomous\nsystems. We discuss possible applications of the EnFPF to climate ensembles and\nto turbulence modelling.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:21:01 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bach","Eviatar",""],["Colonius","Tim",""],["Stuart","Andrew",""]]}
{"id":"2308.05485","submitter":"Benedikt Ahrens","authors":"Ralph Matthes and Kobe Wullaert and Benedikt Ahrens","title":"Substitution for Non-Wellfounded Syntax with Binders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe a generic construction of non-wellfounded syntax involving\nvariable binding and its monadic substitution operation. Our construction of\nthe syntax and its substitution takes place in category theory, notably by\nusing monoidal categories and strong functors between them. A language is\nspecified by a multi-sorted binding signature, say {\\Sigma}. First, we provide\nsufficient criteria for {\\Sigma} to generate a language of possibly infinite\nterms, through {\\omega}-continuity. Second, we construct a monadic substitution\noperation for the language generated by {\\Sigma}. A cornerstone in this\nconstruction is a mild generalization of the notion of heterogeneous\nsubstitution systems developed by Matthes and Uustalu; such a system\nencapsulates the necessary corecursion scheme for implementing substitution.\nThe results are formalized in the Coq proof assistant, through the UniMath\nlibrary of univalent mathematics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:25:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Matthes","Ralph",""],["Wullaert","Kobe",""],["Ahrens","Benedikt",""]]}
{"id":"2308.05486","submitter":"Matteo Iacopini","authors":"Matteo Iacopini and Aubrey Poon and Luca Rossini and Dan Zhu","title":"The Distributional Impact of Money Growth and Inflation Disaggregates: A\n  Quantile Sensitivity Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose an alternative method to construct a quantile dependence system\nfor inflation and money growth. By considering all quantiles, we assess how\nperturbations in one variable's quantile lead to changes in the distribution of\nthe other variable. We demonstrate the construction of this relationship\nthrough a system of linear quantile regressions. The proposed framework is\nexploited to examine the distributional effects of money growth on the\ndistributions of inflation and its disaggregate measures in the United States\nand the Euro area. Our empirical analysis uncovers significant impacts of the\nupper quantile of the money growth distribution on the distribution of\ninflation and its disaggregate measures. Conversely, we find that the lower and\nmedian quantiles of the money growth distribution have a negligible influence\non the distribution of inflation and its disaggregate measures.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:26:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Iacopini","Matteo",""],["Poon","Aubrey",""],["Rossini","Luca",""],["Zhu","Dan",""]]}
{"id":"2308.05487","submitter":"Sungmin Kang","authors":"Sungmin Kang, Gabin An, Shin Yoo","title":"A Preliminary Evaluation of LLM-Based Fault Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have shown a surprising level of performance on\nmultiple software engineering problems. However, they have not yet been applied\nto Fault Localization (FL), in which one must find the code element responsible\nfor a bug from a potentially vast codebase. Nonetheless, LLM application to FL\nhas the potential to benefit developers both in terms of performance and\nexplainability. In this work, we present AutoFL, an automated fault\nlocalization technique that only requires a single failing test, and in its\nfault localization process generates an explanation about why the given test\nfails. Using the function call API of the OpenAI LLM, ChatGPT, we provide tools\nthat allow it to explore a large source code repository, which would otherwise\npose a significant challenge as it would be impossible to fit all the source\ncode within the limited prompt length. Our results indicate that, on the widely\nused Defects4J benchmark, AutoFL can identify the faulty method on the first\ntry more often than all standalone techniques we compared against from prior\nwork. Nonetheless, there is ample room to improve performance, and we encourage\nfurther experimentation of language model-based FL as a promising research\narea.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:26:55 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 05:00:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kang","Sungmin",""],["An","Gabin",""],["Yoo","Shin",""]]}
{"id":"2308.05488","submitter":"Andre Ran","authors":"A.E. Frazho, M.A. Kaashoek, A.C.M. Ran, F. van Schagen","title":"Wiener-Hopf indices of unimodular functions on the unit circle,\n  revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inspired by the paper of Groenewald, Kaashoek and Ran (Wiener-Hopf indices of\nunitary functions on the unit circle in terms of realizations and related\nresults on Toeplitz operators. \\emph{Indag. Math.} 28, (2017), 649-710), we\npresent an operator-theoretic approach to provide further insight and simpler\ncomputational formulas for the Wiener-Hopf indices of a rational matrix valued\nfunction taking unimodular values on the unit circle.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:28:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Frazho","A. E.",""],["Kaashoek","M. A.",""],["Ran","A. C. M.",""],["van Schagen","F.",""]]}
{"id":"2308.05489","submitter":"Chenwei Wang","authors":"Chenwei Wang, Jifang Pei, Xiaoyu Liu, Yulin Huang, Deqing Mao, Yin\n  Zhang, Jianyu Yang","title":"SAR Target Image Generation Method Using Azimuth-Controllable Generative\n  Adversarial Network","comments":null,"journal-ref":null,"doi":"10.1109/JSTARS.2022.3218369","report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sufficient synthetic aperture radar (SAR) target images are very important\nfor the development of researches. However, available SAR target images are\noften limited in practice, which hinders the progress of SAR application. In\nthis paper, we propose an azimuth-controllable generative adversarial network\nto generate precise SAR target images with an intermediate azimuth between two\ngiven SAR images' azimuths. This network mainly contains three parts:\ngenerator, discriminator, and predictor. Through the proposed specific network\nstructure, the generator can extract and fuse the optimal target features from\ntwo input SAR target images to generate SAR target image. Then a similarity\ndiscriminator and an azimuth predictor are designed. The similarity\ndiscriminator can differentiate the generated SAR target images from the real\nSAR images to ensure the accuracy of the generated, while the azimuth predictor\nmeasures the difference of azimuth between the generated and the desired to\nensure the azimuth controllability of the generated. Therefore, the proposed\nnetwork can generate precise SAR images, and their azimuths can be controlled\nwell by the inputs of the deep network, which can generate the target images in\ndifferent azimuths to solve the small sample problem to some degree and benefit\nthe researches of SAR images. Extensive experimental results show the\nsuperiority of the proposed method in azimuth controllability and accuracy of\nSAR target image generation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:34:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Chenwei",""],["Pei","Jifang",""],["Liu","Xiaoyu",""],["Huang","Yulin",""],["Mao","Deqing",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.05490","submitter":"Ming Gang Zhao","authors":"BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, R.\n  Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I. Balossino, Y.\n  Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Bertani, D. Bettoni, F.\n  Bianchi, E. Bianco, J. Bloms, A. Bortone, I. Boyko, R. A. Briere, A.\n  Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin,\n  J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C. Chen, Chao\n  Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen, X. R.\n  Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S. Cheng, S. K.\n  Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H. L. Dai, J.\n  P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I.\n  Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding,\n  J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, S. X. Du, Z. H. Duan, P. Egorov, Y.\n  L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y. Fang, R. Farinelli, L. Fava, F.\n  Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, K Fischer, M. Fritsch, C.\n  Fritzsch, C. D. Fu, Y. W. Fu, H. Gao, Y. N. Gao, Yang Gao, S. Garbolino, I.\n  Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A Gilman, K. Goetzen,\n  L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu, Y. T. Gu, C.\n  Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, R. P. Guo, Y. P. Guo, A. Guskov, X.\n  T. H., W. Y. Han, X. Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H.\n  Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, T. Holtmann, P. C. Hong, G. Y.\n  Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K.\n  X. Huang, L. Q. Huang, X. T. Huang, Y. P. Huang, T. Hussain, N H\\\"usken, W.\n  Imoehl, M. Irshad, J. Jackson, S. Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q.\n  P. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, Z. K. Jia, P. C. Jiang, S. S. Jiang, T.\n  J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q.\n  Jing, T. Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X.\n  S. Kang, R. Kappert, M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R.\n  Kliemt, L. Koch, O. B. Kolcu, B. Kopf, M. Kuessner, A. Kupsc, W. K\\\"uhn, J.\n  J. Lane, J. S. Lange, P. Larin, A. Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei,\n  H. Leithoff, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, Cheng Li, D. M.\n  Li, F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J.\n  S. Li, J. W. Li, Ke Li, L. J Li, L. K. Li, Lei Li, M. H. Li, P. R. Li, S. X.\n  Li, T. Li, W. D. Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J.\n  Li, Z. X. Li, Z. Y. Li, C. Liang, H. Liang, H. Liang, H. Liang, Y. F. Liang,\n  Y. T. Liang, G. R. Liao, L. Z. Liao, J. Libby, A. Limphirat, D. X. Lin, T.\n  Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, D. Liu, F. H. Liu, Fang Liu,\n  Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui Liu,\n  J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C.\n  Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W.\n  M. Liu, X. Liu, Y. Liu, Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu,\n  H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, M. X.\n  Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma, J. L. Ma,\n  L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma, F. E.\n  Maas, M. Maggiora, S. Maldaner, S. Malde, A. Mangoni, Y. J. Mao, Z. P. Mao,\n  S. Marcello, Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min,\n  R. E. Mitchell, X. H. Mo, N. Yu. Muchnoi, Y. Nefedov, F. Nerling, I. B.\n  Nikolaev, Z. Ning, S. Nisar, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X.\n  Pan, Y. Pan, A. Pathak, Y. P. Pei, M. Pelizaeus, H. P. Peng, K. Peters, J. L.\n  Ping, R. G. Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H. Qi, H. R. Qi,\n  M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q. Qin, X. P.\n  Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K. J. Ren, A.\n  Rivetti, V. Rodin, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N. Salone, A.\n  Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X.\n  Y. Shan, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H.\n  Shen, X. Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q. Q. Shi, R.\n  S. Shi, X. Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y. X. Song,\n  S. Sosio, S. Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H.\n  K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. Sun, Y.\n  J. Sun, Y. Z. Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J. Tang, Y.\n  A. Tang, L. Y Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H. Tian, W.\n  H. Tian, Y. Tian, Z. F. Tian, I. Uman, B. Wang, B. L. Wang, Bo Wang, C. W.\n  Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, K. Wang, L. L. Wang, M.\n  Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, W. Wang, W.\n  H. Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, Y. Wang, Y.\n  D. Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi\n  Wang, Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D. H. Wei, F.\n  Weidner, S. P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M. Wolke, L.\n  Wollenberg, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu, Y. Wu, Y. J\n  Wu, Z. Wu, L. Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, S. Y.\n  Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H.\n  Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu,\n  W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan,\n  X. Q Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao Yang, Y. Yang, Y. F. Yang,\n  Y. X. Yang, Yifan Yang, Z. W. Yang, M. Ye, M. H. Ye, J. H. Yin, Z. Y. You, B.\n  X. Yu, C. X. Yu, G. Yu, T. Yu, X. D. Yu, C. Z. Yuan, L. Yuan, S. C. Yuan, X.\n  Q. 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. H. Zhan, A. Q. Zhang, B. L. Zhang, B. X.\n  Zhang, D. H. Zhang, G. Y. Zhang, H. Zhang, H. H. Zhang, H. H. Zhang, H. Q.\n  Zhang, H. Y. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W. Zhang, J. X.\n  Zhang, J. Y. Zhang, J. Z. Zhang, Jiawei Zhang, L. M. Zhang, L. Q. Zhang, Lei\n  Zhang, P. Zhang, Q. Y. Zhang, Shuihan Zhang, Shulei Zhang, X. D. Zhang, X. M.\n  Zhang, X. Y. Zhang, X. Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. X.\n  Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z. Y. Zhang, Z. Y.\n  Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao, Ling Zhao, M. G.\n  Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B.\n  Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, L.\n  P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, J. Zhu, K.\n  Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu, T. J. Zhu, W. J.\n  Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Search for the lepton number violation decay $\\phi \\to \\pi^+ \\pi^+ e^-\n  e^-$ via $J/\\psi\\to \\phi\\eta$","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using $(1.0087\\pm0.0044)\\times10^{10}$ $J/\\psi$ events collected by the\nBESIII detector at the BEPCII collider, we search for the lepton number\nviolation decay $\\phi \\to \\pi^+ \\pi^+ e^- e^-$ via $J/\\psi\\to \\phi\\eta$. No\nsignal is found and the upper limit on the branching fraction of $\\phi \\to\n\\pi^+ \\pi^+ e^- e^-$ is set to be $9.7\\times10^{-6}$ at the 90\\% confidence\nlevel.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:36:38 GMT"}],"update_date":"2023-08-11","authors_parsed":[["BESIII Collaboration","",""],["Ablikim","M.",""],["Achasov","M. N.",""],["Adlarson","P.",""],["Aliberti","R.",""],["Amoroso","A.",""],["An","M. R.",""],["An","Q.",""],["Bai","Y.",""],["Bakina","O.",""],["Balossino","I.",""],["Ban","Y.",""],["Batozskaya","V.",""],["Begzsuren","K.",""],["Berger","N.",""],["Bertani","M.",""],["Bettoni","D.",""],["Bianchi","F.",""],["Bianco","E.",""],["Bloms","J.",""],["Bortone","A.",""],["Boyko","I.",""],["Briere","R. A.",""],["Brueggemann","A.",""],["Cai","H.",""],["Cai","X.",""],["Calcaterra","A.",""],["Cao","G. F.",""],["Cao","N.",""],["Cetin","S. A.",""],["Chang","J. F.",""],["Chang","T. T.",""],["Chang","W. L.",""],["Che","G. R.",""],["Chelkov","G.",""],["Chen","C.",""],["Chen","Chao",""],["Chen","G.",""],["Chen","H. S.",""],["Chen","M. L.",""],["Chen","S. J.",""],["Chen","S. M.",""],["Chen","T.",""],["Chen","X. R.",""],["Chen","X. T.",""],["Chen","Y. B.",""],["Chen","Y. Q.",""],["Chen","Z. J.",""],["Cheng","W. S.",""],["Choi","S. K.",""],["Chu","X.",""],["Cibinetto","G.",""],["Coen","S. C.",""],["Cossio","F.",""],["Cui","J. J.",""],["Dai","H. L.",""],["Dai","J. P.",""],["Dbeyssi","A.",""],["de Boer","R. E.",""],["Dedovich","D.",""],["Deng","Z. Y.",""],["Denig","A.",""],["Denysenko","I.",""],["Destefanis","M.",""],["De Mori","F.",""],["Ding","B.",""],["Ding","X. X.",""],["Ding","Y.",""],["Ding","Y.",""],["Dong","J.",""],["Dong","L. Y.",""],["Dong","M. Y.",""],["Dong","X.",""],["Du","S. X.",""],["Duan","Z. H.",""],["Egorov","P.",""],["Fan","Y. L.",""],["Fang","J.",""],["Fang","S. S.",""],["Fang","W. X.",""],["Fang","Y.",""],["Farinelli","R.",""],["Fava","L.",""],["Feldbauer","F.",""],["Felici","G.",""],["Feng","C. Q.",""],["Feng","J. H.",""],["Fischer","K",""],["Fritsch","M.",""],["Fritzsch","C.",""],["Fu","C. D.",""],["Fu","Y. W.",""],["Gao","H.",""],["Gao","Y. N.",""],["Gao","Yang",""],["Garbolino","S.",""],["Garzia","I.",""],["Ge","P. T.",""],["Ge","Z. W.",""],["Geng","C.",""],["Gersabeck","E. M.",""],["Gilman","A",""],["Goetzen","K.",""],["Gong","L.",""],["Gong","W. X.",""],["Gradl","W.",""],["Gramigna","S.",""],["Greco","M.",""],["Gu","M. H.",""],["Gu","Y. T.",""],["Guan","C. Y",""],["Guan","Z. L.",""],["Guo","A. Q.",""],["Guo","L. B.",""],["Guo","R. P.",""],["Guo","Y. P.",""],["Guskov","A.",""],["H.","X. T.",""],["Han","W. Y.",""],["Hao","X. Q.",""],["Harris","F. A.",""],["He","K. K.",""],["He","K. L.",""],["Heinsius","F. H.",""],["Heinz","C. H.",""],["Heng","Y. K.",""],["Herold","C.",""],["Holtmann","T.",""],["Hong","P. C.",""],["Hou","G. Y.",""],["Hou","Y. R.",""],["Hou","Z. L.",""],["Hu","H. M.",""],["Hu","J. F.",""],["Hu","T.",""],["Hu","Y.",""],["Huang","G. S.",""],["Huang","K. X.",""],["Huang","L. Q.",""],["Huang","X. T.",""],["Huang","Y. P.",""],["Hussain","T.",""],["H\u00fcsken","N",""],["Imoehl","W.",""],["Irshad","M.",""],["Jackson","J.",""],["Jaeger","S.",""],["Janchiv","S.",""],["Jeong","J. H.",""],["Ji","Q.",""],["Ji","Q. P.",""],["Ji","X. B.",""],["Ji","X. L.",""],["Ji","Y. Y.",""],["Jia","Z. K.",""],["Jiang","P. C.",""],["Jiang","S. S.",""],["Jiang","T. J.",""],["Jiang","X. S.",""],["Jiang","Y.",""],["Jiao","J. B.",""],["Jiao","Z.",""],["Jin","S.",""],["Jin","Y.",""],["Jing","M. Q.",""],["Johansson","T.",""],["K.","X.",""],["Kabana","S.",""],["Kalantar-Nayestanaki","N.",""],["Kang","X. L.",""],["Kang","X. S.",""],["Kappert","R.",""],["Kavatsyuk","M.",""],["Ke","B. C.",""],["Khoukaz","A.",""],["Kiuchi","R.",""],["Kliemt","R.",""],["Koch","L.",""],["Kolcu","O. B.",""],["Kopf","B.",""],["Kuessner","M.",""],["Kupsc","A.",""],["K\u00fchn","W.",""],["Lane","J. J.",""],["Lange","J. S.",""],["Larin","P.",""],["Lavania","A.",""],["Lavezzi","L.",""],["Lei","T. T.",""],["Lei","Z. H.",""],["Leithoff","H.",""],["Lellmann","M.",""],["Lenz","T.",""],["Li","C.",""],["Li","C.",""],["Li","C. H.",""],["Li","Cheng",""],["Li","D. M.",""],["Li","F.",""],["Li","G.",""],["Li","H.",""],["Li","H. B.",""],["Li","H. J.",""],["Li","H. N.",""],["Li","Hui",""],["Li","J. R.",""],["Li","J. S.",""],["Li","J. W.",""],["Li","Ke",""],["Li","L. J",""],["Li","L. K.",""],["Li","Lei",""],["Li","M. H.",""],["Li","P. R.",""],["Li","S. X.",""],["Li","T.",""],["Li","W. D.",""],["Li","W. G.",""],["Li","X. H.",""],["Li","X. L.",""],["Li","Xiaoyu",""],["Li","Y. G.",""],["Li","Z. J.",""],["Li","Z. X.",""],["Li","Z. Y.",""],["Liang","C.",""],["Liang","H.",""],["Liang","H.",""],["Liang","H.",""],["Liang","Y. F.",""],["Liang","Y. T.",""],["Liao","G. R.",""],["Liao","L. Z.",""],["Libby","J.",""],["Limphirat","A.",""],["Lin","D. X.",""],["Lin","T.",""],["Liu","B. J.",""],["Liu","B. X.",""],["Liu","C.",""],["Liu","C. X.",""],["Liu","D.",""],["Liu","F. H.",""],["Liu","Fang",""],["Liu","Feng",""],["Liu","G. M.",""],["Liu","H.",""],["Liu","H. B.",""],["Liu","H. M.",""],["Liu","Huanhuan",""],["Liu","Huihui",""],["Liu","J. B.",""],["Liu","J. L.",""],["Liu","J. Y.",""],["Liu","K.",""],["Liu","K. Y.",""],["Liu","Ke",""],["Liu","L.",""],["Liu","L. C.",""],["Liu","Lu",""],["Liu","M. H.",""],["Liu","P. L.",""],["Liu","Q.",""],["Liu","S. B.",""],["Liu","T.",""],["Liu","W. K.",""],["Liu","W. M.",""],["Liu","X.",""],["Liu","Y.",""],["Liu","Y. B.",""],["Liu","Z. A.",""],["Liu","Z. Q.",""],["Lou","X. C.",""],["Lu","F. X.",""],["Lu","H. J.",""],["Lu","J. G.",""],["Lu","X. L.",""],["Lu","Y.",""],["Lu","Y. P.",""],["Lu","Z. H.",""],["Luo","C. L.",""],["Luo","M. X.",""],["Luo","T.",""],["Luo","X. L.",""],["Lyu","X. R.",""],["Lyu","Y. F.",""],["Ma","F. C.",""],["Ma","H. L.",""],["Ma","J. L.",""],["Ma","L. L.",""],["Ma","M. M.",""],["Ma","Q. M.",""],["Ma","R. Q.",""],["Ma","R. T.",""],["Ma","X. Y.",""],["Ma","Y.",""],["Maas","F. E.",""],["Maggiora","M.",""],["Maldaner","S.",""],["Malde","S.",""],["Mangoni","A.",""],["Mao","Y. J.",""],["Mao","Z. P.",""],["Marcello","S.",""],["Meng","Z. X.",""],["Messchendorp","J. G.",""],["Mezzadri","G.",""],["Miao","H.",""],["Min","T. J.",""],["Mitchell","R. E.",""],["Mo","X. H.",""],["Muchnoi","N. Yu.",""],["Nefedov","Y.",""],["Nerling","F.",""],["Nikolaev","I. B.",""],["Ning","Z.",""],["Nisar","S.",""],["Niu","Y.",""],["Olsen","S. L.",""],["Ouyang","Q.",""],["Pacetti","S.",""],["Pan","X.",""],["Pan","Y.",""],["Pathak","A.",""],["Pei","Y. P.",""],["Pelizaeus","M.",""],["Peng","H. P.",""],["Peters","K.",""],["Ping","J. L.",""],["Ping","R. G.",""],["Plura","S.",""],["Pogodin","S.",""],["Prasad","V.",""],["Qi","F. Z.",""],["Qi","H.",""],["Qi","H. R.",""],["Qi","M.",""],["Qi","T. Y.",""],["Qian","S.",""],["Qian","W. B.",""],["Qiao","C. F.",""],["Qin","J. J.",""],["Qin","L. Q.",""],["Qin","X. P.",""],["Qin","X. S.",""],["Qin","Z. H.",""],["Qiu","J. F.",""],["Qu","S. Q.",""],["Redmer","C. F.",""],["Ren","K. J.",""],["Rivetti","A.",""],["Rodin","V.",""],["Rolo","M.",""],["Rong","G.",""],["Rosner","Ch.",""],["Ruan","S. N.",""],["Salone","N.",""],["Sarantsev","A.",""],["Schelhaas","Y.",""],["Schoenning","K.",""],["Scodeggio","M.",""],["Shan","K. Y.",""],["Shan","W.",""],["Shan","X. Y.",""],["Shangguan","J. F.",""],["Shao","L. G.",""],["Shao","M.",""],["Shen","C. P.",""],["Shen","H. F.",""],["Shen","W. H.",""],["Shen","X. Y.",""],["Shi","B. A.",""],["Shi","H. C.",""],["Shi","J. L.",""],["Shi","J. Y.",""],["Shi","Q. Q.",""],["Shi","R. S.",""],["Shi","X.",""],["Song","J. J.",""],["Song","T. Z.",""],["Song","W. M.",""],["Song","Y. J.",""],["Song","Y. X.",""],["Sosio","S.",""],["Spataro","S.",""],["Stieler","F.",""],["Su","Y. J.",""],["Sun","G. B.",""],["Sun","G. X.",""],["Sun","H.",""],["Sun","H. K.",""],["Sun","J. F.",""],["Sun","K.",""],["Sun","L.",""],["Sun","S. S.",""],["Sun","T.",""],["Sun","W. Y.",""],["Sun","Y.",""],["Sun","Y. J.",""],["Sun","Y. Z.",""],["Sun","Z. T.",""],["Tan","Y. X.",""],["Tang","C. J.",""],["Tang","G. Y.",""],["Tang","J.",""],["Tang","Y. A.",""],["Tao","L. Y",""],["Tao","Q. T.",""],["Tat","M.",""],["Teng","J. X.",""],["Thoren","V.",""],["Tian","W. H.",""],["Tian","W. H.",""],["Tian","Y.",""],["Tian","Z. F.",""],["Uman","I.",""],["Wang","B.",""],["Wang","B. L.",""],["Wang","Bo",""],["Wang","C. W.",""],["Wang","D. Y.",""],["Wang","F.",""],["Wang","H. J.",""],["Wang","H. P.",""],["Wang","K.",""],["Wang","L. L.",""],["Wang","M.",""],["Wang","Meng",""],["Wang","S.",""],["Wang","S.",""],["Wang","T.",""],["Wang","T. J.",""],["Wang","W.",""],["Wang","W.",""],["Wang","W. H.",""],["Wang","W. P.",""],["Wang","X.",""],["Wang","X. F.",""],["Wang","X. J.",""],["Wang","X. L.",""],["Wang","Y.",""],["Wang","Y. D.",""],["Wang","Y. F.",""],["Wang","Y. H.",""],["Wang","Y. N.",""],["Wang","Y. Q.",""],["Wang","Yaqian",""],["Wang","Yi",""],["Wang","Z.",""],["Wang","Z. L.",""],["Wang","Z. Y.",""],["Wang","Ziyi",""],["Wei","D.",""],["Wei","D. H.",""],["Weidner","F.",""],["Wen","S. P.",""],["Wenzel","C. W.",""],["Wiedner","U.",""],["Wilkinson","G.",""],["Wolke","M.",""],["Wollenberg","L.",""],["Wu","C.",""],["Wu","J. F.",""],["Wu","L. H.",""],["Wu","L. J.",""],["Wu","X.",""],["Wu","X. H.",""],["Wu","Y.",""],["Wu","Y. J",""],["Wu","Z.",""],["Xia","L.",""],["Xian","X. M.",""],["Xiang","T.",""],["Xiao","D.",""],["Xiao","G. Y.",""],["Xiao","H.",""],["Xiao","S. Y.",""],["Xiao","Y. L.",""],["Xiao","Z. J.",""],["Xie","C.",""],["Xie","X. H.",""],["Xie","Y.",""],["Xie","Y. G.",""],["Xie","Y. H.",""],["Xie","Z. P.",""],["Xing","T. Y.",""],["Xu","C. F.",""],["Xu","C. J.",""],["Xu","G. F.",""],["Xu","H. Y.",""],["Xu","Q. J.",""],["Xu","W. L.",""],["Xu","X. P.",""],["Xu","Y. C.",""],["Xu","Z. P.",""],["Yan","F.",""],["Yan","L.",""],["Yan","W. B.",""],["Yan","W. C.",""],["Yan","X. Q",""],["Yang","H. J.",""],["Yang","H. L.",""],["Yang","H. X.",""],["Yang","Tao",""],["Yang","Y.",""],["Yang","Y. F.",""],["Yang","Y. X.",""],["Yang","Yifan",""],["Yang","Z. W.",""],["Ye","M.",""],["Ye","M. H.",""],["Yin","J. H.",""],["You","Z. Y.",""],["Yu","B. X.",""],["Yu","C. X.",""],["Yu","G.",""],["Yu","T.",""],["Yu","X. D.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Yuan","S. C.",""],["Yuan","X. Q.",""],["Yuan","Y.",""],["Yuan","Z. Y.",""],["Yue","C. X.",""],["Zafar","A. A.",""],["Zeng","F. R.",""],["Zeng","X.",""],["Zeng","Y.",""],["Zeng","Y. J.",""],["Zhai","X. Y.",""],["Zhan","Y. H.",""],["Zhang","A. Q.",""],["Zhang","B. L.",""],["Zhang","B. X.",""],["Zhang","D. H.",""],["Zhang","G. Y.",""],["Zhang","H.",""],["Zhang","H. H.",""],["Zhang","H. H.",""],["Zhang","H. Q.",""],["Zhang","H. Y.",""],["Zhang","J. J.",""],["Zhang","J. L.",""],["Zhang","J. Q.",""],["Zhang","J. W.",""],["Zhang","J. X.",""],["Zhang","J. Y.",""],["Zhang","J. Z.",""],["Zhang","Jiawei",""],["Zhang","L. M.",""],["Zhang","L. Q.",""],["Zhang","Lei",""],["Zhang","P.",""],["Zhang","Q. Y.",""],["Zhang","Shuihan",""],["Zhang","Shulei",""],["Zhang","X. D.",""],["Zhang","X. M.",""],["Zhang","X. Y.",""],["Zhang","X. Y.",""],["Zhang","Y.",""],["Zhang","Y. T.",""],["Zhang","Y. H.",""],["Zhang","Y. X.",""],["Zhang","Yan",""],["Zhang","Yao",""],["Zhang","Z. H.",""],["Zhang","Z. L.",""],["Zhang","Z. Y.",""],["Zhang","Z. Y.",""],["Zhao","G.",""],["Zhao","J.",""],["Zhao","J. Y.",""],["Zhao","J. Z.",""],["Zhao","Lei",""],["Zhao","Ling",""],["Zhao","M. G.",""],["Zhao","S. J.",""],["Zhao","Y. B.",""],["Zhao","Y. X.",""],["Zhao","Z. G.",""],["Zhemchugov","A.",""],["Zheng","B.",""],["Zheng","J. P.",""],["Zheng","W. J.",""],["Zheng","Y. H.",""],["Zhong","B.",""],["Zhong","X.",""],["Zhou","H.",""],["Zhou","L. P.",""],["Zhou","X.",""],["Zhou","X. K.",""],["Zhou","X. R.",""],["Zhou","X. Y.",""],["Zhou","Y. Z.",""],["Zhu","J.",""],["Zhu","K.",""],["Zhu","K. J.",""],["Zhu","L.",""],["Zhu","L. X.",""],["Zhu","S. H.",""],["Zhu","S. Q.",""],["Zhu","T. J.",""],["Zhu","W. J.",""],["Zhu","Y. C.",""],["Zhu","Z. A.",""],["Zou","J. H.",""],["Zu","J.",""]]}
{"id":"2308.05491","submitter":"Tanisha Joshi","authors":"Tanisha Joshi, S.D Pathak","title":"Interacting Tachyonic Scalar Field III","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study explores the plausibility of an interacting tachyonic scalar,\nhomogeneous in nature, as a promising candidate for dynamic dark energy,\noffering insights into the observed accelerated expansion of the universe. The\nparameterization of the interaction between the tachyonic field, matter, and\nHubble's parameter is performed linearly. The analysis focuses on fundamental\ncosmological parameters in a flat universe $(K = 0)$: expansion rate, universe\nage, energy density evolution for matter and the tachyonic field. The study\nalso examines the coupling strength between the tachyonic field and matter,\nrevealing a maximum value of unity when the interaction depends solely on their\nenergy densities. Combining them also yields an upper limit of unity (precisely\n0.7) for the coupling strength.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:38:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Joshi","Tanisha",""],["Pathak","S. D",""]]}
{"id":"2308.05492","submitter":"Luca Foffano","authors":"Luca Foffano, Matteo Cerruti, Valerio Vittorini","title":"Neutrinos from interactions between the relativistic jet and large-scale\n  structures of BL Lac objects investigated through their gamma-ray spectrum","comments":"Accepted for publication on Proceedings of Science for the 38th\n  International Cosmic Ray Conference (ICRC2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Absorption and emission lines in the optical spectrum are typically used to\ninvestigate the presence of large-scale environments in active galactic nuclei\n(AGNs). BL Lac objects - which are a category of AGNs with the relativistic jet\npointing directly to the observer - are supposed to represent a late evolution\nstage of AGNs. Their large-scale structures are probably poorer of material,\nwhich is distributed with lower densities throughout the circumnuclear\nenvironment. Their accretion disk is weak and weakly reprocessed, making the\nnon-thermal continuum of the relativistic jet dominate their optical spectrum\nand preventing us from identifying the thermal emission of the photon fields\nproduced by such large-scale structures. However, these photon fields may still\nexist and eventually interact with the gamma rays traveling in the blazar jet\nvia gamma-gamma pair production, producing observable effects such as\nabsorption features in their spectral energy distribution. Interestingly, the\nsame photon field might also lead to the production of high-energy neutrinos,\nacting as targets for proton-photon interactions. In this contribution, we\npresent the results of a set of simulations over a wide parameter space\ndescribing both the blazar jet and the photon field properties. We discuss the\nmost effective conditions that may produce fluxes of neutrinos compatible with\nthe sensitivities of the current and the next generation of neutrino detectors.\nWe will also discuss how the possible neutrino flux would be related to the\nproperties of the large-scale structures investigated indirectly through the\nanalysis of the gamma-ray spectrum of the BL Lac object.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:42:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Foffano","Luca",""],["Cerruti","Matteo",""],["Vittorini","Valerio",""]]}
{"id":"2308.05493","submitter":"Xu Zheng","authors":"Xu Zheng, Tianbo Pan, Yunhao Luo, Lin Wang","title":"Look at the Neighbor: Distortion-aware Unsupervised Domain Adaptation\n  for Panoramic Semantic Segmentation","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":"  Endeavors have been recently made to transfer knowledge from the labeled\npinhole image domain to the unlabeled panoramic image domain via Unsupervised\nDomain Adaptation (UDA). The aim is to tackle the domain gaps caused by the\nstyle disparities and distortion problem from the non-uniformly distributed\npixels of equirectangular projection (ERP). Previous works typically focus on\ntransferring knowledge based on geometric priors with specially designed\nmulti-branch network architectures. As a result, considerable computational\ncosts are induced, and meanwhile, their generalization abilities are profoundly\nhindered by the variation of distortion among pixels. In this paper, we find\nthat the pixels' neighborhood regions of the ERP indeed introduce less\ndistortion. Intuitively, we propose a novel UDA framework that can effectively\naddress the distortion problems for panoramic semantic segmentation. In\ncomparison, our method is simpler, easier to implement, and more\ncomputationally efficient. Specifically, we propose distortion-aware attention\n(DA) capturing the neighboring pixel distribution without using any geometric\nconstraints. Moreover, we propose a class-wise feature aggregation (CFA) module\nto iteratively update the feature representations with a memory bank. As such,\nthe feature similarity between two domains can be consistently optimized.\nExtensive experiments show that our method achieves new state-of-the-art\nperformance while remarkably reducing 80% parameters.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:47:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zheng","Xu",""],["Pan","Tianbo",""],["Luo","Yunhao",""],["Wang","Lin",""]]}
{"id":"2308.05494","submitter":"Shih-Ying Hsu","authors":"Shih-Ying Hsu, Sheng-Yuan Liu, Doug Johnstone, Tie Liu, Leonardo\n  Bronfman, Huei-Ru Vivien Chen, Somnath Dutta, David J. Eden, Neal J. Evans\n  II, Naomi Hirano, Mika Juvela, Yi-Jehng Kuan, Woojin Kwon, Chin-Fei Lee,\n  Chang Won Lee, Jeong-Eun Lee, Shanghuo Li, Chun-Fan Liu, Xunchuan Liu, Qiuyi\n  Luo, Sheng-Li Qin, Mark G. Rawlings, Dipen Sahu, Patricio Sanhueza, Hsien\n  Shang, Kenichi Tatematsu, Yao-Lun Yang","title":"ALMA Survey of Orion Planck Galactic Cold Clumps (ALMASOP): The\n  Warm-Envelope Origin of Hot Corinos","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hot corinos are of great interest due to their richness in interstellar\ncomplex organic molecules (COMs) and the consequent potential prebiotic\nconnection to solar-like planetary systems. Recent surveys have reported an\nincreasing number of hot corino detections in Class 0/I protostars; however,\nthe relationships between their physical properties and the hot-corino\nsignatures remain elusive. In this study, our objective is to establish a\ngeneral picture of the detectability of the hot corinos by identifying the\norigin of the hot-corino signatures in the sample of young stellar objects\n(YSOs) obtained from the Atacama Large Millimeter/submillimeter Array Survey of\nOrion Planck Galactic Cold Clumps (ALMASOP) project. We apply spectral energy\ndistribution (SED) modeling to our sample and identify the physical parameters\nof the modeled YSOs directly, linking the detection of hot-corino signatures to\nthe envelope properties of the YSOs. Imaging simulations of the methanol\nemission further support this scenario. We, therefore, posit that the observed\nCOM emission originates from the warm inner envelopes of the sample YSOs, based\non both the warm region size and the envelope density profile. The former is\ngoverned by the source luminosity and is additionally affected by the disk and\ncavity properties, while the latter is related to the evolutionary stages. This\nscenario provides a framework for detecting hot-corino signatures toward\nluminous Class 0 YSOs, with fewer detections observed toward similarly luminous\nClass I sources.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:48:29 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 15:23:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hsu","Shih-Ying",""],["Liu","Sheng-Yuan",""],["Johnstone","Doug",""],["Liu","Tie",""],["Bronfman","Leonardo",""],["Chen","Huei-Ru Vivien",""],["Dutta","Somnath",""],["Eden","David J.",""],["Evans","Neal J.","II"],["Hirano","Naomi",""],["Juvela","Mika",""],["Kuan","Yi-Jehng",""],["Kwon","Woojin",""],["Lee","Chin-Fei",""],["Lee","Chang Won",""],["Lee","Jeong-Eun",""],["Li","Shanghuo",""],["Liu","Chun-Fan",""],["Liu","Xunchuan",""],["Luo","Qiuyi",""],["Qin","Sheng-Li",""],["Rawlings","Mark G.",""],["Sahu","Dipen",""],["Sanhueza","Patricio",""],["Shang","Hsien",""],["Tatematsu","Kenichi",""],["Yang","Yao-Lun",""]]}
{"id":"2308.05495","submitter":"Taehwan Im","authors":"Taehwan Im, Sun Kyu Song, Jae Whan Park, and Han Woong Yeom","title":"Topological soliton molecule in quasi 1D charge density wave","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":"  Soliton molecules, bound states of two solitons, can be important for the\ninformatics using solitons and the quest for exotic particles in a wide range\nof physical systems from unconventional superconductors to nuclear matter and\nHiggs field, but have been observed only in temporal dimension for classical\nwave optical systems. Here, we identify a topological soliton molecule formed\nspatially in an electronic system, a quasi 1D charge density wave of indium\natomic wires. This system is composed of two coupled Peierls chains, which are\nendowed with a Z$_4$ topology and three distinct, right-chiral, left-chiral,\nand non-chiral, solitons. Our scanning tunneling microscopy measurements\nidentify a bound state of right- and left-chiral solitons with distinct in-gap\nstates and net zero phase shift. Our density functional theory calculations\nreveal the attractive interaction of these solitons and the hybridization of\ntheir electronic states. This result initiates the study of the interaction\nbetween solitons in electronic systems, which can provide novel manybody\nelectronic states and extra data-handling capacity beyond the given soliton\ntopology.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:54:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Im","Taehwan",""],["Song","Sun Kyu",""],["Park","Jae Whan",""],["Yeom","Han Woong",""]]}
{"id":"2308.05496","submitter":"Nick Bryan-Kinns","authors":"Nick Bryan-Kinns, Berker Banar, Corey Ford, Courtney N. Reed, Yixiao\n  Zhang, Simon Colton, Jack Armitage","title":"Exploring XAI for the Arts: Explaining Latent Space in Generative Music","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Explainable AI has the potential to support more interactive and fluid\nco-creative AI systems which can creatively collaborate with people. To do\nthis, creative AI models need to be amenable to debugging by offering\neXplainable AI (XAI) features which are inspectable, understandable, and\nmodifiable. However, currently there is very little XAI for the arts. In this\nwork, we demonstrate how a latent variable model for music generation can be\nmade more explainable; specifically we extend MeasureVAE which generates\nmeasures of music. We increase the explainability of the model by: i) using\nlatent space regularisation to force some specific dimensions of the latent\nspace to map to meaningful musical attributes, ii) providing a user interface\nfeedback loop to allow people to adjust dimensions of the latent space and\nobserve the results of these changes in real-time, iii) providing a\nvisualisation of the musical attributes in the latent space to help people\nunderstand and predict the effect of changes to latent space dimensions. We\nsuggest that in doing so we bridge the gap between the latent space and the\ngenerated musical outcomes in a meaningful way which makes the model and its\noutputs more explainable and more debuggable.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 10:59:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bryan-Kinns","Nick",""],["Banar","Berker",""],["Ford","Corey",""],["Reed","Courtney N.",""],["Zhang","Yixiao",""],["Colton","Simon",""],["Armitage","Jack",""]]}
{"id":"2308.05497","submitter":"Max Vom Stein","authors":"Max vom Stein, Maximilian Hoppe, Maxim Sommer, Kai-Dietrich Wolf","title":"Measuring the spatial Acuity of vibrotactile Stimuli: A new Approach to\n  determine universal and individual Thresholds","comments":"17 pages, 10 figures. Submitted to Elsevier: Displays","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tactile perception is an increasingly popular gateway in human-machine\ninteraction, yet universal design guidelines for tactile displays are still\nlacking, largely due to the absence of methods to measure sensibility across\nskin areas. In this study, we address this gap by developing and evaluating two\nfully automated vibrotactile tasks that require subjects to discriminate the\nposition of vibrotactile stimuli using a two-interval forced-choice procedure\n(2IFC). Of the two methodologies, one was initially validated through a\npreliminary study involving 13 participants. Subsequently, we applied the\nvalidated and improved vibrotactile testing procedure to a larger sample of 23\nparticipants, enabling a direct and valid comparison with static perception.\nOur findings reveal a significantly finer spatial acuity for static stimuli\nperception compared to vibrotactile stimuli perception from a stimulus\nseparation of 15 mm onwards. This study introduces a novel method for\ngenerating both universal thresholds and individual person-specific data for\nvibratory perception, marking a critical step towards the development of\nfunctional vibrotactile displays. The results underline the need for further\nresearch in this area and provide a foundation for the development of universal\ndesign guidelines for tactile displays.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:01:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Stein","Max vom",""],["Hoppe","Maximilian",""],["Sommer","Maxim",""],["Wolf","Kai-Dietrich",""]]}
{"id":"2308.05498","submitter":"Benjamin Miller","authors":"Benjamin A. Miller and Kevin Chan and Tina Eliassi-Rad","title":"Complex Network Effects on the Robustness of Graph Convolutional\n  Networks","comments":"39 pages, 8 figures. arXiv admin note: text overlap with\n  arXiv:2003.05822","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vertex classification -- the problem of identifying the class labels of nodes\nin a graph -- has applicability in a wide variety of domains. Examples include\nclassifying subject areas of papers in citation networks or roles of machines\nin a computer network. Vertex classification using graph convolutional networks\nis susceptible to targeted poisoning attacks, in which both graph structure and\nnode attributes can be changed in an attempt to misclassify a target node. This\nvulnerability decreases users' confidence in the learning method and can\nprevent adoption in high-stakes contexts. Defenses have also been proposed,\nfocused on filtering edges before creating the model or aggregating information\nfrom neighbors more robustly. This paper considers an alternative: we leverage\nnetwork characteristics in the training data selection process to improve\nrobustness of vertex classifiers.\n  We propose two alternative methods of selecting training data: (1) to select\nthe highest-degree nodes and (2) to iteratively select the node with the most\nneighbors minimally connected to the training set. In the datasets on which the\noriginal attack was demonstrated, we show that changing the training set can\nmake the network much harder to attack. To maintain a given probability of\nattack success, the adversary must use far more perturbations; often a factor\nof 2--4 over the random training baseline. These training set selection methods\noften work in conjunction with the best recently published defenses to provide\neven greater robustness. While increasing the amount of randomly selected\ntraining data sometimes results in a more robust classifier, the proposed\nmethods increase robustness substantially more. We also run a simulation study\nin which we demonstrate conditions under which each of the two methods\noutperforms the other, controlling for the graph topology, homophily of the\nlabels, and node attributes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:03:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Miller","Benjamin A.",""],["Chan","Kevin",""],["Eliassi-Rad","Tina",""]]}
{"id":"2308.05499","submitter":"Ayla Erdur Kara","authors":"Muhittin Evren Aydin and Ayla Erdur Kara","title":"Singular Miminal Ruled Surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study surfaces with minimal potential energy under\ngravitational forces, called singular minimal surfaces. We prove that a\nsingular minimal ruled surface in a Euclidean $3-$space is cylindrical, in\nparticular as an $\\alpha-$catenary cylinder by a result of L\\'{o}pez [Ann.\nGlob. Anal. Geom. 53(4) (2018), 521-541]. This result is also extended in\nLorentz-Minkowski $3-$space.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:03:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Aydin","Muhittin Evren",""],["Kara","Ayla Erdur",""]]}
{"id":"2308.05500","submitter":"Pelin \\c{C}ilo\\u{g}lu","authors":"Pelin \\c{C}ilo\\u{g}lu, Hamdullah Y\\\"ucel","title":"An Adaptive Algorithm Based on Stochastic Discontinuous Galerkin for\n  Convection Dominated Equations with Random Data","comments":"41 pages, 19 figures, 5 tables","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 an adaptive approach, based on mesh refinement or\nparametric enrichment, for convection diffusion equations containing randomness\nin their coefficients. A parametric system of convection diffusion equations\nobtained by an application of stochastic Galerkin approach is discretized by\nusing a symmetric interior penalty Galerkin (SIPG) method with upwinding for\nthe convection term in the spatial domain. We show the reliability of the\nproposed residual-based error estimator in the energy norm contributed by the\nerror due to the SIPG discretization, the error due to the data oscillations,\nand the error due to the (generalized) polynomial chaos discretization in the\nparametric space. To illustrate the performance of the proposed estimator,\nseveral benchmark examples including a random diffusivity parameter, a random\nvelocity parameter, random diffusivity/velocity parameters, and a random (jump)\ndiscontinuous diffusivity parameter, are tested.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:07:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["\u00c7ilo\u011flu","Pelin",""],["Y\u00fccel","Hamdullah",""]]}
{"id":"2308.05501","submitter":"Sapir Gershov","authors":"Sapir Gershov, Fadi Mahameed, Aeyal Raz, Shlomi Laufer","title":"More Than Meets the Eye: Analyzing Anesthesiologists' Visual Attention\n  in the Operating Room Using Deep Learning Models","comments":"Submitted to MICCAI Aml4HC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Patient's vital signs, which are displayed on monitors, make the\nanesthesiologist's visual attention (VA) a key component in the safe management\nof patients under general anesthesia; moreover, the distribution of said VA and\nthe ability to acquire specific cues throughout the anesthetic, may have a\ndirect impact on patient's outcome. Currently, most studies employ wearable\neye-tracking technologies to analyze anesthesiologists' visual patterns. Albeit\nbeing able to produce meticulous data, wearable devices are not a sustainable\nsolution for large-scale or long-term use for data collection in the operating\nroom (OR). Thus, by utilizing a novel eye-tracking method in the form of deep\nlearning models that process monitor-mounted webcams, we collected continuous\nbehavioral data and gained insight into the anesthesiologist's VA distribution\nwith minimal disturbance to their natural workflow. In this study, we collected\nOR video recordings using the proposed framework and compared different visual\nbehavioral patterns. We distinguished between baseline VA distribution during\nuneventful periods to patterns associated with active phases or during\ncritical, unanticipated incidents. In the future, such a platform may serve as\na crucial component of context-aware assistive technologies in the OR.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:12:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gershov","Sapir",""],["Mahameed","Fadi",""],["Raz","Aeyal",""],["Laufer","Shlomi",""]]}
{"id":"2308.05502","submitter":"Andrea Tagarelli","authors":"Candida M. Greco, Andrea Tagarelli","title":"Bringing order into the realm of Transformer-based language models for\n  artificial intelligence and law","comments":"Accepted for publication with Artificial Intelligence and Law,\n  Springer Nature","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.NE physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer-based language models (TLMs) have widely been recognized to be a\ncutting-edge technology for the successful development of deep-learning-based\nsolutions to problems and applications that require natural language processing\nand understanding. Like for other textual domains, TLMs have indeed pushed the\nstate-of-the-art of AI approaches for many tasks of interest in the legal\ndomain. Despite the first Transformer model being proposed about six years ago,\nthere has been a rapid progress of this technology at an unprecedented rate,\nwhereby BERT and related models represent a major reference, also in the legal\ndomain. This article provides the first systematic overview of TLM-based\nmethods for AI-driven problems and tasks in the legal sphere. A major goal is\nto highlight research advances in this field so as to understand, on the one\nhand, how the Transformers have contributed to the success of AI in supporting\nlegal processes, and on the other hand, what are the current limitations and\nopportunities for further research development.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:14:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Greco","Candida M.",""],["Tagarelli","Andrea",""]]}
{"id":"2308.05503","submitter":"Jiaxin Song","authors":"Xiaolin Bu, Jiaxin Song and Ziqi Yu","title":"EFX Allocations Exist for Binary Valuations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.AI cs.CC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the fair division problem and the existence of allocations\nsatisfying the fairness criterion envy-freeness up to any item (EFX). The\nexistence of EFX allocations is a major open problem in the fair division\nliterature. We consider binary valuations where the marginal gain of the value\nby receiving an extra item is either $0$ or $1$. Babaioff et al. [2021] proved\nthat EFX allocations always exist for binary and submodular valuations. In this\npaper, by using completely different techniques, we extend this existence\nresult to general binary valuations that are not necessarily submodular, and we\npresent a polynomial time algorithm for computing an EFX allocation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:28:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bu","Xiaolin",""],["Song","Jiaxin",""],["Yu","Ziqi",""]]}
{"id":"2308.05504","submitter":"Wouter Jansen","authors":"Maarten de Backer, Wouter Jansen, Dennis Laurijssen, Ralph Simon,\n  Walter Daems, Jan Steckel","title":"Detecting and Classifying Bio-Inspired Artificial Landmarks Using In-Air\n  3D Sonar","comments":"Accepted at 2023 IEEE Sensors Conference, Vienna, Austria","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Various autonomous applications rely on recognizing specific known landmarks\nin their environment. For example, Simultaneous Localization And Mapping (SLAM)\nis an important technique that lays the foundation for many common tasks, such\nas navigation and long-term object tracking. This entails building a map on the\ngo based on sensory inputs which are prone to accumulating errors. Recognizing\nlandmarks in the environment plays a vital role in correcting these errors and\nfurther improving the accuracy of SLAM. The most popular choice of sensors for\nconducting SLAM today is optical sensors such as cameras or LiDAR sensors.\nThese can use landmarks such as QR codes as a prerequisite. However, such\nsensors become unreliable in certain conditions, e.g., foggy, dusty,\nreflective, or glass-rich environments. Sonar has proven to be a viable\nalternative to manage such situations better. However, acoustic sensors also\nrequire a different type of landmark. In this paper, we put forward a method to\ndetect the presence of bio-mimetic acoustic landmarks using support vector\nmachines trained on the frequency bands of the reflecting acoustic echoes using\nan embedded real-time imaging sonar.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:30:23 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 07:22:14 GMT"}],"update_date":"2023-08-14","authors_parsed":[["de Backer","Maarten",""],["Jansen","Wouter",""],["Laurijssen","Dennis",""],["Simon","Ralph",""],["Daems","Walter",""],["Steckel","Jan",""]]}
{"id":"2308.05505","submitter":"Xinyi Wang","authors":"Xinyi Wang (1), Asmar Muqeet (1), Tao Yue (1), Shaukat Ali (1 and 2),\n  Paolo Arcaini (3) ((1) Simula Research Laboratory Oslo Norway, (2) Oslo\n  Metropolitan University Oslo Norway, (3) National Institute of Informatics\n  Tokyo Japan)","title":"Test Case Minimization with Quantum Annealers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum annealers are specialized quantum computers for solving combinatorial\noptimization problems using special characteristics of quantum computing (QC),\nsuch as superposition, entanglement, and quantum tunneling. Theoretically,\nquantum annealers can outperform classical computers. However, the currently\navailable quantum annealers are small-scale, i.e., they have limited quantum\nbits (qubits); hence, they currently cannot demonstrate the quantum advantage.\nNonetheless, research is warranted to develop novel mechanisms to formulate\ncombinatorial optimization problems for quantum annealing (QA). However,\nsolving combinatorial problems with QA in software engineering remains\nunexplored. Toward this end, we propose BootQA, the very first effort at\nsolving the test case minimization (TCM) problem with QA. In BootQA, we provide\na novel formulation of TCM for QA, followed by devising a mechanism to\nincorporate bootstrap sampling to QA to optimize the use of qubits. We also\nimplemented our TCM formulation in three other optimization processes:\nclassical simulated annealing (SA), QA without problem decomposition, and QA\nwith an existing D-Wave problem decomposition strategy, and conducted an\nempirical evaluation with three real-world TCM datasets. Results show that\nBootQA outperforms QA without problem decomposition and QA with the existing\ndecomposition strategy in terms of effectiveness. Moreover, BootQA's\neffectiveness is similar to SA. Finally, BootQA has higher efficiency in terms\nof time when solving large TCM problems than the other three optimization\nprocesses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:31:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Xinyi","","1 and 2"],["Muqeet","Asmar","","1 and 2"],["Yue","Tao","","1 and 2"],["Ali","Shaukat","","1 and 2"],["Arcaini","Paolo",""]]}
{"id":"2308.05506","submitter":"Thomas Studer","authors":"Michael Baur and Thomas Studer","title":"Semirings of Evidence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In traditional justification logic, evidence terms have the syntactic form of\npolynomials, but they are not equipped with the corresponding algebraic\nstructure. We present a novel semantic approach to justification logic that\nmodels evidence by a semiring. Hence justification terms can be interpreted as\npolynomial functions on that semiring. This provides an adequate semantics for\nevidence terms and clarifies the role of variables in justification logic.\nMoreover, the algebraic structure makes it possible to compute with evidence.\nDepending on the chosen semiring this can be used to model trust,\nprobabilities, cost, etc. Last but not least the semiring approach seems\npromising for obtaining a realization procedure for modal fixed point logics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:34:15 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 13:36:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Baur","Michael",""],["Studer","Thomas",""]]}
{"id":"2308.05507","submitter":"Roman Engelhardt","authors":"Roman Engelhardt and Hani S. Mahmassani and Klaus Bogenberger","title":"Predictive Vehicle Repositioning for On-Demand Ride-Pooling Services","comments":"Submitted to TRB Annual Meeting 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  On-Demand Ride-Pooling services have the potential to increase traffic\nefficiency compared to private vehicle trips by decreasing parking space needed\nand increasing vehicle occupancy due to higher vehicle utilization and shared\ntrips, respectively. Thereby, an operator controls a fleet of vehicles that\nserve requested trips on-demand while trips can be shared. In this highly\ndynamic and stochastic setting, asymmetric spatio-temporal request\ndistributions can drive the system towards an imbalance between demand and\nsupply when vehicles end up in regions with low demand. This imbalance would\nlead to low fleet utilization and high customer waiting times. This study\nproposes a novel rebalancing algorithm to predictively reposition idle fleet\nvehicles to reduce this imbalance. The algorithm first samples artificial\nrequests from a predicted demand distribution and simulates future fleet states\nto identify supply shortages. An assignment problem is formulated that assigns\nrepositioning trips considering multiple samples and forecast horizons. The\nalgorithm is implemented in an agent-based simulation framework and compared to\nmultiple state-of-the-art rebalancing algorithms. A case study for Chicago,\nIllinois shows the benefits of applying the repositioning strategy by\nincreasing service rate and vehicle revenue hours by roughly 50% compared to a\nservice without repositioning. It additionally outperforms all comparison\nalgorithms by serving more customers, increasing the pooling efficiency and\ndecreasing customer waiting time regardless of the forecasting method applied.\nAs a trade-off, the computational time increases, but with a termination within\na couple of seconds it is still applicable for large-scale real world\ninstances.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:35:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Engelhardt","Roman",""],["Mahmassani","Hani S.",""],["Bogenberger","Klaus",""]]}
{"id":"2308.05508","submitter":"Wentao Ning","authors":"Wentao Ning, Xiao Yan, Weiwen Liu, Reynold Cheng, Rui Zhang and Bo\n  Tang","title":"Multi-domain Recommendation with Embedding Disentangling and Domain\n  Alignment","comments":"Accepted by CIKM'23 as a Long paper","journal-ref":null,"doi":"10.1145/3583780.3614977","report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-domain recommendation (MDR) aims to provide recommendations for\ndifferent domains (e.g., types of products) with overlapping users/items and is\ncommon for platforms such as Amazon, Facebook, and LinkedIn that host multiple\nservices. Existing MDR models face two challenges: First, it is difficult to\ndisentangle knowledge that generalizes across domains (e.g., a user likes cheap\nitems) and knowledge specific to a single domain (e.g., a user likes blue\nclothing but not blue cars). Second, they have limited ability to transfer\nknowledge across domains with small overlaps. We propose a new MDR method named\nEDDA with two key components, i.e., embedding disentangling recommender and\ndomain alignment, to tackle the two challenges respectively. In particular, the\nembedding disentangling recommender separates both the model and embedding for\nthe inter-domain part and the intra-domain part, while most existing MDR\nmethods only focus on model-level disentangling. The domain alignment leverages\nrandom walks from graph processing to identify similar user/item pairs from\ndifferent domains and encourages similar user/item pairs to have similar\nembeddings, enhancing knowledge transfer. We compare EDDA with 12\nstate-of-the-art baselines on 3 real datasets. The results show that EDDA\nconsistently outperforms the baselines on all datasets and domains. All\ndatasets and codes are available at https://github.com/Stevenn9981/EDDA.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:41:34 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 01:48:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ning","Wentao",""],["Yan","Xiao",""],["Liu","Weiwen",""],["Cheng","Reynold",""],["Zhang","Rui",""],["Tang","Bo",""]]}
{"id":"2308.05509","submitter":"Juncai He","authors":"Juncai He","title":"On the Optimal Expressive Power of ReLU DNNs and Its Application in\n  Approximation with Kolmogorov Superposition Theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is devoted to studying the optimal expressive power of ReLU deep\nneural networks (DNNs) and its application in approximation via the Kolmogorov\nSuperposition Theorem. We first constructively prove that any continuous\npiecewise linear functions on $[0,1]$, comprising $O(N^2L)$ segments, can be\nrepresented by ReLU DNNs with $L$ hidden layers and $N$ neurons per layer.\nSubsequently, we demonstrate that this construction is optimal regarding the\nparameter count of the DNNs, achieved through investigating the shattering\ncapacity of ReLU DNNs. Moreover, by invoking the Kolmogorov Superposition\nTheorem, we achieve an enhanced approximation rate for ReLU DNNs of arbitrary\nwidth and depth when dealing with continuous functions in high-dimensional\nspaces.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:42:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Juncai",""]]}
{"id":"2308.05510","submitter":"He Wang","authors":"Minghui Du and Bo Liang and He Wang and Peng Xu and Ziren Luo and\n  Yueliang Wu","title":"Advancing Space-Based Gravitational Wave Astronomy: Rapid Detection and\n  Parameter Estimation Using Normalizing Flows","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM gr-qc physics.data-an","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Gravitational wave (GW) astronomy is witnessing a transformative shift from\nterrestrial to space-based detection, with missions like Taiji at the\nforefront. While the transition brings unprecedented opportunities to explore\nmassive black hole binaries (MBHBs), it also imposes complex challenges in data\nanalysis, particularly in parameter estimation amidst confusion noise.\nAddressing this gap, we utilize scalable Normalizing Flow models to achieve\nrapid and accurate inference within the Taiji environment. Innovatively, our\napproach simplifies the data's complexity, employs a transformation mapping to\novercome the year-period time-dependent response function, and unveils\nadditional multimodality in the arrival time parameter. Our method estimates\nMBHBs several orders of magnitude faster than conventional techniques,\nmaintaining high accuracy even in complex backgrounds. These findings\nsignificantly enhance the efficiency of GW data analysis, paving the way for\nrapid detection and alerting systems and enriching our ability to explore the\nuniverse through space-based GW observation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:42:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Du","Minghui",""],["Liang","Bo",""],["Wang","He",""],["Xu","Peng",""],["Luo","Ziren",""],["Wu","Yueliang",""]]}
{"id":"2308.05511","submitter":"Feng-Xiao Sun","authors":"Yilun Xu, Daoquan Zhu, Feng-Xiao Sun, Qiongyi He, Wei Zhang","title":"Fast quantum state transfer and entanglement preparation in strongly\n  coupled bosonic systems","comments":"28 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continuous U(1) gauge symmetry, which guarantees the conservation of the\ntotal excitations in linear bosonic systems, will be broken when it comes to\nthe strong-coupling regime where the rotation wave approximation (RWA) fails.\nHere we develop analytic solutions for multi-mode bosonic systems with XX-type\ncouplings beyond RWA, and proposed a novel scheme to implement high-fidelity\nquantum state transfer (QST) and entanglement preparation (EP) with high speed.\nThe scheme can be realized with designated coupling strength and pulse duration\nwith which the excitation number keeps unchanged regardless of the breakdown of\nthe global U(1) symmetry. In the QST tasks, we consider several typical quantum\nstates and demonstrate that this method is robust against thermal noise and\nimperfections of experimental sequence. In the EP tasks, the scheme is\nsuccessfully implemented for the preparation of Bell states and W-type states,\nwithin a shortest preparation time.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:44:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xu","Yilun",""],["Zhu","Daoquan",""],["Sun","Feng-Xiao",""],["He","Qiongyi",""],["Zhang","Wei",""]]}
{"id":"2308.05512","submitter":"Hirofumi Nema","authors":"Hirofumi Nema, Yasuhiro Fujii, Eiichi Oishi and Akitoshi Koreeda","title":"Observation of low-frequency Raman peak in layered WTe$_2$","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":"  WTe$_2$ recently attracted considerable attention as a layered material\nexhibiting ferroelectricity, giant magnetoresistance, and pressure-induced\nsuperconductivity. In this study, we performed Raman spectroscopy on bulk\nWTe$_2$, including the unreported low frequency region. A novel Raman peak (P0)\nwas found at approximately 9 cm$^{-1}$ in addition to the seven already known\npeaks. Furthermore, the angular and polarization dependence of the spectra\nrevealed that the novel peak had $A_1$ symmetry. The existence of this novel\npeak is consistent with first principles calculations by another group. Our\nwork paves the way for studying the low frequency vibration modes of atomic\nlayer ferrolectric films.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:45:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nema","Hirofumi",""],["Fujii","Yasuhiro",""],["Oishi","Eiichi",""],["Koreeda","Akitoshi",""]]}
{"id":"2308.05513","submitter":"Han Qing Shi","authors":"Han-Qing Shi and Hai-Qing Zhang","title":"Measuring Renyi Entropy in Neural Network Quantum States","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the Renyi entropy in a one-dimensional transverse-field quantum\nIsing model by employing a swapping operator acting on the states which are\nprepared from the neural network methods. In the static ground state, Renyi\nentropy can uncover the critical point of the quantum phase transition from\nparamagnetic to ferromagnetic. At the critical point, the relation between the\nRenyi entropy and the subsystem size satisfies the predictions from conformal\nfield theory. In the dynamical case, we find coherent oscillations of the Renyi\nentropy after the end of the linear quench. These oscillations have universal\nfrequencies which may come from the superpositions of excited states. The\nasymptotic form of the Renyi entropy implies a new length scale away from the\ncritical point. This length scale is also verified by the overlap of the\nreduced Renyi entropy against the dimensionless subsystem size.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:52:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shi","Han-Qing",""],["Zhang","Hai-Qing",""]]}
{"id":"2308.05514","submitter":"Julia Theresa Kamml","authors":"Julia Kamml, Claire Acevedo, David Kammer","title":"Advanced-Glycation Endproducts: How cross-linking properties affect the\n  collagen fibril behavior","comments":"19 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advanced-Glycation-Endproducts (AGEs) are known to be a major cause of\nimpaired tissue material properties. In collagen fibrils, the main building\ncomponent of human tissue, these AGEs appear as fibrillar cross-links. When\nAGEs accumulate in collagen fibrils, a process often caused by diabetes and\naging, the mechanical properties of the collagen fibril are altered. However,\ncurrent knowledge about the mechanical properties of different types of AGEs,\nand their quantity in collagen fibrils is limited owing to the scarcity of\navailable experimental data. Consequently, the precise relationship between the\nnano-scale cross-link properties, their density in collagen fibrils, and the\nmechanical properties of the collagen fibrils at larger scales remains poorly\nunderstood. In our study, we use coarse-grained molecular dynamics simulations\nand perform destructive tensile tests on collagen fibrils to evaluate the\neffect of different cross-link densities and their mechanical properties on\ncollagen fibril deformation and fracture behavior. We observe that the collagen\nfibril stiffens at high strain levels when either the AGEs density or the\nloading energy capacity of AGEs are increased. We demonstrate that this\nstiffening is caused by a mechanism that favors energy absorption via\nstretching rather than inter-molecular sliding. Hence, in cross-linked collagen\nfibrils, the absorbed energy is stored rather than dissipated through friction,\nresulting in brittle fracture upon fibrillar failure. Further, by varying\nmultiple AGEs nano-scale parameters, we show that the AGEs loading energy\ncapacity is, aside from their density in the fibril, the unique factor\ndetermining the effect of different types of AGEs on the mechanical behavior of\ncollagen fibrils. Our results show that knowing AGEs properties is crucial for\nunderstanding of the origin of impaired tissue behavior.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:55:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kamml","Julia",""],["Acevedo","Claire",""],["Kammer","David",""]]}
{"id":"2308.05515","submitter":"Udugama Vithanage Bavantha Lakshan Udugama","authors":"U.V.B.L. Udugama, G. Vosselman, F. Nex","title":"Mono-hydra: Real-time 3D scene graph construction from monocular camera\n  input with IMU","comments":"7 pages, 5 figures, GSW 2023 conference paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The ability of robots to autonomously navigate through 3D environments\ndepends on their comprehension of spatial concepts, ranging from low-level\ngeometry to high-level semantics, such as objects, places, and buildings. To\nenable such comprehension, 3D scene graphs have emerged as a robust tool for\nrepresenting the environment as a layered graph of concepts and their\nrelationships. However, building these representations using monocular vision\nsystems in real-time remains a difficult task that has not been explored in\ndepth. This paper puts forth a real-time spatial perception system Mono-Hydra,\ncombining a monocular camera and an IMU sensor setup, focusing on indoor\nscenarios. However, the proposed approach is adaptable to outdoor applications,\noffering flexibility in its potential uses. The system employs a suite of deep\nlearning algorithms to derive depth and semantics. It uses a robocentric\nvisual-inertial odometry (VIO) algorithm based on square-root information,\nthereby ensuring consistent visual odometry with an IMU and a monocular camera.\nThis system achieves sub-20 cm error in real-time processing at 15 fps,\nenabling real-time 3D scene graph construction using a laptop GPU (NVIDIA\n3080). This enhances decision-making efficiency and effectiveness in simple\ncamera setups, augmenting robotic system agility. We make Mono-Hydra publicly\navailable at: https://github.com/UAV-Centre-ITC/Mono_Hydra\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:58:38 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Udugama","U. V. B. L.",""],["Vosselman","G.",""],["Nex","F.",""]]}
{"id":"2308.05516","submitter":"Paolo Leonetti","authors":"Paolo Leonetti","title":"Quasi-arithmetic means ad libitum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\alpha_1, \\ldots, \\alpha_m$ be two or more positive reals with sum $1$,\nlet $C\\subseteq \\mathbb{R}^k$ be an open convex set, and $f: C\\to \\mathbb{R}^k$\nbe a continuous injection with convex image. For each nonempty set $S\\subseteq\nC$, let $\\mathscr{M}(S)$ be the family of quasi-arithmetic means of all\n$m$-tuples of vectors in $C$ with respect to $f$ and the weights\n$\\alpha_1,\\ldots,\\alpha_m$, that is, the family $$ \\mathscr{M}(S)= \\left\\{\nf^{-1}\\left(\\alpha_1f(x_1)+\\cdots+\\alpha_mf(x_m)\\right): x_1,\\ldots,x_m \\in S\n\\right\\}. $$ We provide a simple necessary and sufficient condition on $S$ for\nwhich the infinite iteration $\\bigcup_{n}\\mathscr{M}^n(S)$ is relatively dense\nin the convex hull of $S$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:58:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Leonetti","Paolo",""]]}
{"id":"2308.05517","submitter":"Liu Yahang","authors":"Yahang Liu, Kecheng Wei, Chen Huang, Yongfu Yu, Guoyou Qin","title":"Quantile regression outcome-adaptive lasso: variable selection for\n  causal quantile treatment effect estimation","comments":"Need polishing","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantile treatment effects (QTEs) can characterize the potentially\nheterogeneous causal effect of a treatment on different points of the entire\noutcome distribution. Propensity score (PS) methods are commonly employed for\nestimating QTEs in non-randomized studies. Empirical and theoretical studies\nhave shown that insufficient and unnecessary adjustment for covariates in PS\nmodels can lead to bias and efficiency loss in estimating treatment effects.\nStriking a balance between bias and efficiency through variable selection is a\ncrucial concern in casual inference. It is essential to acknowledge that the\ncovariates related treatment and outcome may vary across different quantiles of\nthe outcome distribution. However, previous studies have overlooked to adjust\nfor different covariates separately in the PS models when estimating different\nQTEs. In this article, we proposed the quantile regression outcome-adaptive\nlasso (QROAL) method to select covariates that can provide unbiased and\nefficient estimates of QTEs. A distinctive feature of our proposed method is\nthe utilization of linear quantile regression models for constructing penalty\nweights, enabling covariate selection in PS models separately when estimating\ndifferent QTEs. We conducted simulation studies to show the superiority of our\nproposed method over the outcome-adaptive lasso (OAL) method in variable\nselection. Moreover, the proposed method exhibited favorable performance\ncompared to the OAL method in terms of root mean square error in a range of\nsettings, including both homogeneous and heterogeneous scenarios. Additionally,\nwe applied the QROAL method to datasets from the China Health and Retirement\nLongitudinal Study (CHARLS) to explore the impact of smoking status on the\nseverity of depression symptoms.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:59:10 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 07:30:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yahang",""],["Wei","Kecheng",""],["Huang","Chen",""],["Yu","Yongfu",""],["Qin","Guoyou",""]]}
{"id":"2308.05518","submitter":"Valerio Busillo","authors":"Valerio Busillo, Giovanni Covone, Mauro Sereno, Lorenzo Ingoglia,\n  Mario Radovich, Sandro Bardelli, Gianluca Castignani, Carlo Giocoli, Giorgio\n  Francesco Lesci, Federico Marulli, Matteo Maturi, Lauro Moscardini, Emanuela\n  Puddu, Mauro Roncarelli","title":"AMICO galaxy clusters in KiDS-DR3: constraints on $\\Lambda$CDM from\n  extreme value statistics","comments":"11 pages, 9 figures, 4 tables","journal-ref":"MNRAS 524 (2023) 5050-5059","doi":"10.1093/mnras/stad2190","report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We constrain the $\\Lambda$CDM cosmological parameter $\\sigma_{8}$ by applying\nthe extreme value statistics for galaxy cluster mass on the AMICO KiDS-DR3\ncatalog. We sample the posterior distribution of the parameters by considering\nthe likelihood of observing the largest cluster mass value in a sample of\n$N_{\\textrm{obs}} = 3644$ clusters with intrinsic richness $\\lambda^{*} > 20$\nin the redshift range $z\\in[0.10, 0.60]$. We obtain\n$\\sigma_{8}=0.90_{-0.18}^{+0.20}$, consistent within $1\\sigma$ with the\nmeasurements obtained by the Planck collaboration and with previous results\nfrom cluster cosmology exploiting AMICO KiDS-DR3. The constraints could improve\nby applying this method to forthcoming missions, such as $\\textit{Euclid}$ and\nLSST, which are expected to deliver thousands of distant and massive clusters.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:02:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Busillo","Valerio",""],["Covone","Giovanni",""],["Sereno","Mauro",""],["Ingoglia","Lorenzo",""],["Radovich","Mario",""],["Bardelli","Sandro",""],["Castignani","Gianluca",""],["Giocoli","Carlo",""],["Lesci","Giorgio Francesco",""],["Marulli","Federico",""],["Maturi","Matteo",""],["Moscardini","Lauro",""],["Puddu","Emanuela",""],["Roncarelli","Mauro",""]]}
{"id":"2308.05519","submitter":"Sung-Soo Byun","authors":"Gernot Akemann, Sung-Soo Byun, Markus Ebke, Gregory Schehr","title":"Universality in the number variance and counting statistics of the real\n  and symplectic Ginibre ensemble","comments":"47 pages, 6 figures; v2 48 pages, 6 figures, references and\n  associated text added","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.stat-mech math.MP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we compute and compare the statistics of the number of\neigenvalues in a centred disc of radius $R$ in all three Ginibre ensembles. We\ndetermine the mean and variance as functions of $R$ in the vicinity of the\norigin, where the real and symplectic ensembles exhibit respectively an\nadditional attraction to or repulsion from the real axis, leading to different\nresults. In the large radius limit, all three ensembles coincide and display a\nuniversal bulk behaviour of $O(R^2)$ for the mean, and $O(R)$ for the variance.\nWe present detailed conjectures for the bulk and edge scaling behaviours of the\nreal Ginibre ensemble, having real and complex eigenvalues. For the symplectic\nensemble we can go beyond the Gaussian case (corresponding to the Ginibre\nensemble) and prove the universality of the full counting statistics both in\nthe bulk and at the edge of the spectrum for rotationally invariant potentials,\nextending a recent work which considered the mean and the variance. This\nstatistical behaviour coincides with the universality class of the complex\nGinibre ensemble, which has been shown to be associated with the ground state\nof non-interacting fermions in a two-dimensional rotating harmonic trap. All\nour analytical results and conjectures are corroborated by numerical\nsimulations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:02:59 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 12:33:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Akemann","Gernot",""],["Byun","Sung-Soo",""],["Ebke","Markus",""],["Schehr","Gregory",""]]}
{"id":"2308.05520","submitter":"Ariel Neufeld","authors":"Ariel Neufeld, Julian Sester","title":"Bounding the Difference between the Values of Robust and Non-Robust\n  Markov Decision Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note we provide an upper bound for the difference between the value\nfunction of a distributionally robust Markov decision problem and the value\nfunction of a non-robust Markov decision problem, where the ambiguity set of\nprobability kernels of the distributionally robust Markov decision process is\ndescribed by a Wasserstein-ball around some reference kernel whereas the\nnon-robust Markov decision process behaves according to a fixed probability\nkernel contained in the ambiguity set. Our derived upper bound for the\ndifference between the value functions is dimension-free and depends linearly\non the radius of the Wasserstein-ball.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:03:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Neufeld","Ariel",""],["Sester","Julian",""]]}
{"id":"2308.05521","submitter":"Christian Dietrich","authors":"Christian Dietrich and Tim-Marek Thomas and Matthias Mnich","title":"Checkpoint Placement for Systematic Fault-Injection Campaigns","comments":"Preprint for accepted version at ICCAD'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Shrinking hardware structures and decreasing operating voltages lead to an\nincreasing number of transient hardware faults,which thus become a core problem\nto consider for safety-critical systems. Here, systematic fault injection (FI),\nwhere one program-under-test is systematically stressed with faults, provides\nan in-depth resilience analysis in the presence of faults. However, FI\ncampaigns require many independent injection experiments and, combined, long\nrun times, especially if we aim for a high coverage of the fault space. One\ncost factor is the forwarding phase, which is the time required to bring the\nsystem-under test into the fault-free state at injection time. One common\ntechnique to speed up the forwarding are checkpoints of the fault-free system\nstate at fixed points in time.\n  In this paper, we show that the placement of checkpoints has a significant\ninfluence on the required forwarding cycles, especially if we place faults\nnon-uniformly on the time axis. For this, we discuss the checkpoint-selection\nproblem in general, formalize it as a maximum-weight reward path problem in\ngraphs, propose an ILP formulation and a dynamic programming algorithm that\nfind the optimal solution, and provide a heuristic checkpoint-selection method\nbased on a genetic algorithm. Applied to the MiBench benchmark suite, our\napproach consistently reduces the forward-phase cycles by at least 88 percent\nand up to 99.934 percent when placing 16 checkpoints.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:03:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dietrich","Christian",""],["Thomas","Tim-Marek",""],["Mnich","Matthias",""]]}
{"id":"2308.05522","submitter":"Alan Kai Hassen","authors":"Paula Torren-Peraire, Alan Kai Hassen, Samuel Genheden, Jonas\n  Verhoeven, Djork-Arne Clevert, Mike Preuss, Igor Tetko","title":"Models Matter: The Impact of Single-Step Retrosynthesis on Synthesis\n  Planning","comments":"The following authors contributed equally: Paula Torren-Peraire, Alan\n  Kai Hassen","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG physics.chem-ph q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Retrosynthesis consists of breaking down a chemical compound recursively\nstep-by-step into molecular precursors until a set of commercially available\nmolecules is found with the goal to provide a synthesis route. Its two primary\nresearch directions, single-step retrosynthesis prediction, which models the\nchemical reaction logic, and multi-step synthesis planning, which tries to find\nthe correct sequence of reactions, are inherently intertwined. Still, this\nconnection is not reflected in contemporary research. In this work, we combine\nthese two major research directions by applying multiple single-step\nretrosynthesis models within multi-step synthesis planning and analyzing their\nimpact using public and proprietary reaction data. We find a disconnection\nbetween high single-step performance and potential route-finding success,\nsuggesting that single-step models must be evaluated within synthesis planning\nin the future. Furthermore, we show that the commonly used single-step\nretrosynthesis benchmark dataset USPTO-50k is insufficient as this evaluation\ntask does not represent model performance and scalability on larger and more\ndiverse datasets. For multi-step synthesis planning, we show that the choice of\nthe single-step model can improve the overall success rate of synthesis\nplanning by up to +28% compared to the commonly used baseline model. Finally,\nwe show that each single-step model finds unique synthesis routes, and differs\nin aspects such as route-finding success, the number of found synthesis routes,\nand chemical validity, making the combination of single-step retrosynthesis\nprediction and multi-step synthesis planning a crucial aspect when developing\nfuture methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:04:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Torren-Peraire","Paula",""],["Hassen","Alan Kai",""],["Genheden","Samuel",""],["Verhoeven","Jonas",""],["Clevert","Djork-Arne",""],["Preuss","Mike",""],["Tetko","Igor",""]]}
{"id":"2308.05523","submitter":"Adam Widomski","authors":"Adam Widomski, Maciej Ogrodnik, Micha{\\l} Karpi\\'nski","title":"Efficient detection of multidimensional single-photon time-bin\n  superpositions","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability to detect quantum superpositions lies at the heart of fundamental\nand applied aspects of quantum mechanics. The time-frequency degree of freedom\nof light enables encoding and transmitting quantum information in a\nmulti-dimensional fashion compatible with fiber and integrated platforms.\nHowever, the ability to efficiently detect time-frequency superpositions is not\nyet available. Here we show, that multidimensional time-bin superpositions can\nbe detected using a single time-resolved photon detector. Our approach uses\noff-the shelf components and is based on the temporal Talbot effect -- a\ntime-frequency counterpart of the well-know near field diffraction effect. We\nprovide experimental results and discuss the possible applications in quantum\ncommunication, quantum information processing, and time-frequency quantum state\ntomography.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:05:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Widomski","Adam",""],["Ogrodnik","Maciej",""],["Karpi\u0144ski","Micha\u0142",""]]}
{"id":"2308.05524","submitter":"Matthew Pressland","authors":"Xin Fang, Mikhail Gorsky, Yann Palu, Pierre-Guy Plamondon, Matthew\n  Pressland","title":"Extriangulated ideal quotients, with applications to cluster theory and\n  gentle algebras","comments":"47 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend results of Br\\\"ustle-Yang on ideal quotients of 2-term\nsubcategories of perfect derived categories of non-positive dg algebras to a\nrelative setting. We find a new interpretation of such quotients: they appear\nas prototypical examples of a new construction of quotients of extriangulated\ncategories by ideals generated by morphisms from injectives to projectives. We\napply our results to Frobenius exact cluster categories and Higgs categories\nwith suitable relative extriangulated structures, and to categories of walks\nrelated to gentle algebras. In all three cases, the extriangulated structures\nare well-behaved (they are 0-Auslander) and their quotients are equivalent to\nhomotopy categories of two-term complexes of projectives over suitable\nfinite-dimensional algebras.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:05:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fang","Xin",""],["Gorsky","Mikhail",""],["Palu","Yann",""],["Plamondon","Pierre-Guy",""],["Pressland","Matthew",""]]}
{"id":"2308.05525","submitter":"Meir Yossef Levi","authors":"Meir Yossef Levi, Guy Gilboa","title":"Critical Points ++: An Agile Point Cloud Importance Measure for Robust\n  Classification, Adversarial Defense and Explainable AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ability to cope accurately and fast with Out-Of-Distribution (OOD)\nsamples is crucial in real-world safety demanding applications. In this work we\nfirst study the interplay between critical points of 3D point clouds and OOD\nsamples. Our findings are that common corruptions and outliers are often\ninterpreted as critical points. We generalize the notion of critical points\ninto importance measures. We show that training a classification network based\nonly on less important points dramatically improves robustness, at a cost of\nminor performance loss on the clean set. We observe that normalized entropy is\nhighly informative for corruption analysis. An adaptive threshold based on\nnormalized entropy is suggested for selecting the set of uncritical points. Our\nproposed importance measure is extremely fast to compute. We show it can be\nused for a variety of applications, such as Explainable AI (XAI), Outlier\nRemoval, Uncertainty Estimation, Robust Classification and Adversarial Defense.\nWe reach SOTA results on the two latter tasks. Code is available at:\nhttps://github.com/yossilevii100/critical_points2\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:06:03 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 18:21:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Levi","Meir Yossef",""],["Gilboa","Guy",""]]}
{"id":"2308.05526","submitter":"Melih Arslan Ozcelik","authors":"Sergei Makarov, Kirill Melnikov, Paolo Nason, Melih A. Ozcelik","title":"Linear power corrections to top quark pair production in hadron\n  collisions","comments":"35 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"TTP23-032, P3H-23-055","categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute, in the framework of renormalon calculus, the ${\\cal\nO}(\\Lambda_{\\rm QCD})$ corrections to the production of $t\\bar{t}$ pairs in\nhadron collisions under the assumption that $q \\bar q \\to t \\bar t$ is the\ndominant partonic channel. This assumption is not applicable to top quark pair\nproduction at the LHC but it is valid for the Tevatron where collisions of\nprotons and anti-protons were studied. We show that the linear power correction\nto the total $t \\bar t$ production cross section vanishes provided one uses a\nshort-distance scheme for the top quark mass. We also derive relatively simple\nformulas for the power corrections to top quark kinematic distributions.\nAlthough small numerically, these power corrections exhibit interesting\ndependencies on top quark kinematics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:11:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Makarov","Sergei",""],["Melnikov","Kirill",""],["Nason","Paolo",""],["Ozcelik","Melih A.",""]]}
{"id":"2308.05527","submitter":"Andrei Kramer-Miehe","authors":"Andrei Kramer, Federica Milinanni, Pierre Nyquist, Alexandra\n  Jauhiainen, Olivia Eriksson","title":"UQSA -- An R-Package for Uncertainty Quantification and Sensitivity\n  Analysis for Biochemical Reaction Network Models","comments":"6 pages, 1 figure, application note","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM q-bio.SC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present an R-package developed for modeling of biochemical reaction\nnetworks, uncertainty quantification (UQ) and sensitivity analysis (SA).\nEstimating parameters and quantifying their uncertainty (and resulting\nprediction uncertainty), is required for data-driven systems biology modeling.\nSampling methods need to be efficient when confronted with high-dimensional,\ncorrelated parameter distributions. We have developed the UQSA package to be\nfast for this problem class and work well with other tools for modelling. We\naim for simplicity, and part of that is our use of the SBtab format for the\nunified storage of model and data. Our tool-set is modular enough, that parts\ncan be replaced. We use intermediate formats that are not hidden from the user\nto make this feasible. UQ is performed through Markov chain Monte Carlo (MCMC)\nsampling in an Approximate Bayesian Computation (ABC) setting. This can be\nfollowed by a variance-decomposition based global sensitivity analysis. If\nneeded, complex parameter distributions can be described, evaluated, and\nsampled from, with the help of Vine-copulas that are available in R. This\napproach is especially useful when new experimental data become available, and\na previously calibrated model needs to be updated.\n  Implementation: R is a high-level language and allows the use of\nsophisticated statistical methods. The ode solver we used is written in C\n(gsl_odeiv2, interface to R is ours). We use the SBtab tabular format for the\nmodel description, as well as the data and an event system to be able to model\ninputs frequently encountered in systems biology and neuroscience. The code has\nbeen tested on one node with 256 cores of a computing cluster, but smaller\nexamples are included in the repository that can be run on a laptop.\n  Source code: https://github.com/icpm-kth/uqsa\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:12:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kramer","Andrei",""],["Milinanni","Federica",""],["Nyquist","Pierre",""],["Jauhiainen","Alexandra",""],["Eriksson","Olivia",""]]}
{"id":"2308.05528","submitter":"Yang Zhang","authors":"Ning Mao, Nikolai Peshcherenko, and Yang Zhang","title":"Wannier functions, minimal model and charge transfer in\n  Pb$_9$CuP$_6$O$_{25}$","comments":"5+4 pages, 3+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":"  Recent preprints claimed that the copper doped lead apatite\nPb$_9$CuP$_6$O$_{25}$ (LK99) might be a high-temperature superconductor because\nof its strong diamagnetism and transport properties. Motivated by the strongly\ncorrelated effects that can arise from a triangular lattice of Cu atoms with\nnarrow bandwidth, we calculated the maximally projected Wannier functions from\ndensity functional theory simulations, and constructed a minimal two-orbital\ntriangular model with Cu ($3d_{xz},3d_{yz}$) basis, and a four-orbital buckled\nhoneycomb model with Cu ($3d_{xz},3d_{yz}$), O ($2p_x,2p_y$). Since the Coulomb\ninteraction Ud is much larger than potential energy difference between Cu and\nO, charge transfer will occur for hole filling fraction $n_h > 1$. We further\ncalculate the interaction parameters, and discuss the possible insulating state\nand corresponding spin exchange coupling.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:14:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mao","Ning",""],["Peshcherenko","Nikolai",""],["Zhang","Yang",""]]}
{"id":"2308.05529","submitter":"Anna Miriam Benini","authors":"Veronica Beltrami, Anna Miriam Benini, Alberto Saracco","title":"Escaping Fatou components with disjoint hyperbolic limit sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct automorphisms of $\\mathbb{C}^2$ with a cycle of escaping Fatou\ncomponents, on which there are exactly two limit functions, both of rank 1. On\neach such Fatou component, the limit sets for these limit functions are two\ndisjoint hyperbolic subsets of the line at infinity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:15:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Beltrami","Veronica",""],["Benini","Anna Miriam",""],["Saracco","Alberto",""]]}
{"id":"2308.05530","submitter":"Ankit Mahajan","authors":"Ankit Mahajan, Jo S. Kurian, Joonho Lee, David R. Reichman, Sandeep\n  Sharma","title":"Response properties in phaseless auxiliary field quantum Monte Carlo","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method for calculating first-order response properties in\nphaseless auxiliary field quantum Monte Carlo (AFQMC) through the application\nof automatic differentiation (AD). Biases and statistical efficiency of the\nresulting estimators are discussed. Our approach demonstrates that AD enables\nthe calculation of reduced density matrices (RDMs) with the same computational\ncost scaling as energy calculations, accompanied by a cost prefactor of less\nthan four in our numerical calculations. We investigate the role of\nself-consistency and trial orbital choice in property calculations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:17:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mahajan","Ankit",""],["Kurian","Jo S.",""],["Lee","Joonho",""],["Reichman","David R.",""],["Sharma","Sandeep",""]]}
{"id":"2308.05531","submitter":"Igor Yu. Chestnov","authors":"S. Mikkola, V. Shahnazaryan, I. Chestnov, and I. Iorsh","title":"Exciton localization on magnetic domain wall in MoS$_2$-CrI$_3$\n  heterostructure","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The existence of spontaneous magnetization that fingerprints a ground-state\nferromagnetic order was recently observed in two-dimensional (2D) van der Waals\nmaterials. Despite progress in the fabrication and manipulation of the\natom-thick magnets, investigation of nanoscale magnetization properties is\nstill challenging due to the concomitant technical issues. We propose a\npromising approach for a direct visualization of the domain walls formed in 2D\nmagnetic materials. By interfacing 2D magnet with a transition metal\ndichalcogenide (TMD) monolayer, the strong proximity effects enable pinning the\nTMD excitons on the domain wall. The emergent localization stems from the\nproximity-induced exchange mixing between spin-dark and spin-bright TMD\nexcitons due to the local in-plane magnetization characteristic of the domain\nwall in the magnetic monolayer.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:17:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mikkola","S.",""],["Shahnazaryan","V.",""],["Chestnov","I.",""],["Iorsh","I.",""]]}
{"id":"2308.05532","submitter":"R\\'obert Kov\\'acs","authors":"Feh\\'er Anna, Mar\\'oti J\\'anos, Tak\\'acs Don\\'at, Orbulov Imre,\n  Kov\\'acs R\\'obert","title":"Thermal and mechanical properties of AlSi7Mg matrix syntactic foams\n  reinforced by Al$_2$O$_3$ or SiC particles in matrix","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Materials with complex inner structure can be challenging to characterize in\nan effective way. First, it is difficult to determine the representative volume\nfor such a heterogeneous material. Second, the effective material parameters\nsignificantly depend on the structure, and thus on the interface properties. In\nthe present paper, we focus on composite metal foams, and we attempt to\ndetermine the effective thermal parameters. We use the heat pulse experiment to\nstudy its transient thermal response. We observed deviation from Fourier's law,\nand thus we propose an evaluation procedure for such experimental data using\nthe Guyer--Krumhansl heat equation. Furthermore, we studied the effective\nparameters, the specific heat, mass density, thermal conductivity and thermal\ndiffusivity, and we propose a method for deducing a more reliable thermal\ndiffusivity and thermal conductivity based on the transient temperature\nhistory.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:18:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Anna","Feh\u00e9r",""],["J\u00e1nos","Mar\u00f3ti",""],["Don\u00e1t","Tak\u00e1cs",""],["Imre","Orbulov",""],["R\u00f3bert","Kov\u00e1cs",""]]}
{"id":"2308.05533","submitter":"Silvia-Laura Pintea","authors":"Frans de Boer, Jan C. van Gemert, Jouke Dijkstra, Silvia L. Pintea","title":"Is there progress in activity progress prediction?","comments":"Accepted at ICCVw-2023 (AI for Creative Video Editing and\n  Understanding, ICCV workshop 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Activity progress prediction aims to estimate what percentage of an activity\nhas been completed. Currently this is done with machine learning approaches,\ntrained and evaluated on complicated and realistic video datasets. The videos\nin these datasets vary drastically in length and appearance. And some of the\nactivities have unanticipated developments, making activity progression\ndifficult to estimate. In this work, we examine the results obtained by\nexisting progress prediction methods on these datasets. We find that current\nprogress prediction methods seem not to extract useful visual information for\nthe progress prediction task. Therefore, these methods fail to exceed simple\nframe-counting baselines. We design a precisely controlled dataset for activity\nprogress prediction and on this synthetic dataset we show that the considered\nmethods can make use of the visual information, when this directly relates to\nthe progress prediction. We conclude that the progress prediction task is\nill-posed on the currently used real-world datasets. Moreover, to fairly\nmeasure activity progression we advise to consider a, simple but effective,\nframe-counting baseline.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:23:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["de Boer","Frans",""],["van Gemert","Jan C.",""],["Dijkstra","Jouke",""],["Pintea","Silvia L.",""]]}
{"id":"2308.05534","submitter":"Chiara Gaia Magnani","authors":"Chiara G. Magnani, Aldo Solari","title":"Rank tests for outlier detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In novelty detection, the objective is to determine whether the test sample\ncontains any outliers, using a sample of controls (inliers). This involves\nmany-to-one comparisons of individual test points against the control sample. A\nrecent approach applies the Benjamini-Hochberg procedure to the conformal\n$p$-values resulting from these comparisons, ensuring false discovery rate\ncontrol.\n  In this paper, we suggest using Wilcoxon-Mann-Whitney tests for the\ncomparisons and subsequently applying the closed testing principle to derive\npost-hoc confidence bounds for the number of outliers in any subset of the test\nsample. We revisit an elegant result that under a nonparametric alternative\nknown as Lehmann's alternative, Wilcoxon-Mann-Whitney is locally most powerful\namong rank tests. By combining this result with a simple observation, we\ndemonstrate that the proposed procedure is more powerful for the null\nhypothesis of no outliers than the Benjamini-Hochberg procedure applied to\nconformal $p$-values.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:23:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Magnani","Chiara G.",""],["Solari","Aldo",""]]}
{"id":"2308.05535","submitter":"Roman Engelhardt","authors":"Fynn Wolf, Roman Engelhardt, Yunfei Zhang, Florian Dandl and Klaus\n  Bogenberger","title":"Effects of Dynamic and Stochastic Travel Times on the Operation of\n  Mobility-on-Demand Services","comments":"Submitted to 26th IEEE International Conference on Intelligent\n  Transportation Systems ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Mobility-on-Demand (MoD) services have been an active research topic in\nrecent years. Many studies focused on developing control algorithms to supply\nefficient services. To cope with a large search space to solve the underlying\nvehicle routing problem, studies usually apply hard time-constraints on pick-up\nand drop-off while considering static network travel times to reduce\ncomputational time. As travel times in real street networks are dynamic and\nstochastic, assigned routes considered feasible by the control algorithm in one\ntime step might become infeasible in the next. Since once assigned and\nconfirmed, customers should still be part of the solution, damage control is\nnecessary to counteract this effect. In this study, a detailed simulation\nframework for MoD services is coupled with a microscopic traffic simulation to\ncreate dynamic and stochastic travel times, and tested in a case study for\nMunich, Germany. Results showed that the combination of inaccurate travel time\nestimation and damage control strategies for infeasible routes deteriorates the\nperformance of MoD services -- hailing and pooling -- significantly. Moreover,\ncustomers suffer from unreliable pick-up time and travel time estimations.\nAllowing re-assignments of initial vehicle schedules according to updated\nsystem states helps to restore system efficiency and reliability, but only to a\nminor extent.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:28:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wolf","Fynn",""],["Engelhardt","Roman",""],["Zhang","Yunfei",""],["Dandl","Florian",""],["Bogenberger","Klaus",""]]}
{"id":"2308.05536","submitter":"Tiantian He","authors":"Tiantian He, Elinor Thompson, Anna Schroder, Neil P. Oxtoby, Ahmed\n  Abdulaal, Frederik Barkhof, Daniel C. Alexander","title":"A coupled-mechanisms modelling framework for neurodegeneration","comments":"MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.CE q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computational models of neurodegeneration aim to emulate the evolving pattern\nof pathology in the brain during neurodegenerative disease, such as Alzheimer's\ndisease. Previous studies have made specific choices on the mechanisms of\npathology production and diffusion, or assume that all the subjects lie on the\nsame disease progression trajectory. However, the complexity and heterogeneity\nof neurodegenerative pathology suggests that multiple mechanisms may contribute\nsynergistically with complex interactions, meanwhile the degree of contribution\nof each mechanism may vary among individuals. We thus put forward a\ncoupled-mechanisms modelling framework which non-linearly combines the\nnetwork-topology-informed pathology appearance with the process of pathology\nspreading within a dynamic modelling system. We account for the heterogeneity\nof disease by fitting the model at the individual level, allowing the\nepicenters and rate of progression to vary among subjects. We construct a\nBayesian model selection framework to account for feature importance and\nparameter uncertainty. This provides a combination of mechanisms that best\nexplains the observations for each individual from the ADNI dataset. With the\nobtained distribution of mechanism importance for each subject, we are able to\nidentify subgroups of patients sharing similar combinations of apparent\nmechanisms.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:34:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Tiantian",""],["Thompson","Elinor",""],["Schroder","Anna",""],["Oxtoby","Neil P.",""],["Abdulaal","Ahmed",""],["Barkhof","Frederik",""],["Alexander","Daniel C.",""]]}
{"id":"2308.05537","submitter":"EPTCS","authors":"Eben Blaisdell (University of Pennsylvania, USA), Max Kanovich\n  (University College London, UK), Stepan L. Kuznetsov (Steklov Mathematical\n  Institute of RAS, Russia and HSE University, Russia), Elaine Pimentel\n  (University College London, UK), Andre Scedrov (University of Pennsylvania,\n  USA)","title":"Explorations in Subexponential Non-associative Non-commutative Linear\n  Logic","comments":"In Proceedings AMSLO 2023, arXiv:2308.03679","journal-ref":"EPTCS 381, 2023, pp. 4-19","doi":"10.4204/EPTCS.381.3","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a previous work we introduced a non-associative non-commutative logic\nextended by multimodalities, called subexponentials, licensing local\napplication of structural rules. Here, we further explore this system,\nexhibiting a classical one-sided multi-succedent classical analogue of our\nintuitionistic system, following the exponential-free calculi of Buszkowski,\nand de Groote, Lamarche. A large fragment of the intuitionistic calculus is\nshown to embed faithfully into the classical fragment.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 18:34:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Blaisdell","Eben","","University of Pennsylvania, USA"],["Kanovich","Max","","University College London, UK"],["Kuznetsov","Stepan L.","","Steklov Mathematical\n  Institute of RAS, Russia and HSE University, Russia"],["Pimentel","Elaine","","University College London, UK"],["Scedrov","Andre","","University of Pennsylvania,\n  USA"]]}
{"id":"2308.05538","submitter":"Alice Battiston","authors":"Alice Battiston and Rossano Schifanella","title":"On the need to move from a single indicator to a multi-dimensional\n  framework to measure accessibility to urban green","comments":"23 pages (11 main), 5 main figures, 1 main table. Supporting web\n  interface see http://atgreen.hpc4ai.unito.it/","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the recent expansion of urban greening interventions, the definition of\nspatial indicators to measure the provision of urban greenery has become of\npivotal importance in informing the policy-design process. By analyzing the\nstability of the population and area rankings induced by several indicators of\ngreen accessibility for over 1,000 cities worldwide, we investigate the extent\nto which the use of a single metric provides a reliable assessment of green\naccessibility in a city. The results suggest that, due to the complex\ninteraction between the spatial distribution of greenspaces in an urban center\nand its population distribution, the use of a single indicator might lead to\ninsufficient discrimination across areas or subgroups of the population, even\nwhen focusing on one form of green accessibility. From a policy perspective,\nthis indicates the need to switch toward a multi-dimensional framework that is\nable to organically evaluate a range of indicators at once.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:37:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Battiston","Alice",""],["Schifanella","Rossano",""]]}
{"id":"2308.05539","submitter":"Sebastien Roux","authors":"S\\'ebastien Roux, Christophe Arnold, Etienne Carr\\'e, Eli Janzen,\n  James H. Edgard, Camille Maestre, B\\'erang\\`ere Toury, Catherine Journet,\n  Vincent Garnier, Philippe Steyer, Takashi Taniguchi, Kenji Watanabe, Annick\n  Loiseau and Julien Barjon","title":"Surface recombination and out of plane diffusivity of free excitons in\n  hexagonal boron nitride","comments":"Main text : 8 pages, 5 figures. Annexes : 3 pages, 3 figures.\n  Submitted to Physical Review B","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel experimental protocol using Cathodoluminescence\nmeasurements as a function of the electron incident energy to study both\nexciton diffusion in a directional way and surface exciton recombination. Our\napproach overcomes the challenges of anisotropic diffusion and the limited\napplicability of existing methods to the bulk counterparts of 2D materials. The\nprotocol is then applied at room and at cryogenic temperatures to four bulk\nhexagonal boron nitride crystals grown by different synthesis routes. The\nexciton diffusivity depends on the sample quality but not on the temperature,\nindicating it is limited by defect scattering even in the best quality\ncrystals. The lower limit for the diffusivity by phonon scattering is 0.2\ncm$^{2}$.s$^{-1}$. Diffusion lengths were as much as 570 nm. Finally, the\nsurface recombination velocity exceeds 10$^{5}$ cm$^{2}$.s$^{-1}$, at a level\nsimilar to silicon or diamond. This result reveals that surface recombination\ncould strongly limit light-emitting devices based on 2D materials.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:37:25 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 12:58:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Roux","S\u00e9bastien",""],["Arnold","Christophe",""],["Carr\u00e9","Etienne",""],["Janzen","Eli",""],["Edgard","James H.",""],["Maestre","Camille",""],["Toury","B\u00e9rang\u00e8re",""],["Journet","Catherine",""],["Garnier","Vincent",""],["Steyer","Philippe",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Loiseau","Annick",""],["Barjon","Julien",""]]}
{"id":"2308.05540","submitter":"Jianhan Zhao","authors":"Jianhan Zhao, Wei Zhang, Yanyan Liu","title":"An Efficient Construction Method Based on Partial Distance of Polar\n  Codes with Reed-Solomon Kernel","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":"  Polar codes with Reed-Solomon (RS) kernel have great potential in\nnext-generation communication systems due to their high polarization rate. In\nthis paper, we study the polarization characteristics of RS polar codes and\npropose two types of partial orders (POs) for the synthesized channels, which\nare supported by validity proofs. By combining these partial orders, a Partial\nDistance-based Polarization Weight (PDPW) construction method is presented. The\nproposed method achieves comparable performance to Monte-Carlo simulations\nwhile requiring lower complexity. Additionally, a Minimum Polarization Weight\nPuncturing (MPWP) scheme for rate-matching is proposed to enhance its practical\napplicability in communication systems. Simulation results demonstrate that the\nRS polar codes based on the proposed PDPW construction outperform the 3rd\nGeneration Partnership Project (3GPP) NR polar codes in terms of standard code\nperformance and rate-matching performance.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:39:56 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhao","Jianhan",""],["Zhang","Wei",""],["Liu","Yanyan",""]]}
{"id":"2308.05541","submitter":"Corentin Louis","authors":"C. K. Louis, P. Louarn, B. Collet, N. Cl\\'ement, S. Al Saati, J. R.\n  Szalay, V. Hue, L. Lamy, S. Kotsiaros, W. S. Kurth, C. M. Jackman, Y. Wang,\n  M. Blanc, F. Allegrini, J. E. P. Connerney, D. Gershman","title":"Source of radio emissions induced by the Galilean moons Io, Europa and\n  Ganymede: in situ measurements by Juno","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At Jupiter, part of the auroral radio emissions are induced by the Galilean\nmoons Io, Europa and Ganymede. Until now, except for Ganymede, they have been\nonly remotely detected, using ground-based radio-telescopes or electric\nantennas aboard spacecraft. The polar trajectory of the Juno orbiter allows the\nspacecraft to cross the range of magnetic flux tubes which sustain the various\nJupiter-satellite interactions, and in turn to sample in situ the associated\nradio emission regions. In this study, we focus on the detection and the\ncharacterization of radio sources associated with Io, Europa and Ganymede.\nUsing electric wave measurements or radio observations (Juno/Waves), in situ\nelectron measurements (Juno/JADE-E), and magnetic field measurements (Juno/MAG)\nwe demonstrate that the Cyclotron Maser Instability (CMI) driven by a loss-cone\nelectron distribution function is responsible for the encountered radio\nsources. We confirmed that radio emissions are associated with Main (MAW) or\nReflected Alfv\\'en Wing (RAW), but also show that for Europa and Ganymede,\ninduced radio emissions are associated with Transhemispheric Electron Beam\n(TEB). For each traversed radio source, we determine the latitudinal extension,\nthe CMI-resonant electron energy, and the bandwidth of the emission. We show\nthat the presence of Alfv\\'en perturbations and downward field aligned currents\nare necessary for the radio emissions to be amplified.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:40:29 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Louis","C. K.",""],["Louarn","P.",""],["Collet","B.",""],["Cl\u00e9ment","N.",""],["Saati","S. Al",""],["Szalay","J. R.",""],["Hue","V.",""],["Lamy","L.",""],["Kotsiaros","S.",""],["Kurth","W. S.",""],["Jackman","C. M.",""],["Wang","Y.",""],["Blanc","M.",""],["Allegrini","F.",""],["Connerney","J. E. P.",""],["Gershman","D.",""]]}
{"id":"2308.05542","submitter":"Wongi Park","authors":"Wongi Park, Inhyuk Park, Sungeun Kim, Jongbin Ryu","title":"Robust Asymmetric Loss for Multi-Label Long-Tailed Learning","comments":null,"journal-ref":"ICCVW 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In real medical data, training samples typically show long-tailed\ndistributions with multiple labels. Class distribution of the medical data has\na long-tailed shape, in which the incidence of different diseases is quite\nvaried, and at the same time, it is not unusual for images taken from\nsymptomatic patients to be multi-label diseases. Therefore, in this paper, we\nconcurrently address these two issues by putting forth a robust asymmetric loss\non the polynomial function. Since our loss tackles both long-tailed and\nmulti-label classification problems simultaneously, it leads to a complex\ndesign of the loss function with a large number of hyper-parameters. Although a\nmodel can be highly fine-tuned due to a large number of hyper-parameters, it is\ndifficult to optimize all hyper-parameters at the same time, and there might be\na risk of overfitting a model. Therefore, we regularize the loss function using\nthe Hill loss approach, which is beneficial to be less sensitive against the\nnumerous hyper-parameters so that it reduces the risk of overfitting the model.\nFor this reason, the proposed loss is a generic method that can be applied to\nmost medical image classification tasks and does not make the training process\nmore time-consuming. We demonstrate that the proposed robust asymmetric loss\nperforms favorably against the long-tailed with multi-label medical image\nclassification in addition to the various long-tailed single-label datasets.\nNotably, our method achieves Top-5 results on the CXR-LT dataset of the ICCV\nCVAMD 2023 competition. We opensource our implementation of the robust\nasymmetric loss in the public repository: https://github.com/kalelpark/RAL.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:41:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Park","Wongi",""],["Park","Inhyuk",""],["Kim","Sungeun",""],["Ryu","Jongbin",""]]}
{"id":"2308.05543","submitter":"Liang Chen","authors":"Liang Chen, Jiawei Zhang, Zhenhua Li, Yunxuan Wei, Faming Fang, Jimmy\n  Ren, and Jinshan Pan","title":"Deep Richardson-Lucy Deconvolution for Low-Light Image Deblurring","comments":"Accepted by IJCV","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Images taken under the low-light condition often contain blur and saturated\npixels at the same time. Deblurring images with saturated pixels is quite\nchallenging. Because of the limited dynamic range, the saturated pixels are\nusually clipped in the imaging process and thus cannot be modeled by the linear\nblur model. Previous methods use manually designed smooth functions to\napproximate the clipping procedure. Their deblurring processes often require\nempirically defined parameters, which may not be the optimal choices for\ndifferent images. In this paper, we develop a data-driven approach to model the\nsaturated pixels by a learned latent map. Based on the new model, the non-blind\ndeblurring task can be formulated into a maximum a posterior (MAP) problem,\nwhich can be effectively solved by iteratively computing the latent map and the\nlatent image. Specifically, the latent map is computed by learning from a map\nestimation network (MEN), and the latent image estimation process is\nimplemented by a Richardson-Lucy (RL)-based updating scheme. To estimate\nhigh-quality deblurred images without amplified artifacts, we develop a prior\nestimation network (PEN) to obtain prior information, which is further\nintegrated into the RL scheme. Experimental results demonstrate that the\nproposed method performs favorably against state-of-the-art algorithms both\nquantitatively and qualitatively on synthetic and real-world images.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:53:30 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Liang",""],["Zhang","Jiawei",""],["Li","Zhenhua",""],["Wei","Yunxuan",""],["Fang","Faming",""],["Ren","Jimmy",""],["Pan","Jinshan",""]]}
{"id":"2308.05544","submitter":"Yi Yang","authors":"Yi Yang, Dong Liu, Ali \\\"Ovg\\\"un, Gaetano Lambiase, and Zheng-Wen Long","title":"Black hole surrounded by the pseudo-isothermal dark matter halo","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The abundance of dark matter in the actual universe motivates us to construct\nthe black hole spacetime enveloped by dark matter. In this paper, we derive a\nnew spherically symmetric black hole surrounded by the pseudo-isothermal dark\nmatter halo, and then explore the effects of the pseudo-isothermal halo profile\non a rotating black hole at the M87 galactic center, aiming to achieve a black\nhole solution that aligns with those found in the real universe. Using the\nNewman-Janis method, we derive a rotating black hole solution encompassed by\nthe pseudo-isothermal halo, which is consistent with observations of actual\nblack holes that are believed to possess spin. Our investigation focuses on the\nimpact of the pseudo-isothermal halo on the black hole event horizon, time-like\nand null orbits, as well as the black hole shadow. We find that as the spin\nparameter $a$ increases, the interval between the inner event horizon and the\nouter event horizon of the rotating black hole surrounded by the\npseudo-isothermal halo in M87 diminishes. This leads to the formation of an\nextreme black hole. The presence of dark matter, however, has minimal effect on\nthe event horizon. Moreover, in the M87 as the spin parameter $a$ increases,\nthe black hole shadow deviates increasingly from a standard circle, with larger\nspin parameters causing more pronounced distortion relative to the standard\ncircle. Surprisingly, we observe that the dark matter density has very little\ninfluence on the shadow of the black hole surrounded by the pseudo-isothermal\nhalo in the M87. This study contributes to a deeper understanding of black hole\nstructures and the role of dark matter in the universe.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:53:47 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 13:52:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yang","Yi",""],["Liu","Dong",""],["\u00d6vg\u00fcn","Ali",""],["Lambiase","Gaetano",""],["Long","Zheng-Wen",""]]}
{"id":"2308.05545","submitter":"Saurabh Kumar","authors":"Saurabh Kumar, Akhil Uniyal, Sayan Chakrabarti","title":"Shadow and Weak Gravitational lensing of rotating traversable Wormhole\n  in Non-homogeneous Plasma Space-time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we have studied the behavior of null geodesics within a\nrotating wormhole space-time in non-magnetized pressure-less plasma. By\nfocusing on the dispersion relation of the plasma and disregarding its direct\ngravitational effects, we examine how light rays traverse in the mentioned\nspace-time. A key highlight of the work is the necessity of a specific plasma\ndistribution profile to establish a generalized Carter's constant, shedding\nlight on the importance of this parameter. Furthermore, we have derived\nanalytical formulas to distinguish the shadow boundary across various plasma\nprofiles, uncovering a fascinating trend of diminishing shadow size as plasma\ndensity increases. Intriguingly, certain limits of the plasma parameters result\nin the complete disappearance of the shadow. When calculating the deflection\nangle by a wormhole in plasma space-time, we observe a distinct pattern: the\nangle decreases as the plasma parameter rises in non-homogeneous plasma\nspace-time, diverging from the behavior observed in homogeneous plasma\nspace-time. Also, leveraging observational data from M$87^{\\ast}$, we establish\nconstraints on the throat radius. Furthermore, minimum shadow diameters provide\nvaluable constraints for the radial and latitudinal plasma parameters.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:55:18 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 07:46:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kumar","Saurabh",""],["Uniyal","Akhil",""],["Chakrabarti","Sayan",""]]}
{"id":"2308.05546","submitter":"Xiangyu Pi","authors":"Xiangyu Pi, Lipeng Zhu, Zhenyu Xiao and Rui Zhang","title":"Multiuser Communications with Movable-Antenna Base Station Via Antenna\n  Position Optimization","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":"  This paper studies the deployment of multiple movable antennas (MAs) at the\nbase station (BS) for enhancing the multiuser communication performance. First,\nwe model the multiuser channel in the uplink to characterize the wireless\nchannel variation caused by MAs' movement at the BS. Then, an optimization\nproblem is formulated to maximize the minimum achievable rate among multiple\nusers for MA-aided uplink multiuser communications by jointly optimizing the\nMAs' positions, their receive combining at the BS, and the transmit power of\nusers, under the constraints of finite moving region of MAs, minimum inter-MA\ndistance, and maximum transmit power of each user. To solve this challenging\nnon-convex optimization problem, a two-loop iterative algorithm is proposed by\nleveraging the particle swarm optimization (PSO) method. Specifically, the\nouter-loop updates the positions of a set of particles, where each particle's\nposition represents one realization of the antenna positioning vector (APV) of\nall MAs. The inner-loop implements the fitness evaluation for each particle in\nterms of the max-min achievable rate of multiple users with its corresponding\nAPV, where the receive combining matrix of the BS and the transmit power of\neach user are optimized by applying the block coordinate descent (BCD)\ntechnique. Simulation results show that the antenna position optimization for\nMAs-aided BS can significantly improve the rate performance as compared to\nconventional BS with fixed-position antennas (FPAs).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:55:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pi","Xiangyu",""],["Zhu","Lipeng",""],["Xiao","Zhenyu",""],["Zhang","Rui",""]]}
{"id":"2308.05547","submitter":"Pierre Nicolay","authors":"Pierre Nicolay, Yvan Petillot, Mykhaylo Marfeychuk, Sen Wang, Ignacio\n  Carlucho","title":"Enhancing AUV Autonomy With Model Predictive Path Integral Control","comments":"10 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous underwater vehicles (AUVs) play a crucial role in surveying marine\nenvironments, carrying out underwater inspection tasks, and ocean exploration.\nHowever, in order to ensure that the AUV is able to carry out its mission\nsuccessfully, a control system capable of adapting to changing environmental\nconditions is required. Furthermore, to ensure the robotic platform's safe\noperation, the onboard controller should be able to operate under certain\nconstraints. In this work, we investigate the feasibility of Model Predictive\nPath Integral Control (MPPI) for the control of an AUV. We utilise a non-linear\nmodel of the AUV to propagate the samples of the MPPI, which allow us to\ncompute the control action in real time. We provide a detailed evaluation of\nthe effect of the main hyperparameters on the performance of the MPPI\ncontroller. Furthermore, we compared the performance of the proposed method\nwith a classical PID and Cascade PID approach, demonstrating the superiority of\nour proposed controller. Finally, we present results where environmental\nconstraints are added and show how MPPI can handle them by simply incorporating\nthose constraints in the cost function.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:55:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nicolay","Pierre",""],["Petillot","Yvan",""],["Marfeychuk","Mykhaylo",""],["Wang","Sen",""],["Carlucho","Ignacio",""]]}
{"id":"2308.05548","submitter":"Jayanth Mohan","authors":"Aadharsh Aadhithya A, Abinesh S, Akshaya J, Jayanth M, Vishnu\n  Radhakrishnan, Sowmya V, Soman K.P","title":"Learning (With) Distributed Optimization","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper provides an overview of the historical progression of distributed\noptimization techniques, tracing their development from early duality-based\nmethods pioneered by Dantzig, Wolfe, and Benders in the 1960s to the emergence\nof the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN)\nalgorithm. The initial focus on Lagrangian relaxation for convex problems and\ndecomposition strategies led to the refinement of methods like the Alternating\nDirection Method of Multipliers (ADMM). The resurgence of interest in\ndistributed optimization in the late 2000s, particularly in machine learning\nand imaging, demonstrated ADMM's practical efficacy and its unifying potential.\nThis overview also highlights the emergence of the proximal center method and\nits applications in diverse domains. Furthermore, the paper underscores the\ndistinctive features of ALADIN, which offers convergence guarantees for\nnon-convex scenarios without introducing auxiliary variables, differentiating\nit from traditional augmentation techniques. In essence, this work encapsulates\nthe historical trajectory of distributed optimization and underscores the\npromising prospects of ALADIN in addressing non-convex optimization challenges.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:59:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["A","Aadharsh Aadhithya",""],["S","Abinesh",""],["J","Akshaya",""],["M","Jayanth",""],["Radhakrishnan","Vishnu",""],["V","Sowmya",""],["P","Soman K.",""]]}
{"id":"2308.05549","submitter":"Chanh-Duc Ngo","authors":"Chanh-Duc Ngo, Fabrizio Pastore, Lionel Briand","title":"Testing Updated Apps by Adapting Learned Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although App updates are frequent and software engineers would like to verify\nupdated features only, automated testing techniques verify entire Apps and are\nthus wasting resources. We present Continuous Adaptation of Learned Models\n(CALM), an automated App testing approach that efficiently tests App updates by\nadapting App models learned when automatically testing previous App versions.\nCALM focuses on functional testing. Since functional correctness can be mainly\nverified through the visual inspection of App screens, CALM minimizes the\nnumber of App screens to be visualized by software testers while maximizing the\npercentage of updated methods and instructions exercised. Our empirical\nevaluation shows that CALM exercises a significantly higher proportion of\nupdated methods and instructions than six state-of-the-art approaches, for the\nsame maximum number of App screens to be visually inspected. Further, in common\nupdate scenarios, where only a small fraction of methods are updated, CALM is\neven quicker to outperform all competing approaches in a more significant way.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 12:59:24 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ngo","Chanh-Duc",""],["Pastore","Fabrizio",""],["Briand","Lionel",""]]}
{"id":"2308.05550","submitter":"Yan Li","authors":"Xuehan Bai, Yan Li, Yanhua Cheng, Wenjie Yang, Quan Chen, Han Li","title":"Cross-Domain Product Representation Learning for Rich-Content E-Commerce","comments":"ICCV23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proliferation of short video and live-streaming platforms has\nrevolutionized how consumers engage in online shopping. Instead of browsing\nproduct pages, consumers are now turning to rich-content e-commerce, where they\ncan purchase products through dynamic and interactive media like short videos\nand live streams. This emerging form of online shopping has introduced\ntechnical challenges, as products may be presented differently across various\nmedia domains. Therefore, a unified product representation is essential for\nachieving cross-domain product recognition to ensure an optimal user search\nexperience and effective product recommendations. Despite the urgent industrial\nneed for a unified cross-domain product representation, previous studies have\npredominantly focused only on product pages without taking into account short\nvideos and live streams. To fill the gap in the rich-content e-commerce area,\nin this paper, we introduce a large-scale cRoss-dOmain Product Ecognition\ndataset, called ROPE. ROPE covers a wide range of product categories and\ncontains over 180,000 products, corresponding to millions of short videos and\nlive streams. It is the first dataset to cover product pages, short videos, and\nlive streams simultaneously, providing the basis for establishing a unified\nproduct representation across different media domains. Furthermore, we propose\na Cross-dOmain Product rEpresentation framework, namely COPE, which unifies\nproduct representations in different domains through multimodal learning\nincluding text and vision. Extensive experiments on downstream tasks\ndemonstrate the effectiveness of COPE in learning a joint feature space for all\nproduct domains.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:06:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bai","Xuehan",""],["Li","Yan",""],["Cheng","Yanhua",""],["Yang","Wenjie",""],["Chen","Quan",""],["Li","Han",""]]}
{"id":"2308.05551","submitter":"Anton Selivanov","authors":"Anton Selivanov, Emilia Fridman","title":"Disturbance attenuation in the Euler-Bernoulli beam using piezoelectric\n  actuators","comments":"This paper was submitted for publication in Automatica. The\n  preliminary version of the paper was accepted for presentation at IEEE\n  Conference on Decision and Control 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a simply-supported Euler-Bernoulli beam with viscous and\nKelvin-Voigt damping. Our objective is to attenuate the effect of an unknown\ndistributed disturbance using one piezoelectric actuator. We show how to design\na suitable $H_\\infty$ state-feedback controller based on a finite number of\ndominating modes. If the remaining (infinitely many) modes are ignored, the\ncalculated $L^2$ gain is wrong. This happens because of the spillover\nphenomenon that occurs when the effect of the control on truncated modes is not\naccounted for in the feedback design. We propose a simple modification of the\n$H_\\infty$ cost that prevents spillover. The key idea is to treat the control\nas a disturbance in the truncated modes and find the corresponding $L^2$ gains\nusing the bounded real lemma. These $L^2$ gains are added to the control weight\nin the $H_\\infty$ cost for the dominating modes, which prevents spillover. A\nnumerical simulation of an aluminum beam with realistic parameters demonstrates\nthe effectiveness of the proposed method.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:06:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Selivanov","Anton",""],["Fridman","Emilia",""]]}
{"id":"2308.05552","submitter":"Mohammed Siddique Akbar Dalwale","authors":"Siddique Dalwale, M. Sait \\\"Ozer, Sebastian Merchel, M. Ercan Altinsoy","title":"3D Modeling of a Guitar Using a Computer Tomography Scan","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper describes the development of a detailed 3D geometric model of an\nacoustical guitar. Modeling an instrument is a sophisticated task considering\nthe individual parts and their complex shapes. The geometry of the parts\nvisible from the outside can be measured using appropriate tools, but it is\nvery difficult to measure the details of the internal parts like bracing,\nheels, and other features by hand through the sound hole. Otherwise, it would\nbe necessary to disassemble the guitar to measure the precise position and\ndimensions of the parts inside it. Reassembling the guitar could result in\nimproper functioning. To avoid damaging the instrument by disassembling or\ntaking inaccurate measurements through the sound hole, a computer tomography\n(CT) scan of the guitar body was performed. Using this method, cross-sectional\nimages of the guitar body in all the three dimensions were extracted with 1 mm\nspacing between adjacent images. In total, approximately 2000 images were\ngenerated and used in developing the geometric model of the guitar. The 3D\nmodel will be further used to develop a vibro-acoustic simulation model of the\nguitar\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:07:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dalwale","Siddique",""],["\u00d6zer","M. Sait",""],["Merchel","Sebastian",""],["Altinsoy","M. Ercan",""]]}
{"id":"2308.05553","submitter":"Yair Hayut","authors":"Yair Hayut","title":"Prikry type forcings and the Bukovsk\\'y-Dehornoy phenomena","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is meant to present in a coherent way several instances of quite\ncommon phenomena that was first identified (independently) by Bukovsk\\'y and\nDehornoy. We present the basic result for Prikry type forcing and show how to\nextend it to the Gitik-Shraon forcing, the Extender Based Prikry forcing,\nPrikry forcings with interleaved collapses and Radin forcing for $o(\\kappa) <\n\\kappa^+$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:08:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hayut","Yair",""]]}
{"id":"2308.05554","submitter":"Hiroki Kusudo","authors":"Hiroki Kusudo, Takeshi Omori, Laurent Joly and Yasutaka Yamaguchi","title":"The receding contact line cools down during dynamic wetting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When a contact line (CL) -- where a liquid-vapor interface meets a substrate\n-- is put into motion, it is well known that the contact angle differs between\nadvancing and receding CLs. Using non-equilibrium molecular dynamics\nsimulations, we reveal another intriguing distinction between advancing and\nreceding CLs: while temperature increases at an advancing CL -- as expected\nfrom viscous dissipation, we show that temperature can drop at a receding CL.\nDetailed quantitative analysis based on the macroscopic energy balance around\nthe dynamic CL showed that the internal energy change of the fluid along the\npathline induced a remarkable temperature drop around the receding CL, in a\nmanner similar to latent heat upon phase changes. This result provides new\ninsights for modeling the dynamic CL, and the framework for heat transport\nanalysis introduced here can be applied to a wide range of nanofluidic systems.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:09:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kusudo","Hiroki",""],["Omori","Takeshi",""],["Joly","Laurent",""],["Yamaguchi","Yasutaka",""]]}
{"id":"2308.05555","submitter":"Joris Barrat","authors":"J. Barrat, A. F. Tzortzakakis, M. Niu, X. Zhou, G.G. Paschos, D.\n  Petrosyan, P.G. Savvidis","title":"Superfluid Polaritonic Qubit in an Annular Trap","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.pop-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the experimental realization and characterization of an\nexciton-polariton qubit prototype. In our system, a Bose-Einstein condensate of\nsemiconductor exciton-polaritons is confined by a spatially-patterned pump\nlaser in an annular trap that supports energy-degenerate circulating currents\nof the polariton superfluid. Using non-invasive temporal interference\nmeasurements, we observe coherent oscillations between a pair of\ncounter-circulating superfluid vortex states of the polaritons coupled by\nelastic scattering off the laser-imprinted potential. The qubit basis states\ncorrespond to the symmetric and antisymmetric superpositions of the two vortex\nstates forming orthogonal double-lobe spatial wavefunctions. By engineering the\npotential, we tune the coupling and coherent oscillations between the two\ncirculating current states, control the energies of the qubit basis states and\nthereby initialize the qubit in the desired state. The dynamics of the system\nis accurately reproduced by our theoretical two-state model, and we discuss\npotential avenues to achieve complete control over our polaritonic qubit and\nimplement controllable interactions and quantum gates between such qubits.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:13:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Barrat","J.",""],["Tzortzakakis","A. F.",""],["Niu","M.",""],["Zhou","X.",""],["Paschos","G. G.",""],["Petrosyan","D.",""],["Savvidis","P. G.",""]]}
{"id":"2308.05556","submitter":"Alex Fink","authors":"Alex Fink, Jorge Alberto Olarte","title":"Extensions of transversal valuated matroids","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Following up on our previous work, we study single-element extensions of\ntransversal valuated matroids. We show that tropical presentations of valuated\nmatroids with a minimal set of finite entries enjoy counterparts of the\nproperties proved by Bonin and de Mier of minimal non-valuated transversal\npresentations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:13:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fink","Alex",""],["Olarte","Jorge Alberto",""]]}
{"id":"2308.05557","submitter":"David Koisser","authors":"David Koisser and Ahmad-Reza Sadeghi","title":"Accountability of Things: Large-Scale Tamper-Evident Logging for Smart\n  Devices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our modern world relies on a growing number of interconnected and interacting\ndevices, leading to a plethora of logs establishing audit trails for all kinds\nof events. Simultaneously, logs become increasingly important for forensic\ninvestigations, and thus, an adversary will aim to alter logs to avoid\nculpability, e.g., by compromising devices that generate and store logs. Thus,\nit is essential to ensure that no one can tamper with any logs without going\nundetected. However, existing approaches to establish tamper evidence of logs\ndo not scale and cannot protect the increasingly large number of devices found\ntoday, as they impose large storage or network overheads. Additionally, most\nschemes do not provide an efficient mechanism to prove that individual events\nhave been logged to establish accountability when different devices interact.\n  This paper introduces a novel scheme for practical large-scale tamper-evident\nlogging with the help of a trusted third party. To achieve this, we present a\nnew binary hash tree construction designed around timestamps to achieve\nconstant storage overhead with a configured temporal resolution. Additionally,\nour design enables the efficient construction of shareable proofs, proving that\nan event was indeed logged. Our evaluation shows that - using practical\nparameters - our scheme can localize any tampering of logs with a sub-second\nresolution, with a constant overhead of ~8KB per hour per device.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:18:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Koisser","David",""],["Sadeghi","Ahmad-Reza",""]]}
{"id":"2308.05558","submitter":"Mounika Vanamala","authors":"Mounika Vanamala, Sean Loesch and Alexander Caravella","title":"Using Machine Learning To Identify Software Weaknesses From Software\n  Requirement Specifications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Secure software engineering is crucial but can be time-consuming; therefore,\nmethods that could expedite the identification of software weaknesses without\nreducing the process efficacy would benefit the software engineering industry\nand thus benefit modern life. This research focuses on finding an efficient\nmachine learning algorithm to identify software weaknesses from requirement\nspecifications. The research uses the CWE repository and PROMISE exp dataset\nfor training. Keywords extracted using latent semantic analysis help map the\nCWE categories to PROMISE_exp. Naive Bayes, support vector machine (SVM),\ndecision trees, neural network, and convolutional neural network (CNN)\nalgorithms were tested, with SVM and neural network producing reliable results.\nThe research is unique contribution lies in the mapping technique and algorithm\nselection. It serves as a valuable reference for the secure software\nengineering community seeking to expedite the development lifecycle without\ncompromising efficacy. Future work involves testing more algorithms, optimizing\nexisting ones, and improving the training sets accuracy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:19:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Vanamala","Mounika",""],["Loesch","Sean",""],["Caravella","Alexander",""]]}
{"id":"2308.05559","submitter":"Bin Guo","authors":"Jingya Chen, Bin Guo, Baisheng Yan","title":"On higher integrability for $p(x)$-Laplacian equations with drift","comments":null,"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 study the higher integrability for the gradient of weak\nsolutions of $p(x)$-Laplacians equation with drift terms. We prove a version of\ngeneralized Gehring's lemma under some weaker condition on the modulus of\ncontinuity of variable exponent $p(x)$ and present a modified version of\nSobolev-Poincar\\'{e} inequality with such an exponent. When $p(x)>2$ we derive\nthe reverse H\\\"older inequality with a proper dependence on the drift and force\nterms and establish a specific high integrability result. Our condition on the\nexponent $p(x)$ is more specific and weaker than the known conditions and our\nresults extend some results on the $p(x)$-Laplacian equations without drift\nterms.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:19:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Jingya",""],["Guo","Bin",""],["Yan","Baisheng",""]]}
{"id":"2308.05560","submitter":"Sohail Farhangi","authors":"Sohail Farhangi","title":"Van der Corput's difference theorem for amenable groups and the left\n  regular representation","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.RT math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish a connection between two variants of van der Corput's Difference\nTheorem (vdCDT) for second countable amenable groups $G$ and the ergodic\nhierarchy of mixing properties of a unitary representation $U$ of $G$. In\nparticular, we show that one variant of vdCDT corresponds to subrepresentations\nof the left regular representation, and another variant of vdCDT corresponds to\nthe absence of finite dimensional subrepresentations. We then obtain\napplications for measure preserving actions of countable abelian groups.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:21:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Farhangi","Sohail",""]]}
{"id":"2308.05561","submitter":"Mateusz Michalek","authors":"Austin Conner, Kangjin Han, Mateusz Micha{\\l}ek","title":"Sullivant-Talaska ideal of the cyclic Gaussian Graphical Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.CO math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we settle a conjecture due to Sturmfels and Uhler concerning\ngeneration of the prime ideal of the variety associated to the Gaussian\ngraphical model of any cycle graph. Our methods are general and applicable to a\nlarge class of ideals with radical initial ideals.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:21:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Conner","Austin",""],["Han","Kangjin",""],["Micha\u0142ek","Mateusz",""]]}
{"id":"2308.05562","submitter":"Arie Levit","authors":"Arie Levit, Raz Slutsky and Itamar Vigdorovich","title":"Spectral gap and character limits in arithmetic groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish vanishing results for limits of characters in various discrete\ngroups, most notably irreducible lattices in higher rank semisimple Lie groups.\nThis is achieved by studying the geometry of the simplex of traces of discrete\ngroups having Kazhdan's property (T) or its relative generalizations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:24:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Levit","Arie",""],["Slutsky","Raz",""],["Vigdorovich","Itamar",""]]}
{"id":"2308.05563","submitter":"Mounika Vanamala","authors":"Natalie Krueger, Dr. Mounika Vanamala, Dr. Rushit Dave","title":"Recent Advancements In The Field Of Deepfake Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A deepfake is a photo or video of a person whose image has been digitally\naltered or partially replaced with an image of someone else. Deepfakes have the\npotential to cause a variety of problems and are often used maliciously. A\ncommon usage is altering videos of prominent political figures and celebrities.\nThese deepfakes can portray them making offensive, problematic, and/or untrue\nstatements. Current deepfakes can be very realistic, and when used in this way,\ncan spread panic and even influence elections and political opinions. There are\nmany deepfake detection strategies currently in use but finding the most\ncomprehensive and universal method is critical. So, in this survey we will\naddress the problems of malicious deepfake creation and the lack of universal\ndeepfake detection methods. Our objective is to survey and analyze a variety of\ncurrent methods and advances in the field of deepfake detection.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:24:27 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Krueger","Natalie",""],["Vanamala","Dr. Mounika",""],["Dave","Dr. Rushit",""]]}
{"id":"2308.05564","submitter":"Michael Smith","authors":"Lin Deng, Michael Stanley Smith, Worapree Maneesoonthorn","title":"Efficient Variational Inference for Large Skew-t Copulas with\n  Application to Intraday Equity Returns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM cs.LG q-fin.ST stat.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Large skew-t factor copula models are attractive for the modeling of\nfinancial data because they allow for asymmetric and extreme tail dependence.\nWe show that the copula implicit in the skew-t distribution of Azzalini and\nCapitanio (2003) allows for a higher level of pairwise asymmetric dependence\nthan two popular alternative skew-t copulas. Estimation of this copula in high\ndimensions is challenging, and we propose a fast and accurate Bayesian\nvariational inference (VI) approach to do so. The method uses a conditionally\nGaussian generative representation of the skew-t distribution to define an\naugmented posterior that can be approximated accurately. A fast stochastic\ngradient ascent algorithm is used to solve the variational optimization. The\nnew methodology is used to estimate copula models for intraday returns from\n2017 to 2021 on 93 U.S. equities. The copula captures substantial heterogeneity\nin asymmetric dependence over equity pairs, in addition to the variability in\npairwise correlations. We show that intraday predictive densities from the\nskew-t copula are more accurate than from some other copula models, while\nportfolio selection strategies based on the estimated pairwise tail\ndependencies improve performance relative to the benchmark index.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:24:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Deng","Lin",""],["Smith","Michael Stanley",""],["Maneesoonthorn","Worapree",""]]}
{"id":"2308.05565","submitter":"Oladipupo Akinyemi","authors":"Oladipupo Akinyemi, Rejwan Sulaiman and Nasr Abosata","title":"Analysis of the LockBit 3.0 and its infiltration into Advanced's\n  infrastructure crippling NHS services","comments":"4 pages and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The LockBit 3.0 ransomware variant is arguably the most threatening of\nmalware in recent times. With no regard for a victim's industry, the ransomware\nhas undergone several evolutions to arrive at an adaptable and evasive variant\nwhich has been a menace to governments and organisations, recently infiltrating\nAdvanced Computer Software group. Previous LockBit studies mostly concentrated\non measuring the impact of the ransomware attack, prevention, encryption\ndetection, decryption, or data recovery, thereby providing little or no benefit\nto the less tech savvy populace as a detailed breakdown of the mode of attack\nis rarely examined. This article analyses the LockBit 3.0 attack techniques\nwith a contextual illustration of the attack on Advanced Computer Software\ngroup. With the NHS being a major client of the organisation, and its services\nalongside 15 other clients being crippled for hours during the attack,\nattention is drawn to how dreadful such disruption may be in critical\norganisations. We observed that the upgrade of Lockbit based on releasing newer\nversions is in a bid to continuously ensure the malware's efficiency - a virtue\nthat keeps it at the zenith - by staying ahead of improved defenses. Our study\nhighlights social engineering as a vibrant portal to Lockbit's maliciousness\nand indicates an investment in detection systems may profit more than in\nprevention systems. Therefore, further research should consider improving\ndetection systems against Lockbit 3.0.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:28:38 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Akinyemi","Oladipupo",""],["Sulaiman","Rejwan",""],["Abosata","Nasr",""]]}
{"id":"2308.05566","submitter":"Oleksandr Shchur","authors":"Oleksandr Shchur, Caner Turkmen, Nick Erickson, Huibin Shen, Alexander\n  Shirkov, Tony Hu, Yuyang Wang","title":"AutoGluon-TimeSeries: AutoML for Probabilistic Time Series Forecasting","comments":"Published at AutoML Conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce AutoGluon-TimeSeries - an open-source AutoML library for\nprobabilistic time series forecasting. Focused on ease of use and robustness,\nAutoGluon-TimeSeries enables users to generate accurate point and quantile\nforecasts with just 3 lines of Python code. Built on the design philosophy of\nAutoGluon, AutoGluon-TimeSeries leverages ensembles of diverse forecasting\nmodels to deliver high accuracy within a short training time.\nAutoGluon-TimeSeries combines both conventional statistical models,\nmachine-learning based forecasting approaches, and ensembling techniques. In\nour evaluation on 29 benchmark datasets, AutoGluon-TimeSeries demonstrates\nstrong empirical performance, outperforming a range of forecasting methods in\nterms of both point and quantile forecast accuracy, and often even improving\nupon the best-in-hindsight combination of prior methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:28:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shchur","Oleksandr",""],["Turkmen","Caner",""],["Erickson","Nick",""],["Shen","Huibin",""],["Shirkov","Alexander",""],["Hu","Tony",""],["Wang","Yuyang",""]]}
{"id":"2308.05567","submitter":"Pan Liang","authors":"Pan Liang, Danwei Ye, Zihao Zhu, Yunchao Wang, Wang Xia, Ronghua\n  Liang, and Guodao Sun","title":"C5: Towards Better Conversation Comprehension and Contextual Continuity\n  for ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs), such as ChatGPT, have demonstrated outstanding\nperformance in various fields, particularly in natural language understanding\nand generation tasks. In complex application scenarios, users tend to engage in\nmulti-turn conversations with ChatGPT to keep contextual information and obtain\ncomprehensive responses. However, human forgetting and model contextual\nforgetting remain prominent issues in multi-turn conversation scenarios, which\nchallenge the users' conversation comprehension and contextual continuity for\nChatGPT. To address these challenges, we propose an interactive conversation\nvisualization system called C5, which includes Global View, Topic View, and\nContext-associated Q\\&A View. The Global View uses the GitLog diagram metaphor\nto represent the conversation structure, presenting the trend of conversation\nevolution and supporting the exploration of locally salient features. The Topic\nView is designed to display all the question and answer nodes and their\nrelationships within a topic using the structure of a knowledge graph, thereby\ndisplay the relevance and evolution of conversations. The Context-associated\nQ\\&A View consists of three linked views, which allow users to explore\nindividual conversations deeply while providing specific contextual information\nwhen posing questions. The usefulness and effectiveness of C5 were evaluated\nthrough a case study and a user study.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:29:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liang","Pan",""],["Ye","Danwei",""],["Zhu","Zihao",""],["Wang","Yunchao",""],["Xia","Wang",""],["Liang","Ronghua",""],["Sun","Guodao",""]]}
{"id":"2308.05568","submitter":"Kazuki Tokuda","authors":"Kazuki Tokuda, Naoto Harada, Kei E. I. Tanaka, Tsuyoshi Inoue, Takashi\n  Shimonishi, Yichen Zhang, Marta Sewi{\\l}o, Yuri Kunitoshi, Ayu Konishi, Yasuo\n  Fukui, Akiko Kawamura, Toshikazu Onishi, Masahiro N. Machida","title":"An ALMA Glimpse of Dense Molecular Filaments Associated with High-mass\n  Protostellar Systems in the Large Magellanic Cloud","comments":"21 pages, 8 figures, 4 tables, 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":"  Recent millimeter/sub-millimeter facilities have revealed the physical\nproperties of filamentary molecular clouds in relation to high-mass star\nformation. A uniform survey of the nearest, face-on star-forming galaxy, the\nLarge Magellanic Cloud (LMC), complements the Galactic knowledge. We present\nALMA survey data with a spatial resolution of $\\sim$0.1 pc in the 0.87 mm\ncontinuum and HCO$^{+}$(4-3) emission toward 30 protostellar objects with\nluminosities of 10$^4$-10$^{5.5}$ $L_{\\odot}$ in the LMC. The spatial\ndistributions of the HCO$^{+}$(4-3) line and thermal dust emission are well\ncorrelated, indicating that the line effectively traces dense, filamentary gas\nwith an H$_2$ volume density of $\\gtrsim$10$^5$ cm$^{-3}$ and a line mass of\n$\\sim$10$^3$-10$^{4}$ $M_{\\odot}$ pc$^{-1}$. Furthermore, we obtain an increase\nin the velocity linewidths of filamentary clouds, which follows a power-law\ndependence on their H$_2$ column densities with an exponent of $\\sim$0.5. This\ntrend is consistent with observations toward filamentary clouds in nearby\nstar-forming regions withiin $ \\lesssim$1 kpc from us and suggests enhanced\ninternal turbulence within the filaments owing to surrounding gas accretion.\nAmong the 30 sources, we find that 14 are associated with hub-filamentary\nstructures, and these complex structures predominantly appear in protostellar\nluminosities exceeding $\\sim$5 $\\times$10$^4$ $L_{\\odot}$. The hub-filament\nsystems tend to appear in the latest stages of their natal cloud evolution,\noften linked to prominent H$\\;${\\sc ii} regions and numerous stellar clusters.\nOur preliminary statistics suggest that the massive filaments accompanied by\nhub-type complex features may be a necessary intermediate product in forming\nextremely luminous high-mass stellar systems capable of ultimately dispersing\nthe parent cloud.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:30:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Tokuda","Kazuki",""],["Harada","Naoto",""],["Tanaka","Kei E. I.",""],["Inoue","Tsuyoshi",""],["Shimonishi","Takashi",""],["Zhang","Yichen",""],["Sewi\u0142o","Marta",""],["Kunitoshi","Yuri",""],["Konishi","Ayu",""],["Fukui","Yasuo",""],["Kawamura","Akiko",""],["Onishi","Toshikazu",""],["Machida","Masahiro N.",""]]}
{"id":"2308.05569","submitter":"Donald Weingarten","authors":"Don Weingarten","title":"Vacuum Branching, Dark Energy, Dark Matter","comments":"found a problem - no longer believe there is a reasonable chance main\n  punchline correct - previous paper, 2105.04545, however, remains correct","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beginning with the Everett-DeWitt many-worlds interpretation of quantum\nmechanics, there have been a series of proposals for how the state vector of a\nquantum system might split at any instant into orthogonal branches, each of\nwhich exhibits approximately classical behavior. In an earlier version of the\npresent work, we proposed a decomposition of a state vector into branches by\nfinding the minimum of a measure of the mean squared quantum complexity of the\nbranches in the branch decomposition. With respect to a particular Lorentz\nframe, for a system beginning in a state of low complexity, branching occurs\nrepeatedly over time with each branch splitting successively into further\nsub-branches among which the branch followed by the real world is chosen\naccording to the Born rule. Alternatively, in an explicitly Lorentz covariant\nformulation, the real world is a single random draw from the set of branches at\nasymptotically late time, which can then be restored to finite time in a\nparticular Lorentz frame by sequentially retracing the set of branching events\nimplied by the late time choice. In the present article, we adapt the earlier\nformulation to quantum electrodynamics in temporal gauge on a lattice in\nMinkowski space. The earlier version, however, here is simplified by replacing\na definition of complexity based on the physical vacuum with a definition based\non the bare vacuum. As a consequence of this replacement, the physical vacuum\nitself is predicted to branch yielding branches with energy densities slightly\nlarger than that of the unbranched vacuum. If the vacuum energy renormalization\nconstant is chosen as usual to give 0 energy density to the unbranched vacuum,\nvacuum branches will appear to have a combination of dark energy and dark\nmatter densities but no additional particle content.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:32:52 GMT"},{"version":"v2","created":"Sun, 13 Aug 2023 20:27:05 GMT"},{"version":"v3","created":"Tue, 15 Aug 2023 15:16:05 GMT"},{"version":"v4","created":"Sun, 27 Aug 2023 14:46:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Weingarten","Don",""]]}
{"id":"2308.05570","submitter":"Rajni Kant Bansal","authors":"Rajni Kant Bansal, Yue Chen, Pengcheng You, Enrique Mallada","title":"Intercept Function and Quantity Bidding in Two-stage Electricity Market\n  with Market Power Mitigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electricity markets typically operate in two stages, day-ahead and real-time.\nDespite best efforts striving efficiency, evidence of price manipulation has\ncalled for system-level market power mitigation (MPM) initiatives that\nsubstitute noncompetitive bids with default bids. Implementing these policies\nwith a limited understanding of participant behavior may lead to unintended\neconomic losses. In this paper, we model the competition between generators and\ninelastic loads in a two-stage market with stage-wise MPM policies. The loss of\nNash equilibrium and lack of guarantee of stable market outcome in the case of\nconventional supply function bidding motivates the use of an alternative market\nmechanism where generators bid an intercept function. A Nash equilibrium\nanalysis for a day-ahead MPM policy leads to a Stackelberg-Nash game with loads\nexercising market power at the expense of generators. A comparison of the\nresulting equilibrium with the standard market (not implementing any MPM\npolicy) shows that a day-ahead policy completely mitigates the market power of\ngenerators. On the other hand, the real-time MPM policy increases demand\nallocation to real-time, contrary to current market practice with most\nelectricity trades in the day-ahead market. Numerical studies illustrate the\nimpact of the slope of the intercept function on the standard market.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:33:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bansal","Rajni Kant",""],["Chen","Yue",""],["You","Pengcheng",""],["Mallada","Enrique",""]]}
{"id":"2308.05571","submitter":"Enes K\\\"okta\\c{s}","authors":"Enes Koktas and Recep A. Tasci and Ibrahim Yildirim and Ertugrul Basar","title":"Unleashing the Potential of Reconfigurable Intelligent Surfaces in\n  Martian Communication","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Space exploration has witnessed a steady increase since the 1960s, with Mars\nplaying a significant role in our quest for further knowledge. As the ambition\nto colonize Mars becomes a reality through the collaboration of private\ncompanies and space agencies, the need for reliable and robust communication\ninfrastructures in the Martian environment becomes paramount. In this context,\nreconfigurable intelligent surface (RIS)-empowered communication emerges as a\npromising technology to enhance the coverage and improve the communication\nquality. By considering various Martian scenarios such as canyons, craters,\nmountains, and plateaus, this article explores of the potential of RISs in\nincreasing the coverage in Martian environments, thereby enabling future Mars\nmissions to be more robust and reliable. The article also investigates the\napplication of RIS-assisted localization in both line-of-sight (LOS) and\nnon-line-of-sight (NLOS) scenarios, presenting a general framework for accurate\nuser angle estimation in challenging Martian conditions. The findings and\npresented framework of this article provide a promising research direction for\nintegrating RISs in deep space communication as well as paving the way for\nfuture improvements in interplanetary communication networks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:33:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Koktas","Enes",""],["Tasci","Recep A.",""],["Yildirim","Ibrahim",""],["Basar","Ertugrul",""]]}
{"id":"2308.05572","submitter":"Martin Adrian Barstow","authors":"O. Vincent, M.A. Barstow, S. Jordan, C. Mander, P. Bergeron, P. Dufour","title":"Classification and parameterisation of a large Gaia sample of white\n  dwarfs using XP spectra","comments":"20 pages, 11 figures, 3 tables. Submitted to Astronomy & Astrophysics\n  Revised version, including links to the White Dwarf catalogue","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The latest Gaia data release in July 2022, DR3, added a number of important\ndata products to those available in earlier releases, including radial velocity\ndata, information on stellar multiplicity and XP spectra of a selected sample\nof stars. While the normal Gaia photometry (G, GBP and GRP bands) and\nastrometry can be used to identify white dwarfs with high confidence, it is\nmuch more difficult to parameterise the stars and determine the white dwarf\nspectral type from this information alone. The availability of the XP spectra\nand synthetic photometry presents an opportunity for more detailed spectral\nclassification and measurement of effective temperature and surface gravity of\nGaia white dwarfs. A magnitude limit of G < 17.6 was applied to the routine\nproduction of XP spectra for Gaia sources, which would have excluded most white\ndwarfs. We created a catalogue of 100,000 high-quality white dwarf\nidentifications for which XP spectra were processed, with a magnitude limit of\nG < 20.5. Synthetic photometry was computed for all these stars, from the XP\nspectra, in Johnson, SDSS and J-PAS, published as the Gaia Synthetic Photometry\nCatalogue - White Dwarfs (GSPC-WD). We have now taken this catalogue and\napplied machine learning techniques to provide a classification of all the\nstars from the XP spectra. We have then applied an automated spectral fitting\nprogramme, with chi-squared minimisation, to measure their physical parameters\n(effective temperature and log g) from which we can estimate the white dwarf\nmasses and radii. We present the results of this work, demonstrating the power\nof being able to classify and parameterise such a large sample of 100, 000\nstars. We describe what we can learn about the white dwarf population from this\ndata set. We also explore the uncertainties in the process and the limitations\nof the data set.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:34:47 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 09:01:06 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 12:38:19 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Vincent","O.",""],["Barstow","M. A.",""],["Jordan","S.",""],["Mander","C.",""],["Bergeron","P.",""],["Dufour","P.",""]]}
{"id":"2308.05573","submitter":"Bayram Tekin","authors":"Zeynep Tugce Ozkarsligil, Bayram Tekin","title":"A Systematic Construction of Kastor-Traschen Currents and their\n  Extensions to Generic Powers of Curvature","comments":"8 pages","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":"  Kastor and Traschen constructed totally anti-symmetric conserved currents\nthat are linear in the Riemann curvature in spacetimes admitting Killing-Yano\ntensors. The construction does not refer to any field equations and is built on\nthe algebraic and differential symmetries of the Riemann tensor as well as on\nthe Killing-Yano equation. Here we give a systematic generalization of their\nwork and find divergence-free currents that are built from the powers of the\ncurvature tensor.\n  A rank-4 divergence-free tensor that is constructed from the powers of the\ncurvature tensor plays a major role here and it comes from the Lanczos-Lovelock\ntheory.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:36:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ozkarsligil","Zeynep Tugce",""],["Tekin","Bayram",""]]}
{"id":"2308.05574","submitter":"Rahul Raman","authors":"Danish Ebadulla, Rahul Raman, S. Natarajan, Hridhay Kiran Shetty,\n  Ashish Harish Shenoy","title":"Exploring Linguistic Similarity and Zero-Shot Learning for Multilingual\n  Translation of Dravidian Languages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current research in zero-shot translation is plagued by several issues such\nas high compute requirements, increased training time and off target\ntranslations. Proposed remedies often come at the cost of additional data or\ncompute requirements. Pivot based neural machine translation is preferred over\na single-encoder model for most settings despite the increased training and\nevaluation time. In this work, we overcome the shortcomings of zero-shot\ntranslation by taking advantage of transliteration and linguistic similarity.\nWe build a single encoder-decoder neural machine translation system for\nDravidian-Dravidian multilingual translation and perform zero-shot translation.\nWe compare the data vs zero-shot accuracy tradeoff and evaluate the performance\nof our vanilla method against the current state of the art pivot based method.\nWe also test the theory that morphologically rich languages require large\nvocabularies by restricting the vocabulary using an optimal transport based\ntechnique. Our model manages to achieves scores within 3 BLEU of large-scale\npivot-based models when it is trained on 50\\% of the language directions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:38:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ebadulla","Danish",""],["Raman","Rahul",""],["Natarajan","S.",""],["Shetty","Hridhay Kiran",""],["Shenoy","Ashish Harish",""]]}
{"id":"2308.05575","submitter":"Blerta Lindqvist","authors":"Blerta Lindqvist","title":"Symmetry Defense Against XGBoost Adversarial Perturbation Attacks","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We examine whether symmetry can be used to defend tree-based ensemble\nclassifiers such as gradient-boosting decision trees (GBDTs) against\nadversarial perturbation attacks. The idea is based on a recent symmetry\ndefense for convolutional neural network classifiers (CNNs) that utilizes CNNs'\nlack of invariance with respect to symmetries. CNNs lack invariance because\nthey can classify a symmetric sample, such as a horizontally flipped image,\ndifferently from the original sample. CNNs' lack of invariance also means that\nCNNs can classify symmetric adversarial samples differently from the incorrect\nclassification of adversarial samples. Using CNNs' lack of invariance, the\nrecent CNN symmetry defense has shown that the classification of symmetric\nadversarial samples reverts to the correct sample classification. In order to\napply the same symmetry defense to GBDTs, we examine GBDT invariance and are\nthe first to show that GBDTs also lack invariance with respect to symmetries.\nWe apply and evaluate the GBDT symmetry defense for nine datasets against six\nperturbation attacks with a threat model that ranges from zero-knowledge to\nperfect-knowledge adversaries. Using the feature inversion symmetry against\nzero-knowledge adversaries, we achieve up to 100% accuracy on adversarial\nsamples even when default and robust classifiers have 0% accuracy. Using the\nfeature inversion and horizontal flip symmetries against perfect-knowledge\nadversaries, we achieve up to over 95% accuracy on adversarial samples for the\nGBDT classifier of the F-MNIST dataset even when default and robust classifiers\nhave 0% accuracy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:39:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lindqvist","Blerta",""]]}
{"id":"2308.05576","submitter":"Tal Linzen","authors":"Matthew Mandelkern and Tal Linzen","title":"Do Language Models Refer?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  What do language models (LMs) do with language? Everyone agrees that they\nproduce sequences of (mostly) coherent sentences. But are they saying anything\nwith those strings or simply babbling in a convincing simulacrum of language\nuse? This is a vague question, and there are many ways of making it precise.\nHere we will address one aspect of the question, namely, whether LMs' words\nrefer: that is, whether the outputs of LMs achieve \"word-to-world\" connections.\nThere is prima facie reason to think they do not since LMs do not interact with\nthe world in the way that ordinary language users do. Drawing on insights from\nthe externalist tradition in philosophy of language, we argue that appearances\nare misleading and that there is good reason to think that LMs can refer.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:39:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mandelkern","Matthew",""],["Linzen","Tal",""]]}
{"id":"2308.05577","submitter":"Jonathan Stallrich","authors":"Jonathan W. Stallrich and Michael McKibben","title":"Optimal Designs for Two-Stage Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The analysis of screening experiments is often done in two stages, starting\nwith factor selection via an analysis under a main effects model. The success\nof this first stage is influenced by three components: (1) main effect\nestimators' variances and (2) bias, and (3) the estimate of the noise variance.\nComponent (3) has only recently been given attention with design techniques\nthat ensure an unbiased estimate of the noise variance. In this paper, we\npropose a design criterion based on expected confidence intervals of the first\nstage analysis that balances all three components. To address model\nmisspecification, we propose a computationally-efficient all-subsets analysis\nand a corresponding constrained design criterion based on lack-of-fit.\nScenarios found in existing design literature are revisited with our criteria\nand new designs are provided that improve upon existing methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:39:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Stallrich","Jonathan W.",""],["McKibben","Michael",""]]}
{"id":"2308.05578","submitter":"Eetu Loisa","authors":"Eetu Loisa","title":"Searching for the flavon at current and future colliders","comments":"10 pages, 5 figures. Contribution to the proceedings of the 21st\n  Conference on Flavor Physics and CP Violation (FPCP2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The $ B_3 - L_2$ $ Z' $ model may explain certain features of the fermion\nmass spectrum as well as the $b \\rightarrow s \\mu^+ \\mu^-$ anomalies. The $ Z'\n$ acquires its mass via a TeV-scale scalar field, the flavon, whose vacuum\nexpectation value spontaneously breaks the family non-universal gauged $\nU(1)_{B_3 - L_2} $ symmetry. We review the key features of the model, with an\nemphasis on its scalar potential and the flavon field, and use experimental\ndata and perturbativity arguments to place bounds upon the Higgs-flavon mixing\nangle. Finally, we discuss flavonstrahlung as a means to discover the flavon\nexperimentally and compute flavonstrahlung cross-sections at current and future\ncolliders.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:41:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Loisa","Eetu",""]]}
{"id":"2308.05579","submitter":"Gary P. T. Choi","authors":"Zhiyuan Lyu, Gary P. T. Choi, Lok Ming Lui","title":"Bijective Density-Equalizing Quasiconformal Map for Multiply-Connected\n  Open Surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.GR math.CV math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel method for computing bijective density-equalizing\nquasiconformal (DEQ) flattening maps for multiply-connected open surfaces. In\nconventional density-equalizing maps, shape deformations are solely driven by\nprescribed constraints on the density distribution, defined as the population\nper unit area, while the bijectivity and local geometric distortions of the\nmappings are uncontrolled. Also, prior methods have primarily focused on\nsimply-connected open surfaces but not surfaces with more complicated\ntopologies. Our proposed method overcomes these issues by formulating the\ndensity diffusion process as a quasiconformal flow, which allows us to\neffectively control the local geometric distortion and guarantee the\nbijectivity of the mapping by solving an energy minimization problem involving\nthe Beltrami coefficient of the mapping. To achieve an optimal parameterization\nof multiply-connected surfaces, we develop an iterative scheme that optimizes\nboth the shape of the target planar circular domain and the density-equalizing\nquasiconformal map onto it. In addition, landmark constraints can be\nincorporated into our proposed method for consistent feature alignment. The\nmethod can also be naturally applied to simply-connected open surfaces. By\nchanging the prescribed population, a large variety of surface flattening maps\nwith different desired properties can be achieved. The method is tested on both\nsynthetic and real examples, demonstrating its efficacy in various applications\nin computer graphics and medical imaging.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:42:03 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 08:59:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lyu","Zhiyuan",""],["Choi","Gary P. T.",""],["Lui","Lok Ming",""]]}
{"id":"2308.05580","submitter":"Mohsen Sadr","authors":"Mohsen Sadr, Marcel Pfeiffer, M. Hossein Gorji","title":"Fokker-Planck-Poisson kinetics: Multi-phase flow beyond equilibrium","comments":null,"journal-ref":"Journal of Fluid Mechanics 920 (2021): A46","doi":"10.1017/jfm.2021.461","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multi-phase phenomena remain at the heart of many challenging fluid dynamics\nproblems. Molecular fluxes at the interface determine the fate of neighboring\nphases, yet their closure far from the continuum needs to be modeled. Along the\nhierarchy of kinetic approaches, a multi-phase particle method is devised in\nthis study. This approach is built closely upon the previous studies on the\nkinetic method development for dense gasses [Phys. Fluids, 29 (12), 2017] and\nlong-range interactions [J. Comput. Phys, 378, 2019]. It is on this background\nthat the current work on Fokker-Planck-Poisson modeling of multi-phase\nphenomena is initiated. Molecular interactions are expressed via stochastic\nforces driven by the white noise, coupled with long-range attractions. The\nformer is local and pursues diffusive approximation of molecular collisions,\nwhereas the latter takes a global feature owing to mean-field forces. The\nobtained Fokker-Planck-Poisson combination provides an efficient workflow for\nphysics-driven simulations suitable for multi-phase phenomena far from the\nequilibrium. Besides highlighting the computational efficiency of the method,\nvarious archetypical and complex problems ranging from\ninverted-temperature-gradient between droplets to spinodal decomposition are\nexplored. Detailed discussions are provided on different characteristics of the\ndroplets dispersed in low/high density background gases; including the\ndeparture of heat fluxes from Fourier's law as well as droplets growth in\nspinodal phases.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:42:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sadr","Mohsen",""],["Pfeiffer","Marcel",""],["Gorji","M. Hossein",""]]}
{"id":"2308.05581","submitter":"Quan Tang","authors":"Quan Tang, Chuanjian Liu, Fagui Liu, Yifan Liu, Jun Jiang, Bowen\n  Zhang, Kai Han, Yunhe Wang","title":"Category Feature Transformer for 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":"  Aggregation of multi-stage features has been revealed to play a significant\nrole in semantic segmentation. Unlike previous methods employing point-wise\nsummation or concatenation for feature aggregation, this study proposes the\nCategory Feature Transformer (CFT) that explores the flow of category embedding\nand transformation among multi-stage features through the prevalent multi-head\nattention mechanism. CFT learns unified feature embeddings for individual\nsemantic categories from high-level features during each aggregation process\nand dynamically broadcasts them to high-resolution features. Integrating the\nproposed CFT into a typical feature pyramid structure exhibits superior\nperformance over a broad range of backbone networks. We conduct extensive\nexperiments on popular semantic segmentation benchmarks. Specifically, the\nproposed CFT obtains a compelling 55.1% mIoU with greatly reduced model\nparameters and computations on the challenging ADE20K dataset.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:44:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Tang","Quan",""],["Liu","Chuanjian",""],["Liu","Fagui",""],["Liu","Yifan",""],["Jiang","Jun",""],["Zhang","Bowen",""],["Han","Kai",""],["Wang","Yunhe",""]]}
{"id":"2308.05582","submitter":"Filipo Sharevski","authors":"Aziz Zeidieh and Filipo Sharevski","title":"Usability Assessment of the OnlyKey Hardware Two-Factor Authentication\n  Key Among Low Vision or Blind Users","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hardware security keys undoubtedly have advantage for users as \"usability\"\npain is trivial compared to the maximum \"security\" gain in authentication.\nNaturally, the hardware factor in the authentication received a widespread\nadoption amongst average users, as it is ergonomically less demanding than\nphone texts or authentication prompts. This ergonomic advantage in particular\nis essential for users who are blind or low vision, as their interaction with a\nphone is impractical. However, the \"usability\" for low vision or blind users\npain might be much higher than an average well-bodied user for the same\n\"security\" gain. In an effort to learn more we conducted a usability assessment\nwith ten low vision or blind users setting up the OnlyKey two-factor\nauthentication key. First, the setup process was insurmountable for more than\nhalf of the participants, resulting in a situation where the hardware key was\nabandoned. Secondly, the lack of tactile orientation led participants to\nconsider it as both impractical, and prone to difficulties locating or loosing\nit. We discuss the implications of our findings for future improvements in\nusable authentication for visually impaired users.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:46:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zeidieh","Aziz",""],["Sharevski","Filipo",""]]}
{"id":"2308.05583","submitter":"Sattar Vakili","authors":"Ushnish Sengupta, Chinkuo Jao, Alberto Bernacchia, Sattar Vakili and\n  Da-shan Shiu","title":"Generative Diffusion Models for Radio Wireless Channel Modelling and\n  Sampling","comments":"2023 IEEE Global Communications Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CE cs.NI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Channel modelling is essential to designing modern wireless communication\nsystems. The increasing complexity of channel modelling and the cost of\ncollecting high-quality wireless channel data have become major challenges. In\nthis paper, we propose a diffusion model based channel sampling approach for\nrapidly synthesizing channel realizations from limited data. We use a diffusion\nmodel with a U Net based architecture operating in the frequency space domain.\nTo evaluate how well the proposed model reproduces the true distribution of\nchannels in the training dataset, two evaluation metrics are used: $i)$ the\napproximate $2$-Wasserstein distance between real and generated distributions\nof the normalized power spectrum in the antenna and frequency domains and $ii)$\nprecision and recall metric for distributions. We show that, compared to\nexisting GAN based approaches which suffer from mode collapse and unstable\ntraining, our diffusion based approach trains stably and generates diverse and\nhigh-fidelity samples from the true channel distribution. We also show that we\ncan pretrain the model on a simulated urban macro-cellular channel dataset and\nfine-tune it on a smaller, out-of-distribution urban micro-cellular dataset,\ntherefore showing that it is feasible to model real world channels using\nlimited data with this approach.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:49:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sengupta","Ushnish",""],["Jao","Chinkuo",""],["Bernacchia","Alberto",""],["Vakili","Sattar",""],["Shiu","Da-shan",""]]}
{"id":"2308.05584","submitter":"Marcel Pfeiffer","authors":"Franziska Hild and Marcel Pfeiffer","title":"Multi-species modeling in the particle-based ellipsoidal statistical\n  Bhatnagar-Gross-Krook method including internal degrees of freedom","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 implementation of the ellipsoidal statistical Bhatnagar-Gross-Krook\n(ESBGK) method in the open-source particle code PICLas is extended for\nmulti-species modeling of polyatomic molecules, including internal energies\nwith multiple vibrational degrees of freedom. For this, the models of Mathiaud,\nMieussens, Pfeiffer, and Brull are combined. In order to determine the\ntransport coefficients of the gas mixture, Wilke's mixing rules and collision\nintegrals are compared. The implementation is verified with simulation test\ncases of a supersonic Couette flow as well as a hypersonic flow around a\n70{\\deg} blunted cone. The solutions of the ESBGK method are compared to the\nDirect Simulation Monte Carlo (DSMC) method to assess the accuracy, where\noverall good agreement is achieved. In general, collision integrals should be\npreferred for the determination of the transport coefficients, since the\nresults using Wilke's mixing rules show larger deviations in particular for\nlarge mass ratios. Considering the computational efficiency of the methods, a\nconsiderable reduction in computational time is possible with the ESBGK model.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:49:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hild","Franziska",""],["Pfeiffer","Marcel",""]]}
{"id":"2308.05585","submitter":"Miao Fan","authors":"Miao Fan, Chen Hu, Shuchang Zhou","title":"Proximal Policy Optimization Actual Combat: Manipulating Output\n  Tokenizer Length","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Reinforcement Learning from Human Feedback (RLHF) plays a pivotal role in\nshaping the impact of large language models (LLMs), contributing significantly\nto controlling output toxicity and selecting output styles, particularly as\nLLMs often harbor misleading content, highlighting the urgency to align them\nwith human values for secure AI systems. The RLHF, characterized by complexity,\ninstability, and sensitivity to hyperparameters, makes the evaluation of the\nreward model for complex tasks challenging, thereby further complicating the\nuse of Proximal Policy Optimization (PPO). In this paper, we introduce a simple\ntask designed to employ Gloden as a reward model that validates the\neffectiveness of PPO and inspires it, primarily explaining the task of\nutilizing PPO to manipulate the tokenizer length of the output generated by the\nmodel. Experiments confirm that PPO is not only effective in manipulating the\noutput tokenizer length to a certain extent in this type of task but also\nexhibits facilitated training once the influence of the reward model effect is\nexcluded, making it an exciting development.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:50:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fan","Miao",""],["Hu","Chen",""],["Zhou","Shuchang",""]]}
{"id":"2308.05586","submitter":"Daniel Greb","authors":"Matteo Costantini, Daniel Greb","title":"Milnor-Wood inequality for klt varieties of general type and\n  uniformization","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the definition of the Toledo invariant for representations of\nfundamental groups of smooth varieties of general type due to Koziarz and\nMaubon to the context of singular klt varieties, where the natural fundamental\ngroups to consider are those of smooth loci. Assuming that the rank of the\ntarget Lie group is not greater than two, we show that the Toledo invariant\nsatisfies a Milnor-Wood type inequality and we characterize the corresponding\nmaximal representations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:50:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Costantini","Matteo",""],["Greb","Daniel",""]]}
{"id":"2308.05587","submitter":"Eric Torrence","authors":"FASER Collaboration","title":"Search for Dark Photons with the FASER detector at the LHC","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-161","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The FASER experiment at the LHC is designed to search for light,\nweakly-interacting particles produced in proton-proton collisions at the ATLAS\ninteraction point that travel in the far-forward direction. The first results\nfrom a search for dark photons decaying to an electron-positron pair, using a\ndataset corresponding to an integrated luminosity of 27.0 fb$^{-1}$ collected\nat center-of-mass energy $\\sqrt{s} = 13.6$ TeV in 2022 in LHC Run 3, are\npresented. No events are seen in an almost background-free analysis, yielding\nworld-leading constraints on dark photons with couplings $\\epsilon \\sim 2\n\\times 10^{-5} - 1 \\times 10^{-4}$ and masses $\\sim$ 17 MeV - 70 MeV. The\nanalysis is also used to probe the parameter space of a massive gauge boson\nfrom a U(1)$_{B-L}$ model, with couplings $g_{B-L} \\sim 5 \\times 10^{-6} - 2\n\\times 10^{-5}$ and masses $\\sim$ 15 MeV - 40 MeV excluded for the first time.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:51:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["FASER Collaboration","",""]]}
{"id":"2308.05588","submitter":"Nave Frost","authors":"Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara, Dan Olteanu","title":"Banzhaf Values for Facts in Query Answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantifying the contribution of database facts to query answers has been\nstudied as means of explanation. The Banzhaf value, originally developed in\nGame Theory, is a natural measure of fact contribution, yet its efficient\ncomputation for select-project-join-union queries is challenging. In this\npaper, we introduce three algorithms to compute the Banzhaf value of database\nfacts: an exact algorithm, an anytime deterministic approximation algorithm\nwith relative error guarantees, and an algorithm for ranking and top-$k$. They\nhave three key building blocks: compilation of query lineage into an equivalent\nfunction that allows efficient Banzhaf value computation; dynamic programming\ncomputation of the Banzhaf values of variables in a Boolean function using the\nBanzhaf values for constituent functions; and a mechanism to compute\nefficiently lower and upper bounds on Banzhaf values for any positive DNF\nfunction.\n  We complement the algorithms with a dichotomy for the Banzhaf-based ranking\nproblem: given two facts, deciding whether the Banzhaf value of one is greater\nthan of the other is tractable for hierarchical queries and intractable for\nnon-hierarchical queries.\n  We show experimentally that our algorithms significantly outperform exact and\napproximate algorithms from prior work, most times up to two orders of\nmagnitude. Our algorithms can also cover challenging problem instances that are\nbeyond reach for prior work.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:52:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Abramovich","Omer",""],["Deutch","Daniel",""],["Frost","Nave",""],["Kara","Ahmet",""],["Olteanu","Dan",""]]}
{"id":"2308.05589","submitter":"Kristen Schumacher","authors":"Kristen Schumacher, Nicolas Yunes and Kent Yagi","title":"Gravitational Wave Polarizations with Different Propagation Speeds","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In some modified theories of gravity, gravitational waves can contain up to\nsix different polarizations, which can travel at speeds different from that of\nlight. Searches for these different polarizations in gravitational wave data\nare important because any detection would be clear evidence of new physics,\nwhile clear non-detections could constrain some modified theories. The first\nstep toward searching the data for such gravitational wave content is the\ncalculation of the amplitudes of these different polarizations. Here we present\na model-independent method to obtain the different polarizations of\ngravitational waves directly from the metric perturbation in theories where\nthese polarizations are allowed to travel at different speeds. We develop our\ncalculations so that the same procedure works with either the metric\nperturbation itself or its trace-reversed form. Our results are in agreement\nwith previous work in the limit that all polarization speeds are the speed of\nlight. We demonstrate how our model-independent method can be used with two\nspecific modified theories of gravity, suggesting its wide applicability to\nother theories that allow for different gravitational wave propagation speeds.\nWe further extend the ppE formalism to apply to such theories that travel with\ndifferent speeds. Finally, we discuss how the different speeds of different\npolarizations may affect null stream tests of general relativity with\ngravitational wave observations by multiple interferometers. Differences in\npropagation speeds may make null streams ineffective or lead to the detection\nof what seem to be isolated scalar or vector modes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:53:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Schumacher","Kristen",""],["Yunes","Nicolas",""],["Yagi","Kent",""]]}
{"id":"2308.05590","submitter":"Igor Rogachevskii","authors":"I. Rogachevskii (BGU), N. Kleeorin (BGU)","title":"Budget equations and astrophysical nonlinear mean-field dynamos","comments":"9 pages, revised paper","journal-ref":null,"doi":null,"report-no":"NORDITA-2023-046","categories":"astro-ph.SR astro-ph.GA physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar, stellar and galactic large-scale magnetic fields are originated due to\na combined action of non-uniform (differential) rotation and helical motions of\nplasma via mean-field dynamos. Usually, nonlinear mean-field dynamo theories\ntake into account algebraic and dynamic quenching of alpha effect and algebraic\nquenching of turbulent magnetic diffusivity. However, these theories do not\ntake into account a feedback of the mean magnetic field on the background\nturbulence (with a zero mean magnetic field). Our analysis using the budget\nequation for the total (kinetic plus magnetic) turbulent energy, which takes\ninto account the feedback of the generated mean magnetic field on the\nbackground turbulence, has shown that a nonlinear dynamo number decreases with\nincrease of the mean magnetic field for a forced turbulence, and a\nshear-produced turbulence and a convective turbulence. This implies that\nmean-field $\\alpha\\Omega$, $\\alpha^2$ and $\\alpha^2\\Omega$ dynamo instabilities\nare always saturated.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:53:26 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 17:54:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rogachevskii","I.","","BGU"],["Kleeorin","N.","","BGU"]]}
{"id":"2308.05591","submitter":"Feng Wang","authors":"Feng Wang, Giovanni Geraci, Tony Q. S. Quek","title":"Optimizing Cache Content Placement in Integrated Terrestrial and\n  Non-terrestrial Networks","comments":"accepted by IEEE GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.IT cs.NI cs.SY eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-terrestrial networks (NTN) offer potential for efficient content\nbroadcast in remote regions, thereby extending the reach of digital services.\nIn this paper, we introduce a novel approach to optimize wireless edge content\nplacement using NTN. Specifically, we dynamically select content for placement\nvia NTN links based on popularity and suitability for delivery through NTN,\nwhile considering the orbital motion of LEO satellites. Our comprehensive\nsystem-level case studies, based on a practical LEO constellation, demonstrate\nthe significant improvement in placement speed compared to existing methods\nthat neglect network mobility. We further show that the advantages of NTN links\nover standalone wireless TN solutions are more pronounced in the early stages\nof content delivery and are amplified by higher content popularity correlation\nacross geographical regions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:57:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Feng",""],["Geraci","Giovanni",""],["Quek","Tony Q. S.",""]]}
{"id":"2308.05592","submitter":"Somnath Koley","authors":"Somnath Koley, Karuna Kar Nanda","title":"Algae-like Artificial Organic Phototactic Micro-swimmers","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mes-hall cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Phototaxis is a light driven self-locomotion of mass and a common phenomenon\nin motile organisms with varieties of motility such as in bacteria, algae, etc.\nIn naturally occurring organisms, mechanical force is generated utilising their\nmetabolic energy to propel and swim in presence of light, performing important\nbio-chemical reactions. Herein, we report a new class of micro-swimmers that\nexhibit captivating and complicated micro-swimming mediated colony formation\nproperties resembling green algae. A facile pyrolysis reaction is explored\nleading to homogeneous organic Nano-structures forming patterned\nself-assemblies among themselves. A delicate balance of colloid surface forms\ninteresting architectures such as dynamic colonies, thallus like patterning and\ncilia like micro-arms. In presence of weak light both positive and negative\nphototaxis are seen moving the micro-swimmers propelling towards and away from\nthe light respectively. During swimming helical motion and electrostatic\ninteractions of colloidal micro-swimmers with neighbouring assemblies are\nobserved. The nature of assembly formation is found to be fractal and can be\ndisintegrated using strong light. Strong exposure stimulates predominately fast\nnegative phototaxis leading to directional propulsion along the light path. All\nthese algae life-like behaviour of the colloidal carbonaceous lyophilic\ncolloids are stable in alcohol and can be reversibly discontinued with water\ndue to super-hydrophilicity. We therefore introduce a class of life-like\ncolloidal chemical architecture. Our discovery may entice studies for creation\nof a diverse programmable micro-swimmers for microscopic understanding and\nmanipulating collective effect of the assemblies for bio-mimetic and catalytic\napplications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:00:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Koley","Somnath",""],["Nanda","Karuna Kar",""]]}
{"id":"2308.05593","submitter":"Fujing Xie","authors":"Fujing Xie, S\\\"oren Schwertfeger","title":"Robust Lifelong Indoor LiDAR Localization using the Area Graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lifelong indoor localization in a given map is the basis for navigation of\nautonomous mobile robots. In this letter, we address the problem of robust\nlocalization in cluttered indoor environments like office spaces and corridors\nusing 3D LiDAR point clouds in a given Area Graph, which is a hierarchical,\ntopometric semantic map representation that uses polygons to demark areas such\nas rooms, corridors or buildings. This representation is very compact, can\nrepresent different floors of buildings through its hierarchy and provides\nsemantic information that helps with localization, like poses of doors and\nglass. In contrast to this, commonly used map representations, such as\noccupancy grid maps or point clouds, lack these features and require frequent\nupdates in response to environmental changes (e.g. moved furniture), unlike our\napproach, which matches against lifelong architectural features such as walls\nand doors. For that we apply filtering to remove clutter from the 3D input\npoint cloud and then employ further scoring and weight functions for\nlocalization. Given a broad initial guess from WiFi localization, our\nexperiments show that our global localization and the weighted point to line\nICP pose tracking perform very well, even when compared to localization and\nSLAM algorithms that use the current, feature-rich cluttered map for\nlocalization.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:03:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xie","Fujing",""],["Schwertfeger","S\u00f6ren",""]]}
{"id":"2308.05594","submitter":"Martin Fasser","authors":"Martin Fasser, Christoph Hotter, David Plankensteiner, Helmut Ritsch","title":"Threshold studies for a hot beam superradiant laser including an atomic\n  guiding potential","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent theoretical predictions hint at an implementation of a superradiant\nlaser based on narrow optical clock transitions by using a filtered thermal\nbeam at high density. Corresponding numerical studies give encouraging results\nbut the required very high densities are sensitive to beam collimation errors\nand inhomogeneous shifts. Here we present extensive numerical studies of\nthreshold conditions and the predicted output power of such a superradiant\nlaser involving realistic particle numbers and velocities along the cavity\naxis. Detailed studies target the threshold scaling as a function of\ntemperature as well as the influence of eliminating the hottest part of the\natomic distribution via velocity filtering and the benefits of additional\natomic beam guiding. Using a cumulant expansion approach allows us to quantify\nthe significance of atom-atom and atom-field correlations in such\nconfigurations. We predict necessary conditions to achieve a certain threshold\nphoton number depending on the atomic temperature and density. In particular,\nwe show that the temperature threshold can be significantly increased by using\nmore atoms. Interestingly, a velocity filter removing very fast atoms has only\nalmost negligible influence despite their phase perturbing properties. On the\npositive side an additional conservative optical guiding towards cavity mode\nantinodes leads to significantly lower threshold and higher average photon\nnumber. Interestingly we see that higher order atom-field and direct atom-atom\nquantum correlations play only a minor role in the laser dynamics, which is a\nbit surprising in the superradiant regime.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:05:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fasser","Martin",""],["Hotter","Christoph",""],["Plankensteiner","David",""],["Ritsch","Helmut",""]]}
{"id":"2308.05595","submitter":"Alceu Emanuel Bissoto","authors":"Alceu Bissoto, Catarina Barata, Eduardo Valle, Sandra Avila","title":"Test-Time Selection for Robust Skin Lesion Analysis","comments":"Accepted at ISIC Workshop @ MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Skin lesion analysis models are biased by artifacts placed during image\nacquisition, which influence model predictions despite carrying no clinical\ninformation. Solutions that address this problem by regularizing models to\nprevent learning those spurious features achieve only partial success, and\nexisting test-time debiasing techniques are inappropriate for skin lesion\nanalysis due to either making unrealistic assumptions on the distribution of\ntest data or requiring laborious annotation from medical practitioners. We\npropose TTS (Test-Time Selection), a human-in-the-loop method that leverages\npositive (e.g., lesion area) and negative (e.g., artifacts) keypoints in test\nsamples. TTS effectively steers models away from exploiting spurious\nartifact-related correlations without retraining, and with less annotation\nrequirements. Our solution is robust to a varying availability of annotations,\nand different levels of bias. We showcase on the ISIC2019 dataset (for which we\nrelease a subset of annotated images) how our model could be deployed in the\nreal-world for mitigating bias.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:08:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bissoto","Alceu",""],["Barata","Catarina",""],["Valle","Eduardo",""],["Avila","Sandra",""]]}
{"id":"2308.05596","submitter":"XInlei He","authors":"Xinlei He and Savvas Zannettou and Yun Shen and Yang Zhang","title":"You Only Prompt Once: On the Capabilities of Prompt Learning on Large\n  Language Models to Tackle Toxic Content","comments":"To Appear in the 45th IEEE Symposium on Security and Privacy, May\n  20-23, 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spread of toxic content online is an important problem that has adverse\neffects on user experience online and in our society at large. Motivated by the\nimportance and impact of the problem, research focuses on developing solutions\nto detect toxic content, usually leveraging machine learning (ML) models\ntrained on human-annotated datasets. While these efforts are important, these\nmodels usually do not generalize well and they can not cope with new trends\n(e.g., the emergence of new toxic terms). Currently, we are witnessing a shift\nin the approach to tackling societal issues online, particularly leveraging\nlarge language models (LLMs) like GPT-3 or T5 that are trained on vast corpora\nand have strong generalizability. In this work, we investigate how we can use\nLLMs and prompt learning to tackle the problem of toxic content, particularly\nfocusing on three tasks; 1) Toxicity Classification, 2) Toxic Span Detection,\nand 3) Detoxification. We perform an extensive evaluation over five model\narchitectures and eight datasets demonstrating that LLMs with prompt learning\ncan achieve similar or even better performance compared to models trained on\nthese specific tasks. We find that prompt learning achieves around 10\\%\nimprovement in the toxicity classification task compared to the baselines,\nwhile for the toxic span detection task we find better performance to the best\nbaseline (0.643 vs. 0.640 in terms of $F_1$-score). Finally, for the\ndetoxification task, we find that prompt learning can successfully reduce the\naverage toxicity score (from 0.775 to 0.213) while preserving semantic meaning.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:14:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["He","Xinlei",""],["Zannettou","Savvas",""],["Shen","Yun",""],["Zhang","Yang",""]]}
{"id":"2308.05597","submitter":"Jan Karbowski","authors":"Jan Karbowski","title":"Bounds on the rates of statistical divergences and mutual information","comments":"16 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Statistical divergences are important tools in data analysis, information\ntheory, and statistical physics, and there exist well known inequalities on\ntheir bounds. However, in many circumstances involving temporal evolution, one\nneeds limitations on the rates of such quantities, instead. Here, several\ngeneral upper bounds on the rates of some f-divergences are derived, valid for\nany type of stochastic dynamics (both Markovian and non-Markovian), in terms of\ninformation-like and/or thermodynamic observables. As special cases, the\nanalytical bounds on the rate of mutual information are obtained, which may\nprovide explicit and simple alternatives to the existing numerical algorithms\nfor its estimation. The major role in all those limitations is played by\ntemporal Fisher information, and some of them contain entropy production,\nsuggesting a link with stochastic thermodynamics. Overall, the derived bounds\ncan be applied to any complex network of interacting elements, where\npredictability of network dynamics is of prime concern.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:17:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Karbowski","Jan",""]]}
{"id":"2308.05598","submitter":"Dipanweeta Bhattacharyya","authors":"Dipanweeta Bhattacharyya, Jasjeet Singh Bagla","title":"Where can we find the merger remnant in BH-BH mergers in Globular\n  clusters?","comments":"8 pages, 1 table, 6 figures with 9 subfigures, Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mergers of black holes and other compact objects produce gravitational waves\nwhich carry a part of the energy, momentum, and angular momentum of the system.\nDue to asymmetry in the gravitational wave emission, a recoil kick velocity is\nimparted to the merger remnant. It has been conjectured that a significant\nfraction of the mergers detected so far reside in globular clusters. We explore\nthe scenario where the merger remnant in a globular cluster is moving at a\nsignificant speed with respect to the binary that underwent merger. We study\nthis in the situation when the kick velocity is higher than the escape velocity\nin the case of globular clusters assuming a Plummer density profile for the\ncluster. We study the evolution of the system to study the outcome: whether\ndynamical friction can trap the black hole within the globular cluster, whether\nthe black hole escapes the globular cluster but ends up in the bulge, and\nlastly, whether the black halo becomes a halo object. We present results for an\nanalysis based on orbital parameters of ten globular clusters using data from\nGAIA EDR3. We find that if the kick velocity is smaller than $120$ km/s then a\nmajority of remnant black holes end up in the bulge. Note that our results in\nterms of where compact objects launched from a globular cluster end up are\napplicable to any mechanism, e.g., a compact object ejected due to three-body\ninteractions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:18:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bhattacharyya","Dipanweeta",""],["Bagla","Jasjeet Singh",""]]}
{"id":"2308.05599","submitter":"Peter Reimann","authors":"Christian Eidecker-Dunkel and Peter Reimann","title":"Allosteric impurity effects in long spin chains","comments":null,"journal-ref":"Phys. Rev. B 108, 054407 (2023)","doi":"10.1103/PhysRevB.108.054407","report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Allosterism traditionally refers to local changes in an extended object, for\ninstance the binding of a ligand to a macromolecule, leading to a localized\nresponse at some other, possibly quite remote position. Here, we show that such\nfascinating effects may already occur in very simple and common quantum\nmany-body systems, such as an anisotropic Heisenberg spin chain: Introducing an\nimpurity at one end of a sufficiently long chain may lead to quite significant\nchanges of the observable behavior near the other end, but not in the much\nlarger region in between. Specifically, spin autocorrelation functions at\nthermal equilibrium are found to exhibit a pronounced allosterism of this type.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:19:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Eidecker-Dunkel","Christian",""],["Reimann","Peter",""]]}
{"id":"2308.05600","submitter":"Edouard Yvinec","authors":"Edouard Yvinec, Arnaud Dapogny and Kevin Bailly","title":"NUPES : Non-Uniform Post-Training Quantization via Power Exponent Search","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 neural network (DNN) deployment has been confined to larger hardware\ndevices due to their expensive computational requirements. This challenge has\nrecently reached another scale with the emergence of large language models\n(LLMs). In order to reduce both their memory footprint and latency, a promising\ntechnique is quantization. It consists in converting floating point\nrepresentations to low bit-width fixed point representations, usually by\nassuming a uniform mapping onto a regular grid. This process, referred to in\nthe literature as uniform quantization, may however be ill-suited as most DNN\nweights and activations follow a bell-shaped distribution. This is even worse\non LLMs whose weight distributions are known to exhibit large, high impact,\noutlier values. In this work, we propose an improvement over the most commonly\nadopted way to tackle this limitation in deep learning models quantization,\nnamely, non-uniform quantization. NUPES leverages automorphisms to preserve the\nscalar multiplications. Such transformations are derived from power functions.\nHowever, the optimization of the exponent parameter and weight values remains a\nchallenging and novel problem which could not be solved with previous post\ntraining optimization techniques which only learn to round up or down weight\nvalues in order to preserve the predictive function. We circumvent this\nlimitation with a new paradigm: learning new quantized weights over the entire\nquantized space. Similarly, we enable the optimization of the power exponent,\ni.e. the optimization of the quantization operator itself during training by\nalleviating all the numerical instabilities. The resulting predictive function\nis compatible with integer-only low-bit inference. We show the ability of the\nmethod to achieve state-of-the-art compression rates in both, data-free and\ndata-driven configurations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:19:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yvinec","Edouard",""],["Dapogny","Arnaud",""],["Bailly","Kevin",""]]}
{"id":"2308.05601","submitter":"Tianpu Zhang","authors":"Weilong Ding, Tianpu Zhang, Jianwu Wang, Zhuofeng Zhao","title":"Multi-graph Spatio-temporal Graph Convolutional Network for Traffic Flow\n  Prediction","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":"  Inter-city highway transportation is significant for urban life. As one of\nthe key functions in intelligent transportation system (ITS), traffic\nevaluation always plays significant role nowadays, and daily traffic flow\nprediction still faces challenges at network-wide toll stations. On the one\nhand, the data imbalance in practice among various locations deteriorates the\nperformance of prediction. On the other hand, complex correlative\nspatio-temporal factors cannot be comprehensively employed in long-term\nduration. In this paper, a prediction method is proposed for daily traffic flow\nin highway domain through spatio-temporal deep learning. In our method, data\nnormalization strategy is used to deal with data imbalance, due to long-tail\ndistribution of traffic flow at network-wide toll stations. And then, based on\ngraph convolutional network, we construct networks in distinct semantics to\ncapture spatio-temporal features. Beside that, meteorology and calendar\nfeatures are used by our model in the full connection stage to extra external\ncharacteristics of traffic flow. By extensive experiments and case studies in\none Chinese provincial highway, our method shows clear improvement in\npredictive accuracy than baselines and practical benefits in business.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:20:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ding","Weilong",""],["Zhang","Tianpu",""],["Wang","Jianwu",""],["Zhao","Zhuofeng",""]]}
{"id":"2308.05602","submitter":"Shizhe Chen","authors":"Shizhe Chen, Thomas Chabal, Ivan Laptev and Cordelia Schmid","title":"Object Goal Navigation with Recursive Implicit Maps","comments":"Accepted to IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Object goal navigation aims to navigate an agent to locations of a given\nobject category in unseen environments. Classical methods explicitly build maps\nof environments and require extensive engineering while lacking semantic\ninformation for object-oriented exploration. On the other hand, end-to-end\nlearning methods alleviate manual map design and predict actions using implicit\nrepresentations. Such methods, however, lack an explicit notion of geometry and\nmay have limited ability to encode navigation history. In this work, we propose\nan implicit spatial map for object goal navigation. Our implicit map is\nrecursively updated with new observations at each step using a transformer. To\nencourage spatial reasoning, we introduce auxiliary tasks and train our model\nto reconstruct explicit maps as well as to predict visual features, semantic\nlabels and actions. Our method significantly outperforms the state of the art\non the challenging MP3D dataset and generalizes well to the HM3D dataset. We\nsuccessfully deploy our model on a real robot and achieve encouraging object\ngoal navigation results in real scenes using only a few real-world\ndemonstrations. Code, trained models and videos are available at\n\\url{https://www.di.ens.fr/willow/research/onav_rim/}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:21:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Shizhe",""],["Chabal","Thomas",""],["Laptev","Ivan",""],["Schmid","Cordelia",""]]}
{"id":"2308.05603","submitter":"Jonathan Bares","authors":"Elisabeth Agoritsas and Jonathan Bar\\'es","title":"Loss of memory of an elastic line on its way to limit cycles","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":"  Under an oscillating mechanical drive, an amorphous material progressively\nforgets its initial configuration and might eventually converge to a limit\ncycle. Beyond quasistatic drivings, how structurally disordered systems lose or\nrecord such memory remains theoretically challenging. Here we investigate these\nissues in a minimal model system -- with quenched disorder and memory encoded\nin a spatial pattern -- where the oscillating protocol can formally be replaced\nby finite positive-velocity driving. We consider an elastic line driven at zero\ntemperature in a fixed disordered landscape, with bi-periodic boundary\nconditions and tunable system size. This setting allows us to control the area\nswept by the line at each cycle in a given disorder realisation, as would the\namplitude of an oscillating drive. We find that the line converges to\ndisorder-dependent limit cycles, jointly for its geometrical \\emph{and}\nvelocity profiles. Moreover, the way it forgets its initial condition is\nstrongly coupled to the nature of the velocity dynamics it displays depending\non system size. We conclude on the implications of these results for the\nresponse of amorphous materials under \\emph{non}-quasistatic oscillating\nprotocols.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:22:40 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Agoritsas","Elisabeth",""],["Bar\u00e9s","Jonathan",""]]}
{"id":"2308.05604","submitter":"Mariela Mart\\'inez-Paredes","authors":"Mariela Mart\\'inez-Paredes, Gustavo Bruzual, Christophe Morisset,\n  Minsun Kim, Marcio Mel\\'endez and Luc Binette","title":"On the origin of optical and IR emission lines in star forming galaxies","comments":"Accepted for publication in MNRAS","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":"  Combining the {\\sc Cloudy} photoionization code with updated stellar\npopulation synthesis results, we simultaneously model the MIR $\\neiii/\\neii$\nvs. $\\oiv/\\neiii$, the MIR-FIR $\\neiii/\\neii$ vs. $\\oiv/\\oiii$ and the\nclassical BPT diagnostic diagrams. We focus on the properties of optically\nclassified \\hii\\,galaxies that lie in the normal star forming zone in the MIR\ndiagnostic diagram. We find that a small fraction of our models lie in this\nzone, but most of them correspond to the lowest explored metallicity,\n\\zstar\\,=\\,0.0002, at age $\\sim1$ Gyr. This value of \\zstar\\,is, by far, lower\nthan the values derived for these galaxies from optical emission lines,\nsuggesting that the far-UV emission produced by post-AGB stars (a.k.a. HOLMES,\nhot low-mass evolved stars) is NOT the source of ionization. Instead, shock\nmodels can easily reproduce this part of the MIR diagram. We suggest that it is\nlikely that some of these galaxies have been misclassified and that in them,\nshocks, produced by a weak AGN-outflow, could be an important source of\nionizaton. Using a subset of our models, we derive a new demarcation line for\nthe maximal contribution of retired galaxies in the BPT diagram. This\ndemarcation line allows for a larger contamination from the neighbouring\nAGN-dominated region. Considering the importance of disentangling the different\nionising mechanisms in weak or deeply obscured systems, new observational\nefforts to classify galaxies both in the optical and IR are required to better\nconstrain this kind of models and understand their evolutionary paths.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:27:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mart\u00ednez-Paredes","Mariela",""],["Bruzual","Gustavo",""],["Morisset","Christophe",""],["Kim","Minsun",""],["Mel\u00e9ndez","Marcio",""],["Binette","Luc",""]]}
{"id":"2308.05605","submitter":"Jianbing Shen","authors":"Wencheng Han, Junbo Yin and Jianbing Shen","title":"Self-Supervised Monocular Depth Estimation by Direction-aware Cumulative\n  Convolution Network","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Monocular depth estimation is known as an ill-posed task in which objects in\na 2D image usually do not contain sufficient information to predict their\ndepth. Thus, it acts differently from other tasks (e.g., classification and\nsegmentation) in many ways. In this paper, we find that self-supervised\nmonocular depth estimation shows a direction sensitivity and environmental\ndependency in the feature representation. But the current backbones borrowed\nfrom other tasks pay less attention to handling different types of\nenvironmental information, limiting the overall depth accuracy. To bridge this\ngap, we propose a new Direction-aware Cumulative Convolution Network (DaCCN),\nwhich improves the depth feature representation in two aspects. First, we\npropose a direction-aware module, which can learn to adjust the feature\nextraction in each direction, facilitating the encoding of different types of\ninformation. Secondly, we design a new cumulative convolution to improve the\nefficiency for aggregating important environmental information. Experiments\nshow that our method achieves significant improvements on three widely used\nbenchmarks, KITTI, Cityscapes, and Make3D, setting a new state-of-the-art\nperformance on the popular benchmarks with all three types of self-supervision.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:32:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Han","Wencheng",""],["Yin","Junbo",""],["Shen","Jianbing",""]]}
{"id":"2308.05606","submitter":"Karl Glazebrook","authors":"Karl Glazebrook, Themiya Nanayakkara, Corentin Schreiber, Claudia\n  Lagos, Lalitwadee Kawinwanichakij, Colin Jacobs, Harry Chittenden, Gabriel\n  Brammer, Glenn G. Kacprzak, Ivo Labbe, Danilo Marchesini, Z. Cemile Marsan,\n  Pascal A. Oesch, Casey Papovich, Rhea-Silvia Remus, Kim-Vy H. Tran, James\n  Esdaile, Angel Chandro Gomez","title":"An extraordinarily massive galaxy that formed its stars at $z \\gtrsim\n  11$","comments":"25 pages, 4 figures","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 formation of galaxies by gradual hierarchical co-assembly of baryons and\ncold dark matter halos is a fundamental paradigm underpinning modern\nastrophysics. A key test of this paradigm is via the observations of massive\ngalaxies at early times as the evolution of the masses and abundances of dark\nmatter halos is straight forward to simulate and massive halos should contain\nthe universal cosmic baryon fraction at high redshift. Extremely massive\nquiescent galaxies > $10^{11}$ M$_\\odot$ have now been observed as early as 1-2\nbillions years after the Big Bang producing tension with theoretical models and\ndriving significant revisions. Typical spectroscopic ages of these objects are\n300-500 Myr. Here we report on the spectroscopic observations with the James\nWebb Space Telescope of one of these objects that is quite different from the\nrest; selected by it having much redder colours. We see spectral features\ntypical of much older stellar populations and detailed modeling shows that they\nformed at least 1.5 billion years earlier in time $z \\gtrsim 11$ in a rapid\nstar formation event. Dark matter halos massive enough to host these ancestors\nought not to have assembled at this time. This observation may point to a\nsignificant gap in our understanding of early stellar populations, galaxy\nformation and/or the nature of dark matter.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:35:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Glazebrook","Karl",""],["Nanayakkara","Themiya",""],["Schreiber","Corentin",""],["Lagos","Claudia",""],["Kawinwanichakij","Lalitwadee",""],["Jacobs","Colin",""],["Chittenden","Harry",""],["Brammer","Gabriel",""],["Kacprzak","Glenn G.",""],["Labbe","Ivo",""],["Marchesini","Danilo",""],["Marsan","Z. Cemile",""],["Oesch","Pascal A.",""],["Papovich","Casey",""],["Remus","Rhea-Silvia",""],["Tran","Kim-Vy H.",""],["Esdaile","James",""],["Gomez","Angel Chandro",""]]}
{"id":"2308.05607","submitter":"Zuowei Liu","authors":"Mingxuan Du, Rundong Fang, Zuowei Liu, Wenxi Lu, Zicheng Ye","title":"Probing invisible dark photon models via atmospheric collisions","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atmospheric collisions can copiously produce dark sector particles in the\ninvisible dark photon model, leading to detectable signals in underground\nneutrino detectors. We consider the dark photon model with the mass mixing\nmechanism and use the Super-K detector to detect the electron recoil events\ncaused by the atmospherically produced dark sector particles within the model.\nWe find that the combined data from four Super-K runs yield new leading\nconstraints for the invisible dark photon in the mass range of $\\sim(0.5-1.4)$\nGeV, surpassing the constraints from NA64, BaBar, and searches for millicharged\nparticles.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:36:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Du","Mingxuan",""],["Fang","Rundong",""],["Liu","Zuowei",""],["Lu","Wenxi",""],["Ye","Zicheng",""]]}
{"id":"2308.05608","submitter":"John Sebastian Simon","authors":"\\v{S}\\'arka Ne\\v{c}asov\\'a and John Sebastian H. Simon","title":"On a nonlocal two-phase flow with convective heat transfer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a system describing the dynamics of a two-phase flow of\nincompressible viscous fluids influenced by the convective heat transfer of\nCaginalp-type. The separation of the fluids is expressed by the order parameter\nwhich is of diffuse interface and is known as the Cahn-Hilliard model. We shall\nconsider a nonlocal version of the Cahn-Hilliard model which replaces the\ngradient term in the free energy functional into a spatial convolution operator\nacting on the order parameter and incorporate with it a potential that is\nassumed to satisfy an arbitrary polynomial growth. The order parameter is\ninfluenced by the fluid velocity by means of convection, the temperature\naffects the interface via a modification of the Landau-Ginzburg free energy.\nThe fluid is governed by the Navier--Stokes equations which is affected by the\norder parameter and the temperature by virtue of the capillarity between the\ntwo fluids. The temperature on the other hand satisfies a parabolic equation\nthat considers latent heat due to phase transition and is influenced by the\nfluid via convection. The goal of this paper is to prove the global existence\nof weak solutions and show that, for an appropriate choice of sequence of\nconvolutional kernels, the solutions of the nonlocal system converges to its\nlocal version.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:38:04 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 14:59:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ne\u010dasov\u00e1","\u0160\u00e1rka",""],["Simon","John Sebastian H.",""]]}
{"id":"2308.05609","submitter":"Diana Sousa","authors":"Pedro Ruas, Diana F. Sousa, Andr\\'e Neves, Carlos Cruz, Francisco M.\n  Couto","title":"LASIGE and UNICAGE solution to the NASA LitCoin NLP Competition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biomedical Natural Language Processing (NLP) tends to become cumbersome for\nmost researchers, frequently due to the amount and heterogeneity of text to be\nprocessed. To address this challenge, the industry is continuously developing\nhighly efficient tools and creating more flexible engineering solutions. This\nwork presents the integration between industry data engineering solutions for\nefficient data processing and academic systems developed for Named Entity\nRecognition (LasigeUnicage\\_NER) and Relation Extraction (BiOnt). Our design\nreflects an integration of those components with external knowledge in the form\nof additional training data from other datasets and biomedical ontologies. We\nused this pipeline in the 2022 LitCoin NLP Challenge, where our team\nLasigeUnicage was awarded the 7th Prize out of approximately 200 participating\nteams, reflecting a successful collaboration between the academia (LASIGE) and\nthe industry (Unicage). The software supporting this work is available at\n\\url{https://github.com/lasigeBioTM/Litcoin-Lasige_Unicage}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:41:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ruas","Pedro",""],["Sousa","Diana F.",""],["Neves","Andr\u00e9",""],["Cruz","Carlos",""],["Couto","Francisco M.",""]]}
{"id":"2308.05610","submitter":"Csaba Fabri","authors":"Csaba F\\'abri","title":"Practical guide to the statistical mechanics of molecular polaritons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A theoretical approach aimed at the quantum statistical mechanics of a\nmolecular ensemble coupled to a lossless cavity mode is presented. A canonical\nensemble is considered and an approximate formula is devised for the Helmholtz\nfree energy correction due to cavity-molecule coupling, which enables the\nderivation of experimentally measurable thermodynamic quantities. The frequency\nof the cavity mode is assumed to lie in the infrared range. Therefore, the\ncavity couples to molecular vibrations and our treatment can be restricted to\nthe electronic ground state of the molecule. The method is tested for an\nanalytically solvable model system of one-dimensional harmonic oscillators\ncoupled to the cavity. The performance of the approximation and its range of\nvalidity are discussed in detail. It is shown that the leading-order correction\nto the Helmholtz free energy is proportional to the square of the collective\ncoupling strength. We also demonstrate that the cavity mode does not have a\nsignificant impact on the thermodynamic properties of the system in the\ncollective ultrastrong coupling regime (the collective coupling strength is\ncomparable to the frequency of the cavity mode).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:52:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["F\u00e1bri","Csaba",""]]}
{"id":"2308.05611","submitter":"Satoru Morita","authors":"Satoru Morita","title":"Representation of degree correlation using eigenvalue decomposition and\n  its application to epidemic models","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech nlin.AO q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Degree correlation plays a crucial role in studying network structures;\nhowever, its varied forms pose challenges to understanding its impact on\nnetwork dynamics. This study devised a method that uses eigenvalue\ndecomposition to characterize degree correlations. Additionally, the\napplicability of this method was demonstrated by approximating the basic and\ntype reproduction numbers in an epidemic network model. The findings elucidate\nthe interplay between degree correlations and epidemic behavior, thus\ncontributing to a deeper understanding of complex networks and their dynamics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:52:42 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Morita","Satoru",""]]}
{"id":"2308.05612","submitter":"D. Adriana G\\'omez-Rosal","authors":"D. Adriana G\\'omez-Rosal, Max Bergau, Georg K.J. Fischer, Andreas\n  Wachaja, Johannes Gr\\\"ater, Matthias Odenweller, Uwe Piechottka, Fabian\n  Hoeflinger, Nikhil Gosala, Niklas Wetzel, Daniel B\\\"uscher, Abhinav Valada,\n  Wolfram Burgard","title":"A Smart Robotic System for Industrial Plant Supervision","comments":"Accepted for publication in IEEE Sensors 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In today's chemical production plants, human field operators perform frequent\nchecks on the plant's integrity to guarantee high safety standards, and thus\nare possibly the first to encounter dangerous operating conditions. To\nalleviate their tasks of failure detection and monitoring by audio, visual, and\nolfactory perceptions, we present a robotic system that consists of an\nautonomously navigating robot integrated with various sensors and data\nprocessing. We aim to resemble the human sensing and interpretation\ncapabilities of sight, smell, and hearing, for providing automated inspection.\nWe evaluate our system extensively at a wastewater facility in full working\nconditions. Our results demonstrate that the system is able to robustly\nnavigate a plant and to provide useful information about critical operating\nconditions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:54:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["G\u00f3mez-Rosal","D. Adriana",""],["Bergau","Max",""],["Fischer","Georg K. J.",""],["Wachaja","Andreas",""],["Gr\u00e4ter","Johannes",""],["Odenweller","Matthias",""],["Piechottka","Uwe",""],["Hoeflinger","Fabian",""],["Gosala","Nikhil",""],["Wetzel","Niklas",""],["B\u00fcscher","Daniel",""],["Valada","Abhinav",""],["Burgard","Wolfram",""]]}
{"id":"2308.05613","submitter":"Sophia Stasevic","authors":"S. Stasevic, J. Milli, J. Mazoyer, A.-M. Lagrange, M. Bonnefoy, V.\n  Faramaz-Gorka, F. M\\'enard, A. Boccaletti, E. Choquet, L. Shuai, J. Olofsson,\n  A. Chomez, B. Ren, P. Rubini, C. Desgrange, R. Gratton, G. Chauvin, A. Vigan,\n  E. Matthews","title":"An inner warp discovered in the disk around HD 110058 using VLT/SPHERE\n  and HST/STIS","comments":"17 pages, 15 figures, 3 tables; accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An edge-on debris disk was detected in 2015 around the young, nearby A0V star\nHD 110058. The disk showed features resembling those seen in the disk of beta\nPictoris that could indicate the presence of a perturbing planetary-mass\ncompanion in the system. We investigated new and archival scattered light\nimages of the disk in order to characterise its morphology and spectrum. In\nparticular, we analysed the disk's warp to constrain the properties of possible\nplanetary perturbers. Our work uses data from two VLT/SPHERE observations and\narchival data from HST/STIS. We measured the morphology of the disk by\nanalysing vertical profiles along the length of the disk to extract the\ncentroid spine position and vertical height. We extracted the surface\nbrightness and reflectance spectrum of the disk. We detect the disk between 20\nau (with SPHERE) and 150 au (with STIS), at a position angle of\n159.6$^\\circ\\pm$0.6$^\\circ$. Analysis of the spine shows an asymmetry between\nthe two sides of the disk, with a 3.4$^\\circ\\pm$0.9$^\\circ$ warp between ~20 au\nand 60 au. The disk is marginally vertically resolved in scattered light, with\na vertical aspect ratio of 9.3$\\pm$0.7% at 45 au. The extracted reflectance\nspectrum is featureless, flat between 0.95 micron and 1.1 micron, and red from\n1.1 micron to 1.65 micron. The outer parts of the disk are also asymmetric with\na tilt between the two sides compatible with a disk made of forward-scattering\nparticles and seen not perfectly edge-on, suggesting an inclination of\n<84$^\\circ$. The presence of an undetected planetary-mass companion on an\ninclined orbit with respect to the disk could explain the warp. The\nmisalignment of the inner parts of the disk with respect to the outer disk\nsuggests a warp that has not yet propagated to the outer parts of the disk,\nfavouring the scenario of an inner perturber as the origin of the warp.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:56:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Stasevic","S.",""],["Milli","J.",""],["Mazoyer","J.",""],["Lagrange","A. -M.",""],["Bonnefoy","M.",""],["Faramaz-Gorka","V.",""],["M\u00e9nard","F.",""],["Boccaletti","A.",""],["Choquet","E.",""],["Shuai","L.",""],["Olofsson","J.",""],["Chomez","A.",""],["Ren","B.",""],["Rubini","P.",""],["Desgrange","C.",""],["Gratton","R.",""],["Chauvin","G.",""],["Vigan","A.",""],["Matthews","E.",""]]}
{"id":"2308.05614","submitter":"Gauri Kamat","authors":"Gauri Kamat, Mingyang Shan, and Roee Gutman","title":"Bayesian Record Linkage with Variables in One File","comments":null,"journal-ref":"Statistics in Medicine, 2023","doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many healthcare and social science applications, information about units\nis dispersed across multiple data files. Linking records across files is\nnecessary to estimate the associations of interest. Common record linkage\nalgorithms only rely on similarities between linking variables that appear in\nall the files. Moreover, analysis of linked files often ignores errors that may\narise from incorrect or missed links. Bayesian record linking methods allow for\nnatural propagation of linkage error, by jointly sampling the linkage structure\nand the model parameters. We extend an existing Bayesian record linkage method\nto integrate associations between variables exclusive to each file being\nlinked. We show analytically, and using simulations, that this method can\nimprove the linking process, and can yield accurate inferences. We apply the\nmethod to link Meals on Wheels recipients to Medicare Enrollment records.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:58:36 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 16:14:45 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 00:59:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kamat","Gauri",""],["Shan","Mingyang",""],["Gutman","Roee",""]]}
{"id":"2308.05615","submitter":"Vitaliy Slyn'ko","authors":"Vladyslav Bivziuk, Sergey Dashkovskiy and Vitalii Slynko","title":"Comparison theorem for infinite-dimensional linear impulsive systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a linear impulsive system in an infinite-dimensional Banach\nspace. It is assumed that the moments of impulsive action satisfy the averaged\ndwell-time condition and the linear operator on the right side of the\ndifferential equation generates an analytic semigroup in the state space. Using\ncommutator identities, we prove a comparison theorem that reduces the problem\nof asymptotic stability of the original system to the study of a simpler system\nwith constant dwell-times. An illustrative example of a linear impulsive system\nof parabolic type in which the continuous and discrete dynamics are both\nunstable is given.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:58:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bivziuk","Vladyslav",""],["Dashkovskiy","Sergey",""],["Slynko","Vitalii",""]]}
{"id":"2308.05616","submitter":"Cameron Pratt","authors":"Nichole Gray, Cameron Pratt, Joel Bregman","title":"Recovering the O VII Absorption Distributions from X-Ray Data","comments":"12 pages, 7 figures, 1 table, accepted by SPIE","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The absorption by gas toward background continuum sources informs us about\nthe cosmic density of gas components as well as the hosts responsible for the\nabsorption (galaxies, clusters, cosmic filaments). Cosmic absorption line\ndistributions are distorted near the detection threshold (S/N $\\approx 3$) due\nto true lines being scattered to lower S/N and false detections occurring at\nthe same S/N. We simulate absorption line distributions in the presence of\nnoise and consider two models for recovery: a parametric fitting of the noise\nplus a cut-off power law absorption line distribution; a non-parametric fit\nwhere the negative absorption line distribution (emission lines) is subtracted\nfrom the positive S/N absorption line distribution (flip and subtract). We show\nthat both approaches work equally well and can use data where S/N$\\gtrsim$3 to\nconstrain the fit. For an input of about 100 absorption line systems, the\nnumber of systems is recovered to $\\approx$14%. This investigation examined the\nO VII X-ray absorption line distribution, but the approach should be broadly\napplicable for statistically well-behaved data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:00:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gray","Nichole",""],["Pratt","Cameron",""],["Bregman","Joel",""]]}
{"id":"2308.05617","submitter":"Hanzhao Wang","authors":"Hanzhao Wang, Zhongze Cai, Xiaocheng Li, Kalyan Talluri","title":"A Neural Network Based Choice Model for Assortment Optimization","comments":"arXiv admin note: substantial text overlap with arXiv:2208.09325","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Discrete-choice models are used in economics, marketing and revenue\nmanagement to predict customer purchase probabilities, say as a function of\nprices and other features of the offered assortment. While they have been shown\nto be expressive, capturing customer heterogeneity and behaviour, they are also\nhard to estimate, often based on many unobservables like utilities; and\nmoreover, they still fail to capture many salient features of customer\nbehaviour. A natural question then, given their success in other contexts, is\nif neural networks can eliminate the necessity of carefully building a\ncontext-dependent customer behaviour model and hand-coding and tuning the\nestimation. It is unclear however how one would incorporate assortment effects\ninto such a neural network, and also how one would optimize the assortment with\nsuch a black-box generative model of choice probabilities. In this paper we\ninvestigate first whether a single neural network architecture can predict\npurchase probabilities for datasets from various contexts and generated under\nvarious models and assumptions. Next, we develop an assortment optimization\nformulation that is solvable by off-the-shelf integer programming solvers. We\ncompare against a variety of benchmark discrete-choice models on simulated as\nwell as real-world datasets, developing training tricks along the way to make\nthe neural network prediction and subsequent optimization robust and comparable\nin performance to the alternates.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:01:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Hanzhao",""],["Cai","Zhongze",""],["Li","Xiaocheng",""],["Talluri","Kalyan",""]]}
{"id":"2308.05618","submitter":"Liyu Hao","authors":"Liyu Hao, Engang Fu","title":"First-principles calculation on the electronic structures, phonon\n  dynamics, and electrical conductivities of Pb$_{10}$(PO$_4$)$_6$O and\n  Pb$_9$Cu(PO$_4$)$_6$O compounds","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":"  Superconducting materials with high critical temperature have the potential\nto revolutionize many fields, including military, electronic communications,\nand power energy. Therefore, Scientists around the world have been tirelessly\nworking with the ultimate goal of achieving high temperature superconductivity.\nIn 2023, a preprint by S. Lee et al in South Korea claimed the discovery of\nultra-high-temperature superconductivity with a critical temperature of up to\n423 K in Cu-doped lead-apatite (LK-99) (arXiv:2307.12008, arXiv:2307.12037),\nwhich caused a worldwide sensation and attention. Herein, the electronic\nstructures, phonon dynamics, and electrical conductivities of LK-99 and its\nparent compound lead-apatite have been calculated using first-principles\nmethods. The results show that the lead-apatite compound and the LK-99 compound\nare insulator and half-metal respectively. The flat band characteristic is\nconsistent with previous calculations. The electrical conductivity of LK-99\ncompound shows two extreme point, and the electrical conductivity along the\nC-axis increases significantly after 400 K. The phonon dispersion spectra of\nthe compounds were investigated, demonstrating their dynamic instability.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:06:39 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hao","Liyu",""],["Fu","Engang",""]]}
{"id":"2308.05619","submitter":"Erkin Otles","authors":"Erkin \\\"Otle\\c{s}, Brian T. Denton, Jenna Wiens","title":"Updating Clinical Risk Stratification Models Using Rank-Based\n  Compatibility: Approaches for Evaluating and Optimizing Clinician-Model Team\n  Performance","comments":"Conference paper accepted at the 2023 Machine Learning for Healthcare\n  Conference Includes supplemental: 32 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As data shift or new data become available, updating clinical machine\nlearning models may be necessary to maintain or improve performance over time.\nHowever, updating a model can introduce compatibility issues when the behavior\nof the updated model does not align with user expectations, resulting in poor\nuser-model team performance. Existing compatibility measures depend on model\ndecision thresholds, limiting their applicability in settings where models are\nused to generate rankings based on estimated risk. To address this limitation,\nwe propose a novel rank-based compatibility measure, $C^R$, and a new loss\nfunction that aims to optimize discriminative performance while encouraging\ngood compatibility. Applied to a case study in mortality risk stratification\nleveraging data from MIMIC, our approach yields more compatible models while\nmaintaining discriminative performance compared to existing model selection\ntechniques, with an increase in $C^R$ of $0.019$ ($95\\%$ confidence interval:\n$0.005$, $0.035$). This work provides new tools to analyze and update risk\nstratification models used in clinical care.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:08:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["\u00d6tle\u015f","Erkin",""],["Denton","Brian T.",""],["Wiens","Jenna",""]]}
{"id":"2308.05620","submitter":"Erik Pearson","authors":"Erik Pearson and Brendan Englot","title":"A Robust and Rapidly Deployable Waypoint Navigation Architecture for\n  Long-Duration Operations in GPS-Denied Environments","comments":"8 pages, 7 figures, Ubiquitous Robots 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  For long-duration operations in GPS-denied environments, accurate and\nrepeatable waypoint navigation is an essential capability. While simultaneous\nlocalization and mapping (SLAM) works well for single-session operations,\nrepeated, multi-session operations require robots to navigate to the same\nspot(s) accurately and precisely each and every time. Localization and\nnavigation errors can build up from one session to the next if they are not\naccounted for. Localization using a global reference map works well, but there\nare no publicly available packages for quickly building maps and navigating\nwith them. We propose a new architecture using a combination of two publicly\navailable packages with a newly released package to create a fully functional\nmulti-session navigation system for ground vehicles. The system takes just a\nfew hours from the beginning of the first manual scan to perform autonomous\nwaypoint navigation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:09:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pearson","Erik",""],["Englot","Brendan",""]]}
{"id":"2308.05621","submitter":"Francesco Orabona","authors":"Francesco Orabona","title":"Normalized Gradients for All","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this short note, I show how to adapt to H\\\"{o}lder smoothness using\nnormalized gradients in a black-box way. Moreover, the bound will depend on a\nnovel notion of local H\\\"{o}lder smoothness. The main idea directly comes from\nLevy [2017].\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:10:08 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Orabona","Francesco",""]]}
{"id":"2308.05622","submitter":"Vladimir Alexandrovich Krykhtin","authors":"I.L. Buchbinder, S.A. Fedoruk, A.P. Isaev, V.A. Krykhtin","title":"Lagrangian formulation for free $6D$ infinite spin field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a Lagrangian that describes the dynamics of a six-dimensional\nfree infinite (continuous) spin field in $6D$ Minkowski space. The Lagrangian\nis formulated in the framework of the BRST approach to higher spin field theory\nand is based on a system of constraints defining an irreducible representation\nof the corresponding Poincar\\'e group. The field realization of generators in\nthe $6D$ Poincar\\'e algebra and the second-, fourth-, and sixth-order Casimir\noperators are obtained in explicit form using additional spinor coordinates.\nSpecific aspects of such a realization in six dimensions are discussed. We\nderive the conditions that determine the irreducible representation $6D$\ninfinite spin field and reformulate them as operators in the Fock space forming\na first-class algebra in terms of commutators. These operators are used to\nconstruct the BRST charge and the corresponding Lagrangian. We prove that the\nconditions of the irreducible representation are reproduced as the consequence\nof the Lagrangian equations of motion, which finally provides the correctness\nof the results obtained.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:12:18 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 15:50:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Buchbinder","I. L.",""],["Fedoruk","S. A.",""],["Isaev","A. P.",""],["Krykhtin","V. A.",""]]}
{"id":"2308.05623","submitter":"Elizabeth Winstanley","authors":"Thomas Morley, Sivakumar Namasivayam and Elizabeth Winstanley","title":"Renormalized stress-energy tensor on global anti-de Sitter space-time\n  with Robin boundary conditions","comments":"17 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the renormalized stress-energy tensor (RSET) for a massless,\nconformally coupled scalar field on global anti-de Sitter space-time in four\ndimensions. Robin (mixed) boundary conditions are applied to the scalar field.\nWe compute both the vacuum and thermal expectation values of the RSET. The\nvacuum RSET is a multiple of the space-time metric when either Dirichlet or\nNeumann boundary conditions are applied. Imposing Robin boundary conditions\nbreaks the maximal symmetry of the vacuum state and results in an RSET whose\ncomponents with mixed indices have their maximum (or maximum magnitude) at the\nspace-time origin. The value of this maximum depends on the boundary\nconditions. We find similar behaviour for thermal states. As the temperature\ndecreases, thermal expectation values of the RSET approach those for vacuum\nstates and their values depend strongly on the boundary conditions. As the\ntemperature increases, the values of the RSET components tend to profiles which\nare the same for all boundary conditions. We also find, for both vacuum and\nthermal states, that the RSET on the space-time boundary is independent of the\nboundary conditions and determined entirely by the trace anomaly.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:12:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Morley","Thomas",""],["Namasivayam","Sivakumar",""],["Winstanley","Elizabeth",""]]}
{"id":"2308.05624","submitter":"Giancarlo Urzua","authors":"Fernando Figueroa, Julie Rana, Giancarlo Urz\\'ua","title":"Optimal bounds for many T-singularities in stable surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.GT math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We effectively bound T-singularities on non-rational projective surfaces with\nan arbitrary amount of T-singularities and ample canonical class. We classify\nall possible geometric situations for which our bound is higher than expected.\nAs an application, we work out in detail the case of two singularities.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:13:43 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Figueroa","Fernando",""],["Rana","Julie",""],["Urz\u00faa","Giancarlo",""]]}
{"id":"2308.05625","submitter":"Giancarlo Urzua","authors":"Giancarlo Urz\\'ua","title":"The Coble-Mukai lattice from $\\mathbb Q$-Gorenstein deformations","comments":"Submitted to the proceedings of the Moduli and Hodge Theory 2021\n  conference at the Institute of the Mathematical Sciences of the Americas","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show some geometric properties of Enriques surfaces via $\\mathbb\nQ$-Gorenstein smoothings of Coble surfaces. In particular, we explicitly\nidentify the Enriques lattice of the general fiber with the Coble-Mukai\nlattice. At the end, we discuss applications to Gorenstein $\\mathbb Q$-Homology\nprojective planes with trivial canonical class.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:13:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Urz\u00faa","Giancarlo",""]]}
{"id":"2308.05626","submitter":"Sahar Shahaf","authors":"Sahar Shahaf and Barak Zackay","title":"A linearized approach to radial velocity extraction","comments":"14 pages, 9 figures. Under review in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-precision radial velocity (RV) measurements are crucial for exoplanet\ndetection and characterisation. Efforts to achieve ~10 cm/s precision have been\nmade over the recent decades, with significant advancements in instrumentation,\ndata reduction techniques, and statistical inference methods. However, despite\nthese efforts, RV precision is currently limited to ~50 cm/s. This value\nexceeds state-of-the-art spectrographs' expected instrumental noise floor and\nis mainly attributed to RV signals induced by stellar variability. In this\nwork, we propose a factorisation method to overcome this limitation. The\nfactorisation is particularly suitable for controlling the effect of localised\nchanges in the stellar emission profile, assuming some smooth function of a few\nastrophysical parameters governs them. We use short-time Fourier transforms\n(STFT) to infer the RV in a procedure equivalent to least-squares minimisation\nin the wavelength domain and demonstrate the effectiveness of our method in\ntreating arbitrary temperature fluctuations on the star's surface. The proposed\nprescription can be naturally generalised to account for other effects, either\nintrinsic to the star, such as magnetic fields, or extrinsic to it, such as\ntelluric contamination. As a proof-of-concept, we empirically derive a set of\nfactorisation terms describing the Solar centre-to-limb variation and apply\nthem to a set of realistic SOAP-GPU spectral simulations. We discuss the\nmethod's capability to mitigate variability-induced RV signals and its\npotential extensions to serve as a tomographic tool.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:14:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shahaf","Sahar",""],["Zackay","Barak",""]]}
{"id":"2308.05627","submitter":"Adrian Lubitz","authors":"Adrian Lubitz, Lisa Gutzeit and Frank Kirchner","title":"CoBaIR: A Python Library for Context-Based Intention Recognition in\n  Human-Robot-Interaction","comments":"7 Pages, 3 Figures, to be published in proceedings of IEEE RO-MAN\n  Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human-Robot Interaction (HRI) becomes more and more important in a world\nwhere robots integrate fast in all aspects of our lives but HRI applications\ndepend massively on the utilized robotic system as well as the deployment\nenvironment and cultural differences. Because of these variable dependencies it\nis often not feasible to use a data-driven approach to train a model for human\nintent recognition. Expert systems have been proven to close this gap very\nefficiently. Furthermore, it is important to support understandability in HRI\nsystems to establish trust in the system. To address the above-mentioned\nchallenges in HRI we present an adaptable python library in which current\nstate-of-the-art Models for context recognition can be integrated. For\nContext-Based Intention Recognition a two-layer Bayesian Network (BN) is used.\nThe bayesian approach offers explainability and clarity in the creation of\nscenarios and is easily extendable with more modalities. Additionally, it can\nbe used as an expert system if no data is available but can as well be\nfine-tuned when data becomes available.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:15:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lubitz","Adrian",""],["Gutzeit","Lisa",""],["Kirchner","Frank",""]]}
{"id":"2308.05628","submitter":"Yongqing Cai","authors":"Zheng Shu, Bowen Wang, Xiangyue Cui, Xuefei Yan, Hejin Yan, Huaxian\n  Jia, Yongqing Cai","title":"High-performance Thermoelectric Monolayer {\\gamma}-GeSe and its Group-IV\n  Monochalcogenide Isostructural Family","comments":null,"journal-ref":"Chem. Eng. J. 454, 140242 (2023)","doi":"10.1016/j.cej.2022.140242","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently synthesized novel phase of germanium selenide ({\\gamma}-GeSe) adopts\na hexagonal lattice and a surprisingly high conductivity than graphite. This\ntriggers great interests in exploring its potential for thermoelectric\napplications. Herein, we explored the thermoelectric performance of monolayer\n{\\gamma}-GeSe and other isostructural {\\gamma}-phase of group-IV\nmonochalcogenides {\\gamma}-GeX (X = S, Se and Te) using the density functional\ntheory and the Boltzmann transport theory. A superb thermoelectric performance\nof monolayer {\\gamma}-GeSe is revealed with figure of merit ZT value up to\n1.13-2.76 for n-type doping at a moderate carrier concentration of\n4.73-2.58x10^12 cm-2 between 300 and 600 K. This superb performance is rooted\nin its rich pocket states and flat plateau levels around the electronic band\nedges, leading to promoted concentrations and electronic conductivity, and\nlimited thermal conductivity. Our work suggests that monolayer {\\gamma}-GeSe is\na promising candidate for high performance medium-temperature thermoelectric\napplications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:16:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shu","Zheng",""],["Wang","Bowen",""],["Cui","Xiangyue",""],["Yan","Xuefei",""],["Yan","Hejin",""],["Jia","Huaxian",""],["Cai","Yongqing",""]]}
{"id":"2308.05629","submitter":"Rickard Br\\\"annvall","authors":"Rickard Br\\\"annvall, Henrik Forsgren, Fredrik Sandin and Marcus\n  Liwicki","title":"ReLU and Addition-based Gated RNN","comments":"12 pages, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We replace the multiplication and sigmoid function of the conventional\nrecurrent gate with addition and ReLU activation. This mechanism is designed to\nmaintain long-term memory for sequence processing but at a reduced\ncomputational cost, thereby opening up for more efficient execution or larger\nmodels on restricted hardware. Recurrent Neural Networks (RNNs) with gating\nmechanisms such as LSTM and GRU have been widely successful in learning from\nsequential data due to their ability to capture long-term dependencies.\nConventionally, the update based on current inputs and the previous state\nhistory is each multiplied with dynamic weights and combined to compute the\nnext state. However, multiplication can be computationally expensive,\nespecially for certain hardware architectures or alternative arithmetic systems\nsuch as homomorphic encryption. It is demonstrated that the novel gating\nmechanism can capture long-term dependencies for a standard synthetic sequence\nlearning task while significantly reducing computational costs such that\nexecution time is reduced by half on CPU and by one-third under encryption.\nExperimental results on handwritten text recognition tasks furthermore show\nthat the proposed architecture can be trained to achieve comparable accuracy to\nconventional GRU and LSTM baselines. The gating mechanism introduced in this\npaper may enable privacy-preserving AI applications operating under homomorphic\nencryption by avoiding the multiplication of encrypted variables. It can also\nsupport quantization in (unencrypted) plaintext applications, with the\npotential for substantial performance gains since the addition-based\nformulation can avoid the expansion to double precision often required for\nmultiplication.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:18:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Br\u00e4nnvall","Rickard",""],["Forsgren","Henrik",""],["Sandin","Fredrik",""],["Liwicki","Marcus",""]]}
{"id":"2308.05630","submitter":"Samuel Kim","authors":"Samuel Kim, C.J. Martoff, Michael Dion, David Glasgow","title":"Reactor Antineutrino Spectral \"Bump\": Cumulative Fission Yields of\n  Irradiated U-235 and Pu-239 Measured by HPGe Gamma-Ray Spectroscopy","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent measurements of the reactor antineutrino emission show that there\nexists a spectral excess (the \"bump\") in the 5-7 MeV region when compared to\nthe Huber-Muller prediction based on the conversion method. Analysis within an\nalternate prediction technique, the summation method, suggests that the bump\ncould be due to excess contributions from a certain few of the beta-decaying\nfission products. However, it has been shown that when updated fission yield\nvalues are used in the summation method, the predicted excess vanishes. In the\npresent preliminary study, fission yields for nuclides suspected of causing the\nneutrino spectral bump are investigated using gamma-ray spectroscopy of U-235\nand Pu-239 samples freshly irradiated using the High Flux Isotope Reactor. For\nseveral of the suspect nuclides, the derived fission yields are consistent with\nJEFF3.3 fission yield library. The exception is the case of Cs-140 from Pu-239,\nwhere the discrepancy between the fitted and expected values suggests a\npotential error in the fission yield library. This highlights the importance of\nusing accurate nuclear data libraries in the analysis of the reactor\nantineutrino spectra, and the need for ongoing efforts to improve these\nlibraries.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:18:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kim","Samuel",""],["Martoff","C. J.",""],["Dion","Michael",""],["Glasgow","David",""]]}
{"id":"2308.05631","submitter":"Shaozhen Xu","authors":"Yuxin Tan and Shaozhen Xu","title":"Some new decay estimates for $(2+1)$-dimensional degenerate oscillatory\n  integral operators","comments":"This new version adds some missed argument and correct some typos","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 consider the $(2+1)-$dimensional oscillatory integral\noperators with cubic homogeneous polynomial phases, which are degenerate in the\nsense of \\cite{Tan06}. We improve the previously known $L^2\\to L^2$ decay rate\nto $3/8$ and also establish a sharp $L^2\\to L^6$ decay estimate based on\nfractional integration method.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:19:07 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 11:35:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tan","Yuxin",""],["Xu","Shaozhen",""]]}
{"id":"2308.05632","submitter":"Zhu Yi","authors":"Zhu Yi and Zhi-Qiang You and You Wu","title":"Model-independent reconstruction of the primordial curvature power\n  spectrum from PTA data","comments":"16 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently released data from pulsar timing array (PTA) collaborations provide\nstrong evidence for a stochastic signal consistent with a gravitational-wave\nbackground, potentially originating from scalar-induced gravitational waves\n(SIGWs). However, in order to determine whether the SIGWs with a specific power\nspectrum of curvature perturbations can account for the PTA signal, one needs\nto estimate the energy density of the SIGWs, which can be computationally\nexpensive. In this paper, we use a model-independent approach to reconstruct\nthe primordial curvature power spectrum using a free spectrum cross over from\n$10^{1}\\,\\mathrm{Mpc}^{-1}$ to $10^{20}\\,\\mathrm{Mpc}^{-1}$ with NANOGrav\n15-yrs data set. Our results can simplify the task of assessing whether a given\nprimordial curvature power spectrum can adequately explain the observed PTA\nsignal without calculating the energy density of SIGWs.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:19:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Yi","Zhu",""],["You","Zhi-Qiang",""],["Wu","You",""]]}
{"id":"2308.05633","submitter":"Keqiang Fan","authors":"Keqiang Fan, Xiaohao Cai, Mahesan Niranjan","title":"IIHT: Medical Report Generation with Image-to-Indicator Hierarchical\n  Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated medical report generation has become increasingly important in\nmedical analysis. It can produce computer-aided diagnosis descriptions and thus\nsignificantly alleviate the doctors' work. Inspired by the huge success of\nneural machine translation and image captioning, various deep learning methods\nhave been proposed for medical report generation. However, due to the inherent\nproperties of medical data, including data imbalance and the length and\ncorrelation between report sequences, the generated reports by existing methods\nmay exhibit linguistic fluency but lack adequate clinical accuracy. In this\nwork, we propose an image-to-indicator hierarchical transformer (IIHT)\nframework for medical report generation. It consists of three modules, i.e., a\nclassifier module, an indicator expansion module and a generator module. The\nclassifier module first extracts image features from the input medical images\nand produces disease-related indicators with their corresponding states. The\ndisease-related indicators are subsequently utilised as input for the indicator\nexpansion module, incorporating the \"data-text-data\" strategy. The\ntransformer-based generator then leverages these extracted features along with\nimage features as auxiliary information to generate final reports. Furthermore,\nthe proposed IIHT method is feasible for radiologists to modify disease\nindicators in real-world scenarios and integrate the operations into the\nindicator expansion module for fluent and accurate medical report generation.\nExtensive experiments and comparisons with state-of-the-art methods under\nvarious evaluation metrics demonstrate the great performance of the proposed\nmethod.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:22:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fan","Keqiang",""],["Cai","Xiaohao",""],["Niranjan","Mahesan",""]]}
{"id":"2308.05634","submitter":"Hao Cheng","authors":"Mengmeng Liu, Hao Cheng, Michael Ying Yang","title":"Tracing the Influence of Predecessors on Trajectory Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In real-world traffic scenarios, agents such as pedestrians and car drivers\noften observe neighboring agents who exhibit similar behavior as examples and\nthen mimic their actions to some extent in their own behavior. This information\ncan serve as prior knowledge for trajectory prediction, which is unfortunately\nlargely overlooked in current trajectory prediction models. This paper\nintroduces a novel Predecessor-and-Successor (PnS) method that incorporates a\npredecessor tracing module to model the influence of predecessors (identified\nfrom concurrent neighboring agents) on the successor (target agent) within the\nsame scene. The method utilizes the moving patterns of these predecessors to\nguide the predictor in trajectory prediction. PnS effectively aligns the motion\nencodings of the successor with multiple potential predecessors in a\nprobabilistic manner, facilitating the decoding process. We demonstrate the\neffectiveness of PnS by integrating it into a graph-based predictor for\npedestrian trajectory prediction on the ETH/UCY datasets, resulting in a new\nstate-of-the-art performance. Furthermore, we replace the HD map-based\nscene-context module with our PnS method in a transformer-based predictor for\nvehicle trajectory prediction on the nuScenes dataset, showing that the\npredictor maintains good prediction performance even without relying on any map\ninformation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:24:37 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Mengmeng",""],["Cheng","Hao",""],["Yang","Michael Ying",""]]}
{"id":"2308.05635","submitter":"Vitaliy Slyn'ko","authors":"Vitalii Slynko, Sergey Dashkovskiy, Ivan Atamas","title":"Asymptotic stability conditions for linear coupled impulsive systems\n  with time-invariant subsystems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article proposes an approach to construct a Lyapunov function for a\nlinear coupled impulsive system consisting of two time-invariant subsystems. In\ncontrast to various variants of small-gain stability conditions for coupled\nsystems, the asymptotic stability property of independent subsystems is not\nassumed. To analyze the asymptotic stability of a coupled system, the direct\nLyapunov method is used in combination with the discretization method. The\nperiodic case and the case when the Floquet theory is not applicable are\nconsidered separately. The main results are illustrated with examples.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:25:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Slynko","Vitalii",""],["Dashkovskiy","Sergey",""],["Atamas","Ivan",""]]}
{"id":"2308.05636","submitter":"Farzad Nikfam","authors":"Farzad Nikfam, Raffaele Casaburi, Alberto Marchisio, Maurizio Martina\n  and Muhammad Shafique","title":"A Homomorphic Encryption Framework for Privacy-Preserving Spiking Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) is widely used today, especially through deep neural\nnetworks (DNNs), however, increasing computational load and resource\nrequirements have led to cloud-based solutions. To address this problem, a new\ngeneration of networks called Spiking Neural Networks (SNN) has emerged, which\nmimic the behavior of the human brain to improve efficiency and reduce energy\nconsumption. These networks often process large amounts of sensitive\ninformation, such as confidential data, and thus privacy issues arise.\nHomomorphic encryption (HE) offers a solution, allowing calculations to be\nperformed on encrypted data without decrypting it. This research compares\ntraditional DNNs and SNNs using the Brakerski/Fan-Vercauteren (BFV) encryption\nscheme. The LeNet-5 model, a widely-used convolutional architecture, is used\nfor both DNN and SNN models based on the LeNet-5 architecture, and the networks\nare trained and compared using the FashionMNIST dataset. The results show that\nSNNs using HE achieve up to 40% higher accuracy than DNNs for low values of the\nplaintext modulus t, although their execution time is longer due to their\ntime-coding nature with multiple time-steps.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:26:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nikfam","Farzad",""],["Casaburi","Raffaele",""],["Marchisio","Alberto",""],["Martina","Maurizio",""],["Shafique","Muhammad",""]]}
{"id":"2308.05637","submitter":"Zezhou Huang","authors":"Zezhou Huang, Jiaxiang Liu, Haonan Wang, and Eugene Wu","title":"The Fast and the Private: Task-based Dataset Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern dataset search platforms employ ML task-based utility metrics instead\nof relying on metadata-based keywords to comb through extensive dataset\nrepositories. In this setup, requesters provide an initial dataset, and the\nplatform identifies complementary datasets to augment (join or union) the\nrequester's dataset such that the ML model (e.g., linear regression)\nperformance is improved most. Although effective, current task-based data\nsearches are stymied by (1) high latency which deters users, (2) privacy\nconcerns for regulatory standards, and (3) low data quality which provides low\nutility. We introduce Mileena, a fast, private, and high-quality task-based\ndataset search platform. At its heart, Mileena is built on pre-computed\nsemi-ring sketches for efficient ML training and evaluation. Based on\nsemi-ring, we develop a novel Factorized Privacy Mechanism that makes the\nsearch differentially private and scales to arbitrary corpus sizes and numbers\nof requests without major quality degradation. We also demonstrate the early\npromise in using LLM-based agents for automatic data transformation and\napplying semi-rings to support causal discovery and treatment effect\nestimation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:27:59 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 16:28:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Zezhou",""],["Liu","Jiaxiang",""],["Wang","Haonan",""],["Wu","Eugene",""]]}
{"id":"2308.05638","submitter":"Edward Shuryak","authors":"Nicholas Miesch, Edward Shuryak, Ismail Zahed","title":"Baryons and tetraquarks using instanton-induced interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze some aspects of the perturbative and non-perturbative interactions\nin the composition of heavy quarkonia, heavy and light baryons ($ccc$ and $uuu$\nones), as well as all charm tetraquarks ($cc\\bar c\\bar c$). Using the\nhyper-spherical approximation and effective radial potentials (in 6 and 9\ndimensions, respectively) we derive their spectra and wave functions. In all of\nthe cases, we focus on the splittings between the s-shell levels, which are\nremarkably insensitive to the quark masses, but proportional to the effective\ninteraction potentials. We use the traditional Cornell-like potentials, and the\nnon-perturbative instanton-induced static potentials, from correlators of two,\nthree and four Wilson lines, and find rather satisfactory description of\nspectra in all cases.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:29:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Miesch","Nicholas",""],["Shuryak","Edward",""],["Zahed","Ismail",""]]}
{"id":"2308.05639","submitter":"Matyas Barczy","authors":"Matyas Barczy, Sandra Palau","title":"On distributions of jumps of multi-type CBI processes","comments":"50 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the distributional properties of jumps of multi-type continuous\nstate and continuous time branching processes with immigration (multi-type CBI\nprocesses). We derive an expression for the distribution function of the first\njump time of a multi-type CBI process with jump size in a given Borel set\nhaving finite total L\\'evy measure (which is defined as the sum of the measures\nappearing in the branching and immigration mechanisms of the multi-type CBI\nprocess in question). Using this we derive an expression for the distribution\nfunction of the local supremum of the norm of the jumps of a multi-type CBI\nprocess. Further, we show that if $A$ is a nondegenerate rectangle anchored at\nzero and with total L\\'evy measure zero, then the probability that the local\ncoordinate-wise supremum of jumps of the multi-type CBI process belongs to $A$\nis zero. We also prove that a converse statement holds.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:29:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Barczy","Matyas",""],["Palau","Sandra",""]]}
{"id":"2308.05640","submitter":"Yuxin Ma","authors":"Yansong Huang, Zherui Zhang, Ao Jiao, Yuxin Ma, Ran Cheng","title":"A Comparative Visual Analytics Framework for Evaluating Evolutionary\n  Processes in Multi-objective Optimization","comments":"Accepted by IEEE VIS 2023 (will appear in IEEE TVCG)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Evolutionary multi-objective optimization (EMO) algorithms have been\ndemonstrated to be effective in solving multi-criteria decision-making\nproblems. In real-world applications, analysts often employ several algorithms\nconcurrently and compare their solution sets to gain insight into the\ncharacteristics of different algorithms and explore a broader range of feasible\nsolutions. However, EMO algorithms are typically treated as black boxes,\nleading to difficulties in performing detailed analysis and comparisons between\nthe internal evolutionary processes. Inspired by the successful application of\nvisual analytics tools in explainable AI, we argue that interactive\nvisualization can significantly enhance the comparative analysis between\nmultiple EMO algorithms. In this paper, we present a visual analytics framework\nthat enables the exploration and comparison of evolutionary processes in EMO\nalgorithms. Guided by a literature review and expert interviews, the proposed\nframework addresses various analytical tasks and establishes a multi-faceted\nvisualization design to support the comparative analysis of intermediate\ngenerations in the evolution as well as solution sets. We demonstrate the\neffectiveness of our framework through case studies on benchmarking and\nreal-world multi-objective optimization problems to elucidate how analysts can\nleverage our framework to inspect and compare diverse algorithms.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:32:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Huang","Yansong",""],["Zhang","Zherui",""],["Jiao","Ao",""],["Ma","Yuxin",""],["Cheng","Ran",""]]}
{"id":"2308.05641","submitter":"Shijie Gao","authors":"Shi-Jie Gao and Xiang-Dong Li","title":"The White Dwarf Mass-Orbital Period Relation Under Wind Mass Loss","comments":"11 pages, 8 figures, 3 tables, accepted for publication in MNRAS,\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":"  Helium white dwarfs (HeWDs) are thought to form from low-mass red giant stars\nexperiencing binary interaction. Because the helium core mass of a red giant\nstar is closely related to the stellar radius, there exists well-known relation\nbetween the orbital period ($P_{\\rm orb}$) and the mass ($M_{\\rm WD}$) of the\nHeWDs, which is almost independent of the type of the companion star.\nTraditional derivation of the $M_{\\rm WD}$-$P_{\\rm orb}$ relation generally\nneglected the effect of wind mass loss from the red giants, while observations\nshow that wind mass loss from red giants in binary systems is systematically\nhigher than that from isolated stars. In this work, we calculate binary\nevolution with tidally enhanced stellar wind (TEW) and find that it causes\nsignificantly scatter of the traditional $M_{\\rm WD}$-$P_{\\rm orb}$ relation.\nThe TEW can prevent the red giants from overflowing their Roche lobes and slow\ndown the growth of the helium core, leaving a lower-mass HeWD for given orbital\nperiod. This scenario may account for some of the HeWD binaries that deviate\nfrom the traditional $M_{\\rm WD}$-$P_{\\rm orb}$ relation. However, we point out\nthat observations of more HeWD binaries in wide orbits are needed to test the\nTEW model and to constrain the enhanced wind factor.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:33:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Gao","Shi-Jie",""],["Li","Xiang-Dong",""]]}
{"id":"2308.05642","submitter":"Gurucharan Mohanta","authors":"Gurucharan Mohanta, Ketan M. Patel","title":"Gauged $SU(3)_F$ and loop induced quark and lepton masses","comments":"25 pages, 5 tables, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate a local $SU(3)_F$ flavour symmetry for its viability in\ngenerating the masses for the quarks and charged leptons of the first two\nfamilies through radiative corrections. Only the third-generation fermions get\ntree-level masses due to specific choice of the field content and their gauge\ncharges. Unprotected by symmetry, the remaining fermions acquire non-vanishing\nmasses through the quantum corrections induced by the gauge bosons of broken\n$SU(3)_F$. We show that inter-generational hierarchy between the masses of the\nfirst two families arises if the flavour symmetry is broken with an\nintermediate $SU(2)$ leading to a specific ordering in the masses of the gauge\nbosons. Based on this scheme, we construct an explicit and predictive model and\nshow its viability in reproducing the realistic charged fermion masses and\nquark mixing parameters in terms of not-so-hierarchical fundamental couplings.\nThe model leads to the strange quark mass, $m_s \\approx 16$ MeV at $M_Z$, which\nis $\\sim 2.4 \\sigma$ away from its current central value. Large flavour\nviolations are a generic prediction of the scheme which pushes the masses of\nthe new gauge bosons to $10^3$ TeV or higher.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:35:33 GMT"}],"update_date":"2023-08-13","authors_parsed":[["Mohanta","Gurucharan",""],["Patel","Ketan M.",""]]}
{"id":"2308.05643","submitter":"Javad Asadzade","authors":"Javad A. Asadzade","title":"On solvability in the small of higher order elliptic equations in\n  Orlicz-Sobolev spaces","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 article, we consider a higher-order elliptic equation with nonsmooth\ncoefficients with respect to Orlicz spaces on the domain\n$\\Omega\\subset\\mathbb{R}^{n}$. The separable subspace of this space is\ndistinguished in which infinitely differentiable and compactly supported\nfunctions are dense; Sobolev spaces generated by these subspaces are\ndetermined. We demonstrate the local solvability of the equation in\nOrlicz-Sobolev spaces under specific restrictions on the coefficients of the\nequation and the Boyd indices of the Orlicz space. This result strengthens the\npreviously known classical $L_{p}$ analog.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:37:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Asadzade","Javad A.",""]]}
{"id":"2308.05644","submitter":"Khaza Anuarul Hoque","authors":"Ernest Bonnah, Khaza Anuarul Hoque","title":"QTWTL: Quality Aware Time Window Temporal Logic for Performance\n  Monitoring","comments":"Accepted for publication in the ACM/IEEE MEMOCODE 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.PF cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In various service-oriented applications such as distributed autonomous\ndelivery, healthcare, tourism, transportation, and many others, where service\nagents need to perform serial and time-bounded tasks to achieve their goals,\nquality of service must constantly be assured. In addition to safety\nrequirements, such agents also need to fulfill performance requirements in\norder to satisfy their quality of service. This paper proposes the novel\nquality-aware time window temporal logic (QTWTL) by extending the traditional\ntime window temporal logic (TWTL) with two operators for counting and\naggregation operations. We also propose offline runtime monitoring algorithms\nfor the performance monitoring of QTWTL specifications. To analyze the\nfeasibility and efficiency of our proposed approach, we generate a large number\nof traces using the New York City Taxi and Limousine Commission Trip Record\ndata, formalize their performance requirements using QTWTL, and monitor them\nusing the proposed algorithms. The obtained results show that the monitoring\nalgorithm has a linear space and time complexity with respect to the number of\ntraces monitored.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:37:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bonnah","Ernest",""],["Hoque","Khaza Anuarul",""]]}
{"id":"2308.05645","submitter":"Jian-Min Zuo","authors":"Hsu-Chih Ni, Renliang Yuan, Jiong Zhang, Jian-Min Zuo","title":"Framework of compressive sensing and data compression for 4D-STEM","comments":"17 pages, 5 figures","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":"  Four-dimensional Scanning Transmission Electron Microscopy (4D-STEM) is a\npowerful technique for high-resolution and high-precision materials\ncharacterization at multiple length scales, including the characterization of\nbeam-sensitive materials. However, the field of view of 4D-STEM is relatively\nsmall, which in absence of live processing is limited by the data size required\nfor storage. Furthermore, the rectilinear scan approach currently employed in\n4D-STEM places a resolution- and signal-dependent dose limit for the study of\nbeam sensitive materials. Improving 4D-STEM data and dose efficiency, by\nkeeping the data size manageable while limiting the amount of electron dose, is\nthus critical for broader applications. Here we develop a general method for\nreconstructing 4D-STEM data with subsampling in both real and reciprocal spaces\nat high fidelity. The approach is first tested on the subsampled datasets\ncreated from a full 4D-STEM dataset, and then demonstrated experimentally using\nrandom scan in real-space. The same reconstruction algorithm can also be used\nfor compression of 4D-STEM datasets, leading to a large reduction (100 times or\nmore) in data size, while retaining the fine features of 4D-STEM imaging, for\ncrystalline samples.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:42:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ni","Hsu-Chih",""],["Yuan","Renliang",""],["Zhang","Jiong",""],["Zuo","Jian-Min",""]]}
{"id":"2308.05646","submitter":"Yeshwanth Nagaraj","authors":"Yeshwanth Nagaraj, Ujjwal Gupta","title":"AST-MHSA : Code Summarization using Multi-Head Self-Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.PL cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Code summarization aims to generate concise natural language descriptions for\nsource code. The prevailing approaches adopt transformer-based encoder-decoder\narchitectures, where the Abstract Syntax Tree (AST) of the source code is\nutilized for encoding structural information. However, ASTs are much longer\nthan the corresponding source code, and existing methods ignore this size\nconstraint by directly feeding the entire linearized AST into the encoders.\nThis simplistic approach makes it challenging to extract truly valuable\ndependency relations from the overlong input sequence and leads to significant\ncomputational overhead due to self-attention applied to all nodes in the AST.\n  To address this issue effectively and efficiently, we present a model,\nAST-MHSA that uses multi-head attention to extract the important semantic\ninformation from the AST. The model consists of two main components: an encoder\nand a decoder. The encoder takes as input the abstract syntax tree (AST) of the\ncode and generates a sequence of hidden states. The decoder then takes these\nhidden states as input and generates a natural language summary of the code.\n  The multi-head attention mechanism allows the model to learn different\nrepresentations of the input code, which can be combined to generate a more\ncomprehensive summary. The model is trained on a dataset of code and summaries,\nand the parameters of the model are optimized to minimize the loss between the\ngenerated summaries and the ground-truth summaries.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:43:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nagaraj","Yeshwanth",""],["Gupta","Ujjwal",""]]}
{"id":"2308.05647","submitter":"Marie-Luise Steinmeyer","authors":"Marie-Luise Steinmeyer, Peter Woitke, Anders Johansen","title":"Sublimation of refractory minerals in the gas envelopes of accreting\n  rocky planets","comments":"17 pages, 10 figures, accepted in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Protoplanets growing within the protoplanetary disk by pebble accretion\nacquire hydrostatic gas envelopes. Due to accretion heating, the temperature in\nthese envelopes can become high enough to sublimate refractory minerals which\nare the major components of the accreted pebbles. Here we study the sublimation\nof different mineral species and determine whether sublimation plays a role\nduring the growth by pebble accretion. For each snapshot in the growth process,\nwe calculate the envelope structure and sublimation temperature of a set of\nmineral species representing different levels of volatility. Sublimation lines\nare determined using and equilibrium scheme for the chemical reactions\nresponsible for destruction and formation of the relevant minerals. We find\nthat the envelope of the growing planet reaches temperatures high enough to\nsublimate all considered mineral species when the mass is larger than 0.4 Earth\nmasses. The sublimation lines are located within the gravitionally bound\nenvelope of the planet. We make a detailed analysis of the sublimation of FeS\nat around 720 K, beyond which the mineral is attacked by H2 to form gaseous H2S\nand solid Fe. We calculate the sulfur concentration in the planet under the\nassumption that all sulfur released as H2S is lost from the planet by diffusion\nback to the protoplanetary disk. Our calculated values are in good agreement\nwith the slightly depleted sulfur abundance of Mars, while the model\noverpredicts the extensive sulfur depletion of Earth by a factor of\napproximately 2. We show that a collision with a sulfur-rich body akin to Mars\nin the moon-forming impact lifts the Earth's sulfur abundance to approximately\n10% of the solar value for all impactor masses above 0.05 Earth masses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:44:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Steinmeyer","Marie-Luise",""],["Woitke","Peter",""],["Johansen","Anders",""]]}
{"id":"2308.05648","submitter":"Zezhong Lv","authors":"Zezhong Lv, Bing Su, Ji-Rong Wen","title":"Counterfactual Cross-modality Reasoning for Weakly Supervised Video\n  Moment Localization","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":"  Video moment localization aims to retrieve the target segment of an untrimmed\nvideo according to the natural language query. Weakly supervised methods gains\nattention recently, as the precise temporal location of the target segment is\nnot always available. However, one of the greatest challenges encountered by\nthe weakly supervised method is implied in the mismatch between the video and\nlanguage induced by the coarse temporal annotations. To refine the\nvision-language alignment, recent works contrast the cross-modality\nsimilarities driven by reconstructing masked queries between positive and\nnegative video proposals. However, the reconstruction may be influenced by the\nlatent spurious correlation between the unmasked and the masked parts, which\ndistorts the restoring process and further degrades the efficacy of contrastive\nlearning since the masked words are not completely reconstructed from the\ncross-modality knowledge. In this paper, we discover and mitigate this spurious\ncorrelation through a novel proposed counterfactual cross-modality reasoning\nmethod. Specifically, we first formulate query reconstruction as an aggregated\ncausal effect of cross-modality and query knowledge. Then by introducing\ncounterfactual cross-modality knowledge into this aggregation, the spurious\nimpact of the unmasked part contributing to the reconstruction is explicitly\nmodeled. Finally, by suppressing the unimodal effect of masked query, we can\nrectify the reconstructions of video proposals to perform reasonable\ncontrastive learning. Extensive experimental evaluations demonstrate the\neffectiveness of our proposed method. The code is available at\n\\href{https://github.com/sLdZ0306/CCR}{https://github.com/sLdZ0306/CCR}.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:45:45 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lv","Zezhong",""],["Su","Bing",""],["Wen","Ji-Rong",""]]}
{"id":"2308.05649","submitter":"Kunjian Song","authors":"Kunjian Song, Mikhail R. Gadelha, Franz Brau{\\ss}e, Rafael S. Menezes,\n  Lucas C. Cordeiro","title":"ESBMC v7.3: Model Checking C++ Programs using Clang AST","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces ESBMC v7.3, the latest Efficient SMT-Based\nContext-Bounded Model Checker version, which now incorporates a new clang-based\nC++ front-end. While the previous CPROVER-based front-end served well for\nhandling C++03 programs, it encountered challenges keeping up with the evolving\nC++ language. As new language and library features were added in each C++\nversion, the limitations of the old front-end became apparent, leading to\ndifficult-to-maintain code. Consequently, modern C++ programs were challenging\nto verify. To overcome this obstacle, we redeveloped the front-end, opting for\na more robust approach using clang. The new front-end efficiently traverses the\nAbstract Syntax Tree (AST) in-memory using clang APIs and transforms each AST\nnode into ESBMC's Intermediate Representation. Through extensive\nexperimentation, our results demonstrate that ESBMC v7.3 with the new front-end\nsignificantly reduces parse and conversion errors, enabling successful\nverification of a wide range of C++ programs, thereby outperforming previous\nESBMC versions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:46:33 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Song","Kunjian",""],["Gadelha","Mikhail R.",""],["Brau\u00dfe","Franz",""],["Menezes","Rafael S.",""],["Cordeiro","Lucas C.",""]]}
{"id":"2308.05650","submitter":"Tian-Ai Zhang","authors":"Shi Jin, Zheng Ma and Tian-ai Zhang","title":"Asymptotic-preserving neural networks for multiscale\n  Vlasov-Poisson-Fokker-Planck system in the high-field regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Vlasov-Poisson-Fokker-Planck (VPFP) system is a fundamental model in\nplasma physics that describes the Brownian motion of a large ensemble of\nparticles within a surrounding bath. Under the high-field scaling, both\ncollision and field are dominant. This paper introduces two\nAsymptotic-Preserving Neural Network (APNN) methods within a physics-informed\nneural network (PINN) framework for solving the VPFP system in the high-field\nregime. These methods aim to overcome the computational challenges posed by\nhigh dimensionality and multiple scales of the system. The first APNN method\nleverages the micro-macro decomposition model of the original VPFP system,\nwhile the second is based on the mass conservation law. Both methods ensure\nthat the loss function of the neural networks transitions naturally from the\nkinetic model to the high-field limit model, thereby preserving the correct\nasymptotic behavior. Through extensive numerical experiments, these APNN\nmethods demonstrate their effectiveness in solving multiscale and high\ndimensional uncertain problems, as well as their broader applicability for\nproblems with long time duration and non-equilibrium initial data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:47:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Jin","Shi",""],["Ma","Zheng",""],["Zhang","Tian-ai",""]]}
{"id":"2308.05651","submitter":"Olivier Haution","authors":"Olivier Haution","title":"Geometric concentration theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish a purely geometric form of the concentration theorem (also\ncalled localization theorem) for actions of a linearly reductive group $G$ on\nan affine scheme $X$ without fixed points. It asserts the existence of a\n$G$-representation over the base without trivial summand, which acquires a\nnowhere vanishing equivariant section over $X$.\n  As a consequence, we show that the equivariant stable motivic homotopy theory\nof a scheme with an action of a linearly reductive group is equivalent to that\nof the fixed locus, upon inverting appropriate maps, namely the Euler classes\nof representations without trivial summands. We also discuss consequences for\nequivariant cohomology theories obtained using Borel's construction. This\nrecovers most known forms of the concentration theorem in algebraic geometry,\nand yields generalisations valid beyond the setting of actions of\ndiagonalisable groups, or of oriented cohomology theories.\n  Finally, we derive a version of Smith theory for motivic cohomology,\nfollowing the approach of Dwyer--Wilkerson in topology.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:48:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Haution","Olivier",""]]}
{"id":"2308.05652","submitter":"Astrid Herremans","authors":"Astrid Herremans and Daan Huybrechs","title":"Efficient Function Approximation in Enriched Approximation Spaces","comments":"18 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An enriched approximation space is the span of a conventional basis with a\nfew extra functions included, for example to capture known features of the\nsolution to a computational problem. Adding functions to a basis makes it\novercomplete and, consequently, the corresponding discretized approximation\nproblem may require solving an ill-conditioned system. Recent research\nindicates that these systems can still provide highly accurate numerical\napproximations under reasonable conditions. In this paper we propose an\nefficient algorithm to compute such approximations. It is based on the AZ\nalgorithm for overcomplete sets and frames, which simplifies in the case of an\nenriched basis. In addition, analysis of the original AZ algorithm and of the\nproposed variant gives constructive insights on how to achieve optimal and\nstable discretizations using enriched bases. We apply the algorithm to examples\nof enriched approximation spaces in literature, including a few non-standard\napproximation problems and an enriched spectral method for a 2D boundary value\nproblem, and show that the simplified AZ algorithm is indeed stable, accurate\nand efficient.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:50:21 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Herremans","Astrid",""],["Huybrechs","Daan",""]]}
{"id":"2308.05653","submitter":"Julia Ziegler","authors":"Juhi Dutta, Jayita Lahiri, Cheng Li, Gudrid Moortgat-Pick, Sheikh\n  Farah Tabira and Julia Anabell Ziegler","title":"Dark Matter Phenomenology in 2HDMS in light of the 95 GeV excess","comments":"32 pages, 10 figures, 10 tables","journal-ref":null,"doi":null,"report-no":"DESY-23-114","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Two Higgs Doublet model extended with a complex scalar singlet (2HDMS) is\na well-motivated Beyond Standard Model candidate addressing several open\nproblems of nature. In this work, we focus on the dark matter (DM)\nphenomenology of the complex scalar singlet where the real part of the complex\nscalar obtains a vacuum expectation value. The model is characterized by an\nenlarged Higgs spectrum comprising six physical Higgs bosons and a pseudoscalar\nDM candidate. We address the impact of accommodating the 95 GeV excess on the\n2HDMS parameter space and DM observables after including all theoretical and\nexperimental constraints. Finally, we look into the prospects of this scenario\nat HL-LHC and future lepton colliders for a representative benchmark.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:50:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dutta","Juhi",""],["Lahiri","Jayita",""],["Li","Cheng",""],["Moortgat-Pick","Gudrid",""],["Tabira","Sheikh Farah",""],["Ziegler","Julia Anabell",""]]}
{"id":"2308.05654","submitter":"Yan Feng","authors":"Yan Feng, Haneen Farah, Bart van Arem","title":"Effect of eHMI on pedestrian road crossing behavior in shared space with\n  Automated Vehicles-A Virtual Reality study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A shared space area is a low-speed urban area in which pedestrians, cyclists,\nand vehicles share the road, often relying on informal interaction rules and\ngreatly expanding freedom of movement for pedestrians and cyclists. While\nshared space has the potential to improve pedestrian priority in urban areas,\nit presents unique challenges for pedestrian-AV interaction due to the absence\nof a clear right of way. The current study applied Virtual Reality (VR)\nexperiments to investigate pedestrian-AV interaction in a shared space, with a\nparticular focus on the impact of external human-machine interfaces (eHMIs) on\npedestrian crossing behavior. Fifty-three participants took part in the VR\nexperiment and three eHMI conditions were investigated: no eHMI, eHMI with a\npedestrian sign on the windshield, and eHMI with a projected zebra crossing on\nthe road. Data collected via VR and questionnaires were used for objective and\nsubjective measures to understand pedestrian-AV interaction. The study revealed\nthat the presence of eHMI had an impact on participants' gazing behavior but\nnot on their crossing decisions. Additionally, participants had a positive user\nexperience with the current VR setting and expressed a high level of trust and\nperceived safety during their interaction with the AV. These findings highlight\nthe potential of utilizing VR to explore and understand pedestrian-AV\ninteractions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:51:02 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 11:32:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Feng","Yan",""],["Farah","Haneen",""],["van Arem","Bart",""]]}
{"id":"2308.05655","submitter":"Yanteng Zhang","authors":"Yanteng Zhang, Qizhi Teng, Xiaohai He, Tong Niu, Lipei Zhang, Yan Liu,\n  Chao Ren","title":"Attention-based 3D CNN with Multi-layer Features for Alzheimer's Disease\n  Diagnosis using Brain Images","comments":"4 pages, 4 figures","journal-ref":"The 45th Annual International Conference of the IEEE Engineering\n  in Medicine and Biology Society, 2023","doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Structural MRI and PET imaging play an important role in the diagnosis of\nAlzheimer's disease (AD), showing the morphological changes and glucose\nmetabolism changes in the brain respectively. The manifestations in the brain\nimage of some cognitive impairment patients are relatively inconspicuous, for\nexample, it still has difficulties in achieving accurate diagnosis through sMRI\nin clinical practice. With the emergence of deep learning, convolutional neural\nnetwork (CNN) has become a valuable method in AD-aided diagnosis, but some CNN\nmethods cannot effectively learn the features of brain image, making the\ndiagnosis of AD still presents some challenges. In this work, we propose an\nend-to-end 3D CNN framework for AD diagnosis based on ResNet, which integrates\nmulti-layer features obtained under the effect of the attention mechanism to\nbetter capture subtle differences in brain images. The attention maps showed\nour model can focus on key brain regions related to the disease diagnosis. Our\nmethod was verified in ablation experiments with two modality images on 792\nsubjects from the ADNI database, where AD diagnostic accuracies of 89.71% and\n91.18% were achieved based on sMRI and PET respectively, and also outperformed\nsome state-of-the-art methods.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:53:35 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhang","Yanteng",""],["Teng","Qizhi",""],["He","Xiaohai",""],["Niu","Tong",""],["Zhang","Lipei",""],["Liu","Yan",""],["Ren","Chao",""]]}
{"id":"2308.05656","submitter":"Steven Dale Cutkosky","authors":"Razieh Ahmadian and Steven Dale Cutkosky","title":"Generating sequences of valuations on simple extensions of domains","comments":"14 pages. arXiv admin note: substantial text overlap with\n  arXiv:1904.10702","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Suppose that $(K,v_0)$ is a valued field, $f(x)\\in K[x]$ is a monic and\nirreducible polynomial and $(L,v)$ is an extension of valued fields, where\n$L=K[x]/(f(x))$. Let $A$ be a local domain with quotient field $K$ dominated by\nthe valuation ring of $v_0$ and such that $f(x)$ is in $A[x]$. The study of\nthese extensions is a classical subject.\n  This paper is devoted to the problem of describing the structure of the\nassociated graded ring ${\\rm gr}_v A[x]/(f(x))$ of $A[x]/(f(x))$ for the\nfiltration defined by $v$ as an extension of the associated graded ring of $A$\nfor the filtration defined by $v_0$. We give a complete simple description of\nthis algebra when there is unique extension of $v_0$ to $L$ and the residue\ncharacteristic of $A$ does not divide the degree of $f$. To do this, we show\nthat the sequence of key polynomials constructed by MacLane's algorithm can be\ntaken to lie inside $A[x]$. This result was proven using a different method in\nthe more restrictive case that the residue fields of $A$ and of the valuation\nring of $v$ are equal and algebraically closed in a recent paper by Cutkosky,\nMourtada and Teissier.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:54:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ahmadian","Razieh",""],["Cutkosky","Steven Dale",""]]}
{"id":"2308.05657","submitter":"Juan M. Cruz-Martinez","authors":"Juan M. Cruz-Martinez, Matteo Robbiati, Stefano Carrazza","title":"Multi-variable integration with a variational quantum circuit","comments":"Code available at https://github.com/qiboteam/QiNNtegrate","journal-ref":null,"doi":null,"report-no":"TIF-UNIMI-2023-13, CERN-TH-2023-157","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we present a novel strategy to evaluate multi-variable integrals\nwith quantum circuits. The procedure first encodes the integration variables\ninto a parametric circuit. The obtained circuit is then derived with respect to\nthe integration variables using the parameter shift rule technique. The\nobservable representing the derivative is then used as the predictor of the\ntarget integrand function following a quantum machine learning approach. The\nintegral is then estimated using the fundamental theorem of integral calculus\nby evaluating the original circuit. Embedding data according to a reuploading\nstrategy, multi-dimensional variables can be easily encoded into the circuit's\ngates and then individually taken as targets while deriving the circuit. These\ntechniques can be exploited to partially integrate a function or to quickly\ncompute parametric integrands within the training hyperspace.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:55:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cruz-Martinez","Juan M.",""],["Robbiati","Matteo",""],["Carrazza","Stefano",""]]}
{"id":"2308.05658","submitter":"Kojo Adu-Gyamfi","authors":"Adu-Gyamfi Kojo, Kandiboina Raghupathi, Ravichandra-Mouli Varsha,\n  Knickerbocker Skylar, Hans Zachary N, Hawkins, Neal R, Sharma Anuj","title":"Automatic Extraction of Relevant Road Infrastructure using Connected\n  vehicle data and Deep Learning Model","comments":"18 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In today's rapidly evolving urban landscapes, efficient and accurate mapping\nof road infrastructure is critical for optimizing transportation systems,\nenhancing road safety, and improving the overall mobility experience for\ndrivers and commuters. Yet, a formidable bottleneck obstructs progress - the\nlaborious and time-intensive manual identification of intersections. Simply\nconsidering the shear number of intersections that need to be identified, and\nthe labor hours required per intersection, the need for an automated solution\nbecomes undeniable. To address this challenge, we propose a novel approach that\nleverages connected vehicle data and cutting-edge deep learning techniques. By\nemploying geohashing to segment vehicle trajectories and then generating image\nrepresentations of road segments, we utilize the YOLOv5 (You Only Look Once\nversion 5) algorithm for accurate classification of both straight road segments\nand intersections. Experimental results demonstrate an impressive overall\nclassification accuracy of 95%, with straight roads achieving a remarkable 97%\nF1 score and intersections reaching a 90% F1 score. This approach not only\nsaves time and resources but also enables more frequent updates and a\ncomprehensive understanding of the road network. Our research showcases the\npotential impact on traffic management, urban planning, and autonomous vehicle\nnavigation systems. The fusion of connected vehicle data and deep learning\nmodels holds promise for a transformative shift in road infrastructure mapping,\npropelling us towards a smarter, safer, and more connected transportation\necosystem.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:57:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Kojo","Adu-Gyamfi",""],["Raghupathi","Kandiboina",""],["Varsha","Ravichandra-Mouli",""],["Skylar","Knickerbocker",""],["N","Hans Zachary",""],["Hawkins","",""],["R","Neal",""],["Anuj","Sharma",""]]}
{"id":"2308.05659","submitter":"Ankit Jha","authors":"Mainak Singha, Harsh Pal, Ankit Jha, Biplab Banerjee","title":"AD-CLIP: Adapting Domains in Prompt Space Using CLIP","comments":"10 pages, 8 figures, 4 tables. Accepted at OOD-CV, ICCV Workshop,\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although deep learning models have shown impressive performance on supervised\nlearning tasks, they often struggle to generalize well when the training\n(source) and test (target) domains differ. Unsupervised domain adaptation (DA)\nhas emerged as a popular solution to this problem. However, current DA\ntechniques rely on visual backbones, which may lack semantic richness. Despite\nthe potential of large-scale vision-language foundation models like CLIP, their\neffectiveness for DA has yet to be fully explored. To address this gap, we\nintroduce AD-CLIP, a domain-agnostic prompt learning strategy for CLIP that\naims to solve the DA problem in the prompt space. We leverage the frozen vision\nbackbone of CLIP to extract both image style (domain) and content information,\nwhich we apply to learn prompt tokens. Our prompts are designed to be\ndomain-invariant and class-generalizable, by conditioning prompt learning on\nimage style and content features simultaneously. We use standard supervised\ncontrastive learning in the source domain, while proposing an entropy\nminimization strategy to align domains in the embedding space given the target\ndomain data. We also consider a scenario where only target domain samples are\navailable during testing, without any source domain data, and propose a\ncross-domain style mapping network to hallucinate domain-agnostic tokens. Our\nextensive experiments on three benchmark DA datasets demonstrate the\neffectiveness of AD-CLIP compared to existing literature.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:58:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Singha","Mainak",""],["Pal","Harsh",""],["Jha","Ankit",""],["Banerjee","Biplab",""]]}
{"id":"2308.05660","submitter":"Gavin Crooks","authors":"Maxwell Aifer, Kaelan Donatella, Max Hunter Gordon, Thomas Ahle,\n  Daniel Simpson, Gavin E. Crooks, Patrick J. Coles","title":"Thermodynamic Linear Algebra","comments":"21+15 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cs.ET quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linear algebraic primitives are at the core of many modern algorithms in\nengineering, science, and machine learning. Hence, accelerating these\nprimitives with novel computing hardware would have tremendous economic impact.\nQuantum computing has been proposed for this purpose, although the resource\nrequirements are far beyond current technological capabilities, so this\napproach remains long-term in timescale. Here we consider an alternative\nphysics-based computing paradigm based on classical thermodynamics, to provide\na near-term approach to accelerating linear algebra.\n  At first sight, thermodynamics and linear algebra seem to be unrelated\nfields. In this work, we connect solving linear algebra problems to sampling\nfrom the thermodynamic equilibrium distribution of a system of coupled harmonic\noscillators. We present simple thermodynamic algorithms for (1) solving linear\nsystems of equations, (2) computing matrix inverses, (3) computing matrix\ndeterminants, and (4) solving Lyapunov equations. Under reasonable assumptions,\nwe rigorously establish asymptotic speedups for our algorithms, relative to\ndigital methods, that scale linearly in matrix dimension. Our algorithms\nexploit thermodynamic principles like ergodicity, entropy, and equilibration,\nhighlighting the deep connection between these two seemingly distinct fields,\nand opening up algebraic applications for thermodynamic computing hardware.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:01:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Aifer","Maxwell",""],["Donatella","Kaelan",""],["Gordon","Max Hunter",""],["Ahle","Thomas",""],["Simpson","Daniel",""],["Crooks","Gavin E.",""],["Coles","Patrick J.",""]]}
{"id":"2308.05661","submitter":"Sheikh Ifatur Rahman","authors":"Sheikh Ifatur Rahman, Robert Armitage and Siddharth Rajan","title":"Demonstration of Multi-Active Region P-down Green LEDs with High Quantum\n  Efficiency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Longer wavelength emitters such as green LEDs display a pronounced efficiency\ndrop at higher current densities, resulting in relatively low wall-plug\nefficiency. Multi-active region approach can improve the wall-plug efficiency\nsignificantly and tackle the green gap challenge. This work reports\nmulti-active region p-down LEDs with high external efficiency operating\nentirely in the green wavelength. Devices were developed using p-down topology,\nwhere the PN junction is oriented such that electric fields from depletion and\nbuilt-in polarization dipoles are aligned. Ga-polar multi-active region green\nLEDs with excellent voltage and EQE scaling, and significantly higher wall-plug\nefficiency is demonstrated in this work.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:02:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rahman","Sheikh Ifatur",""],["Armitage","Robert",""],["Rajan","Siddharth",""]]}
{"id":"2308.05662","submitter":"Jackson Remington","authors":"Jackson Remington","title":"Analysis of Downward Terrestrial Gamma-ray Flashes Using a Large-Area\n  Cosmic Ray Scintillation Detector","comments":"Ph.D. Dissertation","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Telescope Array (TA) of central Utah was designed to detect\nultra-high-energy cosmic rays (UHECRs) and is the largest of its kind in the\nNorthern hemisphere. Its capabilities, however, are not limited to\nextra-terrestrial sources. Scintillation detectors (SDs) in the array are\ndesigned to measure energy deposit from charged cosmic ray secondaries, but\nhave recently caught bursts of electromagnetic radiation that do not match the\ntypical signature of cosmic ray air showers. After investigation, the bursts\nwere tied to individual lightning strikes. In an effort to better understand\nthe phenomenon, Langmuir Laboratory for Atmospheric Research at New Mexico Tech\nprovided specialized lightning detectors across the array, eventually\nconfirming the events as downward terrestrial gamma-ray flashes (TGFs) produced\nin the first few microseconds of lightning flashes. After 20 identified TGFs\nand 2 publications, the lightning instrumentation at Telescope Array was\nupgraded in the summer of 2018 with the addition of a broadband interferometer\n(INTF) for high-resolution lightning mapping. This unique variety of lightning\ndetectors has become one of the leading studies of downward TGFs. This\ndissertation is focused on the application of this method and resultson four\nevents from late 2018. The individual TGFs lasted <10 us and likely consisted\nof >10^12 gamma-rays, with evidence of some energies >2.6 MeV. I determined TGF\nsource times, plan locations, and altitudes with average uncertainties of 0.6\nus, 140 m, and 25 m, respectively. This high resolution showed that TGFs in all\nfour of these events occured during strong initial breakdown pulses and was\ndriven by streamer-based fast negative breakdown in the first couple\nmilliseconds of negative intracloud and cloud-to-ground lightning flashes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:02:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Remington","Jackson",""]]}
{"id":"2308.05663","submitter":"Cristian Villavicencio","authors":"C.A. Dominguez, Marcelo Loewe, Cristian Villavicencio, R. Zamora","title":"Nucleon axial-vector coupling constant in magnetar environments","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nucleon axial-vector coupling constant $g_A$ is studied in the presence\nof an external magnetic field, and in dense nuclear environments, to emulate\nnuclear matter in magnetars. For this purpose we use QCD finite energy sum\nrules for two-current and three-current correlators, the former involving\nnucleon-nucleon correlators and the latter involving proton-axial-neutron\ncurrents. As a result, the axial-vector coupling constant decreases both with\nbaryon density as well as with magnetic field. The axial-vector coupling\nevaluated with baryon density near the nuclear density $\\rho_0$ leads to\n$g_A^*\\approx 0.92$. In the presence of magnetic fields $g_A$ decreases in\ngeneral, but $g_A^*$ does not show significant changes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:02:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Dominguez","C. A.",""],["Loewe","Marcelo",""],["Villavicencio","Cristian",""],["Zamora","R.",""]]}
{"id":"2308.05664","submitter":"Andrea Luppi","authors":"Andrea I Luppi, Fernando E. Rosas, Gustavo Deco, Morten L.\n  Kringelbach, and Pedro A.M. Mediano","title":"Information decomposition reveals hidden high-order contributions to\n  temporal irreversibility","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cond-mat.stat-mech cs.IT math-ph math.IT math.MP physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Temporal irreversibility, often referred to as the arrow of time, is a\nfundamental concept in statistical mechanics. Markers of irreversibility also\nprovide a powerful characterisation of information processing in biological\nsystems. However, current approaches tend to describe temporal irreversibility\nin terms of a single scalar quantity, without disentangling the underlying\ndynamics that contribute to irreversibility. Here we propose a broadly\napplicable information-theoretic framework to characterise the arrow of time in\nmultivariate time series, which yields qualitatively different types of\nirreversible information dynamics. This multidimensional characterisation\nreveals previously unreported high-order modes of irreversibility, and\nestablishes a formal connection between recent heuristic markers of temporal\nirreversibility and metrics of information processing. We demonstrate the\nprevalence of high-order irreversibility in the hyperactive regime of a\nbiophysical model of brain dynamics, showing that our framework is both\ntheoretically principled and empirically useful. This work challenges the view\nof the arrow of time as a monolithic entity, enhancing both our theoretical\nunderstanding of irreversibility and our ability to detect it in practical\napplications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:04:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Luppi","Andrea I",""],["Rosas","Fernando E.",""],["Deco","Gustavo",""],["Kringelbach","Morten L.",""],["Mediano","Pedro A. M.",""]]}
{"id":"2308.05665","submitter":"Kojo Adu-Gyamfi","authors":"Kojo Adu-Gyamfi, Sharma Anuj","title":"Exploring Deep Learning Approaches to Predict Person and Vehicle Trips:\n  An Analysis of NHTS Data","comments":"15 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Modern transportation planning relies heavily on accurate predictions of\nperson and vehicle trips. However, traditional planning models often fail to\naccount for the intricacies and dynamics of travel behavior, leading to\nless-than-optimal accuracy in these predictions. This study explores the\npotential of deep learning techniques to transform the way we approach trip\npredictions, and ultimately, transportation planning. Utilizing a comprehensive\ndataset from the National Household Travel Survey (NHTS), we developed and\ntrained a deep learning model for predicting person and vehicle trips. The\nproposed model leverages the vast amount of information in the NHTS data,\ncapturing complex, non-linear relationships that were previously overlooked by\ntraditional models. As a result, our deep learning model achieved an impressive\naccuracy of 98% for person trip prediction and 96% for vehicle trip estimation.\nThis represents a significant improvement over the performances of traditional\ntransportation planning models, thereby demonstrating the power of deep\nlearning in this domain. The implications of this study extend beyond just more\naccurate predictions. By enhancing the accuracy and reliability of trip\nprediction models, planners can formulate more effective, data-driven\ntransportation policies, infrastructure, and services. As such, our research\nunderscores the need for the transportation planning field to embrace advanced\ntechniques like deep learning. The detailed methodology, along with a thorough\ndiscussion of the results and their implications, are presented in the\nsubsequent sections of this paper.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:06:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Adu-Gyamfi","Kojo",""],["Anuj","Sharma",""]]}
{"id":"2308.05666","submitter":"Sergio Ernesto Aguilar Gutierrez","authors":"Sergio E. Aguilar-Gutierrez, Ayan K. Patra and Juan F. Pedraza","title":"Entangled universes in dS wedge holography","comments":"30 pages + Appendices; 8 figures","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-95","categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a new setting in the framework of braneworld holography to\ndescribe a pair of coupled and entangled uniformly accelerated universes. The\nmodel consists of two branes embedded into AdS space capping off the UV and IR\nregions, giving rise to a notion of dS wedge holography. Specializing in a\nthree-dimensional bulk, we show that dS JT gravity can emerge as an effective\nbraneworld theory, provided that fluctuations transverse to the brane are\nincluded. We study the holographic entanglement entropy between the branes as\nwell as the holographic complexity within the `complexity=anything' proposal.\nWe reproduce a Page curve with respect to an observer collecting radiation on\nthe UV brane, as long as we take the limit where gravity decouples in that\nuniverse, thus acting as a non-gravitating bath. The Page curve emerges due to\nmomentum-space (UV/IR) entanglement and can be understood as analogous to the\n`confinement-deconfinement' transition in theories with a mass gap. Moreover,\nthe analysis of complexity shows that the hyperfast growth phenomenon is\ndisplayed within a set of proposals, while late-time linear growth can be\nrecovered for a different set. Our framework thus provides new test grounds for\nunderstanding quantum information concepts in dS space and dS holography.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:07:16 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Aguilar-Gutierrez","Sergio E.",""],["Patra","Ayan K.",""],["Pedraza","Juan F.",""]]}
{"id":"2308.05667","submitter":"Zheng Qin","authors":"Minhao Li, Zheng Qin, Zhirui Gao, Renjiao Yi, Chenyang Zhu, Yulan Guo,\n  Kai Xu","title":"2D3D-MATR: 2D-3D Matching Transformer for Detection-free Registration\n  between Images and Point Clouds","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 commonly adopted detect-then-match approach to registration finds\ndifficulties in the cross-modality cases due to the incompatible keypoint\ndetection and inconsistent feature description. We propose, 2D3D-MATR, a\ndetection-free method for accurate and robust registration between images and\npoint clouds. Our method adopts a coarse-to-fine pipeline where it first\ncomputes coarse correspondences between downsampled patches of the input image\nand the point cloud and then extends them to form dense correspondences between\npixels and points within the patch region. The coarse-level patch matching is\nbased on transformer which jointly learns global contextual constraints with\nself-attention and cross-modality correlations with cross-attention. To resolve\nthe scale ambiguity in patch matching, we construct a multi-scale pyramid for\neach image patch and learn to find for each point patch the best matching image\npatch at a proper resolution level. Extensive experiments on two public\nbenchmarks demonstrate that 2D3D-MATR outperforms the previous state-of-the-art\nP2-Net by around $20$ percentage points on inlier ratio and over $10$ points on\nregistration recall. Our code and models are available at\nhttps://github.com/minhaolee/2D3DMATR.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:10:54 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 12:49:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Minhao",""],["Qin","Zheng",""],["Gao","Zhirui",""],["Yi","Renjiao",""],["Zhu","Chenyang",""],["Guo","Yulan",""],["Xu","Kai",""]]}
{"id":"2308.05668","submitter":"Th\\'eo Durandard","authors":"Th\\'eo Durandard","title":"Dynamic delegation in promotion contests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  I study how organizations assign tasks to identify the best candidate to\npromote among a pool of workers. Task allocation and workers' motivation\ninteract through the organization's promotion decisions. The organization\ndesigns the workers' careers to both screen and develop talent. When only\nnon-routine tasks are informative about a worker's type and non-routine tasks\nare scarce, the organization's preferred promotion system is an index contest.\nEach worker is assigned a number that depends only on his own type. The\nprincipal delegates the non-routine task to the worker whose current index is\nthe highest and promotes the first worker whose type exceeds a threshold. Each\nworker's threshold is independent of the other workers' types. Competition is\nmediated by the allocation of tasks: who gets the opportunity to prove\nthemselves is a determinant factor in promotions. Finally, features of the\noptimal promotion contest rationalize the prevalence of fast-track promotion,\nthe role of seniority, or when a group of workers is systemically advantaged.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:13:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Durandard","Th\u00e9o",""]]}
{"id":"2308.05669","submitter":"Manu Stalport","authors":"M. Stalport, M. Cretignier, S. Udry, A. Anna John, T. G. Wilson, J.-B.\n  Delisle, A. S. Bonomo, L. A. Buchhave, D. Charbonneau, S. Dalal, M. Damasso,\n  L. Di Fabrizio, X. Dumusque, A. Fiorenzano, A. Harutyunyan, R. D. Haywood, D.\n  W. Latham, M. L\\'opez-Morales, V. Lorenzi, C. Lovis, L. Malavolta, E.\n  Molinari, A. Mortier, M. Pedani, F. Pepe, M. Pinamonti, E. Poretti, K. Rice,\n  A. Sozzetti","title":"A review of planetary systems around HD 99492, HD 147379 and HD 190007\n  with HARPS-N","comments":"27 pages, 26 figures (13 in Appendix); Accepted for publication in\n  A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Rocky Planet Search (RPS) program is dedicated to a blind radial velocity\n(RV) search of planets around bright stars in the Northern hemisphere, using\nthe high-resolution echelle spectrograph HARPS-N installed on the Telescopio\nNazionale Galileo (TNG).\n  The goal of this work is to revise and update the properties of three\nplanetary systems by analysing the HARPS-N data with state-of-the-art stellar\nactivity mitigation tools. The stars considered are HD 99492 (83Leo B), HD\n147379 (Gl617 A) and HD 190007.\n  We employ a systematic process of data modelling, that we selected from the\ncomparison of different approaches. We use YARARA to remove instrumental\nsystematics from the RV, and then use SPLEAF to further mitigate the stellar\nnoise with a multidimensional correlated noise model. We also search for\ntransit features in the Transiting Exoplanets Survey Satellite (TESS) data of\nthese stars.\n  We report on the discovery of a new planet around HD 99492, namely HD 99492\nc, with an orbital period of 95.2 days and a minimum mass of msin i = 17.9\nM_Earth, and refine the parameters of HD 99492 b. We also update and refine the\nKeplerian solutions for the planets around HD 147379 and HD 190007, but do not\ndetect additional planetary signals. We discard the transiting geometry for the\nplanets, but stress that TESS did not exhaustively cover all the orbital\nphases.\n  The addition of the HARPS-N data, and the use of advanced data analysis\ntools, has allowed us to present a more precise view of these three planetary\nsystems. It demonstrates once again the importance of long observational\nefforts such as the RPS program. Added to the RV exoplanet sample, these\nplanets populate two apparently distinct populations revealed by a bimodality\nin the planets minimum mass distribution. The separation is located between 30\nand 50 M_Earth.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:14:44 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Stalport","M.",""],["Cretignier","M.",""],["Udry","S.",""],["John","A. Anna",""],["Wilson","T. G.",""],["Delisle","J. -B.",""],["Bonomo","A. S.",""],["Buchhave","L. A.",""],["Charbonneau","D.",""],["Dalal","S.",""],["Damasso","M.",""],["Di Fabrizio","L.",""],["Dumusque","X.",""],["Fiorenzano","A.",""],["Harutyunyan","A.",""],["Haywood","R. D.",""],["Latham","D. W.",""],["L\u00f3pez-Morales","M.",""],["Lorenzi","V.",""],["Lovis","C.",""],["Malavolta","L.",""],["Molinari","E.",""],["Mortier","A.",""],["Pedani","M.",""],["Pepe","F.",""],["Pinamonti","M.",""],["Poretti","E.",""],["Rice","K.",""],["Sozzetti","A.",""]]}
{"id":"2308.05670","submitter":"Leone Di Mauro Villari Dr","authors":"Leone Di Mauro Villari, Alesssandro Principi","title":"The Fracton quantum gas","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/4.0/","abstract":"  Starting from a simple dipole-conserving Hamiltonian model, after introducing\na proper quantisation framework, we construct the linear-response theory of a\nfracton quantum gas. We show how to consistently construct the density operator\nand we calculate the density-density linear-response function in the limit of\nlarge number of (fracton) flavours. We show how to construct its random-phase\napproximation, from which we calculate the fracton-plasmon dispersion.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:15:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Villari","Leone Di Mauro",""],["Principi","Alesssandro",""]]}
{"id":"2308.05671","submitter":"Adrian Ioana","authors":"R\\'emi Boutonnet, Daniel Drimbe, Adrian Ioana, Sorin Popa","title":"Non-isomorphism of $A^{*n}, 2\\leq n \\leq \\infty$, for a non-separable\n  abelian von Neumann algebra $A$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that if $A$ is a non-separable abelian tracial von Neuman algebra\nthen its free powers $A^{*n}, 2\\leq n \\leq \\infty$, are mutually non-isomorphic\nand with trivial fundamental group, $\\mathcal F(A^{*n})=1$, whenever $2\\leq\nn<\\infty$. This settles the non-separable version of the free group factor\nproblem.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:17:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Boutonnet","R\u00e9mi",""],["Drimbe","Daniel",""],["Ioana","Adrian",""],["Popa","Sorin",""]]}
{"id":"2308.05672","submitter":"Mohsen Sadr","authors":"Mohsen Sadr, Qian Wang, M. Hossein Gorji","title":"Coupling kinetic and continuum using data-driven maximum entropy\n  distribution","comments":null,"journal-ref":"Journal of Computational Physics, Volume 444, 2021, 110542","doi":"10.1016/j.jcp.2021.110542","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  An important class of multi-scale flow scenarios deals with an interplay\nbetween kinetic and continuum phenomena. While hybrid solvers provide a natural\nway to cope with these settings, two issues restrict their performance.\nForemost, the inverse problem implied by estimating distributions has to be\naddressed, to provide boundary conditions for the kinetic solver. The next\nissue comes from defining a robust yet accurate switching criterion between the\ntwo solvers. This study introduces a data-driven kinetic-continuum coupling,\nwhere the Maximum-Entropy-Distribution (MED) is employed to parametrize\ndistributions arising from continuum field variables. Two regression\nmethodologies of Gaussian-Processes (GPs) and Artificial-Neural-Networks (ANNs)\nare utilized to predict MEDs efficiently. Hence the MED estimates are employed\nto carry out the coupling, besides providing a switching criterion. To achieve\nthe latter, a continuum breakdown parameter is defined by means of the Fisher\ninformation distance computed from the MED estimates. We test the performance\nof our devised MED estimators by recovering bi-modal densities. Next, MED\nestimates are integrated into a hybrid kinetic-continuum solution algorithm.\nHere Direct Simulation Monte-Carlo (DSMC) and Smoothed-Particle Hydrodynamics\n(SPH) are chosen as kinetic and continuum solvers, respectively. The problem of\nmonatomic gas inside Sod's shock tube is investigated, where DSMC-SPH coupling\nis realized by applying the devised MED estimates. Very good agreements with\nrespect to benchmark solutions along with a promising speed-up are observed in\nour reported test cases.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:20:54 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sadr","Mohsen",""],["Wang","Qian",""],["Gorji","M. Hossein",""]]}
{"id":"2308.05673","submitter":"David Walker","authors":"David Walker","title":"Algorithms for 3D Hilbert Encoding and Decoding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents algorithms and pseudocode for encoding and decoding 3D\nHilbert orderings.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:22:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Walker","David",""]]}
{"id":"2308.05674","submitter":"Nikolai Priezjev V.","authors":"Nikolai V. Priezjev","title":"Fatigue behavior of Cu-Zr metallic glasses under cyclic loading","comments":"21 pages, 8 figures. arXiv admin note: text overlap with\n  arXiv:2301.07857","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The effect of oscillatory shear deformation on the fatigue life, yielding\ntransition, and flow localization in metallic glasses is investigated using\nmolecular dynamics simulations. We study a well-annealed Cu-Zr amorphous alloy\nsubjected to periodic shear at room temperature. We find that upon loading for\nhundreds of cycles at strain amplitudes just below a critical value, the\npotential energy at zero strain remains nearly constant and plastic events are\nhighly localized. By contrast, at strain amplitudes above the critical point,\nthe plastic deformation is gradually accumulated upon continued loading until\nthe yielding transition and the formation of a shear band across the entire\nsystem. Interestingly, when the strain amplitude approaches the critical value\nfrom above, the number of cycles to failure increases as a power-law function,\nwhich is consistent with the previous results on binary Lennard-Jones glasses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:23:26 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Priezjev","Nikolai V.",""]]}
{"id":"2308.05675","submitter":"Changlong Shen","authors":"Zhiquan Hu, Changlong Shen","title":"Erd\\H{o}s-Gy\\'{a}rf\\'{a}s Conjecture for $P_{10}$-free Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $P_{10}$ be a path on $10$ vertices. A graph is said to be $P_{10}$-free\nif it does not contain $P_{10}$ as an induced subgraph. The well-known\nErd\\H{o}s-Gy\\'{a}rf\\'{a}s Conjecture states that every graph with minimum\ndegree at least three has a cycle whose length is a power of $2$. In this\npaper, we show that every $P_{10}$-free graph with minimum degree at least\nthree contains a cycle of length $4$ or $8$. This implies that the conjecture\nis true for $P_{10}$-free graphs.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:23:39 GMT"},{"version":"v2","created":"Sat, 12 Aug 2023 03:38:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Zhiquan",""],["Shen","Changlong",""]]}
{"id":"2308.05676","submitter":"Anna Zhigun","authors":"Anna Zhigun and Mabel Lizzy Rajendran","title":"Modelling non-local cell-cell adhesion: a multiscale approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cell-cell adhesion plays a vital role in the development and maintenance of\nmulticellular organisms. One of its functions is regulation of cell migration,\nsuch as occurs, e.g. during embryogenesis or in cancer. In this work, we\ndevelop a versatile multiscale approach to modelling a moving self-adhesive\ncell population that combines a careful microscopic description of a\ndeterministic adhesion-driven motion component with an efficient mesoscopic\nrepresentation of a stochastic velocity-jump process. This approach gives rise\nto mesoscopic models in the form of kinetic transport equations featuring\nmultiple non-localities. Subsequent parabolic and hyperbolic scalings produce\ngeneral classes of equations with non-local adhesion and myopic diffusion, a\nspecial case being the classical macroscopic model proposed in [4]. Our\nsimulations show how the combination of the two motion effects can unfold.\nCell-cell adhesion relies on the subcellular cell adhesion molecule binding.\nOur approach lends itself conveniently to capturing this microscopic effect. On\nthe macroscale, this results in an additional non-linear integral equation of a\nnovel type that is coupled to the cell density equation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:24:04 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhigun","Anna",""],["Rajendran","Mabel Lizzy",""]]}
{"id":"2308.05677","submitter":"Rajeev Singh","authors":"Sonali Patnaik, Lopamudra Nayak, Rajeev Singh","title":"Assessing Lepton Flavor Universality Violations in Semileptonic Decays","comments":"Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In light of recent measurements suggesting potential lepton flavor\nuniversality violations in semileptonic decays at LHCb and other collider\nexperiments, this article offers a brief review of the theoretical basis of\ntree- and loop-level $B$-hadron decays, $b \\to c l \\nu_l$ and $b \\to s l^+\nl^-$, and the experimental conditions. We reassess global averages for\n$\\mathcal{R}_{D(D^*)}$, $\\mathcal{R}_{K(K^*)}$, $\\mathcal{R}_{J/\\psi}$, and\n$\\mathcal{R}_{\\eta_c}$ in semileptonic transitions and have also provided the\nresults for $B_c$ decay channels within the relativistic independent quark\nmodel context. If LHC Run 2 data evaluation corroborates Run 1 measurements,\nthe effect of statistical significance in each decay channel could reach\n5\\,$\\sigma$. The confirmation of these measurements could soon represent the\nfirst notable observation of physics beyond the Standard Model, broadening our\nperspective of New Physics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:24:11 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Patnaik","Sonali",""],["Nayak","Lopamudra",""],["Singh","Rajeev",""]]}
{"id":"2308.05678","submitter":"Beatrice Langella","authors":"Massimiliano Berti, Beatrice Langella, Diego Silimbani","title":"Time periodic solutions of completely resonant Klein-Gordon equations on\n  $\\mathbb{S}^3$","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove existence and multiplicity of Cantor families of small amplitude\ntime periodic solutions of completely resonant Klein-Gordon equations on the\nsphere $\\mathbb{S}^3$ with quadratic, cubic and quintic nonlinearity, regarded\nas toy models in General Relativity. The solutions are obtained by a\nvariational Lyapunov- Schmidt decomposition, which reduces the problem to the\nsearch of mountain pass critical points of a restricted Euler-Lagrange action\nfunctional. Compactness properties of its gradient are obtained by\nStrichartz-type estimates for the solutions of the linear Klein-Gordon equation\non $\\mathbb{S}^3$.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:27:58 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Berti","Massimiliano",""],["Langella","Beatrice",""],["Silimbani","Diego",""]]}
{"id":"2308.05679","submitter":"Laura Boucheron","authors":"Jeremy A. Grajeda, Laura E. Boucheron, Michael S. Kirk, Andrew\n  Leisner, and C. Nick Arge","title":"Quantifying the Consistency and Characterizing the Confidence of Coronal\n  Holes Detected by Active Contours without Edges (ACWE)","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":"  This paper presents an intramethod ensemble for coronal hole (CH) detection\nbased on the Active Contours Without Edges (ACWE) segmentation algorithm. The\npurpose of this ensemble is to develop a confidence map that defines, for all\non disk regions of a Solar extreme ultraviolet (EUV) image, the likelihood that\neach region belongs to a CH based on that region's proximity to, and\nhomogeneity with, the core of identified CH regions. CHs are regions of open\nmagnetic field lines, resulting in high speed solar wind. Accurate detection of\nCHs is vital for space weather prediction. By relying on region homogeneity,\nand not intensity (which can vary due to various factors including line of\nsight changes and stray light from nearby bright regions), to define the final\nconfidence of any given region, this ensemble is able to provide robust,\nconsistent delineations of the CH regions. Using the metrics of global\nconsistency error (GCE), local consistency error (LCE), intersection over union\n(IOU), and the structural similarity index measure (SSIM), the method is shown\nto be robust to different spatial resolutions and different intensity\nresolutions. Furthermore, using the same metrics, the method is shown to be\nrobust across short timescales, indicating self-consistent segmentations.\nFinally, the accuracy of the segmentations and confidence maps are validated by\nconsidering the skewness (i.e., unipolarity) of the underlying magnetic field.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:29:14 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Grajeda","Jeremy A.",""],["Boucheron","Laura E.",""],["Kirk","Michael S.",""],["Leisner","Andrew",""],["Arge","C. Nick",""]]}
{"id":"2308.05680","submitter":"Iknoor Singh","authors":"Iknoor Singh, Carolina Scarton, Xingyi Song, Kalina Bontcheva","title":"Finding Already Debunked Narratives via Multistage Retrieval: Enabling\n  Cross-Lingual, Cross-Dataset and Zero-Shot Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CY cs.IR cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The task of retrieving already debunked narratives aims to detect stories\nthat have already been fact-checked. The successful detection of claims that\nhave already been debunked not only reduces the manual efforts of professional\nfact-checkers but can also contribute to slowing the spread of misinformation.\nMainly due to the lack of readily available data, this is an understudied\nproblem, particularly when considering the cross-lingual task, i.e. the\nretrieval of fact-checking articles in a language different from the language\nof the online post being checked. This paper fills this gap by (i) creating a\nnovel dataset to enable research on cross-lingual retrieval of already debunked\nnarratives, using tweets as queries to a database of fact-checking articles;\n(ii) presenting an extensive experiment to benchmark fine-tuned and\noff-the-shelf multilingual pre-trained Transformer models for this task; and\n(iii) proposing a novel multistage framework that divides this cross-lingual\ndebunk retrieval task into refinement and re-ranking stages. Results show that\nthe task of cross-lingual retrieval of already debunked narratives is\nchallenging and off-the-shelf Transformer models fail to outperform a strong\nlexical-based baseline (BM25). Nevertheless, our multistage retrieval framework\nis robust, outperforming BM25 in most scenarios and enabling cross-domain and\nzero-shot learning, without significantly harming the model's performance.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:33:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Singh","Iknoor",""],["Scarton","Carolina",""],["Song","Xingyi",""],["Bontcheva","Kalina",""]]}
{"id":"2308.05681","submitter":"Ziyi Chang","authors":"Zhengzhi Lu, He Wang, Ziyi Chang, Guoan Yang and Hubert P. H. Shum","title":"Hard No-Box Adversarial Attack on Skeleton-Based Human Action\n  Recognition with Skeleton-Motion-Informed Gradient","comments":"Camera-ready version for ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, methods for skeleton-based human activity recognition have been\nshown to be vulnerable to adversarial attacks. However, these attack methods\nrequire either the full knowledge of the victim (i.e. white-box attacks),\naccess to training data (i.e. transfer-based attacks) or frequent model queries\n(i.e. black-box attacks). All their requirements are highly restrictive,\nraising the question of how detrimental the vulnerability is. In this paper, we\nshow that the vulnerability indeed exists. To this end, we consider a new\nattack task: the attacker has no access to the victim model or the training\ndata or labels, where we coin the term hard no-box attack. Specifically, we\nfirst learn a motion manifold where we define an adversarial loss to compute a\nnew gradient for the attack, named skeleton-motion-informed (SMI) gradient. Our\ngradient contains information of the motion dynamics, which is different from\nexisting gradient-based attack methods that compute the loss gradient assuming\neach dimension in the data is independent. The SMI gradient can augment many\ngradient-based attack methods, leading to a new family of no-box attack\nmethods. Extensive evaluation and comparison show that our method imposes a\nreal threat to existing classifiers. They also show that the SMI gradient\nimproves the transferability and imperceptibility of adversarial samples in\nboth no-box and transfer-based black-box settings.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:34:20 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 15:34:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Zhengzhi",""],["Wang","He",""],["Chang","Ziyi",""],["Yang","Guoan",""],["Shum","Hubert P. H.",""]]}
{"id":"2308.05682","submitter":"Yan V. Fyodorov","authors":"Yan V. Fyodorov","title":"On the density of complex eigenvalues of Wigner reaction matrix in a\n  disordered or chaotic system with absorption","comments":"22 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn math-ph math.MP nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In an absorptive system the Wigner reaction $K-$matrix (directly related to\nthe impedance matrix in acoustic or electromagnetic wave scattering) is\nnon-selfadjoint, hence its eigenvalues are complex. The most interesting regime\narises when the absorption, taken into account as an imaginary part of the\nspectral parameter, is of the order of the mean level spacing. I show how to\nderive the mean density of the complex eigenvalues for reflection problems in\ndisordered or chaotic systems with broken time-reversal invariance. The\ncomputations are done in the framework of nonlinear $\\sigma-$ model approach,\nassuming fixed $M$ and $N\\to \\infty$. Some explicit formulas are provided for\nzero-dimensional quantum chaotic system as well as for a semi-infinite quasi-1D\nsystem with fully operative Anderson localization.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:35:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fyodorov","Yan V.",""]]}
{"id":"2308.05683","submitter":"David Stark","authors":"David Stark, Filippos Kapsalidis, Sergej Markmann, Mathieu Bertrand,\n  Bahareh Marzban, Emilio Gini, Mattias Beck, and J\\'er\\^ome Faist","title":"Quantum Cascade Surface Emitting Lasers","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":"  A low-cost single frequency laser emitting in the mid-infrared spectral\nregion and dissipating minimal electrical power is a key ingredient for the\nnext generation of portable gas sensors for high-volume applications involving\nchemical sensing of important greenhouse and pollutant gases. We propose here a\nQuantum Cascade Surface Emitting Laser (QCSEL), which we implement as a short\nlinear cavity with high reflectivity coated end-mirrors to suppress any edge\nemission and use a buried semiconductor diffraction grating to extract the\nlight from the surface. By wafer-level testing we investigate the cavity length\nscaling, extract mirror reflectivities larger than 0.9, and achieve a pulsed\nthreshold power dissipation of 237 mW for an emission wavelength near 7.5\n$\\mu$m. Finally, we demonstrate single mode emission with a side-mode\nsuppression ratio larger than 33 dB of a 248 $\\mu$m short cavity mounted with\nthe epitaxial layer up and operated in continuous wave at 20 $^\\circ$C.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:38:47 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Stark","David",""],["Kapsalidis","Filippos",""],["Markmann","Sergej",""],["Bertrand","Mathieu",""],["Marzban","Bahareh",""],["Gini","Emilio",""],["Beck","Mattias",""],["Faist","J\u00e9r\u00f4me",""]]}
{"id":"2308.05684","submitter":"Ignacio Del Amo","authors":"Ignacio del Amo and Peter Ditlevsen","title":"Escape by jumps and diffusion by {\\alpha}-stable noise across the\n  barrier in a double well potential","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many physical and chemical phenomena are governed by stochastic escape across\npotential barriers. The escape time depends on the structure of the noise and\nthe shape of the potential barrier. By applying $\\alpha$-stable noise from the\n$\\alpha=2$ Gaussian noise limit to the $\\alpha<2$ jump processes, we find a\ncontinuous transition of the mean escape time from the usual dependence on the\nheight of the barrier for Gaussian noise to a dependence solely on the width of\nthe barrier for $\\alpha$-stable noise. We consider the exit problem of a\nprocess driven by $\\alpha$-stable noise in a double well potential. We study\nindividually the influences of the width and the height of the potential\nbarrier in the escape time and we show through scalings that the asymptotic\nlaws are described by a universal curve independent of both parameters. When\nthe dependence in the stability parameter is considered, we see that there are\ntwo different diffusive regimes in which diffusion is described either by\nKramer's time or by the corresponding asymptotic law for $\\alpha$-stable noise.\nWe determine the regions of the noise parameter space in which each regime\nprevails, and exploit this result to construct an anomalous example in which a\ndouble well potential exhibit a different diffusion regime in each well for a\nwide range of parameters.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:38:48 GMT"}],"update_date":"2023-08-11","authors_parsed":[["del Amo","Ignacio",""],["Ditlevsen","Peter",""]]}
{"id":"2308.05685","submitter":"Netta Haroush","authors":"Netta Haroush, Michal Levo, Eric Wieschaus and Thomas Gregor","title":"Functional analysis of a gene locus in response to non-canonical\n  combinations of transcription factors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transcription factor combinations determine gene locus activity and thereby\ncell identity. However, the precise link between concentrations of such\nactivating transcription factors and target-gene activity is ambiguous. Here we\ninvestigate this link for the gap gene dependent activation of the even-skipped\n(eve) locus in the Drosophila embryo. We simultaneously measure the\nspatiotemporal gap gene concentrations in hemizygous and homozygous gap\nmutants, and link these to eve activity. Although changes in expression extend\nwell beyond the genetically manipulated gene, nearly all expression\nalternations approximate the canonical combinations of activating levels in\nwild-type, sometimes necessitating pattern shifts. Expression levels that\ndiverge from the wild-type repertoire still drive locus activation. Specific\nstripes in the homozygous mutants show partial penetrance, justifying their\nrenown variable phenotypes. However, all eve stripes appear at highly\nreproducible positions, even though a broader span of gap gene expression\nlevels activates eve. Our results suggest a correction capacity of the gap gene\nnetwork and set constraints on the activity of multi-enhancer gene loci.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:38:59 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Haroush","Netta",""],["Levo","Michal",""],["Wieschaus","Eric",""],["Gregor","Thomas",""]]}
{"id":"2308.05686","submitter":"Jinxin Hu","authors":"Jin-Xin Hu, Shuai A. Chen and K. T. Law","title":"Anomalous Coherence Length in Superconductors with Quantum Metric","comments":"8 pages, 5 figures, plus Supplementary Material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The coherence length $\\xi$ is a fundamental length scale of superconductors\nwhich governs the sizes of Cooper pairs, vortices, Andreev bound states and\nmore. In existing microscopic theories of superconductivity, it is expected\nthat as the attractive interaction increases, $\\xi$ decreases as the electrons\nare bound together more strongly. In BCS theory, for example, the coherence\nlength is $\\xi_\\mathrm{BCS} = \\hbar v_{F}/\\Delta$, where $v_{F}$ is the Fermi\nvelocity and $\\Delta$ is the pairing gap. It is clear that increasing $\\Delta$\nwill shorten $\\xi_\\mathrm{BCS}$. However, the situation is puzzling for\nsuperconductors with completely flat bands in which $v_{F}$ goes to zero and\n$\\xi_\\mathrm{BCS}$ is expected to be zero. In this work, we show that the\nquantum metric, which is the real part of the quantum geometric tensor, gives\nrise to an anomalous contribution to the coherence length. Specifically, $\\xi =\n\\sqrt{\\xi_\\mathrm{BCS}^2 +\\ell_{\\mathrm{qm}}^{2}}$ for a superconductor where\n$\\ell_{\\mathrm{qm}}$ is the quantum metric contribution. In the flat band\nlimit, $\\xi$ does not vanish but bound by $\\ell_{\\mathrm{qm}}$. Incredibly, for\nthe nontrivial flat bands with Chern number $C$, $\\xi$ has a topological bound\nof $\\xi\\geq a\\sqrt{\\vert C \\vert/4\\pi}$ where $a$ is the lattice constant.\nPhysically, the Cooper pair size of a superconductor cannot be squeezed down to\na size smaller than $\\ell_{\\mathrm{qm}}$ which is a fundamental length scale\ndetermined by the quantum geometry of the bands. Finally, we calculate the\nquantum metric contributions for the superconducting moir\\'e graphene family\nand show that the quantum metric effects are very important in these\nsuperconductors.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:41:18 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hu","Jin-Xin",""],["Chen","Shuai A.",""],["Law","K. T.",""]]}
{"id":"2308.05687","submitter":"Petter Andreas Bergh","authors":"Petter Andreas Bergh, Julia Yael Plavnik, Sarah Witherspoon","title":"Support varieties without the tensor product property","comments":"11 pages","journal-ref":null,"doi":null,"report-no":"Hamburger Beitr. zur Mathematik Nr 946; ZMP-HH/23-12","categories":"math.QA math.KT math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that over a perfect field, every non-semisimple finite tensor\ncategory with finitely generated cohomology embeds into a larger such category\nwhere the tensor product property does not hold for support varieties.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:41:30 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bergh","Petter Andreas",""],["Plavnik","Julia Yael",""],["Witherspoon","Sarah",""]]}
{"id":"2308.05688","submitter":"Lionel Pournin","authors":"Hugo Parlier, Lionel Pournin","title":"Counting geodesics between surface triangulations","comments":"26 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT cs.CG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a surface $\\Sigma$ equipped with a set $P$ of marked points, we\nconsider the triangulations of $\\Sigma$ with vertex set $P$. The flip-graph of\n$\\Sigma$ whose vertices are these triangulations, and whose edges correspond to\nflipping arcs appears in the study of moduli spaces and mapping class groups.\nWe consider the number of geodesics in the flip-graph of $\\Sigma$ between two\ntriangulations as a function of their distance. We show that this number grows\nexponentially provided the surface has enough topology, and that in the\nremaining cases the growth is polynomial.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:41:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Parlier","Hugo",""],["Pournin","Lionel",""]]}
{"id":"2308.05689","submitter":"Franz Achleitner","authors":"Franz Achleitner, Anton Arnold, Ansgar J\\\"ungel","title":"Necessary and sufficient conditions for strong stability of explicit\n  Runge-Kutta methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strong stability is a property of time integration schemes for ODEs that\npreserve temporal monotonicity of solutions in arbitrary (inner product) norms.\nIt is proved that explicit Runge--Kutta schemes of order $p\\in 4\\mathbb{N}$\nwith $s=p$ stages for linear autonomous ODE systems are not strongly stable,\nclosing an open stability question from [Z.~Sun and C.-W.~Shu, SIAM J. Numer.\nAnal. 57 (2019), 1158--1182]. Furthermore, for explicit Runge--Kutta methods of\norder $p\\in\\mathbb{N}$ and $s>p$ stages, we prove several sufficient as well as\nnecessary conditions for strong stability. These conditions involve both the\nstability function and the hypocoercivity index of the ODE system matrix. This\nindex is a structural property combining the Hermitian and skew-Hermitian part\nof the system matrix.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:43:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Achleitner","Franz",""],["Arnold","Anton",""],["J\u00fcngel","Ansgar",""]]}
{"id":"2308.05690","submitter":"Ao-Xiang Liu","authors":"Ao-Xiang Liu, Ma-Cheng Yang and Cong-Feng Qiao","title":"A Universal Quantum Certainty Relation for Arbitrary Number of\n  Observables","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive by lattice theory a universal quantum certainty relation for\narbitrary $M$ observables in $N$-dimensional system, which provides a\nstate-independent maximum lower bound on the direct-sum of the probability\ndistribution vectors (PDVs) in terms of majorization relation. While the utmost\nlower bound coincides with $(1/N,...,1/N)$ for any two orthogonal bases, the\nmajorization certainty relation for $M\\geqslant3$ is shown to be nontrivial.\nThe universal majorization bounds for three mutually complementary observables\nand a more general set of observables in dimension-2 are achieved. It is found\nthat one cannot prepare a quantum state with PDVs of incompatible observables\nspreading out arbitrarily. Moreover, we obtain a complementary relation for the\nquantum coherence as well, which characterizes a trade-off relation of quantum\ncoherence with different bases.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:44:10 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Ao-Xiang",""],["Yang","Ma-Cheng",""],["Qiao","Cong-Feng",""]]}
{"id":"2308.05691","submitter":"Junichiro Kawamura","authors":"Waleed Abdallah, Mustafa Ashry, Junichiro Kawamura and Ahmad Moursy","title":"Semi-visible dark photon in a model with vector-like leptons for the\n  $(g-2)_{e,\\mu}$ and $W$-boson mass anomalies","comments":"20 pages, 3 figures, 2 tables","journal-ref":null,"doi":null,"report-no":"CTPU-PTC-23-32","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a model realizes that a semi-visible dark photon which can\ncontribute to the anomalous magnetic moment ($g-2$) of both electron and muon.\nIn this model, the electron $g-2$ is deviated from the Standard Model (SM)\nprediction by the 1-loop diagrams involving the vector-like leptons, while that\nof muon is deviated due to a non-vanishing gauge kinetic mixing with photons.\nWe also argue that the $W$-boson mass can be deviated from the SM prediction\ndue to the vector-like lepton loops, so that the value obtained by the CDF II\nexperiment can be explained. Thus, this model simultaneously explains the\nrecent three anomalies in $g-2$ of electron and muon as well as the $W$-boson\nmass. The constraints on the $\\mathcal{O}(1)~\\mathrm{GeV}$ dark photon can be\navoided because of the semi-invisible decay of the dark photon, $A^\\prime \\to 2\nN \\to 2\\nu \\,2\\chi \\to 2\\nu \\,4e$, where $N$ is a SM singlet vector-like\nneutrino and $\\chi$ is a CP-even Higgs boson of the $U(1)^\\prime$ gauge\nsymmetry.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:46:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Abdallah","Waleed",""],["Ashry","Mustafa",""],["Kawamura","Junichiro",""],["Moursy","Ahmad",""]]}
{"id":"2308.05692","submitter":"Xinchi Han","authors":"Xinchi Han and Weihao Jiang and Peirui Cao and Qinwei Yang and Yunzhuo\n  Liu and Shuyao Qi and Shengkai Lin and Shizhen Zhao","title":"Isolated Scheduling for Distributed Training Tasks in GPU Clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Distributed machine learning (DML) technology makes it possible to train\nlarge neural networks in a reasonable amount of time. Meanwhile, as the\ncomputing power grows much faster than network capacity, network communication\nhas gradually become the bottleneck of DML. Current multi-tenant GPU clusters\nface network contention caused by hash-collision problem which not only further\nincreases the overhead of communication, but also creates unfairness and\naffects the user experience. In this paper, we firstly analyse how network\ncontention affects the training time in a cluster with 32 NVIDIA V100 GPUs.\nThen we propose vClos to eliminate network contention by jointly optimizing\nnetwork topology and communication pattern in distributed training. An\nOCS-vClos which introduces a layer of optical circuit switches (OCSs) in the\nleaf-spine network is also proposed to reduce potential network resource\nfragmentation caused by resource allocation strategy in vClos. Testbed\nexperiments and real-trace-based large-scale simulations are conducted to\ndemonstrate the superiority of vClos over existing network resource scheduling\nstrategies.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:48:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Han","Xinchi",""],["Jiang","Weihao",""],["Cao","Peirui",""],["Yang","Qinwei",""],["Liu","Yunzhuo",""],["Qi","Shuyao",""],["Lin","Shengkai",""],["Zhao","Shizhen",""]]}
{"id":"2308.05693","submitter":"Benedikt Pago","authors":"Moritz Lichter, Benedikt Pago, Tim Seppelt","title":"Limitations of Game Comonads via Homomorphism Indistinguishability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for\nk-variable counting logic and thereby initiated a line of work that imports\ncategory theoretic machinery to finite model theory. Such game comonads have\nbeen developed for various logics, yielding characterisations of logical\nequivalences in terms of isomorphisms in the associated co-Kleisli category. We\nshow a first limitation of this approach by studying linear-algebraic logic,\nwhich is strictly more expressive than first-order counting logic and whose\nk-variable logical equivalence relations are known as invertible-map\nequivalences (IM). We show that there exists no finite-rank comonad on the\ncategory of graphs whose co-Kleisli isomorphisms characterise IM-equivalence,\nanswering a question of \\'O Conghaile and Dawar (CSL 2021). We obtain this\nresult by ruling out a characterisation of IM-equivalence in terms of\nhomomorphism indistinguishability and employing the Lov\\'asz-type theorems for\ngame comonads established by Dawar, Jakl, and Reggio (2021). Two graphs are\nhomomorphism indistinguishable over a graph class if they admit the same number\nof homomorphisms from every graph in the class. The IM-equivalences cannot be\ncharacterised in this way, neither when counting homomorphisms in the natural\nnumbers, nor in any finite prime field.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:54:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lichter","Moritz",""],["Pago","Benedikt",""],["Seppelt","Tim",""]]}
{"id":"2308.05694","submitter":"Margaryta Myronyuk Dr","authors":"Margaryta Myronyuk","title":"Identically distributed random vectors on locally compact Abelian groups","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":"  L. Klebanov proved the following theorem. Let $\\xi_1, \\dots, \\xi_n$ be\nindependent random variables. Consider linear forms\n$L_1=a_1\\xi_1+\\cdots+a_n\\xi_n,$ $L_2=b_1\\xi_1+\\cdots+b_n\\xi_n,$\n$L_3=c_1\\xi_1+\\cdots+c_n\\xi_n,$ $L_4=d_1\\xi_1+\\cdots+d_n\\xi_n,$ where the\ncoefficients $a_j, b_j, c_j, d_j$ are real numbers. If the random vectors\n$(L_1,L_2)$ and $(L_3,L_4)$ are identically distributed, then all $\\xi_i$ for\nwhich $a_id_j-b_ic_j\\neq 0$ for all $j=\\overline{1,n}$ are Gaussian random\nvariables. The present article is devoted to an analog of the Klebanov theorem\nin the case when random variables take values in a locally compact Abelian\ngroup and the coefficients of the linear forms are integers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:55:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Myronyuk","Margaryta",""]]}
{"id":"2308.05695","submitter":"Zixuan Pan","authors":"Zixuan Pan, Jianxu Chen, Yiyu Shi","title":"Masked Diffusion as Self-supervised Representation Learner","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Denoising diffusion probabilistic models have recently demonstrated\nstate-of-the-art generative performance and been used as strong pixel-level\nrepresentation learners. This paper decomposes the interrelation between the\ngenerative capability and representation learning ability inherent in diffusion\nmodels. We present masked diffusion model (MDM), a scalable self-supervised\nrepresentation learner that substitutes the conventional additive Gaussian\nnoise of traditional diffusion with a masking mechanism. Our proposed approach\nconvincingly surpasses prior benchmarks, demonstrating remarkable advancements\nin both medical and natural image semantic segmentation tasks, particularly\nwithin the context of few-shot scenario.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:57:14 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 22:05:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pan","Zixuan",""],["Chen","Jianxu",""],["Shi","Yiyu",""]]}
{"id":"2308.05696","submitter":"Bowen Yu","authors":"Yingxiu Zhao, Bowen Yu, Binyuan Hui, Haiyang Yu, Fei Huang, Yongbin\n  Li, Nevin L. Zhang","title":"A Preliminary Study of the Intrinsic Relationship between Complexity and\n  Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Training large language models (LLMs) with open-domain instruction data has\nyielded remarkable success in aligning to end tasks and user preferences.\nExtensive research has highlighted that enhancing the quality and diversity of\ninstruction data consistently improves performance. However, the impact of data\ncomplexity, as a crucial metric, remains relatively unexplored in three\naspects: (1) scaling law, where the sustainability of performance improvements\nwith increasing complexity is uncertain, (2) additional tokens, whether the\nimprovement brought by complexity comes from introducing more training tokens,\nand (3) curriculum tuning, where the potential advantages of incorporating\ninstructions ranging from easy to difficult are not yet fully understood. In\nthis paper, we propose \\textit{tree-instruct} to systematically enhance the\ncomplexity of instruction data in a controllable manner. This approach adds a\nspecified number of nodes into the instruction semantic tree, yielding new\ninstruction data based on the modified tree. By adjusting the number of added\nnodes, we can control the difficulty level in the modified instruction data.\nOur preliminary experiments reveal the following insights: (1) Increasing\ncomplexity consistently leads to sustained performance improvements. For\ninstance, using 1,000 instruction data and 10 nodes resulted in a substantial\n24\\% increase in win rate. (2) Under the same token budget, a few complex\ninstructions outperform diverse yet simple instructions. (3) Curriculum\ninstruction tuning might not yield the anticipated results; focusing on\nincreasing complexity appears to be the key.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:58:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Zhao","Yingxiu",""],["Yu","Bowen",""],["Hui","Binyuan",""],["Yu","Haiyang",""],["Huang","Fei",""],["Li","Yongbin",""],["Zhang","Nevin L.",""]]}
{"id":"2308.05697","submitter":"Xubin Ren","authors":"Xubin Ren, Lianghao Xia, Yuhao Yang, Wei Wei, Tianle Wang, Xuheng Cai\n  and Chao Huang","title":"SSLRec: A Self-Supervised Learning Library for Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning (SSL) has gained significant interest in recent\nyears as a solution to address the challenges posed by sparse and noisy data in\nrecommender systems. Despite the growing number of SSL algorithms designed to\nprovide state-of-the-art performance in various recommendation scenarios (e.g.,\ngraph collaborative filtering, sequential recommendation, social\nrecommendation, KG-enhanced recommendation), there is still a lack of unified\nframeworks that integrate recommendation algorithms across different domains.\nSuch a framework could serve as the cornerstone for self-supervised\nrecommendation algorithms, unifying the validation of existing methods and\ndriving the design of new ones. To address this gap, we introduce SSLRec, a\nnovel benchmark platform that provides a standardized, flexible, and\ncomprehensive framework for evaluating various SSL-enhanced recommenders. The\nSSLRec library features a modular architecture that allows users to easily\nevaluate state-of-the-art models and a complete set of data augmentation and\nself-supervised toolkits to help create SSL recommendation models with specific\nneeds. Furthermore, SSLRec simplifies the process of training and evaluating\ndifferent recommendation models with consistent and fair settings. Our SSLRec\nplatform covers a comprehensive set of state-of-the-art SSL-enhanced\nrecommendation models across different scenarios, enabling researchers to\nevaluate these cutting-edge models and drive further innovation in the field.\nOur implemented SSLRec framework is available at the source code repository\nhttps://github.com/HKUDS/SSLRec.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:59:36 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ren","Xubin",""],["Xia","Lianghao",""],["Yang","Yuhao",""],["Wei","Wei",""],["Wang","Tianle",""],["Cai","Xuheng",""],["Huang","Chao",""]]}
{"id":"2308.05698","submitter":"Kojo Adu-Gyamfi","authors":"Kojo Konadu Adu-Gyamfi, Karo Ahmadi-Dehrashid, Yaw Okyere Adu-Gyamfi,\n  Pujitha Gunaratne, Anuj Sharma","title":"MobiScout: A Scalable Cloud-Based Driving and Activity Monitoring\n  Platform Featuring an IOS App and a WatchOS Extension","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  MobiScout is an iOS software that monitors users' driving habits and\nphysiological conditions while on the road. The Mobiscout app was created to\nprovide a low-cost next-generation data collection and analysis solution for\nnaturalistic driving studies. MobiScout collects real-time data, including\nphysiological information from drivers in their normal driving conditions using\nsensors and cameras on mobile phones, smartwatches, and Bluetooth-enabled OBD\nequipment. The MobiScout software captures vehicle and driving data, including\nspeed, braking, pulse rate, and acceleration, while the phone's camera captures\neverything inside and outside the car. Data captured can be streamed to cloud\nstorage in real-time or persisted in local storage in WIFI dead zones. The\ninformation gathered will be studied further to better understand typical\ntraffic behavior, performance, surroundings, and driving context among drivers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:00:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Adu-Gyamfi","Kojo Konadu",""],["Ahmadi-Dehrashid","Karo",""],["Adu-Gyamfi","Yaw Okyere",""],["Gunaratne","Pujitha",""],["Sharma","Anuj",""]]}
{"id":"2308.05699","submitter":"Aaron Goldberg","authors":"Aaron Z. Goldberg and Khabat Heshami","title":"Teleamplification on Borealis","comments":"7+4 pages, 5+6 figures; comments always welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A recent theoretical proposal for teleamplification requires preparation of\nFock states, programmable interferometers, and photon-number resolving\ndetectors to herald the teleamplification of an input state. These enable\nteleportation and heralded noiseless linear amplification of a photonic state\nup to an arbitrarily large energy cutoff. We report on adapting this proposal\nfor Borealis and demonstrating teleamplification of squeezed-vacuum states with\nvariable amplification factors. The results match the theoretical predictions\nand exhibit features of amplification in the teleported mode. This\ndemonstration motivates the continued development of photonic quantum computing\nhardware for noiseless linear amplification's applications across quantum\ncommunication, sensing, and error correction.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:02:32 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Goldberg","Aaron Z.",""],["Heshami","Khabat",""]]}
{"id":"2308.05700","submitter":"Sarah E Carter","authors":"Sarah E. Carter, Mathieu d'Aquin, Dayana Spagnuelo, Ilaria Tiddi,\n  Kathryn Cormican, Heike Felzmann","title":"The Privacy-Value-App Relationship and the Value-Centered Privacy\n  Assistant","comments":"14 pages, Preprint; under review. Supplementary available at:\n  https://zenodo.org/record/8234190","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many of us make quick decisions that affect our data privacy on our\nsmartphones without due consideration of our values. One such decision point is\nestablishing whether to download a smartphone app or not. In this work, we aim\nto better understand the relationship between our values, our privacy\npreferences, and our app choices, as well as explore the effectiveness of a\nsmartphone value-centered privacy assistant (VcPA) at promoting value-centered\napp selection. To do this, we conducted a mixed-methods study that involved two\nphases. The first was an online survey of 273 smartphone user's values and\nprivacy preferences when considering whether to download one of two apps (Lose\nIt! and OpenLitterMap). Our results suggest that values and privacy preferences\nare related in an app or context-dependent manner. The second phase was testing\nthe VcPA with 77 users in a synthetic Mock App Store setting. We established\nusability of a VcPA, with the VcPA helping some users more than others with\nselecting apps consistent with their selected value profile. Future qualitative\nand context-specific explorations of user perspectives could contribute to\nadequately capturing the specific role of values for privacy decision-making\nand improving the VcPA.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:04:12 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Carter","Sarah E.",""],["d'Aquin","Mathieu",""],["Spagnuelo","Dayana",""],["Tiddi","Ilaria",""],["Cormican","Kathryn",""],["Felzmann","Heike",""]]}
{"id":"2308.05701","submitter":"Daniel Bogdoll","authors":"Daniel Bogdoll, Lukas Bosch, Tim Joseph, Helen Gremmelmaier, Yitian\n  Yang, J. Marius Z\\\"ollner","title":"Exploring the Potential of World Models for Anomaly Detection in\n  Autonomous Driving","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years there have been remarkable advancements in autonomous\ndriving. While autonomous vehicles demonstrate high performance in closed-set\nconditions, they encounter difficulties when confronted with unexpected\nsituations. At the same time, world models emerged in the field of model-based\nreinforcement learning as a way to enable agents to predict the future\ndepending on potential actions. This led to outstanding results in sparse\nreward and complex control tasks. This work provides an overview of how world\nmodels can be leveraged to perform anomaly detection in the domain of\nautonomous driving. We provide a characterization of world models and relate\nindividual components to previous works in anomaly detection to facilitate\nfurther research in the field.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:04:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Bogdoll","Daniel",""],["Bosch","Lukas",""],["Joseph","Tim",""],["Gremmelmaier","Helen",""],["Yang","Yitian",""],["Z\u00f6llner","J. Marius",""]]}
{"id":"2308.05702","submitter":"Ranjan Modak","authors":"Ranjan Modak","title":"Engineering skin effect across a junction of Hermitian and non-Hermitian\n  lattice","comments":"7 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a system where the two edges of a non-Hermitian lattice with\nasymmetric nearest-neighbor hopping are connected with two Hermitian lattices\nwith symmetric nearest-neighbor hopping.\n  In the absence of those Hermitian lattices, the majority of the eigenstates\nof the system will be localized at the edges, the phenomena known as the\nnon-Hermitian skin effect. We show that once we connect it with the Hermitian\nlattices, for open boundary conditions (OBC), the localized states exist at the\njunction of the non-Hermitian and Hermitian lattice; moreover, the spectrum\nshows mobility edges that separate delocalized and localized states. On the\ncontrary, mobility edges vanish for periodic boundary conditions (PBC), and the\ndelocalized phase turns into a scale-invariant localized phase, where the\nlocalized states are still peaked at the junctions. We also find that if the\nconnected Hermitian lattices are thermodynamically large, in OBC, most of the\nstates become delocalized, while in PBC, the system still shows the\nscale-invariant localized phase.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:06:55 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Modak","Ranjan",""]]}
{"id":"2308.05703","submitter":"Jose Ceniceros","authors":"Jose Ceniceros","title":"$p$-Fold Cyclic Branched Covers and Overtwisted Contact Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article presents an alternate way to prove a result originally proven by\nHarvey, Kawamuro, and Plamenvskaya in \\cite{HaKaPl}. We accomplish this by\nexplicitly constructing an overtwisted disk in the $p$-fold cyclic branched\ncover of $S^3$ with the standard contact structure branched along a carefully\nselected transverse knot. Furthermore, by utilizing this construction of the\novertwisted disk, we can see that the overtwisted disk is contained in the\ncomplement of the branch locus.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:07:17 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ceniceros","Jose",""]]}
{"id":"2308.05704","submitter":"Alfredo Glioti","authors":"Siyu Chen, Alfredo Glioti, Giuliano Panico, Andrea Wulzer","title":"Boosting likelihood learning with event reweighting","comments":"51 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extracting maximal information from experimental data requires access to the\nlikelihood function, which however is never directly available for complex\nexperiments like those performed at high energy colliders. Theoretical\npredictions are obtained in this context by Monte Carlo events, which do\nfurnish an accurate but abstract and implicit representation of the likelihood.\nStrategies based on statistical learning are currently being developed to infer\nthe likelihood function explicitly by training a continuous-output classifier\non Monte Carlo events. In this paper, we investigate the usage of Monte Carlo\nevents that incorporate the dependence on the parameters of interest by\nreweighting. This enables more accurate likelihood learning with less training\ndata and a more robust learning scheme that is more suited for automation and\nextensive deployment. We illustrate these advantages in the context of LHC\nprecision probes of new Effective Field Theory interactions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:07:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Siyu",""],["Glioti","Alfredo",""],["Panico","Giuliano",""],["Wulzer","Andrea",""]]}
{"id":"2308.05705","submitter":"Md Abhishek","authors":"Md. Abhishek, Subramanya Hegde, Dileep P. Jatkar, Arnab Priya Saha,\n  and Amit Suthar","title":"Loop Amplitudes in the Coulomb Branch of $\\mathcal{N}=4$\n  Super-Yang-Mills Theory","comments":"44 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study four point loop amplitudes at an arbitrary point in the Coulomb\nbranch of $\\mathcal{N}=4$ super-Yang-Mills theory. We study two particle\nunitary cuts up to four loop order. We explicitly verify that bubble and\ntriangle graphs do not contribute at one loop level and show that the results\nhold at higher loop level as well. We also write down an all loop recursion\nrelation for two particle reducible graphs for four point amplitudes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:08:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Abhishek","Md.",""],["Hegde","Subramanya",""],["Jatkar","Dileep P.",""],["Saha","Arnab Priya",""],["Suthar","Amit",""]]}
{"id":"2308.05706","submitter":"Paolo Saracco","authors":"Paolo Saracco","title":"A remark on the Galois-type correspondence between ideal coideals and\n  comodule subrings of a Hopf algebroid","comments":"13 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We exhibit a bijective correspondence between certain left ideal coideals in\na Hopf algebroid for which the resulting quotient is a coequalizer and certain\nright coideal subrings which are themselves an equalizer, remarkably improving\na recent result of the author obtained in collaboration with L. El Kaoutit, A.\nGhobadi and J. Vercruysse. Interpreting this result in the Hopf algebra setting\nprovides a bijective correspondence which extends the previously known cases.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:10:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Saracco","Paolo",""]]}
{"id":"2308.05707","submitter":"Jiageng Zhu","authors":"Jiageng Zhu, Hanchen Xie, Jianhua Wu, Jiazhi Li, Mahyar Khayatkhoei,\n  Mohamed E. Hussein, Wael AbdAlmageed","title":"Shadow Datasets, New challenging datasets for Causal Representation\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Discovering causal relations among semantic factors is an emergent topic in\nrepresentation learning. Most causal representation learning (CRL) methods are\nfully supervised, which is impractical due to costly labeling. To resolve this\nrestriction, weakly supervised CRL methods were introduced. To evaluate CRL\nperformance, four existing datasets, Pendulum, Flow, CelebA(BEARD) and\nCelebA(SMILE), are utilized. However, existing CRL datasets are limited to\nsimple graphs with few generative factors. Thus we propose two new datasets\nwith a larger number of diverse generative factors and more sophisticated\ncausal graphs. In addition, current real datasets, CelebA(BEARD) and\nCelebA(SMILE), the originally proposed causal graphs are not aligned with the\ndataset distributions. Thus, we propose modifications to them.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:14:07 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 19:24:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Jiageng",""],["Xie","Hanchen",""],["Wu","Jianhua",""],["Li","Jiazhi",""],["Khayatkhoei","Mahyar",""],["Hussein","Mohamed E.",""],["AbdAlmageed","Wael",""]]}
{"id":"2308.05708","submitter":"Hector Pasten","authors":"Natalia Garcia-Fritz, Hector Pasten","title":"Intersecting the torsion of elliptic curves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2007, Bogomolov and Tschinkel proved that given two complex elliptic\ncurves $E_1$ and $E_2$ along with even degree-$2$ maps $\\pi_j\\colon E_j\\to\n\\mathbb{P}^1$ having different branch loci, the intersection of the image of\nthe torsion points of $E_1$ and $E_2$ under their respective $\\pi_j$ is finite.\nThey conjectured (also in works with Fu) that the cardinality of this\nintersection is uniformly bounded independently of the elliptic curves. As it\nhas been observed in the literature, the recent proof of the Uniform\nManin--Mumford conjecture implies a full solution of the\nBogomolov--Fu--Tschinkel conjecture. In this work we prove a generalization of\nthe Bogomolov--Fu--Tschinkel conjecture where instead of even degree-$2$ maps\none can use any rational functions of bounded degree on the elliptic curves as\nlong as they have different branch loci. Our approach combines Nevanlinna\ntheory with the Uniform Manin--Mumford conjecture. With similar techniques, we\nalso prove a result on lower bounds for ranks of elliptic curves over number\nfields.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:14:09 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Garcia-Fritz","Natalia",""],["Pasten","Hector",""]]}
{"id":"2308.05709","submitter":"Juan Carlos Loredo Rosillo","authors":"H. Cao, L. M. Hansen, F. Giorgino, L. Carosini, P. Zahalka, F. Zilk,\n  J. C. Loredo, P. Walther","title":"A photonic source of heralded GHZ states","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generating large multiphoton entangled states is of main interest due to\nenabling universal photonic quantum computing and all-optical quantum repeater\nnodes. These applications exploit measurement-based quantum computation using\ncluster states. Remarkably, it was shown that photonic cluster states of\narbitrary size can be generated by using feasible heralded linear optics fusion\ngates that act on heralded three-photon Greenberger-Horne-Zeilinger (GHZ)\nstates as the initial resource state. Thus, the capability of generating\nheralded GHZ states is of great importance for scaling up photonic quantum\ncomputing. Here, we experimentally demonstrate this required building block by\nreporting a polarisation-encoded heralded GHZ state of three photons, for which\nwe build a high-rate six-photon source ($547{\\pm}2$ Hz) from a solid-state\nquantum emitter and a stable polarisation-based interferometer. The detection\nof three ancillary photons heralds the generation of three-photon GHZ states\namong the remaining particles with fidelities up to\n$\\mathcal{F}=0.7278{\\pm}0.0106$. Our results initiate a path for scalable\nentangling operations using heralded linear-optics implementations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:17:28 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Cao","H.",""],["Hansen","L. M.",""],["Giorgino","F.",""],["Carosini","L.",""],["Zahalka","P.",""],["Zilk","F.",""],["Loredo","J. C.",""],["Walther","P.",""]]}
{"id":"2308.05710","submitter":"Dominik Vietinghoff","authors":"Dominik Vietinghoff (1), Michael B\\\"ottinger (2), Gerik Scheuermann\n  (1), Christian Heine (1) ((1) Leipzig University, (2) Deutsches\n  Klimarechenzentrum)","title":"A Mathematical Foundation for the Spatial Uncertainty of Critical Points\n  in Probabilistic Scalar Fields","comments":"11 pages, 8 figures, to appear in an IEEE VGTC sponsored conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Critical points mark locations in the domain where the level-set topology of\na scalar function undergoes fundamental changes and thus indicate potentially\ninteresting features in the data. Established methods exist to locate and\nrelate such points in a deterministic setting, but it is less well understood\nhow the concept of critical points can be extended to the analysis of uncertain\ndata. Most methods for this task aim at finding likely locations of critical\npoints or estimate the probability of their occurrence locally but do not\nindicate if critical points at potentially different locations in different\nrealizations of a stochastic process are manifestations of the same feature,\nwhich is required to characterize the spatial uncertainty of critical points.\nPrevious work on relating critical points across different realizations\nreported challenges for interpreting the resulting spatial distribution of\ncritical points but did not investigate the causes. In this work, we provide a\nmathematical formulation of the problem of finding critical points with spatial\nuncertainty and computing their spatial distribution, which leads us to the\nnotion of uncertain critical points. We analyze the theoretical properties of\nthese structures and highlight connections to existing works for special\nclasses of uncertain fields. We derive conditions under which\nwell-interpretable results can be obtained and discuss the implications of\nthose restrictions for the field of visualization. We demonstrate that the\ndiscussed limitations are not purely academic but also arise in real-world\ndata.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:18:25 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Vietinghoff","Dominik",""],["B\u00f6ttinger","Michael",""],["Scheuermann","Gerik",""],["Heine","Christian",""]]}
{"id":"2308.05711","submitter":"Marshall Wang","authors":"Marshall Wang, John Willes, Thomas Jiralerspong, Matin Moezzi","title":"A Comparison of Classical and Deep Reinforcement Learning Methods for\n  HVAC Control","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":"  Reinforcement learning (RL) is a promising approach for optimizing HVAC\ncontrol. RL offers a framework for improving system performance, reducing\nenergy consumption, and enhancing cost efficiency. We benchmark two popular\nclassical and deep RL methods (Q-Learning and Deep-Q-Networks) across multiple\nHVAC environments and explore the practical consideration of model\nhyper-parameter selection and reward tuning. The findings provide insight for\nconfiguring RL agents in HVAC systems, promoting energy-efficient and\ncost-effective operation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:20:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Wang","Marshall",""],["Willes","John",""],["Jiralerspong","Thomas",""],["Moezzi","Matin",""]]}
{"id":"2308.05712","submitter":"Dhruba Jyoti Gogoi Dr.","authors":"Surajit Mandal, Surajit Das, Ananda Pramanik and Dhruba Jyoti Gogoi","title":"Leading-order corrections to the thermodynamics of Rindler modified\n  Schwarzschild black hole","comments":"28 pages, 9 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 present a thermodynamical study of a Rindler modified\nSchwarzschild black hole under the consideration of small thermal fluctuations.\nIn particular, we compute various stable macroscopic thermodynamic variables\nsuch as Hawking temperature, entropy, Helmholtz free energy, internal energy,\nenthalpy, and Gibbs free energy. To explore the effects of small statistical\nthermal fluctuations on stable thermodynamical parameters, we estimated the\ncorrections to the various thermodynamical potentials of Rindler modified\nSchwarzschild black hole upto the first (leading) order and do a comparative\nstudy for the different values of correction parameter and Rindler acceleration\nparameter for fixed values of a cosmological constant. We study the stability\nof black holes under the consideration of thermal fluctuations and notice that\nthe small-sized black hole is stable and the large-sized black hole is unstable\nfor a negative value of correction parameter. For the positive value of the\ncorrection parameter, both the small and large black holes become unstable.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:20:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Mandal","Surajit",""],["Das","Surajit",""],["Pramanik","Ananda",""],["Gogoi","Dhruba Jyoti",""]]}
{"id":"2308.05713","submitter":"Ernest Davis","authors":"Ernest Davis and Scott Aaronson","title":"Testing GPT-4 with Wolfram Alpha and Code Interpreter plug-ins on math\n  and science problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI math.HO physics.pop-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report describes a test of the large language model GPT-4 with the\nWolfram Alpha and the Code Interpreter plug-ins on 105 original problems in\nscience and math, at the high school and college levels, carried out in\nJune-August 2023. Our tests suggest that the plug-ins significantly enhance\nGPT's ability to solve these problems. Having said that, there are still often\n\"interface\" failures; that is, GPT often has trouble formulating problems in a\nway that elicits useful answers from the plug-ins. Fixing these interface\nfailures seems like a central challenge in making GPT a reliable tool for\ncollege-level calculation problems.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:22:28 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 23:59:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Davis","Ernest",""],["Aaronson","Scott",""]]}
{"id":"2308.05714","submitter":"Hector Pasten","authors":"Natalia Garcia-Fritz, Hector Pasten","title":"Hilbert's tenth problem for lacunary entire functions of finite order","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the context of Hilbert's tenth problem, an outstanding open case is that\nof complex entire functions in one variable. A negative solution is known for\npolynomials (by Denef) and for exponential polynomials of finite order (by\nChompitaki, Garcia-Fritz, Pasten, Pheidas, and Vidaux), but no other case is\nknown for rings of complex entire functions in one variable. We prove a\nnegative solution to the analogue of Hilbert's tenth problem for rings of\ncomplex entire functions of finite order having lacunary power series expansion\nat the origin.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:22:52 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Garcia-Fritz","Natalia",""],["Pasten","Hector",""]]}
{"id":"2308.05715","submitter":"Bernd Schr\\\"oder","authors":"Bernd S. W. Schr\\\"oder","title":"Towards the Automorphism Conjecture I: Combinatorial Control and\n  Compensation for Factorials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper exploits adjacencies between the orbits of an ordered set P and a\nconsequence of the classification of finite simple groups to, in many cases,\nexponentially bound the number of automorphisms. Results clearly identify the\nstructures which currently prevent the proof of such an exponential bound, or\nwhich indeed inflate the number of automorphisms beyond such a bound. This is a\nfirst step towards a possible resolution of the Automorphism Conjecture for\nordered sets.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:26:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Schr\u00f6der","Bernd S. W.",""]]}
{"id":"2308.05716","submitter":"Masahisa Ebina","authors":"Masahisa Ebina","title":"Ergodicity and central limit theorems for stochastic wave equations in\n  high dimensions","comments":"49 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider stochastic wave equations in spatial dimensions $d \\geq 4$. We\nassume that the driving noise is given by a Gaussian noise that is white in\ntime and has some spatial correlation. We show that the solution process is\nspatially ergodic under the spatial shift using the tools of Malliavin\ncalculus. When the spatial correlation is given by the Riesz kernel, we also\nestablish that the spatial integral of the solution with proper normalization\nconverges to the standard normal distribution under the Wasserstein distance.\nThe convergence is obtained by first constructing the approximation sequence to\nthe solution and then applying Malliavin-Stein's method to the normalized\nspatial integral of the sequence. The corresponding functional central limit\ntheorem is presented as well.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:29:23 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Ebina","Masahisa",""]]}
{"id":"2308.05717","submitter":"Madeline Pettine","authors":"M. Pettine, S. Imbeah, J. Rathbun, A. Hayes, R. Lopes-Gautier, A.\n  Mura, F. Tosi, F. Zambon, S. Bertolino","title":"JIRAM Observations of Volcanic Flux on Io: Distribution and Comparison\n  to Tidal Heat Flow Models","comments":"Submitted for review to Geophysical Research Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Jovian Infrared Auroral Mapper (JIRAM) instrument aboard Juno has allowed\nclear, high-resolution imaging of Io's polar volcanoes. We have used data from\nJIRAM's M-band (4.78 micron) imager from eleven Juno orbits to construct a\nglobal map of volcanic flux. This map provides insight into the spatial\ndistribution of volcanoes and the ways in which high- and low-latitude\nvolcanoes differ. Using spherical harmonic analysis, we have quantitatively\ncompared our volcanic flux map to the surface heat flow distribution expected\nby modeling data of Io's tidal heat deposition (de Kleer et al. 2019). Systems\nof bright volcanoes were confirmed at high latitudes. Our study finds that both\npoles are more active than previous studies have suggested, although the south\npole was viewed too infrequently to establish reliable long-term trends. While\nnone of the tidal heat flow models match well, the asthenospheric heating model\nagrees best with the observed volcanic flux.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:29:50 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Pettine","M.",""],["Imbeah","S.",""],["Rathbun","J.",""],["Hayes","A.",""],["Lopes-Gautier","R.",""],["Mura","A.",""],["Tosi","F.",""],["Zambon","F.",""],["Bertolino","S.",""]]}
{"id":"2308.05718","submitter":"Alexander Shabalin","authors":"Alexander N. Shabalin, Evgeniia P. Ovchinnikova, Yuri E. Charikov","title":"Temporal and Spatial Characteristics of Hard X-Ray Sources in Flare\n  Model with a Vertical Current Sheet","comments":"Accepted for publication in the Astrophysical Journal. 18 pages, 6\n  figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyzed changes in the height of the coronal hard X-ray (HXR) source for\nflares SOL2013-05-13T01:50 and SOL2013-05-13T15:51. Analysis of the Reuven\nRamaty High Energy Solar Spectroscopic Imager data revealed the downward motion\nof the HXR source and the separation of the sources by energy and height. In\nthe early stages of the flares, a negative correlation was found between the\nHXR source area in the corona and HXR flux. For the SOL2013-05-13T15:51 event,\nan increasing trend in the time delay spectra at the footpoints was obtained.\nFor both events, the spectra of the time delays in the coronal HXR source\nshowed a decreasing trend across the energies in certain flare phases. To\ninterpret the observed phenomena, we considered a flare model of collapsing\ntraps and calculated the distribution functions of accelerated electrons along\nthe magnetic loop using a nonstationary relativistic kinetic equation. This\napproach considers betatron and Fermi first-order acceleration mechanisms. The\nincreasing trend of the time delay spectra at the footpoints was explained by\nthe high mirror ratio in the magnetic loop and betatron acceleration mechanism.\nThe observed features in the spatial and temporal behavior of the HXR sources,\nsuch as the negative correlation between the HXR source area and HXR flux, can\nbe interpreted by the collapsing trap model.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:31:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Shabalin","Alexander N.",""],["Ovchinnikova","Evgeniia P.",""],["Charikov","Yuri E.",""]]}
{"id":"2308.05719","submitter":"Supragyan Priyadarshinee","authors":"Supragyan Priyadarshinee","title":"Quasi-normal mode of dyonic hairy black hole and its interplay with\n  phase transitions","comments":"29 pages, 45 Figures. arXiv admin note: text overlap with\n  arXiv:2108.02514","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the dynamical stability of hairy dyonic black holes in the\nEinstein-Maxwell-scalar gravity system against the massless scalar field\nperturbation. We numerically obtain the corresponding quasinormal modes (QNMs)\nusing the series solution and shooting methods for various black hole\nparameters. We find that the numerical values obtained from these two methods\nagree well with each other. The imaginary part of the QNM is always negative,\nindicating the stability of the dyonic hairy black hole against the scalar\nperturbation. We find that the decay and oscillatory modes of the scalar field\nperturbation increase linearly with the horizon radius for large black holes.\nWe thoroughly investigate the behaviour of QNMs for different values of black\nhole parameters, including the electric charge, magnetic charge, horizon radius\nand hairy parameter, etc. Moreover, we also analyse the QNM near the\nsmall/large black hole phase transition and find that the nature of the QNMs is\ndifferent for large and small black hole phases, suggesting QNMs as the\npossible probe of black hole phase transition.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:35:01 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 11:28:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Priyadarshinee","Supragyan",""]]}
{"id":"2308.05720","submitter":"Arindam Mandal","authors":"Ashutosh Kumar Alok, Neetu Raj Singh Chundawat and Arindam Mandal","title":"Correlating neutrino millicharge and muon $(g-2)$ in an abelian\n  $L_\\mu-L_\\tau$ model","comments":"15 Pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The inclusion of an additional $U(1)$ gauge symmetry is a common feature in\nmany extensions of the Standard Model, revealing the intricate connections\nbetween particle physics and cosmology. The $L_{\\mu} - L_{\\tau}$ model stands\nas a prominent member of this distinguished family, characterized by its\nanomaly-free nature and resilience in the face of collider constraints. This\nframework provides a unique vantage point for investigating both the intriguing\nmystery of the muon $(g-2)$ anomaly and the puzzling issue of the Hubble\ntension. However, due to the presence of kinetic mixing between the photon and\n$Z'$ in this model, the neutrinos have the potential to acquire minuscule\nelectric charges, often referred to as millicharges ($q_{\\nu}$) which is\ndirectly related to the strength of the new gauge couplings. A crucial question\nemerges: how does the model's inclusion of millicharges, while adhering to the\nstringent constraints imposed by experimental observations, influence its\ninherent ability to address the muon $(g-2)$ anomaly and the Hubble tension? We\nfind the current upper bounds on $q_{\\nu}$ derived from experiments such as the\nbeam dump, XENONnT and LUX-ZEPLIN experiments can impose strong constraints on\nthe $U(1)_{L_{\\mu} - L_{\\tau}}$ coupling. Consequently, these constraints may\nlimit the ability of the model to fully accommodate the current measurement of\n$(g-2)_{\\mu}$ while having a relatively minor impact on the resolution of the\nHubble tension.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:36:57 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Alok","Ashutosh Kumar",""],["Chundawat","Neetu Raj Singh",""],["Mandal","Arindam",""]]}
{"id":"2308.05721","submitter":"Yangyang Xu","authors":"Yangyang Xu, Yibo Yang, Bernard Ghanemm, Lefei Zhang, Du Bo, Dacheng\n  Tao","title":"Deformable Mixer Transformer with Gating for Multi-Task Learning of\n  Dense Prediction","comments":"submitted to IJCV; an extension to our previous AAAI 2023 paper\n  arXiv:2301.03461","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CNNs and Transformers have their own advantages and both have been widely\nused for dense prediction in multi-task learning (MTL). Most of the current\nstudies on MTL solely rely on CNN or Transformer. In this work, we present a\nnovel MTL model by combining both merits of deformable CNN and query-based\nTransformer with shared gating for multi-task learning of dense prediction.\nThis combination may offer a simple and efficient solution owing to its\npowerful and flexible task-specific learning and advantages of lower cost, less\ncomplexity and smaller parameters than the traditional MTL methods. We\nintroduce deformable mixer Transformer with gating (DeMTG), a simple and\neffective encoder-decoder architecture up-to-date that incorporates the\nconvolution and attention mechanism in a unified network for MTL. It is\nexquisitely designed to use advantages of each block, and provide deformable\nand comprehensive features for all tasks from local and global perspective.\nFirst, the deformable mixer encoder contains two types of operators: the\nchannel-aware mixing operator leveraged to allow communication among different\nchannels, and the spatial-aware deformable operator with deformable convolution\napplied to efficiently sample more informative spatial locations. Second, the\ntask-aware gating transformer decoder is used to perform the task-specific\npredictions, in which task interaction block integrated with self-attention is\napplied to capture task interaction features, and the task query block\nintegrated with gating attention is leveraged to select corresponding\ntask-specific features. Further, the experiment results demonstrate that the\nproposed DeMTG uses fewer GFLOPs and significantly outperforms current\nTransformer-based and CNN-based competitive models on a variety of metrics on\nthree dense prediction datasets. Our code and models are available at\nhttps://github.com/yangyangxu0/DeMTG.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:37:49 GMT"},{"version":"v2","created":"Fri, 11 Aug 2023 05:39:02 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 08:15:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Yangyang",""],["Yang","Yibo",""],["Ghanemm","Bernard",""],["Zhang","Lefei",""],["Bo","Du",""],["Tao","Dacheng",""]]}
{"id":"2308.05722","submitter":"Lukas Liehr","authors":"Lukas Liehr","title":"Arithmetic progressions and holomorphic phase retrieval","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the phase retrieval problem within the broader context of analytic\nfunctions. Given a parameter $\\theta \\in \\mathbb{R}$, we derive the following\ncharacterization of uniqueness in terms of rigidity of a set $\\Lambda \\subseteq\n\\mathbb{R}$: if $\\mathcal{F}$ is a vector space of entire functions containing\nall exponentials $e^{\\xi z}, \\, \\xi \\in \\mathbb{C} \\setminus \\{ 0 \\}$, then\nevery $F \\in \\mathcal{F}$ is uniquely determined up to a unimodular phase\nfactor by $\\{ |F(z)| : z \\in e^{i\\theta}(\\mathbb{R} + i \\Lambda) \\}$ if and\nonly if $\\Lambda$ is not contained in an arithmetic progression\n$a\\mathbb{Z}+b$. Leveraging this insight, we establish a series of consequences\nfor Gabor phase retrieval and Pauli-type uniqueness problems. For instance,\n$\\mathbb{Z} \\times \\tilde{\\mathbb{Z}}$ is a uniqueness set for the Gabor phase\nretrieval problem in $L^2(\\mathbb{R}_+)$, provided that $\\tilde{\\mathbb{Z}}$ is\na suitable perturbation of the integers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:38:07 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liehr","Lukas",""]]}
{"id":"2308.05723","submitter":"Manimala Chakraborti","authors":"Manimala Chakraborti, Sven Heinemeyer, and Ipsita Saha","title":"$(g-2)_\\mu$ and Stau coannihilation : Dark Matter and Collider Analysis","comments":"37 pages, 11 figures. arXiv admin note: text overlap with\n  arXiv:2112.01389","journal-ref":null,"doi":null,"report-no":"IFT--UAM/CSIC--23-080","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Slepton coannihilation is one of the most promising scenarios that can bring\nthe predicted Dark Matter (DM) abundance in the the Minimal Supersymmetric\nStandard Model (MSSM) into agreement with the experimental observation. In this\nscenario, the lightest supersymmetric particle (LSP), usually assumed to be the\nlightest neutralino, can serve as a Dark Matter (DM) candidate while the\nsleptons as the next-to-LSPs (NLSPs) lie close in mass. In our previous studies\nanalyzing the electroweak (EW) sector of MSSM, a degeneracy between the three\ngenerations of sleptons was assumed for the sake of simplicity. In case of\nslepton coannihilation this directly links the smuons involved in the\nexplanation for $(g-2)_\\mu$ to the coannihilating NLSPs required to explain the\nDM content of the universe. On the other hand, in Grand Unified Theories such\ndegeneracy do not hold, and often the lighter stau turns out to be the NLSP at\nthe EW scale, with the smuons (and selectrons) somewhat heavier. In this paper\nwe analyze a non-universal slepton mass scenario at the EW scale where the\nfirst two generations of sleptons are taken to be mass-degenerate and heavier\nthan the staus, enforcing stau coannihilation. We analyze the parameter space\nof the MSSM in the light of a variety of experimental data namely, the DM relic\ndensity and direct detection (DD) limits, LHC data and especially, the\ndiscrepancy between the experimental result for $(g-2)_\\mu$, and its Standard\nModel (SM) prediction. We find an upper limit on the LSP and NLSP masses of\nabout ~ 550 GeV. In contrast to the scenario with full degeneracy among the\nthree families of sleptons, the upper limit on the light smuon/selectron mass\nmoves up by ~ 200 GeV. We analyze the DD prospects as well as the physics\npotential of the HL-LHC and a future high-energy $e^+ e^-$ collider to\ninvestigate this scenario further.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:39:41 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chakraborti","Manimala",""],["Heinemeyer","Sven",""],["Saha","Ipsita",""]]}
{"id":"2308.05724","submitter":"Kanishka Tyagi","authors":"Chinmay Rane, Kanishka Tyagi, Michael Manry","title":"Optimizing Performance of Feedforward and Convolutional Neural Networks\n  through Dynamic Activation Functions","comments":"Under submission in Neurocomputing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CE cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning training training algorithms are a huge success in recent years\nin many fields including speech, text,image video etc. Deeper and deeper layers\nare proposed with huge success with resnet structures having around 152 layers.\nShallow convolution neural networks(CNN's) are still an active research, where\nsome phenomena are still unexplained. Activation functions used in the network\nare of utmost importance, as they provide non linearity to the networks. Relu's\nare the most commonly used activation function.We show a complex piece-wise\nlinear(PWL) activation in the hidden layer. We show that these PWL activations\nwork much better than relu activations in our networks for convolution neural\nnetworks and multilayer perceptrons. Result comparison in PyTorch for shallow\nand deep CNNs are given to further strengthen our case.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:39:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Rane","Chinmay",""],["Tyagi","Kanishka",""],["Manry","Michael",""]]}
{"id":"2308.05725","submitter":"Tu Anh Nguyen","authors":"Tu Anh Nguyen, Wei-Ning Hsu, Antony D'Avirro, Bowen Shi, Itai Gat,\n  Maryam Fazel-Zarani, Tal Remez, Jade Copet, Gabriel Synnaeve, Michael Hassid,\n  Felix Kreuk, Yossi Adi, Emmanuel Dupoux","title":"EXPRESSO: A Benchmark and Analysis of Discrete Expressive Speech\n  Resynthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent work has shown that it is possible to resynthesize high-quality speech\nbased, not on text, but on low bitrate discrete units that have been learned in\na self-supervised fashion and can therefore capture expressive aspects of\nspeech that are hard to transcribe (prosody, voice styles, non-verbal\nvocalization). The adoption of these methods is still limited by the fact that\nmost speech synthesis datasets are read, severely limiting spontaneity and\nexpressivity. Here, we introduce Expresso, a high-quality expressive speech\ndataset for textless speech synthesis that includes both read speech and\nimprovised dialogues rendered in 26 spontaneous expressive styles. We\nillustrate the challenges and potentials of this dataset with an expressive\nresynthesis benchmark where the task is to encode the input in low-bitrate\nunits and resynthesize it in a target voice while preserving content and style.\nWe evaluate resynthesis quality with automatic metrics for different\nself-supervised discrete encoders, and explore tradeoffs between quality,\nbitrate and invariance to speaker and style. All the dataset, evaluation\nmetrics and baseline models are open source\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:41:19 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Nguyen","Tu Anh",""],["Hsu","Wei-Ning",""],["D'Avirro","Antony",""],["Shi","Bowen",""],["Gat","Itai",""],["Fazel-Zarani","Maryam",""],["Remez","Tal",""],["Copet","Jade",""],["Synnaeve","Gabriel",""],["Hassid","Michael",""],["Kreuk","Felix",""],["Adi","Yossi",""],["Dupoux","Emmanuel",""]]}
{"id":"2308.05726","submitter":"A G Sreejith","authors":"A. G. Sreejith, Kevin France, Luca Fossati, Tommi T. Koskinen, Arika\n  Egan, P. Wilson Cauley, Patricio. E. Cubillos, S. Ambily, Chenliang Huang,5\n  Panayotis Lavvas, Brian T. Fleming, Jean-Michel Desert, Nicholas Nell, Pascal\n  Petit, Aline Vidotto","title":"CUTE reveals escaping metals in the upper atmosphere of the ultra-hot\n  Jupiter WASP-189b","comments":"Accepted for publication in The Astrophysical Journal Letters","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":"  Ultraviolet observations of Ultra-hot Jupiters (UHJs), exoplanets with\ntemperatures over 2000\\,K, provide us with an opportunity to investigate if and\nhow atmospheric escape shapes their upper atmosphere. Near-ultraviolet transit\nspectroscopy offers a unique tool to study this process owing to the presence\nof strong metal lines and a bright photospheric continuum as the light source\nagainst which the absorbing gas is observed. WASP-189b is one of the hottest\nplanets discovered to date, with a day-side temperature of about 3400\\,K\norbiting a bright A-type star. We present the first near-ultraviolet\nobservations of WASP-189b, acquired with the Colorado Ultraviolet Transit\nExperiment ($CUTE$). $CUTE$ is a 6U NASA-funded ultraviolet spectroscopy\nmission, dedicated to monitoring short-period transiting planets. WASP-189b was\none of the $CUTE$ early science targets and was observed during three\nconsecutive transits in March 2022. We present an analysis of the $CUTE$\nobservations and results demonstrating near-ultraviolet (2500--3300~\\AA)\nbroadband transit depth ($1.08^{+0.08}_{-0.08}\\%$) of about twice the visual\ntransit depth indicating that the planet has an extended, hot upper atmosphere\nwith a temperature of about 15000\\,K and a moderate mass loss rate of about\n\\SI{4e8}{\\kg\\per\\second}. We observe absorption by Mg{\\sc ii} lines ($R_p/R_s$\nof $0.212^{+0.038}_{-0.061}$) beyond the Roche lobe at $>$4$\\sigma$\nsignificance in the transmission spectrum at a resolution of 10~\\AA, while at\nlower resolution (100~\\AA), we observe a quasi-continuous absorption signal\nconsistent with a \"forest\" of low-ionization metal absorption dominated by\nFe{\\sc ii}. The results suggest an upper atmospheric temperature\n($\\sim15000$\\,K), higher than that predicted by current state-of-the-art\nhydrodynamic models.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:48:20 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Sreejith","A. G.",""],["France","Kevin",""],["Fossati","Luca",""],["Koskinen","Tommi T.",""],["Egan","Arika",""],["Cauley","P. Wilson",""],["Cubillos","Patricio. E.",""],["Ambily","S.",""],["Huang","Chenliang",""],["Lavvas","5 Panayotis",""],["Fleming","Brian T.",""],["Desert","Jean-Michel",""],["Nell","Nicholas",""],["Petit","Pascal",""],["Vidotto","Aline",""]]}
{"id":"2308.05727","submitter":"Wenyuan Li","authors":"Wenyuan Li","title":"Existence of generating families on Lagrangian cobordisms","comments":"16 pages, 1 figure. 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 embedded exact Lagrangian cobordism between Legendrian submanifolds in\nthe 1-jet bundle, we prove that a generating family linear at infinity on the\nLegendrian at the negative end extends to a generating family linear at\ninfinity on the Lagrangian cobordism after stabilization if and only if the\nformal obstructions vanish. In particular, a Lagrangian filling with trivial\nstable Lagrangian Gauss map admits a generating family linear at infinity.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:49:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Wenyuan",""]]}
{"id":"2308.05728","submitter":"Sandeep Munjal","authors":"Vidit Pandey, Mohd Salman Siddiqui, Sandeep Munjal, Tufail Ahmad","title":"Structural and Optical Properties of Spin-Coated Mn$_3$O$_4$ Thin Films\n  of Different Coating Layers","comments":"21 Pages, 71 references, 7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In present study, Tetragonal Mn$_3$O$_4$ thin films of different coating\nlayers of 2, 4, 6, 8, and 10 were prepared on the microscopic glass slides by\nthe spin-coating method. X-ray diffraction, Raman spectroscopy, and\nultra-violet visible spectroscopy were used to explore the structural and\noptical properties of Mn$_3$O$_4$ thin films. XRD patterns and Raman spectra\nconfirm the phase of all films as tetragonal. The average crystallite size of\nfilms increased from ~17 to ~25 nm with increasing coating layers. Optical\nproperties such as band gap, skin depth, cutoff wavelength, excitation\ncoefficient, refractive index, etc, have been studied in detail by using\nultra-violet visible spectroscopy. The direct optical band gap and refractive\nindex of fabricated films were decreased as increasing the coating layers of\nMn$_3$O$_4$. The refractive index for 2 and 4 coating layers were decreased as\nincreasing the incident wavelength. While for 6, 8, and 10 coating layers, the\nvalues of refractive index remain constant with respect to incident wavelength.\nThe optical analyses suggest that prepared Mn$_3$O$_4$ thin films can be used\nas a potential candidate for optical semiconductor devices including\nphotovoltaic cells and optical sensors.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:52:45 GMT"}],"update_date":"2023-08-13","authors_parsed":[["Pandey","Vidit",""],["Siddiqui","Mohd Salman",""],["Munjal","Sandeep",""],["Ahmad","Tufail",""]]}
{"id":"2308.05729","submitter":"Andrea Young","authors":"Alexandre Assouline, Taige Wang, Haoxin Zhou, Liam A. Cohen, Fangyuan\n  Yang, Ruining Zhang, Takashi Taniguchi, Kenji Watanabe, Roger S. K. Mong,\n  Michael P. Zaletel, and Andrea F. Young","title":"Energy gap of the even-denominator fractional quantum Hall state in\n  bilayer graphene","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":"  Bernal bilayer graphene hosts even denominator fractional quantum Hall states\nthought to be described by a Pfaffian wave function with nonabelian\nquasiparticle excitations. Here we report the quantitative determination of\nfractional quantum Hall energy gaps in bilayer graphene using both thermally\nactivated transport and by direct measurement of the chemical potential. We\nfind a transport activation gap of 5.1K at B = 12T for a half-filled N=1 Landau\nlevel, consistent with density matrix renormalization group calculations for\nthe Pfaffian state. However, the measured thermodynamic gap of 11.6K is smaller\nthan theoretical expectations for the clean limit by approximately a factor of\ntwo. We analyze the chemical potential data near fractional filling within a\nsimplified model of a Wigner crystal of fractional quasiparticles with\nlong-wavelength disorder, explaining this discrepancy. Our results\nquantitatively establish bilayer graphene as a robust platform for probing the\nnon-Abelian anyons expected to arise as the elementary excitations of the\neven-denominator state.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:52:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Assouline","Alexandre",""],["Wang","Taige",""],["Zhou","Haoxin",""],["Cohen","Liam A.",""],["Yang","Fangyuan",""],["Zhang","Ruining",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Mong","Roger S. K.",""],["Zaletel","Michael P.",""],["Young","Andrea F.",""]]}
{"id":"2308.05730","submitter":"Salvatore Pace","authors":"Salvatore D. Pace","title":"Emergent generalized symmetries in ordered phases","comments":"23 pages, 7 figures. v2: minor changes and added references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the rich landscape of higher-form and non-invertible symmetries\nthat emerge at low energies in generic ordered phases. Using that their charge\nis carried by homotopy defects (i.e., domain walls, vortices, hedgehogs, etc.),\nwe find the fusion higher category that describes them when there are finitely\nmany types of homotopy defects, which depends only on the spontaneous\nsymmetry-breaking (SSB) pattern of the ordered phase. These emergent symmetries\nare not spontaneously broken in the ordered phase. We show that spontaneously\nbreaking them induces a phase transition into a nontrivial disordered phase\nthat can have symmetry-enriched (non-)abelian topological orders, photons, and\neven more emergent symmetries. This SSB transition is between two distinct SSB\nphases$\\unicode{x2013}$an ordinary and generalized one$\\unicode{x2013}$making\nit a possible generalized deconfined quantum critical point. We also\ninvestigate the 't Hooft anomalies of these emergent symmetries and conjecture\nthat there is always a mixed anomaly between them and the microscopic symmetry\nspontaneously broken in the ordered phase. One way this anomaly can manifest is\nthrough the fractionalization of the microscopic symmetry's quantum numbers.\nOur results demonstrate that even the most exotic generalized symmetries emerge\nin ordinary phases and provide a valuable framework for characterizing them and\ntheir transitions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:52:53 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 23:06:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pace","Salvatore D.",""]]}
{"id":"2308.05731","submitter":"Steffen Hagedorn","authors":"Steffen Hagedorn, Marcel Hallgarten, Martin Stoll, Alexandru\n  Condurache","title":"Rethinking Integration of Prediction and Planning in Deep Learning-Based\n  Automated Driving Systems: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV cs.LG cs.MA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Automated driving has the potential to revolutionize personal, public, and\nfreight mobility. Besides the enormous challenge of perception, i.e. accurately\nperceiving the environment using available sensor data, automated driving\ncomprises planning a safe, comfortable, and efficient motion trajectory. To\npromote safety and progress, many works rely on modules that predict the future\nmotion of surrounding traffic. Modular automated driving systems commonly\nhandle prediction and planning as sequential separate tasks. While this\naccounts for the influence of surrounding traffic on the ego-vehicle, it fails\nto anticipate the reactions of traffic participants to the ego-vehicle's\nbehavior. Recent works suggest that integrating prediction and planning in an\ninterdependent joint step is necessary to achieve safe, efficient, and\ncomfortable driving. While various models implement such integrated systems, a\ncomprehensive overview and theoretical understanding of different principles\nare lacking. We systematically review state-of-the-art deep learning-based\nprediction, planning, and integrated prediction and planning models. Different\nfacets of the integration ranging from model architecture and model design to\nbehavioral aspects are considered and related to each other. Moreover, we\ndiscuss the implications, strengths, and limitations of different integration\nmethods. By pointing out research gaps, describing relevant future challenges,\nand highlighting trends in the research field, we identify promising directions\nfor future research.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:53:03 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hagedorn","Steffen",""],["Hallgarten","Marcel",""],["Stoll","Martin",""],["Condurache","Alexandru",""]]}
{"id":"2308.05732","submitter":"Phillip Lippe","authors":"Phillip Lippe, Bastiaan S. Veeling, Paris Perdikaris, Richard E.\n  Turner, Johannes Brandstetter","title":"PDE-Refiner: Achieving Accurate Long Rollouts with Neural PDE Solvers","comments":"Project website: https://phlippe.github.io/PDERefiner/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Time-dependent partial differential equations (PDEs) are ubiquitous in\nscience and engineering. Recently, mostly due to the high computational cost of\ntraditional solution techniques, deep neural network based surrogates have\ngained increased interest. The practical utility of such neural PDE solvers\nrelies on their ability to provide accurate, stable predictions over long time\nhorizons, which is a notoriously hard problem. In this work, we present a\nlarge-scale analysis of common temporal rollout strategies, identifying the\nneglect of non-dominant spatial frequency information, often associated with\nhigh frequencies in PDE solutions, as the primary pitfall limiting stable,\naccurate rollout performance. Based on these insights, we draw inspiration from\nrecent advances in diffusion models to introduce PDE-Refiner; a novel model\nclass that enables more accurate modeling of all frequency components via a\nmultistep refinement process. We validate PDE-Refiner on challenging benchmarks\nof complex fluid dynamics, demonstrating stable and accurate rollouts that\nconsistently outperform state-of-the-art models, including neural, numerical,\nand hybrid neural-numerical architectures. We further demonstrate that\nPDE-Refiner greatly enhances data efficiency, since the denoising objective\nimplicitly induces a novel form of spectral data augmentation. Finally,\nPDE-Refiner's connection to diffusion models enables an accurate and efficient\nassessment of the model's predictive uncertainty, allowing us to estimate when\nthe surrogate becomes inaccurate.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:53:05 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Lippe","Phillip",""],["Veeling","Bastiaan S.",""],["Perdikaris","Paris",""],["Turner","Richard E.",""],["Brandstetter","Johannes",""]]}
{"id":"2308.05733","submitter":"Guangkai Xu","authors":"Guangkai Xu, Wei Yin, Hao Chen, Chunhua Shen, Kai Cheng, Feng Zhao","title":"FrozenRecon: Pose-free 3D Scene Reconstruction with Frozen Depth Models","comments":"Accepted to ICCV 2023. Project webpage is at:\n  https://aim-uofa.github.io/FrozenRecon/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D scene reconstruction is a long-standing vision task. Existing approaches\ncan be categorized into geometry-based and learning-based methods. The former\nleverages multi-view geometry but can face catastrophic failures due to the\nreliance on accurate pixel correspondence across views. The latter was\nproffered to mitigate these issues by learning 2D or 3D representation\ndirectly. However, without a large-scale video or 3D training data, it can\nhardly generalize to diverse real-world scenarios due to the presence of tens\nof millions or even billions of optimization parameters in the deep network.\nRecently, robust monocular depth estimation models trained with large-scale\ndatasets have been proven to possess weak 3D geometry prior, but they are\ninsufficient for reconstruction due to the unknown camera parameters, the\naffine-invariant property, and inter-frame inconsistency. Here, we propose a\nnovel test-time optimization approach that can transfer the robustness of\naffine-invariant depth models such as LeReS to challenging diverse scenes while\nensuring inter-frame consistency, with only dozens of parameters to optimize\nper video frame. Specifically, our approach involves freezing the pre-trained\naffine-invariant depth model's depth predictions, rectifying them by optimizing\nthe unknown scale-shift values with a geometric consistency alignment module,\nand employing the resulting scale-consistent depth maps to robustly obtain\ncamera poses and achieve dense scene reconstruction, even in low-texture\nregions. Experiments show that our method achieves state-of-the-art\ncross-dataset reconstruction on five zero-shot testing datasets.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:55:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Xu","Guangkai",""],["Yin","Wei",""],["Chen","Hao",""],["Shen","Chunhua",""],["Cheng","Kai",""],["Zhao","Feng",""]]}
{"id":"2308.05734","submitter":"Haohe Liu","authors":"Haohe Liu, Qiao Tian, Yi Yuan, Xubo Liu, Xinhao Mei, Qiuqiang Kong,\n  Yuping Wang, Wenwu Wang, Yuxuan Wang, Mark D. Plumbley","title":"AudioLDM 2: Learning Holistic Audio Generation with Self-supervised\n  Pretraining","comments":"AudioLDM 2 project page is https://audioldm.github.io/audioldm2","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.MM eess.AS eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although audio generation shares commonalities across different types of\naudio, such as speech, music, and sound effects, designing models for each type\nrequires careful consideration of specific objectives and biases that can\nsignificantly differ from those of other types. To bring us closer to a unified\nperspective of audio generation, this paper proposes a framework that utilizes\nthe same learning method for speech, music, and sound effect generation. Our\nframework introduces a general representation of audio, called language of\naudio (LOA). Any audio can be translated into LOA based on AudioMAE, a\nself-supervised pre-trained representation learning model. In the generation\nprocess, we translate any modalities into LOA by using a GPT-2 model, and we\nperform self-supervised audio generation learning with a latent diffusion model\nconditioned on LOA. The proposed framework naturally brings advantages such as\nin-context learning abilities and reusable self-supervised pretrained AudioMAE\nand latent diffusion models. Experiments on the major benchmarks of\ntext-to-audio, text-to-music, and text-to-speech demonstrate new\nstate-of-the-art or competitive performance to previous approaches. Our demo\nand code are available at https://audioldm.github.io/audioldm2.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:55:13 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liu","Haohe",""],["Tian","Qiao",""],["Yuan","Yi",""],["Liu","Xubo",""],["Mei","Xinhao",""],["Kong","Qiuqiang",""],["Wang","Yuping",""],["Wang","Wenwu",""],["Wang","Yuxuan",""],["Plumbley","Mark D.",""]]}
{"id":"2308.05735","submitter":"Lukas J. Furtak","authors":"Lukas J. Furtak, Ivo Labb\\'e, Adi Zitrin, Jenny E. Greene, Pratika\n  Dayal, Iryna Chemerynska, Vasily Kokorev, Tim B. Miller, Andy D. Goulding,\n  Rachel Bezanson, Gabriel B. Brammer, Sam E. Cutler, Joel Leja, Richard Pan,\n  Sedona H. Price, Bingjie Wang, John R. Weaver, Katherine E. Whitaker, Hakim\n  Atek, \\'Akos Bogd\\'an, St\\'ephane Charlot, Emma Curtis-Lake, Pieter van\n  Dokkum, Ryan Endsley, Yoshinobu Fudamoto, Seiji Fujimoto, Anna de Graaff,\n  Karl Glazebrook, St\\'ephanie Juneau, Danilo Marchesini, Michael V. Maseda,\n  Erica Nelson, Pascal A. Oesch, Ad\\`ele Plat, David J. Setton, Daniel P. Stark\n  and Christina C. Williams","title":"A supermassive black hole in the early universe growing in the shadows","comments":"Submitted. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Early JWST observations have uncovered a new, substantial population of red\nsources that might represent a previously overlooked phase of actively growing\nsupermassive black holes (Kocevski et al. 2023, Matthee et al. 2023, Labbe et\nal. 2023). One of the most intriguing examples is an extremely red, point-like\nobject that was found to be triply-imaged by the strong lensing galaxy cluster\nAbell 2744 (Furtak et al. 2023), allowing an unprecedented detailed look into\nthis enigmatic population. Here we present deep spectroscopic JWST/NIRSpec\nobservations of this object, Abell2744-QSO1. The spectroscopy confirms that the\nthree images are of the same object, and that it is a highly reddened\n($A_V\\sim3$) broad emission-line Active Galactic Nucleus (AGN) at a redshift of\n$z_{\\mathrm{spec}}=7.0451\\pm0.0005$. From the width of H$\\beta$\n($\\mathrm{FWHM}=2800\\pm250\\,\\frac{\\mathrm{km}}{\\mathrm{s}}$) we derive a black\nhole mass of $M_{\\mathrm{BH}}=3_{-1}^{+2}\\times10^7\\,\\mathrm{M}_{\\odot}$. We\ninfer a very high ratio of black hole to galaxy mass of at least 3% and\npossibly as high as 100%, an order of magnitude or more than is seen in local\ngalaxies. The lack of strong metal lines in the spectrum together with the high\nbolometric luminosity\n($L_{\\mathrm{bol}}=(1.1\\pm0.3)\\times10^{45}\\,\\frac{\\mathrm{erg}}{\\mathrm{s}}$)\nsuggest that we are seeing the black hole in a phase of rapid growth, accreting\nat 30% of the Eddington limit. Based on early JWST imaging studies we estimate\nthat such heavily reddened, low-mass black holes can be $\\sim100$ times more\ncommon than UV-selected ones at this epoch. The rapid growth and high black\nhole to galaxy mass ratio of A2744-QSO1 suggests that it may represent the\nmissing link between black hole seeds (Inayoshi et al. 2020; Greene et al.\n2020; Volonteri 2021) and the first luminous quasars (Fan et al. 2023).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:56:31 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Furtak","Lukas J.",""],["Labb\u00e9","Ivo",""],["Zitrin","Adi",""],["Greene","Jenny E.",""],["Dayal","Pratika",""],["Chemerynska","Iryna",""],["Kokorev","Vasily",""],["Miller","Tim B.",""],["Goulding","Andy D.",""],["Bezanson","Rachel",""],["Brammer","Gabriel B.",""],["Cutler","Sam E.",""],["Leja","Joel",""],["Pan","Richard",""],["Price","Sedona H.",""],["Wang","Bingjie",""],["Weaver","John R.",""],["Whitaker","Katherine E.",""],["Atek","Hakim",""],["Bogd\u00e1n","\u00c1kos",""],["Charlot","St\u00e9phane",""],["Curtis-Lake","Emma",""],["van Dokkum","Pieter",""],["Endsley","Ryan",""],["Fudamoto","Yoshinobu",""],["Fujimoto","Seiji",""],["de Graaff","Anna",""],["Glazebrook","Karl",""],["Juneau","St\u00e9phanie",""],["Marchesini","Danilo",""],["Maseda","Michael V.",""],["Nelson","Erica",""],["Oesch","Pascal A.",""],["Plat","Ad\u00e8le",""],["Setton","David J.",""],["Stark","Daniel P.",""],["Williams","Christina C.",""]]}
{"id":"2308.05736","submitter":"Bencheng Liao","authors":"Bencheng Liao, Shaoyu Chen, Yunchi Zhang, Bo Jiang, Qian Zhang, Wenyu\n  Liu, Chang Huang, Xinggang Wang","title":"MapTRv2: An End-to-End Framework for Online Vectorized HD Map\n  Construction","comments":"Code available at https://github.com/hustvl/MapTR . arXiv admin note:\n  substantial text overlap with arXiv:2208.14437","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  High-definition (HD) map provides abundant and precise static environmental\ninformation of the driving scene, serving as a fundamental and indispensable\ncomponent for planning in autonomous driving system. In this paper, we present\n\\textbf{Map} \\textbf{TR}ansformer, an end-to-end framework for online\nvectorized HD map construction. We propose a unified permutation-equivalent\nmodeling approach, \\ie, modeling map element as a point set with a group of\nequivalent permutations, which accurately describes the shape of map element\nand stabilizes the learning process. We design a hierarchical query embedding\nscheme to flexibly encode structured map information and perform hierarchical\nbipartite matching for map element learning. To speed up convergence, we\nfurther introduce auxiliary one-to-many matching and dense supervision. The\nproposed method well copes with various map elements with arbitrary shapes. It\nruns at real-time inference speed and achieves state-of-the-art performance on\nboth nuScenes and Argoverse2 datasets. Abundant qualitative results show stable\nand robust map construction quality in complex and various driving scenes. Code\nand more demos are available at \\url{https://github.com/hustvl/MapTR} for\nfacilitating further studies and applications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:56:53 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Liao","Bencheng",""],["Chen","Shaoyu",""],["Zhang","Yunchi",""],["Jiang","Bo",""],["Zhang","Qian",""],["Liu","Wenyu",""],["Huang","Chang",""],["Wang","Xinggang",""]]}
{"id":"2308.05737","submitter":"Alaa Maalouf","authors":"Alaa Maalouf and Ninad Jadhav and Krishna Murthy Jatavallabhula and\n  Makram Chahine and Daniel M.Vogt and Robert J. Wood and Antonio Torralba and\n  Daniela Rus","title":"Follow Anything: Open-set detection, tracking, and following in\n  real-time","comments":"Project webpage: https://github.com/alaamaalouf/FollowAnything\n  Explainer video: https://www.youtube.com/watch?v=6Mgt3EPytrw","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tracking and following objects of interest is critical to several robotics\nuse cases, ranging from industrial automation to logistics and warehousing, to\nhealthcare and security. In this paper, we present a robotic system to detect,\ntrack, and follow any object in real-time. Our approach, dubbed ``follow\nanything'' (FAn), is an open-vocabulary and multimodal model -- it is not\nrestricted to concepts seen at training time and can be applied to novel\nclasses at inference time using text, images, or click queries. Leveraging rich\nvisual descriptors from large-scale pre-trained models (foundation models), FAn\ncan detect and segment objects by matching multimodal queries (text, images,\nclicks) against an input image sequence. These detected and segmented objects\nare tracked across image frames, all while accounting for occlusion and object\nre-emergence. We demonstrate FAn on a real-world robotic system (a micro aerial\nvehicle) and report its ability to seamlessly follow the objects of interest in\na real-time control loop. FAn can be deployed on a laptop with a lightweight\n(6-8 GB) graphics card, achieving a throughput of 6-20 frames per second. To\nenable rapid adoption, deployment, and extensibility, we open-source all our\ncode on our project webpage at https://github.com/alaamaalouf/FollowAnything .\nWe also encourage the reader the watch our 5-minutes explainer video in this\nhttps://www.youtube.com/watch?v=6Mgt3EPytrw .\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:57:06 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Maalouf","Alaa",""],["Jadhav","Ninad",""],["Jatavallabhula","Krishna Murthy",""],["Chahine","Makram",""],["Vogt","Daniel M.",""],["Wood","Robert J.",""],["Torralba","Antonio",""],["Rus","Daniela",""]]}
{"id":"2308.05738","submitter":"Will Consagra","authors":"William Consagra, Martin Cole, Xing Qiu, Zhengwu Zhang","title":"Continuous and Atlas-free Analysis of Brain Structural Connectivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO q-bio.NC stat.AP stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Brain structural networks are often represented as discrete adjacency\nmatrices with elements summarizing the connectivity between pairs of regions of\ninterest (ROIs). These ROIs are typically determined a-priori using a brain\natlas. The choice of atlas is often arbitrary and can lead to a loss of\nimportant connectivity information at the sub-ROI level. This work introduces\nan atlas-free framework that overcomes these issues by modeling brain\nconnectivity using smooth random functions. In particular, we assume that the\nobserved pattern of white matter fiber tract endpoints is driven by a latent\nrandom function defined over a product manifold domain. To facilitate\nstatistical analysis of these high dimensional functional data objects, we\ndevelop a novel algorithm to construct a data-driven reduced-rank function\nspace that offers a desirable trade-off between computational complexity and\nflexibility. Using real data from the Human Connectome Project, we show that\nour method outperforms state-of-the-art approaches that use the traditional\natlas-based structural connectivity representation on a variety of connectivity\nanalysis tasks. We further demonstrate how our method can be used to detect\nlocalized regions and connectivity patterns associated with group differences.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:57:15 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Consagra","William",""],["Cole","Martin",""],["Qiu","Xing",""],["Zhang","Zhengwu",""]]}
{"id":"2308.05739","submitter":"Michael Fischer","authors":"Michael Fischer, Tobias Ritschel","title":"Zero Grads Ever Given: Learning Local Surrogate Losses for\n  Non-Differentiable Graphics","comments":null,"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":"  Gradient-based optimization is now ubiquitous across graphics, but\nunfortunately can not be applied to problems with undefined or zero gradients.\nTo circumvent this issue, the loss function can be manually replaced by a\n\"surrogate\" that has similar minima but is differentiable. Our proposed\nframework, ZeroGrads, automates this process by learning a neural approximation\nof the objective function, the surrogate, which in turn can be used to\ndifferentiate through arbitrary black-box graphics pipelines. We train the\nsurrogate on an actively smoothed version of the objective and encourage\nlocality, focusing the surrogate's capacity on what matters at the current\ntraining episode. The fitting is performed online, alongside the parameter\noptimization, and self-supervised, without pre-computed data or pre-trained\nmodels. As sampling the objective is expensive (it requires a full rendering or\nsimulator run), we devise an efficient sampling scheme that allows for\ntractable run-times and competitive performance at little overhead. We\ndemonstrate optimizing diverse non-convex, non-differentiable black-box\nproblems in graphics, such as visibility in rendering, discrete parameter\nspaces in procedural modelling or optimal control in physics-driven animation.\nIn contrast to more traditional algorithms, our approach scales well to higher\ndimensions, which we demonstrate on problems with up to 35k interlinked\nvariables.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:57:22 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Fischer","Michael",""],["Ritschel","Tobias",""]]}
{"id":"2308.05740","submitter":"Rodolfo Ferro-Hern\\'andez","authors":"Jens Erler and Rodolfo Ferro-Hernandez","title":"Perturbative contributions to $\\Delta\\alpha^{(5)}(M^2_Z)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute a theoretically driven prediction for the hadronic contribution to\nthe electromagnetic running coupling at the $Z$ scale using lattice QCD and\nstate-of-the-art perturbative QCD. We\nobtain$$\\Delta\\alpha^{(5)}(M^2_Z)=\\left[279.5\\pm0.9\\pm0.59\\right]\\times10^{-4}\\quad\\quad\\,\\,\\,\\,\\,\\,(\\mathrm{Mainz\n\\,\\,\\,Collaboration})$$$$\\Delta\\alpha^{(5)}(M^2_Z)=\\left[278.42\\pm0.22\\pm0.59\\right]\\times10^{-4}\\,\\,\\,\\,\\,\\,\\,\\,\\quad(\\mathrm{\nBMW \\,\\,\\,Collaboration}),$$\n  where the first error is the quoted lattice uncertainty. The second is due to\nperturbative QCD, and is dominated by the parametric uncertainty on\n$\\hat{\\alpha}_s$, which is based on a rather conservative error. Using instead\nthe PDG average, we find a total error on $\\Delta\\alpha^{(5)}(M^2_Z)$ of\n$0.4\\times10^{-4}$. Furthermore, with a particular emphasis on the charm quark\ncontributions, we also update $\\Delta\\alpha^{(5)}(M^2_Z)$ when low-energy\ncross-section data is used as an input, obtaining $\\Delta\\alpha^{(5)}(M^2_Z) =\n\\left[276.29 \\pm 0.38 \\pm 0.62\\right] \\times 10^{-4}$. The difference between\nlattice QCD and cross-section-driven results reflects the known tension between\nboth methods in the computation of the anomalous magnetic moment of the muon.\nOur results are expressed in a way that will allow straightforward\nmodifications and an easy implementation in electroweak global fits.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:57:49 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Erler","Jens",""],["Ferro-Hernandez","Rodolfo",""]]}
{"id":"2308.05741","submitter":"Yun-Chun Chen","authors":"Yun-Chun Chen, Vladimir G. Kim, Noam Aigerman, Alec Jacobson","title":"Neural Progressive Meshes","comments":"SIGGRAPH 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent proliferation of 3D content that can be consumed on hand-held\ndevices necessitates efficient tools for transmitting large geometric data,\ne.g., 3D meshes, over the Internet. Detailed high-resolution assets can pose a\nchallenge to storage as well as transmission bandwidth, and level-of-detail\ntechniques are often used to transmit an asset using an appropriate bandwidth\nbudget. It is especially desirable for these methods to transmit data\nprogressively, improving the quality of the geometry with more data. Our key\ninsight is that the geometric details of 3D meshes often exhibit similar local\npatterns even across different shapes, and thus can be effectively represented\nwith a shared learned generative space. We learn this space using a\nsubdivision-based encoder-decoder architecture trained in advance on a large\ncollection of surfaces. We further observe that additional residual features\ncan be transmitted progressively between intermediate levels of subdivision\nthat enable the client to control the tradeoff between bandwidth cost and\nquality of reconstruction, providing a neural progressive mesh representation.\nWe evaluate our method on a diverse set of complex 3D shapes and demonstrate\nthat it outperforms baselines in terms of compression ratio and reconstruction\nquality.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:58:02 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Chen","Yun-Chun",""],["Kim","Vladimir G.",""],["Aigerman","Noam",""],["Jacobson","Alec",""]]}
{"id":"2308.05742","submitter":"Cheuk Ting Li","authors":"Cheuk Ting Li","title":"A Characterization of Entropy as a Universal Monoidal Natural\n  Transformation","comments":"45 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the essential properties of entropy (monotonicity, additivity\nand subadditivity) are consequences of entropy being a monoidal natural\ntransformation from the under category functor $-/\\mathsf{LProb}_{\\rho}$ (where\n$\\mathsf{LProb}_{\\rho}$ is category of $\\ell_{\\rho}$ discrete probability\nspaces) to $\\Delta_{\\mathbb{R}}$. Moreover, the Shannon entropy can be\ncharacterized as the universal monoidal natural transformation from\n$-/\\mathsf{LProb}_{\\rho}$ to the category of strongly Archimedean ordered\nvector spaces (a reflective subcategory of the lax-slice 2-category over\n$\\mathsf{MonCat}_{\\ell}$ in the 2-category of monoidal categories), providing a\nsuccinct characterization of Shannon entropy as a reflection arrow. We can\nlikewise define entropy for every category with a monoidal structure on its\nunder categories (e.g. the category of finite abelian groups, the category of\nfinite inhabited sets, the category of finite dimensional vector spaces, and\nthe augmented simplex category) via the reflection arrow to the reflective\nsubcategory of strongly Archimedean ordered vector spaces. This implies that\nall these entropies over different categories are components of a single\nnatural transformation (the unit of the idempotent monad), allowing us to\nconnect these entropies in a natural manner. We also provide a universal\ncharacterization of the conditional Shannon entropy based on the chain rule\nwhich, unlike the characterization of information loss by Baez, Fritz and\nLeinster, does not require any continuity assumption.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:58:15 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 18:04:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Cheuk Ting",""]]}
{"id":"2308.05743","submitter":"Berndt Muller","authors":"John W. Harris and Berndt M\\\"uller","title":"\"QGP Signatures\" Revisited","comments":"42 pages, 47 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the graphic table of QCD signatures in our 1996 Annual Reviews\narticle \"The Search for the Quark-Gluon Plasma\" and assess the progress that\nhas been made since its publication towards providing quantitative evidence for\nthe formation of a quark-gluon plasma in relativistic heavy-ion collisions and\nits characteristic properties.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:59:31 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 16:04:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Harris","John W.",""],["M\u00fcller","Berndt",""]]}
{"id":"2308.05744","submitter":"Jia Zheng","authors":"Wentao Hu and Jia Zheng and Zixin Zhang and Xiaojun Yuan and Jian Yin\n  and Zihan Zhou","title":"PlankAssembly: Robust 3D Reconstruction from Three Orthographic Views\n  with Learnt Shape Programs","comments":"To Appear in ICCV 2023. The first three authors contributed equally\n  to this work. The project page is at\n  https://manycore-research.github.io/PlankAssembly","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we develop a new method to automatically convert 2D line\ndrawings from three orthographic views into 3D CAD models. Existing methods for\nthis problem reconstruct 3D models by back-projecting the 2D observations into\n3D space while maintaining explicit correspondence between the input and\noutput. Such methods are sensitive to errors and noises in the input, thus\noften fail in practice where the input drawings created by human designers are\nimperfect. To overcome this difficulty, we leverage the attention mechanism in\na Transformer-based sequence generation model to learn flexible mappings\nbetween the input and output. Further, we design shape programs which are\nsuitable for generating the objects of interest to boost the reconstruction\naccuracy and facilitate CAD modeling applications. Experiments on a new\nbenchmark dataset show that our method significantly outperforms existing ones\nwhen the inputs are noisy or incomplete.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:59:34 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Hu","Wentao",""],["Zheng","Jia",""],["Zhang","Zixin",""],["Yuan","Xiaojun",""],["Yin","Jian",""],["Zhou","Zihan",""]]}
{"id":"2308.05745","submitter":"Iaroslav Koshelev","authors":"Iaroslav Koshelev and Stamatios Lefkimmiatis","title":"Iterative Reweighted Least Squares Networks With Convergence Guarantees\n  for Solving Inverse Imaging Problems","comments":"arXiv admin note: text overlap with arXiv:2304.10536","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 present a novel optimization strategy for image\nreconstruction tasks under analysis-based image regularization, which promotes\nsparse and/or low-rank solutions in some learned transform domain. We\nparameterize such regularizers using potential functions that correspond to\nweighted extensions of the $\\ell_p^p$-vector and $\\mathcal{S}_p^p$\nSchatten-matrix quasi-norms with $0 < p \\le 1$. Our proposed minimization\nstrategy extends the Iteratively Reweighted Least Squares (IRLS) method,\ntypically used for synthesis-based $\\ell_p$ and $\\mathcal{S}_p$ norm and\nanalysis-based $\\ell_1$ and nuclear norm regularization. We prove that under\nmild conditions our minimization algorithm converges linearly to a stationary\npoint, and we provide an upper bound for its convergence rate. Further, to\nselect the parameters of the regularizers that deliver the best results for the\nproblem at hand, we propose to learn them from training data by formulating the\nsupervised learning process as a stochastic bilevel optimization problem. We\nshow that thanks to the convergence guarantees of our proposed minimization\nstrategy, such optimization can be successfully performed with a\nmemory-efficient implicit back-propagation scheme. We implement our learned\nIRLS variants as recurrent networks and assess their performance on the\nchallenging image reconstruction tasks of non-blind deblurring,\nsuper-resolution and demosaicking. The comparisons against other existing\nlearned reconstruction approaches demonstrate that our overall method is very\ncompetitive and in many cases outperforms existing unrolled networks, whose\nnumber of parameters is orders of magnitude higher than in our case.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:59:46 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Koshelev","Iaroslav",""],["Lefkimmiatis","Stamatios",""]]}
{"id":"2308.05746","submitter":"Songtao Huang","authors":"Franklin J. Vivanco, Alexander Schuckert, Songtao Huang, Grant L.\n  Schumacher, Gabriel G. T. Assump\\c{c}\\~ao, Yunpeng Ji, Jianyi Chen, Michael\n  Knap, Nir Navon","title":"The strongly driven Fermi polaron","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quasiparticles are emergent excitations of matter that underlie much of our\nunderstanding of quantum many-body systems. Therefore, the prospect of\nmanipulating their properties with external fields -- or even destroying them\n-- has both fundamental and practical implications. However, in solid-state\nmaterials it is often challenging to understand how quasiparticles are modified\nby external fields owing to their complex interplay with other collective\nexcitations, such as phonons. Here, we take advantage of the clean setting of\nhomogeneous quantum gases and fast radio-frequency control to manipulate Fermi\npolarons -- quasiparticles formed by impurities interacting with a\nnon-interacting Fermi gas -- from weak to ultrastrong drives. Exploiting two\ninternal states of the impurity species, we develop a steady-state\nspectroscopy, from which we extract the energy of the driven polaron. We\nmeasure the decay rate and the quasiparticle residue of the driven polaron from\nthe Rabi oscillations between the two internal states. At large drive\nstrengths, the so-extracted quasiparticle residue exceeds unity, raising\nintriguing questions on the relationship between the Rabi oscillations and the\nimpurity's spectral functions. Our experiment establishes the driven Fermi\npolaron as a promising platform for studying controllable quasiparticles in\nstrongly driven quantum matter.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:59:51 GMT"}],"update_date":"2023-08-11","authors_parsed":[["Vivanco","Franklin J.",""],["Schuckert","Alexander",""],["Huang","Songtao",""],["Schumacher","Grant L.",""],["Assump\u00e7\u00e3o","Gabriel G. T.",""],["Ji","Yunpeng",""],["Chen","Jianyi",""],["Knap","Michael",""],["Navon","Nir",""]]}
{"id":"2308.05752","submitter":"Dhiman Ray","authors":"Dhiman Ray, Michele Parrinello","title":"Data Driven Classification of Ligand Unbinding Pathways","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Studying the pathways of ligand-receptor binding is essential to understand\nthe mechanism of target recognition by small molecules. The binding free energy\nand kinetics of protein-ligand complexes can be computed using molecular\ndynamics (MD) simulations, often in quantitative agreement with experiments.\nHowever, only a qualitative picture of the ligand binding/unbinding paths can\nbe obtained through a conventional analysis of the MD trajectories. Besides,\nthe higher degree of manual effort involved in analyzing pathways limits its\napplicability in large-scale drug discovery. Here we address this limitation by\nintroducing an automated approach for analyzing molecular transition paths with\na particular focus on protein-ligand dissociation. Our method is based on the\ndynamic time-warping (DTW) algorithm, originally designed for speech\nrecognition. We accurately classified molecular trajectories using a very\ngeneric descriptor set of contacts or distances. Our approach outperforms\nmanual classification by distinguishing between parallel dissociation channels,\nwithin the pathways identified by visual inspection. Most notably, we could\ncompute exit-path-specific ligand-dissociation kinetics. The unbinding\ntimescale along the fastest path agrees with the experimental residence time,\nproviding a physical interpretation to our entirely data-driven protocol. In\ncombination with appropriate enhanced sampling algorithms, this technique can\nbe used for the initial exploration of ligand-dissociation pathways as well as\nfor calculating path-specific thermodynamic and kinetic properties.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 10:52:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ray","Dhiman",""],["Parrinello","Michele",""]]}
{"id":"2308.05753","submitter":"Denis Koshelev","authors":"Denis Koshelev, Alexey Ponomarenko, Sergei Seleznev","title":"Amortized neural networks for agent-based model forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a new procedure for unconditional and conditional\nforecasting in agent-based models. The proposed algorithm is based on the\napplication of amortized neural networks and consists of two steps. The first\nstep simulates artificial datasets from the model. In the second step, a neural\nnetwork is trained to predict the future values of the variables using the\nhistory of observations. The main advantage of the proposed algorithm is its\nspeed. This is due to the fact that, after the training procedure, it can be\nused to yield predictions for almost any data without additional simulations or\nthe re-estimation of the neural network\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 11:24:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Koshelev","Denis",""],["Ponomarenko","Alexey",""],["Seleznev","Sergei",""]]}
{"id":"2308.05754","submitter":"Wangjun Jiang","authors":"Wangjun Jiang, Zhiqing Wei, Zhiyong Feng","title":"SLAM for Multiple Extended Targets using 5G Signal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.PF","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  5th Generation (5G) mobile communication systems operating at around 28 GHz\nhave the potential to be applied to simultaneous localization and mapping\n(SLAM). Most existing 5G SLAM studies estimate environment as many point\ntargets, instead of extended targets. In this paper, we focus on the\nperformance analysis of 5G SLAM for multiple extended targets. To evaluate the\nmapping performance of multiple extended targets, a new mapping error metric,\nnamed extended targets generalized optimal sub-pattern assignment (ET-GOPSA),\nis proposed in this paper. Compared with the existing metrics, ET-GOPSA not\nonly considers the accuracy error of target estimation, the cost of missing\ndetection, the cost of false detection, but also the cost of matching the\nestimated point with the extended target. To evaluate the performance of 5G\nsignal in SLAM, we analyze and simulate the mapping error of 5G signal sensing\nby ET-GOPSA. Simulation results show that, under the condition of SNR = 10 dB,\n5G signal sensing can barely meet to meet the requirements of SLAM for multiple\nextended targets with the carrier frequency of 28 GHz, the bandwidth of 1.23\nGHz, and the antenna size of 32.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 08:30:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jiang","Wangjun",""],["Wei","Zhiqing",""],["Feng","Zhiyong",""]]}
{"id":"2308.05755","submitter":"Arkadiusz Nowacki","authors":"Arkadiusz Nowacki, Ewelina Ko{\\l}pa, Mateusz Szychiewicz, Konrad\n  Ciecierski","title":"Deep learning for spike detection in deep brain stimulation surgery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep brain stimulation (DBS) is a neurosurgical procedure successfully used\nto treat conditions such as Parkinson's disease. Electrostimulation, carried\nout by implanting electrodes into an identified focus in the brain, makes it\npossible to reduce the symptoms of the disease significantly. In this paper, a\nmethod for analyzing recordings of neuronal activity acquired during DBS\nneurosurgery using deep learning is presented. We tested using a convolutional\nneural network (CNN) for this purpose. Based on the time window, the classifier\nassesses whether neuronal activity (spike) is present. The maximum accuracy\nvalue for the classifier was 98.98%, and the area under the receiver operating\ncharacteristic curve (AUC) was 0.9898. The method made it possible to obtain a\nclassification without using data preprocessing.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:15:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nowacki","Arkadiusz",""],["Ko\u0142pa","Ewelina",""],["Szychiewicz","Mateusz",""],["Ciecierski","Konrad",""]]}
{"id":"2308.05756","submitter":"Beitong Tian","authors":"Beitong Tian, Kuan-Chieh Lu, Ahmadreza Eslaminia, Yaohui Wang, Chenhui\n  Shao, Klara Nahrstedt","title":"WeldMon: A Cost-effective Ultrasonic Welding Machine Condition\n  Monitoring System","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrasonic welding machines play a critical role in the lithium battery\nindustry, facilitating the bonding of batteries with conductors. Ensuring\nhigh-quality welding is vital, making tool condition monitoring systems\nessential for early-stage quality control. However, existing monitoring methods\nface challenges in cost, downtime, and adaptability. In this paper, we present\nWeldMon, an affordable ultrasonic welding machine condition monitoring system\nthat utilizes a custom data acquisition system and a data analysis pipeline\ndesigned for real-time analysis. Our classification algorithm combines\nauto-generated features and hand-crafted features, achieving superior\ncross-validation accuracy (95.8% on average over all testing tasks) compared to\nthe state-of-the-art method (92.5%) in condition classification tasks. Our data\naugmentation approach alleviates the concept drift problem, enhancing tool\ncondition classification accuracy by 8.3%. All algorithms run locally,\nrequiring only 385 milliseconds to process data for each welding cycle. We\ndeploy WeldMon and a commercial system on an actual ultrasonic welding machine,\nperforming a comprehensive comparison. Our findings highlight the potential for\ndeveloping cost-effective, high-performance, and reliable tool condition\nmonitoring systems.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 00:30:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tian","Beitong",""],["Lu","Kuan-Chieh",""],["Eslaminia","Ahmadreza",""],["Wang","Yaohui",""],["Shao","Chenhui",""],["Nahrstedt","Klara",""]]}
{"id":"2308.05757","submitter":"Cheng-Wei Ching","authors":"Cheng-Wei Ching, Chirag Gupta, Zi Huang, Liting Hu","title":"OrcoDCS: An IoT-Edge Orchestrated Online Deep Compressed Sensing\n  Framework","comments":"6 pages, 8 figures, to appear in 2023 IEEE International Conference\n  on Distributed Computing Systems Workshop on ECAI","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.DC cs.IT cs.LG math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compressed data aggregation (CDA) over wireless sensor networks (WSNs) is\ntask-specific and subject to environmental changes. However, the existing\ncompressed data aggregation (CDA) frameworks (e.g., compressed sensing-based\ndata aggregation, deep learning(DL)-based data aggregation) do not possess the\nflexibility and adaptivity required to handle distinct sensing tasks and\nenvironmental changes. Additionally, they do not consider the performance of\nfollow-up IoT data-driven deep learning (DL)-based applications. To address\nthese shortcomings, we propose OrcoDCS, an IoT-Edge orchestrated online deep\ncompressed sensing framework that offers high flexibility and adaptability to\ndistinct IoT device groups and their sensing tasks, as well as high performance\nfor follow-up applications. The novelty of our work is the design and\ndeployment of IoT-Edge orchestrated online training framework over WSNs by\nleveraging an specially-designed asymmetric autoencoder, which can largely\nreduce the encoding overhead and improve the reconstruction performance and\nrobustness. We show analytically and empirically that OrcoDCS outperforms the\nstate-of-the-art DCDA on training time, significantly improves flexibility and\nadaptability when distinct reconstruction tasks are given, and achieves higher\nperformance for follow-up applications.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 04:19:35 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ching","Cheng-Wei",""],["Gupta","Chirag",""],["Huang","Zi",""],["Hu","Liting",""]]}
{"id":"2308.05758","submitter":"Sen Yang","authors":"Sen Yang and Xiaofeng Li","title":"SNR-based beaconless multi-scan link acquisition model with vibration\n  for LEO-to-ground laser communication","comments":"15 pages, 7 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":"  We propose a link acquisition time model deeply involving the process from\nthe transmitted power to received signal-to-noise ratio (SNR) for LEO-to-ground\nlaser communication for the first time. Compared with the conventional\nacquisition models founded on geometry analysis with divergence angle\nthreshold, utilizing SNR as the decision criterion is more appropriate for\npractical engineering requirements. Specially, under the combined effects of\nplatform vibration and turbulence, we decouple the parameters of beam\ndivergence angle, spiral pitch, and coverage factor at a fixed transmitted\npower for a given average received SNR threshold. Then the single-scan\nacquisition probability is obtained by integrating the field of uncertainty\n(FOU), probability distribution of coverage factor, and receiver field angle.\nConsequently, the closed-form analytical expression of acquisition time\nexpectation adopting multi-scan, which ensures acquisition success, with\nessential reset time between single-scan is derived. The optimizations\nconcerning the beam divergence angle, spiral pitch, and FOU are presented.\nMoreover, the influence of platform vibration is investigated. All the\nanalytical derivations are confirmed by Monte Carlo simulations. Notably, we\nprovide a theoretical method for designing the minimum divergence angle\nmodulated by the laser, which not only improves the acquisition performance\nwithin a certain vibration range, but also achieves a good trade-off with the\nsystem complexity.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 08:12:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yang","Sen",""],["Li","Xiaofeng",""]]}
{"id":"2308.05759","submitter":"Felipe Meneguitti Dias","authors":"Douglas A.Almeida, Felipe M. Dias, Marcelo A. F. Toledo, Diego A. C.\n  Cardenas, Filipe A. C. Oliveira, Estela Ribeiro, Jose E. Krieger, Marco A.\n  Gutierrez","title":"A machine-learning sleep-wake classification model using a reduced\n  number of features derived from photoplethysmography and activity signals","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sleep is a crucial aspect of our overall health and well-being. It plays a\nvital role in regulating our mental and physical health, impacting our mood,\nmemory, and cognitive function to our physical resilience and immune system.\nThe classification of sleep stages is a mandatory step to assess sleep quality,\nproviding the metrics to estimate the quality of sleep and how well our body is\nfunctioning during this essential period of rest. Photoplethysmography (PPG)\nhas been demonstrated to be an effective signal for sleep stage inference,\nmeaning it can be used on its own or in a combination with others signals to\ndetermine sleep stage. This information is valuable in identifying potential\nsleep issues and developing strategies to improve sleep quality and overall\nhealth. In this work, we present a machine learning sleep-wake classification\nmodel based on the eXtreme Gradient Boosting (XGBoost) algorithm and features\nextracted from PPG signal and activity counts. The performance of our method\nwas comparable to current state-of-the-art methods with a Sensitivity of 91.15\n$\\pm$ 1.16%, Specificity of 53.66 $\\pm$ 1.12%, F1-score of 83.88 $\\pm$ 0.56%,\nand Kappa of 48.0 $\\pm$ 0.86%. Our method offers a significant improvement over\nother approaches as it uses a reduced number of features, making it suitable\nfor implementation in wearable devices that have limited computational power.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 13:43:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Almeida","Douglas A.",""],["Dias","Felipe M.",""],["Toledo","Marcelo A. F.",""],["Cardenas","Diego A. C.",""],["Oliveira","Filipe A. C.",""],["Ribeiro","Estela",""],["Krieger","Jose E.",""],["Gutierrez","Marco A.",""]]}
{"id":"2308.05760","submitter":"Dongling Xu","authors":"Dongling Xu, Xiang Yi, Yal\\c{c}n Ata, Xinyue Tao, Yuxuan Li, Peng Yue","title":"Unified Statistical Channel Modeling and performance analysis of\n  Vertical Underwater Wireless Optical Communication Links considering\n  Turbulence-Induced Fading","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The reliability of a vertical underwater wireless optical communication\n(UWOC) network is seriously impacted by turbulence-induced fading due to\nfluctuations in the water temperature and salinity, which vary with depth. To\nbetter assess the vertical UWOC system performances, an accurate probability\ndistribution function (PDF) model that can describe this fading is\nindispensable. In view of the limitations of theoretical and experimental\nstudies, this paper is the first to establish a more accurate modeling scheme\nfor wave optics simulation (WOS) by fully considering the constraints of\nsampling conditions on multi-phase screen parameters. On this basis, we\ncomplete the modeling of light propagation in a vertical oceanic turbulence\nchannel and subsequently propose a unified statistical model named mixture\nWeibull-generalized Gamma (WGG) distribution model to characterize\nturbulence-induced fading in vertical links. Interestingly, the WGG model is\nshown to provide a perfect fit with the acquired data under all considered\nchannel conditions. We further show that the application of the WGG model leads\nto closed-form and analytically tractable expressions for key UWOC system\nperformance metrics such as the average bit-error rate (BER). The presented\nresults give valuable insight into the practical aspects of development of UWOC\nnetworks.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 06:47:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xu","Dongling",""],["Yi","Xiang",""],["Ata","Yal\u00e7n",""],["Tao","Xinyue",""],["Li","Yuxuan",""],["Yue","Peng",""]]}
{"id":"2308.05761","submitter":"Alexander Stepanenko","authors":"A. A. Stepanenko and Yu. M. Gasparyan","title":"Analysis of sample temperature dynamics under pulsed laser irradiation\n  during laser-induced-desorption diagnostic","comments":null,"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":"  The accurate assessment of the local tritium concentration in the tokamak\nfirst wall by means of the laser-induced desorption (LID) diagnostic is sought\nas one the key solutions to monitoring the local radioactive tritium content in\nthe first wall of the fusion reactor ITER. Numerical models of gas desorption\nfrom solids used for LID simulation are usually closed with the one-dimensional\nheat transport models. In this study, the temperature dynamics of a target\nirradiated by a short laser pulse during LID are analyzed by means of the\ntwo-dimensional heat transport model to assess the validity of using\none-dimensional approximation for recovering the diagnostic signal. The\nquantitative estimates for the parameters governing the heat transfer are\npresented. The analytical expressions for the sample temperature distribution\nresolved both in time and space are derived. The sensitivity analysis of the\nobtained relations to uncertainties in the experimental parameters is\nperformed. It is shown that, depending of the ratio between the laser spot\nradius and heat diffusion length, the one-dimensional approach can noticeably\noverestimate the sample temperature in the limit of small laser spot radius,\nresulting in more than 100 % larger amounts of tritium desorbed from the\nirradiated target, compared to the two-dimensional approximation. In the limit\nof large laser spot radius, both approaches yield comparable amounts of\ndesorbed tritium.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 19:11:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Stepanenko","A. A.",""],["Gasparyan","Yu. M.",""]]}
{"id":"2308.05762","submitter":"Vaastav Anand","authors":"Roberta De Viti, Solal Pirelli, Vaastav Anand","title":"HotOS XIX Panel Report: Panel on Future of Reproduction and Replication\n  of Systems Research","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.OS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At HotOS XIX (2023), we organized a panel to discuss the future of\nreproducibility and replication in systems research. In this document, we\nhighlight the key points and themes that were discussed in the panel and\nsummarize the various opinions shared by both the panelists as well as the\nHotOS attendees.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:47:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["De Viti","Roberta",""],["Pirelli","Solal",""],["Anand","Vaastav",""]]}
{"id":"2308.05763","submitter":"Ben Israeli","authors":"Ben Y. Israeli, Christopher Berg Smiet","title":"A topological approach to magnetic nulls","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph astro-ph.SR math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic nulls are locations where the magnetic field vanishes. Nulls are the\nlocation of magnetic reconnection, and they determine to a large degree the\nmagnetic connectivity in a system. We describe a novel approach to\nunderstanding movement, appearance, and disappearance of nulls in magnetic\nfields. This approach is based on the novel concept of isotropes, or lines\nwhere the field direction is constant. These lines are streamlines of a vector\nfield whose flux is sourced by the topological indices of nulls, and can be\nconceptualized as corresponding \"lines of force\" between nulls. We show how\nthis topological approach can be used to generate analytical expressions for\nthe location of nulls in the presence of external fields for dipoles and for a\nfield defined by the Hopf fibration.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:13:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Israeli","Ben Y.",""],["Smiet","Christopher Berg",""]]}
{"id":"2308.05764","submitter":"\\\"Ozg\\\"un Turgut","authors":"\\\"Ozg\\\"un Turgut, Philip M\\\"uller, Paul Hager, Suprosanna Shit, Sophie\n  Starck, Martin J. Menten, Eimo Martens, Daniel Rueckert","title":"Unlocking the Diagnostic Potential of ECG through Knowledge Transfer\n  from Cardiac MRI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The electrocardiogram (ECG) is a widely available diagnostic tool that allows\nfor a cost-effective and fast assessment of the cardiovascular health. However,\nmore detailed examination with expensive cardiac magnetic resonance (CMR)\nimaging is often preferred for the diagnosis of cardiovascular diseases. While\nproviding detailed visualization of the cardiac anatomy, CMR imaging is not\nwidely available due to long scan times and high costs. To address this issue,\nwe propose the first self-supervised contrastive approach that transfers\ndomain-specific information from CMR images to ECG embeddings. Our approach\ncombines multimodal contrastive learning with masked data modeling to enable\nholistic cardiac screening solely from ECG data. In extensive experiments using\ndata from 40,044 UK Biobank subjects, we demonstrate the utility and\ngeneralizability of our method. We predict the subject-specific risk of various\ncardiovascular diseases and determine distinct cardiac phenotypes solely from\nECG data. In a qualitative analysis, we demonstrate that our learned ECG\nembeddings incorporate information from CMR image regions of interest. We make\nour entire pipeline publicly available, including the source code and\npre-trained model weights.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 10:05:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Turgut","\u00d6zg\u00fcn",""],["M\u00fcller","Philip",""],["Hager","Paul",""],["Shit","Suprosanna",""],["Starck","Sophie",""],["Menten","Martin J.",""],["Martens","Eimo",""],["Rueckert","Daniel",""]]}
{"id":"2308.05765","submitter":"Md Simul Hasan Talukder","authors":"Md. Simul Hasan Talukder, Rejwan Bin Sulaiman, Mouli Bardhan Paul\n  Angon","title":"Unleashing the Power of Extra-Tree Feature Selection and Random Forest\n  Classifier for Improved Survival Prediction in Heart Failure Patients","comments":"7 page, 6 Table and 6 Figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Heart failure is a life-threatening condition that affects millions of people\nworldwide. The ability to accurately predict patient survival can aid in early\nintervention and improve patient outcomes. In this study, we explore the\npotential of utilizing data pre-processing techniques and the Extra-Tree (ET)\nfeature selection method in conjunction with the Random Forest (RF) classifier\nto improve survival prediction in heart failure patients. By leveraging the\nstrengths of ET feature selection, we aim to identify the most significant\npredictors associated with heart failure survival. Using the public UCL Heart\nfailure (HF) survival dataset, we employ the ET feature selection algorithm to\nidentify the most informative features. These features are then used as input\nfor grid search of RF. Finally, the tuned RF Model was trained and evaluated\nusing different matrices. The approach was achieved 98.33% accuracy that is the\nhighest over the exiting work.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:47:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Talukder","Md. Simul Hasan",""],["Sulaiman","Rejwan Bin",""],["Angon","Mouli Bardhan Paul",""]]}
{"id":"2308.05766","submitter":"Svetlana Varchenko","authors":"G. Felder, A. Smirnov, V. Tarasov, A. Varchenko","title":"Hypergeometric integrals, hook formulas and Whittaker vectors","comments":"Latex, 15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AG math.MP math.QA math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We determine the coefficient of proportionality between two multidimensional\nhypergeometric integrals. One of them is a solution of the dynamical difference\nequations associated with a Young diagram and the other is the vertex integral\nassociated with the Young diagram. The coefficient of proportionality is the\ninverse of the product of weighted hooks of the Young diagram. It turns out\nthat this problem is closely related to the question of describing the action\nof the center of the universal enveloping algebra of $\\mathfrak{gl}_n$ on the\nspace of Whittaker vectors in the tensor product of dual Verma modules with\nfundamental modules, for which we give an explicit basis of simultaneous\neigenvectors.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:36:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Felder","G.",""],["Smirnov","A.",""],["Tarasov","V.",""],["Varchenko","A.",""]]}
{"id":"2308.05767","submitter":"YiJin Zhou","authors":"Yijin Zhou, Fu Li, Yang Li, Youshuo Ji, Lijian Zhang, Yuanfang Chen,\n  Wenming Zheng, Guangming Shi","title":"EEG-based Emotion Style Transfer Network for Cross-dataset Emotion\n  Recognition","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.HC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the key to realizing aBCIs, EEG emotion recognition has been widely\nstudied by many researchers. Previous methods have performed well for\nintra-subject EEG emotion recognition. However, the style mismatch between\nsource domain (training data) and target domain (test data) EEG samples caused\nby huge inter-domain differences is still a critical problem for EEG emotion\nrecognition. To solve the problem of cross-dataset EEG emotion recognition, in\nthis paper, we propose an EEG-based Emotion Style Transfer Network (E2STN) to\nobtain EEG representations that contain the content information of source\ndomain and the style information of target domain, which is called stylized\nemotional EEG representations. The representations are helpful for\ncross-dataset discriminative prediction. Concretely, E2STN consists of three\nmodules, i.e., transfer module, transfer evaluation module, and discriminative\nprediction module. The transfer module encodes the domain-specific information\nof source and target domains and then re-constructs the source domain's\nemotional pattern and the target domain's statistical characteristics into the\nnew stylized EEG representations. In this process, the transfer evaluation\nmodule is adopted to constrain the generated representations that can more\nprecisely fuse two kinds of complementary information from source and target\ndomains and avoid distorting. Finally, the generated stylized EEG\nrepresentations are fed into the discriminative prediction module for final\nclassification. Extensive experiments show that the E2STN can achieve the\nstate-of-the-art performance on cross-dataset EEG emotion recognition tasks.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:54:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhou","Yijin",""],["Li","Fu",""],["Li","Yang",""],["Ji","Youshuo",""],["Zhang","Lijian",""],["Chen","Yuanfang",""],["Zheng","Wenming",""],["Shi","Guangming",""]]}
{"id":"2308.05768","submitter":"Nina Weng","authors":"Nina Weng, Martyna Plomecka, Manuel Kaufmann, Ard Kastrati, Roger\n  Wattenhofer, Nicolas Langer","title":"An Interpretable and Attention-based Method for Gaze Estimation Using\n  Electroencephalography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Eye movements can reveal valuable insights into various aspects of human\nmental processes, physical well-being, and actions. Recently, several datasets\nhave been made available that simultaneously record EEG activity and eye\nmovements. This has triggered the development of various methods to predict\ngaze direction based on brain activity. However, most of these methods lack\ninterpretability, which limits their technology acceptance. In this paper, we\nleverage a large data set of simultaneously measured Electroencephalography\n(EEG) and Eye tracking, proposing an interpretable model for gaze estimation\nfrom EEG data. More specifically, we present a novel attention-based deep\nlearning framework for EEG signal analysis, which allows the network to focus\non the most relevant information in the signal and discard problematic\nchannels. Additionally, we provide a comprehensive evaluation of the presented\nframework, demonstrating its superiority over current methods in terms of\naccuracy and robustness. Finally, the study presents visualizations that\nexplain the results of the analysis and highlights the potential of attention\nmechanism for improving the efficiency and effectiveness of EEG data analysis\nin a variety of applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:58:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Weng","Nina",""],["Plomecka","Martyna",""],["Kaufmann","Manuel",""],["Kastrati","Ard",""],["Wattenhofer","Roger",""],["Langer","Nicolas",""]]}
{"id":"2308.05769","submitter":"Benard Tabu Dr","authors":"Samuel Alpert, Visal Veng, and Benard Tabu","title":"Alternative Fertilizer Production Using an Environmentally Benign\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fertilizer manufacturing is an energy-intensive process that is done in a\nselect number of facilities across the world. We performed a literature review\nof methods that are being pursued in the emerging field of sustainable\nfertilizer manufacturing and analyzed the results of one such sustainably\nsourced fertilizer process. The results of our testing on a rooftop garden\nshowed that the production of tomatoes was similar to the control and\ncommercial fertilizer scenarios in that the total weight of tomatoes per plant\nwas 16% higher, and the weight per tomato was 68% more than the control (tap\nwater). We hope that this type of research will continue to be performed and\nexpanded so that we can adopt a more sustainable method of fertilizer\nmanufacturing in our pursuit of net positive environmental benefits.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 01:43:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Alpert","Samuel",""],["Veng","Visal",""],["Tabu","Benard",""]]}
{"id":"2308.05770","submitter":"Wongi Park","authors":"Wongi Park and Jongbin Ryu","title":"Fine-Grained Self-Supervised Learning with Jigsaw Puzzles for Medical\n  Image Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classifying fine-grained lesions is challenging due to minor and subtle\ndifferences in medical images. This is because learning features of\nfine-grained lesions with highly minor differences is very difficult in\ntraining deep neural networks. Therefore, in this paper, we introduce\nFine-Grained Self-Supervised Learning(FG-SSL) method for classifying subtle\nlesions in medical images. The proposed method progressively learns the model\nthrough hierarchical block such that the cross-correlation between the\nfine-grained Jigsaw puzzle and regularized original images is close to the\nidentity matrix. We also apply hierarchical block for progressive fine-grained\nlearning, which extracts different information in each step, to supervised\nlearning for discovering subtle differences. Our method does not require an\nasymmetric model, nor does a negative sampling strategy, and is not sensitive\nto batch size. We evaluate the proposed fine-grained self-supervised learning\nmethod on comprehensive experiments using various medical image recognition\ndatasets. In our experiments, the proposed method performs favorably compared\nto existing state-of-the-art approaches on the widely-used ISIC2018, APTOS2019,\nand ISIC2017 datasets.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 02:08:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Park","Wongi",""],["Ryu","Jongbin",""]]}
{"id":"2308.05771","submitter":"Shidong Liang","authors":"Annan Fan and Shi-Dong Liang","title":"Geometric criterion of topological phase transition for non-Hermitian\n  systems","comments":"24 pages, 4 figures. arXiv admin note: text overlap with\n  arXiv:2308.05329","journal-ref":"Annalen der physik, 2100520 (2021)","doi":"10.1002/andp.202100520","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a geometric criterion of the topological phase transition for\nnon-Hermitian systems. We define the length of the boundary of the bulk band in\nthe complex energy plane for non-Hermitian systems. For one-dimensional\nsystems, we find that the topological phase transition occurs when the\nderivatives of the length with respect to parameters are discontinuous. For\ntwo-dimensional systems, when the length is discontinuous, the topological\nphase transitions between the gapped and gapless phases occurs. When the\nderivatives of the length with respect to parameters are discontinuous, the\ntopological phase transition between the gapless and gapless phases occurs.\nThese nonanalytic behaviors of the length in the complex energy plane provide a\nsignal to detect the topological phase transitions. We demonstrate this\ngeometric criterion by the one-dimensional non-Hermitian Su-Schieffer-Heeger\nmodel and the two-dimensional non-Hermitian Chern insulator model. This\ngeometric criterion provides an efficient insight to the global topological\ninvariant from a geometric local object in the complex energy plane for\nnon-Hermitian systems\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 05:55:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fan","Annan",""],["Liang","Shi-Dong",""]]}
{"id":"2308.05772","submitter":"Donggyu Kim","authors":"Donggyu Kim and Sang-il Oum","title":"Note on Hamilitonicity of basis graphs of even delta-matroids","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the basis graph of an even delta-matroid is Hamiltonian if it\nhas more than two vertices. More strongly, we prove that for two distinct edges\n$e$ and $f$ sharing a common end, it has a Hamiltonian cycle using $e$ and\navoiding $f$ unless it has at most two vertices or it is a cycle of length at\nmost four. We also prove that if the basis graph is not a hypercube graph, then\neach vertex belongs to cycles of every length $\\ell\\ge 3$, and each edge\nbelongs to cycles of every length $\\ell \\ge 4$. For the last theorem, we\nprovide two proofs, one of which uses the result of Naddef (1984) on polytopes\nand the result of Chepoi (2007) on basis graphs of even delta-matroids, and the\nother is a direct proof using various properties of even delta-matroids. Our\ntheorems generalize the analogous results for matroids by Holzmann and Harary\n(1972) and Bondy and Ingleton (1976).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:00:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kim","Donggyu",""],["Oum","Sang-il",""]]}
{"id":"2308.05773","submitter":"Diego Pasquier","authors":"Diego Pasquier","title":"Comment on \"Identification of the Mott Insulating Charge Density Wave\n  State in $1T$-TaS$_2$\"","comments":null,"journal-ref":null,"doi":"10.1103/PhysRevLett.131.059601","report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The applicability of DFT+$U$ to the star-of-David phase of $1T$-TaS$_2$ is\nexamined. The viability of a Mott phase as a ground state for the bulk of this\nmaterial is briefly discussed in light of the available experimental evidence.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:02:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Pasquier","Diego",""]]}
{"id":"2308.05774","submitter":"Kai Xiao","authors":"Kai Xiao, Haibo Yuan, Bowen Huang, Ruoyi Zhang, Lin Yang and Shuai Xu","title":"Improvement of the Pan-STARRS Photometric Calibration with LAMOST and\n  Gaia","comments":"14 pages, 18 figures, ApJS accepted, see main results in Figures 11\n  and 12","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we perform the re-calibration of PS1 photometry by correcting\nfor position-dependent systematic errors using the spectroscopy-based Stellar\nColor Regression method (SCR), the photometry-based SCR method (SCR$'$), and\nthe Gaia XP synthetic photometry method (XPSP). We confirm the significant\nlarge-scale and small-scale spatial variation of magnitude offsets for all the\n$grizy$ filters. We show that the PS1 photometric calibration precisions in the\n$grizy$ filters are around 5--7\\,mmag when averaged over 14$'$ regions. We note\na much larger calibration error up to 0.04 mag in the Galactic plane, which is\nprobably caused by the systematic errors of the PS1 magnitudes in crowded\nfields. The results of the three methods are consistent with each other within\n1--2\\,mmag or better for all the filters. We provide two-dimensional maps and a\npython package ({\\url{https://doi.org/10.12149/101283}}) to correct for\nposition-dependent magnitude offsets of PS1, which can be used for\nhigh-precision investigations and as a reference to calibrate other surveys.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:57:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xiao","Kai",""],["Yuan","Haibo",""],["Huang","Bowen",""],["Zhang","Ruoyi",""],["Yang","Lin",""],["Xu","Shuai",""]]}
{"id":"2308.05775","submitter":"T. Jeremy P. Karpowski","authors":"Julian Bissantz, Jeremy Karpowski, Matthias Steinhausen, Yujuan Luo,\n  Federica Ferraro, Arne Scholtissek, Christian Hasse, Luc Vervisch","title":"Application of dense neural networks for manifold-based modeling of\n  flame-wall interactions","comments":null,"journal-ref":"Applications in Energy and Combustion Science, Volume 13, 2023","doi":"10.1016/j.jaecs.2023.100113","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Artifical neural networks (ANNs) are universal approximators capable of\nlearning any correlation between arbitrary input data with corresponding\noutputs, which can also be exploited to represent a low-dimensional chemistry\nmanifold in the field of combustion. In this work, a procedure is developed to\nsimulate a premixed methane-air flame undergoing side-wall quenching utilizing\nan ANN chemistry manifold. In the investigated case, the flame characteristics\nare governed by two canonical problems: the adiabatic flame propagation in the\ncore flow and the non-adiabatic flame-wall interaction governed by enthalpy\nlosses to the wall. Similar to the tabulation of a Quenching Flamelet-Generated\nManifold (QFM), the neural network is trained on a 1D head-on quenching flame\ndatabase to learn the intrinsic chemistry manifold. The control parameters\n(i.e. the inputs) of the ANN are identified from thermo-chemical state\nvariables by a sparse principal component analysis (PCA) without using prior\nknowledge about the flame physics. These input quantities are then transported\nin the coupled CFD solver and used for manifold access during simulation\nruntime. The chemical source terms are corrected at the manifold boundaries to\nensure boundedness of the thermo-chemical state at all times. Finally, the ANN\nmodel is assessed by comparison to simulation results of the 2D side-wall\nquenching (SWQ) configuration with detailed chemistry and with a flamelet-based\nmanifold (QFM).\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:06:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bissantz","Julian",""],["Karpowski","Jeremy",""],["Steinhausen","Matthias",""],["Luo","Yujuan",""],["Ferraro","Federica",""],["Scholtissek","Arne",""],["Hasse","Christian",""],["Vervisch","Luc",""]]}
{"id":"2308.05776","submitter":"Gohil Thakur Dr.","authors":"Gohil S. Thakur, Manuel Schulze and Michael Ruck","title":"On the synthesis methodologies to prepare Pb$_9$Cu(PO$_4$)$_6$O --\n  phase, composition, magnetic analysis and absence of superconductivity","comments":"16 pages, 8 figure and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present the results of our various attempts to prepare the presumably\nroom-temperature and ambient-pressure superconducting compound\nPb$_9$Cu(PO$_4$)$_6$O (LK-99). We experimented with various starting materials,\nand used several synthesis techniques like, sealed quartz tubes and\nair-sintering pathways to prepare the reported phase. Repetition of the exact\nsynthesis process followed by Lee et al failed to reproduce the superconducting\nphase yielding only a multiphase sample. None of our prepared samples exhibits\nMeissner effect or Levitation. Very importantly, no copper (or only a trace\namount) could be detected in any of the designated LK-99 phase with PXRD\npattern identical to the reported one. Additionally, some dark greyish flakes\nin some samples responded towards the magnet in a way imitating\nhalf-levitation. The magnetic measurement on those sample suggest it is\ndiamagnetic in the measured temperature range of 2-325 K but show a weak soft\nferromagnetic behavior at 2 K, the origin of which is still unknown to us.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:13:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Thakur","Gohil S.",""],["Schulze","Manuel",""],["Ruck","Michael",""]]}
{"id":"2308.05777","submitter":"Martin Buttenschoen","authors":"Martin Buttenschoen, Garrett M. Morris, Charlotte M. Deane","title":"PoseBusters: AI-based docking methods fail to generate physically valid\n  poses or generalise to novel sequences","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The last few years have seen the development of numerous deep learning-based\nprotein-ligand docking methods. They offer huge promise in terms of speed and\naccuracy. However, despite claims of state-of-the-art performance in terms of\ncrystallographic root-mean-square deviation (RMSD), upon closer inspection, it\nhas become apparent that they often produce physically implausible molecular\nstructures. It is therefore not sufficient to evaluate these methods solely by\nRMSD to a native binding mode. It is vital, particularly for deep\nlearning-based methods, that they are also evaluated on steric and energetic\ncriteria. We present PoseBusters, a Python package that performs a series of\nstandard quality checks using the well-established cheminformatics toolkit\nRDKit. Only methods that both pass these checks and predict native-like binding\nmodes should be classed as having ``state-of-the-art'' performance. We use\nPoseBusters to compare five deep learning-based docking methods (DeepDock,\nDiffDock, EquiBind, TankBind, and Uni-Mol) and two well-established standard\ndocking methods (AutoDock Vina and CCDC Gold) with and without an additional\npost-prediction energy minimisation step using a molecular mechanics force\nfield. We show that both in terms of physical plausibility and the ability to\ngeneralise to examples that are distinct from the training data, no deep\nlearning-based method yet outperforms classical docking tools. In addition, we\nfind that molecular mechanics force fields contain docking-relevant physics\nmissing from deep-learning methods. PoseBusters allows practitioners to assess\ndocking and molecular generation methods and may inspire new inductive biases\nstill required to improve deep learning-based methods, which will help drive\nthe development of more accurate and more realistic predictions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 11:28:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Buttenschoen","Martin",""],["Morris","Garrett M.",""],["Deane","Charlotte M.",""]]}
{"id":"2308.05778","submitter":"Yue Sun","authors":"Qiang Hou, Wei Wei, Xin Zhou, Xinyue Wang, Yue Sun, ZhiXiang Shi","title":"Current percolation model for the special resistivity behavior observed\n  in Cu-doped Apatite","comments":"This paper represents a continuation of our previous study\n  [arXiv:2308.01192], now offering a more comprehensive analysis of the\n  collected data","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":"  Since the initial report of the potential occurrence of room-temperature\nsuperconductivity under normal pressure [arXiv: 2307.12008], there has been\nsignificant interest in the field of condensed matter physics regarding\nCu-doped Apatite (Pb10-xCux(PO4)6O). In this study, we performed\ntemperature-dependent resistivity measurements on the synthesized\nPb10-xCux(PO4)6O samples. The structure of the sample was confirmed to match\nthe reference literature through X-ray diffraction analysis. Remarkably, we\nobserved four distinct types of resistivity behaviors within samples from the\nsame pellet: (1) A semiconductor-like behavior characterized by a decrease in\nresistivity as the temperature is lowered. (2) A gradual reduction in\nresistivity, reaching an exceptionally small value that falls below the\nresolution limits of our measurement equipment. (3) An abrupt drop in\nresistivity to a low value at ~ 250 K. (4) An almost linear reduction in\nresistivity exhibiting a transition at approximately 7 K (possibly associated\nwith Pb). Following a thorough compositional analysis, we proposed a current\npercolation model, based on the formation of a Cu/Pb current channel, to\nelucidate the observed special resistivity behaviors. It is important to note\nthat the Meissner effect was not observed in our magnetization measurements.\nConsequently, we reached the conclusion that the presence of superconductivity\nin Cu-doped Apatite has yet to be substantiated.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:37:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hou","Qiang",""],["Wei","Wei",""],["Zhou","Xin",""],["Wang","Xinyue",""],["Sun","Yue",""],["Shi","ZhiXiang",""]]}
{"id":"2308.05779","submitter":"Maria Jose Sanchez Majo","authors":"Walter Qui\\~nonez, Mar\\'ia Jos\\'e S\\'anchez, Diego Rubi","title":"Effect of memristor\\'s potentiation-depression curves peculiarities in\n  the convergence of physical perceptrons","comments":"10 pages published version","journal-ref":"Phys. Scr. 98 095917 (2023)","doi":"10.1088/1402-4896/aceb98","report-no":null,"categories":"cond-mat.mes-hall cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neuromorphic computing aims to emulate the architecture and information\nprocessing mechanisms of the mammalian brain. This includes the implementation\nby hardware of neural networks. Oxide-based memristor arrays with cross-bar\narchitecture appear as a possible physical implementation of neural networks.In\nthis paper, we obtain experimental potentiation-depression (P-D) curves on\ndifferent manganite-based memristive systems and simulate the learning process\nof perceptrons for character recognition. We analyze how the specific\ncharacteristics of the P-D curves affect the convergence time -- characterized\nby the EPOCHs-to-convergence (ETC) parameter -- of the network. Our work shows\nthat ETC is reduced for systems displaying P-D curves with relatively low\ngranularity and non-linear and asymmetric response. In addition, we also show\nthat noise injection during the synaptic weight actualization further reduces\nthe ETC. The results obtained here are expected to contribute to the\noptimization of hardware neural networks based on memristors cross-bar arrays.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 13:39:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Qui\u00f1onez","Walter",""],["S\u00e1nchez","Mar\u00eda Jos\u00e9",""],["Rubi","Diego",""]]}
{"id":"2308.05780","submitter":"Rohan Gupta","authors":"Sidhantha Poddar and Rohan Gupta","title":"Optical Script Identification for multi-lingual Indic-script","comments":"20 pages , 12 figures Keywords: Optical character Identification,\n  Pre-processing, feature extraction, multi-script, Indic-script, Script\n  Recognition","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Script identification and text recognition are some of the major domains in\nthe application of Artificial Intelligence. In this era of digitalization, the\nuse of digital note-taking has become a common practice. Still, conventional\nmethods of using pen and paper is a prominent way of writing. This leads to the\nclassification of scripts based on the method they are obtained. A survey on\nthe current methodologies and state-of-art methods used for processing and\nidentification would prove beneficial for researchers. The aim of this article\nis to discuss the advancement in the techniques for script pre-processing and\ntext recognition. In India there are twelve prominent Indic scripts, unlike the\nEnglish language, these scripts have layers of characteristics. Complex\ncharacteristics such as similarity in text shape make them difficult to\nrecognize and analyze, thus this requires advance preprocessing methods for\ntheir accurate recognition. A sincere attempt is made in this survey to provide\na comparison between all algorithms. We hope that this survey would provide\ninsight to a researcher working not only on Indic scripts but also other\nlanguages.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:02:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Poddar","Sidhantha",""],["Gupta","Rohan",""]]}
{"id":"2308.05781","submitter":"Ion I. Cotaescu","authors":"Ion I. Cotaescu","title":"Conserved spin operator of Dirac's theory in spatially flat FLRW\n  spacetimes","comments":"22 pages no figures. arXiv admin note: text overlap with\n  arXiv:2304.12182","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  New conserved spin and orbital angular momentum operators of Dirac's theory\non spatially flat FLRW spacetimes are proposed generalizing thus recent results\nconcerning the role of Pryce's spin operator in the flat case [I. I. Cot\\u\naescu, Eur. Phys. J. C (2022) 82:1073]. These operators split the conserved\ntotal angular momentum generating the new spin and orbital symmetries that form\nthe rotations of the isometry groups. The new spin operator is defined and\nstudied in active mode with the help of a suitable spectral representation\ngiving its Fourier transfor. Moreover, in the same manner is defined the\noperator of the fermion polarization. The orbital angular momentum is derived\nin passive mode using a new method, inspired by Wigner's theory of induced\nrepresentations, but working properly only for global rotations. In this\napproach the quantization is performed finding that the one-particle spin and\norbital angular momentum operators have the same form in any FLRW spacetime\nregardless their concrete geometries given by various scale factors.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 15:02:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cotaescu","Ion I.",""]]}
{"id":"2308.05782","submitter":"Ruining Deng","authors":"Franklin Hu, Ruining Deng, Shunxing Bao, Haichun Yang, Yuankai Huo","title":"Multi-scale Multi-site Renal Microvascular Structures Segmentation for\n  Whole Slide Imaging in Renal Pathology","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":"  Segmentation of microvascular structures, such as arterioles, venules, and\ncapillaries, from human kidney whole slide images (WSI) has become a focal\npoint in renal pathology. Current manual segmentation techniques are\ntime-consuming and not feasible for large-scale digital pathology images. While\ndeep learning-based methods offer a solution for automatic segmentation, most\nsuffer from a limitation: they are designed for and restricted to training on\nsingle-site, single-scale data. In this paper, we present Omni-Seg, a novel\nsingle dynamic network method that capitalizes on multi-site, multi-scale\ntraining data. Unique to our approach, we utilize partially labeled images,\nwhere only one tissue type is labeled per training image, to segment\nmicrovascular structures. We train a singular deep network using images from\ntwo datasets, HuBMAP and NEPTUNE, across different magnifications (40x, 20x,\n10x, and 5x). Experimental results indicate that Omni-Seg outperforms in terms\nof both the Dice Similarity Coefficient (DSC) and Intersection over Union\n(IoU). Our proposed method provides renal pathologists with a powerful\ncomputational tool for the quantitative analysis of renal microvascular\nstructures.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:26:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hu","Franklin",""],["Deng","Ruining",""],["Bao","Shunxing",""],["Yang","Haichun",""],["Huo","Yuankai",""]]}
{"id":"2308.05783","submitter":"Frederike D\\\"umbgen","authors":"Frederike D\\\"umbgen, Connor Holmes, Ben Agro, Timothy D. Barfoot","title":"Toward Globally Optimal State Estimation Using Automatically Tightened\n  Semidefinite Relaxations","comments":"17 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, semidefinite relaxations of common optimization problems in\nrobotics have attracted growing attention due to their ability to provide\nglobally optimal solutions. In many cases, specific handcrafted redundant\nconstraints are added to the relaxation in order to improve its tightness,\nwhich is usually a requirement for obtaining or certifying globally optimal\nsolutions. These constraints are formulation-dependent and typically require a\nlengthy manual process to find. Instead, the present paper suggests an\nautomatic method to find a set of sufficient redundant constraints to obtain\ntightness, if they exist. We first propose an efficient feasibility check to\ndetermine if a given set of variables can lead to a tight formulation.\nSecondly, we show how to scale the method to problems of bigger size. At no\npoint of the entire process do we have to manually find redundant constraints.\nWe showcase the effectiveness of the approach by providing new insights on two\nclassical robotics problems: range-based localization and stereo-based pose\nestimation. Finally, we reproduce semidefinite relaxations presented in recent\nliterature and show that our automatic method finds a smaller set of\nconstraints sufficient for tightness than previously considered.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:30:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["D\u00fcmbgen","Frederike",""],["Holmes","Connor",""],["Agro","Ben",""],["Barfoot","Timothy D.",""]]}
{"id":"2308.05784","submitter":"Ruining Deng","authors":"Haoju Leng, Ruining Deng, Shunxing Bao, Dazheng Fang, Bryan A. Millis,\n  Yucheng Tang, Haichun Yang, Xiao Wang, Yifan Peng, Lipeng Wan, Yuankai Huo","title":"High-performance Data Management for Whole Slide Image Analysis in\n  Digital Pathology","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":"  When dealing with giga-pixel digital pathology in whole-slide imaging, a\nnotable proportion of data records holds relevance during each analysis\noperation. For instance, when deploying an image analysis algorithm on\nwhole-slide images (WSI), the computational bottleneck often lies in the\ninput-output (I/O) system. This is particularly notable as patch-level\nprocessing introduces a considerable I/O load onto the computer system.\nHowever, this data management process could be further paralleled, given the\ntypical independence of patch-level image processes across different patches.\nThis paper details our endeavors in tackling this data access challenge by\nimplementing the Adaptable IO System version 2 (ADIOS2). Our focus has been\nconstructing and releasing a digital pathology-centric pipeline using ADIOS2,\nwhich facilitates streamlined data management across WSIs. Additionally, we've\ndeveloped strategies aimed at curtailing data retrieval times. The performance\nevaluation encompasses two key scenarios: (1) a pure CPU-based image analysis\nscenario (\"CPU scenario\"), and (2) a GPU-based deep learning framework scenario\n(\"GPU scenario\"). Our findings reveal noteworthy outcomes. Under the CPU\nscenario, ADIOS2 showcases an impressive two-fold speed-up compared to the\nbrute-force approach. In the GPU scenario, its performance stands on par with\nthe cutting-edge GPU I/O acceleration framework, NVIDIA Magnum IO GPU Direct\nStorage (GDS). From what we know, this appears to be among the initial\ninstances, if any, of utilizing ADIOS2 within the field of digital pathology.\nThe source code has been made publicly available at\nhttps://github.com/hrlblab/adios.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:33:59 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 20:21:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Leng","Haoju",""],["Deng","Ruining",""],["Bao","Shunxing",""],["Fang","Dazheng",""],["Millis","Bryan A.",""],["Tang","Yucheng",""],["Yang","Haichun",""],["Wang","Xiao",""],["Peng","Yifan",""],["Wan","Lipeng",""],["Huo","Yuankai",""]]}
{"id":"2308.05785","submitter":"Ruining Deng","authors":"Xueyuan Li, Ruining Deng, Yucheng Tang, Shunxing Bao, Haichun Yang,\n  Yuankai Huo","title":"Leverage Weakly Annotation to Pixel-wise Annotation via Zero-shot\n  Segment Anything Model for Molecular-empowered Learning","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":"  Precise identification of multiple cell classes in high-resolution Giga-pixel\nwhole slide imaging (WSI) is critical for various clinical scenarios. Building\nan AI model for this purpose typically requires pixel-level annotations, which\nare often unscalable and must be done by skilled domain experts (e.g.,\npathologists). However, these annotations can be prone to errors, especially\nwhen distinguishing between intricate cell types (e.g., podocytes and mesangial\ncells) using only visual inspection. Interestingly, a recent study showed that\nlay annotators, when using extra immunofluorescence (IF) images for reference\n(referred to as molecular-empowered learning), can sometimes outperform domain\nexperts in labeling. Despite this, the resource-intensive task of manual\ndelineation remains a necessity during the annotation process. In this paper,\nwe explore the potential of bypassing pixel-level delineation by employing the\nrecent segment anything model (SAM) on weak box annotation in a zero-shot\nlearning approach. Specifically, we harness SAM's ability to produce\npixel-level annotations from box annotations and utilize these SAM-generated\nlabels to train a segmentation model. Our findings show that the proposed\nSAM-assisted molecular-empowered learning (SAM-L) can diminish the labeling\nefforts for lay annotators by only requiring weak box annotations. This is\nachieved without compromising annotation accuracy or the performance of the\ndeep learning-based segmentation. This research represents a significant\nadvancement in democratizing the annotation process for training pathological\nimage segmentation, relying solely on non-expert annotators.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:44:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Xueyuan",""],["Deng","Ruining",""],["Tang","Yucheng",""],["Bao","Shunxing",""],["Yang","Haichun",""],["Huo","Yuankai",""]]}
{"id":"2308.05786","submitter":"Yuhang Zhang","authors":"Yuhang Zhang, Cong Liu, Xiyu Zhu, Hai-Hu Wen","title":"Ferromagnetism and insulating behavior with a logarithmic temperature\n  dependence of resistivity in $Pb_{10-x}Cu_x\\left( PO_4 \\right) _6O$","comments":"11 Pages,4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent claim of discovering above-room-temperature superconductivity (Tc\nabout 400 K) at ambient pressure in copper doped apatite $Pb_{10}\\left( PO_4\n\\right) _6O$ has stimulated world-wide enthusiasm and impulse of motion. A lot\nof follow-up works have been carried out with controversial conclusions. To\ncheck whether superconductivity is really present or absent in the material, we\nneed samples which should have a rather pure phase of $Pb_{10-x}Cu_x\\left( PO_4\n\\right) _6O$. Here we report the characterization results from the\n$Pb_{10-x}Cu_x\\left( PO_4 \\right) _6O$ with a volume of about 97% inferred from\nthe fitting to the x-ray diffraction pattern. The resistivity measurements show\nthat it is a semiconductor characterized roughly by a ln(1/T) temperature\ndependence in wide temperature region without trace of superconductivity.\nMagnetization measurements show that it has a general ferromagnetic signal with\na weak superparamagnetic background. Many grains of the sample show clear\ninteractions with a NbFeB magnet. The detected Cu concentration is much lower\nthan the expected nominal one and the conduction may be improved if more Cu\natoms are successfully doped into the system. Our results show the absence of\nmetallicity and superconductivity in $Pb_{10-x}Cu_x\\left( PO_4 \\right) _6O$ at\nambient pressure, and suggest the presence of strong correlation effect.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:20:41 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 16:21:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Yuhang",""],["Liu","Cong",""],["Zhu","Xiyu",""],["Wen","Hai-Hu",""]]}
{"id":"2308.05787","submitter":"Ziyuan Huang","authors":"Ziyuan Huang, Shiwei Zhang, Liang Pan, Zhiwu Qing, Yingya Zhang, Ziwei\n  Liu, Marcelo H. Ang Jr","title":"Temporally-Adaptive Models for Efficient Video Understanding","comments":"arXiv admin note: text overlap with arXiv:2110.06178","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spatial convolutions are extensively used in numerous deep video models. It\nfundamentally assumes spatio-temporal invariance, i.e., using shared weights\nfor every location in different frames. This work presents Temporally-Adaptive\nConvolutions (TAdaConv) for video understanding, which shows that adaptive\nweight calibration along the temporal dimension is an efficient way to\nfacilitate modeling complex temporal dynamics in videos. Specifically, TAdaConv\nempowers spatial convolutions with temporal modeling abilities by calibrating\nthe convolution weights for each frame according to its local and global\ntemporal context. Compared to existing operations for temporal modeling,\nTAdaConv is more efficient as it operates over the convolution kernels instead\nof the features, whose dimension is an order of magnitude smaller than the\nspatial resolutions. Further, kernel calibration brings an increased model\ncapacity. Based on this readily plug-in operation TAdaConv as well as its\nextension, i.e., TAdaConvV2, we construct TAdaBlocks to empower ConvNeXt and\nVision Transformer to have strong temporal modeling capabilities. Empirical\nresults show TAdaConvNeXtV2 and TAdaFormer perform competitively against\nstate-of-the-art convolutional and Transformer-based models in various video\nunderstanding benchmarks. Our codes and models are released at:\nhttps://github.com/alibaba-mmai-research/TAdaConv.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:35:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Huang","Ziyuan",""],["Zhang","Shiwei",""],["Pan","Liang",""],["Qing","Zhiwu",""],["Zhang","Yingya",""],["Liu","Ziwei",""],["Ang","Marcelo H.","Jr"]]}
{"id":"2308.05788","submitter":"Elena Derunova","authors":"Elena Derunova, \\'Angel David R\\'ios Ortiz, Jacob Gayles, Yan Sun,\n  Michael W. Gaultois, and Mazhar N. Ali","title":"Correlated electrons tunneling through pseudo Fermi arcs in hyperbolic\n  Fermi surfaces of topological materials","comments":"arXiv admin note: substantial text overlap with arXiv:2007.05525","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci cond-mat.other","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last few decades, basic ideas of topology have completely transformed\nthe prediction of quantum transport phenomena. Following this trend, we go\ndeeper into the incorporation of modern mathematics into quantum material\nscience focusing on geometry. Here we formulate geometrical conditions of the\nFermi surface for a Fermi liquid breakdown and corresponding correlated\ntransport phenomena. As a mechanism to recognize these correlations, we\nintroduce pseudo Fermi arcs connecting separate pockets of a hyperbolic Fermi\nsurface. Tunneling through these pseudo arcs and corresponding time-reversal\nsymmetry breaking of purely geometrical origin is referred to as the Fermi\nSurface Geometry Effect (FS-GE). The reliability of the FS-GE is tested on the\nspin and anomalous Hall effects, traditionally associated with intrinsic\ntime-reversal symmetry breaking. An index, H, quantifying the FS-GE in a\nparticular direction, shows a universal correlation (R^2 = 0.97) with the\nexperimentally measured intrinsic anomalous Hall conductivity, of 16 different\ncompounds spanning a wide variety of crystal, chemical, and electronic\nstructure families, including those where topological methods give R$^2$ =\n0.52. This raises a question about the predictive limits of topological physics\nand its transformation into a wider study of bandstructures' and Fermi\nsurfaces' geometries, opening horizon for prediction of phenomena beyond\ntopological understanding.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:55:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Derunova","Elena",""],["Ortiz","\u00c1ngel David R\u00edos",""],["Gayles","Jacob",""],["Sun","Yan",""],["Gaultois","Michael W.",""],["Ali","Mazhar N.",""]]}
{"id":"2308.05789","submitter":"Minhao He","authors":"Yuwen Hu, Yen-Chen Tsui, Minhao He, Umut Kamber, Taige Wang, Amir S.\n  Mohammadi, Kenji Watanabe, Takashi Taniguchi, Zlatko Papic, Michael P.\n  Zaletel, Ali Yazdani","title":"High-Resolution Tunneling Spectroscopy of Fractional Quantum Hall States","comments":"5 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":"  Strong interaction among electrons in two-dimensional systems in the presence\nof high magnetic fields gives rise to fractional quantum Hall (FQH) states that\nhost quasi-particles with fractional charge and statistics. We perform\nhigh-resolution scanning tunneling microscopy and spectroscopy of FQH states in\nultra-clean Bernal-stacked bilayer graphene (BLG) devices. Our experiments show\nthat the formation of FQH states coincides with the appearance of sharp\nexcitations in tunneling experiments that have been predicted to occur for\nelectron fractionalizing into bound states of quasi-particles. From these\nmeasurements and their comparison to theoretical calculations, we find large\nlocal energy gaps that protect quasi-particles of FQH states predicted to host\nnon-abelian anyons, making BLG an ideal setting for the exploration of these\nnovel quasi-particles. STM studies not only provide a way to characterize the\nbulk properties of FQH states in the absence of disorder but also reveal\nprevious undiscovered states in such ultra-clean samples.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:57:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hu","Yuwen",""],["Tsui","Yen-Chen",""],["He","Minhao",""],["Kamber","Umut",""],["Wang","Taige",""],["Mohammadi","Amir S.",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Papic","Zlatko",""],["Zaletel","Michael P.",""],["Yazdani","Ali",""]]}
{"id":"2308.05790","submitter":"Richard Parker","authors":"Richard J. Parker (University of Sheffield, UK)","title":"A dependence of binary and planetary system destruction on subtle\n  variations in the substructure in young star-forming regions","comments":"9 pages, 5 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulations of the effects of stellar fly-bys on planetary systems in\nstar-forming regions show a strong dependence on subtle variations in the\ninitial spatial and kinematic substructure of the regions. For similar stellar\ndensities, the more substructured star-forming regions disrupt up to a factor\nof two more planetary systems. We extend this work to look at the effects of\nsubstructure on stellar binary populations. We present $N$-body simulations of\nsubstructured, and non-substructured (smooth) star-forming regions in which we\nplace different populations of stellar binaries. We find that for binary\npopulations that are dominated by close ($<$100au) systems, a higher proportion\nare destroyed in substructured regions. However, for wider systems ($>$100au),\na higher proportion are destroyed in smooth regions. The difference is likely\ndue to the hard-soft, or fast-slow boundary for binary destruction. Hard\n(fast/close) binaries are more likely to be destroyed in environments with a\nsmall velocity dispersion (kinematically substructured regions), whereas soft\n(slow/wide) binaries are more likely to be destroyed in environments with\nhigher velocity dispersions (non-kinematically substructured regions). Due to\nthe vast range of stellar binary semimajor axes in star-forming regions\n($10^{-2} - 10^4$au) these differences are small and hence unlikely to be\nobservable. However, planetary systems have a much smaller initial semimajor\naxis range (likely $\\sim$1 -- 100au for gas giants) and here the difference in\nthe fraction of companions due to substructure could be observed if the\nstar-forming regions that disrupt planetary systems formed with similar stellar\ndensities.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Parker","Richard J.","","University of Sheffield, UK"]]}
{"id":"2308.05791","submitter":"Alex Levchenko","authors":"Maxim Dzero, Maxim Khodas, Alex Levchenko","title":"Transport anomalies in multiband superconductors near quantum critical\n  point","comments":"41 pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the effects of quantum fluctuations on the transport properties of\nmultiband superconductors near a pair-breaking quantum critical point. For this\npurpose, we consider a minimal model of the quantum phase transition in a\nsystem with two nested two-dimensional Fermi surfaces. Under the assumption\nthat doping the system adds nonmagnetic impurities but does not change the\ndensities of carriers, we include disorder potentials that render both intra-\nand interband collisions. Interband scattering leads to a full suppression of\nthe unconventional $s^{\\pm}$ superconducting order similar to the effect of\nparamagnetic impurities in isotropic single-band superconductors. We use the\ndiagrammatic technique of quantum field theory to compute the corrections to\nelectrical conductivity in a normal state due to superconducting fluctuations\nin the entire low-temperature quantum regime. We show that the sign of the\nconductivity correction depends on how the quantum critical point is approached\nin the phase diagram. We contrast our findings to existing approaches to this\nproblem based on the renormalization group, time-dependent Ginzburg-Landau\nphenomenology, and effective bosonic action field theories.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dzero","Maxim",""],["Khodas","Maxim",""],["Levchenko","Alex",""]]}
{"id":"2308.05792","submitter":"Renato Renner","authors":"Renato Renner and Ramona Wolf","title":"Commuting operations factorise","comments":"24 pages, 6 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":"  Consider two agents, Alice and Bob, each of whom takes a quantum input,\noperates on a shared quantum system $K$, and produces a quantum output. Alice\nand Bob's operations may commute, in the sense that the joint input-output\nbehaviour is independent of the order in which they access $K$. Here we ask\nwhether this commutation property implies that $K$ can be split into two\nfactors on which Alice and Bob act separately. The question can be regarded as\na \"fully quantum\" generalisation of a problem posed by Tsirelson, who\nconsidered the case where Alice and Bob's inputs and outputs are classical. In\nthis case, the answer is negative in general, but it is known that a\nfactorisation exists in finite dimensions. Here we show the same holds in the\nfully quantum case, i.e., commuting operations factorise, provided that all\ninput systems are finite-dimensional.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Renner","Renato",""],["Wolf","Ramona",""]]}
{"id":"2308.05793","submitter":"Rui-Xing Zhang","authors":"Penghao Zhu, Rui-Xing Zhang","title":"Delicate Topology of Luttinger Semimetal","comments":"10 + 6 pages, 4 + 5 figures","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":"  Recent advances in delicate topology have expanded the classification of\ntopological bands, but its presence in solid-state materials remains elusive.\nHere we show that delicate topology naturally emerges in the Luttinger-Kohn\nmodel that describes many semiconductors and semimetals. In particular, the\nLuttinger semimetal is found to be a quantum critical point leading to a\nquantized jump of an integer-valued delicate topological invariant. Away from\nthis criticality, we have identified new types of electronic insulators and\nsemimetals with intertwined stable and delicate topologies. They all carry\ngapless surface states that transform anomalously under rotation symmetry. Our\nwork provides a starting point for exploring delicate topological phenomena in\nquantum materials.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhu","Penghao",""],["Zhang","Rui-Xing",""]]}
{"id":"2308.05794","submitter":"Shi-Ju Kang","authors":"Shi-Ju Kang, Yong-Gang Zheng, Qingwen Wu","title":"Hunting for the candidates of misclassified sources in LSP BL Lacs using\n  Machine learning","comments":"Accepted for publication in MNRAS. 15 pages, 6 figures, 8 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An equivalent width (EW) based classification may cause the erroneous\njudgement to the flat spectrum radio quasars (FSRQs) and BL Lacerate objects\n(BL Lac) due to the diluting the line features by dramatic variations in the\njet continuum flux. To help address the issue, the present paper explore the\npossible intrinsic classification on the bias of a random forest supervised\nmachine learning algorithm. In order to do so, we compile a sample of 1680\nFermi blazars that have both gamma-rays and radio-frequencies data available\nfrom the 4LAC-DR2 catalog, which includes 1352 training and validation samples\nand 328 forecast samples. By studying the results for all of the different\ncombinations of 23 characteristic parameters, we found that there are 178\noptimal parameters combinations (OPCs) with the highest accuracy ($\\simeq$\n98.89\\%). Using the combined classification results from the nine combinations\nof these OPCs to the 328 forecast samples, we predict that there are 113 true\nBL Lacs (TBLs) and 157 false BL Lacs (FBLs) that are possible intrinsically\nFSRQs misclassified as BL Lacs. The FBLs show a clear separation from TBLs and\nFSRQs in the $\\gamma$-ray photon spectral index, $\\Gamma_{\\rm ph}$, and X-band\nradio flux, ${\\rm log}{F_{R}}$, plot. Phenomenally, existence a BL Lac to FSRQ\n(B-to-F) transition zone is suggested, where the FBLs are in the stage of\ntransition from BL Lacs to FSRQs. Comparing the LSP Changing-Look Blazars\n(CLBs) reported in the literatures, the majority of LSP CLBs are located at the\nB-to-F zone. We argue that the FBLs located at B-to-F transition zone are the\nmost likely Candidates of CLBs.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kang","Shi-Ju",""],["Zheng","Yong-Gang",""],["Wu","Qingwen",""]]}
{"id":"2308.05795","submitter":"Sirio Belli","authors":"Sirio Belli, Minjung Park, Rebecca L. Davies, J. Trevor Mendel,\n  Benjamin D. Johnson, Charlie Conroy, Chlo\\\"e Benton, Letizia Bugiani, Razieh\n  Emami, Joel Leja, Yijia Li, Gabriel Maheson, Elijah P. Mathews, Rohan P.\n  Naidu, Erica J. Nelson, Sandro Tacchella, Bryan A. Terrazas, Rainer\n  Weinberger","title":"Massive and Multiphase Gas Outflow in a Quenching Galaxy at z=2.445","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale outflows driven by supermassive black holes are thought to play a\nfundamental role in suppressing star formation in massive galaxies. However,\ndirect observational evidence for this hypothesis is still lacking,\nparticularly in the young universe where star formation quenching is remarkably\nrapid, thus requiring effective removal of gas as opposed to slow gas heating.\nWhile outflows of ionized gas are commonly detected in massive distant\ngalaxies, the amount of ejected mass is too small to be able to suppress star\nformation. Gas ejection is expected to be more efficient in the neutral and\nmolecular phases, but at high redshift these have only been observed in\nstarbursts and quasars. Using deep spectroscopy from JWST, here we show the\npresence of an outflow of neutral and ionized gas in a massive galaxy observed\nduring the rapid quenching of its star formation, at a redshift of z=2.445. The\noutflowing mass is mostly in the neutral phase, and the mass outflow rate is\nlarger than the residual star formation rate, indicating that the gas ejection\nis likely to have a strong impact on the evolution of the galaxy. We do not\ndetect X-ray or radio activity; however the presence of a supermassive black\nhole is suggested by the properties of the ionized gas emission lines. We thus\nconclude that supermassive black holes are able to rapidly suppress star\nformation in massive galaxies by efficiently ejecting neutral gas.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Belli","Sirio",""],["Park","Minjung",""],["Davies","Rebecca L.",""],["Mendel","J. Trevor",""],["Johnson","Benjamin D.",""],["Conroy","Charlie",""],["Benton","Chlo\u00eb",""],["Bugiani","Letizia",""],["Emami","Razieh",""],["Leja","Joel",""],["Li","Yijia",""],["Maheson","Gabriel",""],["Mathews","Elijah P.",""],["Naidu","Rohan P.",""],["Nelson","Erica J.",""],["Tacchella","Sandro",""],["Terrazas","Bryan A.",""],["Weinberger","Rainer",""]]}
{"id":"2308.05796","submitter":"Mark Hirsbrunner","authors":"Mark R. Hirsbrunner, Alexander D. Gray, Taylor L. Hughes","title":"Crystalline-electromagnetic responses of higher order topological\n  semimetals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previous work has shown that time-reversal symmetric Weyl semimetals with a\nquadrupolar arrangement of first-order Weyl nodes exhibit a mixed\ncrystalline-electromagnetic response. For systems with higher order Weyl nodes,\nwhich are attached to both surface and hinge Fermi arcs, additional phenomena\nappear on surfaces of codimension $n>1$, such as electromagnetic responses of\nthe hinges. Here we construct a model possessing a quadrupole of higher order\nWeyl nodes to study the interplay between higher order topology and mixed\ncrystalline-electromagnetic responses. We show that the higher order nature of\nthe Weyl nodes yields a dipole of Dirac nodes on certain surfaces, leading to a\nmixed crystalline-electromagnetic \\emph{surface} response that binds charge to\ndislocations and momentum-density to magnetic fields. In addition, we show that\nthe model possesses a bulk quadrupole moment of crystal-momentum that provides\na link between the bulk and surface responses of the system.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hirsbrunner","Mark R.",""],["Gray","Alexander D.",""],["Hughes","Taylor L.",""]]}
{"id":"2308.05797","submitter":"Raphael Marschall","authors":"Raphael Marschall, Bj\\\"orn J. R. Davidsson, Martin Rubin, Valeriy\n  Tenishev","title":"Neutral gas coma dynamics: modeling of flows and attempts to link inner\n  coma structures to properties of the nucleus","comments":"29 pages, 9 figures, Chapter in press for the book Comets III, edited\n  by K. Meech and M. Combi, University of Arizona Press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deriving properties of cometary nuclei from coma data is of significant\nimportance for our understanding of cometary activity and has implications\nbeyond. Ground-based data represent the bulk of measurements available for\ncomets. Yet, to date these observations only access a comet's gas and dust coma\nat rather large distances from the surface and do not directly observe its\nsurface. In contrast, spacecraft missions are one of the only tools that gain\ndirect access to surface measurements. However, such missions are limited to\nroughly one per decade. We can overcome these challenges by recognising that\nthe coma contains information about the nucleus's properties. In particular,\nthe near-surface gas environment is most representative of the nucleus. It can\ninform us about the composition, regionality of activity, and sources of coma\nfeatures and how they link to the topography, morphology, or other surface\nproperties. The inner coma data is a particularly good proxy because it has not\nyet, or only marginally, been contaminated by coma chemistry or secondary gas\nsources. Additionally, the simultaneous observation of the innermost coma with\nthe surface provides the potential to make a direct link between coma\nmeasurements and the nucleus. If we hope to link outer coma measurements\nobtained by Earth-based telescopes to the surface, we must first understand how\nthe inner coma measurements are linked to the surface. Numerical models that\ndescribe the flow from the surface into the immediate surroundings are needed\nto make this connection. This chapter focuses on the advances made to\nunderstand the flow of the neutral gas coma from the surface to distances up to\na few tens of nuclei radii. We describe both simple/heuristic models and\nstate-of-the-art physically consistent models. Model limitations and what they\neach are best suited for are discussed.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Marschall","Raphael",""],["Davidsson","Bj\u00f6rn J. R.",""],["Rubin","Martin",""],["Tenishev","Valeriy",""]]}
{"id":"2308.05798","submitter":"Tianshu Wang","authors":"Adam Burrows, David Vartanyan, Tianshu Wang","title":"Black-Hole Formation Accompanied by the Supernova Explosion of a\n  40-M$_{\\odot}$ Progenitor Star","comments":"23 pages, 15 figures. Submitted to the Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have simulated the collapse and evolution of the core of a\nsolar-metallicity 40-M$_{\\odot}$ star and find that it explodes vigorously by\nthe neutrino mechanism. This despite its very high ``compactness\". Within\n$\\sim$1.5 seconds of explosion, a black hole forms. The explosion is very\nasymmetrical and has a total explosion energy of $\\sim$1.6$\\times$10$^{51}$\nergs. At black hole formation, its baryon mass is $\\sim$2.434 M$_{\\odot}$ and\ngravitational mass is 2.286 M$_{\\odot}$. Seven seconds after black hole\nformation an additional $\\sim$0.2 M$_{\\odot}$ is accreted, leaving a black hole\nbaryon mass of $\\sim$2.63 M$_{\\odot}$. A disk forms around the proto-neutron\nstar, from which a pair of neutrino-driven jets emanates. These jets accelerate\nsome of the matter up to speeds of $\\sim$45,000 km s$^{-1}$ and contain matter\nwith entropies of $\\sim$50. The large spatial asymmetry in the explosion\nresults in a residual black hole recoil speed of $\\sim$1000 km s$^{-1}$. This\nnovel black-hole formation channel now joins the other black-hole formation\nchannel between $\\sim$12 and $\\sim$15 M$_{\\odot}$ discovered previously and\nimplies that the black-hole/neutron-star birth ratio for solar-metallicity\nstars could be $\\sim$20%. However, one channel leaves black holes in perhaps\nthe $\\sim$5-15 M$_{\\odot}$ range with low kick speeds, while the other leaves\nblack holes in $\\sim$2.5 M$_{\\odot}$ mass range with high kick speeds. This\nexotic channel of lower-mass black hole formation, accompanied by a very\nasymmetrical supernova explosion, reveals the importance of performing detailed\nand fully 3D simulations in order to determine the mapping of initial states to\noutcomes in the core-collapse context.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Burrows","Adam",""],["Vartanyan","David",""],["Wang","Tianshu",""]]}
{"id":"2308.05799","submitter":"Bowen Fu","authors":"Bowen Fu, Stephen F. King, Luca Marsili, Silvia Pascoli, Jessica\n  Turner, and Ye-Ling Zhou","title":"Testing Realistic $SO(10)$ SUSY GUTs with Proton Decay and Gravitational\n  Waves","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"IPPP/23/41","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a comprehensive analysis of a supersymmetric $SO(10)$ Grand\nUnified Theory, which is broken to the Standard Model via the breaking of two\nintermediate symmetries. The spontaneous breaking of the first intermediate\nsymmetry, $B-L$, leads to the generation of cosmic strings and right-handed\nneutrino masses and further to an observable cosmological background of\ngravitational waves and generation of light neutrino masses via type-I seesaw\nmechanism. Supersymmetry breaking manifests as sparticle masses below the $B-L$\nbreaking but far above the electroweak scale due to proton decay limits. This\nnaturally pushes the $B-L$ breaking scale close to the GUT scale, leading to\nthe formation of metastable cosmic strings, which can provide a gravitational\nwave spectrum consistent with the recent Pulsar Timing Arrays observation. We\nperform a detailed analysis of this model using two-loop renormalisation group\nequations, including threshold corrections, to determine the symmetry-breaking\nscale consistent with the recent Pulsar Timing Arrays signals such as NANOGrav\n15-year data and testable by the next-generation limits on proton decay from\nHyper-K and JUNO. Simultaneously, we find the regions of the model parameter\nspace that can predict the measured quark and lepton masses and mixing, baryon\nasymmetry of our Universe, a viable dark matter candidate and can be tested by\na combination of neutrinoless double beta decay searches and limits on the sum\nof neutrinos masses.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fu","Bowen",""],["King","Stephen F.",""],["Marsili","Luca",""],["Pascoli","Silvia",""],["Turner","Jessica",""],["Zhou","Ye-Ling",""]]}
{"id":"2308.05800","submitter":"Laura Keating","authors":"Laura C. Keating, James S. Bolton, Fergus Cullen, Martin G. Haehnelt,\n  Ewald Puchwein and Girish Kulkarni","title":"JWST observations of galaxy damping wings during reionization\n  interpreted with cosmological simulations","comments":"13 pages, 7 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":"  Spectra of the highest redshift galaxies taken with JWST are now allowing us\nto see into the heart of the reionization epoch. Many of these observed\ngalaxies exhibit strong damping wing absorption redward of their Lyman-$\\alpha$\nemission. These observations have been used to measure the redshift evolution\nof the neutral fraction of the intergalactic medium and sizes of ionized\nbubbles. However, these estimates have been made using a simple analytic model\nfor the intergalactic damping wing. We explore the recent observations with\nmodels of inhomogeneous reionization from the Sherwood-Relics simulation suite.\nWe carry out a comparison between the damping wings calculated from the\nsimulations and from the analytic model. We find that although the agreement is\ngood on the red side of the Lyman-$\\alpha$ emission, there is a discrepancy on\nthe blue side due to residual neutral hydrogen present in the simulations,\nwhich saturates the intergalactic absorption. For this reason, we find that it\nis difficult to reproduce the claimed observations of large bubble sizes at z ~\n7, which are driven by a detection of transmitted flux blueward of the\nLyman-$\\alpha$ emission. We suggest instead that the observations can be\nexplained by a model with smaller ionized bubbles and larger intrinsic\nLyman-$\\alpha$ emission from the host galaxy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Keating","Laura C.",""],["Bolton","James S.",""],["Cullen","Fergus",""],["Haehnelt","Martin G.",""],["Puchwein","Ewald",""],["Kulkarni","Girish",""]]}
{"id":"2308.05801","submitter":"Matthew Hopkins","authors":"Matthew J. Hopkins, Chris Lintott, Michele T. Bannister, J. Ted\n  Mackereth, and John C. Forbes","title":"The Galactic Interstellar Object Population: A Framework for Prediction\n  and Inference","comments":"Submitted to AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Milky Way is thought to host a huge population of interstellar objects\n(ISOs), numbering approximately $10^{15}\\mathrm{pc}^{-3}$ around the Sun, which\nare formed and shaped by a diverse set of processes ranging from planet\nformation to galactic dynamics. We define a novel framework: firstly to predict\nthe properties of this Galactic ISO population by combining models of processes\nacross planetary and galactic scales, and secondly to make inferences about the\nprocesses modelled, by comparing the predicted population to what is observed.\nWe predict the spatial and compositional distribution of the Galaxy's\npopulation of ISOs by modelling the Galactic stellar population with data from\nthe APOGEE survey and combining this with a protoplanetary disk chemistry\nmodel. Selecting ISO water mass fraction as an example observable quantity, we\nevaluate its distribution both at the position of the Sun and averaged over the\nGalactic disk; our prediction for the Solar neighbourhood is compatible with\nthe inferred water mass fraction of 2I/Borisov. We show that the well-studied\nGalactic stellar metallicity gradient has a corresponding ISO compositional\ngradient. We also demonstrate the inference part of the framework by using the\ncurrent observed ISO composition distribution to constrain the parent star\nmetallicity dependence of the ISO production rate. This constraint, and other\ninferences made with this framework, will improve dramatically as the Vera C.\nRubin Observatory Legacy Survey of Space and Time (LSST) progresses and more\nISOs are observed. Finally, we explore generalisations of this framework to\nother Galactic populations, such as that of exoplanets.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hopkins","Matthew J.",""],["Lintott","Chris",""],["Bannister","Michele T.",""],["Mackereth","J. Ted",""],["Forbes","John C.",""]]}
{"id":"2308.05802","submitter":"Adel Bilal","authors":"Manojna Namuduri and Adel Bilal","title":"Effective gravitational action for 2D massive Majorana fermions on\n  arbitrary genus Riemann surfaces","comments":"94 pages, 1 figure, references added, minor corrections","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 explore the effective gravitational action for two-dimensional massive\nEuclidean Majorana fermions in a small mass expansion, continuing and\ncompleting the study initiated in a previous paper. We perform a detailed\nanalysis of local zeta functions, heat kernels, and Green's functions of the\nDirac operator on arbitrary Riemann surfaces. We obtain the full expansion of\nthe effective gravitational action to all orders in $m^2$. For genus one and\nlarger, this requires the understanding of the role of the zero-modes of the\n(massless) Dirac operator which is worked out.\n  Besides the Liouville action, at order $m^0$, which only involves the\nbackground metric and the conformal factor $\\sigma$, the various contributions\nto the effective gravitational action at higher orders in $m^2$ can be\nexpressed in terms of integrals of the renormalized Green's function at\ncoinciding points of the squared (massless) Dirac operator, as well as of\nhigher Green's functions. In particular, at order $m^2$, these contributions\ncan be re-written as a term $\\int e^{2\\sigma}\\, \\sigma$ characteristic of the\nMabuchi action, much as for 2D massive scalars, as well as several other terms\nthat are multi-local in the conformal factor $\\sigma$ and involve the Green's\nfunctions of the massless Dirac operator and the renormalized Green's function,\nbut for the background metric only.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:16 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 12:11:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Namuduri","Manojna",""],["Bilal","Adel",""]]}
{"id":"2308.05803","submitter":"Cissy Suen","authors":"Cissy T Suen, Igor Markovi\\'c, Marta Zonno, Sergey Zhdanovich, Na-Hyun\n  Jo, Michael Schmid, Philipp Hansmann, Pascal Puphal, Katrin F\\\"ursich,\n  Valentin Zimmerman, Steef Smit, Christine Au-Yeung, Berend Zwartsenberg,\n  Maximilian Krautloher, Ilya S Elfimov, Roland Koch, Sergey Gorovikov, Chris\n  Jozwiak, Aaron Bostwick, Eli Rotenberg, Bernhard Keimer, and Andrea\n  Damascelli","title":"Nature of the current-induced insulator-to-metal transition in\n  Ca$_2$RuO$_4$ as revealed by transport-ARPES","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Mott insulator Ca$_2$RuO$_4$ exhibits a rare insulator-to-metal\ntransition (IMT) induced by DC current. While structural changes associated\nwith this transition have been tracked by neutron diffraction, Raman\nscattering, and x-ray spectroscopy, work on elucidating the response of the\nelectronic degrees of freedom is still in progress. Here we unveil the\ncurrent-induced modifications of the electronic states of Ca$_2$RuO$_4$ by\nemploying angle-resolved photoemission spectroscopy (ARPES) in conjunction with\nfour-probe transport. Two main effects emerge: a clear reduction of the Mott\ngap and a modification in the dispersion of the Ru-bands. The changes in\ndispersion occur exclusively along the $XM$ high-symmetry direction, parallel\nto the $b$-axis where the greatest in-plane lattice change occurs. These\nexperimental observations are reflected in dynamical mean-field theory (DMFT)\ncalculations simulated exclusively from the current-induced lattice constants,\nindicating a current driven structural transition as the primary mechanism of\nthe IMT. Furthermore, we demonstrate this phase is distinct from the\nhigh-temperature zero-current metallic phase. Our results provide insight into\nthe elusive nature of the current-induced IMT of Ca$_2$RuO$_4$ and advance the\nchallenging, yet powerful, technique of transport-ARPES.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:00:21 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 22:04:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Suen","Cissy T",""],["Markovi\u0107","Igor",""],["Zonno","Marta",""],["Zhdanovich","Sergey",""],["Jo","Na-Hyun",""],["Schmid","Michael",""],["Hansmann","Philipp",""],["Puphal","Pascal",""],["F\u00fcrsich","Katrin",""],["Zimmerman","Valentin",""],["Smit","Steef",""],["Au-Yeung","Christine",""],["Zwartsenberg","Berend",""],["Krautloher","Maximilian",""],["Elfimov","Ilya S",""],["Koch","Roland",""],["Gorovikov","Sergey",""],["Jozwiak","Chris",""],["Bostwick","Aaron",""],["Rotenberg","Eli",""],["Keimer","Bernhard",""],["Damascelli","Andrea",""]]}
{"id":"2308.05804","submitter":"Prabhat Solanki","authors":"Biplob Bhattacherjee, Prabhat Solanki","title":"Search for Electroweakinos in R-Parity Violating SUSY with Long-Lived\n  Particles at HL-LHC","comments":"43 pages, 16 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the R-parity violating (RPV) supersymmetric (SUSY) model at\nthe High-Luminosity Large Hadron Collider (HL-LHC) in the context of compact\nmuon solenoid (CMS) experiment assuming a total integrated luminosity of\n$\\mathcal{L}=3000~\\text{fb}^{-1}$ at $\\sqrt{s}=$ 14 TeV. We focus on the pair\nproduction of electroweakinos, specifically, $\\chi_2^0$ and $\\chi_1^{\\pm}$ in\nwino and higgsino states in a particular scenario where $\\chi_2^0$ and\n$\\chi_1^{\\pm}$ decay into a Higgs boson and W boson, respectively, along the\nlong-lived lightest supersymmetric particle (LSP), $\\chi_1^0$, which decays to\nthree quarks via $\\lambda^{''}$ RPV couplings leading to the prompt as well as\ndisplaced signatures in the final state. To select events at the level-1 (L1)\ntrigger system, we employ dedicated and standard triggers followed by an\noffline analysis integrating information from the tracker, electromagnetic\ncalorimeter (ECAL) and minimum ionising particle (MIP) timing detector (MTD).\nWe observe that wino-like $\\chi_2^0/\\chi_1^{\\pm}$ with a mass of 1900 GeV and\n$\\chi_1^0$ with a mass greater than 800 GeV can be probed across a decay length\nranging from 1 cm to 200 cm. In the case of higgsino-like pair production of\n$\\chi_2^0/\\chi_1^{\\pm}$, we can probe $\\chi_2^0/\\chi_1^{\\pm}$ with a mass of\n1600 GeV, and $\\chi_1^0$ with a mass greater than 700 GeV, across a decay\nlength range of 1 cm to 200 cm.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:01:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bhattacherjee","Biplob",""],["Solanki","Prabhat",""]]}
{"id":"2308.05805","submitter":"Lerato Baidoo Dr","authors":"Lerato Baidoo (1, 2 and 3), Richard A. Perley (1 and 2), Jean Eilek (4\n  and 5), Oleg Smirnov (2 and 6), Valentina Vacca (7), Torsten Ensslin (8) ((1)\n  National Radio Astronomy Observatory, Socorro United States, (2) Center for\n  Radio Astronomy Techniques and Technologies, Rhodes University, Makhanda\n  South Africa, (3) Dunlap Institute for Astronomy and Astrophysics, University\n  of Toronto, Toronto Canada, (4) Physics Department New Mexico Tech, Socorro\n  United States, (5) Adjunct Astronomer at the National Radio Astronomy\n  Observatory, Socorro United States, (6) South African Radio Astronomy\n  Observatory, Cape Town, South Africa, (7) INAF, Observatorio Astronomico di\n  Caligiari, Selargius Italy, (8) Max-Planck-Institute for Astrophysics,\n  Garching Germany)","title":"A Wideband Polarization Observation of Hydra A with the Jansky Very\n  Large Array","comments":"21 pages, 19 figures, Accepted for publication in The Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present results of a wideband high-resolution polarization study of Hydra\nA, one of the most luminous FR I radio galaxies known and amongst the most\nwell-studied. The radio emission from this source displays extremely large\nFaraday rotation measures (RM), ranging from -12300 rad m$^{-2}$ to 5000 rad\nm$^{-2}$, the majority of which are believed to originate from magnetized\nthermal gas external to the radio tails. The radio emission from both tails\nstrongly depolarizes with decreasing frequency. The depolarization, as a\nfunction of wavelength, is commonly non-monotonic, often showing oscillatory\nbehavior, with strongly non-linear rotation of the polarization position angle\nwith $\\lambda^2$. A simple model, based on the RM screen derived from the high\nfrequency, high resolution data, predicts the lower frequency depolarization\nremarkably well. The success of this model indicates the majority of the\ndepolarization can be attributed to fluctuations in the magnetic field on\nscales $< 1500$ pc, suggesting the presence of turbulent magnetic\nfield/electron density structures on sub-kpc scales within a Faraday rotating\n(FR) medium.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:01:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Baidoo","Lerato","","1, 2 and 3"],["Perley","Richard A.","","1 and 2"],["Eilek","Jean","","4\n  and 5"],["Smirnov","Oleg","","2 and 6"],["Vacca","Valentina",""],["Ensslin","Torsten",""]]}
{"id":"2308.05806","submitter":"Rebecca VanDrunen","authors":"Becca VanDrunen, Juanjuan Ren, Sebastian Franke, Stephen Hughes","title":"Gain-compensated metal cavity modes and a million-fold improvement of\n  Purcell factors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using a rigorous mode theory for gain-compensated plasmonic dimers, we\ndemonstrate how quality factors and Purcell factors can be dramatically\nincreased, improving the quality factors from 10 to over 26,000 and the peak\nPurcell factors from around 3000 to over 10 billion. Full three-dimensional\ncalculations are presented for gold dimers in a finite-size gain medium, which\nallows one to easily surpass fundamental Purcell factor limits of lossy media.\nWithin a regime of linear system response, we show how the Purcell factors are\nmodified from the contributions from the projected local density of states as\nwell as a non-local gain. Further, we show that the effective mode volume and\nradiative beta factors remain relatively constant, despite the significant\nenhancement of the Purcell factors.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:02:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["VanDrunen","Becca",""],["Ren","Juanjuan",""],["Franke","Sebastian",""],["Hughes","Stephen",""]]}
{"id":"2308.05807","submitter":"Gabriel Hoerning","authors":"Gabriel A. Hoerning, Ricardo G. Landim, Luiza O. Ponte, Raphael P.\n  Rolim, Filipe B. Abdalla, Elcio Abdalla","title":"Constraints on interacting dark energy revisited: alleviating the Hubble\n  tension","comments":"11 pages, 4 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we have revisited a class of coupled dark energy models where\ndark energy interacts with dark matter via phenomenological interactions. We\nincluded correction terms on the perturbation equations taking into account the\nperturbation of the Hubble rate, absent in previous works. We also consider\nmore recent data sets such as cosmic microwave background anisotropies from\n\\textit{Planck} 2018, type I-a supernovae measurements from Pantheon+ and data\nfrom baryon acoustic oscillations, and redshift space distortions. We analyzed\nthe influence of the SH0ES Cepheid host distances on the results and for one\nmodel the discrepancy of $H_0$ is reduced to $1.3\\sigma$ when compared to\n$\\Lambda$CDM and $4.6\\sigma$ when compared to the SH0ES team.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:03:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hoerning","Gabriel A.",""],["Landim","Ricardo G.",""],["Ponte","Luiza O.",""],["Rolim","Raphael P.",""],["Abdalla","Filipe B.",""],["Abdalla","Elcio",""]]}
{"id":"2308.05808","submitter":"Veronika Prokhorchuk","authors":"Piotr W. Nowak, Andriy Oliynyk and Veronika Prokhorchuk","title":"On (bi)reversible automata generating lamplighter groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For any nontrivial abelian group $\\mathbb{X}$ we construct a reversible\n(bireversible in case the order of $\\mathbb{X}$ is odd) automaton such that its\nset of states and alphabet are identified with $\\mathbb{X}$, transition and\noutput functions are defined via the left and the right regular actions\ncorrespondingly and its group splits into the restricted wreath product\n$\\mathbb{X} \\wr \\mathbb{Z}$, i.e. is a lamplighter group.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:06:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Nowak","Piotr W.",""],["Oliynyk","Andriy",""],["Prokhorchuk","Veronika",""]]}
{"id":"2308.05809","submitter":"Yihao Liu","authors":"Yihao Liu, Amir Kheradmand, Mehran Armand","title":"Toward Process Controlled Medical Robotic System","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Medical errors, defined as unintended acts either of omission or commission\nthat cause the failure of medical actions, are the third leading cause of death\nin the United States. The application of autonomy and robotics can alleviate\nsome causes of medical errors by improving accuracy and providing means to\npreciously follow planned procedures. However, for the robotic applications to\nimprove safety, they must maintain constant operating conditions in the\npresence of disturbances, and provide reliable measurements, evaluation, and\ncontrol for each state of the procedure. This article addresses the need for\nprocess control in medical robotic systems, and proposes a standardized design\ncycle toward its automation. Monitoring and controlling the changing conditions\nin a medical or surgical environment necessitates a clear definition of\nworkflows and their procedural dependencies. We propose integrating process\ncontrol into medical robotic workflows to identify change in states of the\nsystem and environment, possible operations, and transitions to new states.\nTherefore, the system translates clinician experiences and procedure workflows\ninto machine-interpretable languages. The design cycle using hFSM formulation\ncan be a deterministic process, which opens up possibilities for higher-level\nautomation in medical robotics. Shown in our work, with a standardized design\ncycle and software paradigm, we pave the way toward controlled workflows that\ncan be automatically generated. Additionally, a modular design for a robotic\nsystem architecture that integrates hFSM can provide easy software and hardware\nintegration. This article discusses the system design, software implementation,\nand example application to Robot-Assisted Transcranial Magnetic Stimulation and\nrobot-assisted femoroplasty. We also provide assessments of these two system\nexamples by testing their robotic tool placement.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:07:38 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Yihao",""],["Kheradmand","Amir",""],["Armand","Mehran",""]]}
{"id":"2308.05810","submitter":"Anatole Moureaux","authors":"Anatole Moureaux and Chlo\\'e Chopin and Laurent Jacques and Flavio\n  Abreu Araujo","title":"Spintronics for image recognition : performance benchmarking via\n  ultrafast data-driven simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a demonstration of image classification using a hardware-based\necho-state network (ESN) that relies on spintronic nanostructures known as\nvortex-based spin-torque oscillators (STVOs). Our network is realized using a\nsingle STVO multiplexed in time. To circumvent the challenges associated with\nrepeated experimental manipulation of such a nanostructured system, we employ\nan ultrafast data-driven simulation framework called the data-driven Thiele\nequation approach (DD-TEA) to simulate the STVO dynamics. We use this approach\nto efficiently develop, optimize and test an STVO-based ESN for image\nclassification using the MNIST dataset. We showcase the versatility of our\nsolution by successfully applying it to solve classification challenges with\nthe EMNIST-letters and Fashion MNIST datasets. Through our simulations, we\ndetermine that within a large ESN the results obtained using the STVO dynamics\nas an activation function are comparable to the ones obtained with other\nconventional nonlinear activation functions like the reLU and the sigmoid.\nWhile achieving state-of-the-art accuracy levels on the MNIST dataset, our\nmodel's performance on EMNIST-letters and Fashion MNIST is lower due to the\nrelative simplicity of the system architecture and the increased complexity of\nthe tasks. We expect that the DD-TEA framework will enable the exploration of\nmore specialized neural architectures, ultimately leading to improved\nclassification accuracy. This approach also holds promise for investigating and\ndeveloping dedicated learning rules to further enhance classification\nperformance.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:09:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Moureaux","Anatole",""],["Chopin","Chlo\u00e9",""],["Jacques","Laurent",""],["Araujo","Flavio Abreu",""]]}
{"id":"2308.05811","submitter":"Fatim Zahra Mouhib","authors":"F. Mouhib, Z. Xie, A. Atila, J. Gu\\'enol\\'e, S. Korte-Kerzel, T.\n  Al-Samman","title":"Atomistic insights into texture, segregation, and binding in magnesium\n  alloys","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study aims at illuminating different solute effects, by comparing RE and\nCa solute additions to binary and ternary MgXZn alloys. A multi-scale approach\nfeatureing atom probe tomography and ab initio calculations was employed. In\nterms of texture, a pole spread in both RD and TD was observed in binary MgCa\nalloys, whileMgGd shows a pronounced RD split and no TD texture component.\nHowever, Zn additions to MgGd lead to a dominant TD pole spread, while the\ncounterpart Ca ternary alloy is less effected by Zn additions. A complementary\ntrend in segregation was observed by atom probe tomography, showing a\nsignificant Ca segregation in binary systems. However, the Ca segregation was\nnot effected by the addition of Zn, while added to MgGd, Zn greatly increases\nthe Gd segregation, and significant Zn segregation can be observed. A possible\nreason was identified by ab initio calculations, which showed significant\ndifferences in binding energies. High binding energies between Ca and vacancies\nwere observed, indicating that Ca, rather than Gd, preferably segregates to\ndefect-rich regions, e.g., grain boundaries. However, in the ternary state\nGd-Zn binding was found to be more favorable than Ca-Zn binding, indicating\nstrong ternary effects in MgGdZn.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:12:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mouhib","F.",""],["Xie","Z.",""],["Atila","A.",""],["Gu\u00e9nol\u00e9","J.",""],["Korte-Kerzel","S.",""],["Al-Samman","T.",""]]}
{"id":"2308.05812","submitter":"Arnab Hazra","authors":"Arnab Hazra, Pratik Nag, Rishikesh Yadav, Ying Sun","title":"Exploring the Efficacy of Statistical and Deep Learning Methods for\n  Large Spatial Datasets: A Case Study","comments":"34 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increasingly large and complex spatial datasets pose massive inferential\nchallenges due to high computational and storage costs. Our study is motivated\nby the KAUST Competition on Large Spatial Datasets 2023, which tasked\nparticipants with estimating spatial covariance-related parameters and\npredicting values at testing sites, along with uncertainty estimates. We\ncompared various statistical and deep learning approaches through\ncross-validation and ultimately selected the Vecchia approximation technique\nfor model fitting. To overcome the constraints in the R package GpGp, which\nlacked support for fitting zero-mean Gaussian processes and direct uncertainty\nestimation-two things that are necessary for the competition, we developed\nadditional \\texttt{R} functions. Besides, we implemented certain\nsubsampling-based approximations and parametric smoothing for skewed sampling\ndistributions of the estimators. Our team DesiBoys secured victory in two out\nof four sub-competitions, validating the effectiveness of our proposed\nstrategies. Moreover, we extended our evaluation to a large real spatial\nsatellite-derived dataset on total precipitable water, where we compared the\npredictive performances of different models using multiple diagnostics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:13:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hazra","Arnab",""],["Nag","Pratik",""],["Yadav","Rishikesh",""],["Sun","Ying",""]]}
{"id":"2308.05813","submitter":"Saeid Pakravan","authors":"Saeid Pakravan, Jean-Yves Chouinard, Xingwang Li, Ming Zeng, Wanming\n  Hao, Quoc-Viet Pham and Octavia A. Dobre","title":"Physical Layer Security for NOMA Systems: Requirements, Issues, and\n  Recommendations","comments":"17 pages, 4 figures","journal-ref":"IEEE Internet of Things Journal","doi":"10.1109/JIOT.2023.3296319","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Non-orthogonal multiple access (NOMA) has been viewed as a potential\ncandidate for the upcoming generation of wireless communication systems.\nComparing to traditional orthogonal multiple access (OMA), multiplexing users\nin the same time-frequency resource block can increase the number of served\nusers and improve the efficiency of the systems in terms of spectral\nefficiency. Nevertheless, from a security view-point, when multiple users are\nutilizing the same time-frequency resource, there may be concerns regarding\nkeeping information confidential. In this context, physical layer security\n(PLS) has been introduced as a supplement of protection to conventional\nencryption techniques by making use of the random nature of wireless\ntransmission media for ensuring communication secrecy. The recent years have\nseen significant interests in PLS being applied to NOMA networks. Numerous\nscenarios have been investigated to assess the security of NOMA systems,\nincluding when active and passive eavesdroppers are present, as well as when\nthese systems are combined with relay and reconfigurable intelligent surfaces\n(RIS). Additionally, the security of the ambient backscatter (AmB)-NOMA systems\nare other issues that have lately drawn a lot of attention. In this paper, a\nthorough analysis of the PLS-assisted NOMA systems research state-of-the-art is\npresented. In this regard, we begin by outlining the foundations of NOMA and\nPLS, respectively. Following that, we discuss the PLS performances for NOMA\nsystems in four categories depending on the type of the eavesdropper, the\nexistence of relay, RIS, and AmB systems in different conditions. Finally, a\nthorough explanation of the most recent PLS-assisted NOMA systems is given.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:18:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Pakravan","Saeid",""],["Chouinard","Jean-Yves",""],["Li","Xingwang",""],["Zeng","Ming",""],["Hao","Wanming",""],["Pham","Quoc-Viet",""],["Dobre","Octavia A.",""]]}
{"id":"2308.05814","submitter":"Arvind K. Saibaba","authors":"Arvind K. Saibaba and Agnieszka Mi\\k{e}dlar","title":"Randomized low-rank approximations beyond Gaussian random matrices","comments":"37 pages, appendix is really supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper expands the analysis of randomized low-rank approximation beyond\nthe Gaussian distribution to four classes of random matrices: (1) independent\nsub-Gaussian entries, (2) independent sub-Gaussian columns, (3) independent\nbounded columns, and (4) independent columns with bounded second moment. Using\na novel interpretation of the low-rank approximation error involving sample\ncovariance matrices, we provide insight into the requirements of a \\textit{good\nrandom matrix} for the purpose of randomized low-rank approximation. Although\nour bounds involve unspecified absolute constants (a consequence of the\nunderlying non-asymptotic theory of random matrices), they allow for\nqualitative comparisons across distributions. The analysis offers some details\non the minimal number of samples (the number of columns $\\ell$ of the random\nmatrix $\\boldsymbol\\Omega$) and the error in the resulting low-rank\napproximation. We illustrate our analysis in the context of the randomized\nsubspace iteration method as a representative algorithm for low-rank\napproximation, however, all the results are broadly applicable to other\nlow-rank approximation techniques. We conclude our discussion with numerical\nexamples using both synthetic and real-world test matrices.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:30:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Saibaba","Arvind K.",""],["Mi\u0119dlar","Agnieszka",""]]}
{"id":"2308.05815","submitter":"Veronika Prokhorchuk","authors":"Andriy Oliynyk and Veronika Prokhorchuk","title":"On exponentiation, $p$-automata and HNN extensions of free abelian\n  groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For every prime $p$ it is shown that a wide class of HNN extensions of free\nabelian groups admit faithful representation by finite $p$-automata.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:31:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Oliynyk","Andriy",""],["Prokhorchuk","Veronika",""]]}
{"id":"2308.05816","submitter":"Johannes Buchner","authors":"Johannes Buchner","title":"Snowballing Nested Sampling","comments":"Accepted as a proceeding for MaxEnt2023. A central-limit-theorem-like\n  result for nested sampling","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO stat.ME","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A new way to run nested sampling, combined with realistic MCMC proposals to\ngenerate new live points, is presented. Nested sampling is run with a fixed\nnumber of MCMC steps. Subsequently, snowballing nested sampling extends the run\nto more and more live points. This stabilizes MCMC proposals over time, and\nleads to pleasant properties, including that the number of live points and\nnumber of MCMC steps do not have to be calibrated, that the evidence and\nposterior approximation improves as more compute is added and can be diagnosed\nwith convergence diagnostics from the MCMC literature. Snowballing nested\nsampling converges to a ``perfect'' nested sampling run with infinite number of\nMCMC steps.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:33:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Buchner","Johannes",""]]}
{"id":"2308.05817","submitter":"Andrea Munaro","authors":"Nick Brettell and Andrea Munaro and Dani\\\"el Paulusma and Shizhou Yang","title":"Comparing Width Parameters on Graph Classes","comments":"31 pages, 4 figures, abstract shortened due to arXiv requirements","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study how the relationship between non-equivalent width parameters changes\nonce we restrict to some special graph class. As width parameters, we consider\ntreewidth, clique-width, twin-width, mim-width, sim-width and tree-independence\nnumber, whereas as graph classes we consider $K_{t,t}$-subgraph-free graphs,\nline graphs and their common superclass, for $t \\geq 3$, of $K_{t,t}$-free\ngraphs.\n  We first provide a complete comparison when restricted to\n$K_{t,t}$-subgraph-free graphs, showing in particular that treewidth,\nclique-width, mim-width, sim-width and tree-independence number are all\nequivalent. This extends a result of Gurski and Wanke (2000) stating that\ntreewidth and clique-width are equivalent for the class of\n$K_{t,t}$-subgraph-free graphs.\n  Next, we provide a complete comparison when restricted to line graphs,\nshowing in particular that, on any class of line graphs, clique-width,\nmim-width, sim-width and tree-independence number are all equivalent, and\nbounded if and only if the class of root graphs has bounded treewidth. This\nextends a resut of Gurski and Wanke (2007) stating that a class of\ngraphs~${\\cal G}$ has bounded treewidth if and only if the class of line graphs\nof graphs in ${\\cal G}$ has bounded clique-width.\n  We then provide an almost-complete comparison for $K_{t,t}$-free graphs,\nleaving one missing case. Our main result is that $K_{t,t}$-free graphs of\nbounded mim-width have bounded tree-independence number. This result has\nstructural and algorithmic consequences. In particular, it proves a special\ncase of a conjecture of Dallard, Milani\\v{c} and \\v{S}torgel.\n  Finally, we consider the question of whether boundedness of a certain width\nparameter is preserved under graph powers. We show that the question has a\npositive answer for sim-width precisely in the case of odd powers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:34:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Brettell","Nick",""],["Munaro","Andrea",""],["Paulusma","Dani\u00ebl",""],["Yang","Shizhou",""]]}
{"id":"2308.05818","submitter":"Unay Dorken Gallastegi","authors":"Unay Dorken Gallastegi, Hoover Rueda-Chacon, Martin J. Stevens, and\n  Vivek K Goyal","title":"Absorption-Based, Passive Range Imaging from Hyperspectral Thermal\n  Measurements","comments":"15 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Passive hyperspectral long-wave infrared measurements are remarkably\ninformative about the surroundings, such as remote object material composition,\ntemperature, and range; and air temperature and gas concentrations. Remote\nobject material and temperature determine the spectrum of thermal radiance, and\nrange, air temperature, and gas concentrations determine how this spectrum is\nmodified by propagation to the sensor. We computationally separate these\nphenomena, introducing a novel passive range imaging method based on\natmospheric absorption of ambient thermal radiance. Previously demonstrated\npassive absorption-based ranging methods assume hot and highly emitting\nobjects. However, the temperature variation in natural scenes is usually low,\nmaking range imaging challenging. Our method benefits from explicit\nconsideration of air emission and parametric modeling of atmospheric\nabsorption. To mitigate noise in low-contrast scenarios, we jointly estimate\nrange and intrinsic object properties by exploiting a variety of absorption\nlines spread over the infrared spectrum. Along with Monte Carlo simulations\nthat demonstrate the importance of regularization, temperature differentials,\nand availability of many spectral bands, we apply this method to long-wave\ninfrared (8--13 $\\mu$m) hyperspectral image data acquired from natural scenes\nwith no active illumination. Range features from 15m to 150m are recovered,\nwith good qualitative match to unaligned lidar data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:35:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gallastegi","Unay Dorken",""],["Rueda-Chacon","Hoover",""],["Stevens","Martin J.",""],["Goyal","Vivek K",""]]}
{"id":"2308.05819","submitter":"Abdallah Alsammani","authors":"Abdallah Alsammani","title":"Stochastic modeling and computational simulations of HBV infection\n  dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates the stochastic dynamics of hepatitis B virus (HBV)\ninfection using a newly proposed stochastic model. Contrary to deterministic\nmodels that fail to encapsulate the inherent randomness and fluctuations in\nbiological processes, our stochastic model provides a more realistic\nrepresentation of HBV infection dynamics. It incorporates random variability,\nthereby acknowledging the changes in viral and cellular populations and\nuncertainties in parameters such as infection rates and immune responses. We\nexamine the solution's existence, uniqueness, and positivity for the proposed\nmodel, followed by a comprehensive stability analysis. We provide the necessary\nand sufficient conditions for local and global stability, offering deep insight\ninto the infection dynamics. Furthermore, we utilize numerical simulations to\ncorroborate our theoretical results. This research provides a robust tool to\nunderstand the complex behavior of HBV dynamics, which significantly\ncontributes to the ongoing quest for more effective HBV control and prevention\nstrategies.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:38:36 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Alsammani","Abdallah",""]]}
{"id":"2308.05820","submitter":"Filipe Cordeiro","authors":"Daniel Rosa, Filipe R. Cordeiro, Ruan Carvalho, Everton Souza, Sergio\n  Chevtchenko, Luiz Rodrigues, Marcelo Marinho, Thales Vieira and Valmir\n  Macario","title":"Recognizing Handwritten Mathematical Expressions of Vertical Addition\n  and Subtraction","comments":"Paper accepted at SIBGRAPI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Handwritten Mathematical Expression Recognition (HMER) is a challenging task\nwith many educational applications. Recent methods for HMER have been developed\nfor complex mathematical expressions in standard horizontal format. However,\nsolutions for elementary mathematical expression, such as vertical addition and\nsubtraction, have not been explored in the literature. This work proposes a new\nhandwritten elementary mathematical expression dataset composed of addition and\nsubtraction expressions in a vertical format. We also extended the MNIST\ndataset to generate artificial images with this structure. Furthermore, we\nproposed a solution for offline HMER, able to recognize vertical addition and\nsubtraction expressions. Our analysis evaluated the object detection algorithms\nYOLO v7, YOLO v8, YOLO-NAS, NanoDet and FCOS for identifying the mathematical\nsymbols. We also proposed a transcription method to map the bounding boxes from\nthe object detection stage to a mathematical expression in the LATEX markup\nsequence. Results show that our approach is efficient, achieving a high\nexpression recognition rate. The code and dataset are available at\nhttps://github.com/Danielgol/HME-VAS\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:39:35 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rosa","Daniel",""],["Cordeiro","Filipe R.",""],["Carvalho","Ruan",""],["Souza","Everton",""],["Chevtchenko","Sergio",""],["Rodrigues","Luiz",""],["Marinho","Marcelo",""],["Vieira","Thales",""],["Macario","Valmir",""]]}
{"id":"2308.05821","submitter":"Houjian Yu","authors":"Houjian Yu, Xibai Lou, Yang Yang, and Changhyun Choi","title":"IOSG: Image-driven Object Searching and Grasping","comments":"Accepted to IEEE/RSJ International Conference on Intelligent Robots\n  (IROS 2023). Project page: https://sites.google.com/umn.edu/iosg","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When robots retrieve specific objects from cluttered scenes, such as home and\nwarehouse environments, the target objects are often partially occluded or\ncompletely hidden. Robots are thus required to search, identify a target\nobject, and successfully grasp it. Preceding works have relied on pre-trained\nobject recognition or segmentation models to find the target object. However,\nsuch methods require laborious manual annotations to train the models and even\nfail to find novel target objects. In this paper, we propose an Image-driven\nObject Searching and Grasping (IOSG) approach where a robot is provided with\nthe reference image of a novel target object and tasked to find and retrieve\nit. We design a Target Similarity Network that generates a probability map to\ninfer the location of the novel target. IOSG learns a hierarchical policy; the\nhigh-level policy predicts the subtask type, whereas the low-level policies,\nexplorer and coordinator, generate effective push and grasp actions. The\nexplorer is responsible for searching the target object when it is hidden or\noccluded by other objects. Once the target object is found, the coordinator\nconducts target-oriented pushing and grasping to retrieve the target from the\nclutter. The proposed pipeline is trained with full self-supervision in\nsimulation and applied to a real environment. Our model achieves a 96.0% and\n94.5% task success rate on coordination and exploration tasks in simulation\nrespectively, and 85.0% success rate on a real robot for the search-and-grasp\ntask.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:41:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yu","Houjian",""],["Lou","Xibai",""],["Yang","Yang",""],["Choi","Changhyun",""]]}
{"id":"2308.05822","submitter":"Junxiao Shen Mr","authors":"Junxiao Shen, John Dudley, Per Ola Kristensson","title":"Encode-Store-Retrieve: Enhancing Memory Augmentation through\n  Language-Encoded Egocentric Perception","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We depend on our own memory to encode, store, and retrieve our experiences.\nHowever, memory lapses can occur. One promising avenue for achieving memory\naugmentation is through the use of augmented reality head-mounted displays to\ncapture and preserve egocentric videos, a practice commonly referred to as life\nlogging. However, a significant challenge arises from the sheer volume of video\ndata generated through life logging, as the current technology lacks the\ncapability to encode and store such large amounts of data efficiently. Further,\nretrieving specific information from extensive video archives requires\nsubstantial computational power, further complicating the task of quickly\naccessing desired content. To address these challenges, we propose a memory\naugmentation system that involves leveraging natural language encoding for\nvideo data and storing them in a vector database. This approach harnesses the\npower of large vision language models to perform the language encoding process.\nAdditionally, we propose using large language models to facilitate natural\nlanguage querying. Our system underwent extensive evaluation using the QA-Ego4D\ndataset and achieved state-of-the-art results with a BLEU score of 8.3,\noutperforming conventional machine learning models that scored between 3.4 and\n5.8. Additionally, in a user study, our system received a higher mean response\nscore of 4.13/5 compared to the human participants' score of 2.46/5 on\nreal-life episodic memory tasks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:43:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shen","Junxiao",""],["Dudley","John",""],["Kristensson","Per Ola",""]]}
{"id":"2308.05823","submitter":"Fabio Pasqualetti","authors":"Alberto Maria Nobili, Yuzhen Qin, Carlo Alberto Avizzano, Danielle S.\n  Bassett, and Fabio Pasqualetti","title":"Vibrational Stabilization of Complex Network Systems","comments":null,"journal-ref":"Proceedings of the 2022 American Control Conference, San Diego,\n  May, 2022","doi":"10.23919/ACC55779.2023.10156032","report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many natural and man-made network systems need to maintain certain patterns,\nsuch as working at equilibria or limit cycles, to function properly. Thus, the\nability to stabilize such patterns is crucial. Most of the existing studies on\nstabilization assume that network systems states can be measured online so that\nfeedback control strategies can be used. However, in many real-world scenarios,\nsystems states, e.g., neuronal activity in the brain, are often difficult to\nmeasure. In this paper, we take this situation into account and study the\nstabilization problem of linear network systems with an open-loop control\nstrategy (vibrational control). We derive a graph-theoretic sufficient\ncondition for structural vibrational stabilizability, under which network\nsystems can always be stabilized. We further provide an approach to select the\nlocations in the network for control placement and design corresponding\nvibrational inputs to stabilize systems that satisfy this condition. Finally,\nwe provide some numerical results that demonstrate the validity of our\ntheoretical findings.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:49:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Nobili","Alberto Maria",""],["Qin","Yuzhen",""],["Avizzano","Carlo Alberto",""],["Bassett","Danielle S.",""],["Pasqualetti","Fabio",""]]}
{"id":"2308.05824","submitter":"Gonzalo Cousillas gcousillas","authors":"Gonzalo Cousillas","title":"Shadowing in non-compact spaces with a global attractor","comments":"8 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies the behavior of dynamical systems in non-compact spaces,\nspecifically focusing on the concepts of global attractors and shadowing. Let\n$K$ be a compact global attractor. We show that the shadowing property holds in\ncertain types of dynamical systems in non-compact spaces if and only if $K$ is\ntrivial.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:49:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cousillas","Gonzalo",""]]}
{"id":"2308.05825","submitter":"Yen-Tsung Chen","authors":"Yen-Tsung Chen","title":"A $v$-adic variant of Anderson-Brownawell-Papanikolas linear\n  independence criterion and its application","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\overline{k}$ be a fixed algebraic closure of $k$. When the finite place\n$v$ is of degree one, we show that all $\\overline{k}$-linear relations among\n$v$-adic Carlitz multiple polylogarithms at algebraic points arise from\n$k$-linear relations among these values of the same weight. As an application,\nwe establish a function field analogue of Furusho-Yamashita's conjecture for\n$v$-adic multiple zeta values whenever the degree of the place $v$ is one.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:53:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Yen-Tsung",""]]}
{"id":"2308.05826","submitter":"D. Anish Roshi","authors":"D. Anish Roshi, Phil Perillat, Felix Fernandez, Hamdi Mani, Benetge\n  Perera, P. K. Manoharan, Luis Quintero, Arun Venkataraman","title":"A Cryogenic Wideband (2.5-14 GHz) Receiver system for the Arecibo 12m\n  Telescope","comments":"13 pages, 7 figures, 1 table (submitted for publication)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we present details of the construction of a wideband, cryogenic\nreceiver and its successful commissioning on the Arecibo 12m telescope. The\ncryogenic receiver works in the 2.5-14 GHz frequency range. The telescope is\noperated by the Arecibo Observatory, and is located within the premises of the\nObservatory. We upgraded the current narrow band, room temperature receivers of\nthe telescope with the new wideband receiver. The current receiver is built\naround a Quadruple-Ridged Flared Horn (QRHF) developed by Akgiray et al.\n(2013). To mitigate strong radio frequency interference (RFI) below 2.7 GHz, we\ninstalled a highpass filter before the first stage low noise amplifier (LNA).\nThe QRHF, highpass filter, noise coupler and LNA are located inside a cryostat\nand are cooled to 15 K. The measured receiver temperature is 25 K (median\nvalue) over 2.5 GHz to 14 GHz. The system temperature measured at zenith is\nabout 40 K near 3.1 and 8.6 GHz and the zenith antenna gains are 0.025 and\n0.018 K/Jy at the two frequencies respectively. In the next stage of the\ndevelopment, we plan to upgrade the highpass filter in order to achieve better\nRFI rejection near 2.5 GHz, improve the aperture efficiency at 8.6 GHz and\nupgrade the IF system to increase the upper frequency of operation from 12 GHz\nto 14 GHz.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:59:25 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Roshi","D. Anish",""],["Perillat","Phil",""],["Fernandez","Felix",""],["Mani","Hamdi",""],["Perera","Benetge",""],["Manoharan","P. K.",""],["Quintero","Luis",""],["Venkataraman","Arun",""]]}
{"id":"2308.05827","submitter":"Lenny Fukshansky","authors":"Maxwell Forst and Lenny Fukshansky","title":"On a new absolute version of Siegel's lemma","comments":"15 pages; some minor additions and authorship change","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish a new version of Siegel's lemma over a number field $k$,\nproviding a bound on the maximum of heights of basis vectors of a subspace of\n$k^N$, $N \\geq 2$. In addition to the small-height property, the basis vectors\nwe obtain satisfy certain sparsity condition. Further, we produce a nontrivial\nbound on the heights of all the possible subspaces generated by subcollections\nof these basis vectors. Our bounds are absolute in the sense that they do not\ndepend on the field of definition. The main novelty of our method is that it\nuses only linear algebra and does not rely on the geometry of numbers or the\nDirichlet box principle employed in the previous works on this subject.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:00:31 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 21:38:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Forst","Maxwell",""],["Fukshansky","Lenny",""]]}
{"id":"2308.05828","submitter":"Kevin Pu","authors":"Kevin Pu, Jim Yang, Angel Yuan, Minyi Ma, Rui Dong, Xinyu Wang, Yan\n  Chen, Tovi Grossman","title":"DiLogics: Creating Web Automation Programs With Diverse Logics","comments":null,"journal-ref":null,"doi":"10.1145/3586183.3606822","report-no":null,"categories":"cs.HC cs.AI cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge workers frequently encounter repetitive web data entry tasks, like\nupdating records or placing orders. Web automation increases productivity, but\ntranslating tasks to web actions accurately and extending to new specifications\nis challenging. Existing tools can automate tasks that perform the same logical\ntrace of UI actions (e.g., input text in each field in order), but do not\nsupport tasks requiring different executions based on varied input conditions.\nWe present DiLogics, a programming-by-demonstration system that utilizes NLP to\nassist users in creating web automation programs that handle diverse\nspecifications. DiLogics first semantically segments input data to structured\ntask steps. By recording user demonstrations for each step, DiLogics\ngeneralizes the web macros to novel but semantically similar task requirements.\nOur evaluation showed that non-experts can effectively use DiLogics to create\nautomation programs that fulfill diverse input instructions. DiLogics provides\nan efficient, intuitive, and expressive method for developing web automation\nprograms satisfying diverse specifications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:01:30 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 15:33:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pu","Kevin",""],["Yang","Jim",""],["Yuan","Angel",""],["Ma","Minyi",""],["Dong","Rui",""],["Wang","Xinyu",""],["Chen","Yan",""],["Grossman","Tovi",""]]}
{"id":"2308.05829","submitter":"Nick Doty","authors":"Nick Doty, Mallory Knodel","title":"Slicing the Network: Maintaining Neutrality, Protecting Privacy, and\n  Promoting Competition","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The principles of net neutrality have been essential for maintaining the\ndiversity of services built on top of the internet and for maintaining some\ncompetition between small and large providers of those online services. That\ndiversity and competition, in turn, provide users with a broader array of\nchoices for seeking online content and disseminating their own speech.\nFurthermore, in order for the internet to be used to its full potential and to\nprotect the human rights of internet users, we need privacy from surveillance\nand unwarranted data collection by governments, network providers, and edge\nproviders.\n  The transition to 5G mobile networks enables network operators to engage in a\ntechnique called network slicing. The portion of a network that is sliced can\nbe used to provide a suite of different service offerings, each tailored to\nspecific purposes, instead of a single, general-purpose subscription for mobile\nvoice and data. This requires a careful approach. Our report describes the\ntechnologies used for network slicing and outlines recommendations -- for both\noperators and regulators -- to enable network slicing while maintaining network\nneutrality, protecting privacy, and promoting competition.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:13:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Doty","Nick",""],["Knodel","Mallory",""]]}
{"id":"2308.05830","submitter":"Swayamtrupta Panda","authors":"Swayamtrupta Panda, Paola Marziani","title":"Modelling the quasar spectra for super-Eddington sources -- The What,\n  the Why and the How","comments":"5 pages, 3 figures, version matches the published version in\n  Proceedings of the XLV Annual Meeting of the Brazilian Astronomical Society.\n  arXiv admin note: text overlap with arXiv:2210.15041","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":"  Broad lines in active galaxies are primarily emitted by photoionization\nprocesses that are driven by the incident continuum arising from a complex\ngeometrical structure circumscribing the supermassive black hole. A model of\nthe broad-band spectral energy distribution (SED) effective in ionizing the\ngas-rich broad line emitting region (BLR) is needed to understand the various\nradiative processes that eventually lead to the emission of emission lines from\ndiverse physical conditions. Photoionization codes are a useful tool to\ninvestigate two aspects - the importance of the shape of the SED, and the\nphysical conditions in the BLR. In this work, we focus on the anisotropy of\ncontinuum radiation from the very centre a direct consequence of the\ndevelopment of a funnel-like structure at regions very close to the black hole.\nAccounting for the diversity of Type-1 active galactic nuclei (AGNs) in the\ncontext of the main sequence of quasars permits us to locate the super\nEddington sources along the sequence and constrain the physical conditions of\ntheir line-emitting BLR.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:16:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Panda","Swayamtrupta",""],["Marziani","Paola",""]]}
{"id":"2308.05831","submitter":"Swayamtrupta Panda","authors":"Swayamtrupta Panda, Edi Bon, Paola Marziani, Nata\\v{s}a Bon","title":"Saturation of the curve -- diagnostics of the continuum and H$\\beta$\n  emission in Population B active galaxy NGC 5548","comments":"5 pages, 7 figures, version matches the published version in\n  Proceedings of the XLV Annual Meeting of the Brazilian Astronomical Society.\n  arXiv admin note: substantial text overlap with arXiv:2111.05378","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":"  NGC 5548 has been hailed as an archetypical type-1 active galactic nuclei\n(AGN) and serves as a valuable laboratory to study the long-term variation of\nits broad-line region (BLR). In this work, we re-affirm our finding on the\nconnection between the continuum variability in the optical regime and the\ncorresponding H$\\beta$ response to it, in order to realize the increase, albeit\nwith a gradual saturation, in the H$\\beta$ emitting luminosity with increasing\nAGN continuum. This effect is also known as the Pronik-Chuvaev effect after the\nauthors who first demonstrated this effect using long-term monitoring of\nanother well-studied Type-1 AGN - Mrk 6. We employ a homogeneous,\nmulti-component spectral fitting procedure over a broad range of spectral\nepochs that is then used to create the continuum and H$\\beta$ light curves. We\nfocus on the epoch range 48636-49686 MJD, different from our previous analysis.\nWe again notice a clear signature of shallowing in the trend between the\nH$\\beta$ and the continuum luminosities. We attempt to recover this H$\\beta$\nemission trend as a response to a significant continuum flux increase using\nCLOUDY photoionization simulations and employ a suitable broad-band spectral\nenergy distribution for this source. We explore the wide range in the physical\nparameters space for modelling the H$\\beta$ emission from the BLR appropriate\nfor this source. We employ a constant density, single cloud model approach in\nthis study and successfully recover the observed shallowing of the H$\\beta$\nemission with respect to the rising AGN continuum and provide constraints on\nthe local BLR densities and the location of the H$\\beta$ emitting BLR which\nagrees with the H$\\beta$ time-lags reported from the long-term reverberation\nmapping monitoring. On the contrary, we do not find a significant breathing\neffect in the location of the H$\\beta$ line-emitting BLR for this epoch in NGC\n5548.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:29:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Panda","Swayamtrupta",""],["Bon","Edi",""],["Marziani","Paola",""],["Bon","Nata\u0161a",""]]}
{"id":"2308.05832","submitter":"Ehsanul Kabir","authors":"Ehsanul Kabir and Zeyu Song and Md Rafi Ur Rashid and Shagufta Mehnaz","title":"FLShield: A Validation Based Federated Learning Framework to Defend\n  Against Poisoning Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) is revolutionizing how we learn from data. With its\ngrowing popularity, it is now being used in many safety-critical domains such\nas autonomous vehicles and healthcare. Since thousands of participants can\ncontribute in this collaborative setting, it is, however, challenging to ensure\nsecurity and reliability of such systems. This highlights the need to design FL\nsystems that are secure and robust against malicious participants' actions\nwhile also ensuring high utility, privacy of local data, and efficiency. In\nthis paper, we propose a novel FL framework dubbed as FLShield that utilizes\nbenign data from FL participants to validate the local models before taking\nthem into account for generating the global model. This is in stark contrast\nwith existing defenses relying on server's access to clean datasets -- an\nassumption often impractical in real-life scenarios and conflicting with the\nfundamentals of FL. We conduct extensive experiments to evaluate our FLShield\nframework in different settings and demonstrate its effectiveness in thwarting\nvarious types of poisoning and backdoor attacks including a defense-aware one.\nFLShield also preserves privacy of local data against gradient inversion\nattacks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:29:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kabir","Ehsanul",""],["Song","Zeyu",""],["Rashid","Md Rafi Ur",""],["Mehnaz","Shagufta",""]]}
{"id":"2308.05833","submitter":"Mahyar Karimi","authors":"Mahyar Karimi, Ahmad Abdollahzadeh Barfroush","title":"Proposing a Dynamic Executive Microservices Architecture Model for AI\n  Systems","comments":"7 pages, 4 figures, 3 tables, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.DC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Microservices architecture is one of the new architectural styles that has\nimproved in recent years. It has become a popular architectural style among\nsystem architects and developers. This popularity increased with the advent of\nnew technologies and technological advancements in cloud computing. These\nadvancements caused the emergence of new design and development challenges for\nservice-based software systems. The increasing use of microservices\narchitecture in large organizations and teams has increased the need to find\nappropriate solutions for architecture challenges. Orchestration of the\ncomponents in the microservices architecture is one of the main challenges in\ndistributed systems and affects the software quality in factors such as\nefficiency, compatibility, stability, and reusability. In such systems,\nsoftware architecture consists of fine-grained components. Due to the\nincreasing number of microservices in a large-scale system, proper management\nand communication orchestration of microservice components can become a point\nof failure. In this article, the challenges of Microservices architecture have\nbeen identified. To resolve the component orchestration challenges, an\nappropriate model to maintain and improve quality is proposed. The presented\nmodel, as a pattern, can be used at the both design and development level of\nthe system. The Dynamicity of software at runtime is the main achievement of\nthis pattern. In this model, microservice components orchestration tasks are\nperformed by using a BPMN-based workflow engine as the orchestrator component.\nThe orchestrator design gives the ability to create, track and modify new\ncomposite microservices without the need to change platform infrastructure.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:31:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Karimi","Mahyar",""],["Barfroush","Ahmad Abdollahzadeh",""]]}
{"id":"2308.05834","submitter":"Debraj Chakrabarti","authors":"Debraj Chakrabarti, Isaac Cinzori, Ishani Gaidhane, Jonathan Gregory,\n  Mary Wright","title":"Bergman kernels of Monomial Polyhedra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bergman kernels of monomial polyhedra are explicitly computed. Monomial\npolyhedra are a class of bounded pseudoconvex Reinhardt domains defined as\nsublevel sets of Laurent monomials. Their kernels are rational functions and\nare obtained by an application of Bell's transformation formula.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:32:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chakrabarti","Debraj",""],["Cinzori","Isaac",""],["Gaidhane","Ishani",""],["Gregory","Jonathan",""],["Wright","Mary",""]]}
{"id":"2308.05835","submitter":"Albert Rico Andr\\'es","authors":"Albert Rico and Karol \\.Zyczkowski","title":"Discrete dynamics in the set of quantum measurements","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":"  A quantum measurement, often referred to as positive operator-valued\nmeasurement (POVM), is a set of positive operators $P_i=P_i^\\dag\\geq 0$ summing\nto identity, $\\sum_iP_i=1\\!\\!1$. This can be seen as a generalization of a\nprobability distribution of positive real numbers summing to unity, whose\nevolution is given by a stochastic matrix. From this perspective, we consider\ntransformations of quantum measurements induced by blockwise stochastic\nmatrices, in which each column defines a POVM. These transformations can be\nsimulated with a sequence of two conditional measurements, and their input and\noutput are always jointly measurable. Analyzing dynamics induced by blockwise\nbistochastic matrices, in which both columns and rows sum to the identity, we\nformulate an operator majorization relation between quantum measurements, which\nallows to establish a resource theory in the set of quantum measurements.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:34:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rico","Albert",""],["\u017byczkowski","Karol",""]]}
{"id":"2308.05836","submitter":"Denise Kahl","authors":"Denise Kahl, Antonio Kr\\\"uger","title":"Using Abstract Tangible Proxy Objects for Interaction in Optical\n  See-through Augmented Reality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interaction with virtual objects displayed in Optical See-through Augmented\nReality is still mostly done with controllers or hand gestures. A much more\nintuitive way of interacting with virtual content is to use physical proxy\nobjects to interact with the virtual objects. Here, the virtual model is\nsuperimposed on a physical object, which can then be touched and moved to\ninteract with the virtual object. Since it is not possible to use an exact\nreplica as a tangible proxy object for every use case, we conducted a study to\ndetermine the extent to which the shape of the physical object can deviate from\nthe shape of the virtual object without massively impacting performance and\nusability, as well as the sense of presence. Our study, in which we\ninvestigated different levels of abstraction for a sofa model, shows that the\nphysical proxy object can be abstracted to a certain degree. At the same time,\nour results indicate that the physical object must have at least a similar\nshape as the virtual object in order to serve as a suitable proxy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:34:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kahl","Denise",""],["Kr\u00fcger","Antonio",""]]}
{"id":"2308.05837","submitter":"Shunli Shang","authors":"Shun-Li Shang, Shuang Lin, Michael C. Gao, Darrell G. Schlom, and\n  Zi-Kui Liu","title":"Predictions and correlation analyses of Ellingham diagrams in binary\n  oxides","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowing oxide-forming ability is vital to gain desired or avoid deleterious\noxides formation through tuning oxidizing environment and materials chemistry.\nHere, we have conducted a comprehensive thermodynamic analysis of 137 binary\noxides using the presently predicted Ellingham diagrams. It is found that the\nactive elements to form oxides easily are the f-block elements (lanthanides and\nactinides), elements in the groups II, III, and IV (alkaline earth, Sc, Y, Ti,\nZr, and Hf), and Al and Li; while the noble elements with their oxides\nnonstable and easily reduced are coinage metals (Cu, Ag, and especially Au),\nPt-group elements, and Hg and Se. Machine learning based sequential feature\nselection indicates that oxide-forming ability can be represented by electronic\nstructures of pure elements, for example, their d- and s-valence electrons,\nMendeleev numbers, and the groups, making the periodic table a useful tool to\ntailor oxide-forming ability. The other key elemental features to correlate\noxide-forming ability are thermochemical properties such as melting points and\nstandard entropy at 298 K of pure elements. It further shows that the present\nEllingham diagrams enable qualitatively understanding and even predicting\noxides formed in multicomponent materials, such as the Fe-20Cr-20Ni alloy (in\nwt.%) and the equimolar high entropy alloy of AlCoCrFeNi, which are in\naccordance with thermodynamic calculations using the CALPHAD approach and\nexperimental observations in the literature.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:35:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shang","Shun-Li",""],["Lin","Shuang",""],["Gao","Michael C.",""],["Schlom","Darrell G.",""],["Liu","Zi-Kui",""]]}
{"id":"2308.05838","submitter":"Swayamtrupta Panda","authors":"Swayamtrupta Panda, Alberto Rodr\\'iguez Ardila, Marcos A. Fonseca\n  Faria, Fernando C. Cerqueira-Campos, Murilo Marinello, Luis G. Dahmer-Hahn","title":"What drives the Coronal Lines? Resolving the forbidden, high-ionization\n  emission regions in a sample of AGNs","comments":"3 pages, 1 figure, version matches the published version in\n  Proceedings of the XLV Annual Meeting of the Brazilian Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emission-line studies in the active galactic nuclei (AGNs), particularly\nthose utilizing high spatial resolution, provide the most accurate method to\ndetermine critical quantities of the central engine and of the gas a few tens\nof parsecs away. Using seeing-limited data with spectroscopy, we have explored\nthe extended narrow-line region for a sample of active galactic nuclei (AGNs)\nwith strong, forbidden emission lines that have high-ionization potentials (IP\n$\\gtrsim$ 100 eV). We have studied the optical and near-infrared spectra for\nthese AGNs, extracted and compared their spectral energy distributions, and put\nconstraints on the physical conditions of the region producing the coronal\nlines. We have realized a novel black hole mass scaling relation with one such\nprominent coronal line - [Si VI] 1.963 microns, over the 10$^6$ - 10$^8$\nM$_{\\odot}$ interval, that suggests photoionization by the continuum produced\nby the accretion disk is the primary physical process at play here. We perform\na detailed parameter space study to optimize the emission from these coronal\nlines in terms of fundamental black hole parameters and test predictions that\ncan be used to measure the kinematics of the extended X-ray emission gas. With\nthe successful launch and first light of the JWST, we are well-poised to refine\nour findings using the superb angular resolution of the telescope that will\nallow us to map the inner few parsecs to the central supermassive black holes.\nThis opens up the study of the higher ionization lines that will be spatially\nresolved by JWST, expanding our sample to tens of hundreds of AGNs, and putting\nfirmer constraints on the physical conditions in the coronal line region.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:37:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Panda","Swayamtrupta",""],["Ardila","Alberto Rodr\u00edguez",""],["Faria","Marcos A. Fonseca",""],["Cerqueira-Campos","Fernando C.",""],["Marinello","Murilo",""],["Dahmer-Hahn","Luis G.",""]]}
{"id":"2308.05839","submitter":"Eduard P. Kontar","authors":"Eduard P. Kontar, A. Gordon Emslie, Daniel L. Clarkson, Xingyao Chen,\n  Nicolina Chrysaphi, Francesco Azzollini, Natasha L. S. Jeffrey, and Mykola\n  Gordovskyy","title":"An Anisotropic Density Turbulence Model from the Sun to 1 au Derived\n  From Radio Observations","comments":"27 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar radio bursts are strongly affected by radio-wave scattering on density\ninhomogeneities, changing their observed time characteristics, sizes, and\npositions. The same turbulence causes angular broadening and scintillation of\ngalactic and extra-galactic compact radio sources observed through the solar\natmosphere. Using large-scale simulations of radio-wave transport, the\ncharacteristics of anisotropic density turbulence from $0.1 \\, R_\\odot$ to $1$\nau are explored. For the first time, a profile of heliospheric density\nfluctuations is deduced that accounts for the properties of extra-solar radio\nsources, solar radio bursts, and in-situ density fluctuation measurements in\nthe solar wind at $1$ au. The radial profile of the spectrum-weighted mean\nwavenumber of density fluctuations (a quantity proportional to the scattering\nrate of radio-waves) is found to have a broad maximum at around $(4-7) \\,\nR_\\odot$, where the slow solar wind becomes supersonic. The level of density\nfluctuations at the inner scale (which is consistent with the proton resonance\nscale) decreases with heliocentric distance as $\\langle\\delta{n_i}^2 \\rangle\n(r) \\simeq 2 \\times 10^7 \\, (r/R_\\odot-1)^{-3.7}$ cm$^{-6}$. Due to scattering,\nthe apparent positions of solar burst sources observed at frequencies between\n$0.1$ and $300$ MHz are computed to be essentially cospatial and to have\ncomparable sizes, for both fundamental and harmonic emission. Anisotropic\nscattering is found to account for the shortest solar radio burst decay times\nobserved, and the required wavenumber anisotropy is $q_\\parallel/q_\\perp\n=0.25-0.4$, depending on whether fundamental or harmonic emission is involved.\nThe deduced radio-wave scattering rate paves the way to quantify intrinsic\nsolar radio burst characteristics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:37:41 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:12:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kontar","Eduard P.",""],["Emslie","A. Gordon",""],["Clarkson","Daniel L.",""],["Chen","Xingyao",""],["Chrysaphi","Nicolina",""],["Azzollini","Francesco",""],["Jeffrey","Natasha L. S.",""],["Gordovskyy","Mykola",""]]}
{"id":"2308.05840","submitter":"Siyu Qi","authors":"Siyu Qi, Lahiru D. Chamain, Zhi Ding","title":"End-to-End Optimization of JPEG-Based Deep Learning Process for Image\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Among major deep learning (DL) applications, distributed learning involving\nimage classification require effective image compression codecs deployed on\nlow-cost sensing devices for efficient transmission and storage. Traditional\ncodecs such as JPEG designed for perceptual quality are not configured for DL\ntasks. This work introduces an integrative end-to-end trainable model for image\ncompression and classification consisting of a JPEG image codec and a DL-based\nclassifier. We demonstrate how this model can optimize the widely deployed JPEG\ncodec settings to improve classification accuracy in consideration of bandwidth\nconstraint. Our tests on CIFAR-100 and ImageNet also demonstrate improved\nvalidation accuracy over preset JPEG configuration.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:38:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Qi","Siyu",""],["Chamain","Lahiru D.",""],["Ding","Zhi",""]]}
{"id":"2308.05841","submitter":"Gerta R\\\"ucker","authors":"Gerta R\\\"ucker, Theodoros Papakonstantinou, Adriani Nikolakopoulou,\n  Guido Schwarzer, Tobias Galla, Annabel L. Davies","title":"Shortest path or random walks? A framework for path weights in network\n  meta-analysis","comments":"Preprint, 17 pages, 7 figures. Submitted to Statistics in Medicine","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantifying the contributions, or weights, of comparisons or single studies\nto the estimates in a network meta-analysis (NMA) is an active area of\nresearch. We extend this to the contributions of paths to NMA estimates. We\npresent a general framework, based on the path-design matrix, that describes\nthe problem of finding path contributions as a linear equation. The resulting\nsolutions may have negative coefficients. We show that two known approaches,\ncalled shortestpath and randomwalk, are special solutions of this equation, and\nboth meet an optimization criterion, as they minimize the sum of absolute path\ncontributions. In general, there is an infinite space of solutions, which can\nbe identified using the generalized inverse (Moore-Penrose pseudoinverse). We\nconsider two further special approaches. For complex networks we find that\nshortestpath is superior with respect to run time and variability, compared to\nthe other approaches, and is thus recommended in practice. The path-weights\nframework also has the potential to answer more general research questions in\nnetwork meta-analysis.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:40:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["R\u00fccker","Gerta",""],["Papakonstantinou","Theodoros",""],["Nikolakopoulou","Adriani",""],["Schwarzer","Guido",""],["Galla","Tobias",""],["Davies","Annabel L.",""]]}
{"id":"2308.05842","submitter":"Chen Chen","authors":"Yunbai Wang, Chen Chen and Xiaoli Chu","title":"Performance Analysis for Hybrid mmWave and THz Networks with Downlink\n  and Uplink Decoupled Cell Association","comments":"This paper has been submitted to IEEE for possible publications","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":"  It is expected that B5G/6G networks will exploit both terahertz (THz) and\nmillimetre wave (mmWave) frequency bands and will increase flexibility in user\nequipment (UE)-cell association. In this paper, we introduce a novel stochastic\ngeometry-based framework for the analysis of the\nsignal-to-interference-plus-noise-ratio (SINR) and rate coverage in a\nmulti-tier hybrid mmWave and THz network, where each tier has a particular base\nstation (BS) density, transmit power, bandwidth, number of BS antennas, and\ncell-association bias factor. The proposed framework incorporates the effects\nof mmWave and THz channel characteristics, BS beamforming gain, and blockages.\nWe investigate the downlink (DL) and uplink (UL) decoupled cell-association\nstrategy and characterise the per-tier cell-association probability. Based on\nthat, we analytically derive the SINR and rate coverage probabilities of a\ntypical user for both DL and UL transmissions. The analytical results are\nvalidated via extensive Monte Carlo simulations. Numerical results demonstrate\nthe superiority of the DL and UL decoupled cell-association strategy in terms\nof SINR and rate coverage over its coupled counterpart. Moreover, we observe\nthat the superiority of using the DL and UL decoupled cell-association strategy\nbecomes more evident with the dense deployment of THz networks.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:40:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Yunbai",""],["Chen","Chen",""],["Chu","Xiaoli",""]]}
{"id":"2308.05843","submitter":"Xinquan Huang","authors":"Xinquan Huang, Tariq Alkhalifah","title":"GaborPINN: Efficient physics informed neural networks using\n  multiplicative filtered networks","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":"  The computation of the seismic wavefield by solving the Helmholtz equation is\ncrucial to many practical applications, e.g., full waveform inversion.\nPhysics-informed neural networks (PINNs) provide functional wavefield solutions\nrepresented by neural networks (NNs), but their convergence is slow. To address\nthis problem, we propose a modified PINN using multiplicative filtered\nnetworks, which embeds some of the known characteristics of the wavefield in\ntraining, e.g., frequency, to achieve much faster convergence. Specifically, we\nuse the Gabor basis function due to its proven ability to represent wavefields\naccurately and refer to the implementation as GaborPINN. Meanwhile, we\nincorporate prior information on the frequency of the wavefield into the design\nof the method to mitigate the influence of the discontinuity of the represented\nwavefield by GaborPINN. The proposed method achieves up to a two-magnitude\nincrease in the speed of convergence as compared with conventional PINNs.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:51:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Huang","Xinquan",""],["Alkhalifah","Tariq",""]]}
{"id":"2308.05844","submitter":"Ljudmila Kamenova","authors":"Ljudmila Kamenova","title":"Finiteness of stable Lagrangian fibrations","comments":"This paper is in memory of my dear friend Sasha Ananin; 7 pages;\n  added a reference and minor improvements","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we survey some finiteness results of the deformation classes of\nhyperk\\\"ahler Lagrangian fibrations, and we prove finiteness for stable\nLagrangian fibrations with a given discriminant divisor.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:55:43 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 17:45:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kamenova","Ljudmila",""]]}
{"id":"2308.05845","submitter":"Mohsen Sadr","authors":"Mohsen Sadr, M. Hossein Gorji","title":"Treatment of long-range interactions arising in the Enskog-Vlasov\n  description of dense fluids","comments":null,"journal-ref":"Journal of Computational Physics 378, 129-142, 2019","doi":"10.1016/j.jcp.2018.11.005","report-no":null,"categories":"physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The kinetic theory of rarefied gases and numerical schemes based on the\nBoltzmann equation have evolved to the cornerstone of non-equilibrium gas\ndynamics. However, their counterparts in the dense regime remain rather exotic\nfor practical non-continuum scenarios. This problem is partly due to the fact\nthat long-range interactions arising from the attractive tail of molecular\npotentials, lead to a computationally demanding Vlasov integral. This study\nfocuses on numerical remedies for efficient stochastic particle simulations\nbased on the Enskog-Vlasov kinetic equation. In particular, we devise a\nPoisson-type elliptic equation that governs the underlying long-range\ninteractions. The idea comes through fitting a Green function to the molecular\npotential, and hence deriving an elliptic equation for the associated\nfundamental solution. Through this transformation of the Vlasov integral,\nefficient Poisson-type solvers can be readily employed in order to compute the\nmean field forces. Besides the technical aspects of different numerical schemes\nfor the treatment of the Vlasov integral, simulation results for the\nevaporation of a liquid slab into the vacuum are presented. It is shown that\nthe proposed formulation leads to accurate predictions with a reasonable\ncomputational cost.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:55:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sadr","Mohsen",""],["Gorji","M. Hossein",""]]}
{"id":"2308.05846","submitter":"Venkat Margapuri","authors":"Venkat Margapuri and Prapti Thapaliya and Mitchell Neilsen","title":"Seed Kernel Counting using Domain Randomization and Object Tracking\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-throughput phenotyping (HTP) of seeds, also known as seed phenotyping,\nis the comprehensive assessment of complex seed traits such as growth,\ndevelopment, tolerance, resistance, ecology, yield, and the measurement of\nparameters that form more complex traits. One of the key aspects of seed\nphenotyping is cereal yield estimation that the seed production industry relies\nupon to conduct their business. While mechanized seed kernel counters are\navailable in the market currently, they are often priced high and sometimes\noutside the range of small scale seed production firms' affordability. The\ndevelopment of object tracking neural network models such as You Only Look Once\n(YOLO) enables computer scientists to design algorithms that can estimate\ncereal yield inexpensively. The key bottleneck with neural network models is\nthat they require a plethora of labelled training data before they can be put\nto task. We demonstrate that the use of synthetic imagery serves as a feasible\nsubstitute to train neural networks for object tracking that includes the tasks\nof object classification and detection. Furthermore, we propose a seed kernel\ncounter that uses a low-cost mechanical hopper, trained YOLOv8 neural network\nmodel, and object tracking algorithms on StrongSORT and ByteTrack to estimate\ncereal yield from videos. The experiment yields a seed kernel count with an\naccuracy of 95.2\\% and 93.2\\% for Soy and Wheat respectively using the\nStrongSORT algorithm, and an accuray of 96.8\\% and 92.4\\% for Soy and Wheat\nrespectively using the ByteTrack algorithm.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:56:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Margapuri","Venkat",""],["Thapaliya","Prapti",""],["Neilsen","Mitchell",""]]}
{"id":"2308.05847","submitter":"Joseph Romano","authors":"Joseph D. Romano and Bruce Allen","title":"Answers to frequently asked questions about the pulsar timing array\n  Hellings and Downs correlation curve","comments":"16 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We answer frequently asked questions (FAQs) about the Hellings and Downs\ncorrelation curve -- the \"smoking-gun\" signature that pulsar timing arrays\n(PTAs) have detected gravitational waves (GWs). Many of these questions arise\nbecause of intuition based on how ground-based interferometers like LIGO\nrespond to GWs. These have arms that are short (km scale) compared to the\nwavelengths of the GWs that they detect (hundreds to thousands of km). In\ncontrast, PTAs respond to GWs whose wavelengths (tens of light-years) are much\nshorter than their arms (a typical PTA pulsar is thousands of light-years from\nEarth). To elucidate this, we calculate the exact response of a \"one-arm,\none-way\" detector to a passing GW, and compare it in the \"short-arm\"\n(LIGO-like) and \"long-arm\" (PTA) limits. This provides qualitative and\nquantitative answers to many questions about the Hellings and Downs\ncorrelation. The resulting \"FAQ sheet\" should help in understanding the\n\"evidence for GWs\" recently announced by several PTA collaborations.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:03:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Romano","Joseph D.",""],["Allen","Bruce",""]]}
{"id":"2308.05848","submitter":"Zhanna Rodnova","authors":"Zhanna Rodnova, Tobias Saule, George Gibson, and Carlos A.\n  Trallero-Herrero","title":"Molecular alignment-assisted spectral broadening and shifting in the\n  near-infrared with a recycled depleted pump from an optical parametric\n  amplifier","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate how the depleted pump of an optical parametric amplifier can\nbe recycled for impulsive alignment of a molecular gas inside a hollow-core\nfiber and use such alignment for the broadening and frequency shift of the\nsignal pulse at a center wavelength of $\\sim 1300$nm. Our results combine\nnon-adiabatic molecular alignment, self-phase modulation and Raman\nnon-linearities. We demonstrate spectral shifts of up to 204 nm and a spectral\nbroadening of more than one octave. We also report on the time delays at which\nbroadening occurs, which do not coincide with any of the molecular rotational\nconstants. Further, we encounter that maximum frequency shifts occur when the\nsignal and pump have perpendicular polarization instead of parallel.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:04:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rodnova","Zhanna",""],["Saule","Tobias",""],["Gibson","George",""],["Trallero-Herrero","Carlos A.",""]]}
{"id":"2308.05849","submitter":"Julio Deride","authors":"Julio Deride, Roger J-B Wets","title":"Solving equilibrium problems in economies with financial markets, home\n  production, and retention","comments":null,"journal-ref":null,"doi":"10.1088/1475-7516/2023/07/058","report-no":null,"categories":"math.OC econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new methodology to compute equilibria for general equilibrium\nproblems on exchange economies with real financial markets, home-production,\nand retention. We demonstrate that equilibrium prices can be determined by\nsolving a related maxinf-optimization problem. We incorporate the non-arbitrage\ncondition for financial markets into the equilibrium formulation and establish\nthe equivalence between solutions to both problems. This reduces the complexity\nof the original by eliminating the need to directly compute financial contract\nprices, allowing us to calculate equilibria even in cases of incomplete\nfinancial markets.\n  We also introduce a Walrasian bifunction that captures the imbalances and\nshow that maxinf-points of this function correspond to equilibrium points.\nMoreover, we demonstrate that every equilibrium point can be approximated by a\nlimit of maxinf points for a family of perturbed problems, by relying on the\nnotion of lopsided convergence.\n  Finally, we propose an augmented Walrasian algorithm and present numerical\nexamples to illustrate the effectiveness of this approach. Our methodology\nallows for efficient calculation of equilibria in a variety of exchange\neconomies and has potential applications in finance and economics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:16:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deride","Julio",""],["Wets","Roger J-B",""]]}
{"id":"2308.05850","submitter":"V\\'ictor Fern\\'andez","authors":"V\\'ictor Fern\\'andez, Gabriela Eisenberg","title":"Matrix characterization of Ciuciura's paraconsistent hierarchy\n  $\\textsf{Ciu}^n$","comments":"18 pages","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 will prove that the logics of the family\n$\\textsf{Ciu}^n$:=$\\{Ciu^n\\}_{n \\in \\omega}$ of paraconsistent Ciuciura{'}s\nLogics (defined by means of bivaluations) can be alternatively defined by means\nof finite matrices. This result arises from the characterization of the\ntruth-values of the involved matrices (relative to each $Ciu^n$-logic) as being\nspecific finite sequences of elements of the set $2$ := $\\{0,1\\}$. Moreover, we\nwill show along the paper that this characterization is related to the\nwell-known standard Fibonacci Sequence, which is presented here by means of its\nbinary expansion.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:31:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fern\u00e1ndez","V\u00edctor",""],["Eisenberg","Gabriela",""]]}
{"id":"2308.05851","submitter":"Anant Khandelwal","authors":"Anant Khandelwal","title":"SegDA: Maximum Separable Segment Mask with Pseudo Labels for Domain\n  Adaptive Semantic Segmentation","comments":"11 pages, 4 Tables, 3 Figures, accepted at ICCVW 2023 (ICCV 2023: 4th\n  Workshop on Visual Perception for Navigation in Human Environments)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unsupervised Domain Adaptation (UDA) aims to solve the problem of label\nscarcity of the target domain by transferring the knowledge from the label rich\nsource domain. Usually, the source domain consists of synthetic images for\nwhich the annotation is easily obtained using the well known computer graphics\ntechniques. However, obtaining annotation for real world images (target domain)\nrequire lot of manual annotation effort and is very time consuming because it\nrequires per pixel annotation. To address this problem we propose SegDA module\nto enhance transfer performance of UDA methods by learning the maximum\nseparable segment representation. This resolves the problem of identifying\nvisually similar classes like pedestrian/rider, sidewalk/road etc. We leveraged\nEquiangular Tight Frame (ETF) classifier inspired from Neural Collapse for\nmaximal separation between segment classes. This causes the source domain pixel\nrepresentation to collapse to a single vector forming a simplex vertices which\nare aligned to the maximal separable ETF classifier. We use this phenomenon to\npropose the novel architecture for domain adaptation of segment representation\nfor target domain. Additionally, we proposed to estimate the noise in labelling\nthe target domain images and update the decoder for noise correction which\nencourages the discovery of pixels for classes not identified in pseudo labels.\nWe have used four UDA benchmarks simulating synthetic-to-real,\ndaytime-to-nighttime, clear-to-adverse weather scenarios. Our proposed approach\noutperforms +2.2 mIoU on GTA -> Cityscapes, +2.0 mIoU on Synthia -> Cityscapes,\n+5.9 mIoU on Cityscapes -> DarkZurich, +2.6 mIoU on Cityscapes -> ACDC.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:35:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Khandelwal","Anant",""]]}
{"id":"2308.05852","submitter":"Michael Gaiewski","authors":"Jeffrey Connors, Michael Gaiewski","title":"An H1-Conforming Solenoidal Basis for Velocity Computation on\n  Powell-Sabin Splits for the Stokes Problem","comments":"22 pages, 8 figures, 16 references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A solenoidal basis is constructed to compute velocities using a certain\nfinite element method for the Stokes problem. The method is conforming, with\npiecewise linear velocity and piecewise constant pressure on the Powell-Sabin\nsplit of a triangulation. Inhomogeneous Dirichlet conditions are supported by\nconstructing an interpolating operator into the solenoidal velocity space. The\nsolenoidal basis reduces the problem size and eliminates the pressure variable\nfrom the linear system for the velocity. A basis of the pressure space is also\nconstructed that can be used to compute the pressure after the velocity, if it\nis desired to compute the pressure. All basis functions have local support and\nlead to sparse linear systems. The basis construction is confirmed through\nrigorous analysis. Velocity and pressure system matrices are both symmetric,\npositive definite, which can be exploited to solve their corresponding linear\nsystems. Significant efficiency gains over the usual saddle-point formulation\nare demonstrated computationally.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 20:49:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Connors","Jeffrey",""],["Gaiewski","Michael",""]]}
{"id":"2308.05853","submitter":"Guhesh Kumaran","authors":"Amihay Hanany, Rudolph Kalveks, Guhesh Kumaran","title":"$SU(n)$ hyper-K\\\"ahler quotients of $3d$ $\\mathcal N=4$ Coulomb branches\n  and quiver subtraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop the diagrammatic technique of quiver subtraction to facilitate the\nidentification and evaluation of the $SU(n)$ hyper-K\\\"ahler quotient (HKQ) of\nthe Coulomb branch of a $3d$ $\\mathcal{N}=4$ unitary quiver theory. The target\nquivers are drawn from a wide range of theories, typically classified as\n''good'' or ''ugly'', which satisfy identified selection criteria. Our\nsubtraction procedure uses quotient quivers that are ''bad'', differing thereby\nfrom quiver subtractions based on Kraft-Procesi transitions. The procedure\nidentifies one or more resultant quivers, the union of whose Coulomb branches\ncorresponds to the desired HKQ. Examples include quivers whose Coulomb branches\nare moduli spaces of free fields, closures of nilpotent orbits of classical and\nexceptional type, and slices in the affine Grassmanian. We calculate the\nHilbert Series and Highest Weight Generating functions for HKQ examples of low\nrank. For certain families of quivers, we are able to conjecture HWGs for\narbitrary rank. We examine the commutation relations between quotient quiver\nsubtraction and other diagrammatic techniques, such as Kraft-Procesi\ntransitions, quiver folding, and discrete quotients.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:00:25 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hanany","Amihay",""],["Kalveks","Rudolph",""],["Kumaran","Guhesh",""]]}
{"id":"2308.05854","submitter":"Guido Magnano","authors":"Guido Magnano","title":"On the \"Legendre scalarization\" of nonlinear gravity theories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We discuss the proposal of a new method to transform a f(R) metric gravity\ntheory into a general relativistic theory including an auxiliary scalar field,\nrecently introduced by S. Cotsakis et al. We argue that (i) the fact that the\nfourth order equations of f(R) metric gravity can be recast (via a Legendre\ntransformation) into Einstein equations without any conformal rescaling has\nbeen thoroughly clarified in the previous literature, and (ii) the newly\nproposed method produces a set of equations that are not equivalent to the\noriginal theory. In the conclusion, a comment is added on another aspect of the\nLegendre transformation which seems to be generally overlooked.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:03:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Magnano","Guido",""]]}
{"id":"2308.05855","submitter":"Joseph Straley","authors":"Matthew D. Golden and Joseph P. Straley","title":"Spatial Dependence of Microscopic Percolation Conduction","comments":"5 pages, 2 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 two dimensions, the average electrical conductance from a point in a\npercolating network to the network boundary should be related by a conformal\ntransformation to the conductance from one point to another in an unbounded\nnetwork. We verify that this works at the percolation threshold for the square.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:05:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Golden","Matthew D.",""],["Straley","Joseph P.",""]]}
{"id":"2308.05856","submitter":"Patricia Cahn","authors":"Patricia Cahn and Alexandra Kjuchukova","title":"Linking in Cyclic Branched Covers and Satellite (non)-Homomorphisms","comments":"23 pages, 11 figures, 5 tables, 3 footnotes, 1 appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $K\\subset S^3$ be a knot and $\\eta, \\gamma \\subset S^3\\backslash K$ be\nsimple closed curves. Denote by $\\Sigma_q(K)$ the $q$-fold cyclic branched\ncover of $K$. We give an explicit formula for computing the linking numbers\nbetween lifts of $\\eta$ and $\\gamma$ to $\\Sigma_q(K)$. As an application, we\nevaluate, in a variety of cases, an obstruction to satellite operations\ninducing homomorphisms on smooth concordance.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:05:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cahn","Patricia",""],["Kjuchukova","Alexandra",""]]}
{"id":"2308.05857","submitter":"Harsh Shrivastava","authors":"Urszula Chajewska, Harsh Shrivastava","title":"Knowledge Propagation over Conditional Independence Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Conditional Independence (CI) graph is a special type of a Probabilistic\nGraphical Model (PGM) where the feature connections are modeled using an\nundirected graph and the edge weights show the partial correlation strength\nbetween the features. Since the CI graphs capture direct dependence between\nfeatures, they have been garnering increasing interest within the research\ncommunity for gaining insights into the systems from various domains, in\nparticular discovering the domain topology. In this work, we propose algorithms\nfor performing knowledge propagation over the CI graphs. Our experiments\ndemonstrate that our techniques improve upon the state-of-the-art on the\npublicly available Cora and PubMed datasets.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:06:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chajewska","Urszula",""],["Shrivastava","Harsh",""]]}
{"id":"2308.05858","submitter":"Klaus Mosegaard","authors":"Klaus Mosegaard","title":"Inconsistency and Acausality of Model Selection in Bayesian Inverse\n  Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bayesian inference paradigms are regarded as powerful tools for solution of\ninverse problems. However, when applied to inverse problems in physical\nsciences, Bayesian formulations suffer from a number of inconsistencies that\nare often overlooked. A well known, but mostly neglected, difficulty is\nconnected to the notion of conditional probability densities. Borel, and later\nKolmogorov's (1933/1956), found that the traditional definition of conditional\ndensities is incomplete: In different parameterizations it leads to different\nresults. We will show an example where two apparently correct procedures\napplied to the same problem lead to two widely different results. Another type\nof inconsistency involves violation of causality. This problem is found in\nmodel selection strategies in Bayesian inversion, such as Hierarchical Bayes\nand Trans-Dimensional Inversion where so-called hyperparameters are included as\nvariables to control either the number (or type) of unknowns, or the prior\nuncertainties on data or model parameters. For Hierarchical Bayes we\ndemonstrate that the calculated 'prior' distributions of data or model\nparameters are not prior-, but posterior information. In fact, the calculated\n'standard deviations' of the data are a measure of the inability of the forward\nfunction to model the data, rather than uncertainties of the data. For\ntrans-dimensional inverse problems we show that the so-called evidence is, in\nfact, not a measure of the success of fitting the data for the given choice (or\nnumber) of parameters, as often claimed. We also find that the notion of\nNatural Parsimony is ill-defined, because of its dependence on the parameter\nprior. Based on this study, we find that careful rethinking of Bayesian\ninversion practices is required, with special emphasis on ways of avoiding the\nBorel-Kolmogorov inconsistency, and on the way we interpret model selection\nresults.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:17:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mosegaard","Klaus",""]]}
{"id":"2308.05859","submitter":"Elijah Pelofske","authors":"Georg Hahn, Elijah Pelofske, Hristo N. Djidjev","title":"Posiform Planting: Generating QUBO Instances for Benchmarking","comments":null,"journal-ref":null,"doi":null,"report-no":"LA-UR-23-27170","categories":"quant-ph cond-mat.stat-mech cs.ET math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We are interested in benchmarking both quantum annealing and classical\nalgorithms for minimizing Quadratic Unconstrained Binary Optimization (QUBO)\nproblems. Such problems are NP-hard in general, implying that the exact minima\nof randomly generated instances are hard to find and thus typically unknown.\nWhile brute forcing smaller instances is possible, such instances are typically\nnot interesting as being too easy for both quantum and classical algorithms. In\nthis contribution, we propose a novel method, called posiform planting, for\ngenerating random QUBO instances of arbitrary size with known optimal\nsolutions, and use those instances to benchmark the sampling quality of four\nD-Wave quantum annealers utilizing different interconnection structures\n(Chimera, Pegasus, and Zephyr hardware graphs) as well as the simulated\nannealing algorithm. Posiform planting differs from existing methods in two key\nways. It ensures the uniqueness of the planted optimal solution, thus avoiding\ngroundstate degeneracy, and it enables the generation of QUBOs that are\ntailored to a given hardware connectivity structure, provided that the\nconnectivity is not too sparse. Posiform planted QUBO's are a type of 2-SAT\nboolean satisfiability combinatorial optimization problems. Our experiments\ndemonstrate the capability of the D-Wave quantum annealers to sample the\noptimal planted solution of combinatorial optimization problems with up to\n$5627$ qubits.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:23:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hahn","Georg",""],["Pelofske","Elijah",""],["Djidjev","Hristo N.",""]]}
{"id":"2308.05860","submitter":"David Curtin","authors":"David Curtin and Jaipratap Singh Grewal","title":"Long Lived Particle Decays in MATHUSLA","comments":"16 pages + references, 11 Figures. Detector FastSim and Event Library\n  publicly available","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We carefully study the decay and reconstruction of long-lived particle (LLP)\ndecays in the proposed MATHUSLA LLP detector for the HL-LHC. Our investigations\nare focused on three LLP benchmark models. MATHUSLA's primary physics target is\nrepresented by hadronically decaying $\\mathcal{O}(10~\\mathrm{GeV})$ LLPs\nproduced in exotic Higgs decays. We also investigate GeV-scale scalar and\nright-handed-neutrino LLPs, which are the target of many other proposed\nexperiments. We first introduce a public MATHUSLA FastSim code to allow for\nefficient signal-only studies of LLP decays in MATHUSLA and general external\nLLP detectors. For each of our benchmark scenarios, we carefully simulate LLP\nproduction and decay, and make our simulation libary publicly accessible for\nfuture investigations and comparisons with other experiments. We then\nsystematically study the geometric acceptance of MATHUSLA for LLP decays in\nthese scenarios, and present updated sensitivity projections that include these\nacceptances. Our results show that the idealized reach of MATHUSLA computed in\nearlier studies is mostly realized. We also investigate possible ways of\nincreasing the signal acceptance using the inherent geometric flexibility of\nthe FastSim, which will provide useful inputs for realistic experimental and\nengineering optimization of the detector in the future.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:26:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Curtin","David",""],["Grewal","Jaipratap Singh",""]]}
{"id":"2308.05861","submitter":"Guenter Last","authors":"Daniel Hug, G\\\"unter Last, Wolfgang Weil","title":"Boolean models","comments":"This survey is a preliminary version of a chapter of the forthcoming\n  book \"Geometry and Physics of Spatial Random Systems'' edited and partially\n  written by Daniel Hug, Michael Klatt, Klaus Mecke, Gerd Schr\\\"oder Turk and\n  Wolfgang Weil","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The topic of this survey are geometric functionals of a Boolean model (in\nEuclidean space) governed by a stationary Poisson process of convex grains. The\nBoolean model is a fundamental benchmark of stochastic geometry and continuum\npercolation. Moreover, it is often used to model amorphous connected structures\nin physics, materials science and biology. Deeper insight into the geometric\nand probabilistic properties of Boolean models and the dependence on the\nunderlying Poisson process can be gained by considering various geometric\nfunctionals of Boolean models. Important examples are the intrinsic volumes and\nMinkowski tensors. We survey here local and asymptotic density (mean value)\nformulas as well as second order properties and central limit theorems.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:37:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hug","Daniel",""],["Last","G\u00fcnter",""],["Weil","Wolfgang",""]]}
{"id":"2308.05862","submitter":"Jun Ma","authors":"Jun Ma, Yao Zhang, Song Gu, Cheng Ge, Shihao Ma, Adamo Young, Cheng\n  Zhu, Kangkang Meng, Xin Yang, Ziyan Huang, Fan Zhang, Wentao Liu, YuanKe Pan,\n  Shoujin Huang, Jiacheng Wang, Mingze Sun, Weixin Xu, Dengqiang Jia, Jae Won\n  Choi, Nat\\'alia Alves, Bram de Wilde, Gregor Koehler, Yajun Wu, Manuel\n  Wiesenfarth, Qiongjie Zhu, Guoqiang Dong, Jian He, the FLARE Challenge\n  Consortium, and Bo Wang","title":"Unleashing the Strengths of Unlabeled Data in Pan-cancer Abdominal Organ\n  Quantification: the FLARE22 Challenge","comments":"MICCAI FLARE22: https://flare22.grand-challenge.org/","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Quantitative organ assessment is an essential step in automated abdominal\ndisease diagnosis and treatment planning. Artificial intelligence (AI) has\nshown great potential to automatize this process. However, most existing AI\nalgorithms rely on many expert annotations and lack a comprehensive evaluation\nof accuracy and efficiency in real-world multinational settings. To overcome\nthese limitations, we organized the FLARE 2022 Challenge, the largest abdominal\norgan analysis challenge to date, to benchmark fast, low-resource, accurate,\nannotation-efficient, and generalized AI algorithms. We constructed an\nintercontinental and multinational dataset from more than 50 medical groups,\nincluding Computed Tomography (CT) scans with different races, diseases,\nphases, and manufacturers. We independently validated that a set of AI\nalgorithms achieved a median Dice Similarity Coefficient (DSC) of 90.0\\% by\nusing 50 labeled scans and 2000 unlabeled scans, which can significantly reduce\nannotation requirements. The best-performing algorithms successfully\ngeneralized to holdout external validation sets, achieving a median DSC of\n89.5\\%, 90.9\\%, and 88.3\\% on North American, European, and Asian cohorts,\nrespectively. They also enabled automatic extraction of key organ biology\nfeatures, which was labor-intensive with traditional manual measurements. This\nopens the potential to use unlabeled data to boost performance and alleviate\nannotation shortages for modern AI models.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:51:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ma","Jun",""],["Zhang","Yao",""],["Gu","Song",""],["Ge","Cheng",""],["Ma","Shihao",""],["Young","Adamo",""],["Zhu","Cheng",""],["Meng","Kangkang",""],["Yang","Xin",""],["Huang","Ziyan",""],["Zhang","Fan",""],["Liu","Wentao",""],["Pan","YuanKe",""],["Huang","Shoujin",""],["Wang","Jiacheng",""],["Sun","Mingze",""],["Xu","Weixin",""],["Jia","Dengqiang",""],["Choi","Jae Won",""],["Alves","Nat\u00e1lia",""],["de Wilde","Bram",""],["Koehler","Gregor",""],["Wu","Yajun",""],["Wiesenfarth","Manuel",""],["Zhu","Qiongjie",""],["Dong","Guoqiang",""],["He","Jian",""],["Consortium","the FLARE Challenge",""],["Wang","Bo",""]]}
{"id":"2308.05863","submitter":"Benjamin L. Gerard","authors":"Benjamin L. Gerard, Daren Dillon, Sylvain Cetre, Rebecca Jensen-Clem","title":"First laboratory demonstration of real-time multi-wavefront sensor\n  single conjugate adaptive optics","comments":"Conference Proceeding for 2023 SPIE Optics & Photonics, Techniques\n  and Instrumentation for Detection of Exoplanets XI","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exoplanet imaging has thus far enabled studies of wide-orbit ($>$10 AU) giant\nplanet ($>$2 Jupiter masses) formation and giant planet atmospheres, with\nfuture 30 meter-class Extremely Large Telescopes (ELTs) needed to image and\ncharacterize terrestrial exoplanets. However, current state-of-the-art\nexoplanet imaging technologies placed on ELTs would still miss the contrast\nrequired for imaging Earth-mass habitable-zone exoplanets around low-mass stars\nby ~100x due to speckle noise--scattered starlight in the science image due to\na combination of aberrations from the atmosphere after an adaptive optics (AO)\ncorrection and internal to the telescope and instrument. We have been\ndeveloping a focal plane wavefront sensing technology called the Fast\nAtmospheric Self-coherent camera Technique (FAST) to address both of these\nissues; in this work we present the first results of simultaneous first and\nsecond stage AO wavefront sensing and control with a Shack Hartmann wavefront\nsensor (SHWFS) and FAST, respectively, using two common path deformable\nmirrors. We demonstrate this \"multi-WFS single conjugate AO\" real-time control\nat up to 200 Hz loop speeds on the Santa Cruz Extreme AO Laboratory (SEAL)\ntestbed, showing a promising potential for both FAST and similar high-speed\ndiffraction-limited second-stage wavefront sensing technologies to be deployed\non current and future observatories, helping to remove speckle noise as the\nmain limitation to ELT habitable exoplanet imaging.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:52:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gerard","Benjamin L.",""],["Dillon","Daren",""],["Cetre","Sylvain",""],["Jensen-Clem","Rebecca",""]]}
{"id":"2308.05864","submitter":"Jun Ma","authors":"Jun Ma, Ronald Xie, Shamini Ayyadhury, Cheng Ge, Anubha Gupta, Ritu\n  Gupta, Song Gu, Yao Zhang, Gihun Lee, Joonkee Kim, Wei Lou, Haofeng Li, Eric\n  Upschulte, Timo Dickscheid, Jos\\'e Guilherme de Almeida, Yixin Wang, Lin Han,\n  Xin Yang, Marco Labagnara, Sahand Jamal Rahi, Carly Kempster, Alice Pollitt,\n  Leon Espinosa, T\\^am Mignot, Jan Moritz Middeke, Jan-Niklas Eckardt, Wangkai\n  Li, Zhaoyang Li, Xiaochen Cai, Bizhe Bai, Noah F. Greenwald, David Van Valen,\n  Erin Weisbart, Beth A. Cimini, Zhuoshi Li, Chao Zuo, Oscar Br\\\"uck, Gary D.\n  Bader, and Bo Wang","title":"The Multi-modality Cell Segmentation Challenge: Towards Universal\n  Solutions","comments":"NeurIPS22 Cell Segmentation Challenge:\n  https://neurips22-cellseg.grand-challenge.org/","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cell segmentation is a critical step for quantitative single-cell analysis in\nmicroscopy images. Existing cell segmentation methods are often tailored to\nspecific modalities or require manual interventions to specify hyperparameters\nin different experimental settings. Here, we present a multi-modality cell\nsegmentation benchmark, comprising over 1500 labeled images derived from more\nthan 50 diverse biological experiments. The top participants developed a\nTransformer-based deep-learning algorithm that not only exceeds existing\nmethods, but can also be applied to diverse microscopy images across imaging\nplatforms and tissue types without manual parameter adjustments. This benchmark\nand the improved algorithm offer promising avenues for more accurate and\nversatile cell analysis in microscopy imaging.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:59:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ma","Jun",""],["Xie","Ronald",""],["Ayyadhury","Shamini",""],["Ge","Cheng",""],["Gupta","Anubha",""],["Gupta","Ritu",""],["Gu","Song",""],["Zhang","Yao",""],["Lee","Gihun",""],["Kim","Joonkee",""],["Lou","Wei",""],["Li","Haofeng",""],["Upschulte","Eric",""],["Dickscheid","Timo",""],["de Almeida","Jos\u00e9 Guilherme",""],["Wang","Yixin",""],["Han","Lin",""],["Yang","Xin",""],["Labagnara","Marco",""],["Rahi","Sahand Jamal",""],["Kempster","Carly",""],["Pollitt","Alice",""],["Espinosa","Leon",""],["Mignot","T\u00e2m",""],["Middeke","Jan Moritz",""],["Eckardt","Jan-Niklas",""],["Li","Wangkai",""],["Li","Zhaoyang",""],["Cai","Xiaochen",""],["Bai","Bizhe",""],["Greenwald","Noah F.",""],["Van Valen","David",""],["Weisbart","Erin",""],["Cimini","Beth A.",""],["Li","Zhuoshi",""],["Zuo","Chao",""],["Br\u00fcck","Oscar",""],["Bader","Gary D.",""],["Wang","Bo",""]]}
{"id":"2308.05865","submitter":"R.T. Sutherland Ph.D.","authors":"R. Tyler Sutherland and M. Foss-Feig","title":"Laser-free trapped ion entangling gates with AESE: Adiabatic Elimination\n  of Spin-motion Entanglement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss a laser-free, two-qubit geometric phase gate technique for\ngenerating high-fidelity entanglement between two trapped ions. The scheme\nworks by ramping the spin-dependent force on and off slowly relative to the\ngate detunings, which adiabatically eliminates the spin-motion entanglement\n(AESE). We show how gates performed with AESE can eliminate spin-motion\nentanglement with multiple modes simultaneously, without having to specifically\ntune the control field detunings. This is because the spin-motion entanglement\nis suppressed by operating the control fields in a certain parametric limit,\nrather than by engineering an optimized control sequence. We also discuss\nphysical implementations that use either electronic or ferromagnetic magnetic\nfield gradients. In the latter, we show how to ``AESE\" the system by smoothly\nturning on the \\textit{effective} spin-dependent force by shelving from a\nmagnetic field insensitive state to a magnetic field sensitive state slowly\nrelative to the gate mode frequencies. We show how to do this with a Rabi or\nadiabatic rapid passage transition. Finally, we show how gating with AESE\nsignificantly decreases the gate's sensitivity to common sources of motional\ndecoherence, making it easier to perform high-fidelity gates at Doppler\ntemperatures.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:04:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sutherland","R. Tyler",""],["Foss-Feig","M.",""]]}
{"id":"2308.05866","submitter":"Songhui Yue","authors":"Songhui Yue, Jyothsna Kondari, Aibek Musaev, Randy K. Smith, Songqing\n  Yue","title":"Using Twitter Data to Determine Hurricane Category: An Experiment","comments":"9 Pages, 6 Figures, in Proceedings of the 15th ISCRAM Conference\n  Rochester, NY, USA May 2018","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Social media posts contain an abundant amount of information about public\nopinion on major events, especially natural disasters such as hurricanes. Posts\nrelated to an event, are usually published by the users who live near the place\nof the event at the time of the event. Special correlation between the social\nmedia data and the events can be obtained using data mining approaches. This\npaper presents research work to find the mappings between social media data and\nthe severity level of a disaster. Specifically, we have investigated the\nTwitter data posted during hurricanes Harvey and Irma, and attempted to find\nthe correlation between the Twitter data of a specific area and the hurricane\nlevel in that area. Our experimental results indicate a positive correlation\nbetween them. We also present a method to predict the hurricane category for a\nspecific area using relevant Twitter data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:30:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yue","Songhui",""],["Kondari","Jyothsna",""],["Musaev","Aibek",""],["Smith","Randy K.",""],["Yue","Songqing",""]]}
{"id":"2308.05867","submitter":"Cristhiano Duarte","authors":"Thiago Melo D. Azevedo, Cristhiano Duarte, Nadja K. Bernardes","title":"Distillation of quantum non-Markovianity","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-Markovianty of open quantum systems dynamics is a physically relevant\nproperty which is usually associated with the backflow of (quantum)\ninformation. Using this paradigmatic marker, we develop an operational\nframework to investigate how non-Markovianity for qubit dynamics can be\ndistilled when many copies of the channels are used, possibly allowing for a\nstronger effect on the backflow of information.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:33:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Azevedo","Thiago Melo D.",""],["Duarte","Cristhiano",""],["Bernardes","Nadja K.",""]]}
{"id":"2308.05868","submitter":"Ilaria Seidel","authors":"Ilaria Seidel, Nathan Sun","title":"Periodic Points of Consecutive-Pattern-Avoiding Stack-Sorting Maps","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  West's stack-sorting map involves a stack which avoids the permutation $21$\nconsecutively. Defant and Zheng extended this to a consecutive-pattern-avoiding\nstack-sorting map $SC_\\sigma$, where the stack must always avoid a given\npermutation $\\sigma$ consecutively. We address one of the main conjectures\nraised by Defant and Zheng in their dynamical approach to $SC_\\sigma$.\nSpecifically, we show that the periodic points of $SC_\\sigma$ are precisely the\npermutations that consecutively avoid $\\sigma$ and its reverse.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:42:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Seidel","Ilaria",""],["Sun","Nathan",""]]}
{"id":"2308.05869","submitter":"Ismet Dagli","authors":"Ismet Dagli, Mehmet Belviranli","title":"Shared Memory-contention-aware Concurrent DNN Execution for Diversely\n  Heterogeneous System-on-Chips","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AI cs.PF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two distinguishing features of state-of-the-art mobile and autonomous systems\nare 1) there are often multiple workloads, mainly deep neural network (DNN)\ninference, running concurrently and continuously; and 2) they operate on shared\nmemory system-on-chips (SoC) that embed heterogeneous accelerators tailored for\nspecific operations. State-of-the-art lacks efficient performance and resource\nmanagement techniques necessary to either maximize total system throughput or\nminimize end-to-end workload latency. In this work, we propose HaX-CoNN, a\nnovel scheme that characterizes and maps layers in concurrently executing DNN\ninference workloads to a diverse set of accelerators within a SoC. Our scheme\nuniquely takes per-layer execution characteristics, shared memory (SM)\ncontention, and inter-accelerator transitions into account to find optimal\nschedules. We evaluate HaX-CoNN on NVIDIA Orin, NVIDIA Xavier, and Qualcomm\nSnapdragon 865 SoCs. Our experimental results indicate that HaX-CoNN minimizes\nmemory contention by up to 45% and can improve latency and total throughput by\nup to 32% and 29%, respectively, compared to the state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:47:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dagli","Ismet",""],["Belviranli","Mehmet",""]]}
{"id":"2308.05870","submitter":"Achintha Wijesinghe","authors":"Achintha Wijesinghe, Songyang Zhang, Siyu Qi, Zhi Ding","title":"UFed-GAN: A Secure Federated Learning Framework with Constrained\n  Computation and Unlabeled Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To satisfy the broad applications and insatiable hunger for deploying low\nlatency multimedia data classification and data privacy in a cloud-based\nsetting, federated learning (FL) has emerged as an important learning paradigm.\nFor the practical cases involving limited computational power and only\nunlabeled data in many wireless communications applications, this work\ninvestigates FL paradigm in a resource-constrained and label-missing\nenvironment. Specifically, we propose a novel framework of UFed-GAN:\nUnsupervised Federated Generative Adversarial Network, which can capture\nuser-side data distribution without local classification training. We also\nanalyze the convergence and privacy of the proposed UFed-GAN. Our experimental\nresults demonstrate the strong potential of UFed-GAN in addressing limited\ncomputational resources and unlabeled data while preserving privacy.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:52:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wijesinghe","Achintha",""],["Zhang","Songyang",""],["Qi","Siyu",""],["Ding","Zhi",""]]}
{"id":"2308.05871","submitter":"Tyler Volkoff","authors":"T. J. Volkoff and Changhyun Ryu","title":"Globally optimal interferometry with lossy twin Fock probes","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29139","categories":"quant-ph cond-mat.quant-gas math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parity or $J_{z}^{2}$ readouts of a Mach-Zehnder (MZ) interferometer probed\nwith a twin Fock input state allow to saturate the optimal sensitivity\nattainable among all product states with a fixed total number of particles, but\nonly when the interferometer phase $\\theta$ is near zero. When more general\nDicke state probes are used, the parity readout saturates the QFI at\n$\\theta=0$, whereas better-than-standard quantum limit performance of the\n$J_{z}^{2}$ readout is restricted to an $o(\\sqrt{N})$ occupation imbalance. We\nshow that a method of moments readout of two quadratic spin observables\n$J_{z}^{2}$ and $J_{+}^{2}+J_{-}^{2}$ is globally optimal for Dicke state\nprobes, i.e., the error saturates the QFI for all $\\theta$. In the lossy\nsetting, we derive the time-inhomogeneous Markov process describing the effect\nof particle loss on twin Fock states, showing that method of moments readout of\nfour at-most-quadratic spin observables is sufficient for globally optimal\nestimation of $\\theta$ when two or more particles are lost. The analysis\nculminates in a numerical calculation of the QFI matrix for distributed MZ\ninterferometry on the four mode state $\\vert {N\\over 4},{N\\over 4},{N\\over\n4},{N\\over 4}\\rangle$ and its lossy counterparts, showing that an advantage for\nestimation of any linear function of the local MZ phases $\\theta_{1}$,\n$\\theta_{2}$ (compared to independent probing of the MZ phases by two copies of\n$\\vert{N\\over 4},{N\\over 4}\\rangle$) appears when more than one particle is\nlost.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:56:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Volkoff","T. J.",""],["Ryu","Changhyun",""]]}
{"id":"2308.05872","submitter":"Liu Yanli","authors":"Liang Shang, Yanli Liu, Zhengyang Lou, Shuxue Quan, Nagesh Adluru,\n  Bochen Guan, William A. Sethares","title":"Vision Backbone Enhancement via Multi-Stage Cross-Scale Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convolutional neural networks (CNNs) and vision transformers (ViTs) have\nachieved remarkable success in various vision tasks. However, many\narchitectures do not consider interactions between feature maps from different\nstages and scales, which may limit their performance. In this work, we propose\na simple add-on attention module to overcome these limitations via multi-stage\nand cross-scale interactions. Specifically, the proposed Multi-Stage\nCross-Scale Attention (MSCSA) module takes feature maps from different stages\nto enable multi-stage interactions and achieves cross-scale interactions by\ncomputing self-attention at different scales based on the multi-stage feature\nmaps. Our experiments on several downstream tasks show that MSCSA provides a\nsignificant performance boost with modest additional FLOPs and runtime.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 22:57:31 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 18:27:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shang","Liang",""],["Liu","Yanli",""],["Lou","Zhengyang",""],["Quan","Shuxue",""],["Adluru","Nagesh",""],["Guan","Bochen",""],["Sethares","William A.",""]]}
{"id":"2308.05873","submitter":"Fritz Scholz","authors":"F.W. Scholz","title":"On Steel's Test with Ties","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":"  This note revisits Steel's multiple comparison test which uses Wilcoxon\nstatistics in pairwise comparisons of several treatment samples with a common\ncontrol sample. It derives means, variances and covariances of the Wilcoxon\nstatistics under the conditional randomization distribution, given the tie\npattern in the pooled samples. Sample sizes do not have to be equal. Under the\nrandomization distribution asymptotic multivariate normality of these Wilcoxon\nstatistics is established. This widens the scope of normal approximations to\nconditional tests, assuming independent samples of respective sizes $n_0,\nn_1,\\ldots,n_K$ from any common population or randomized treatment assignment\nto $N=n_0 + n_1+\\ldots+n_K$ experimental subjects. Significance probabilities\nare obtained using a normal approximation and a single quadrature. In the\ncontinuous shift model the simultaneous tests are converted to simultaneous\nconfidence bounds and intervals. This is implemented in the {\\sf R} package\n{\\tt kSamples}. Extensions to all pairwise Wilcoxon test comparisons are\ndiscussed.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:02:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Scholz","F. W.",""]]}
{"id":"2308.05874","submitter":"Antonios Zitridis","authors":"Antonios Zitridis","title":"Homogenization of conditional slow-fast McKean-Vlasov SDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a fully-coupled system of conditional slow-fast McKean-Vlasov\nStochastic Differential Equations that exhibit full dependence on both the slow\nand fast components, as well as on the conditional law of the slow component.\nOur aim is to derive convergence rates to its homogenized limit, without making\nperiodicity assumptions. To prove our results, we utilize a perturbation method\nfor equations posed in the Wasserstein space.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:05:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zitridis","Antonios",""]]}
{"id":"2308.05875","submitter":"Minjae Kim","authors":"M. Kim, T. Mannel, J. Lasue, A. Longobardo, M. S. Bentley, R. Moissl\n  and the MIDAS team","title":"Cometary dust collected by MIDAS on board Rosetta II. Particle shape\n  descriptors and pristineness evaluation","comments":"40 pages, 31 figures, 1 online table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The MIDAS (Micro-Imaging Dust Analysis System) atomic force microscope on\nboard the Rosetta comet orbiter investigated and measured the 3D topography of\na few hundred nm to tens of $\\mu$m sized dust particles of\n67P/Churyumov-Gerasimenko with resolutions down to a few nanometers, giving\ninsights into the physical processes of our early Solar System. We analyze the\nshapes of the cometary dust particles collected by MIDAS on the basis of a\nrecently updated particle catalog with the aim to determine which structural\nproperties remained pristine. We develop a set of shape descriptors and metrics\nsuch as aspect ratio, elongation, circularity, convexity, and particle\nsurface/volume distribution, which can be used to describe the distribution of\nparticle shapes. Furthermore, we compare the structure of the MIDAS dust\nparticles and the clusters in which the particles were deposited to those found\nin previous laboratory experiments and by Rosetta/COSIMA. Finally, we combine\nour findings to calculate a pristineness score for MIDAS particles and\ndetermine the most pristine particles and their properties. We find that the\nmorphological properties of all cometary dust particles at the micrometer scale\nare surprisingly homogeneous despite originating from diverse cometary\nenvironments (e.g., different collection targets that are associated with\ncometary activities/source regions and collection velocities/periods). We next\nfind that the types of clusters found by MIDAS show good agreement with those\ndefined by previous laboratory experiments, however, there are some differences\nto those found by Rosetta/COSIMA. Based on our result, we rate 19 out of 1082\nMIDAS particles at least moderately pristine, i.e., they are not substantially\nflattened by impact, not fragmented, and/or not part of a fragmentation\ncluster.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:09:10 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 23:43:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","M.",""],["Mannel","T.",""],["Lasue","J.",""],["Longobardo","A.",""],["Bentley","M. S.",""],["Moissl","R.",""],["team","the MIDAS",""]]}
{"id":"2308.05876","submitter":"Maulik Bhatt","authors":"Maulik Bhatt and Negar Mehr","title":"Strategic Decision-Making in Multi-Agent Domains: A Weighted Potential\n  Dynamic Game Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In interactive multi-agent settings, decision-making complexity arises from\nagents' interconnected objectives. Dynamic game theory offers a formal\nframework for analyzing such intricacies. Yet, solving dynamic games and\ndetermining Nash equilibria pose computational challenges due to the need of\nsolving coupled optimal control problems. To address this, our key idea is to\nleverage potential games, which are games with a potential function that allows\nfor the computation of Nash equilibria by optimizing the potential function. We\nargue that dynamic potential games, can effectively facilitate interactive\ndecision-making in many multi-agent interactions. We will identify structures\nin realistic multi-agent interactive scenarios that can be transformed into\nweighted potential dynamic games. We will show that the open-loop Nash\nequilibria of the resulting weighted potential dynamic game can be obtained by\nsolving a single optimal control problem. We will demonstrate the effectiveness\nof the proposed method through various simulation studies, showing close\nproximity to feedback Nash equilibria and significant improvements in solve\ntime compared to state-of-the-art game solvers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:10:13 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 22:03:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bhatt","Maulik",""],["Mehr","Negar",""]]}
{"id":"2308.05877","submitter":"Leonardo Ferreira","authors":"Leonardo Antunes Ferreira, Lucas Pereira Carlini, Gabriel de Almeida\n  S\\'a Coutrin, Tatiany Marcondes Heideirich, Marina Carvalho de Moraes Barros,\n  Ruth Guinsburg and Carlos Eduardo Thomaz","title":"Revisiting N-CNN for Clinical Practice","comments":"AICAI 2023 in conjuction with MICCAI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper revisits the Neonatal Convolutional Neural Network (N-CNN) by\noptimizing its hyperparameters and evaluating how they affect its\nclassification metrics, explainability and reliability, discussing their\npotential impact in clinical practice. We have chosen hyperparameters that do\nnot modify the original N-CNN architecture, but mainly modify its learning rate\nand training regularization. The optimization was done by evaluating the\nimprovement in F1 Score for each hyperparameter individually, and the best\nhyperparameters were chosen to create a Tuned N-CNN. We also applied soft\nlabels derived from the Neonatal Facial Coding System, proposing a novel\napproach for training facial expression classification models for neonatal pain\nassessment. Interestingly, while the Tuned N-CNN results point towards\nimprovements in classification metrics and explainability, these improvements\ndid not directly translate to calibration performance. We believe that such\ninsights might have the potential to contribute to the development of more\nreliable pain evaluation tools for newborns, aiding healthcare professionals in\ndelivering appropriate interventions and improving patient outcomes.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:22:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ferreira","Leonardo Antunes",""],["Carlini","Lucas Pereira",""],["Coutrin","Gabriel de Almeida S\u00e1",""],["Heideirich","Tatiany Marcondes",""],["Barros","Marina Carvalho de Moraes",""],["Guinsburg","Ruth",""],["Thomaz","Carlos Eduardo",""]]}
{"id":"2308.05878","submitter":"Stephanie Wang","authors":"Stephanie Wang, Michael Flynn, and Fangyu Luo","title":"Composable Core-sets for Diversity Approximation on Multi-Dataset\n  Streams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Core-sets refer to subsets of data that maximize some function that is\ncommonly a diversity or group requirement. These subsets are used in place of\nthe original data to accomplish a given task with comparable or even enhanced\nperformance if biases are removed. Composable core-sets are core-sets with the\nproperty that subsets of the core set can be unioned together to obtain an\napproximation for the original data; lending themselves to be used for streamed\nor distributed data. Recent work has focused on the use of core-sets for\ntraining machine learning models. Preceding solutions such as CRAIG have been\nproven to approximate gradient descent while providing a reduced training time.\nIn this paper, we introduce a core-set construction algorithm for constructing\ncomposable core-sets to summarize streamed data for use in active learning\nenvironments. If combined with techniques such as CRAIG and heuristics to\nenhance construction speed, composable core-sets could be used for real time\ntraining of models when the amount of sensor data is large. We provide\nempirical analysis by considering extrapolated data for the runtime of such a\nbrute force algorithm. This algorithm is then analyzed for efficiency through\naveraged empirical regression and key results and improvements are suggested\nfor further research on the topic.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:24:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Stephanie",""],["Flynn","Michael",""],["Luo","Fangyu",""]]}
{"id":"2308.05879","submitter":"Adriano Tiribocchi","authors":"S. Succi, A. Tiribocchi","title":"Navier-Stokes-Schr\\\"odinger equation for dissipative fluids","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a mapping between a Schr\\\"odinger equation with a complex\ndiffusion along with a complex potential and the Navier-Stokes equation.\nFollowing a generalization of the Madelung transformations, we show that the\ninclusion of above contributions leads to continuity and momentum equations for\na dissipative incompressible Navier-Stokes fluid. The dynamics is found to\npreserve unitarity, a condition that is lost if non-imaginary potentials are\nconsidered. The present model may facilitate the formulation of quantum\nalgorithms for classical dissipative fluids. In particular, since quantum wave\nequations of this sort have recently been used to develop analogies between\npolariton systems and the Kardar-Parisi-Zhang (KPZ) equation, the present model\nmay open up intriguing prospects for polariton-based realizations of quantum\ncomputers.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:44:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Succi","S.",""],["Tiribocchi","A.",""]]}
{"id":"2308.05880","submitter":"Xiaoyuan Fan","authors":"Xue Li and Kishan Prudhvi Guddanti and Samrat Acharya and Patrick\n  Royer and Xiaoyuan Fan and Marcelo Elizondo","title":"Smart Data Mapping for Connecting Power System Model and Geospatial Data","comments":"5 pages, i figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Knowing the geospatial locations of power system model elements and linking\nload models with end users and their communities are the foundation for\nanalyzing system resilience and vulnerability to natural hazards. However,\npower system models and geospatial data for power grid assets are often\ndeveloped asynchronously without close coordination. Creating a direct mapping\nbetween the two is a challenging task, mainly due to heterogeneous data\nstructures, target uses, historical legacies, and human errors. This work aims\nto build an automatic data mapping workflow to connect the two, and to support\nenergy grid resilience studies for Puerto Rico. The primary steps in this\nworkflow include constructing graphs using geospatial data, and aligning them\nto the transmission networks defined in the power system data. The results have\nbeen evaluated against existing manual mapping practices for part of the Puerto\nRico Power Grid model to illustrate the performance of such auto-mapping\nsolutions.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:46:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Xue",""],["Guddanti","Kishan Prudhvi",""],["Acharya","Samrat",""],["Royer","Patrick",""],["Fan","Xiaoyuan",""],["Elizondo","Marcelo",""]]}
{"id":"2308.05881","submitter":"Richard Wang","authors":"Tianxiao Zhang, Kaidong Li, Xiangyu Chen, Cuncong Zhong, Bo Luo, Ivan\n  Grijalva, Brian McCornack, Daniel Flippo, Ajay Sharda, Guanghui Wang","title":"Aphid Cluster Recognition and Detection in the Wild Using Deep Learning\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aphid infestation poses a significant threat to crop production, rural\ncommunities, and global food security. While chemical pest control is crucial\nfor maximizing yields, applying chemicals across entire fields is both\nenvironmentally unsustainable and costly. Hence, precise localization and\nmanagement of aphids are essential for targeted pesticide application. The\npaper primarily focuses on using deep learning models for detecting aphid\nclusters. We propose a novel approach for estimating infection levels by\ndetecting aphid clusters. To facilitate this research, we have captured a\nlarge-scale dataset from sorghum fields, manually selected 5,447 images\ncontaining aphids, and annotated each individual aphid cluster within these\nimages. To facilitate the use of machine learning models, we further process\nthe images by cropping them into patches, resulting in a labeled dataset\ncomprising 151,380 image patches. Then, we implemented and compared the\nperformance of four state-of-the-art object detection models (VFNet, GFLV2,\nPAA, and ATSS) on the aphid dataset. Extensive experimental results show that\nall models yield stable similar performance in terms of average precision and\nrecall. We then propose to merge close neighboring clusters and remove tiny\nclusters caused by cropping, and the performance is further boosted by around\n17%. The study demonstrates the feasibility of automatically detecting and\nmanaging insects using machine learning models. The labeled dataset will be\nmade openly available to the research community.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:53:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Tianxiao",""],["Li","Kaidong",""],["Chen","Xiangyu",""],["Zhong","Cuncong",""],["Luo","Bo",""],["Grijalva","Ivan",""],["McCornack","Brian",""],["Flippo","Daniel",""],["Sharda","Ajay",""],["Wang","Guanghui",""]]}
{"id":"2308.05882","submitter":"Christophe Bonneville","authors":"Christophe Bonneville, Youngsoo Choi, Debojyoti Ghosh, Jonathan L.\n  Belof","title":"GPLaSDI: Gaussian Process-based Interpretable Latent Space Dynamics\n  Identification through Deep Autoencoder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.LG cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerically solving partial differential equations (PDEs) can be challenging\nand computationally expensive. This has led to the development of reduced-order\nmodels (ROMs) that are accurate but faster than full order models (FOMs).\nRecently, machine learning advances have enabled the creation of non-linear\nprojection methods, such as Latent Space Dynamics Identification (LaSDI). LaSDI\nmaps full-order PDE solutions to a latent space using autoencoders and learns\nthe system of ODEs governing the latent space dynamics. By interpolating and\nsolving the ODE system in the reduced latent space, fast and accurate ROM\npredictions can be made by feeding the predicted latent space dynamics into the\ndecoder. In this paper, we introduce GPLaSDI, a novel LaSDI-based framework\nthat relies on Gaussian process (GP) for latent space ODE interpolations. Using\nGPs offers two significant advantages. First, it enables the quantification of\nuncertainty over the ROM predictions. Second, leveraging this prediction\nuncertainty allows for efficient adaptive training through a greedy selection\nof additional training data points. This approach does not require prior\nknowledge of the underlying PDEs. Consequently, GPLaSDI is inherently\nnon-intrusive and can be applied to problems without a known PDE or its\nresidual. We demonstrate the effectiveness of our approach on the Burgers\nequation, Vlasov equation for plasma physics, and a rising thermal bubble\nproblem. Our proposed method achieves between 200 and 100,000 times speed-up,\nwith up to 7% relative error.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 23:54:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bonneville","Christophe",""],["Choi","Youngsoo",""],["Ghosh","Debojyoti",""],["Belof","Jonathan L.",""]]}
{"id":"2308.05883","submitter":"Gourab Mukherjee","authors":"Jiajun Luo, Trambak Banerjee, Gourab Mukherjee and Wenguang Sun","title":"Empirical Bayes Estimation with Side Information: A Nonparametric\n  Integrative Tweedie Approach","comments":"the paper is based on chapter 2 of Jiajun Luo's PhD thesis which is\n  archived at https://digitallibrary.usc.edu/asset-management/2A3BF1OVJ47TH","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the problem of compound estimation of normal means while\naccounting for the presence of side information. Leveraging the empirical Bayes\nframework, we develop a nonparametric integrative Tweedie (NIT) approach that\nincorporates structural knowledge encoded in multivariate auxiliary data to\nenhance the precision of compound estimation. Our approach employs convex\noptimization tools to estimate the gradient of the log-density directly,\nenabling the incorporation of structural constraints. We conduct theoretical\nanalyses of the asymptotic risk of NIT and establish the rate at which NIT\nconverges to the oracle estimator. As the dimension of the auxiliary data\nincreases, we accurately quantify the improvements in estimation risk and the\nassociated deterioration in convergence rate. The numerical performance of NIT\nis illustrated through the analysis of both simulated and real data,\ndemonstrating its superiority over existing methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:24:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Luo","Jiajun",""],["Banerjee","Trambak",""],["Mukherjee","Gourab",""],["Sun","Wenguang",""]]}
{"id":"2308.05884","submitter":"Alpin Dale","authors":"Tear Gosling, Alpin Dale, Yinhe Zheng","title":"PIPPA: A Partially Synthetic Conversational Dataset","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  With the emergence of increasingly powerful large language models, there is a\nburgeoning interest in leveraging these models for casual conversation and\nrole-play applications. However, existing conversational and role-playing\ndatasets often fail to capture the diverse and nuanced interactions typically\nexhibited by real-world role-play participants. To address this limitation and\ncontribute to the rapidly growing field, we introduce a partially-synthetic\ndataset named PIPPA (Personal Interaction Pairs between People and AI). PIPPA\nis a result of a community-driven crowdsourcing effort involving a group of\nrole-play enthusiasts. The dataset comprises over 1 million utterances that are\ndistributed across 26,000 conversation sessions and provides a rich resource\nfor researchers and AI developers to explore and refine conversational AI\nsystems in the context of role-play scenarios.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:33:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gosling","Tear",""],["Dale","Alpin",""],["Zheng","Yinhe",""]]}
{"id":"2308.05885","submitter":"Choonkil Park","authors":"C. Jayakumar, A. Murugesan, Vediyappan Govindan, Choonkil Park","title":"Oscillation conditions of half-linear delay difference equations of\n  second-","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of our work is to investigate the oscillation and asymptotic\nproperties of a class of difference equations with a condition. In contrast to\nmost previous studies, the oscillation of the investigated equation is obtained\nwith only one condition.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:35:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jayakumar","C.",""],["Murugesan","A.",""],["Govindan","Vediyappan",""],["Park","Choonkil",""]]}
{"id":"2308.05886","submitter":"Oliver Monti","authors":"Joohyung Park, Ayan N. Batyrkhanov, J.R. Schaibley and Oliver L.A.\n  Monti","title":"Proximitization: Opportunities for Manipulating Correlations in Hybrid\n  Organic / 2D Materials","comments":"32 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":"  Van der Waals layered and 2D materials constitute an extraordinary playground\nfor condensed matter physics, since the strong confinement of wavefunctions to\ntwo dimensions supports a diverse set of correlated phenomena. By creating\ncarefully designed heterostructures, these can be readily manipulated. In this\nPerspective, we advance the viewpoint that heterostructures from from these\nmaterials with thin layers of organic molecules offer an opportunity for\ncreating and manipulating the correlated degrees of freedom in unprecedented\nways. We briefly survey what has been accomplished thus far, including proposed\nmechanisms, before concentrating on unique opportunities offered by the vast\nselection of available organic molecules. We further introduce the notion of\nproximitization in combination with symmetry breaking as a fertile and\npotentially unifying conceptual vantage point from which to consider\nopportunities for tailoring correlations in van der Waals layered materials.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:38:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Park","Joohyung",""],["Batyrkhanov","Ayan N.",""],["Schaibley","J. R.",""],["Monti","Oliver L. A.",""]]}
{"id":"2308.05887","submitter":"M. Marques Alves","authors":"M. Marques Alves, Benar F. Svaiter","title":"A search-free $O(1/k^{3/2})$ homotopy inexact proximal-Newton\n  extragradient algorithm for monotone variational inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present and study the iteration-complexity of a relative-error inexact\nproximal-Newton extragradient algorithm for solving smooth monotone variational\ninequality problems in real Hilbert spaces. We removed a search procedure from\nMonteiro and Svaiter (2012) by introducing a novel approach based on homotopy,\nwhich requires the resolution (at each iteration) of a single strongly monotone\nlinear variational inequality. For a given tolerance $\\rho>0$, our main\nalgorithm exhibits pointwise $O\\left(\\frac{1}{\\rho}\\right)$ and ergodic\n$O\\left(\\frac{1}{\\rho^{2/3}}\\right)$ iteration-complexities.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:38:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Alves","M. Marques",""],["Svaiter","Benar F.",""]]}
{"id":"2308.05888","submitter":"Daniel Ries","authors":"Daniel Ries, Alicia Carriquiry","title":"The Relationship between Moderate to Vigorous Physical Activity and\n  Metabolic Syndrome: A Bayesian Measurement Error Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Metabolic Syndrome (MetS) is a serious condition that can be an early warning\nsign of heart disease and Type 2 diabetes. MetS is characterized by having\nelevated levels of blood pressure, cholesterol, waist circumference, and\nfasting glucose. There are many articles in the literature exploring the\nrelationship between physical activity and MetS, but most do not consider the\nmeasurement error in the physical activity measurements nor the correlations\namong the MetS risk factors. Furthermore, previous work has generally treated\nMetS as binary, rather than directly modeling the risk factors on their\nmeasured, continuous space. Using data from the National Health and Nutrition\nExamination Survey (NHANES), we explore the relationship between minutes of\nmoderate to vigorous physical activity (MVPA) and MetS risk factors. We\nconstruct a measurement error model for the accelerometry data, and then model\nits relationship between MetS risk factors with nonlinear seemingly unrelated\nregressions, incorporating dependence among MetS risk factors. The novel\nfeatures of this model give the medical research community a new way to\nunderstand relationships between MVPA and MetS. The results of this approach\npresent the field with a different modeling perspective than previously taken\nand suggest future avenues of scientific discovery.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:42:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ries","Daniel",""],["Carriquiry","Alicia",""]]}
{"id":"2308.05889","submitter":"Lingkai Kong","authors":"Lingkai Kong, Wenhao Mu, Jiaming Cui, Yuchen Zhuang, B. Aditya\n  Prakash, Bo Dai, Chao Zhang","title":"DF2: Distribution-Free Decision-Focused Learning","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Decision-focused learning (DFL) has recently emerged as a powerful approach\nfor predict-then-optimize problems by customizing a predictive model to a\ndownstream optimization task. However, existing end-to-end DFL methods are\nhindered by three significant bottlenecks: model mismatch error, sample average\napproximation error, and gradient approximation error. Model mismatch error\nstems from the misalignment between the model's parameterized predictive\ndistribution and the true probability distribution. Sample average\napproximation error arises when using finite samples to approximate the\nexpected optimization objective. Gradient approximation error occurs as DFL\nrelies on the KKT condition for exact gradient computation, while most methods\napproximate the gradient for backpropagation in non-convex objectives. In this\npaper, we present DF2 -- the first \\textit{distribution-free} decision-focused\nlearning method explicitly designed to address these three bottlenecks. Rather\nthan depending on a task-specific forecaster that requires precise model\nassumptions, our method directly learns the expected optimization function\nduring training. To efficiently learn the function in a data-driven manner, we\ndevise an attention-based model architecture inspired by the distribution-based\nparameterization of the expected objective. Our method is, to the best of our\nknowledge, the first to address all three bottlenecks within a single model. We\nevaluate DF2 on a synthetic problem, a wind power bidding problem, and a\nnon-convex vaccine distribution problem, demonstrating the effectiveness of\nDF2.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:44:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kong","Lingkai",""],["Mu","Wenhao",""],["Cui","Jiaming",""],["Zhuang","Yuchen",""],["Prakash","B. Aditya",""],["Dai","Bo",""],["Zhang","Chao",""]]}
{"id":"2308.05890","submitter":"Aamir Hamid","authors":"Aamir Hamid, Hemanth Reddy Samidi, Tim Finin, Primal Pappachan,\n  Roberto Yus","title":"PrivacyLens: A Framework to Collect and Analyze the Landscape of Past,\n  Present, and Future Smart Device Privacy Policies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  As the adoption of smart devices continues to permeate all aspects of our\nlives, concerns surrounding user privacy have become more pertinent than ever\nbefore. While privacy policies define the data management practices of their\nmanufacturers, previous work has shown that they are rarely read and understood\nby users. Hence, automatic analysis of privacy policies has been shown to help\nprovide users with appropriate insights. Previous research has extensively\nanalyzed privacy policies of websites, e-commerce, and mobile applications, but\nprivacy policies of smart devices, present some differences and specific\nchallenges such as the difficulty to find and collect them. We present\nPrivacyLens, a novel framework for discovering and collecting past, present,\nand future smart device privacy policies and harnessing NLP and ML algorithms\nto analyze them. PrivacyLens is currently deployed, collecting, analyzing, and\npublishing insights about privacy policies to assist different stakeholders of\nsmart devices, such as users, policy authors, and regulators. We show several\nexamples of analytical tasks enabled by PrivacyLens, including comparisons of\ndevices per type and manufacturing country, categorization of privacy policies,\nand impact of data regulations on data practices. At the time of submitting\nthis paper, PrivacyLens had collected and analyzed more than 1,200 privacy\npolicies for 7,300 smart device\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:52:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hamid","Aamir",""],["Samidi","Hemanth Reddy",""],["Finin","Tim",""],["Pappachan","Primal",""],["Yus","Roberto",""]]}
{"id":"2308.05891","submitter":"Daniel Ries","authors":"Daniel Ries, Alicia Carriquiry","title":"Assessing adult physical activity and compliance with 2008 CDC\n  guidelines using a Bayesian two-part measurement error model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While there is wide agreement that physical activity is an important\ncomponent of a healthy lifestyle, it is unclear how many people adhere to\npublic health recommendations on physical activity. The Physical Activity\nGuidelines (PAG), published by the CDC, provide guidelines to American adults,\nbut it is difficult to assess compliance with these guidelines. The PAG further\ncomplicate adherence assessment by recommending activity to occur in at least\n10 minute bouts. To better understand the measurement capabilities of various\ninstruments to quantify activity, and to propose an approach to evaluate\nactivity relative to the PAG, researchers at Iowa State University administered\nthe Physical Activity Measurement Survey (PAMS) to over 1,000 participants in\nfour different Iowa counties. In this paper, we develop a two-part Bayesian\nmeasurement error model and apply it to the PAMS data in order to assess\ncompliance to the PAG in the Iowa adult population. The model accurately\naccounts for the 10 minute bout requirement put forth in the PAG. The\nmeasurement error model corrects biased estimates and accounts for day to day\nvariation in activity. The model is also applied to the nationally\nrepresentative National Health and Nutrition Examination Survey.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:53:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ries","Daniel",""],["Carriquiry","Alicia",""]]}
{"id":"2308.05892","submitter":"Lukas Wenzl","authors":"Lukas Wenzl, Shi-Fan Chen, Rachel Bean","title":"Magnification Bias Estimators for Realistic Surveys: an Application to\n  the BOSS Survey","comments":"14 pages, 9 figures, 3 tables, prepared for submission to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In addition to the intrinsic clustering of galaxies themselves, the spatial\ndistribution of galaxies observed in surveys is modulated by the presence of\nweak lensing due to matter in the foreground. This effect, known as\nmagnification bias, is a significant contaminant to analyses of galaxy-lensing\ncross-correlations and must be carefully modeled. We present a method to\nestimate the magnification bias in spectroscopically confirmed galaxy samples\nbased on finite differences of galaxy catalogs while marginalizing over errors\ndue to finite step size. We use our estimator to measure the magnification\nbiases of the CMASS and LOWZ samples in the SDSS BOSS galaxy survey,\nanalytically taking into account the dependence on galaxy shape for fiber and\nPSF magnitudes, finding $\\alpha_{\\rm CMASS} = 2.71 \\pm 0.02$ and $\\alpha_{\\rm\nLOWZ} = 2.45 \\pm 0.02$ and quantify modeling uncertainties in these\nmeasurements. Finally, we quantify the redshift evolution of the magnification\nbias within the CMASS and LOWZ samples, finding a difference of up to a factor\nof three between the lower and upper redshift bounds for the former. We discuss\nhow to account for this evolution in modeling and its interaction with commonly\napplied redshift-dependent weights. Our method should be readily-applicable to\nupcoming surveys and we make our code publicly available as part of this work.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:55:36 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wenzl","Lukas",""],["Chen","Shi-Fan",""],["Bean","Rachel",""]]}
{"id":"2308.05893","submitter":"Jaehoon Chung","authors":"Jaehoon Chung, Jamil Fayyad, Younes Al Younes, and Homayoun Najjaran","title":"Learning to Team-Based Navigation: A Review of Deep Reinforcement\n  Learning Techniques for Multi-Agent Pathfinding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.MA cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-agent pathfinding (MAPF) is a critical field in many large-scale\nrobotic applications, often being the fundamental step in multi-agent systems.\nThe increasing complexity of MAPF in complex and crowded environments, however,\ncritically diminishes the effectiveness of existing solutions. In contrast to\nother studies that have either presented a general overview of the recent\nadvancements in MAPF or extensively reviewed Deep Reinforcement Learning (DRL)\nwithin multi-agent system settings independently, our work presented in this\nreview paper focuses on highlighting the integration of DRL-based approaches in\nMAPF. Moreover, we aim to bridge the current gap in evaluating MAPF solutions\nby addressing the lack of unified evaluation metrics and providing\ncomprehensive clarification on these metrics. Finally, our paper discusses the\npotential of model-based DRL as a promising future direction and provides its\nrequired foundational understanding to address current challenges in MAPF. Our\nobjective is to assist readers in gaining insight into the current research\ndirection, providing unified metrics for comparing different MAPF algorithms\nand expanding their knowledge of model-based DRL to address the existing\nchallenges in MAPF.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:59:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chung","Jaehoon",""],["Fayyad","Jamil",""],["Younes","Younes Al",""],["Najjaran","Homayoun",""]]}
{"id":"2308.05894","submitter":"Felipe Riquelme Abarca","authors":"Felipe Riquelme and Anibal Velozo","title":"On the Hausdorff dimension of geodesics that diverge on average","comments":"23 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we prove that the Hausdorff dimension of geodesic directions\nthat are recurrent and diverge on average coincides with the entropy at\ninfinity of the geodesic flow for any complete, pinched negatively curved\nRiemannian manifold. We derive an interesting consequence from this result, we\nprove that the entropy of a {\\sigma}-finite, ergodic and conservative infinite\ninvariant measure is bounded from above by the entropy at infinity of the\ngeodesic flow.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:01:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Riquelme","Felipe",""],["Velozo","Anibal",""]]}
{"id":"2308.05895","submitter":"Peter Hansen","authors":"Chen Tong and Peter Reinhard Hansen","title":"Characterizing Correlation Matrices that Admit a Clustered Factor\n  Representation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Clustered Factor (CF) model induces a block structure on the correlation\nmatrix and is commonly used to parameterize correlation matrices. Our results\nreveal that the CF model imposes superfluous restrictions on the correlation\nmatrix. This can be avoided by a different parametrization, involving the\nlogarithmic transformation of the block correlation matrix.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:07:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tong","Chen",""],["Hansen","Peter Reinhard",""]]}
{"id":"2308.05896","submitter":"Chuanxin Song","authors":"Chuanxin Song, Hanbo Wu, Xin Ma","title":"Semantic-embedded Similarity Prototype for Scene Recognition","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the high inter-class similarity caused by the complex composition\nwithin scenes and the co-existing objects across scenes, various studies have\nexplored object semantic knowledge within scenes to improve scene recognition.\nHowever, a resulting issue arises as semantic segmentation or object detection\ntechniques demand heavy computational power, thereby burdening the network\nconsiderably. This limitation often renders object-assisted approaches\nincompatible with edge devices. In contrast, this paper proposes a\nsemantic-based similarity prototype that assists the scene recognition network\nto achieve higher accuracy without increasing network parameters. It is simple\nand can be plug-and-played into existing pipelines. More specifically, a\nstatistical strategy is introduced to depict semantic knowledge in scenes as\nclass-level semantic representations. These representations are utilized to\nexplore inter-class correlations, ultimately constructing a similarity\nprototype. Furthermore, we propose two ways to use the similarity prototype to\nsupport network training from the perspective of gradient label softening and\nbatch-level contrastive loss, respectively. Comprehensive evaluations on\nmultiple benchmarks show that our similarity prototype enhances the performance\nof existing networks without adding any computational burden. Code and the\nstatistical similarity prototype will be available soon.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:11:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Song","Chuanxin",""],["Wu","Hanbo",""],["Ma","Xin",""]]}
{"id":"2308.05897","submitter":"Ava Fascetti","authors":"Yinan Xuan, Ava J. Fascetti, Colin Barry, and Edward J. Wang","title":"Development of a One Dollar Blood Pressure Monitor","comments":"4 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  BPClip is an ultra-low-cost cuffless blood pressure monitor. As a universal\nsmartphone attachment, BPClip leverages the computational imaging power of\nsmartphones to perform oscillometry based blood pressure measurements. This\npaper examines different design considerations in BPClip's development. The\ncost and accuracy of blood pressure measurements are the central design goals.\nBoth of these requirements are achieved with the initial prototype that\nachieves a $0.80 USD material cost and a mean absolute error of 8.72 and 5.49\nmmHg for systolic and diastolic blood pressure, respectively. Since a main\nmotivator to develop BPClip is making blood pressure monitoring more\naccessible, usability is also central to the design. User studies were\nconducted throughout the design process to inform the most intuitive and\naccessible design features. In this paper, we demystify the design process to\nshare effective design practices with future developers working towards\nexpanding health monitoring access beyond traditional clinical settings.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:18:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xuan","Yinan",""],["Fascetti","Ava J.",""],["Barry","Colin",""],["Wang","Edward J.",""]]}
{"id":"2308.05898","submitter":"Jieshan Chen","authors":"Jieshan Chen, Jiamou Sun, Sidong Feng, Zhenchang Xing, Qinghua Lu,\n  Xiwei Xu, Chunyang Chen","title":"Unveiling the Tricks: Automated Detection of Dark Patterns in Mobile\n  Applications","comments":"20 pages, 9 figures, accepted by UIST 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Mobile apps bring us many conveniences, such as online shopping and\ncommunication, but some use malicious designs called dark patterns to trick\nusers into doing things that are not in their best interest. Many works have\nbeen done to summarize the taxonomy of these patterns and some have tried to\nmitigate the problems through various techniques. However, these techniques are\neither time-consuming, not generalisable or limited to specific patterns. To\naddress these issues, we propose UIGuard, a knowledge-driven system that\nutilizes computer vision and natural language pattern matching to automatically\ndetect a wide range of dark patterns in mobile UIs. Our system relieves the\nneed for manually creating rules for each new UI/app and covers more types with\nsuperior performance. In detail, we integrated existing taxonomies into a\nconsistent one, conducted a characteristic analysis and distilled knowledge\nfrom real-world examples and the taxonomy. Our UIGuard consists of two\ncomponents, Property Extraction and Knowledge-Driven Dark Pattern Checker. We\ncollected the first dark pattern dataset, which contains 4,999 benign UIs and\n1,353 malicious UIs of 1,660 instances spanning 1,023 mobile apps. Our system\nachieves a superior performance in detecting dark patterns (micro averages:\n0.82 in precision, 0.77 in recall, 0.79 in F1 score). A user study involving 58\nparticipants further shows that \\tool{} significantly increases users'\nknowledge of dark patterns.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:18:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Jieshan",""],["Sun","Jiamou",""],["Feng","Sidong",""],["Xing","Zhenchang",""],["Lu","Qinghua",""],["Xu","Xiwei",""],["Chen","Chunyang",""]]}
{"id":"2308.05899","submitter":"Andrew Lincowski","authors":"Andrew P. Lincowski, Victoria S. Meadows, Sebastian Zieba, Laura\n  Kreidberg, Caroline Morley, Micha\\\"el Gillon, Franck Selsis, Eric Agol,\n  Emeline Bolmont, Elsa Ducrot, Renyu Hu, Daniel D. B. Koll, Xintong Lyu, Avi\n  Mandell, Gabrielle Suissa, Patrick Tamburo","title":"Potential Atmospheric Compositions of TRAPPIST-1 c constrained by\n  JWST/MIRI Observations at 15 $\\mu$m","comments":"15 pages, accepted to APJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first JWST observations of TRAPPIST-1 c showed a secondary eclipse depth\nof 421+/-94 ppm at 15 um, which is consistent with a bare rock surface or a\nthin, O2-dominated, low CO2 atmosphere (Zieba et al. 2023). Here, we further\nexplore potential atmospheres for TRAPPIST-1 c by comparing the observed\nsecondary eclipse depth to synthetic spectra of a broader range of plausible\nenvironments. To self-consistently incorporate the impact of photochemistry and\natmospheric composition on atmospheric thermal structure and predicted eclipse\ndepth, we use a two-column climate model coupled to a photochemical model, and\nsimulate O2-dominated, Venus-like, and steam atmospheres. We find that a\nbroader suite of plausible atmospheric compositions are also consistent with\nthe data. For lower pressure atmospheres (0.1 bar), our O2-CO2 atmospheres\nproduce eclipse depths within 1$\\sigma$ of the data, consistent with the\nmodeling results of Zieba et al. (2023). However, for higher-pressure\natmospheres, our models produce different temperature-pressure profiles and are\nless pessimistic, with 1-10 bar O2, 100 ppm CO2 models within 2.0-2.2$\\sigma$\nof the measured secondary eclipse depth, and up to 0.5% CO2 within 2.9$\\sigma$.\nVenus-like atmospheres are still unlikely. For thin O2 atmospheres of 0.1 bar\nwith a low abundance of CO2 ($\\sim$100 ppm), up to 10% water vapor can be\npresent and still provide an eclipse depth within 1$\\sigma$ of the data. We\ncompared the TRAPPIST-1 c data to modeled steam atmospheres of $\\leq$ 3 bar,\nwhich are 1.7-1.8$\\sigma$ from the data and not conclusively ruled out. More\ndata will be required to discriminate between possible atmospheres, or to more\ndefinitively support the bare rock hypothesis.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:21:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lincowski","Andrew P.",""],["Meadows","Victoria S.",""],["Zieba","Sebastian",""],["Kreidberg","Laura",""],["Morley","Caroline",""],["Gillon","Micha\u00ebl",""],["Selsis","Franck",""],["Agol","Eric",""],["Bolmont","Emeline",""],["Ducrot","Elsa",""],["Hu","Renyu",""],["Koll","Daniel D. B.",""],["Lyu","Xintong",""],["Mandell","Avi",""],["Suissa","Gabrielle",""],["Tamburo","Patrick",""]]}
{"id":"2308.05900","submitter":"Nguyen Tuan Hung","authors":"Nguyen T. Hung, Jianqi Huang, Yuki Tatsumi, Teng Yang, Riichiro Saito","title":"QERaman: An open-source program for calculating resonance Raman spectra\n  based on Quantum ESPRESSO","comments":"10 pages, 6 figures, 2 tables","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 present an open-source program QERaman that computes first-order resonance\nRaman spectroscopy of materials using the output data from Quantum ESPRESSO.\nComplex values of Raman tensors are calculated based on the quantum description\nof the Raman scattering from calculations of electron-photon and\nelectron-phonon matrix elements, which are obtained by using the modified\nQuantum ESPRESSO. Our program also calculates the resonant Raman spectra as a\nfunction of incident laser energy for linearly- or circularly-polarized light.\nHands-on tutorials for graphene and MoS$_2$ are given to show how to run\nQERaman. All codes, examples, and scripts are available on the GitHub\nrepository.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:25:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hung","Nguyen T.",""],["Huang","Jianqi",""],["Tatsumi","Yuki",""],["Yang","Teng",""],["Saito","Riichiro",""]]}
{"id":"2308.05901","submitter":"Shenghui Cheng","authors":"Jinyu Li, Ping Hu, Weicheng Cui, Tianyi Huang, and Shenghui Cheng","title":"Deepsea: A Meta-ocean Prototype for Undersea Exploration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Metaverse has attracted great attention from industry and academia in recent\nyears. Metaverse for the ocean (Meta-ocean) is the implementation of the\nMetaverse technologies in virtual emersion of the ocean which is beneficial for\npeople yearning for the ocean. It has demonstrated great potential for tourism\nand education with its strong immersion and appealing interactive user\nexperience. However, quite limited endeavors have been spent on exploring the\nfull possibility of Meta-ocean, especially in modeling the movements of marine\ncreatures. In this paper, we first investigate the technology status of\nMetaverse and virtual reality (VR) and develop a prototype that builds the\nMeta-ocean in VR devices with strong immersive visual effects. Then, we\ndemonstrate a method to model the undersea scene and marine creatures and\npropose an optimized path algorithm based on the Catmull-Rom spline to model\nthe movements of marine life. Finally, we conduct a user study to analyze our\nMeta-ocean prototype. This user study illustrates that our new prototype can\ngive us strong immersion and an appealing interactive user experience.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:39:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Jinyu",""],["Hu","Ping",""],["Cui","Weicheng",""],["Huang","Tianyi",""],["Cheng","Shenghui",""]]}
{"id":"2308.05902","submitter":"Chen Xu","authors":"Chen Xu, Xiaopeng Ye, Jun Xu, Xiao Zhang, Weiran Shen, Ji-Rong Wen","title":"LTP-MMF: Towards Long-term Provider Max-min Fairness Under\n  Recommendation Feedback Loops","comments":"arXiv admin note: text overlap with arXiv:2303.06660","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-stakeholder recommender systems involve various roles, such as users,\nproviders. Previous work pointed out that max-min fairness (MMF) is a better\nmetric to support weak providers. However, when considering MMF, the features\nor parameters of these roles vary over time, how to ensure long-term provider\nMMF has become a significant challenge. We observed that recommendation\nfeedback loops (named RFL) will influence the provider MMF greatly in the long\nterm. RFL means that recommender system can only receive feedback on exposed\nitems from users and update recommender models incrementally based on this\nfeedback. When utilizing the feedback, the recommender model will regard\nunexposed item as negative. In this way, tail provider will not get the\nopportunity to be exposed, and its items will always be considered as negative\nsamples. Such phenomenons will become more and more serious in RFL. To\nalleviate the problem, this paper proposes an online ranking model named\nLong-Term Provider Max-min Fairness (named LTP-MMF). Theoretical analysis shows\nthat the long-term regret of LTP-MMF enjoys a sub-linear bound. Experimental\nresults on three public recommendation benchmarks demonstrated that LTP-MMF can\noutperform the baselines in the long term.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:52:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xu","Chen",""],["Ye","Xiaopeng",""],["Xu","Jun",""],["Zhang","Xiao",""],["Shen","Weiran",""],["Wen","Ji-Rong",""]]}
{"id":"2308.05903","submitter":"Daniel Ries","authors":"Daniel Ries, Joshua Michalenko, Tyler Ganter, Rashad Imad-Fayez\n  Baiyasi, Jason Adams","title":"Comparing the quality of neural network uncertainty estimates for\n  classification problems","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":"  Traditional deep learning (DL) models are powerful classifiers, but many\napproaches do not provide uncertainties for their estimates. Uncertainty\nquantification (UQ) methods for DL models have received increased attention in\nthe literature due to their usefulness in decision making, particularly for\nhigh-consequence decisions. However, there has been little research done on how\nto evaluate the quality of such methods. We use statistical methods of\nfrequentist interval coverage and interval width to evaluate the quality of\ncredible intervals, and expected calibration error to evaluate classification\npredicted confidence. These metrics are evaluated on Bayesian neural networks\n(BNN) fit using Markov Chain Monte Carlo (MCMC) and variational inference (VI),\nbootstrapped neural networks (NN), Deep Ensembles (DE), and Monte Carlo (MC)\ndropout. We apply these different UQ for DL methods to a hyperspectral image\ntarget detection problem and show the inconsistency of the different methods'\nresults and the necessity of a UQ quality metric. To reconcile these\ndifferences and choose a UQ method that appropriately quantifies the\nuncertainty, we create a simulated data set with fully parameterized\nprobability distribution for a two-class classification problem. The gold\nstandard MCMC performs the best overall, and the bootstrapped NN is a close\nsecond, requiring the same computational expense as DE. Through this\ncomparison, we demonstrate that, for a given data set, different models can\nproduce uncertainty estimates of markedly different quality. This in turn\npoints to a great need for principled assessment methods of UQ quality in DL\napplications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:55:14 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ries","Daniel",""],["Michalenko","Joshua",""],["Ganter","Tyler",""],["Baiyasi","Rashad Imad-Fayez",""],["Adams","Jason",""]]}
{"id":"2308.05904","submitter":"Gianluca Calcagni","authors":"Gianluca Calcagni, Sachiko Kuroyanagi","title":"Log-periodic stochastic gravitational-wave background beyond Einstein\n  gravity","comments":"28 pages, 3 figures, 1 table. v2: section 3 reorganized and\n  shortened, conclusions expanded, references added","journal-ref":null,"doi":null,"report-no":"ET-0274A-23, IFT-UAM/CSIC-23-105","categories":"gr-qc astro-ph.CO hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Periodic patterns of logarithmic oscillations can arise in primordial\ncurvature perturbation spectra and in the associated stochastic\ngravitational-wave background via different mechanisms. We show that, in the\npresence of log oscillations, the spectral shape of the stochastic background\nhas a unique parametrization independent of its physical origin. We also show\nthat this log-periodic modulation can be generated in any scenario beyond\nEinstein gravity endowed with an approximate discrete scale invariance, a\nsymmetry typical of deterministic fractal spacetimes that could emerge in\nquantum gravity under certain conditions. We discuss how a log-oscillatory\nspectral shape arises from concrete inflationary models beyond Einstein gravity\nand the prospects for detection in Einstein Telescope and other next-generation\ngravitational-wave observatories. We find that these instruments will be\nsensitive to log-periodic features if the detection is made with a high\nsignal-to-noise ratio (SNR) and that the error scales as $1/{\\rm SNR}$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:01:13 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 10:12:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Calcagni","Gianluca",""],["Kuroyanagi","Sachiko",""]]}
{"id":"2308.05905","submitter":"Taylor Contreras","authors":"T. Contreras, A. Martins, C. Stanford, C. O. Escobar, R. Guenette, M.\n  stancari, J. Martin-Albo, B. Lawrence-Sanderson, A. Para, A. Kish, F.\n  Kellerer","title":"A Method To Characterize Metalenses For Light Collection Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph hep-ex physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Metalenses and metasurfaces are promising emerging technologies that could\nimprove light collection in light collection detectors, concentrating light on\nsmall area photodetectors such as silicon photomultipliers. Here we present a\ndetailed method to characterize metalenses to assess their efficiency at\nconcentrating monochromatic light coming from a wide range of incidence angles,\nnot taking into account their imaging quality.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 16:44:28 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 18:33:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Contreras","T.",""],["Martins","A.",""],["Stanford","C.",""],["Escobar","C. O.",""],["Guenette","R.",""],["stancari","M.",""],["Martin-Albo","J.",""],["Lawrence-Sanderson","B.",""],["Para","A.",""],["Kish","A.",""],["Kellerer","F.",""]]}
{"id":"2308.05906","submitter":"Zaman Keinath-Esmail","authors":"Zaman Keinath-Esmail","title":"On the equivalence of Occam algorithms","comments":"13 pages, submitted to Information and Computation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Blumer et al. (1987, 1989) showed that any concept class that is learnable by\nOccam algorithms is PAC learnable. Board and Pitt (1990) showed a partial\nconverse of this theorem: for concept classes that are closed under exception\nlists, any class that is PAC learnable is learnable by an Occam algorithm.\nHowever, their Occam algorithm outputs a hypothesis whose complexity is\n$\\delta$-dependent, which is an important limitation. In this paper, we show\nthat their partial converse applies to Occam algorithms with\n$\\delta$-independent complexities as well. Thus, we provide a posteriori\njustification of various theoretical results and algorithm design methods which\nuse the partial converse as a basis for their work.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:05:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Keinath-Esmail","Zaman",""]]}
{"id":"2308.05907","submitter":"Majid Daliri","authors":"Majid Daliri, Juliana Freire, Christopher Musco, A\\'ecio Santos,\n  Haoxiang Zhang","title":"Simple Analysis of Priority Sampling","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a tight upper bound on the variance of the priority sampling method\n(aka sequential Poisson sampling). Our proof is significantly shorter and\nsimpler than the original proof given by Mario Szegedy at STOC 2006, which\nresolved a conjecture by Duffield, Lund, and Thorup.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:09:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Daliri","Majid",""],["Freire","Juliana",""],["Musco","Christopher",""],["Santos","A\u00e9cio",""],["Zhang","Haoxiang",""]]}
{"id":"2308.05908","submitter":"Anton Artemyev","authors":"Xiaofei Shi, David S. Tonoian, Anton V. Artemyev, Xiao-Jia Zhang, and\n  Vassilis Angelopoulos","title":"Electron resonant interaction with whistler-mode waves around the\n  Earth's bow shock I: the probabilistic approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adiabatic heating of solar wind electrons at the Earth's bow shock and its\nforeshock region produces transversely anisotropic hot electrons that, in turn,\ngenerate intense high-frequency whistler-mode waves. These waves are often\ndetected by spacecraft as narrow-band, electromagnetic emissions in the\nfrequency range of [0.1,0.5] of the local electron gyrofrequency. Resonant\ninteractions between these waves and electrons may cause electron acceleration\nand pitch-angle scattering, which can be important for creating the electron\npopulation that seeds shock drift acceleration. The high intensity and\ncoherence of the observed whistler-mode waves prohibit the use of quasi-linear\ntheory to describe their interaction with electrons. In this paper, we aim to\ndevelop a new theoretical approach to describe this interaction, that\nincorporates nonlinear resonant interactions, gradients of the background\ndensity and magnetic field, and the fine structure of the waveforms that\nusually consist of short, intense wave-packet trains. This is the first of two\naccompanying papers. It outlines a probabilistic approach to describe the\nwave-particle interaction. We demonstrate how the wave-packet size affects\nelectron nonlinear resonance at the bow shock and foreshock regions, and how to\nevaluate electron distribution dynamics in such a system that is frequented by\nshort, intense whistler-mode wave-packets. In the second paper, this\nprobabilistic approach is merged with a mapping technique, which allows us to\nmodel systems containing short and long wave-packets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:16:36 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shi","Xiaofei",""],["Tonoian","David S.",""],["Artemyev","Anton V.",""],["Zhang","Xiao-Jia",""],["Angelopoulos","Vassilis",""]]}
{"id":"2308.05909","submitter":"Anton Artemyev","authors":"David S. Tonoian, Xiaofei Shi, Anton V. Artemyev, Xiao-Jia Zhang, and\n  Vassilis Angelopoulos","title":"Electron resonant interaction with whistler-mode waves around the\n  Earth's bow shock II: the mapping technique","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electron resonant scattering by high-frequency electromagnetic whistler-mode\nwaves has been proposed as a mechanism for solar wind electron scattering and\npre-acceleration to energies that enable them to participate in shock drift\nacceleration around the Earth's bow shock. However, observed whistler-mode\nwaves are often sufficiently intense to resonate with electrons nonlinearly,\nwhich prohibits the application of quasi-linear diffusion theory. This is the\nsecond of two accompanying papers devoted to developing a new theoretical\napproach for quantifying the electron distribution evolution subject to\nmultiple resonant interactions with intense whistler-mode wave-packets. In the\nfirst paper, we described a probabilistic approach, applicable to systems with\nshort wave-packets. For such systems, nonlinear resonant effects can be treated\nby diffusion theory, but with diffusion rates different from those of\nquasi-linear diffusion. In this paper we generalize this approach by merging it\nwith a mapping technique. This technique can be used to model the electron\ndistribution evolution in the presence of significantly non-diffusive resonant\nscattering by intense long wave-packets. We verify our technique by comparing\nits predictions with results from a numerical integration approach.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:20:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tonoian","David S.",""],["Shi","Xiaofei",""],["Artemyev","Anton V.",""],["Zhang","Xiao-Jia",""],["Angelopoulos","Vassilis",""]]}
{"id":"2308.05910","submitter":"Rashid Bikbaev Mr.","authors":"Rashid G. Bikbaev, Kuo-Ping Chen, Ivan V. Timofeev","title":"Two-dimensional dynamic beam steering by Tamm plasmon polariton","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":"  The dynamic steering of a beam reflected from a photonic structure supporting\nTamm plasmon polariton is demonstrated. The phase and amplitude of the\nreflected wave are adjusted by modulating the refractive index of a transparent\nconductive oxide layer by applying a bias voltage. It is shown that the\nproposed design allows for two-dimensional beam steering by deflecting the\nlight beam along the polar and azimuthal angles.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:22:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bikbaev","Rashid G.",""],["Chen","Kuo-Ping",""],["Timofeev","Ivan V.",""]]}
{"id":"2308.05911","submitter":"Yiheng Liu","authors":"Yiheng Liu, Junta Wu, Yi Fu","title":"Collaborative Tracking Learning for Frame-Rate-Insensitive Multi-Object\n  Tracking","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-object tracking (MOT) at low frame rates can reduce computational,\nstorage and power overhead to better meet the constraints of edge devices. Many\nexisting MOT methods suffer from significant performance degradation in\nlow-frame-rate videos due to significant location and appearance changes\nbetween adjacent frames. To this end, we propose to explore collaborative\ntracking learning (ColTrack) for frame-rate-insensitive MOT in a query-based\nend-to-end manner. Multiple historical queries of the same target jointly track\nit with richer temporal descriptions. Meanwhile, we insert an information\nrefinement module between every two temporal blocking decoders to better fuse\ntemporal clues and refine features. Moreover, a tracking object consistency\nloss is proposed to guide the interaction between historical queries. Extensive\nexperimental results demonstrate that in high-frame-rate videos, ColTrack\nobtains higher performance than state-of-the-art methods on large-scale\ndatasets Dancetrack and BDD100K, and outperforms the existing end-to-end\nmethods on MOT17. More importantly, ColTrack has a significant advantage over\nstate-of-the-art methods in low-frame-rate videos, which allows it to obtain\nfaster processing speeds by reducing frame-rate requirements while maintaining\nhigher performance. Code will be released at\nhttps://github.com/yolomax/ColTrack\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:25:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Yiheng",""],["Wu","Junta",""],["Fu","Yi",""]]}
{"id":"2308.05912","submitter":"Hector Galindo-Silva","authors":"Hector Galindo-Silva","title":"Ideological Ambiguity and Political Spectrum","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":"  This study examines the relationship between ambiguity and the ideological\npositioning of political parties across the political spectrum. We identify a\nstrong non-monotonic (inverted U-shaped) relationship between party ideology\nand ambiguity within a sample of 202 European political parties. This pattern\nis observed across all ideological dimensions covered in the data. To explain\nthis pattern, we propose a novel theory that suggests centrist parties are\nperceived as less risky by voters compared to extremist parties, giving them an\nadvantage in employing ambiguity to attract more voters at a lower cost. We\nsupport our explanation with additional evidence from electoral outcomes and\neconomic indicators in the respective party countries.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:30:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Galindo-Silva","Hector",""]]}
{"id":"2308.05913","submitter":"Mohamed Amazioug PhD","authors":"M. Amazioug, B. Maroufi and M. Daoud","title":"Creating mirror-mirror quantum correlations in optomechanics","comments":null,"journal-ref":null,"doi":"10.1140/epjd/e2020-100518-7","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the transfer of quantum correlations between two movable mirrors of\ntwo Fabry-P\\'erot cavities separated via broadband squeezed light and coupled\nvia photon hopping process. We investigate the transfer of quantum correlations\nfrom EPR entangled squeezed light to the movable mirrors. We show that Gaussian\nquantum steering remains lower than entanglement. We employ Gaussian quantum\nsteering to characterize the steerability between the two mechanical modes. The\nlogarithmic negativity is used as the witness of quantum entanglement and\nGaussian quantum discord gives the measure of all non classical correlations\nincluding entanglement. We conclude that the transfer of quantum correlations\nis optimal for a strong optomechanical coupling and decreases with the thermal\neffects. We also conclude that steering, entanglement and discord are directly\nrelated to photon hopping coupling and the squeezing parameter.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:38:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Amazioug","M.",""],["Maroufi","B.",""],["Daoud","M.",""]]}
{"id":"2308.05914","submitter":"Peimeng Yin","authors":"Peimeng Yin, Eirik Endeve, Cory D. Hauck, and Stefan R. Schnake","title":"A semi-implicit dynamical low-rank discontinuous Galerkin method for\n  space homogeneous kinetic equations. Part I: emission and absorption","comments":"33 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dynamical low-rank approximation (DLRA) is an emerging tool for reducing\ncomputational costs and provides memory savings when solving high-dimensional\nproblems. In this work, we propose and analyze a semi-implicit dynamical\nlow-rank discontinuous Galerkin (DLR-DG) method for the space homogeneous\nkinetic equation with a relaxation operator, modeling the emission and\nabsorption of particles by a background medium. Both DLRA and the DG scheme can\nbe formulated as Galerkin equations. To ensure their consistency, a weighted\nDLRA is introduced so that the resulting DLR-DG solution is a solution to the\nfully discrete DG scheme in a subspace of the classical DG solution space.\nSimilar to the classical DG method, we show that the proposed DLR-DG method is\nwell-posed. We also identify conditions such that the DLR-DG solution converges\nto the equilibrium. Numerical results are presented to demonstrate the\ntheoretical findings.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:39:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yin","Peimeng",""],["Endeve","Eirik",""],["Hauck","Cory D.",""],["Schnake","Stefan R.",""]]}
{"id":"2308.05915","submitter":"Drew Yarger","authors":"Drew Yarger, J. Derek Tucker","title":"Detecting changepoints in globally-indexed functional time series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In environmental and climate data, there is often an interest in determining\nif and when changes occur in a system. Such changes may result from localized\nsources in space and time like a volcanic eruption or climate geoengineering\nevents. Detecting such events and their subsequent influence on climate has\nimportant policy implications. However, the climate system is complex, and such\nchanges can be challenging to detect. One statistical perspective for\nchangepoint detection is functional time series, where one observes an entire\nfunction at each time point. We will consider the context where each time point\nis a year, and we observe a function of temperature indexed by day of the year.\nFurthermore, such data is measured at many spatial locations on Earth, which\nmotivates accommodating sets of functional time series that are\nspatially-indexed on a sphere. Simultaneously inferring changes that can occur\nat different times for different locations is challenging. We propose test\nstatistics for detecting these changepoints, and we evaluate performance using\nvarying levels of data complexity, including a simulation study, simplified\nclimate model simulations, and climate reanalysis data. We evaluate changes in\nstratospheric temperature globally over 1984-1998. Such changes may be\nassociated with the eruption of Mt. Pinatubo in 1991.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:45:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yarger","Drew",""],["Tucker","J. Derek",""]]}
{"id":"2308.05916","submitter":"Anamaria Berea","authors":"Edgar Arguello, Sam Carter, Cristina Grieg, Michael Hammer, Chris\n  Prather, Clark Petri, Anamaria Berea","title":"An Exploration of Mars Colonization with Agent-Based Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.MA nlin.AO stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Establishing a human settlement on Mars is an incredibly complex engineering\nproblem. The inhospitable nature of the Martian environment requires any\nhabitat to be largely self-sustaining. Beyond mining a few basic minerals and\nwater, the colonizers will be dependent on Earth resupply and replenishment of\nnecessities via technological means, i.e., splitting Martian water into oxygen\nfor breathing and hydrogen for fuel. Beyond the technical and engineering\nchallenges, future colonists will also face psychological and human behavior\nchallenges. Our goal is to better understand the behavioral and psychological\ninteractions of future Martian colonists through an Agent-Based Modeling (ABM\nsimulation) approach. We seek to identify areas of consideration for planning a\ncolony as well as propose a minimum initial population size required to create\na stable colony. Accounting for engineering and technological limitations, we\ndraw on research regarding high performing teams in isolated and high stress\nenvironments (ex: submarines, Arctic exploration, ISS, war) to include the 4\nbasic personality types within the ABM. Interactions between agents with\ndifferent psychological profiles are modeled at the individual level, while\nglobal events such as accidents or delays in Earth resupply affect the colony\nas a whole. From our multiple simulations and scenarios (up to 28 Earth years),\nwe found that an initial population of 22 was the minimum required to maintain\na viable colony size over the long run. We also found that the agreeable\npersonality type was the one more likely to survive. We find, contrary to other\nliterature, that the minimum number of people with all personality types that\ncan lead to a sustainable settlement is in the tens and not hundreds.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:52:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Arguello","Edgar",""],["Carter","Sam",""],["Grieg","Cristina",""],["Hammer","Michael",""],["Prather","Chris",""],["Petri","Clark",""],["Berea","Anamaria",""]]}
{"id":"2308.05917","submitter":"Rajesh Kr Yadav Dr","authors":"Suman Banerjee, Rajesh Kumar Yadav, Avinash Khare and Bhabani Prasad\n  Mandal","title":"A Class of Exactly Solvable Real and Complex $PT$ Symmetric\n  Reflectionless Potentials","comments":"26 pages, 49 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the question of the number of exactly solvable complex but\nPT-invariant reflectionless potentials with $N$ bound states. By carefully\nconsidering the $X_m$ rationally extended reflectionless potentials, we argue\nthat the total number of exactly solvable complex PT-invariant reflectionless\npotentials are $2[(2N-1)m+N]$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:53:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Banerjee","Suman",""],["Yadav","Rajesh Kumar",""],["Khare","Avinash",""],["Mandal","Bhabani Prasad",""]]}
{"id":"2308.05918","submitter":"Jun-Jie Wei Dr.","authors":"Jun-Jie Wei, Fulvio Melia","title":"Investigating Cosmological Models and the Hubble Tension using Localized\n  Fast Radio Bursts","comments":"11 pages, 6 figures, 1 table. Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the dispersion measure (DM) and redshift measurements of 24 localized\nfast radio bursts (FRBs) to compare cosmological models and investigate the\nHubble tension. Setting a flat prior on the DM contribution from the Milky\nWay's halo, $\\mathrm{DM_{halo}^{MW}}\\in[5,\\;80]\\;\\mathrm{pc\\;cm^{-3}}$, the\nbest fit for flat $\\Lambda$CDM is obtained with a Hubble constant\n$H_0=95.8^{+7.8}_{-9.2}\\;\\mathrm{km\\;s^{-1}\\;Mpc^{-1}}$ and a median matter\ndensity $\\Omega_{\\mathrm{m}}\\approx0.66$. The best fit for the\n$R_{\\mathrm{h}}=ct$ universe is realized with\n$H_0=94.2^{+5.6}_{-6.2}\\;\\mathrm{km\\;s^{-1}\\;Mpc^{-1}}$. We emphasize that the\n$H_0$ measurement depends sensitively on the $\\mathrm{DM_{halo}^{MW}}$ prior.\nSince flat $\\Lambda$CDM has one more free parameter, $R_{\\mathrm{h}}=ct$ is\nfavored by the Bayesian Information Criterion (BIC) with a likelihood of\n$\\sim73\\%$ versus $\\sim27\\%$. Through simulations, we find that if the real\ncosmology is $\\Lambda$CDM, a sample of $\\sim1,150$ FRBs in the redshift range\n$0<z<3$ would be sufficient to rule out $R_{\\mathrm{h}}=ct$ at a $3\\sigma$\nconfidence level, while $\\sim550$ FRBs would be necessary to rule out\n$\\Lambda$CDM if the real cosmology is instead $R_{\\mathrm{h}}=ct$. The required\nsample sizes are different, reflecting the fact that the BIC imposes a severe\npenalty on the model with more free parameters. We further adopt a\nstraightforward method of deriving an upper limit to $H_{0}$, without needing\nto consider the poorly known probability distribution of the DM contributed by\nthe host galaxy. The theoretical DM contribution from the intergalactic medium\n($\\mathrm{DM_{IGM}}$) at any $z$ is proportional to $H_0$. Thus, requiring the\nextragalactic $\\mathrm{DM_{ext}}$ to be larger than $\\mathrm{DM_{IGM}}$\ndelimits $H_0$ to the upside. Assuming flat $\\Lambda$CDM, we have\n$H_0<89.0\\;\\mathrm{km\\;s^{-1}\\;Mpc^{-1}}$ at a 95\\% confidence level.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:55:30 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wei","Jun-Jie",""],["Melia","Fulvio",""]]}
{"id":"2308.05919","submitter":"Yonggang Zhao","authors":"Shu Mi, Ye Gao, Ze Jiang, Junwei Zhang, Wenhui Cao, Jinjin Li, Yutong\n  Wang, Quan Liu, Chengchao Xu, Huaixin Yang, Jianqi Li, Guangming Zhang, Yayu\n  Wang, Yonggang Zhao","title":"Piezostrain-induced in-plane anisotropy of superconducting transition\n  temperature for FeSe0.5Te0.5 thin films","comments":"22 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":"  Superconductivity is a macroscopic quantum phenomenon and it is commonly\nbelieved that the in-plane superconducting transition temperature (Tc) should\nbe isotropic for superconductors with crystal structures of stacking layers\n(quasi two-dimensional). Here, we report the observation of piezostrain-induced\nin-plane anisotropy of Tc in FeSe0.5Te0.5 (FST) thin films grown on\nferroelectrics. The as-prepared FST shows tetragonal phase with equal in-plane\nlattice parameters and absence of in-plane anisotropy of Tc. Upon applying\nelectric fields, piezostrain induces difference of the in-plane lattice\nparameters (a-b) and in-plane anisotropy of Tc. The in-plane anisotropy of Tc\ncorrelates with a-b and becomes more remarkable for larger values of a-b. Some\npossible extrinsic effects were ruled out by experiments and analysis. It is\nsuggested that electronic nematicity with one direction induced by piezostrain\nand inhomogeneous superconductivity in FST are involved in this unusual\nphenomenon. This work reveals the exotic behavior of FST and will stimulate\nexploration of similar behavior in other unconventional superconductors.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:59:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mi","Shu",""],["Gao","Ye",""],["Jiang","Ze",""],["Zhang","Junwei",""],["Cao","Wenhui",""],["Li","Jinjin",""],["Wang","Yutong",""],["Liu","Quan",""],["Xu","Chengchao",""],["Yang","Huaixin",""],["Li","Jianqi",""],["Zhang","Guangming",""],["Wang","Yayu",""],["Zhao","Yonggang",""]]}
{"id":"2308.05920","submitter":"Zijie Ye","authors":"Zijie Ye, Jia Jia and Junliang Xing","title":"Semantics2Hands: Transferring Hand Motion Semantics between Avatars","comments":"Accepted to MM 2023, 9 pages, 10 figures. Project page:\n  https://abcyzj.github.io/S2H/","journal-ref":null,"doi":"10.1145/3581783.3612703","report-no":null,"categories":"cs.CV cs.GR cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human hands, the primary means of non-verbal communication, convey intricate\nsemantics in various scenarios. Due to the high sensitivity of individuals to\nhand motions, even minor errors in hand motions can significantly impact the\nuser experience. Real applications often involve multiple avatars with varying\nhand shapes, highlighting the importance of maintaining the intricate semantics\nof hand motions across the avatars. Therefore, this paper aims to transfer the\nhand motion semantics between diverse avatars based on their respective hand\nmodels. To address this problem, we introduce a novel anatomy-based semantic\nmatrix (ASM) that encodes the semantics of hand motions. The ASM quantifies the\npositions of the palm and other joints relative to the local frame of the\ncorresponding joint, enabling precise retargeting of hand motions.\nSubsequently, we obtain a mapping function from the source ASM to the target\nhand joint rotations by employing an anatomy-based semantics reconstruction\nnetwork (ASRN). We train the ASRN using a semi-supervised learning strategy on\nthe Mixamo and InterHand2.6M datasets. We evaluate our method in intra-domain\nand cross-domain hand motion retargeting tasks. The qualitative and\nquantitative results demonstrate the significant superiority of our ASRN over\nthe state-of-the-arts.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:07:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ye","Zijie",""],["Jia","Jia",""],["Xing","Junliang",""]]}
{"id":"2308.05921","submitter":"Ryugo Morita","authors":"Ryugo Morita, Zhiqiang Zhang, Jinjia Zhou","title":"BATINet: Background-Aware Text to Image Synthesis and Manipulation\n  Network","comments":"Accepted to ICIP2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Background-Induced Text2Image (BIT2I) aims to generate foreground content\naccording to the text on the given background image. Most studies focus on\ngenerating high-quality foreground content, although they ignore the\nrelationship between the two contents. In this study, we analyzed a novel\nBackground-Aware Text2Image (BAT2I) task in which the generated content matches\nthe input background. We proposed a Background-Aware Text to Image synthesis\nand manipulation Network (BATINet), which contains two key components: Position\nDetect Network (PDN) and Harmonize Network (HN). The PDN detects the most\nplausible position of the text-relevant object in the background image. The HN\nharmonizes the generated content referring to background style information.\nFinally, we reconstructed the generation network, which consists of the\nmulti-GAN and attention module to match more user preferences. Moreover, we can\napply BATINet to text-guided image manipulation. It solves the most challenging\ntask of manipulating the shape of an object. We demonstrated through\nqualitative and quantitative evaluations on the CUB dataset that the proposed\nmodel outperforms other state-of-the-art methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:22:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Morita","Ryugo",""],["Zhang","Zhiqiang",""],["Zhou","Jinjia",""]]}
{"id":"2308.05922","submitter":"Sunyoung Kim","authors":"Naohiko Arima, Sunyoung Kim, Masakazu Kojima","title":"Further Development in Convex Conic Reformulation of Geometric Nonconvex\n  Conic Optimization Problems","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A geometric nonconvex conic optimization problem (COP) was recently proposed\nby Kim, Kojima and Toh as a unified framework for convex conic reformulation of\na class of quadratic optimization problems and polynomial optimization\nproblems. The nonconvex COP minimizes a linear function over the intersection\nof a nonconvex cone $\\mathbb{K}$, a convex subcone $\\mathbb{J}$ of the convex\nhull co$\\mathbb{K}$ of $\\mathbb{K}$, and an affine hyperplane with a normal\nvector $H$. Under the assumption co$(\\mathbb{K} \\cap \\mathbb{J}) = \\mathbb{J}$,\nthe original nonconvex COP in their paper was shown to be equivalently\nformulated as a convex conic program by replacing the constraint set with the\nintersection of $\\mathbb{J}$ and the affine hyperplane. This paper further\nstudies some remaining issues, not fully investigated there, such as the key\nassumption co$(\\mathbb{K} \\cap \\mathbb{J}) = \\mathbb{J}$ in the framework. More\nspecifically, we provide three sets of necessary-sufficient conditions for the\nassumption. As an application, we propose a new wide class of quadratically\nconstrained quadratic programs with multiple nonconvex equality and inequality\nconstraints that can be solved exactly by their semidefinite relaxation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:26:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Arima","Naohiko",""],["Kim","Sunyoung",""],["Kojima","Masakazu",""]]}
{"id":"2308.05923","submitter":"Adrian Chun-Pong Chu","authors":"Adrian Chun-Pong Chu, Ao Sun","title":"Genus one singularities in mean curvature flow","comments":null,"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 show that for certain one-parameter families of initial conditions in\n$\\mathbb R^3$, when we run mean curvature flow, a genus one singularity must\nappear in one of the flows. Moreover, such a singularity is robust under\nperturbation of the family of initial conditions. This contrasts sharply with\nthe case of just a single flow. As an application, we construct an embedded,\ngenus one self-shrinker with entropy lower than a shrinking doughnut.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:34:25 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chu","Adrian Chun-Pong",""],["Sun","Ao",""]]}
{"id":"2308.05924","submitter":"Yuto Mochizuki","authors":"Yuto Mochizuki, Misaki Mizumoto, and Ken Ebisawa","title":"Origin of the complex iron line structure and spectral variation in Mrk\n  766","comments":"11 pages, 7 figures, Published in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2329","report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Complex Fe-K emission/absorption line features are commonly observed in the\n6--11 keV band from Active Galactic Nuclei (AGN). These features are formed in\nvarious physical components surrounding the black holes. The Narrow-Line\nSeyfert 1 (NLS1) galaxy Mrk 766, in particular, exhibits characteristic\nblue-shifted Fe-K absorption lines caused by the ultra-fast outflow (UFO), and\na broad Fe-K emission line, as well as variable absorbers partially covering\nthe X-ray emitting region. We re-analyze the Mrk 766 archival data of\nXMM-Newton, NuSTAR, and Swift to investigate the origin of the Fe-K line\nfeature and the 0.3--79 keV energy spectral variation. We have found that the\nspectral variation in $\\lesssim$10 keV is primarily explained by the variable\npartial covering of the central X-ray source by multi-layer absorbing clouds.\nThe Fe-K line feature consists of the blue-shifted absorption lines due to the\nUFO, a narrow emission line from the distant material, a broad emission line\nfrom the inner-disk reflection, and a slightly broadened weak emission line at\naround 6.4--6.7 keV whose equivalent width is $\\sim$0.05 keV. The last one is\npresumably due to the resonance scattering in the UFO out of the line-of-sight,\nas predicted by a Monte Carlo simulation based on the hydrodynamical UFO\nmodeling. We suggest that the seemingly complex Fe-K line features and the\nX-ray energy spectra of Mrk 766 are explained by a moderately extended central\nX-ray source around a Schwarzschild black hole, an optically thick accretion\ndisk with a truncated inner-radius, the UFO, multi-layer partial covering\nclouds, and a torus.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:43:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mochizuki","Yuto",""],["Mizumoto","Misaki",""],["Ebisawa","Ken",""]]}
{"id":"2308.05925","submitter":"Zhaoqi Su","authors":"Zhaoqi Su and Liangxiao Hu and Siyou Lin and Hongwen Zhang and\n  Shengping Zhang and Justus Thies and Yebin Liu","title":"CaPhy: Capturing Physical Properties for Animatable Human Avatars","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present CaPhy, a novel method for reconstructing animatable human avatars\nwith realistic dynamic properties for clothing. Specifically, we aim for\ncapturing the geometric and physical properties of the clothing from real\nobservations. This allows us to apply novel poses to the human avatar with\nphysically correct deformations and wrinkles of the clothing. To this end, we\ncombine unsupervised training with physics-based losses and 3D-supervised\ntraining using scanned data to reconstruct a dynamic model of clothing that is\nphysically realistic and conforms to the human scans. We also optimize the\nphysical parameters of the underlying physical model from the scans by\nintroducing gradient constraints of the physics-based losses. In contrast to\nprevious work on 3D avatar reconstruction, our method is able to generalize to\nnovel poses with realistic dynamic cloth deformations. Experiments on several\nsubjects demonstrate that our method can estimate the physical properties of\nthe garments, resulting in superior quantitative and qualitative results\ncompared with previous methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:01:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Su","Zhaoqi",""],["Hu","Liangxiao",""],["Lin","Siyou",""],["Zhang","Hongwen",""],["Zhang","Shengping",""],["Thies","Justus",""],["Liu","Yebin",""]]}
{"id":"2308.05926","submitter":"Darcy Smith","authors":"D. L. Smith (1, 2 and 3), L. V. Nguyen (3 and 4), M. I. Reja (1 and\n  3), E. P. Schartner (1), H. Ebendorff-Heidepriem (1), D. J. Ottaway (1 and 2)\n  and S. C. Warren-Smith (3 and 4) ((1) Institute for Photonics and Advanced\n  Sensing and The School of Physics, Chemistry and Earth Sciences, The\n  University of Adelaide, (2) Australian Research Council Centre of Excellence\n  for Gravitational Wave Discovery (OzGrav), (3) Future Industries Institute,\n  University of South Australia, (4) Laser Physics and Photonics Devices\n  Laboratory, University of South Australia)","title":"Harnessing the power of complex light propagation in multimode fibers\n  for spatially resolved sensing","comments":"31 pages and 14 figures total, 18 pages and 4 figures in main\n  article, 13 pages and 10 figures in supplementary information","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 propagation of coherent light in multimode optical fibers results in\ncomplex light patterns known as speckle. This effect has historically made\nunderstanding and controlling the light transport in these fibers extremely\ndifficult, with successes such as imaging still being restricted to special\ncases. This complexity can also be a powerful tool for sensing environmental\nparameters, as small perturbations lead to significant changes in the output of\nthe fiber. Until now, the ability to use speckle patterns for longitudinally\nresolved sensing has remained unclear, with previous studies limited to the\nclassification of fiber bending positions and thus lacking quantification. In\nthis paper, we demonstrate that random longitudinal variations which are\nusually regarded as a significantly detrimental property are crucial to\nachieving spatially resolved measurements. The mode coupling induced by such\nvariations break the longitudinal symmetry of the fiber causing the fiber's\noutput to become dependent on the longitudinal position of such a perturbation.\nIn this work we use machine learning to quantitatively extract this spatial\ninformation and compare three fiber types with dramatically different mode\ncoupling and sensitivity characteristics. We show that sapphire crystal fiber,\nwhich supports a high degree of mode coupling due to significant diameter\ninhomogeneities, provides the greatest accuracy. These findings have\nfar-reaching implications for the broader optics and photonics research\ncommunity in the study of complex light propagation and offers exciting\nopportunities for the development of new and innovative sensing technologies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:15:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Smith","D. L.","","1, 2 and 3"],["Nguyen","L. V.","","3 and 4"],["Reja","M. I.","","1 and\n  3"],["Schartner","E. P.","","1 and 2"],["Ebendorff-Heidepriem","H.","","1 and 2"],["Ottaway","D. J.","","1 and 2"],["Warren-Smith","S. C.","","3 and 4"]]}
{"id":"2308.05927","submitter":"Jun-Hong An","authors":"Feng-Zhou Ji, Jun-Hong An","title":"Kerr-Nonlinearity-Induced Strong Spin-Magnon Coupling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One pillar of quantum magnonics is to explore the utilization of mediation\nrole of magnons in different platforms to develop quantum technologies. The\nefficient coupling between magnons and various quantum entities is a\nprerequisite. Here, we propose a scheme to enhance the spin-magnon coupling by\nthe magnonic Kerr nonlinearity in a YIG sphere. We find that the Kerr enhanced\nspin-magnon coupling invalidates the widely used single-Kittel-mode\napproximation to magnons. It is revealed that the spin decoherence induced by\nthe multi-mode magnons in the strong-coupling regime becomes not severe, but\nsuppressed manifesting as either population trapping or persistent Rabi-like\noscillation. This anomalous effect is due to that the spin changes to be so\nhybridized with the magnons that one or two bound states are formed between\nthem. Enriching the spin-magnon coupling physics, the result supplies a\nguideline to control the spin-magnon interface.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:15:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ji","Feng-Zhou",""],["An","Jun-Hong",""]]}
{"id":"2308.05928","submitter":"Zishang Ji","authors":"Zishang Ji, Xuanyu Zhang, Xuanzhe Wang and Yan Huang","title":"Trajectory Generation and Tracking based on Energy Minimization for a\n  Four-Link Brachiation Robot","comments":"Submitted to 2023 IEEE International Conference on Unmanned Systems\n  (ICUS)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aiming to mimic the brachiation locomotion of primates, we establish a\nbrachiation robot model capable of swinging between different bars. The robot's\ndesign is based on a four-link underactuated structure. We propose an offline\ntrajectory generator with optimization for minimizing energy consumption, which\nis implemented by direct collocation method to generate joint-space\ntrajectories. We also propose a linear Model Predictive Control (MPC) algorithm\nas the feedback controller. The proposed MPC concurrently tracks both\ntrajectories in joint space and Cartesian space. In simulation experiments, we\nanalyzed the influence of lower-to-upper arm length ratio and swing time on the\nmotion performance. The simulation results also demonstrate the robot has\nsatisfied ability in trajectory tracking, obstacle avoidance and robustness.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:21:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ji","Zishang",""],["Zhang","Xuanyu",""],["Wang","Xuanzhe",""],["Huang","Yan",""]]}
{"id":"2308.05929","submitter":"Lei Zheng","authors":"Lei Zheng, Rui Yang, Zengqi Peng, Michael Yu Wang, Jun Ma","title":"Spatiotemporal Receding Horizon Control with Proactive Interaction\n  Towards Safe and Efficient Autonomous Driving in Dense Traffic","comments":"14 pages, 13 figures, 6 tables, submitted to IEEE Transactions on\n  Intelligent Transportation Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In dense traffic scenarios, ensuring safety while keeping high task\nperformance for autonomous driving is a critical challenge. To address this\nproblem, this paper proposes a computationally-efficient spatiotemporal\nreceding horizon control (ST-RHC) scheme to generate a safe, dynamically\nfeasible, energy-efficient trajectory in control space, where different driving\ntasks in dense traffic can be achieved with high accuracy and safety in real\ntime. In particular, an embodied spatiotemporal safety barrier module\nconsidering proactive interactions is devised to mitigate the effects of\ninaccuracies resulting from the trajectory prediction of other vehicles.\nSubsequently, the motion planning and control problem is formulated as a\nconstrained nonlinear optimization problem, which favorably facilitates the\neffective use of off-the-shelf optimization solvers in conjunction with\nmultiple shooting. The effectiveness of the proposed ST-RHC scheme is\ndemonstrated through comprehensive comparisons with state-of-the-art algorithms\non synthetic and real-world traffic datasets under dense traffic, and the\nattendant outcome of superior performance in terms of accuracy, efficiency and\nsafety is achieved.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:23:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zheng","Lei",""],["Yang","Rui",""],["Peng","Zengqi",""],["Wang","Michael Yu",""],["Ma","Jun",""]]}
{"id":"2308.05930","submitter":"Stefan Abi-Karam","authors":"Stefan Abi-Karam, Rishov Sarkar, Dejia Xu, Zhiwen Fan, Zhangyang Wang,\n  Cong Hao","title":"INR-Arch: A Dataflow Architecture and Compiler for Arbitrary-Order\n  Gradient Computations in Implicit Neural Representation Processing","comments":"9 pages, 8 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.DC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An increasing number of researchers are finding use for nth-order gradient\ncomputations for a wide variety of applications, including graphics,\nmeta-learning (MAML), scientific computing, and most recently, implicit neural\nrepresentations (INRs). Recent work shows that the gradient of an INR can be\nused to edit the data it represents directly without needing to convert it back\nto a discrete representation. However, given a function represented as a\ncomputation graph, traditional architectures face challenges in efficiently\ncomputing its nth-order gradient due to the higher demand for computing power\nand higher complexity in data movement. This makes it a promising target for\nFPGA acceleration. In this work, we introduce INR-Arch, a framework that\ntransforms the computation graph of an nth-order gradient into a\nhardware-optimized dataflow architecture. We address this problem in two\nphases. First, we design a dataflow architecture that uses FIFO streams and an\noptimized computation kernel library, ensuring high memory efficiency and\nparallel computation. Second, we propose a compiler that extracts and optimizes\ncomputation graphs, automatically configures hardware parameters such as\nlatency and stream depths to optimize throughput, while ensuring deadlock-free\noperation, and outputs High-Level Synthesis (HLS) code for FPGA implementation.\nWe utilize INR editing as our benchmark, presenting results that demonstrate\n1.8-4.8x and 1.5-3.6x speedup compared to CPU and GPU baselines respectively.\nFurthermore, we obtain 3.1-8.9x and 1.7-4.3x lower memory usage, and 1.7-11.3x\nand 5.5-32.8x lower energy-delay product. Our framework will be made\nopen-source and available on GitHub.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:24:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Abi-Karam","Stefan",""],["Sarkar","Rishov",""],["Xu","Dejia",""],["Fan","Zhiwen",""],["Wang","Zhangyang",""],["Hao","Cong",""]]}
{"id":"2308.05931","submitter":"Ernest Xia Dr.","authors":"Yang Lin, Ernest X.W. Xia, Xuan Yu","title":"Some identities on Lin-Peng-Toh's partition statistic of $k$-colored\n  partitions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Andrews proved two conjectures on a partition statistic introduced\nby Beck. Very recently, Chern established some results on weighted rank and\ncrank moments and proved many Andrews-Beck type congruences. Motivated by\nAndrews and Chern's work, Lin, Peng and To introduced a partition statistic of\n$k$-colored partitions $NB_k(r,m,n)$ which counts the total number of parts of\n$\\pi^{(1)}$ in each $k$-colored partition $\\pi$ of $n$ with ${\\rm\ncrank}_k(\\pi)$ congruent to $r$ modulo $m$ and proved a number of congruences\nfor $NB_k(r,m,n)$. In this paper, we prove some identities on $NB_k(r,m,n)$\nwhich are analogous to Ramanujan's ``most beautiful identity\". Moreover, those\nidentities imply some congruences proved by Lin, Peng and Toh.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:25:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lin","Yang",""],["Xia","Ernest X. W.",""],["Yu","Xuan",""]]}
{"id":"2308.05932","submitter":"Xiang Zhang","authors":"Xiang Zhang, Lei Yu, Wen Yang, Jianzhuang Liu, Gui-Song Xia","title":"Generalizing Event-Based Motion Deblurring in Real-World Scenarios","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":"  Event-based motion deblurring has shown promising results by exploiting\nlow-latency events. However, current approaches are limited in their practical\nusage, as they assume the same spatial resolution of inputs and specific\nblurriness distributions. This work addresses these limitations and aims to\ngeneralize the performance of event-based deblurring in real-world scenarios.\nWe propose a scale-aware network that allows flexible input spatial scales and\nenables learning from different temporal scales of motion blur. A two-stage\nself-supervised learning scheme is then developed to fit real-world data\ndistribution. By utilizing the relativity of blurriness, our approach\nefficiently ensures the restored brightness and structure of latent images and\nfurther generalizes deblurring performance to handle varying spatial and\ntemporal scales of motion blur in a self-distillation manner. Our method is\nextensively evaluated, demonstrating remarkable performance, and we also\nintroduce a real-world dataset consisting of multi-scale blurry frames and\nevents to facilitate research in event-based deblurring.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:27:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Xiang",""],["Yu","Lei",""],["Yang","Wen",""],["Liu","Jianzhuang",""],["Xia","Gui-Song",""]]}
{"id":"2308.05933","submitter":"Tsubasa Harada","authors":"Tsubasa Harada and Toshiya Itoh","title":"Competitive Analysis of Online Facility Assignment for General Layout of\n  Servers on a Line","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the online facility assignment on a line ${\\rm OFAL}(S,c)$ with a set $S$\nof $k$ servers and a capacity $c:S\\to\\mathbb{N}$, each server $s\\in S$ with a\ncapacity $c(s)$ is placed on a line, and a request arrives on a line\none-by-one. The task of an online algorithm is to irrevocably match a current\nrequest with one of the servers with vacancies before the next request arrives.\nAn algorithm can match up to $c(s)$ requests to a server $s\\in S$.\n  In this paper, we propose a new online algorithm PTCP (Policy Transition at\nCritical Point) for $\\mathrm{OFAL}(S,c)$ and show that PTCP is\n$(2\\alpha(S)+1)$-competitive, where $\\alpha(S)$ is informally the ratio of the\ndiameter of $S$ to the maximum distance between two adjacent servers in $S$.\nDepending on the layout of servers, $\\alpha(S)$ ranges from constant\n(independent of $k$) to $k-1$. Among all of known algorithms for\n$\\mathrm{OFAL}(S,c)$, this upper bound on the competitive ratio is the best\nwhen $\\alpha(S)$ is small.\n  We also show that the competitive ratio of any MPFS (Most Preferred Free\nServers) algorithm is at least $2\\alpha(S)+1$. For $\\mathrm{OFAL}(S,c)$, recall\nthat MPFS is a class of algorithms whose competitive ratio does not depend on a\ncapacity $c$ and it includes the natural greedy algorithm and PTCP, etc. Thus,\nthis implies that PTCP is the best for $\\mathrm{OFAL}(S,c)$ in the class MPFS.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:33:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Harada","Tsubasa",""],["Itoh","Toshiya",""]]}
{"id":"2308.05934","submitter":"Melvyn Tyloo","authors":"Melvyn Tyloo","title":"Evolution of robustness in growing random networks","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO cond-mat.dis-nn physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Networks are widely used to model the interaction between individual\ndynamical systems. In many instances, the total number of units as well as the\ninteraction coupling are not fixed in time, but rather constantly evolve. In\nterms of networks, this means that the number of nodes and edges change in\ntime. Various properties of coupled dynamical systems essentially depend on the\nstructure of the interaction network, such as their robustness to noise. It is\ntherefore of interest to predict how these properties are affected when the\nnetwork grows. Here, we focus on the time-evolution of the network's Kirchhoff\nindex. We derive closed form expressions for its variation in various scenarios\nincluding both the addition of edges and nodes. For the latter case, we\ninvestigate the evolution where a single node with one and two edges connecting\nto existing nodes are added recursively to a network. In both cases we derive\nrelations between the properties of the nodes to which the new one connects,\nand the global evolution of the network robustness. In particular, we show how\ndifferent scalings of the Kirchhoff index as a function of the number of nodes\nare obtained. We illustrate and confirm the theory with numerical simulations\nof growing random networks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:33:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tyloo","Melvyn",""]]}
{"id":"2308.05935","submitter":"Shangqing Tu","authors":"Shangqing Tu, Zheyuan Zhang, Jifan Yu, Chunyang Li, Siyu Zhang, Zijun\n  Yao, Lei Hou, Juanzi Li","title":"LittleMu: Deploying an Online Virtual Teaching Assistant via\n  Heterogeneous Sources Integration and Chain of Teach Prompts","comments":"7 pages, 3 figures, Accepted by CIKM 23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Teaching assistants have played essential roles in the long history of\neducation. However, few MOOC platforms are providing human or virtual teaching\nassistants to support learning for massive online students due to the\ncomplexity of real-world online education scenarios and the lack of training\ndata. In this paper, we present a virtual MOOC teaching assistant, LittleMu\nwith minimum labeled training data, to provide question answering and chit-chat\nservices. Consisting of two interactive modules of heterogeneous retrieval and\nlanguage model prompting, LittleMu first integrates structural, semi- and\nunstructured knowledge sources to support accurate answers for a wide range of\nquestions. Then, we design delicate demonstrations named \"Chain of Teach\"\nprompts to exploit the large-scale pre-trained model to handle complex\nuncollected questions. Except for question answering, we develop other\neducational services such as knowledge-grounded chit-chat. We test the system's\nperformance via both offline evaluation and online deployment. Since May 2020,\nour LittleMu system has served over 80,000 users with over 300,000 queries from\nover 500 courses on XuetangX MOOC platform, which continuously contributes to a\nmore convenient and fair education. Our code, services, and dataset will be\navailable at https://github.com/THU-KEG/VTA.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:36:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tu","Shangqing",""],["Zhang","Zheyuan",""],["Yu","Jifan",""],["Li","Chunyang",""],["Zhang","Siyu",""],["Yao","Zijun",""],["Hou","Lei",""],["Li","Juanzi",""]]}
{"id":"2308.05936","submitter":"Bekzod Madaminov Allayarovich","authors":"R.Z.Abdullaev, B.A.Madaminov","title":"Isometries of generalized $log$-spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper studied isometries of $F$-spaces of integrable functions with\nlogarithm. In particular, using passports of Boolean algebra, a necessary and\nsufficient condition of isometry $F$-spaces of integrable functions of\nlogarithm with respect to strictly positive $\\sigma$-finite measures is proved.\nIn this work,external, internal and generalized $log$ algebras are considered\nseparately.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:40:49 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Abdullaev","R. Z.",""],["Madaminov","B. A.",""]]}
{"id":"2308.05937","submitter":"Siddharth Agarwal","authors":"Siddharth Agarwal, Maria A. Rodriguez and Rajkumar Buyya","title":"A Deep Recurrent-Reinforcement Learning Method for Intelligent\n  AutoScaling of Serverless Functions","comments":"12 pages, 13 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Function-as-a-Service (FaaS) introduces a lightweight, function-based cloud\nexecution model that finds its relevance in applications like IoT-edge data\nprocessing and anomaly detection. While CSP offer a near-infinite function\nelasticity, these applications often experience fluctuating workloads and\nstricter performance constraints. A typical CSP strategy is to empirically\ndetermine and adjust desired function instances, \"autoscaling\", based on\nmonitoring-based thresholds such as CPU or memory, to cope with demand and\nperformance. However, threshold configuration either requires expert knowledge,\nhistorical data or a complete view of environment, making autoscaling a\nperformance bottleneck lacking an adaptable solution.RL algorithms are proven\nto be beneficial in analysing complex cloud environments and result in an\nadaptable policy that maximizes the expected objectives. Most realistic cloud\nenvironments usually involve operational interference and have limited\nvisibility, making them partially observable. A general solution to tackle\nobservability in highly dynamic settings is to integrate Recurrent units with\nmodel-free RL algorithms and model a decision process as a POMDP. Therefore, in\nthis paper, we investigate a model-free Recurrent RL agent for function\nautoscaling and compare it against the model-free Proximal Policy Optimisation\n(PPO) algorithm. We explore the integration of a LSTM network with the\nstate-of-the-art PPO algorithm to find that under our experimental and\nevaluation settings, recurrent policies were able to capture the environment\nparameters and show promising results for function autoscaling. We further\ncompare a PPO-based autoscaling agent with commercially used threshold-based\nfunction autoscaling and posit that a LSTM-based autoscaling agent is able to\nimprove throughput by 18%, function execution by 13% and account for 8.4% more\nfunction instances.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:41:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Agarwal","Siddharth",""],["Rodriguez","Maria A.",""],["Buyya","Rajkumar",""]]}
{"id":"2308.05938","submitter":"Xing Lan","authors":"Xing Lan, Jiayi Lyu, Hanyu Jiang, Kun Dong, Zehai Niu, Yi Zhang, Jian\n  Xue","title":"FoodSAM: Any Food Segmentation","comments":"Code is available at https://github.com/jamesjg/FoodSAM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we explore the zero-shot capability of the Segment Anything\nModel (SAM) for food image segmentation. To address the lack of class-specific\ninformation in SAM-generated masks, we propose a novel framework, called\nFoodSAM. This innovative approach integrates the coarse semantic mask with\nSAM-generated masks to enhance semantic segmentation quality. Besides, we\nrecognize that the ingredients in food can be supposed as independent\nindividuals, which motivated us to perform instance segmentation on food\nimages. Furthermore, FoodSAM extends its zero-shot capability to encompass\npanoptic segmentation by incorporating an object detector, which renders\nFoodSAM to effectively capture non-food object information. Drawing inspiration\nfrom the recent success of promptable segmentation, we also extend FoodSAM to\npromptable segmentation, supporting various prompt variants. Consequently,\nFoodSAM emerges as an all-encompassing solution capable of segmenting food\nitems at multiple levels of granularity. Remarkably, this pioneering framework\nstands as the first-ever work to achieve instance, panoptic, and promptable\nsegmentation on food images. Extensive experiments demonstrate the feasibility\nand impressing performance of FoodSAM, validating SAM's potential as a\nprominent and influential tool within the domain of food image segmentation. We\nrelease our code at https://github.com/jamesjg/FoodSAM.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:42:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lan","Xing",""],["Lyu","Jiayi",""],["Jiang","Hanyu",""],["Dong","Kun",""],["Niu","Zehai",""],["Zhang","Yi",""],["Xue","Jian",""]]}
{"id":"2308.05939","submitter":"Dominic Maggio","authors":"Dominic Maggio, Courtney Mario, Luca Carlone","title":"VERF: Runtime Monitoring of Pose Estimation with Neural Radiance Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present VERF, a collection of two methods (VERF-PnP and VERF-Light) for\nproviding runtime assurance on the correctness of a camera pose estimate of a\nmonocular camera without relying on direct depth measurements. We leverage the\nability of NeRF (Neural Radiance Fields) to render novel RGB perspectives of a\nscene. We only require as input the camera image whose pose is being estimated,\nan estimate of the camera pose we want to monitor, and a NeRF model containing\nthe scene pictured by the camera. We can then predict if the pose estimate is\nwithin a desired distance from the ground truth and justify our prediction with\na level of confidence. VERF-Light does this by rendering a viewpoint with NeRF\nat the estimated pose and estimating its relative offset to the sensor image up\nto scale. Since scene scale is unknown, the approach renders another auxiliary\nimage and reasons over the consistency of the optical flows across the three\nimages. VERF-PnP takes a different approach by rendering a stereo pair of\nimages with NeRF and utilizing the Perspective-n-Point (PnP) algorithm. We\nevaluate both methods on the LLFF dataset, on data from a Unitree A1 quadruped\nrobot, and on data collected from Blue Origin's sub-orbital New Shepard rocket\nto demonstrate the effectiveness of the proposed pose monitoring method across\na range of scene scales. We also show monitoring can be completed in under half\na second on a 3090 GPU.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:43:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Maggio","Dominic",""],["Mario","Courtney",""],["Carlone","Luca",""]]}
{"id":"2308.05940","submitter":"Rishideep Roy","authors":"Rishideep Roy, Kumarjit Saha","title":"How fast do rumours spread?","comments":"30 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a rumour propagation model as a long-range percolation model on\n$\\mathbb{Z}$. We show a sharp phase transition-type behaviour in terms of\nrumour propagation. In the super-critical phase, we show that the rightmost\nvertex in the rumour cluster has a deterministic speed in the sense that after\nappropriate scaling, the location of the rightmost vertex converges a.s. to a\ndeterministic positive constant. We further show a central limit theorem for\nappropriately scaled and centered rightmost vertex. We later introduce a rumour\npropagation model with re-activation and obtain the speed result for this\nre-activated process as well, in the sense of convergence of the scaled\nrightmost vertex.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:52:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Roy","Rishideep",""],["Saha","Kumarjit",""]]}
{"id":"2308.05941","submitter":"Zhimeng Wang","authors":"Zhimeng Wang, Ang Xuan, Xinwei Shen, Yunfei Du, Hongbin Sun","title":"A Robust Planning Model for Offshore Microgrid Considering Tidal Power\n  and Desalination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increasing attention has been paid to resources on islands, thus microgrids\non islands need to be invested. Different from onshore microgrids, offshore\nmicrogrids (OM) are usually abundant in ocean renewable energy (ORE), such as\noffshore wind, tidal power generation (TPG), etc. Moreover, some special loads\nsuch as seawater desalination unit (SDU) should be included. In this sense,\nthis paper proposes a planning method for OM to minimize the investment cost\nwhile the ORE's fluctuation could be accommodated with robustness. First, a\ndeterministic planning model (DPM) is formulated for the OM with TPG and SDU. A\nrobust planning model (RPM) is then developed considering the uncertainties\nfrom both TPG and load demand. The Column-and-constraint generation (C&CG)\nalgorithm is then employed to solve the RPM, producing planning results for the\nOM that is robust against the worst scenario. Results of the case studies show\nthat the investment and operation decisions of the proposed model are robust,\nand TPG shows good complementarity with the other RESs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:57:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Zhimeng",""],["Xuan","Ang",""],["Shen","Xinwei",""],["Du","Yunfei",""],["Sun","Hongbin",""]]}
{"id":"2308.05942","submitter":"Weiwei Xu","authors":"Weiwei Xu, Hao He, Kai Gao, Minghui Zhou","title":"Understanding and Remediating Open-Source License Incompatibilities in\n  the PyPI Ecosystem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The reuse and distribution of open-source software must be in compliance with\nits accompanying open-source license. In modern packaging ecosystems,\nmaintaining such compliance is challenging because a package may have a complex\nmulti-layered dependency graph with many packages, any of which may have an\nincompatible license. Although prior research finds that license\nincompatibilities are prevalent, empirical evidence is still scarce in some\nmodern packaging ecosystems (e.g., PyPI). It also remains unclear how\ndevelopers remediate the license incompatibilities in the dependency graphs of\ntheir packages (including direct and transitive dependencies), let alone any\nautomated approaches. To bridge this gap, we conduct a large-scale empirical\nstudy of license incompatibilities and their remediation practices in the PyPI\necosystem. We find that 7.27% of the PyPI package releases have license\nincompatibilities and 61.3% of them are caused by transitive dependencies,\ncausing challenges in their remediation; for remediation, developers can apply\none of the five strategies: migration, removal, pinning versions, changing\ntheir own licenses, and negotiation. Inspired by our findings, we propose\nSILENCE, an SMT-solver-based approach to recommend license incompatibility\nremediations with minimal costs in package dependency graph. Our evaluation\nshows that the remediations proposed by SILENCE can match 19 historical\nreal-world cases (except for migrations not covered by an existing knowledge\nbase) and have been accepted by five popular PyPI packages whose developers\nwere previously unaware of their license incompatibilities.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:57:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xu","Weiwei",""],["He","Hao",""],["Gao","Kai",""],["Zhou","Minghui",""]]}
{"id":"2308.05943","submitter":"Lisa Mathew","authors":"Jayakrishna Vijayakumar and Lisa Mathew","title":"On Some Closure Properties of nc-eNCE Graph Grammars","comments":"14 pages,9 figures, to be submitted to Theory of Computing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the study of automata and grammars, closure properties of the associated\nlanguages have been studied extensively. In particular, closure properties of\nvarious types of graph grammars have been examined in (Rozenberg and Welzl,\nInf. and Control,1986) and (Rozenberg and Welzl, Acta Informatica,1986). In\nthis paper we examine some critical closure properties of the nc-eNCE graph\ngrammars discussed in (Jayakrishna and Mathew, Symmetry 2023) and (Jayakrishna\nand Mathew, ICMICDS 2022).\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:10:30 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 15:49:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vijayakumar","Jayakrishna",""],["Mathew","Lisa",""]]}
{"id":"2308.05944","submitter":"Victoria Puyam","authors":"Victoria Puyam and N. Nimai Singh","title":"$A_{5}$ symmetry and deviation from Golden Ratio mixing","comments":"10 figures and 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use $A_{5}$ discrete symmetry group to construct a neutrino mass model\nthat can reproduce deviation from the exact golden ratio mixing. Here, we\nobtain the neutrino masses through Type-I seesaw mechanism. The contribution\nfrom charged lepton sector gives the necessary deviation required to produce\nnon-zero $\\theta_{13}$. More specifically, a definite pattern of charged lepton\nmass matrix predicted by the model controls the lepton mixing. By taking the\nobserved $\\theta_{13}$ as input value we can obtain the value of all the mixing\nangles and Dirac CP violating phase within the current experimental bounds.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:37:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Puyam","Victoria",""],["Singh","N. Nimai",""]]}
{"id":"2308.05945","submitter":"Wentao Su","authors":"Wentao Su and Weitao Duan","title":"Improving Ego-Cluster for Network Effect Measurement","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Network effect is common in social network platforms. Many new features in\nsocial networks are designed to specifically create network effect to improve\nuser engagement. For example, content creators tend to produce more when their\narticles and posts receive more positive feedback from followers. This paper\ndiscusses a new cluster-level experimentation methodology to measure the\ncreator-side metrics in the context of A/B experiment. The methodology is\ndesigned to address the cases when the experiment randomization unit and the\nmetric measurement unit are not the same, and it is a part of the overall\nstrategy at LinkedIn to promote a robust creator community and ecosystem. The\nmethod is developed based on the widely-cited research at LinkedIn, but\nsignificantly improves the clustering algorithm efficiency and flexibility,\nleading to a stronger capability of the creator-side metrics measurement and\nincreasing velocity for creator-related experiments.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:40:30 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Su","Wentao",""],["Duan","Weitao",""]]}
{"id":"2308.05946","submitter":"Dwaipayan Dubey","authors":"Dwaipayan Dubey, Fabian Gr\\\"ubel, Rosa Arenales-Lope, Karan\n  Molaverdikhani, Barbara Ercolano, Christian Rab, and Oliver Trapp","title":"Polycyclic Aromatic Hydrocarbons in Exoplanet Atmospheres I.\n  Thermochemical Equilibrium Models","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context: Polycyclic Aromatic Hydrocarbons, largely known as PAHs, are\nwidespread in the universe and have been identified in a vast array of\nastronomical observations from the interstellar medium to protoplanetary discs.\nThey are likely to be associated with the chemical history of the universe and\nthe emergence of life on Earth. However, their abundance on exoplanets remains\nunknown.\n  Aims: We aim to investigate the feasibility of PAH formation in the\nthermalized atmospheres of irradiated and non-irradiated hot Jupiters around\nSun-like stars.\n  Methods: To this aim, we introduced PAHs in the 1-D self-consistent forward\nmodeling code petitCODE. We simulated a large number of planet atmospheres with\ndifferent parameters (e.g. carbon to oxygen ratio, metallicity, and effective\nplanetary temperature) to study PAH formation. By coupling the thermochemical\nequilibrium solution from petitCODE with the 1-D radiative transfer code,\npetitRADTRANS, we calculated the synthetic transmission and emission spectra\nfor irradiated and non-irradiated planets, respectively, and explored the role\nof PAHs on planet spectra.\n  Results: Our models show strong correlations between PAH abundance and the\naforementioned parameters. In thermochemical equilibrium scenarios, an optimal\ntemperature, elevated carbon to oxygen ratio, and increased metallicity values\nare conducive to the formation of PAHs, with the carbon to oxygen ratio having\nthe largest effect.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:42:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dubey","Dwaipayan",""],["Gr\u00fcbel","Fabian",""],["Arenales-Lope","Rosa",""],["Molaverdikhani","Karan",""],["Ercolano","Barbara",""],["Rab","Christian",""],["Trapp","Oliver",""]]}
{"id":"2308.05947","submitter":"Alvaro De Diego Unanue","authors":"Alvaro de Diego Unanue, Gary Froyland, Oliver Junge, P\\'eter Koltai","title":"A dynamic $p$-Laplacian","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalise the dynamic Laplacian introduced in (Froyland, 2015) to a\ndynamic $p$-Laplacian, in analogy to the generalisation of the standard\n$2$-Laplacian to the standard $p$-Laplacian for $p>1$. Spectral properties of\nthe dynamic Laplacian are connected to the geometric problem of finding\n\"coherent\" sets with persistently small boundaries under dynamical evolution,\nand we show that the dynamic $p$-Laplacian shares similar geometric\nconnections. In particular, we prove that the first eigenvalue of the dynamic\n$p$-Laplacian with Dirichlet boundary conditions exists and converges to a\ndynamic version of the Cheeger constant introduced in (Froyland, 2015) as\n$p\\rightarrow 1$. We develop a numerical scheme to estimate the leading\neigenfunctions of the (nonlinear) dynamic $p$-Laplacian, and through a series\nof examples we investigate the behaviour of the level sets of these\neigenfunctions. These level sets define the boundaries of sets in the domain of\nthe dynamics that remain coherent under the dynamical evolution.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:46:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Unanue","Alvaro de Diego",""],["Froyland","Gary",""],["Junge","Oliver",""],["Koltai","P\u00e9ter",""]]}
{"id":"2308.05948","submitter":"Yiyang Cai","authors":"Yiyang Cai, Jiaming Lu, Jiewen Wang, Shuang Liang","title":"Uncertainty-Aware Cross-Modal Transfer Network for Sketch-Based 3D Shape\n  Retrieval","comments":"6 pages, 7 figures; To be published in IEEE International Conference\n  on Multimedia and Expo 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, sketch-based 3D shape retrieval has attracted growing\nattention. While many previous studies have focused on cross-modal matching\nbetween hand-drawn sketches and 3D shapes, the critical issue of how to handle\nlow-quality and noisy samples in sketch data has been largely neglected. This\npaper presents an uncertainty-aware cross-modal transfer network (UACTN) that\naddresses this issue. UACTN decouples the representation learning of sketches\nand 3D shapes into two separate tasks: classification-based sketch uncertainty\nlearning and 3D shape feature transfer. We first introduce an end-to-end\nclassification-based approach that simultaneously learns sketch features and\nuncertainty, allowing uncertainty to prevent overfitting noisy sketches by\nassigning different levels of importance to clean and noisy sketches. Then, 3D\nshape features are mapped into the pre-learned sketch embedding space for\nfeature alignment. Extensive experiments and ablation studies on two benchmarks\ndemonstrate the superiority of our proposed method compared to state-of-the-art\nmethods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:46:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cai","Yiyang",""],["Lu","Jiaming",""],["Wang","Jiewen",""],["Liang","Shuang",""]]}
{"id":"2308.05949","submitter":"R.S. Prasobh Sankar","authors":"R.S. Prasobh Sankar and Sundeep Prabhakar Chepuri","title":"Coded Aperture Radar Imaging Using Reconfigurable Intelligent Surfaces","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 paper, we focus on radar imaging using active sensing with a single\ntransceiver and reconfigurable intelligent surface (RIS). RISs are arrays with\ntunable passive phase shifter elements that can modify the propagation channel.\nThe RIS reflects each transmit pulse with a different phase profile. We use\ncompressive sensing to recover the radar scene from observations at the\nsingle-antenna receiver. We also provide a projected gradient descent algorithm\nto design the RIS phase shifts to obtain minimally coherent observations\nrequired for recovery. Through numerical simulations, we demonstrate that the\nproposed method recovers radar scenes with point scatterers and extended\ntargets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:49:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sankar","R. S. Prasobh",""],["Chepuri","Sundeep Prabhakar",""]]}
{"id":"2308.05950","submitter":"Sumit Patel","authors":"Ras Dwivedi, Sumit Patel, Prof. Sandeep Shukla","title":"Blockchain-Based Transferable Digital Rights of Land","comments":"5 pages, Paper presented in https://easychair.org/cfp/ICSF2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Land, being a scarce and valuable resource, is in high demand, especially in\ndensely populated areas of older cities. Development authorities require land\nfor infrastructure projects and other amenities, while landowners hold onto\ntheir land for both its usage and its financial value. Transferable Development\nRights (TDRs) serve as a mechanism to separate the development rights\nassociated with the land from the physical land itself. Development authorities\nacquire the land by offering compensation in the form of TDRs, which hold\nmonetary value. In this paper, we present the tokenization of development\nrights, focusing on the implementation in collaboration with a development\nauthority. While there have been previous implementations of land tokenization,\nwe believe our approach is the first to tokenize development rights\nspecifically. Our implementation addresses practical challenges related to\nrecord-keeping, ground verification of land, and the unique identification of\nstakeholders. We ensure the accurate evaluation of development rights by\nincorporating publicly available circle rates, which consider the ground\ndevelopment of the land and its surrounding areas.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:50:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dwivedi","Ras",""],["Patel","Sumit",""],["Shukla","Prof. Sandeep",""]]}
{"id":"2308.05951","submitter":"Anupam Sahoo","authors":"Anupam Sahoo, Apurba Das","title":"Homotopy conformal algebras","comments":"18 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math-ph math.MP math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The notion of conformal algebras was introduced by Victor G. Kac using the\naxiomatic description of the operator product expansion of chiral fields in\nconformal field theory. The structure theory, representations and cohomology of\nLie and associative conformal algebras are extensively studied in the\nliterature. In this paper, we first introduce $A_\\infty$-conformal algebras as\nthe homotopy analogue of associative conformal algebras and provide some\nequivalent descriptions. We characterize some $A_\\infty$-conformal algebras in\nterms of Hochschild cohomology classes of associative conformal algebras. Next,\nwe introduce associative conformal $2$-algebras as the categorification of\nassociative conformal algebras. We show that the category of associative\nconformal $2$-algebras and the category of $2$-term $A_\\infty$-conformal\nalgebras are equivalent. Finally, we consider $L_\\infty$-conformal algebras and\nfind their relations with $A_\\infty$-conformal algebras.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:53:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sahoo","Anupam",""],["Das","Apurba",""]]}
{"id":"2308.05952","submitter":"Franziska Weindel","authors":"Franziska Weindel, Andreas L. Gimpel, Robert N. Grass and Reinhard\n  Heckel","title":"Embracing Errors is More Efficient than Avoiding Them through\n  Constrained Coding for DNA Data Storage","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":"  DNA is an attractive medium for digital data storage. When data is stored on\nDNA, errors occur, which makes error-correcting coding techniques critical for\nreliable DNA data storage. To reduce the number of errors, a common technique\nis to include constraints that avoid homopolymers (consecutive repeated\nnucleotides) and balance the GC content, as sequences with homopolymers and\nunbalanced GC contents are often associated with larger error rates. However,\nconstrained coding comes at the cost of an increase in redundancy. An\nalternative (unconstrained coding) is to control the errors by randomizing the\nsequences, embracing errors, and paying for them with additional coding\nredundancy. In this paper, we determine the error regimes in which embracing\nerrors is more efficient than constrained coding. We find that constrained\ncoding is inefficient in most common error regimes for DNA data storage.\nSpecifically, the error probabilities for nucleotides in homopolymers and in\nsequences with unbalanced GC contents must be very large for constrained coding\nto achieve a higher code rate than unconstrained coding.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:54:30 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Weindel","Franziska",""],["Gimpel","Andreas L.",""],["Grass","Robert N.",""],["Heckel","Reinhard",""]]}
{"id":"2308.05953","submitter":"Osamu Saeki","authors":"Osamu Saeki","title":"Reeb spaces of smooth functions on manifolds II","comments":"11 pages, 6 figures, continuation of the previous paper \"Reeb spaces\n  of smooth functions on manifolds\"","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Reeb space of a continuous function is the space of connected components\nof the level sets. In this paper we characterize those smooth functions on\nclosed manifolds whose Reeb spaces have the structure of a finite graph. We\nalso give several explicit examples of smooth functions on closed manifolds\nsuch that they themselves or their Reeb spaces have some interesting\nproperties.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 05:55:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Saeki","Osamu",""]]}
{"id":"2308.05954","submitter":"Damien Gaboriau","authors":"P\\'en\\'elope Azuelos and Damien Gaboriau","title":"Perfect kernel and dynamics: from Bass-Serre theory to hyperbolic groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce several approaches to studying the Cantor-Bendixson\ndecomposition of and the dynamics on the (topological) space of subgroups for\nvarious families of countable groups. In particular, we uncover the perfect\nkernel and the Cantor-Bendixson rank of the space of subgroups of many new\ngroups, including for instance infinitely ended groups, limit groups,\nhyperbolic 3-manifold groups and many graphs of free groups with cyclic edge\ngroups. We also study the topological dynamics of the conjugation action on the\nperfect kernel, establishing the conditions for topological transitivity and\nhigher topological transitivity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:02:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Azuelos","P\u00e9n\u00e9lope",""],["Gaboriau","Damien",""]]}
{"id":"2308.05955","submitter":"Yuya Ominato","authors":"Yuya Ominato, Ai Yamakage, and Mamoru Matsuo","title":"Dynamical Majorana Ising spin response in a topological\n  superconductor-magnet hybrid by microwave irradiation","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a dynamical spin response of surface Majorana fermions in a\ntopological superconductor-magnet hybrid under microwave irradiation. We find a\nmethod to toggle between dissipative and non-dissipative Majorana Ising spin\ndynamics by adjusting the external magnetic field angle and the microwave\nfrequency. This reflects the topological nature of the Majorana fermions,\nenhancing the Gilbert damping of the magnet, thereby, providing a detection\nmethod for the Majorana Ising spins. Our findings illuminate a magnetic probe\nfor Majorana fermions, paving the path to innovative spin devices.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:10:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ominato","Yuya",""],["Yamakage","Ai",""],["Matsuo","Mamoru",""]]}
{"id":"2308.05956","submitter":"Wakana Kubo","authors":"Ryosuke Nakayama, Sohei Saito, Takuo Tanaka, and Wakana Kubo","title":"Metasurface absorber enhanced thermoelectric conversion","comments":"13 pages, 7 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Metasurfaces are artificial thin materials that achieve optical thickness\nthrough thin geometrical structure. This feature of metasurfaces results in\nunprecedented benefits for enhancing the performance of optoelectronic devices.\nIn this study, we report that this metasurface feature is also essential to\ndrive photo-thermoelectric conversion, which requires the accumulation of\nthermal energy and effective heat conduction. For example, a\nmetasurface-attached thermoelectric device placed in an environment with\nuniform thermal radiation generates an output voltage by gathering the thermal\nenergies existing in the environment and creating an additional thermal\ngradient across the thermoelectric element. In contrast, when a\n100-um-thick-carbon-black-coated electrode was used instead of the metasurface,\nthe device showed low-er thermoelectric performance than that of the\nmetasurface-attached device although carbon black exhibits higher infrared\nabsorption than the metasurface. These results indicate that metasurface\ncharacteristics of optical thickness and thin geometrical structure for\nachieving the high thermal conductance are essential in enhancing the\nperformance of photo-thermoelectric devices in terms of the effective\ncollection of thermal energies and conduction of local heating.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:11:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Nakayama","Ryosuke",""],["Saito","Sohei",""],["Tanaka","Takuo",""],["Kubo","Wakana",""]]}
{"id":"2308.05957","submitter":"Jun Hee Kim","authors":"Jun Hee Kim, Jaeman Son, Hyunsoo Kim, Eunjo Lee","title":"Node Embedding for Homophilous Graphs with ARGEW: Augmentation of Random\n  walks by Graph Edge Weights","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Representing nodes in a network as dense vectors node embeddings is important\nfor understanding a given network and solving many downstream tasks. In\nparticular, for weighted homophilous graphs where similar nodes are connected\nwith larger edge weights, we desire node embeddings where node pairs with\nstrong weights have closer embeddings. Although random walk based node\nembedding methods like node2vec and node2vec+ do work for weighted networks via\nincluding edge weights in the walk transition probabilities, our experiments\nshow that the embedding result does not adequately reflect edge weights. In\nthis paper, we propose ARGEW (Augmentation of Random walks by Graph Edge\nWeights), a novel augmentation method for random walks that expands the corpus\nin such a way that nodes with larger edge weights end up with closer\nembeddings. ARGEW can work with any random walk based node embedding method,\nbecause it is independent of the random sampling strategy itself and works on\ntop of the already-performed walks. With several real-world networks, we\ndemonstrate that with ARGEW, compared to not using it, the desired pattern that\nnode pairs with larger edge weights have closer embeddings is much clearer. We\nalso examine ARGEW's performance in node classification: node2vec with ARGEW\noutperforms pure node2vec and is not sensitive to hyperparameters (i.e.\nconsistently good). In fact, it achieves similarly good results as supervised\nGCN, even without any node feature or label information during training.\nFinally, we explain why ARGEW works consistently well by exploring the\ncoappearance distributions using a synthetic graph with clear structural roles.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:19:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kim","Jun Hee",""],["Son","Jaeman",""],["Kim","Hyunsoo",""],["Lee","Eunjo",""]]}
{"id":"2308.05958","submitter":"Lingyun Qiu","authors":"Lingyun Qiu, Zhongjing Wang, Hui Yu, Shenwen Yu","title":"Traceability of Water Pollution: An Inversion Scheme Via Dynamic CGO\n  Solutions","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 aim to identify the time-dependent source term in the diffusion equation\nusing boundary measurements. This facilitates tracing back the origins of\nenvironmental pollutants. Based on the idea of dynamic complex geometrical\noptics (CGO) solutions, we analyze a variational formulation of the inverse\nsource problem and prove the uniqueness result. We propose a two-step\nreconstruction algorithm. Initially, the locations of the point sources are\ndetermined, followed by the reconstruction of the Fourier components of the\nemission concentration functions. Numerical experiments on simulated data are\nconducted. The results demonstrate that our proposed two-step reconstruction\nalgorithm can reliably reconstruct multiple point sources and accurately\nreconstruct the emission concentration functions. Additionally, we partition\nthe algorithm into online and offline computations, with the bulk of the work\ndone offline. This paves the way for real-time traceability of pollutants. Our\nproposed method, applicable in various fields - especially those related to\nwater pollution, can identify the source of a contaminant in the environment,\nthus serving as a valuable tool in environmental protection.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:25:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Qiu","Lingyun",""],["Wang","Zhongjing",""],["Yu","Hui",""],["Yu","Shenwen",""]]}
{"id":"2308.05959","submitter":"Mateen Ulhaq","authors":"Mateen Ulhaq, Ivan V. Baji\\'c","title":"Learned Point Cloud Compression for Classification","comments":"6 pages, 4 figures, IEEE MMSP 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":"  Deep learning is increasingly being used to perform machine vision tasks such\nas classification, object detection, and segmentation on 3D point cloud data.\nHowever, deep learning inference is computationally expensive. The limited\ncomputational capabilities of end devices thus necessitate a codec for\ntransmitting point cloud data over the network for server-side processing. Such\na codec must be lightweight and capable of achieving high compression ratios\nwithout sacrificing accuracy. Motivated by this, we present a novel point cloud\ncodec that is highly specialized for the machine task of classification. Our\ncodec, based on PointNet, achieves a significantly better rate-accuracy\ntrade-off in comparison to alternative methods. In particular, it achieves a\n94% reduction in BD-bitrate over non-specialized codecs on the ModelNet40\ndataset. For low-resource end devices, we also propose two lightweight\nconfigurations of our encoder that achieve similar BD-bitrate reductions of 93%\nand 92% with 3% and 5% drops in top-1 accuracy, while consuming only 0.470 and\n0.048 encoder-side kMACs/point, respectively. Our codec demonstrates the\npotential of specialized codecs for machine analysis of point clouds, and\nprovides a basis for extension to more complex tasks and datasets in the\nfuture.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:28:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ulhaq","Mateen",""],["Baji\u0107","Ivan V.",""]]}
{"id":"2308.05960","submitter":"Zhiwei Liu","authors":"Zhiwei Liu, Weiran Yao, Jianguo Zhang, Le Xue, Shelby Heinecke,\n  Rithesh Murthy, Yihao Feng, Zeyuan Chen, Juan Carlos Niebles, Devansh Arpit,\n  Ran Xu, Phil Mui, Huan Wang, Caiming Xiong, Silvio Savarese","title":"BOLAA: Benchmarking and Orchestrating LLM-augmented Autonomous Agents","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The massive successes of large language models (LLMs) encourage the emerging\nexploration of LLM-augmented Autonomous Agents (LAAs). An LAA is able to\ngenerate actions with its core LLM and interact with environments, which\nfacilitates the ability to resolve complex tasks by conditioning on past\ninteractions such as observations and actions. Since the investigation of LAA\nis still very recent, limited explorations are available. Therefore, we provide\na comprehensive comparison of LAA in terms of both agent architectures and LLM\nbackbones. Additionally, we propose a new strategy to orchestrate multiple LAAs\nsuch that each labor LAA focuses on one type of action, \\textit{i.e.} BOLAA,\nwhere a controller manages the communication among multiple agents. We conduct\nsimulations on both decision-making and multi-step reasoning environments,\nwhich comprehensively justify the capacity of LAAs. Our performance results\nprovide quantitative suggestions for designing LAA architectures and the\noptimal choice of LLMs, as well as the compatibility of both. We release our\nimplementation code of LAAs to the public at\n\\url{https://github.com/salesforce/BOLAA}.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:37:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Zhiwei",""],["Yao","Weiran",""],["Zhang","Jianguo",""],["Xue","Le",""],["Heinecke","Shelby",""],["Murthy","Rithesh",""],["Feng","Yihao",""],["Chen","Zeyuan",""],["Niebles","Juan Carlos",""],["Arpit","Devansh",""],["Xu","Ran",""],["Mui","Phil",""],["Wang","Huan",""],["Xiong","Caiming",""],["Savarese","Silvio",""]]}
{"id":"2308.05961","submitter":"Zikun Zhuang","authors":"Zikun Zhuang, Ruihao Qian, Chi Xie, Shuang Liang","title":"Compositional Learning in Transformer-Based Human-Object Interaction\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":"  Human-object interaction (HOI) detection is an important part of\nunderstanding human activities and visual scenes. The long-tailed distribution\nof labeled instances is a primary challenge in HOI detection, promoting\nresearch in few-shot and zero-shot learning. Inspired by the combinatorial\nnature of HOI triplets, some existing approaches adopt the idea of\ncompositional learning, in which object and action features are learned\nindividually and re-composed as new training samples. However, these methods\nfollow the CNN-based two-stage paradigm with limited feature extraction\nability, and often rely on auxiliary information for better performance.\nWithout introducing any additional information, we creatively propose a\ntransformer-based framework for compositional HOI learning. Human-object pair\nrepresentations and interaction representations are re-composed across\ndifferent HOI instances, which involves richer contextual information and\npromotes the generalization of knowledge. Experiments show our simple but\neffective method achieves state-of-the-art performance, especially on rare HOI\nclasses.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:41:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhuang","Zikun",""],["Qian","Ruihao",""],["Xie","Chi",""],["Liang","Shuang",""]]}
{"id":"2308.05962","submitter":"Qinghua Lu","authors":"Yue Liu, Qinghua Lu, Liming Zhu, Hye-Young Paik","title":"Decentralised Governance for Foundation Model based AI Systems:\n  Exploring the Role of Blockchain in Responsible AI","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":"  Foundation models including large language models (LLMs) are increasingly\nattracting interest worldwide for their distinguished capabilities and\npotential to perform a wide variety of tasks. Nevertheless, people are\nconcerned about whether foundation model based AI systems are properly governed\nto ensure trustworthiness of foundation model based AI systems and to prevent\nmisuse that could harm humans, society and the environment. In this paper, we\nidentify eight governance challenges of foundation model based AI systems\nregarding the three fundamental dimensions of governance: decision rights,\nincentives, and accountability. Furthermore, we explore the potential of\nblockchain as a solution to address the challenges by providing a distributed\nledger to facilitate decentralised governance. We present an architecture that\ndemonstrates how blockchain can be leveraged to realise governance in\nfoundation model based AI systems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:41:47 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:50:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Yue",""],["Lu","Qinghua",""],["Zhu","Liming",""],["Paik","Hye-Young",""]]}
{"id":"2308.05963","submitter":"Shun-Qing Shen","authors":"Kai-Zhi Bai, Bo Fu, Zhenyu Zhang, and Shun-Qing Shen","title":"Metallic Quantized Anomalous Hall Effect without Chiral Edge States","comments":"6 pages, 4 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":"  The quantum anomalous Hall effect (QAHE) is a topological state of matter\nwith a quantized Hall resistance. It has been observed in some two-dimensional\ninsulating materials such as magnetic topological insulator films and twisted\nbilayer graphene. These materials are insulating in the bulk, but possess\nchiral edge states carrying the edge current around the systems. Here we\ndiscover a metallic QAHE in a topological insulator film with magnetic sandwich\nheterostructure, in which the Hall conductance is quantized to $e^{2}/h$, but\nthe longitudinal conductance remains finite. This effect is attributed to the\nexistence of a pair of massless Dirac cones of surface fermions, with each\ncontributing half of the Hall conductance due to quantum anomaly. It is not\ncharacterized by a Chern number and not associated to any chiral edge states.\nOur study offers novel insights into topological transport phenomena and\ntopological metallic states of matter.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:42:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bai","Kai-Zhi",""],["Fu","Bo",""],["Zhang","Zhenyu",""],["Shen","Shun-Qing",""]]}
{"id":"2308.05964","submitter":"Weihao Li","authors":"Weihao Li, Dianne Cook, Emi Tanaka, Susan VanderPlas","title":"A Plot is Worth a Thousand Tests: Assessing Residual Diagnostics with\n  the Lineup Protocol","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Regression experts consistently recommend plotting residuals for model\ndiagnosis, despite the availability of many numerical hypothesis test\nprocedures designed to use residuals to assess problems with a model fit. Here\nwe provide evidence for why this is good advice using data from a visual\ninference experiment. We show how conventional tests are too sensitive, which\nmeans that too often the conclusion would be that the model fit is inadequate.\nThe experiment uses the lineup protocol which puts a residual plot in the\ncontext of null plots. This helps generate reliable and consistent reading of\nresidual plots for better model diagnosis. It can also help in an obverse\nsituation where a conventional test would fail to detect a problem with a model\ndue to contaminated data. The lineup protocol also detects a range of\ndepartures from good residuals simultaneously.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:46:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Weihao",""],["Cook","Dianne",""],["Tanaka","Emi",""],["VanderPlas","Susan",""]]}
{"id":"2308.05965","submitter":"Ju Won Seo","authors":"Ju Won Seo, Jin Sung Kim, and Chung Choo Chung","title":"Classification Method of Road Surface Condition and Type with LiDAR\n  Using Spatiotemporal Information","comments":"10 pages","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 spatiotemporal architecture with a deep neural network\n(DNN) for road surface conditions and types classification using LiDAR. It is\nknown that LiDAR provides information on the reflectivity and number of point\nclouds depending on a road surface. Thus, this paper utilizes the information\nto classify the road surface. We divided the front road area into four\nsubregions. First, we constructed feature vectors using each subregion's\nreflectivity, number of point clouds, and in-vehicle information. Second, the\nDNN classifies road surface conditions and types for each subregion. Finally,\nthe output of the DNN feeds into the spatiotemporal process to make the final\nclassification reflecting vehicle speed and probability given by the outcomes\nof softmax functions of the DNN output layer. To validate the effectiveness of\nthe proposed method, we performed a comparative study with five other\nalgorithms. With the proposed DNN, we obtained the highest accuracy of 98.0\\%\nand 98.6\\% for two subregions near the vehicle. In addition, we implemented the\nproposed method on the Jetson TX2 board to confirm that it is applicable in\nreal-time.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:50:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Seo","Ju Won",""],["Kim","Jin Sung",""],["Chung","Chung Choo",""]]}
{"id":"2308.05966","submitter":"Jungyeon Kim","authors":"Jungyeon Kim, Hyowon Lee, Heedong Do, Jinseok Choi, Jeonghun Park,\n  Wonjae Shin, Yonina C. Eldar, and Namyoon Lee","title":"On the Learning of Digital Self-Interference Cancellation in Full-Duplex\n  Radios","comments":"8 pages, 5 figures and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Full-duplex communication systems have the potential to achieve significantly\nhigher data rates and lower latency compared to their half-duplex counterparts.\nThis advantage stems from their ability to transmit and receive data\nsimultaneously. However, to enable successful full-duplex operation, the\nprimary challenge lies in accurately eliminating strong self-interference (SI).\nOvercoming this challenge involves addressing various issues, including the\nnonlinearity of power amplifiers, the time-varying nature of the SI channel,\nand the non-stationary transmit data distribution. In this article, we present\na review of recent advancements in digital self-interference cancellation (SIC)\nalgorithms. Our focus is on comparing the effectiveness of adaptable\nmodel-based SIC methods with their model-free counterparts that leverage\ndata-driven machine learning techniques. Through our comparison study under\npractical scenarios, we demonstrate that the model-based SIC approach offers a\nmore robust solution to the time-varying SI channel and the non-stationary\ntransmission, achieving optimal SIC performance in terms of the convergence\nrate while maintaining low computational complexity. To validate our findings,\nwe conduct experiments using a software-defined radio testbed that conforms to\nthe IEEE 802.11a standards. The experimental results demonstrate the robustness\nof the model-based SIC methods, providing practical evidence of their\neffectiveness.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:54:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kim","Jungyeon",""],["Lee","Hyowon",""],["Do","Heedong",""],["Choi","Jinseok",""],["Park","Jeonghun",""],["Shin","Wonjae",""],["Eldar","Yonina C.",""],["Lee","Namyoon",""]]}
{"id":"2308.05967","submitter":"Huikai Wu","authors":"Shenxiao Mei, Chenglong Ma, Feihong Shen, Huikai Wu","title":"YOLOrtho -- A Unified Framework for Teeth Enumeration and Dental Disease\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting dental diseases through panoramic X-rays images is a standard\nprocedure for dentists. Normally, a dentist need to identify diseases and find\nthe infected teeth. While numerous machine learning models adopting this\ntwo-step procedure have been developed, there has not been an end-to-end model\nthat can identify teeth and their associated diseases at the same time. To fill\nthe gap, we develop YOLOrtho, a unified framework for teeth enumeration and\ndental disease detection. We develop our model on Dentex Challenge 2023 data,\nwhich consists of three distinct types of annotated data. The first part is\nlabeled with quadrant, and the second part is labeled with quadrant and\nenumeration and the third part is labeled with quadrant, enumeration and\ndisease. To further improve detection, we make use of Tufts Dental public\ndataset. To fully utilize the data and learn both teeth detection and disease\nidentification simultaneously, we formulate diseases as attributes attached to\ntheir corresponding teeth. Due to the nature of position relation in teeth\nenumeration, We replace convolution layer with CoordConv in our model to\nprovide more position information for the model. We also adjust the model\narchitecture and insert one more upsampling layer in FPN in favor of large\nobject detection. Finally, we propose a post-process strategy for teeth layout\nthat corrects teeth enumeration based on linear sum assignment. Results from\nexperiments show that our model exceeds large Diffusion-based model.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:54:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mei","Shenxiao",""],["Ma","Chenglong",""],["Shen","Feihong",""],["Wu","Huikai",""]]}
{"id":"2308.05968","submitter":"Qing Rao","authors":"Qing Rao, Guoyun Gao, Xinyu Wang, Hongxia Xue, Dong-Keun Ki","title":"Scratching lithography, manipulation, and soldering of 2D materials\n  using microneedle probes","comments":"10 pages, 5 figures","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 demonstrate a facile technique to scratch, manipulate, and solder\nexfoliated flakes of layered 2D materials using a microneedle probe attached to\nthe precision xyz manipulators under an optical microscope. We show that the\nprobe can be used to scratch the flakes into a designated shape with a\nprecision at micrometer scales, move, rotate, roll-up, and exfoliate the flakes\nto help building various types of heterostructures, and form electric contacts\nby directly drawing/placing thin metal wires over the flake. All these can be\ndone without lithography and etching steps that often take long processing time\nand involve harmful chemicals. Moreover, the setup can be easily integrated\ninto any van der Waals assembly systems such as those in a glove box for\nhandling air/chemical-sensitive materials. The microneedle technique\ndemonstrated in this study therefore enables quick fabrications of devices from\ndiverse 2D materials for testing their properties at an early stage of research\nbefore conducting more advanced studies and helps to build different types of\nvan der Waals heterostructures.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:00:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rao","Qing",""],["Gao","Guoyun",""],["Wang","Xinyu",""],["Xue","Hongxia",""],["Ki","Dong-Keun",""]]}
{"id":"2308.05969","submitter":"Yafei Wang","authors":"Yafei Wang, Jianguo Liu","title":"Learning nonparametric DAGs with incremental information via high-order\n  HSIC","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":"  Score-based methods for learning Bayesain networks(BN) aim to maximizing the\nglobal score functions. However, if local variables have direct and indirect\ndependence simultaneously, the global optimization on score functions misses\nedges between variables with indirect dependent relationship, of which scores\nare smaller than those with direct dependent relationship. In this paper, we\npresent an identifiability condition based on a determined subset of parents to\nidentify the underlying DAG. By the identifiability condition, we develop a\ntwo-phase algorithm namely optimal-tuning (OT) algorithm to locally amend the\nglobal optimization. In the optimal phase, an optimization problem based on\nfirst-order Hilbert-Schmidt independence criterion (HSIC) gives an estimated\nskeleton as the initial determined parents subset. In the tuning phase, the\nskeleton is locally tuned by deletion, addition and DAG-formalization\nstrategies using the theoretically proved incremental properties of high-order\nHSIC. Numerical experiments for different synthetic datasets and real-world\ndatasets show that the OT algorithm outperforms existing methods. Especially in\nSigmoid Mix model with the size of the graph being ${\\rm\\bf d=40}$, the\nstructure intervention distance (SID) of the OT algorithm is 329.7 smaller than\nthe one obtained by CAM, which indicates that the graph estimated by the OT\nalgorithm misses fewer edges compared with CAM.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:07:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Yafei",""],["Liu","Jianguo",""]]}
{"id":"2308.05970","submitter":"Yuesong Li","authors":"Yuesong Li, Feng Pan, Helong Yan, Xiuli Xin, Xiaoxue Feng","title":"Focused Specific Objects NeRF","comments":"17 pages,32 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most NeRF-based models are designed for learning the entire scene, and\ncomplex scenes can lead to longer learning times and poorer rendering effects.\nThis paper utilizes scene semantic priors to make improvements in fast\ntraining, allowing the network to focus on the specific targets and not be\naffected by complex backgrounds. The training speed can be increased by 7.78\ntimes with better rendering effect, and small to medium sized targets can be\nrendered faster. In addition, this improvement applies to all NeRF-based\nmodels. Considering the inherent multi-view consistency and smoothness of NeRF,\nthis paper also studies weak supervision by sparsely sampling negative ray\nsamples. With this method, training can be further accelerated and rendering\nquality can be maintained. Finally, this paper extends pixel semantic and color\nrendering formulas and proposes a new scene editing technique that can achieve\nunique displays of the specific semantic targets or masking them in rendering.\nTo address the problem of unsupervised regions incorrect inferences in the\nscene, we also designed a self-supervised loop that combines morphological\noperations and clustering.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:07:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Yuesong",""],["Pan","Feng",""],["Yan","Helong",""],["Xin","Xiuli",""],["Feng","Xiaoxue",""]]}
{"id":"2308.05971","submitter":"Zihao Cheng","authors":"Zihao Cheng, Dongmei Huang, Feng Li, Chao Lu, and P. K. A. Wai","title":"Soliton frequency comb generation in a low Q microcavity coupled to a\n  gain microcavity","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":"  Soliton frequency comb generation in coupled nonlinear microcavities is\nattractive because a coupled microcavity offers more flexibility and\npossibilities compared to a single nonlinear microcavity. In this paper, we\ninvestigate how an amplifying auxiliary cavity affects the bistability region\nof the main cavity and soliton frequency comb generation. When the auxiliary\ncavity has a small gain, it can partially compensate for the loss of the main\ncavity allowing the generation of soliton combs with a relatively low Q-factor\nin the main cavity. A low Q-factor microcavity would reduce the difficulty of\nfabrication and extend the microcavity platform to different types of\nmaterials. However, if the gain of the auxiliary cavity is too large, a\nfrequency comb cannot be generated because the coupled nonlinear microcavity\nsystem is no longer dissipative. Our results provide a theoretical\nunderstanding and experimental guidance for the bistability region and soliton\nfrequency comb generation in coupled nonlinear microcavities with an amplifying\nauxiliary cavity. The results will facilitate the development of chip-scale\nintegrated optical frequency comb sources.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:09:16 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cheng","Zihao",""],["Huang","Dongmei",""],["Li","Feng",""],["Lu","Chao",""],["Wai","P. K. A.",""]]}
{"id":"2308.05972","submitter":"Yuhan Zhao","authors":"Yuhan Zhao, Rui Chen, Riwei Lai, Qilong Han, Hongtao Song, Li Chen","title":"Augmented Negative Sampling for Collaborative Filtering","comments":"11 pages, 16 figures,","journal-ref":null,"doi":"10.1145/3604915.3608811","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Negative sampling is essential for implicit-feedback-based collaborative\nfiltering, which is used to constitute negative signals from massive unlabeled\ndata to guide supervised learning. The state-of-the-art idea is to utilize hard\nnegative samples that carry more useful information to form a better decision\nboundary. To balance efficiency and effectiveness, the vast majority of\nexisting methods follow the two-pass approach, in which the first pass samples\na fixed number of unobserved items by a simple static distribution and then the\nsecond pass selects the final negative items using a more sophisticated\nnegative sampling strategy. However, selecting negative samples from the\noriginal items is inherently restricted, and thus may not be able to contrast\npositive samples well. In this paper, we confirm this observation via\nexperiments and introduce two limitations of existing solutions: ambiguous trap\nand information discrimination. Our response to such limitations is to\nintroduce augmented negative samples. This direction renders a substantial\ntechnical challenge because constructing unconstrained negative samples may\nintroduce excessive noise that distorts the decision boundary. To this end, we\nintroduce a novel generic augmented negative sampling paradigm and provide a\nconcrete instantiation. First, we disentangle hard and easy factors of negative\nitems. Next, we generate new candidate negative samples by augmenting only the\neasy factors in a regulated manner: the direction and magnitude of the\naugmentation are carefully calibrated. Finally, we design an advanced negative\nsampling strategy to identify the final augmented negative samples, which\nconsiders not only the score function used in existing methods but also a new\nmetric called augmentation gain. Extensive experiments on real-world datasets\ndemonstrate that our method significantly outperforms state-of-the-art\nbaselines.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:09:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhao","Yuhan",""],["Chen","Rui",""],["Lai","Riwei",""],["Han","Qilong",""],["Song","Hongtao",""],["Chen","Li",""]]}
{"id":"2308.05973","submitter":"Zied Baklouti","authors":"Zied Baklouti (UPCit\\'e, ENIT)","title":"Tweet Sentiment Extraction using Viterbi Algorithm with Transfer\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tweet sentiment extraction extracts the most significant portion of the\nsentence, determining whether the sentiment is positive or negative. This\nresearch aims to identify the part of tweet sentences that strikes any emotion.\nTo reach this objective, we continue improving the Viterbi algorithm previously\nmodified by the author to make it able to receive pre-trained model parameters.\nWe introduce the confidence score and vector as two indicators responsible for\nevaluating the model internally before assessing the final results. We then\npresent a method to fine-tune this nonparametric model. We found that the model\ngets highly explainable as the confidence score vector reveals precisely where\nthe least confidence predicted states are and if the modifications approved\nameliorate the confidence score or if the tuning is going in the wrong\ndirection.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:16:49 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Baklouti","Zied","","UPCit\u00e9, ENIT"]]}
{"id":"2308.05974","submitter":"Meirav Zehavi","authors":"Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stephan\n  Thomasse, Meirav Zehavi","title":"Lossy Kernelization for (Implicit) Hitting Set Problems","comments":"Accepted to ESA'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We re-visit the complexity of kernelization for the $d$-Hitting Set problem.\nThis is a classic problem in Parameterized Complexity, which encompasses\nseveral other of the most well-studied problems in this field, such as Vertex\nCover, Feedback Vertex Set in Tournaments (FVST) and Cluster Vertex Deletion\n(CVD). In fact, $d$-Hitting Set encompasses any deletion problem to a\nhereditary property that can be characterized by a finite set of forbidden\ninduced subgraphs. With respect to bit size, the kernelization complexity of\n$d$-Hitting Set is essentially settled: there exists a kernel with $O(k^d)$\nbits ($O(k^d)$ sets and $O(k^{d-1})$ elements) and this it tight by the result\nof Dell and van Melkebeek [STOC 2010, JACM 2014]. Still, the question of\nwhether there exists a kernel for $d$-Hitting Set with fewer elements has\nremained one of the most major open problems~in~Kernelization.\n  In this paper, we first show that if we allow the kernelization to be lossy\nwith a qualitatively better loss than the best possible approximation ratio of\npolynomial time approximation algorithms, then one can obtain kernels where the\nnumber of elements is linear for every fixed $d$. Further, based on this, we\npresent our main result: we show that there exist approximate Turing\nkernelizations for $d$-Hitting Set that even beat the established bit-size\nlower bounds for exact kernelizations -- in fact, we use a constant number of\noracle calls, each with ``near linear'' ($O(k^{1+\\epsilon})$) bit size, that\nis, almost the best one could hope for. Lastly, for two special cases of\nimplicit 3-Hitting set, namely, FVST and CVD, we obtain the ``best of both\nworlds'' type of results -- $(1+\\epsilon)$-approximate kernelizations with a\nlinear number of vertices. In terms of size, this substantially improves the\nexact kernels of Fomin et al. [SODA 2018, TALG 2019], with simpler arguments.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:17:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fomin","Fedor V.",""],["Le","Tien-Nam",""],["Lokshtanov","Daniel",""],["Saurabh","Saket",""],["Thomasse","Stephan",""],["Zehavi","Meirav",""]]}
{"id":"2308.05975","submitter":"Yin Yifei","authors":"Liang Chen, Yifei Yin, Hao Shi, Qingqing Sheng, Wei Li","title":"A Self-supervised SAR Image Despeckling Strategy Based on\n  Parameter-sharing Convolutional Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Speckle noise is generated due to the SAR imaging mechanism, which brings\ndifficulties in SAR image interpretation. Hence, despeckling is a helpful step\nin SAR pre-processing. Nowadays, deep learning has been proved to be a\nprogressive method for SAR image despeckling. Most deep learning methods for\ndespeckling are based on supervised learning, which needs original SAR images\nand speckle-free SAR images to train the network. However, the speckle-free SAR\nimages are generally not available. So, this issue was tackled by adding\nmultiplicative noise to optical images synthetically for simulating speckled\nimage. Therefore, there are following challenges in SAR image despeckling: (1)\nlack of speckle-free SAR image; (2) difficulty in keeping details such as edges\nand textures in heterogeneous areas. To address these issues, we propose a\nself-supervised SAR despeckling strategy that can be trained without\nspeckle-free images. Firstly, the feasibility of SAR image despeckling without\nspeckle-free images is proved theoretically. Then, the sub-sampler based on the\nadjacent-syntropy criteria is proposed. The training image pairs are generated\nby the sub-sampler from real-word SAR image to estimate the noise distribution.\nFurthermore, to make full use of training pairs, the parameter sharing\nconvolutional neural networks are adopted. Finally, according to the\ncharacteristics of SAR images, a multi-feature loss function is proposed. The\nproposed loss function is composed of despeckling term, regular term and\nperception term, to constrain the gap between the generated paired images. The\nability of edge and texture feature preserving is improved simultaneously.\nFinally, qualitative and quantitative experiments are validated on real-world\nSAR images, showing better performances than several advanced SAR image\ndespeckling methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:19:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Liang",""],["Yin","Yifei",""],["Shi","Hao",""],["Sheng","Qingqing",""],["Li","Wei",""]]}
{"id":"2308.05976","submitter":"Yapeng Meng","authors":"Yapeng Meng, Songru Yang, Xu Hu, Rui Zhao, Lincheng Li, Zhenwei Shi,\n  Zhengxia Zou","title":"Zero-shot Text-driven Physically Interpretable Face Editing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper proposes a novel and physically interpretable method for face\nediting based on arbitrary text prompts. Different from previous\nGAN-inversion-based face editing methods that manipulate the latent space of\nGANs, or diffusion-based methods that model image manipulation as a reverse\ndiffusion process, we regard the face editing process as imposing vector flow\nfields on face images, representing the offset of spatial coordinates and color\nfor each image pixel. Under the above-proposed paradigm, we represent the\nvector flow field in two ways: 1) explicitly represent the flow vectors with\nrasterized tensors, and 2) implicitly parameterize the flow vectors as\ncontinuous, smooth, and resolution-agnostic neural fields, by leveraging the\nrecent advances of implicit neural representations. The flow vectors are\niteratively optimized under the guidance of the pre-trained Contrastive\nLanguage-Image Pretraining~(CLIP) model by maximizing the correlation between\nthe edited image and the text prompt. We also propose a learning-based one-shot\nface editing framework, which is fast and adaptable to any text prompt input.\nOur method can also be flexibly extended to real-time video face editing.\nCompared with state-of-the-art text-driven face editing methods, our method can\ngenerate physically interpretable face editing results with high identity\nconsistency and image quality. Our code will be made publicly available.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:20:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Meng","Yapeng",""],["Yang","Songru",""],["Hu","Xu",""],["Zhao","Rui",""],["Li","Lincheng",""],["Shi","Zhenwei",""],["Zou","Zhengxia",""]]}
{"id":"2308.05977","submitter":"Tomohiro I","authors":"Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik K\\\"oppl, Ryo\n  Yoshinaka, Ayumi Shinohara","title":"Breaking a Barrier in Constructing Compact Indexes for Parameterized\n  Pattern Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A parameterized string (p-string) is a string over an alphabet $(\\Sigma_{s}\n\\cup \\Sigma_{p})$, where $\\Sigma_{s}$ and $\\Sigma_{p}$ are disjoint alphabets\nfor static symbols (s-symbols) and for parameter symbols (p-symbols),\nrespectively. Two p-strings $x$ and $y$ are said to parameterized match\n(p-match) if and only if $x$ can be transformed into $y$ by applying a\nbijection on $\\Sigma_{p}$ to every occurrence of p-symbols in $x$. The indexing\nproblem for p-matching is to preprocess a p-string $T$ of length $n$ so that we\ncan efficiently find the occurrences of substrings of $T$ that p-match with a\ngiven pattern. Extending the Burrows-Wheeler Transform (BWT) based index for\nexact string pattern matching, Ganguly et al. [SODA 2017] proposed the first\ncompact index (named pBWT) for p-matching, and posed an open problem on how to\nconstruct it in compact space, i.e., in $O(n \\lg |\\Sigma_{s} \\cup \\Sigma_{p}|)$\nbits of space. Hashimoto et al. [SPIRE 2022] partially solved this problem by\nshowing how to construct some components of pBWTs for $T$ in $O(n\n\\frac{|\\Sigma_{p}| \\lg n}{\\lg \\lg n})$ time in an online manner while reading\nthe symbols of $T$ from right to left. In this paper, we improve the time\ncomplexity to $O(n \\frac{\\lg |\\Sigma_{p}| \\lg n}{\\lg \\lg n})$. We remark that\nremoving the multiplicative factor of $|\\Sigma_{p}|$ from the complexity is of\ngreat interest because it has not been achieved for over a decade in the\nconstruction of related data structures like parameterized suffix arrays even\nin the offline setting. We also show that our data structure can support\nbackward search, a core procedure of BWT-based indexes, at any stage of the\nonline construction, making it the first compact index for p-matching that can\nbe constructed in compact space and even in an online manner.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:24:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Iseri","Kento",""],["I","Tomohiro",""],["Hendrian","Diptarama",""],["K\u00f6ppl","Dominik",""],["Yoshinaka","Ryo",""],["Shinohara","Ayumi",""]]}
{"id":"2308.05978","submitter":"Chao Feng","authors":"Chao Feng, Alberto Huertas Celdran, Pedro Miguel Sanchez Sanchez, Jan\n  Kreischer, Jan von der Assen, Gerome Bovet, Gregorio Martinez Perez, Burkhard\n  Stiller","title":"CyberForce: A Federated Reinforcement Learning Framework for Malware\n  Mitigation","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The expansion of the Internet-of-Things (IoT) paradigm is inevitable, but\nvulnerabilities of IoT devices to malware incidents have become an increasing\nconcern. Recent research has shown that the integration of Reinforcement\nLearning with Moving Target Defense (MTD) mechanisms can enhance cybersecurity\nin IoT devices. Nevertheless, the numerous new malware attacks and the time\nthat agents take to learn and select effective MTD techniques make this\napproach impractical for real-world IoT scenarios. To tackle this issue, this\nwork presents CyberForce, a framework that employs Federated Reinforcement\nLearning (FRL) to collectively and privately determine suitable MTD techniques\nfor mitigating diverse zero-day attacks. CyberForce integrates device\nfingerprinting and anomaly detection to reward or penalize MTD mechanisms\nchosen by an FRL-based agent. The framework has been evaluated in a federation\nconsisting of ten devices of a real IoT platform. A pool of experiments with\nsix malware samples affecting the devices has demonstrated that CyberForce can\nprecisely learn optimum MTD mitigation strategies. When all clients are\naffected by all attacks, the FRL agent exhibits high accuracy and reduced\ntraining time when compared to a centralized RL agent. In cases where different\nclients experience distinct attacks, the CyberForce clients gain benefits\nthrough the transfer of knowledge from other clients and similar attack\nbehavior. Additionally, CyberForce showcases notable robustness against data\npoisoning attacks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:25:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Feng","Chao",""],["Celdran","Alberto Huertas",""],["Sanchez","Pedro Miguel Sanchez",""],["Kreischer","Jan",""],["von der Assen","Jan",""],["Bovet","Gerome",""],["Perez","Gregorio Martinez",""],["Stiller","Burkhard",""]]}
{"id":"2308.05979","submitter":"Rirong Yuan","authors":"Rirong Yuan","title":"Notes on conformal metrics of negative curvature on manifolds with\n  boundary","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use certain Morse functions to construct conformal metrics such that the\neigenvalue vector of modified Schouten tensor belongs to a given cone. As a\nresult, we prove that any Riemannian metric on compact 3-manifolds with\nboundary is conformal to a compact metric of negative sectional curvature.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:25:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yuan","Rirong",""]]}
{"id":"2308.05980","submitter":"H\\'ector Carrascosa De Lucas","authors":"H. Carrascosa, M. \\'A. Satorre, B. Escribano, R. Mart\\'in-Dom\\'enech,\n  G. M. Mu\\~noz Caro","title":"Physical properties of methanol (CH$_3$OH) ice as a function of\n  temperature: Density, infrared band strengths, and crystallization","comments":"11 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The presence of methanol among the common ice components in interstellar\nclouds and protostellar envelopes has been confirmed by the James Webb Space\nTelescope. Methanol is often detected in the gas phase toward lines of sight\nshielded from UV radiation. We measured the volumetric density of methanol ice,\ngrown under simulated interstellar conditions, and the infrared spectroscopy at\ndifferent deposition temperatures and during the warm-up. The IR band strengths\nare provided and the experimental spectra are compared to those computed with a\nmodel. The transition from amorphous to crystalline methanol ice was also\nexplored. Finally, we propose new observations of methanol ice at high\nresolution to probe the methanol ice structure.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:28:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Carrascosa","H.",""],["Satorre","M. \u00c1.",""],["Escribano","B.",""],["Mart\u00edn-Dom\u00e9nech","R.",""],["Caro","G. M. Mu\u00f1oz",""]]}
{"id":"2308.05981","submitter":"Marija \\v{S}indik","authors":"Marija \\v{S}indik, Tomasz Zawi\\'slak, Alessio Recati, and Sandro\n  Stringari","title":"Sound, superfluidity and layer compressibility in a ring dipolar\n  supersolid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a protocol to excite the Goldstone modes of a supersolid dipolar\nBose-Einstein condensed gas confined in a ring geometry. By abruptly removing\nan applied periodic modulation proportional to cos($\\varphi$), where $\\varphi$\nis the azimuthal angle, we explore the resulting oscillations of the gas, by\nsolving the extended Gross-Pitaevskii equation. The value of the two\nlongitudinal sound velocities exhibited in the supersolid phase are analyzed\nusing the hydrodynamic theory of supersolids at zero temperature. This approach\nallows for the determination of the layer compressibility modulus as well as of\nthe superfluid fraction $f_S$, in agreement with the Leggett estimate of the\nnon-classical moment of inertia.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:29:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["\u0160indik","Marija",""],["Zawi\u015blak","Tomasz",""],["Recati","Alessio",""],["Stringari","Sandro",""]]}
{"id":"2308.05982","submitter":"Lihui Yi","authors":"Lihui Yi and Ermin Wei","title":"Optimal EV Charging Decisions Considering Charging Rate Characteristics\n  and Congestion Effects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid growth in the demand for plug-in electric vehicles (EVs), the\ncorresponding charging infrastructures are expanding. These charging stations\nare located at various places and with different congestion levels. EV drivers\nface an important decision in choosing which charging station to go to in order\nto reduce their overall time costs. However, existing literature either assumes\na flat charging rate and hence overlooks the physical characteristics of an EV\nbattery where charging rate is typically reduced as the battery charges, or\nignores the effect of other drivers on an EV's decision making process. In this\npaper, we consider both the predetermined exogenous wait cost and the\nendogenous congestion induced by other drivers' strategic decisions, and\npropose a differential equation based approach to find the optimal strategies.\nWe analytically characterize the equilibrium strategies and find that\nco-located EVs may make different decisions depending on the charging rate\nand/or remaining battery levels. Through numerical experiments, we investigate\nthe impact of charging rate characteristics, modeling parameters and the\nconsideration of endogenous congestion levels on the optimal charging\ndecisions. Finally, we conduct numerical studies on real-world data and find\nthat some EV users with slower charging rates may benefit from the\nparticipation of fast-charging EVs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:29:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yi","Lihui",""],["Wei","Ermin",""]]}
{"id":"2308.05983","submitter":"Xin Dong","authors":"Xin Dong, Rui Wang, Siyuan Liang, Aishan Liu, Lihua Jing","title":"Face Encryption via Frequency-Restricted Identity-Agnostic Attacks","comments":"I noticed something missing in the article's description in\n  subsection 3.2, so I'd like to undo it and re-finalize and describe it","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Billions of people are sharing their daily live images on social media\neveryday. However, malicious collectors use deep face recognition systems to\neasily steal their biometric information (e.g., faces) from these images. Some\nstudies are being conducted to generate encrypted face photos using adversarial\nattacks by introducing imperceptible perturbations to reduce face information\nleakage. However, existing studies need stronger black-box scenario feasibility\nand more natural visual appearances, which challenge the feasibility of privacy\nprotection. To address these problems, we propose a frequency-restricted\nidentity-agnostic (FRIA) framework to encrypt face images from unauthorized\nface recognition without access to personal information. As for the weak\nblack-box scenario feasibility, we obverse that representations of the average\nfeature in multiple face recognition models are similar, thus we propose to\nutilize the average feature via the crawled dataset from the Internet as the\ntarget to guide the generation, which is also agnostic to identities of unknown\nface recognition systems; in nature, the low-frequency perturbations are more\nvisually perceptible by the human vision system. Inspired by this, we restrict\nthe perturbation in the low-frequency facial regions by discrete cosine\ntransform to achieve the visual naturalness guarantee. Extensive experiments on\nseveral face recognition models demonstrate that our FRIA outperforms other\nstate-of-the-art methods in generating more natural encrypted faces while\nattaining high black-box attack success rates of 96%. In addition, we validate\nthe efficacy of FRIA using real-world black-box commercial API, which reveals\nthe potential of FRIA in practice. Our codes can be found in\nhttps://github.com/XinDong10/FRIA.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:38:46 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 08:35:33 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 03:20:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dong","Xin",""],["Wang","Rui",""],["Liang","Siyuan",""],["Liu","Aishan",""],["Jing","Lihua",""]]}
{"id":"2308.05984","submitter":"Alberto Pozanco","authors":"Parisa Zehtabi, Alberto Pozanco, Ayala Bloch, Daniel Borrajo, Sarit\n  Kraus","title":"Contrastive Explanations of Multi-agent Optimization Solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In many real-world scenarios, agents are involved in optimization problems.\nSince most of these scenarios are over-constrained, optimal solutions do not\nalways satisfy all agents. Some agents might be unhappy and ask questions of\nthe form ``Why does solution $S$ not satisfy property $P$?''. In this paper, we\npropose MAoE, a domain-independent approach to obtain contrastive explanations\nby (i) generating a new solution $S^\\prime$ where the property $P$ is enforced,\nwhile also minimizing the differences between $S$ and $S^\\prime$; and (ii)\nhighlighting the differences between the two solutions. Such explanations aim\nto help agents understanding why the initial solution is better than what they\nexpected. We have carried out a computational evaluation that shows that MAoE\ncan generate contrastive explanations for large multi-agent optimization\nproblems. We have also performed an extensive user study in four different\ndomains that shows that, after being presented with these explanations, humans'\nsatisfaction with the original solution increases.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:42:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zehtabi","Parisa",""],["Pozanco","Alberto",""],["Bloch","Ayala",""],["Borrajo","Daniel",""],["Kraus","Sarit",""]]}
{"id":"2308.05985","submitter":"Liang Zhang","authors":"Liang Zhang, Nathaniel Xu, Pengfei Yang, Gaojie Jin, Cheng-Chao Huang,\n  Lijun Zhang","title":"TrajPAC: Towards Robustness Verification of Pedestrian Trajectory\n  Prediction Models","comments":"ICCV 2023 version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robust pedestrian trajectory forecasting is crucial to developing safe\nautonomous vehicles. Although previous works have studied adversarial\nrobustness in the context of trajectory forecasting, some significant issues\nremain unaddressed. In this work, we try to tackle these crucial problems.\nFirstly, the previous definitions of robustness in trajectory prediction are\nambiguous. We thus provide formal definitions for two kinds of robustness,\nnamely label robustness and pure robustness. Secondly, as previous works fail\nto consider robustness about all points in a disturbance interval, we utilise a\nprobably approximately correct (PAC) framework for robustness verification.\nAdditionally, this framework can not only identify potential counterexamples,\nbut also provides interpretable analyses of the original methods. Our approach\nis applied using a prototype tool named TrajPAC. With TrajPAC, we evaluate the\nrobustness of four state-of-the-art trajectory prediction models --\nTrajectron++, MemoNet, AgentFormer, and MID -- on trajectories from five scenes\nof the ETH/UCY dataset and scenes of the Stanford Drone Dataset. Using our\nframework, we also experimentally study various factors that could influence\nrobustness performance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:43:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Liang",""],["Xu","Nathaniel",""],["Yang","Pengfei",""],["Jin","Gaojie",""],["Huang","Cheng-Chao",""],["Zhang","Lijun",""]]}
{"id":"2308.05986","submitter":"Huiwen Xu","authors":"Huiwen Xu, U Kang","title":"Fast and Accurate Transferability Measurement by Evaluating Intra-class\n  Feature Variance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Given a set of pre-trained models, how can we quickly and accurately find the\nmost useful pre-trained model for a downstream task? Transferability\nmeasurement is to quantify how transferable is a pre-trained model learned on a\nsource task to a target task. It is used for quickly ranking pre-trained models\nfor a given task and thus becomes a crucial step for transfer learning.\nExisting methods measure transferability as the discrimination ability of a\nsource model for a target data before transfer learning, which cannot\naccurately estimate the fine-tuning performance. Some of them restrict the\napplication of transferability measurement in selecting the best supervised\npre-trained models that have classifiers. It is important to have a general\nmethod for measuring transferability that can be applied in a variety of\nsituations, such as selecting the best self-supervised pre-trained models that\ndo not have classifiers, and selecting the best transferring layer for a target\ntask. In this work, we propose TMI (TRANSFERABILITY MEASUREMENT WITH\nINTRA-CLASS FEATURE VARIANCE), a fast and accurate algorithm to measure\ntransferability. We view transferability as the generalization of a pre-trained\nmodel on a target task by measuring intra-class feature variance. Intra-class\nvariance evaluates the adaptability of the model to a new task, which measures\nhow transferable the model is. Compared to previous studies that estimate how\ndiscriminative the models are, intra-class variance is more accurate than those\nas it does not require an optimal feature extractor and classifier. Extensive\nexperiments on real-world datasets show that TMI outperforms competitors for\nselecting the top-5 best models, and exhibits consistently better correlation\nin 13 out of 17 cases.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:50:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xu","Huiwen",""],["Kang","U",""]]}
{"id":"2308.05987","submitter":"Zhaohui Yin","authors":"Zhaohui Yin, Jingguang Tian, Xinhui Hu, Xinkang Xu","title":"Advancing the study of Large-Scale Learning in Overlapped Speech\n  Detection","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":"  Overlapped Speech Detection (OSD) is an important part of speech applications\ninvolving analysis of multi-party conversations. However, most of the existing\nOSD systems are trained and evaluated on specific dataset, which limits the\napplication scenarios of these systems. To solve this problem, we conduct a\nstudy of large-scale learning (LSL) in OSD tasks and propose a general 16K\nsingle-channel OSD system. In our study, 522 hours of labeled audio in\ndifferent languages and styles are collected and used as the large-scale\ndataset. Rigorous comparative experiments are designed and used to evaluate the\neffectiveness of LSL in OSD tasks and select the appropriate model of general\nOSD system. The results show that LSL can significantly improve the performance\nand robustness of OSD models, and the OSD model based on Conformer (CF-OSD)\nwith LSL is currently the best 16K single-channel OSD system. Moreover, the\nCF-OSD with LSL establishes a state-of-the-art performance with an F1-score of\n81.6% and 53.8% on Alimeeting test set and DIHARD II evaluation set,\nrespectively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:50:41 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 09:28:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yin","Zhaohui",""],["Tian","Jingguang",""],["Hu","Xinhui",""],["Xu","Xinkang",""]]}
{"id":"2308.05988","submitter":"Darren Tsai","authors":"Darren Tsai, Julie Stephany Berrio, Mao Shan, Eduardo Nebot and\n  Stewart Worrall","title":"MS3D++: Ensemble of Experts for Multi-Source Unsupervised Domain\n  Adaption in 3D Object Detection","comments":"Code is available at https://github.com/darrenjkt/MS3D","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deploying 3D detectors in unfamiliar domains has been demonstrated to result\nin a drastic drop of up to 70-90% in detection rate due to variations in lidar,\ngeographical region, or weather conditions from their original training\ndataset. This domain gap leads to missing detections for densely observed\nobjects, misaligned confidence scores, and increased high-confidence false\npositives, rendering the detector highly unreliable. To address this, we\nintroduce MS3D++, a self-training framework for multi-source unsupervised\ndomain adaptation in 3D object detection. MS3D++ provides a straightforward\napproach to domain adaptation by generating high-quality pseudo-labels,\nenabling the adaptation of 3D detectors to a diverse range of lidar types,\nregardless of their density. Our approach effectively fuses predictions of an\nensemble of multi-frame pre-trained detectors from different source domains to\nimprove domain generalization. We subsequently refine the predictions\ntemporally to ensure temporal consistency in box localization and object\nclassification. Furthermore, we present an in-depth study into the performance\nand idiosyncrasies of various 3D detector components in a cross-domain context,\nproviding valuable insights for improved cross-domain detector ensembling.\nExperimental results on Waymo, nuScenes and Lyft demonstrate that detectors\ntrained with MS3D++ pseudo-labels achieve state-of-the-art performance,\ncomparable to training with human-annotated labels in Bird's Eye View (BEV)\nevaluation for both low and high density lidar.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:56:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tsai","Darren",""],["Berrio","Julie Stephany",""],["Shan","Mao",""],["Nebot","Eduardo",""],["Worrall","Stewart",""]]}
{"id":"2308.05989","submitter":"Dandan Zhang","authors":"Dandan Zhang, Zhenzhao Tao, Mao Yuan, Jumei Yao, Pei Wang, Qijun Zhi,\n  Weiwei Zhu, Xun Shi, Michael Kramer, Di Li, Lei Zhang, and Guangxing Li","title":"Galactic Interstellar Scintillation Observed from Four Globular Cluster\n  Pulsars by FAST","comments":"9 pages, 3 figures, matches the published version","journal-ref":"SCIENCE CHINA Physics, Mechanics & Astronomy , Volume 66, Issue 9:\n  299511 (2023)","doi":"10.1007/s11433-023-2138-5","report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report detections of scintillation arcs for pulsars in globular clusters\nM5, M13 and M15 for the first time using the Five-hundred-meter Aperture\nSpherical radio Telescope (FAST). From observations of these arcs at multiple\nepochs, we infer that screen-like scattering medium exists at distances\n$4.1_{-0.3}^{+0.2}$ kpc, $6.7_{-0.2}^{+0.2}$ kpc and $1.3_{-1.0}^{+0.7}$ kpc\nfrom Earth in the directions of M5, M13 and M15, respectively. This means M5's\nand M13's scattering screens are located at $3.0_{-0.2}^{+0.1}$ kpc and\n$4.4_{-0.1}^{+0.1}$ kpc above the galactic plane, whereas, M15's is at\n$0.6_{-0.5}^{+0.3}$ kpc below the plane. We estimate the scintillation\ntimescale and decorrelation bandwidth for each pulsar at each epoch using the\none-dimensional auto-correlation in frequency and time of the dynamic spectra.\nWe found that the boundary of the Local Bubble may have caused the scattering\nof M15, and detected the most distant off-plane scattering screens to date\nthrough pulsar scintillation, which provides evidence for understanding the\nmedium circulation in the Milky Way.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:56:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Dandan",""],["Tao","Zhenzhao",""],["Yuan","Mao",""],["Yao","Jumei",""],["Wang","Pei",""],["Zhi","Qijun",""],["Zhu","Weiwei",""],["Shi","Xun",""],["Kramer","Michael",""],["Li","Di",""],["Zhang","Lei",""],["Li","Guangxing",""]]}
{"id":"2308.05990","submitter":"Yongrong Qiu","authors":"Nan Wu, Isabel Valera, Alexander Ecker, Thomas Euler, Yongrong Qiu","title":"Bayesian Neural System Identification with Response Variability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Neural population responses in sensory systems are driven by external\nphysical stimuli. This stimulus-response relationship is typically\ncharacterized by receptive fields with the assumption of identical and\nindependent Gaussian or Poisson distributions through the loss function.\nHowever, responses to repeated presentations of the same stimulus vary,\ncomplicating the understanding of neural coding in a stochastic manner.\nTherefore, to appreciate neural information processing, it is critical to\nidentify stimulus-response function in the presence of trial-to-trial\nvariability. Here, we present a Bayesian system identification approach to\npredict neural responses to visual stimuli with uncertainties, and explore\nwhether incorporating response fluctuations by using synaptic variability can\nbe beneficial for identifying neural response properties. To this end, we build\na neural network model using variational inference to estimate the distribution\nof each model weight. Tests with different neural datasets demonstrate that\nthis method can achieve higher or comparable performance on neural prediction\ncompared to Monte Carlo dropout methods and traditional models using point\nestimates of the model parameters. At the same time, our variational method\nallows to estimate the uncertainty of neural transfer function, which we have\nfound to be negatively correlated with the predictive performance. Finally, our\nmodel enables a highly challenging task, i.e., the prediction of noise\ncorrelations for unseen stimuli, albeit to a moderate degree. Together, we\nprovide a probabilistic approach as a starting point for simultaneously\nestimating neuronal receptive fields and analyzing trial-to-trial\nco-variability for a population of neurons, which may help to uncover the\nunderpinning of stochastic biological computation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:57:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wu","Nan",""],["Valera","Isabel",""],["Ecker","Alexander",""],["Euler","Thomas",""],["Qiu","Yongrong",""]]}
{"id":"2308.05991","submitter":"Yufei Yin","authors":"Yufei Yin, Jiajun Deng, Wengang Zhou, Li Li, Houqiang Li","title":"Cyclic-Bootstrap Labeling for Weakly Supervised Object Detection","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":"  Recent progress in weakly supervised object detection is featured by a\ncombination of multiple instance detection networks (MIDN) and ordinal online\nrefinement. However, with only image-level annotation, MIDN inevitably assigns\nhigh scores to some unexpected region proposals when generating pseudo labels.\nThese inaccurate high-scoring region proposals will mislead the training of\nsubsequent refinement modules and thus hamper the detection performance. In\nthis work, we explore how to ameliorate the quality of pseudo-labeling in MIDN.\nFormally, we devise Cyclic-Bootstrap Labeling (CBL), a novel weakly supervised\nobject detection pipeline, which optimizes MIDN with rank information from a\nreliable teacher network. Specifically, we obtain this teacher network by\nintroducing a weighted exponential moving average strategy to take advantage of\nvarious refinement modules. A novel class-specific ranking distillation\nalgorithm is proposed to leverage the output of weighted ensembled teacher\nnetwork for distilling MIDN with rank information. As a result, MIDN is guided\nto assign higher scores to accurate proposals among their neighboring ones,\nthus benefiting the subsequent pseudo labeling. Extensive experiments on the\nprevalent PASCAL VOC 2007 \\& 2012 and COCO datasets demonstrate the superior\nperformance of our CBL framework. Code will be available at\nhttps://github.com/Yinyf0804/WSOD-CBL/.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:57:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yin","Yufei",""],["Deng","Jiajun",""],["Zhou","Wengang",""],["Li","Li",""],["Li","Houqiang",""]]}
{"id":"2308.05992","submitter":"Inhyuk Oh","authors":"In Hyuk Oh, Ju Won Seo, Jin Sung Kim, and Chung Choo Chung","title":"Reachable Set-based Path Planning for Automated Vertical Parking System","comments":"8 pages, 10 figures, conference. This is the Accepted Manuscript\n  version of an article accepted for publication in [IEEE International\n  Conference on Intelligent Transportation Systems ITSC 2023]. IOP Publishing\n  Ltd is not responsible for any errors or omissions in this version of the\n  manuscript or any version derived from it. No information about DOI has been\n  posted yet","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 proposes a local path planning method with a reachable set for\nAutomated vertical Parking Systems (APS). First, given a parking lot layout\nwith a goal position, we define an intermediate pose for the APS to accomplish\nreverse parking with a single maneuver, i.e., without changing the gear shift.\nThen, we introduce a reachable set which is a set of points consisting of the\ngrid points of all possible intermediate poses. Once the APS approaches the\ngoal position, it must select an intermediate pose in the reachable set. A\nminimization problem was formulated and solved to choose the intermediate pose.\nWe performed various scenarios with different parking lot conditions. We used\nthe Hybrid-A* algorithm for the global path planning to move the vehicle from\nthe starting pose to the intermediate pose and utilized clothoid-based local\npath planning to move from the intermediate pose to the goal pose.\nAdditionally, we designed a controller to follow the generated path and\nvalidated its tracking performance. It was confirmed that the tracking error in\nthe mean root square for the lateral position was bounded within 0.06m and for\norientation within 0.01rad.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:59:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Oh","In Hyuk",""],["Seo","Ju Won",""],["Kim","Jin Sung",""],["Chung","Chung Choo",""]]}
{"id":"2308.05993","submitter":"Mengjie Zhou","authors":"Mengjie Zhou, Liu Liu, Yiran Zhong","title":"Image-based Geolocalization by Ground-to-2.5D Map Matching","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":"  We study the image-based geolocalization problem that aims to locate\nground-view query images on cartographic maps. Previous methods often utilize\ncross-view localization techniques to match ground-view query images with 2D\nmaps. However, the performance of these methods is frequently unsatisfactory\ndue to the significant cross-view appearance differences. In this paper, we\nextend cross-view matching to 2.5D spaces, where the heights of the structures\n- such as trees, buildings, and other objects - can provide additional\ninformation to guide the cross-view matching. We present a new approach to\nlearning representative embeddings from multi-model data. Specifically, we\nfirst align 2D maps to ground-view panoramic images with polar transform to\nreduce the gap between panoramic images and maps. Then we leverage global\nfusion to fuse the multi-modal features from 2D and 2.5D maps to increase the\ndistinctiveness of location embeddings. We construct the first large-scale\nground-to-2.5D map geolocalization dataset to validate our method and\nfacilitate the research. We test our learned embeddings on two popular\nlocalization approaches, i.e., single-image based localization, and route based\nlocalization. Extensive experiments demonstrate that our proposed method\nachieves significantly higher localization accuracy and faster convergence than\nprevious 2D map-based approaches.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:00:30 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhou","Mengjie",""],["Liu","Liu",""],["Zhong","Yiran",""]]}
{"id":"2308.05994","submitter":"Byeong-Cheol Lee","authors":"Byeong-Cheol Lee, Gwanghui Jeong, Jae-Rim Koo, Beomdu Lim, Myeong-Gu\n  Park, Tae-Yang Bang, Yeon-Ho Choi, Hyeong-Ill Oh, and Inwoo Han","title":"A Search for exoplanets around northern circumpolar stars VIII. filter\n  out a planet cycle from the multi-period radial velocity variations in M\n  giant HD 3638","comments":"5 pages, 2 figures, Accepted for publication in JKAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper is written as a follow-up observations to reinterpret the radial\nvelocity (RV) of HD 36384, where the existence of planetary systems is known to\nbe ambiguous. In giants, it is, in general, difficult to distinguish the\nsignals of planetary companions from those of stellar activities. Thus, known\nexoplanetary giant hosts are relatively rare. We, for many years, have obtained\nRV data in evolved stars using the high-resolution, fiber-fed Bohyunsan\nObservatory Echelle Spectrograph (BOES) at the Bohyunsan Optical Astronomy\nObservatory (BOAO). Here, we report the results of RV variations in the M giant\nHD 36384. We have found two significant periods of 586d and 490d. Considering\nthe orbital stability, it is impossible to have two planets at so close orbits.\nTo determine the nature of the RV variability variations, we analyze the\nHIPPARCOS photometric data, some indicators of stellar activities, and line\nprofiles. A significant period of 580d was revealed in the HIPPARCOS\nphotometry. H{\\alpha} EW variations also show a meaningful period of 582d.\nThus, the period of 586d may be closely related to the rotational modulations\nand/or stellar pulsations. On the other hand, the other significant period of\n490d is interpreted as the result of the orbiting companion. Our orbital fit\nsuggests that the companion was a planetary mass of 6.6 MJ and is located at\n1.3 AU from the host.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:01:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lee","Byeong-Cheol",""],["Jeong","Gwanghui",""],["Koo","Jae-Rim",""],["Lim","Beomdu",""],["Park","Myeong-Gu",""],["Bang","Tae-Yang",""],["Choi","Yeon-Ho",""],["Oh","Hyeong-Ill",""],["Han","Inwoo",""]]}
{"id":"2308.05995","submitter":"Zhang Fan","authors":"Fan Zhang, Naye Ji, Fuxing Gao, Siyuan Zhao, Zhaohan Wang, Shunman Li","title":"Audio is all in one: speech-driven gesture synthetics using WavLM\n  pre-trained model","comments":"10 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.GR cs.MM eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The generation of co-speech gestures for digital humans is an emerging area\nin the field of virtual human creation. Prior research has made progress by\nusing acoustic and semantic information as input and adopting classify method\nto identify the person's ID and emotion for driving co-speech gesture\ngeneration. However, this endeavour still faces significant challenges. These\nchallenges go beyond the intricate interplay between co-speech gestures, speech\nacoustic, and semantics; they also encompass the complexities associated with\npersonality, emotion, and other obscure but important factors. This paper\nintroduces \"diffmotion-v2,\" a speech-conditional diffusion-based and\nnon-autoregressive transformer-based generative model with WavLM pre-trained\nmodel. It can produce individual and stylized full-body co-speech gestures only\nusing raw speech audio, eliminating the need for complex multimodal processing\nand manually annotated. Firstly, considering that speech audio not only\ncontains acoustic and semantic features but also conveys personality traits,\nemotions, and more subtle information related to accompanying gestures, we\npioneer the adaptation of WavLM, a large-scale pre-trained model, to extract\nlow-level and high-level audio information. Secondly, we introduce an adaptive\nlayer norm architecture in the transformer-based layer to learn the\nrelationship between speech information and accompanying gestures. Extensive\nsubjective evaluation experiments are conducted on the Trinity, ZEGGS, and BEAT\ndatasets to confirm the WavLM and the model's ability to synthesize natural\nco-speech gestures with various styles.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:03:28 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 03:27:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Fan",""],["Ji","Naye",""],["Gao","Fuxing",""],["Zhao","Siyuan",""],["Wang","Zhaohan",""],["Li","Shunman",""]]}
{"id":"2308.05996","submitter":"Qi Liu","authors":"Qi Liu, Zhilong Zhou, Gangwei Jiang, Tiezheng Ge, Defu Lian","title":"Deep Task-specific Bottom Representation Network for Multi-Task\n  Recommendation","comments":"CIKM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural-based multi-task learning (MTL) has gained significant improvement,\nand it has been successfully applied to recommendation system (RS). Recent deep\nMTL methods for RS (e.g. MMoE, PLE) focus on designing soft gating-based\nparameter-sharing networks that implicitly learn a generalized representation\nfor each task. However, MTL methods may suffer from performance degeneration\nwhen dealing with conflicting tasks, as negative transfer effects can occur on\nthe task-shared bottom representation. This can result in a reduced capacity\nfor MTL methods to capture task-specific characteristics, ultimately impeding\ntheir effectiveness and hindering the ability to generalize well on all tasks.\nIn this paper, we focus on the bottom representation learning of MTL in RS and\npropose the Deep Task-specific Bottom Representation Network (DTRN) to\nalleviate the negative transfer problem. DTRN obtains task-specific bottom\nrepresentation explicitly by making each task have its own representation\nlearning network in the bottom representation modeling stage. Specifically, it\nextracts the user's interests from multiple types of behavior sequences for\neach task through the parameter-efficient hypernetwork. To further obtain the\ndedicated representation for each task, DTRN refines the representation of each\nfeature by employing a SENet-like network for each task. The two proposed\nmodules can achieve the purpose of getting task-specific bottom representation\nto relieve tasks' mutual interference. Moreover, the proposed DTRN is flexible\nto combine with existing MTL methods. Experiments on one public dataset and one\nindustrial dataset demonstrate the effectiveness of the proposed DTRN.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:04:43 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 01:37:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Qi",""],["Zhou","Zhilong",""],["Jiang","Gangwei",""],["Ge","Tiezheng",""],["Lian","Defu",""]]}
{"id":"2308.05997","submitter":"Xuhan Guo","authors":"Youlv Chen, Xuhan Guo, Xulin Zhang, and Yikai Su","title":"High-dimensional broadband non-Abelian holonomy in silicon nitride\n  photonics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-Abelian geometry phase has attracted significant attention for the robust\nholonomic unitary behavior exhibited, which arises from the degenerate subspace\nevolving along a trajectory in Hilbert space. It has been regarded as a\npromising approach for implementing topologically protected quantum computation\nand logic manipulation. However, due to the challenges associated with\nhigh-dimensional parameters manipulation, this matrix-valued geometry phase has\nnot been realized on silicon integrated photonic platform, which is CMOS\ncompatible and regarded as the most promising flatform for next-generation\nfunctional devices. Here, we demonstrate the first non-Abelian holonomic\nhigh-dimensional unitary matrices on multilayer silicon nitride integrated\nplatform. By leveraging the advantage of integrated platform and geometry\nphase, ultracompact footprint, highest order (up to six) and broadband\noperation (larger than 100nm) non-Abelian holonomy unitary matrices are\nexperimentally realized. Our work paves the way for versatile non-Abelian\noptical computing devices in integrated photonics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:04:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Youlv",""],["Guo","Xuhan",""],["Zhang","Xulin",""],["Su","Yikai",""]]}
{"id":"2308.05998","submitter":"Frederik Br\\\"uning","authors":"Frederik Br\\\"uning, Anne Driemel","title":"Simplified and Improved Bounds on the VC-Dimension for Elastic Distance\n  Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study range spaces, where the ground set consists of polygonal curves and\nthe ranges are balls defined by an elastic distance measure. Such range spaces\nappear in various applications like classification, range counting, density\nestimation and clustering when the instances are trajectories or time series.\nThe Vapnik-Chervonenkis dimension (VC-dimension) plays an important role when\ndesigning algorithms for these range spaces. We show for the Fr\\'echet distance\nand the Hausdorff distance that the VC-dimension is upper-bounded by $O(dk\n\\log(km))$, where $k$ is the complexity of the center of a ball, $m$ is the\ncomplexity of the curve in the ground set, and $d$ is the ambient dimension.\nFor $d \\geq 4$ this bound is tight in each of the parameters $d,k$ and $m$\nseparately. Our approach rests on an argument that was first used by Goldberg\nand Jerrum and later improved by Anthony and Bartlett. The idea is to interpret\nthe ranges as combinations of sign values of polynomials and to bound the\ngrowth function via the number of connected components in an arrangement of\nzero sets of polynomials.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:06:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Br\u00fcning","Frederik",""],["Driemel","Anne",""]]}
{"id":"2308.05999","submitter":"Yatao Li","authors":"Yatao Li, Wanling Gao, Lei Wang, Lixin Sun, Zun Wang, Jianfeng Zhan","title":"Does AI for science need another ImageNet Or totally different\n  benchmarks? A case study of machine learning force fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  AI for science (AI4S) is an emerging research field that aims to enhance the\naccuracy and speed of scientific computing tasks using machine learning\nmethods. Traditional AI benchmarking methods struggle to adapt to the unique\nchallenges posed by AI4S because they assume data in training, testing, and\nfuture real-world queries are independent and identically distributed, while\nAI4S workloads anticipate out-of-distribution problem instances. This paper\ninvestigates the need for a novel approach to effectively benchmark AI for\nscience, using the machine learning force field (MLFF) as a case study. MLFF is\na method to accelerate molecular dynamics (MD) simulation with low\ncomputational cost and high accuracy. We identify various missed opportunities\nin scientifically meaningful benchmarking and propose solutions to evaluate\nMLFF models, specifically in the aspects of sample efficiency, time domain\nsensitivity, and cross-dataset generalization capabilities. By setting up the\nproblem instantiation similar to the actual scientific applications, more\nmeaningful performance metrics from the benchmark can be achieved. This suite\nof metrics has demonstrated a better ability to assess a model's performance in\nreal-world scientific applications, in contrast to traditional AI benchmarking\nmethodologies. This work is a component of the SAIBench project, an AI4S\nbenchmarking suite. The project homepage is\nhttps://www.computercouncil.org/SAIBench.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:06:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Yatao",""],["Gao","Wanling",""],["Wang","Lei",""],["Sun","Lixin",""],["Wang","Zun",""],["Zhan","Jianfeng",""]]}
{"id":"2308.06000","submitter":"Ivan Filippov","authors":"Ivan Filippov, Alexandr Anikanov, Aleksandr Rykov, Alexander\n  Mumlyakov, Maksim Shibalov, Igor Trofimov, Nikolay Porokhov, Yuriy Anufriev\n  and Michael Tarkhov","title":"Superconducting TSV contact for cryoelectronic devices","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This work focuses on the fabrication of niobium through silicon vias (TSV)\nsuperconductors interconnects. The effect of supercycle of sequential oxidation\nand chemical etching process on the through-etch wall quality was investigated.\nIt was experimentally shown that the use of supercycle in the fabrication\nprocess leads to significant improvement of the TSV wall quality and removal of\nthe defect type - scallops. After 12 times repetitions of supercycles a\ndissipative bonding of superconducting strips on the front and back side of the\nsample is observed. The critical current density of such coupling is 5x104\nA/cm2. The critical ratio of substrate thickness to hole diameter at which\nelectrical coupling is formed is 3 : 1.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:07:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Filippov","Ivan",""],["Anikanov","Alexandr",""],["Rykov","Aleksandr",""],["Mumlyakov","Alexander",""],["Shibalov","Maksim",""],["Trofimov","Igor",""],["Porokhov","Nikolay",""],["Anufriev","Yuriy",""],["Tarkhov","Michael",""]]}
{"id":"2308.06001","submitter":"Andrew Wynn","authors":"Joshua Binns and Andrew Wynn","title":"Global stability of Oldroyd-B fluids in plane Couette flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove conditions for global nonlinear stability of Oldroyd-B viscoelatic\nfluid flows in the Couette shear flow geometry. Global stability is inferred by\nanalysing a new functional, called a perturbation entropy, to quantify the\nmagnitude of the polymer perturbations from their steady-state values. The\nconditions for global stability extend, in a physically natural manner,\nclassical results on global stability of Newtonian Couette flow.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:12:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Binns","Joshua",""],["Wynn","Andrew",""]]}
{"id":"2308.06002","submitter":"Giulia Cinquegrana","authors":"Giulia C. Cinquegrana, Meridith Joyce, Amanda I. Karakas","title":"Bridging the Gap between Intermediate and Massive Stars II:\n  $M_\\text{mas}$ for the most metal-rich stars and implications for Fe CCSNe\n  rates","comments":"Accepted for publication in MNRAS (August 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The minimum initial mass required for a star to explode as an Fe core\ncollapse supernova, typically denoted $M_\\text{mas}$, is an important quantity\nin stellar evolution because it defines the border between intermediate mass\nand massive stellar evolutionary paths. The precise value of $M_\\text{mas}$\ncarries implications for models of galactic chemical evolution and the\ncalculation of star formation rates. Despite the fact that stars with super\nsolar metallicities are commonplace within spiral and some giant elliptical\ngalaxies, there are currently no studies of this mass threshold in super\nmetal-rich models with $Z>0.05$. Here, we study the minimum mass necessary for\na star to undergo an Fe core collapse supernova when its initial metal content\nfalls in the range $2.5\\times 10^{-3} \\leq Z \\leq 0.10$. Although an increase\nin initial $Z$ corresponds to an increase in the Fe ignition threshold for $Z\n\\approx 1\\times 10^{-3}$ to $Z\\approx0.04$, we find that there is a steady\nreversal in trend that occurs for $Z > 0.05$. Our super metal-rich models thus\nundergo Fe core collapse at lower initial masses than those required at solar\nmetallicity. Our results indicate that metallicity--dependent curves extending\nto $Z=0.10$ for the minimum Fe ignition mass should be utilised in galactic\nchemical evolution simulations to accurately model supernovae rates as a\nfunction of metallicity, particularly for simulations of metal-rich spiral and\nelliptical galaxies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:18:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cinquegrana","Giulia C.",""],["Joyce","Meridith",""],["Karakas","Amanda I.",""]]}
{"id":"2308.06003","submitter":"Benedicte Sverdrup Ofstad","authors":"Benedicte Sverdrup Ofstad, Meilani Wibowo-Teale, H{\\aa}kon Emil\n  Kristiansen, Einar Aurbakken, Marios Petros Kitsaras, {\\O}yvind Sigmundson\n  Sch{\\o}yen, Eirill Hauge, Simen Kvaal, Stella Stopkowicz, Andrew M.\n  Wibowo-Teale, Thomas Bondo Pedersen","title":"Magnetic Optical Rotation from Real-Time Simulations in Finite Magnetic\n  Fields","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 numerical approach to magnetic optical rotation based on\nreal-time time-dependent electronic-structure theory. Not relying on\nperturbation expansions in the magnetic-field strength, the formulation allows\nus to test the range of validity of the linear relation between the rotation\nangle per unit path length and the magnetic-field strength that was established\nempirically by Verdet 160 years ago. Results obtained from time-dependent\ncoupled-cluster and time-dependent current density-functional theory are\npresented for the closed-shell molecules H2, HF, and CO in magnetic fields up\nto 55 kT at standard temperature and pressure conditions. We find that Verdet's\nlinearity remains valid up to roughly 10-20 kT, above which significant\ndeviations from linearity are observed. Among the three current\ndensity-functional approximations tested in this work, the current-dependent\nTao-Perdew-Staroverov-Scuseria hybrid functional performs the best in\ncomparison with time-dependent coupled-cluster singles and doubles results for\nthe magnetic optical rotation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:19:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ofstad","Benedicte Sverdrup",""],["Wibowo-Teale","Meilani",""],["Kristiansen","H\u00e5kon Emil",""],["Aurbakken","Einar",""],["Kitsaras","Marios Petros",""],["Sch\u00f8yen","\u00d8yvind Sigmundson",""],["Hauge","Eirill",""],["Kvaal","Simen",""],["Stopkowicz","Stella",""],["Wibowo-Teale","Andrew M.",""],["Pedersen","Thomas Bondo",""]]}
{"id":"2308.06004","submitter":"Adem Ersin Ureyen","authors":"A. Ersin Ureyen","title":"Harmonic Bloch Space on the Real Hyperbolic Ball","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the Bloch and the little Bloch spaces of harmonic functions on the\nreal hyperbolic ball. We show that the Bergman projections from\n$L^\\infty(\\mathbb B)$ to $\\mathcal B$, and from $C_0(\\mathbb B)$ to $\\mathcal\nB_0$ are onto. We verify that the dual space of the hyperbolic harmonic Bergman\nspace $\\mathcal B^1_\\alpha$ is $\\mathcal B$ and its predual is $\\mathcal B_0$.\nFinally, we obtain an atomic decomposition of Bloch functions as a series of\nBergman reproducing kernels.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:21:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ureyen","A. Ersin",""]]}
{"id":"2308.06005","submitter":"Wenxin Xiao","authors":"Wenxin Xiao, Hao He, Weiwei Xu, Yuxia Zhang, and Minghui Zhou","title":"How Early Participation Determines Long-Term Sustained Activity in\n  GitHub Projects?","comments":"The 31st ACM Joint European Software Engineering Conference and\n  Symposium on the Foundations of Software Engineering (ESEC/FSE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although the open source model bears many advantages in software development,\nopen source projects are always hard to sustain. Previous research on open\nsource sustainability mainly focuses on projects that have already reached a\ncertain level of maturity (e.g., with communities, releases, and downstream\nprojects). However, limited attention is paid to the development of\n(sustainable) open source projects in their infancy, and we believe an\nunderstanding of early sustainability determinants is crucial for project\ninitiators, incubators, newcomers, and users.\n  In this paper, we aim to explore the relationship between early participation\nfactors and long-term project sustainability. We leverage a novel methodology\nthat measures the early participation of 290,255 GitHub projects during the\nfirst three months with reference to the Blumberg model, trains an XGBoost\nmodel to predict project's two-year sustained activity, and interprets the\ntrained model using LIME. We quantitatively show that early participants have a\npositive effect on project's future sustained activity if they have prior\nexperience in OSS project incubation and demonstrate concentrated focus and\nsteady commitment. Participation from non-code contributors and detailed\ncontribution documentation also promote project's sustained activity. Compared\nwith individual projects, building a community that consists of more\nexperienced core developers and more active peripheral developers is important\nfor organizational projects. This study provides unique insights into the\nincubation and recognition of sustainable open source projects, and our\ninterpretable prediction approach can also offer guidance to open source\nproject initiators and newcomers.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:24:41 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 08:57:27 GMT"},{"version":"v3","created":"Sat, 26 Aug 2023 12:06:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiao","Wenxin",""],["He","Hao",""],["Xu","Weiwei",""],["Zhang","Yuxia",""],["Zhou","Minghui",""]]}
{"id":"2308.06006","submitter":"Imre Kisv\\'ardai","authors":"Imre Kisv\\'ardai, Bernadett D. P\\'al, \\'Akos Kereszturi","title":"Investigating the porosity of Enceladus","comments":"8 pages, 9 figures","journal-ref":null,"doi":"10.1093/mnras/stad2333","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interior of Enceladus, a medium sized icy moon of Saturn hosts\nhydrothermal activity and exhibits tidal heating and related geyser-like\nactivity. There are major disagreements in the existing literature on the\nporosity of the interior, due to the different theoretical assumptions on which\nporosity related calculations were based. We present an application of\nexperimental equations - derived for Earth - for icy planetary objects and\nEnceladus in particular. We chose a set of boundary values for our initial\nparameters from measured porosity values of chondrite samples as references,\nand calculated the porosity related values of Enceladus using various\napproaches. We present a comprehensive investigation of the effects of using\nthese different porosity calculation methods on icy moons. With our most\nrealistic approach we also calculated the same values for Earth and Mars for\ncomparison. Our result for Enceladus is a minimum porosity of about 5\\% at the\ncentre of the body. For the total pore volume we estimated $1.51*10^7 km^3$ for\nEnceladus, $2.11*10^8 km^3$ for Earth and $1.62*10^8 km^3$ for Mars. Using the\nsame method, we estimated the total pore surface area. From this we derived\nthat the pore surface under a given $1 km^2$ area of the surface on Enceladus\nis about $1.37*10^9 km^2$, while for Earth this value is only $5.07*10^7 km^2$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:26:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kisv\u00e1rdai","Imre",""],["P\u00e1l","Bernadett D.",""],["Kereszturi","\u00c1kos",""]]}
{"id":"2308.06007","submitter":"Soumya Prakash Dash","authors":"Soumya P. Dash and Aryan Kaushik","title":"RIS-Assisted 6G Wireless Communications: A Novel Statistical Framework\n  in the Presence of Direct Channel","comments":"5 pages","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":"  A RIS-assisted wireless communication system in the presence of a direct\ncommunication path between the transceiver pair is considered in this paper.\nThe transmitter-RIS and the RIS-receiver channels follow independent Nakagami-m\ndistributions, and the direct channel between the transceiver pair follows a\nRayleigh distribution. Considering this system model, the statistics of the\ncomposite channel for the RIS-assisted communication system are derived in\nterms of obtaining novel expressions for the probability density functions for\nthe magnitude and the phase of the communication channel. The correctness of\nthe analytical framework is verified via Monte Carlo simulations, and the\neffects of the shape parameters of the channels and the number of reflecting\nelements in the RIS on the randomness of the composite channel are studied via\nnumerical results.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:26:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dash","Soumya P.",""],["Kaushik","Aryan",""]]}
{"id":"2308.06008","submitter":"Padraig \\'O Cath\\'ain","authors":"Oliver W. Gnilke, Padraig O Cathain, Oktay Olmez, Guillermo Nunez\n  Ponasso","title":"Invariants of Quadratic Forms and applications in Design Theory","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.HO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of regular incidence structures such as projective planes and\nsymmetric block designs is a well established topic in discrete mathematics.\nWork of Bruck, Ryser and Chowla in the mid-twentieth century applied the\nHasse-Minkowski local-global theory for quadratic forms to derive non-existence\nresults for certain design parameters. Several combinatorialists have provided\nalternative proofs of this result, replacing conceptual arguments with\nalgorithmic ones. In this paper, we show that the methods required are purely\nlinear-algebraic in nature and are no more difficult conceptually than the\ntheory of the Jordan Canonical Form. Computationally, they are rather easier.\nWe conclude with some classical and recent applications to design theory,\nincluding a novel application to the decomposition of incidence matrices of\nsymmetric designs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:27:14 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gnilke","Oliver W.",""],["Cathain","Padraig O",""],["Olmez","Oktay",""],["Ponasso","Guillermo Nunez",""]]}
{"id":"2308.06009","submitter":"Kun Li","authors":"Kun Li, Dan Guo, Meng Wang","title":"ViGT: Proposal-free Video Grounding with Learnable Token in Transformer","comments":"This paper has been accepted by SCIENCE CHINA Information Sciences","journal-ref":null,"doi":"10.1007/s11432-022-3783-3","report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The video grounding (VG) task aims to locate the queried action or event in\nan untrimmed video based on rich linguistic descriptions. Existing\nproposal-free methods are trapped in complex interaction between video and\nquery, overemphasizing cross-modal feature fusion and feature correlation for\nVG. In this paper, we propose a novel boundary regression paradigm that\nperforms regression token learning in a transformer. Particularly, we present a\nsimple but effective proposal-free framework, namely Video Grounding\nTransformer (ViGT), which predicts the temporal boundary using a learnable\nregression token rather than multi-modal or cross-modal features. In ViGT, the\nbenefits of a learnable token are manifested as follows. (1) The token is\nunrelated to the video or the query and avoids data bias toward the original\nvideo and query. (2) The token simultaneously performs global context\naggregation from video and query features. First, we employed a sharing feature\nencoder to project both video and query into a joint feature space before\nperforming cross-modal co-attention (i.e., video-to-query attention and\nquery-to-video attention) to highlight discriminative features in each\nmodality. Furthermore, we concatenated a learnable regression token [REG] with\nthe video and query features as the input of a vision-language transformer.\nFinally, we utilized the token [REG] to predict the target moment and visual\nfeatures to constrain the foreground and background probabilities at each\ntimestamp. The proposed ViGT performed well on three public datasets: ANet\nCaptions, TACoS and YouCookII. Extensive ablation studies and qualitative\nanalysis further validated the interpretability of ViGT.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:30:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Kun",""],["Guo","Dan",""],["Wang","Meng",""]]}
{"id":"2308.06010","submitter":"Guangjun Zhu","authors":"Guangjun Zhu, Yijun Cui, Yulong Yang and Yi yang","title":"The $\\circ$ operation and $*$ operation of fan graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a finite simple graph on the vertex set $V$ and let $I_G$ denote\nits edge ideal in the polynomial ring $S=\\mathbb{K}[x_V]$. In this paper, we\ncompute the depth and the Castelnuovo--Mumford regularity of $S/I_G$ when\n$G=F_{k}^{W}(K_n)$ is a $k$-fan graph, or $G=G_1\\circ G_2$ or $G=G_1* G_2$ is\nthe graph obtained from fan graphs $G_1$, $G_2$ by $\\circ$ operation or $*$\noperation, respectively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:37:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhu","Guangjun",""],["Cui","Yijun",""],["Yang","Yulong",""],["yang","Yi",""]]}
{"id":"2308.06011","submitter":"Anjali Kshirsagar","authors":"Sutapa Chattopadhyay and Anjali Kshirsagar","title":"Design of Sn-doped cadmium chalcogenide based monolayers for\n  valleytronics properties","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":"  Valleytronics, that uses the valley index or valley pseudospin to encode\ninformation, has emerged as an interesting field of research in two-dimensional\n(2D) systems with promising device applications. Spin-orbit coupling (SOC) and\ninversion symmetry breaking leads to spin-splitting of bands near the energy\nextrema (valleys). In order to find a new 2D material useful for valleytronics,\nwe have designed hexagonal planar monolayers of cadmium chalcogenides (CdX, X =\nS, Se, Te) from the (111) surface of bulk CdX zinc blende structure. Band\nstructure study reveals valence band local maxima at symmetry point K and its\ntime reversal conjugate point K$\\textquotesingle$. Application of SOC initiates\nspin-splitting in the valleys that lifts the energy degeneracy and shows strong\nvalley-spin coupling character. We have substituted two Cd atoms in the planar\nmonolayers by Sn atoms which increases the spin-splitting significantly. The\nstructural, dynamic, mechanical and thermal stability of all the monolayers has\nbeen confirmed. Values of formation energies indicate that it may be feasible\nto synthesize the Sn-doped CdSe and CdTe monolayers using bottom-up approach.\nZeeman-type spin-splitting is observed in the valley region and Rashba\nspin-splitting is observed at the $\\Gamma$ point for Sn-doped CdSe and CdTe\nmonolayers. Berry curvature values are more in all the Sn-doped monolayers than\nthe pristine monolayers. These newly designed monolayers are thus found to be\nsuitable for valleytronics applications. Sn-doped monolayers show band\ninversion deep in the valence and conduction bands between Sn~$s$ and $p$ and\nX~$p$ states but lack topological properties.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:39:36 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chattopadhyay","Sutapa",""],["Kshirsagar","Anjali",""]]}
{"id":"2308.06012","submitter":"Wei Yang","authors":"Wei Yang","title":"A tutorial overview on the angular scattering models of\n  Electron-Neutral, Ion-Neutral, Neutral-Neutral, and Coulomb Collisions in\n  Monte Carlo collision modeling on low temperature plasma","comments":"55 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past decade, massive modeling practices on low temperature plasma\n(LTP) reveal that input data such as microscopic scattering cross sections are\ncrucial to output macroscopic phenomena. In Monte Carlo collision (MCC)\nmodeling on LTP, angular scattering model is a non-trivial topic in both\nnatural and laboratory plasma. Conforming to the pedagogical purpose of this\noverview, the classical and quantum theory of binary scattering including the\ncommonly used Born-Bethe approximation is first introduced. State-of-the-art\nangular scattering models are derived based on the above theories for\nelectron-neutral, ion-neutral, neutral-neutral, and Coulomb collisions. The\ntutorial is not aiming to provide accurate cross section data by modern\napproaches in quantum theory, but to introduce analytical angular scattering\nmodels from classical, semi-empirical, and first-order perturbation theory. The\nreviewed models are expected to be readily incorporated into the MCC codes, in\nwhich scattering angle is randomly sampled through analytical inversion instead\nof numerical accept-reject method. Those simplified approaches are very\nattractive, and demonstrate in many cases the ability to achieve a striking\nagreement with experiments. Energy partition models on electron-neutral\nionization are also discussed with insight from the binary encounter Bethe\ntheory. This overview is written in a tutorial style, in order to serve as a\nguide for novice in this field, and at the same time as a comprehensive\nreference for practitioners in MCC modeling on plasma.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:40:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yang","Wei",""]]}
{"id":"2308.06013","submitter":"Ali Maatouk","authors":"Ali Maatouk, Nicola Piovesan, Fadhel Ayed, Antonio De Domenico,\n  Merouane Debbah","title":"Large Language Models for Telecom: Forthcoming Impact on the Industry","comments":null,"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":"  Large Language Models (LLMs) have emerged as a transformative force,\nrevolutionizing numerous fields well beyond the conventional domain of Natural\nLanguage Processing (NLP) and garnering unprecedented attention. As LLM\ntechnology continues to progress, the telecom industry is facing the prospect\nof its potential impact on its landscape. To elucidate these implications, we\ndelve into the inner workings of LLMs, providing insights into their current\ncapabilities and limitations. We also examine the use cases that can be readily\nimplemented in the telecom industry, streamlining numerous tasks that currently\nhinder operational efficiency and demand significant manpower and engineering\nexpertise. Furthermore, we uncover essential research directions that deal with\nthe distinctive challenges of utilizing the LLMs within the telecom domain.\nAddressing these challenges represents a significant stride towards fully\nharnessing the potential of LLMs and unlocking their capabilities to the\nfullest extent within the telecom domain.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:41:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Maatouk","Ali",""],["Piovesan","Nicola",""],["Ayed","Fadhel",""],["De Domenico","Antonio",""],["Debbah","Merouane",""]]}
{"id":"2308.06014","submitter":"Xingliang Tian","authors":"Shengbing Deng and Xingliang Tian","title":"Classification and non-degeneracy of positive radial solutions for a\n  weighted fourth-order equation and its application","comments":"arXiv admin note: text overlap with arXiv:2205.08937","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper is devoted to radial solutions of the following weighted\nfourth-order equation\n  \\begin{equation*}\n  \\mathrm{div}(|x|^{\\alpha}\\nabla(\\mathrm{div}(|x|^\\alpha\\nabla\nu)))=u^{2^{**}_{\\alpha}-1},\\quad u>0\\quad \\mbox{in}\\quad \\mathbb{R}^N,\n  \\end{equation*} where $N\\geq 2$, $\\frac{4-N}{2}<\\alpha<2$ and\n$2^{**}_{\\alpha}=\\frac{2N}{N-4+2\\alpha}$. It is obvious that the solutions of\nabove equation are invariant under the scaling\n$\\lambda^{\\frac{N-4+2\\alpha}{2}}u(\\lambda x)$ while they are not invariant\nunder translation when $\\alpha\\neq 0$. We characterize all the solutions to the\nrelated linearized problem about radial solutions, and obtain the conclusion of\nthat if $\\alpha$ satisfies $(2-\\alpha)(2N-2+\\alpha)\\neq4k(N-2+k)$ for all\n$k\\in\\mathbb{N}^+$ the radial solution is non-degenerate, otherwise there exist\nnew solutions to the linearized problem that ``replace'' the ones due to the\ntranslations invariance. As applications, firstly we investigate the remainder\nterms of some inequalities related to above equation. Then when $N\\geq 5$ and\n$0<\\alpha<2$, we establish a new type second-order Caffarelli-Kohn-Nirenberg\ninequality\n  \\begin{equation*}\n  \\int_{\\mathbb{R}^N} |\\mathrm{div}(|x|^\\alpha\\nabla u)|^2 \\mathrm{d}x \\geq C\n\\left(\\int_{\\mathbb{R}^N}|u|^{2^{**}_{\\alpha}}\n\\mathrm{d}x\\right)^{\\frac{2}{2^{**}_{\\alpha}}},\\quad\n  \\mbox{for all}\\quad u\\in C^\\infty_0(\\mathbb{R}^N),\n  \\end{equation*}\n  and in this case we consider a prescribed perturbation problem by using\nLyapunov-Schmidt reduction.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:41:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Deng","Shengbing",""],["Tian","Xingliang",""]]}
{"id":"2308.06015","submitter":"Xuannan Liu","authors":"Xuannan Liu, Yaoyao Zhong, Yuhang Zhang, Lixiong Qin, Weihong Deng","title":"Enhancing Generalization of Universal Adversarial Perturbation through\n  Gradient Aggregation","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 are vulnerable to universal adversarial perturbation\n(UAP), an instance-agnostic perturbation capable of fooling the target model\nfor most samples. Compared to instance-specific adversarial examples, UAP is\nmore challenging as it needs to generalize across various samples and models.\nIn this paper, we examine the serious dilemma of UAP generation methods from a\ngeneralization perspective -- the gradient vanishing problem using small-batch\nstochastic gradient optimization and the local optima problem using large-batch\noptimization. To address these problems, we propose a simple and effective\nmethod called Stochastic Gradient Aggregation (SGA), which alleviates the\ngradient vanishing and escapes from poor local optima at the same time.\nSpecifically, SGA employs the small-batch training to perform multiple\niterations of inner pre-search. Then, all the inner gradients are aggregated as\na one-step gradient estimation to enhance the gradient stability and reduce\nquantization errors. Extensive experiments on the standard ImageNet dataset\ndemonstrate that our method significantly enhances the generalization ability\nof UAP and outperforms other state-of-the-art methods. The code is available at\nhttps://github.com/liuxuannan/Stochastic-Gradient-Aggregation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:44:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Xuannan",""],["Zhong","Yaoyao",""],["Zhang","Yuhang",""],["Qin","Lixiong",""],["Deng","Weihong",""]]}
{"id":"2308.06016","submitter":"Guangjun Zhu","authors":"Shiya Duan, Guangjun Zhu, Yijun Cui and Jiaxin Li","title":"Integral closure and normality of edge ideals of some edge-weighted\n  graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G_\\omega$ be an edge-weighted simple graph. In this paper, we give a\ncomplete characterization of the graph $G_\\omega$ whose edge ideal\n$I(G_\\omega)$ is integrally closed. We also show that if $G_\\omega$ is an\nedge-weighted star graph, a path or a cycle, and $I(G_\\omega)$ is integrally\nclosed, then $I(G_\\omega)$ is normal.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:45:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Duan","Shiya",""],["Zhu","Guangjun",""],["Cui","Yijun",""],["Li","Jiaxin",""]]}
{"id":"2308.06017","submitter":"Luv Verma Mr.","authors":"Luv Verma, Ketaki N. Kolhatkar","title":"Optimizing transformer-based machine translation model for single GPU\n  training: a hyperparameter ablation study","comments":"12 pages, 15 figures, 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In machine translation tasks, the relationship between model complexity and\nperformance is often presumed to be linear, driving an increase in the number\nof parameters and consequent demands for computational resources like multiple\nGPUs. To explore this assumption, this study systematically investigates the\neffects of hyperparameters through ablation on a sequence-to-sequence machine\ntranslation pipeline, utilizing a single NVIDIA A100 GPU. Contrary to\nexpectations, our experiments reveal that combinations with the most parameters\nwere not necessarily the most effective. This unexpected insight prompted a\ncareful reduction in parameter sizes, uncovering \"sweet spots\" that enable\ntraining sophisticated models on a single GPU without compromising translation\nquality. The findings demonstrate an intricate relationship between\nhyperparameter selection, model size, and computational resource needs. The\ninsights from this study contribute to the ongoing efforts to make machine\ntranslation more accessible and cost-effective, emphasizing the importance of\nprecise hyperparameter tuning over mere scaling.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:47:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Verma","Luv",""],["Kolhatkar","Ketaki N.",""]]}
{"id":"2308.06018","submitter":"Ngoc Luyen Le","authors":"Ngoc Luyen Le, Marie-H\\'el\\`ene Abel, Philippe Gouspillou","title":"Designing a User Contextual Profile Ontology: A Focus on the Vehicle\n  Sales Domain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the digital age, it is crucial to understand and tailor experiences for\nusers interacting with systems and applications. This requires the creation of\nuser contextual profiles that combine user profiles with contextual\ninformation. However, there is a lack of research on the integration of\ncontextual information with different user profiles. This study aims to address\nthis gap by designing a user contextual profile ontology that considers both\nuser profiles and contextual information on each profile. Specifically, we\npresent a design and development of the user contextual profile ontology with a\nfocus on the vehicle sales domain. Our designed ontology serves as a structural\nfoundation for standardizing the representation of user profiles and contextual\ninformation, enhancing the system's ability to capture user preferences and\ncontextual information of the user accurately. Moreover, we illustrate a case\nstudy using the User Contextual Profile Ontology in generating personalized\nrecommendations for vehicle sales domain.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:48:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Le","Ngoc Luyen",""],["Abel","Marie-H\u00e9l\u00e8ne",""],["Gouspillou","Philippe",""]]}
{"id":"2308.06019","submitter":"Shubham Srivastav","authors":"Shubham Srivastav, T. Moore, M. Nicholl, M. R. Magee, S. J. Smartt, M.\n  D. Fulton, S. A. Sim, J. M. Pollin, L. Galbany, C. Inserra, A. Kozyreva,\n  Takashi J. Moriya, F. P. Callan, X. Sheng, K. W. Smith, J. S. Sommer, J. P.\n  Anderson, M. Deckers, M. Gromadzki, T. E. M\\\"uller-Bravo, G. Pignata, A. Rest\n  and D. R. Young","title":"Unprecedented early flux excess in the hybrid 02es-like type Ia\n  supernova 2022ywc indicates interaction with circumstellar material","comments":"Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present optical photometric and spectroscopic observations of the\n02es-like type Ia supernova (SN) 2022ywc. The transient occurred in the\noutskirts of an elliptical host galaxy and showed a striking double-peaked\nlight curve with an early excess feature detected in the ATLAS orange and cyan\nbands. The early excess is remarkably luminous with an absolute magnitude $\\sim\n-19$, comparable in luminosity to the subsequent radioactively-driven second\npeak. The spectra resemble the hybrid 02es-like SN 2016jhr, that is considered\nto be a helium shell detonation candidate. We investigate different physical\nmechanisms that could power such a prominent early excess and rule out massive\nhelium shell detonation, surface $^{56}$Ni distribution and ejecta-companion\ninteraction. We conclude that SN ejecta interacting with circumstellar material\n(CSM) is the most viable scenario. Semi-analytical modelling with MOSFiT\nindicates that SN ejecta interacting with $\\sim 0.05\\,$M$_{\\odot}$ of CSM at a\ndistance of $\\sim 10^{14}$ cm can explain the extraordinary light curve. A\ndouble-degenerate scenario may explain the origin of the CSM, either by\ntidally-stripped material from the secondary white dwarf, or disk-originated\nmatter launched along polar axes following the disruption and accretion of the\nsecondary white dwarf. A non-spherical CSM configuration could suggest that a\nsmall fraction of 02es-like events viewed along a favourable line of sight may\nbe expected to display a very conspicuous early excess like SN 2022ywc.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:49:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Srivastav","Shubham",""],["Moore","T.",""],["Nicholl","M.",""],["Magee","M. R.",""],["Smartt","S. J.",""],["Fulton","M. D.",""],["Sim","S. A.",""],["Pollin","J. M.",""],["Galbany","L.",""],["Inserra","C.",""],["Kozyreva","A.",""],["Moriya","Takashi J.",""],["Callan","F. P.",""],["Sheng","X.",""],["Smith","K. W.",""],["Sommer","J. S.",""],["Anderson","J. P.",""],["Deckers","M.",""],["Gromadzki","M.",""],["M\u00fcller-Bravo","T. E.",""],["Pignata","G.",""],["Rest","A.",""],["Young","D. R.",""]]}
{"id":"2308.06020","submitter":"Bo Chen","authors":"Qingqing Yu, Bo Chen, Jiaru Wang, Yao Sun","title":"A direct sampling method based on the Green's function for\n  time-dependent inverse scattering problems","comments":"18 pages, 12 figures, 2 tables","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":"  This paper concerns the numerical simulation of time domain inverse acoustic\nscattering problems with a point-like scatterer, multiple point-like scatterers\nor normal size scatterers. Based on the Green's function and the application of\nthe time convolution, direct sampling methods are proposed to reconstruct the\nlocation of the scatterer. The proposed methods involve only integral calculus\nwithout solving any equations and are easy to implement. Numerical experiments\nare provided to show the effectiveness and robustness of the methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:51:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yu","Qingqing",""],["Chen","Bo",""],["Wang","Jiaru",""],["Sun","Yao",""]]}
{"id":"2308.06021","submitter":"Jakob Van Den Eijnden","authors":"J. van den Eijnden, L. Sidoli, M. Diaz Trigo, N. Degenaar, I. El\n  Mellah, F. F\\\"urst, V. Grinberg, P. Kretschmar, S. Mart\\'inez-N\\'u\\~nez, J.\n  C. A. Miller-Jones, K. Postnov, T. D. Russell","title":"The first mm detection of a neutron star high-mass X-ray binary","comments":"Submitted to MNRAS Letters. 6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neutron stars accreting from massive binary companions come in a wide range\nof types. Systems with an OB supergiant donor are often divided between\npersistently and transiently accreting systems, respectively called Supergiant\nX-ray Binaries (SgXBs) and Supergiant Fast X-ray Transients (SFXTs). The origin\nof this dichotomy in accretion behaviour is typically attributed to systematic\ndifferences in the massive stellar wind, the binary orbit, or magnetic field\nconfiguration, but direct observational evidence for these hypotheses remains\nsparse. Here, we present the results of a pilot exploration of a novel approach\nto this long-standing question, turning to the mm band to probe the outer\nregions of the stellar wind beyond the binary orbit. Specifically, we present\n100-GHz NOEMA observations of a SgXB, X1908+075, and a SFXT, IGR J18410-0535.\nWe detect the SFXT as a point source at $63.4 \\pm 9.6$ $\\mu$Jy, while the SgXB\nis not detected. The spectrum of IGR J18410-0535 is constrained to be flat or\ninverted by comparing with quasi-simultaneous $5.5$+$9$ GHz radio observations,\nruling out non-thermal flaring and consistent with thermal wind emission.\nAdditional X-ray measurements further constrain the wind mass loss rate and\nvelocity of the SgXB. We compare our targets with each other and earlier wind\nestimates, and reflect on future opportunities using this novel observational\napproach to characterize stellar winds in X-ray binaries.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:54:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Eijnden","J. van den",""],["Sidoli","L.",""],["Trigo","M. Diaz",""],["Degenaar","N.",""],["Mellah","I. El",""],["F\u00fcrst","F.",""],["Grinberg","V.",""],["Kretschmar","P.",""],["Mart\u00ednez-N\u00fa\u00f1ez","S.",""],["Miller-Jones","J. C. A.",""],["Postnov","K.",""],["Russell","T. D.",""]]}
{"id":"2308.06022","submitter":"Andres Felipe Posada Moreno","authors":"Andr\\'es Felipe Posada-Moreno, Lukas Kreisk\\\"other, Tassilo Glander,\n  Sebastian Trimpe","title":"Scale-Preserving Automatic Concept Extraction (SPACE)","comments":"22 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Convolutional Neural Networks (CNN) have become a common choice for\nindustrial quality control, as well as other critical applications in the\nIndustry 4.0. When these CNNs behave in ways unexpected to human users or\ndevelopers, severe consequences can arise, such as economic losses or an\nincreased risk to human life. Concept extraction techniques can be applied to\nincrease the reliability and transparency of CNNs through generating global\nexplanations for trained neural network models. The decisive features of image\ndatasets in quality control often depend on the feature's scale; for example,\nthe size of a hole or an edge. However, existing concept extraction methods do\nnot correctly represent scale, which leads to problems interpreting these\nmodels as we show herein. To address this issue, we introduce the\nScale-Preserving Automatic Concept Extraction (SPACE) algorithm, as a\nstate-of-the-art alternative concept extraction technique for CNNs, focused on\nindustrial applications. SPACE is specifically designed to overcome the\naforementioned problems by avoiding scale changes throughout the concept\nextraction process. SPACE proposes an approach based on square slices of input\nimages, which are selected and then tiled before being clustered into concepts.\nOur method provides explanations of the models' decision-making process in the\nform of human-understandable concepts. We evaluate SPACE on three image\nclassification datasets in the context of industrial quality control. Through\nexperimental results, we illustrate how SPACE outperforms other methods and\nprovides actionable insights on the decision mechanisms of CNNs. Finally, code\nfor the implementation of SPACE is provided.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:54:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Posada-Moreno","Andr\u00e9s Felipe",""],["Kreisk\u00f6ther","Lukas",""],["Glander","Tassilo",""],["Trimpe","Sebastian",""]]}
{"id":"2308.06023","submitter":"Felix Kaps","authors":"Felix G. Kaps (1 ad 2), Susanne C. Kehr (1) and Lukas M. Eng (1 and 2)\n  ((1) Institute of Applied Physics TUD Dresden University of Technology, (2)\n  W\\\"urzburg-Dresden Cluster of Excellence - EXC 2147)","title":"Polarization sensitivity in scattering-type scanning near-field optical\n  microscopy -- towards nanoellipsometry","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electric field enhancement mediated through sharp tips in scattering-type\nscanning near-field optical microscopy (s-SNOM) enables optical material\nanalysis down to the 10-nm length scale, and even below. Nevertheless, mostly\nthe out-of-plane electric field component is considered here due to the\nlightning rod effect of the elongated s-SNOM tip being orders of magnitude\nstronger as compared to any in-plane field component. Nonetheless, the\nfundamental understanding of resonantly excited near-field coupled systems\nclearly allows us to take profit from all vectorial components, especially also\nfrom the in-plane ones. In this paper, we theoretically and experimentally\nexplore how linear polarization control of both near-field illumination and\ndetection, can constructively be implemented to (non-)resonantly couple to\nselected sample permittivity tensor components, e.g. explicitly also to the\nin-plane directions. When applying the point-dipole model, we show that\nresonantly excited samples respond with a strong near-field signal, to all\nlinear polarization angles. We then experimentally investigate the\npolarization-dependent responses for both non-resonant (Au) and phonon-resonant\n(3C-SiC) sample excitations at a 10.6~$\\mu$m and 10.7~$\\mu$m incident\nwavelength using a tabletop CO$_2$ laser. Varying the illumination polarization\nangle thus allows for quantitatively comparing the scattered near-field\nsignatures for the two wavelengths. Finally, we compare our experimental data\nto simulation results, and thus gain the fundamental understanding of the\npolarization's influence on the near-field interaction. As a result, the\nnear-field components parallel and perpendicular to the sample surface can be\neasily disentangled and quantified through their polarization signatures,\nconnecting them directly to the sample's local permittivity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:01:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kaps","Felix G.","","1 ad 2"],["Kehr","Susanne C.","","1 and 2"],["Eng","Lukas M.","","1 and 2"]]}
{"id":"2308.06024","submitter":"Yang Zhang","authors":"Yang Zhang, Chenyun Xiong, Junjie Liu, Xuhui Ye, Guodong Sun","title":"Spatial-information Guided Adaptive Context-aware Network for Efficient\n  RGB-D Semantic Segmentation","comments":"Accepted by IEEE Sensors Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Efficient RGB-D semantic segmentation has received considerable attention in\nmobile robots, which plays a vital role in analyzing and recognizing\nenvironmental information. According to previous studies, depth information can\nprovide corresponding geometric relationships for objects and scenes, but\nactual depth data usually exist as noise. To avoid unfavorable effects on\nsegmentation accuracy and computation, it is necessary to design an efficient\nframework to leverage cross-modal correlations and complementary cues. In this\npaper, we propose an efficient lightweight encoder-decoder network that reduces\nthe computational parameters and guarantees the robustness of the algorithm.\nWorking with channel and spatial fusion attention modules, our network\neffectively captures multi-level RGB-D features. A globally guided local\naffinity context module is proposed to obtain sufficient high-level context\ninformation. The decoder utilizes a lightweight residual unit that combines\nshort- and long-distance information with a few redundant computations.\nExperimental results on NYUv2, SUN RGB-D, and Cityscapes datasets show that our\nmethod achieves a better trade-off among segmentation accuracy, inference time,\nand parameters than the state-of-the-art methods. The source code will be at\nhttps://github.com/MVME-HBUT/SGACNet\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:02:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Yang",""],["Xiong","Chenyun",""],["Liu","Junjie",""],["Ye","Xuhui",""],["Sun","Guodong",""]]}
{"id":"2308.06025","submitter":"Weiyuan Li","authors":"Weiyuan Li, Bin Dai, Ziyi Zhou, Qi Yao and Baoyuan Wang","title":"Controlling Character Motions without Observable Driving Source","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":"  How to generate diverse, life-like, and unlimited long head/body sequences\nwithout any driving source? We argue that this under-investigated research\nproblem is non-trivial at all, and has unique technical challenges behind it.\nWithout semantic constraints from the driving sources, using the standard\nautoregressive model to generate infinitely long sequences would easily result\nin 1) out-of-distribution (OOD) issue due to the accumulated error, 2)\ninsufficient diversity to produce natural and life-like motion sequences and 3)\nundesired periodic patterns along the time. To tackle the above challenges, we\npropose a systematic framework that marries the benefits of VQ-VAE and a novel\ntoken-level control policy trained with reinforcement learning using carefully\ndesigned reward functions. A high-level prior model can be easily injected on\ntop to generate unlimited long and diverse sequences. Although we focus on no\ndriving sources now, our framework can be generalized for controlled synthesis\nwith explicit driving sources. Through comprehensive evaluations, we conclude\nthat our proposed framework can address all the above-mentioned challenges and\noutperform other strong baselines very significantly.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:07:38 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Weiyuan",""],["Dai","Bin",""],["Zhou","Ziyi",""],["Yao","Qi",""],["Wang","Baoyuan",""]]}
{"id":"2308.06026","submitter":"Antonio Garc\\'ia Mu\\~noz","authors":"A. Garc\\'ia Mu\\~noz","title":"Heating and ionization by non-thermal electrons in the upper atmospheres\n  of water-rich exoplanets","comments":"Published","journal-ref":"Astronomy & Astrophysics, Volume 672, id.A77, 12 pp., 2023","doi":"10.1051/0004-6361/202245766","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. The long-term evolution of an atmosphere and the remote\ndetectability of its chemical constituents are susceptible to how the\natmospheric gas responds to stellar irradiation. The response remains poorly\ncharacterized for water and its dissociation products, however, this knowledge\nis relevant to our understanding of hypothetical water-rich exoplanets. Aims:\nOur work investigates the effect of photoelectrons, namely, the non-thermal\nelectrons produced by photoionizing stellar radiation on the heating and\nionization of extended atmospheres dominated by the dissociation products of\nwater. Methods: We used a Monte Carlo model and up-to-date collision cross\nsections to simulate the slowing down of photoelectrons in O-H mixtures for a\nrange of fractional ionizations and photoelectron energies. Results: We find\nthat that the fraction of energy of a photoelectron that goes into heating is\nsimilar in a pure H gas and in O-H mixtures, except for very low fractional\nionizations, whereby the O atom remains an efficient sink of energy. The O-H\nmixtures will go on to produce more electrons because the O atom is\nparticularly susceptible to ionization. We quantified all that information and\npresent it in a way that can be easily incorporated into\nphotochemical-hydrodynamical models. Conclusions: Neglecting the role of\nphotoelectrons in models of water-rich atmospheres will result in\noverestimations of the atmospheric heating and, foreseeably, the mass-loss\nrates as well. It will also underestimate the rate at which the atmospheric gas\nbecomes ionized, which may have implications for the detection of extended\natmospheres with Lyman-{\\alpha} transmission spectroscopy. Our simulations for\nthe small exoplanets {\\pi} Men c and TRAPPIST-1 b reveal that they respond very\ndifferently to irradiation from their host stars, with water remaining in\nmolecular form at lower pressures in the latter case.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:12:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mu\u00f1oz","A. Garc\u00eda",""]]}
{"id":"2308.06027","submitter":"Yuki Endo","authors":"Yuki Endo","title":"Masked-Attention Diffusion Guidance for Spatially Controlling\n  Text-to-Image Generation","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":"  Text-to-image synthesis has achieved high-quality results with recent\nadvances in diffusion models. However, text input alone has high spatial\nambiguity and limited user controllability. Most existing methods allow spatial\ncontrol through additional visual guidance (e.g, sketches and semantic masks)\nbut require additional training with annotated images. In this paper, we\npropose a method for spatially controlling text-to-image generation without\nfurther training of diffusion models. Our method is based on the insight that\nthe cross-attention maps reflect the positional relationship between words and\npixels. Our aim is to control the attention maps according to given semantic\nmasks and text prompts. To this end, we first explore a simple approach of\ndirectly swapping the cross-attention maps with constant maps computed from the\nsemantic regions. Moreover, we propose masked-attention guidance, which can\ngenerate images more faithful to semantic masks than the first approach.\nMasked-attention guidance indirectly controls attention to each word and pixel\naccording to the semantic regions by manipulating noise images fed to diffusion\nmodels. Experiments show that our method enables more accurate spatial control\nthan baselines qualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:15:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Endo","Yuki",""]]}
{"id":"2308.06028","submitter":"Sebastian Stock","authors":"Sebastian Stock, Atif Mashkoor, Alexander Egyed","title":"Validation-Driven Development","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Formal methods play a fundamental role in asserting the correctness of\nrequirements specifications. However, historically, formal method experts have\nprimarily focused on verifying those specifications. Although equally\nimportant, validation of requirements specifications often takes the back seat.\nThis paper introduces a validation-driven development (VDD) process that\nprioritizes validating requirements in formal development. The VDD process is\nbuilt upon problem frames - a requirements analysis approach - and validation\nobligations (VOs) - the concept of breaking down the overall validation of a\nspecification and linking it to refinement steps. The effectiveness of the VDD\nprocess is demonstrated through a case study in the aviation industry.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:15:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Stock","Sebastian",""],["Mashkoor","Atif",""],["Egyed","Alexander",""]]}
{"id":"2308.06029","submitter":"Kiyoto Nakamura","authors":"Kiyoto Nakamura, Joachim Ankerhold","title":"Qubit Dynamics beyond Lindblad: Non-Markovianity versus Rotating Wave\n  Approximation","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With increasing experimental performance of qubit devices, highly accurate\ntheoretical predictions are needed to describe the open system dynamics. Here,\nwe make use of three equations of motion for the reduced density matrix, the\nconventional Lindblad equation (LE), the Universal Lindblad Equation (ULE), and\nthe Hierarchical Equations of Motion (HEOM). While the HEOM provides\nnumerically exact benchmark data, the LE is based on the Born-Markov\napproximation in combination with the rotating wave approximation (RWA) which\nis not imposed in the ULE. This allows us to analyze the distinction between\nthe Born-Markov approximation and the RWA, which may be sometimes confused. As\na demonstration, predictions for relaxation and decoherence of a two-level\nsystem in presence of reservoirs with Ohmic and sub-Ohmic spectral densities\nare explored. With the aid of a recently proposed protocol based on Ramsey\nexperiments, the role of the Born-Markov approximation and the RWA is revealed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:16:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Nakamura","Kiyoto",""],["Ankerhold","Joachim",""]]}
{"id":"2308.06030","submitter":"Weiyi Pan","authors":"Weiyi Pan, Changsong Xu, Xueyang Li, Zhiming Xu, Boyu Liu, Bing-Lin\n  Gu, and Wenhui Duan","title":"Role of higher-order spin interactions in the emergence of chiral\n  magnetic configurations in lithium-decorated monolayer CrTe$_{2}$","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":"  Chiral magnetic states in two-dimensional (2D) layered noncentrosymmetric\nmagnets, which are of promising advanced spintronic applications, are usually\nattributed to Dzyaloshinskii-Moriya interaction (DMI), yet the role of\nunderlying higher-order spin couplings on the emergence of chiral spin textures\nis rarely reported. In this work, taking lithium-decorated monolayer CrTe$_{2}$\n(LiCrTe$_{2}$) as an example, we proposed a comprehensive\nfirst-principles-based spin model using the symmetry-adapted cluster expansion\nmethod. Based on this spin model, we identified the ground state of monolayer\nLiCrTe$_{2}$ to be a chiral labyrinth domain (LD) state, and various\nhigher-order spin interactions are essentially responsible for stabilizing this\nLD state. Meanwhile, some higher-order couplings are identified to play the\nrole of DMI due to their nontrivial spin spiral chirality selectivity. In\naddition, skyrmions emerge under either external magnetic field or finite\ntemperature. Our study sheds light on the complex magnetic couplings in 2D\nmagnets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:16:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Pan","Weiyi",""],["Xu","Changsong",""],["Li","Xueyang",""],["Xu","Zhiming",""],["Liu","Boyu",""],["Gu","Bing-Lin",""],["Duan","Wenhui",""]]}
{"id":"2308.06031","submitter":"Michael Fink","authors":"Michael Fink, Annalena Daniels, Cheng Qian, V\\'ictor Mart\\'inez\n  Vel\\'asquez, Sahil Salotra, Dirk Wollherr","title":"Comparison of Dynamic Tomato Growth Models for Optimal Control in\n  Greenhouses","comments":"2023 IEEE International Conference on Agrosystem Engineering,\n  Technology & Applications (AGRETA2023), Kuala Lumpur, Malaysia","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As global demand for efficiency in agriculture rises, there is a growing\ninterest in high-precision farming practices. Particularly greenhouses play a\ncritical role in ensuring a year-round supply of fresh produce. In order to\nmaximize efficiency and productivity while minimizing resource use,\nmathematical techniques such as optimal control have been employed. However,\nselecting appropriate models for optimal control requires domain expertise.\nThis study aims to compare three established tomato models for their\nsuitability in an optimal control framework. Results show that all three models\nhave similar yield predictions and accuracy, but only two models are currently\napplicable for optimal control due to implementation limitations. The two\nremaining models each have advantages in terms of economic yield and\ncomputation times, but the differences in optimal control strategies suggest\nthat they require more accurate parameter identification and calibration\ntailored to greenhouses.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:18:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fink","Michael",""],["Daniels","Annalena",""],["Qian","Cheng",""],["Vel\u00e1squez","V\u00edctor Mart\u00ednez",""],["Salotra","Sahil",""],["Wollherr","Dirk",""]]}
{"id":"2308.06032","submitter":"Arianna Trozze","authors":"Arianna Trozze, Toby Davies, and Bennett Kleinberg","title":"Large Language Models in Cryptocurrency Securities Cases: Can ChatGPT\n  Replace Lawyers?","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 (LLMs) could enhance access to the legal system.\nHowever, empirical research on their effectiveness in conducting legal tasks is\nscant. We study securities cases involving cryptocurrencies as one of numerous\ncontexts where AI could support the legal process, studying LLMs' legal\nreasoning and drafting capabilities. We examine whether a) an LLM can\naccurately determine which laws are potentially being violated from a fact\npattern, and b) whether there is a difference in juror decision-making based on\ncomplaints written by a lawyer compared to an LLM. We feed fact patterns from\nreal-life cases to GPT-3.5 and evaluate its ability to determine correct\npotential violations from the scenario and exclude spurious violations. Second,\nwe had mock jurors assess complaints written by the LLM and lawyers. GPT-3.5's\nlegal reasoning skills proved weak, though we expect improvement in future\nmodels, particularly given the violations it suggested tended to be correct (it\nmerely missed additional, correct violations). GPT-3.5 performed better at\nlegal drafting, and jurors' decisions were not statistically significantly\nassociated with the author of the document upon which they based their\ndecisions. Because LLMs cannot satisfactorily conduct legal reasoning tasks,\nthey would be unable to replace lawyers at this stage. However, their drafting\nskills (though, perhaps, still inferior to lawyers), could provide access to\njustice for more individuals by reducing the cost of legal services. Our\nresearch is the first to systematically study LLMs' legal drafting and\nreasoning capabilities in litigation, as well as in securities law and\ncryptocurrency-related misconduct.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:23:11 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 17:57:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Trozze","Arianna",""],["Davies","Toby",""],["Kleinberg","Bennett",""]]}
{"id":"2308.06033","submitter":"Protyush Nandi","authors":"Protyush Nandi and Subinay Dasgupta","title":"Nodal line semimetals through boundary","comments":"8 pages,10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the properties of a spinless Hamiltonian which describes topological\nnodal line semimetals at zero temperature. Our Hamiltonian has some resemblance\nwith the usual Hamiltonian for this type of materials, with that of Weyl\nsemimetals and is some sort of a generalisation of Kitaev Hamiltonian on\nhoneycomb lattice. As the interaction parameter of the Hamiltonian is varied,\nit shows a transition from a gapless phase to a semimetal phase and then to\nanother semimetal phase. These transitions show up as non-analytic behaviour of\nground state energy. We find that one type of the semimetal is characterised by\na single closed loop of nodal line, while the other, by two such loops both\ncrossing the boundary of the first Brillouin zone. Surface states with non-zero\nwinding number are found to exist in both of these phases, but over two\ntopologically different regions. We also study the length of nodal line, the\narea and perimeter of the region over which the winding number is non-zero and\nthe low-frequency electrical conductivity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:26:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nandi","Protyush",""],["Dasgupta","Subinay",""]]}
{"id":"2308.06034","submitter":"Andrea Munari","authors":"Andrea Munari","title":"Age of Incorrect Information in Random Access Channels without Feedback","comments":null,"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":"  We focus on a system in which a set of two-state Markov sources report status\nupdate to a common receiver over a shared wireless channel. Inspired by\npractical IoT networks, we consider three variations of ALOHA as medium access\nprotocol: i) a random approach in which a source transmits regardless of its\nstatus, ii) a reactive scheme in which updates are sent only when a source\nchanges state, and iii) a hybrid solution which blends the two possibilities.\nWe consider different criteria to capture the ability of the receiver to\nmaintain an accurate perception of the tracked processes: average age of\nincorrect information (AoII), probability of missed detection (i.e., of not\ndetecting a source transition), and average duration of intervals over which\nthe receiver lingers with erroneous knowledge. We provide closed form\nanalytical expressions for all the metrics, highlighting non-trivial trade-offs\nand providing useful protocol design hints.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:28:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Munari","Andrea",""]]}
{"id":"2308.06035","submitter":"Viktor Kewenig","authors":"Viktor Kewenig, Christopher Edwards, Quitterie Lacome DEstalenx,\n  Akilles Rechardt, Jeremy I Skipper and Gabriella Vigliocco","title":"Evidence of Human-Like Visual-Linguistic Integration in Multimodal Large\n  Language Models During Predictive Language Processing","comments":"13 pages, 4 figures, submitted to journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The advanced language processing abilities of large language models (LLMs)\nhave stimulated debate over their capacity to replicate human-like cognitive\nprocesses. One differentiating factor between language processing in LLMs and\nhumans is that language input is often grounded in more than one perceptual\nmodality, whereas most LLMs process solely text-based information. Multimodal\ngrounding allows humans to integrate - e.g. visual context with linguistic\ninformation and thereby place constraints on the space of upcoming words,\nreducing cognitive load and improving perception and comprehension. Recent\nmultimodal LLMs (mLLMs) combine visual and linguistic embedding spaces with a\ntransformer type attention mechanism for next-word prediction. To what extent\ndoes predictive language processing based on multimodal input align in mLLMs\nand humans? To answer this question, 200 human participants watched short\naudio-visual clips and estimated the predictability of an upcoming verb or\nnoun. The same clips were processed by the mLLM CLIP, with predictability\nscores based on a comparison of image and text feature vectors. Eye-tracking\nwas used to estimate what visual features participants attended to, and CLIP's\nvisual attention weights were recorded. We find that human estimates of\npredictability align significantly with CLIP scores, but not for a unimodal LLM\nof comparable parameter size. Further, alignment vanished when CLIP's visual\nattention weights were perturbed, and when the same input was fed to a\nmultimodal model without attention. Analysing attention patterns, we find a\nsignificant spatial overlap between CLIP's visual attention weights and human\neye-tracking data. Results suggest that comparable processes of integrating\nmultimodal information, guided by attention to relevant visual features,\nsupports predictive language processing in mLLMs and humans.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:30:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kewenig","Viktor",""],["Edwards","Christopher",""],["DEstalenx","Quitterie Lacome",""],["Rechardt","Akilles",""],["Skipper","Jeremy I",""],["Vigliocco","Gabriella",""]]}
{"id":"2308.06036","submitter":"Hiroshi Yoshitake","authors":"Hiroshi Yoshitake, Pieter Abbeel","title":"The Impact of Overall Optimization on Warehouse Automation","comments":"8 pages, 4 figures, accepted at International Conference on\n  Intelligent Robots and Systems (IROS2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we propose a novel approach for investigating optimization\nperformance by flexible robot coordination in automated warehouses with\nmulti-agent reinforcement learning (MARL)-based control. Automated systems\nusing robots are expected to achieve efficient operations compared with manual\nsystems in terms of overall optimization performance. However, the impact of\noverall optimization on performance remains unclear in most automated systems\ndue to a lack of suitable control methods. Thus, we proposed a centralized\ntraining-and-decentralized execution MARL framework as a practical overall\noptimization control method. In the proposed framework, we also proposed a\nsingle shared critic, trained with global states and rewards, applicable to a\ncase in which heterogeneous agents make decisions asynchronously. Our proposed\nMARL framework was applied to the task selection of material handling equipment\nthrough automated order picking simulation, and its performance was evaluated\nto determine how far overall optimization outperforms partial optimization by\ncomparing it with other MARL frameworks and rule-based control methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:31:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yoshitake","Hiroshi",""],["Abbeel","Pieter",""]]}
{"id":"2308.06037","submitter":"Zhe Wang","authors":"Xuyang Hou, Zhe Wang, Qi Liu, Tan Qu, Jia Cheng, Jun Lei","title":"Deep Context Interest Network for Click-Through Rate Prediction","comments":"accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Click-Through Rate (CTR) prediction, estimating the probability of a user\nclicking on an item, is essential in industrial applications, such as online\nadvertising. Many works focus on user behavior modeling to improve CTR\nprediction performance. However, most of those methods only model users'\npositive interests from users' click items while ignoring the context\ninformation, which is the display items around the clicks, resulting in\ninferior performance. In this paper, we highlight the importance of context\ninformation on user behavior modeling and propose a novel model named Deep\nContext Interest Network (DCIN), which integrally models the click and its\ndisplay context to learn users' context-aware interests. DCIN consists of three\nkey modules: 1) Position-aware Context Aggregation Module (PCAM), which\nperforms aggregation of display items with an attention mechanism; 2)\nFeedback-Context Fusion Module (FCFM), which fuses the representation of clicks\nand display contexts through non-linear feature interaction; 3) Interest\nMatching Module (IMM), which activates interests related with the target item.\nMoreover, we provide our hands-on solution to implement our DCIN model on\nlarge-scale industrial systems. The significant improvements in both offline\nand online evaluations demonstrate the superiority of our proposed DCIN method.\nNotably, DCIN has been deployed on our online advertising system serving the\nmain traffic, which brings 1.5% CTR and 1.5% RPM lift.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:32:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hou","Xuyang",""],["Wang","Zhe",""],["Liu","Qi",""],["Qu","Tan",""],["Cheng","Jia",""],["Lei","Jun",""]]}
{"id":"2308.06038","submitter":"Chun-Mei Feng","authors":"Chun-Mei Feng, Kai Yu, Yong Liu, Salman Khan, Wangmeng Zuo","title":"Diverse Data Augmentation with Diffusions for Effective Test-time Prompt\n  Tuning","comments":"Proceedings of the IEEE/CVF International Conference on Computer\n  Vision 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Benefiting from prompt tuning, recent years have witnessed the promising\nperformance of pre-trained vision-language models, e.g., CLIP, on versatile\ndownstream tasks. In this paper, we focus on a particular setting of learning\nadaptive prompts on the fly for each test sample from an unseen new domain,\nwhich is known as test-time prompt tuning (TPT). Existing TPT methods typically\nrely on data augmentation and confidence selection. However, conventional data\naugmentation techniques, e.g., random resized crops, suffers from the lack of\ndata diversity, while entropy-based confidence selection alone is not\nsufficient to guarantee prediction fidelity. To address these issues, we\npropose a novel TPT method, named DiffTPT, which leverages pre-trained\ndiffusion models to generate diverse and informative new data. Specifically, we\nincorporate augmented data by both conventional method and pre-trained stable\ndiffusion to exploit their respective merits, improving the models ability to\nadapt to unknown new test data. Moreover, to ensure the prediction fidelity of\ngenerated data, we introduce a cosine similarity-based filtration technique to\nselect the generated data with higher similarity to the single test sample. Our\nexperiments on test datasets with distribution shifts and unseen categories\ndemonstrate that DiffTPT improves the zero-shot accuracy by an average of\n5.13\\% compared to the state-of-the-art TPT method. Our code and models will be\npublicly released.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:36:31 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 05:20:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Feng","Chun-Mei",""],["Yu","Kai",""],["Liu","Yong",""],["Khan","Salman",""],["Zuo","Wangmeng",""]]}
{"id":"2308.06039","submitter":"Debodeep Banerjee","authors":"Debodeep Banerjee, Stefano Teso, Andrea Passerini","title":"Learning to Guide Human Experts via Personalized Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In learning to defer, a predictor identifies risky decisions and defers them\nto a human expert. One key issue with this setup is that the expert may end up\nover-relying on the machine's decisions, due to anchoring bias. At the same\ntime, whenever the machine chooses the deferral option the expert has to take\ndecisions entirely unassisted. As a remedy, we propose learning to guide (LTG),\nan alternative framework in which -- rather than suggesting ready-made\ndecisions -- the machine provides guidance useful to guide decision-making, and\nthe human is entirely responsible for coming up with a decision. We also\nintroduce SLOG, an LTG implementation that leverages (a small amount of) human\nsupervision to convert a generic large language model into a module capable of\ngenerating textual guidance, and present preliminary but promising results on a\nmedical diagnosis task.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:36:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Banerjee","Debodeep",""],["Teso","Stefano",""],["Passerini","Andrea",""]]}
{"id":"2308.06040","submitter":"Arikatla Satyanarayana Reddy","authors":"Shivani Chauhan and A. Satyanarayana Reddy","title":"Algebraic connectivity of Kronecker products of line graphs","comments":"14 pages, accepted for publication in Discrete Mathematics,\n  Algorithms and Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a tree with $n$ vertices and $L(X)$ be its line graph. In this\nwork, we completely characterize the trees for which the algebraic connectivity\nof $L(X)\\times K_m$ is equal to $m-1$, where $\\times$ denotes the Kronecker\nproduct. We provide a few necessary and sufficient conditions for $L(X)\\times\nK_m$ to be Laplacian integral. The algebraic connectivity of $L(X)\\times K_m$,\nwhere $X$ is a tree of diameter $4$ and $k$-book graph is discussed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:36:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chauhan","Shivani",""],["Reddy","A. Satyanarayana",""]]}
{"id":"2308.06041","submitter":"Miquel Miravet-Ten\\'es","authors":"Miquel Miravet-Ten\\'es, Pablo Cerd\\'a-Dur\\'an, Martin Obergaulinger,\n  Jos\\'e A. Font","title":"Assessment of a new sub-grid model for magnetohydrodynamical turbulence.\n  II. Kelvin-Helmholtz instability","comments":"12 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The modelling of astrophysical systems such as binary neutron star mergers or\nthe formation of magnetars from the collapse of massive stars involves the\nnumerical evolution of magnetised fluids at extremely large Reynolds numbers.\nThis is a major challenge for (unresolved) direct numerical simulations which\nmay struggle to resolve highly dynamical features as, e.g. turbulence, magnetic\nfield amplification, or the transport of angular momentum. Sub-grid models\noffer a means to overcome those difficulties. In a recent paper we presented\nMInIT, an MHD-instability-induced-turbulence mean-field, sub-grid model based\non the modelling of the turbulent (Maxwell, Reynolds, and Faraday) stress\ntensors. While in our previous work MInIT was assessed within the framework of\nthe magnetorotational instability, in this paper we further evaluate the model\nin the context of the Kelvin-Helmholtz instability (KHI). The main difference\nwith other sub-grid models (as e.g. the alpha-viscosity model or the gradient\nmodel) is that in MInIT we track independently the turbulent energy density at\nsub-grid scales, which is used, via a simple closure relation, to compute the\ndifferent turbulent stresses relevant for the dynamics. The free coefficients\nof the model are calibrated using well resolved box simulations of magnetic\nturbulence generated by the KHI. We test the model against these simulations\nand show that it yields order-of-magnitude accurate predictions for the\nevolution of the turbulent Reynolds and Maxwell stresses.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:39:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Miravet-Ten\u00e9s","Miquel",""],["Cerd\u00e1-Dur\u00e1n","Pablo",""],["Obergaulinger","Martin",""],["Font","Jos\u00e9 A.",""]]}
{"id":"2308.06042","submitter":"Carsten Schneider","authors":"Johannes Bluemlein, Nikolai Fadeev, Carsten Schneider","title":"Computing Mellin representations and asymptotics of nested binomial sums\n  in a symbolic way: the RICA package","comments":null,"journal-ref":"ACM Communications in Computer Algebra, Vol. 57, No. 2, Issue 224,\n  June 2023","doi":"10.1145/3614408.3614410","report-no":"RISC Report Series 23-11","categories":"hep-ph cs.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nested binomial sums form a particular class of sums that arise in the\ncontext of particle physics computations at higher orders in perturbation\ntheory within QCD and QED, but that are also mathematically relevant, e.g., in\ncombinatorics. We present the package RICA (Rule Induced Convolutions for\nAsymptotics), which aims at calculating Mellin representations and asymptotic\nexpansions at infinity of those objects. These representations are of\nparticular interest to perform analytic continuations of such sums.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:43:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bluemlein","Johannes",""],["Fadeev","Nikolai",""],["Schneider","Carsten",""]]}
{"id":"2308.06043","submitter":"Luisa Fermo","authors":"Luisa Fermo, Concetta Laurita, Maria Grazia Russo","title":"On the error of best polynomial approximation of composite functions","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 purpose of the paper is to provide a characterization of the error of the\nbest polynomial approximation of composite functions in weighted spaces. Such a\ncharacterization is essential for the convergence analysis of numerical methods\napplied to non-linear problems or for numerical approaches that make use of\nregularization techniques to cure low smoothness of the solution. This result\nis obtained through an estimate of the derivatives of composite functions in\nweighted uniform norm.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:43:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fermo","Luisa",""],["Laurita","Concetta",""],["Russo","Maria Grazia",""]]}
{"id":"2308.06044","submitter":"Tim Seppelt","authors":"Eva Fluck, Tim Seppelt and Gian Luca Spitzer","title":"Going Deep and Going Wide: Counting Logic and Homomorphism\n  Indistinguishability over Graphs of Bounded Treedepth and Treewidth","comments":"30 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the expressive power of first-order logic with counting quantifiers,\nespecially the $k$-variable and quantifier-rank-$q$ fragment $\\mathsf{C}^k_q$,\nusing homomorphism indistinguishability. Recently, Dawar, Jakl, and Reggio\n(2021) proved that two graphs satisfy the same $\\mathsf{C}^k_q$-sentences if\nand only if they are homomorphism indistinguishable over the class\n$\\mathcal{T}^k_q$ of graphs admitting a $k$-pebble forest cover of depth $q$.\nTheir proof builds on the categorical framework of game comonads developed by\nAbramsky, Dawar, and Wang (2017). We reprove their result using elementary\ntechniques inspired by Dvo\\v{r}\\'ak (2010). Using these techniques we also give\na characterisation of guarded counting logic. Our main focus, however, is to\nprovide a graph theoretic analysis of the graph class $\\mathcal{T}^k_q$. This\nallows us to separate $\\mathcal{T}^k_q$ from the intersection of the graph\nclass $\\mathcal{TW}_{k-1}$, that is graphs of treewidth less or equal $k-1$,\nand $\\mathcal{TD}_q$, that is graphs of treedepth at most $q$ if $q$ is\nsufficiently larger than $k$. We are able to lift this separation to the\nsemantic separation of the respective homomorphism indistinguishability\nrelations. A part of this separation is to prove that the class\n$\\mathcal{TD}_q$ is homomorphism distinguishing closed, which was already\nconjectured by Roberson (2022).\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:45:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fluck","Eva",""],["Seppelt","Tim",""],["Spitzer","Gian Luca",""]]}
{"id":"2308.06045","submitter":"Markus Horn","authors":"Markus Horn, Thomas Wodtko, Michael Buchholz, and Klaus Dietmayer","title":"User Feedback and Sample Weighting for Ill-Conditioned Hand-Eye\n  Calibration","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":"  Hand-eye calibration is an important and extensively researched method for\ncalibrating rigidly coupled sensors, solely based on estimates of their motion.\nDue to the geometric structure of this problem, at least two motion estimates\nwith non-parallel rotation axes are required for a unique solution. If the\nmajority of rotation axes are almost parallel, the resulting optimization\nproblem is ill-conditioned. In this paper, we propose an approach to\nautomatically weight the motion samples of such an ill-conditioned optimization\nproblem for improving the conditioning. The sample weights are chosen in\nrelation to the local density of all available rotation axes. Furthermore, we\npresent an approach for estimating the sensitivity and conditioning of the cost\nfunction, separated into the translation and the rotation part. This\ninformation can be employed as user feedback when recording the calibration\ndata to prevent ill-conditioning in advance. We evaluate and compare our\napproach on artificially augmented data from the KITTI odometry dataset.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:46:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Horn","Markus",""],["Wodtko","Thomas",""],["Buchholz","Michael",""],["Dietmayer","Klaus",""]]}
{"id":"2308.06046","submitter":"Julyan Cartwright","authors":"Ana M. O. Morgado, Luis A. M. Rocha, Julyan H. E. Cartwright, and\n  Silvana S. S. Cardoso","title":"Osmosis drives explosions and methane release in Siberian permafrost","comments":null,"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":"  Several mysterious large craters, with anomalously high concentrations of\nmethane, have formed in the Yamal and Taymyr peninsulas of Siberia since 2014.\nWhile the thawing of the permafrost in the Arctic owing to climate warming may\npromote methane releases, it is unknown how such release might be associated\nwith violent explosion and crater formation. In this study we demonstrate that\na significant volume of surface ice-melt water can migrate downward driven by\nthe osmotic pressure associated with a cryopeg, a lens of salty water below. We\nshow that the overpressure reached at depth, caused by this water accumulation\nin the reservoir, can exceed the fracture strength and cause the frozen soil to\ncrack. If such fractures propagate to the surface, a rapid reduction of\npressure at depth can result in methane hydrate decomposition, methane gas\nrelease, and mechanical explosion. This phenomenon may also be the cause of\nseafloor pockmarks in fine-grained sediments such as silts and clays. This\nunforeseen mechanism may therefore accelerate significantly the decomposition\nof methane hydrates transported from depth to the surface, with implications\nfor the climate.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:51:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Morgado","Ana M. O.",""],["Rocha","Luis A. M.",""],["Cartwright","Julyan H. E.",""],["Cardoso","Silvana S. S.",""]]}
{"id":"2308.06047","submitter":"Matthias Meiwes","authors":"Matthias Meiwes","title":"Topological entropy and orbit growth in link complements","comments":"52 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.SG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this article, we exhibit certain linking properties of periodic orbits of\n$C^{1+\\alpha}$ flows with positive topological entropy on closed 3-manifolds M.\nIt is shown that any such flow contains a link L of periodic orbits and a\nhorseshoe K in M\\L, such that all periodic orbits in K are unique in their\nhomotopy class in M\\L (among periodic orbits in M). Moreover, the entropy of\nthe flow can be approximated by the entropies of such horseshoes K. A version\nof that result for chords is obtained. Our main motivation comes from Reeb\ndynamics, and as an application, we address a question by Alves-Pirnapasov, and\nobtain that the topological entropy of a 3-dimensional, $C^{\\infty}$-generic\nReeb flow can be approximated by the exponential homotopical growth rates of\ncontact homology in link complements.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:52:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Meiwes","Matthias",""]]}
{"id":"2308.06048","submitter":"Yan Rybalko","authors":"Yan Rybalko","title":"H\\\"older continuity of functions in the fractional Sobolev spaces:\n  1-dimensional case","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 deals with the embedding of the Sobolev spaces of fractional order\ninto the space of H\\\"older continuous functions. More precisely, we show that\nthe function $f\\in H^s(\\mathbb{R})$ with $\\frac{1}{2}<s<1$ is H\\\"older\ncontinuous with the exponent $s-\\frac{1}{2}$. This is a particular case of the\nmuch stronger embedding theorems (see Section 2.8.1 in \\textit{H. Triebel,\nInterpolation Theory, Function Spaces, Differential Operators, North-Holland\nPub. Co., Amsterdam, 1978.}), but here we give an elementary proof for\n$H^{s}(\\mathbb{R})$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:52:22 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 17:30:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rybalko","Yan",""]]}
{"id":"2308.06049","submitter":"Denis  V. Osipov","authors":"D. V. Osipov","title":"Local analog of the Deligne-Riemann-Roch isomorphism for line bundles in\n  relative dimension $1$","comments":"47 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a local analog of the Deligne-Riemann-Roch isomorphism in the case\nof line bundles and relative dimension $1$. This local analog consists in\ncomputation of the class of determinant central extension of a group ind-scheme\n$\\mathcal G$ by the multiplicative group scheme over $\\mathbb Q$ via the\nproduct of $2$-cocyles in the second cohomology group. These $2$-cocycles are\nthe compositions of the Contou-Carr\\`{e}re symbol with the $\\cup$-product of\n$1$-cocycles. The group ind-scheme $\\mathcal G$ represents the functor which\nassigns to every commutative ring $A$ the group that is the semidirect product\nof the group $A((t))^*$ of invertible elements of $A((t))$ and the group of\ncontinuous $A$-automorphisms of $A$-algebra $A((t))$. The determinant central\nextension naturally acts on the determinant line bundle on the moduli stack of\ngeometric data (proper quintets). A proper quintet is a collection of a proper\nfamily of curves over $ \\mathop{\\rm Spec} A$, a line bundle on this family, a\nsection of this family, a relative formal parameter at the section, a formal\ntrivialization of the bundle at the section that satisfy further conditions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:55:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Osipov","D. V.",""]]}
{"id":"2308.06050","submitter":"Xiaorun Zang","authors":"Xiaorun Zang and Andriy Shevchenko","title":"Optical near-field enhancement by guided Bloch modes in plasmonic\n  metasurfaces","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Local enhancement of light intensity by plasmonic nanostructures is essential\nfor many optical applications, such as Surface-Enhanced Raman Spectroscopy\n(SERS) and fluorescence- or scattering-based plasmonic sensing. The enhancement\nis usually localized on the surface of each individual metal nanoparticle\nplaying the role of a plasmonic resonator. In some cases, however, the\nparticles are arranged in a periodic lattice and the excitations in them can be\ncoupled to the surface lattice resonances (SLRs), which can additionally\nenhance the field. In this work, we report a field-enhancement mechanism that\nis based on the coupling between surface plasmon resonances in metal\nnanoparticles and Bloch modes guided by a dielectric-metal slab waveguide in a\nplasmonic metasurface. We demonstrate an extra factor of the local intensity\nenhancement of about 80 and the corresponding additional SERS enhancement of\nmore than 6000 compared to isolated plasmonic nanoparticles on a thick glass\nsubstrate. This mechanism opens the possibility to design extraordinarily\nefficient metal-dielectric metasurfaces for many applications in optics and\nphotonics, including SERS, fluoresence spectroscopy, nonlinear optics, and\nsolar energy harvesting.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:58:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zang","Xiaorun",""],["Shevchenko","Andriy",""]]}
{"id":"2308.06051","submitter":"Chun-Mei Feng","authors":"Chun-Mei Feng, Kai Yu, Nian Liu, Xinxing Xu, Salman Khan, Wangmeng Zuo","title":"Towards Instance-adaptive Inference for Federated Learning","comments":"Proceedings of the IEEE/CVF International Conference on Computer\n  Vision 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning (FL) is a distributed learning paradigm that enables\nmultiple clients to learn a powerful global model by aggregating local\ntraining. However, the performance of the global model is often hampered by\nnon-i.i.d. distribution among the clients, requiring extensive efforts to\nmitigate inter-client data heterogeneity. Going beyond inter-client data\nheterogeneity, we note that intra-client heterogeneity can also be observed on\ncomplex real-world data and seriously deteriorate FL performance. In this\npaper, we present a novel FL algorithm, i.e., FedIns, to handle intra-client\ndata heterogeneity by enabling instance-adaptive inference in the FL framework.\nInstead of huge instance-adaptive models, we resort to a parameter-efficient\nfine-tuning method, i.e., scale and shift deep features (SSF), upon a\npre-trained model. Specifically, we first train an SSF pool for each client,\nand aggregate these SSF pools on the server side, thus still maintaining a low\ncommunication cost. To enable instance-adaptive inference, for a given\ninstance, we dynamically find the best-matched SSF subsets from the pool and\naggregate them to generate an adaptive SSF specified for the instance, thereby\nreducing the intra-client as well as the inter-client heterogeneity. Extensive\nexperiments show that our FedIns outperforms state-of-the-art FL algorithms,\ne.g., a 6.64\\% improvement against the top-performing method with less than\n15\\% communication cost on Tiny-ImageNet. Our code and models will be publicly\nreleased.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:58:47 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 05:04:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Feng","Chun-Mei",""],["Yu","Kai",""],["Liu","Nian",""],["Xu","Xinxing",""],["Khan","Salman",""],["Zuo","Wangmeng",""]]}
{"id":"2308.06052","submitter":"Vesa Kaarnioja","authors":"Ian H. Sloan, Vesa Kaarnioja","title":"Doubling the rate -- improved error bounds for orthogonal projection in\n  Hilbert spaces","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convergence rates for $L_2$ approximation in a Hilbert space $H$ are a\ncentral theme in numerical analysis. The present work is inspired by Schaback\n(Math. Comp., 1999), who showed, in the context of best pointwise approximation\nfor radial basis function interpolation, that the convergence rate for\nsufficiently smooth functions can be doubled, compared to the general rate for\nfunctions in the \"native space\" $H$. Motivated by this, we obtain a general\nresult for $H$-orthogonal projection onto a finite dimensional subspace of $H$:\nnamely, that any known $L_2$ convergence rate for all functions in $H$\ntranslates into a doubled $L_2$ convergence rate for functions in a smoother\nnormed space $B$, along with a similarly improved error bound in the $H$-norm,\nprovided that $L_2$, $H$ and $B$ are suitably related. As a special case we\nimprove the known $L_2$ and $H$-norm convergence rates for kernel interpolation\nin reproducing kernel Hilbert spaces, with particular attention to a recent\nstudy (Kaarnioja, Kazashi, Kuo, Nobile, Sloan, Numer. Math., 2022) of periodic\nkernel-based interpolation at lattice points applied to parametric partial\ndifferential equations. A second application is to radial basis function\ninterpolation for general conditionally positive definite basis functions,\nwhere again the $L_2$ convergence rate is doubled, and the convergence rate in\nthe native space norm is similarly improved, for all functions in a smoother\nnormed space $B$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:04:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sloan","Ian H.",""],["Kaarnioja","Vesa",""]]}
{"id":"2308.06053","submitter":"Xinyue Ma","authors":"Xinyue Ma, Suyeon Jeong, Minjia Zhang, Di Wang, Jonghyun Choi,\n  Myeongjae Jeon","title":"Cost-effective On-device Continual Learning over Memory Hierarchy with\n  Miro","comments":"This paper is to be published in the 29th Annual International\n  Conference on Mobile Computing and Networking (ACM MobiCom 23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual learning (CL) trains NN models incrementally from a continuous\nstream of tasks. To remember previously learned knowledge, prior studies store\nold samples over a memory hierarchy and replay them when new tasks arrive. Edge\ndevices that adopt CL to preserve data privacy are typically energy-sensitive\nand thus require high model accuracy while not compromising energy efficiency,\ni.e., cost-effectiveness. Our work is the first to explore the design space of\nhierarchical memory replay-based CL to gain insights into achieving\ncost-effectiveness on edge devices. We present Miro, a novel system runtime\nthat carefully integrates our insights into the CL framework by enabling it to\ndynamically configure the CL system based on resource states for the best\ncost-effectiveness. To reach this goal, Miro also performs online profiling on\nparameters with clear accuracy-energy trade-offs and adapts to optimal values\nwith low overhead. Extensive evaluations show that Miro significantly\noutperforms baseline systems we build for comparison, consistently achieving\nhigher cost-effectiveness.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:05:53 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 03:19:03 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 01:36:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ma","Xinyue",""],["Jeong","Suyeon",""],["Zhang","Minjia",""],["Wang","Di",""],["Choi","Jonghyun",""],["Jeon","Myeongjae",""]]}
{"id":"2308.06054","submitter":"Ciaran Eising","authors":"Ken Power, Shailendra Deva, Ting Wang, Julius Li, Ciar\\'an Eising","title":"Hardware Accelerators in Autonomous Driving","comments":null,"journal-ref":"Proceedings of the Irish Machine Vision and Image Processing\n  Conference 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computing platforms in autonomous vehicles record large amounts of data from\nmany sensors, process the data through machine learning models, and make\ndecisions to ensure the vehicle's safe operation. Fast, accurate, and reliable\ndecision-making is critical. Traditional computer processors lack the power and\nflexibility needed for the perception and machine vision demands of advanced\nautonomous driving tasks. Hardware accelerators are special-purpose\ncoprocessors that help autonomous vehicles meet performance requirements for\nhigher levels of autonomy. This paper provides an overview of ML accelerators\nwith examples of their use for machine vision in autonomous vehicles. We offer\nrecommendations for researchers and practitioners and highlight a trajectory\nfor ongoing and future research in this emerging field.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:07:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Power","Ken",""],["Deva","Shailendra",""],["Wang","Ting",""],["Li","Julius",""],["Eising","Ciar\u00e1n",""]]}
{"id":"2308.06055","submitter":"Jakub Caputa","authors":"Jan Krupi\\'nski, Maciej Wielgosz, Szymon Mazurek, Krystian\n  Strza{\\l}ka, Pawe{\\l} Russek, Jakub Caputa, Daria {\\L}ukasik, Jakub\n  Grzeszczyk, Micha{\\l} Karwatowski, Rafa{\\l} Fraczek, Ernest Jamro, Marcin\n  Pietro\\'n, Sebastian Koryciak, Agnieszka D\\k{a}browska-Boruch, Kazimierz\n  Wiatr","title":"Computer-Aided Cytology Diagnosis in Animals: CNN-Based Image Quality\n  Assessment for Accurate Disease Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a computer-aided cytology diagnosis system designed for\nanimals, focusing on image quality assessment (IQA) using Convolutional Neural\nNetworks (CNNs). The system's building blocks are tailored to seamlessly\nintegrate IQA, ensuring reliable performance in disease classification. We\nextensively investigate the CNN's ability to handle various image variations\nand scenarios, analyzing the impact on detecting low-quality input data.\nAdditionally, the network's capacity to differentiate valid cellular samples\nfrom those with artifacts is evaluated. Our study employs a ResNet18 network\narchitecture and explores the effects of input sizes and cropping strategies on\nmodel performance. The research sheds light on the significance of CNN-based\nIQA in computer-aided cytology diagnosis for animals, enhancing the accuracy of\ndisease classification.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:09:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Krupi\u0144ski","Jan",""],["Wielgosz","Maciej",""],["Mazurek","Szymon",""],["Strza\u0142ka","Krystian",""],["Russek","Pawe\u0142",""],["Caputa","Jakub",""],["\u0141ukasik","Daria",""],["Grzeszczyk","Jakub",""],["Karwatowski","Micha\u0142",""],["Fraczek","Rafa\u0142",""],["Jamro","Ernest",""],["Pietro\u0144","Marcin",""],["Koryciak","Sebastian",""],["D\u0105browska-Boruch","Agnieszka",""],["Wiatr","Kazimierz",""]]}
{"id":"2308.06056","submitter":"Lev Ginzburg","authors":"Lev V. Ginzburg, Yuze Wu, Marc P. R\\\"o\\\"osli, Pedro Rosso Gomez,\n  Rebekka Garreis, Chuyao Tong, Veronika Star\\'a, Carolin Gold, Khachatur\n  Nazaryan, Serhii Kryhin, Hiske Overweg, Christian Reichl, Matthias Berl,\n  Takashi Taniguchi, Kenji Watanabe, Werner Wegscheider, Thomas Ihn, and Klaus\n  Ensslin","title":"Long distance electron-electron scattering detected with point contacts","comments":"14 pages, 11 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 measure electron transport through point contacts in an electron gas in\nAlGaAs/GaAs heterostructures and graphene for a range of temperatures, magnetic\nfields and electron densities. We find a magnetoconductance peak around B = 0.\nWith increasing temperature, the width of the peak increases monotonically,\nwhile its amplitude first increases and then decreases. For GaAs point contacts\nthe peak is particularly sharp at relatively low temperatures $T\\approx$1.5 K:\nthe curve rounds on a scale of few tens of $\\mu$T hinting at length scales of\nseveral millimeters for the corresponding scattering processes. We propose a\nmodel based on the transition between different transport regimes with\nincreasing temperature: from ballistic transport to few electron-electron\nscatterings to hydrodynamic superballistic flow to hydrodynamic Poiseuille-like\nflow. The model is in qualitative and, in many cases, quantitative agreement\nwith the experimental observations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:12:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ginzburg","Lev V.",""],["Wu","Yuze",""],["R\u00f6\u00f6sli","Marc P.",""],["Gomez","Pedro Rosso",""],["Garreis","Rebekka",""],["Tong","Chuyao",""],["Star\u00e1","Veronika",""],["Gold","Carolin",""],["Nazaryan","Khachatur",""],["Kryhin","Serhii",""],["Overweg","Hiske",""],["Reichl","Christian",""],["Berl","Matthias",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Wegscheider","Werner",""],["Ihn","Thomas",""],["Ensslin","Klaus",""]]}
{"id":"2308.06057","submitter":"Andrea Asperti","authors":"Andrea Asperti, Gabriele Colasuonno, Antonio Guerra","title":"Head Rotation in Denoising Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Denoising Diffusion Models (DDM) are emerging as the cutting-edge technology\nin the realm of deep generative modeling, challenging the dominance of\nGenerative Adversarial Networks. However, effectively exploring the latent\nspace's semantics and identifying compelling trajectories for manipulating and\nediting important attributes of the generated samples remains challenging,\nprimarily due to the high-dimensional nature of the latent space. In this\nstudy, we specifically concentrate on face rotation, which is known to be one\nof the most intricate editing operations. By leveraging a recent embedding\ntechnique for Denoising Diffusion Implicit Models (DDIM), we achieve, in many\ncases, noteworthy manipulations encompassing a wide rotation angle of $\\pm\n30^o$, preserving the distinct characteristics of the individual. Our\nmethodology exploits the computation of trajectories approximating clouds of\nlatent representations of dataset samples with different yaw rotations through\nlinear regression. Specific trajectories are obtained by restricting the\nanalysis to subsets of data sharing significant attributes with the source\nimage. One of these attributes is the light provenance: a byproduct of our\nresearch is a labeling of CelebA, categorizing images into three major groups\nbased on the illumination direction: left, center, and right.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:14:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Asperti","Andrea",""],["Colasuonno","Gabriele",""],["Guerra","Antonio",""]]}
{"id":"2308.06058","submitter":"Xiaowen Jiang","authors":"Xiaowen Jiang and Sebastian U. Stich","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence\n  and Variance Reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recently proposed stochastic Polyak stepsize (SPS) and stochastic\nline-search (SLS) for SGD have shown remarkable effectiveness when training\nover-parameterized models. However, in non-interpolation settings, both\nalgorithms only guarantee convergence to a neighborhood of a solution which may\nresult in a worse output than the initial guess. While artificially decreasing\nthe adaptive stepsize has been proposed to address this issue (Orvieto et al.\n[2022]), this approach results in slower convergence rates for convex and\nover-parameterized models. In this work, we make two contributions: Firstly, we\npropose two new variants of SPS and SLS, called AdaSPS and AdaSLS, which\nguarantee convergence in non-interpolation settings and maintain sub-linear and\nlinear convergence rates for convex and strongly convex functions when training\nover-parameterized models. AdaSLS requires no knowledge of problem-dependent\nparameters, and AdaSPS requires only a lower bound of the optimal function\nvalue as input. Secondly, we equip AdaSPS and AdaSLS with a novel variance\nreduction technique and obtain algorithms that require\n$\\smash{\\widetilde{\\mathcal{O}}}(n+1/\\epsilon)$ gradient evaluations to achieve\nan $\\mathcal{O}(\\epsilon)$-suboptimality for convex functions, which improves\nupon the slower $\\mathcal{O}(1/\\epsilon^2)$ rates of AdaSPS and AdaSLS without\nvariance reduction in the non-interpolation regimes. Moreover, our result\nmatches the fast rates of AdaSVRG but removes the inner-outer-loop structure,\nwhich is easier to implement and analyze. Finally, numerical experiments on\nsynthetic and real datasets validate our theory and demonstrate the\neffectiveness and robustness of our algorithms.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:17:29 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 16:28:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Xiaowen",""],["Stich","Sebastian U.",""]]}
{"id":"2308.06059","submitter":"Arieh Iserles","authors":"Mar\\'ia Jos\\'e Cantero and Arieh Iserles","title":"On skyburst polynomials and their zeros","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider polynomials orthogonal on the unit circle with respect to the\ncomplex-valued measure $z^{\\omega-1}\\mathrm{d} z$, where\n$\\omega\\in\\mathbb{R}\\setminus\\{0\\}$. We derive their explicit form, a\ngenerating function and several recurrence relations. These polynomials possess\nan intriguing pattern of zeros which, as $\\omega$ varies, are reminiscent of a\nfirework explosion. We prove this pattern in a rigorous manner.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:18:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cantero","Mar\u00eda Jos\u00e9",""],["Iserles","Arieh",""]]}
{"id":"2308.06060","submitter":"Fabio Anselmi","authors":"Renzo Testa, Alex Rodriguez, Alberto d'Onofrio, Andrea Trombettoni,\n  Fabio Benatti, Fabio Anselmi","title":"Catalysis of quantum tunneling by ancillary system learning","comments":"Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given the key role that quantum tunneling plays in a wide range of\napplications, a crucial objective is to maximize the probability of tunneling\nfrom one quantum state/level to another, while keeping the resources of the\nunderlying physical system fixed. In this work, we demonstrate that an\neffective solution to this challenge can be achieved by coupling the tunneling\nsystem with an ancillary system of the same kind. By utilizing machine learning\ntechniques, the parameters of both the ancillary system and the coupling can be\noptimized, leading to the maximization of the tunneling probability. We provide\nillustrative examples for the paradigmatic scenario involving a two-mode system\nand a two-mode ancilla with arbitrary couplings and in the presence of several\ninteracting particles. Importantly, the enhancement of the tunneling\nprobability appears to be minimally affected by noise and decoherence in both\nthe system and the ancilla.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:21:14 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Testa","Renzo",""],["Rodriguez","Alex",""],["d'Onofrio","Alberto",""],["Trombettoni","Andrea",""],["Benatti","Fabio",""],["Anselmi","Fabio",""]]}
{"id":"2308.06061","submitter":"Lorenzo Ducci","authors":"L. Ducci, P. Romano, S. Vercellone, A. Santangelo","title":"Modelling the expected very high energy gamma-ray emission from\n  accreting neutron stars in X-ray binaries","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The detection of gamma-ray emission from accreting pulsars in X-ray binaries\n(XRBs) has long been sought after. For some high-mass X-ray binaries (HMXBs),\nmarginal detections have recently been reported. Regardless of whether these\nwill be confirmed or not, future telescopes operating in the gamma-ray band\ncould offer the sensitivity needed to achieve solid detections and possibly\nspectra. In view of future observational advances, we explored the expected\nemission above 10 GeV from XRBs, based on the Cheng & Ruderman model, where\ngamma-ray photons are produced by the decay of pion-0 originated by protons\naccelerated in the magnetosphere of an accreting pulsar fed by an accretion\ndisc. We improved this model by considering, through Monte Carlo simulations,\nthe development of cascades inside of and outside the accretion disc, taking\ninto account pair and photon production processes that involve interaction with\nnuclei, X-ray photons from the accretion disc, and the magnetic field. We\nproduced grids of solutions for different input parameter values of the X-ray\nluminosity (L_x), magnetic field strength (B), and for different properties of\nthe region where acceleration occurs. We found that the gamma-ray luminosity\nspans more than five orders of magnitude, with a maximum of ~1E35 erg/s. The\ngamma-ray spectra show a large variety of shapes: some have most of the\nemission below ~100 GeV, others are harder (emission up to 10-100 TeV). We\ncompared our results with Fermi/LAT and VERITAS detections and upper-limits of\ntwo HMXBs: A0535+26 and GROJ1008-57. More consequential comparisons will be\npossible when more sensitive instruments will be operational in the coming\nyears.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:30:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ducci","L.",""],["Romano","P.",""],["Vercellone","S.",""],["Santangelo","A.",""]]}
{"id":"2308.06062","submitter":"Eric Breard","authors":"Eric C. P Breard, Luke Fullard and Josef Dufek","title":"The Rheology of Granular Mixtures with Varying Size, Density, Particle\n  Friction and Flow Geometry","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Employing the discrete element method, we study the rheology of dense\ngranular media mixtures, varying in size, density, and frictional properties of\nparticles, across a spectrum from quasi-static to inertial regimes. By\naccounting for the volumetric contribution of each solid phase, we find that\nthe stress ratio, $\\mu$, and concentration $\\phi$, scale with the inertial\nnumber when using volume averaging to calculate mean particle density, friction\nand size. Moreover, the critical packing fraction correlates with skewness,\npolydispersity, and particle friction, irrespective of the size distribution.\nNotably, following the work of Kim and Kamrin [2020] we introduce a rheological\npower-law scaling to collapse all or monodisperse and polydisperse data,\nreliant on concentration, dimensionless granular temperature, and the inertial\nnumber. This model seamlessly merges the $\\mu(I)$-rheology and Kinetic Theory,\nenabling the unification of all local and non-local rheology data onto a single\nmaster curve.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:34:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Breard","Eric C. P",""],["Fullard","Luke",""],["Dufek","Josef",""]]}
{"id":"2308.06063","submitter":"Ramakrishna Appicharla","authors":"Ramakrishna Appicharla, Baban Gain, Santanu Pal and Asif Ekbal","title":"A Case Study on Context Encoding in Multi-Encoder based Document-Level\n  Neural Machine Translation","comments":"Accepted to MT Summit 2023 (oral)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies have shown that the multi-encoder models are agnostic to the\nchoice of context, and the context encoder generates noise which helps improve\nthe models in terms of BLEU score. In this paper, we further explore this idea\nby evaluating with context-aware pronoun translation test set by training\nmulti-encoder models trained on three different context settings viz, previous\ntwo sentences, random two sentences, and a mix of both as context.\nSpecifically, we evaluate the models on the ContraPro test set to study how\ndifferent contexts affect pronoun translation accuracy. The results show that\nthe model can perform well on the ContraPro test set even when the context is\nrandom. We also analyze the source representations to study whether the context\nencoder generates noise. Our analysis shows that the context encoder provides\nsufficient information to learn discourse-level information. Additionally, we\nobserve that mixing the selected context (the previous two sentences in this\ncase) and the random context is generally better than the other settings.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:35:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Appicharla","Ramakrishna",""],["Gain","Baban",""],["Pal","Santanu",""],["Ekbal","Asif",""]]}
{"id":"2308.06064","submitter":"Shuang Zhang","authors":"Shuang Zhang, Wanming Hao, Gangcan Sun, Chongwen Huang, Zhengyu Zhu,\n  Xingwang Li, Chau Yuen","title":"Joint Beamforming Optimization for Active STAR-RIS Assisted ISAC systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate an active simultaneously transmitting and\nreflecting reconfigurable intelligent surface (STAR-RIS) assisted integrated\nsensing and communications (ISAC) system, in which a dual-function base station\n(DFBS) equipped with multiple antennas provides communication services for\nmultiple users with the assistance of an active STARRIS and performs target\nsensing simultaneously. Through optimizing both the DFBS and STAR-RIS\nbeamforming jointly under different work modes, our purpose is to achieve the\nmaximized communication sum rate, subject to the minimum radar signal-to-noise\nratio (SNR) constraint, active STAR-RIS hardware constraints, and total power\nconstraint of DFBS and active STAR-RIS. To solve the non-convex optimization\nproblem formulated, an efficient alternating optimization algorithm is\nproposed. Specifically, the fractional programming scheme is first leveraged to\nturn the original problem into a structure with more tractable, and\nsubsequently the transformed problem is decomposed into multiple sub-problems.\nNext, we develop a derivation method to obtain the closed expression of the\nradar receiving beamforming, and then the DFBS transmit beamforming is\noptimized under the radar SNR requirement and total power constraint. After\nthat, the active STAR-RIS reflection and transmission beamforming are optimized\nby majorization minimiation, complex circle manifold and convex optimization\ntechniques. Finally, the proposed schemes are conducted through numerical\nsimulations to show their benefits and efficiency.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:43:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Shuang",""],["Hao","Wanming",""],["Sun","Gangcan",""],["Huang","Chongwen",""],["Zhu","Zhengyu",""],["Li","Xingwang",""],["Yuen","Chau",""]]}
{"id":"2308.06065","submitter":"Antoine Tordeux","authors":"Mohcine Chraibi, Andreas Schadschneider and Antoine Tordeux","title":"Social distancing and the future of pedestrian dynamics","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many countries have introduced social distancing rules during the COVID-19\npandemic in order to reduce spreading of the virus in public spaces. This has\ninspired research on pedestrian dynamics in more ways than just one. Many\nstudies have been performed, not only to determine the effectiveness of such\nmeasures, but also in order to understand its effects on crowd dynamics in\ngeneral. In this Perspective article, we reflect on the insights derived from\nthese investigations and their relevance for future advancements in the field\nof pedestrian dynamics. This includes impacts on safety regulations and the\npotential for new theoretical and experimental approaches which may hold\nrelevance even beyond applied restrictions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:01:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chraibi","Mohcine",""],["Schadschneider","Andreas",""],["Tordeux","Antoine",""]]}
{"id":"2308.06066","submitter":"Kevin Heng","authors":"Kevin Heng","title":"The Transient Outgassed Atmosphere of 55 Cancri e","comments":"7 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The enigmatic nature of 55 Cancri e has defied theoretical explanation. Any\nexplanation needs to account for the observed variability of its secondary\neclipse depth, which is at times consistent with zero in the visible/optical\nrange of wavelengths -- a phenomenon that does not occur with its also variable\ninfrared eclipses. Yet, despite this variability its transit depth remains\nsomewhat constant in time and is inconsistent with opaque material filling its\nHill sphere. The current study explores the possibility of a thin, transient,\nsecondary atmosphere on 55 Cancri e that is sourced by geochemical outgassing.\nIts transient nature derives from the inability of outgassing to be balanced by\natmospheric escape. As the outgassed atmosphere escapes and is replenished, it\nrapidly adjusts to radiative equilibrium and the temperature fluctuations cause\nthe infrared eclipse depths to vary. Atmospheres of pure carbon dioxide or\ncarbon monoxide produce sufficient Rayleigh scattering to explain the observed\noptical/visible eclipse depths, which vanish in the absence of an atmosphere\nand the presence of a dark rocky surface. Atmospheres of pure methane are ruled\nout because they produce insufficient Rayleigh scattering. Upcoming\nobservations by the James Webb Space Telescope will potentially allow the\natmospheric temperature and surface pressure, as well as the surface\ntemperature, to be measured.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:02:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Heng","Kevin",""]]}
{"id":"2308.06067","submitter":"Themistoklis Sidiropoulos","authors":"T. P.H. Sidiropoulos, N. Di Palo, D.E. Rivas, A. Summers, S. Severino,\n  M. Reduzzi, J. Biegert","title":"Enhanced optical conductivity and many-body effects in strongly-driven\n  photo-excited semi-metallic graphite","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 excitation of quasi-particles near the extrema of the electronic band\nstructure is a gateway to electronic phase transitions in condensed matter. In\na many-body system, quasi-particle dynamics are strongly influenced by the\nelectronic single-particle structure and have been extensively studied in the\nweak optical excitation regime. Yet, under strong optical excitation, where\nlight fields coherently drive carriers, the dynamics of many-body interactions\nthat can lead to new quantum phases remain largely unresolved. Here, we induce\nsuch a highly non-equilibrium many-body state through strong optical excitation\nof charge carriers near the van Hove singularity in graphite. We investigate\nthe system's evolution into a strongly-driven photo-excited state with\nattosecond soft X-ray core-level spectroscopy. Surprisingly, we find an\nenhancement of the optical conductivity of nearly ten times the quantum\nconductivity and pinpoint it to carrier excitations in flat bands. This\ninteraction regime is robust against carrier-carrier interaction with coherent\noptical phonons acting as an attractive force reminiscent of superconductivity.\nThe strongly-driven non-equilibrium state is markedly different from the\nsingle-particle structure and macroscopic conductivity and is a consequence of\nthe non-adiabatic many-body state.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:02:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sidiropoulos","T. P. H.",""],["Di Palo","N.",""],["Rivas","D. E.",""],["Summers","A.",""],["Severino","S.",""],["Reduzzi","M.",""],["Biegert","J.",""]]}
{"id":"2308.06068","submitter":"Thi Phuong Thao Nguyen","authors":"Thi Phuong Thao Nguyen and Kunihiko Yamauchi","title":"Goodenough-Kanamori-Anderson rules in 2D magnet: A chemical trend in\n  MCl2 with M=V, Mn, and Ni","comments":"6 pages, 5 figures, submitted for publication","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":"  Density-functional-theory calculations were performed to investigate the\nmagnetism in a series of triangular-lattice monolayer MCl2 (M=V, Mn, and Ni).\nThe magnetic stability manifests a distinct chemical trend; VCl2 and MnCl2 show\nthe antiferromagnetic ground states and NiCl2 shows the ferromagnetic ground\nstate. The microscopic mechanism behind the magnetic interaction is explained\nby the so-called Goodenough-Kanamori-Anderson rules and by the virtual-hopping\nprocess through the hopping integrals between the 3d-orbital maximally\nlocalized Wannier functions. Our result highlights the role of the direct\nexchange interaction and the superexchange interaction in the magnetic\nstabilization in two-dimensional magnets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:04:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Nguyen","Thi Phuong Thao",""],["Yamauchi","Kunihiko",""]]}
{"id":"2308.06069","submitter":"Chih-Hong Cheng","authors":"Chih-Hong Cheng, Venkatesh Prasad Venkataramanan, Pragya Kirti Gupta,\n  Yun-Fei Hsu, Simon Burton","title":"Safeguarding Learning-based Control for Smart Energy Systems with\n  Sampling Specifications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG cs.LO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study challenges using reinforcement learning in controlling energy\nsystems, where apart from performance requirements, one has additional safety\nrequirements such as avoiding blackouts. We detail how these safety\nrequirements in real-time temporal logic can be strengthened via discretization\ninto linear temporal logic (LTL), such that the satisfaction of the LTL\nformulae implies the satisfaction of the original safety requirements. The\ndiscretization enables advanced engineering methods such as synthesizing\nshields for safe reinforcement learning as well as formal verification, where\nfor statistical model checking, the probabilistic guarantee acquired by LTL\nmodel checking forms a lower bound for the satisfaction of the original\nreal-time safety requirements.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:09:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cheng","Chih-Hong",""],["Venkataramanan","Venkatesh Prasad",""],["Gupta","Pragya Kirti",""],["Hsu","Yun-Fei",""],["Burton","Simon",""]]}
{"id":"2308.06070","submitter":"Christian Reiher","authors":"Tomasz {\\L}uczak, Joanna Polcyn, and Christian Reiher","title":"The next case of Andr\\'asfai's conjecture","comments":"Dedicated to the memory of Vera T. S\\'os","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathrm{ex}(n,s)$ denote the maximum number of edges in a triangle-free\ngraph on $n$ vertices which contains no independent sets larger than $s$. The\nbehaviour of $\\mathrm{ex}(n,s)$ was first studied by Andr\\'asfai, who\nconjectured that for $s>n/3$ this function is determined by appropriately\nchosen blow-ups of so called Andr\\'asfai graphs. Moreover, he proved\n$\\mathrm{ex}(n, s)=n^2-4ns+5s^2$ for $s/n\\in [2/5, 1/2]$ and in earlier work we\nobtained $\\mathrm{ex}(n, s)=3n^2-15ns+20s^2$ for $s/n\\in [3/8, 2/5]$. Here we\nmake the next step in the quest to settle Andr\\'asfai's conjecture by proving\n$\\mathrm{ex}(n, s)=6n^2-32ns+44s^2$ for $s/n\\in [4/11, 3/8]$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:11:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["\u0141uczak","Tomasz",""],["Polcyn","Joanna",""],["Reiher","Christian",""]]}
{"id":"2308.06071","submitter":"Tobias Dornheim","authors":"Tobias Dornheim and Panagiotis Tolias and Simon Groth and Zhandos\n  Moldabekov and Jan Vorberger and Barak Hirshberg","title":"Fermionic physics from ab initio path integral Monte Carlo simulations\n  of fictitious identical particles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.stat-mech physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The \\emph{ab initio} path integral Monte Carlo (PIMC) method is one of the\nmost successful methods in statistical physics, quantum chemistry and related\nfields, but its application to quantum degenerate Fermi systems is severely\nhampered by an exponential computational bottleneck: the notorious fermion sign\nproblem. Very recently, Xiong and Xiong [J. Chem. Phys. 157, 094112 (2022)]\nhave suggested to partially circumvent the sign problem by carrying out PIMC\nsimulations of fictitious systems which contain an interpolating continuous\nvariable $\\xi\\in[-1,1]$ in their partition function, with the physical Fermi-\nand Bose-statistics corresponding to the endpoint limits $\\xi=-1$ and $\\xi=1$.\nIt has been proposed that thermodynamic information about the fermionic limit\nmight be obtained by path integral calculations within the bosonic sector\n$\\xi>0$ combined with a quadratic $\\xi$ extrapolation throughout the fermionic\nsector $\\xi<0$, essentially bypassing the sign problem. In this work, we show\nhow the inclusion of the artificial parameter $\\xi$ can be interpreted as an\neffective penalty on the formation of permutation cycles in the PIMC\nsimulation. We empirically demonstrate that the proposed extrapolation method\nbreaks down for moderate to high quantum degeneracy. Instead, the method\nconstitutes a valuable tool for the description of large Fermi-systems of weak\nquantum degeneracy. This is demonstrated for electrons in a 2D harmonic trap\nand for the archetypal uniform electron gas (UEG), where we find excellent\nagreement ($\\sim0.5\\%$) with exact configuration PIMC results in the\nhigh-density regime while attaining a speed-up exceeding eleven orders of\nmagnitude. Finally, we extend the idea beyond the energy and analyze the radial\ndensity distribution (2D trap), as well as the static structure factor and\nimaginary-time density-density correlation function (UEG).\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:22:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dornheim","Tobias",""],["Tolias","Panagiotis",""],["Groth","Simon",""],["Moldabekov","Zhandos",""],["Vorberger","Jan",""],["Hirshberg","Barak",""]]}
{"id":"2308.06072","submitter":"Julia Hornauer","authors":"Julia Hornauer and Adrian Holzbock and Vasileios Belagiannis","title":"Out-of-Distribution Detection for Monocular Depth Estimation","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":"  In monocular depth estimation, uncertainty estimation approaches mainly\ntarget the data uncertainty introduced by image noise. In contrast to prior\nwork, we address the uncertainty due to lack of knowledge, which is relevant\nfor the detection of data not represented by the training distribution, the\nso-called out-of-distribution (OOD) data. Motivated by anomaly detection, we\npropose to detect OOD images from an encoder-decoder depth estimation model\nbased on the reconstruction error. Given the features extracted with the fixed\ndepth encoder, we train an image decoder for image reconstruction using only\nin-distribution data. Consequently, OOD images result in a high reconstruction\nerror, which we use to distinguish between in- and out-of-distribution samples.\nWe built our experiments on the standard NYU Depth V2 and KITTI benchmarks as\nin-distribution data. Our post hoc method performs astonishingly well on\ndifferent models and outperforms existing uncertainty estimation approaches\nwithout modifying the trained encoder-decoder depth estimation model.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:25:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hornauer","Julia",""],["Holzbock","Adrian",""],["Belagiannis","Vasileios",""]]}
{"id":"2308.06073","submitter":"Taekoo Oh","authors":"Taekoo Oh and Naoto Nagaosa","title":"Emergent inductance from spin fluctuations in strongly correlated\n  magnets","comments":"17 pages, 14 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":"  Recently, the intriguing phenomenon of emergent inductance has been\ntheoretically proposed and experimentally observed in nanoscale spiral spin\nsystems subjected to oscillating currents. Building upon these recent\ndevelopments, we put forward the concept of emergent inductance in strongly\ncorrelated magnets in the normal state with spin fluctuations. It is argued\nthat the inductance shows a positive peak at temperatures above the ordering\ntemperature. As for the frequency dependence, in systems featuring a\nsingle-band structure or a gapped multi-band, we observe a Drude-type, while in\ngapless multi-band systems, a non-Drude inductance with a sharp dip near zero\nfrequency. These results offer valuable insights into the behavior of strongly\ncorrelated magnets and open up new possibilities for harnessing emergent\ninductance in practical applications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:25:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Oh","Taekoo",""],["Nagaosa","Naoto",""]]}
{"id":"2308.06074","submitter":"Jeison Fischer","authors":"Thomas Michely, Jason Bergelt, Affan Safeer, Alexander B\\\"ader, Tobias\n  Hartl, Jeison Fischer","title":"Growth of aligned and twisted hexagonal boron nitride on Ir(110)","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-sa/4.0/","abstract":"  The growth of monolayer hexagonal boron nitride (h-BN) on Ir(110) through\nlow-pressure chemical vapor deposition is investigated using low energy\nelectron diffraction and scanning tunneling microscopy. We find that the growth\nof aligned single hexagonal boron nitride on Ir(110) requires a growth\ntemperature of 1500 K, whereas lower growth temperatures result in coexistence\nof aligned h-BN with twisted h-BN The presence of the h-BN overlayer suppresses\nthe formation of the nano-faceted ridge pattern known from clean Ir(110).\nInstead, we observe the formation of a (1 $\\times$ n) reconstruction, with n\nsuch that the missing rows are in registry with the h-BN/Ir(110) moir\\'{e}\npattern. Our moir\\'{e} analysis showcases a precise methodology for determining\nboth the moir\\'{e} periodicity and the h-BN lattice parameter on an fcc(110)\nsurface.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:28:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Michely","Thomas",""],["Bergelt","Jason",""],["Safeer","Affan",""],["B\u00e4der","Alexander",""],["Hartl","Tobias",""],["Fischer","Jeison",""]]}
{"id":"2308.06075","submitter":"Matteo Cozzi","authors":"Carlo Alberto Antonini, Matteo Cozzi","title":"Global gradient regularity and a Hopf lemma for quasilinear operators of\n  mixed local-nonlocal type","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address some regularity issues for mixed local-nonlocal quasilinear\noperators modeled upon the sum of a $p$-Laplacian and of a fractional $(s,\nq)$-Laplacian. Under suitable assumptions on the right-hand sides and the outer\ndata, we show that weak solutions of the Dirichlet problem are $C^{1,\n\\theta}$-regular up to the boundary. In addition, we establish a Hopf type\nlemma for positive supersolutions. Both results hold assuming the boundary of\nthe reference domain to be merely of class $C^{1, \\alpha}$, while for the\nregularity result we also require that $p > s q$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:28:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Antonini","Carlo Alberto",""],["Cozzi","Matteo",""]]}
{"id":"2308.06076","submitter":"Haoyu Wang","authors":"Haoyu Wang, Haozhe Wu, Junliang Xing, Jia Jia","title":"Versatile Face Animator: Driving Arbitrary 3D Facial Avatar in RGBD\n  Space","comments":"Accepted by ACM MM2023","journal-ref":null,"doi":"10.1145/3581783.3612065","report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Creating realistic 3D facial animation is crucial for various applications in\nthe movie production and gaming industry, especially with the burgeoning demand\nin the metaverse. However, prevalent methods such as blendshape-based\napproaches and facial rigging techniques are time-consuming, labor-intensive,\nand lack standardized configurations, making facial animation production\nchallenging and costly. In this paper, we propose a novel self-supervised\nframework, Versatile Face Animator, which combines facial motion capture with\nmotion retargeting in an end-to-end manner, eliminating the need for\nblendshapes or rigs. Our method has the following two main characteristics: 1)\nwe propose an RGBD animation module to learn facial motion from raw RGBD videos\nby hierarchical motion dictionaries and animate RGBD images rendered from 3D\nfacial mesh coarse-to-fine, enabling facial animation on arbitrary 3D\ncharacters regardless of their topology, textures, blendshapes, and rigs; and\n2) we introduce a mesh retarget module to utilize RGBD animation to create 3D\nfacial animation by manipulating facial mesh with controller transformations,\nwhich are estimated from dense optical flow fields and blended together with\ngeodesic-distance-based weights. Comprehensive experiments demonstrate the\neffectiveness of our proposed framework in generating impressive 3D facial\nanimation results, highlighting its potential as a promising solution for the\ncost-effective and efficient production of facial animation in the metaverse.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:29:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Haoyu",""],["Wu","Haozhe",""],["Xing","Junliang",""],["Jia","Jia",""]]}
{"id":"2308.06077","submitter":"Marija Sakota","authors":"Marija \\v{S}akota, Maxime Peyrard, Robert West","title":"Fly-Swat or Cannon? Cost-Effective Language Model Choice via\n  Meta-Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative language models (LMs) have become omnipresent across data science.\nFor a wide variety of tasks, inputs can be phrased as natural language prompts\nfor an LM, from whose output the solution can then be extracted. LM performance\nhas consistently been increasing with model size - but so has the monetary cost\nof querying the ever larger models. Importantly, however, not all inputs are\nequally hard: some require larger LMs for obtaining a satisfactory solution,\nwhereas for others smaller LMs suffice. Based on this fact, we design a\nframework for Cost-Effective Language Model Choice (CELMOC). Given a set of\ninputs and a set of candidate LMs, CELMOC judiciously assigns each input to an\nLM predicted to do well on the input according to a so-called meta-model,\naiming to achieve high overall performance at low cost. The cost-performance\ntrade-off can be flexibly tuned by the user. Options include, among others,\nmaximizing total expected performance (or the number of processed inputs) while\nstaying within a given cost budget, or minimizing total cost while processing\nall inputs. We evaluate CELMOC on 14 datasets covering five natural language\ntasks, using four candidate LMs of vastly different size and cost. With CELMOC,\nwe match the performance of the largest available LM while achieving a cost\nreduction of 63%. Via our publicly available library, researchers as well as\npractitioners can thus save large amounts of money without sacrificing\nperformance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:29:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["\u0160akota","Marija",""],["Peyrard","Maxime",""],["West","Robert",""]]}
{"id":"2308.06078","submitter":"Raghunath Sahoo","authors":"Debadatta Behera, Suman Deb, Captain R. Singh, and Raghunath Sahoo","title":"Demystifying the nature of nuclear modification factor for upcoming O-O\n  collisions at LHC energies using a transport model","comments":"9 pages and 10 captioned figures, submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The present work focuses on Oxygen-Oxygen (O-O) collisions, which are planned\nat the CERN Large Hadron Collider. Oxygen, being a doubly magic number nucleus,\nhas some very unique features. This study attempts to probe the exotic state of\nQCD matter in O-O collisions. Additionally, the role of different nuclear\ndensity profiles in governing the final state dynamics in ultra-relativistic\nnuclear collisions is also explored. Using a multi-phase transport (AMPT)\nmodel, we obtain the nuclear modification factor ($\\rm R_{\\rm AA}$ ) for all\ncharged hadrons and identified particles for O-O collisions at\n$\\sqrt{s_{\\rm{NN}}}$ = 7 TeV. Furthermore, we investigate the behavior of $\\rm\nR_{\\rm AA}$ as a function of transverse momentum ($\\rm p_{\\rm T}$) for three\ncentralities (most-central, mid-central, and peripheral) considering both\n$\\alpha$-cluster and Woods-Saxon nuclear density profiles. We also extend this\nwork to study the rapidity dependence of $\\rm R_{\\rm AA}$ for all charged\nhadrons. To better under our findings of O-O collisions, the results are\nconfronted with the available data of $\\rm R_{\\rm AA}$ for Pb-Pb collisions.\nThe present study sheds light on particle production mechanisms, emphasizing\nfactors influencing particle yield from pre-collision to post-collision stages\nin the context of O-O collisions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:31:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Behera","Debadatta",""],["Deb","Suman",""],["Singh","Captain R.",""],["Sahoo","Raghunath",""]]}
{"id":"2308.06079","submitter":"Jan M. L. Martin","authors":"Emmanouil Semdalas and Jan M. L. Martin","title":"Can G4-like Composite Ab Initio Methods Accurately Predict Vibrational\n  Harmonic Frequencies?","comments":"submitted to Mol. Phys. [Timothy J. Lee memorial issue]","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Minimally empirical G4-like composite wavefunction theories [E. Semidalas and\nJ. M. L. Martin, \\textit{J. Chem. Theory Comput.} {\\bf 16}, 4238-4255 and\n7507-7524 (2020)] trained against the large and chemically diverse GMTKN55\nbenchmark suite have demonstrated both accuracy and cost-effectiveness in\npredicting thermochemistry, barrier heights, and noncovalent interaction\nenergies. Here, we assess the spectroscopic accuracy of top-performing methods:\nG4-\\textit{n}, cc-G4-\\textit{n}, and G4-\\textit{n}-F12, and validate them\nagainst explicitly correlated coupled cluster CCSD(T*)(F12*) harmonic\nvibrational frequencies and experimental data from the HFREQ2014 dataset, of\nsmall first- and second-row polyatomics. G4-T is three times more accurate than\nplain CCSD(T)/def2-TZVP, while G4-T$_{\\rm ano}$ is two times superior to\nCCSD(T)/ano-pVTZ. Combining CCSD(T)/ano-pVTZ with MP2-F12 in a parameter-free\ncomposite scheme results to a root-mean-square deviation of ~5 cm$^{-1}$\nrelative to experiment, comparable to CCSD(T) at the complete basis set limit.\nApplication to the harmonic frequencies of benzene reveals a significant\nadvantage of composites with ANO basis sets -- MP2/ano-pV\\textit{m}Z and\n[CCSD(T)-MP2]/ano-pVTZ (\\textit{m} = Q or 5) -- over similar protocols based on\nCCSD(T)/def2-TZVP. Overall, G4-type composite energy schemes, particularly when\ncombined with ANO basis sets in CCSD(T), are accurate and comparatively\ninexpensive tools for computational vibrational spectroscopy.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:33:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Semdalas","Emmanouil",""],["Martin","Jan M. L.",""]]}
{"id":"2308.06080","submitter":"Shimeles Terefe Mengistue Mr.","authors":"Shimeles Terefe, Ascensi\\'on Del Olmo, Paola Marziani, Mirjana\n  Povi\\'c, Mar\\'ia Angeles Mart\\'inez-Carballo, Jaime Perea, and Isabel\n  M\\'arquez","title":"Optical and near-UV spectroscopic properties of low-redshift jetted\n  quasars in the main sequence context","comments":"The paper has been accepted for publishing in MNRAS. Has 26 pages and\n  59 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents new optical and near-UV spectra of 11 extremely powerful\njetted quasars, with radio to optical flux density ratio $>$ 10$^3$, that\nconcomitantly cover the low-ionization emission of \\mgii\\ and \\hb\\ as well as\nthe \\feii\\ blends in the redshift range $0.35 \\lesssim z \\lesssim 1$. We aim to\nquantify broad emission line differences between radio-loud (RL) and\nradio-quiet (RQ) quasars by using the 4D eigenvector 1 parameter space and its\nMain Sequence (MS) and to check the effect of powerful radio ejection on the\nlow ionization broad emission lines. The \\hb\\ and \\mgii\\ emission lines were\nmeasured by using non-linear multicomponent fittings as well as by analysing\ntheir full profile. We found that broad emission lines show large redward\nasymmetry both in \\hb\\ and \\mgii. The location of our RL sources in a UV plane\nlooks similar to the optical one, with weak \\feiiuv\\ emission and broad \\mgii.\nWe supplement the 11 sources with large samples from previous work to gain some\ngeneral inferences. We found that, compared to RQ, our extreme RL quasars show\nlarger median \\hb\\ full width at half maximum (FWHM), weaker \\feii\\ emission,\nlarger \\mbh, lower \\lledd, and a restricted bf space occupation in the optical\nand UV MS planes. The differences are more elusive when the comparison is\ncarried out by restricting the RQ population to the region of the MS occupied\nby RL sources, albeit an unbiased comparison matching \\mbh\\ and \\lledd\\\nsuggests that the most powerful RL quasars show the highest redward asymmetries\nin \\hb.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:40:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Terefe","Shimeles",""],["Del Olmo","Ascensi\u00f3n",""],["Marziani","Paola",""],["Povi\u0107","Mirjana",""],["Mart\u00ednez-Carballo","Mar\u00eda Angeles",""],["Perea","Jaime",""],["M\u00e1rquez","Isabel",""]]}
{"id":"2308.06081","submitter":"Alexandre Krajenbrink","authors":"Ismail Yunus Akhalwaya, Adam Connolly, Roland Guichard, Steven\n  Herbert, Cahit Kargi, Alexandre Krajenbrink, Michael Lubasch, Conor Mc\n  Keever, Julien Sorci, Michael Spranger, Ifan Williams","title":"A Modular Engine for Quantum Monte Carlo Integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present the Quantum Monte Carlo Integration (QMCI) engine developed by\nQuantinuum. It is a quantum computational tool for evaluating multi-dimensional\nintegrals that arise in various fields of science and engineering such as\nfinance. This white paper presents a detailed description of the architecture\nof the QMCI engine, including a variety of distribution-loading methods, a\nnovel quantum amplitude estimation method that improves the statistical\nrobustness of QMCI calculations, and a library of statistical quantities that\ncan be estimated. The QMCI engine is designed with modularity in mind, allowing\nfor the continuous development of new quantum algorithms tailored in particular\nto financial applications. Additionally, the engine features a resource mode,\nwhich provides a precise resource quantification for the quantum circuits\ngenerated. The paper also includes extensive benchmarks that showcase the\nengine's performance, with a focus on the evaluation of various financial\ninstruments.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:42:33 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Akhalwaya","Ismail Yunus",""],["Connolly","Adam",""],["Guichard","Roland",""],["Herbert","Steven",""],["Kargi","Cahit",""],["Krajenbrink","Alexandre",""],["Lubasch","Michael",""],["Keever","Conor Mc",""],["Sorci","Julien",""],["Spranger","Michael",""],["Williams","Ifan",""]]}
{"id":"2308.06082","submitter":"Manish Kumar","authors":"Manish Kumar","title":"Security of XCB and HCTR","comments":"M.Tech Dissertation. Indian Statistical Institute, Kolkata, July 2018","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tweakable Enciphering Scheme (TES) is a length preserving scheme which\nprovides confidentiality and admissible integrity. XCB (Extended Code Book) is\na TES which was introduced in 2004. In 2007, it was modified and security bound\nwas provided. Later, these two versions were referred to as XCBv1 and XCBv2\nrespectively. XCBv2 was proposed as the IEEE-std 1619.2 2010 for encryption of\nsector oriented storage media. In 2013, first time Security bound of XCBv1 was\ngiven and XCBv2's security bound was enhanced. A constant of $2^{22}$ appears\nin the security bounds of the XCBv1 and XCBv2.\n  We showed that this constant of $2^{22}$ can be reduced to $2^{5}$. Further,\nwe modified the XCB (MXCB) scheme such that it gives better security bound\ncompared to the present XCB scheme. We also analyzed some weak keys attack on\nXCB and a type of TES known as HCTR (proposed in 2005). We performed\ndistinguishing attack and the hash key recovery attack on HCTR. Next, we\nanalyzed the dependency of the two different keys in HCTR.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:45:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kumar","Manish",""]]}
{"id":"2308.06083","submitter":"Bogdan Matioc","authors":"Joachim Escher, Anca-Voichita Matioc, Bogdan-Vasile Matioc","title":"The Mullins-Sekerka problem via the method of potentials","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that the two-dimensional Mullins-Sekerka problem is well-posed in\nall subcritical Sobolev spaces $H^r(\\mathbb{R})$ with $r\\in(3/2,2).$ This is\nthe first result where this issue is established in an unbounded geometry. The\nnovelty of our approach is the use of potential theory to formulate the model\nas an evolution problem with nonlinearities expressed by singular integral\noperators.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:46:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Escher","Joachim",""],["Matioc","Anca-Voichita",""],["Matioc","Bogdan-Vasile",""]]}
{"id":"2308.06084","submitter":"Alice C. Quillen","authors":"A. C. Quillen, Nathan Skerrett","title":"Generating quantum channels from functions on discrete sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Using the recent ability of quantum computers to initialize quantum states\nrapidly with high fidelity, we use a function operating on a discrete set to\ncreate a simple class of quantum channels. Fixed points and periodic orbits,\nthat are present in the function, generate fixed points and periodic orbits in\nthe associated quantum channel. Phenomenology such as periodic doubling is\nvisible in a 6 qubit dephasing channel constructed from a truncated version of\nthe logistic map. Using disjoint subsets, discrete function-generated channels\ncan be constructed that preserve coherence within subspaces. Error correction\nprocedures can be in this class as syndrome detection uses an initialized\nquantum register. A possible application for function-generated channels is in\nhybrid classical/quantum algorithms. We illustrate how these channels can aid\nin carrying out classical computations involving iteration of non-invertible\nfunctions on a quantum computer with the Euclidean algorithm for finding the\ngreatest common divisor of two integers.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:47:10 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 16:41:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Quillen","A. C.",""],["Skerrett","Nathan",""]]}
{"id":"2308.06085","submitter":"Jinqiang Chen","authors":"Jinqiang Chen, Vandana Dwarka, Cornelis Vuik","title":"A matrix-free parallel solution method for the three-dimensional\n  heterogeneous Helmholtz equation","comments":"25 pages, 15 figures, manuscript submitted to a special issue of\n  conference NMLSP2022","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Helmholtz equation is related to seismic exploration, sonar, antennas,\nand medical imaging applications. It is one of the most challenging problems to\nsolve in terms of accuracy and convergence due to the scalability issues of the\nnumerical solvers. For 3D large-scale applications, high-performance parallel\nsolvers are also needed. In this paper, a matrix-free parallel iterative solver\nis presented for the three-dimensional (3D) heterogeneous Helmholtz equation.\nWe consider the preconditioned Krylov subspace methods for solving the linear\nsystem obtained from finite-difference discretization. The Complex Shifted\nLaplace Preconditioner (CSLP) is employed since it results in a linear increase\nin the number of iterations as a function of the wavenumber. The preconditioner\nis approximately inverted using one parallel 3D multigrid cycle. For parallel\ncomputing, the global domain is partitioned blockwise. The matrix-vector\nmultiplication and preconditioning operator are implemented in a matrix-free\nway instead of constructing large, memory-consuming coefficient matrices.\nNumerical experiments of 3D model problems demonstrate the robustness and\noutstanding strong scaling of our matrix-free parallel solution method.\nMoreover, the weak parallel scalability indicates our approach is suitable for\nrealistic 3D heterogeneous Helmholtz problems with minimized pollution error.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:48:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Jinqiang",""],["Dwarka","Vandana",""],["Vuik","Cornelis",""]]}
{"id":"2308.06086","submitter":"Priyanshi Sinha","authors":"Priyanshi Sinha (for the STAR Collaboration)","title":"Probing nuclear structure using elliptic flow of strange and\n  multi-strange hadrons in isobar collisions","comments":"Submitted in proceeding for DAE-HEP 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Isobar collisions, $^{96}_{44}$Ru+$^{96}_{44}$Ru and\n$^{96}_{40}$Zr+$^{96}_{40}$Zr, at $\\sqrt{s_{\\mathrm {NN}}}$ = 200 GeV have been\nperformed at RHIC in order to study the charge separation along the magnetic\nfield, called the Chiral Magnetic Effect (CME). The difference in nuclear\ndeformation and structure between the two isobar nuclei may result in a\ndifference in the flow magnitudes. Hence, elliptic flow measurements for these\ncollisions give direct information about the initial state anisotropies.\nStrange and multi-strange hadrons have a small hadronic cross-section compared\nto light hadrons, making them an excellent probe for understanding the initial\nstate anisotropies of the medium produced in these isobar collisions. The\ncollected datasets include approximately two billion events for each of the\nisobar species and provide a unique opportunity for statistics hungry\nmeasurements. In this proceeding, we will report the elliptic flow ($v_{2}$)\nmeasurement of $K_{s}^{0}$, $\\Lambda$, $\\overline{\\Lambda}$, $\\phi$, $\\Xi^{-}$,\n$\\overline{\\Xi}^{+}$, $\\Omega^{-}$, and $\\overline{\\Omega}^{+}$ at mid-rapidity\nfor Ru+Ru and Zr+Zr collisions at $\\sqrt{s_{\\mathrm {NN}}}$ = 200 GeV. The\ncentrality and transverse momentum ($p_{T}$) dependence of $v_{2}$ of\n(multi-)strange hadrons will be shown. System size dependence of $v_{2}$ will\nbe shown by comparing the $v_{2}$ results obtained from Cu+Cu, Au+Au, and U+U\ncollisions. The number of constituent quark (NCQ) scaling for these strange\nhadrons will also be tested. We will also compare the $p_{T}$-integrated\n$v_{2}$ for these two isobar collisions. Transport model calculations will be\ncompared to data to provide further quantitative constraints on the nuclear\nstructure.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:51:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sinha","Priyanshi","","for the STAR Collaboration"]]}
{"id":"2308.06087","submitter":"Sung Jin Um","authors":"Sung Jin Um, Dongjin Kim, Jung Uk Kim","title":"Audio-Visual Spatial Integration and Recursive Attention for Robust\n  Sound Source Localization","comments":"Camera-Ready, ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The objective of the sound source localization task is to enable machines to\ndetect the location of sound-making objects within a visual scene. While the\naudio modality provides spatial cues to locate the sound source, existing\napproaches only use audio as an auxiliary role to compare spatial regions of\nthe visual modality. Humans, on the other hand, utilize both audio and visual\nmodalities as spatial cues to locate sound sources. In this paper, we propose\nan audio-visual spatial integration network that integrates spatial cues from\nboth modalities to mimic human behavior when detecting sound-making objects.\nAdditionally, we introduce a recursive attention network to mimic human\nbehavior of iterative focusing on objects, resulting in more accurate attention\nregions. To effectively encode spatial information from both modalities, we\npropose audio-visual pair matching loss and spatial region alignment loss. By\nutilizing the spatial cues of audio-visual modalities and recursively focusing\nobjects, our method can perform more robust sound source localization.\nComprehensive experimental results on the Flickr SoundNet and VGG-Sound Source\ndatasets demonstrate the superiority of our proposed method over existing\napproaches. Our code is available at: https://github.com/VisualAIKHU/SIRA-SSL\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 11:57:58 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 03:19:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Um","Sung Jin",""],["Kim","Dongjin",""],["Kim","Jung Uk",""]]}
{"id":"2308.06088","submitter":"Arne Bewersdorff","authors":"Arne Bewersdorff, Kathrin Se{\\ss}ler, Armin Baur, Enkelejda Kasneci,\n  Claudia Nerdel","title":"Assessing Student Errors in Experimentation Using Artificial\n  Intelligence and Large Language Models: A Comparative Study with Human Raters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Identifying logical errors in complex, incomplete or even contradictory and\noverall heterogeneous data like students' experimentation protocols is\nchallenging. Recognizing the limitations of current evaluation methods, we\ninvestigate the potential of Large Language Models (LLMs) for automatically\nidentifying student errors and streamlining teacher assessments. Our aim is to\nprovide a foundation for productive, personalized feedback. Using a dataset of\n65 student protocols, an Artificial Intelligence (AI) system based on the\nGPT-3.5 and GPT-4 series was developed and tested against human raters. Our\nresults indicate varying levels of accuracy in error detection between the AI\nsystem and human raters. The AI system can accurately identify many fundamental\nstudent errors, for instance, the AI system identifies when a student is\nfocusing the hypothesis not on the dependent variable but solely on an expected\nobservation (acc. = 0.90), when a student modifies the trials in an ongoing\ninvestigation (acc. = 1), and whether a student is conducting valid test trials\n(acc. = 0.82) reliably. The identification of other, usually more complex\nerrors, like whether a student conducts a valid control trial (acc. = .60),\nposes a greater challenge. This research explores not only the utility of AI in\neducational settings, but also contributes to the understanding of the\ncapabilities of LLMs in error detection in inquiry-based learning like\nexperimentation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:03:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Bewersdorff","Arne",""],["Se\u00dfler","Kathrin",""],["Baur","Armin",""],["Kasneci","Enkelejda",""],["Nerdel","Claudia",""]]}
{"id":"2308.06089","submitter":"Nick Bryan-Kinns","authors":"Ashley Noel-Hirst and Nick Bryan-Kinns","title":"An Autoethnographic Exploration of XAI in Algorithmic Composition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning models are capable of generating complex music across a\nrange of genres from folk to classical music. However, current generative music\nAI models are typically difficult to understand and control in meaningful ways.\nWhilst research has started to explore how explainable AI (XAI) generative\nmodels might be created for music, no generative XAI models have been studied\nin music making practice. This paper introduces an autoethnographic study of\nthe use of the MeasureVAE generative music XAI model with interpretable latent\ndimensions trained on Irish folk music. Findings suggest that the exploratory\nnature of the music-making workflow foregrounds musical features of the\ntraining dataset rather than features of the generative model itself. The\nappropriation of an XAI model within an iterative workflow highlights the\npotential of XAI models to form part of a richer and more complex workflow than\nthey were initially designed for.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:03:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Noel-Hirst","Ashley",""],["Bryan-Kinns","Nick",""]]}
{"id":"2308.06090","submitter":"Sohei Ashida","authors":"Sohei Ashida","title":"Transformation of a variational problem in the Euclidean space to that\n  of a tuple of functions on several regions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain a method to transform an minimization problem of the quadratic form\ncorresponding to the Schr\\\"odinger operator in the Euclidean space to a\nvariational problem of a tuple of functions defined on several regions. The\nmethod is based on a characterization of elements of the orthogonal complement\nof $H^1_0(\\Omega)$ in $H^1(\\Omega)$ as weak solutions to an elliptic partial\ndifferential equation on a region $\\Omega$ with a bounded boundary.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:04:18 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 13:12:09 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 02:38:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ashida","Sohei",""]]}
{"id":"2308.06091","submitter":"Seongmin Park","authors":"Seongmin Park, Mincheol Yoon, Jae-woong Lee, Hogun Park, Jongwuk Lee","title":"Toward a Better Understanding of Loss Functions for Collaborative\n  Filtering","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Collaborative filtering (CF) is a pivotal technique in modern recommender\nsystems. The learning process of CF models typically consists of three\ncomponents: interaction encoder, loss function, and negative sampling. Although\nmany existing studies have proposed various CF models to design sophisticated\ninteraction encoders, recent work shows that simply reformulating the loss\nfunctions can achieve significant performance gains. This paper delves into\nanalyzing the relationship among existing loss functions. Our mathematical\nanalysis reveals that the previous loss functions can be interpreted as\nalignment and uniformity functions: (i) the alignment matches user and item\nrepresentations, and (ii) the uniformity disperses user and item distributions.\nInspired by this analysis, we propose a novel loss function that improves the\ndesign of alignment and uniformity considering the unique patterns of datasets\ncalled Margin-aware Alignment and Weighted Uniformity (MAWU). The key novelty\nof MAWU is two-fold: (i) margin-aware alignment (MA) mitigates\nuser/item-specific popularity biases, and (ii) weighted uniformity (WU) adjusts\nthe significance between user and item uniformities to reflect the inherent\ncharacteristics of datasets. Extensive experimental results show that MF and\nLightGCN equipped with MAWU are comparable or superior to state-of-the-art CF\nmodels with various loss functions on three public datasets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:04:36 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Park","Seongmin",""],["Yoon","Mincheol",""],["Lee","Jae-woong",""],["Park","Hogun",""],["Lee","Jongwuk",""]]}
{"id":"2308.06092","submitter":"Javier del Pino","authors":"Javier del Pino, Jan Ko\\v{s}ata, Oded Zilberberg","title":"Limit cycles as stationary states of an extended Harmonic Balance ansatz","comments":"Includes Supplemental Material","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO cond-mat.mes-hall cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A limit cycle is a self-sustained periodic motion appearing in autonomous\nordinary differential equations. As the period of the limit cycle is a-priori\nunknown, it is challenging to find them as stationary states of a rotating\nansatz. Correspondingly, their study commonly relies on brute-force\ntime-evolution or on circumstantial evidence such as instabilities of fixed\npoints. Alas, such approaches are unable to account for the coexistence of\nmultiple solutions, as they rely on specific initial conditions. Here, we\ndevelop a multifrequency rotating ansatz with which we find limit cycles as\nstationary states. We demonstrate our approach and its performance in the\nsimplest case of the Van der Pol oscillator. Moving beyond the simplest\nexample, we show that our method can capture the coexistence of all fixed-point\nattractors and limit cycles in a modified nonlinear Van der Pol oscillator. Our\nresults facilitate the systematic mapping of out-of-equilibrium phase diagrams,\nwith implications across all fields of natural science.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:05:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["del Pino","Javier",""],["Ko\u0161ata","Jan",""],["Zilberberg","Oded",""]]}
{"id":"2308.06093","submitter":"Yongqi Huang","authors":"Yongqi Huang, Peng Ye, Xiaoshui Huang, Sheng Li, Tao Chen, Tong He,\n  Wanli Ouyang","title":"Experts Weights Averaging: A New General Training Scheme for Vision\n  Transformers","comments":"12 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Structural re-parameterization is a general training scheme for Convolutional\nNeural Networks (CNNs), which achieves performance improvement without\nincreasing inference cost. As Vision Transformers (ViTs) are gradually\nsurpassing CNNs in various visual tasks, one may question: if a training scheme\nspecifically for ViTs exists that can also achieve performance improvement\nwithout increasing inference cost? Recently, Mixture-of-Experts (MoE) has\nattracted increasing attention, as it can efficiently scale up the capacity of\nTransformers at a fixed cost through sparsely activated experts. Considering\nthat MoE can also be viewed as a multi-branch structure, can we utilize MoE to\nimplement a ViT training scheme similar to structural re-parameterization? In\nthis paper, we affirmatively answer these questions, with a new general\ntraining strategy for ViTs. Specifically, we decouple the training and\ninference phases of ViTs. During training, we replace some Feed-Forward\nNetworks (FFNs) of the ViT with specially designed, more efficient MoEs that\nassign tokens to experts by random uniform partition, and perform Experts\nWeights Averaging (EWA) on these MoEs at the end of each iteration. After\ntraining, we convert each MoE into an FFN by averaging the experts,\ntransforming the model back into original ViT for inference. We further provide\na theoretical analysis to show why and how it works. Comprehensive experiments\nacross various 2D and 3D visual tasks, ViT architectures, and datasets validate\nthe effectiveness and generalizability of the proposed training scheme.\nBesides, our training scheme can also be applied to improve performance when\nfine-tuning ViTs. Lastly, but equally important, the proposed EWA technique can\nsignificantly improve the effectiveness of naive MoE in various 2D visual small\ndatasets and 3D visual tasks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:05:12 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 14:30:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Huang","Yongqi",""],["Ye","Peng",""],["Huang","Xiaoshui",""],["Li","Sheng",""],["Chen","Tao",""],["He","Tong",""],["Ouyang","Wanli",""]]}
{"id":"2308.06094","submitter":"Chao Yang","authors":"Chao Yang, Lu Wang, Kun Gao, Shuang Li","title":"Reinforcement Logic Rule Learning for Temporal Point Processes","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a framework that can incrementally expand the explanatory temporal\nlogic rule set to explain the occurrence of temporal events. Leveraging the\ntemporal point process modeling and learning framework, the rule content and\nweights will be gradually optimized until the likelihood of the observational\nevent sequences is optimal. The proposed algorithm alternates between a master\nproblem, where the current rule set weights are updated, and a subproblem,\nwhere a new rule is searched and included to best increase the likelihood. The\nformulated master problem is convex and relatively easy to solve using\ncontinuous optimization, whereas the subproblem requires searching the huge\ncombinatorial rule predicate and relationship space. To tackle this challenge,\nwe propose a neural search policy to learn to generate the new rule content as\na sequence of actions. The policy parameters will be trained end-to-end using\nthe reinforcement learning framework, where the reward signals can be\nefficiently queried by evaluating the subproblem objective. The trained policy\ncan be used to generate new rules in a controllable way. We evaluate our\nmethods on both synthetic and real healthcare datasets, obtaining promising\nresults.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:05:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yang","Chao",""],["Wang","Lu",""],["Gao","Kun",""],["Li","Shuang",""]]}
{"id":"2308.06095","submitter":"Fabian Galetzka","authors":"Fabian Galetzka, Anne Beyer, David Schlangen","title":"Neural Conversation Models and How to Rein Them in: A Survey of Failures\n  and Fixes","comments":"Represents the state of the field in 2022; partially based on the\n  first authors 2022 PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent conditional language models are able to continue any kind of text\nsource in an often seemingly fluent way. This fact encouraged research in the\narea of open-domain conversational systems that are based on powerful language\nmodels and aim to imitate an interlocutor by generating appropriate\ncontributions to a written dialogue. From a linguistic perspective, however,\nthe complexity of contributing to a conversation is high. In this survey, we\ninterpret Grice's maxims of cooperative conversation from the perspective of\nthis specific research area and systematize the literature under the aspect of\nwhat makes a contribution appropriate: A neural conversation model has to be\nfluent, informative, consistent, coherent, and follow social norms. In order to\nensure these qualities, recent approaches try to tame the underlying language\nmodels at various intervention points, such as data, training regime or\ndecoding. Sorted by these categories and intervention points, we discuss\npromising attempts and suggest novel ways for future research.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:07:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Galetzka","Fabian",""],["Beyer","Anne",""],["Schlangen","David",""]]}
{"id":"2308.06096","submitter":"Mathias Garny","authors":"Michael Hartmeier, Mathias Garny","title":"Minimal Basis for Exact Time Dependent Kernels in Cosmological\n  Perturbation Theory and Application to $\\Lambda$CDM and $w_0w_a$CDM","comments":"4 figures, 40 pages + appendices","journal-ref":null,"doi":null,"report-no":"TUM-HEP-1466/23","categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive a minimal basis of kernels furnishing the perturbative expansion of\nthe density contrast and velocity divergence in powers of the initial density\nfield that is applicable to cosmological models with arbitrary expansion\nhistory, thereby relaxing the commonly adopted Einstein-de-Sitter (EdS)\napproximation. For this class of cosmological models, the non-linear kernels\nare at every order given by a sum of terms, each of which factorizes into a\ntime-dependent growth factor and a wavenumber-dependent basis function. We show\nhow to reduce the set of basis functions to a minimal amount, and give explicit\nexpressions up to order $n=5$. We find that for this minimal basis choice, each\nbasis function individually displays the expected scaling behaviour due to\nmomentum conservation, being non-trivial at $n\\geq 4$. This is a highly\ndesirable property for numerical evaluation of loop corrections. In addition,\nit allows us to match the density field to an effective field theory (EFT)\ndescription for cosmologies with an arbitrary expansion history, which we\nexplicitly derive at order four. We evaluate the differences to the EdS\napproximation for $\\Lambda$CDM and $w_0w_a$CDM, paying special attention to the\nirreducible cosmology dependence that cannot be absorbed into EFT terms for the\none-loop bispectrum. Finally, we provide algebraic recursion relations for a\nspecial generalization of the EdS approximation that retains its simplicity and\nis relevant for mixed hot and cold dark matter models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:15:38 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hartmeier","Michael",""],["Garny","Mathias",""]]}
{"id":"2308.06097","submitter":"Yangyang Xu","authors":"Yangyang Xu, Shengfeng He, Kwan-Yee K. Wong, Ping Luo","title":"RIGID: Recurrent GAN Inversion and Editing of Real Face Videos","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  GAN inversion is indispensable for applying the powerful editability of GAN\nto real images. However, existing methods invert video frames individually\noften leading to undesired inconsistent results over time. In this paper, we\npropose a unified recurrent framework, named \\textbf{R}ecurrent v\\textbf{I}deo\n\\textbf{G}AN \\textbf{I}nversion and e\\textbf{D}iting (RIGID), to explicitly and\nsimultaneously enforce temporally coherent GAN inversion and facial editing of\nreal videos. Our approach models the temporal relations between current and\nprevious frames from three aspects. To enable a faithful real video\nreconstruction, we first maximize the inversion fidelity and consistency by\nlearning a temporal compensated latent code. Second, we observe incoherent\nnoises lie in the high-frequency domain that can be disentangled from the\nlatent space. Third, to remove the inconsistency after attribute manipulation,\nwe propose an \\textit{in-between frame composition constraint} such that the\narbitrary frame must be a direct composite of its neighboring frames. Our\nunified framework learns the inherent coherence between input frames in an\nend-to-end manner, and therefore it is agnostic to a specific attribute and can\nbe applied to arbitrary editing of the same video without re-training.\nExtensive experiments demonstrate that RIGID outperforms state-of-the-art\nmethods qualitatively and quantitatively in both inversion and editing tasks.\nThe deliverables can be found in \\url{https://cnnlstm.github.io/RIGID}\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:17:24 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 13:34:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xu","Yangyang",""],["He","Shengfeng",""],["Wong","Kwan-Yee K.",""],["Luo","Ping",""]]}
{"id":"2308.06098","submitter":"Tanay Rastogi","authors":"Tanay Rastogi and M{\\aa}rten Bj\\\"orkman","title":"Automated Construction of Time-Space Diagrams for Traffic Analysis Using\n  Street-View Video Sequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Time-space diagrams are essential tools for analyzing traffic patterns and\noptimizing transportation infrastructure and traffic management strategies.\nTraditional data collection methods for these diagrams have limitations in\nterms of temporal and spatial coverage. Recent advancements in camera\ntechnology have overcome these limitations and provided extensive urban data.\nIn this study, we propose an innovative approach to constructing time-space\ndiagrams by utilizing street-view video sequences captured by cameras mounted\non moving vehicles. Using the state-of-the-art YOLOv5, StrongSORT, and\nphotogrammetry techniques for distance calculation, we can infer vehicle\ntrajectories from the video data and generate time-space diagrams. To evaluate\nthe effectiveness of our proposed method, we utilized datasets from the KITTI\ncomputer vision benchmark suite. The evaluation results demonstrate that our\napproach can generate trajectories from video data, although there are some\nerrors that can be mitigated by improving the performance of the detector,\ntracker, and distance calculation components. In conclusion, the utilization of\nstreet-view video sequences captured by cameras mounted on moving vehicles,\ncombined with state-of-the-art computer vision techniques, has immense\npotential for constructing comprehensive time-space diagrams. These diagrams\noffer valuable insights into traffic patterns and contribute to the design of\ntransportation infrastructure and traffic management strategies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:18:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rastogi","Tanay",""],["Bj\u00f6rkman","M\u00e5rten",""]]}
{"id":"2308.06099","submitter":"Eberhard Goering","authors":"Michael Miller, Rene Nacke, Sven Ilse, Gisela Sch\\\"utz, and Eberhard\n  Goering","title":"Direct determination of the spin-polarization at buried interfaces using\n  voltage dependent MOKE signals","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":"  Here we present a conceptually simple method to directly measure the\nspin-polarization at buried ferromagnet/insulator interfaces under ambient\nconditions. This has been done by applying an AC voltage across the interface\nand measuring the voltage-induced change of the longitudinal MOKE signal as a\nfunction of the applied magnetic field. A straight-forward quantitative model\nis presented, how the spin-polarization enters the VMOKE signal. For Fe and Co,\na clear positive majority spin-polarization has been identified, while Ni\nreveals a negative minority spin-polarization. This new method provides a\ndirect way to determine interfacial spin-polarizations at buried interfaces,\nwhich is one of most important key parameters in spintronics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:20:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Miller","Michael",""],["Nacke","Rene",""],["Ilse","Sven",""],["Sch\u00fctz","Gisela",""],["Goering","Eberhard",""]]}
{"id":"2308.06100","submitter":"Philipp Vaeth","authors":"Philipp Vaeth and Alexander M. Fruehwald and Benjamin Paassen and\n  Magda Gregorova","title":"Diffusion-based Visual Counterfactual Explanations -- Towards Systematic\n  Quantitative Evaluation","comments":"Accepted at the 5th International Workshop on eXplainable Knowledge\n  Discovery in Data Mining @ ECML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Latest methods for visual counterfactual explanations (VCE) harness the power\nof deep generative models to synthesize new examples of high-dimensional images\nof impressive quality. However, it is currently difficult to compare the\nperformance of these VCE methods as the evaluation procedures largely vary and\noften boil down to visual inspection of individual examples and small scale\nuser studies. In this work, we propose a framework for systematic, quantitative\nevaluation of the VCE methods and a minimal set of metrics to be used. We use\nthis framework to explore the effects of certain crucial design choices in the\nlatest diffusion-based generative models for VCEs of natural image\nclassification (ImageNet). We conduct a battery of ablation-like experiments,\ngenerating thousands of VCEs for a suite of classifiers of various complexity,\naccuracy and robustness. Our findings suggest multiple directions for future\nadvancements and improvements of VCE methods. By sharing our methodology and\nour approach to tackle the computational challenges of such a study on a\nlimited hardware setup (including the complete code base), we offer a valuable\nguidance for researchers in the field fostering consistency and transparency in\nthe assessment of counterfactual explanations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:22:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Vaeth","Philipp",""],["Fruehwald","Alexander M.",""],["Paassen","Benjamin",""],["Gregorova","Magda",""]]}
{"id":"2308.06101","submitter":"Junhong Gou","authors":"Junhong Gou, Siyu Sun, Jianfu Zhang, Jianlou Si, Chen Qian, Liqing\n  Zhang","title":"Taming the Power of Diffusion Models for High-Quality Virtual Try-On\n  with Appearance Flow","comments":"Accepted by ACMMM 2023","journal-ref":null,"doi":"10.1145/3581783.3612255","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Virtual try-on is a critical image synthesis task that aims to transfer\nclothes from one image to another while preserving the details of both humans\nand clothes. While many existing methods rely on Generative Adversarial\nNetworks (GANs) to achieve this, flaws can still occur, particularly at high\nresolutions. Recently, the diffusion model has emerged as a promising\nalternative for generating high-quality images in various applications.\nHowever, simply using clothes as a condition for guiding the diffusion model to\ninpaint is insufficient to maintain the details of the clothes. To overcome\nthis challenge, we propose an exemplar-based inpainting approach that leverages\na warping module to guide the diffusion model's generation effectively. The\nwarping module performs initial processing on the clothes, which helps to\npreserve the local details of the clothes. We then combine the warped clothes\nwith clothes-agnostic person image and add noise as the input of diffusion\nmodel. Additionally, the warped clothes is used as local conditions for each\ndenoising process to ensure that the resulting output retains as much detail as\npossible. Our approach, namely Diffusion-based Conditional Inpainting for\nVirtual Try-ON (DCI-VTON), effectively utilizes the power of the diffusion\nmodel, and the incorporation of the warping module helps to produce\nhigh-quality and realistic virtual try-on results. Experimental results on\nVITON-HD demonstrate the effectiveness and superiority of our method.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:23:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gou","Junhong",""],["Sun","Siyu",""],["Zhang","Jianfu",""],["Si","Jianlou",""],["Qian","Chen",""],["Zhang","Liqing",""]]}
{"id":"2308.06102","submitter":"Tista Mukherjee","authors":"Tista Mukherjee (for the IceCube Collaboration)","title":"Searching for IceCube sub-TeV neutrino counterparts to sub-threshold\n  Gravitational Wave 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-1504","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the release of the Gravitational Wave Transient Catalogue GWTC-2.1 by\nthe LIGO-Virgo collaboration, sub-threshold gravitational wave (GW) candidates\nare publicly available. They are expected to be released in real-time as well,\nin the upcoming O4 run. Using these GW candidates for multi-messenger studies\ncomplement the ongoing efforts to identify neutrino counterparts to GW events.\nThis in turn, allows us to schedule electromagnetic follow-up searches more\nefficiently. However, the definition and criteria for sub-threshold candidates\nare pretty flexible. Finding a multi-messenger counterpart via archival studies\nfor these candidates will help to set up strong bounds on the GW parameters\nwhich are useful for defining a GW signal as sub-threshold, thereby increasing\ntheir significance for scheduling follow-up searches. Here, we present the\ncurrent status of this ongoing work with the IceCube Neutrino Observatory. We\nperform a selection of the sub-threshold GW candidates from GWTC-2.1 and\nconduct an archival search for sub-TeV neutrino counterparts detected by the\ndense infill array of the IceCube Neutrino Observatory, known as \"DeepCore\".\nFor this, an Unbinned Maximum Likelihood (UML) method is used. We report the\n90% C.L. sensitivities of this sub-TeV neutrino dataset for each selected\nsub-threshold GW candidate, considering the spatial and temporal correlation\nbetween the GW and neutrino events within a 1000 s time window.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:26:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mukherjee","Tista","","for the IceCube Collaboration"]]}
{"id":"2308.06103","submitter":"Andrea Gesmundo","authors":"Andrea Gesmundo and Kaitlin Maile","title":"Composable Function-preserving Expansions for Transformer Architectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Training state-of-the-art neural networks requires a high cost in terms of\ncompute and time. Model scale is recognized to be a critical factor to achieve\nand improve the state-of-the-art. Increasing the scale of a neural network\nnormally requires restarting from scratch by randomly initializing all the\nparameters of the model, as this implies a change of architecture's parameters\nthat does not allow for a straightforward transfer of knowledge from smaller\nsize models. In this work, we propose six composable transformations to\nincrementally increase the size of transformer-based neural networks while\npreserving functionality, allowing to expand the capacity of the model as\nneeded. We provide proof of exact function preservation under minimal\ninitialization constraints for each transformation. The proposed methods may\nenable efficient training pipelines for larger and more powerful models by\nprogressively expanding the architecture throughout training.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:27:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gesmundo","Andrea",""],["Maile","Kaitlin",""]]}
{"id":"2308.06104","submitter":"Vincent Humiliere","authors":"Jean-Fran\\c{c}ois Barraud, Mihai Damian, Vincent Humili\\`ere,\n  Alexandru Oancea","title":"Morse homology with DG coefficients","comments":"232 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a theory of Morse homology and cohomology with coefficients in a\nderived local system, for manifolds and also more generally for colimits of\nspaces that have the homotopy type of manifolds, with a view towards Floer\ntheory. The model that we adopt for derived, or differential graded (DG) local\nsystems is that of DG modules over chains on the based loop space of a\nmanifold. These encompass both classical (non DG) local systems and chains on\nfibers of Hurewicz fibrations. We prove that the Morse homology and cohomology\ngroups that we construct are isomorphic to DG Tor and Ext functors. The key\ningredient in the definition is a notion of twisting cocycle obtained by\nevaluating into based loops a coherent system of representatives for the\nfundamental classes of the moduli spaces of Morse trajectories of arbitrary\ndimensions. From this perspective, our construction sits midway between\nclassical Morse homology with twisted coefficients and more refined invariants\nof Floer homotopical flavor. The construction of the twisting cocycle is\noriginally due to Barraud and Cornea with Z/2-coefficients. We show that the\ntwisting cocycle with integer coefficients is equivalent to Brown's universal\ntwisting cocycle. We prove that Morse homology with coefficients in chains on\nthe fiber of a Hurewicz fibration recovers the homology of the total space of\nthe fibration. We study several structural properties of the theory:\ninvariance, functoriality, and Poincar\\'e duality, also in the nonorientable\ncase.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:30:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Barraud","Jean-Fran\u00e7ois",""],["Damian","Mihai",""],["Humili\u00e8re","Vincent",""],["Oancea","Alexandru",""]]}
{"id":"2308.06105","submitter":"Attila P\\'asztor","authors":"Szabolcs Borsanyi, Zoltan Fodor, Matteo Giordano, Jana N. Guenther,\n  Sandor D. Katz, Attila Pasztor, Chik Him Wong","title":"Can rooted staggered fermions describe nonzero baryon density at low\n  temperatures?","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research on the QCD phase diagram with lattice field theory methods is\ndominated by the use of rooted staggered fermions, as they are the\ncomputationally cheapest discretization available. We show that rooted\nstaggered fermions at a nonzero baryochemical potential $\\mu_B$ predict a sharp\nrise in the baryon density at low temperatures and $\\mu_B \\gtrsim 3 m_\\pi/2$,\nwhere $m_\\pi$ is the Goldstone pion mass. We elucidate the nature of the\nnon-analyticity behind this sharp rise in the density by a comparison of\nreweighting results with a Taylor expansion of high order. While at first sight\nthis non-analytic behavior becomes apparent at the same position where the pion\ncondensation transition takes place in the phase-quenched theory, the nature of\nthe non-analyticity in the two theories appears to be quite different: While at\nnonzero isospin density the data are consistent with a genuine thermodynamic\n(branch-point) singularity, the results at nonzero baryon density point to an\nessential singularity at $\\mu_B=0$. The effect is absent for four flavors of\ndegenerate quarks, where rooting is not used. For the two-flavor case, we show\nnumerical evidence that the magnitude of the effect diminishes on finer\nlattices. We discuss the implications of this technical complication on future\nstudies of the QCD phase diagram.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:38:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Borsanyi","Szabolcs",""],["Fodor","Zoltan",""],["Giordano","Matteo",""],["Guenther","Jana N.",""],["Katz","Sandor D.",""],["Pasztor","Attila",""],["Wong","Chik Him",""]]}
{"id":"2308.06106","submitter":"Chao Yang","authors":"Chao Yang, Hengyuan Miao, Shuang Li","title":"Hawkes Processes with Delayed Granger Causality","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We aim to explicitly model the delayed Granger causal effects based on\nmultivariate Hawkes processes. The idea is inspired by the fact that a causal\nevent usually takes some time to exert an effect. Studying this time lag itself\nis of interest. Given the proposed model, we first prove the identifiability of\nthe delay parameter under mild conditions. We further investigate a model\nestimation method under a complex setting, where we want to infer the posterior\ndistribution of the time lags and understand how this distribution varies\nacross different scenarios. We treat the time lags as latent variables and\nformulate a Variational Auto-Encoder (VAE) algorithm to approximate the\nposterior distribution of the time lags. By explicitly modeling the time lags\nin Hawkes processes, we add flexibility to the model. The inferred time-lag\nposterior distributions are of scientific meaning and help trace the original\ncausal time that supports the root cause analysis. We empirically evaluate our\nmodel's event prediction and time-lag inference accuracy on synthetic and real\ndata, achieving promising results.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:43:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yang","Chao",""],["Miao","Hengyuan",""],["Li","Shuang",""]]}
{"id":"2308.06107","submitter":"Jiyang Guan","authors":"Jiyang Guan, Jian Liang, Ran He","title":"Test-Time Adaptation for Backdoor Defense","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks have played a crucial part in many critical domains,\nsuch as autonomous driving, face recognition, and medical diagnosis. However,\ndeep neural networks are facing security threats from backdoor attacks and can\nbe manipulated into attacker-decided behaviors by the backdoor attacker. To\ndefend the backdoor, prior research has focused on using clean data to remove\nbackdoor attacks before model deployment. In this paper, we investigate the\npossibility of defending against backdoor attacks at test time by utilizing\npartially poisoned data to remove the backdoor from the model. To address the\nproblem, a two-stage method Test-Time Backdoor Defense (TTBD) is proposed. In\nthe first stage, we propose two backdoor sample detection methods, namely DDP\nand TeCo, to identify poisoned samples from a batch of mixed, partially\npoisoned samples. Once the poisoned samples are detected, we employ Shapley\nestimation to calculate the contribution of each neuron's significance in the\nnetwork, locate the poisoned neurons, and prune them to remove backdoor in the\nmodels. Our experiments demonstrate that TTBD removes the backdoor successfully\nwith only a batch of partially poisoned data across different model\narchitectures and datasets against different types of backdoor attacks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:46:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Guan","Jiyang",""],["Liang","Jian",""],["He","Ran",""]]}
{"id":"2308.06108","submitter":"Jenni Jormanainen","authors":"J. Jormanainen, T. Hovatta, I. M. Christie, E. Lindfors, M.\n  Petropoulou, I. Liodakis","title":"Quantitative comparisons of VHE gamma-ray blazar flares with\n  relativistic reconnection models","comments":"Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The origin of extremely fast variability is one of the long-standing\nquestions in the gamma-ray astronomy of blazars. While many models explain the\nslower, lower energy variability, they cannot easily account for such fast\nflares reaching hour-to-minute time scales. Magnetic reconnection, a process\nwhere magnetic energy is converted to the acceleration of relativistic\nparticles in the reconnection layer, is a candidate solution to this problem.\nIn this work, we employ state-of-the-art particle-in-cell simulations in a\nstatistical comparison with observations of a flaring episode of a well-known\nblazar, Mrk 421, at very high energy (VHE, E > 100 GeV). We tested the\npredictions of our model by generating simulated VHE light curves that we\ncompared quantitatively with methods that we have developed for a precise\nevaluation of theoretical and observed data. With our analysis, we can\nconstrain the parameter space of the model, such as the magnetic field strength\nof the unreconnected plasma, viewing angle and the reconnection layer\norientation in the blazar jet. Our analysis favours parameter spaces with\nmagnetic field strength 0.1 G, rather large viewing angles (6-8 degrees), and\nmisaligned layer angles, offering a strong candidate explanation for the\nDoppler crisis often observed in the jets of high synchrotron peaking blazars.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:51:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jormanainen","J.",""],["Hovatta","T.",""],["Christie","I. M.",""],["Lindfors","E.",""],["Petropoulou","M.",""],["Liodakis","I.",""]]}
{"id":"2308.06109","submitter":"Mark Pankov","authors":"Mariusz Kwiatkowski, Mark Pankov","title":"On maximal cliques in the graph of simplex codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The induced subgraph of the corresponding Grassmann graph formed by simplex\ncodes is considered. We show that this graph, as the Grassmann graph, contains\ntwo types of maximal cliques. For any two cliques of the first type there is a\nmonomial linear automorphism transferring one of them to the other. Cliques of\nthe second type are more complicated and can contain different numbers of\nelements.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:52:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kwiatkowski","Mariusz",""],["Pankov","Mark",""]]}
{"id":"2308.06110","submitter":"EPTCS","authors":"Elena Machkasova (University of Minnesota, Morris)","title":"Proceedings Twelfth International Workshop on Trends in Functional\n  Programming in Education","comments":null,"journal-ref":"EPTCS 382, 2023","doi":"10.4204/EPTCS.382","report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This volume contains the papers, accepted after post-reviewing, based on\npresentations submitted to TFPIE 2023 that took place at UMAss Boston in\nBoston, Massachusetts, USA on January 12th 2023. TFPIE stands for Trends in\nFunctional Programming in Education, where authors present research and\nexperiences in teaching concepts of functional programming at any level.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:53:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Machkasova","Elena","","University of Minnesota, Morris"]]}
{"id":"2308.06111","submitter":"Lars Hillebrand","authors":"Lars Hillebrand, Armin Berger, Tobias Deu{\\ss}er, Tim Dilmaghani,\n  Mohamed Khaled, Bernd Kliem, R\\\"udiger Loitz, Maren Pielka, David Leonhard,\n  Christian Bauckhage, Rafet Sifa","title":"Improving Zero-Shot Text Matching for Financial Auditing with Large\n  Language Models","comments":"Accepted at DocEng 2023, 4 pages, 1 figure, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Auditing financial documents is a very tedious and time-consuming process. As\nof today, it can already be simplified by employing AI-based solutions to\nrecommend relevant text passages from a report for each legal requirement of\nrigorous accounting standards. However, these methods need to be fine-tuned\nregularly, and they require abundant annotated data, which is often lacking in\nindustrial environments. Hence, we present ZeroShotALI, a novel recommender\nsystem that leverages a state-of-the-art large language model (LLM) in\nconjunction with a domain-specifically optimized transformer-based\ntext-matching solution. We find that a two-step approach of first retrieving a\nnumber of best matching document sections per legal requirement with a custom\nBERT-based model and second filtering these selections using an LLM yields\nsignificant performance improvements over existing approaches.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:55:09 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 07:45:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hillebrand","Lars",""],["Berger","Armin",""],["Deu\u00dfer","Tobias",""],["Dilmaghani","Tim",""],["Khaled","Mohamed",""],["Kliem","Bernd",""],["Loitz","R\u00fcdiger",""],["Pielka","Maren",""],["Leonhard","David",""],["Bauckhage","Christian",""],["Sifa","Rafet",""]]}
{"id":"2308.06112","submitter":"Yasser Abdelaziz Dahou Djilali","authors":"Yasser Abdelaziz Dahou Djilali, Sanath Narayan, Haithem Boussaid,\n  Ebtessam Almazrouei, Merouane Debbah","title":"Lip2Vec: Efficient and Robust Visual Speech Recognition via\n  Latent-to-Latent Visual to Audio Representation Mapping","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":"  Visual Speech Recognition (VSR) differs from the common perception tasks as\nit requires deeper reasoning over the video sequence, even by human experts.\nDespite the recent advances in VSR, current approaches rely on labeled data to\nfully train or finetune their models predicting the target speech. This hinders\ntheir ability to generalize well beyond the training set and leads to\nperformance degeneration under out-of-distribution challenging scenarios.\nUnlike previous works that involve auxiliary losses or complex training\nprocedures and architectures, we propose a simple approach, named Lip2Vec that\nis based on learning a prior model. Given a robust visual speech encoder, this\nnetwork maps the encoded latent representations of the lip sequence to their\ncorresponding latents from the audio pair, which are sufficiently invariant for\neffective text decoding. The generated audio representation is then decoded to\ntext using an off-the-shelf Audio Speech Recognition (ASR) model. The proposed\nmodel compares favorably with fully-supervised learning methods on the LRS3\ndataset achieving 26 WER. Unlike SoTA approaches, our model keeps a reasonable\nperformance on the VoxCeleb test set. We believe that reprogramming the VSR as\nan ASR task narrows the performance gap between the two and paves the way for\nmore flexible formulations of lip reading.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 12:59:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Djilali","Yasser Abdelaziz Dahou",""],["Narayan","Sanath",""],["Boussaid","Haithem",""],["Almazrouei","Ebtessam",""],["Debbah","Merouane",""]]}
{"id":"2308.06113","submitter":"Maximilian Kaul","authors":"Maximilian Kaul, Alexander K\\\"uchler, Christian Banse","title":"A Uniform Representation of Classical and Quantum Source Code for Static\n  Code Analysis","comments":"2023 IEEE International Conference on Quantum Computing and\n  Engineering (QCE)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence of quantum computing raises the question of how to identify\n(security-relevant) programming errors during development. However, current\nstatic code analysis tools fail to model information specific to quantum\ncomputing. In this paper, we identify this information and propose to extend\nclassical code analysis tools accordingly. Among such tools, we identify the\nCode Property Graph to be very well suited for this task as it can be easily\nextended with quantum computing specific information. For our proof of concept,\nwe implemented a tool which includes information from the quantum world in the\ngraph and demonstrate its ability to analyze source code written in Qiskit and\nOpenQASM. Our tool brings together the information from the classical and\nquantum world, enabling analysis across both domains. By combining all relevant\ninformation into a single detailed analysis, this powerful tool can facilitate\ntackling future quantum source code analysis challenges.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:03:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kaul","Maximilian",""],["K\u00fcchler","Alexander",""],["Banse","Christian",""]]}
{"id":"2308.06114","submitter":"Abhishek Chikkaballi","authors":"Abhishek Chikkaballi, Kamila Kowalska, Enrico Maria Sessolo","title":"Naturally small neutrino mass with asymptotic safety and\n  gravitational-wave signatures","comments":"41 pages, 5 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 revisit the dynamical generation of an arbitrarily small neutrino Yukawa\ncoupling in the Standard Model with trans-Planckian asymptotic safety and apply\nthe same mechanism to the gauged $B-L$ model. We show that thanks to the\npresence of additional irrelevant couplings, the described neutrino-mass\ngeneration in the $B-L$ model is potentially more in line with existing\ntheoretical calculations in quantum gravity. Interestingly, the model can\naccommodate, in full naturalness and without extensions, the possibility of\npurely Dirac, pseudo-Dirac, and Majorana neutrinos with any see-saw scale. We\ninvestigate eventual distinctive signatures of these cases in the detection of\ngravitational waves from first-order phase transitions. We find that, while it\nis easy to produce a signal observable in new-generation space interferometers,\nits discriminating features are washed out by the strong dependence of the\ngravitational-wave spectrum on the relevant parameters of the scalar potential.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:04:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chikkaballi","Abhishek",""],["Kowalska","Kamila",""],["Sessolo","Enrico Maria",""]]}
{"id":"2308.06115","submitter":"J. Douglas Wright","authors":"Joshua A. McGinnis and J. Douglas Wright","title":"Approximation of (some) FPUT lattices by KdV Equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a Fermi-Pasta-Ulam-Tsingou lattice with randomly varying\ncoefficients. We discover a relatively simple condition which when placed on\nthe nature of the randomness allows us to prove that small amplitude/long\nwavelength solutions are almost surely rigorously approximated by solutions of\nKorteweg-de Vries equations for very long times. The key ideas combine energy\nestimates with homogenization theory and the technical proof requires a novel\napplication of autoregressive processes.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:10:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["McGinnis","Joshua A.",""],["Wright","J. Douglas",""]]}
{"id":"2308.06116","submitter":"Neil Chada","authors":"Neil K. Chada, Philip J. Herbert","title":"The Stochastic Steepest Descent Method for Robust Optimization in Banach\n  Spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Stochastic gradient methods have been a popular and powerful choice of\noptimization methods, aimed at minimizing functions. Their advantage lies in\nthe fact that that one approximates the gradient as opposed to using the full\nJacobian matrix. One research direction, related to this, has been on the\napplication to infinite-dimensional problems, where one may naturally have a\nHilbert space framework. However, there has been limited work done on\nconsidering this in a more general setup, such as where the natural framework\nis that of a Banach space. This article aims to address this by the\nintroduction of a novel stochastic method, the stochastic steepest descent\nmethod (SSD). The SSD will follow the spirit of stochastic gradient descent,\nwhich utilizes Riesz representation to identify gradients and derivatives. Our\nchoice for using such a method is that it naturally allows one to adopt a\nBanach space setting, for which recent applications have exploited the benefit\nof this, such as in PDE-constrained shape optimization. We provide a\nconvergence theory related to this under mild assumptions. Furthermore, we\ndemonstrate the performance of this method on a couple of numerical\napplications, namely a $p$-Laplacian and an optimal control problem. Our\nassumptions are verified in these applications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:10:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chada","Neil K.",""],["Herbert","Philip J.",""]]}
{"id":"2308.06117","submitter":"Jaime Ortega Arroyo","authors":"Alexia Stollmann, Jose Garcia-Guirado, Jae-Sang Hong, Hyungsoon Im,\n  Hakho Lee, Jaime Ortega Arroyo, Romain Quidant","title":"Molecular fingerprinting of biological nanoparticles with a label-free\n  optofluidic platform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Label-free detecting multiple analytes in a high-throughput fashion has been\none of the long-sought goals in biosensing applications. Yet, for all-optical\napproaches, interfacing state-of-the-art label-free techniques with\nmicrofluidics tools that can process small volumes of sample with high\nthroughput, and with surface chemistry that grants analyte specificity, poses a\ncritical challenge to date. Here, we introduce an optofluidic platform that\nbrings together state-of-the-art digital holography with PDMS microfluidics by\nusing supported lipid bilayers as a surface chemistry building block to\nintegrate both technologies. Specifically, this platform fingerprints\nheterogeneous biological nanoparticle populations via a multiplexed label-free\nimmunoaffinity assay with single particle sensitivity. Herein, we first\nthoroughly characterise the robustness and performance of the platform, and\nthen apply it to profile four distinct ovarian cell-derived extracellular\nvesicle populations over a panel of surface protein biomarkers, thus developing\na unique biomarker fingerprint for each cell line. We foresee that our approach\nwill find many applications where routine and multiplexed characterisation of\nbiological nanoparticles is required.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:10:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Stollmann","Alexia",""],["Garcia-Guirado","Jose",""],["Hong","Jae-Sang",""],["Im","Hyungsoon",""],["Lee","Hakho",""],["Arroyo","Jaime Ortega",""],["Quidant","Romain",""]]}
{"id":"2308.06118","submitter":"L\\'eo Touzo","authors":"L\\'eo Touzo and Pierre Le Doussal","title":"Non-equilibrium phase transitions in active rank diffusions","comments":"8 pages, 6 Figures. Supp. Mat.: 18 pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider N run and tumble particles in one dimension interacting via a\nlinear 1D Coulomb potential, an active version of the rank diffusion problem.\nIt was solved previously for N = 2 leading to a stationary bound state in the\nattractive case. Here the evolution of the density fields is obtained in the\nlarge N limit in terms of two coupled Burger's type equations. In the\nattractive case the exact stationary solution describes a non-trivial\nN-particle bound state, which exhibits transitions between a phase where the\ndensity is smooth with infinite support, a phase where the density has finite\nsupport and exhibits \"shocks\", i.e. clusters of particles, at the edges, and a\nfully clustered phase. In presence of an additional linear potential, the phase\ndiagram, obtained for either sign of the interaction, is even richer, with\nadditional partially expanding phases, with or without shocks. Finally, a\ngeneral self-consistent method is introduced to treat more general\ninteractions. The predictions are tested through extensive numerical\nsimulations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:11:38 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Touzo","L\u00e9o",""],["Doussal","Pierre Le",""]]}
{"id":"2308.06119","submitter":"Oleg Morzhin","authors":"Oleg Morzhin, Alexander Pechen","title":"Krotov Type Optimization of Coherent and Incoherent Controls for Open\n  Two-Qubit Systems","comments":"18 pages, 2 figures. Accepted to Bulletin of Irkutsk State\n  University, Series Mathematics","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work considers two-qubit open quantum systems driven by coherent and\nincoherent controls. Incoherent control induces time-dependent decoherence\nrates via time-dependent spectral density of the environment which is used as a\nresource for controlling the system. The system evolves according to the\nGorini-Kossakowski-Sudarshan-Lindblad master equation with time-dependent\ncoefficients. For two types of interaction with coherent control, three types\nof objectives are considered: 1) maximizing the Hilbert-Schmidt overlap between\nthe final and target density matrices; 2) minimizing the Hilbert-Schmidt\ndistance between these matrices; 3) steering the overlap to a given value. For\nthe first problem, we develop the Krotov type methods directly in terms of\ndensity matrices with or without regularization for piecewise continuous\nconstrained controls and find the cases where the methods produce (either\nexactly or with some precision) zero controls which satisfy the Pontryagin\nmaximum principle and produce the overlap's values close to their upper\nestimates. For the problems 2) and 3), we find cases when the dual annealing\nmethod steers the objectives close to zero and produces a non-zero control.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:17:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Morzhin","Oleg",""],["Pechen","Alexander",""]]}
{"id":"2308.06120","submitter":"Jan M. L. Martin","authors":"Golokesh Santra and Margarita Shepelenko and Emmanouil Semidalas and\n  Jan M. L. Martin","title":"Is valence CCSD(T) enough for the binding of water clusters? The isomers\n  of (H$_2$O)$_6$ and (H$_2$O)$_{20}$ as a case study","comments":"version updated from ResearchGate, now including 3-body contributions\n  for water20","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Benchmark calculations on noncovalent interactions typically exclude\ncorrelation effects beyond valence CCSD(T) owing to their steep computational\ncost scaling. In this work, we consider their importance for water clusters,\nspecifically, eight isomers of (H$_2$O)$_6$ and four Wales-Hodges isomers of\n(H$_2$O)$_{20}$. Higher order connected triples, $T_3$--(T), reduce\ndissociation energies of the latter by about 0.4 kcal/mol, but this is more\nthan compensated by an increase of up to 0.85 kcal/mol due to connected\nquadruple excitations. In general, higher-order correlation effects favor more\ncompact isomers over more `spread-out' ones. We also consider additional small\neffects for balance: scalar relativistics reduce binding in (H$_2$O)$_{20}$ by\nca. --0.4 kcal/mol, which fortuitously is compensated by the ca. 0.55 kcal/mol\ndiagonal Born-Oppenheimer correction. Core-valence correlation has the greatest\nimpact, at ca. 1.3 kcal/mol for the icosamer.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:17:46 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Santra","Golokesh",""],["Shepelenko","Margarita",""],["Semidalas","Emmanouil",""],["Martin","Jan M. L.",""]]}
{"id":"2308.06121","submitter":"Xing-Dao Guo","authors":"Xing-Dao Guo, Dian-Yong Chen, Xue-Qian Li, Zhong-Yuan Yuan, Shijin\n  Sang","title":"Molecular components in the $J/\\psi$ and the $\\rho$-$\\pi$ puzzle","comments":"8 pges, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Motivated by the large branching fractions of $J/\\psi \\to f_0 (1710)\n\\omega/f_0(1710) \\phi$ and the light exotic candidates, we find that there may\nexist molecular states composed of $f_0(1710) \\omega$ and $f_0 (1710) \\phi$,\nwhich correspond to $X(2440)$ and $X(2680)$ observed in a few decades before.\nThe branching fraction of $X(2440)$ and $X(2680)$ to various $PV$ channels and\n$KK\\omega(\\phi)$ channels are estimated in the molecular scenario. In addition,\nthe large branching fractions of $J/\\psi \\to f_0 (1710) \\omega/f_0(1710) \\phi$\nindicate the sizable molecular components in the $J/\\psi$ state. Thus, we\nconsider the $J/\\psi$ as the supperposition of $c\\bar{c}(1S)$, $f_0(1710)\n\\omega$ and $f_0 (1710) \\phi$ molecular states, and these molecular components\nhave significant impact on the light hadron decays of $J/\\psi$, which may\nshield light on the long standing $\\rho-\\pi$ puzzle.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:20:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Guo","Xing-Dao",""],["Chen","Dian-Yong",""],["Li","Xue-Qian",""],["Yuan","Zhong-Yuan",""],["Sang","Shijin",""]]}
{"id":"2308.06122","submitter":"Joel Puibasset","authors":"Jo\\\"el Puibasset","title":"Are nucleation bubbles in a liquid all independent?","comments":null,"journal-ref":"Journal of Molecular Liquids 387, 122638 (2023)","doi":"10.1016/j.molliq.2023.122638","report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spontaneous formation of tiny bubbles in a liquid is at the root of the\nnucleation mechanism during the liquid-to-vapor transition of a metastable\nliquid. The smaller the bubbles the larger their probability to appear, and\neven for moderately metastable liquid, it is frequent to observe several tiny\nbubbles close to each other, suggesting that they are not all independent. It\nis shown that these spatially correlated bubbles should be seen as belonging to\none single density depression of the liquid due to fluctuations (called LDR for\nLow Density Region) and should be counted as one event instead of several. This\nhas a major impact on the characterization of the bubble density in a liquid,\nwith consequences (i) for understanding liquid-to-vapor transitions which\nproceed through growing and merging of these correlated bubbles, and (ii) for\nfree energy profile and barrier calculations with molecular simulation\ntechniques which require to convert the calculated size distribution of the\nlargest bubble into the size distribution of any bubble. Remarkably, the\naverage number of LDRs in a given volume simply relates to the probability of\nnot having bubbles in the liquid.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:21:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Puibasset","Jo\u00ebl",""]]}
{"id":"2308.06123","submitter":"Amanda Welch","authors":"Cristina Ballantine and Amanda Welch","title":"PED and POD partitions: combinatorial proofs of recurrence relations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  PED partitions are partitions with even parts distinct while odd parts are\nunrestricted. Similarly, POD partitions have distinct odd parts while even\nparts are unrestricted. Merca proved several recurrence relations analytically\nfor the number of PED partitions of $n$. They are similar to the recurrence\nrelation for the number of partitions of $n$ given by Euler's pentagonal number\ntheorem. We provide combinatorial proofs for all of these theorems and also for\nthe pentagonal number theorem for PED partitions proved analytically by Fink,\nGuy, and Krusemeyer. Moreover, we prove combinatorially a recurrence for POD\npartitions given by Ballantine and Merca, Beck-type identities involving PED\nand POD partitions, and several other results about PED and POD partitions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:22:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ballantine","Cristina",""],["Welch","Amanda",""]]}
{"id":"2308.06124","submitter":"Ping Liu","authors":"Habib Ammari and Silvio Barandun and Bryn Davies and Erik Orvehed\n  Hiltunen and Ping Liu","title":"Stability of the non-Hermitian skin effect","comments":"18 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.mtrl-sci math.AP math.MP math.RA physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper shows that the skin effect in systems of non-Hermitian\nsubwavelength resonators is robust with respect to random imperfections in the\nsystem. The subwavelength resonators are highly contrasting material inclusions\nthat resonate in a low-frequency regime. The non-Hermiticity is due to the\nintroduction of an imaginary gauge potential, which leads to a skin effect that\nis manifested by the system's eigenmodes accumulating at one edge of the\nstructure. We elucidate the topological protection of the associated (real)\neigenfrequencies and illustrate the competition between the two different\nlocalisation effects present when the system is randomly perturbed: the\nnon-Hermitian skin effect and the disorder-induced Anderson localisation. We\nshow that, as the strength of the disorder increases, more and more eigenmodes\nbecome localised in the bulk. Our results are based on an asymptotic matrix\nmodel for subwavelength physics and can be generalised also to tight-binding\nmodels in condensed matter theory.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:26:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ammari","Habib",""],["Barandun","Silvio",""],["Davies","Bryn",""],["Hiltunen","Erik Orvehed",""],["Liu","Ping",""]]}
{"id":"2308.06125","submitter":"Cal Peyser","authors":"Cal Peyser, Zhong Meng, Ke Hu, Rohit Prabhavalkar, Andrew Rosenberg,\n  Tara N. Sainath, Michael Picheny, Kyunghyun Cho","title":"Improving Joint Speech-Text Representations Without Alignment","comments":null,"journal-ref":"INTERSPEECH 2023","doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The last year has seen astonishing progress in text-prompted image generation\npremised on the idea of a cross-modal representation space in which the text\nand image domains are represented jointly. In ASR, this idea has found\napplication as joint speech-text encoders that can scale to the capacities of\nvery large parameter models by being trained on both unpaired speech and text.\nWhile these methods show promise, they have required special treatment of the\nsequence-length mismatch inherent in speech and text, either by up-sampling\nheuristics or an explicit alignment model. In this work, we offer evidence that\njoint speech-text encoders naturally achieve consistent representations across\nmodalities by disregarding sequence length, and argue that consistency losses\ncould forgive length differences and simply assume the best alignment. We show\nthat such a loss improves downstream WER in both a large-parameter monolingual\nand multilingual system.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:28:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Peyser","Cal",""],["Meng","Zhong",""],["Hu","Ke",""],["Prabhavalkar","Rohit",""],["Rosenberg","Andrew",""],["Sainath","Tara N.",""],["Picheny","Michael",""],["Cho","Kyunghyun",""]]}
{"id":"2308.06126","submitter":"Ruihan Liu","authors":"Ruihan Liu and Chen Wang","title":"Unit Root Testing for High-Dimensional Nonstationary Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we consider a $n$-dimensional random walk $X_t$, whose error\nterms are linear processes generated by $n$-dimensional noise vectors, and each\ncomponent of these noise vectors is independent and may not be identically\ndistributed with uniformly bounded 8th moment and densities. Given $T$\nobservations such that the dimension $n$ and sample size $T$ going to infinity\nproportionally, define $\\boldsymbol{X}$ and $\\hat{\\boldsymbol{R}}$ as the data\nmatrix and the sample correlation matrix of $\\boldsymbol{X}$ respectively. This\narticle establishes the central limit theorem (CLT) of the first $K$ largest\neigenvalues of $n^{-1}\\hat{\\boldsymbol{R}}$. Subsequently, we propose a new\nunit root test for the panel high-dimensional nonstationary time series based\non the CLT of the largest eigenvalue of $n^{-1}\\hat{\\boldsymbol{R}}$. A\nnumerical experiment is undertaken to verify the power of our proposed unit\nroot test.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:30:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Ruihan",""],["Wang","Chen",""]]}
{"id":"2308.06127","submitter":"Marc Weber","authors":"Marc Weber, Phillip Swazinna, Daniel Hein, Steffen Udluft, and Volkmar\n  Sterzing","title":"Learning Control Policies for Variable Objectives from Offline Data","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Offline reinforcement learning provides a viable approach to obtain advanced\ncontrol strategies for dynamical systems, in particular when direct interaction\nwith the environment is not available. In this paper, we introduce a conceptual\nextension for model-based policy search methods, called variable objective\npolicy (VOP). With this approach, policies are trained to generalize\nefficiently over a variety of objectives, which parameterize the reward\nfunction. We demonstrate that by altering the objectives passed as input to the\npolicy, users gain the freedom to adjust its behavior or re-balance\noptimization targets at runtime, without need for collecting additional\nobservation batches or re-training.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:33:59 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Weber","Marc",""],["Swazinna","Phillip",""],["Hein","Daniel",""],["Udluft","Steffen",""],["Sterzing","Volkmar",""]]}
{"id":"2308.06128","submitter":"Xingyong Zhang","authors":"Cuiling Liu, Xingyong Zhang, Liben Wang","title":"Multiplicity of solutions for a class of nonhomogeneous quasilinear\n  elliptic system with locally symmetric condition in $\\mathbb{R}^N$","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 is concerned with a class of nonhomogeneous quasilinear elliptic\nsystem driven by the locally symmetric potential and the small continuous\nperturbations in the whole-space $\\mathbb{R}^N$. By a variant of Clark's\ntheorem without the global symmetric condition and a Moser's iteration\ntechnique, we obtain the existence of multiple solutions when the nonlinear\nterm satisfies some growth conditions only in a circle with center 0 and the\nperturbation term is any continuous function with a small parameter and no any\ngrowth hypothesis.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:34:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Cuiling",""],["Zhang","Xingyong",""],["Wang","Liben",""]]}
{"id":"2308.06129","submitter":"Alexander Timans","authors":"Alexander Timans, Nina Wiedemann, Nishant Kumar, Ye Hong, Martin\n  Raubal","title":"Uncertainty Quantification for Image-based Traffic Prediction across\n  Cities","comments":"39 pages, 22 figures. Code publicly available at:\n  https://github.com/alextimans/traffic4cast-uncertainty","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the strong predictive performance of deep learning models for traffic\nprediction, their widespread deployment in real-world intelligent\ntransportation systems has been restrained by a lack of interpretability.\nUncertainty quantification (UQ) methods provide an approach to induce\nprobabilistic reasoning, improve decision-making and enhance model deployment\npotential. To gain a comprehensive picture of the usefulness of existing UQ\nmethods for traffic prediction and the relation between obtained uncertainties\nand city-wide traffic dynamics, we investigate their application to a\nlarge-scale image-based traffic dataset spanning multiple cities and time\nperiods. We compare two epistemic and two aleatoric UQ methods on both temporal\nand spatio-temporal transfer tasks, and find that meaningful uncertainty\nestimates can be recovered. We further demonstrate how uncertainty estimates\ncan be employed for unsupervised outlier detection on changes in city traffic\ndynamics. We find that our approach can capture both temporal and spatial\neffects on traffic behaviour in a representative case study for the city of\nMoscow. Our work presents a further step towards boosting uncertainty awareness\nin traffic prediction tasks, and aims to highlight the value contribution of UQ\nmethods to a better understanding of city traffic dynamics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:35:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Timans","Alexander",""],["Wiedemann","Nina",""],["Kumar","Nishant",""],["Hong","Ye",""],["Raubal","Martin",""]]}
{"id":"2308.06130","submitter":"Erik Mulder","authors":"Erik Mulder","title":"Fast square-free decomposition of integers using class groups","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $n=a^2b$, where $b$ is square-free. In this paper we present an algorithm\nbased on class groups of binary quadratic forms that finds the square-free\ndecomposition of $n$, i.e. $a$ and $b$, in heuristic expected time: $$\n\\widetilde{\\mathcal{O}}(L_{b}[1/2,1] \\ln(n) + L_{b}[1/2,1/2] \\ln(n)^2). $$ If\n$a,b$ are both primes of roughly the same cryptographic size, then our method\nis currently the fastest known method to factor $n$. This has applications in\ncryptography, since some cryptosystems rely on the hardness of factoring\nintegers of this form.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:38:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mulder","Erik",""]]}
{"id":"2308.06131","submitter":"Matthias Hoek","authors":"R. Spreckels, M. Hoek, U. M\\\"uller and M. Thiel","title":"A Highly Segmented Neutron Polarimeter for A1","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A new neutron polarimeter for measuring the neutron's electric form factor\nwas designed and constructed to complement the A1 spectrometer setup at the\nMainz Microtron (MAMI). The design is based on a previous polarimeter with\nsignificant improvements to halve the error of the extracted form factor. A\nhigher granularity of the polarimeter sections and a deeper first section on\nthe one hand, and a faster readout employing Time-over-Threshold methods to\nmeasure the signal amplitudes combined with a high-precision FPGA-based TDC on\nthe other hand will allow to achieve this goal. The performance of the new\npolarimeter during a first measurement campaign in 2019 using liquid hydrogen\nand deuterium targets will be discussed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:38:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Spreckels","R.",""],["Hoek","M.",""],["M\u00fcller","U.",""],["Thiel","M.",""]]}
{"id":"2308.06132","submitter":"Pan Qin","authors":"Aina Wang, Pan Qin, Xi-Ming Sun","title":"PDE Discovery for Soft Sensors Using Coupled Physics-Informed Neural\n  Network with Akaike's Information Criterion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Soft sensors have been extensively used to monitor key variables using\neasy-to-measure variables and mathematical models. Partial differential\nequations (PDEs) are model candidates for soft sensors in industrial processes\nwith spatiotemporal dependence. However, gaps often exist between idealized\nPDEs and practical situations. Discovering proper structures of PDEs, including\nthe differential operators and source terms, can remedy the gaps. To this end,\na coupled physics-informed neural network with Akaike's criterion information\n(CPINN-AIC) is proposed for PDE discovery of soft sensors. First, CPINN is\nadopted for obtaining solutions and source terms satisfying PDEs. Then, we\npropose a data-physics-hybrid loss function for training CPINN, in which\nundetermined combinations of differential operators are involved. Consequently,\nAIC is used to discover the proper combination of differential operators.\nFinally, the artificial and practical datasets are used to verify the\nfeasibility and effectiveness of CPINN-AIC for soft sensors. The proposed\nCPINN-AIC is a data-driven method to discover proper PDE structures and neural\nnetwork-based solutions for soft sensors.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:39:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wang","Aina",""],["Qin","Pan",""],["Sun","Xi-Ming",""]]}
{"id":"2308.06133","submitter":"Eduard Boos E","authors":"Eduard Boos","title":"An effective gauge field theory of the nucleon interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the possibility of constructing an effective gauge field theory of\nthe nucleon interations based on the ideas of isotopic invariance as well as\nhypercharge invariance as a local gauge symmetry and spontaneous breaking of\nthis symmetry. The constructed model predicts the structure of interactions of\nprotons and neutrons with $\\rho$- and $\\sigma$-mesons, with pi-mesons and\nphotons, as well as interactions of these particles with each other. The\nLagrangian of the model consists of several parts parts involving dimension 4\nand 5 gauge invariant operators. Feynman rules for physical degrees of freedom\nas follow from the Lagrangian define the structure of diagrams for one-boson\nexchanges between nucleons predicting the internucleon one-boson exchange\npotential as well as nucleon scattering amplitudes. The range of applicability\nof the model is discussed and estimates are made of the resulting coupling\nconstants. The model predicts the mass of the neutral $\\rho^0$-meson to be\nabout $1\\,MeV$ larger than the mass of the charged mesons $\\rho^{\\pm}$. The\nvector $\\omega$-meson, which is a sterile particle with respect to the\nconsidered gauge group $SU_I(2)\\times U_Y(1)$, can be added to the scheme by\nmeans of a gauge-invariant operator of dimension 5, as shown in Appendix ~A.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:40:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Boos","Eduard",""]]}
{"id":"2308.06134","submitter":"Genya Kobayashi Dr.","authors":"Genya Kobayashi, Shonosuke Sugasawa, Yuki Kawakubo, Dongu Han, Taeryon\n  Choi","title":"Clustering and Predicting Multiple Time Series Count Data via Mixture of\n  Bayesian Predictive Syntheses: Analysis of COVID-19 Hospitalisation in Japan\n  and Korea","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the outbreak of COVID-19, governments and academia have made tremendous\nefforts to predict the course of the pandemic and implement prevention measures\nby monitoring various indicators. These indicators are obtained daily or\nweekly, and typically constitute time series count data over multiple\nsub-regions of a country, where groups of sub-regions often exhibit similar\ndynamics. This paper proposes a novel methodology called the mixture of\nBayesian predictive syntheses (MBPS) to improve the predictive performance for\nsuch data by combining a set of predictive models and clustering the time\nseries based on the contribution of those predictive models. MBPS takes the\nform of a finite mixture of dynamic factor models and is particularly useful\nwhen the multiple time series are discrete, as MBPS does not require\nmultivariate count models, which are generally cumbersome to develop and\nimplement. The clustering through MBPS provides valuable insights into the data\nand improves predictive performance by leveraging the share information within\neach cluster. Grouping multiple series into clusters also reduces the number of\nparameters needed compared to employing a multivariate model. To validate its\nefficacy, we apply the model to analyse the data on the numbers of COVID-19\ninpatients and isolated individuals in Japan and Korea. The results demonstrate\nthat our proposed approach outperforms the agent methods in predictive\naccuracy. Moreover, the insights gained from our model provide valuable\ninformation for interpreting and diagnosing the analysis, contributing to the\nformulation of preventive measures for infectious diseases in the future.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:43:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kobayashi","Genya",""],["Sugasawa","Shonosuke",""],["Kawakubo","Yuki",""],["Han","Dongu",""],["Choi","Taeryon",""]]}
{"id":"2308.06135","submitter":"Roberto Garra","authors":"G. Dattoli and R. Garra","title":"A note on differential equations of logistic type","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Logistic equations play a pivotal role in the study of any non linear\nevolution process exhibiting growth and saturation. The interest for the\nphenomenology, they rule, goes well beyond physical processes and cover many\naspects of ecology, population growth, economy...According to such a broad\nrange of applications, there are different forms of functions and distributions\nwhich are recognized as generalized logistics. Sometimes they are obtained by\nfitting procedures. Therefore, criteria might be needed to infer the associated\nnon linear differential equations, useful to guess \"hidden\" evolution\nmechanisms. In this article we analyze different forms of logistic functions\nand use simple means to reconstruct the differential equation they satisfy. Our\nstudy includes also differential equations containing non standard forms of\nderivative operators, like those of the Laguerre type.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:44:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dattoli","G.",""],["Garra","R.",""]]}
{"id":"2308.06136","submitter":"Amanda Welch","authors":"Cristina Ballantine and Amanda Welch","title":"Generalizations of POD and PED partitions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Partitions with even (respectively odd) parts distinct and all other parts\nunrestricted are often referred to as PED (respectively POD) partitions. In\nthis article, we generalize these notions and study sets of partitions in which\nparts with fixed residue(s) modulo r are distinct while all other parts are\nunrestricted. We also study partitions in which parts divisible by r\n(respectively congruent to r modulo 2r) must occur with multiplicity greater\nthan one.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:48:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ballantine","Cristina",""],["Welch","Amanda",""]]}
{"id":"2308.06137","submitter":"Kushal Kedia","authors":"Kushal Kedia, Prithwish Dan, Sanjiban Choudhury","title":"A Game-Theoretic Framework for Joint Forecasting and Planning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Planning safe robot motions in the presence of humans requires reliable\nforecasts of future human motion. However, simply predicting the most likely\nmotion from prior interactions does not guarantee safety. Such forecasts fail\nto model the long tail of possible events, which are rarely observed in limited\ndatasets. On the other hand, planning for worst-case motions leads to overtly\nconservative behavior and a ``frozen robot''. Instead, we aim to learn\nforecasts that predict counterfactuals that humans guard against. We propose a\nnovel game-theoretic framework for joint planning and forecasting with the\npayoff being the performance of the planner against the demonstrator, and\npresent practical algorithms to train models in an end-to-end fashion. We\ndemonstrate that our proposed algorithm results in safer plans in a crowd\nnavigation simulator and real-world datasets of pedestrian motion. We release\nour code at\nhttps://github.com/portal-cornell/Game-Theoretic-Forecasting-Planning.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:56:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kedia","Kushal",""],["Dan","Prithwish",""],["Choudhury","Sanjiban",""]]}
{"id":"2308.06138","submitter":"Masoume Kazemi","authors":"Masoume Kazemi, Davood Moradkhani, Alireza A. Alipour","title":"Application of Artificial Neural Networks for Investigation of Pressure\n  Filtration Performance, a Zinc Leaching Filter Cake Moisture Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Machine Learning (ML) is a powerful tool for material science applications.\nArtificial Neural Network (ANN) is a machine learning technique that can\nprovide high prediction accuracy. This study aimed to develop an ANN model to\npredict the cake moisture of the pressure filtration process of zinc\nproduction. The cake moisture was influenced by seven parameters: temperature\n(35 and 65 Celsius), solid concentration (0.2 and 0.38 g/L), pH (2, 3.5, and\n5), air-blow time (2, 10, and 15 min), cake thickness (14, 20, 26, and 34 mm),\npressure, and filtration time. The study conducted 288 tests using two types of\nfabrics: polypropylene (S1) and polyester (S2). The ANN model was evaluated by\nthe Coefficient of determination (R2), the Mean Square Error (MSE), and the\nMean Absolute Error (MAE) metrics for both datasets. The results showed R2\nvalues of 0.88 and 0.83, MSE values of 6.243x10-07 and 1.086x10-06, and MAE\nvalues of 0.00056 and 0.00088 for S1 and S2, respectively. These results\nindicated that the ANN model could predict the cake moisture of pressure\nfiltration in the zinc leaching process with high accuracy.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:58:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kazemi","Masoume",""],["Moradkhani","Davood",""],["Alipour","Alireza A.",""]]}
{"id":"2308.06139","submitter":"Guillaume Scholz","authors":"Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz","title":"Shared ancestry graphs and symbolic arboreal maps","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A network $N$ on a finite set $X$, $|X|\\geq 2$, is a connected directed\nacyclic graph with leaf set $X$ in which every root in $N$ has outdegree at\nleast 2 and no vertex in $N$ has indegree and outdegree equal to 1; $N$ is\narboreal if the underlying unrooted, undirected graph of $N$ is a tree.\nNetworks are of interest in evolutionary biology since they are used, for\nexample, to represent the evolutionary history of a set $X$ of species whose\nancestors have exchanged genes in the past. For $M$ some arbitrary set of\nsymbols, $d:{X \\choose 2} \\to M \\cup \\{\\odot\\}$ is a symbolic arboreal map if\nthere exists some arboreal network $N$ whose vertices with outdegree two or\nmore are labelled by elements in $M$ and so that $d(\\{x,y\\})$, $\\{x,y\\} \\in {X\n\\choose 2}$, is equal to the label of the least common ancestor of $x$ and $y$\nin $N$ if this exists and $\\odot$ else. Important examples of symbolic arboreal\nmaps include the symbolic ultrametrics, which arise in areas such as game\ntheory, phylogenetics and cograph theory. In this paper we show that a map\n$d:{X \\choose 2} \\to M \\cup \\{\\odot\\}$ is a symbolic arboreal map if and only\nif $d$ satisfies certain 3- and 4-point conditions and the graph with vertex\nset $X$ and edge set consisting of those pairs $\\{x,y\\} \\in {X \\choose 2}$ with\n$d(\\{x,y\\}) \\neq \\odot$ is Ptolemaic. To do this, we introduce and prove a key\ntheorem concerning the shared ancestry graph for a network $N$ on $X$, where\nthis is the graph with vertex set $X$ and edge set consisting of those $\\{x,y\\}\n\\in {X \\choose 2}$ such that $x$ and $y$ share a common ancestor in $N$. In\nparticular, we show that for any connected graph $G$ with vertex set $X$ and\nedge clique cover $K$ in which there are no two distinct sets in $K$ with one a\nsubset of the other, there is some network with $|K|$ roots and leaf set $X$\nwhose shared ancestry graph is $G$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:59:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Huber","Katharina T.",""],["Moulton","Vincent",""],["Scholz","Guillaume E.",""]]}
{"id":"2308.06140","submitter":"Frank Heyen","authors":"Frank Heyen, Quynh Quang Ngo, Michael Sedlmair","title":"Visual Overviews for Sheet Music Structure","comments":"Proceedings of the 24th International Society for Music Information\n  Retrieval Conference (ISMIR) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose different methods for alternative representation and visual\naugmentation of sheet music that help users gain an overview of general\nstructure, repeating patterns, and the similarity of segments. To this end, we\nexplored mapping the overall similarity between sections or bars to colors. For\nthese mappings, we use dimensionality reduction or clustering to assign similar\nsegments to similar colors and vice versa. To provide a better overview, we\nfurther designed simplified music notation representations, including\nhierarchical and compressed encodings. These overviews allow users to display\nwhole pieces more compactly on a single screen without clutter and to find and\nnavigate to distant segments more quickly. Our preliminary evaluation with\nguitarists and tablature shows that our design supports users in tasks such as\nanalyzing structure, finding repetitions, and determining the similarity of\nspecific segments to others.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:01:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Heyen","Frank",""],["Ngo","Quynh Quang",""],["Sedlmair","Michael",""]]}
{"id":"2308.06141","submitter":"Samuel Jelbart","authors":"Samuel Jelbart and Christian Kuehn","title":"Extending Discrete Geometric Singular Perturbation Theory to\n  Non-Hyperbolic Points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend the recently developed discrete geometric singular perturbation\ntheory to the non-normally hyperbolic regime. Our primary tool is the Takens\nembedding theorem, which provides a means of approximating the dynamics of\nparticular maps with the time-1 map of a formal vector field. First, we show\nthat the so-called reduced map, which governs the slow dynamics near slow\nmanifolds in the normally hyperbolic regime, can be locally approximated by the\ntime-one map of the reduced vector field which appears in continuous-time\ngeometric singular perturbation theory. In the non-normally hyperbolic regime,\nwe show that the dynamics of fast-slow maps with a unipotent linear part can be\nlocally approximated by the time-1 map induced by a fast-slow vector field in\nthe same dimension, which has a nilpotent singularity of the corresponding\ntype. The latter result is used to describe (i) the local dynamics of\ntwo-dimensional fast-slow maps with non-normally singularities of regular fold,\ntranscritical and pitchfork type, and (ii) dynamics on a (potentially high\ndimensional) local center manifold in $n$-dimensional fast-slow maps with\nregular contact or fold submanifolds of the critical manifold. In general, our\nresults show that the dynamics near a large and important class of\nsingularities in fast-slow maps can be described via the use of formal\nembedding theorems which allow for their approximation by the time-1 map of a\nfast-slow vector field featuring a loss of normal hyperbolicity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:01:39 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jelbart","Samuel",""],["Kuehn","Christian",""]]}
{"id":"2308.06142","submitter":"Dr. Mohammed Javed","authors":"Bulla Rajesh and Sk Mahafuz Zaman and Mohammed Javed and P.\n  Nagabhushan","title":"CompTLL-UNet: Compressed Domain Text-Line Localization in Challenging\n  Handwritten Documents using Deep Feature Learning from JPEG Coefficients","comments":"Accepted in 7th Asian Conference on Pattern Recognition (ACPR 2023),\n  5-8 November 2023, Kitakyushu, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic localization of text-lines in handwritten documents is still an\nopen and challenging research problem. Various writing issues such as uneven\nspacing between the lines, oscillating and touching text, and the presence of\nskew become much more challenging when the case of complex handwritten document\nimages are considered for segmentation directly in their respective compressed\nrepresentation. This is because, the conventional way of processing compressed\ndocuments is through decompression, but here in this paper, we propose an idea\nthat employs deep feature learning directly from the JPEG compressed\ncoefficients without full decompression to accomplish text-line localization in\nthe JPEG compressed domain. A modified U-Net architecture known as Compressed\nText-Line Localization Network (CompTLL-UNet) is designed to accomplish it. The\nmodel is trained and tested with JPEG compressed version of benchmark datasets\nincluding ICDAR2017 (cBAD) and ICDAR2019 (cBAD), reporting the state-of-the-art\nperformance with reduced storage and computational costs in the JPEG compressed\ndomain.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:02:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Rajesh","Bulla",""],["Zaman","Sk Mahafuz",""],["Javed","Mohammed",""],["Nagabhushan","P.",""]]}
{"id":"2308.06143","submitter":"The CMS Collaboration","authors":"CMS Collaboration","title":"Search for scalar leptoquarks produced in lepton-quark collisions and\n  coupled to $\\tau$ leptons","comments":"Submitted to Physical Review Letters. All figures and tables can be\n  found at\n  http://cms-results.web.cern.ch/cms-results/public-results/publications/EXO-22-018\n  (CMS Public Pages)","journal-ref":null,"doi":null,"report-no":"CMS-EXO-22-018, CERN-EP-2023-129","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first search for scalar leptoquarks produced in lepton-quark collisions\nand coupled to $\\tau$ leptons is presented. It is based on a set of\nproton-proton collision data recorded with the CMS detector at the LHC at a\ncenter-of-mass energy of 13 TeV corresponding to an integrated luminosity of\n138 fb$^{-1}$. The reconstructed final state consists of a jet, significant\nmissing transverse momentum, and a $\\tau$ lepton reconstructed through its\nhadronic or leptonic decays. Limits are set on the product of the leptoquark\nproduction cross section and branching fraction and interpreted as exclusions\nin the plane of the leptoquark mass and the leptoquark-$\\tau$-quark coupling\nstrength.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:04:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["CMS Collaboration","",""]]}
{"id":"2308.06144","submitter":"Sruthi S","authors":"Sruthi S, Tanmay Basu","title":"Identification of the Relevance of Comments in Codes Using Bag of Words\n  and Transformer Based Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Forum for Information Retrieval (FIRE) started a shared task this year\nfor classification of comments of different code segments. This is binary text\nclassification task where the objective is to identify whether comments given\nfor certain code segments are relevant or not. The BioNLP-IISERB group at the\nIndian Institute of Science Education and Research Bhopal (IISERB) participated\nin this task and submitted five runs for five different models. The paper\npresents the overview of the models and other significant findings on the\ntraining corpus. The methods involve different feature engineering schemes and\ntext classification techniques. The performance of the classical bag of words\nmodel and transformer-based models were explored to identify significant\nfeatures from the given training corpus. We have explored different classifiers\nviz., random forest, support vector machine and logistic regression using the\nbag of words model. Furthermore, the pre-trained transformer based models like\nBERT, RoBERT and ALBERT were also used by fine-tuning them on the given\ntraining corpus. The performance of different such models over the training\ncorpus were reported and the best five models were implemented on the given\ntest corpus. The empirical results show that the bag of words model outperforms\nthe transformer based models, however, the performance of our runs are not\nreasonably well in both training and test corpus. This paper also addresses the\nlimitations of the models and scope for further improvement.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:06:41 GMT"}],"update_date":"2023-08-14","authors_parsed":[["S","Sruthi",""],["Basu","Tanmay",""]]}
{"id":"2308.06145","submitter":"Ashwin Jacob","authors":"Ashwin Jacob, Micha{\\l} W{\\l}odarczyk, Meirav Zehavi","title":"Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is\n  Large","comments":"Accepted to ESA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the parameterized complexity of two classic problems on directed\ngraphs: Hamiltonian Cycle and its generalization {\\sc Longest Cycle}. Since\n2008, it is known that Hamiltonian Cycle is W[1]-hard when parameterized by\ndirected treewidth [Lampis et al., ISSAC'08]. By now, the question of whether\nit is FPT parameterized by the directed feedback vertex set (DFVS) number has\nbecome a longstanding open problem. In particular, the DFVS number is the\nlargest natural directed width measure studied in the literature. In this\npaper, we provide a negative answer to the question, showing that even for the\nDFVS number, the problem remains W[1]-hard. As a consequence, we also obtain\nthat Longest Cycle is W[1]-hard on directed graphs when parameterized\nmultiplicatively above girth, in contrast to the undirected case. This resolves\nan open question posed by Fomin et al. [ACM ToCT'21] and Gutin and Mnich\n[arXiv:2207.12278]. Our hardness results apply to the path versions of the\nproblems as well. On the positive side, we show that Longest Path parameterized\nmultiplicatively above girth} belongs to the class XP.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:10:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jacob","Ashwin",""],["W\u0142odarczyk","Micha\u0142",""],["Zehavi","Meirav",""]]}
{"id":"2308.06146","submitter":"Gang Zhang","authors":"Gang Zhang and Zhi Song","title":"Stable dynamic helix state in the nonintegrable XXZ Heisenberg model","comments":"7 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":"  We investigate the influence of the external fields on the stability of spin\nhelix states in a XXZ Heisenberg model. Exact diagonalization on finite system\nshows that random transverse fields in x and y directions drive the transition\nfrom integrability to nonintegrability. It results in the fast decay of a\nstatic helix state, which is the eigenstate of an unperturbed XXZ Heisenberg\nmodel. However, in the presence of uniform z field, the static helix state\nbecomes a dynamic helix state with a relatively long life as a quantum scar\nstate.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:14:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Gang",""],["Song","Zhi",""]]}
{"id":"2308.06147","submitter":"Mengkun She","authors":"Mengkun She and Yifan Song and David Nakath and Kevin K\\\"oser","title":"Efficient Large-scale AUV-based Visual Seafloor Mapping","comments":"27 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Driven by the increasing number of marine data science applications, there is\na growing interest in surveying and exploring the vast, uncharted terrain of\nthe deep sea with robotic platforms. Despite impressive results achieved by\nmany on-land visual mapping algorithms in the past decades, transferring these\nmethods from land to the deep sea remains a challenge due to harsh\nenvironmental conditions. Typically, deep-sea exploration involves the use of\nautonomous underwater vehicles (AUVs) equipped with high-resolution cameras and\nartificial illumination systems. However, images obtained in this manner often\nsuffer from heterogeneous illumination and quality degradation due to\nattenuation and scattering, on top of refraction of light rays. All of this\ntogether often lets on-land SLAM approaches fail underwater or makes\nStructure-from-Motion approaches drift or omit difficult images, resulting in\ngaps, jumps or weakly registered areas. In this work, we present a system that\nincorporates recent developments in underwater imaging and visual mapping to\nfacilitate automated robotic 3D reconstruction of hectares of seafloor. Our\napproach is efficient in that it detects and reconsiders difficult, weakly\nregistered areas, to avoid omitting images and to make better use of limited\ndive time; on the other hand it is computationally efficient; leveraging a\nhybrid approach combining benefits from SLAM and Structure-from-Motion that\nruns much faster than incremental reconstructions while achieving at least\non-par performance. The proposed system has been extensively tested and\nevaluated during several research cruises, demonstrating its robustness and\npracticality in real-world conditions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:24:03 GMT"}],"update_date":"2023-08-14","authors_parsed":[["She","Mengkun",""],["Song","Yifan",""],["Nakath","David",""],["K\u00f6ser","Kevin",""]]}
{"id":"2308.06148","submitter":"Victor Morel","authors":"Piero Romare, Victor Morel, Farzaneh Karegar, Simone Fischer-H\\\"ubner","title":"Tapping into Privacy: A Study of User Preferences and Concerns on\n  Trigger-Action Platforms","comments":"Accepted for publication at PST 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Internet of Things (IoT) devices are rapidly increasing in popularity,\nwith more individuals using Internet-connected devices that continuously\nmonitor their activities. This work explores privacy concerns and expectations\nof end-users related to Trigger-Action platforms (TAPs) in the context of the\nInternet of Things (IoT). TAPs allow users to customize their smart\nenvironments by creating rules that trigger actions based on specific events or\nconditions. As personal data flows between different entities, there is a\npotential for privacy concerns. In this study, we aimed to identify the privacy\nfactors that impact users' concerns and preferences for using IoT TAPs. To\naddress this research objective, we conducted three focus groups with 15\nparticipants and we extracted nine themes related to privacy factors using\nthematic analysis. Our participants particularly prefer to have control and\ntransparency over the automation and are concerned about unexpected data\ninferences, risks and unforeseen consequences for themselves and for bystanders\nthat are caused by the automation. The identified privacy factors can help\nresearchers derive predefined and selectable profiles of privacy permission\nsettings for IoT TAPs that represent the privacy preferences of different types\nof users as a basis for designing usable privacy controls for IoT TAPs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:25:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Romare","Piero",""],["Morel","Victor",""],["Karegar","Farzaneh",""],["Fischer-H\u00fcbner","Simone",""]]}
{"id":"2308.06149","submitter":"Mohsen Sadr","authors":"Mohsen Sadr, Manuel Torrilhon, M. Hossein Gorji","title":"Gaussian Process Regression for Maximum Entropy Distribution","comments":null,"journal-ref":"Journal of Computational Physics, Volume 418, 2020, 109644","doi":"10.1016/j.jcp.2020.109644","report-no":null,"categories":"stat.ML cs.LG math-ph math.MP physics.data-an","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Maximum-Entropy Distributions offer an attractive family of probability\ndensities suitable for moment closure problems. Yet finding the Lagrange\nmultipliers which parametrize these distributions, turns out to be a\ncomputational bottleneck for practical closure settings. Motivated by recent\nsuccess of Gaussian processes, we investigate the suitability of Gaussian\npriors to approximate the Lagrange multipliers as a map of a given set of\nmoments. Examining various kernel functions, the hyperparameters are optimized\nby maximizing the log-likelihood. The performance of the devised data-driven\nMaximum-Entropy closure is studied for couple of test cases including\nrelaxation of non-equilibrium distributions governed by Bhatnagar-Gross-Krook\nand Boltzmann kinetic equations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:26:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sadr","Mohsen",""],["Torrilhon","Manuel",""],["Gorji","M. Hossein",""]]}
{"id":"2308.06150","submitter":"Gabriel Katz","authors":"Gabriel Katz","title":"On immersions and embeddings with trivial normal line bundles","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $Z$ be a smooth compact $(n+1)$-manifold. We study smooth embeddings and\nimmersions $\\beta: M \\to Z$ of compact or closed $n$-manifolds $M$ such that\nthe normal line bundle $\\nu^\\beta$ is trivialized. For a fixed $Z$, we\nintroduce an equivalence relation between such $\\beta$'s; it is a crossover\nbetween pseudo-isotopies and bordisms. We call this equivalence relation ``{\\sf\nquasitopy}\". It comes in two flavors: $\\mathsf{IMM}(Z)$ and $\\mathsf{EMB}(Z)$,\nbased on immersions and embeddings into $Z$, respectively. We prove that the\nnatural map $\\mathsf{A}:\\mathsf{EMB}(Z) \\to \\mathsf{IMM}(Z)$ is injective and\nadmits a right inverse $\\mathsf{R}:\\mathsf{IMM}(Z) \\to \\mathsf{EMB}(Z)$,\ninduced by the resolution of self-intersections. As a result, we get a map\n$$\\mathcal B\\Sigma:\\; \\mathsf{IMM}(Z) \\big/ \\mathsf{A}(\\mathsf{EMB}(Z))\n\\longrightarrow \\bigoplus_{k \\in [2, n+1]} \\mathbf B_{n+1-k}(Z)$$ whose target\nis a collection of smooth bordism groups of the space $Z$ and which\ndifferentiate between immersions and embeddings.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:28:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Katz","Gabriel",""]]}
{"id":"2308.06151","submitter":"Yan Li","authors":"Yan Li, Rong-Feng Shen, Bin-Bin Zhang","title":"Quasi-periodic oscillation in short gamma-ray bursts from black\n  hole-neutron star mergers","comments":"13 pages, 8 figures, Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Short-duration gamma-ray bursts (sGRBs) are commonly attributed to the\nmergers of double neutron stars (NSs) or the mergers of a neutron star with a\nblack hole (BH). While the former scenario was confirmed by the event GW170817,\nthe latter remains elusive. Here, we consider the latter scenario in which, a\nNS is tidally disrupted by a fast spinning low-mass BH and the accretion onto\nthe BH launches a relativistic jet and hence produces a sGRB. The merging\nbinary's orbit is likely misaligned with the BH's spin. Hence, the\nLense-Thirring precession around the BH may cause a hyper-accreting thick disk\nto precess in a solid-body manner. We propose that a jet, initially aligned\nwith the BH spin, is deflected and collimated by the wind from the disk,\ntherefore being forced to precess along with the disk. This would result in a\nquasi-periodic oscillation or modulation in the gamma-ray light curve of the\nsGRB, with a quasi-period of $\\sim 0.01-0.1$ s. The appearance of the\nmodulation may be delayed respective to the triggering of the light curve. This\nfeature, unique to the BH-NS merger, may have already revealed itself in a few\nobserved sGRBs (such as GRB 130310A), and it carries the spin-obit orientation\ninformation of the merging system. Identification of this feature would be a\nnew approach to reveal spin-orbit-misaligned merging BH-NS systems, which are\nlikely missed by the current gravitational-wave searching strategy principally\ntargeting aligned systems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:29:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Yan",""],["Shen","Rong-Feng",""],["Zhang","Bin-Bin",""]]}
{"id":"2308.06152","submitter":"Jinqiang Chen","authors":"Jinqiang Chen, Vandana Dwarka, Cornelis Vuik","title":"A matrix-free parallel two-level deflation preconditioner for the\n  two-dimensional Helmholtz problems","comments":"36 pages, 18 figures, a manuscript to be submitted as a journal paper","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 matrix-free parallel two-level-deflation preconditioner combined\nwith the Complex Shifted Laplacian preconditioner(CSLP) for the two-dimensional\nHelmholtz problems. The Helmholtz equation is widely studied in seismic\nexploration, antennas, and medical imaging. It is one of the hardest problems\nto solve both in terms of accuracy and convergence, due to scalability issues\nof the numerical solvers. Motivated by the observation that for large\nwavenumbers, the eigenvalues of the CSLP-preconditioned system shift towards\nzero, deflation with multigrid vectors, and further high-order vectors were\nincorporated to obtain wave-number-independent convergence. For large-scale\napplications, high-performance parallel scalable methods are also\nindispensable. In our method, we consider the preconditioned Krylov subspace\nmethods for solving the linear system obtained from finite-difference\ndiscretization. The CSLP preconditioner is approximated by one parallel\ngeometric multigrid V-cycle. For the two-level deflation, the matrix-free\nGalerkin coarsening as well as high-order re-discretization approaches on the\ncoarse grid are studied. The results of matrix-vector multiplications in Krylov\nsubspace methods and the interpolation/restriction operators are implemented\nbased on the finite-difference grids without constructing any coefficient\nmatrix. These adjustments lead to direct improvements in terms of memory\nconsumption. Numerical experiments of model problems show that wavenumber\nindependence has been obtained for medium wavenumbers. The matrix-free parallel\nframework shows satisfactory weak and strong parallel scalability.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:30:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Jinqiang",""],["Dwarka","Vandana",""],["Vuik","Cornelis",""]]}
{"id":"2308.06153","submitter":"Juan Ruiz-Alvarez","authors":"Sergio Amat, David Levin, Juan Ruiz-\\'Alvarez, Dionisio F. Y\\'a\\~nez","title":"Non-linear WENO B-spline based approximation method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we present a new WENO b-spline based quasi-interpolation\nalgorithm. The novelty of this construction resides in the application of the\nWENO weights to the b-spline functions, that are a partition of unity, instead\nto the coefficients that multiply the b-spline functions of the spline. The\nresult obtained conserves the smoothness of the original spline and presents\nadaption to discontinuities in the function. Another new idea that we introduce\nin this work is the use of different base weight functions from those proposed\nin classical WENO algorithms. Apart from introducing the construction of the\nnew algorithms, we present theoretical results regarding the order of accuracy\nobtained at smooth zones and close to the discontinuity, as well as theoretical\nconsiderations about how to design the new weight functions. Through a tensor\nproduct strategy, we extend our results to several dimensions. In order to\ncheck the theoretical results obtained, we present an extended battery of\nnumerical experiments in one, two and tree dimensions that support our\nconclussions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:31:59 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Amat","Sergio",""],["Levin","David",""],["Ruiz-\u00c1lvarez","Juan",""],["Y\u00e1\u00f1ez","Dionisio F.",""]]}
{"id":"2308.06154","submitter":"Boyuan Liu","authors":"Boyuan Liu, Nina S. Sartorio, Robert G. Izzard and Anastasia Fialkov","title":"Population synthesis of Be X-ray binaries: metallicity dependence of\n  total X-ray outputs","comments":"25 pages, 16+7 figures, submitted to MNRAS, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  X-ray binaries (XRBs) are thought to regulate cosmic thermal and ionisation\nhistories during the Epoch of Reionisation and Cosmic Dawn ($z\\sim 5-30$).\nTheoretical predictions of the X-ray emission from XRBs are important for\nmodeling such early cosmic evolution. Nevertheless, the contribution from\nBe-XRBs, powered by accretion of compact objects from decretion disks around\nrapidly rotating O/B stars, has not been investigated systematically. Be-XRBs\nare the largest class of high-mass XRBs (HMXBs) identified in local\nobservations and are expected to play even more important roles in metal-poor\nenvironments at high redshifts. In light of this, we build a physically\nmotivated model for Be-XRBs based on recent hydrodynamic simulations and\nobservations of decretion disks. Our model is able to reproduce the observed\npopulation of Be-XRBs in the Small Magellanic Cloud with appropriate initial\nconditions and binary stellar evolution parameters. We derive the X-ray output\nfrom Be-XRBs as a function of metallicity in the (absolute) metallicity range\n$Z\\in [10^{-4},0.03]$. We find that Be-XRBs can contribute a significant\nfraction ($\\sim 60\\%$) of the total X-ray budget from HMXBs observed in nearby\ngalaxies for $Z\\sim 0.0003-0.02$. A similar fraction of observed ultra-luminous\n($\\gtrsim 10^{39}\\ \\rm erg\\ s^{-1}$) X-ray sources can also be explained by\nBe-XRBs. Moreover, the predicted metallicty dependence in our fiducial model is\nconsistent with observations, showing a factor of $\\sim 8$ increase in X-ray\nluminosity per unit star formation rate from $Z=0.02$ to $Z=0.0003$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:33:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Boyuan",""],["Sartorio","Nina S.",""],["Izzard","Robert G.",""],["Fialkov","Anastasia",""]]}
{"id":"2308.06155","submitter":"Tianpu Zhang","authors":"Weilong Ding, Tianpu Zhang, Zhe Wang","title":"Phased Deep Spatio-temporal Learning for Highway Traffic Volume\n  Prediction","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":"  Inter-city highway transportation is significant for citizens' modern urban\nlife and generates heterogeneous sensory data with spatio-temporal\ncharacteristics. As a routine analysis in transportation domain, daily traffic\nvolume estimation faces challenges for highway toll stations including lacking\nof exploration of correlative spatio-temporal features from a long-term\nperspective and effective means to deal with data imbalance which always\ndeteriorates the predictive performance. In this paper, a deep spatio-temporal\nlearning method is proposed to predict daily traffic volume in three phases. In\nfeature pre-processing phase, data is normalized elaborately according to\nlatent long-tail distribution. In spatio-temporal learning phase, a hybrid\nmodel is employed combining fully convolution network (FCN) and long short-term\nmemory (LSTM), which considers time, space, meteorology, and calendar from\nheterogeneous data. In decision phase, traffic volumes on a coming day at\nnetwork-wide toll stations would be achieved effectively, which is especially\ncalibrated for vital few highway stations. Using real-world data from one\nChinese provincial highway, extensive experiments show our method has distinct\nimprovement for predictive accuracy than various traditional models, reaching\n5.269 and 0.997 in MPAE and R-squre metrics, respectively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:33:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ding","Weilong",""],["Zhang","Tianpu",""],["Wang","Zhe",""]]}
{"id":"2308.06156","submitter":"Yasumasa Yamasaki","authors":"Y. Yamasaki and H. Imada","title":"Quantification of propagation modes in an astronomical instrument from\n  its radiation pattern","comments":"7 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. Understanding complex phenomena and unsolved problems in modern\nastronomy requires wider-bandwidth observations. The current technique for\ndesigning and fabricating an astronomical instrument potentially provides such\nobservations with higher efficiency and precision than in the past.\nHigher-order modes in an instrument associated with wider bandwidths have been\nreported, which may degrade observation precision. Aims. To reduce the\nunfavorable degradation, we need to quantify the higher-order propagation\nmodes, though their power is too difficult to measure directly. Instead of the\ndirect mode measurement, we aim at developing a method based on measurable\nradiation patterns from an instrument of interest. Method. Assuming a linear\nsystem, whose radiated field is determined as a superposition of the mode\ncoefficients in an instrument, we obtain a coefficient matrix connecting the\ninside modes and the outside radiated field and calculate the pseudo-inverse\nmatrix. To understand the estimation accuracy of the proposed method, we\ndemonstrate two cases with numerical simulations, axially-corrugated horn case\nand offset Cassegrain antenna case, and investigate the effect of random errors\non the accuracy. Results. Both cases showed the estimated mode coefficients\nwith a precision of 10e-6 with respect to the maximum mode amplitude and 10e-3\ndegrees in phase, respectively. The calculation errors were observed when the\nrandom errors were smaller than 0.01 percent of the maximum radiated field\namplitude. The demonstrated method works independently of the details of a\nsystem. Conclusions. The method can quantify the propagation modes inside an\ninstrument and will be applicable to most of linear components and antennas.\nThis method can be employed for a general purpose, such as diagnosis of feed\nalignment and higher-performance feed design.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:33:59 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 04:17:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yamasaki","Y.",""],["Imada","H.",""]]}
{"id":"2308.06157","submitter":"Haohan Chen","authors":"Haohan Chen, Jiepeng Wu, Minglei He, Hao Wang, Xinen Wu, Kezhou Fan,\n  Haiying Liu, Qiang Li, Lijun Wu and Kam Sing Wong","title":"High efficiency spin-decoupled modulation using chiral C2-symmetric\n  meta-atoms","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":"  Orthogonal circularly polarized light is essential for multiplexing tunable\nmetasurfaces. Mainstream spin-decoupled metasurfaces, consisting of numerous\nmeta-atoms with mirror symmetry, rely on the cooperative modulation of the\nPancharatnam-Berry (PB) phase and the propagation phase. This paper\ndemonstrates spin-decoupled functionality through the synergistic utilization\nof planar chiral meta-atom phase response and PB phase. Based on the Jones\ncalculus, it has been found that meta-atoms with chiral C2-symmetry owns a\nlarger geometric parameter range with high cross-polarization ratio compared to\nthose with mirror symmetry or higher symmetries at the same aspect ratio. This\ncharacteristic is advantageous in terms of enabling high-efficiency\nmanipulation and enhancing the signal-to-noise ratio. As an example, 10 kinds\nof C2-symmetry chiral meta-atoms with a H-like shape are selected by the\nself-adaptive genetic algorithm to attain a full 2$\\pi$ phase span with an\ninterval of $\\pi$/5. To mitigate the additional propagation phase change of the\nguided modes originated from the arrangement alternation upon the rotation of\nthe meta-atoms, the enantiomer of chiral meta-atoms and its PB phase delay are\nadopted to minimize the difference between the actual and desired target\nphases. A polarization-insensitive metalens and a chiral virtual-moving\nmetalens array are designed to demonstrate the spin-decoupled function with\nboth high efficiency and signal-to-noise ratio. The work in this paper may\ntrigger more exciting and interesting spin-decoupled multiplexing metasurfaces\nand broaden the prospect of chiroptical applications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:35:13 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Haohan",""],["Wu","Jiepeng",""],["He","Minglei",""],["Wang","Hao",""],["Wu","Xinen",""],["Fan","Kezhou",""],["Liu","Haiying",""],["Li","Qiang",""],["Wu","Lijun",""],["Wong","Kam Sing",""]]}
{"id":"2308.06158","submitter":"Alexander Thomas","authors":"Alexander Thomas","title":"Infinitesimal modular group: $q$-deformed $\\mathfrak{sl}_2$ and Witt\n  algebra","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe new 1-parameter families of Lie algebras deforming the\n3-dimensional Heisenberg algebra, the simple Lie algebra $\\mathfrak{sl}_2$ and\nthe Witt algebra. They are constructed through a realization as differential\noperators. These operators are related to the modular group and $q$-deformed\nrational numbers defined by Morier-Genoud and Ovsienko and lead to $q$-deformed\nM\\\"obius transformations acting on the hyperbolic plane.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:36:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Thomas","Alexander",""]]}
{"id":"2308.06159","submitter":"Daniel Cao Labora","authors":"Daniel Cao Labora","title":"A visual and simple proof for the Picard Little Theorem","comments":"One figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most famous results in Complex Analysis is the Little Picard\nTheorem, that characterizes the image set of an arbitrary entire function.\nSpecifically, the theorem states that this image set is either the whole\ncomplex plane or the whole complex plane except a point. The traditional proofs\nfor the theorem involve technical tools such as either modular functions,\nHarnack's inequality, Bloch and Landau theorems... The previous fact makes the\nLittle Picard Theorem to be often presented at initial courses on Complex\nAnalysis without a proof. This manuscript provides a short and visual proof by\nonly using basic concepts that are covered in any standard course on Complex\nAnalysis. In fact, the essence of the proof is a good understanding of\ncomposition of the complex exponential map with itself and its underlying\ngeometrical properties.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:36:47 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Labora","Daniel Cao",""]]}
{"id":"2308.06160","submitter":"Weijia Wu","authors":"Weijia Wu, Yuzhong Zhao, Hao Chen, Yuchao Gu, Rui Zhao, Yefei He, Hong\n  Zhou, Mike Zheng Shou, Chunhua Shen","title":"DatasetDM: Synthesizing Data with Perception Annotations Using Diffusion\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current deep networks are very data-hungry and benefit from training on\nlargescale datasets, which are often time-consuming to collect and annotate. By\ncontrast, synthetic data can be generated infinitely using generative models\nsuch as DALL-E and diffusion models, with minimal effort and cost. In this\npaper, we present DatasetDM, a generic dataset generation model that can\nproduce diverse synthetic images and the corresponding high-quality perception\nannotations (e.g., segmentation masks, and depth). Our method builds upon the\npre-trained diffusion model and extends text-guided image synthesis to\nperception data generation. We show that the rich latent code of the diffusion\nmodel can be effectively decoded as accurate perception annotations using a\ndecoder module. Training the decoder only needs less than 1% (around 100\nimages) manually labeled images, enabling the generation of an infinitely large\nannotated dataset. Then these synthetic data can be used for training various\nperception models for downstream tasks. To showcase the power of the proposed\napproach, we generate datasets with rich dense pixel-wise labels for a wide\nrange of downstream tasks, including semantic segmentation, instance\nsegmentation, and depth estimation. Notably, it achieves 1) state-of-the-art\nresults on semantic segmentation and instance segmentation; 2) significantly\nmore robust on domain generalization than using the real data alone; and\nstate-of-the-art results in zero-shot segmentation setting; and 3) flexibility\nfor efficient application and novel task composition (e.g., image editing). The\nproject website and code can be found at\nhttps://weijiawu.github.io/DatasetDM_page/ and\nhttps://github.com/showlab/DatasetDM, respectively\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:38:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Wu","Weijia",""],["Zhao","Yuzhong",""],["Chen","Hao",""],["Gu","Yuchao",""],["Zhao","Rui",""],["He","Yefei",""],["Zhou","Hong",""],["Shou","Mike Zheng",""],["Shen","Chunhua",""]]}
{"id":"2308.06161","submitter":"Rui Xu","authors":"Rui Xu, Yong Luo, Han Hu, Bo Du, Jialie Shen, Yonggang Wen","title":"Rethinking the Localization in Weakly Supervised Object Localization","comments":"Accepted by ACM International Conference on Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Weakly supervised object localization (WSOL) is one of the most popular and\nchallenging tasks in computer vision. This task is to localize the objects in\nthe images given only the image-level supervision. Recently, dividing WSOL into\ntwo parts (class-agnostic object localization and object classification) has\nbecome the state-of-the-art pipeline for this task. However, existing solutions\nunder this pipeline usually suffer from the following drawbacks: 1) they are\nnot flexible since they can only localize one object for each image due to the\nadopted single-class regression (SCR) for localization; 2) the generated pseudo\nbounding boxes may be noisy, but the negative impact of such noise is not well\naddressed. To remedy these drawbacks, we first propose to replace SCR with a\nbinary-class detector (BCD) for localizing multiple objects, where the detector\nis trained by discriminating the foreground and background. Then we design a\nweighted entropy (WE) loss using the unlabeled data to reduce the negative\nimpact of noisy bounding boxes. Extensive experiments on the popular\nCUB-200-2011 and ImageNet-1K datasets demonstrate the effectiveness of our\nmethod.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:38:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Xu","Rui",""],["Luo","Yong",""],["Hu","Han",""],["Du","Bo",""],["Shen","Jialie",""],["Wen","Yonggang",""]]}
{"id":"2308.06162","submitter":"Neville Harnew","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, M. Andreotti, D. Andreou, D.\n  Ao, F. Archilli, A. Artamonov, M. Artuso, E. Aslanides, M. Atzeni, B.\n  Audurier, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J.J. Back, A.\n  Bailly-reyre, P. Baladron Rodriguez, V. Balagura, W. Baldini, J. Baptista de\n  Souza Leite, M. Barbetti, R.J. Barlow, S. Barsuk, W. Barter, M. Bartolini, F.\n  Baryshnikov, J.M. Basels, G. Bassi, B. Batsukh, A. Battig, A. Bay, A. Beck,\n  M. Becker, F. Bedeschi, I.B. Bediaga, A. Beiter, S. Belin, V. Bellee, K.\n  Belous, I. Belov, I. Belyaev, G. Benane, G. Bencivenni, E. Ben-Haim, A.\n  Berezhnoy, R. Bernet, S. Bernet Andres, D. Berninghoff, H.C. Bernstein, C.\n  Bertella, A. Bertolin, C. Betancourt, F. Betti, Ia. Bezshyiko, J. Bhom, L.\n  Bian, M.S. Bieker, N.V. Biesuz, P. Billoir, A. Biolchini, M. Birch, F.C.R.\n  Bishop, A. Bitadze, A. Bizzeti, M.P. Blago, T. Blake, F. Blanc, J.E. Blank,\n  S. Blusk, D. Bobulska, V. Bocharnikov, J.A. Boelhauve, O. Boente Garcia, T.\n  Boettcher, A. Boldyrev, C.S. Bolognani, R. Bolzonella, N. Bondar, F. Borgato,\n  S. Borghi, M. Borsato, J.T. Borsuk, S.A. Bouchiba, T.J.V. Bowcock, A. Boyer,\n  C. Bozzi, M.J. Bradley, S. Braun, A. Brea Rodriguez, J. Brodzicka, A. Brossa\n  Gonzalo, J. Brown, D. Brundu, A. Buonaura, L. Buonincontri, A.T. Burke, C.\n  Burr, A. Bursche, A. Butkevich, J.S. Butter, J. Buytaert, W. Byczynski, S.\n  Cadeddu, H. Cai, R. Calabrese, L. Calefice, S. Cali, M. Calvi, M. Calvo\n  Gomez, P. Campana, D.H. Campora Perez, A.F. Campoverde Quezada, S. Capelli,\n  L. Capriotti, A. Carbone, R. Cardinale, A. Cardini, P. Carniti, L. Carus, A.\n  Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini,\n  S. Celani, J. Cerasoli, D. Cervenkov, A.J. Chadwick, I. Chahrour, M.G.\n  Chapman, M. Charles, Ph. Charpentier, C.A. Chavez Barajas, M. Chefdeville, C.\n  Chen, S. Chen, A. Chernov, S. Chernyshenko, V. Chobanova, S. Cholak, M.\n  Chrzaszcz, A. Chubykin, V. Chulikov, P. Ciambrone, M.F. Cicala, X. Cid Vidal,\n  G. Ciezarek, P. Cifra, G. Ciullo, P.E.L. Clarke, M. Clemencic, H.V. Cliff, J.\n  Closier, J.L. Cobbledick, V. Coco, J. Cogan, E. Cogneras, L. Cojocariu, P.\n  Collins, T. Colombo, L. Congedo, A. Contu, N. Cooke, I. Corredoira, G. Corti,\n  B. Couturier, D.C. Craik, M. Cruz Torres, R. Currie, C.L. Da Silva, S.\n  Dadabaev, L. Dai, X. Dai, E. Dall'Occo, J. Dalseno, C. D'Ambrosio, J. Daniel,\n  A. Danilina, P. d'Argent, J.E. Davies, A. Davis, O. De Aguiar Francisco, J.\n  de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De Freitas Carneiro Da\n  Graca, E. De Lucia, J.M. De Miranda, L. De Paula, M. De Serio, D. De Simone,\n  P. De Simone, F. De Vellis, J.A. de Vries, C.T. Dean, F. Debernardis, D.\n  Decamp, V. Dedu, L. Del Buono, B. Delaney, H.-P. Dembinski, V. Denysenko, O.\n  Deschamps, F. Dettori, B. Dey, P. Di Nezza, I. Diachkov, S. Didenko, L.\n  Dieste Maronas, S. Ding, V. Dobishuk, A. Dolmatov, C. Dong, A.M. Donohoe, F.\n  Dordei, A.C. dos Reis, L. Douglas, A.G. Downes, P. Duda, M.W. Dudek, L.\n  Dufour, V. Duk, P. Durante, M. M. Duras, J.M. Durham, D. Dutta, A. Dziurda,\n  A. Dzyuba, S. Easo, U. Egede, V. Egorychev, C. Eirea Orro, S. Eisenhardt, E.\n  Ejopu, S. Ek-In, L. Eklund, M. Elashri, J. Ellbracht, S. Ely, A. Ene, E.\n  Epple, S. Escher, J. Eschle, S. Esen, T. Evans, F. Fabiano, L.N. Falcao, Y.\n  Fan, B. Fang, L. Fantini, M. Faria, S. Farry, D. Fazzini, L. Felkowski, M.\n  Feo, M. Fernandez Gomez, A.D. Fernez, F. Ferrari, L. Ferreira Lopes, F.\n  Ferreira Rodrigues, S. Ferreres Sole, M. Ferrillo, M. Ferro-Luzzi, S.\n  Filippov, R.A. Fini, M. Fiorini, M. Firlej, K.M. Fischer, D.S. Fitzgerald, C.\n  Fitzpatrick, T. Fiutowski, F. Fleuret, M. Fontana, F. Fontanelli, R. Forty,\n  D. Foulds-Holt, V. Franco Lima, M. Franco Sevilla, M. Frank, E. Franzoso, G.\n  Frau, C. Frei, D.A. Friday, L. Frontini, J. Fu, Q. Fuehring, T. Fulghesu, E.\n  Gabriel, G. Galati, M.D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta,\n  M. Gandelman, P. Gandini, H. Gao, Y. Gao, Y. Gao, M. Garau, L.M. Garcia\n  Martin, P. Garcia Moreno, J. Garc\\'ia Pardi\\~nas, B. Garcia Plana, F.A.\n  Garcia Rosales, L. Garrido, C. Gaspar, R.E. Geertsema, D. Gerick, L.L.\n  Gerken, E. Gersabeck, M. Gersabeck, T. Gershon, L. Giambastiani, V. Gibson,\n  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, V.V.\n  Gligorov, C. G\\\"obel, E. Golobardes, D. Golubkov, A. Golutvin, A. Gomes, S.\n  Gomez Fernandez, F. Goncalves Abrantes, M. Goncerz, G. Gong, I.V. Gorelov, C.\n  Gotti, J.P. Grabowski, T. Grammatico, L.A. Granado Cardoso, E. Graug\\'es, E.\n  Graverini, G. Graziani, A. T. Grecu, L.M. Greeven, N.A. Grieser, L. Grillo,\n  S. Gromov, B.R. Gruberg Cazon, C. Gu, M. Guarise, M. Guittiere, P. A.\n  G\\\"unther, E. Gushchin, A. Guth, Y. Guz, T. Gys, T. Hadavizadeh, C.\n  Hadjivasiliou, G. Haefeli, C. Haen, J. Haimberger, S.C. Haines, T.\n  Halewood-leagas, M.M. Halvorsen, P.M. Hamilton, J. Hammerich, Q. Han, X. Han,\n  T.H. Hancock, S. Hansmann-Menzemer, L. Hao, N. Harnew, T. Harrison, C. Hasse,\n  M. Hatch, J. He, K. Heijhoff, F. Hemmer, C. Henderson, R.D.L. Henderson, A.M.\n  Hennequin, K. Hennessy, L. Henry, J. Herd, J. Heuel, A. Hicheur, D. Hill, M.\n  Hilton, S.E. Hollitt, J. Horswill, R. Hou, Y. Hou, J. Hu, J. Hu, W. Hu, X.\n  Hu, W. Huang, X. Huang, W. Hulsbergen, R.J. Hunter, M. Hushchyn, D.\n  Hutchcroft, P. Ibis, M. Idzik, D. Ilin, P. Ilten, A. Inglessi, A. Iniukhin,\n  A. Ishteev, K. Ivshin, R. Jacobsson, H. Jage, S.J. Jaimes Elles, S. Jakobsen,\n  E. Jans, B.K. Jashal, A. Jawahery, V. Jevtic, E. Jiang, X. Jiang, Y. Jiang,\n  M. John, D. Johnson, C.R. Jones, T.P. Jones, S. Joshi, B. Jost, N. Jurik, I.\n  Juszczak, S. Kandybei, Y. Kang, M. Karacson, D. Karpenkov, M. Karpov, J.W.\n  Kautz, F. Keizer, D.M. Keller, M. Kenzie, T. Ketel, B. Khanji, A. Kharisova,\n  S. Kholodenko, G. Khreich, T. Kirn, V.S. Kirsebom, O. Kitouni, S. Klaver, N.\n  Kleijne, K. Klimaszewski, M.R. Kmiec, S. Koliiev, L. Kolk, A. Kondybayeva, A.\n  Konoplyannikov, P. Kopciewicz, R. Kopecna, P. Koppenburg, M. Korolev, I.\n  Kostiuk, O. Kot, S. Kotriakhova, A. Kozachuk, P. Kravchenko, L. Kravchuk, M.\n  Kreps, S. Kretzschmar, P. Krokovny, W. Krupa, W. Krzemien, J. Kubat, S.\n  Kubis, W. Kucewicz, M. Kucharczyk, V. Kudryavtsev, E. Kulikova, A. Kupsc, D.\n  Lacarrere, G. Lafferty, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez,\n  J.J. Lane, R. Lane, C. Langenbruch, J. Langer, O. Lantwin, T. Latham, F.\n  Lazzari, C. Lazzeroni, R. Le Gac, S.H. Lee, R. Lef\\`evre, A. Leflat, S.\n  Legotin, P. Lenisa, O. Leroy, T. Lesiak, B. Leverington, A. Li, H. Li, K. Li,\n  P. Li, P.-R. Li, S. Li, T. Li, T. Li, Y. Li, Z. Li, X. Liang, C. Lin, T. Lin,\n  R. Lindner, V. Lisovskyi, R. Litvinov, G. Liu, H. Liu, K. Liu, Q. Liu, S.\n  Liu, A. Lobo Salvia, A. Loi, R. Lollini, J. Lomba Castro, 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, A. Lusiani, K. Lynch, X.-R. Lyu, R. Ma, S. Maccolini, F.\n  Machefert, F. Maciuc, I. Mackay, V. Macko, L.R. Madhan Mohan, A. Maevskiy, D.\n  Maisuzenko, M.W. Majewski, J.J. Malczewski, S. Malde, B. Malecki, 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, S. Meloni, M. Merk, A. Merli, L. Meyer\n  Garcia, D. Miao, H. Miao, M. Mikhasenko, D.A. Milanes, E. Millard, M.\n  Milovanovic, M.-N. Minard, A. Minotti, E. Minucci, T. Miralles, S.E.\n  Mitchell, B. Mitreska, D.S. Mitzel, A. Modak, A. M\\\"odden, R.A. Mohammed,\n  R.D. Moise, S. Mokhnenko, T. Momb\\\"acher, M. Monk, I.A. Monroy, S. Monteil,\n  G. Morello, M.J. Morello, M.P. Morgenthaler, J. Moron, A.B. Morris, A.G.\n  Morris, R. Mountain, H. Mu, E. Muhammad, F. Muheim, M. Mulder, K. M\\\"uller,\n  C.H. Murphy, D. Murray, R. Murta, P. Muzzetto, P. Naik, T. Nakada, R.\n  Nandakumar, T. Nanut, I. Nasteva, M. Needham, N. Neri, S. Neubert, N.\n  Neufeld, P. Neustroev, R. Newcombe, J. Nicolini, D. Nicotra, E.M. Niel, S.\n  Nieswand, N. Nikitin, N.S. Nolte, C. Normand, J. Novoa Fernandez, G. Nowak,\n  C. Nunez, A. Oblakowska-Mucha, V. Obraztsov, T. Oeser, S. Okamura, R.\n  Oldeman, F. Oliva, 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, W. Parker, C.\n  Parkes, B. Passalacqua, G. Passaleva, A. Pastore, M. Patel, C. Patrignani,\n  C.J. Pawley, A. Pellegrino, M. Pepe Altarelli, S. Perazzini, D. Pereima, A.\n  Pereiro Castro, P. Perret, K. Petridis, A. Petrolini, S. Petrucci, M.\n  Petruzzo, H. Pham, A. Philippov, R. Piandani, L. Pica, M. Piccini, B.\n  Pietrzyk, G. Pietrzyk, M. Pili, D. Pinci, F. Pisani, M. Pizzichemi, V.\n  Placinta, J. Plews, M. Plo Casasus, F. Polci, M. Poli Lener, A. Poluektov, N.\n  Polukhina, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, S. Poslavskii, K.\n  Prasanth, L. Promberger, C. Prouve, V. Pugatch, V. Puill, G. Punzi, H.R. Qi,\n  W. Qian, N. Qin, S. Qu, R. Quagliani, N.V. Raab, B. Rachwal, J.H. Rademacker,\n  R. Rajagopalan, M. Rama, M. Ramos Pernas, M.S. Rangel, F. Ratnikov, G. Raven,\n  M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, C. Remon Alepuz, Z. Ren,\n  P.K. Resmi, R. Ribatti, A.M. Ricci, S. Ricciardi, K. Richardson, M.\n  Richardson-Slipper, K. Rinnert, P. Robbe, G. Robertson, E. Rodrigues, E.\n  Rodriguez Fernandez, J.A. Rodriguez Lopez, E. Rodriguez Rodriguez, D.L. Rolf,\n  A. Rollings, P. Roloff, V. Romanovskiy, M. Romero Lamas, A. Romero Vidal,\n  J.D. Roth, 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, E. Santovetti, D. Saranin, G. Sarpis, M.\n  Sarpis, A. Sarti, C. Satriano, A. Satta, M. Saur, D. Savrina, H. Sazak, L.G.\n  Scantlebury Smead, A. Scarabotto, S. Schael, S. Scherl, A. M. Schertz, M.\n  Schiller, H. Schindler, M. Schmelling, B. Schmidt, S. Schmitt, O. Schneider,\n  A. Schopper, M. Schubiger, N. Schulte, S. Schulte, M.H. Schune, R. Schwemmer,\n  B. Sciascia, A. Sciuccati, S. Sellam, A. Semennikov, M. Senghi Soares, A.\n  Sergi, N. Serra, L. Sestini, A. Seuthe, Y. Shang, D.M. Shangase, M. Shapkin,\n  I. Shchemerov, L. Shchutska, T. Shears, L. Shekhtman, Z. Shen, S. Sheng, V.\n  Shevchenko, B. Shi, E.B. Shields, Y. Shimizu, E. Shmanin, R. Shorkin, J.D.\n  Shupperd, B.G. Siddi, R. Silva Coutinho, G. Simi, S. Simone, M. Singla, N.\n  Skidmore, R. Skuza, T. Skwarnicki, M.W. Slater, J.C. Smallwood, J.G. Smeaton,\n  E. Smith, K. Smith, M. Smith, A. Snoch, L. Soares Lavra, M.D. Sokoloff,\n  F.J.P. Soler, A. Solomin, A. Solovev, I. Solovyev, R. Song, F.L. Souza De\n  Almeida, B. Souza De Paula, B. Spaan, E. Spadaro Norella, E. Spedicato, J.G.\n  Speer, E. Spiridenkov, P. Spradlin, V. Sriskaran, F. Stagni, M. Stahl, S.\n  Stahl, S. 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, A. Szabelski, T. Szumlak, M. Szymanski, Y. Tan, S. Taneja, M.D.\n  Tat, A. Terentev, F. Teubert, E. Thomas, D.J.D. Thompson, H. Tilquin, V.\n  Tisserand, S. T'Jampens, M. Tobin, L. Tomassetti, G. Tonani, X. Tong, D.\n  Torres Machado, D.Y. Tou, C. Trippl, G. Tuci, N. Tuning, A. Ukleja, D.J.\n  Unverzagt, A. Usachov, A. Ustyuzhanin, U. Uwer, V. Vagnoni, A. Valassi, G.\n  Valenti, N. Valls Canudas, M. Van Dijk, H. Van Hecke, E. van Herwijnen, C.B.\n  Van Hulse, M. van Veghel, R. Vazquez Gomez, P. Vazquez Regueiro, C. V\\'azquez\n  Sierra, S. Vecchi, J.J. Velthuis, M. Veltri, A. Venkateswaran, M. Veronesi,\n  M. 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, R. Wang, X. Wang, Y. Wang, Z.\n  Wang, Z. Wang, Z. Wang, J.A. Ward, N.K. Watson, D. Websdale, Y. Wei, B.D.C.\n  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, K. Wyllie, Z. Xiang, Y. Xie, A. Xu, J.\n  Xu, L. Xu, L. Xu, M. Xu, Q. Xu, Z. Xu, Z. Xu, D. Yang, S. Yang, X. Yang, Y.\n  Yang, Z. Yang, Z. Yang, L.E. Yeomans, V. Yeroshenko, H. Yeung, H. Yin, J. Yu,\n  X. Yuan, E. Zaffaroni, M. Zavertyaev, M. Zdybal, M. Zeng, C. Zhang, D. 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, X. Zhu, X. Zhu,\n  Z. Zhu, V. Zhukov, Q. Zou, S. Zucchelli, D. Zuliani, G. Zunica","title":"A search for rare $B \\rightarrow D \\mu^+ \\mu^-$ decays","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-2022-048.html (LHCb\n  public pages)","journal-ref":null,"doi":null,"report-no":"LHCb-PAPER-2022-048, CERN-EP-2023-121","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A search for rare $B \\rightarrow D \\mu^+ \\mu^-$ decays is performed using\nproton-proton collision data collected by the LHCb experiment, corresponding to\nan integrated luminosity of 9 fb$^{-1}$. No significant signals are observed in\nthe non-resonant $\\mu^+\\mu^-$ modes, and upper limits of $\\mathcal{B}(B^0\n\\rightarrow \\overline{D}^0 \\mu^+ \\mu^-) < 5.1 \\times 10^{-8}$, $\\mathcal{B}(B^+\n\\rightarrow D_s^+ \\mu^+ \\mu^-) < 3.2 \\times 10^{-8}$, $\\mathcal{B}(B_s^0\n\\rightarrow \\overline{D}^0 \\mu^+ \\mu^-) < 1.6 \\times 10^{-7}$ and $f_c/f_u\n\\cdot \\mathcal{B}(B_c^+ \\rightarrow D_s^+ \\mu^+ \\mu^-) < 9.6 \\times 10^{-8}$\nare set at the 95\\% confidence level, where $f_c$ and $f_u$ are the\nfragmentation fractions of a $B$ meson with a $c$ and $u$ quark respectively in\nproton-proton collisions. Each result is either the first such measurement or\nan improvement by three orders of magnitude on an existing limit. Separate\nupper limits are calculated when the muon pair originates from a $J/\\psi\n\\rightarrow \\mu^+ \\mu^-$ decay. The branching fraction of $B_c^+ \\rightarrow\nD_s^+ J/\\psi$ multiplied by the fragmentation-fraction ratio is measured to be\n$f_c/f_u \\cdot \\mathcal{B}(B_c^+ \\rightarrow D_s^+ J/\\psi ) = (1.63 \\pm 0.15\n\\pm 0.13) \\times 10^{-5}$, where the first uncertainty is statistical and the\nsecond systematic.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:40:58 GMT"}],"update_date":"2023-08-14","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.",""],["Andreotti","M.",""],["Andreou","D.",""],["Ao","D.",""],["Archilli","F.",""],["Artamonov","A.",""],["Artuso","M.",""],["Aslanides","E.",""],["Atzeni","M.",""],["Audurier","B.",""],["Perea","I. Bachiller",""],["Bachmann","S.",""],["Bachmayer","M.",""],["Back","J. J.",""],["Bailly-reyre","A.",""],["Rodriguez","P. Baladron",""],["Balagura","V.",""],["Baldini","W.",""],["Leite","J. Baptista de Souza",""],["Barbetti","M.",""],["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.",""],["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.",""],["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",""],["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",""],["Campana","P.",""],["Perez","D. H. Campora",""],["Quezada","A. F. Campoverde",""],["Capelli","S.",""],["Capriotti","L.",""],["Carbone","A.",""],["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.",""],["Coco","V.",""],["Cogan","J.",""],["Cogneras","E.",""],["Cojocariu","L.",""],["Collins","P.",""],["Colombo","T.",""],["Congedo","L.",""],["Contu","A.",""],["Cooke","N.",""],["Corredoira","I.",""],["Corti","G.",""],["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.",""],["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.",""],["Maronas","L. Dieste",""],["Ding","S.",""],["Dobishuk","V.",""],["Dolmatov","A.",""],["Dong","C.",""],["Donohoe","A. M.",""],["Dordei","F.",""],["Reis","A. C. dos",""],["Douglas","L.",""],["Downes","A. G.",""],["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.",""],["Egede","U.",""],["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.",""],["Farry","S.",""],["Fazzini","D.",""],["Felkowski","L.",""],["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.",""],["Forty","R.",""],["Foulds-Holt","D.",""],["Lima","V. Franco",""],["Sevilla","M. Franco",""],["Frank","M.",""],["Franzoso","E.",""],["Frau","G.",""],["Frei","C.",""],["Friday","D. A.",""],["Frontini","L.",""],["Fu","J.",""],["Fuehring","Q.",""],["Fulghesu","T.",""],["Gabriel","E.",""],["Galati","G.",""],["Galati","M. D.",""],["Torreira","A. Gallas",""],["Galli","D.",""],["Gambetta","S.",""],["Gandelman","M.",""],["Gandini","P.",""],["Gao","H.",""],["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.",""],["Gerick","D.",""],["Gerken","L. L.",""],["Gersabeck","E.",""],["Gersabeck","M.",""],["Gershon","T.",""],["Giambastiani","L.",""],["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.",""],["Gligorov","V. V.",""],["G\u00f6bel","C.",""],["Golobardes","E.",""],["Golubkov","D.",""],["Golutvin","A.",""],["Gomes","A.",""],["Fernandez","S. Gomez",""],["Abrantes","F. Goncalves",""],["Goncerz","M.",""],["Gong","G.",""],["Gorelov","I. V.",""],["Gotti","C.",""],["Grabowski","J. P.",""],["Grammatico","T.",""],["Cardoso","L. A. Granado",""],["Graug\u00e9s","E.",""],["Graverini","E.",""],["Graziani","G.",""],["Grecu","A. T.",""],["Greeven","L. M.",""],["Grieser","N. A.",""],["Grillo","L.",""],["Gromov","S.",""],["Cazon","B. R. Gruberg",""],["Gu","C.",""],["Guarise","M.",""],["Guittiere","M.",""],["G\u00fcnther","P. A.",""],["Gushchin","E.",""],["Guth","A.",""],["Guz","Y.",""],["Gys","T.",""],["Hadavizadeh","T.",""],["Hadjivasiliou","C.",""],["Haefeli","G.",""],["Haen","C.",""],["Haimberger","J.",""],["Haines","S. C.",""],["Halewood-leagas","T.",""],["Halvorsen","M. M.",""],["Hamilton","P. M.",""],["Hammerich","J.",""],["Han","Q.",""],["Han","X.",""],["Hancock","T. H.",""],["Hansmann-Menzemer","S.",""],["Hao","L.",""],["Harnew","N.",""],["Harrison","T.",""],["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.",""],["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.",""],["John","M.",""],["Johnson","D.",""],["Jones","C. R.",""],["Jones","T. P.",""],["Joshi","S.",""],["Jost","B.",""],["Jurik","N.",""],["Juszczak","I.",""],["Kandybei","S.",""],["Kang","Y.",""],["Karacson","M.",""],["Karpenkov","D.",""],["Karpov","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.",""],["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","P.",""],["Li","P. -R.",""],["Li","S.",""],["Li","T.",""],["Li","T.",""],["Li","Y.",""],["Li","Z.",""],["Liang","X.",""],["Lin","C.",""],["Lin","T.",""],["Lindner","R.",""],["Lisovskyi","V.",""],["Litvinov","R.",""],["Liu","G.",""],["Liu","H.",""],["Liu","K.",""],["Liu","Q.",""],["Liu","S.",""],["Salvia","A. Lobo",""],["Loi","A.",""],["Lollini","R.",""],["Castro","J. Lomba",""],["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.",""],["Lusiani","A.",""],["Lynch","K.",""],["Lyu","X. -R.",""],["Ma","R.",""],["Maccolini","S.",""],["Machefert","F.",""],["Maciuc","F.",""],["Mackay","I.",""],["Macko","V.",""],["Mohan","L. R. Madhan",""],["Maevskiy","A.",""],["Maisuzenko","D.",""],["Majewski","M. W.",""],["Malczewski","J. J.",""],["Malde","S.",""],["Malecki","B.",""],["Malinin","A.",""],["Maltsev","T.",""],["Manca","G.",""],["Mancinelli","G.",""],["Mancuso","C.",""],["Escalero","R. Manera",""],["Manuzzi","D.",""],["Manzari","C. A.",""],["Marangotto","D.",""],["Marchand","J. F.",""],["Marconi","U.",""],["Mariani","S.",""],["Benito","C. Marin",""],["Marks","J.",""],["Marshall","A. M.",""],["Marshall","P. J.",""],["Martelli","G.",""],["Martellotti","G.",""],["Martinazzoli","L.",""],["Martinelli","M.",""],["Santos","D. Martinez",""],["Vidal","F. Martinez",""],["Massafferri","A.",""],["Materok","M.",""],["Matev","R.",""],["Mathad","A.",""],["Matiunin","V.",""],["Matteuzzi","C.",""],["Mattioli","K. R.",""],["Mauri","A.",""],["Maurice","E.",""],["Mauricio","J.",""],["Mazurek","M.",""],["McCann","M.",""],["Mcconnell","L.",""],["McGrath","T. H.",""],["McHugh","N. T.",""],["McNab","A.",""],["McNulty","R.",""],["Meadows","B.",""],["Meier","G.",""],["Melnychuk","D.",""],["Meloni","S.",""],["Merk","M.",""],["Merli","A.",""],["Garcia","L. Meyer",""],["Miao","D.",""],["Miao","H.",""],["Mikhasenko","M.",""],["Milanes","D. A.",""],["Millard","E.",""],["Milovanovic","M.",""],["Minard","M. -N.",""],["Minotti","A.",""],["Minucci","E.",""],["Miralles","T.",""],["Mitchell","S. E.",""],["Mitreska","B.",""],["Mitzel","D. S.",""],["Modak","A.",""],["M\u00f6dden","A.",""],["Mohammed","R. A.",""],["Moise","R. D.",""],["Mokhnenko","S.",""],["Momb\u00e4cher","T.",""],["Monk","M.",""],["Monroy","I. A.",""],["Monteil","S.",""],["Morello","G.",""],["Morello","M. J.",""],["Morgenthaler","M. P.",""],["Moron","J.",""],["Morris","A. B.",""],["Morris","A. G.",""],["Mountain","R.",""],["Mu","H.",""],["Muhammad","E.",""],["Muheim","F.",""],["Mulder","M.",""],["M\u00fcller","K.",""],["Murphy","C. H.",""],["Murray","D.",""],["Murta","R.",""],["Muzzetto","P.",""],["Naik","P.",""],["Nakada","T.",""],["Nandakumar","R.",""],["Nanut","T.",""],["Nasteva","I.",""],["Needham","M.",""],["Neri","N.",""],["Neubert","S.",""],["Neufeld","N.",""],["Neustroev","P.",""],["Newcombe","R.",""],["Nicolini","J.",""],["Nicotra","D.",""],["Niel","E. M.",""],["Nieswand","S.",""],["Nikitin","N.",""],["Nolte","N. S.",""],["Normand","C.",""],["Fernandez","J. Novoa",""],["Nowak","G.",""],["Nunez","C.",""],["Oblakowska-Mucha","A.",""],["Obraztsov","V.",""],["Oeser","T.",""],["Okamura","S.",""],["Oldeman","R.",""],["Oliva","F.",""],["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.",""],["Parker","W.",""],["Parkes","C.",""],["Passalacqua","B.",""],["Passaleva","G.",""],["Pastore","A.",""],["Patel","M.",""],["Patrignani","C.",""],["Pawley","C. J.",""],["Pellegrino","A.",""],["Altarelli","M. Pepe",""],["Perazzini","S.",""],["Pereima","D.",""],["Castro","A. Pereiro",""],["Perret","P.",""],["Petridis","K.",""],["Petrolini","A.",""],["Petrucci","S.",""],["Petruzzo","M.",""],["Pham","H.",""],["Philippov","A.",""],["Piandani","R.",""],["Pica","L.",""],["Piccini","M.",""],["Pietrzyk","B.",""],["Pietrzyk","G.",""],["Pili","M.",""],["Pinci","D.",""],["Pisani","F.",""],["Pizzichemi","M.",""],["Placinta","V.",""],["Plews","J.",""],["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.",""],["Raab","N. V.",""],["Rachwal","B.",""],["Rademacker","J. H.",""],["Rajagopalan","R.",""],["Rama","M.",""],["Pernas","M. Ramos",""],["Rangel","M. S.",""],["Ratnikov","F.",""],["Raven","G.",""],["De Miguel","M. Rebollo",""],["Redi","F.",""],["Reich","J.",""],["Reiss","F.",""],["Alepuz","C. Remon",""],["Ren","Z.",""],["Resmi","P. K.",""],["Ribatti","R.",""],["Ricci","A. M.",""],["Ricciardi","S.",""],["Richardson","K.",""],["Richardson-Slipper","M.",""],["Rinnert","K.",""],["Robbe","P.",""],["Robertson","G.",""],["Rodrigues","E.",""],["Fernandez","E. Rodriguez",""],["Lopez","J. A. Rodriguez",""],["Rodriguez","E. Rodriguez",""],["Rolf","D. L.",""],["Rollings","A.",""],["Roloff","P.",""],["Romanovskiy","V.",""],["Lamas","M. Romero",""],["Vidal","A. Romero",""],["Roth","J. D.",""],["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.",""],["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.",""],["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.",""],["De Almeida","F. L. Souza",""],["De Paula","B. Souza",""],["Spaan","B.",""],["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.",""],["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",""],["Tou","D. Y.",""],["Trippl","C.",""],["Tuci","G.",""],["Tuning","N.",""],["Ukleja","A.",""],["Unverzagt","D. J.",""],["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 Veghel","M.",""],["Gomez","R. Vazquez",""],["Regueiro","P. Vazquez",""],["Sierra","C. V\u00e1zquez",""],["Vecchi","S.",""],["Velthuis","J. J.",""],["Veltri","M.",""],["Venkateswaran","A.",""],["Veronesi","M.",""],["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","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.",""],["Wyllie","K.",""],["Xiang","Z.",""],["Xie","Y.",""],["Xu","A.",""],["Xu","J.",""],["Xu","L.",""],["Xu","L.",""],["Xu","M.",""],["Xu","Q.",""],["Xu","Z.",""],["Xu","Z.",""],["Yang","D.",""],["Yang","S.",""],["Yang","X.",""],["Yang","Y.",""],["Yang","Z.",""],["Yang","Z.",""],["Yeomans","L. E.",""],["Yeroshenko","V.",""],["Yeung","H.",""],["Yin","H.",""],["Yu","J.",""],["Yuan","X.",""],["Zaffaroni","E.",""],["Zavertyaev","M.",""],["Zdybal","M.",""],["Zeng","M.",""],["Zhang","C.",""],["Zhang","D.",""],["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","X.",""],["Zhu","X.",""],["Zhu","Z.",""],["Zhukov","V.",""],["Zou","Q.",""],["Zucchelli","S.",""],["Zuliani","D.",""],["Zunica","G.",""]]}
{"id":"2308.06163","submitter":"Mohammad Rifat Arefin","authors":"Mohammad Rifat Arefin, Suraj Shetiya, Zili Wang and Christoph Csallner","title":"Scaling Up Toward Automated Black-box Reverse Engineering of\n  Context-Free Grammars","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":"  Black-box context-free grammar inference is a hard problem as in many\npractical settings it only has access to a limited number of example programs.\nThe state-of-the-art approach Arvada heuristically generalizes grammar rules\nstarting from flat parse trees and is non-deterministic to explore different\ngeneralization sequences. We observe that many of Arvada's generalization steps\nviolate common language concept nesting rules. We thus propose to pre-structure\ninput programs along these nesting rules, apply learnt rules recursively, and\nmake black-box context-free grammar inference deterministic. The resulting\nTreeVada yielded faster runtime and higher-quality grammars in an empirical\ncomparison.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:45:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Arefin","Mohammad Rifat",""],["Shetiya","Suraj",""],["Wang","Zili",""],["Csallner","Christoph",""]]}
{"id":"2308.06164","submitter":"David We{\\ss}mayer","authors":"D.We{\\ss}mayer, N. Przybilla, A. Ebenbichler, P. Aschenbrenner, and K.\n  Butler","title":"The blue supergiant Sher 25 revisited in the Gaia era","comments":"27 pages, 22 figures, Accepted for publication in Astronomy &\n  Astrophysics, Data: https://doi.org/10.5281/zenodo.8230158","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":"  Aims. The evolutionary status of the blue supergiant Sher 25 and its\nmembership to the massive cluster NGC 3603 are investigated. Methods. A hybrid\nnon-LTE (local thermodynamic equilibrium) spectrum synthesis approach is\nemployed to analyse a high-resolution optical spectrum of Sher 25 and five\nsimilar early B-type comparison stars in order to derive atmospheric parameters\nand elemental abundances. Fundamental stellar parameters are determined by\nconsidering stellar evolution tracks, Gaia Data Release 3 (DR3) data and\ncomplementary distance information. Interstellar reddening and the reddening\nlaw along the sight line towards Sher 25 are constrained employing UV\nphotometry for the first time in addition to optical and infrared data. The\ndistance to NGC 3603 is reevaluated based on Gaia DR3 data of the innermost\ncluster O-stars. Results. The spectroscopic distance derived from the\nquantitative analysis implies that Sher 25 lies in the foreground of NGC 3603,\nwhich is found to have a distance of $d_\\mathrm{NGC 3603}$ = 6250$\\pm$150 pc. A\ncluster membership is also excluded as the hourglass nebula is unaffected by\nthe vigorous stellar winds of the cluster stars and from the different\nexcitation signatures of the hourglass nebula and the nebula around NGC 3603.\nSher 25 turns out to have a luminosity of log L/L$_\\odot$ = 5.48$\\pm$0.14,\nequivalent to that of a $\\sim$27 $M_\\odot$ supergiant in a single-star\nscenario, which is about half of the mass assumed so far, bringing it much\ncloser in its characteristics to Sk-69{\\deg}202, the progenitor of SN 1987A.\nSher 25 is significantly older than NGC 3603. Further arguments for a binary\n(merger) evolutionary scenario of Sher 25 are discussed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:46:43 GMT"}],"update_date":"2023-08-14","authors_parsed":[["We\u00dfmayer","D.",""],["Przybilla","N.",""],["Ebenbichler","A.",""],["Aschenbrenner","P.",""],["Butler","K.",""]]}
{"id":"2308.06165","submitter":"Diogo Tavares","authors":"Diogo Tavares and Pedro Azevedo and David Semedo and Ricardo Sousa and\n  Jo\\~ao Magalh\\~aes","title":"Task Conditioned BERT for Joint Intent Detection and Slot-filling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dialogue systems need to deal with the unpredictability of user intents to\ntrack dialogue state and the heterogeneity of slots to understand user\npreferences. In this paper we investigate the hypothesis that solving these\nchallenges as one unified model will allow the transfer of parameter support\ndata across the different tasks. The proposed principled model is based on a\nTransformer encoder, trained on multiple tasks, and leveraged by a rich input\nthat conditions the model on the target inferences. Conditioning the\nTransformer encoder on multiple target inferences over the same corpus, i.e.,\nintent and multiple slot types, allows learning richer language interactions\nthan a single-task model would be able to. In fact, experimental results\ndemonstrate that conditioning the model on an increasing number of dialogue\ninference tasks leads to improved results: on the MultiWOZ dataset, the joint\nintent and slot detection can be improved by 3.2\\% by conditioning on intent,\n10.8\\% by conditioning on slot and 14.4\\% by conditioning on both intent and\nslots. Moreover, on real conversations with Farfetch costumers, the proposed\nconditioned BERT can achieve high joint-goal and intent detection performance\nthroughout a dialogue.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:47:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tavares","Diogo",""],["Azevedo","Pedro",""],["Semedo","David",""],["Sousa","Ricardo",""],["Magalh\u00e3es","Jo\u00e3o",""]]}
{"id":"2308.06166","submitter":"Hector Pijeira Cabrera","authors":"Abel D\\'iaz-Gonz\\'alez, Juan Hern\\'andez and H\\'ector Pijeira-Cabrera","title":"Sequentially-ordered Sobolev inner product and Laguerre-Sobolev\n  polynomials","comments":null,"journal-ref":"Mathematics (2023), 11(8), 1956","doi":"10.3390/math11081956","report-no":null,"categories":"math.CA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the sequence of polynomials $\\{S_n\\}_{n\\geq 0}$ that are orthogonal\nwith respect to the general discrete Sobolev-type inner product $$ \\langle f,g\n\\rangle_{\\mathsf{s}}=\\!\\int\\! f(x)\ng(x)d\\mu(x)+\\sum_{j=1}^{N}\\sum_{k=0}^{d_j}\\lambda_{j,k}\nf^{(k)}(c_j)g^{(k)}(c_j), $$ where $\\mu$ is a finite Borel measure whose\nsupport $\\supp{\\mu}$ is an infinite set of the real line, $\\lambda_{j,k}\\geq\n0$, and the mass points $c_i$, $i=1,\\dots,N$ are real values outside the\ninterior of the convex hull of $\\supp{\\mu}$\n($c_i\\in\\RR\\setminus\\inter{\\ch{\\supp{\\mu}}}$). Under some restriction of order\nin the discrete part of $\\langle \\cdot, \\cdot \\rangle_{\\mathsf{s}}$, we prove\nthat $S_n$ has at least $n-d^*$ zeros on $\\inter{\\ch{\\supp{\\mu}}}$, being $d^*$\nthe number of terms in the discrete part of $\\langle \\cdot, \\cdot\n\\rangle_{\\mathsf{s}}$. Finally, we obtain the outer relative asymptotic for\n$\\{S_n\\}$ in the case that the measure $\\mu$ is the classical Laguerre measure,\nand for each mass point, only one order derivative appears in the discrete part\nof $\\langle \\cdot, \\cdot \\rangle_{\\mathsf{s}}$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:47:42 GMT"}],"update_date":"2023-08-14","authors_parsed":[["D\u00edaz-Gonz\u00e1lez","Abel",""],["Hern\u00e1ndez","Juan",""],["Pijeira-Cabrera","H\u00e9ctor",""]]}
{"id":"2308.06167","submitter":"Andrzej A. Zdziarski","authors":"Andrzej A. Zdziarski, Srimanta Banerjee, Swadesh Chand, Gulab\n  Dewangan, Ranjeev Misra, Michal Szanecki, Andrzej Niedzwiecki","title":"Black hole spin measurements in LMC X-1 are highly model-dependent","comments":"ApJ, submitted, 9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spin parameter of the black hole in the accreting X-ray binary LMC X-1\nhas been measured in a number of studies to be $a_*\\gtrsim 0.9$. These\nmeasurements were claimed to take into account both statistical and systematic\n(model-dependent) uncertainties. We perform new measurements using a recent\nsimultaneous observation of LMC X-1 by NICER and NuSTAR, providing a data set\nof very high quality. We use the disk continuum method together with improved\nmodels for coronal Comptonization. With the standard relativistic blackbody\ndisk model and optically thin Comptonization, we obtain values of $a_*$ similar\nto those obtained before. We then consider modifications to the standard disk\nmodel. Using a phenomenological color correction set to 2, we find lower values\nof $a_*\\approx 0.64$--0.84. We then consider disks thicker than the standard\none, i.e., with some dissipation in surface layers, as expected if partially\nsupported by magnetic pressure. To account for that, we assume the disk is\ncovered by a warm and optically thick layer, Comptonizing the emission of the\nunderlying disk. Our model with the lowest $\\chi^2$ yields then a low range of\nthe spin, $a_*\\approx 0.40^{+0.41}_{-0.32}$. That last model is also in\nagreement with the inverse disk temperature-luminosity relation found in this\nsource. We conclude that determinations of the spin using the continuum method\nis highly sensitive to the assumptions about the disk structure.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:49:07 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zdziarski","Andrzej A.",""],["Banerjee","Srimanta",""],["Chand","Swadesh",""],["Dewangan","Gulab",""],["Misra","Ranjeev",""],["Szanecki","Michal",""],["Niedzwiecki","Andrzej",""]]}
{"id":"2308.06168","submitter":"Wolfgang Trutschnig","authors":"Jonathan Ansari, Patrick B. Langthaler, Sebastian Fuchs, Wolfgang\n  Trutschnig","title":"Quantifying and estimating dependence via sensitivity of conditional\n  distributions","comments":"24 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recently established, directed dependence measures for pairs $(X,Y)$ of\nrandom variables build upon the natural idea of comparing the conditional\ndistributions of $Y$ given $X=x$ with the marginal distribution of $Y$. They\nassign pairs $(X,Y)$ values in $[0,1]$, the value is $0$ if and only if $X,Y$\nare independent, and it is $1$ exclusively for $Y$ being a function of $X$.\nHere we show that comparing randomly drawn conditional distributions with each\nother instead or, equivalently, analyzing how sensitive the conditional\ndistribution of $Y$ given $X=x$ is on $x$, opens the door to constructing novel\nfamilies of dependence measures $\\Lambda_\\varphi$ induced by general convex\nfunctions $\\varphi: \\mathbb{R} \\rightarrow \\mathbb{R}$, containing, e.g.,\nChatterjee's coefficient of correlation as special case. After establishing\nadditional useful properties of $\\Lambda_\\varphi$ we focus on continuous\n$(X,Y)$, translate $\\Lambda_\\varphi$ to the copula setting, consider the\n$L^p$-version and establish an estimator which is strongly consistent in full\ngenerality. A real data example and a simulation study illustrate the chosen\napproach and the performance of the estimator. Complementing the\nafore-mentioned results, we show how a slight modification of the construction\nunderlying $\\Lambda_\\varphi$ can be used to define new measures of\nexplainability generalizing the fraction of explained variance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:52:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ansari","Jonathan",""],["Langthaler","Patrick B.",""],["Fuchs","Sebastian",""],["Trutschnig","Wolfgang",""]]}
{"id":"2308.06169","submitter":"Boris Doubrov","authors":"Boris Doubrov, Tohru Morimoto","title":"Extrinsic geometry and linear differential equations of\n  $\\mathfrak{sl}_3$-type","comments":"34 pages, v2: Updated URL to Maple files","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As an application of the general theory on extrinsic geometry, we investigate\nextrinsic geometry in frag varieties and systems of linear PDE's for a class of\nspecial interest associated with the adjoint representation of\n$\\mathfrak{sl}(3)$. We carry out a complete local classification of the\nhomogeneous structures in this class. As a result, we find 7 kinds of new\nsystems of linear PDE's of second order on a 3-dimensional contact manifold\neach of which has a solution space of dimension 8. Among them there are\nincluded a system of PDE's called contact Cayley's surface and one which has\n$\\mathfrak{sl}(2)$ symmetry.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:52:28 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 07:52:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Doubrov","Boris",""],["Morimoto","Tohru",""]]}
{"id":"2308.06170","submitter":"Angelo Russomanno","authors":"Martina Minutillo and Procolo Lucignano and Gabriele Campagnano and\n  Angelo Russomanno","title":"Topological properties of gap and supercurrent, and Anderson\n  localization of quasiparticles, in a Kitaev ring threaded by a magnetic flux","comments":"17 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a superconducting Kitaev ring pierced by a magnetic flux, with and\nwithout disorder, in a quantum ring configuration, and in a rf-SQUID one, where\na weak link is present. In all cases we find in the ground state a finite\nsupercurrent in the thermodynamic limit. This current is periodic in the flux,\nwith a period strictly associated with the chosen configuration. In the\nrf-SQUID the supercurrent shows jumps at a fixed value $\\Phi^*$ of the flux,\nwhen the system is topological. In the thermodynamic limit $\\Phi^*$ is constant\ninside the topological phase, independently of disorder, and we analytically\npredict it using a perturbative approach in the weak-link coupling. We find\nthat the weak link breaks the ground-state degeneracy due to the boundary\nMajorana modes, and opens a topological spectral gap for $\\Phi\\neq \\Phi^*$,\nthat vanishes at $\\Phi^*$ with a cusp providing the current jump. Looking at\nthe quasiparticle excitations, we see that they are Anderson localized, so they\ncannot carry a resistive contribution to the current, and the localization\nlength stays finite also for very small disorder strength, for a specific value\nof the superconducting coupling. In the absence of disorder, we analytically\nand numerically find that the chemical-potential derivative of the supercurrent\nlogarithmically diverges at the topological/trivial transition, in agreement\nwith the transition being of the second order.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:52:37 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Minutillo","Martina",""],["Lucignano","Procolo",""],["Campagnano","Gabriele",""],["Russomanno","Angelo",""]]}
{"id":"2308.06171","submitter":"Hector Pijeira Cabrera","authors":"H\\'ector Pijeira-Cabrera, Javier Quintero-Roba and Juan Toribio-Milane","title":"Differential properties of Jacobi-Sobolev polynomials and electrostatic\n  interpretation","comments":null,"journal-ref":"Mathematics 2023, 11(15), 3420","doi":"10.3390/math11153420","report-no":null,"categories":"math.CA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the sequence of monic polynomials $\\{S_n\\}_{n\\geqslant 0}$,\northogonal with respect to the Jacobi-Sobolev inner {product} \\;$$ \\langle\nf,g\\rangle_{\\mathsf{s}}= \\int_{-1}^{1} f(x) g(x)\\,\nd\\mu^{\\alpha,\\beta}(x)+\\sum_{j=1}^{N}\\sum_{k=0}^{d_j}\\lambda_{j,k}\nf^{(k)}(c_j)g^{(k)}(c_j), $$ \\; where $N,d_j \\in \\ZZ_+$,\n$\\lambda_{j,k}\\geqslant 0$, $d\\mu^{\\alpha,\\beta}(x)=(1-x)^{\\alpha}(1+x)^{\\beta}\ndx$, $\\alpha,\\beta>-1$, and $c_j\\in\\RR\\setminus (-1,1)$. A connection formula\nthat relates the Sobolev polynomials $S_n$ with the Jacobi polynomials is\nprovided, as well as the ladder differential operators for the sequence\n$\\{S_n\\}_{n\\geqslant 0}$ and a second-order differential equation with a\npolynomial coefficient that they satisfied. We give sufficient conditions under\nwhich the zeros of a wide class of Jacobi-Sobolev polynomials can be\ninterpreted as the solution of an electrostatic equilibrium problem of $n$ unit\ncharges moving in the presence of a logarithmic potential. Several examples are\npresented to illustrate this interpretation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:55:52 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Pijeira-Cabrera","H\u00e9ctor",""],["Quintero-Roba","Javier",""],["Toribio-Milane","Juan",""]]}
{"id":"2308.06172","submitter":"Vicky Singh Thounaojam Mr.","authors":"Debasish Borah, Satyabrata Mahapatra, Narendra Sahu and Vicky Singh\n  Thounaojam","title":"GRB221009A events from the mediator of dark matter self-interactions","comments":"7 pages, 5 captioned 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":"  In this work, we explore the intriguing possibility of connecting\nself-interacting dark matter (SIDM) with the recently observed exceptionally\nbright and long-duration Gamma Ray Burst (GRB221009A). The proposed minimal\nscenario involves a light scalar mediator, simultaneously enabling dark matter\n(DM) self-interaction and explaining the observed very high energy (VHE)\nphotons from GRB221009A reported by LHAASO's data. The scalar's mixing with the\nstandard model (SM) Higgs boson allows for its production at the GRB site,\nwhich will then propagate escaping attenuation by the extra-galactic background\nlight (EBL). These scalars, if highly boosted, have the potential to explain\nLHAASO's data. Moreover, the same mixing also facilitates DM-nucleon or\nDM-electron scatterings at terrestrial detectors, linking SIDM phenomenology to\nthe GRB221009A events. This manuscript presents the parameter space meeting all\nconstraints and offers an exciting opportunity to explore SIDM in future direct\nsearch experiments using insights from the GRB observation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:57:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Borah","Debasish",""],["Mahapatra","Satyabrata",""],["Sahu","Narendra",""],["Thounaojam","Vicky Singh",""]]}
{"id":"2308.06173","submitter":"Amira Guesmi","authors":"Amira Guesmi, Muhammad Abdullah Hanif, Bassem Ouni, and Muhammed\n  Shafique","title":"Physical Adversarial Attacks For Camera-based Smart Systems: Current\n  Trends, Categorization, Applications, Research Challenges, and Future Outlook","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CV cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a comprehensive survey of the current trends\nfocusing specifically on physical adversarial attacks. We aim to provide a\nthorough understanding of the concept of physical adversarial attacks,\nanalyzing their key characteristics and distinguishing features. Furthermore,\nwe explore the specific requirements and challenges associated with executing\nattacks in the physical world. Our article delves into various physical\nadversarial attack methods, categorized according to their target tasks in\ndifferent applications, including classification, detection, face recognition,\nsemantic segmentation and depth estimation. We assess the performance of these\nattack methods in terms of their effectiveness, stealthiness, and robustness.\nWe examine how each technique strives to ensure the successful manipulation of\nDNNs while mitigating the risk of detection and withstanding real-world\ndistortions. Lastly, we discuss the current challenges and outline potential\nfuture research directions in the field of physical adversarial attacks. We\nhighlight the need for enhanced defense mechanisms, the exploration of novel\nattack strategies, the evaluation of attacks in different application domains,\nand the establishment of standardized benchmarks and evaluation criteria for\nphysical adversarial attacks. Through this comprehensive survey, we aim to\nprovide a valuable resource for researchers, practitioners, and policymakers to\ngain a holistic understanding of physical adversarial attacks in computer\nvision and facilitate the development of robust and secure DNN-based systems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:02:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Guesmi","Amira",""],["Hanif","Muhammad Abdullah",""],["Ouni","Bassem",""],["Shafique","Muhammed",""]]}
{"id":"2308.06174","submitter":"Maria Petropoulou","authors":"S. I. Stathopoulos, M. Petropoulou, G. Vasilopoulos, A. Mastichiadis","title":"LeHaMoC: a versatile time-dependent lepto-hadronic modeling code for\n  high-energy astrophysical sources","comments":"19 pages, submitted to A&A. The leptonic module of the code (LeMoC)\n  can be found at https://github.com/mariapetro/LeHaMoC.git","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent associations of high-energy neutrinos with active galactic nuclei\n(AGN) have revived the interest in leptohadronic models of radiation from\nastrophysical sources. The rapid increase in the amount of acquired\nmulti-messenger data will require soon fast numerical models that may be\napplied to large source samples. We develop a time-dependent leptohadronic\ncode, LeHaMoC, that offers several notable benefits compared to other existing\ncodes, such as versatility and speed. LeHaMoC solves the Fokker-Planck\nequations of photons and relativistic particles (i.e. electrons, positrons,\nprotons, and neutrinos) produced in a homogeneous magnetized source that may\nalso be expanding. The code utilizes a fully implicit difference scheme that\nallows fast computation of steady-state and dynamically evolving physical\nproblems. We first present test cases where we compare the numerical results\nobtained with LeHaMoC against exact analytical solutions and numerical results\ncomputed with ATHE$\\nu$A, a well-tested code of similar philosophy but\ndifferent numerical implementation. We find a good agreement (within 10-30%)\nwith the numerical results obtained with ATHE$\\nu$A without evidence of\nsystematic differences. We then demonstrate the capabilities of the code\nthrough illustrative examples. First, we fit the spectral energy distribution\nfrom a jetted AGN in the context of a synchrotron-self Compton model and a\nproton-synchrotron model using Bayesian inference. Second, we compute the\nhigh-energy neutrino signal and the electromagnetic cascade induced by hadronic\ninteractions in the corona of NGC 1068. LeHaMoC is easily customized to model a\nvariety of high-energy astrophysical sources and has the potential to become a\nwidely utilized tool in multi-messenger astrophysics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:04:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Stathopoulos","S. I.",""],["Petropoulou","M.",""],["Vasilopoulos","G.",""],["Mastichiadis","A.",""]]}
{"id":"2308.06175","submitter":"Fabian Gr\\\"oger","authors":"Fabian Gr\\\"oger, Marc Pouly, Flavia Tinner, Leif Brandes","title":"Assessing Guest Nationality Composition from Hotel Reviews","comments":null,"journal-ref":"Gr\\\"oger, Fabian; Pouly, Marc; Tinner, Flavia & Brandes, Leif\n  (2022). Assessing Guest Nationality Composition from Hotel Reviews.\n  Proceedings of the 9th Swiss Data Science Conference, 1","doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many hotels target guest acquisition efforts to specific markets in order to\nbest anticipate individual preferences and needs of their guests. Likewise,\nsuch strategic positioning is a prerequisite for efficient marketing budget\nallocation. Official statistics report on the number of visitors from different\ncountries, but no fine-grained information on the guest composition of\nindividual businesses exists. There is, however, growing interest in such data\nfrom competitors, suppliers, researchers and the general public. We demonstrate\nhow machine learning can be leveraged to extract references to guest\nnationalities from unstructured text reviews in order to dynamically assess and\nmonitor the dynamics of guest composition of individual businesses. In\nparticular, we show that a rather simple architecture of pre-trained embeddings\nand stacked LSTM layers provides a better performance-runtime tradeoff than\nmore complex state-of-the-art language models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:04:34 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gr\u00f6ger","Fabian",""],["Pouly","Marc",""],["Tinner","Flavia",""],["Brandes","Leif",""]]}
{"id":"2308.06176","submitter":"Andreas Fring","authors":"Andreas Fring and Marta Reboiro","title":"Thermodynamic cycles in the broken PT-regime -- beating the Carnot cycle","comments":"6 pages, 5 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":"  We propose a new type of quantum thermodynamic cycle whose efficiency is\ngreater than the one of the classical Carnot cycle for the same conditions. In\nour model this type of cycle only exists in the low temperature regime in the\nspontaneously broken parity-time-reversal (PT) symmetry regime of a\nnon-Hermitian quantum theory and does not manifest in the PT-symmetric regime.\nWe discuss this effect for an ensemble based on a model of a single boson\ncoupled in a non Hermitian way to a bath of different types of bosons with and\nwithout a time-dependent boundary.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:04:59 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fring","Andreas",""],["Reboiro","Marta",""]]}
{"id":"2308.06177","submitter":"Tingxin Li","authors":"Fan Xu, Zheng Sun, Tongtong Jia, Chang Liu, Cheng Xu, Chushan Li, Yu\n  Gu, Kenji Watanabe, Takashi Taniguchi, Bingbing Tong, Jinfeng Jia, Zhiwen\n  Shi, Shengwei Jiang, Yang Zhang, Xiaoxue Liu, Tingxin Li","title":"Observation of integer and fractional quantum anomalous Hall states in\n  twisted bilayer MoTe2","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 interplay between strong correlations and topology can lead to the\nemergence of intriguing quantum states of matter. One well-known example is the\nfractional quantum Hall effect, where exotic electron fluids with fractionally\ncharged excitations form in partially filled Landau levels. The emergence of\ntopological moir\\'e flat bands provides exciting opportunities to realize the\nlattice analogs of both the integer and fractional quantum Hall states without\nthe need for an external magnetic field. These states are known as the integer\nand fractional quantum anomalous Hall (IQAH and FQAH) states. Here, we present\ndirect transport evidence of the existence of both IQAH and FQAH states in\ntwisted bilayer MoTe2 (AA stacked). At zero magnetic field, we observe\nwell-quantized Hall resistance of h/e2 around moir\\'e filling factor {\\nu} = -1\n(corresponding to one hole per moir\\'e unit cell), and nearly-quantized Hall\nresistance of 3h/2e2 around {\\nu} = -2/3, respectively. Concomitantly, the\nlongitudinal resistance exhibits distinct minima around {\\nu} = -1 and -2/3.\nThe application of an electric field induces topological quantum phase\ntransition from the IQAH state to a charge transfer insulator at {\\nu} = -1,\nand from the FQAH state to a generalized Wigner crystal state, further\ntransitioning to a metallic state at {\\nu} = -2/3. Our study paves the way for\nthe investigation of fractionally charged excitations and anyonic statistics at\nzero magnetic field based on semiconductor moir\\'e materials.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:06:33 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 15:29:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Fan",""],["Sun","Zheng",""],["Jia","Tongtong",""],["Liu","Chang",""],["Xu","Cheng",""],["Li","Chushan",""],["Gu","Yu",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Tong","Bingbing",""],["Jia","Jinfeng",""],["Shi","Zhiwen",""],["Jiang","Shengwei",""],["Zhang","Yang",""],["Liu","Xiaoxue",""],["Li","Tingxin",""]]}
{"id":"2308.06178","submitter":"Aldo Procacci","authors":"Aldo Procacci and Benedetto Scoppola","title":"On the local central limit theorem for interacting spin systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the equivalence between integral and local central limit theorem for\nspin system interacting via an absolutely summable pair potential without any\nconditions on the temperature of the system.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:08:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Procacci","Aldo",""],["Scoppola","Benedetto",""]]}
{"id":"2308.06179","submitter":"James Capers","authors":"James R Capers, Dean A Patient, Simon A R Horsley","title":"Manipulating the Quasi-Normal Modes of Radially Symmetric Resonators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive two methods for simultaneously controlling the resonance frequency,\nlinewidth and multipolar nature of the resonances of radially symmetric\nstructures. Firstly, we formulate an eigenvalue problem for a global shift in\nthe permittivity of the structure to place a resonance at a particular complex\nfrequency. Next, we employ quasi-normal mode perturbation theory to design\nradially graded structures with resonances at desired frequencies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:08:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Capers","James R",""],["Patient","Dean A",""],["Horsley","Simon A R",""]]}
{"id":"2308.06180","submitter":"Qian Yuan","authors":"Feimin Huang, Zhouping Xin, Lingda Xu, Qian Yuan","title":"Nonlinear asymptotic stability of compressible vortex sheets with\n  viscosity effects","comments":"54 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper concerns the stabilizing effect of viscosity on the vortex sheets.\nIt is found that although a vortex sheet is not a time-asymptotic attractor for\nthe compressible Navier-Stokes equations, a viscous wave that approximates the\nvortex sheet on any finite time interval can be constructed explicitly, which\nis shown to be time-asymptotically stable in the $ L^\\infty $-space with small\nperturbations, regardless of the amplitude of the vortex sheet. The result\nshows that the viscosity has a strong stabilizing effect on the vortex sheets,\nwhich are generally unstable for the ideal compressible Euler equations even\nfor short time [26,8,1]. The proof is based on the $ L^2 $-energy method.In\nparticular, the asymptotic stability of the vortex sheet under small spatially\nperiodic perturbations is proved by studying the dynamics of these spatial\noscillations. The first key point in our analysis is to construct an ansatz to\ncancel these oscillations. Then using the Galilean transformation, we are able\nto find a shift function of the vortex sheet such that an anti-derivative\ntechnique works, which plays an important role in the energy estimates.\nMoreover, by introducing a new variable and using the intrinsic properties of\nthe vortex sheet, we can achieve the optimal decay rates to the viscous wave.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:09:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Huang","Feimin",""],["Xin","Zhouping",""],["Xu","Lingda",""],["Yuan","Qian",""]]}
{"id":"2308.06181","submitter":"Henrik Koch","authors":"Rosario R. Riso, Enrico Ronca and Henrik Koch","title":"Strong coupling to circularly polarized photons: towards field-induced\n  enantioselectivity","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development of new methodologies for the selective synthesis of\nindividual enantiomers is still one of the major challenges in synthetic\nchemistry. Many biomolecules, and therefore many pharmaceutical compounds, are\nindeed chiral. While the use of chiral reactants or catalysts has led to\nsignificant progress in the field of asymmetric synthesis, a systematic\napproach applicable to general reactions has still not been proposed. In this\nwork, we show that strong coupling to circularly polarized fields represents a\npromising alternative for reaching highly selective asymmetric synthesis in a\nnon-invasive fashion. We demonstrate that the field induces stereoselectivity\nin the early stages of the chemical reaction, by selecting an energetically\npreferred direction of approach for the reagents.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:11:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Riso","Rosario R.",""],["Ronca","Enrico",""],["Koch","Henrik",""]]}
{"id":"2308.06182","submitter":"Jaron Sanders","authors":"Gianluca Kosmella, Ripalta Stabile, Jaron Sanders","title":"Noise-Resilient Designs for Optical Neural Networks","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE eess.SP physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  All analog signal processing is fundamentally subject to noise, and this is\nalso the case in modern implementations of Optical Neural Networks (ONNs).\nTherefore, to mitigate noise in ONNs, we propose two designs that are\nconstructed from a given, possibly trained, Neural Network (NN) that one wishes\nto implement. Both designs have the capability that the resulting ONNs gives\noutputs close to the desired NN.\n  To establish the latter, we analyze the designs mathematically. Specifically,\nwe investigate a probabilistic framework for the first design that establishes\nthat the design is correct, i.e., for any feed-forward NN with Lipschitz\ncontinuous activation functions, an ONN can be constructed that produces output\narbitrarily close to the original. ONNs constructed with the first design thus\nalso inherit the universal approximation property of NNs. For the second\ndesign, we restrict the analysis to NNs with linear activation functions and\ncharacterize the ONNs' output distribution using exact formulas.\n  Finally, we report on numerical experiments with LeNet ONNs that give insight\ninto the number of components required in these designs for certain accuracy\ngains. We specifically study the effect of noise as a function of the depth of\nan ONN. The results indicate that in practice, adding just a few components in\nthe manner of the first or the second design can already be expected to\nincrease the accuracy of ONNs considerably.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:11:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kosmella","Gianluca",""],["Stabile","Ripalta",""],["Sanders","Jaron",""]]}
{"id":"2308.06183","submitter":"Jinbang Hu","authors":"Jinbang Hu and Xiansi Wang and Justin Wells","title":"Observation of broadening Rashba-type band in AuSb surface alloy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Here, we report a novel AuSb 2D superstructure on Au(111) that shows\nagreements and discrepancies to the expected electronic features of the ideal\n2D surface alloys with $\\sqrt{3}\\times\\sqrt{3}$ periodicity. Using spin- and\nangle-resolved photoemission spectroscopy, we find a significant spin splitting\nof the alloy bands with antiparallel spin polarization. The band structure\noriginates from the hybridization between the Sb and the Au orbitals at the 2D\nSb-Au interface. Taking advantage of the good agreement between the\nexperimental results and DFT calculations, we find the broadening of the band\nis due to the perturbations introduced by the 3-pointed-star-shaped defects as\nnonresonant impurities in the $8\\times8$ superstructure. The periodic defect\ncan properly adjust the energy position of the Rashba band while not breaking\nthe in-plane symmetry.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:14:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hu","Jinbang",""],["Wang","Xiansi",""],["Wells","Justin",""]]}
{"id":"2308.06184","submitter":"Roger Casals","authors":"Roger Casals, Ian Le, Melissa Sherman-Bennett, Daping Weng","title":"Demazure weaves for reduced plabic graphs (with a proof that\n  Muller-Speyer twist is Donaldson-Thomas)","comments":"79 pages, 65 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.RT math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  First, this article develops the theory of weaves and their cluster\nstructures for the affine cones of positroid varieties. In particular, we\nexplain how to construct a weave from a reduced plabic graph, show it is\nDemazure, compare their associated cluster structures, and prove that the\nconjugate surface of the graph is Hamiltonian isotopic to the Lagrangian\nfilling associated to the weave. The T-duality map for plabic graphs has a\nsurprising key role in the construction of these weaves. Second, we use the\nabove established bridge between weaves and reduced plabic graphs to show that\nthe Muller-Speyer twist map on positroid varieties is the Donaldson-Thomas\ntransformation. This latter statement implies that the Muller-Speyer twist is a\nquasi-cluster automorphism. An additional corollary of our results is that\ntarget labeled seeds and the source labeled seeds are related by a\nquasi-cluster transformation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:17:08 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Casals","Roger",""],["Le","Ian",""],["Sherman-Bennett","Melissa",""],["Weng","Daping",""]]}
{"id":"2308.06185","submitter":"Oinam Romesh Meitei","authors":"Oinam Romesh Meitei and Troy Van Voorhis","title":"Electron correlation in 2D periodic systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given the growing significance of 2D materials in various optoelectronic\napplications, it is imperative to have simulation tools that can accurately and\nefficiently describe electron correlation effects in these systems. Here, we\nshow that the recently developed bootstrap embedding (BE) accurately predicts\nelectron correlation energies and structural properties for 2D systems. Without\nexplicit dependence on the reciprocal space sum ($k$-points) in the correlation\ncalculation, BE can typically recover $\\sim$99.5% of the total electron\ncorrelation energy in 2D semi-metal, insulator and semiconductors. We\ndemonstrate that BE can predict lattice constants and bulk moduli for 2D\nsystems with high precision. Furthermore, we highlight the capability of BE to\ntreat electron correlation in twisted bilayer graphene superlattices with large\nunit cells containing hundreds of carbon atoms. We find that as the twist angle\ndecreases towards the magic angle, the correlation energy initially decreases\nin magnitude, followed by a subsequent increase. We conclude that BE is a\npromising electronic structure method for future applications to 2D materials.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:22:56 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Meitei","Oinam Romesh",""],["Van Voorhis","Troy",""]]}
{"id":"2308.06186","submitter":"Sebastian Biewer","authors":"Sebastian Biewer, Kevin Baum, Sarah Sterz, Holger Hermanns, Sven\n  Hetmank, Markus Langer, Anne Lauber-R\\\"onsberg and Franz Lehr","title":"Software Doping Analysis for Human Oversight","comments":"Submitted to Formal Methods in System Design, special issue for FASE\n  2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.LO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This article introduces a framework that is meant to assist in mitigating\nsocietal risks that software can pose. Concretely, this encompasses facets of\nsoftware doping as well as unfairness and discrimination in high-risk\ndecision-making systems. The term software doping refers to software that\ncontains surreptitiously added functionality that is against the interest of\nthe user. A prominent example of software doping are the tampered emission\ncleaning systems that were found in millions of cars around the world when the\ndiesel emissions scandal surfaced. The first part of this article combines the\nformal foundations of software doping analysis with established probabilistic\nfalsification techniques to arrive at a black-box analysis technique for\nidentifying undesired effects of software. We apply this technique to emission\ncleaning systems in diesel cars but also to high-risk systems that evaluate\nhumans in a possibly unfair or discriminating way. We demonstrate how our\napproach can assist humans-in-the-loop to make better informed and more\nresponsible decisions. This is to promote effective human oversight, which will\nbe a central requirement enforced by the European Union's upcoming AI Act. We\ncomplement our technical contribution with a juridically, philosophically, and\npsychologically informed perspective on the potential problems caused by such\nsystems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:24:16 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Biewer","Sebastian",""],["Baum","Kevin",""],["Sterz","Sarah",""],["Hermanns","Holger",""],["Hetmank","Sven",""],["Langer","Markus",""],["Lauber-R\u00f6nsberg","Anne",""],["Lehr","Franz",""]]}
{"id":"2308.06187","submitter":"Elio Quiroga Rodriguez","authors":"E. Quiroga","title":"A peculiar galaxy near M104","comments":"5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Messier 104, NGC 4594, also known as the Sombrero Galaxy, has been\nextensively studied, especially its structure and stellar halo. Its abundance\nof globular clusters has given rise to many theories and much speculation (Ford\nH. C. et al 1996). But other objects in the vicinity of such a spectacular\ngalaxy are sometimes ignored. While studying HST images available on the HST\nLegacy website of the halo of M104 (HST proposal 9714, PI: Keith Noll), the\nauthor observed at 12:40:07.829 -11:36:47.38 (in j2000) an object about 4\narcseconds in diameter. A study with VO tools suggests that the object is a SBc\ngalaxy with AGN (Seyfert).\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:28:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Quiroga","E.",""]]}
{"id":"2308.06188","submitter":"Wouter Van Harten","authors":"Wouter van Harten, Laura Scarabosio","title":"Exploiting locality in sparse polynomial approximation of parametric\n  elliptic PDEs and application to parameterized domains","comments":"38 pages, 2 figures, submitted to ESIAM M2AN","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 work studies how the choice of the representation for parametric,\nspatially distributed inputs to elliptic partial differential equations (PDEs)\naffects the efficiency of a polynomial surrogate, based on Taylor expansion,\nfor the parameter-to-solution map. In particular, we show potential advantages\nof representations using functions with localized supports. As model problem,\nwe consider the steady-state diffusion equation, where the diffusion\ncoefficient and right-hand side depend smoothly but potentially in a\n\\textsl{highly nonlinear} way on a parameter $y\\in [-1,1]^{\\mathbb{N}}$.\nFollowing previous work for affine parameter dependence and for the lognormal\ncase, we use pointwise instead of norm-wise bounds to prove\n$\\ell^p$-summability of the Taylor coefficients of the solution. As\napplication, we consider surrogates for solutions to elliptic PDEs on\nparametric domains. Using a mapping to a nominal configuration, this case fits\nin the general framework, and higher convergence rates can be attained when\nmodeling the parametric boundary via spatially localized functions. The\ntheoretical results are supported by numerical experiments for the parametric\ndomain problem, illustrating the efficiency of the proposed approach and\nproviding further insight on numerical aspects. Although the methods and ideas\nare carried out for the steady-state diffusion equation, they extend easily to\nother elliptic and parabolic PDEs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:29:26 GMT"}],"update_date":"2023-08-14","authors_parsed":[["van Harten","Wouter",""],["Scarabosio","Laura",""]]}
{"id":"2308.06189","submitter":"Santiago Fern\\'andez","authors":"Santiago Fern\\'andez-Ferrer, Francisco Javier L\\'opez-Mart\\'inez,\n  Fernando H. Gregorio and Juan E. Cousseau","title":"Companding and Predistortion Techniques for Improved Efficiency and\n  Performance in SWIPT","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://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we analyze how the use of companding techniques, together with\ndigital predistortion (DPD), can be leveraged to improve system efficiency and\nperformance in simultaneous wireless information and power transfer (SWIPT)\nsystems based on power splitting. By taking advantage of the benefits of each\nof these well-known techniques to mitigate non-linear effects due to power\namplifier (PA) and energy harvesting (EH) operation, we illustrate how DPD and\ncompanding can be effectively combined to improve the EH efficiency while\nkeeping unalterable the information transfer performance. We establish design\ncriteria that allow the PA to operate in a higher efficiency region so that the\nreduction in peak-to-average power ratio over the transmitted signal is\ntranslated into an increase in the average radiated power and EH efficiency.\nThe performance of DPD and companding techniques is evaluated in a number of\nscenarios, showing that a combination of both techniques allows to\nsignificantly increase the power transfer efficiency in SWIPT systems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:31:51 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 17:05:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fern\u00e1ndez-Ferrer","Santiago",""],["L\u00f3pez-Mart\u00ednez","Francisco Javier",""],["Gregorio","Fernando H.",""],["Cousseau","Juan E.",""]]}
{"id":"2308.06190","submitter":"Emma Zajdela","authors":"Emma R. Zajdela and Daniel M. Abrams","title":"Phase chimera states: frozen patterns of disorder","comments":"5 pages of main text, 4 pages supplemental material, 5 figures in the\n  main text, 1 figure in the supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD math-ph math.DS math.MP nlin.AO nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Coupled oscillators can serve as a testbed for larger questions of pattern\nformation across many areas of science and engineering. Much effort has been\ndedicated to the Kuramoto model and phase oscillators, but less has focused on\noscillators with variable amplitudes. Here we examine the simplest such\noscillators -- Stuart-Landau oscillators -- and attempt to elucidate some\npuzzling dynamics observed in simulation by us and others. We demonstrate the\nexistence and stability of a previously unreported state which we call a\n``phase chimera state.'' Remarkably, in this state, the amplitudes of all\noscillators are identical, but one subset of oscillators phase-locks while\nanother subset remains incoherent in phase. We also show that this state can\ntake the form of a ``multitailed phase chimera state'' where a single\nphase-synchronous cluster of oscillators coexists with multiple groups of\nphase-incoherent oscillators.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:32:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zajdela","Emma R.",""],["Abrams","Daniel M.",""]]}
{"id":"2308.06191","submitter":"Ben Webster","authors":"Ben Webster, Philsang Yoo","title":"3-dimensional mirror symmetry","comments":"23 pages. Expanded version of the published article","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AG math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This expository article discusses recent advances in understanding\n3-dimensional mirror symmetry and the mathematical definitions of the Higgs and\nCoulomb branches. This is a slightly expanded version of an article appearing\nin the Notices of the AMS.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:33:05 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Webster","Ben",""],["Yoo","Philsang",""]]}
{"id":"2308.06192","submitter":"Michael Kouritzin A","authors":"Michael A. Kouritzin","title":"Sampling and Filtering with Markov Chains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A continuous-time Markov chain rate change formula for simulation, model\nselection, filtering and theory is proven. It is used to develop Markov chain\nimportance sampling, rejection sampling, branching particle filtering\nalgorithms and filtering equations akin to the Duncan-Mortensen-Zakai equation\nand the Fujisaki-Kallianpur-Kunita equation but for Markov signals with general\ncontinuous-time Markov chain observations. A direct method of solving these\nfiltering equations is given that, for example, applies to trend, volatility\nand/or parameter estimation in financial models given tick-by-tick market data.\nAll the results also apply to continuous-time Hidden Markov Models (CTHMM),\nwhich have become important in applications like disease progression tracking,\nas special cases and the corresponding CTHMM results are stated as corollaries.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:33:29 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Kouritzin","Michael A.",""]]}
{"id":"2308.06193","submitter":"Yasushi Shinohara","authors":"Yasushi Shinohara, Haruki Sanada, Katsuya Oguri","title":"Enhancement of Zener tunneling rate via electron-hole attraction within\n  a time-dependent quasi-Hartree-Fock method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The tunneling process, a prototypical phenomenon of nonperturbative dynamics,\nis a natural consequence of photocarrier generation in materials irradiated by\na strong laser. Common treatments for Zener tunneling are based on a one-body\nproblem with a field-free electronic structure. In a literature (Ikemachi et\nal., Phys. Rev. A 98, 023415 (2018)), a characteristic of gap shrinking or\nexcitation can occur due to the electron-hole interaction for slow and strong\ntime-varying electric fields. We have developed a theoretical framework called\nthe quasi-Hartree-Fock (qHF) method to enable a more flexible imitation of the\nelectronic structures and electron-hole attraction strength of materials\ncompared to the original Hartree-Fock method. In the qHF framework, band gap,\nreduced effective mass, and electron-hole interaction strength can be\nindependently selected to reproduce common crystals. In this study, we\ninvestigate the effect of electron-hole attraction on Zener tunneling subjected\nto a DC electric field for four different systems using the qHF method. Our\nfindings demonstrate that the electron-hole attraction promotes the tunneling\nrates in all four material systems assumed as examples. Specifically, systems\nthat have a strong electron-hole interaction show a few factor enhancements for\ntunneling rates under DC fields, while systems with a weak interaction show\nhigher enhancements of a few tens of percent.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:35:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shinohara","Yasushi",""],["Sanada","Haruki",""],["Oguri","Katsuya",""]]}
{"id":"2308.06194","submitter":"Yankun Lang","authors":"Yankun Lang, Zhuoran Jiang, Leshan Sun, Liangzhong Xiang and Lei Ren","title":"Hybrid-Supervised Deep Learning for Domain Transfer 3D Protoacoustic\n  Image 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":"  Protoacoustic imaging showed great promise in providing real-time 3D dose\nverification of proton therapy. However, the limited acquisition angle in\nprotoacoustic imaging induces severe artifacts, which significantly impairs its\naccuracy for dose verification. In this study, we developed a deep learning\nmethod with a Recon- Enhance two-stage strategy for protoacoustic imaging to\naddress the limited view issue. Specifically, in the Recon-stage, a\ntransformer-based network was developed to reconstruct initial pressure maps\nfrom radiofrequency signals. The network is trained in a hybrid-supervised\napproach, where it is first trained using supervision by the iteratively\nreconstructed pressure map and then fine-tuned using transfer learning and\nself-supervision based on the data fidelity constraint. In the Enhance-stage, a\n3D U-net is applied to further enhance the image quality with supervision from\nthe ground truth pressure map. The final protoacoustic images are then\nconverted to dose for proton verification. The results evaluated on a dataset\nof 126 prostate cancer patients achieved an average RMSE of 0.0292, and an\naverage SSIM of 0.9618, significantly out-performing related start-of-the-art\nmethods. Qualitative results also demonstrated that our approach addressed the\nlimit-view issue with more details reconstructed. Dose verification achieved an\naverage RMSE of 0.018, and an average SSIM of 0.9891. Gamma index evaluation\ndemonstrated a high agreement (94.7% and 95.7% for 1%/3 mm and 1%/5 mm) between\nthe predicted and the ground truth dose maps. Notably, the processing time was\nreduced to 6 seconds, demonstrating its feasibility for online 3D dose\nverification for prostate proton therapy.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:36:59 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lang","Yankun",""],["Jiang","Zhuoran",""],["Sun","Leshan",""],["Xiang","Liangzhong",""],["Ren","Lei",""]]}
{"id":"2308.06195","submitter":"Komal Chand","authors":"Komal Chand, Khushboo Kunwar Rao, Kaushar Vaidya, Anju Panthi\n  (Department of Physics, Birla Institute of Technology and Science-Pilani,\n  333031 Rajasthan, India)","title":"Hot Stellar Populations of Berkeley 39 using Swift/UVOT","comments":null,"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":"  Open clusters are excellent tools to probe the history of the Galactic disk\nand properties of star formation. In this work, we present a study of an old\nage open cluster Berkley 39 using the observations from UVOT instrument of the\nNeil Gehrels Swift observatory. Making use of a machine learning algorithm,\nML-MOC, we have identified a total of 861 stars as cluster members out of which\n17 are blue straggler stars. In this work, we present a characterisation of 2\nblue straggler stars. To estimate the fundamental parameters of blue straggler\nstars and their companions (if any), we constructed spectral energy\ndistributions using UV data from swift/UVOT and GALEX, optical data from Gaia\nDR3, and infrared (IR) data from 2MASS, Spitzer/IRAC, and WISE. We find excess\nflux in UV in one blue straggler star, implying the possibility of a hot\ncompanion.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:40:30 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chand","Komal","","Department of Physics, Birla Institute of Technology and Science-Pilani,\n  333031 Rajasthan, India"],["Rao","Khushboo Kunwar","","Department of Physics, Birla Institute of Technology and Science-Pilani,\n  333031 Rajasthan, India"],["Vaidya","Kaushar","","Department of Physics, Birla Institute of Technology and Science-Pilani,\n  333031 Rajasthan, India"],["Panthi","Anju","","Department of Physics, Birla Institute of Technology and Science-Pilani,\n  333031 Rajasthan, India"]]}
{"id":"2308.06196","submitter":"Tarik Dzanic","authors":"Tarik Dzanic and Luigi Martinelli","title":"Towards full molecular gas dynamics simulations of complex flows via the\n  Boltzmann equation","comments":"14 pages, 9 figures, Cambridge Unsteady Flow Symposium","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":"  This work explores the capability of simulating complex fluid flows by\ndirectly solving the Boltzmann equation. Due to the high-dimensionality of the\ngoverning equation, the substantial computational cost of solving the Boltzmann\nequation has generally limited its application to simpler, two-dimensional flow\nproblems. Utilizing a combination of high-order spatial discretizations and\ndiscretely-conservative velocity models along with their highly-efficient\nimplementation on massively-parallel GPU computing architectures, we\ndemonstrate the current ability of directly solving the Boltzmann equation\naugmented with the BGK collision model for complex, three-dimensional flows.\nNumerical results are presented for a variety of these problems including\nrarefied microchannels, transitional and turbulent flows, and high-speed\natmospheric re-entry vehicles, showcasing the ability of the approach in\naccurately predicting complex nonlinear flow phenomena and non-equilibrium\neffects.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:40:52 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 23:09:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dzanic","Tarik",""],["Martinelli","Luigi",""]]}
{"id":"2308.06197","submitter":"Angus Maiden MAAI(Prof)","authors":"Angus Maiden (1), Bahareh Nakisa (1) ((1) Deakin University)","title":"Complex Facial Expression Recognition Using Deep Knowledge Distillation\n  of Basic Features","comments":"17 pages, 9 figures, 6 tables. Code available at\n  https://github.com/AngusMaiden/complex-FER","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Complex emotion recognition is a cognitive task that has so far eluded the\nsame excellent performance of other tasks that are at or above the level of\nhuman cognition. Emotion recognition through facial expressions is particularly\ndifficult due to the complexity of emotions expressed by the human face. For a\nmachine to approach the same level of performance in this domain as a human, it\nmay need to synthesise knowledge and understand new concepts in real-time as\nhumans do. Humans are able to learn new concepts using only few examples, by\ndistilling the important information from memories and discarding the rest.\nSimilarly, continual learning methods learn new classes whilst retaining the\nknowledge of known classes, whilst few-shot learning methods are able to learn\nnew classes using very few training examples. We propose a novel continual\nlearning method inspired by human cognition and learning that can accurately\nrecognise new compound expression classes using few training samples, by\nbuilding on and retaining its knowledge of basic expression classes. Using\nGradCAM visualisations, we demonstrate the relationship between basic and\ncompound facial expressions, which our method leverages through knowledge\ndistillation and a novel Predictive Sorting Memory Replay. Our method achieves\nthe current state-of-the-art in continual learning for complex facial\nexpression recognition with 74.28% Overall Accuracy on new classes. We also\ndemonstrate that using continual learning for complex facial expression\nrecognition achieves far better performance than non-continual learning\nmethods, improving on state-of-the-art non-continual learning methods by\n13.95%. To the best of our knowledge, our work is also the first to apply\nfew-shot learning to complex facial expression recognition, achieving the\nstate-of-the-art with 100% accuracy using a single training sample for each\nexpression class.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:42:48 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Maiden","Angus","","Deakin University"],["Nakisa","Bahareh","","Deakin University"]]}
{"id":"2308.06198","submitter":"Melissa Hall","authors":"Melissa Hall, Candace Ross, Adina Williams, Nicolas Carion, Michal\n  Drozdzal, Adriana Romero Soriano","title":"DIG In: Evaluating Disparities in Image Generations with Indicators for\n  Geographic Diversity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unprecedented photorealistic results achieved by recent text-to-image\ngenerative systems and their increasing use as plug-and-play content creation\nsolutions make it crucial to understand their potential biases. In this work,\nwe introduce three indicators to evaluate the realism, diversity and\nprompt-generation consistency of text-to-image generative systems when prompted\nto generate objects from across the world. Our indicators complement\nqualitative analysis of the broader impact of such systems by enabling\nautomatic and efficient benchmarking of geographic disparities, an important\nstep towards building responsible visual content creation systems. We use our\nproposed indicators to analyze potential geographic biases in state-of-the-art\nvisual content creation systems and find that: (1) models have less realism and\ndiversity of generations when prompting for Africa and West Asia than Europe,\n(2) prompting with geographic information comes at a cost to prompt-consistency\nand diversity of generated images, and (3) models exhibit more region-level\ndisparities for some objects than others. Perhaps most interestingly, our\nindicators suggest that progress in image generation quality has come at the\ncost of real-world geographic representation. Our comprehensive evaluation\nconstitutes a crucial step towards ensuring a positive experience of visual\ncontent creation for everyone.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:43:37 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 16:42:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hall","Melissa",""],["Ross","Candace",""],["Williams","Adina",""],["Carion","Nicolas",""],["Drozdzal","Michal",""],["Soriano","Adriana Romero",""]]}
{"id":"2308.06199","submitter":"Anna-Grace Linton","authors":"Anna-Grace Linton (1), Vania Dimitrova (2), Amy Downing (3), Richard\n  Wagland (4), Adam Glaser (3) ((1) UKRI CDT in AI for Medical Diagnosis and\n  Care, University of Leeds, UK, (2) School of Computing, University of Leeds,\n  UK, (3) School of Medicine, University of Leeds, UK, (4) School of Health\n  Sciences, University of Southampton, UK)","title":"Weakly Supervised Text Classification on Free Text Comments in\n  Patient-Reported Outcome Measures","comments":"Accepted and presented at Health Text Analytics conference 2023 (UK)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Free text comments (FTC) in patient-reported outcome measures (PROMs) data\nare typically analysed using manual methods, such as content analysis, which is\nlabour-intensive and time-consuming. Machine learning analysis methods are\nlargely unsupervised, necessitating post-analysis interpretation. Weakly\nsupervised text classification (WSTC) can be a valuable method of analysis to\nclassify domain-specific text data in which there is limited labelled data. In\nthis paper, we apply five WSTC techniques to FTC in PROMs data to identify\nhealth-related quality of life (HRQoL) themes reported by colorectal cancer\npatients. The WSTC methods label all the themes mentioned in the FTC. The\nresults showed moderate performance on the PROMs data, mainly due to the\nprecision of the models, and variation between themes. Evaluation of the\nclassification performance illustrated the potential and limitations of keyword\nbased WSTC to label PROMs FTC when labelled data is limited.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:47:49 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Linton","Anna-Grace",""],["Dimitrova","Vania",""],["Downing","Amy",""],["Wagland","Richard",""],["Glaser","Adam",""]]}
{"id":"2308.06200","submitter":"Michele Fava","authors":"Michele Fava, Jorge Kurchan, and Silvia Pappalardi","title":"Designs via Free Probability","comments":"16 pages, 4 figures","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":"  Unitary Designs have become a vital tool for investigating pseudorandomness\nsince they approximate the statistics of the uniform Haar ensemble. Despite\ntheir central role in quantum information, their relation to quantum chaotic\nevolution and in particular to the Eigenstate Thermalization Hypothesis (ETH)\nare still largely debated issues. This work provides a bridge between the\nlatter and $k$-designs through Free Probability theory. First, by introducing\nthe more general notion of $k$-freeness, we show that it can be used as an\nalternative probe of designs. In turn, free probability theory comes with\nseveral tools, useful for instance for the calculation of mixed moments or for\nquantum channels. Our second result is the connection to quantum dynamics.\nQuantum ergodicity, and correspondingly ETH, apply to a restricted class of\nphysical observables, as already discussed in the literature. In this spirit,\nwe show that unitary evolution with generic Hamiltonians always leads to\nfreeness at sufficiently long times, but only when the operators considered are\nrestricted within the ETH class. Our results provide a direct link between\nunitary designs, quantum chaos and the Eigenstate Thermalization Hypothesis,\nand shed new light on the universality of late-time quantum dynamics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:49:40 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Fava","Michele",""],["Kurchan","Jorge",""],["Pappalardi","Silvia",""]]}
{"id":"2308.06201","submitter":"Mohammad Eslami","authors":"Mohammad Eslami, Tiago Perez and Samuel Pagliarini","title":"SALSy: Security-Aware Layout Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Integrated Circuits (ICs) are the target of diverse attacks during their\nlifetime. Fabrication-time attacks, such as the insertion of Hardware Trojans,\ncan give an adversary access to privileged data and/or the means to corrupt the\nIC's internal computation. Post-fabrication attacks, where the end-user takes a\nmalicious role, also attempt to obtain privileged information through means\nsuch as fault injection and probing. Taking these threats into account and at\nthe same time, this paper proposes a methodology for Security-Aware Layout\nSynthesis (SALSy), such that ICs can be designed with security in mind in the\nsame manner as power-performance-area (PPA) metrics are considered today, a\nconcept known as security closure. Furthermore, the trade-offs between PPA and\nsecurity are considered and a chip is fabricated in a 65nm CMOS commercial\ntechnology for validation purposes - a feature not seen in previous research on\nsecurity closure. Measurements on the fabricated ICs indicate that SALSy\npromotes a modest increase in power in order to achieve significantly improved\nsecurity metrics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:52:28 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:15:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Eslami","Mohammad",""],["Perez","Tiago",""],["Pagliarini","Samuel",""]]}
{"id":"2308.06202","submitter":"Frederic Zhang","authors":"Frederic Z. Zhang, Yuhui Yuan, Dylan Campbell, Zhuoyao Zhong, Stephen\n  Gould","title":"Exploring Predicate Visual Context in Detecting of Human-Object\n  Interactions","comments":"To appear in ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, the DETR framework has emerged as the dominant approach for\nhuman--object interaction (HOI) research. In particular, two-stage\ntransformer-based HOI detectors are amongst the most performant and\ntraining-efficient approaches. However, these often condition HOI\nclassification on object features that lack fine-grained contextual\ninformation, eschewing pose and orientation information in favour of visual\ncues about object identity and box extremities. This naturally hinders the\nrecognition of complex or ambiguous interactions. In this work, we study these\nissues through visualisations and carefully designed experiments. Accordingly,\nwe investigate how best to re-introduce image features via cross-attention.\nWith an improved query design, extensive exploration of keys and values, and\nbox pair positional embeddings as spatial guidance, our model with enhanced\npredicate visual context (PViC) outperforms state-of-the-art methods on the\nHICO-DET and V-COCO benchmarks, while maintaining low training cost.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:57:45 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhang","Frederic Z.",""],["Yuan","Yuhui",""],["Campbell","Dylan",""],["Zhong","Zhuoyao",""],["Gould","Stephen",""]]}
{"id":"2308.06203","submitter":"Ricardo Cannizzaro Mr","authors":"Ricardo Cannizzaro, Jonathan Routley, and Lars Kunze","title":"Towards a Causal Probabilistic Framework for Prediction,\n  Action-Selection & Explanations for Robot Block-Stacking Tasks","comments":"3 pages, 3 figures, accepted to the \"Causality for Robotics:\n  Answering the Question of Why\" workshop at the 2023 IEEE/RSJ International\n  Conference on Intelligent Robots and Systems (IROS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG stat.AP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Uncertainties in the real world mean that is impossible for system designers\nto anticipate and explicitly design for all scenarios that a robot might\nencounter. Thus, robots designed like this are fragile and fail outside of\nhighly-controlled environments. Causal models provide a principled framework to\nencode formal knowledge of the causal relationships that govern the robot's\ninteraction with its environment, in addition to probabilistic representations\nof noise and uncertainty typically encountered by real-world robots. Combined\nwith causal inference, these models permit an autonomous agent to understand,\nreason about, and explain its environment. In this work, we focus on the\nproblem of a robot block-stacking task due to the fundamental perception and\nmanipulation capabilities it demonstrates, required by many applications\nincluding warehouse logistics and domestic human support robotics. We propose a\nnovel causal probabilistic framework to embed a physics simulation capability\ninto a structural causal model to permit robots to perceive and assess the\ncurrent state of a block-stacking task, reason about the next-best action from\nplacement candidates, and generate post-hoc counterfactual explanations. We\nprovide exemplar next-best action selection results and outline planned\nexperimentation in simulated and real-world robot block-stacking tasks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:58:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Cannizzaro","Ricardo",""],["Routley","Jonathan",""],["Kunze","Lars",""]]}
{"id":"2308.06204","submitter":"Wenlu Du","authors":"Wenlu Du, Ankan Dash, Jing Li, Hua Wei and Guiling Wang","title":"Safety in Traffic Management Systems: A Comprehensive Survey","comments":"Accepted by MDPI Designs journal, the Special Issue Design and\n  Application of Intelligent Transportation Systems. 30 pages, 6 figures,\n  published on 10 August 2023","journal-ref":"Designs 2023, 7, 100","doi":"10.3390/designs7040100","report-no":null,"categories":"eess.SY cs.AI cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic management systems play a vital role in ensuring safe and efficient\ntransportation on roads. However, the use of advanced technologies in traffic\nmanagement systems has introduced new safety challenges. Therefore, it is\nimportant to ensure the safety of these systems to prevent accidents and\nminimize their impact on road users. In this survey, we provide a comprehensive\nreview of the literature on safety in traffic management systems. Specifically,\nwe discuss the different safety issues that arise in traffic management\nsystems, the current state of research on safety in these systems, and the\ntechniques and methods proposed to ensure the safety of these systems. We also\nidentify the limitations of the existing research and suggest future research\ndirections.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:09:12 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Du","Wenlu",""],["Dash","Ankan",""],["Li","Jing",""],["Wei","Hua",""],["Wang","Guiling",""]]}
{"id":"2308.06205","submitter":"Iris Hee Rhang Yoon","authors":"Bernadette J. Stolz, Jagdeep Dhesi, Joshua A. Bull, Heather A.\n  Harrington, Helen M. Byrne, Iris H.R. Yoon","title":"Relational persistent homology for multispecies data with application to\n  the tumor microenvironment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT q-bio.CB q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Topological data analysis (TDA) is an active field of mathematics for\nquantifying shape in complex data. Standard methods in TDA such as persistent\nhomology (PH) are typically focused on the analysis of data consisting of a\nsingle entity (e.g., cells or molecular species). However, state-of-the-art\ndata collection techniques now generate exquisitely detailed multispecies data,\nprompting a need for methods that can examine and quantify the relations among\nthem. Such heterogeneous data types arise in many contexts, ranging from\nbiomedical imaging, geospatial analysis, to species ecology. Here, we propose\ntwo methods for encoding spatial relations among different data types that are\nbased on Dowker complexes and Witness complexes. We apply the methods to\nsynthetic multispecies data of a tumor microenvironment and analyze topological\nfeatures that capture relations between different cell types, e.g., blood\nvessels, macrophages, tumor cells, and necrotic cells. We demonstrate that\nrelational topological features can extract biological insight, including the\ndominant immune cell phenotype (an important predictor of patient prognosis)\nand the parameter regimes of a data-generating model. The methods provide a\nquantitative perspective on the relational analysis of multispecies spatial\ndata, overcome the limits of traditional PH, and are readily computable.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:09:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Stolz","Bernadette J.",""],["Dhesi","Jagdeep",""],["Bull","Joshua A.",""],["Harrington","Heather A.",""],["Byrne","Helen M.",""],["Yoon","Iris H. R.",""]]}
{"id":"2308.06206","submitter":"Ruiyang Zhao","authors":"Ruiyang Zhao, Xiaoyong Mu, Rafaela Gsponer, Jamie Donald-McCann,\n  Yonghao Feng, Weibing Zhang, Yuting Wang, Gong-Bo Zhao, Kazuya Koyama, David\n  Bacon, Robert G. Crittenden","title":"A Multi-tracer Analysis for the eBOSS galaxy sample based on the\n  Effective Field Theory of Large-scale Structure","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform a multi-tracer full-shape analysis in Fourier space based on the\neffective field theory of large-scale structure (EFTofLSS) using the complete\nSloan Digital Sky Survey IV (SDSS-IV) extended Baryon Oscillation Spectroscopic\nSurvey (eBOSS) DR16 luminous red galaxy (LRG) and emission line galaxy (ELG)\nsamples. We study in detail the impact of the volume projection effect and\ndifferent prior choices when doing the full-shape analysis based on the\nEFTofLSS model. We show that adopting a combination of Jeffreys prior and\nGaussian prior can mitigate the volume effect and avoid exploring unphysical\nregions in the parameter space at the same time, which is crucial when jointly\nanalysing the eBOSS LRG and ELG samples. We validate our pipeline using 1000\neBOSS EZmocks. By performing a multi-tracer analysis on mocks with comparable\nfootprints, we find that cosmological constraints can be improved by\n$\\sim10-40\\%$ depending on whether we assume zero stochastic terms in the cross\npower spectrum, which breaks the degeneracy and boosts the constraints on the\nstandard deviation of matter density fluctuation $\\sigma_8$. Combining with the\nBig Bang Nucleosynthesis (BBN) prior and fixing the spectral tilt $n_s$ to\nPlanck value, our multi-tracer full-shape analysis measures\n$H_0=70.0\\pm2.3~{\\rm km}~{\\rm s}^{-1} {\\rm Mpc}^{-1}$,\n$\\Omega_m=0.317^{+0.017}_{-0.021}$, $\\sigma_8=0.787_{-0.062}^{+0.055}$ and\n$S_8=0.809_{-0.078}^{+0.064}$, consistent with the Planck 2018 results. In\nparticular, the constraint on $\\sigma_8$ is improved beyond that obtained from\nthe single tracer analysis by $18\\%$, or by $27\\%$ when assuming zero\nstochastic terms in the cross power spectrum.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:10:38 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhao","Ruiyang",""],["Mu","Xiaoyong",""],["Gsponer","Rafaela",""],["Donald-McCann","Jamie",""],["Feng","Yonghao",""],["Zhang","Weibing",""],["Wang","Yuting",""],["Zhao","Gong-Bo",""],["Koyama","Kazuya",""],["Bacon","David",""],["Crittenden","Robert G.",""]]}
{"id":"2308.06207","submitter":"Jintao Liu","authors":"Fanglong Yao, Changyuan Tian, Jintao Liu, Zequn Zhang, Qing Liu, Li\n  Jin, Shuchao Li, Xiaoyu Li, Xian Sun","title":"Thinking Like an Expert:Multimodal Hypergraph-of-Thought (HoT) Reasoning\n  to boost Foundation Modals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reasoning ability is one of the most crucial capabilities of a foundation\nmodel, signifying its capacity to address complex reasoning tasks.\nChain-of-Thought (CoT) technique is widely regarded as one of the effective\nmethods for enhancing the reasoning ability of foundation models and has\ngarnered significant attention. However, the reasoning process of CoT is\nlinear, step-by-step, similar to personal logical reasoning, suitable for\nsolving general and slightly complicated problems. On the contrary, the\nthinking pattern of an expert owns two prominent characteristics that cannot be\nhandled appropriately in CoT, i.e., high-order multi-hop reasoning and\nmultimodal comparative judgement. Therefore, the core motivation of this paper\nis transcending CoT to construct a reasoning paradigm that can think like an\nexpert. The hyperedge of a hypergraph could connect various vertices, making it\nnaturally suitable for modelling high-order relationships. Inspired by this,\nthis paper innovatively proposes a multimodal Hypergraph-of-Thought (HoT)\nreasoning paradigm, which enables the foundation models to possess the\nexpert-level ability of high-order multi-hop reasoning and multimodal\ncomparative judgement. Specifically, a textual hypergraph-of-thought is\nconstructed utilizing triple as the primary thought to model higher-order\nrelationships, and a hyperedge-of-thought is generated through multi-hop\nwalking paths to achieve multi-hop inference. Furthermore, we devise a visual\nhypergraph-of-thought to interact with the textual hypergraph-of-thought via\nCross-modal Co-Attention Graph Learning for multimodal comparative\nverification. Experimentations on the ScienceQA benchmark demonstrate the\nproposed HoT-based T5 outperforms CoT-based GPT3.5 and chatGPT, which is on par\nwith CoT-based GPT4 with a lower model size.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:13:04 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yao","Fanglong",""],["Tian","Changyuan",""],["Liu","Jintao",""],["Zhang","Zequn",""],["Liu","Qing",""],["Jin","Li",""],["Li","Shuchao",""],["Li","Xiaoyu",""],["Sun","Xian",""]]}
{"id":"2308.06208","submitter":"Cuncai Liu","authors":"Cuncai Liu, Fengjuan Meng, Chang Zhang","title":"Well-posedness and global attractor for wave equation with nonlinear\n  damping and super-cubic nonlinearity","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the paper, we study the semilinear wave equation involving the nonlinear\ndamping $g(u_t) $ and nonlinearity $f(u)$. Under the wider ranges of exponents\nof $g$ and $f$, the well-posedness of the weak solution is achieved by\nestablishing a priori space-time estimates. Then, the existence of the global\nattractor in the naturally phase space $H^1_0(\\Omega)\\times L^2(\\Omega)$ is\nobtained. Moreover, we prove that the global attrator is regular, that is, the\nglobal attractor is a bounded subset of $(H^2(\\Omega)\\cap H^1_0(\\Omega))\\times\nH^1_0(\\Omega)$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:14:20 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Liu","Cuncai",""],["Meng","Fengjuan",""],["Zhang","Chang",""]]}
{"id":"2308.06209","submitter":"Lars Rohwedder","authors":"Alexander Armbruster, Lars Rohwedder, Andreas Wiese","title":"Simpler constant factor approximation algorithms for weighted flow time\n  -- now for any $p$-norm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A prominent problem in scheduling theory is the weighted flow time problem on\none machine. We are given a machine and a set of jobs, each of them\ncharacterized by a processing time, a release time, and a weight. The goal is\nto find a (possibly preemptive) schedule for the jobs in order to minimize the\nsum of the weighted flow times, where the flow time of a job is the time\nbetween its release time and its completion time. It had been a longstanding\nimportant open question to find a polynomial time $O(1)$-approximation\nalgorithm for the problem and this was resolved in a recent line of work. These\nalgorithms are quite complicated and involve for example a reduction to\n(geometric) covering problems, dynamic programs to solve those, and LP-rounding\nmethods to reduce the running time to a polynomial in the input size. In this\npaper, we present a much simpler $(6+\\epsilon)$-approximation algorithm for the\nproblem that does not use any of these reductions, but which works on the input\njobs directly. It even generalizes directly to an $O(1)$-approximation\nalgorithm for minimizing the $p$-norm of the jobs' flow times, for any $0 < p <\n\\infty$ (the original problem setting corresponds to $p=1$). Prior to our work,\nfor $p>1$ only a pseudopolynomial time $O(1)$-approximation algorithm was known\nfor this variant, and no algorithm for $p<1$. For the same objective function,\nwe present a very simple QPTAS for the setting of constantly many unrelated\nmachines for $0 < p < \\infty$ (and assuming quasi-polynomially bounded input\ndata). It works in the cases with and without the possibility to migrate a job\nto a different machine. This is the first QPTAS for the problem if migrations\nare allowed, and it is arguably simpler than the known QPTAS for minimizing the\nweighted sum of the jobs' flow times without migration.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:21:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Armbruster","Alexander",""],["Rohwedder","Lars",""],["Wiese","Andreas",""]]}
{"id":"2308.06210","submitter":"O\\u{g}uz Yilmaz","authors":"Engin Ba\\c{s}ako\\u{g}lu, Bar{\\i}\\c{s} Ye\\c{s}ilo\\u{g}lu and O\\u{g}uz\n  Y{\\i}lmaz","title":"Global Well-posedness for The Fourth-order Nonlinear Schr\\\"{o}dinger\n  Equations on $\\mathbb{R}^{2}$","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 global well-posedness of the two-dimensional defocusing\nfourth-order Schr\\\"odinger initial value problem with power type nonlinearities\n$\\vert u\\vert^{2k}u$ where $k$ is a positive integer. By using the $I$-method,\nwe prove that global well-posedness is satisfied in the Sobolev spaces\n$H^{s}(\\mathbb{R}^{2})$ for $2-\\frac{3}{4k}<s<2$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:25:06 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Ba\u015fako\u011flu","Engin",""],["Ye\u015filo\u011flu","Bar\u0131\u015f",""],["Y\u0131lmaz","O\u011fuz",""]]}
{"id":"2308.06211","submitter":"Allison Moore H","authors":"Tye Lidman and Allison H. Moore","title":"Adjacency of three-manifolds and Brunnian links","comments":"2 figures, 9 pages, comments welcome","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 adjacency in three-manifolds. A three-manifold $Y$\nis $n$-adjacent to another three-manifold $Z$ if there exists an $n$-component\nlink in $Y$ and surgery slopes for that link such that performing Dehn surgery\nalong any nonempty sublink yields $Z$. We characterize adjacencies from\nthree-manifolds to the three-sphere, providing an analogy to Askitas and\nKalfagianni's results on $n$-adjacency in knots.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:30:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lidman","Tye",""],["Moore","Allison H.",""]]}
{"id":"2308.06212","submitter":"Yue Feng","authors":"Yue Feng, Shuchang Liu, Zhenghai Xue, Qingpeng Cai, Lantao Hu, Peng\n  Jiang, Kun Gai, Fei Sun","title":"A Large Language Model Enhanced Conversational Recommender System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Conversational recommender systems (CRSs) aim to recommend high-quality items\nto users through a dialogue interface. It usually contains multiple sub-tasks,\nsuch as user preference elicitation, recommendation, explanation, and item\ninformation search. To develop effective CRSs, there are some challenges: 1)\nhow to properly manage sub-tasks; 2) how to effectively solve different\nsub-tasks; and 3) how to correctly generate responses that interact with users.\nRecently, Large Language Models (LLMs) have exhibited an unprecedented ability\nto reason and generate, presenting a new opportunity to develop more powerful\nCRSs. In this work, we propose a new LLM-based CRS, referred to as LLMCRS, to\naddress the above challenges. For sub-task management, we leverage the\nreasoning ability of LLM to effectively manage sub-task. For sub-task solving,\nwe collaborate LLM with expert models of different sub-tasks to achieve the\nenhanced performance. For response generation, we utilize the generation\nability of LLM as a language interface to better interact with users.\nSpecifically, LLMCRS divides the workflow into four stages: sub-task detection,\nmodel matching, sub-task execution, and response generation. LLMCRS also\ndesigns schema-based instruction, demonstration-based instruction, dynamic\nsub-task and model matching, and summary-based generation to instruct LLM to\ngenerate desired results in the workflow. Finally, to adapt LLM to\nconversational recommendations, we also propose to fine-tune LLM with\nreinforcement learning from CRSs performance feedback, referred to as RLPF.\nExperimental results on benchmark datasets show that LLMCRS with RLPF\noutperforms the existing methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:30:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Feng","Yue",""],["Liu","Shuchang",""],["Xue","Zhenghai",""],["Cai","Qingpeng",""],["Hu","Lantao",""],["Jiang","Peng",""],["Gai","Kun",""],["Sun","Fei",""]]}
{"id":"2308.06213","submitter":"Noah D. Gade","authors":"Noah D. Gade and Jordan Rodu","title":"Change Point Detection With Conceptors","comments":"Main Text 30 pages, 9 figures; Supplementary Material 29 pages, 2\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Offline change point detection seeks to identify points in a time series\nwhere the data generating process changes. This problem is well studied for\nunivariate i.i.d. data, but becomes challenging with increasing dimension and\ntemporal dependence. For the at most one change point problem, we propose the\nuse of a conceptor matrix to learn the characteristic dynamics of a specified\ntraining window in a time series. The associated random recurrent neural\nnetwork acts as a featurizer of the data, and change points are identified from\na univariate quantification of the distance between the featurization and the\nspace spanned by a representative conceptor matrix. This model agnostic method\ncan suggest potential locations of interest that warrant further study. We\nprove that, under mild assumptions, the method provides a consistent estimate\nof the true change point, and quantile estimates for statistics are produced\nvia a moving block bootstrap of the original data. The method is tested on\nsimulations from several classes of processes, and we evaluate performance with\nclustering metrics, graphical methods, and observed Type 1 error control. We\napply our method to publicly available neural data from rats experiencing bouts\nof non-REM sleep prior to exploration of a radial maze.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:32:00 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gade","Noah D.",""],["Rodu","Jordan",""]]}
{"id":"2308.06214","submitter":"Peter Feller","authors":"Peter Feller, Diana Hubbard, Hannah Turner","title":"The Dehn twist coefficient for big and small mapping class groups","comments":"26 pages, 4 figures, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a quasimorphism, which we call the Dehn twist coefficient (DTC),\nfrom the mapping class group of a surface (with a chosen compact boundary\ncomponent) that generalizes the well-studied fractional Dehn twist coefficient\n(FDTC) to surfaces of infinite type. Indeed, for surfaces of finite type the\nDTC coincides with the FDTC. We provide a characterization of the DTC (and thus\nalso of the FDTC) as the unique homogeneous quasimorphism satisfying certain\npositivity conditions.\n  The FDTC has image contained in $\\mathbb{Q}$. In contrast to this, we find\nthat for some surfaces of infinite type the DTC has image all of $\\mathbb{R}$.\nTo see this we provide a new construction of maps with irrational rotation\nbehavior for some surfaces of infinite type with a countable space of ends or\neven just one end. In fact, we find that the DTC is the right tool to detect\nirrational rotation behavior, even for surfaces without boundary.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:32:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Feller","Peter",""],["Hubbard","Diana",""],["Turner","Hannah",""]]}
{"id":"2308.06215","submitter":"Victor Nistor","authors":"Simon Labrunie, Hassan Mohsen, Victor Nistor","title":"Polynomial bounds for the solutions of parametric transmission problems\n  on smooth, bounded domains","comments":"We fixed a small .tex problem in the abstract on the site (the\n  manuscript has not changed)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.NA math.NA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a \\emph{family} $(P_\\omega)_{\\omega \\in \\Omega}$ of elliptic\nsecond order differential operators on a domain $U_0 \\subset \\mathbb{R}^m$\nwhose coefficients depend on the space variable $x \\in U_0$ and on $\\omega \\in\n\\Omega,$ a probability space. We allow the coefficients $a_{ij}$ of $P_\\omega$\nto have jumps over a fixed interface $\\Gamma \\subset U_0$ (independent of\n$\\omega \\in \\Omega$). We obtain polynomial in the norms of the coefficients\nestimates on the norm of the solution $u_\\omega$ to the equation $P_\\omega\nu_\\omega = f$ with transmission and mixed boundary conditions (we consider\n``sign-changing'' problems as well). In particular, we show that, if $f$ and\nthe coefficients $a_{ij}$ are smooth enough and follow a log-normal-type\ndistribution, then the map $\\Omega \\ni \\omega \\to \\|u_\\omega\\|_{H^{k+1}(U_0)}$\nis in $L^p(\\Omega)$, for all $1 \\le p < \\infty$. The same is true for the norms\nof the inverses of the resulting operators. We expect our estimates to be\nuseful in Uncertainty Quantification.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:32:52 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 09:25:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Labrunie","Simon",""],["Mohsen","Hassan",""],["Nistor","Victor",""]]}
{"id":"2308.06216","submitter":"Ryan Matzke","authors":"Bence Borda, Peter Grabner, Ryan W. Matzke","title":"Riesz Energy, $L^2$ Discrepancy, and Optimal Transport of Determinantal\n  Point Processes on the Sphere and the Flat Torus","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math-ph math.MP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Determinantal point processes exhibit an inherent repulsive behavior, thus\nproviding examples of very evenly distributed point sets on manifolds. In this\npaper, we study the so-called harmonic ensemble, defined in terms of Laplace\neigenfunctions on the sphere $\\mathbb{S}^d$ and the flat torus $\\mathbb{T}^d$,\nand the so-called spherical ensemble on $\\mathbb{S}^2$, which originates in\nrandom matrix theory. We extend results of Beltr\\'an, Marzo and Ortega-Cerd\\`a\non the Riesz $s$-energy of the harmonic ensemble to the nonsingular regime\n$s<0$, and as a corollary find the expected value of the spherical cap $L^2$\ndiscrepancy via the Stolarsky invariance principle. We also show that the\nspherical ensemble and the harmonic ensemble on $\\mathbb{S}^2$ and\n$\\mathbb{T}^2$ with $N$ points attain the optimal rate $N^{-1/2}$ in\nexpectation in the Wasserstein metric $W_2$, in contrast to i.i.d. random\npoints, which are known to lose a factor of $(\\log N)^{1/2}$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:34:22 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Borda","Bence",""],["Grabner","Peter",""],["Matzke","Ryan W.",""]]}
{"id":"2308.06217","submitter":"Ke Sun","authors":"Ke Sun, Shen Chen, Taiping Yao, Xiaoshuai Sun, Shouhong Ding, Rongrong\n  Ji","title":"Continual Face Forgery Detection via Historical Distribution Preserving","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Face forgery techniques have advanced rapidly and pose serious security\nthreats. Existing face forgery detection methods try to learn generalizable\nfeatures, but they still fall short of practical application. Additionally,\nfinetuning these methods on historical training data is resource-intensive in\nterms of time and storage. In this paper, we focus on a novel and challenging\nproblem: Continual Face Forgery Detection (CFFD), which aims to efficiently\nlearn from new forgery attacks without forgetting previous ones. Specifically,\nwe propose a Historical Distribution Preserving (HDP) framework that reserves\nand preserves the distributions of historical faces. To achieve this, we use\nuniversal adversarial perturbation (UAP) to simulate historical forgery\ndistribution, and knowledge distillation to maintain the distribution variation\nof real faces across different models. We also construct a new benchmark for\nCFFD with three evaluation protocols. Our extensive experiments on the\nbenchmarks show that our method outperforms the state-of-the-art competitors.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:37:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Sun","Ke",""],["Chen","Shen",""],["Yao","Taiping",""],["Sun","Xiaoshuai",""],["Ding","Shouhong",""],["Ji","Rongrong",""]]}
{"id":"2308.06218","submitter":"Sam Shepherd","authors":"Michael Mihalik and Sam Shepherd","title":"Splittings of One-Ended Groups with One-Ended Halfspaces and\n  Non-1-Acyclicity at Infinity","comments":"40 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the notion of halfspaces associated to a group splitting, and\ninvestigate the relationship between the coarse geometry of the halfspaces and\nthe coarse geometry of the group. Roughly speaking, the halfspaces of a group\nsplitting are subgraphs of the Cayley graph obtained by pulling back the\nhalfspaces of the Bass--Serre tree. Our first theorem shows that (under mild\nconditions) any splitting of a one-ended group can be upgraded to a splitting\nwith one-ended halfspaces. Our second theorem demonstrates that a one-ended\ngroup usually has a JSJ splitting with one-ended halfspaces. And our third\ntheorem states that if a one-ended finitely presented group $G$ admits a\nsplitting with one-ended halfspaces such that some edge stabilizer has more\nthan one end, then $H^2(G,\\mathbb ZG)\\ne \\{0\\}$; in particular $G$ is not\nsimply connected at infinity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:38:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mihalik","Michael",""],["Shepherd","Sam",""]]}
{"id":"2308.06219","submitter":"Khayrul Islam","authors":"Yue Wu, Yuwen Zhao, Khayrul Islam, Yuyuan Zhou, Saeed Omidi, Yevgeny\n  Berdichevsky, and Yaling Liu","title":"Acoustofluidic Engineering Functional Vessel-on-a-Chip","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Construction of in vitro vascular models is of great significance to various\nbiomedical research, such as pharmacokinetics and hemodynamics, thus is an\nimportant direction in tissue engineering. In this work, a standing surface\nacoustic wave field was constructed to spatially arrange suspended endothelial\ncells into a designated patterning. The cell patterning was maintained after\nthe acoustic field was withdrawn by the solidified hydrogel. Then, interstitial\nflow was provided to activate vessel tube formation. Thus, a functional\nvessel-on-a-chip was engineered with specific vessel geometry. Vascular\nfunction, including perfusability and vascular barrier function, was\ncharacterized by beads loading and dextran diffusion, respectively. A\ncomputational atomistic simulation model was proposed to illustrate how solutes\ncross vascular lipid bilayer. The reported acoustofluidic methodology is\ncapable of facile and reproducible fabrication of functional vessel network\nwith specific geometry. It is promising to facilitate the development of both\nfundamental research and regenerative therapy.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:41:14 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 19:58:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Yue",""],["Zhao","Yuwen",""],["Islam","Khayrul",""],["Zhou","Yuyuan",""],["Omidi","Saeed",""],["Berdichevsky","Yevgeny",""],["Liu","Yaling",""]]}
{"id":"2308.06220","submitter":"Noah D. Gade","authors":"Noah D. Gade and Jordan Rodu","title":"Nonlinear Permuted Granger Causality","comments":"Main Text 28 pages, 4 figures; Supplementary Material 27 pages, 3\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Granger causal inference is a contentious but widespread method used in\nfields ranging from economics to neuroscience. The original definition\naddresses the notion of causality in time series by establishing functional\ndependence conditional on a specified model. Adaptation of Granger causality to\nnonlinear data remains challenging, and many methods apply in-sample tests that\ndo not incorporate out-of-sample predictability leading to concerns of model\noverfitting. To allow for out-of-sample comparison, we explicitly define a\nmeasure of functional connectivity using permutations of the covariate set.\nArtificial neural networks serve as featurizers of the data to approximate any\narbitrary, nonlinear relationship, and under certain conditions on the\nfeaturization process and the model residuals, we prove consistent estimation\nof the variance for each permutation. Performance of the permutation method is\ncompared to penalized objective, naive replacement, and omission techniques via\nsimulation, and we investigate its application to neuronal responses of\nacoustic stimuli in the auditory cortex of anesthetized rats. We contend that\ntargeted use of the Granger causal framework, when prior knowledge of the\ncausal mechanisms in a dataset are limited, can help to reveal potential\npredictive relationships between sets of variables that warrant further study.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:44:16 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Gade","Noah D.",""],["Rodu","Jordan",""]]}
{"id":"2308.06221","submitter":"Kanishka Tyagi","authors":"Kanishka Tyagi, Chinmay Rane, Michael Manry","title":"Automated Sizing and Training of Efficient Deep Autoencoders using\n  Second Order Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a multi-step training method for designing generalized linear\nclassifiers. First, an initial multi-class linear classifier is found through\nregression. Then validation error is minimized by pruning of unnecessary\ninputs. Simultaneously, desired outputs are improved via a method similar to\nthe Ho-Kashyap rule. Next, the output discriminants are scaled to be net\nfunctions of sigmoidal output units in a generalized linear classifier. We then\ndevelop a family of batch training algorithm for the multi layer perceptron\nthat optimizes its hidden layer size and number of training epochs. Next, we\ncombine pruning with a growing approach. Later, the input units are scaled to\nbe the net function of the sigmoidal output units that are then feed into as\ninput to the MLP. We then propose resulting improvements in each of the deep\nlearning blocks thereby improving the overall performance of the deep\narchitecture. We discuss the principles and formulation regarding learning\nalgorithms for deep autoencoders. We investigate several problems in deep\nautoencoders networks including training issues, the theoretical, mathematical\nand experimental justification that the networks are linear, optimizing the\nnumber of hidden units in each layer and determining the depth of the deep\nlearning model. A direct implication of the current work is the ability to\nconstruct fast deep learning models using desktop level computational\nresources. This, in our opinion, promotes our design philosophy of building\nsmall but powerful algorithms. Performance gains are demonstrated at each step.\nUsing widely available datasets, the final network's ten fold testing error is\nshown to be less than that of several other linear, generalized linear\nclassifiers, multi layer perceptron and deep learners reported in the\nliterature.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:48:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tyagi","Kanishka",""],["Rane","Chinmay",""],["Manry","Michael",""]]}
{"id":"2308.06222","submitter":"Zi-Xiang Li","authors":"Xun Cai and Zi-Xiang Li and Hong Yao","title":"High-temperature superconductivity induced by the Su-Schrieffer-Heeger\n  electron-phonon coupling","comments":"5 pages plus supplemental materials, 4 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":"  Experimental quest for high-temperature and room-temperature\nsuperconductivity (SC) at ambient pressure has been a long-standing research\ntheme in physics. It has also been desired to construct reliable microscopic\nmechanisms that may achieve high-temperature SC. Here we systematically explore\nSC in the Su-Schrieffer-Heeger (SSH) electron-phonon coupling models by\nperforming numerically-exact quantum Monte-Carlo simulations. Our results\nreliably showed that superconducting $T_c$ of the SSH models is high,\nremarkably higher than those in the Holstein models, particularly in strong\nelectron-phonon coupling regime. This is mainly because SSH phonons can not\nonly induce strong pairing between electrons but also help the phase coherence\nof Cooper pairs, thus realizing higher $T_c$. As mechanism of higher-$T_c$ of\nthe SSH models could be potentially relevant to realistic materials, it paves a\npromising way to find higher-temperature SC in the future.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:48:42 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 15:32:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cai","Xun",""],["Li","Zi-Xiang",""],["Yao","Hong",""]]}
{"id":"2308.06223","submitter":"Chonghao Zhao","authors":"Chonghao Zhao","title":"An approach to extend Cross-Impact Balance method in multiple timespans","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-Impact Balance Analysis (CIB) is a widely used method to build\nscenarios and help researchers to formulate policies in different fields, such\nas management sciences and social sciences. During the development of the CIB\nmethod over the years, some derivative methods were developed to expand its\napplication scope, including a method called dynamic CIB. However, the workflow\nof dynamic CIB is relatively complex. In this article, we provide another\napproach to extend CIB in multiple timespans based on the concept 'scenario\nweight' and simplify the workflow to bring convenience to the policy makers.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:52:11 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Zhao","Chonghao",""]]}
{"id":"2308.06224","submitter":"Ranjan Singh","authors":"Piyush Agarwal, Rohit Medwal, Keynesh Dongol, John Rex Mohan, Yingshu\n  Yang, Hironori Asada, Yasuhiro Fukuma and Ranjan Singh","title":"Interfacial spintronic THz emission","comments":"20 Pages, 4 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The broken inversion symmetry at the ferromagnet (FM)/heavy-metal (HM)\ninterface leads to spin-dependent degeneracy of the energy band, forming\nspin-polarized surface states. As a result, the interface serves as an\neffective medium for converting spin accumulation into two-dimensional charge\ncurrent through the inverse Rashba-Edelstein effect. Exploring and assessing\nthis spin-to-charge conversion (SCC) phenomenon at the FM/HM interface could\noffer a promising avenue to surpass the presumed limits of SCC in bulk HM\nlayers. We utilize spintronic heterostructures as a platform to measure the\nspin-to-charge conversion (SCC) experienced by photoexcited spin currents.\nThese heterostructures emit terahertz electric field when illuminated by\nfemtosecond laser pulses, enabling us to quantitatively assess the ultrafast\nSCC process. Our results demonstrate a robust interfacial spin-to-charge\nconversion (iSCC) within a synthetic antiferromagnetic heterostructure,\nspecifically for the NiFe/Ru/NiFe configuration, by isolating the SCC\ncontribution originating from the interface itself, separate from the bulk\nheavy-metal (HM) region. Moreover, the iSCC at the NiFe/Ru interface is\ndiscovered to be approximately 27% of the strength observed in the highest\nspin-Hall conducting heavy-metal, Pt. Our results thus highlight the\nsignificance of interfacial engineering as a promising pathway for achieving\nefficient ultrafast spintronic devices.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:52:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Agarwal","Piyush",""],["Medwal","Rohit",""],["Dongol","Keynesh",""],["Mohan","John Rex",""],["Yang","Yingshu",""],["Asada","Hironori",""],["Fukuma","Yasuhiro",""],["Singh","Ranjan",""]]}
{"id":"2308.06225","submitter":"Victor Nistor","authors":"Ivan Beschastnyi, Catarina Carvalho, Victor Nistor, Yu Qiao","title":"Analysis on noncompact manifolds and Index Theory: Fredholm conditions\n  and Pseudodifferential operators","comments":"10 pages and three figures, based on the talk of V.N. at \"Methusalem\n  Colloquium and Geometric Analysis Seminar,'' Ghent University, June 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.FA math.MP math.OA math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide Fredholm conditions for compatible differential operators on\ncertain Lie manifolds (that is, on certain possibly non-compact manifolds with\nnice ends). We discuss in more detail the case of manifolds with cylindrical,\nhyperbolic, and Euclidean ends, which are all covered by particular instances\nof our results. We also discuss applications to Schr\\\"odinger operators with\nsingularities of the form r^{-2\\gamma}$, $\\gamma \\in \\RR_+$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:54:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Beschastnyi","Ivan",""],["Carvalho","Catarina",""],["Nistor","Victor",""],["Qiao","Yu",""]]}
{"id":"2308.06226","submitter":"Tevong You","authors":"Joe Davighi, Scott Melville, Ken Mimasu, Tevong You","title":"Positivity and the Electroweak Hierarchy","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-44","categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We point out that an unnatural hierarchy between certain higher-dimensional\noperator coefficients in a low-energy Effective Field Theory (EFT) would\nautomatically imply that the Higgs' vacuum expectation value is hierarchically\nsmaller than the EFT cut-off, assuming the EFT emerged from a unitary, causal\nand local UV completion. Future colliders may have the sensitivity to infer\nsuch a pattern of coefficients for a little hierarchy with an EFT cut-off up to\n$\\mathcal{O}(10)$ TeV.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:55:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Davighi","Joe",""],["Melville","Scott",""],["Mimasu","Ken",""],["You","Tevong",""]]}
{"id":"2308.06227","submitter":"Zichao Yue","authors":"Ruirong Huang, Zichao Yue, Caroline Huang, Janarbek Matai, and Zhiru\n  Zhang","title":"Comprehensive Benchmarking of Binary Neural Networks on NVM Crossbar\n  Architectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-volatile memory (NVM) crossbars have been identified as a promising\ntechnology, for accelerating important machine learning operations, with\nmatrix-vector multiplication being a key example. Binary neural networks (BNNs)\nare especially well-suited for use with NVM crossbars due to their use of a\nlow-bitwidth representation for both activations and weights. However, the\naggressive quantization of BNNs can result in suboptimal accuracy, and the\nanalog effects of NVM crossbars can further degrade the accuracy during\ninference.\n  This paper presents a comprehensive study that benchmarks BNNs trained and\nvalidated on ImageNet and deployed on NeuroSim, a simulator for\nNVM-crossbar-based PIM architecture. Our study analyzes the impact of various\nparameters, such as input precision and ADC resolution, on both the accuracy of\nthe inference and the hardware performance metrics. We have found that an ADC\nresolution of 8-bit with an input precision of 4-bit achieves near-optimal\naccuracy compared to the original BNNs. In addition, we have identified\nbottleneck components in the PIM architecture that affect area, latency, and\nenergy consumption, and we demonstrate the impact that different BNN layers\nhave on hardware performance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:58:18 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Huang","Ruirong",""],["Yue","Zichao",""],["Huang","Caroline",""],["Matai","Janarbek",""],["Zhang","Zhiru",""]]}
{"id":"2308.06228","submitter":"Cheng-Chun Lee","authors":"Cheng-Chun Lee, Lipai Huang, Federico Antolini, Matthew Garcia, Andrew\n  Juanb, Samuel D. Brody, Ali Mostafavi","title":"MaxFloodCast: Ensemble Machine Learning Model for Predicting Peak\n  Inundation Depth And Decoding Influencing Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Timely, accurate, and reliable information is essential for decision-makers,\nemergency managers, and infrastructure operators during flood events. This\nstudy demonstrates a proposed machine learning model, MaxFloodCast, trained on\nphysics-based hydrodynamic simulations in Harris County, offers efficient and\ninterpretable flood inundation depth predictions. Achieving an average\nR-squared of 0.949 and a Root Mean Square Error of 0.61 ft on unseen data, it\nproves reliable in forecasting peak flood inundation depths. Validated against\nHurricane Harvey and Storm Imelda, MaxFloodCast shows the potential in\nsupporting near-time floodplain management and emergency operations. The\nmodel's interpretability aids decision-makers in offering critical information\nto inform flood mitigation strategies, to prioritize areas with critical\nfacilities and to examine how rainfall in other watersheds influences flood\nexposure in one area. The MaxFloodCast model enables accurate and interpretable\ninundation depth predictions while significantly reducing computational time,\nthereby supporting emergency response efforts and flood risk management more\neffectively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:58:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Lee","Cheng-Chun",""],["Huang","Lipai",""],["Antolini","Federico",""],["Garcia","Matthew",""],["Juanb","Andrew",""],["Brody","Samuel D.",""],["Mostafavi","Ali",""]]}
{"id":"2308.06229","submitter":"Peijun Li","authors":"Peijun Li and Xiaokai Yuan","title":"A highly efficient and accurate numerical method for the electromagnetic\n  scattering problem with rectangular cavities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a robust numerical solution to the electromagnetic\nscattering problem involving multiple multi-layered cavities in both transverse\nmagnetic and electric polarizations. A transparent boundary condition is\nintroduced at the open aperture of the cavity to transform the problem from an\nunbounded domain into that of bounded cavities. By employing Fourier series\nexpansion of the solution, we reduce the original boundary value problem to a\ntwo-point boundary value problem, represented as an ordinary differential\nequation for the Fourier coefficients. The analytical derivation of the\nconnection formula for the solution enables us to construct a small-scale\nsystem that includes solely the Fourier coefficients on the aperture,\nstreamlining the solving process. Furthermore, we propose accurate numerical\nquadrature formulas designed to efficiently handle the weakly singular\nintegrals that arise in the transparent boundary conditions. To demonstrate the\neffectiveness and versatility of our proposed method, a series of numerical\nexperiments are conducted.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:59:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Li","Peijun",""],["Yuan","Xiaokai",""]]}
{"id":"2308.06230","submitter":"James Mott","authors":"D. P. Aguillard (33), T. Albahri (30), D. Allspach (7), A. Anisenkov\n  (4 and 37), K. Badgley (7), S. Bae{\\ss}ler (35 and 38), I. Bailey (17 and\n  39), L. Bailey (27), V. A. Baranov (15), E. Barlas-Yucel (28), T. Barrett\n  (6), E. Barzi (7), F. Bedeschi (10), M. Berz (18), M. Bhattacharya (7), H. P.\n  Binney (36), P. Bloom (19), J. Bono (7), E. Bottalico (30), T. Bowcock (30),\n  S. Braun (36), M. Bressler (32), G. Cantatore (12 and 40), R. M. Carey (2),\n  B. C. K. Casey (7), D. Cauz (26 and 41), R. Chakraborty (29), A. Chapelain\n  (6), S. Chappa (7), S. Charity (30), C. Chen (23 and 22), M. Cheng (28), R.\n  Chislett (27), Z. Chu (22 and 42 and 43), T. E. Chupp (33), C. Claessens\n  (36), M. E. Convery (7), S. Corrodi (1), L. Cotrozzi (10 and 44), J. D.\n  Crnkovic (7), S. Dabagov (8 and 45), P. T. Debevec (28), S. Di Falco (10), G.\n  Di Sciascio (11), B. Drendel (7), A. Driutti (10 and 44), V. N. Duginov (15),\n  M. Eads (20), A. Edmonds (2), J. Esquivel (7), M. Farooq (33), R. Fatemi\n  (29), C. Ferrari (10 and 46), M. Fertl (14), A. T. Fienberg (36), A. Fioretti\n  (10 and 46), D. Flay (32), S. B. Foster (2), H. Friedsam (7), N. S. Froemming\n  (20), C. Gabbanini (10 and 46), I. Gaines (7), M. D. Galati (10 and 44), S.\n  Ganguly (7), A. Garcia (36), J. George (32 and 47), L. K. Gibbons (6), A.\n  Gioiosa (25 and 48), K. L. Giovanetti (13), P. Girotti (10), W. Gohn (29), L.\n  Goodenough (7), T. Gorringe (29), J. Grange (33), S. Grant (1 and 27), F.\n  Gray (21), S. Haciomeroglu (5 and 49), T. Halewood-Leagas (30), D. Hampai\n  (8), F. Han (29), J. Hempstead (36), D. W. Hertzog (36), G. Hesketh (27), E.\n  Hess (10), A. Hibbert (30), Z. Hodge (36), K. W. Hong (35), R. Hong (29), T.\n  Hu (23 and 22), Y. Hu (22 and 42 and 43), M. Iacovacci (9 and 50), M. Incagli\n  (10), P. Kammel (36), M. Kargiantoulakis (7), M. Karuza (12 and 51), J.\n  Kaspar (36), D. Kawall (32), L. Kelton (29), A. Keshavarzi (31), D. S.\n  Kessler (32), K. S. Khaw (23 and 22), Z. Khechadoorian (6), N. V. Khomutov\n  (15), B. Kiburg (7), M. Kiburg (7 and 19), O. Kim (34), N. Kinnaird (2), E.\n  Kraegeloh (33), V. A. Krylov (15), N. A. Kuchinskiy (15), K. R. Labe (6), J.\n  LaBounty (36), M. Lancaster (31), S. Lee (5), B. Li (22 and 1 and 52), D. Li\n  (22 and 53), L. Li (22 and 42 and 43), I. Logashenko (4 and 37), A. Lorente\n  Campos (29), Z. Lu (22 and 42 and 43), A. Luc\\`a (7), G. Lukicov (27), A.\n  Lusiani (10 and 54), A. L. Lyon (7), B. MacCoy (36), R. Madrak (7), K. Makino\n  (18), S. Mastroianni (9), J. P. Miller (2), S. Miozzi (11), B. Mitra (34), J.\n  P. Morgan (7), W. M. Morse (3), J. Mott (7 and 2), A. Nath (9 and 50), J. K.\n  Ng (23 and 22), H. Nguyen (7), Y. Oksuzian (1), Z. Omarov (16 and 5), R.\n  Osofsky (36), S. Park (5), G. Pauletta (26 and 41), G. M. Piacentino (25 and\n  55), R. N. Pilato (30), K. T. Pitts (28 and 56), B. Plaster (29), D.\n  Po\\v{c}ani\\'c (35), N. Pohlman (20), C. C. Polly (7), J. Price (30), B. Quinn\n  (34), M. U. H. Qureshi (14), S. Ramachandran (1 and 47), E. Ramberg (7), R.\n  Reimann (14), B. L. Roberts (2), D. L. Rubin (6), L. Santi (26 and 41), C.\n  Schlesier (28 and 57), A. Schreckenberger (7), Y. K. Semertzidis (5 and 16),\n  D. Shemyakin (4 and 37), M. Sorbara (11 and 58), D. St\\\"ockinger (24), J.\n  Stapleton (7), D. Still (7), C. Stoughton (7), D. Stratakis (7), H. E.\n  Swanson (36), G. Sweetmore (31), D. A. Sweigart (6), M. J. Syphers (20), D.\n  A. Tarazona (6 and 30 and 18), T. Teubner (30), A. E. Tewsley-Booth (29 and\n  33), V. Tishchenko (3), N. H. Tran (2 and 59), W. Turner (30), E. Valetov\n  (18), D. Vasilkova (27 and 30), G. Venanzoni (30 and 48), V. P. Volnykh (15),\n  T. Walton (7), A. Weisskopf (18), L. Welty-Rieger (7), P. Winter (1), Y. Wu\n  (1), B. Yu (34), M. Yucel (7), Y. Zeng (23 and 22), C. Zhang (30) (for the\n  Muon g-2 Collaboration, (1) Argonne National Laboratory, Lemont, Illinois,\n  USA, (2) Boston University, Boston, Massachusetts, USA, (3) Brookhaven\n  National Laboratory, Upton, New York, USA, (4) Budker Institute of Nuclear\n  Physics, Novosibirsk, Russia, (5) Center for Axion and Precision Physics\n  (CAPP) / Institute for Basic Science (IBS), Daejeon, Republic of Korea, (6)\n  Cornell University, Ithaca, New York, USA, (7) Fermi National Accelerator\n  Laboratory, Batavia, Illinois, USA, (8) INFN, Laboratori Nazionali di\n  Frascati, Frascati, Italy, (9) INFN, Sezione di Napoli, Naples, Italy, (10)\n  INFN, Sezione di Pisa, Pisa, Italy, (11) INFN, Sezione di Roma Tor Vergata,\n  Rome, Italy, (12) INFN, Sezione di Trieste, Trieste, Italy, (13) Department\n  of Physics and Astronomy, James Madison University, Harrisonburg, Virginia,\n  USA, (14) Institute of Physics and Cluster of Excellence PRISMA+, Johannes\n  Gutenberg University Mainz, Mainz, Germany, (15) Joint Institute for Nuclear\n  Research, Dubna, Russia, (16) Department of Physics, Korea Advanced Institute\n  of Science and Technology (KAIST), Daejeon, Republic of Korea, (17) Lancaster\n  University, Lancaster, United Kingdom, (18) Michigan State University, East\n  Lansing, Michigan, USA, (19) North Central College, Naperville, Illinois,\n  USA, (20) Northern Illinois University, DeKalb, Illinois, USA, (21) Regis\n  University, Denver, Colorado, USA, (22) School of Physics and Astronomy,\n  Shanghai Jiao Tong University, Shanghai, China, (23) Tsung-Dao Lee Institute,\n  Shanghai Jiao Tong University, Shanghai, China, (24) Institut f\\\"ur Kern- und\n  Teilchenphysik, Technische Universit\\\"at Dresden, Dresden, Germany, (25)\n  Universit\\`a del Molise, Campobasso, Italy, (26) Universit\\`a di Udine,\n  Udine, Italy, (27) Department of Physics and Astronomy, University College\n  London, London, United Kingdom, (28) University of Illinois at\n  Urbana-Champaign, Urbana, Illinois, USA, (29) University of Kentucky,\n  Lexington, Kentucky, USA, (30) University of Liverpool, Liverpool, United\n  Kingdom, (31) Department of Physics and Astronomy, University of Manchester,\n  Manchester, United Kingdom, (32) Department of Physics, University of\n  Massachusetts, Amherst, Massachusetts, USA, (33) University of Michigan, Ann\n  Arbor, Michigan, USA, (34) University of Mississippi, University,\n  Mississippi, USA, (35) University of Virginia, Charlottesville, Virginia,\n  USA, (36) University of Washington, Seattle, Washington, USA, (37)\n  Novosibirsk State University, (38) Oak Ridge National Laboratory, (39) The\n  Cockcroft Institute of Accelerator Science and Technology, Daresbury, United\n  Kingdom, (40) Universit\\`a di Trieste, Trieste, Italy, (41) INFN Gruppo\n  Collegato di Udine, Sezione di Trieste, Udine, Italy, (42) Shanghai Key\n  Laboratory for Particle Physics and Cosmology, (43) Key Lab for Particle\n  Physics, Astrophysics and Cosmology (MOE), (44) Universit\\`a di Pisa, Pisa,\n  Italy, (45) Lebedev Physical Institute and NRNU MEPhI, (46) Istituto\n  Nazionale di Ottica - Consiglio Nazionale delle Ricerche, Pisa, Italy, (47)\n  Alliance University, Bangalore, India, (48) INFN, Sezione di Pisa, Pisa,\n  Italy, (49) Istinye University, Istanbul, urki, (50) Universit\\`a di Napoli,\n  Naples, Italy, (51) University of Rijeka, Rijeka, Croatia, (52) Research\n  Center for Graph Computing, Zhejiang Lab, Hangzhou, Zhejiang, China, (53)\n  Shenzhen Technology University, Shenzhen, Guangdong, China, (54) Scuola\n  Normale Superiore, Pisa, Italy, (41) INFN Gruppo Collegato di Udine, Sezione\n  di Trieste, Udine, Italy, (55) INFN, Sezione di Roma Tor Vergata, Rome,\n  Italy, (56) Virginia Tech, Blacksburg, Virginia, USA, (57) Wellesley College,\n  Wellesley, Massachusetts, USA, (58) Universit\\`a di Roma Tor Vergata, Rome,\n  Italy, (59) Institute for Interdisciplinary Research in Science and Education\n  (ICISE), Quy Nhon, Binh Dinh, Vietnam)","title":"Measurement of the Positive Muon Anomalous Magnetic Moment to 0.20 ppm","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-385-AD-CSAID-PPD","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new measurement of the positive muon magnetic anomaly, $a_\\mu\n\\equiv (g_\\mu - 2)/2$, from the Fermilab Muon $g\\!-\\!2$ Experiment based on\ndata collected in 2019 and 2020. We have analyzed more than four times the\nnumber of positrons from muon decay than in our previous result from 2018 data.\nThe systematic error is reduced by more than a factor of two due to better\nrunning conditions, a more stable beam, and improved knowledge of the magnetic\nfield weighted by the muon distribution, $\\tilde{\\omega}'^{}_p$, and of the\nanomalous precession frequency corrected for beam dynamics effects, $\\omega_a$.\nFrom the ratio $\\omega_a / \\tilde{\\omega}'^{}_p$, together with precisely\ndetermined external parameters, we determine $a_\\mu = 116\\,592\\,057(25) \\times\n10^{-11}$ (0.21 ppm). Combining this result with our previous result from the\n2018 data, we obtain $a_\\mu\\text{(FNAL)} = 116\\,592\\,055(24) \\times 10^{-11}$\n(0.20 ppm). The new experimental world average is $a_\\mu (\\text{Exp}) =\n116\\,592\\,059(22)\\times 10^{-11}$ (0.19 ppm), which represents a factor of two\nimprovement in precision.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:00:27 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Aguillard","D. P.","","4 and 37"],["Albahri","T.","","4 and 37"],["Allspach","D.","","4 and 37"],["Anisenkov","A.","","4 and 37"],["Badgley","K.","","35 and 38"],["Bae\u00dfler","S.","","35 and 38"],["Bailey","I.","","17 and\n  39"],["Bailey","L.","","12 and 40"],["Baranov","V. A.","","12 and 40"],["Barlas-Yucel","E.","","12 and 40"],["Barrett","T.","","12 and 40"],["Barzi","E.","","12 and 40"],["Bedeschi","F.","","12 and 40"],["Berz","M.","","12 and 40"],["Bhattacharya","M.","","12 and 40"],["Binney","H. P.","","12 and 40"],["Bloom","P.","","12 and 40"],["Bono","J.","","12 and 40"],["Bottalico","E.","","12 and 40"],["Bowcock","T.","","12 and 40"],["Braun","S.","","12 and 40"],["Bressler","M.","","12 and 40"],["Cantatore","G.","","12 and 40"],["Carey","R. M.","","26 and 41"],["Casey","B. C. K.","","26 and 41"],["Cauz","D.","","26 and 41"],["Chakraborty","R.","","23 and 22"],["Chapelain","A.","","23 and 22"],["Chappa","S.","","23 and 22"],["Charity","S.","","23 and 22"],["Chen","C.","","23 and 22"],["Cheng","M.","","22 and 42 and 43"],["Chislett","R.","","22 and 42 and 43"],["Chu","Z.","","22 and 42 and 43"],["Chupp","T. E.","","10 and 44"],["Claessens","C.","","10 and 44"],["Convery","M. E.","","10 and 44"],["Corrodi","S.","","10 and 44"],["Cotrozzi","L.","","10 and 44"],["Crnkovic","J. D.","","8 and 45"],["Dabagov","S.","","8 and 45"],["Debevec","P. T.","","10 and 44"],["Di Falco","S.","","10 and 44"],["Di Sciascio","G.","","10 and 44"],["Drendel","B.","","10 and 44"],["Driutti","A.","","10 and 44"],["Duginov","V. N.","","10 and 46"],["Eads","M.","","10 and 46"],["Edmonds","A.","","10 and 46"],["Esquivel","J.","","10 and 46"],["Farooq","M.","","10 and 46"],["Fatemi","R.","","10 and 46"],["Ferrari","C.","","10 and 46"],["Fertl","M.","","10 and 46"],["Fienberg","A. T.","","10 and 46"],["Fioretti","A.","","10 and 46"],["Flay","D.","","10 and 46"],["Foster","S. B.","","10 and 46"],["Friedsam","H.","","10 and 46"],["Froemming","N. S.","","10 and 46"],["Gabbanini","C.","","10 and 46"],["Gaines","I.","","10 and 44"],["Galati","M. D.","","10 and 44"],["Ganguly","S.","","32 and 47"],["Garcia","A.","","32 and 47"],["George","J.","","32 and 47"],["Gibbons","L. K.","","25 and 48"],["Gioiosa","A.","","25 and 48"],["Giovanetti","K. L.","","1 and 27"],["Girotti","P.","","1 and 27"],["Gohn","W.","","1 and 27"],["Goodenough","L.","","1 and 27"],["Gorringe","T.","","1 and 27"],["Grange","J.","","1 and 27"],["Grant","S.","","1 and 27"],["Gray","F.","","5 and 49"],["Haciomeroglu","S.","","5 and 49"],["Halewood-Leagas","T.","","23 and 22"],["Hampai","D.","","23 and 22"],["Han","F.","","23 and 22"],["Hempstead","J.","","23 and 22"],["Hertzog","D. W.","","23 and 22"],["Hesketh","G.","","23 and 22"],["Hess","E.","","23 and 22"],["Hibbert","A.","","23 and 22"],["Hodge","Z.","","23 and 22"],["Hong","K. W.","","23 and 22"],["Hong","R.","","23 and 22"],["Hu","T.","","23 and 22"],["Hu","Y.","","22 and 42 and 43"],["Iacovacci","M.","","9 and 50"],["Incagli","M.","","12 and 51"],["Kammel","P.","","12 and 51"],["Kargiantoulakis","M.","","12 and 51"],["Karuza","M.","","12 and 51"],["Kaspar","J.","","23 and 22"],["Kawall","D.","","23 and 22"],["Kelton","L.","","23 and 22"],["Keshavarzi","A.","","23 and 22"],["Kessler","D. S.","","23 and 22"],["Khaw","K. S.","","23 and 22"],["Khechadoorian","Z.","","7 and 19"],["Khomutov","N. V.","","7 and 19"],["Kiburg","B.","","7 and 19"],["Kiburg","M.","","7 and 19"],["Kim","O.","","22 and 1 and 52"],["Kinnaird","N.","","22 and 1 and 52"],["Kraegeloh","E.","","22 and 1 and 52"],["Krylov","V. A.","","22 and 1 and 52"],["Kuchinskiy","N. A.","","22 and 1 and 52"],["Labe","K. R.","","22 and 1 and 52"],["LaBounty","J.","","22 and 1 and 52"],["Lancaster","M.","","22 and 1 and 52"],["Lee","S.","","22 and 1 and 52"],["Li","B.","","22 and 1 and 52"],["Li","D.","","22 and 53"],["Li","L.","","22 and 42 and 43"],["Logashenko","I.","","4 and 37"],["Campos","A. Lorente","","22 and 42 and 43"],["Lu","Z.","","22 and 42 and 43"],["Luc\u00e0","A.","","10 and 54"],["Lukicov","G.","","10 and 54"],["Lusiani","A.","","10 and 54"],["Lyon","A. L.","","7 and 2"],["MacCoy","B.","","7 and 2"],["Madrak","R.","","7 and 2"],["Makino","K.","","7 and 2"],["Mastroianni","S.","","7 and 2"],["Miller","J. P.","","7 and 2"],["Miozzi","S.","","7 and 2"],["Mitra","B.","","7 and 2"],["Morgan","J. P.","","7 and 2"],["Morse","W. M.","","7 and 2"],["Mott","J.","","7 and 2"],["Nath","A.","","9 and 50"],["Ng","J. K.","","23 and 22"],["Nguyen","H.","","16 and 5"],["Oksuzian","Y.","","16 and 5"],["Omarov","Z.","","16 and 5"],["Osofsky","R.","","26 and 41"],["Park","S.","","26 and 41"],["Pauletta","G.","","26 and 41"],["Piacentino","G. M.","","25 and\n  55"],["Pilato","R. N.","","28 and 56"],["Pitts","K. T.","","28 and 56"],["Plaster","B.","","1 and 47"],["Po\u010dani\u0107","D.","","1 and 47"],["Pohlman","N.","","1 and 47"],["Polly","C. C.","","1 and 47"],["Price","J.","","1 and 47"],["Quinn","B.","","1 and 47"],["Qureshi","M. U. H.","","1 and 47"],["Ramachandran","S.","","1 and 47"],["Ramberg","E.","","26 and 41"],["Reimann","R.","","26 and 41"],["Roberts","B. L.","","26 and 41"],["Rubin","D. L.","","26 and 41"],["Santi","L.","","26 and 41"],["Schlesier","C.","","28 and 57"],["Schreckenberger","A.","","5 and 16"],["Semertzidis","Y. K.","","5 and 16"],["Shemyakin","D.","","4 and 37"],["Sorbara","M.","","11 and 58"],["St\u00f6ckinger","D.","","6 and 30 and 18"],["Stapleton","J.","","6 and 30 and 18"],["Still","D.","","6 and 30 and 18"],["Stoughton","C.","","6 and 30 and 18"],["Stratakis","D.","","6 and 30 and 18"],["Swanson","H. E.","","6 and 30 and 18"],["Sweetmore","G.","","6 and 30 and 18"],["Sweigart","D. A.","","6 and 30 and 18"],["Syphers","M. J.","","6 and 30 and 18"],["Tarazona","D. A.","","6 and 30 and 18"],["Teubner","T.","","29 and\n  33"],["Tewsley-Booth","A. E.","","29 and\n  33"],["Tishchenko","V.","","2 and 59"],["Tran","N. H.","","2 and 59"],["Turner","W.","","27 and 30"],["Valetov","E.","","27 and 30"],["Vasilkova","D.","","27 and 30"],["Venanzoni","G.","","30 and 48"],["Volnykh","V. P.","","23 and 22"],["Walton","T.","","23 and 22"],["Weisskopf","A.","","23 and 22"],["Welty-Rieger","L.","","23 and 22"],["Winter","P.","","23 and 22"],["Wu","Y.","","23 and 22"],["Yu","B.","","23 and 22"],["Yucel","M.","","23 and 22"],["Zeng","Y.","","23 and 22"],["Zhang","C.",""]]}
{"id":"2308.06231","submitter":"Giora Peniakov","authors":"Giora Peniakov, Quirin Buchinger, Mohamed Helal, Simon Betzold, Yorick\n  Reum, Michele B. Rota, Giuseppe Ronco, Mattia Beccaceci, Tobias M. Krieger,\n  Saimon F. Covre Da Silva, Armando Rastelli, Rinaldo Trotta, Andreas Pfenning,\n  Sven Hoefling, Tobias Huber-Loyola","title":"Polarized and Un-Polarized Emission from a Single Emitter in a Bullseye\n  Resonator","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present polarized |S|=0.99$\\pm$0.01, and unpolarized |S|=0.03$\\pm$0.01\nemission from a single emitter embedded in a single, cylindrically symmetric\ndevice design. We show that the polarization stems from a position offset of\nthe single emitter with respect to the cavity center, which breaks the\ncylindrical symmetry, and a position-dependent coupling to the frequency\ndegenerate eigenmodes of the resonator structure. The experimental results are\ninterpreted by using numerical simulations and by experimental mapping of the\npolarization-resolved far-field emission patterns. Our findings can be\ngeneralized to any nanophotonic structure where two orthogonal eigenmodes are\nnot fully spatially overlapping.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:00:51 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Peniakov","Giora",""],["Buchinger","Quirin",""],["Helal","Mohamed",""],["Betzold","Simon",""],["Reum","Yorick",""],["Rota","Michele B.",""],["Ronco","Giuseppe",""],["Beccaceci","Mattia",""],["Krieger","Tobias M.",""],["Da Silva","Saimon F. Covre",""],["Rastelli","Armando",""],["Trotta","Rinaldo",""],["Pfenning","Andreas",""],["Hoefling","Sven",""],["Huber-Loyola","Tobias",""]]}
{"id":"2308.06232","submitter":"Ryosuke Shimizu","authors":"Mathav Murugan, Ryosuke Shimizu","title":"First-order Sobolev spaces, self-similar energies and energy measures on\n  the Sierpi\\'{n}ski carpet","comments":"155 pages, 4 figures; Preliminary draft, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.AP math.FA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct and investigate $(1, p)$-Sobolev space, $p$-energy, and the\ncorresponding $p$-energy measures on the planar Sierpi\\'{n}ski carpet for all\n$p \\in (1, \\infty)$. Our method is based on the idea of Kusuoka and Zhou\n[Probab. Theory Related Fields $\\textbf{93}$ (1992), no. 2, 169--196], where\nBrownian motion (the case $p = 2$) on self-similar sets including the planar\nSierpi\\'{n}ski carpet were constructed. Similar to this earlier work, we use a\nsequence of discrete graph approximations and the corresponding discrete\n$p$-energies to define the Sobolev space and $p$-energies. However, we need a\nnew approach to ensure that our $(1, p)$-Sobolev space has a dense set of\ncontinuous functions when $p$ is less than the Ahlfors regular conformal\ndimension. The new ingredients are the use of Loewner type estimates on\ncombinatorial modulus to obtain Poincar\\'e inequality and elliptic Harnack\ninequality on a sequence of approximating graphs. An important feature of our\nSobolev space is the self-similarity of our $p$-energy, which allows us to\ndefine corresponding $p$-energy measures on the planar Sierpi\\'{n}ski carpet.\nWe show that our Sobolev space can also be viewed as a Korevaar-Schoen type\nspace. We apply our results to the attainment problem for Ahlfors regular\nconformal dimension of the Sierpi\\'{n}ski carpet. In particular, we show that\nif the Ahlfors regular conformal dimension, say $\\dim_{\\mathrm{ARC}}$, is\nattained, then any optimal measure which attains $\\dim_{\\mathrm{ARC}}$ should\nbe comparable with the $\\dim_{\\mathrm{ARC}}$-energy measure of some function in\nour $(1, \\dim_{\\mathrm{ARC}})$-Sobolev space up to a multiplicative constant.\nIn this case, we also prove that the Newton-Sobolev space corresponding to any\noptimal measure and metric can be identified as our self-similar $(1,\n\\dim_{\\mathrm{ARC}})$-Sobolev space.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:03:19 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Murugan","Mathav",""],["Shimizu","Ryosuke",""]]}
{"id":"2308.06233","submitter":"Hilson Shrestha","authors":"Hilson Shrestha, Kathleen Cachel, Mallak Alkhathlan, Elke\n  Rundensteiner, and Lane Harrison","title":"Help or Hinder? Evaluating the Impact of Fairness Metrics and Algorithms\n  in Visualizations for Consensus Ranking","comments":"14 pages","journal-ref":"Proceedings of the 2023 ACM Conference on Fairness,\n  Accountability, and Transparency (pp. 1685-1698)","doi":"10.1145/3593013.3594108","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For applications where multiple stakeholders provide recommendations, a fair\nconsensus ranking must not only ensure that the preferences of rankers are well\nrepresented, but must also mitigate disadvantages among socio-demographic\ngroups in the final result. However, there is little empirical guidance on the\nvalue or challenges of visualizing and integrating fairness metrics and\nalgorithms into human-in-the-loop systems to aid decision-makers. In this work,\nwe design a study to analyze the effectiveness of integrating such fairness\nmetrics-based visualization and algorithms. We explore this through a\ntask-based crowdsourced experiment comparing an interactive visualization\nsystem for constructing consensus rankings, ConsensusFuse, with a similar\nsystem that includes visual encodings of fairness metrics and fair-rank\ngeneration algorithms, FairFuse. We analyze the measure of fairness, agreement\nof rankers' decisions, and user interactions in constructing the fair consensus\nranking across these two systems. In our study with 200 participants, results\nsuggest that providing these fairness-oriented support features nudges users to\nalign their decision with the fairness metrics while minimizing the tedious\nprocess of manually having to amend the consensus ranking. We discuss the\nimplications of these results for the design of next-generation fairness\noriented-systems and along with emerging directions for future research.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:04:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Shrestha","Hilson",""],["Cachel","Kathleen",""],["Alkhathlan","Mallak",""],["Rundensteiner","Elke",""],["Harrison","Lane",""]]}
{"id":"2308.06234","submitter":"Paul Davidson","authors":"Devang Tavkari, Paul Davidson","title":"Thermo-mechanical Characterization of Joule Heated Twisted-Coiled\n  Actuators","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, Twisted-Coiled Actuators (TCA) were manufactured by co-coiling\na silver coated nylon conductive yarn with a nylon primary mono filament. In\nthe co-coiled TCA, the conductive yarn is used for Joule heating of primary\nnylon mono filament to provide controlled actuation. A detailed experimental\nstudy is conducted to characterize the thermo-mechanical response of TCA, with\nvarying supply of current amplitude and current rates. The results indicates\nsignificant rate-dependent hysteritic actuation response to supply current. The\ndetails of manufacturing, experiments and results are reported.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:04:57 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Tavkari","Devang",""],["Davidson","Paul",""]]}
{"id":"2308.06235","submitter":"Kexin Jiang","authors":"Kexin Jiang, Yahui Zhao, Guozhe Jin, Zhenguo Zhang and Rongyi Cui","title":"KETM:A Knowledge-Enhanced Text Matching method","comments":"Accepted to IJCNN 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text matching is the task of matching two texts and determining the\nrelationship between them, which has extensive applications in natural language\nprocessing tasks such as reading comprehension, and Question-Answering systems.\nThe mainstream approach is to compute text representations or to interact with\nthe text through attention mechanism, which is effective in text matching\ntasks. However, the performance of these models is insufficient for texts that\nrequire commonsense knowledge-based reasoning. To this end, in this paper, We\nintroduce a new model for text matching called the Knowledge Enhanced Text\nMatching model (KETM), to enrich contextual representations with real-world\ncommon-sense knowledge from external knowledge sources to enhance our model\nunderstanding and reasoning. First, we use Wiktionary to retrieve the text word\ndefinitions as our external knowledge. Secondly, we feed text and knowledge to\nthe text matching module to extract their feature vectors. The text matching\nmodule is used as an interaction module by integrating the encoder layer, the\nco-attention layer, and the aggregation layer. Specifically, the interaction\nprocess is iterated several times to obtain in-depth interaction information\nand extract the feature vectors of text and knowledge by multi-angle pooling.\nThen, we fuse text and knowledge using a gating mechanism to learn the ratio of\ntext and knowledge fusion by a neural network that prevents noise generated by\nknowledge. After that, experimental validation on four datasets are carried\nout, and the experimental results show that our proposed model performs well on\nall four datasets, and the performance of our method is improved compared to\nthe base model without adding external knowledge, which validates the\neffectiveness of our proposed method. The code is available at\nhttps://github.com/1094701018/KETM\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:08:14 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jiang","Kexin",""],["Zhao","Yahui",""],["Jin","Guozhe",""],["Zhang","Zhenguo",""],["Cui","Rongyi",""]]}
{"id":"2308.06236","submitter":"Petra Hatalova","authors":"P. Hatalova, R. Brasser, E. Mamonova, S. C. Werner","title":"Forming rocky exoplanets around K-dwarf stars","comments":"27 pages, 29 figures, to be published in Astronomy & Astrophysics","journal-ref":"A&A 676, A131 (2023)","doi":"10.1051/0004-6361/202346332","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  How multiple close-in super-Earths form around stars with masses lower than\nthat of the Sun is still an open issue. Several recent modeling studies have\nfocused on planet formation around M-dwarf stars, but so far no studies have\nfocused specifically on K dwarfs, which are of particular interest in the\nsearch for extraterrestrial life. We aim to reproduce the currently known\npopulation of close-in super-Earths observed around K-dwarf stars and their\nsystem characteristics. We performed 48 high-resolution N-body simulations of\nplanet formation via planetesimal accretion using the existing GENGA software\nrunning on GPUs. In the simulations we varied the initial disk mass and the\nsolid and gas surface density profiles. Each simulation began with 12000 bodies\nwith radii of between 200 and 2000 km around two different stars, with masses\nof 0.6 and 0.8 $M_{\\odot}$. Most simulations ran for 20 Myr, with several\nsimulations extended to 40 or 100 Myr. The mass distributions for the planets\nwith masses between 2 and 12 $M_\\oplus$ show a strong preference for planets\nwith masses $M_p<6$ $M_\\oplus$ and a lesser preference for planets with larger\nmasses, whereas the mass distribution for the observed sample increases almost\nlinearly. However, we managed to reproduce the main characteristics and\narchitectures of the known planetary systems and produce mostly long-term\nangular-momentum-deficit-stable, nonresonant systems, but we require an initial\ndisk mass of 15 $M_\\oplus$ or higher and a gas surface density value at 1 AU of\n1500 g cm$^{-2}$ or higher. Our simulations also produce many low-mass planets\nwith $M<2$ $M_\\oplus$, which are not yet found in the observed population,\nprobably due to the observational biases. The final systems contain only a\nsmall number of planets, which could possibly accrete substantial amounts of\ngas, and these formed after the gas had mostly dissipated.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:08:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hatalova","P.",""],["Brasser","R.",""],["Mamonova","E.",""],["Werner","S. C.",""]]}
{"id":"2308.06237","submitter":"Lev Khaykovich","authors":"Yaakov Yudkin, Roy Elbaz, Jos\\'e P. D'Incao, Paul S. Julienne, Lev\n  Khaykovich","title":"The reshape of three-body interactions: Observation of the survival of\n  an Efimov state in the atom-dimer continuum","comments":"12 pages, 10 figures. arXiv admin note: text overlap with\n  arXiv:2004.02723","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efimov states are exotic and counterintuitive three-body quantum states that\nemerge in the vicinity of two-atom Feshbach resonances. These states exhibit\nremarkable characteristics as their large spatial extent and extremely weak\nbinding energies following an infinite geometric series, and exist even when\ninteractions are not strong enough to bind two atoms. Efimov states are\nuniversal and produce observable effects at critical values of the interaction\nstrength across the two-body resonance when approaching their threshold for\ndissociation into the different types of three-body continua. In particular, as\nthe strength of the interaction is decreased, an Efimov state merges into the\natom-dimer threshold and eventually dissociates into an unbound atom-dimer\npair. Here we explore this critical point using refined coherent few-body\nspectroscopy in $^7$Li atoms near a narrow two-body Feshbach resonance.\nContrary to the expectation set by universality, we find that the $^7$Li Efimov\ntrimer does not immediately dissociate when passing the threshold, and survives\nas a metastable state embedded in the atom-dimer continuum. We identify this\nbehavior with a novel phenomena related to the emergence of a repulsive\ninteraction in the atom-dimer channel which reshapes the three-body\ninteractions in systems characterized by narrow Feshbach resonances. Our\nresults shed new light on the nature of $^7$Li Efimov states and provide a new\npath to understand various puzzling phenomena observed here, as well as in\nother previous experimental studies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:09:58 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Yudkin","Yaakov",""],["Elbaz","Roy",""],["D'Incao","Jos\u00e9 P.",""],["Julienne","Paul S.",""],["Khaykovich","Lev",""]]}
{"id":"2308.06238","submitter":"Catalin Gainaru Dr.","authors":"Kevin Moch, Roland B\\\"ohmer, and Catalin Gainaru","title":"The nonlinear physical aging-susceptibility of a glass forming melt","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A high-resolution, temperature oscillation-based probe of physical aging in\ncomplex systems is introduced. The Fourier analysis of the measured responses\nallows one to extract a high-order aging-related complex susceptibility that is\nnot accessible via traditional temperature-jump and -ramp procedures. To\ndemonstrate the potential of this oscillatory approach, we analyze the periodic\ntime evolution of glycerol's structural relaxation using shear rheology as a\nvehicle. Thereby, we access up to the sixth harmonics and detect aging\nfingerprints within a resolution range of three orders of magnitude for\ntemperature amplitudes of up to 4 K. The high-order aging coefficients and\nsusceptibilities obtained for glycerol are described well by the\nTool-Narayanaswami-Moynihan formalism.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:13:53 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Moch","Kevin",""],["B\u00f6hmer","Roland",""],["Gainaru","Catalin",""]]}
{"id":"2308.06239","submitter":"Vikrant Singhal","authors":"Shai Ben-David, Alex Bie, Cl\\'ement L. Canonne, Gautam Kamath, Vikrant\n  Singhal","title":"Private Distribution Learning with Public Data: The View from Sample\n  Compression","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of private distribution learning with access to public\ndata. In this setup, which we refer to as public-private learning, the learner\nis given public and private samples drawn from an unknown distribution $p$\nbelonging to a class $\\mathcal Q$, with the goal of outputting an estimate of\n$p$ while adhering to privacy constraints (here, pure differential privacy)\nonly with respect to the private samples.\n  We show that the public-private learnability of a class $\\mathcal Q$ is\nconnected to the existence of a sample compression scheme for $\\mathcal Q$, as\nwell as to an intermediate notion we refer to as list learning. Leveraging this\nconnection: (1) approximately recovers previous results on Gaussians over\n$\\mathbb R^d$; and (2) leads to new ones, including sample complexity upper\nbounds for arbitrary $k$-mixtures of Gaussians over $\\mathbb R^d$, results for\nagnostic and distribution-shift resistant learners, as well as closure\nproperties for public-private learnability under taking mixtures and products\nof distributions. Finally, via the connection to list learning, we show that\nfor Gaussians in $\\mathbb R^d$, at least $d$ public samples are necessary for\nprivate learnability, which is close to the known upper bound of $d+1$ public\nsamples.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:15:12 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 19:26:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ben-David","Shai",""],["Bie","Alex",""],["Canonne","Cl\u00e9ment L.",""],["Kamath","Gautam",""],["Singhal","Vikrant",""]]}
{"id":"2308.06240","submitter":"Alba Torras Coloma","authors":"Alba Torras-Coloma, Leyre Mart\\'inez de Olcoz, Eva C\\'espedes, Elia\n  Bertoldo, David L\\'opez-N\\'u\\~nez, Sagar Paul, Wolfgang Wernsdorfer, Gemma\n  Rius, Pol Forn-D\\'iaz","title":"Superconducting nitridized-aluminum thin films","comments":"13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the direct observation of superconductivity in nitridized-aluminum\nthin films. The films are produced by sputtering deposition of aluminum in a\ncontrolled mixture of nitrogen diluted in argon. The concentration of applied\nnitrogen directly determines the properties of the superconducting thin films.\nWe observe samples displaying critical temperatures up to 3.38$\\pm$0.01 K and\nresilience to in-plane magnetic fields well above 1 T, with good\nreproducibility of the results. To our knowledge, this work represents the\nfirst unambiguous demonstration of tunable superconductivity in aluminum-based\nnitridized thin films. Our results put forward nitridized aluminum as a\npromising material to be employed in superconducting quantum circuits for\nquantum technology applications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:19:09 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Torras-Coloma","Alba",""],["de Olcoz","Leyre Mart\u00ednez",""],["C\u00e9spedes","Eva",""],["Bertoldo","Elia",""],["L\u00f3pez-N\u00fa\u00f1ez","David",""],["Paul","Sagar",""],["Wernsdorfer","Wolfgang",""],["Rius","Gemma",""],["Forn-D\u00edaz","Pol",""]]}
{"id":"2308.06241","submitter":"Mohammad Maksood Akhter","authors":"Mohammad Maksood Akhter, Devpriya Kanojia","title":"Covid-19 Public Sentiment Analysis for Indian Tweets Classification","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":"  When any extraordinary event takes place in the world wide area, it is the\nsocial media that acts as the fastest carrier of the news along with the\nconsequences dealt with that event. One can gather much information through\nsocial networks regarding the sentiments, behavior, and opinions of the people.\nIn this paper, we focus mainly on sentiment analysis of twitter data of India\nwhich comprises of COVID-19 tweets. We show how Twitter data has been extracted\nand then run sentimental analysis queries on it. This is helpful to analyze the\ninformation in the tweets where opinions are highly unstructured,\nheterogeneous, and are either positive or negative or neutral in some cases.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 09:29:55 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Akhter","Mohammad Maksood",""],["Kanojia","Devpriya",""]]}
{"id":"2308.06242","submitter":"Annie Raymond","authors":"Maria Dasc\\u{a}lu and Annie Raymond","title":"Tropicalizing the Graph Profile of Some Almost-Stars","comments":"14 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many important problems in extremal combinatorics can be stated as certifying\npolynomial inequalities in graph homomorphism numbers, and in particular, many\nask to certify pure binomial inequalities. For a fixed collection of graphs\n$\\mathcal{U}$, the tropicalization of the graph profile of $\\mathcal{U}$\nessentially records all valid pure binomial inequalities involving graph\nhomomorphism numbers for graphs in $\\mathcal{U}$. Building upon ideas and\ntechniques described by Blekherman and Raymond in 2022, we compute the\ntropicalization of the graph profile for $K_1$ and $S_{2,1^k}$-trees,\nalmost-star graphs with one branch containing two edges and $k$ branches\ncontaining one edge. This allows pure binomial inequalities in homomorphism\nnumbers (or densities) for these graphs to be verified through an explicit\nlinear program where the number of variables is equal to the number of edges in\nthe biggest $S_{2,1^k}$-tree involved.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:19:16 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Dasc\u0103lu","Maria",""],["Raymond","Annie",""]]}
{"id":"2308.06243","submitter":"David Williams","authors":"Nilima Nigam and David M. Williams","title":"Conforming Finite Element Function Spaces in Four Dimensions, Part 1:\n  Foundational Principles and the Tesseract","comments":"35 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The stability, robustness, accuracy, and efficiency of space-time finite\nelement methods crucially depend on the choice of approximation spaces for test\nand trial functions. This is especially true for high-order, mixed finite\nelement methods which often must satisfy an inf-sup condition in order to\nensure stability. With this in mind, the primary objective of this paper and a\ncompanion paper is to provide a wide range of explicitly stated, conforming,\nfinite element spaces in four-dimensions. In this paper, we construct explicit\nhigh-order conforming finite elements on 4-cubes (tesseracts); our construction\nuses tools from the recently developed `Finite Element Exterior Calculus'. With\na focus on practical implementation, we provide details including Piola-type\ntransformations, and explicit expressions for the volumetric, facet, face,\nedge, and vertex degrees of freedom. In addition, we establish important\ntheoretical properties, such as the exactness of the finite element sequences,\nand the unisolvence of the degrees of freedom.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:19:59 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 00:58:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nigam","Nilima",""],["Williams","David M.",""]]}
{"id":"2308.06244","submitter":"Vitalie Eremeev","authors":"Hugo Molinares, Fernanda Pinilla, Enrique Mu\\~noz, Francisco Mu\\~noz,\n  Vitalie Eremeev","title":"Generation of phonon quantum states and quantum correlations among\n  single photon emitters in hexagonal boron nitride","comments":"14 pages, 9 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":"  Hexagonal boron nitride hosts one dimensional topologically-protected phonons\nat certain grain boundaries. Here we show that it is possible to use these\nphonons for the transmission of information. Particularly, \\textit{(i)} a color\ncenter (a single photon emitter) can be used to induce single-, two- and\nqubit-phonon states in the one dimensional channel, and \\textit{(ii)} two\ndistant color centers can be coupled by the topological phonons transmitted\nalong a line of defects that acts as a waveguide, thus exhibiting strong\nquantum correlations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:24:32 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Molinares","Hugo",""],["Pinilla","Fernanda",""],["Mu\u00f1oz","Enrique",""],["Mu\u00f1oz","Francisco",""],["Eremeev","Vitalie",""]]}
{"id":"2308.06245","submitter":"Palash Pandya","authors":"Palash Pandya and Marcin Wie\\'sniak","title":"Minimum Hilbert-Schmidt distance and the Closest Separable state to\n  arbitrary $2 \\times 2$ and $2 \\times 3$ states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we provide a three step algorithm to obtain the Closest\nSeparable State to the given state in Hilbert space dimensions $2\\times 2$ and\n$2\\times 3$, or in the higher dimensional Hilbert spaces, 'Closest Positive\nPartial Transpose (PPT) state' for the chosen bipartition. In the process, a\ntight lower bound to the minimum Hilbert-Schmidt distance is brought forth\ntogether with the relation between the minimum Hilbert-Schmidt distance and\nNegativity. This also leads us to discuss the validity of the said distance\nfrom the set of separable quantum states as an entanglement measure. Any\nEntanglement measure defined as the minimum of a distance measure to the set of\nseparable states needs to follow certain widely accepted rules. Most\nsignificantly, contractiveness of the distance (also, CP non-expansive\nproperty) under LOCC maps. While the Hilbert-Schmidt distance does not have\nthis property, it is still an open question if the measure constructed using it\nis non-increasing under LOCC operations. While we outline some of the\ndifficulties in such a proof, we also provide numerical evidence that brings\none step closer to closing the question.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:24:54 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Pandya","Palash",""],["Wie\u015bniak","Marcin",""]]}
{"id":"2308.06246","submitter":"Joao Lucas Rulff Da Costa","authors":"Sonia Castelo, Joao Rulff, Erin McGowan, Bea Steers, Guande Wu, Shaoyu\n  Chen, Iran Roman, Roque Lopez, Ethan Brewer, Chen Zhao, Jing Qian, Kyunghyun\n  Cho, He He, Qi Sun, Huy Vo, Juan Bello, Michael Krone, Claudio Silva","title":"ARGUS: Visualization of AI-Assisted Task Guidance in AR","comments":"11 pages, 8 figures. This is the author's version of the article of\n  the article that has been accepted for publication 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":"  The concept of augmented reality (AR) assistants has captured the human\nimagination for decades, becoming a staple of modern science fiction. To pursue\nthis goal, it is necessary to develop artificial intelligence (AI)-based\nmethods that simultaneously perceive the 3D environment, reason about physical\ntasks, and model the performer, all in real-time. Within this framework, a wide\nvariety of sensors are needed to generate data across different modalities,\nsuch as audio, video, depth, speech, and time-of-flight. The required sensors\nare typically part of the AR headset, providing performer sensing and\ninteraction through visual, audio, and haptic feedback. AI assistants not only\nrecord the performer as they perform activities, but also require machine\nlearning (ML) models to understand and assist the performer as they interact\nwith the physical world. Therefore, developing such assistants is a challenging\ntask. We propose ARGUS, a visual analytics system to support the development of\nintelligent AR assistants. Our system was designed as part of a multi year-long\ncollaboration between visualization researchers and ML and AR experts. This\nco-design process has led to advances in the visualization of ML in AR. Our\nsystem allows for online visualization of object, action, and step detection as\nwell as offline analysis of previously recorded AR sessions. It visualizes not\nonly the multimodal sensor data streams but also the output of the ML models.\nThis allows developers to gain insights into the performer activities as well\nas the ML models, helping them troubleshoot, improve, and fine tune the\ncomponents of the AR assistant.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:27:01 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Castelo","Sonia",""],["Rulff","Joao",""],["McGowan","Erin",""],["Steers","Bea",""],["Wu","Guande",""],["Chen","Shaoyu",""],["Roman","Iran",""],["Lopez","Roque",""],["Brewer","Ethan",""],["Zhao","Chen",""],["Qian","Jing",""],["Cho","Kyunghyun",""],["He","He",""],["Sun","Qi",""],["Vo","Huy",""],["Bello","Juan",""],["Krone","Michael",""],["Silva","Claudio",""]]}
{"id":"2308.06247","submitter":"Christoph T\\\"onnis","authors":"Christoph T\\\"onnis, Seowon Choi, Carsten Rott, Minyeong Seo, Jiwoong\n  Lee (for the IceCube Collaboration)","title":"A new simulation framework for IceCube Upgrade calibration using IceCube\n  Upgrade Camera system","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":"PoS(ICRC2023)1071","doi":"10.22323/1.444.1071","report-no":"PoS-ICRC2023-1071","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Currently, an upgrade consisting of seven densely instrumented strings in the\ncenter of the volume of the IceCube detector with new digital optical modules\n(DOMs) is being built. On each string, DOMs will be regularly spaced with a\nvertical separation of 3 m between depths of 2160 m and 2430 m below the\nsurface of the ice, which is a denser configuration than the existing DOMs of\nIceCube detector. For a precise calibration of the IceCube Upgrade it is\nimportant to understand the properties of the ice, both inside and surrounding\nthe deployment holes. The camera system together with the LED illumination\nsystem was developed and produced at Sungkyunkwan university and are installed\nin almost every DOM to measure these properties. For these calibration\nmeasurements, a new simulation framework, which produces expected images from\nvarious geometric and optical variables has been developed. Images produced\nfrom the simulation will be used to develop an analysis framework for the\nIceCube Upgrade camera calibration system and for the design of the IceCube\nGen2 camera system.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:27:28 GMT"}],"update_date":"2023-08-14","authors_parsed":[["T\u00f6nnis","Christoph","","for the IceCube Collaboration"],["Choi","Seowon","","for the IceCube Collaboration"],["Rott","Carsten","","for the IceCube Collaboration"],["Seo","Minyeong","","for the IceCube Collaboration"],["Lee","Jiwoong","","for the IceCube Collaboration"]]}
{"id":"2308.06248","submitter":"Robin Hesse","authors":"Robin Hesse, Simone Schaub-Meyer, Stefan Roth","title":"FunnyBirds: A Synthetic Vision Dataset for a Part-Based Analysis of\n  Explainable AI Methods","comments":"Accepted at ICCV 2023. Code: https://github.com/visinf/funnybirds","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The field of explainable artificial intelligence (XAI) aims to uncover the\ninner workings of complex deep neural models. While being crucial for\nsafety-critical domains, XAI inherently lacks ground-truth explanations, making\nits automatic evaluation an unsolved problem. We address this challenge by\nproposing a novel synthetic vision dataset, named FunnyBirds, and accompanying\nautomatic evaluation protocols. Our dataset allows performing semantically\nmeaningful image interventions, e.g., removing individual object parts, which\nhas three important implications. First, it enables analyzing explanations on a\npart level, which is closer to human comprehension than existing methods that\nevaluate on a pixel level. Second, by comparing the model output for inputs\nwith removed parts, we can estimate ground-truth part importances that should\nbe reflected in the explanations. Third, by mapping individual explanations\ninto a common space of part importances, we can analyze a variety of different\nexplanation types in a single common framework. Using our tools, we report\nresults for 24 different combinations of neural models and XAI methods,\ndemonstrating the strengths and weaknesses of the assessed methods in a fully\nautomatic and systematic manner.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:29:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Hesse","Robin",""],["Schaub-Meyer","Simone",""],["Roth","Stefan",""]]}
{"id":"2308.06249","submitter":"Leonardo Constantin Mihalcea","authors":"Leonardo C. Mihalcea and Rahul Singh","title":"Characteristic cycles of IH sheaves of simply laced minuscule Schubert\n  varieties are irreducible","comments":"14 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G/P$ be a complex cominuscule flag manifold of type $E_6,E_7$. We prove\nthat each characteristic cycle of the intersection homology (IH) complex of a\nSchubert variety in $G/P$ is irreducible. The proof utilizes an earlier\nalgorithm by the same authors which calculates local Euler obstructions, then\nproceeds by direct computer calculation using Sage. This completes to the\nexceptional Lie types the characterization of irreducibility of IH sheaves of\nSchubert varieties in cominuscule $G/P$ obtained by Boe and Fu. As a\nby-product, we also obtain that the Mather classes, and the\nChern-Schwartz-MacPherson classes of Schubert cells in cominuscule $G/P$ of\ntype $E_6,E_7$, are strongly positive.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:32:02 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mihalcea","Leonardo C.",""],["Singh","Rahul",""]]}
{"id":"2308.06250","submitter":"Zirui Chen","authors":"Zirui Chen, Zhaoyang Zhang, and Zhaohui Yang","title":"Big AI Models for 6G Wireless Networks: Opportunities, Challenges, and\n  Research Directions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, big artificial intelligence (AI) models represented by chatGPT have\nbrought an incredible revolution. With the pre-trained big AI model (BAIM) in\ncertain fields, numerous downstream tasks can be accomplished with only\nfew-shot or even zero-shot learning and exhibit state-of-the-art performances.\nAs widely envisioned, the big AI models are to rapidly penetrate into major\nintelligent services and applications, and are able to run at low unit cost and\nhigh flexibility. In 6G wireless networks, to fully enable intelligent\ncommunication, sensing and computing, apart from providing other intelligent\nwireless services and applications, it is of vital importance to design and\ndeploy certain wireless BAIMs (wBAIMs). However, there still lacks\ninvestigation on architecture design and system evaluation for wBAIM. In this\npaper, we provide a comprehensive discussion as well as some in-depth prospects\non the demand, design and deployment aspects of the wBAIM. We opine that wBAIM\nwill be a recipe of the 6G wireless networks to build high-efficient,\nsustainable, versatile, and extensible wireless intelligence for numerous\npromising visions. Then, we present the core characteristics and principles to\nguide the design of wBAIMs, and discuss the key aspects of developing wBAIMs\nthrough identifying the differences between the existing BAIMs and the emerging\nwBAIMs. Finally, related research directions and potential solutions are\noutlined.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:33:31 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Chen","Zirui",""],["Zhang","Zhaoyang",""],["Yang","Zhaohui",""]]}
{"id":"2308.06251","submitter":"RIcardo Carmo","authors":"R. B. do Carmo and T. Ara\\'ujo Lima","title":"Mixing Property of Symmetrical Polygonal Billiards","comments":"8 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The present work consists of a numerical study of the dynamics of irrational\npolygonal billiards. Our contribution reinforces the hypothesis that these\nsystems could be Strongly Mixing, although never demonstrably chaotic, and\ndiscuss the role of rotational symmetries on the billiards boundaries. We\nintroduce a biparametric polygonal billiards family with only $C_n$ rotational\nsymmetries. Initially, we calculate for some integers values of $n$ the filling\nof the phase space through the Relative Measure $r(\\ell, \\theta; t)$ for a\nplane of parameters $\\ell \\times \\theta$. From the resulting phase diagram, we\ncould identify the completely ergodic systems. The numerical evidence that\nsymmetrical polygonal billiards can be Strongly Mixing is obtained by\ncalculating the Position Autocorrelation Function, $\\Cor_x(t)$, these figures\nof merit result in power law-type decays $t^{- \\sigma}$. The Strongly Mixing\nproperty is indicated by $\\sigma = 1$. For odd small values of $n$, the\nexponent $\\sigma \\simeq 1$ is obtained while $\\sigma < 1$, weakly mixing cases,\nfor small even values. Intermediate $n$ values present $\\sigma \\simeq 1$\nindependent of parity. For high values of symmetry parameter $n$, the\nbiprametric family tends to be a circular billiard (integrable case). This\nrange shows even less ergodic behavior when $n$ increases and $\\sigma$\ndecreases.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:36:23 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Carmo","R. B. do",""],["Lima","T. Ara\u00fajo",""]]}
{"id":"2308.06252","submitter":"Andrew N. Jordan","authors":"Andrew N. Jordan and John C. Howell","title":"Fundamental Limits on Subwavelength Range Resolution","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.data-an quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish fundamental bounds on subwavelength resolution for the radar\nranging problem, ``super radar''. Information theoretical metrics are applied\nto probe the resolution limits for the case of both direct electric field\nmeasurement and photon-counting measurements. To establish fundamental limits,\nwe begin with the simplest case of range resolution of two point targets from a\nmetrology perspective. These information-based metrics establish fundamental\nbounds on both the minimal discrimination distance of two targets as well as\nthe precision on the separation of two subwavelength resolved targets. For the\nminimal separation distance, both the direct field method and photon counting\nmethod show that the discriminability vanishes quadratically as the target\nseparation goes to zero, and is proportional to the variance of the second\nderivative of the electromagnetic field profile. Nevertheless, robust\nsubwavelength estimation is possible. Several different band-limited function\nclasses are introduced to optimize discrimination. We discuss the application\nof maximum likelihood estimation to improve the range precision with optimal\nperformance. The general theory of multi-parameter estimation is analyzed, and\na simple example of estimating both the separation and relative strength of the\ntwo point reflectors is presented.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:38:10 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Jordan","Andrew N.",""],["Howell","John C.",""]]}
{"id":"2308.06253","submitter":"James Gardner","authors":"James W. Gardner, Tuvia Gefen, Simon A. Haine, Joseph J. Hope, and\n  Yanbei Chen","title":"Holevo Cram\\'er-Rao Bound for waveform estimation of gravitational waves","comments":"v2. Letter: 7 pages, 2 figures. Supplemental Material: 17 pages, 4\n  figures. Submitted on August 11 2023 to Physical Review Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detecting kilohertz gravitational waves from the post-merger remnants of\nbinary neutron-star mergers could enhance our understanding of extreme matter.\nTo enable this detection, a gravitational-wave interferometer can be detuned to\nincrease its kilohertz sensitivity. The precision limits of detuned\ninterferometers and other cavity--based quantum sensors, however, are not well\nunderstood. The sensitivity of the standard variational readout scheme does not\nreach the waveform-estimation Quantum Cram\\'er-Rao Bound. We establish the\nfundamental precision limit, the waveform-estimation Holevo Cram\\'er-Rao Bound,\nby identifying the incompatibility of the na\\\"ive estimates of the signal's\ncosine and sine phases. For an equal weighting between the phases, we prove\nthat the standard scheme is indeed optimal. For unequal weights, however, we\npropose an experimental realisation of a new measurement scheme to\nsignificantly improve the sensitivity. This scheme could facilitate kilohertz\ngravitational-wave astronomy and has broader applications to detuned\ncavity--based quantum metrology.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:38:30 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 21:56:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gardner","James W.",""],["Gefen","Tuvia",""],["Haine","Simon A.",""],["Hope","Joseph J.",""],["Chen","Yanbei",""]]}
{"id":"2308.06254","submitter":"Martin N\\\"agele","authors":"Jannis Blauth and Nathan Klein and Martin N\\\"agele","title":"A Better-Than-1.6-Approximation for Prize-Collecting TSP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prize-Collecting TSP is a variant of the traveling salesperson problem where\none may drop vertices from the tour at the cost of vertex-dependent penalties.\nThe quality of a solution is then measured by adding the length of the tour and\nthe sum of all penalties of vertices that are not visited. We present a\npolynomial-time approximation algorithm with an approximation guarantee\nslightly below $1.6$, where the guarantee is with respect to the natural linear\nprogramming relaxation of the problem. This improves upon the previous\nbest-known approximation ratio of $1.774$. Our approach is based on a known\ndecomposition for solutions of this linear relaxation into rooted trees. Our\nalgorithm takes a tree from this decomposition and then performs a pruning step\nbefore doing parity correction on the remainder. Using a simple analysis, we\nbound the approximation guarantee of the proposed algorithm by $(1+\\sqrt{5})/2\n\\approx 1.618$, the golden ratio. With some additional technical care we\nfurther improve it to $1.599$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:39:50 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Blauth","Jannis",""],["Klein","Nathan",""],["N\u00e4gele","Martin",""]]}
{"id":"2308.06255","submitter":"Rhodri Smith","authors":"Rhodri Lyn Smith, Lee Bartley, Christopher O'Callaghan, Kevin M.\n  Bradley, Chris Marshall","title":"NEMA NU 2-2018 performance evaluation of a new generation digital 32-cm\n  axial field-of-view Omni Legend PET-CT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A NEMA performance evaluation was conducted on the new General Electric (GE)\ndigital Omni Legend PET-CT system with 32-cm extended field-of-view. This study\nmarks the introduction of the first-ever commercially available clinical\ndigital bismuth germanate technology. Testing was performed in accordance with\nthe NEMA NU2-2018 standard. A comparison was made with the performance of two\nother commercial GE scanners with extended fields-of-view. A digital lutetium\nyttrium orthosilicate system (Discovery MI - 6 ring) and a non-digital bismuth\ngermanate system (Discovery IQ). For the Omni assessment, the tangential,\nradial, and axial spatial resolutions at 1 cm radial offset were measured as\n3.76 mm, 3.73 mm, and 4.25 mm FWHM. The total system sensitivity to a line\nsource at the center was 44.36 cps/kBq. The peak NECR was 501 kcps at 17.8\nkBq/mL. The scatter fraction at NECR peak was 35.48%, and the maximum\ncount-rate error at and below NEC peak was 5.5%. Sphere contrast recovery\ncoefficients were from 52% (10 mm) to 93% (37 mm). The system does not use time\nof flight; thus, no assessment of timing resolution was made. The PET-CT\nco-registration accuracy was 2.4 mm. The performance of the Omni Legend\nsurpassed that of the Discovery MI on all NEMA tests, except for assessments of\nbackground variability (image noise). Time of flight is associated with\ninherent improvements in signal-to-noise ratio. In lieu of time of flight\ncapabilities, the Omni provides software corrections in the form of a\npre-trained neural network (trained on non-ToF to ToF). With such corrections,\naverage performance is competitive when compared to ToF systems. Further\nvalidation is required to optimize clinical imaging protocols and\nhyperparameters associated with such software corrections and to examine the\neffect of non-linear corrections with varying target size, particularly for\nreal world, clinical scans.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:44:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Smith","Rhodri Lyn",""],["Bartley","Lee",""],["O'Callaghan","Christopher",""],["Bradley","Kevin M.",""],["Marshall","Chris",""]]}
{"id":"2308.06256","submitter":"Pascal Puphal","authors":"P. Puphal, M. Y. P. Akbar, M. Hepting, E. Goering, M. Isobe, A. A.\n  Nugroho, B. Keimer","title":"Single crystal synthesis, structure, and magnetism of\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","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent claim of superconductivity above room temperature in\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O with 0.9 < $x$ < 1 (referred to as LK-99) has\nsparked considerable interest. To minimize the influence of structural defects\nand impurity phases on the physical properties, we have synthesized phase-pure\nsingle crystals with $x \\sim 1$. We find that the crystals are highly\ninsulating and optically transparent. X-ray analysis reveals an uneven\ndistribution of the substituted Cu throughout the sample. Temperature ($T$)\ndependent magnetization measurements for $ 2 \\leq T \\leq 800$ K reveal the\ndiamagnetic response characteristic of a non-magnetic insulator, as well as a\nsmall ferromagnetic component, possibly originating from frustrated exchange\ninteractions in Cu-rich clusters in the Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O\nstructure. No anomalies indicative of phase transitions are observed. We\ntherefore rule out the presence of superconductivity in Pb$_{9}$Cu(PO$_4$)$_6$O\ncrystals, and provide some considerations on the origin of anomalies previously\nreported in experiments on polycrystalline specimen.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:47:20 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:15:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Puphal","P.",""],["Akbar","M. Y. P.",""],["Hepting","M.",""],["Goering","E.",""],["Isobe","M.",""],["Nugroho","A. A.",""],["Keimer","B.",""]]}
{"id":"2308.06257","submitter":"Gwynn Elfring","authors":"Mouad Boudina, Gwynn J. Elfring","title":"Capillary imbibition in a diverging flexible channel","comments":"11 pages, 7 figures","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":"  We study the imbibition of a wetting liquid between flexible sheets that are\nfixed on both ends. Assuming a narrow gap between the sheets, we solve the\nlubrication equation coupled with slender body deformation. When the sheets are\nparallel, we find that the deformation initially speeds up the flow, as shown\nin previous studies, but only up to the middle of the channel. As the channel\ncontracts, the hydrodynamic resistance increases and ultimately slows down the\nfilling process. Below a threshold stiffness, the channel collapses and\nimbibition stops. We propose a scaling of the filling duration near this\nthreshold. Next we show that if the sheets are initially tilted with a minimal\nangle, the channel avoids collapse. The liquid front pulls the diverging sheets\nand spreads in a nearly parallel portion, which maintains the capillary\npropulsion and enhances the wicking. Therefore, while it is established that\ndiverging rigid plates imbibe liquids slower than parallel ones, we show that\nelasticity reverses this principle: diverging flexible sheets imbibe liquids\nfaster than parallel ones. We find an optimal tilt angle that gives the\nshortest filling time.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:47:24 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Boudina","Mouad",""],["Elfring","Gwynn J.",""]]}
{"id":"2308.06258","submitter":"David Williams","authors":"David M. Williams and Nilima Nigam","title":"Conforming Finite Element Function Spaces in Four Dimensions, Part II:\n  The Pentatope and Tetrahedral Prism","comments":"44 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present explicit expressions for conforming finite element\nfunction spaces, basis functions, and degrees of freedom on the pentatope and\ntetrahedral prism elements. More generally, our objective is to construct\nfinite element function spaces that maintain conformity with\ninfinite-dimensional spaces of a carefully chosen de Rham complex. This paper\nis a natural extension of the companion paper entitled \"Conforming Finite\nElement Function Spaces in Four Dimensions, Part I: Foundational Principles and\nthe Tesseract\" by Nigam and Williams, (2023). In contrast to Part I, in this\npaper we focus on two of the most popular elements which do not possess a full\ntensor-product structure in all four coordinate directions. We note that these\nelements appear frequently in existing space-time finite element methods. In\norder to build our finite element spaces, we utilize powerful techniques from\nthe recently developed 'Finite Element Exterior Calculus'. Subsequently, we\ntranslate our results into the well-known language of linear algebra (vectors\nand matrices) in order to facilitate implementation by scientists and\nengineers.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:47:29 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 01:06:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Williams","David M.",""],["Nigam","Nilima",""]]}
{"id":"2308.06259","submitter":"Xian Li","authors":"Xian Li, Ping Yu, Chunting Zhou, Timo Schick, Luke Zettlemoyer, Omer\n  Levy, Jason Weston, Mike Lewis","title":"Self-Alignment with Instruction Backtranslation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a scalable method to build a high quality instruction following\nlanguage model by automatically labelling human-written text with corresponding\ninstructions. Our approach, named instruction backtranslation, starts with a\nlanguage model finetuned on a small amount of seed data, and a given web\ncorpus. The seed model is used to construct training examples by generating\ninstruction prompts for web documents (self-augmentation), and then selecting\nhigh quality examples from among these candidates (self-curation). This data is\nthen used to finetune a stronger model. Finetuning LLaMa on two iterations of\nour approach yields a model that outperforms all other LLaMa-based models on\nthe Alpaca leaderboard not relying on distillation data, demonstrating highly\neffective self-alignment.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:47:54 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 16:44:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Xian",""],["Yu","Ping",""],["Zhou","Chunting",""],["Schick","Timo",""],["Zettlemoyer","Luke",""],["Levy","Omer",""],["Weston","Jason",""],["Lewis","Mike",""]]}
{"id":"2308.06260","submitter":"Oleksandr Romanko","authors":"Oleksandr Romanko, Akhilesh Narayan, Roy H. Kwon","title":"ChatGPT-based Investment Portfolio Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.AI cs.CE q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we explore potential uses of generative AI models, such as\nChatGPT, for investment portfolio selection. Trusting investment advice from\nGenerative Pre-Trained Transformer (GPT) models is a challenge due to model\n\"hallucinations\", necessitating careful verification and validation of the\noutput. Therefore, we take an alternative approach. We use ChatGPT to obtain a\nuniverse of stocks from S&P500 market index that are potentially attractive for\ninvesting. Subsequently, we compared various portfolio optimization strategies\nthat utilized this AI-generated trading universe, evaluating those against\nquantitative portfolio optimization models as well as comparing to some of the\npopular investment funds. Our findings indicate that ChatGPT is effective in\nstock selection but may not perform as well in assigning optimal weights to\nstocks within the portfolio. But when stocks selection by ChatGPT is combined\nwith established portfolio optimization models, we achieve even better results.\nBy blending strengths of AI-generated stock selection with advanced\nquantitative optimization techniques, we observed the potential for more robust\nand favorable investment outcomes, suggesting a hybrid approach for more\neffective and reliable investment decision-making in the future.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:48:17 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Romanko","Oleksandr",""],["Narayan","Akhilesh",""],["Kwon","Roy H.",""]]}
{"id":"2308.06261","submitter":"Kevin Hsieh","authors":"Sathiya Kumaran Mani, Yajie Zhou, Kevin Hsieh, Santiago Segarra,\n  Ranveer Chandra, and Srikanth Kandula","title":"Enhancing Network Management Using Code Generated by Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Analyzing network topologies and communication graphs plays a crucial role in\ncontemporary network management. However, the absence of a cohesive approach\nleads to a challenging learning curve, heightened errors, and inefficiencies.\nIn this paper, we introduce a novel approach to facilitate a\nnatural-language-based network management experience, utilizing large language\nmodels (LLMs) to generate task-specific code from natural language queries.\nThis method tackles the challenges of explainability, scalability, and privacy\nby allowing network operators to inspect the generated code, eliminating the\nneed to share network data with LLMs, and concentrating on application-specific\nrequests combined with general program synthesis techniques. We design and\nevaluate a prototype system using benchmark applications, showcasing high\naccuracy, cost-effectiveness, and the potential for further enhancements using\ncomplementary program synthesis techniques.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:49:15 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Mani","Sathiya Kumaran",""],["Zhou","Yajie",""],["Hsieh","Kevin",""],["Segarra","Santiago",""],["Chandra","Ranveer",""],["Kandula","Srikanth",""]]}
{"id":"2308.06262","submitter":"Fanqing Meng","authors":"Fanqing Meng, Wenqi Shao, Zhanglin Peng, Chonghe Jiang, Kaipeng Zhang,\n  Yu Qiao, Ping Luo","title":"Foundation Model is Efficient Multimodal Multitask Model Selector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates an under-explored but important problem: given a\ncollection of pre-trained neural networks, predicting their performance on each\nmulti-modal task without fine-tuning them, such as image recognition,\nreferring, captioning, visual question answering, and text question answering.\nA brute-force approach is to finetune all models on all target datasets,\nbringing high computational costs. Although recent-advanced approaches employed\nlightweight metrics to measure models' transferability,they often depend\nheavily on the prior knowledge of a single task, making them inapplicable in a\nmulti-modal multi-task scenario. To tackle this issue, we propose an efficient\nmulti-task model selector (EMMS), which employs large-scale foundation models\nto transform diverse label formats such as categories, texts, and bounding\nboxes of different downstream tasks into a unified noisy label embedding. EMMS\ncan estimate a model's transferability through a simple weighted linear\nregression, which can be efficiently solved by an alternating minimization\nalgorithm with a convergence guarantee. Extensive experiments on 5 downstream\ntasks with 24 datasets show that EMMS is fast, effective, and generic enough to\nassess the transferability of pre-trained models, making it the first model\nselection method in the multi-task scenario. For instance, compared with the\nstate-of-the-art method LogME enhanced by our label embeddings, EMMS achieves\n9.0\\%, 26.3\\%, 20.1\\%, 54.8\\%, 12.2\\% performance gain on image recognition,\nreferring, captioning, visual question answering, and text question answering,\nwhile bringing 5.13x, 6.29x, 3.59x, 6.19x, and 5.66x speedup in wall-clock\ntime, respectively. The code is available at\nhttps://github.com/OpenGVLab/Multitask-Model-Selector.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:54:44 GMT"}],"update_date":"2023-08-14","authors_parsed":[["Meng","Fanqing",""],["Shao","Wenqi",""],["Peng","Zhanglin",""],["Jiang","Chonghe",""],["Zhang","Kaipeng",""],["Qiao","Yu",""],["Luo","Ping",""]]}
{"id":"2308.06263","submitter":"Chima McGruder","authors":"Chima D. McGruder, Mercedes L\\'opez-Morales, James Kirk, Erin May,\n  Benjamin V. Rackham, Munazza K. Alam, Natalie H. Allen, John D. Monnier,\n  Kelly Meyer, Tyler Gardner, Kevin Ortiz Ceballos, Eva-Maria Ahrer, Peter J.\n  Wheatley, George W. King, Andr\\'es Jord\\'an, David J. Osip, and N\\'estor\n  Espinoza","title":"ACCESS, LRG-BEASTS, & MOPSS: Featureless Optical Transmission Spectra of\n  WASP-25b and WASP-124b","comments":"Accepted in AJ July 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present new optical transmission spectra for two hot Jupiters: WASP-25b (M\n= 0.56~M$_J$; R = 1.23 R$_J$; P =~3.76 days) and WASP-124b (M = 0.58~M$_J$; R =\n1.34 R$_J$; P = 3.37 days), with wavelength coverages of 4200 - 9100\\AA\\ and\n4570 - 9940\\AA, respectively. These spectra are from the ESO Faint Object\nSpectrograph and Camera (v.2) mounted on the New Technology Telescope (NTT) and\nInamori-Magellan Areal Camera & Spectrograph on Magellan Baade. No strong\nspectral features were found in either spectra, with the data probing 4 and 6\nscale heights, respectively. \\texttt{Exoretrievals} and \\texttt{PLATON}\nretrievals favor stellar activity for WASP-25b, while the data for WASP-124b\ndid not favor one model over another. For both planets the retrievals found a\nwide range in the depths where the atmosphere could be optically thick\n($\\sim0.4\\mu$ - 0.2 bars for WASP-25b and 1.6 $\\mu$ -- 32 bars for WASP-124b)\nand recovered a temperature that is consistent with the planets' equilibrium\ntemperatures, but with wide uncertainties (up to $\\pm$430$^\\circ$K). For\nWASP-25b, the models also favor stellar spots that are $\\sim$500-3000$^\\circ$K\ncooler than the surrounding photosphere. The fairly weak constraints on\nparameters are owing to the relatively low precision of the data, with an\naverage precision of 840 and 1240 ppm per bin for WASP-25b and WASP-124b,\nrespectively. However, some contribution might still be due to an inherent\nabsence of absorption or scattering in the planets' upper atmospheres, possibly\nbecause of aerosols. We attempt to fit the strength of the sodium signals to\nthe aerosol-metallicity trend proposed by McGruder et al. 2023, and find\nWASP-25b and WASP-124b are consistent with the prediction, though their\nuncertainties are too large to confidently confirm the trend.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:59:00 GMT"},{"version":"v2","created":"Mon, 14 Aug 2023 18:27:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["McGruder","Chima D.",""],["L\u00f3pez-Morales","Mercedes",""],["Kirk","James",""],["May","Erin",""],["Rackham","Benjamin V.",""],["Alam","Munazza K.",""],["Allen","Natalie H.",""],["Monnier","John D.",""],["Meyer","Kelly",""],["Gardner","Tyler",""],["Ceballos","Kevin Ortiz",""],["Ahrer","Eva-Maria",""],["Wheatley","Peter J.",""],["King","George W.",""],["Jord\u00e1n","Andr\u00e9s",""],["Osip","David J.",""],["Espinoza","N\u00e9stor",""]]}
{"id":"2308.06264","submitter":"Klaus Nordhausen","authors":"Jyrki M\\\"ott\\\"onen, Klaus Nordhausen, Hannu Oja and Una Radojicic","title":"The Asymptotic Properties of the One-Sample Spatial Rank Methods","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":"  For a set of $p$-variate data points $\\boldsymbol y_1,\\ldots,\\boldsymbol\ny_n$, there are several versions of multivariate median and related\nmultivariate sign test proposed and studied in the literature. In this paper we\nconsider the asymptotic properties of the multivariate extension of the\nHodges-Lehmann (HL) estimator, the spatial HL-estimator, and the related test\nstatistic. The asymptotic behavior of the spatial HL-estimator and the related\ntest statistic when $n$ tends to infinity are collected, reviewed, and proved,\nsome for the first time though being used already for a longer time. We also\nderive the limiting behavior of the HL-estimator when both the sample size $n$\nand the dimension $p$ tend to infinity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:59:21 GMT"}],"update_date":"2023-08-14","authors_parsed":[["M\u00f6tt\u00f6nen","Jyrki",""],["Nordhausen","Klaus",""],["Oja","Hannu",""],["Radojicic","Una",""]]}
{"id":"2308.06277","submitter":"Veeti Ahvonen","authors":"Veeti Ahvonen, Damian Heiman and Antti Kuusisto","title":"Descriptive complexity for neural networks via Boolean networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the descriptive complexity of a class of neural networks with\nunrestricted topologies and piecewise polynomial activation functions. We\nconsider the general scenario where the running time is unlimited and\nfloating-point numbers are used for simulating reals. We characterize a class\nof these neural networks with a rule-based logic for Boolean networks. In\nparticular, we show that the sizes of the neural networks and the corresponding\nBoolean rule formulae are polynomially related. In fact, in the direction from\nBoolean rules to neural networks, the blow-up is only linear. We also analyze\nthe delays in running times due to the translations. In the translation from\nneural networks to Boolean rules, the time delay is polylogarithmic in the\nneural network size and linear in time. In the converse translation, the time\ndelay is linear in both factors.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 15:43:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ahvonen","Veeti",""],["Heiman","Damian",""],["Kuusisto","Antti",""]]}
{"id":"2308.06278","submitter":"Biswarup Mukherjee","authors":"Manikandan Shenbagam, Anne Tryphosa Kamatham, Priyanka Vijay, Suman\n  Salimath, Shriniwas Patwardhan, Siddhartha Sikdar, Chitra Kataria and\n  Biswarup Mukherjee","title":"A Sonomyography-based Muscle Computer Interface for Individuals with\n  Spinal Cord Injury","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Impairment of hand functions in individuals with spinal cord injury (SCI)\nseverely disrupts activities of daily living. Recent advances have enabled\nrehabilitation assisted by robotic devices to augment the residual function of\nthe muscles. Traditionally, non-invasive electromyography-based peripheral\nneural interfaces have been utilized to sense volitional motor intent to drive\nrobotic assistive devices. However, the dexterity and fidelity of control that\ncan be achieved with electromyography-based control have been limited due to\ninherent limitations in signal quality. We have developed and tested a\nmuscle-computer interface (MCI) utilizing sonomyography to provide control of a\nvirtual cursor for individuals with motor-incomplete spinal cord injury. We\ndemonstrate that individuals with SCI successfully gained control of a virtual\ncursor by utilizing contractions of muscles of the wrist joint. The\nsonomyography-based interface enabled control of the cursor at multiple graded\nlevels demonstrating the ability to achieve accurate and stable endpoint\ncontrol. Our sonomyography-based muscle-computer interface can enable dexterous\ncontrol of upper-extremity assistive devices for individuals with\nmotor-incomplete SCI.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:32:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shenbagam","Manikandan",""],["Kamatham","Anne Tryphosa",""],["Vijay","Priyanka",""],["Salimath","Suman",""],["Patwardhan","Shriniwas",""],["Sikdar","Siddhartha",""],["Kataria","Chitra",""],["Mukherjee","Biswarup",""]]}
{"id":"2308.06279","submitter":"Federico Fioravanti","authors":"Federico Fioravanti, Fernando Delbianco, Fernando Tohm\\'e","title":"Visitors Out! The Absence of Away Team Supporters as a Source of Home\n  Advantage in Football","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":"  We seek to gain more insight into the effect of the crowds on the Home\nAdvantage by analyzing the particular case of Argentinean football (also known\nas soccer), where for more than ten years, the visiting team fans were not\nallowed to attend the games. Additionally, during the COVID-19 lockdown, a\nsignificant number of games were played without both away and home team fans.\nThe analysis of more than 20 years of matches of the Argentinean tournament\nindicates that the absence of the away team crowds was beneficial for the Top 5\nteams during the first two years after their attendance was forbidden. An\nadditional intriguing finding is that the lack of both crowds affects\nsignificantly all the teams, to the point of turning the home advantage into\nhome `disadvantage' for most of the teams.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 13:22:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fioravanti","Federico",""],["Delbianco","Fernando",""],["Tohm\u00e9","Fernando",""]]}
{"id":"2308.06280","submitter":"Syed Hasib Akhter Faruqui","authors":"Carolina Ramirez-Tamayo, Syed Hasib Akhter Faruqui, Stanford Martinez,\n  Angel Brisco, Nicholas Czarnek, Adel Alaeddini, Jeffrey R. Mock, Edward J.\n  Golob, Kal L. Clark","title":"Incorporation of Eye-Tracking and Gaze Feedback to Characterize and\n  Improve Radiologist Search Patterns of Chest X-rays: A Randomized Controlled\n  Clinical Trial","comments":"Submitted for Review in the Journal of the American College of\n  Radiology (JACR)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Diagnostic errors in radiology often occur due to incomplete visual\nassessments by radiologists, despite their knowledge of predicting disease\nclasses. This insufficiency is possibly linked to the absence of required\ntraining in search patterns. Additionally, radiologists lack consistent\nfeedback on their visual search patterns, relying on ad-hoc strategies and peer\ninput to minimize errors and enhance efficiency, leading to suboptimal patterns\nand potential false negatives. This study aimed to use eye-tracking technology\nto analyze radiologist search patterns, quantify performance using established\nmetrics, and assess the impact of an automated feedback-driven educational\nframework on detection accuracy. Ten residents participated in a controlled\ntrial focused on detecting suspicious pulmonary nodules. They were divided into\nan intervention group (received automated feedback) and a control group.\nResults showed that the intervention group exhibited a 38.89% absolute\nimprovement in detecting suspicious-for-cancer nodules, surpassing the control\ngroup's improvement (5.56%, p-value=0.006). Improvement was more rapid over the\nfour training sessions (p-value=0.0001). However, other metrics such as speed,\nsearch pattern heterogeneity, distractions, and coverage did not show\nsignificant changes. In conclusion, implementing an automated feedback-driven\neducational framework improved radiologist accuracy in detecting suspicious\nnodules. The study underscores the potential of such systems in enhancing\ndiagnostic performance and reducing errors. Further research and broader\nimplementation are needed to consolidate these promising results and develop\neffective training strategies for radiologists, ultimately benefiting patient\noutcomes.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 23:41:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ramirez-Tamayo","Carolina",""],["Faruqui","Syed Hasib Akhter",""],["Martinez","Stanford",""],["Brisco","Angel",""],["Czarnek","Nicholas",""],["Alaeddini","Adel",""],["Mock","Jeffrey R.",""],["Golob","Edward J.",""],["Clark","Kal L.",""]]}
{"id":"2308.06281","submitter":"Sriram Vamsi Ilapakurthy","authors":"Sriram Vamsi Ilapakurthy","title":"A framework for smart homes for elderly people using Labview","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper deals with home automation systems that are essential for safe and\nindependent living of elderly people. These individuals must be able to perform\ntheir Activities of Daily Living (ADLs) without help from caretakers. They must\nbe confident enough that help is just a few minutes with the systems in place.\nThe focus will be on the medical and emergency systems, which are most\nessential for independent living. Zigbee based Wireless Sensor Networks (WSN)\nare used to collect the data throughout the home. Smart shirts and smart phones\nmonitor different parameters of the individual and transmit the data to the\nhome network. A PC running LabVIEW is used as the central control unit for the\nentire house. The house must have a fail proof communication framework for\nconnecting with emergency services, doctors, helpers and relatives. The home\nnetwork is connected to the Public Switched Telephone Network (PSTN) and\ninternet. SMS, email, prerecorded voice-based telephone calls are appropriately\nused to report emergencies. A GUI (Graphical User Interface) was built in\nLabVIEW in order to control and simulate an entire home. Ambient Intelligence\nis built into the system to make it adaptive and dynamic as far as possible.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 23:38:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ilapakurthy","Sriram Vamsi",""]]}
{"id":"2308.06282","submitter":"Flynn Darby","authors":"Flynn B. Darby, Michael Y. Hua, Oskari V. Pakari, Shaun D. Clarke,\n  Sara A. Pozzi","title":"Multiplicity counting using organic scintillators to distinguish neutron\n  sources: An advanced teaching laboratory","comments":"29 pages, 17 figures, pre-proof accepted to AJP, AJP number\n  AJP22-AR-01524R2 (DOI: 10.1119/5.0139531)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this advanced instructional laboratory, students explore complex detection\nsystems and nondestructive assay techniques used in the field of nuclear\nphysics. After setting up and calibrating a neutron detection system, students\ncarry out timing and energy deposition analyses of radiation signals. Through\nthe timing of prompt fission neutron signals, multiplicity counting is used to\ncarry out a special nuclear material (SNM) nondestructive assay. Our\nexperimental setup is comprised of eight trans-stilbene organic scintillation\ndetectors in a well-counter configuration, and measurements are taken on a\nspontaneous fission source as well as two ({\\alpha},n) sources. By comparing\neach source's measured multiplicity distribution, the resulting measurements of\nthe ({\\alpha},n) sources can be distinguished from that of the spontaneous\nfission source. Such comparisons prevent the spoofing, i.e., intentional\nimitation, of a fission source by an ({\\alpha},n) neutron source. This\ninstructional laboratory is designed for nuclear engineering and physics\nstudents interested in organic scintillators, neutron sources, and\nnonproliferation radiation measurement techniques.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:26:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Darby","Flynn B.",""],["Hua","Michael Y.",""],["Pakari","Oskari V.",""],["Clarke","Shaun D.",""],["Pozzi","Sara A.",""]]}
{"id":"2308.06283","submitter":"Adeel Zafar","authors":"Adeel Zafar, Di Yang, Guoning Chen","title":"Extract and Characterize Hairpin Vortices in Turbulent Flows","comments":"Accepted for presentation at IEEE VIS 2023. The paper will appear in\n  IEEE Transactions on Visualization and Computer Graphics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Hairpin vortices are one of the most important vortical structures in\nturbulent flows. Extracting and characterizing hairpin vortices provides useful\ninsight into many behaviors in turbulent flows. However, hairpin vortices have\ncomplex configurations and might be entangled with other vortices, making their\nextraction difficult. In this work, we introduce a framework to extract and\nseparate hairpin vortices in shear driven turbulent flows for their study. Our\nmethod first extracts general vortical regions with a region-growing strategy\nbased on certain vortex criteria (e.g., $\\lambda_2$) and then separates those\nvortices with the help of progressive extraction of ($\\lambda_2$) iso-surfaces\nin a top-down fashion. This leads to a hierarchical tree representing the\nspatial proximity and merging relation of vortices. After separating individual\nvortices, their shape and orientation information is extracted. Candidate\nhairpin vortices are identified based on their shape and orientation\ninformation as well as their physical characteristics. An interactive\nvisualization system is developed to aid the exploration, classification, and\nanalysis of hairpin vortices based on their geometric and physical attributes.\nWe also present additional use cases of the proposed system for the analysis\nand study of general vortices in other types of flows.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 21:51:09 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 19:20:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zafar","Adeel",""],["Yang","Di",""],["Chen","Guoning",""]]}
{"id":"2308.06284","submitter":"Matthew Martell","authors":"Nicole A. Errett, Joseph Wartman, Scott B. Miles, Ben Silver, Matthew\n  Martell, Youngjun Choe","title":"Street View Data Collection Design for Disaster Reconnaissance","comments":"11 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the last decade, street-view type images have been used across\ndisciplines to generate and understand various place-based metrics. However\nefforts to collect this data were often meant to support investigator-driven\nresearch without regard to the utility of the data for other researchers. To\naddress this, we describe our methods for collecting and publishing\nlongitudinal data of this type in the wake of the COVID-19 pandemic and discuss\nsome of the challenges we encountered along the way. Our process included\ndesigning a route taking into account both broad area canvassing and community\ncapitals transects. We also implemented procedures for uploading and publishing\ndata from each survey. Our methods successfully generated the kind of\nlongitudinal data that can be beneficial to a variety of research disciplines.\nHowever, there were some challenges with data collection consistency and the\nsheer magnitude of data produced. Overall, our approach demonstrates the\nfeasibility of generating longitudinal street-view data in the wake of a\ndisaster event. Based on our experience, we provide recommendations for future\nresearchers attempting to create a similar data set.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 01:26:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Errett","Nicole A.",""],["Wartman","Joseph",""],["Miles","Scott B.",""],["Silver","Ben",""],["Martell","Matthew",""],["Choe","Youngjun",""]]}
{"id":"2308.06285","submitter":"Chaoqing Xu Dr.","authors":"Chaoqing Xu, Zhentao Zheng, Yiting Fu, Baofeng Chang, Legao Chen,\n  Minghui Wu, Mingli Song, and Jinsong Jiang","title":"An Integrated Visual Analytics System for Studying Clinical Carotid\n  Artery Plaques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Carotid artery plaques can cause arterial vascular diseases such as stroke\nand myocardial infarction, posing a severe threat to human life. However, the\ncurrent clinical examination mainly relies on a direct assessment by physicians\nof patients' clinical indicators and medical images, lacking an integrated\nvisualization tool for analyzing the influencing factors and composition of\ncarotid artery plaques. We have designed an intelligent carotid artery plaque\nvisual analysis system for vascular surgery experts to comprehensively analyze\nthe clinical physiological and imaging indicators of carotid artery diseases.\nThe system mainly includes two functions: First, it displays the correlation\nbetween carotid artery plaque and various factors through a series of\ninformation visualization methods and integrates the analysis of patient\nphysiological indicator data. Second, it enhances the interface guidance\nanalysis of the inherent correlation between the components of carotid artery\nplaque through machine learning and displays the spatial distribution of the\nplaque on medical images. Additionally, we conducted two case studies on\ncarotid artery plaques using real data obtained from a hospital, and the\nresults indicate that our designed carotid analysis system can effectively\nprovide clinical diagnosis and treatment guidance for vascular surgeons.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 02:31:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Chaoqing",""],["Zheng","Zhentao",""],["Fu","Yiting",""],["Chang","Baofeng",""],["Chen","Legao",""],["Wu","Minghui",""],["Song","Mingli",""],["Jiang","Jinsong",""]]}
{"id":"2308.06286","submitter":"Meng Gao","authors":"Meng Gao","title":"A density version of Waring-Goldbach problem","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 a density version of the Waring-Goldbach problem.\nSuppose that A is a subset of the primes, and the lower density of A in the\nprimes is larger than 1/2. Let k be a positive integer other than 1, 2, 4, 8,\nand 9. We prove that every sufficiently large natural number n satisfying the\nnecessary congruence condition can be expressed as a sum of s terms of the k-th\npowers of primes from set A, where s is a positive integer dependent on k.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 14:07:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gao","Meng",""]]}
{"id":"2308.06287","submitter":"Chen-Hsun Ma","authors":"Chen-Hsun Ma, Kwan-Lok Li, You-Hua Chu and Albert K. H. Kong","title":"Chandra Observation of NGC 1559: Eight Ultraluminous X-ray Sources\n  Including a Compact Binary Candidate","comments":"Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the 30-year history of ultra-luminous X-ray sources (ULXs) studies,\nissues like the majority of their physical natures (i.e., neutron stars,\nstellar-mass black holes, or intermediate black holes) as well as the accretion\nmechanisms are still under debate. Expanding the ULX sample size in the\nliterature is clearly a way to help. To this end, we investigated the X-ray\nsource population, ULXs in particular, in the barred spiral galaxy NGC 1559\nusing a Chandra observation made in 2016. In this 45-ks exposure, 33 X-ray\npoint sources were detected within the 2.'7 isophotal radius of the galaxy.\nAmong them, 8 ULXs were identified with the criterion of the X-ray luminosity\n$L_x>10^{39}$ erg s$^{-1}$ (0.3-7~keV). Both X-ray light curves and spectra of\nall the sources were examined. Except for some low-count spectra that only\nprovide ambiguous spectral fitting results, all the X-ray sources were\nbasically spectrally hard and therefore likely have non-thermal origins. While\nno strong X-ray variability was present in most of the sources owing to the\nrelatively short exposure of the observation, we found an intriguing ULX, named\nX-24, exhibiting a periodicity of $\\sim$7500s with a detection significance of\n2.7$\\sigma$. We speculate that it is the orbital period of the system.\nRoche-lobe over flow and Roche limit are consistent with the speculation. Thus,\nwe suggest that X-24 may be the one of the rare compact binary ULXs, and hence,\na good candidate as a stellar-mass black hole.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:09:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Chen-Hsun",""],["Li","Kwan-Lok",""],["Chu","You-Hua",""],["Kong","Albert K. H.",""]]}
{"id":"2308.06288","submitter":"Ruining Deng","authors":"Jiayuan Chen, Yu Wang, Ruining Deng, Quan Liu, Can Cui, Tianyuan Yao,\n  Yilin Liu, Jianyong Zhong, Agnes B. Fogo, Haichun Yang, Shilin Zhao, Yuankai\n  Huo","title":"Spatial Pathomics Toolkit for Quantitative Analysis of Podocyte Nuclei\n  with Histology and Spatial Transcriptomics Data in Renal Pathology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Podocytes, specialized epithelial cells that envelop the glomerular\ncapillaries, play a pivotal role in maintaining renal health. The current\ndescription and quantification of features on pathology slides are limited,\nprompting the need for innovative solutions to comprehensively assess diverse\nphenotypic attributes within Whole Slide Images (WSIs). In particular,\nunderstanding the morphological characteristics of podocytes, terminally\ndifferentiated glomerular epithelial cells, is crucial for studying glomerular\ninjury. This paper introduces the Spatial Pathomics Toolkit (SPT) and applies\nit to podocyte pathomics. The SPT consists of three main components: (1)\ninstance object segmentation, enabling precise identification of podocyte\nnuclei; (2) pathomics feature generation, extracting a comprehensive array of\nquantitative features from the identified nuclei; and (3) robust statistical\nanalyses, facilitating a comprehensive exploration of spatial relationships\nbetween morphological and spatial transcriptomics features.The SPT successfully\nextracted and analyzed morphological and textural features from podocyte\nnuclei, revealing a multitude of podocyte morphomic features through\nstatistical analysis. Additionally, we demonstrated the SPT's ability to\nunravel spatial information inherent to podocyte distribution, shedding light\non spatial patterns associated with glomerular injury. By disseminating the\nSPT, our goal is to provide the research community with a powerful and\nuser-friendly resource that advances cellular spatial pathomics in renal\npathology. The implementation and its complete source code of the toolkit are\nmade openly accessible at https://github.com/hrlblab/spatial_pathomics.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 17:16:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Jiayuan",""],["Wang","Yu",""],["Deng","Ruining",""],["Liu","Quan",""],["Cui","Can",""],["Yao","Tianyuan",""],["Liu","Yilin",""],["Zhong","Jianyong",""],["Fogo","Agnes B.",""],["Yang","Haichun",""],["Zhao","Shilin",""],["Huo","Yuankai",""]]}
{"id":"2308.06289","submitter":"Qiyang Zheng","authors":"Qi-Yang Zheng","title":"Fibonacci-like property of partition function","comments":"First draft","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 Fibonacci-like property of the partition\nfunction. The partition function $p(n)$ has a property: $p(n) \\leq p(n-1) +\np(n-2)$. Our result shows that if we impose certain restrictions on the\npartition, then the inequality becomes an equality. Furthermore, we extend this\nresult to cases with a greater number of summands.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 18:33:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Qi-Yang",""]]}
{"id":"2308.06290","submitter":"Hariharan Subramonyam","authors":"Hariharan Subramonyam, Jessica Hullman","title":"Are We Closing the Loop Yet? Gaps in the Generalizability of VIS4ML\n  Research","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":"  Visualization for machine learning (VIS4ML) research aims to help experts\napply their prior knowledge to develop, understand, and improve the performance\nof machine learning models. In conceiving VIS4ML systems, researchers\ncharacterize the nature of human knowledge to support human-in-the-loop tasks,\ndesign interactive visualizations to make ML components interpretable and\nelicit knowledge, and evaluate the effectiveness of human-model interchange. We\nsurvey recent VIS4ML papers to assess the generalizability of research\ncontributions and claims in enabling human-in-the-loop ML. Our results show\npotential gaps between the current scope of VIS4ML research and aspirations for\nits use in practice. We find that while papers motivate that VIS4ML systems are\napplicable beyond the specific conditions studied, conclusions are often\noverfitted to non-representative scenarios, are based on interactions with a\nsmall set of ML experts and well-understood datasets, fail to acknowledge\ncrucial dependencies, and hinge on decisions that lack justification. We\ndiscuss approaches to close the gap between aspirations and research claims and\nsuggest documentation practices to report generality constraints that better\nacknowledge the exploratory nature of VIS4ML research.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:44:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Subramonyam","Hariharan",""],["Hullman","Jessica",""]]}
{"id":"2308.06291","submitter":"David Naccache","authors":"David Naccache and Ofer Yifrach-Stav","title":"The Balkans Continued Fraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In a previous escapade we gave a collection of continued fractions involving\nCatalan's constant. This paper provides more general formulae governing those\ncontinued fractions. Having distinguished different cases associated to regions\nin the plan, we nickname those continued fractions \\enquote{The Balkans} as\nthey divide into areas which are related but still different in nature.\n  Because we do not provide formal proofs of those machine-constructed formulae\nwe do not claim them to be theorems. Still, each and every proposed formula was\nextensively tested numerically.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 00:56:40 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 18:20:14 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 19:30:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Naccache","David",""],["Yifrach-Stav","Ofer",""]]}
{"id":"2308.06292","submitter":"Sandun Rajapaksa","authors":"Sandun Rajapaksa, Lloyd Allison, Peter J. Stuckey, Maria Garcia de la\n  Banda, and Arun S. Konagurthu","title":"The divergence time of protein structures modelled by Markov matrices\n  and its relation to the divergence of sequences","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A complete time-parameterized statistical model quantifying the divergent\nevolution of protein structures in terms of the patterns of conservation of\ntheir secondary structures is inferred from a large collection of protein 3D\nstructure alignments. This provides a better alternative to time-parameterized\nsequence-based models of protein relatedness, that have clear limitations\ndealing with twilight and midnight zones of sequence relationships. Since\nprotein structures are far more conserved due to the selection pressure\ndirectly placed on their function, divergence time estimates can be more\naccurate when inferred from structures. We use the Bayesian and\ninformation-theoretic framework of Minimum Message Length to infer a\ntime-parameterized stochastic matrix (accounting for perturbed structural\nstates of related residues) and associated Dirichlet models (accounting for\ninsertions and deletions during the evolution of protein domains). These are\nused in concert to estimate the Markov time of divergence of tertiary\nstructures, a task previously only possible using proxies (like RMSD). By\nanalyzing one million pairs of homologous structures, we yield a relationship\nbetween the Markov divergence time of structures and of sequences. Using these\ninferred models and the relationship between the divergence of sequences and\nstructures, we demonstrate a competitive performance in secondary structure\nprediction against neural network architectures commonly employed for this\ntask. The source code and supplementary information are downloadable from\n\\url{http://lcb.infotech.monash.edu.au/sstsum}.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:32:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rajapaksa","Sandun",""],["Allison","Lloyd",""],["Stuckey","Peter J.",""],["de la Banda","Maria Garcia",""],["Konagurthu","Arun S.",""]]}
{"id":"2308.06293","submitter":"Daniel Ries","authors":"Daniel Ries, Jason Adams, Joshua Zollweg","title":"Target Detection on Hyperspectral Images Using MCMC and VI Trained\n  Bayesian Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural networks (NN) have become almost ubiquitous with image classification,\nbut in their standard form produce point estimates, with no measure of\nconfidence. Bayesian neural networks (BNN) provide uncertainty quantification\n(UQ) for NN predictions and estimates through the posterior distribution. As NN\nare applied in more high-consequence applications, UQ is becoming a\nrequirement. BNN provide a solution to this problem by not only giving accurate\npredictions and estimates, but also an interval that includes reasonable values\nwithin a desired probability. Despite their positive attributes, BNN are\nnotoriously difficult and time consuming to train. Traditional Bayesian methods\nuse Markov Chain Monte Carlo (MCMC), but this is often brushed aside as being\ntoo slow. The most common method is variational inference (VI) due to its fast\ncomputation, but there are multiple concerns with its efficacy. We apply and\ncompare MCMC- and VI-trained BNN in the context of target detection in\nhyperspectral imagery (HSI), where materials of interest can be identified by\ntheir unique spectral signature. This is a challenging field, due to the\nnumerous permuting effects practical collection of HSI has on measured spectra.\nBoth models are trained using out-of-the-box tools on a high fidelity HSI\ntarget detection scene. Both MCMC- and VI-trained BNN perform well overall at\ntarget detection on a simulated HSI scene. This paper provides an example of\nhow to utilize the benefits of UQ, but also to increase awareness that\ndifferent training methods can give different results for the same model. If\nsufficient computational resources are available, the best approach rather than\nthe fastest or most efficient should be used, especially for high consequence\nproblems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:35:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ries","Daniel",""],["Adams","Jason",""],["Zollweg","Joshua",""]]}
{"id":"2308.06294","submitter":"Jingye Yang","authors":"Jingye Yang, Cong Liu, Wendy Deng, Da Wu, Chunhua Weng, Yunyun Zhou,\n  Kai Wang","title":"Enhancing Phenotype Recognition in Clinical Notes Using Large Language\n  Models: PhenoBCBERT and PhenoGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We hypothesize that large language models (LLMs) based on the transformer\narchitecture can enable automated detection of clinical phenotype terms,\nincluding terms not documented in the HPO. In this study, we developed two\ntypes of models: PhenoBCBERT, a BERT-based model, utilizing Bio+Clinical BERT\nas its pre-trained model, and PhenoGPT, a GPT-based model that can be\ninitialized from diverse GPT models, including open-source versions such as\nGPT-J, Falcon, and LLaMA, as well as closed-source versions such as GPT-3 and\nGPT-3.5. We compared our methods with PhenoTagger, a recently developed HPO\nrecognition tool that combines rule-based and deep learning methods. We found\nthat our methods can extract more phenotype concepts, including novel ones not\ncharacterized by HPO. We also performed case studies on biomedical literature\nto illustrate how new phenotype information can be recognized and extracted. We\ncompared current BERT-based versus GPT-based models for phenotype tagging, in\nmultiple aspects including model architecture, memory usage, speed, accuracy,\nand privacy protection. We also discussed the addition of a negation step and\nan HPO normalization layer to the transformer models for improved HPO term\ntagging. In conclusion, PhenoBCBERT and PhenoGPT enable the automated discovery\nof phenotype terms from clinical notes and biomedical literature, facilitating\nautomated downstream tasks to derive new biological insights on human diseases.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 03:40:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Jingye",""],["Liu","Cong",""],["Deng","Wendy",""],["Wu","Da",""],["Weng","Chunhua",""],["Zhou","Yunyun",""],["Wang","Kai",""]]}
{"id":"2308.06295","submitter":"Elena Braverman Prof","authors":"Elena Braverman and John Ioannis Stavroulakis","title":"Towards a resolution of the Buchanan-Lillo conjecture","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Buchanan and Lillo both conjectured that oscillatory solutions of the\nfirst-order delay differential equation with positive feedback $x^{\\prime\n}(t)=p(t)x(\\tau (t))$, $t\\geq 0$, where $0\\leq p(t)\\leq 1$, $0\\leq t-\\tau\n(t)\\leq 2.75+\\ln2,t\\in \\mathbb{R},$ are asymptotic to a shifted multiple of a\nunique periodic solution. This special solution was known to be uniform for all\nnonautonomous equations, and intriguingly, can also be described from the more\ngeneral perspective of the mixed feedback case (sign-changing $p$). The analog\nof this conjecture for negative feedback, $p(t)\\leq0$, was resolved by Lillo,\nand the mixed feedback analog was recently set as an open problem. In this\npaper, we investigate the convergence properties of the special periodic\nsolutions in the mixed feedback case, characterizing the threshold between\nbounded and unbounded oscillatory solutions, with standing assumptions that $p$\nand $\\tau$ are measurable, $\\tau (t)\\leq t$ and $\\lim_{t\\rightarrow \\infty\n}\\tau (t)=\\infty$. We prove that nontrivial oscillatory solutions on this\nthreshold are asymptotic (differing by $o(1)$) to the special periodic\nsolutions for mixed feedback, which include the periodic solution of the\npositive feedback case. The conclusions drawn from these results elucidate and\nrefine the conjecture of Buchanan and Lillo that oscillatory solutions in the\npositive feedback case $p(t)\\geq0$, would differ from a multiple, translation,\nof the special periodic solution, by $o(1)$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 04:19:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Braverman","Elena",""],["Stavroulakis","John Ioannis",""]]}
{"id":"2308.06296","submitter":"Rabia Asghar","authors":"Rabia Asghar, Sanjay Kumar, Paul Hynds, Arslan Shaukat","title":"Classification of White Blood Cells Using Machine and Deep Learning\n  Models: A Systematic Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Machine learning (ML) and deep learning (DL) models have been employed to\nsignificantly improve analyses of medical imagery, with these approaches used\nto enhance the accuracy of prediction and classification. Model predictions and\nclassifications assist diagnoses of various cancers and tumors. This review\npresents an in-depth analysis of modern techniques applied within the domain of\nmedical image analysis for white blood cell classification. The methodologies\nthat use blood smear images, magnetic resonance imaging (MRI), X-rays, and\nsimilar medical imaging domains are identified and discussed, with a detailed\nanalysis of ML/DL techniques applied to the classification of white blood cells\n(WBCs) representing the primary focus of the review. The data utilized in this\nresearch has been extracted from a collection of 136 primary papers that were\npublished between the years 2006 and 2023. The most widely used techniques and\nbest-performing white blood cell classification methods are identified. While\nthe use of ML and DL for white blood cell classification has concurrently\nincreased and improved in recent year, significant challenges remain - 1)\nAvailability of appropriate datasets remain the primary challenge, and may be\nresolved using data augmentation techniques. 2) Medical training of researchers\nis recommended to improve current understanding of white blood cell structure\nand subsequent selection of appropriate classification models. 3) Advanced DL\nnetworks including Generative Adversarial Networks, R-CNN, Fast R-CNN, and\nfaster R-CNN will likely be increasingly employed to supplement or replace\ncurrent techniques.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 06:32:25 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 09:35:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Asghar","Rabia",""],["Kumar","Sanjay",""],["Hynds","Paul",""],["Shaukat","Arslan",""]]}
{"id":"2308.06297","submitter":"Mohsen Soltanifar","authors":"Mohsen Soltanifar","title":"A Classification of Elements of Function Space\n  $F(\\mathbb{R},\\mathbb{R})$","comments":null,"journal-ref":"Mathematics MDPI-AG 2023","doi":"10.3390/math11173715","report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we classify the function space of all real-valued functions on\nR denoted as F(R, R) into 28 distinct blocks. Each block contains elements that\nshare common features in terms of the cardinality of their sets of continuity\nand differentiability. Alongside this classification, we introduce the concept\nof the Connection, which reveals a special relationship structure between four\nwellknown real-valued functions in real analysis: the Cantor function,\nDirichlet function, the Thomae function, and the Weierstrass function. Despite\nthe significance of this field, several perspectives remain unexplored\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:02:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Soltanifar","Mohsen",""]]}
{"id":"2308.06298","submitter":"Yanyun Li","authors":"Yanyun Li, Xin Guo and Xianping Guo","title":"Maximal reliability of controlled Markov systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concentrates on the reliability of a discrete-time controlled\nMarkov system with finite states and actions, and aims to give an efficient\nalgorithm for obtaining an optimal (control) policy that makes the system have\nthe maximal reliability for every initial state. After establishing the\nexistence of an optimal policy, for the computation of optimal policies, we\nintroduce the concept of an absorbing set of a stationary policy, and find some\ncharacterization and a computational method of the absorbing sets. Using the\nlargest absorbing set, we build a novel optimality equation (OE), and prove the\nuniqueness of a solution of the OE. Furthermore, we provide a policy iteration\nalgorithm of optimal policies, and prove that an optimal policy and the maximal\nreliability can be obtained in a finite number of iterations. Finally, an\nexample in reliability and maintenance problems is given to illustrate our\nresults.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:12:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Yanyun",""],["Guo","Xin",""],["Guo","Xianping",""]]}
{"id":"2308.06299","submitter":"Mark Schutera","authors":"Hendrik Vogt, Stefan Buehler, Mark Schutera","title":"Defensive Perception: Estimation and Monitoring of Neural Network\n  Performance under Deployment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a method for addressing the issue of unnoticed\ncatastrophic deployment and domain shift in neural networks for semantic\nsegmentation in autonomous driving. Our approach is based on the idea that deep\nlearning-based perception for autonomous driving is uncertain and best\nrepresented as a probability distribution. As autonomous vehicles' safety is\nparamount, it is crucial for perception systems to recognize when the vehicle\nis leaving its operational design domain, anticipate hazardous uncertainty, and\nreduce the performance of the perception system. To address this, we propose to\nencapsulate the neural network under deployment within an uncertainty\nestimation envelope that is based on the epistemic uncertainty estimation\nthrough the Monte Carlo Dropout approach. This approach does not require\nmodification of the deployed neural network and guarantees expected model\nperformance. Our defensive perception envelope has the capability to estimate a\nneural network's performance, enabling monitoring and notification of entering\ndomains of reduced neural network performance under deployment. Furthermore,\nour envelope is extended by novel methods to improve the application in\ndeployment settings, including reducing compute expenses and confining\nestimation noise. Finally, we demonstrate the applicability of our method for\nmultiple different potential deployment shifts relevant to autonomous driving,\nsuch as transitions into the night, rainy, or snowy domain. Overall, our\napproach shows great potential for application in deployment settings and\nenables operational design domain recognition via uncertainty, which allows for\ndefensive perception, safe state triggers, warning notifications, and feedback\nfor testing or development and adaptation of the perception stack.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:45:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vogt","Hendrik",""],["Buehler","Stefan",""],["Schutera","Mark",""]]}
{"id":"2308.06300","submitter":"Rabia Asghar","authors":"Rabia Asghar, Sanjay Kumar, Paul Hynds, Abeera Mahfooz","title":"Automatic Classification of Blood Cell Images Using Convolutional Neural\n  Network","comments":"15","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Human blood primarily comprises plasma, red blood cells, white blood cells,\nand platelets. It plays a vital role in transporting nutrients to different\norgans, where it stores essential health-related data about the human body.\nBlood cells are utilized to defend the body against diverse infections,\nincluding fungi, viruses, and bacteria. Hence, blood analysis can help\nphysicians assess an individual's physiological condition. Blood cells have\nbeen sub-classified into eight groups: Neutrophils, eosinophils, basophils,\nlymphocytes, monocytes, immature granulocytes (promyelocytes, myelocytes, and\nmetamyelocytes), erythroblasts, and platelets or thrombocytes on the basis of\ntheir nucleus, shape, and cytoplasm. Traditionally, pathologists and\nhematologists in laboratories have examined these blood cells using a\nmicroscope before manually classifying them. The manual approach is slower and\nmore prone to human error. Therefore, it is essential to automate this process.\nIn our paper, transfer learning with CNN pre-trained models. VGG16, VGG19,\nResNet-50, ResNet-101, ResNet-152, InceptionV3, MobileNetV2, and DenseNet-20\napplied to the PBC dataset's normal DIB. The overall accuracy achieved with\nthese models lies between 91.375 and 94.72%. Hence, inspired by these\npre-trained architectures, a model has been proposed to automatically classify\nthe ten types of blood cells with increased accuracy. A novel CNN-based\nframework has been presented to improve accuracy. The proposed CNN model has\nbeen tested on the PBC dataset normal DIB. The outcomes of the experiments\ndemonstrate that our CNN-based framework designed for blood cell classification\nattains an accuracy of 99.91% on the PBC dataset. Our proposed convolutional\nneural network model performs competitively when compared to earlier results\nreported in the literature.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:57:12 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 10:08:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Asghar","Rabia",""],["Kumar","Sanjay",""],["Hynds","Paul",""],["Mahfooz","Abeera",""]]}
{"id":"2308.06301","submitter":"Ashish Kumar Upadhyay","authors":"Ashish Upadhyay","title":"Generalized Gr\\\"otzsch Graphs","comments":"This is a first draft report about ongoing work on the Gr\\\"otzsch\n  Graphs","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this paper is to present a generalization of Gr\\\"otzsch graph.\nInspired by structure of the Gr\\\"otzsch's graph, we present constructions of\ntwo families of graphs, $G_m$ and $H_m$ for odd and even values of $m$\nrespectively and on $n = 2m +1$ vertices. We show that each member of this\nfamily is non-planar, triangle-free, and Hamiltonian. Further, when $m$ is odd\nthe graph $G_m$ is maximal triangle-free, and when $m$ is even, the addition of\nexactly $\\frac{m}{2}$ edges makes the graph $H_m$ maximal triangle-free. We\nshow that $G_m$ is 4-chromatic and $H_m$ is 3-chromatic for all $m$. Further,\nwe note some other properties of these graphs and compare with Mycielski's\nconstruction.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:51:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Upadhyay","Ashish",""]]}
{"id":"2308.06302","submitter":"Nikolai Poklonski","authors":"Alexander S. Minkin, Irina V. Lebedeva, Andrey M. Popov, Sergey A.\n  Vyrko, Nikolai A. Poklonski and Yurii E. Lozovik","title":"Interlayer interaction, shear vibrational mode, and tribological\n  properties of two-dimensional bilayers with a commensurate moir\\'e pattern","comments":"9 pages, 3 figures; Supplemental Material: 2 pages, 1 figure","journal-ref":"Phys. Rev. B 108 (2023) 085411(1-9)","doi":"10.1103/PhysRevB.108.085411","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The potential energy surface (PES) of interlayer interaction of infinite\ntwisted bilayer graphene is calculated for a set of commensurate moir\\'e\npatterns using the registry-dependent Kolmogorov-Crespi empirical potential.\nThe calculated PESs have the same shape for all considered moir\\'e patterns\nwith the unit cell size of the PES which is inversely related to the unit cell\nsize of the moir\\'e pattern. The amplitude of PES corrugations is found to\ndecrease exponentially upon increasing the size of the moir\\'e pattern unit\ncell. An analytical expression for such a PES including the first Fourier\nharmonics compatible with the symmetries of both layers is derived. It is shown\nthat the calculated PESs can be approximated by the derived expression with the\naccuracy within 1%. This means that different physical properties associated\nwith relative in-plane motion of graphene layers are interrelated and can be\nexpressed analytically as functions of the amplitude of PES corrugations. In\nthis way, we obtain the shear mode frequency, shear modulus, shear strength and\nbarrier for relative rotation of the commensurate twisted layers to a fully\nincommensurate state for the considered moir\\'e patterns. This barrier may\npossibly lead to the macroscopic robust superlubricity for twisted graphene\nbilayer with a commensurate moir\\'e pattern. The conclusions made should be\nvalid for diverse 2D systems of twisted commensurate layers.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:53:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Minkin","Alexander S.",""],["Lebedeva","Irina V.",""],["Popov","Andrey M.",""],["Vyrko","Sergey A.",""],["Poklonski","Nikolai A.",""],["Lozovik","Yurii E.",""]]}
{"id":"2308.06303","submitter":"Mikrajuddin Abdullah","authors":"Mikrajuddin Abdullah","title":"A New Approach to Overcoming Zero Trade in Gravity Models to Avoid\n  Indefinite Values in Linear Logarithmic Equations and Parameter Verification\n  Using Machine Learning","comments":"20 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.LG q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The presence of a high number of zero flow trades continues to provide a\nchallenge in identifying gravity parameters to explain international trade\nusing the gravity model. Linear regression with a logarithmic linear equation\nencounters an indefinite value on the logarithmic trade. Although several\napproaches to solving this problem have been proposed, the majority of them are\nno longer based on linear regression, making the process of finding solutions\nmore complex. In this work, we suggest a two-step technique for determining the\ngravity parameters: first, perform linear regression locally to establish a\ndummy value to substitute trade flow zero, and then estimating the gravity\nparameters. Iterative techniques are used to determine the optimum parameters.\nMachine learning is used to test the estimated parameters by analyzing their\nposition in the cluster. We calculated international trade figures for 2004,\n2009, 2014, and 2019. We just examine the classic gravity equation and discover\nthat the powers of GDP and distance are in the same cluster and are both worth\nroughly one. The strategy presented here can be used to solve other problems\ninvolving log-linear regression.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:08:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Abdullah","Mikrajuddin",""]]}
{"id":"2308.06304","submitter":"Hector Pijeira Cabrera","authors":"Abel D\\'iaz-Gonz\\'alez, H\\'ector Pijeira-Cabrera and Javier\n  Quintero-Roba","title":"Electrostatic models for zeros of Laguerre-Sobolev polynomials","comments":"arXiv admin note: substantial text overlap with arXiv:2308.06171","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let {$\\{S_n\\}_{n\\geqslant 0}$} be the sequence of orthogonal polynomials with\nrespect to the Laguerre-Sobolev inner product $$ \\langle f,g\\rangle_S\n=\\!\\int_{0}^{+\\infty}\\! f(x)\ng(x)x^{\\alpha}e^{-x}dx+\\sum_{j=1}^{N}\\sum_{k=0}^{d_j}\\lambda_{j,k}\nf^{(k)}(c_j)g^{(k)}(c_j), $$ where $\\lambda_{j,k}\\geqslant 0$, $\\alpha >-1$ and\n$c_i \\in (-\\infty, 0)$ for $i=1,2,\\dots,N$. We provide a formula that relates\nthe Laguerre-Sobolev polynomials $S_n$ to the standard Laguerre orthogonal\npolynomials. We find the ladder operators for the polynomial sequence\n$\\{S_n\\}_{n\\geqslant 0}$ and a second-order differential equation with\npolynomial coefficients for $\\{S_n\\}_{n\\geqslant 0}$. We establish a sufficient\ncondition for an electrostatic model of the zeros of orthogonal\nLaguerre-Sobolev polynomials. Some examples are given where this condition is\neither satisfied or not.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:02:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["D\u00edaz-Gonz\u00e1lez","Abel",""],["Pijeira-Cabrera","H\u00e9ctor",""],["Quintero-Roba","Javier",""]]}
{"id":"2308.06305","submitter":"Andrews Cordolino Sobral","authors":"Caroline Pacheco do Espirito Silva, Andrews Cordolino Sobral, Antoine\n  Vacavant, Thierry Bouwmans, Felippe De Souza","title":"Discovering Local Binary Pattern Equation for Foreground Object Removal\n  in Videos","comments":"arXiv admin note: substantial text overlap with arXiv:2104.08633","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Designing a novel Local Binary Pattern (LBP) process usually relies heavily\non human experts' knowledge and experience in the area. Even experts are often\nleft with tedious episodes of trial and error until they identify an optimal\nLBP for a particular dataset. To address this problem, we present a novel\nsymbolic regression able to automatically discover LBP formulas to remove the\nmoving parts of a scene by segmenting it into a background and a foreground.\nExperimental results conducted on real videos of outdoor urban scenes under\nvarious conditions show that the LBPs discovered by the proposed approach\nsignificantly outperform the previous state-of-the-art LBP descriptors both\nqualitatively and quantitatively. Our source code and data will be available\nonline.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:04:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Silva","Caroline Pacheco do Espirito",""],["Sobral","Andrews Cordolino",""],["Vacavant","Antoine",""],["Bouwmans","Thierry",""],["De Souza","Felippe",""]]}
{"id":"2308.06306","submitter":"Markus V\\\"olk","authors":"Markus V\\\"olk, Kilian Kleeberger, Werner Kraus, Richard Bormann","title":"Towards Packaging Unit Detection for Automated Palletizing Tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For various automated palletizing tasks, the detection of packaging units is\na crucial step preceding the actual handling of the packaging units by an\nindustrial robot. We propose an approach to this challenging problem that is\nfully trained on synthetically generated data and can be robustly applied to\narbitrary real world packaging units without further training or setup effort.\nThe proposed approach is able to handle sparse and low quality sensor data, can\nexploit prior knowledge if available and generalizes well to a wide range of\nproducts and application scenarios. To demonstrate the practical use of our\napproach, we conduct an extensive evaluation on real-world data with a wide\nrange of different retail products. Further, we integrated our approach in a\nlab demonstrator and a commercial solution will be marketed through an\nindustrial partner.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 15:37:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["V\u00f6lk","Markus",""],["Kleeberger","Kilian",""],["Kraus","Werner",""],["Bormann","Richard",""]]}
{"id":"2308.06307","submitter":"Karen Yeats","authors":"Simone Hu and Karen Yeats","title":"Reconstructing a bijection on the level of Le diagrams","comments":"25 pages. arXiv admin note: substantial text overlap with\n  arXiv:2206.04749","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.CO math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lukowiski, Parisi, and Williams formulated the T-duality map of string theory\nat a purely combinatorial level as a map on decorated permutations. We\ncombinatorially describe this map at the level of Le diagrams. This perspective\nmakes the dimension shift under the map more transparent.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:18:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Simone",""],["Yeats","Karen",""]]}
{"id":"2308.06308","submitter":"Victor Nistor","authors":"Mirela Kohr, Victor Nistor, Wolfgang L. Wendland","title":"Essentially translation invariant pseudodifferential operators on\n  manifolds with cylindrical ends","comments":"45 pages, we have added more background material on\n  pseudodifferential operators based on our lectures for the \"Summer school in\n  Geometric Analysis,'' August-September 2023, organized by Haydys Andriy and\n  Joel Fine at Universit\\'e Libre de Bruxelles","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study two classes (or calculi) of pseudodifferential operators defined on\nmanifolds with cylindrical ends: the class of pseudodifferential operators that\nare ``translation invariant at infinity'' and the class of ``essentially\ntranslation invariant operators'' that have appeared in the study of layer\npotential operators on manifolds with straight cylindrical ends. Both classes\nare close to the $b$-calculus considered by Melrose and Schulze and to the\n$c$-calculus considered by Melrose and Mazzeo-Melrose. Our calculi, however,\nare different and, while some of their properties follow from those of the $b$-\nor $c$-calculi, many of their properties do not. In particular, we prove that\nthe ``essentially translation invariant calculus'' is spectrally invariant, a\nproperty not enjoyed by the ``translation invariant at infinity'' calculus or\nthe $b$-calculus. For our calculi, we provide easy, intuitive proofs of the\nusual properties: stability for products and adjoints, mapping and boundedness\nproperties for operators acting between Sobolev spaces, regularity properties,\nexistence of a quantization map, topological properties of our algebras, and\nthe Fredholm property. Since our applications will be to the Stokes operator,\nwe systematically work in the setting of Agmon-Douglis-Nirenberg-elliptic\noperators.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 16:20:44 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 09:16:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kohr","Mirela",""],["Nistor","Victor",""],["Wendland","Wolfgang L.",""]]}
{"id":"2308.06309","submitter":"Karen Da Mata","authors":"Karen da Mata, Priscila Silva and Lance Fiondella","title":"Predicting Resilience with Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.PF cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Resilience engineering studies the ability of a system to survive and recover\nfrom disruptive events, which finds applications in several domains. Most\nstudies emphasize resilience metrics to quantify system performance, whereas\nrecent studies propose statistical modeling approaches to project system\nrecovery time after degradation. Moreover, past studies are either performed on\ndata after recovering or limited to idealized trends. Therefore, this paper\nproposes three alternative neural network (NN) approaches including (i)\nArtificial Neural Networks, (ii) Recurrent Neural Networks, and (iii)\nLong-Short Term Memory (LSTM) to model and predict system performance,\nincluding negative and positive factors driving resilience to quantify the\nimpact of disruptive events and restorative activities. Goodness-of-fit\nmeasures are computed to evaluate the models and compared with a classical\nstatistical model, including mean squared error and adjusted R squared. Our\nresults indicate that NN models outperformed the traditional model on all\ngoodness-of-fit measures. More specifically, LSTMs achieved an over 60\\% higher\nadjusted R squared, and decreased predictive error by 34-fold compared to the\ntraditional method. These results suggest that NN models to predict resilience\nare both feasible and accurate and may find practical use in many important\ndomains.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:29:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["da Mata","Karen",""],["Silva","Priscila",""],["Fiondella","Lance",""]]}
{"id":"2308.06310","submitter":"Francois Henault M.","authors":"Francois Henault","title":"Remote Measurement of Heliostat Reflectivity with the Backward Gazing\n  Procedure","comments":"None","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Concentrated solar power is a promising technique enabling renewable energy\nproduction with large scale solar power plants in the near future. Estimating\nquantitatively the reflectivity of a solar concentrator is a major issue, since\nit has a significant impact on the flux distribution formed on the solar\nreceiver. Moreover, it is desirable that the mirrors can be measured during\noperation in order to evaluate environmental factors such as day night thermal\ncycles or soiling and ageing effects at the reflective surfaces. For that\npurpose, we used a backward gazing method that was originally developed to\nmeasure mirror shape and misalignment errors. The method operates in quasi\nreal-time without disturbing the heat production process. It was successfully\ntested at a solar tower power plant in France. Its basic principle consists in\nacquiring four simultaneous images of a Sun-tracking heliostat, captured from\ndifferent observation points located near the thermal receiver. The images are\nthen processed with a minimization algorithm allowing the determination of\nmirror slopes errors. In this communication, it is shown that the algorithm\nalso allows one to get quantitative reflectivity maps at the surface of the\nheliostat. The measurement is fully remote and is used to evaluate surface\nreflectivity that depends on optical coatings quality and soiling. Preliminary\nresults obtained with a Themis heliostat are presented. They show that\nreflectivity measurements can be carried out within repeatability about 10\npercent Peak-to-Valley (PTV) and 1 percent RMS. Ways to improving these numbers\nare discussed in the paper\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:54:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Henault","Francois",""]]}
{"id":"2308.06311","submitter":"Claire Frechette","authors":"Claire Frechette, Mathilde Gerbelli-Gauthier, Alia Hamieh, and Naomi\n  Tanabe","title":"Large Sums of Fourier Coefficients of Cusp Forms","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $N$ be a fixed positive integer, and let $f\\in S_k(N)$ be a primitive\ncusp form given by the Fourier expansion $f(z)=\\sum_{n=1}^{\\infty}\n\\lambda_f(n)n^{\\frac{k-1}{2}}e(nz)$. We consider the partial sum\n$S(x,f)=\\sum_{n\\leq x}\\lambda_f(x)$. It is conjectured that $S(x,f)=o(x\\log x)$\nin the range $x\\geq k^{\\epsilon}$. Lamzouri proved in arXiv:1703.10582\n[math.NT] that this is true under the assumption of the Generalized Riemann\nHypothesis (GRH) for $L(s,f)$. In this paper, we prove that this conjecture\nholds under a weaker assumption than GRH. In particular, we prove that given\n$\\epsilon>(\\log k)^{-\\frac{1}{8}}$ and $1\\leq T\\leq (\\log k)^{\\frac{1}{200}}$,\nwe have $S(x,f)\\ll \\frac{x\\log x}{T}$ in the range $x\\geq k^{\\epsilon}$\nprovided that $L(s,f)$ has no more than $\\epsilon^2\\log k/5000$ zeros in the\nregion $\\left\\{s\\,:\\, \\Re(s)\\geq \\frac34, \\, |\\Im(s)-\\phi| \\leq\n\\frac14\\right\\}$ for every real number $\\phi$ with $|\\phi|\\leq T$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 17:55:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Frechette","Claire",""],["Gerbelli-Gauthier","Mathilde",""],["Hamieh","Alia",""],["Tanabe","Naomi",""]]}
{"id":"2308.06312","submitter":"Brandon Rayhaun","authors":"Leonardo Rastelli and Brandon C. Rayhaun","title":"Rationality in Four Dimensions","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math.NT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By leveraging the physics of the Higgs branch, we argue that the conformal\ncentral charges $a$ and $c$ of an arbitrary 4d $N=2$ superconformal field\ntheory (SCFT) are rational numbers. Our proof of the rationality of $c$ is\nconditioned on a well-supported conjecture about how the Higgs branch of an\nSCFT is encoded in its protected chiral algebra. To establish the rationality\nof $a$, we further rely on a widely-believed technical assumption on the\nhigh-temperature limit of the superconformal index.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rastelli","Leonardo",""],["Rayhaun","Brandon C.",""]]}
{"id":"2308.06313","submitter":"Stefano Carrazza","authors":"Stavros Efthymiou, Alvaro Orgaz-Fuertes, Rodolfo Carobene, Juan\n  Cereijo, Andrea Pasquale, Sergi Ramos-Calderer, Simone Bordoni, David\n  Fuentes-Ruiz, Alessandro Candido, Edoardo Pedicillo, Matteo Robbiati,\n  Yuanzheng Paul Tan, Jadwiga Wilkens, Ingo Roth, Jos\\'e Ignacio Latorre,\n  Stefano Carrazza","title":"Qibolab: an open-source hybrid quantum operating system","comments":"18 pages, 10 figures, code available at\n  https://github.com/qiboteam/qibolab","journal-ref":null,"doi":null,"report-no":"TIF-UNIMI-2023-14, CERN-TH-2023-142","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Qibolab, an open-source software library for quantum hardware\ncontrol integrated with the Qibo quantum computing middleware framework.\nQibolab provides the software layer required to automatically execute\ncircuit-based algorithms on custom self-hosted quantum hardware platforms. We\nintroduce a set of objects designed to provide programmatic access to quantum\ncontrol through pulses-oriented drivers for instruments, transpilers and\noptimization algorithms. Qibolab enables experimentalists and developers to\ndelegate all complex aspects of hardware implementation to the library so they\ncan standardize the deployment of quantum computing algorithms in a\nhardware-agnostic way. We first describe the status of all components of the\nlibrary, then we show examples of control setup for superconducting qubits\nplatforms. Finally, we present successful application results related to\ncircuit-based algorithms.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Efthymiou","Stavros",""],["Orgaz-Fuertes","Alvaro",""],["Carobene","Rodolfo",""],["Cereijo","Juan",""],["Pasquale","Andrea",""],["Ramos-Calderer","Sergi",""],["Bordoni","Simone",""],["Fuentes-Ruiz","David",""],["Candido","Alessandro",""],["Pedicillo","Edoardo",""],["Robbiati","Matteo",""],["Tan","Yuanzheng Paul",""],["Wilkens","Jadwiga",""],["Roth","Ingo",""],["Latorre","Jos\u00e9 Ignacio",""],["Carrazza","Stefano",""]]}
{"id":"2308.06314","submitter":"Tanner Trickle","authors":"Andrea Mitridate, Kris Pardo, Tanner Trickle, Kathryn M. Zurek","title":"Effective Field Theory for Dark Matter Absorption on Single Phonons","comments":"36 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"CALT-TH-2023-032, DESY-23-113, FERMILAB-PUB-23-417-T","categories":"hep-ph astro-ph.CO cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single phonon excitations, with energies in the $1-100 \\, \\text{meV}$ range,\nare a powerful probe of light dark matter (DM). Utilizing effective field\ntheory, we derive a framework to compute DM absorption rates into single\nphonons starting from general DM-electron, proton, and neutron interactions. We\napply the framework to a variety of DM models: Yukawa coupled scalars,\naxionlike particles (ALPs) with derivative interactions, and vector DM coupling\nvia gauge interactions or Standard Model electric and magnetic dipole moments.\nWe find that GaAs or $\\text{Al}_2\\text{O}_3$ targets can set powerful\nconstraints on a $U(1)_{B-L}$ model, and targets with electronic spin ordering\nare similarly sensitive to DM coupling to the electron magnetic dipole moment.\nLastly, we make the code, \\textsf{PhonoDark-abs} (an extension of the existing\n\\textsf{PhonoDark} code which computes general DM-single phonon scattering\nrates), publicly available.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mitridate","Andrea",""],["Pardo","Kris",""],["Trickle","Tanner",""],["Zurek","Kathryn M.",""]]}
{"id":"2308.06315","submitter":"Julie Pag\\`es","authors":"Elizabeth E. Jenkins, Aneesh V. Manohar, Luca Naterop and Julie\n  Pag\\`es","title":"An Algebraic Formula for Two Loop Renormalization of Scalar Quantum\n  Field Theory","comments":"25 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"ZU-TH 45/23, PSI-PR-23-29","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a general formula for the two-loop renormalization counterterms of a\nscalar quantum field theory with interactions containing up to two derivatives,\nwhich extends 't Hooft's one-loop result. We show that factorizable topologies\ndo not contribute to the renormalization group equations. The results will be\ncombined with the geometric method in a subsequent paper to obtain the\nrenormalization group equations for the scalar sector of effective field\ntheories (EFT) to two-loop order.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jenkins","Elizabeth E.",""],["Manohar","Aneesh V.",""],["Naterop","Luca",""],["Pag\u00e8s","Julie",""]]}
{"id":"2308.06316","submitter":"Iryna Butsky","authors":"Iryna S. Butsky, Philip F. Hopkins, Philipp Kempski, Sam B. Ponnada,\n  Eliot Quataert, Jonathan Squire","title":"Galactic Cosmic-ray Scattering due to Intermittent Structures","comments":"9 pages, 3 figures, submitted to MNRAS","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":"  Cosmic rays (CRs) with energies $\\ll$ TeV comprise a significant component of\nthe interstellar medium (ISM). Major uncertainties in CR behavior on observable\nscales (much larger than CR gyroradii) stem from how magnetic fluctuations\nscatter CRs in pitch angle. Traditional first-principles models, which assume\nthese magnetic fluctuations are weak and uniformly scatter CRs in a homogeneous\nISM, struggle to reproduce basic observables such as the dependence of CR\nresidence times and scattering rates on rigidity. We therefore explore a new\ncategory of \"patchy\" CR scattering models, wherein CRs are predominantly\nscattered by intermittent strong scattering structures with small\nvolume-filling factors. These models produce the observed rigidity dependence\nwith a simple size distribution constraint, such that larger scattering\nstructures are rarer but can scatter a wider range of CR energies. To reproduce\nthe empirically-inferred CR scattering rates, the mean free path between\nscattering structures must be $\\ell_{\\rm mfp} \\sim 10$ pc at GeV energies. We\nderive constraints on the sizes, internal properties, mass/volume-filling\nfactors, and the number density any such structures would need to be both\nphysically and observationally consistent. We consider a range of candidate\nstructures, both large-scale (e.g. H II regions) and small-scale (e.g.\nintermittent turbulent structures, perhaps even associated with radio plasma\nscattering) and show that while many macroscopic candidates can be immediately\nruled out as the primary CR scattering sites, many smaller structures remain\nviable and merit further theoretical study. We discuss future observational\nconstraints that could test these models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Butsky","Iryna S.",""],["Hopkins","Philip F.",""],["Kempski","Philipp",""],["Ponnada","Sam B.",""],["Quataert","Eliot",""],["Squire","Jonathan",""]]}
{"id":"2308.06317","submitter":"Francesco D'Eugenio","authors":"Francesco D'Eugenio, Pablo Perez-Gonzalez, Roberto Maiolino, Jan\n  Scholtz, Michele Perna, Chiara Circosta, Hannah Uebler, Santiago Arribas,\n  Torsten Boeker, Andrew Bunker, Stefano Carniani, Stephane Charlot, Jacopo\n  Chevallard, Giovanni Cresci, Emma Curtis-Lake, Gareth Jones, Nimisha Kumari,\n  Isabella Lamperti, Tobias Looser, Eleonora Parlanti, Hans-Walter Rix, Brant\n  Robertson, Bruno Rodriguez Del Pino, Sandro Tacchella, Giacomo Venturi, Chris\n  Willott","title":"A fast-rotator post-starburst galaxy quenched by supermassive black-hole\n  feedback at z=3","comments":"40 pages, 9 figures, submitted to Nat. Ast., comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is compelling evidence that the most massive galaxies in the Universe\nstopped forming stars due to the time-integrated feedback from their central\nsuper-massive black holes (SMBHs). However, the exact quenching mechanism is\nnot yet understood, because local massive galaxies were quenched billions of\nyears ago. We present JWST/NIRSpec integral-field spectroscopy observations of\nGS-10578, a massive, quiescent galaxy at redshift z=3.064. From the spectrum we\ninfer that the galaxy has a stellar mass of $M_*=1.6\\pm0.2 \\times 10^{11}$ MSun\nand a dynamical mass $M_{\\rm dyn}=2.0\\pm0.5 \\times 10^{11}$ MSun. Half of its\nstellar mass formed at z=3.7-4.6, and the system is now quiescent, with the\ncurrent star-formation rate SFR<9 MSun/yr. We detect ionised- and neutral-gas\noutflows traced by [OIII] emission and NaI absorption. Outflow velocities reach\n$v_{\\rm out}\\approx$1,000 km/s, comparable to the galaxy escape velocity and\ntoo high to be explained by star formation alone. GS-10578 hosts an Active\nGalactic Nucleus (AGN), evidence that these outflows are due to SMBH feedback.\nThe outflow rates are 0.14-2.9 and 30-300 MSun/yr for the ionised and neutral\nphases, respectively. The neutral outflow rate is ten times higher than the\nSFR, hence this is direct evidence for ejective SMBH feedback, with\nmass-loading capable of interrupting star formation by rapidly removing its\nfuel. Stellar kinematics show ordered rotation, with spin parameter\n$\\lambda_{Re}=0.62\\pm0.07$, meaning GS-10578 is rotation supported. This study\nshows direct evidence for ejective AGN feedback in a massive, recently quenched\ngalaxy, thus clarifying how SMBHs quench their hosts. Quenching can occur\nwithout destroying the stellar disc.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["D'Eugenio","Francesco",""],["Perez-Gonzalez","Pablo",""],["Maiolino","Roberto",""],["Scholtz","Jan",""],["Perna","Michele",""],["Circosta","Chiara",""],["Uebler","Hannah",""],["Arribas","Santiago",""],["Boeker","Torsten",""],["Bunker","Andrew",""],["Carniani","Stefano",""],["Charlot","Stephane",""],["Chevallard","Jacopo",""],["Cresci","Giovanni",""],["Curtis-Lake","Emma",""],["Jones","Gareth",""],["Kumari","Nimisha",""],["Lamperti","Isabella",""],["Looser","Tobias",""],["Parlanti","Eleonora",""],["Rix","Hans-Walter",""],["Robertson","Brant",""],["Del Pino","Bruno Rodriguez",""],["Tacchella","Sandro",""],["Venturi","Giacomo",""],["Willott","Chris",""]]}
{"id":"2308.06318","submitter":"James Alvey","authors":"James Alvey, Uddipta Bhardwaj, Samaya Nissanke, Christoph Weniger","title":"What to do when things get crowded? Scalable joint analysis of\n  overlapping gravitational wave signals","comments":"6 pages. 3 figures. Codes: peregrine is publicly available at\n  https://github.com/PEREGRINE-GW/peregrine/tree/overlapping, swyft is\n  available at https://github.com/undark-lab/swyft","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The gravitational wave sky is starting to become very crowded, with the\nfourth science run (O4) at LIGO expected to detect $\\mathcal{O}(100)$ compact\nobject coalescence signals. Data analysis issues start to arise as we look\nfurther forwards, however. In particular, as the event rate increases in e.g.\nnext generation detectors, it will become increasingly likely that signals\narrive in the detector coincidentally, eventually becoming the dominant source\nclass. It is known that current analysis pipelines will struggle to deal with\nthis scenario, predominantly due to the scaling of traditional methods such as\nMonte Carlo Markov Chains and nested sampling, where the time difference\nbetween analysing a single signal and multiple can be as significant as days to\nmonths. In this work, we argue that sequential simulation-based inference\nmethods can solve this problem by breaking the scaling behaviour. Specifically,\nwe apply an algorithm known as (truncated marginal) neural ratio estimation\n(TMNRE), implemented in the code peregrine and based on swyft. To demonstrate\nits applicability, we consider three case studies comprising two overlapping,\nspinning, and precessing binary black hole systems with merger times separated\nby 0.05 s, 0.2 s, and 0.5 s. We show for the first time that we can recover,\nwith full precision (as quantified by a comparison to the analysis of each\nsignal independently), the posterior distributions of all 30 model parameters\nin a full joint analysis. Crucially, we achieve this with only $\\sim 15\\%$ of\nthe waveform evaluations that would be needed to analyse even a single signal\nwith traditional methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alvey","James",""],["Bhardwaj","Uddipta",""],["Nissanke","Samaya",""],["Weniger","Christoph",""]]}
{"id":"2308.06319","submitter":"Chang Liu","authors":"Chang Liu, Adam A. Miller, Samuel J. Boos, Ken J. Shen, Dean M.\n  Townsley, Steve Schulze, Luke Harvey, Kate Maguire, Joel Johansson, Thomas G.\n  Brink, Umut Burgaz, Georgios Dimitriadis, Alexei V. Filippenko, Saarah Hall,\n  K-Ryan Hinds, Andrew Hoffman, Viraj Karambelkar, Charles D. Kilpatrick,\n  Daniel Perley, Neil Pichay, Huei Sears, Jesper Sollerman, Robert Stein,\n  Jacobus H. Terwel, WeiKang Zheng, Matthew J. Graham, Mansi M. Kasliwal,\n  Leander Lacroix, Josiah Purdum, Benjamin Rusholme, Avery Wold","title":"SN 2022joj: A Peculiar Type Ia Supernova Possibly Driven by an\n  Asymmetric Helium-shell Double Detonation","comments":"24 pages, 11 figures, 6 tables. Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present observations of SN 2022joj, a peculiar Type Ia supernova (SN Ia)\ndiscovered by the Zwicky Transient Facility (ZTF). SN 2022joj exhibits an\nunusually red $g_\\mathrm{ZTF}-r_\\mathrm{ZTF}$ color at early times and a rapid\nblueward evolution afterwards. Around maximum brightness, SN 2022joj shows a\nhigh luminosity ($M_{g_\\mathrm{ZTF},\\mathrm{max}}\\simeq-19.7$ mag), a blue\nbroadband color ($g_\\mathrm{ZTF}-r_\\mathrm{ZTF}\\simeq-0.2$ mag), and shallow Si\nII absorption lines, consistent with those of overluminous, SN 1991T-like\nevents. The maximum-light spectrum also shows prominent absorption around 4200\n\\r{A}, which resembles the Ti II features in subluminous, SN 1991bg-like\nevents. Despite the blue optical-band colors, SN 2022joj exhibits extremely red\nultraviolet $-$ optical colors at maximum luminosity ($u-v\\simeq1.6$ mag and\n$uvw1 - v\\simeq4.0$ mag), suggesting a suppression of flux between\n$\\sim$2500--4000 \\r{A}. Strong C II lines are also detected at peak. We show\nthat these unusual spectroscopic properties are broadly consistent with the\nhelium-shell double detonation of a sub-Chandrasekhar mass\n($M\\simeq1\\mathrm{M_\\odot}$) carbon/oxygen (C/O) white dwarf (WD) from a\nrelatively massive helium shell ($M_s\\simeq0.04$--$0.1\\mathrm{M_\\odot}$), if\nobserved along a line of sight roughly opposite to where the shell initially\ndetonates. None of the existing models could quantitatively explain all the\npeculiarities observed in SN 2022joj. The low flux ratio of [Ni II]\n$\\lambda$7378 to [Fe II] $\\lambda$7155 emission in the late-time nebular\nspectra indicates a low yield of stable Ni isotopes, favoring a\nsub-Chandrasekhar mass progenitor. The significant blueshift measured in the\n[Fe II] $\\lambda$7155 line is also consistent with an asymmetric chemical\ndistribution in the ejecta, as is predicted in double-detonation models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Chang",""],["Miller","Adam A.",""],["Boos","Samuel J.",""],["Shen","Ken J.",""],["Townsley","Dean M.",""],["Schulze","Steve",""],["Harvey","Luke",""],["Maguire","Kate",""],["Johansson","Joel",""],["Brink","Thomas G.",""],["Burgaz","Umut",""],["Dimitriadis","Georgios",""],["Filippenko","Alexei V.",""],["Hall","Saarah",""],["Hinds","K-Ryan",""],["Hoffman","Andrew",""],["Karambelkar","Viraj",""],["Kilpatrick","Charles D.",""],["Perley","Daniel",""],["Pichay","Neil",""],["Sears","Huei",""],["Sollerman","Jesper",""],["Stein","Robert",""],["Terwel","Jacobus H.",""],["Zheng","WeiKang",""],["Graham","Matthew J.",""],["Kasliwal","Mansi M.",""],["Lacroix","Leander",""],["Purdum","Josiah",""],["Rusholme","Benjamin",""],["Wold","Avery",""]]}
{"id":"2308.06320","submitter":"Chitraang Murdia","authors":"Dan Stefan Eniceicu, Raghu Mahajan, Chitraang Murdia","title":"Complex eigenvalue instantons and the Fredholm determinant expansion in\n  the Gross-Witten-Wadia model","comments":"21 pages + references, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the leading nonperturbative corrections to the strong-coupling\n(ungapped) phase of the Gross-Witten-Wadia (GWW) integral over unitary\nmatrices, to one-loop order. We compute these corrections directly in terms of\neigenvalue tunneling in a holomorphic presentation of the integral over\neigenvalues. The leading nonperturbative contribution to the partition function\ncomes from a pair of complex eigenvalue instantons. We show that these are in\nfact \"ghost instantons\", which are extrema of the one-eigenvalue effective\npotential on the \"unphysical sheet\" of the spectral curve and have been\ndiscussed in detail recently by Mari\\~no, Schiappa, and Schwick. Further, we\ndiscuss the relationship of these instantons to the Fredholm determinant\nexpansion of the unitary matrix integral, which has recently become an object\nof interest in the computations of BPS indices of supersymmetric gauge theories\nand black holes. We find that, after taking the 't Hooft limit, the first\ncorrection given by the Fredholm determinant expansion of the GWW integral\nagrees precisely with the leading nonperturbative correction, to one-loop\norder.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Eniceicu","Dan Stefan",""],["Mahajan","Raghu",""],["Murdia","Chitraang",""]]}
{"id":"2308.06321","submitter":"Piotr Sierant","authors":"Xhek Turkeshi, Piotr Sierant","title":"Error-resilience Phase Transitions in Encoding-Decoding Quantum Circuits","comments":"4+9 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding how errors deteriorate the information encoded in a many-body\nquantum system is a fundamental problem with practical implications for quantum\ntechnologies. Here, we investigate a class of encoding-decoding random circuits\nwith coherent errors. The existence of a phase transition separating an\nerror-protecting phase at weak error strength from an error-vulnerable phase is\nanalytically demonstrated. We derive exact expressions showing that this\ntransition is accompanied by an area-to-volume law entanglement transition and\na localization transition in the computational basis. The emergence of\nmultifractal features in the considered system is highlighted.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Turkeshi","Xhek",""],["Sierant","Piotr",""]]}
{"id":"2308.06322","submitter":"Pablo Candela","authors":"Pablo Candela, Diego Gonz\\'alez-S\\'anchez, Bal\\'azs Szegedy","title":"On measure-preserving $\\mathbb{F}_p^\\omega$-systems of order $k$","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building on previous work in the nilspace-theoretic approach to the study of\nHost-Kra factors of measure-preserving systems, we prove that every ergodic\n$\\mathbb{F}_p^\\omega$-system of order $k$ is a factor of an Abramov\n$\\mathbb{F}_p^\\omega$-system of order $k$. This answers a question of\nJamneshan, Shalom and Tao.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Candela","Pablo",""],["Gonz\u00e1lez-S\u00e1nchez","Diego",""],["Szegedy","Bal\u00e1zs",""]]}
{"id":"2308.06323","submitter":"Ishmam Mahbub","authors":"Zhen Liu, Kun-Feng Lyu, Ishmam Mahbub, and Lian-Tao Wang","title":"Top Yukawa Coupling Determination at High Energy Muon Collider","comments":"33 pages, 13 figures","journal-ref":null,"doi":null,"report-no":"UMN-TH-4220/23","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Top Yukawa coupling profoundly influences several core mysteries linked\nto the electroweak scale and the Higgs boson. We study the feasibility of\nmeasuring the Top Yukawa coupling at high-energy muon colliders by examining\nthe high-energy dynamics of the weak boson fusion to top quark pair processes.\nA deviation of the Top Yukawa coupling from the Standard Model would lead\nmodified $V V \\rightarrow t\\bar{t}$ process, violating unitarity at high\nenergy. Our analysis reveals that utilizing a muon collider with a\ncenter-of-mass energy of 10 TeV and an integrated luminosity of 10 ab$^{-1}$\nallows us to investigate the Top Yukawa coupling with a precision surpassing\n1.5\\%, more than one order of magnitude better than the precision from $t\\bar t\nh$ channel at muon colliders. This precision represents a notable enhancement\ncompared to the anticipated sensitivities of the High-Luminosity LHC (3.4\\%)\nand those at muon colliders derived from the $t\\bar{t} H$ process.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Zhen",""],["Lyu","Kun-Feng",""],["Mahbub","Ishmam",""],["Wang","Lian-Tao",""]]}
{"id":"2308.06324","submitter":"Kaloyan Penev","authors":"Mohammad M. Mahmud and Kaloyan M. Penev and Joshua A. Schussler","title":"Measuring Tidal Dissipation in Giant Planets from Tidal Circularization","comments":"Accepted for publication in MNRAS 19 pages, 11 figures, 2 tables","journal-ref":null,"doi":"10.1093/mnras/stad2298","report-no":null,"categories":"astro-ph.EP astro-ph.IM astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this project, we determined the constraints on the modified tidal quality\nfactor, $Q_{pl}'$, of gas-giant planets orbiting close to their host stars. We\nallowed $Q_{pl}'$ to depend on tidal frequency, accounting for the multiple\ntidal waves with time-dependent frequencies simultaneously present on the\nplanet. We performed our analysis on 78 single-star and single-planet systems,\nwith giant planets and host stars with radiative cores and convective outer\nshells. We extracted constraints on the frequency-dependent $Q_{pl}'$ for each\nsystem separately and combined them to find general constraints on $Q_{pl}'$\nrequired to explain the observed eccentricity envelope while simultaneously\nallowing the observed eccentricities of all systems to survive to the present\nday. Individual systems do not place tight constraints on $Q_{pl}'$. However,\nsince similar planets must have similar tidal dissipation, we require that a\nconsistent, possibly frequency-dependent, model must apply. Under that\nassumption, we find that the value of $\\log_{10}Q_{pl}'$ for HJs is $5.0\\pm0.5$\nfor the range of tidal period from 0.8 to 7 days. We did not see any clear sign\nof frequency dependence of $Q_{pl}'$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mahmud","Mohammad M.",""],["Penev","Kaloyan M.",""],["Schussler","Joshua A.",""]]}
{"id":"2308.06325","submitter":"Matthew Leighton","authors":"Matthew P. Leighton, Jannik Ehrich, David A. Sivak","title":"Information Arbitrage in Bipartite Heat Engines","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Heat engines and information engines have each historically served as\nmotivating examples for the development of thermodynamics. While these two\ntypes of systems are typically thought of as two separate kinds of machines,\nrecent empirical studies of specific systems have hinted at possible\nconnections between the two. Inspired by molecular machines in the cellular\nenvironment, which in many cases have separate components in contact with\ndistinct sources of fluctuations, we study bipartite heat engines. We show that\na bipartite heat engine can only produce net output work by acting as an\ninformation engine. Conversely, information engines can only extract more work\nthan the work consumed to power them if they have access to different sources\nof fluctuations, i.e., act as heat engines. We illustrate these findings first\nthrough an analogy to economics and a cyclically controlled 2D ideal gas. We\nthen explore two analytically tractable model systems in more detail: a\nBrownian-gyrator heat engine which we show can be reinterpreted as a\nfeedback-cooling information engine, and a quantum-dot information engine which\ncan be reinterpreted as a thermoelectric heat engine. Our results suggest\ndesign principles for both heat engines and information engines at the\nnanoscale, and ultimately imply constraints on how free-energy transduction is\ncarried out in biological molecular machines.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:00:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Leighton","Matthew P.",""],["Ehrich","Jannik",""],["Sivak","David A.",""]]}
{"id":"2308.06326","submitter":"Thomas Kropfreiter","authors":"Thomas Kropfreiter, Florian Meyer, David F. Crouse, Stefano Coraluppi,\n  Franz Hlawatsch, Peter Willett","title":"To Coalesce or to Repel? An Analysis of MHT, JPDA, and Belief\n  Propagation Multitarget Tracking Methods","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Joint probabilistic data association (JPDA) filter methods and multiple\nhypothesis tracking (MHT) methods are widely used for multitarget tracking\n(MTT). However, they are known to exhibit undesirable behavior in tracking\nscenarios with targets in close proximity: JPDA filter methods suffer from the\ntrack coalescence effect, i.e., the estimated tracks of targets in close\nproximity tend to merge and can become indistinguishable, and MHT methods\nsuffer from an opposite effect known as track repulsion. In this paper, we\nreview the JPDA filter and MHT methods and discuss the track coalescence and\ntrack repulsion effects. We also consider a more recent methodology for MTT\nthat is based on the belief propagation (BP) algorithm, and we argue that\nBP-based MTT exhibits significantly reduced track coalescence and no track\nrepulsion. Our theoretical arguments are confirmed by numerical results.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:02:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kropfreiter","Thomas",""],["Meyer","Florian",""],["Crouse","David F.",""],["Coraluppi","Stefano",""],["Hlawatsch","Franz",""],["Willett","Peter",""]]}
{"id":"2308.06327","submitter":"Mohammad Soleymanpour","authors":"Mohammad Soleymanpour, Mahmoud Al Ismail, Fahimeh Bahmaninezhad,\n  Kshitiz Kumar, Jian Wu","title":"Bilingual Streaming ASR with Grapheme units and Auxiliary Monolingual\n  Loss","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce a bilingual solution to support English as secondary locale for\nmost primary locales in hybrid automatic speech recognition (ASR) settings. Our\nkey developments constitute: (a) pronunciation lexicon with grapheme units\ninstead of phone units, (b) a fully bilingual alignment model and subsequently\nbilingual streaming transformer model, (c) a parallel encoder structure with\nlanguage identification (LID) loss, (d) parallel encoder with an auxiliary loss\nfor monolingual projections. We conclude that in comparison to LID loss, our\nproposed auxiliary loss is superior in specializing the parallel encoders to\nrespective monolingual locales, and that contributes to stronger bilingual\nlearning. We evaluate our work on large-scale training and test tasks for\nbilingual Spanish (ES) and bilingual Italian (IT) applications. Our bilingual\nmodels demonstrate strong English code-mixing capability. In particular, the\nbilingual IT model improves the word error rate (WER) for a code-mix IT task\nfrom 46.5% to 13.8%, while also achieving a close parity (9.6%) with the\nmonolingual IT model (9.5%) over IT tests.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:06:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Soleymanpour","Mohammad",""],["Ismail","Mahmoud Al",""],["Bahmaninezhad","Fahimeh",""],["Kumar","Kshitiz",""],["Wu","Jian",""]]}
{"id":"2308.06328","submitter":"Joaquim Serra","authors":"Hardy Chan, Serena Dipierro, Joaquim Serra, Enrico Valdinoci","title":"Nonlocal approximation of minimal surfaces: optimal estimates from\n  stability","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":"  Minimal surfaces in closed 3-manifolds are classically constructed via the\nAlmgren-Pitts approach. The Allen-Cahn approximation has proved to be a\npowerful alternative, and Chodosh and Mantoulidis (in Ann. Math. 2020) used it\nto give a new proof of Yau's conjecture for generic metrics and establish the\nmultiplicity one conjecture. The primary goal of this paper is to set the\nground for a new approximation based on nonlocal minimal surfaces. More\nprecisely, we prove that if $\\partial E$ is a stable $s$-minimal surface in\n$B_1\\subset \\mathbb R^3$ then:\n  - $\\partial E\\cap B_{1/2}$ enjoys a $C^{2,\\alpha}$ estimate that is robust as\n$s\\uparrow 1$ (i.e. uniform in $s$);\n  - the distance between different connected components of~$\\partial E\\cap\nB_{1/2}$ must be at least of order~$(1-s)^{\\frac 1 2}$ (optimal sheet\nseparation estimate);\n  - interactions between multiple sheets at distances of order $(1-s)^{\\frac 1\n2}$ are described by the D\\'avila--del Pino--Wei system. A second important\ngoal of the paper is to establish that hyperplanes are the only stable\n$s$-minimal hypersurfaces in $\\mathbb R^4$, for $s\\in(0,1)$ sufficiently close\nto $1$. This is done by exploiting suitable modifications of the results\ndescribed above. In this application, it is crucially used that our curvature\nand separations estimates hold without any assumption on area bounds (in\ncontrast to the analogous estimates for Allen-Cahn).\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:07:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chan","Hardy",""],["Dipierro","Serena",""],["Serra","Joaquim",""],["Valdinoci","Enrico",""]]}
{"id":"2308.06329","submitter":"Manar Naeem","authors":"Lana Bozanic, Manar Naeem, Kensuke Gallock-Yoshimura, Robert B. Mann","title":"Correlation harvesting between particle detectors in uniform motion","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the correlation harvesting protocol using two Unruh-DeWitt\nparticle detectors moving along four classes of uniformly accelerated\ntrajectories categorized by Letaw: linear, catenary, cusped, and circular\nmotions. For each trajectory, two types of configurations are carried out: one\npossesses a stationary (time-translation invariant) Wightman function and the\nother is nonstationary. We find that detectors undergoing linear, catenary, and\ncusped motions gain fewer correlations in the nonstationary configurations\ncompared to those in stationary configurations. Detectors in circular motion\nhave similar behavior in both configurations. We discuss the relative\nsuppression of correlation harvesting due to high acceleration for each case.\nRemarkably we find that under certain circumstances detectors in both linear\nand circular states of motion can harvest genuine (non-communication assisted)\nentanglement even though they are in causal contact.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:08:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bozanic","Lana",""],["Naeem","Manar",""],["Gallock-Yoshimura","Kensuke",""],["Mann","Robert B.",""]]}
{"id":"2308.06330","submitter":"Adri\\'an Del R\\'io Vega","authors":"Adri\\'an del R\\'io and Ivan Agullo","title":"Chiral fermion anomaly as a memory effect","comments":"14 pages + 2 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the non-conservation of the chiral charge of Dirac fields between\npast and future null infinity due to the Adler-Bell-Jackiw chiral anomaly. In\nprevious investigations \\cite{dR21}, we found that this charge fails to be\nconserved if electromagnetic sources in the bulk emit circularly polarized\nradiation. In this article, we unravel yet another contribution coming from the\nnon-zero, infrared ``soft'' charges of the external, electromagnetic field.\nThis new contribution can be interpreted as another manifestation of the\nordinary memory effect produced by transitions between different infrared\nsectors of Maxwell theory, but now on test quantum fields rather than on test\nclassical particles. In other words, a flux of electromagnetic waves can leave\na memory on quantum fermion states in the form of a permanent, net helicity. We\nelaborate this idea in both $1+1$ and $3+1$ dimensions. We also show that, in\nsharp contrast, gravitational infrared charges do not contribute to the fermion\nchiral anomaly.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:09:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["del R\u00edo","Adri\u00e1n",""],["Agullo","Ivan",""]]}
{"id":"2308.06331","submitter":"Raghav Venkatraman","authors":"Dmitry Golovaty and Jamie Taylor and Raghavendra Venkatraman and\n  Arghir Zarnescu","title":"Interaction energies in paranematic colloids","comments":"50 pages, 13 figures. Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cond-mat.mtrl-sci cond-mat.soft math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a system of colloidal particles embedded in a paranematic -- an\nisotropic phase of a nematogenic medium above the temperature of the\nnematic-to-isotropic transition. In this state, the nematic order is induced by\nthe boundary conditions in a narrow band around each particle and it decays\nexponentially in the bulk.\n  We develop rigorous asymptotics of the linearization of the appropriate\nvariational model that allow us to describe weak far-field interactions between\nthe colloidal particles in two dimensional paranematic suspensions. We\ndemonstrate analytically that decay rates of solutions to the full nonlinear\nand linear problems are similar and verify numerically that the interactions\nbetween the particles in these problems have similar dependence on the distance\nbetween the particles. Finally, we perform Monte-Carlo simulations for a system\nof colloidal particles in a paranematic and describe the statistical properties\nof this system.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:14:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Golovaty","Dmitry",""],["Taylor","Jamie",""],["Venkatraman","Raghavendra",""],["Zarnescu","Arghir",""]]}
{"id":"2308.06332","submitter":"Khondker Fariha Hossain","authors":"Khondker Fariha Hossain, Sharif Amit Kamran, Joshua Ong, Andrew G.\n  Lee, Alireza Tavakkoli","title":"Revolutionizing Space Health (Swin-FSR): Advancing Super-Resolution of\n  Fundus Images for SANS Visual Assessment Technology","comments":"Accepted in 26th International Conference on Medical Image Computing\n  and Computer Assisted Intervention, MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The rapid accessibility of portable and affordable retinal imaging devices\nhas made early differential diagnosis easier. For example, color funduscopy\nimaging is readily available in remote villages, which can help to identify\ndiseases like age-related macular degeneration (AMD), glaucoma, or pathological\nmyopia (PM). On the other hand, astronauts at the International Space Station\nutilize this camera for identifying spaceflight-associated neuro-ocular\nsyndrome (SANS). However, due to the unavailability of experts in these\nlocations, the data has to be transferred to an urban healthcare facility (AMD\nand glaucoma) or a terrestrial station (e.g, SANS) for more precise disease\nidentification. Moreover, due to low bandwidth limits, the imaging data has to\nbe compressed for transfer between these two places. Different super-resolution\nalgorithms have been proposed throughout the years to address this.\nFurthermore, with the advent of deep learning, the field has advanced so much\nthat x2 and x4 compressed images can be decompressed to their original form\nwithout losing spatial information. In this paper, we introduce a novel model\ncalled Swin-FSR that utilizes Swin Transformer with spatial and depth-wise\nattention for fundus image super-resolution. Our architecture achieves Peak\nsignal-to-noise-ratio (PSNR) of 47.89, 49.00 and 45.32 on three public\ndatasets, namely iChallenge-AMD, iChallenge-PM, and G1020. Additionally, we\ntested the model's effectiveness on a privately held dataset for SANS provided\nby NASA and achieved comparable results against previous architectures.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:17:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hossain","Khondker Fariha",""],["Kamran","Sharif Amit",""],["Ong","Joshua",""],["Lee","Andrew G.",""],["Tavakkoli","Alireza",""]]}
{"id":"2308.06333","submitter":"Juming Xiong","authors":"Juming Xiong, Yilin Liu, Ruining Deng, Regina N Tyree, Hernan Correa,\n  Girish Hiremath, Yaohong Wang, and Yuankai Huo","title":"Deep Learning-Based Open Source Toolkit for Eosinophil Detection in\n  Pediatric Eosinophilic Esophagitis","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":"  Eosinophilic Esophagitis (EoE) is a chronic, immune/antigen-mediated\nesophageal disease, characterized by symptoms related to esophageal dysfunction\nand histological evidence of eosinophil-dominant inflammation. Owing to the\nintricate microscopic representation of EoE in imaging, current methodologies\nwhich depend on manual identification are not only labor-intensive but also\nprone to inaccuracies. In this study, we develop an open-source toolkit, named\nOpen-EoE, to perform end-to-end whole slide image (WSI) level eosinophil (Eos)\ndetection using one line of command via Docker. Specifically, the toolkit\nsupports three state-of-the-art deep learning-based object detection models.\nFurthermore, Open-EoE further optimizes the performance by implementing an\nensemble learning strategy, and enhancing the precision and reliability of our\nresults. The experimental results demonstrated that the Open-EoE toolkit can\nefficiently detect Eos on a testing set with 289 WSIs. At the widely accepted\nthreshold of >= 15 Eos per high power field (HPF) for diagnosing EoE, the\nOpen-EoE achieved an accuracy of 91%, showing decent consistency with\npathologist evaluations. This suggests a promising avenue for integrating\nmachine learning methodologies into the diagnostic process for EoE. The docker\nand source code has been made publicly available at\nhttps://github.com/hrlblab/Open-EoE.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:18:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xiong","Juming",""],["Liu","Yilin",""],["Deng","Ruining",""],["Tyree","Regina N",""],["Correa","Hernan",""],["Hiremath","Girish",""],["Wang","Yaohong",""],["Huo","Yuankai",""]]}
{"id":"2308.06334","submitter":"Estefania Padilla Gonzalez","authors":"E. Padilla Gonzalez, D.A. Howell, G. Terreran, C. McCully, M. Newsome,\n  J. Burke, J. Farah, C. Pellegrino, K. A. Bostroem, G. Hosseinzadeh, J.\n  Pearson, D. J. Sand, M. Shrestha, N. Smith, Y. Dong, N. Meza Retamal, S.\n  Valenti, S. Boos, K. J. Shen, D. Townsley, L. Galbany, L. Piscarreta, R.J.\n  Foley, M.J. Bustamante-Rosell, D.A. Coulter, R. Chornock, K.W. Davis, C.B.\n  Dickinson, D.O. Jones, J. Kutcka, X.K. Le Saux, C.R. Rojas-Bravo, K. Taggart,\n  S. Tinyanont, G. Yang, S. W. Jha, and R. Margutti","title":"SN 2022joj: A Potential Double Detonation with a Thin Helium shell","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":"  We present photometric and spectroscopic data for SN 2022joj, a nearby\npeculiar Type Ia supernova (SN Ia) with a fast decline rate ($\\rm{\\Delta\nm_{15,B}=1.4}$ mag). SN 2022joj shows exceedingly red colors, with a value of\napproximately ${B-V \\approx 1.1}$ mag during its initial stages, beginning from\n$11$ days before maximum brightness. As it evolves the flux shifts towards the\nblue end of the spectrum, approaching ${B-V \\approx 0}$ mag around maximum\nlight. Furthermore, at maximum light and beyond, the photometry is consistent\nwith that of typical SNe Ia. This unusual behavior extends to its spectral\ncharacteristics, which initially displayed a red spectrum and later evolved to\nexhibit greater consistency with typical SNe Ia. We consider two potential\nexplanations for this behavior: double detonation from a helium shell on a\nsub-Chandrasekhar-mass white dwarf and Chandrasekhar-mass models with a shallow\ndistribution of $\\rm{^{56}Ni}$. The shallow nickel models could not reproduce\nthe red colors in the early light curves. Spectroscopically, we find strong\nagreement between SN 2022joj and double-detonation models with white dwarf\nmasses around 1 $\\rm{M_{\\odot}}$ and thin He-shell between 0.01 and 0.02\n$\\rm{M_{\\odot}}$. Moreover, the early red colors are explained by\nline-blanketing absorption from iron-peak elements created by the double\ndetonation scenario in similar mass ranges. However, the nebular spectra\ncomposition in SN 2022joj deviates from expectations for double detonation, as\nwe observe strong [Fe III] emission instead of [Ca II] lines as anticipated\nfrom double detonation models. More detailed modeling, e.g., including viewing\nangle effects, is required to test if double detonation models can explain the\nnebular spectra.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:19:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gonzalez","E. Padilla",""],["Howell","D. A.",""],["Terreran","G.",""],["McCully","C.",""],["Newsome","M.",""],["Burke","J.",""],["Farah","J.",""],["Pellegrino","C.",""],["Bostroem","K. A.",""],["Hosseinzadeh","G.",""],["Pearson","J.",""],["Sand","D. J.",""],["Shrestha","M.",""],["Smith","N.",""],["Dong","Y.",""],["Retamal","N. Meza",""],["Valenti","S.",""],["Boos","S.",""],["Shen","K. J.",""],["Townsley","D.",""],["Galbany","L.",""],["Piscarreta","L.",""],["Foley","R. J.",""],["Bustamante-Rosell","M. J.",""],["Coulter","D. A.",""],["Chornock","R.",""],["Davis","K. W.",""],["Dickinson","C. B.",""],["Jones","D. O.",""],["Kutcka","J.",""],["Saux","X. K. Le",""],["Rojas-Bravo","C. R.",""],["Taggart","K.",""],["Tinyanont","S.",""],["Yang","G.",""],["Jha","S. W.",""],["Margutti","R.",""]]}
{"id":"2308.06335","submitter":"Ekaterina Nepovinnykh Mrs","authors":"Veikka Immonen, Ekaterina Nepovinnykh, Tuomas Eerola, Charles V.\n  Stewart, Heikki K\\\"alvi\\\"ainen","title":"Combining feature aggregation and geometric similarity for\n  re-identification of patterned animals","comments":"Camera traps, AI, and Ecology, 3rd International Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Image-based re-identification of animal individuals allows gathering of\ninformation such as migration patterns of the animals over time. This, together\nwith large image volumes collected using camera traps and crowdsourcing, opens\nnovel possibilities to study animal populations. For many species, the\nre-identification can be done by analyzing the permanent fur, feather, or skin\npatterns that are unique to each individual. In this paper, we address the\nre-identification by combining two types of pattern similarity metrics: 1)\npattern appearance similarity obtained by pattern feature aggregation and 2)\ngeometric pattern similarity obtained by analyzing the geometric consistency of\npattern similarities. The proposed combination allows to efficiently utilize\nboth the local and global pattern features, providing a general\nre-identification approach that can be applied to a wide variety of different\npattern types. In the experimental part of the work, we demonstrate that the\nmethod achieves promising re-identification accuracies for Saimaa ringed seals\nand whale sharks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:19:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Immonen","Veikka",""],["Nepovinnykh","Ekaterina",""],["Eerola","Tuomas",""],["Stewart","Charles V.",""],["K\u00e4lvi\u00e4inen","Heikki",""]]}
{"id":"2308.06336","submitter":"Cihan Okay","authors":"Rui Soares Barbosa, Aziz Kharoof, Cihan Okay","title":"A bundle perspective on contextuality: Empirical models and simplicial\n  distributions on bundle scenarios","comments":"50 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper provides a bundle perspective to contextuality by introducing new\ncategories of contextuality scenarios based on bundles of simplicial complexes\nand simplicial sets. The former approach generalizes earlier work on the\nsheaf-theoretic perspective on contextuality, and the latter extends simplicial\ndistributions, a more recent approach to contextuality formulated in the\nlanguage of simplicial sets. After constructing our bundle categories, we also\nconstruct functors that relate them and natural isomorphisms that allow us to\ncompare the notions of contextuality formulated in two languages. We are\nmotivated by applications to the resource theory of contextuality, captured by\nthe morphisms in these categories. In this paper, we develop the main formalism\nand leave applications to future work.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:19:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Barbosa","Rui Soares",""],["Kharoof","Aziz",""],["Okay","Cihan",""]]}
{"id":"2308.06337","submitter":"Sever Topan","authors":"Sever Topan, Yuxiao Chen, Edward Schmerling, Karen Leung, Jonas\n  Nilsson, Michael Cox, Marco Pavone","title":"Refining Obstacle Perception Safety Zones via Maneuver-Based\n  Decomposition","comments":"* indicates equal contribution. Accepted into the IEEE Intelligent\n  Vehicles Symposium 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A critical task for developing safe autonomous driving stacks is to determine\nwhether an obstacle is safety-critical, i.e., poses an imminent threat to the\nautonomous vehicle. Our previous work showed that Hamilton Jacobi reachability\ntheory can be applied to compute interaction-dynamics-aware perception safety\nzones that better inform an ego vehicle's perception module which obstacles are\nconsidered safety-critical. For completeness, these zones are typically larger\nthan absolutely necessary, forcing the perception module to pay attention to a\nlarger collection of objects for the sake of conservatism. As an improvement,\nwe propose a maneuver-based decomposition of our safety zones that leverages\ninformation about the ego maneuver to reduce the zone volume. In particular, we\npropose a \"temporal convolution\" operation that produces safety zones for\nspecific ego maneuvers, thus limiting the ego's behavior to reduce the size of\nthe safety zones. We show with numerical experiments that maneuver-based zones\nare significantly smaller (up to 76% size reduction) than the baseline while\nmaintaining completeness.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:23:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Topan","Sever",""],["Chen","Yuxiao",""],["Schmerling","Edward",""],["Leung","Karen",""],["Nilsson","Jonas",""],["Cox","Michael",""],["Pavone","Marco",""]]}
{"id":"2308.06338","submitter":"Anirbit Mukherjee","authors":"Anirbit Mukherjee and Amartya Roy","title":"Size Lowerbounds for Deep Operator Networks","comments":"21 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CC cs.NA math.AP math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Operator Networks are an increasingly popular paradigm for solving\nregression in infinite dimensions and hence solve families of PDEs in one shot.\nIn this work, we aim to establish a first-of-its-kind data-dependent lowerbound\non the size of DeepONets required for them to be able to reduce empirical error\non noisy data. In particular, we show that for low training errors to be\nobtained on $n$ data points it is necessary that the common output dimension of\nthe branch and the trunk net be scaling as $\\Omega \\left ( {\\sqrt{n}} \\right\n)$. This inspires our experiments with DeepONets solving the\nadvection-diffusion-reaction PDE, where we demonstrate the possibility that at\na fixed model size, to leverage increase in this common output dimension and\nget monotonic lowering of training error, the size of the training data might\nnecessarily need to scale quadratically with it.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:26:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mukherjee","Anirbit",""],["Roy","Amartya",""]]}
{"id":"2308.06339","submitter":"Jackson Pybus","authors":"J.R. Pybus, T. Kolar, B. Devkota, P. Sharp, B. Yu, O. Hen, E.\n  Piasetzky, S.N. Santiesteban, A. Schmidt, A. Somov, Y. Soreq, H.\n  Szumila-Vance, C.S. Akondi, C. Ayerbe Gayoso, V.V. Berdnikov, H. Bhatt, D.\n  Bhetuwal, M.M. Dalton, A. Deur, R. Dotel, C. Fanelli, J. Guo, T.J. Hague,\n  D.W. Higinbotham, N.D. Hoffman, P. Hurck, I. Jaegle, A. Karki, W. Li, V.\n  Lyubovitskij, H. Marukyan, M.D. McCaughan, M.E. McCracken, S. Oresic, Z.\n  Papandreou, C. Paudel, S. Ratliff, E.M. Seroka, S. Somov, I. Strakovsky, K.\n  Suresh, A. Thiel, and B. Zihlmann","title":"Search for axion-like particles through nuclear Primakoff production\n  using the GlueX detector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the results of the first search for the production of axion-like\nparticles (ALP) via Primakoff production on nuclear targets using the GlueX\ndetector. This search uses an integrated luminosity of 100\npb$^{-1}\\cdot$nucleon on a $^{12}$C target, and explores the mass region of 200\n< $m_a$ < 450 MeV via the decay $X\\rightarrow\\gamma\\gamma$. This mass range is\nbetween the $\\pi^0$ and $\\eta$ masses, which enables the use of the measured\n$\\eta$ production rate to obtain absolute bounds on the ALP production with\nreduced sensitivity to experimental luminosity and detection efficiency. We\nfind no evidence for an ALP, consistent with previous searches in the quoted\nmass range, and present limits on the coupling on the scale of $O$(1 TeV). We\nfurther find that the ALP production limit we obtain is hindered by the peaking\nstructure of the non-target-related dominant background in GlueX, which we\ntreat by using data on $^4$He to estimate and subtract these backgrounds. We\ncomment on how this search can be improved in a future higher-statistics\ndedicated measurement.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:27:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pybus","J. R.",""],["Kolar","T.",""],["Devkota","B.",""],["Sharp","P.",""],["Yu","B.",""],["Hen","O.",""],["Piasetzky","E.",""],["Santiesteban","S. N.",""],["Schmidt","A.",""],["Somov","A.",""],["Soreq","Y.",""],["Szumila-Vance","H.",""],["Akondi","C. S.",""],["Gayoso","C. Ayerbe",""],["Berdnikov","V. V.",""],["Bhatt","H.",""],["Bhetuwal","D.",""],["Dalton","M. M.",""],["Deur","A.",""],["Dotel","R.",""],["Fanelli","C.",""],["Guo","J.",""],["Hague","T. J.",""],["Higinbotham","D. W.",""],["Hoffman","N. D.",""],["Hurck","P.",""],["Jaegle","I.",""],["Karki","A.",""],["Li","W.",""],["Lyubovitskij","V.",""],["Marukyan","H.",""],["McCaughan","M. D.",""],["McCracken","M. E.",""],["Oresic","S.",""],["Papandreou","Z.",""],["Paudel","C.",""],["Ratliff","S.",""],["Seroka","E. M.",""],["Somov","S.",""],["Strakovsky","I.",""],["Suresh","K.",""],["Thiel","A.",""],["Zihlmann","B.",""]]}
{"id":"2308.06340","submitter":"Wei-Cheng Huang","authors":"Wei-Cheng Huang","title":"Tensor products of Drinfeld modules and convolutions of Goss $L$-series","comments":"arXiv admin note: substantial text overlap with arXiv:2206.14931","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Following the same framework of the special value results of convolutions of\nGoss and Pellarin $L$-series attached to Drinfeld modules that take values in\nTate algebras by Papanikolas and the author, we establish special value results\nof convolutions of two Goss $L$-series attached to Drinfeld modules that take\nvalues in ${\\mathbb{F}_q}(\\!(\\frac{1}{\\theta})\\!).$ Applying the class module\nformula of Fang to tensor products of two Drinfeld modules, we provide special\nvalue formulas for their $L$-functions. By way of the theory of Schur\npolynomials these identities take the form of specializations of convolutions\nof Rankin-Selberg type. Finally, we show an explicit computation of the\nregulators appearing in Fang's class module formula for tensor products as well\nas symmetric and alternating squares of Drinfeld modules.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:29:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Wei-Cheng",""]]}
{"id":"2308.06341","submitter":"Yifu Han","authors":"Yifu Han, Francois P. Hamon, Su Jiang, Louis J. Durlofsky","title":"Surrogate Model for Geological CO2 Storage and Its Use in MCMC-based\n  History Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep-learning-based surrogate models show great promise for use in geological\ncarbon storage operations. In this work we target an important application -\nthe history matching of storage systems characterized by a high degree of\n(prior) geological uncertainty. Toward this goal, we extend the recently\nintroduced recurrent R-U-Net surrogate model to treat geomodel realizations\ndrawn from a wide range of geological scenarios. These scenarios are defined by\na set of metaparameters, which include the mean and standard deviation of\nlog-permeability, permeability anisotropy ratio, horizontal correlation length,\netc. An infinite number of realizations can be generated for each set of\nmetaparameters, so the range of prior uncertainty is large. The surrogate model\nis trained with flow simulation results, generated using the open-source\nsimulator GEOS, for 2000 random realizations. The flow problems involve four\nwells, each injecting 1 Mt CO2/year, for 30 years. The trained surrogate model\nis shown to provide accurate predictions for new realizations over the full\nrange of geological scenarios, with median relative error of 1.3% in pressure\nand 4.5% in saturation. The surrogate model is incorporated into a Markov chain\nMonte Carlo history matching workflow, where the goal is to generate history\nmatched realizations and posterior estimates of the metaparameters. We show\nthat, using observed data from monitoring wells in synthetic `true' models,\ngeological uncertainty is reduced substantially. This leads to posterior 3D\npressure and saturation fields that display much closer agreement with the\ntrue-model responses than do prior predictions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:29:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Han","Yifu",""],["Hamon","Francois P.",""],["Jiang","Su",""],["Durlofsky","Louis J.",""]]}
{"id":"2308.06342","submitter":"Jaesung Tae","authors":"Jaesung Tae","title":"Mirror Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion models have successfully been applied to generative tasks in\nvarious continuous domains. However, applying diffusion to discrete categorical\ndata remains a non-trivial task. Moreover, generation in continuous domains\noften requires clipping in practice, which motivates the need for a theoretical\nframework for adapting diffusion to constrained domains. Inspired by the mirror\nLangevin algorithm for the constrained sampling problem, in this theoretical\nreport we propose Mirror Diffusion Models (MDMs). We demonstrate MDMs in the\ncontext of simplex diffusion and propose natural extensions to popular domains\nsuch as image and text generation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:31:54 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 03:21:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tae","Jaesung",""]]}
{"id":"2308.06343","submitter":"Ari Paavo Seitsonen","authors":"R. Vuilleumier, A. P. Seitsonen","title":"Vibrational spectroscopies in liquid water: on temperature and\n  coordination effects in Raman and infrared spectroscopies","comments":"15 pages, 7 figures, 5 tables","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33301","doi":"10.5488/CMP.26.33302","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Water is an ubiquitous liquid that has several exotic and anomalous\nproperties. Despite its apparent simple chemical formula, its capability of\nforming a dynamic network of hydrogen bonds leads to a rich variety of physics.\nHere we study the vibrations of water using molecular dynamics simulations,\nmainly concentrating on the Raman and infrared spectroscopic signatures. We\ninvestigate the consequences of the temperature on the vibrational frequencies,\nand we enter the details of the hydrogen bonding coordination by using\nrestrained simulations in order to gain quantitative insight on the dependence\nof the frequencies on the neighbouring molecules. Further we consider the\ndifferences due to the different methods of solving the electronic structure to\nevaluate the forces on the ions, and report results on the angular\ncorrelations, isotopic mixtures HOD in H$_2$O/D$_2$O and and the dielectric\nconstants in water.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:39:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vuilleumier","R.",""],["Seitsonen","A. P.",""]]}
{"id":"2308.06344","submitter":"Luis Enrique Gonzalez","authors":"D. J. Gonz\\'alez, L. E. Gonz\\'alez","title":"An ab initio study of the static, dynamic and electronic properties of\n  some liquid 5d transition metals near melting","comments":"20 pages, 19 figures, 5 tables","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33601","doi":"10.5488/CMP.26.33601","report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report a study on the static and dynamic properties of several liquid 5$d$\ntransition metals at thermodynamic conditions near their respective melting\npoints. This is performed by resorting to ab initio molecular dynamics\nsimulations in the framework of the density functional theory. Results are\npresented for the static structure factors and pair distribution functions;\nmoreover, the local short range order in the liquid metal is also analized. As\nfor the dynamical properties, both single-particle and collective properties\nare evaluated. The dynamical structure shows the propagating density\nfluctuations, and the respective dispersion relation is obtained. Results are\nalso obtained for the longitudinal and transverse current spectral functions\nalong with the associated dispersion of collective excitations. For some\nmetals, we found the existence of two branches of transverse collective\nexcitations in the region around the main peak of the structure factor.\nFinally, several transport coefficients are also calculated.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:50:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gonz\u00e1lez","D. J.",""],["Gonz\u00e1lez","L. E.",""]]}
{"id":"2308.06345","submitter":"Graham Bruce","authors":"T. Plaskocinski, Y. Arita, G. D. Bruce, S. Persheyev, K. Dholakia, A.\n  Di Falco and H. Ohadi","title":"Laser Writing of Parabolic Micromirrors with a High Numerical Aperture\n  for Optical Trapping and Rotation","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  On-chip optical trapping systems allow for high scalability and lower the\nbarrier to access. Systems capable of trapping multiple particles typically\ncome with high cost and complexity. Here we present a technique for making\nparabolic mirrors with micron-size dimensions and high numerical apertures\n(NA>1). Over 350 mirrors are made by simple CO2 laser ablation of glass\nfollowed by gold deposition. We fabricate mirrors of arbitrary diameter and\ndepth at a high throughput rate by carefully controlling the ablation\nparameters. We use the micromirrors for 3-dimensional optical trapping of\nmicrobeads in solution, achieving a maximum optical trap stiffness of 52\npN/{\\mu}m/W. We then further demonstrate the viability of the mirrors as\nin-situ optical elements through the rotation of a vaterite particle using\nreflected circularly polarized light. The method used allows for rapid and\nhighly customizable fabrication of dense optical arrays.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:51:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Plaskocinski","T.",""],["Arita","Y.",""],["Bruce","G. D.",""],["Persheyev","S.",""],["Dholakia","K.",""],["Di Falco","A.",""],["Ohadi","H.",""]]}
{"id":"2308.06346","submitter":"Alexander Krivchikov","authors":"M. S. Barabashko, A. I. Krivchikov, R. Basnukaeva, O. A. Korolyuk, A.\n  Je\\.zowski","title":"Proportional correlation between heat capacity and thermal expansion of\n  atomic, molecular crystals and carbon nanostructures","comments":"13 pages, 7 figures, 2 tables","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33602","doi":"10.5488/CMP.26.33602","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Correlation between thermal expansions $\\beta(T)$ and heat capacity $C(T)$ of\natomic and molecular crystals, amorphous materials with a structural disorder,\ncarbon nanomaterials (fullerite C$_{60}$, bundles SWCNTs of single-walled\ncarbon nanotubes) was analyzed. The influence of the contribution to the\ncoefficient of linear thermal expansion $\\alpha_\\textrm{Xe}(T)$ of Xe atoms\nadsorbed on the SWCNTs bundles is considered. The proportional correlation was\nfound between the contribution to the coefficient of linear thermal expansion\n$\\alpha_\\textrm{Xe}(T)$ and the normalized to the gas constant heat capacity\n$C_\\textrm{Xe}(T)/R$ of Xe atoms adsorbed on the SWCNTs bundles. The\nproportional correlation $(\\beta/\\beta^*) \\sim (C_\\textrm{V}/R)$ with the\nparameter $\\beta^*$ for the bulk thermal expansion coefficient for cryocrystals\nis proposed. In the case of atomic crystals such as Xe and Ar, the proportional\ncorrelation $(\\beta/\\beta^*) \\sim (C_\\textrm{V}/R)$ is observed in the\ntemperature range from the lowest experimental to temperatures where\n$C_\\textrm{V}/R \\approx 2.3$. The correlation is not observed in the\ntemperatures where $2.3<C_V/R<3$ (classical Dulong-Petit law). It was found\nthat the universal proportional correlation is also observed for molecular\ncrystals with linear symmetry, such as CO$_{2}$, CO, and N$_{2}$O if the\nnormalized heat capacity below the values $C_\\textrm{V}/R \\approx 3 \\div 3.5$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:58:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Barabashko","M. S.",""],["Krivchikov","A. I.",""],["Basnukaeva","R.",""],["Korolyuk","O. A.",""],["Je\u017cowski","A.",""]]}
{"id":"2308.06347","submitter":"Travis Maxfield","authors":"Travis Maxfield, Joshua Hochuli, James Wellnitz, Cleber Melo-Filho,\n  Konstantin I. Popov, Eugene Muratov, and Alex Tropsha","title":"The N-ary in the Coal Mine: Avoiding Mixture Model Failure with Proper\n  Validation","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modeling the properties of chemical mixtures is a difficult but important\npart of any modeling process intended to be applicable to the often messy and\nimpure phenomena of everyday life, including food and environmental safety,\nhealthcare, etc. Part of this difficulty stems from the increased complexity of\ndesigning suitable model validation schemes for mixture data, a fact which has\nbeen elucidated in previous work only in the case of binary mixture models. We\nextend these previously defined validation strategies for QSAR modeling of\nbinary mixtures to the more complex case of general, $N$-ary mixtures and argue\nthat these strategies are applicable to many modeling tasks beyond simple\nchemical mixtures. Additionally, we propose a method of establishing a baseline\nmodel performance for each mixture dataset to be in used in model selection\ncomparisons. This baseline is intended to account for the statistical\ndependence generically present between the properties of mixtures that share\nconstituents. We contend that without such a baseline, estimates of model\nperformance can be dramatically overestimated, and we demonstrate this with\nmultiple case studies using real and simulated data.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:00:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Maxfield","Travis",""],["Hochuli","Joshua",""],["Wellnitz","James",""],["Melo-Filho","Cleber",""],["Popov","Konstantin I.",""],["Muratov","Eugene",""],["Tropsha","Alex",""]]}
{"id":"2308.06348","submitter":"Austin Atsango","authors":"Austin O. Atsango, Tobias Morawietz, Ondrej Marsalek, and Thomas E.\n  Markland","title":"Developing machine-learned potentials to simultaneously capture the\n  dynamics of excess protons and hydroxide ions in classical and path integral\n  simulations","comments":null,"journal-ref":null,"doi":"10.1063/5.0162066","report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The transport of excess protons and hydroxide ions in water underlies\nnumerous important chemical and biological processes. Accurately simulating the\nassociated transport mechanisms ideally requires utilizing ab initio molecular\ndynamics simulations to model the bond breaking and formation involved in\nproton transfer and path-integral simulations to model the nuclear quantum\neffects relevant to light hydrogen atoms. These requirements result in a\nprohibitive computational cost, especially at the time and length scales needed\nto converge proton transport properties. Here, we present machine-learned\npotentials (MLPs) that can model both excess protons and hydroxide ions at the\ngeneralized gradient approximation and hybrid density functional theory levels\nof accuracy and use them to perform multiple nanoseconds of both classical and\npath-integral proton defect simulations at a fraction of the cost of the\ncorresponding ab initio simulations. We show that the MLPs are able to\nreproduce ab initio trends and converge properties such as the diffusion\ncoefficients of both excess protons and hydroxide ions. We use our\nmulti-nanosecond simulations, which allow us to monitor large numbers of proton\ntransfer events, to analyze the role of hypercoordination in the transport\nmechanism of the hydroxide ion and provide further evidence for the asymmetry\nin diffusion between excess protons and hydroxide ions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:01:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Atsango","Austin O.",""],["Morawietz","Tobias",""],["Marsalek","Ondrej",""],["Markland","Thomas E.",""]]}
{"id":"2308.06349","submitter":"Yang Li","authors":"Ning Chen, Yang Liu, and Yang Li","title":"Statistical Material Law Support for Room Temperature Superconductivity\n  in the Lead Apatite System","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Quantum mechanics calculations of an electronic orbital coupling distribution\nof the new possible Room Temperature (RT) system of lead apatite Pb10(PO4)6O\nsystem show that the complex orbital coupling characteristics of the new system\nare similar to those of copper oxide and with multiple orbital interactions.\nThe overall bandwidth is significantly larger than the current largest copper\noxide system, which can also be compared to near RT high-pressure hydride\nsystems. By applying a material dependence law relating overall bandwidth to\nsuperconducting critical temperature across various typical superconducting\nsystems, we predict that the electronic structure of the new material can\nsupport achieving RT superconductivity in the condition of a flatter band.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:01:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Ning",""],["Liu","Yang",""],["Li","Yang",""]]}
{"id":"2308.06350","submitter":"Prof. J.-F. Wax","authors":"J.-F. Wax, N. Jakse","title":"On the existence of a second branch of transverse collective excitations\n  in liquid metals","comments":"8 pages, 6 figures, 1 table","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33603","doi":"10.5488/CMP.26.33603","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It was found recently that the liquid dynamics of several metals (Li, Zn, Ni,\nFe, Tl, Pb) under pressure is characterized by transverse spectral functions\ncontaining an additional high-frequency peak. To rationalize the pressure\ndependence of the contributions from different propagating processes to\ntransverse spectral functions in liquid metals, ab initio molecular dynamics\nsimulations were performed for two typical liquid metals (Na and Al) in a wide\nrange of pressures. The influence of density/pressure is investigated for Na by\nconsidering four pressures ranging from 15 to 147 GPa, while the temperature\ninfluence is considered for Al between 600 K in the deep supercooled liquid up\nto 1700 K well above the melting point at ambient pressure. Both temperature\nand density dependence of the spectra of collective excitations are analyzed\nwith a focus on the appearance of a second high-frequency mode in the\ntransverse spectra. A correspondence between spectra of transverse collective\nexcitations and the peak positions of the Fourier-spectra of velocity\nautocorrelation functions (vibrational density of states) is found.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:03:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wax","J. -F.",""],["Jakse","N.",""]]}
{"id":"2308.06351","submitter":"Samuel Ubellacker","authors":"Samuel Ubellacker, Aaron Ray, James Bern, Jared Strader, Luca Carlone","title":"Aggressive Aerial Grasping using a Soft Drone with Onboard Perception","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contrary to the stunning feats observed in birds of prey, aerial manipulation\nand grasping with flying robots still lack versatility and agility.\nConventional approaches using rigid manipulators require precise positioning\nand are subject to large reaction forces at grasp, which limit performance at\nhigh speeds. The few reported examples of aggressive aerial grasping rely on\nmotion capture systems, or fail to generalize across environments and grasp\ntargets. We describe the first example of a soft aerial manipulator equipped\nwith a fully onboard perception pipeline, capable of robustly localizing and\ngrasping visually and morphologically varied objects. The proposed system\nfeatures a novel passively closing tendon-actuated soft gripper that enables\nfast closure at grasp, while compensating for position errors, complying to the\ntarget-object morphology, and dampening reaction forces. The system includes an\nonboard perception pipeline that combines a neural-network-based semantic\nkeypoint detector with a state-of-the-art robust 3D object pose estimator,\nwhose estimate is further refined using a fixed-lag smoother. The resulting\npose estimate is passed to a minimum-snap trajectory planner, tracked by an\nadaptive controller that fully compensates for the added mass of the grasped\nobject. Finally, a finite-element-based controller determines optimal gripper\nconfigurations for grasping. Rigorous experiments confirm that our approach\nenables dynamic, aggressive, and versatile grasping. We demonstrate fully\nonboard vision-based grasps of a variety of objects, in both indoor and outdoor\nenvironments, and up to speeds of 2.0 m/s -- the fastest vision-based grasp\nreported in the literature. Finally, we take a major step in expanding the\nutility of our platform beyond stationary targets, by demonstrating\nmotion-capture-based grasps of targets moving up to 0.3 m/s, with relative\nspeeds up to 1.5 m/s.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:06:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ubellacker","Samuel",""],["Ray","Aaron",""],["Bern","James",""],["Strader","Jared",""],["Carlone","Luca",""]]}
{"id":"2308.06352","submitter":"Chenqiu Zhao","authors":"Chenqiu Zhao, Guanfang Dong, Anup Basu","title":"Learning Distributions via Monte-Carlo Marginalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose a novel method to learn intractable distributions from their\nsamples. The main idea is to use a parametric distribution model, such as a\nGaussian Mixture Model (GMM), to approximate intractable distributions by\nminimizing the KL-divergence. Based on this idea, there are two challenges that\nneed to be addressed. First, the computational complexity of KL-divergence is\nunacceptable when the dimensions of distributions increases. The Monte-Carlo\nMarginalization (MCMarg) is proposed to address this issue. The second\nchallenge is the differentiability of the optimization process, since the\ntarget distribution is intractable. We handle this problem by using Kernel\nDensity Estimation (KDE). The proposed approach is a powerful tool to learn\ncomplex distributions and the entire process is differentiable. Thus, it can be\na better substitute of the variational inference in variational auto-encoders\n(VAE). One strong evidence of the benefit of our method is that the\ndistributions learned by the proposed approach can generate better images even\nbased on a pre-trained VAE's decoder. Based on this point, we devise a\ndistribution learning auto-encoder which is better than VAE under the same\nnetwork architecture. Experiments on standard dataset and synthetic data\ndemonstrate the efficiency of the proposed approach.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:08:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Chenqiu",""],["Dong","Guanfang",""],["Basu","Anup",""]]}
{"id":"2308.06353","submitter":"Orest Pizio","authors":"T. Patsahan, O. Pizio","title":"Aspects of the microscopic structure of curcumin solutions with\n  water-dimethylsulfoxide solvent. Molecular dynamics computer simulation study","comments":"15 pages, 14 figures","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33605","doi":"10.5488/CMP.26.33605","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore some aspects of the microscopic structure of curcumin solutions\nwith water-dimethylsulfoxide solvent of variable composition. Molecular\ndynamics computer simulations at isobaric-isothermal conditions are used for\nthis purpose. The model consists of the OPLS-UA type model for the enol\nconformer of curcumin (J. Mol. Liq., 223, 707, 2016), the OPLS model for the\ndimethylsulfoxide (DMSO) and the SPC/E water model. Radial distributions for\nthe centers of mass of curcumin molecules are evaluated and the corresponding\nrunning coordination numbers are analyzed. The disaggregation of curcumin\nclusters upon increasing the DMSO content in water-DMSO solvent is elucidated.\nChanges of the distribution of water and DMSO species around curcumin molecules\nare investigated. A qualitative comparison of our findings with the results of\nother authors is performed. A possibility to relate predictions of the model\nwith the experimental observations in terms of the so-called critical\nwateraggregation percentage is discussed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:10:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Patsahan","T.",""],["Pizio","O.",""]]}
{"id":"2308.06354","submitter":"Shan Chen","authors":"Marco Guevara, Shan Chen, Spencer Thomas, Tafadzwa L. Chaunzwa, Idalid\n  Franco, Benjamin Kann, Shalini Moningi, Jack Qian, Madeleine Goldstein, Susan\n  Harper, Hugo JWL Aerts, Guergana K. Savova, Raymond H. Mak, Danielle S.\n  Bitterman","title":"Large Language Models to Identify Social Determinants of Health in\n  Electronic Health Records","comments":"38 pages, 5 figures, 5 tables in main, submitted for review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Social determinants of health (SDoH) have an important impact on patient\noutcomes but are incompletely collected from the electronic health records\n(EHR). This study researched the ability of large language models to extract\nSDoH from free text in EHRs, where they are most commonly documented, and\nexplored the role of synthetic clinical text for improving the extraction of\nthese scarcely documented, yet extremely valuable, clinical data. 800 patient\nnotes were annotated for SDoH categories, and several transformer-based models\nwere evaluated. The study also experimented with synthetic data generation and\nassessed for algorithmic bias. Our best-performing models were fine-tuned\nFlan-T5 XL (macro-F1 0.71) for any SDoH, and Flan-T5 XXL (macro-F1 0.70). The\nbenefit of augmenting fine-tuning with synthetic data varied across model\narchitecture and size, with smaller Flan-T5 models (base and large) showing the\ngreatest improvements in performance (delta F1 +0.12 to +0.23). Model\nperformance was similar on the in-hospital system dataset but worse on the\nMIMIC-III dataset. Our best-performing fine-tuned models outperformed zero- and\nfew-shot performance of ChatGPT-family models for both tasks. These fine-tuned\nmodels were less likely than ChatGPT to change their prediction when\nrace/ethnicity and gender descriptors were added to the text, suggesting less\nalgorithmic bias (p<0.05). At the patient-level, our models identified 93.8% of\npatients with adverse SDoH, while ICD-10 codes captured 2.0%. Our method can\neffectively extracted SDoH information from clinic notes, performing better\ncompare to GPT zero- and few-shot settings. These models could enhance\nreal-world evidence on SDoH and aid in identifying patients needing social\nsupport.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:18:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Guevara","Marco",""],["Chen","Shan",""],["Thomas","Spencer",""],["Chaunzwa","Tafadzwa L.",""],["Franco","Idalid",""],["Kann","Benjamin",""],["Moningi","Shalini",""],["Qian","Jack",""],["Goldstein","Madeleine",""],["Harper","Susan",""],["Aerts","Hugo JWL",""],["Savova","Guergana K.",""],["Mak","Raymond H.",""],["Bitterman","Danielle S.",""]]}
{"id":"2308.06355","submitter":"Anthony Douglas J Haymet","authors":"A. D. J. Haymet","title":"How should a small country respond to climate change?","comments":"4 pages, 3 figures","journal-ref":"Condensed Matter Physics, 2023, vol. 26, No. 3, 33901","doi":"10.5488/CMP.26.33901","report-no":null,"categories":"physics.ao-ph physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Responses to the global climate crisis often focus on the largest current\nemitters of greenhouse gases. However, analysis shows that about a third of\nemissions come from a collection of small emitters, each contributing one- to\ntwo-percent of the total additional CO$_2$ injected into the communal\natmosphere. Attempts to hold global warming to less than 1.5\\textcelsius~\ncannot succeed without also reducing emissions from these small countries.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:19:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Haymet","A. D. J.",""]]}
{"id":"2308.06356","submitter":"Maxime Zavidovique","authors":"Maxime Zavidovique","title":"Discrete and Continuous Weak KAM Theory: an introduction through\n  examples and its applications to twist maps","comments":"166 pages, 7 figures. Extracted from the author's habilitation (HDR).\n  Intended to be published as a pedagogical book","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of these notes is to present a self contained account of discrete\nweak KAM theory. Put aside the intrinsic elegance of this theory, it is also a\ntoy model for classical weak KAM theory, where many technical difficulties\ndisappear, but where central ideas and results persist. It can therefore serve\nas a good introduction to (continuous) weak KAM theory. After a general\nexposition of the general abstract theory, several examples are studied. The\nlast section is devoted to the historical problem of conservative twist maps of\nthe annulus.\n  At the end of the first three Chapters, the relations between the results\nproved in the discrete setting and the analogous theorems of classical weak KAM\ntheory are discussed. Some key differences are also highlighted between the\ndiscrete and classical theory. Those results are new. The text also contains\nother results never published before, such as the convergence of solutions of\ndiscounted equations for degenerate perturbations.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:20:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zavidovique","Maxime",""]]}
{"id":"2308.06357","submitter":"Mariana Smit Vega Garcia","authors":"Mark Allen and Mariana Smit Vega Garcia","title":"Two-phase almost minimizers for a fractional free boundary problem","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 study almost minimizers to a fractional\nAlt-Caffarelli-Friedman type functional. Our main results concern the optimal\n$C^{0,s}$ regularity of almost minimizers as well as the structure of the free\nboundary. We first prove that the two free boundaries\n$F^+(u)=\\partial\\{u(\\cdot,0)>0\\}$ and $F^-(u)=\\partial\\{u(\\cdot,0)<0\\}$ cannot\ntouch, that is, $F^+(u)\\cap F^-(u)=\\emptyset$. Lastly, we prove a flatness\nimplies $C^{1,\\gamma}$ result for the free boundary.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:24:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Allen","Mark",""],["Garcia","Mariana Smit Vega",""]]}
{"id":"2308.06358","submitter":"Yumeng Xue","authors":"Luyu Cheng, Bairui Su, Yumeng Xue, Xiaoyu Liu, Yunhai Wang","title":"CA2: Cyber Attacks Analytics","comments":"IEEE Conference on Visual Analytics Science and Technology (VAST)\n  Challenge Workshop 2020","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The VAST Challenge 2020 Mini-Challenge 1 requires participants to identify\nthe responsible white hat groups behind a fictional Internet outage. To address\nthis task, we have created a visual analytics system named CA2: Cyber Attacks\nAnalytics. This system is designed to efficiently compare and match subgraphs\nwithin an extensive graph containing anonymized profiles. Additionally, we\nshowcase an iterative workflow that utilizes our system's capabilities to\npinpoint the responsible group.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:27:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheng","Luyu",""],["Su","Bairui",""],["Xue","Yumeng",""],["Liu","Xiaoyu",""],["Wang","Yunhai",""]]}
{"id":"2308.06359","submitter":"Matthew Kroesche","authors":"Matthew Kroesche","title":"Low-Lying Zeros of a Thin Family of Automorphic $L$-Functions in the\n  Level Aspect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate the one-level density of thin subfamilies of a family of Hecke\ncuspforms formed by twisting the forms in a smaller family by a character. The\nresult gives support up to 1, conditional on GRH, and we also find several of\nthe lower-order main terms. In addition, we find an unconditional result that\nhas only slightly lower support. A crucial step in doing so is the\nestablishment of an on-average version of the Weil bound that applies to\ntwisted Kloosterman sums. Moreover, we average over these thin subfamilies by\nrunning over the characters in a coset, and observe that any amount of\naveraging at all is enough to allow us to get support greater than 1 and thus\ndistinguish between the SO(even) and SO(odd) symmetry types. Finally, we also\napply our results to nonvanishing problems for the families studied.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:33:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kroesche","Matthew",""]]}
{"id":"2308.06360","submitter":"Manas Sajjan","authors":"Manas Sajjan, Rishabh Gupta, Sumit Suresh Kale, Vinit Singh, Keerthi\n  Kumaran, and Sabre Kais","title":"Physics inspired quantum simulation of resonating valence bond states --\n  a prototypical template for a spin-liquid ground state","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spin-liquids -- an emergent, exotic collective phase of matter -- have\ngarnered enormous attention in recent years. While experimentally, many\nprospective candidates have been proposed and realized, theoretically modeling\nreal materials that display such behavior may pose serious challenges due to\nthe inherently high correlation content of emergent phases. Over the last few\ndecades, the second-quantum revolution has been the harbinger of a novel\ncomputational paradigm capable of initiating a foundational evolution in\ncomputational physics. In this report, we strive to use the power of the latter\nto study a prototypical model -- a spin-$\\frac{1}{2}$-unit cell of a Kagome\nanti-ferromagnet. Extended lattices of such unit cells are known to possess a\nmagnetically disordered spin-liquid ground state. We employ robust classical\nnumerical techniques like Density-Matrix Renormalization Group (DMRG) to\nidentify the nature of the ground state through a matrix-product state (MPS)\nformulation. We subsequently use the gained insight to construct an auxillary\nhamiltonian with reduced measurables and also design an ansatz that is modular\nand gate efficient. With robust error-mitigation strategies, we are able to\ndemonstrate that the said ansatz is capable of accurately representing the\ntarget ground state even on a real IBMQ backend within $1\\%$ accuracy in\nenergy. Since the protocol is linearly scaling $O(n)$ in the number of unit\ncells, gate requirements, and the number of measurements, it is\nstraightforwardly extendable to larger Kagome lattices which can pave the way\nfor efficient construction of spin-liquid ground states on a quantum device.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:34:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sajjan","Manas",""],["Gupta","Rishabh",""],["Kale","Sumit Suresh",""],["Singh","Vinit",""],["Kumaran","Keerthi",""],["Kais","Sabre",""]]}
{"id":"2308.06361","submitter":"Thibault Chervy","authors":"Jenny Hu, Etienne Lorchat, Xueqi Chen, Kenji Watanabe, Takashi\n  Taniguchi, Tony F. Heinz, Puneet A. Murthy, Thibault Chervy","title":"Quantum control of exciton wavefunctions in 2D semiconductors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Excitons -- bound electron-hole pairs -- play a central role in light-matter\ninteraction phenomena, and are crucial for wide-ranging applications from light\nharvesting and generation to quantum information processing. A long-standing\nchallenge in solid-state optics has been to achieve precise and scalable\ncontrol over the quantum mechanical state of excitons in semiconductor\nheterostructures. Here, we demonstrate a technique for creating tailored and\ntunable potential landscapes for optically active excitons in 2D semiconductors\nthat enables in-situ wavefunction shaping at the nanoscopic lengthscale. Using\nnanostructured gate electrodes, we create localized electrostatic traps for\nexcitons in diverse geometries such as quantum dots and rings, and arrays\nthereof. We show independent spectral tuning of multiple spatially separated\nquantum dots, which allows us to bring them to degeneracy despite material\ndisorder. Owing to the strong light-matter coupling of excitons in 2D\nsemiconductors, we observe unambiguous signatures of confined exciton\nwavefunctions in optical reflection and photoluminescence measurements. Our\nwork introduces a new approach to engineering exciton dynamics and interactions\nat the nanometer scale, with implications for novel optoelectronic devices,\ntopological photonics, and many-body quantum nonlinear optics.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:47:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Jenny",""],["Lorchat","Etienne",""],["Chen","Xueqi",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Heinz","Tony F.",""],["Murthy","Puneet A.",""],["Chervy","Thibault",""]]}
{"id":"2308.06362","submitter":"Marshall King","authors":"Gregory Berkolaiko, Denis I. Borisov, Marshall King","title":"Exotic eigenvalues and analytic resolvent for a graph with a shrinking\n  edge","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a metric graph consisting of two edges, one of which has length\n$\\varepsilon$ which we send to zero. On this graph we study the resolvent and\nspectrum of the Laplacian subject to a general vertex condition at the\nconnecting vertex. Despite the singular nature of the perturbation (by a short\nedge), we find that the resolvent depends analytically on the parameter\n$\\varepsilon$. In contrast, the negative eigenvalues escape to minus infinity\nat rates that could be fractional, namely, $\\varepsilon^0$,\n$\\varepsilon^{-2/3}$ or $\\varepsilon^{-1}$. These rates take place when the\ncorresponding eigenfunction localizes, respectively, only on the long edge, on\nboth edges, or only on the short edge.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:51:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Berkolaiko","Gregory",""],["Borisov","Denis I.",""],["King","Marshall",""]]}
{"id":"2308.06363","submitter":"Mahouton    Norbert Hounkonnou","authors":"Mahouton Norbert Hounkonnou, Francis Atta Howard and Kinvi Kangni","title":"Particles and $p-$adic integrals of Spin$\\left(\\frac{1}{2}\\right)$: spin\n  Lie group, $\\mathcal{R}(\\rho,q)-$gamma and $\\mathcal{R}(\\rho,q)-$ beta\n  functions, ghost and applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we address the $p$-adic analogues of the fermion spin Lie\nalgebras and Lie groups. We consider the extension of the fermion spin Lie\ngroups and Lie algebras to the $p-$adic Lie groups and investigate the way to\nextend their integral to the zeta function as well. We show that their groups\nare ghost friendly. In addition, we develop the $\\mathcal{R}(p,q)-$deformed\ncalculus for the Bernoulli, Volkenborn, Euler and Genocchi polynomials, and\nestablish related definitions. Finally, we perform a $p-$adic generalization of\nbeta and gamma functions and exhibit some physical applications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 14:17:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hounkonnou","Mahouton Norbert",""],["Howard","Francis Atta",""],["Kangni","Kinvi",""]]}
{"id":"2308.06364","submitter":"Edward Zhu","authors":"Edward Zhu","title":"On the representation of N by the powers of the golden mean and\n  Zeckendorf theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  It is well known that every positive integer N can be written as the sum of\nnon-consecutive powers of the golden ratio. We prove that the non-positive\npowers, together with the parity of the first positive power, can determine the\npositive integer. We give an explicit formula for N in terms of the above\ninformation.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 11:31:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Edward",""]]}
{"id":"2308.06365","submitter":"Ron Nielsen","authors":"Ron W Nielsen","title":"Towards a better understanding of the Anthropocene","comments":"20 pages, 18 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  (1) Results of analysis of new sets of anthropogenic data are presented. They\nconfirm earlier results of similar analyses. The expected and inevitable\nmassive deceleration of human-induced global change process is demonstrated as\nan ongoing phenomenon. Human activities and impacts on the Earth System, while\nin general remaining strong, are now systematically slowing down. (2) It is now\nclearly stated, by supporters of the concept of the Great Acceleration, that\nthe so-called Great Acceleration is not acceleration and that this term is open\nto misinterpretation. (3) There was no systematic sharp increase in\nanthropogenic growth trajectories around 1950 CE (Common Era) or around any\nother recent time. (4) Close inspection of data suggests that the Anthropocene\nis not a geological epoch, but a historical event, also reflected as a\ngeological event. (5) The Anthropocene has no convincingly determinable\nbeginning. What is described as the Anthropocene appears to be an integral part\nof a long process transcending the Pleistocene and Holocene epochs, a natural\ncontinuation of the past developments of human interaction with nature. (6)\nUsing the concept of the Jinji unconformity, the embryonic beginning of human\n(hominid) interaction with the environment could be placed at the time of the\nfirst use of stone tools millions of years ago. Gradually the intensity of this\ninteraction was increasing and culminated monotonically in an event described\nas the Anthropocene.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:33:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nielsen","Ron W",""]]}
{"id":"2308.06367","submitter":"Muhammad Asjad","authors":"M. Amazioug, D. S. Dutykh, B. Teklu and M. Asjad","title":"Achieving Strong Magnon Blockade through Magnon Squeezing in a Cavity\n  Magnetomechanical System","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a scheme to achieve magnon (photon) blockade by using magnon\nsqueezing within a cavity magnomechanical system under weak pump driving. Under\nideal conditions, we observe a substantial magnon blockade effect, as well as\nsimultaneous photon blockade. Moreover, both numerical and analytical results\nmatch perfectly, providing robust evidence of consistency. In addition to\ncalculating optimal parametric gain and detuning values, we can improve the\nsecond-order correlation function. The proposed scheme will be a pioneering\napproach towards magnon (photon) blockade in experimental cavity\nmagnomechanical systems.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:03:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Amazioug","M.",""],["Dutykh","D. S.",""],["Teklu","B.",""],["Asjad","M.",""]]}
{"id":"2308.06368","submitter":"Razvan Bunescu","authors":"Tonmoy Hasan and Razvan Bunescu","title":"Topic-Level Bayesian Surprise and Serendipity for Recommender Systems","comments":null,"journal-ref":null,"doi":"10.1145/3604915.3608851","report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  A recommender system that optimizes its recommendations solely to fit a\nuser's history of ratings for consumed items can create a filter bubble,\nwherein the user does not get to experience items from novel, unseen\ncategories. One approach to mitigate this undesired behavior is to recommend\nitems with high potential for serendipity, namely surprising items that are\nlikely to be highly rated. In this paper, we propose a content-based\nformulation of serendipity that is rooted in Bayesian surprise and use it to\nmeasure the serendipity of items after they are consumed and rated by the user.\nWhen coupled with a collaborative-filtering component that identifies similar\nusers, this enables recommending items with high potential for serendipity. To\nfacilitate the evaluation of topic-level models for surprise and serendipity,\nwe introduce a dataset of book reading histories extracted from Goodreads,\ncontaining over 26 thousand users and close to 1.3 million books, where we\nmanually annotate 449 books read by 4 users in terms of their time-dependent,\ntopic-level surprise. Experimental evaluations show that models that use\nBayesian surprise correlate much better with the manual annotations of\ntopic-level surprise than distance-based heuristics, and also obtain better\nserendipitous item recommendation performance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:05:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hasan","Tonmoy",""],["Bunescu","Razvan",""]]}
{"id":"2308.06369","submitter":"Joceline Lega","authors":"Nicholas Ercolani, Joceline Lega, Brandon Tippings","title":"Map enumeration from a dynamical perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.CO math.DS math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This contribution summarizes recent work of the authors that combines methods\nfrom dynamical systems theory (discrete Painlev\\'e equations) and asymptotic\nanalysis of orthogonal polynomial recurrences, to address long-standing\nquestions in map enumeration. Given a genus $g$, we present a framework that\nprovides the generating function for the number of maps that can be realized on\na surface of that genus. In the case of 4-valent maps, our methodology leads to\nexplicit expressions for map counts. For general even or mixed valence, the\nnumber of vertices of the map specifies the relevant order of the derivatives\nof the generating function that needs to be considered. Beyond summarizing our\nown results, we provide context for the program highlighted in this article\nthrough a brief review of the literature describing advances in map\nenumeration. In addition, we discuss open problems and challenges related to\nthis fascinating area of research that stands at the intersection of\nstatistical physics, random matrices, orthogonal polynomials, and discrete\ndynamical systems theory.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:05:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ercolani","Nicholas",""],["Lega","Joceline",""],["Tippings","Brandon",""]]}
{"id":"2308.06371","submitter":"Alphan Sahin","authors":"Alphan Sahin","title":"Wireless Federated $k$-Means Clustering with Non-coherent Over-the-Air\n  Computation","comments":"This work has been accepted for presentation at IEEE MILCOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we propose using an over-the-air computation (OAC) scheme for\nthe federated k-means clustering algorithm to reduce the per-round\ncommunication latency when it is implemented over a wireless network. The OAC\nscheme relies on an encoder exploiting the representation of a number in a\nbalanced number system and computes the sum of the updates for the federated\nk-means via signal superposition property of wireless multiple-access channels\nnon-coherently to eliminate the need for precise phase and time\nsynchronization. Also, a reinitialization method for ineffectively used\ncentroids is proposed to improve the performance of the proposed method for\nheterogeneous data distribution. For a customer-location clustering scenario,\nwe demonstrate the performance of the proposed algorithm and compare it with\nthe standard k-means clustering. Our results show that the proposed approach\nperforms similarly to the standard k-means while reducing communication\nlatency.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:12:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sahin","Alphan",""]]}
{"id":"2308.06372","submitter":"Alphan Sahin","authors":"Alphan Sahin, Xiaofeng Wang","title":"Majority Vote Computation With Complementary Sequences for Distributed\n  UAV Guidance","comments":"This work has been accepted for presentation at IEEE MILCOM 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 study introduces a novel non-coherent over-the-air computation (OAC)\nscheme aimed at achieving reliable majority vote (MV) calculations in fading\nchannels. The proposed approach relies on modulating the amplitude of the\nelements of complementary sequences (CSs) based on the sign of the parameters\nto be aggregated. Notably, our method eliminates the reliance on channel state\ninformation at the nodes, rendering it compatible with time-varying channels.\nTo demonstrate the efficacy of our approach, we employ it in a scenario where\nan unmanned aerial vehicle (UAV) is guided by distributed sensors, relying on\nthe MV computed using our proposed scheme. The experimental results confirm the\nsuperiority of our approach, as evidenced by a significant reduction in\ncomputation error rates in fading channels, particularly with longer sequence\nlengths. Meanwhile, we ensure that the peak-to-mean-envelope power ratio of the\ntransmitted orthogonal frequency division multiplexing signals remains within\nor below 3 dB.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:12:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sahin","Alphan",""],["Wang","Xiaofeng",""]]}
{"id":"2308.06374","submitter":"Simon Razniewski","authors":"Jeff Z. Pan, Simon Razniewski, Jan-Christoph Kalo, Sneha Singhania,\n  Jiaoyan Chen, Stefan Dietze, Hajira Jabeen, Janna Omeliyanenko, Wen Zhang,\n  Matteo Lissandrini, Russa Biswas, Gerard de Melo, Angela Bonifati, Edlira\n  Vakaj, Mauro Dragoni, Damien Graux","title":"Large Language Models and Knowledge Graphs: Opportunities and Challenges","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have taken Knowledge Representation -- and the\nworld -- by storm. This inflection point marks a shift from explicit knowledge\nrepresentation to a renewed focus on the hybrid representation of both explicit\nknowledge and parametric knowledge. In this position paper, we will discuss\nsome of the common debate points within the community on LLMs (parametric\nknowledge) and Knowledge Graphs (explicit knowledge) and speculate on\nopportunities and visions that the renewed focus brings, as well as related\nresearch topics and challenges.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:16:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pan","Jeff Z.",""],["Razniewski","Simon",""],["Kalo","Jan-Christoph",""],["Singhania","Sneha",""],["Chen","Jiaoyan",""],["Dietze","Stefan",""],["Jabeen","Hajira",""],["Omeliyanenko","Janna",""],["Zhang","Wen",""],["Lissandrini","Matteo",""],["Biswas","Russa",""],["de Melo","Gerard",""],["Bonifati","Angela",""],["Vakaj","Edlira",""],["Dragoni","Mauro",""],["Graux","Damien",""]]}
{"id":"2308.06375","submitter":"Jiwoong Im","authors":"Daniel Jiwoong Im, Alexander Kondratskiy, Vincent Harvey, Hsuan-Wei Fu","title":"UAMM: UBET Automated Market Maker","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CE q-fin.CP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Automated market makers (AMMs) are pricing mechanisms utilized by\ndecentralized exchanges (DEX). Traditional AMM approaches are constrained by\npricing solely based on their own liquidity pool, without consideration of\nexternal markets or risk management for liquidity providers. In this paper, we\npropose a new approach known as UBET AMM (UAMM), which calculates prices by\nconsidering external market prices and the impermanent loss of the liquidity\npool. Despite relying on external market prices, our method maintains the\ndesired properties of a constant product curve when computing slippages. The\nkey element of UAMM is determining the appropriate slippage amount based on the\ndesired target balance, which encourages the liquidity pool to minimize\nimpermanent loss. We demonstrate that our approach eliminates arbitrage\nopportunities when external market prices are efficient.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:17:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Im","Daniel Jiwoong",""],["Kondratskiy","Alexander",""],["Harvey","Vincent",""],["Fu","Hsuan-Wei",""]]}
{"id":"2308.06376","submitter":"Hamed Hojatian","authors":"Hamed Hojatian, Zoubeir Mlika, J\\'er\\'emy Nadal, Jean-Fran\\c{c}ois\n  Frigon, Fran\\c{c}ois Leduc-Primeau","title":"Learning Energy-Efficient Hardware Configurations for Massive MIMO\n  Beamforming","comments":"This preprint comprises 15 pages and features 15 figures. Copyright\n  may be transferred without notice","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hybrid beamforming (HBF) and antenna selection are promising techniques for\nimproving the energy efficiency~(EE) of massive multiple-input\nmultiple-output~(mMIMO) systems. However, the transmitter architecture may\ncontain several parameters that need to be optimized, such as the power\nallocated to the antennas and the connections between the antennas and the\nradio frequency chains. Therefore, finding the optimal transmitter architecture\nrequires solving a non-convex mixed integer problem in a large search space. In\nthis paper, we consider the problem of maximizing the EE of fully digital\nprecoder~(FDP) and hybrid beamforming~(HBF) transmitters. First, we propose an\nenergy model for different beamforming structures. Then, based on the proposed\nenergy model, we develop an unsupervised deep learning method to maximize the\nEE by designing the transmitter configuration for FDP and HBF. The proposed\ndeep neural networks can provide different trade-offs between spectral\nefficiency and energy consumption while adapting to different numbers of active\nusers. Finally, to ensure that the proposed method can be implemented in\npractice, we investigate the ability of the model to be trained exclusively\nusing imperfect channel state information~(CSI), both for the input to the deep\nlearning model and for the calculation of the loss function. Simulation results\nshow that the proposed solutions can outperform conventional methods in terms\nof EE while being trained with imperfect CSI. Furthermore, we show that the\nproposed solutions are less complex and more robust to noise than conventional\nmethods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:19:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hojatian","Hamed",""],["Mlika","Zoubeir",""],["Nadal","J\u00e9r\u00e9my",""],["Frigon","Jean-Fran\u00e7ois",""],["Leduc-Primeau","Fran\u00e7ois",""]]}
{"id":"2308.06377","submitter":"Hao Li","authors":"Hao Li, Han Liu, Dewei Hu, Xing Yao, Jiacheng Wang, Ipek Oguz","title":"CATS v2: Hybrid encoders for robust medical segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Convolutional Neural Networks (CNNs) have exhibited strong performance in\nmedical image segmentation tasks by capturing high-level (local) information,\nsuch as edges and textures. However, due to the limited field of view of\nconvolution kernel, it is hard for CNNs to fully represent global information.\nRecently, transformers have shown good performance for medical image\nsegmentation due to their ability to better model long-range dependencies.\nNevertheless, transformers struggle to capture high-level spatial features as\neffectively as CNNs. A good segmentation model should learn a better\nrepresentation from local and global features to be both precise and\nsemantically accurate. In our previous work, we proposed CATS, which is a\nU-shaped segmentation network augmented with transformer encoder. In this work,\nwe further extend this model and propose CATS v2 with hybrid encoders.\nSpecifically, hybrid encoders consist of a CNN-based encoder path paralleled to\na transformer path with a shifted window, which better leverage both local and\nglobal information to produce robust 3D medical image segmentation. We fuse the\ninformation from the convolutional encoder and the transformer at the skip\nconnections of different resolutions to form the final segmentation. The\nproposed method is evaluated on two public challenge datasets: Cross-Modality\nDomain Adaptation (CrossMoDA) and task 5 of Medical Segmentation Decathlon\n(MSD-5), to segment vestibular schwannoma (VS) and prostate, respectively.\nCompared with the state-of-the-art methods, our approach demonstrates superior\nperformance in terms of higher Dice scores.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:21:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Hao",""],["Liu","Han",""],["Hu","Dewei",""],["Yao","Xing",""],["Wang","Jiacheng",""],["Oguz","Ipek",""]]}
{"id":"2308.06378","submitter":"Mojtaba Yeganejou","authors":"Mojtaba Yeganejou, Kimia Honari, Ryan Kluzinski, Scott Dick, Michael\n  Lipsett, James Miller","title":"DCNFIS: Deep Convolutional Neuro-Fuzzy Inference System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A key challenge in eXplainable Artificial Intelligence is the well-known\ntradeoff between the transparency of an algorithm (i.e., how easily a human can\ndirectly understand the algorithm, as opposed to receiving a post-hoc\nexplanation), and its accuracy. We report on the design of a new deep network\nthat achieves improved transparency without sacrificing accuracy. We design a\ndeep convolutional neuro-fuzzy inference system (DCNFIS) by hybridizing fuzzy\nlogic and deep learning models and show that DCNFIS performs as accurately as\nthree existing convolutional neural networks on four well-known datasets. We\nfurthermore that DCNFIS outperforms state-of-the-art deep fuzzy systems. We\nthen exploit the transparency of fuzzy logic by deriving explanations, in the\nform of saliency maps, from the fuzzy rules encoded in DCNFIS. We investigate\nthe properties of these explanations in greater depth using the Fashion-MNIST\ndataset.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:32:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yeganejou","Mojtaba",""],["Honari","Kimia",""],["Kluzinski","Ryan",""],["Dick","Scott",""],["Lipsett","Michael",""],["Miller","James",""]]}
{"id":"2308.06379","submitter":"Andreas Nygaard MSc","authors":"Andreas Nygaard, Emil Brinch Holm, Steen Hannestad, and Thomas Tram","title":"Fast and effortless computation of profile likelihoods using CONNECT","comments":"23 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.IM hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The frequentist method of profile likelihoods has recently received renewed\nattention in the field of cosmology. This is because the results of inferences\nbased on the latter may differ from those of Bayesian inferences, either\nbecause of prior choices or because of non-Gaussianity in the likelihood\nfunction. Consequently, both methods are required for a fully nuanced analysis.\nHowever, in the last decades, cosmological parameter estimation has largely\nbeen dominated by Bayesian statistics due to the numerical complexity of\nconstructing profile likelihoods, arising mainly from the need for a large\nnumber of gradient-free optimisations of the likelihood function.\n  In this paper, we show how to accommodate the computational requirements of\nprofile likelihoods using the publicly available neural network framework\nCONNECT together with a novel modification of the gradient-based\n$basin$-$hopping$ optimisation algorithm. Apart from the reduced evaluation\ntime of the likelihood due to the neural network, we also achieve an additional\nspeed-up of 1$-$2 orders of magnitude compared to profile likelihoods computed\nwith the gradient-free method of $simulated$ $annealing$, with excellent\nagreement between the two. This allows for the production of typical triangle\nplots normally associated with Bayesian marginalisation within cosmology (and\npreviously unachievable using likelihood maximisation because of the\nprohibitive computational cost). We have tested the setup on three cosmological\nmodels: the $\\Lambda$CDM model, an extension with varying neutrino mass, and\nfinally a decaying cold dark matter model. Given the default precision settings\nin CONNECT, we achieve a high precision in $\\chi^2$ with a difference to the\nresults obtained by CLASS of $\\Delta\\chi^2\\approx0.2$ (and, importantly,\nwithout any bias in inferred parameter values) $-$ easily good enough for\nprofile likelihood analyses.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:34:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nygaard","Andreas",""],["Holm","Emil Brinch",""],["Hannestad","Steen",""],["Tram","Thomas",""]]}
{"id":"2308.06380","submitter":"Aldo Procacci","authors":"Aldo Procacci","title":"Cluster expansion methods in rigorous statistical mechanics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This draft is intended to be used as class notes for a grad course on\nrigorous statistical mechanics at math department of UFMG. It should be\nconsidered as a very prelimivary version and a work in progress. Several\nchapters lack references, exercises, and revision.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:36:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Procacci","Aldo",""]]}
{"id":"2308.06381","submitter":"Peter Perry","authors":"Peter Perry and Camille Schuetz","title":"Solutions to the Fifth-Order KP II Equation Scatter","comments":"28 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fifth-order KP II equation $$ \\partial_t u + \\alpha \\partial_x^3 u +\n\\beta \\partial_x^5 u + u \\partial_x u + \\partial_x^{-1} \\partial_y^2u=0$$\n($\\beta<0$, $\\alpha>0$) is a nonlinear dispersive equation that models long\ndispersive waves in two space dimensions. We prove that solutions of the\nfifth-order KP II equation scatter to solutions of the corresponding linear\nequation $$ \\partial_t v + \\alpha\\partial_x^3 v + \\beta\\partial_x^5 v +\n\\partial_x^{-1} \\partial_y^2 v = 0$$ for small data. Our proof uses builds on\nHadac, Herr, and Koch's work (see ArXiv:0708.2011) on the third-order KP II\nequation.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:42:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Perry","Peter",""],["Schuetz","Camille",""]]}
{"id":"2308.06382","submitter":"Siyuan Shan","authors":"Siyuan Shan, Yang Li, Amartya Banerjee, Junier B. Oliva","title":"Phoneme Hallucinator: One-shot Voice Conversion via Set Expansion","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Voice conversion (VC) aims at altering a person's voice to make it sound\nsimilar to the voice of another person while preserving linguistic content.\nExisting methods suffer from a dilemma between content intelligibility and\nspeaker similarity; i.e., methods with higher intelligibility usually have a\nlower speaker similarity, while methods with higher speaker similarity usually\nrequire plenty of target speaker voice data to achieve high intelligibility. In\nthis work, we propose a novel method \\textit{Phoneme Hallucinator} that\nachieves the best of both worlds. Phoneme Hallucinator is a one-shot VC model;\nit adopts a novel model to hallucinate diversified and high-fidelity target\nspeaker phonemes based just on a short target speaker voice (e.g. 3 seconds).\nThe hallucinated phonemes are then exploited to perform neighbor-based voice\nconversion. Our model is a text-free, any-to-any VC model that requires no text\nannotations and supports conversion to any unseen speaker. Objective and\nsubjective evaluations show that \\textit{Phoneme Hallucinator} outperforms\nexisting VC methods for both intelligibility and speaker similarity.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:44:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shan","Siyuan",""],["Li","Yang",""],["Banerjee","Amartya",""],["Oliva","Junier B.",""]]}
{"id":"2308.06383","submitter":"Yan Di","authors":"Yan Di, Chenyangguang Zhang, Ruida Zhang, Fabian Manhardt, Yongzhi Su,\n  Jason Rambach, Didier Stricker, Xiangyang Ji and Federico Tombari","title":"U-RED: Unsupervised 3D Shape Retrieval and Deformation for Partial Point\n  Clouds","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we propose U-RED, an Unsupervised shape REtrieval and\nDeformation pipeline that takes an arbitrary object observation as input,\ntypically captured by RGB images or scans, and jointly retrieves and deforms\nthe geometrically similar CAD models from a pre-established database to tightly\nmatch the target. Considering existing methods typically fail to handle noisy\npartial observations, U-RED is designed to address this issue from two aspects.\nFirst, since one partial shape may correspond to multiple potential full\nshapes, the retrieval method must allow such an ambiguous one-to-many\nrelationship. Thereby U-RED learns to project all possible full shapes of a\npartial target onto the surface of a unit sphere. Then during inference, each\nsampling on the sphere will yield a feasible retrieval. Second, since\nreal-world partial observations usually contain noticeable noise, a reliable\nlearned metric that measures the similarity between shapes is necessary for\nstable retrieval. In U-RED, we design a novel point-wise residual-guided metric\nthat allows noise-robust comparison. Extensive experiments on the synthetic\ndatasets PartNet, ComplementMe and the real-world dataset Scan2CAD demonstrate\nthat U-RED surpasses existing state-of-the-art approaches by 47.3%, 16.7% and\n31.6% respectively under Chamfer Distance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:56:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Di","Yan",""],["Zhang","Chenyangguang",""],["Zhang","Ruida",""],["Manhardt","Fabian",""],["Su","Yongzhi",""],["Rambach","Jason",""],["Stricker","Didier",""],["Ji","Xiangyang",""],["Tombari","Federico",""]]}
{"id":"2308.06384","submitter":"Matthias Ludewig","authors":"Matthias Ludewig","title":"Coarse geometry and its applications in solid state physics","comments":"Entry for the \"Encyclopedia of Mathematical Physics, 2nd edition\"","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.KT math.MG math.MP math.OA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this article, we give an overview over recent developments in the\nmathematical treatment of topological insulators using coarse geometry.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:58:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ludewig","Matthias",""]]}
{"id":"2308.06385","submitter":"Victor Gallego","authors":"Victor Gallego","title":"ZYN: Zero-Shot Reward Models with Yes-No Questions","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 address the problem of directing the text generations of a\nLLM towards a desired behavior, aligning the generated text with the\npreferences of the human operator. We propose using another language model as a\ncritic, reward model in a zero-shot way thanks to the prompt of a Yes-No\nquestion that represents the user preferences, without requiring further\nlabeled data. This zero-shot reward model provides the learning signal to\nfurther fine-tune the base LLM using reinforcement learning, as in RLAIF; yet\nour approach is also compatible in other contexts such as quality-diversity\nsearch. Extensive evidence of the capabilities of the proposed ZYN framework is\nprovided through experiments in different domains related to text generation,\nincluding detoxification; optimizing sentiment of movie reviews, or any other\nattribute; steering the opinion about a particular topic the model may have;\nand personalizing prompt generators for text-to-image tasks. Code to be\nreleased at \\url{https://github.com/vicgalle/zero-shot-reward-models/}.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 20:59:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gallego","Victor",""]]}
{"id":"2308.06386","submitter":"Mathieu Tanneau","authors":"Haoruo Zhao, Mathieu Tanneau, Pascal Van Hentenryck","title":"On the Benefits of Stochastic Economic Dispatch in Real-Time Electricity\n  Markets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Independent system operators (ISOs) in the US clear their real-time\nelectricity market every five minutes, optimizing energy and reserve dispatches\nto minimize operating costs while meeting technical and regulatory constraints.\nCurrently, many real-time markets are cleared by solving a single-period,\ndeterministic, security-constrained economic dispatch (SCED). Nevertheless,\ngiven the growing penetration of renewable generation and the forthcoming\nretirement of conventional generation units, it becomes increasingly\nchallenging to manage operational uncertainty at the real-time stage via the\ncurrent SCED formulations. This limitation is best illustrated by the recent\nintroduction into the real-time market of multiple short-term ramping products,\nwhich aim at bridging the gap between deterministic and stochastic\nformulations. In contrast, this paper explores the scalability and potential\nbenefits of explicitly considering uncertainty in real-time market formulations\nby combining multi-period look-ahead dispatch (LAD) and stochastic look-ahead\n(SLAD) formulations. An accelerated Benders' decomposition is presented to\nsolve the resulting problems efficiently. The paper conducts extensive\nnumerical experiments on a real, industry-size transmission grid that\nbenchmarks the proposed approaches and evaluates their benefits. The results\ndemonstrate that stochastic optimization is now tractable enough to be used in\nreal-time markets. Furthermore, the combination of multi-period and stochastic\nlook-ahead offers significant benefits in both reliability and cost, as SLAD\ncan better position online generators to accommodate future ramping needs,\nthereby reducing future operational costs and violations. Overall, SLAD reduces\nimport costs and the risk of transmission violation and saves an average of\nmore than 2% of costs compared to SCED.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:02:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Haoruo",""],["Tanneau","Mathieu",""],["Van Hentenryck","Pascal",""]]}
{"id":"2308.06387","submitter":"Murat Yessenov","authors":"Murat Yessenov, Miguel Romer, Naoki Ichiji and Ayman F. Abouraddy","title":"Experimental realization of Lorentz boosts of space-time wave packets","comments":"13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is now well-understood that a Lorentz boost of a spatially coherent\nmonochromatic optical beam yields a so-called space-time wave packet (STWP): a\npropagation-invariant pulsed beam whose group velocity is determined by the\nrelative velocity between the source and observer. Moreover, the Lorentz boost\nof an STWP is another STWP, whose group velocities are related by the\nrelativistic law for addition of velocities typically associated with massive\nparticles. We present an experimental procedure for testing this prediction in\nboth the subluminal and superluminal regimes that makes use of spatio-temporal\nFourier synthesis via a spatial light modulator. Our approach enables realizing\nthe change in temporal bandwidth, the invariance of the spatial bandwidth, the\nconcomitant change in the spatio-temporal wave-packet envelope, and the change\nin group velocity that all accompany a Lorentz boost of a monochromatic optical\nbeam. The only consequence of the Lorentz boost not captured by this\nmethodology is the Doppler shift in the optical carrier. This work may provide\nan avenue for further table-top demonstration of relativistic transformations\nof optical fields.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:05:36 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 01:09:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yessenov","Murat",""],["Romer","Miguel",""],["Ichiji","Naoki",""],["Abouraddy","Ayman F.",""]]}
{"id":"2308.06388","submitter":"Michael R\\\"ockner","authors":"Viorel Barbu, Jos\\'e Lu\\'is da Silva, Michael R\\\"ockner","title":"Nonlocal, nonlinear Fokker-Planck equations and nonlinear martingale\n  problems","comments":"arXiv admin note: text overlap with arXiv:2210.05612","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work is concerned with the existence of mild solutions and the\nuniqueness of distributional solutions to nonlinear Fokker-Planck equations\nwith nonlocal operators $\\Psi(-\\Delta)$, where $\\Psi$ is a Bernstein function.\nAs applications, the existence and uniqueness of solutions to the corresponding\nnonlinear martingale problems are proved. Furthermore, it is shown that these\nsolutions form a nonlinear Markov process in the sense of McKean such that\ntheir one-dimensional time marginal law densities are the solutions to the\nnonlocal nonlinear Fokker-Planck equation. Hence, McKean's program envisioned\nin his PNAS paper from 1966 is realized for these nonlocal PDEs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:06:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Barbu","Viorel",""],["da Silva","Jos\u00e9 Lu\u00eds",""],["R\u00f6ckner","Michael",""]]}
{"id":"2308.06389","submitter":"Stephen Mrenna","authors":"Stefano Frixione, Simone Amoroso, Stephen Mrenna","title":"Matrix element corrections in the Pythia8 parton shower in the context\n  of matched simulations at next-to-leading order","comments":"16 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-413-CSAID","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the role of matrix element corrections (MEC) to parton showers in\nthe context of MC@NLO-type matchings for processes that feature unstable\nresonances, where MEC are liable to result in double-counting issues, and are\nthus generally not employed. By working with Pythia8, we show that disabling\nall MEC is actually unnecessary in computations based on the narrow-width\napproximation, and we propose alternative MEC settings which, while still\navoiding double counting, allow one to include hard-recoil effects in the\nsimulations of resonance decays. We illustrate our findings by considering\ntop-antitop production at the LHC, and by comparing MadGraph_aMC@NLO\npredictions with those of POWHEG-BOX and standalone Pythia8.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:11:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Frixione","Stefano",""],["Amoroso","Simone",""],["Mrenna","Stephen",""]]}
{"id":"2308.06390","submitter":"Julie D\\'eserti","authors":"Julie D\\'eserti","title":"On the conjugacy classes of monomial birational maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This short note deals with the conjugacy classes of monomial birational maps\nin the $n$-dimensional Cremona group, $n\\geq 2$.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:13:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["D\u00e9serti","Julie",""]]}
{"id":"2308.06391","submitter":"Gautier Dagan","authors":"Gautier Dagan, Frank Keller, Alex Lascarides","title":"Dynamic Planning with a LLM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While Large Language Models (LLMs) can solve many NLP tasks in zero-shot\nsettings, applications involving embodied agents remain problematic. In\nparticular, complex plans that require multi-step reasoning become difficult\nand too costly as the context window grows. Planning requires understanding the\nlikely effects of one's actions and identifying whether the current environment\nsatisfies the goal state. While symbolic planners find optimal solutions\nquickly, they require a complete and accurate representation of the planning\nproblem, severely limiting their use in practical scenarios. In contrast,\nmodern LLMs cope with noisy observations and high levels of uncertainty when\nreasoning about a task. Our work presents LLM Dynamic Planner (LLM-DP): a\nneuro-symbolic framework where an LLM works hand-in-hand with a traditional\nplanner to solve an embodied task. Given action-descriptions, LLM-DP solves\nAlfworld faster and more efficiently than a naive LLM ReAct baseline.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:17:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dagan","Gautier",""],["Keller","Frank",""],["Lascarides","Alex",""]]}
{"id":"2308.06392","submitter":"Pekka Orponen","authors":"Malgorzata Nowicka, Vinay K. Gautam, Pekka Orponen","title":"Automated rendering of multi-stranded DNA complexes with pseudoknots","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a general method for rendering representations of multi-stranded\nDNA complexes from textual descriptions into 2D diagrams. The complexes can be\narbitrarily pseudoknotted, and if a planar rendering is possible, the method\nwill determine one in time which is essentially linear in the size of the\ntextual description. (That is, except for a final stochastic fine-tuning step.)\nIf a planar rendering is not possible, the method will compute a visually\npleasing approximate rendering in quadratic time. Examples of diagrams produced\nby the method are presented in the paper.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:19:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nowicka","Malgorzata",""],["Gautam","Vinay K.",""],["Orponen","Pekka",""]]}
{"id":"2308.06393","submitter":"Adnan Qayyum","authors":"Muhammad Atif Butt, Hassan Ali, Adnan Qayyum, Waqas Sultani, Ala\n  Al-Fuqaha, Junaid Qadir","title":"R2S100K: Road-Region Segmentation Dataset For Semi-Supervised Autonomous\n  Driving in the Wild","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semantic understanding of roadways is a key enabling factor for safe\nautonomous driving. However, existing autonomous driving datasets provide\nwell-structured urban roads while ignoring unstructured roadways containing\ndistress, potholes, water puddles, and various kinds of road patches i.e.,\nearthen, gravel etc. To this end, we introduce Road Region Segmentation dataset\n(R2S100K) -- a large-scale dataset and benchmark for training and evaluation of\nroad segmentation in aforementioned challenging unstructured roadways. R2S100K\ncomprises 100K images extracted from a large and diverse set of video sequences\ncovering more than 1000 KM of roadways. Out of these 100K privacy respecting\nimages, 14,000 images have fine pixel-labeling of road regions, with 86,000\nunlabeled images that can be leveraged through semi-supervised learning\nmethods. Alongside, we present an Efficient Data Sampling (EDS) based\nself-training framework to improve learning by leveraging unlabeled data. Our\nexperimental results demonstrate that the proposed method significantly\nimproves learning methods in generalizability and reduces the labeling cost for\nsemantic segmentation tasks. Our benchmark will be publicly available to\nfacilitate future research at https://r2s100k.github.io/.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:31:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Butt","Muhammad Atif",""],["Ali","Hassan",""],["Qayyum","Adnan",""],["Sultani","Waqas",""],["Al-Fuqaha","Ala",""],["Qadir","Junaid",""]]}
{"id":"2308.06394","submitter":"Jihan Yin","authors":"Anisha Gunjal, Jihan Yin, Erhan Bas","title":"Detecting and Preventing Hallucinations in Large Vision Language Models","comments":"preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Instruction tuned Large Vision Language Models (LVLMs) have significantly\nadvanced in generalizing across a diverse set of multi-modal tasks, especially\nfor Visual Question Answering (VQA). However, generating detailed responses\nthat are visually grounded is still a challenging task for these models. We\nfind that even the current state-of-the-art LVLMs (InstructBLIP) still contain\na staggering 30 percent of the hallucinatory text in the form of non-existent\nobjects, unfaithful descriptions, and inaccurate relationships. To address\nthis, we introduce M-HalDetect, a (M)ultimodal (Hal)lucination (Detect)ion\nDataset that can be used to train and benchmark models for hallucination\ndetection and prevention. M-HalDetect consists of 16k fine-grained annotations\non VQA examples, making it the first comprehensive multi-modal hallucination\ndetection dataset for detailed image descriptions. Unlike previous work that\nonly consider object hallucination, we additionally annotate both entity\ndescriptions and relationships that are unfaithful. To demonstrate the\npotential of this dataset for hallucination prevention, we optimize\nInstructBLIP through our novel Fine-grained Direct Preference Optimization\n(FDPO). We also train fine-grained multi-modal reward models from InstructBLIP\nand evaluate their effectiveness with best-of-n rejection sampling. We perform\nhuman evaluation on both FDPO and rejection sampling, and find that they reduce\nhallucination rates in InstructBLIP by 41% and 55% respectively. We also find\nthat our reward model generalizes to other multi-modal models, reducing\nhallucinations in LLaVA and mPLUG-OWL by 15% and 57% respectively, and has\nstrong correlation with human evaluated accuracy scores.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:35:20 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 22:56:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gunjal","Anisha",""],["Yin","Jihan",""],["Bas","Erhan",""]]}
{"id":"2308.06395","submitter":"Amartya Goswami","authors":"Amartya Goswami","title":"Ideals in quantales, II","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As a natural extension of the ongoing development of a theory of ideals in\ncommutative quantales with an identity element, this article aims to study into\nthe analysis of certain topological properties exhibited by distinguished\nclasses of ideals. These ideals are equipped with quantale topologies. The\nprimary objectives encompass characterizing quantale spaces exhibiting\nsobriety, examining several conditions pertaining to quasi-compactness, and\ndemonstrating that quantale spaces comprised of proper ideals adhere to the\nspectral properties as defined by Hochster. We introduce the notion of a\nstrongly disconnected spaces and show that for a quantale with zero Jacobson\nradical, strongly disconnected quantale spaces containing all maximal ideals of\nthe quantale imply existence of non-trivial idempotent elements in the\nquantale. Additionally, a sufficient criterion for establishing the\nconnectedness of a quantale space is presented. Finally, we discuss on\ncontinuous maps between quantale spaces.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:38:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Goswami","Amartya",""]]}
{"id":"2308.06396","submitter":"Marios Chatzikos","authors":"Marios Chatzikos, Stefano Bianchi, Francesco Camilloni, Priyanka\n  Chakraborty, Chamani M. Gunasekera, Francisco Guzm\\'an, Jonathan S. Milby,\n  Arnab Sarkar, Gargi Shaw, Peter A. M. van Hoof, Gary J. Ferland","title":"The 2023 release of Cloudy","comments":"18 pages, 10 figures, accepted for publication in RMxAA","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We describe the 2023 release of the spectral synthesis code Cloudy. Since the\nprevious major release, migrations of our online services motivated us to adopt\ngit as our version control system. This change alone led us to adopt an annual\nrelease scheme, accompanied by a short release paper, the present being the\ninaugural. Significant changes to our atomic and molecular data have improved\nthe accuracy of Cloudy predictions: we have upgraded our instance of the\nChianti database from version 7 to 10; our H- and He-like collisional rates to\nimproved theoretical values; our molecular data to the most recent LAMDA\ndatabase, and several chemical reaction rates to their most recent UDfA and\nKiDA values. Finally, we describe our progress on upgrading Cloudy's\ncapabilities to meet the requirements of the X-ray microcalorimeters aboard the\nupcoming XRISM and Athena missions, and outline future development that will\nmake Cloudy of use to the X-ray community.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:39:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chatzikos","Marios",""],["Bianchi","Stefano",""],["Camilloni","Francesco",""],["Chakraborty","Priyanka",""],["Gunasekera","Chamani M.",""],["Guzm\u00e1n","Francisco",""],["Milby","Jonathan S.",""],["Sarkar","Arnab",""],["Shaw","Gargi",""],["van Hoof","Peter A. M.",""],["Ferland","Gary J.",""]]}
{"id":"2308.06397","submitter":"Oscar Randal-Williams","authors":"Oscar Randal-Williams","title":"Monodromy and mapping class groups of 3-dimensional hypersurfaces","comments":"28 pages","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151","categories":"math.AT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe the subgroup of the mapping class group of a hypersurface in\n$\\mathbb{CP}^4$ consisting of those diffeomorphisms which can be realised by\nmonodromy.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:39:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Randal-Williams","Oscar",""]]}
{"id":"2308.06398","submitter":"Saeed Nasiri","authors":"Saeed Nasiri","title":"A Compressive Sensing Based Method for Harmonic State Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Power quality monitoring has become a vital need in modern power systems\nowing to the need for agile operation and troubleshooting scheme. On the other\nhand, the nature of load in modern power system is changing in many ways.\nDigital loads, which are mostly relied on power electronic equipment, may\ndistort the quality of power flowing through the network. Moreover, one of the\nmost critical objectives of smart grids is to improve quality of services\ndelivered to customers, alongside with security, reliability and efficiency. To\nthis end, a novel method based on compressive sensing is proposed in this paper\nto detect the source and the magnitude of the harmonics. The method takes\nadvantages of compressive sensing theory in such a way that a real-time\nmonitoring of harmonic distortion is obtained with a limited number of\nmeasurements. The efficacy of the method is checked by means of various\nsimulations on IEEE 118 bus test system. The results show the capabilities of\nthe method in both noisy and noise-free conditions.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:42:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nasiri","Saeed",""]]}
{"id":"2308.06399","submitter":"Marco Scutari","authors":"Lorenzo Valleggi and Marco Scutari and Federico Mattia Stefanini","title":"Learning Bayesian Networks with Heterogeneous Agronomic Data Sets via\n  Mixed-Effect Models and Hierarchical Clustering","comments":"28 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research involving diverse but related data sets, where associations between\ncovariates and outcomes may vary, is prevalent in various fields including\nagronomic studies. In these scenarios, hierarchical models, also known as\nmultilevel models, are frequently employed to assimilate information from\ndifferent data sets while accommodating their distinct characteristics.\nHowever, their structure extend beyond simple heterogeneity, as variables often\nform complex networks of causal relationships.\n  Bayesian networks (BNs) provide a powerful framework for modelling such\nrelationships using directed acyclic graphs to illustrate the connections\nbetween variables. This study introduces a novel approach that integrates\nrandom effects into BN learning. Rooted in linear mixed-effects models, this\napproach is particularly well-suited for handling hierarchical data. Results\nfrom a real-world agronomic trial suggest that employing this approach enhances\nstructural learning, leading to the discovery of new connections and the\nimprovement of improved model specification. Furthermore, we observe a\nreduction in prediction errors from 28% to 17%. By extending the applicability\nof BNs to complex data set structures, this approach contributes to the\neffective utilisation of BNs for hierarchical agronomic data. This, in turn,\nenhances their value as decision-support tools in the field.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:46:45 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:27:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Valleggi","Lorenzo",""],["Scutari","Marco",""],["Stefanini","Federico Mattia",""]]}
{"id":"2308.06400","submitter":"Josu\\'e I. Rios-Cangas","authors":"Josu\\'e I. Rios-Cangas","title":"The Krein transform and semi-bounded extensions of semi-bounded linear\n  relations","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Krein transform is the real counterpart of the Cayley transform and gives\na one-to-one correspondence between the positive relations and symmetric\ncontractions. It is treated with a slight variation of the usual one, resulting\nin an involution for linear relations. On the other hand, a semi-bounded linear\nrelation has closed semi-bounded symmetric extensions with semi-bounded\nselfadjoint extensions. A self-consistent theory of semi-bounded symmetric\nextensions of semi-bounded linear relations is presented. By using The Krein\ntransform, a formula of positive extensions of quasi-null relations is\nprovided.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:51:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rios-Cangas","Josu\u00e9 I.",""]]}
{"id":"2308.06401","submitter":"Mohamed Elmahallawy","authors":"Yasmine Mustafa, Mohamed Elmahallawy, Tie Luo, Seif Eldawlatly","title":"A Brain-Computer Interface Augmented Reality Framework with\n  Auto-Adaptive SSVEP Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Brain-Computer Interface (BCI) initially gained attention for developing\napplications that aid physically impaired individuals. Recently, the idea of\nintegrating BCI with Augmented Reality (AR) emerged, which uses BCI not only to\nenhance the quality of life for individuals with disabilities but also to\ndevelop mainstream applications for healthy users. One commonly used BCI signal\npattern is the Steady-state Visually-evoked Potential (SSVEP), which captures\nthe brain's response to flickering visual stimuli. SSVEP-based BCI-AR\napplications enable users to express their needs/wants by simply looking at\ncorresponding command options. However, individuals are different in brain\nsignals and thus require per-subject SSVEP recognition. Moreover, muscle\nmovements and eye blinks interfere with brain signals, and thus subjects are\nrequired to remain still during BCI experiments, which limits AR engagement. In\nthis paper, we (1) propose a simple adaptive ensemble classification system\nthat handles the inter-subject variability, (2) present a simple BCI-AR\nframework that supports the development of a wide range of SSVEP-based BCI-AR\napplications, and (3) evaluate the performance of our ensemble algorithm in an\nSSVEP-based BCI-AR application with head rotations which has demonstrated\nrobustness to the movement interference. Our testing on multiple subjects\nachieved a mean accuracy of 80\\% on a PC and 77\\% using the HoloLens AR\nheadset, both of which surpass previous studies that incorporate individual\nclassifiers and head movements. In addition, our visual stimulation time is 5\nseconds which is relatively short. The statistically significant results show\nthat our ensemble classification approach outperforms individual classifiers in\nSSVEP-based BCIs.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:56:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mustafa","Yasmine",""],["Elmahallawy","Mohamed",""],["Luo","Tie",""],["Eldawlatly","Seif",""]]}
{"id":"2308.06402","submitter":"Josu\\'e I. Rios-Cangas","authors":"Jorge R. Bola\\~nos-Serv\\'in, Josu\\'e I. Rios-Cangas and Alfredo Uribe","title":"The fast recurrent subspace on an $N$-level quantum energy transport\n  model","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fast recurrent subspace (the biggest support of all invariant states) of\na Weak Coupling Limit Type Quantum Markov Semigroup modeling a quantum\ntransport open system of $N$-energy levels is determined. This is achieved by\ncharacterizing the structure of all the invariant state and their spectra in\nterms of a natural generalization of the Discrete Fourier Transform operator.\nFinally, the attraction domains and long-time behavior of the evolution are\nstudied on hereditary subalgebras where faithful invariant states exist.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:57:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bola\u00f1os-Serv\u00edn","Jorge R.",""],["Rios-Cangas","Josu\u00e9 I.",""],["Uribe","Alfredo",""]]}
{"id":"2308.06403","submitter":"Kaylea Champion","authors":"Kaylea Champion and Benjamin Mako Hill","title":"Taboo and Collaborative Knowledge Production: Evidence from Wikipedia","comments":null,"journal-ref":null,"doi":"10.1145/3610090","report-no":null,"categories":"cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By definition, people are reticent or even unwilling to talk about taboo\nsubjects. Because subjects like sexuality, health, and violence are taboo in\nmost cultures, important information on each of these subjects can be difficult\nto obtain. Are peer produced knowledge bases like Wikipedia a promising\napproach for providing people with information on taboo subjects? With its\nreliance on volunteers who might also be averse to taboo, can the peer\nproduction model produce high-quality information on taboo subjects? In this\npaper, we seek to understand the role of taboo in knowledge bases produced by\nvolunteers. We do so by developing a novel computational approach to identify\ntaboo subjects and by using this method to identify a set of articles on taboo\nsubjects in English Wikipedia. We find that articles on taboo subjects are more\npopular than non-taboo articles and that they are frequently vandalized.\nDespite frequent vandalism attacks, we also find that taboo articles are higher\nquality than non-taboo articles. We hypothesize that stigmatizing societal\nattitudes will lead contributors to taboo subjects to seek to be less\nidentifiable. Although our results are consistent with this proposal in several\nways, we surprisingly find that contributors make themselves more identifiable\nin others.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 21:58:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Champion","Kaylea",""],["Hill","Benjamin Mako",""]]}
{"id":"2308.06404","submitter":"Daniel Moreno-Cartagena","authors":"Daniel Moreno-Cartagena, Guillermo Cabrera-Vives, Pavlos Protopapas,\n  Cristobal Donoso-Oliva, Manuel P\\'erez-Carrasco, Martina C\\'adiz-Leyton","title":"Positional Encodings for Light Curve Transformers: Playing with\n  Positions and Attention","comments":"In Proceedings of the 40th International Conference on Machine\n  Learning (ICML), Workshop on Machine Learning for Astrophysics, PMLR 202,\n  2023, Honolulu, Hawaii, USA","journal-ref":"In Proceedings of the 40th International Conference on Machine\n  Learning (ICML), Workshop on Machine Learning for Astrophysics, PMLR 202,\n  2023, Honolulu, Hawaii, USA","doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conducted empirical experiments to assess the transferability of a light\ncurve transformer to datasets with different cadences and magnitude\ndistributions using various positional encodings (PEs). We proposed a new\napproach to incorporate the temporal information directly to the output of the\nlast attention layer. Our results indicated that using trainable PEs lead to\nsignificant improvements in the transformer performances and training times.\nOur proposed PE on attention can be trained faster than the traditional\nnon-trainable PE transformer while achieving competitive results when\ntransfered to other datasets.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:02:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Moreno-Cartagena","Daniel",""],["Cabrera-Vives","Guillermo",""],["Protopapas","Pavlos",""],["Donoso-Oliva","Cristobal",""],["P\u00e9rez-Carrasco","Manuel",""],["C\u00e1diz-Leyton","Martina",""]]}
{"id":"2308.06405","submitter":"Yan Pang","authors":"Yan Pang, Tianhao Wang, Xuhui Kang, Mengdi Huai, Yang Zhang","title":"White-box Membership Inference Attacks against Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion models have begun to overshadow GANs and other generative models in\nindustrial applications due to their superior image generation performance. The\ncomplex architecture of these models furnishes an extensive array of attack\nfeatures. In light of this, we aim to design membership inference attacks\n(MIAs) catered to diffusion models. We first conduct an exhaustive analysis of\nexisting MIAs on diffusion models, taking into account factors such as\nblack-box/white-box models and the selection of attack features. We found that\nwhite-box attacks are highly applicable in real-world scenarios, and the most\neffective attacks presently are white-box. Departing from earlier research,\nwhich employs model loss as the attack feature for white-box MIAs, we employ\nmodel gradients in our attack, leveraging the fact that these gradients provide\na more profound understanding of model responses to various samples. We subject\nthese models to rigorous testing across a range of parameters, including\ntraining steps, sampling frequency, diffusion steps, and data variance. Across\nall experimental settings, our method consistently demonstrated near-flawless\nattack performance, with attack success rate approaching $100\\%$ and attack\nAUCROC near $1.0$. We also evaluate our attack against common defense\nmechanisms, and observe our attacks continue to exhibit commendable\nperformance.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:03:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pang","Yan",""],["Wang","Tianhao",""],["Kang","Xuhui",""],["Huai","Mengdi",""],["Zhang","Yang",""]]}
{"id":"2308.06406","submitter":"Lisa Wan Khee Goh","authors":"Lisa W. K. Goh, Joan Bachs-Esteban, Adri\\`a G\\'omez-Valent, Valeria\n  Pettorino and Javier Rubio","title":"Observational Constraints on Early Coupled Quintessence","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate an Early Coupled Quintessence model where a light scalar\nmediates a fifth force stronger than gravity among dark matter particles and\nleads to the growth of perturbations prior to matter-radiation equality. Using\ncosmological data from the $\\textit{Planck}$ Cosmic Microwave Background power\nspectra, the Pantheon+ Type 1a Supernovae, Baryon Acoustic Oscillations, and\nBig Bang Nucleosynthesis, we constrain the coupling strength $\\beta$ and the\nredshift $z_{\\rm OFF}$ at which the interaction becomes effectively inactive,\nfinding a firm degeneracy between these two parameters which holds true\nregardless of when the scaling regime begins.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:34:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Goh","Lisa W. K.",""],["Bachs-Esteban","Joan",""],["G\u00f3mez-Valent","Adri\u00e0",""],["Pettorino","Valeria",""],["Rubio","Javier",""]]}
{"id":"2308.06407","submitter":"Giseon Baek","authors":"Giseon Baek, Jeong-Eun Lee, Neal J. Evans II, Tomoya Hirota, Yuri\n  Aikawa, Ji-hyun Kang, Jungha Kim, Jes K. J{\\o}rgensen","title":"Spectral survey of a Hot core with an Eruptive Accretion in S255IR NIRS3\n  (SHEA): The discovery of class I and class II millimeter methanol maser\n  transitions","comments":"9 pages, 4 Figures, 1 Table, Accepted for publication in ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We report the detection of the millimeter CH$_3$OH masers including a new\ndetection of class I (11$_{0,11}$-10$_{1,10}$A) and class II\n(6$_{1,5}$-5$_{2,4}$E) maser transitions toward the high-mass protostar S255IR\nNIRS3 in post-burst phase. The CH$_3$OH emissions were detected as a mixture of\nmaser and thermal characteristics. We examine the detected transitions using an\nexcitation diagram and LTE model spectra and compare the observed properties\nwith those of thermal lines. Class II CH$_3$OH maser transitions showed\ndistinctive intensity and velocity distributions from those of thermal\ntransitions. Bright distinct emission components in addition to the fragmented\nand arc-shaped emissions are only detected in class I CH$_3$OH maser\ntransitions toward southern and western directions from the protostellar\nposition, implying the presence of the slow outflow shocks.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:40:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Baek","Giseon",""],["Lee","Jeong-Eun",""],["Evans","Neal J.","II"],["Hirota","Tomoya",""],["Aikawa","Yuri",""],["Kang","Ji-hyun",""],["Kim","Jungha",""],["J\u00f8rgensen","Jes K.",""]]}
{"id":"2308.06408","submitter":"Matheus A. Tunes BSc MSc PhD MInstP","authors":"M.A. Tunes, S.M. Drewry, F. Schmidt, J.A. Valdez, M.M. Schneider, C.A.\n  Kohnert, T.A. Saleh, C.G. Sch\\\"on, S. Fensin, O. El-Atwani, N. Goossens, S.\n  Huang, J. Vleugls, S.A. Maloy, and K. Lambrinou","title":"Transcending the MAX phases concept of nanolaminated early transition\n  metal carbides/nitrides -- the ZIA phases","comments":null,"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":"  A new potential class of nanolaminated and structurally complex materials,\nherein conceived as the Zigzag IntermetAllic (ZIA) phases, is proposed. A study\nof the constituent phases of a specific Nb--Si--Ni intermetallic alloy revealed\nthat its ternary H-phase, \\textit{i.e.}, the Nb$_3$SiNi$_2$ intermetallic\ncompound (IMC), is a crystalline solid with the close-packed \\textit{fcc}\nBravais lattice, the 312 MAX phase stoichiometry and a layered atomic\narrangement that may define an entire class of nanolaminated IMCs analogous to\nthe nanolaminated ceramic compounds known today as the MAX phases. The electron\nmicroscopy investigation of the Nb$_{3}$SiNi$_{2}$ compound -- the first\ncandidate ZIA phase -- revealed a remarkable structural complexity, as its\nordered unit cell is made of 96 atoms. The ZIA phases extend the concept of\nnanolaminated crystalline solids well beyond the MAX phases family of early\ntransition metal carbides/nitrides, most likely broadening the spectrum of\nachievable material properties into domains typically not covered by the MAX\nphases. Furthermore, this work uncovers that both families of nanolaminated\ncrystalline solids, \\textit{i.e.}, the herein introduced \\textit{fcc} ZIA\nphases and all known variants of the \\textit{hcp} MAX phases, obey the same\noverarching stoichiometric rule $P_{x+y}A_xN_y$, where $x$ and $y$ are integers\nranging from 1 to 6.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:45:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tunes","M. A.",""],["Drewry","S. M.",""],["Schmidt","F.",""],["Valdez","J. A.",""],["Schneider","M. M.",""],["Kohnert","C. A.",""],["Saleh","T. A.",""],["Sch\u00f6n","C. G.",""],["Fensin","S.",""],["El-Atwani","O.",""],["Goossens","N.",""],["Huang","S.",""],["Vleugls","J.",""],["Maloy","S. A.",""],["Lambrinou","K.",""]]}
{"id":"2308.06409","submitter":"Jayasree Sengupta","authors":"Jayasree Sengupta, Tanya Shreedhar, Dinh Nguyen, Robert Kramer and\n  Vaibhav Bajpai","title":"Through the Lens of Google CrUX: Dissecting Web Browsing Experience\n  Across Devices and Countries","comments":"7 pages, 4 figures and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  User quality of experience in the context of Web browsing is being researched\nwidely, with plenty of developments occurring alongside technological advances,\nnot seldom driven by big industry players. With the huge reach and\ninfrastructure of Google, the Chrome User Experience Report (CrUX) provides\nquantitative real-life measurement data of a vast magnitude. Analysis of this\nsteadily expanding dataset aggregating different user experience metrics,\nyields tangible insights into actual trends and developments. Hence, this paper\nis the first to study the CrUX dataset from the viewpoint of relevant metrics\nby quantitative evaluation of users Web browsing experience across three device\ntypes and nine European countries. Analysis of data segmented by connection\ntype in the device dimension shows desktops outperforming other device types\nfor all metrics. Similar analysis in the country dimension, shows North\nEuropean countries (Sweden, Finland) having maximum 4G connections (85.99%,\n81.41% respectively) and steadily performing 25%-36% better at the 75th\npercentile across all metrics compared to the worst performing country. Such a\nhigh-level longitudinal analysis of real-life Web browsing experience provides\nan extensive base for future research.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 22:57:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sengupta","Jayasree",""],["Shreedhar","Tanya",""],["Nguyen","Dinh",""],["Kramer","Robert",""],["Bajpai","Vaibhav",""]]}
{"id":"2308.06410","submitter":"Sahil Bhatia","authors":"Yuto Nishida, Sahil Bhatia, Shadaj Laddad, Hasan Genc, Yakun Sophia\n  Shao, Alvin Cheung","title":"Code Transpilation for Hardware Accelerators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  DSLs and hardware accelerators have proven to be very effective in optimizing\ncomputationally expensive workloads. In this paper, we propose a solution to\nthe challenge of manually rewriting legacy or unoptimized code in\ndomain-specific languages and hardware accelerators. We introduce an approach\nthat integrates two open-source tools: Metalift, a code translation framework,\nand Gemmini, a DNN accelerator generator. The integration of these two tools\noffers significant benefits, including simplified workflows for developers to\nrun legacy code on Gemmini generated accelerators and a streamlined programming\nstack for Gemmini that reduces the effort required to add new instructions.\nThis paper provides details on this integration and its potential to simplify\nand optimize computationally expensive workloads.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:01:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nishida","Yuto",""],["Bhatia","Sahil",""],["Laddad","Shadaj",""],["Genc","Hasan",""],["Shao","Yakun Sophia",""],["Cheung","Alvin",""]]}
{"id":"2308.06411","submitter":"Kangjin Kim","authors":"Jeongseok Kim and Kangjin Kim","title":"Dialogue Possibilities between a Human Supervisor and UAM Air Traffic\n  Management: Route Alteration","comments":"18 pages, 2 figures, accepted to the Advances in Artificial\n  Intelligence and Machine Learning (AAIML) journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel approach to detour management in Urban Air\nTraffic Management (UATM) using knowledge representation and reasoning. It aims\nto understand the complexities and requirements of UAM detours, enabling a\nmethod that quickly identifies safe and efficient routes in a carefully sampled\nenvironment. This method implemented in Answer Set Programming uses\nnon-monotonic reasoning and a two-phase conversation between a human manager\nand the UATM system, considering factors like safety and potential impacts. The\nrobustness and efficacy of the proposed method were validated through several\nqueries from two simulation scenarios, contributing to the symbiosis of human\nknowledge and advanced AI techniques. The paper provides an introduction,\nciting relevant studies, problem formulation, solution, discussions, and\nconcluding comments.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:01:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kim","Jeongseok",""],["Kim","Kangjin",""]]}
{"id":"2308.06412","submitter":"Shiyu Zhao","authors":"Shiyu Zhao, Samuel Schulter, Long Zhao, Zhixing Zhang, Vijay Kumar\n  B.G, Yumin Suh, Manmohan Chandraker, Dimitris N. Metaxas","title":"Improving Pseudo Labels for Open-Vocabulary Object Detection","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies show promising performance in open-vocabulary object detection\n(OVD) using pseudo labels (PLs) from pretrained vision and language models\n(VLMs). However, PLs generated by VLMs are extremely noisy due to the gap\nbetween the pretraining objective of VLMs and OVD, which blocks further\nadvances on PLs. In this paper, we aim to reduce the noise in PLs and propose a\nmethod called online Self-training And a Split-and-fusion head for OVD\n(SAS-Det). First, the self-training finetunes VLMs to generate high quality PLs\nwhile prevents forgetting the knowledge learned in the pretraining. Second, a\nsplit-and-fusion (SAF) head is designed to remove the noise in localization of\nPLs, which is usually ignored in existing methods. It also fuses complementary\nknowledge learned from both precise ground truth and noisy pseudo labels to\nboost the performance. Extensive experiments demonstrate SAS-Det is both\nefficient and effective. Our pseudo labeling is 3 times faster than prior\nmethods. SAS-Det outperforms prior state-of-the-art models of the same scale by\na clear margin and achieves 37.4 AP$_{50}$ and 27.3 AP$_r$ on novel categories\nof the COCO and LVIS benchmarks, respectively.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:03:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Shiyu",""],["Schulter","Samuel",""],["Zhao","Long",""],["Zhang","Zhixing",""],["G","Vijay Kumar B.",""],["Suh","Yumin",""],["Chandraker","Manmohan",""],["Metaxas","Dimitris N.",""]]}
{"id":"2308.06413","submitter":"Maximilian Egger","authors":"Rawad Bitar, Maximilian Egger, Antonia Wachter-Zeh and Marvin\n  Xhemrishi","title":"Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work investigates the design of sparse secret sharing schemes that\nencode a sparse private matrix into sparse shares. This investigation is\nmotivated by distributed computing, where the multiplication of sparse and\nprivate matrices is moved from a computationally weak main node to untrusted\nworker machines. Classical secret-sharing schemes produce dense shares.\nHowever, sparsity can help speed up the computation. We show that, for matrices\nwith i.i.d. entries, sparsity in the shares comes at a fundamental cost of\nweaker privacy. We derive a fundamental tradeoff between sparsity and privacy\nand construct optimal sparse secret sharing schemes that produce shares that\nleak the minimum amount of information for a desired sparsity of the shares. We\napply our schemes to distributed sparse and private matrix multiplication\nschemes with no colluding workers while tolerating stragglers. For the setting\nof two non-communicating clusters of workers, we design a sparse one-time pad\nso that no private information is leaked to a cluster of untrusted and\ncolluding workers, and the shares with bounded but non-zero leakage are\nassigned to a cluster of partially trusted workers. We conclude by discussing\nthe necessity of using permutations for matrices with correlated entries.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:04:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bitar","Rawad",""],["Egger","Maximilian",""],["Wachter-Zeh","Antonia",""],["Xhemrishi","Marvin",""]]}
{"id":"2308.06414","submitter":"Juncheng Wei","authors":"Yong Liu, Frank Pacard, and Juncheng Wei","title":"Bouncing Jacobi fields and the Allen-Cahn equation on surfaces","comments":"45 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Allen-Cahn functional is a well studied variational problem which appears\nin the modeling of phase transition phenomenon. This functional depends on a\nparameter $\\varepsilon >0$ and is intimately related to the area functional as\nthe parameter $\\varepsilon$ tends to $0$. In the case where the ambient\nmanifold is a compact surface, we give sufficient assumptions which guarantee\nthe existence of countable families of critical points of the Allen-Cahn\nfunctional whose nodal sets converge with multiplicity $2$ to a given embedded\ngeodesic, while their energies and Morse indices stays uniformly bounded, as\nthe parameter $\\varepsilon$ tends to $0$. This result is specific to two\ndimensional surfaces and, for generic metric, it does not occur in higher\ndimension.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:08:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yong",""],["Pacard","Frank",""],["Wei","Juncheng",""]]}
{"id":"2308.06415","submitter":"Daniel Staros","authors":"Daniel Staros, Brenda Rubenstein, Panchapakesan Ganesh","title":"A first-principles study of bilayer 1T'-WTe2/CrI3: A candidate\n  topological spin filter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.str-el physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability to manipulate electronic spin channels in 2D materials is crucial\nfor realizing next-generation spintronics. Spin filters are spintronic\ncomponents that polarize spins using external electromagnetic fields or\nintrinsic material properties like magnetism. Recently, topological protection\nfrom backscattering has emerged as an enticing feature through which the\nrobustness of 2D spin filters might be enhanced. In this work, we propose and\nthen characterize one of the first 2D topological spin filters: bilayer\nCrI3/1T'-WTe2. To do so, we use a combination of Density Functional Theory and\nmaximally localized Wannier functions to demonstrate that the bilayer (BL)\nsatisfies the principal criteria for being a topological spin filter; namely\nthat it is gapless, exhibits charge transfer from WTe2 to CrI3 that renders the\nBL metallic despite the CrI3 retaining its monolayer ferromagnetism, and does\nnot retain the topological character of monolayer 1T'-WTe2. In particular, we\nobserve that the atomic magnetic moments on Cr from DFT are approximately 3.2\nmB/Cr in the BL compared to 2.9 mB/Cr with small negative ferromagnetic (FM)\nmoments induced on the W atoms in freestanding monolayer CrI3. Subtracting the\ncharge and spin densities of the constituent monolayers from those of the BL\nfurther reveals spin-polarized charge transfer from WTe2 to CrI3. We find that\nthe BL is topologically trivial by showing that its Chern number is zero.\nAltogether, this evidence indicates that BL 1T'-WTe2/CrI3 is gapless, magnetic,\nand topologically trivial, meaning that a terraced WTe2/CrI3 BL heterostructure\nin which only a portion of a WTe2 monolayer is topped with CrI3 is a promising\ncandidate for a 2D topological spin filter. Our results further suggest that 1D\nchiral edge states may be realized by stacking strongly hybridized FM\nmonolayers, like CrI3, atop 2D nonmagnetic Weyl semimetals like 1T'-WTe2.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:12:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Staros","Daniel",""],["Rubenstein","Brenda",""],["Ganesh","Panchapakesan",""]]}
{"id":"2308.06416","submitter":"Mahesh Chandrasekhar Gandikota","authors":"M. C. Gandikota, Shibananda Das and A. Cacciuto","title":"Spontaneous crumpling of active spherical shells","comments":"6 pages and 6 figures including the appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The existence of a crumpled phase for self-avoiding elastic surfaces was\npostulated more than three decades ago using simple Flory-like scaling\narguments. Despite much effort, its stability in a microscopic environment has\nbeen the subject of much debate. In this Letter we show how a crumpled phase\ndevelops reliably and consistently upon subjecting a thin spherical shell to\nactive fluctuations. We find a master curve describing how the relative volume\nof a shell changes with the strength of the active forces, that applies for\nevery shell independent of size and elastic constants. Furthermore, we extract\na general expression for the onset active force beyond which a shell begins to\ncrumple. Finally, we calculate how the size exponent varies along the crumpling\ncurve.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:27:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gandikota","M. C.",""],["Das","Shibananda",""],["Cacciuto","A.",""]]}
{"id":"2308.06417","submitter":"Elena Dimitriadis Bermejo","authors":"Elena Dimitriadis Bermejo","title":"A new model of dg-categories","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AG math.KT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we develop a new model for the category of dg-categories.\nFollowing Rezk's example in the case of classic Segal spaces, we define\ndg-Segal spaces: functors between free dg-categories of finite type and\nsimplicial spaces to which we add certain properties. We define also complete\ndg-Segal spaces, and make their relationship to classic Segal spaces explicit.\nWith the help of two new hypercover constructions, and up to a certain\nhypothesis, we prove that there exists an equivalence between the homotopy\ncategory of dg-categories and the homotopy category of functors defined above\nwith a model structure making the complete dg-Segal spaces into its fibrant\nobjects.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:27:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bermejo","Elena Dimitriadis",""]]}
{"id":"2308.06418","submitter":"Saeed Azad","authors":"Saeed Azad, Daniel R. Herber","title":"Concurrent Probabilistic Control Co-Design and Layout Optimization of\n  Wave Energy Converter Farms using Surrogate Modeling","comments":"14 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":"  Wave energy converters (WECs) are a promising candidate for meeting the\nincreasing energy demands of today's society. It is known that the sizing and\npower take-off (PTO) control of WEC devices have a major impact on their\nperformance. In addition, to improve power generation, WECs must be optimally\ndeployed within a farm. While such individual aspects have been investigated\nfor various WECs, potential improvements may be attained by leveraging an\nintegrated, system-level design approach that considers all of these aspects.\nHowever, the computational complexity of estimating the hydrodynamic\ninteraction effects significantly increases for large numbers of WECs. In this\narticle, we undertake this challenge by developing data-driven surrogate models\nusing artificial neural networks and the principles of many-body expansion. The\neffectiveness of this approach is demonstrated by solving a concurrent plant\n(i.e., sizing), control (i.e., PTO parameters), and layout optimization of\nheaving cylinder WEC devices. WEC dynamics were modeled in the frequency\ndomain, subject to probabilistic incident waves with farms of $3$, $5$, $7$,\nand $10$ WECs. The results indicate promising directions toward a practical\nframework for array design investigations with more tractable computational\ndemands.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:34:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Azad","Saeed",""],["Herber","Daniel R.",""]]}
{"id":"2308.06419","submitter":"Mahsa Golchoubian","authors":"Mahsa Golchoubian, Moojan Ghafurian, Kerstin Dautenhahn, Nasser\n  Lashgarian Azad","title":"Pedestrian Trajectory Prediction in Pedestrian-Vehicle Mixed\n  Environments: A Systematic Review","comments":"Published in IEEE Transactions on Intelligent Transportation Systems","journal-ref":null,"doi":"10.1109/TITS.2023.3291196","report-no":null,"categories":"cs.RO cs.AI cs.HC cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Planning an autonomous vehicle's (AV) path in a space shared with pedestrians\nrequires reasoning about pedestrians' future trajectories. A practical\npedestrian trajectory prediction algorithm for the use of AVs needs to consider\nthe effect of the vehicle's interactions with the pedestrians on pedestrians'\nfuture motion behaviours. In this regard, this paper systematically reviews\ndifferent methods proposed in the literature for modelling pedestrian\ntrajectory prediction in presence of vehicles that can be applied for\nunstructured environments. This paper also investigates specific considerations\nfor pedestrian-vehicle interaction (compared with pedestrian-pedestrian\ninteraction) and reviews how different variables such as prediction\nuncertainties and behavioural differences are accounted for in the previously\nproposed prediction models. PRISMA guidelines were followed. Articles that did\nnot consider vehicle and pedestrian interactions or actual trajectories, and\narticles that only focused on road crossing were excluded. A total of 1260\nunique peer-reviewed articles from ACM Digital Library, IEEE Xplore, and Scopus\ndatabases were identified in the search. 64 articles were included in the final\nreview as they met the inclusion and exclusion criteria. An overview of\ndatasets containing trajectory data of both pedestrians and vehicles used by\nthe reviewed papers has been provided. Research gaps and directions for future\nwork, such as having more effective definition of interacting agents in deep\nlearning methods and the need for gathering more datasets of mixed traffic in\nunstructured environments are discussed.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:58:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Golchoubian","Mahsa",""],["Ghafurian","Moojan",""],["Dautenhahn","Kerstin",""],["Azad","Nasser Lashgarian",""]]}
{"id":"2308.06420","submitter":"Yen Nhi Truong Vu","authors":"Yen Nhi Truong Vu, Dan Guo, Ahmed Taha, Jason Su, Thomas Paul Matthews","title":"M&M: Tackling False Positives in Mammography with a Multi-view and\n  Multi-instance Learning Sparse Detector","comments":"MICCAI 2023 with supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep-learning-based object detection methods show promise for improving\nscreening mammography, but high rates of false positives can hinder their\neffectiveness in clinical practice. To reduce false positives, we identify\nthree challenges: (1) unlike natural images, a malignant mammogram typically\ncontains only one malignant finding; (2) mammography exams contain two views of\neach breast, and both views ought to be considered to make a correct\nassessment; (3) most mammograms are negative and do not contain any findings.\nIn this work, we tackle the three aforementioned challenges by: (1) leveraging\nSparse R-CNN and showing that sparse detectors are more appropriate than dense\ndetectors for mammography; (2) including a multi-view cross-attention module to\nsynthesize information from different views; (3) incorporating multi-instance\nlearning (MIL) to train with unannotated images and perform breast-level\nclassification. The resulting model, M&M, is a Multi-view and Multi-instance\nlearning system that can both localize malignant findings and provide\nbreast-level predictions. We validate M&M's detection and classification\nperformance using five mammography datasets. In addition, we demonstrate the\neffectiveness of each proposed component through comprehensive ablation\nstudies.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 23:59:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vu","Yen Nhi Truong",""],["Guo","Dan",""],["Taha","Ahmed",""],["Su","Jason",""],["Matthews","Thomas Paul",""]]}
{"id":"2308.06421","submitter":"Mihir Vahanwala","authors":"Mihir Vahanwala","title":"Characterising Robust Instances of Ultimate Positivity for Linear\n  Dynamical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linear Dynamical Systems, both discrete and continuous, are invaluable\nmathematical models in a plethora of applications such the verification of\nprobabilistic systems, model checking, computational biology, cyber-physical\nsystems, and economics. We consider discrete Linear Recurrence Sequences and\ncontinuous C-finite functions, i.e. solutions to homogeneous Linear\nDifferential Equations. The Ultimate Positivity Problem gives the recurrence\nrelation and the initialisation as input and asks whether there is a step $n_0$\n(resp. a time $t_0$) such that the Linear Recurrence Sequence $u[n] \\ge 0$ for\n$n > n_0$ (resp. solution to homogeneous linear differential equation $u(t) \\ge\n0$ for $t > t_0$). There are intrinsic number-theoretic challenges to surmount\nin order to decide these problems, which crucially arise in engineering and the\npractical sciences. In these settings, the difficult corner cases are seldom\nrelevant: tolerance to the inherent imprecision is especially critical. We thus\ncharacterise \\textit{robust} instances of the Ultimate Positivity Problem,\ni.e.\\ inputs for which the decision is locally constant. We describe the sets\nof Robust YES and Robust NO instances using the First Order Theory of the\nReals. We show, via the admission of quantifier elimination by the First Order\nTheory of the Reals, that these sets are semialgebraic.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:00:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vahanwala","Mihir",""]]}
{"id":"2308.06422","submitter":"Seyedarmin Azizi","authors":"Seyedarmin Azizi, Mahdi Nazemi, Arash Fayyazi, Massoud Pedram","title":"Sensitivity-Aware Mixed-Precision Quantization and Width Optimization of\n  Deep Neural Networks Through Cluster-Based Tree-Structured Parzen Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the complexity and computational demands of deep learning models rise, the\nneed for effective optimization methods for neural network designs becomes\nparamount. This work introduces an innovative search mechanism for\nautomatically selecting the best bit-width and layer-width for individual\nneural network layers. This leads to a marked enhancement in deep neural\nnetwork efficiency. The search domain is strategically reduced by leveraging\nHessian-based pruning, ensuring the removal of non-crucial parameters.\nSubsequently, we detail the development of surrogate models for favorable and\nunfavorable outcomes by employing a cluster-based tree-structured Parzen\nestimator. This strategy allows for a streamlined exploration of architectural\npossibilities and swift pinpointing of top-performing designs. Through rigorous\ntesting on well-known datasets, our method proves its distinct advantage over\nexisting methods. Compared to leading compression strategies, our approach\nrecords an impressive 20% decrease in model size without compromising accuracy.\nAdditionally, our method boasts a 12x reduction in search time relative to the\nbest search-focused strategies currently available. As a result, our proposed\nmethod represents a leap forward in neural network design optimization, paving\nthe way for quick model design and implementation in settings with limited\nresources, thereby propelling the potential of scalable deep learning\nsolutions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:16:51 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 16:18:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Azizi","Seyedarmin",""],["Nazemi","Mahdi",""],["Fayyazi","Arash",""],["Pedram","Massoud",""]]}
{"id":"2308.06423","submitter":"Iwan Praton","authors":"Yusong Deng and Iwan Praton","title":"Equidissections of darts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define the dart $D(a)$ to be the nonconvex quadrilateral whose vertices\nare $(0,1), (1,1), (1,0), (a,a)$ (in counterclockwise order), with $a>1$. Such\na dart can be dissected into any even number of equal-area triangles. Here we\ninvestigate darts that can be dissected into an odd number of equal-area\ntriangle.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:17:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deng","Yusong",""],["Praton","Iwan",""]]}
{"id":"2308.06424","submitter":"Chirag Pabbaraju","authors":"Chirag Pabbaraju","title":"Multiclass Learnability Does Not Imply Sample Compression","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 hypothesis class admits a sample compression scheme, if for every sample\nlabeled by a hypothesis from the class, it is possible to retain only a small\nsubsample, using which the labels on the entire sample can be inferred. The\nsize of the compression scheme is an upper bound on the size of the subsample\nproduced. Every learnable binary hypothesis class (which must necessarily have\nfinite VC dimension) admits a sample compression scheme of size only a finite\nfunction of its VC dimension, independent of the sample size. For multiclass\nhypothesis classes, the analog of VC dimension is the DS dimension. We show\nthat the analogous statement pertaining to sample compression is not true for\nmulticlass hypothesis classes: every learnable multiclass hypothesis class,\nwhich must necessarily have finite DS dimension, does not admit a sample\ncompression scheme of size only a finite function of its DS dimension.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:26:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pabbaraju","Chirag",""]]}
{"id":"2308.06425","submitter":"James Sellers","authors":"Shane Chern, Robson da Silva, and James A. Sellers","title":"Elementary Proofs of Arithmetic Properties for Schur-Type Overpartitions\n  Modulo Small Powers of 2","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 2022, Broudy and Lovejoy extensively studied the function $S(n)$ which\ncounts the number of overpartitions of \\emph{Schur-type}. In particular, they\nproved a number of congruences satisfied by $S(n)$ modulo $2$, $4$, and $5$. In\nthis work, we extend their list of arithmetic properties satisfied by $S(n)$ by\nfocusing on moduli which are small powers of 2. In particular, we prove the\nfollowing infinite family of Ramanujan-like congruences: For all $\\alpha\\geq 0$\nand $n\\geq 0$, $$\nS\\left(2^{5+2\\alpha}n+\\left(2^{5+2\\alpha}-\\frac{2^{2+2\\alpha}-1}{3}\\right)\\right)\\equiv\n0 \\pmod{16}. $$ All of the proof techniques used herein are elementary, relying\non classical $q$-series identities and generating function manipulations as\nwell as the parameterization work popularized by Alaca, Alaca, and Williams.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:40:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chern","Shane",""],["da Silva","Robson",""],["Sellers","James A.",""]]}
{"id":"2308.06426","submitter":"Bilal Farooq","authors":"Muhammad Sajjad Ansar, Nael Alsaleh, and Bilal Farooq","title":"Driver Heterogeneity in Willingness to Give Control to Conditional\n  Automation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.SY econ.EM eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The driver's willingness to give (WTG) control in conditionally automated\ndriving is assessed in a virtual reality based driving-rig, through their\nchoice to give away driving control and through the extent to which automated\ndriving is adopted in a mixed-traffic environment. Within- and across-class\nunobserved heterogeneity and locus of control variations are taken into\naccount. The choice of giving away control is modelled using the mixed logit\n(MIXL) and mixed latent class (LCML) model. The significant latent segments of\nthe locus of control are developed into internalizers and externalizers by the\nlatent class model (LCM) based on the taste heterogeneity identified from the\nMIXL model. Results suggest that drivers choose to \"giveAway\" control of the\nvehicle when greater concentration/attentiveness is required (e.g., in the\nnighttime) or when they are interested in performing a non-driving-related task\n(NDRT). In addition, it is observed that internalizers demonstrate more\nheterogeneity compared to externalizers in terms of WTG.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:53:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ansar","Muhammad Sajjad",""],["Alsaleh","Nael",""],["Farooq","Bilal",""]]}
{"id":"2308.06427","submitter":"Changkeun Oh","authors":"Shengwen Gan, Larry Guth, Changkeun Oh","title":"Restriction estimates for quadratic manifolds of arbitrary codimensions","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The restriction conjecture is one of the famous problems in harmonic\nanalysis. There have been many methods developed in the study of the conjecture\nfor the paraboloid. In this paper, we generalize the multilinear method of\nBourgain and Guth for the paraboloid, and obtain restriction estimates for all\nquadratic manifolds of arbitrary codimensions. In particular, our theorem\nrecovers the main theorem of Bourgain and Guth for the paraboloid. A new\ningredient is a covering lemma for varieties whose proof relies on Tarski's\nprojection theorem in real algebraic geometry. We also provide algorithms to\ncompute several algebraic quantities that naturally appear in the argument.\nThese algorithms rely on a cylindrical decomposition in real algebraic\ngeometry.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 00:55:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gan","Shengwen",""],["Guth","Larry",""],["Oh","Changkeun",""]]}
{"id":"2308.06428","submitter":"Keyi Yin","authors":"Keyi Yin, Hezi Zhang, Yunong Shi, Travis Humble, Ang Li, Yufei Ding","title":"Optimal Synthesis of Stabilizer Codes via MaxSAT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum Error Correction (QEC) codes are crucial for achieving fault-tolerant\nquantum computing in the long term. However, efficiently implementing these\ncodes on hardware poses significant challenges, including hardware connectivity\nmatching, efficient circuit scheduling, and fault-tolerance enforcement. In\nthis study, we present an optimal synthesizer that stitches generic stabilizer\ncodes onto diverse hardware structures via MaxSAT. Our evaluation demonstrates\n(1) the capability of our approach to be applied for various codes and devices\nand (2) the consistently better efficiency than the best prior heuristic\napproaches that only target specific QEC codes. By bridging the gap between\nhigh-level QEC code design and low-level hardware constraints, this work paves\nthe way toward achieving long-term fault-tolerant quantum computing goals.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:09:20 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 22:05:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yin","Keyi",""],["Zhang","Hezi",""],["Shi","Yunong",""],["Humble","Travis",""],["Li","Ang",""],["Ding","Yufei",""]]}
{"id":"2308.06429","submitter":"Ting Hu","authors":"Zhendong Sha, Yuanzhu Chen, Ting Hu","title":"Genetic heterogeneity analysis using genetic algorithm and network\n  science","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Through genome-wide association studies (GWAS), disease susceptible genetic\nvariables can be identified by comparing the genetic data of individuals with\nand without a specific disease. However, the discovery of these associations\nposes a significant challenge due to genetic heterogeneity and feature\ninteractions. Genetic variables intertwined with these effects often exhibit\nlower effect-size, and thus can be difficult to be detected using machine\nlearning feature selection methods. To address these challenges, this paper\nintroduces a novel feature selection mechanism for GWAS, named Feature\nCo-selection Network (FCSNet). FCS-Net is designed to extract heterogeneous\nsubsets of genetic variables from a network constructed from multiple\nindependent feature selection runs based on a genetic algorithm (GA), an\nevolutionary learning algorithm. We employ a non-linear machine learning\nalgorithm to detect feature interaction. We introduce the Community Risk Score\n(CRS), a synthetic feature designed to quantify the collective disease\nassociation of each variable subset. Our experiment showcases the effectiveness\nof the utilized GA-based feature selection method in identifying feature\ninteractions through synthetic data analysis. Furthermore, we apply our novel\napproach to a case-control colorectal cancer GWAS dataset. The resulting\nsynthetic features are then used to explain the genetic heterogeneity in an\nadditional case-only GWAS dataset.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:28:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sha","Zhendong",""],["Chen","Yuanzhu",""],["Hu","Ting",""]]}
{"id":"2308.06430","submitter":"Ting Hu","authors":"Zhendong Sha, Li Zhu, Zijun Jiang, Yuanzhu Chen, Ting Hu","title":"How complex is the microarray dataset? A novel data complexity metric\n  for biological high-dimensional microarray data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data complexity analysis quantifies the hardness of constructing a predictive\nmodel on a given dataset. However, the effectiveness of existing data\ncomplexity measures can be challenged by the existence of irrelevant features\nand feature interactions in biological micro-array data. We propose a novel\ndata complexity measure, depth, that leverages an evolutionary inspired feature\nselection algorithm to quantify the complexity of micro-array data. By\nexamining feature subsets of varying sizes, the approach offers a novel\nperspective on data complexity analysis. Unlike traditional metrics, depth is\nrobust to irrelevant features and effectively captures complexity stemming from\nfeature interactions. On synthetic micro-array data, depth outperforms existing\nmethods in robustness to irrelevant features and identifying complexity from\nfeature interactions. Applied to case-control genotype and gene-expression\nmicro-array datasets, the results reveal that a single feature of\ngene-expression data can account for over 90% of the performance of\nmulti-feature model, confirming the adequacy of the commonly used\ndifferentially expressed gene (DEG) feature selection method for the gene\nexpression data. Our study also demonstrates that constructing predictive\nmodels for genotype data is harder than gene expression data. The results in\nthis paper provide evidence for the use of interpretable machine learning\nalgorithms on microarray data.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:34:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sha","Zhendong",""],["Zhu","Li",""],["Jiang","Zijun",""],["Chen","Yuanzhu",""],["Hu","Ting",""]]}
{"id":"2308.06431","submitter":"Davood Rafiei","authors":"Mohammadreza Samadi, Davood Rafiei","title":"Performance Prediction for Multi-hop Questions","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.DB cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the problem of Query Performance Prediction (QPP) for open-domain\nmulti-hop Question Answering (QA), where the task is to estimate the difficulty\nof evaluating a multi-hop question over a corpus. Despite the extensive\nresearch on predicting the performance of ad-hoc and QA retrieval models, there\nhas been a lack of study on the estimation of the difficulty of multi-hop\nquestions. The problem is challenging due to the multi-step nature of the\nretrieval process, potential dependency of the steps and the reasoning\ninvolved. To tackle this challenge, we propose multHP, a novel pre-retrieval\nmethod for predicting the performance of open-domain multi-hop questions. Our\nextensive evaluation on the largest multi-hop QA dataset using several modern\nQA systems shows that the proposed model is a strong predictor of the\nperformance, outperforming traditional single-hop QPP models. Additionally, we\ndemonstrate that our approach can be effectively used to optimize the\nparameters of QA systems, such as the number of documents to be retrieved,\nresulting in improved overall retrieval performance.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:34:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Samadi","Mohammadreza",""],["Rafiei","Davood",""]]}
{"id":"2308.06432","submitter":"Yuhan Zhang","authors":"Yuhan Zhang, Kun Huang, Mingchao Li, Songtao Yuan, Qiang Chen","title":"Learn Single-horizon Disease Evolution for Predictive Generation of\n  Post-therapeutic Neovascular Age-related Macular Degeneration","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":"  Most of the existing disease prediction methods in the field of medical image\nprocessing fall into two classes, namely image-to-category predictions and\nimage-to-parameter predictions. Few works have focused on image-to-image\npredictions. Different from multi-horizon predictions in other fields,\nophthalmologists prefer to show more confidence in single-horizon predictions\ndue to the low tolerance of predictive risk. We propose a single-horizon\ndisease evolution network (SHENet) to predictively generate post-therapeutic\nSD-OCT images by inputting pre-therapeutic SD-OCT images with neovascular\nage-related macular degeneration (nAMD). In SHENet, a feature encoder converts\nthe input SD-OCT images to deep features, then a graph evolution module\npredicts the process of disease evolution in high-dimensional latent space and\noutputs the predicted deep features, and lastly, feature decoder recovers the\npredicted deep features to SD-OCT images. We further propose an evolution\nreinforcement module to ensure the effectiveness of disease evolution learning\nand obtain realistic SD-OCT images by adversarial training. SHENet is validated\non 383 SD-OCT cubes of 22 nAMD patients based on three well-designed schemes\nbased on the quantitative and qualitative evaluations. Compared with other\ngenerative methods, the generative SD-OCT images of SHENet have the highest\nimage quality. Besides, SHENet achieves the best structure protection and\ncontent prediction. Qualitative evaluations also demonstrate that SHENet has a\nbetter visual effect than other methods. SHENet can generate post-therapeutic\nSD-OCT images with both high prediction performance and good image quality,\nwhich has great potential to help ophthalmologists forecast the therapeutic\neffect of nAMD.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:40:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Yuhan",""],["Huang","Kun",""],["Li","Mingchao",""],["Yuan","Songtao",""],["Chen","Qiang",""]]}
{"id":"2308.06433","submitter":"Edmilson Roque dos Santos","authors":"Tiago Pereira, Edmilson Roque dos Santos and Sebastian van Strien","title":"Robust reconstruction of sparse network dynamics","comments":"48 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an math.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Reconstruction of the network interaction structure from multivariate time\nseries is an important problem in multiple fields of science. This problem is\nill-posed for large networks leading to the reconstruction of false\ninteractions. We put forward the Ergodic Basis Pursuit (EBP) method that uses\nthe network dynamics' statistical properties to ensure the exact reconstruction\nof sparse networks when a minimum length of time series is attained. We show\nthat this minimum time series length scales quadratically with the node degree\nbeing probed and logarithmic with the network size. Our approach is robust\nagainst noise and allows us to treat the noise level as a parameter. We show\nthe reconstruction power of the EBP in experimental multivariate time series\nfrom optoelectronic networks.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:54:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pereira","Tiago",""],["Santos","Edmilson Roque dos",""],["van Strien","Sebastian",""]]}
{"id":"2308.06434","submitter":"Nilesh Kumar","authors":"Nilesh Kumar, Ruby Shrestha, Zhiyuan Li, Linwei Wang","title":"Distributionally Robust Optimization and Invariant Representation\n  Learning for Addressing Subgroup Underrepresentation: Mechanisms and\n  Limitations","comments":"Accepted at FAIMI-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spurious correlation caused by subgroup underrepresentation has received\nincreasing attention as a source of bias that can be perpetuated by deep neural\nnetworks (DNNs). Distributionally robust optimization has shown success in\naddressing this bias, although the underlying working mechanism mostly relies\non upweighting under-performing samples as surrogates for those\nunderrepresented in data. At the same time, while invariant representation\nlearning has been a powerful choice for removing nuisance-sensitive features,\nit has been little considered in settings where spurious correlations are\ncaused by significant underrepresentation of subgroups. In this paper, we take\nthe first step to better understand and improve the mechanisms for debiasing\nspurious correlation due to subgroup underrepresentation in medical image\nclassification. Through a comprehensive evaluation study, we first show that 1)\ngeneralized reweighting of under-performing samples can be problematic when\nbias is not the only cause for poor performance, while 2) naive invariant\nrepresentation learning suffers from spurious correlations itself. We then\npresent a novel approach that leverages robust optimization to facilitate the\nlearning of invariant representations at the presence of spurious correlations.\nFinetuned classifiers utilizing such representation demonstrated improved\nabilities to reduce subgroup performance disparity, while maintaining high\naverage and worst-group performance.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:55:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kumar","Nilesh",""],["Shrestha","Ruby",""],["Li","Zhiyuan",""],["Wang","Linwei",""]]}
{"id":"2308.06435","submitter":"Nicole Robinson PhD","authors":"Nicole Robinson, Jennifer Connolly, Gavin Suddrey, David J. Kavanagh","title":"A Brief Wellbeing Training Session Delivered by a Humanoid Social Robot:\n  A Pilot Randomized Controlled Trial","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Mental health and psychological distress are rising in adults, showing the\nimportance of wellbeing promotion, support, and technique practice that is\neffective and accessible. Interactive social robots have been tested to deliver\nhealth programs but have not been explored to deliver wellbeing technique\ntraining in detail. A pilot randomised controlled trial was conducted to\nexplore the feasibility of an autonomous humanoid social robot to deliver a\nbrief mindful breathing technique to promote information around wellbeing. It\ncontained two conditions: brief technique training (Technique) and control\ndesigned to represent a simple wait-list activity to represent a\nrelationship-building discussion (Simple Rapport). This trial also explored\nwillingness to discuss health-related topics with a robot. Recruitment uptake\nrate through convenience sampling was high (53%). A total of 230 participants\ntook part (mean age = 29 years) with 71% being higher education students. There\nwere moderate ratings of technique enjoyment, perceived usefulness, and\nlikelihood to repeat the technique again. Interaction effects were found across\nmeasures with scores varying across gender and distress levels. Males with high\ndistress and females with low distress who received the simple rapport activity\nreported greater comfort to discuss non-health topics than males with low\ndistress and females with high distress. This trial marks a notable step\ntowards the design and deployment of an autonomous wellbeing intervention to\ninvestigate the impact of a brief robot-delivered mindfulness training program\nfor a sub-clinical population.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 01:57:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Robinson","Nicole",""],["Connolly","Jennifer",""],["Suddrey","Gavin",""],["Kavanagh","David J.",""]]}
{"id":"2308.06436","submitter":"Shiyuan Piao","authors":"Shiyuan Piao, Hong Gu, Aina Wang, Pan Qin","title":"A Domain-adaptive Physics-informed Neural Network for Inverse Problems\n  of Maxwell's Equations in Heterogeneous Media","comments":"5 pages,4 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":"  Maxwell's equations are a collection of coupled partial differential\nequations (PDEs) that, together with the Lorentz force law, constitute the\nbasis of classical electromagnetism and electric circuits. Effectively solving\nMaxwell's equations is crucial in various fields, like electromagnetic\nscattering and antenna design optimization. Physics-informed neural networks\n(PINNs) have shown powerful ability in solving PDEs. However, PINNs still\nstruggle to solve Maxwell's equations in heterogeneous media. To this end, we\npropose a domain-adaptive PINN (da-PINN) to solve inverse problems of Maxwell's\nequations in heterogeneous media. First, we propose a location parameter of\nmedia interface to decompose the whole domain into several sub-domains.\nFurthermore, the electromagnetic interface conditions are incorporated into a\nloss function to improve the prediction performance near the interface. Then,\nwe propose a domain-adaptive training strategy for da-PINN. Finally, the\neffectiveness of da-PINN is verified with two case studies.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:14:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Piao","Shiyuan",""],["Gu","Hong",""],["Wang","Aina",""],["Qin","Pan",""]]}
{"id":"2308.06437","submitter":"Jonathon Nessralla","authors":"Jonathon Nessralla, Daniel T. Larson, Takashi Taniguchi, Kenji\n  Watanabe, Efthimios Kaxiras, D. Kwabena Bediako","title":"Modulating the electrochemical intercalation of graphene interfaces with\n  $\\alpha$-RuCl$_3$ as a solid-state electron acceptor","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":"  Intercalation reactions modify the charge density in van der Waals (vdW)\nmaterials through coupled electronic-ionic charge accumulation, and are\nsusceptible to modulation by interlayer hybridization in vdW heterostructures.\nHere, we demonstrate that charge transfer between graphene and\n$\\alpha$-RuCl$_3$, which dopes the graphene positively, greatly favors the\nintercalation of lithium ions into graphene-based vdW heterostructures. We\nsystematically tune this effect on Li$^+$ ion intercalation, modulating the\nintercalation potential, by using varying thicknesses of hexagonal boron\nnitride (hBN) as spacer layers between graphene and $\\alpha$-RuCl$_3$. Confocal\nRaman spectroscopy and electronic transport measurements are used to monitor\nelectrochemical intercalation and density functional theory computations help\nquantify charge transfer to both $\\alpha$-RuCl$_3$ and graphene upon Li\nintercalation. This work demonstrates a versatile approach for systematically\nmodulating the electrochemical intercalation behavior of two-dimensional layers\nakin to electron donating/withdrawing substituent effects used to tune\nmolecular redox potentials.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:16:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nessralla","Jonathon",""],["Larson","Daniel T.",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Kaxiras","Efthimios",""],["Bediako","D. Kwabena",""]]}
{"id":"2308.06438","submitter":"Tilmann Glimm","authors":"Tilmann Glimm, Daniel Gruszka","title":"Modeling the Interplay of Oscillatory Synchronization and Aggregation\n  via Cell-Cell Adhesion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a model of systems of cells with intracellular oscillators\n('clocks'). This is motivated by examples from developmental biology and from\nthe behavior of organisms on the threshold to multicellularity. Cells undergo\nrandom motion and adhere to each other. The adhesion strength between neighbors\ndepends on their clock phases in addition to a constant baseline strength. The\noscillators are linked via Kuramoto-type local interactions. The model is an\nadvection-diffusion partial differential equation with nonlocal advection\nterms. We demonstrate that synchronized states correspond to Dirac-delta\nmeasure solutions of a weak version of the equation. To analyze the complex\ninterplay of aggregation and synchronization, we then perform a linear\nstability analysis of the incoherent, spatially uniform state. This lets us\nclassify possibly emerging patterns depending on model parameters. Combining\nthese results with numerical simulations, we determine a range of possible\nfar-from equilibrium patterns when baseline adhesion strength is zero: There is\naggregation into separate synchronized clusters with or without global\nsynchrony; global synchronization without aggregation; or unexpectedly a\n``phase wave\" pattern characterized by spatial gradients of clock phases. A 2D\nLattice-Gas Cellular Automaton model confirms and illustrates these results.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:20:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Glimm","Tilmann",""],["Gruszka","Daniel",""]]}
{"id":"2308.06439","submitter":"Yerlan Aimuratov","authors":"Vitaliy Kim, Adel Umirbayeva and Yerlan Aimuratov","title":"Estimates of the Surface Magnetic Field Strength of Radio Pulsars","comments":"12 pages, 6 figures, 5 tables, 29 references. Published in Universe\n  in the Special Issue Remo Ruffini Festschrift","journal-ref":"Universe 2023, 9 (7), 334","doi":"10.3390/universe9070334","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the geometry of the magnetic field of rotation-powered\npulsars. A new method for calculating an angle ($\\beta$) between the spin and\nmagnetic dipole axes of a neutron star (NS) in the ejector stage is considered\nwithin the frame of the magnetic dipole energy loss mechanism. We estimate the\nsurface magnetic field strength ($B_{\\rm ns}$) for a population of known\nneutron stars in the radio pulsar (ejector) stage. The evaluated $B_{\\rm\nns}(\\beta)$ may differ by an order of magnitude from the values without\nconsidering the angle $\\beta$. It is shown that $B_{\\rm ns}(\\beta)$ lies in the\nrange $10^{8}$--$10^{14}\\,\\text{G}$ for a known population of short and middle\nperiodic radio pulsars.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:26:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kim","Vitaliy",""],["Umirbayeva","Adel",""],["Aimuratov","Yerlan",""]]}
{"id":"2308.06440","submitter":"Chuanan Wei","authors":"Chuanan Wei, Ce Xu","title":"On some conjectural series containing harmonic numbers of 3-order","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Harmonic numbers are important in a lot of branches of number theory. By\nmeans of the derivative operator, the integral operator, and several summation\nand transformation formulas for hypergeometric series, we prove four series\ncontaining harmonic numbers of 3-order. Three of them are conjectures which\nwere recently proposed by Z.-W. Sun.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:29:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wei","Chuanan",""],["Xu","Ce",""]]}
{"id":"2308.06441","submitter":"Qing Chen","authors":"Qing Chen, Nan Chen, Wei Shuai, Guande Wu, Zhe Xu, Hanghang Tong, and\n  Nan Cao","title":"Calliope-Net: Automatic Generation of Graph Data Facts via Annotated\n  Node-link Diagrams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph or network data are widely studied in both data mining and\nvisualization communities to review the relationship among different entities\nand groups. The data facts derived from graph visual analysis are important to\nhelp understand the social structures of complex data, especially for data\njournalism. However, it is challenging for data journalists to discover graph\ndata facts and manually organize correlated facts around a meaningful topic due\nto the complexity of graph data and the difficulty to interpret graph\nnarratives. Therefore, we present an automatic graph facts generation system,\nCalliope-Net, which consists of a fact discovery module, a fact organization\nmodule, and a visualization module. It creates annotated node-link diagrams\nwith facts automatically discovered and organized from network data. A novel\nlayout algorithm is designed to present meaningful and visually appealing\nannotated graphs. We evaluate the proposed system with two case studies and an\nin-lab user study. The results show that Calliope-Net can benefit users in\ndiscovering and understanding graph data facts with visually pleasing annotated\nvisualizations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:32:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Qing",""],["Chen","Nan",""],["Shuai","Wei",""],["Wu","Guande",""],["Xu","Zhe",""],["Tong","Hanghang",""],["Cao","Nan",""]]}
{"id":"2308.06442","submitter":"AKM Mubashwir Alam","authors":"AKM Mubashwir Alam, Keke Chen","title":"Making Your Program Oblivious: a Comparative Study for Side-channel-safe\n  Confidential Computing","comments":null,"journal-ref":"IEEE CLOUD 2023","doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Trusted Execution Environments (TEEs) are gradually adopted by major cloud\nproviders, offering a practical option of \\emph{confidential computing} for\nusers who don't fully trust public clouds. TEEs use CPU-enabled hardware\nfeatures to eliminate direct breaches from compromised operating systems or\nhypervisors. However, recent studies have shown that side-channel attacks are\nstill effective on TEEs. An appealing solution is to convert applications to be\n\\emph{data oblivious} to deter many side-channel attacks. While a few research\nprototypes on TEEs have adopted specific data oblivious operations, the general\nconversion approaches have never been thoroughly compared against and tested on\nbenchmark TEE applications. These limitations make it difficult for researchers\nand practitioners to choose and adopt a suitable data oblivious approach for\ntheir applications. To address these issues, we conduct a comprehensive\nanalysis of several representative conversion approaches and implement\nbenchmark TEE applications with them. We also perform an extensive empirical\nstudy to provide insights into their performance and ease of use.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:33:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alam","AKM Mubashwir",""],["Chen","Keke",""]]}
{"id":"2308.06443","submitter":"Cheol Jun Cho","authors":"Cheol Jun Cho, Edward F. Chang, and Gopala K. Anumanchipalli","title":"Neural Latent Aligner: Cross-trial Alignment for Learning\n  Representations of Complex, Naturalistic Neural Data","comments":"Accepted at ICML 2023","journal-ref":"Proceedings of the 40th International Conference on Machine\n  Learning (2023), PMLR 202:5661-5676","doi":null,"report-no":null,"categories":"cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the neural implementation of complex human behaviors is one of\nthe major goals in neuroscience. To this end, it is crucial to find a true\nrepresentation of the neural data, which is challenging due to the high\ncomplexity of behaviors and the low signal-to-ratio (SNR) of the signals. Here,\nwe propose a novel unsupervised learning framework, Neural Latent Aligner\n(NLA), to find well-constrained, behaviorally relevant neural representations\nof complex behaviors. The key idea is to align representations across repeated\ntrials to learn cross-trial consistent information. Furthermore, we propose a\nnovel, fully differentiable time warping model (TWM) to resolve the temporal\nmisalignment of trials. When applied to intracranial electrocorticography\n(ECoG) of natural speaking, our model learns better representations for\ndecoding behaviors than the baseline models, especially in lower dimensional\nspace. The TWM is empirically validated by measuring behavioral coherence\nbetween aligned trials. The proposed framework learns more cross-trial\nconsistent representations than the baselines, and when visualized, the\nmanifold reveals shared neural trajectories across trials.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:35:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cho","Cheol Jun",""],["Chang","Edward F.",""],["Anumanchipalli","Gopala K.",""]]}
{"id":"2308.06444","submitter":"Shan Cao","authors":"Shan Cao, Qunsheng Ruan and Qingfeng Wu","title":"TongueSAM: An Universal Tongue Segmentation Model Based on SAM with\n  Zero-Shot","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tongue segmentation serves as the primary step in automated TCM tongue\ndiagnosis, which plays a significant role in the diagnostic results. Currently,\nnumerous deep learning based methods have achieved promising results. However,\nmost of these methods exhibit mediocre performance on tongues different from\nthe training set. To address this issue, this paper proposes a universal tongue\nsegmentation model named TongueSAM based on SAM (Segment Anything Model). SAM\nis a large-scale pretrained interactive segmentation model known for its\npowerful zero-shot generalization capability. Applying SAM to tongue\nsegmentation enables the segmentation of various types of tongue images with\nzero-shot. In this study, a Prompt Generator based on object detection is\nintegrated into SAM to enable an end-to-end automated tongue segmentation\nmethod. Experiments demonstrate that TongueSAM achieves exceptional performance\nacross various of tongue segmentation datasets, particularly under zero-shot.\nTongueSAM can be directly applied to other datasets without fine-tuning. As far\nas we know, this is the first application of large-scale pretrained model for\ntongue segmentation. The project and pretrained model of TongueSAM be publiced\nin :https://github.com/cshan-github/TongueSAM.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:38:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cao","Shan",""],["Ruan","Qunsheng",""],["Wu","Qingfeng",""]]}
{"id":"2308.06445","submitter":"AKM Mubashwir Alam","authors":"AKM Mubashwir Alam, Justin Boyce, Keke Chen","title":"SGX-MR-Prot: Efficient and Developer-Friendly Access-Pattern Protection\n  in Trusted Execution Environments","comments":"arXiv admin note: text overlap with arXiv:2009.03518","journal-ref":"International Conference on Distributed Computing Systems (ICDCS)\n  2023","doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Trusted Execution Environments, such as Intel SGX, use hardware supports to\nensure the confidentiality and integrity of applications against a compromised\ncloud system. However, side channels like access patterns remain for\nadversaries to exploit and obtain sensitive information. Common approaches use\noblivious programs or primitives, such as ORAM, to make access patterns\noblivious to input data, which are challenging to develop. This demonstration\nshows a prototype SGX-MR-Prot for efficiently protecting access patterns of\nSGX-based data-intensive applications and minimizing developers' efforts.\nSGX-MR-Prot uses the MapReduce framework to regulate application dataflows to\nreduce the cost of access-pattern protection and hide the data oblivious\ndetails from SGX developers. This demonstration will allow users to intuitively\nunderstand the unique contributions of the framework-based protection approach\nvia interactive exploration and visualization.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:44:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alam","AKM Mubashwir",""],["Boyce","Justin",""],["Chen","Keke",""]]}
{"id":"2308.06446","submitter":"Luxin Luo","authors":"Luxin Luo, Sida Kong","title":"The S-rule and 1-d representation for the traversal of a planar graph in\n  AEC industry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on two trivial observations of the AEC industry, this paper proposes a\ntraversal method (\"S-rule\") and expression (\"1-dimensional-graph\") transformed\nfrom DFS. This traversal method conforms to the original cognitive logic of the\nAEC industry, and the 1-d expression has clear language characteristics while\ncompletely retaining the topological relationship of the planar graph : a\nsequence of finite symbols (vocabularies) under definite rules. Moreover, the\nlanguage can be restored to a standard 2-d form that is isomorphic to the\noriginal planar graph, thus ensuring its visualization characteristics.\nFragments of the 1-d language can be used as planar units for free combination\nand weighting, and as the data foundation to support advanced calculations\nincluding FEM and isomorphic matching. And after the 2-d graph is reduced to\n1-d, any 3-d or higher-dimensional graphs can also be reduced to 1 or 2\ndimensions. The first half of this paper (Chapter 1) takes the 4X4 standard\ngrid as an example to introduce the prototype of S-rule and 1-d expression, and\ngives the mapping rule from 1-d expression to its editable text form. In the\nsecond half of this paper, the rule and expression are gradually extended to\nnon-embedded planar graphs (Chapter 2) and embedded planar graphs (Chapter 3),\nand the \"grammar\" is finally summarized (Chapter 4).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:45:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Luo","Luxin",""],["Kong","Sida",""]]}
{"id":"2308.06447","submitter":"Milad Ramezankhani","authors":"Milad Ramezankhani and Abbas S. Milani","title":"A Sequential Meta-Transfer (SMT) Learning to Combat Complexities of\n  Physics-Informed Neural Networks: Application to Composites Autoclave\n  Processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Physics-Informed Neural Networks (PINNs) have gained popularity in solving\nnonlinear partial differential equations (PDEs) via integrating physical laws\ninto the training of neural networks, making them superior in many scientific\nand engineering applications. However, conventional PINNs still fall short in\naccurately approximating the solution of complex systems with strong\nnonlinearity, especially in long temporal domains. Besides, since PINNs are\ndesigned to approximate a specific realization of a given PDE system, they lack\nthe necessary generalizability to efficiently adapt to new system\nconfigurations. This entails computationally expensive re-training from scratch\nfor any new change in the system. To address these shortfalls, in this work a\nnovel sequential meta-transfer (SMT) learning framework is proposed, offering a\nunified solution for both fast training and efficient adaptation of PINNs in\nhighly nonlinear systems with long temporal domains. Specifically, the\nframework decomposes PDE's time domain into smaller time segments to create\n\"easier\" PDE problems for PINNs training. Then for each time interval, a\nmeta-learner is assigned and trained to achieve an optimal initial state for\nrapid adaptation to a range of related tasks. Transfer learning principles are\nthen leveraged across time intervals to further reduce the computational\ncost.Through a composites autoclave processing case study, it is shown that SMT\nis clearly able to enhance the adaptability of PINNs while significantly\nreducing computational cost, by a factor of 100.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:46:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ramezankhani","Milad",""],["Milani","Abbas S.",""]]}
{"id":"2308.06448","submitter":"Sudhanshu Chanpuriya","authors":"Sudhanshu Chanpuriya and Cameron Musco","title":"Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Algorithms for node clustering typically focus on finding homophilous\nstructure in graphs. That is, they find sets of similar nodes with many edges\nwithin, rather than across, the clusters. However, graphs often also exhibit\nheterophilous structure, as exemplified by (nearly) bipartite and tripartite\ngraphs, where most edges occur across the clusters. Grappling with such\nstructure is typically left to the task of graph simplification. We present a\nprobabilistic model based on non-negative matrix factorization which unifies\nclustering and simplification, and provides a framework for modeling arbitrary\ngraph structure. Our model is based on factorizing the process of taking a\nrandom walk on the graph. It permits an unconstrained parametrization, allowing\nfor optimization via simple gradient descent. By relaxing the hard clustering\nto a soft clustering, our algorithm relaxes potentially hard clustering\nproblems to a tractable ones. We illustrate our algorithm's capabilities on a\nsynthetic graph, as well as simple unsupervised learning tasks involving\nbipartite and tripartite clustering of orthographic and phonological data.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:47:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chanpuriya","Sudhanshu",""],["Musco","Cameron",""]]}
{"id":"2308.06449","submitter":"Xiaoming Chen","authors":"Xiaoming Chen","title":"Instruction Set Architecture (ISA) for Processing-in-Memory DNN\n  Accelerators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we introduce an instruction set architecture (ISA) for\nprocessing-in-memory (PIM) based deep neural network (DNN) accelerators. The\nproposed ISA is for DNN inference on PIM-based architectures. It is assumed\nthat the weights have been trained and programmed into PIM-based DNN\naccelerators before inference, and they are fixed during inference. We do not\nrestrict the devices of PIM-based DNN accelerators. Popular devices used to\nbuild PIM-based DNN accelerators include resistive random-access memory (RRAM),\nflash, ferroelectric field-effect transistor (FeFET), static random-access\nmemory (SRAM), etc. The target DNNs include convolutional neural networks\n(CNNs) and multi-layer perceptrons (MLPs). The proposed ISA is transparent to\nboth applications and hardware implementations. It enables to develop unified\ntoolchains for PIM-based DNN accelerators and software stacks. For practical\nhardware that uses a different ISA, the generated instructions by unified\ntoolchains can easily converted to the target ISA. The proposed ISA has been\nused in the open-source DNN compiler PIMCOMP-NN\n(https://github.com/sunxt99/PIMCOMP-NN) and the associated open-source\nsimulator PIMSIM-NN (https://github.com/wangxy-2000/pimsim-nn).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:59:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Xiaoming",""]]}
{"id":"2308.06450","submitter":"Jiang Li","authors":"Jiang Li, Xiaoping Wang, Yingjian Liu, Qing Zhou, Zhigang Zeng","title":"Simple Model Also Works: A Novel Emotion Recognition Network in Textual\n  Conversation Based on Curriculum Learning Strategy","comments":"12 pages,9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emotion Recognition in Conversation (ERC) has emerged as a research hotspot\nin domains such as conversational robots and question-answer systems. How to\nefficiently and adequately retrieve contextual emotional cues has been one of\nthe key challenges in the ERC task. Existing efforts do not fully model the\ncontext and employ complex network structures, resulting in excessive\ncomputational resource overhead without substantial performance improvement. In\nthis paper, we propose a novel Emotion Recognition Network based on Curriculum\nLearning strategy (ERNetCL). The proposed ERNetCL primarily consists of\nTemporal Encoder (TE), Spatial Encoder (SE), and Curriculum Learning (CL) loss.\nWe utilize TE and SE to combine the strengths of previous methods in a\nsimplistic manner to efficiently capture temporal and spatial contextual\ninformation in the conversation. To simulate the way humans learn curriculum\nfrom easy to hard, we apply the idea of CL to the ERC task to progressively\noptimize the network parameters of ERNetCL. At the beginning of training, we\nassign lower learning weights to difficult samples. As the epoch increases, the\nlearning weights for these samples are gradually raised. Extensive experiments\non four datasets exhibit that our proposed method is effective and dramatically\nbeats other baseline models.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:05:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Jiang",""],["Wang","Xiaoping",""],["Liu","Yingjian",""],["Zhou","Qing",""],["Zeng","Zhigang",""]]}
{"id":"2308.06451","submitter":"Zongbo Han","authors":"Zongbo Han, Tianchi Xie, Bingzhe Wu, Qinghua Hu, Changqing Zhang","title":"Semantic Equivariant Mixup","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mixup is a well-established data augmentation technique, which can extend the\ntraining distribution and regularize the neural networks by creating ''mixed''\nsamples based on the label-equivariance assumption, i.e., a proportional mixup\nof the input data results in the corresponding labels being mixed in the same\nproportion. However, previous mixup variants may fail to exploit the\nlabel-independent information in mixed samples during training, which usually\ncontains richer semantic information. To further release the power of mixup, we\nfirst improve the previous label-equivariance assumption by the\nsemantic-equivariance assumption, which states that the proportional mixup of\nthe input data should lead to the corresponding representation being mixed in\nthe same proportion. Then a generic mixup regularization at the representation\nlevel is proposed, which can further regularize the model with the semantic\ninformation in mixed samples. At a high level, the proposed semantic\nequivariant mixup (sem) encourages the structure of the input data to be\npreserved in the representation space, i.e., the change of input will result in\nthe obtained representation information changing in the same way. Different\nfrom previous mixup variants, which tend to over-focus on the label-related\ninformation, the proposed method aims to preserve richer semantic information\nin the input with semantic-equivariance assumption, thereby improving the\nrobustness of the model against distribution shifts. We conduct extensive\nempirical studies and qualitative analyzes to demonstrate the effectiveness of\nour proposed method. The code of the manuscript is in the supplement.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:05:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Han","Zongbo",""],["Xie","Tianchi",""],["Wu","Bingzhe",""],["Hu","Qinghua",""],["Zhang","Changqing",""]]}
{"id":"2308.06452","submitter":"Lu Liyao","authors":"Liyao Lu","title":"Improved YOLOv8 Detection Algorithm in Security Inspection Image","comments":"23 pages,23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Security inspection is the first line of defense to ensure the safety of\npeople's lives and property, and intelligent security inspection is an\ninevitable trend in the future development of the security inspection industry.\nAiming at the problems of overlapping detection objects, false detection of\ncontraband, and missed detection in the process of X-ray image detection, an\nimproved X-ray contraband detection algorithm CSS-YOLO based on YOLOv8s is\nproposed.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:13:38 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 02:31:51 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 07:11:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Liyao",""]]}
{"id":"2308.06453","submitter":"Penghui Yang","authors":"Penghui Yang, Ming-Kun Xie, Chen-Chen Zong, Lei Feng, Gang Niu,\n  Masashi Sugiyama, Sheng-Jun Huang","title":"Multi-Label Knowledge Distillation","comments":"Accepted by ICCV 2023. The first two authors contributed equally to\n  this work","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":"  Existing knowledge distillation methods typically work by imparting the\nknowledge of output logits or intermediate feature maps from the teacher\nnetwork to the student network, which is very successful in multi-class\nsingle-label learning. However, these methods can hardly be extended to the\nmulti-label learning scenario, where each instance is associated with multiple\nsemantic labels, because the prediction probabilities do not sum to one and\nfeature maps of the whole example may ignore minor classes in such a scenario.\nIn this paper, we propose a novel multi-label knowledge distillation method. On\none hand, it exploits the informative semantic knowledge from the logits by\ndividing the multi-label learning problem into a set of binary classification\nproblems; on the other hand, it enhances the distinctiveness of the learned\nfeature representations by leveraging the structural information of label-wise\nembeddings. Experimental results on multiple benchmark datasets validate that\nthe proposed method can avoid knowledge counteraction among labels, thus\nachieving superior performance against diverse comparing methods. Our code is\navailable at: https://github.com/penghui-yang/L2D\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:19:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Penghui",""],["Xie","Ming-Kun",""],["Zong","Chen-Chen",""],["Feng","Lei",""],["Niu","Gang",""],["Sugiyama","Masashi",""],["Huang","Sheng-Jun",""]]}
{"id":"2308.06454","submitter":"Cong Sun","authors":"Leilei Su, Jian Chen, Yifan Peng, Cong Sun","title":"Demonstration-based learning for few-shot biomedical named entity\n  recognition under machine reading comprehension","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although deep learning techniques have shown significant achievements, they\nfrequently depend on extensive amounts of hand-labeled data and tend to perform\ninadequately in few-shot scenarios. The objective of this study is to devise a\nstrategy that can improve the model's capability to recognize biomedical\nentities in scenarios of few-shot learning. By redefining biomedical named\nentity recognition (BioNER) as a machine reading comprehension (MRC) problem,\nwe propose a demonstration-based learning method to address few-shot BioNER,\nwhich involves constructing appropriate task demonstrations. In assessing our\nproposed method, we compared the proposed method with existing advanced methods\nusing six benchmark datasets, including BC4CHEMD, BC5CDR-Chemical,\nBC5CDR-Disease, NCBI-Disease, BC2GM, and JNLPBA. We examined the models'\nefficacy by reporting F1 scores from both the 25-shot and 50-shot learning\nexperiments. In 25-shot learning, we observed 1.1% improvements in the average\nF1 scores compared to the baseline method, reaching 61.7%, 84.1%, 69.1%, 70.1%,\n50.6%, and 59.9% on six datasets, respectively. In 50-shot learning, we further\nimproved the average F1 scores by 1.0% compared to the baseline method,\nreaching 73.1%, 86.8%, 76.1%, 75.6%, 61.7%, and 65.4%, respectively. We\nreported that in the realm of few-shot learning BioNER, MRC-based language\nmodels are much more proficient in recognizing biomedical entities compared to\nthe sequence labeling approach. Furthermore, our MRC-language models can\ncompete successfully with fully-supervised learning methodologies that rely\nheavily on the availability of abundant annotated data. These results highlight\npossible pathways for future advancements in few-shot BioNER methodologies.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:23:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Su","Leilei",""],["Chen","Jian",""],["Peng","Yifan",""],["Sun","Cong",""]]}
{"id":"2308.06455","submitter":"Kaiqian Qu","authors":"Kaiqian Qu, Shuaishuai Guo, and Nasir Saeed","title":"Near-Field Integrated Sensing and Communication: Performance Analysis\n  and Beamforming Design","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores the potential of near-field beamforming (NFBF) in\nintegrated sensing and communication (ISAC) systems with extremely large-scale\narrays (XL-arrays). The large-scale antenna arrays increase the possibility of\nhaving communication users and targets of interest in the near field of the\nbase station (BS). The paper first establishes the models of electromagnetic\n(EM) near-field spherical waves and far-field plane waves. With the models, we\nanalyze the near-field beam focusing ability and the far-field beam steering\nability by finding the gain-loss mathematical expression caused by the\nfar-field steering vector mismatch in the near-field case. We formulate the\nNFBF design problem as minimizing the weighted summation of radar and the\ncommunication beamforming errors under a total power constraint and solve this\nquadratically constrained quadratic programming (QCQP) problem using the least\nsquares (LS) method. Moreover, the Cram\\'er-Rao bound (CRB) for target\nparameter estimation is derived to verify the performance of NFBF. Furthermore,\nwe also perform power minimization using convex optimization while ensuring the\nrequired communication and sensing quality-of-service (QoS). The simulation\nresults show the influence of model mismatch on near-field ISAC and the\nperformance gain of transmit beamforming from the additional distance dimension\nof near-field.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:26:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qu","Kaiqian",""],["Guo","Shuaishuai",""],["Saeed","Nasir",""]]}
{"id":"2308.06456","submitter":"Sanjay Roy","authors":"Sanjay Roy, Srabani Mondal and T. K. Samanta","title":"Quasi fuzzy delta compact spaces and a few related properties","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 paper, we introduce the concept of various types fuzzy delta\n$(\\delta)$ compactness such as Quasi fuzzy delta compact, Quasi fuzzy countably\ndelta compact, Weakly fuzzy delta compact, $a$-delta compact, Strong fuzzy\ndelta compact, Ultra fuzzy delta compact and Fuzzy delta compact and\ncharacterize these types of fuzzy delta compactness using the notion of fuzzy\nupper limit of net of some types of delta $(\\delta)$ closed sets.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:28:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Roy","Sanjay",""],["Mondal","Srabani",""],["Samanta","T. K.",""]]}
{"id":"2308.06457","submitter":"Zhichao Wang","authors":"Zhichao Wang, Mengyu Dai, Keld Lundgaard","title":"Text-to-Video: a Two-stage Framework for Zero-shot Identity-agnostic\n  Talking-head Generation","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The advent of ChatGPT has introduced innovative methods for information\ngathering and analysis. However, the information provided by ChatGPT is limited\nto text, and the visualization of this information remains constrained.\nPrevious research has explored zero-shot text-to-video (TTV) approaches to\ntransform text into videos. However, these methods lacked control over the\nidentity of the generated audio, i.e., not identity-agnostic, hindering their\neffectiveness. To address this limitation, we propose a novel two-stage\nframework for person-agnostic video cloning, specifically focusing on TTV\ngeneration. In the first stage, we leverage pretrained zero-shot models to\nachieve text-to-speech (TTS) conversion. In the second stage, an audio-driven\ntalking head generation method is employed to produce compelling videos\nprivided the audio generated in the first stage. This paper presents a\ncomparative analysis of different TTS and audio-driven talking head generation\nmethods, identifying the most promising approach for future research and\ndevelopment. Some audio and videos samples can be found in the following link:\nhttps://github.com/ZhichaoWang970201/Text-to-Video/tree/main.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:30:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zhichao",""],["Dai","Mengyu",""],["Lundgaard","Keld",""]]}
{"id":"2308.06458","submitter":"Guange Su","authors":"Xiaosen Han and Guange Su","title":"Existence of $U(1)$ Gauged Q-balls for A Field Model with Sixth-order\n  Potential","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":"  Q-balls are non-topological solitons in a large family of field theories. We\nfocus on the existence of $U(1)$ gauged Q-balls for a field theory with\nsixth-order potential. The problem can be reduced to proving the existence of\ncritical points for some indefinite functional. For this, we use a constrained\nminimization approach to obtain the existence of critical points. Moreover, we\nestablish some qualitative properties of the Q-ball solution, such as\nmonotonicity, boundedness and asymptotic behavior.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:32:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Han","Xiaosen",""],["Su","Guange",""]]}
{"id":"2308.06459","submitter":"Pranav Goel","authors":"Pranav Goel (1), Jon Green (2), David Lazer (3), Philip Resnik (4 and\n  5) ((1) Department of Computer Science, University of Maryland, (2)\n  Department of Political Science, Duke University, (3) Network Science\n  Institute, Northeastern University, (4) Department of Linguistics, University\n  of Maryland, (5) Institute for Advanced Computer Studies, University of\n  Maryland)","title":"Mainstream News Articles Co-Shared with Fake News Buttress\n  Misinformation Narratives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Most prior and current research examining misinformation spread on social\nmedia focuses on reports published by 'fake' news sources. These approaches\nfail to capture another potential form of misinformation with a much larger\naudience: factual news from mainstream sources ('real' news) repurposed to\npromote false or misleading narratives. We operationalize narratives using an\nexisting unsupervised NLP technique and examine the narratives present in\nmisinformation content. We find that certain articles from reliable outlets are\nshared by a disproportionate number of users who also shared fake news on\nTwitter. We consider these 'real' news articles to be co-shared with fake news.\nWe show that co-shared articles contain existing misinformation narratives at a\nsignificantly higher rate than articles from the same reliable outlets that are\nnot co-shared with fake news. This holds true even when articles are chosen\nfollowing strict criteria of reliability for the outlets and after accounting\nfor the alternative explanation of partisan curation of articles. For example,\nwe observe that a recent article published by The Washington Post titled\n\"Vaccinated people now make up a majority of COVID deaths\" was\ndisproportionately shared by Twitter users with a history of sharing\nanti-vaccine false news reports. Our findings suggest a strategic repurposing\nof mainstream news by conveyors of misinformation as a way to enhance the reach\nand persuasiveness of misleading narratives. We also conduct a comprehensive\ncase study to help highlight how such repurposing can happen on Twitter as a\nconsequence of the inclusion of particular narratives in the framing of\nmainstream news.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:55:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Goel","Pranav","","4 and\n  5"],["Green","Jon","","4 and\n  5"],["Lazer","David","","4 and\n  5"],["Resnik","Philip","","4 and\n  5"]]}
{"id":"2308.06460","submitter":"Jian Tan","authors":"Jian Tan and Linjing Zhang","title":"Weak type estimates for Bochner--Riesz means on Hardy-type spaces\n  associated with ball quasi-Banach function spaces","comments":"30 pages. arXiv admin note: text overlap with arXiv:1905.02097 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X\\left(\\mathbb{R}^{n}\\right)$ be a ball quasi-Banach function space on\n$\\mathbb{R}^{n}$, $WX\\left(\\mathbb{R}^{n}\\right)$ be the weak ball quasi-Banach\nfunction space on $\\mathbb{R}^{n}$, $H_{X}\\left(\\mathbb{R}^{n}\\right)$ be the\nHardy space associated with $X\\left(\\mathbb{R}^{n}\\right)$ and\n$WH_{X}\\left(\\mathbb{R}^{n}\\right)$ be the weak Hardy space associated with\n$X\\left(\\mathbb{R}^{n}\\right)$. In this paper, we obtain the boundedness of the\nBochner--Riesz means and the maximal Bochner--Riesz means from\n$H_{X}\\left(\\mathbb{R}^{n}\\right)$ to $WH_{X}\\left(\\mathbb{R}^{n}\\right)$ or\n$WX\\left(\\mathbb{R}^{n}\\right)$, which includes the critical case. Moreover, we\napply these results to several examples of ball quasi-Banach function spaces,\nnamely, weighted Lebesgue spaces, Herz spaces, Lorentz spaces, variable\nLebesgue spaces and Morrey spaces. This shows that all the results obtained in\nthis article are of wide applications, and more applications of these results\nare predictable.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:57:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tan","Jian",""],["Zhang","Linjing",""]]}
{"id":"2308.06461","submitter":"Amanda Pan","authors":"Hoi H. Nguyen, Amanda Pan","title":"A note on the singularity probability of random directed $d$-regular\n  graphs","comments":"24 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note we show that the singular probability of the adjacency matrix of\na random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \\to\n\\infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang.\nOur method is based on the study of the singularity problem modulo a prime\ntogether with an inverse-type result on the decay of the characteristic\nfunction. The latter is related to the inverse Kneser's problem in\ncombinatorics.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 03:57:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nguyen","Hoi H.",""],["Pan","Amanda",""]]}
{"id":"2308.06462","submitter":"Christoph Ortner","authors":"Christoph Ortner","title":"On the Atomic Cluster Expansion: interatomic potentials and beyond","comments":"5 pages","journal-ref":"KIM REVIEW, Volume 1, Article 01, 2023","doi":"10.25950/c7f24234","report-no":null,"categories":"physics.comp-ph cond-mat.mtrl-sci physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Atomic Cluster Expansion (ACE) [R. Drautz, Phys. Rev. B, 99:014104\n(2019)] provides a systematically improvable, universal descriptor for the\nenvironment of an atom that is invariant to permutation, translation and\nrotation. ACE is being used extensively in newly emerging interatomic\npotentials based on machine learning. This commentary discusses the ACE\nframework and its potential impact.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 04:03:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ortner","Christoph",""]]}
{"id":"2308.06463","submitter":"Youliang Yuan","authors":"Youliang Yuan, Wenxiang Jiao, Wenxuan Wang, Jen-tse Huang, Pinjia He,\n  Shuming Shi and Zhaopeng Tu","title":"GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher","comments":"13 pages, 4 figures, 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Safety lies at the core of the development of Large Language Models (LLMs).\nThere is ample work on aligning LLMs with human ethics and preferences,\nincluding data filtering in pretraining, supervised fine-tuning, reinforcement\nlearning from human feedback, and red teaming, etc. In this study, we discover\nthat chat in cipher can bypass the safety alignment techniques of LLMs, which\nare mainly conducted in natural languages. We propose a novel framework\nCipherChat to systematically examine the generalizability of safety alignment\nto non-natural languages -- ciphers. CipherChat enables humans to chat with\nLLMs through cipher prompts topped with system role descriptions and few-shot\nenciphered demonstrations. We use CipherChat to assess state-of-the-art LLMs,\nincluding ChatGPT and GPT-4 for different representative human ciphers across\n11 safety domains in both English and Chinese. Experimental results show that\ncertain ciphers succeed almost 100% of the time to bypass the safety alignment\nof GPT-4 in several safety domains, demonstrating the necessity of developing\nsafety alignment for non-natural languages. Notably, we identify that LLMs seem\nto have a ''secret cipher'', and propose a novel SelfCipher that uses only role\nplay and several demonstrations in natural language to evoke this capability.\nSelfCipher surprisingly outperforms existing human ciphers in almost all cases.\nOur code and data will be released at https://github.com/RobustNLP/CipherChat.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 04:05:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yuan","Youliang",""],["Jiao","Wenxiang",""],["Wang","Wenxuan",""],["Huang","Jen-tse",""],["He","Pinjia",""],["Shi","Shuming",""],["Tu","Zhaopeng",""]]}
{"id":"2308.06464","submitter":"Jun Li","authors":"Jun Li, Minqing Zhang, Ke Niu, Yingnan Zhang, Xiaoyuan Yang","title":"A One-dimensional HEVC video steganalysis method using the Optimality of\n  Predicted Motion Vectors","comments":"Submitted to TCSVT","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Among steganalysis techniques, detection against motion vector (MV)\ndomain-based video steganography in High Efficiency Video Coding (HEVC)\nstandard remains a hot and challenging issue. For the purpose of improving the\ndetection performance, this paper proposes a steganalysis feature based on the\noptimality of predicted MVs with a dimension of one. Firstly, we point out that\nthe motion vector prediction (MVP) of the prediction unit (PU) encoded using\nthe Advanced Motion Vector Prediction (AMVP) technique satisfies the local\noptimality in the cover video. Secondly, we analyze that in HEVC video, message\nembedding either using MVP index or motion vector differences (MVD) may destroy\nthe above optimality of MVP. And then, we define the optimal rate of MVP in\nHEVC video as a steganalysis feature. Finally, we conduct steganalysis\ndetection experiments on two general datasets for three popular steganography\nmethods and compare the performance with four state-of-the-art steganalysis\nmethods. The experimental results show that the proposed optimal rate of MVP\nfor all cover videos is 100\\%, while the optimal rate of MVP for all stego\nvideos is less than 100\\%. Therefore, the proposed steganography scheme can\naccurately distinguish between cover videos and stego videos, and it is\nefficiently applied to practical scenarios with no model training and low\ncomputational complexity.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 04:51:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Jun",""],["Zhang","Minqing",""],["Niu","Ke",""],["Zhang","Yingnan",""],["Yang","Xiaoyuan",""]]}
{"id":"2308.06465","submitter":"Carter Butts","authors":"Peng Huang and Carter T. Butts","title":"California Exodus? A Network Model of Population Redistribution in the\n  United States","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by debates about California's net migration loss, we employ valued\nexponential-family random graph models to analyze the inter-county migration\nflow networks in the United States. We introduce a protocol that visualizes the\ncomplex effects of potential underlying mechanisms, and perform in silico\nknockout experiments to quantify their contribution to the California Exodus.\nWe find that racial dynamics contribute to the California Exodus, urbanization\nameliorates it, and political climate and housing costs have little impact.\nMoreover, the severity of the California Exodus depends on how one measures it,\nand California is not the state with the most substantial population loss. The\npaper demonstrates how generative statistical models can provide mechanistic\ninsights beyond simple hypothesis-testing.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 04:53:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Peng",""],["Butts","Carter T.",""]]}
{"id":"2308.06466","submitter":"Naresh Goud Boddu","authors":"Naresh Goud Boddu, Vipul Goyal, Rahul Jain, Jo\\~ao Ribeiro","title":"Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum\n  Messages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-malleable codes are fundamental objects at the intersection of\ncryptography and coding theory. These codes provide security guarantees even in\nsettings where error correction and detection are impossible, and have found\napplications to several other cryptographic tasks. Roughly speaking, a\nnon-malleable code for a family of tampering functions guarantees that no\nadversary can tamper (using functions from this family) the encoding of a given\nmessage into the encoding of a related distinct message. Non-malleable secret\nsharing schemes are a strengthening of non-malleable codes which satisfy\nadditional privacy and reconstruction properties.\n  We first focus on the $2$-split-state tampering model, one of the strongest\nand most well-studied adversarial tampering models. Here, a codeword is split\ninto two parts which are stored in physically distant servers, and the\nadversary can then independently tamper with each part using arbitrary\nfunctions. This model can be naturally extended to the secret sharing setting\nwith several parties by having the adversary independently tamper with each\nshare.\n  Previous works on non-malleable coding and secret sharing in the split-state\ntampering model only considered the encoding of \\emph{classical} messages.\nFurthermore, until the recent work by Aggarwal, Boddu, and Jain (arXiv 2022),\nadversaries with quantum capabilities and \\emph{shared entanglement} had not\nbeen considered, and it is a priori not clear whether previous schemes remain\nsecure in this model.\n  In this work, we introduce the notions of split-state non-malleable codes and\nsecret sharing schemes for quantum messages secure against quantum adversaries\nwith shared entanglement. We also present explicit constructions of such\nschemes that achieve low-error non-malleability.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:15:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Boddu","Naresh Goud",""],["Goyal","Vipul",""],["Jain","Rahul",""],["Ribeiro","Jo\u00e3o",""]]}
{"id":"2308.06467","submitter":"Roman Garaev","authors":"Roman Garaev, Bader Rasheed and Adil Khan","title":"Not So Robust After All: Evaluating the Robustness of Deep Neural\n  Networks to Unseen Adversarial Attacks","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks (DNNs) have gained prominence in various applications,\nsuch as classification, recognition, and prediction, prompting increased\nscrutiny of their properties. A fundamental attribute of traditional DNNs is\ntheir vulnerability to modifications in input data, which has resulted in the\ninvestigation of adversarial attacks. These attacks manipulate the data in\norder to mislead a DNN. This study aims to challenge the efficacy and\ngeneralization of contemporary defense mechanisms against adversarial attacks.\nSpecifically, we explore the hypothesis proposed by Ilyas et. al, which posits\nthat DNN image features can be either robust or non-robust, with adversarial\nattacks targeting the latter. This hypothesis suggests that training a DNN on a\ndataset consisting solely of robust features should produce a model resistant\nto adversarial attacks. However, our experiments demonstrate that this is not\nuniversally true. To gain further insights into our findings, we analyze the\nimpact of adversarial attack norms on DNN representations, focusing on samples\nsubjected to $L_2$ and $L_{\\infty}$ norm attacks. Further, we employ canonical\ncorrelation analysis, visualize the representations, and calculate the mean\ndistance between these representations and various DNN decision boundaries. Our\nresults reveal a significant difference between $L_2$ and $L_{\\infty}$ norms,\nwhich could provide insights into the potential dangers posed by $L_{\\infty}$\nnorm attacks, previously underestimated by the research community.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:21:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Garaev","Roman",""],["Rasheed","Bader",""],["Khan","Adil",""]]}
{"id":"2308.06468","submitter":"Xavier Soria Poma","authors":"Xavier Soria, Yachuan Li, Mohammad Rouhani and Angel D. Sappa","title":"Tiny and Efficient Model for the Edge Detection Generalization","comments":"To Appear in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Most high-level computer vision tasks rely on low-level image operations as\ntheir initial processes. Operations such as edge detection, image enhancement,\nand super-resolution, provide the foundations for higher level image analysis.\nIn this work we address the edge detection considering three main objectives:\nsimplicity, efficiency, and generalization since current state-of-the-art\n(SOTA) edge detection models are increased in complexity for better accuracy.\nTo achieve this, we present Tiny and Efficient Edge Detector (TEED), a light\nconvolutional neural network with only $58K$ parameters, less than $0.2$% of\nthe state-of-the-art models. Training on the BIPED dataset takes $less than 30\nminutes$, with each epoch requiring $less than 5 minutes$. Our proposed model\nis easy to train and it quickly converges within very first few epochs, while\nthe predicted edge-maps are crisp and of high quality. Additionally, we propose\na new dataset to test the generalization of edge detection, which comprises\nsamples from popular images used in edge detection and image segmentation. The\nsource code is available in https://github.com/xavysp/TEED.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:23:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Soria","Xavier",""],["Li","Yachuan",""],["Rouhani","Mohammad",""],["Sappa","Angel D.",""]]}
{"id":"2308.06469","submitter":"Kyosuke Tomonari","authors":"Kyosuke Tomonari and Sebastian Bahamonde","title":"Dirac-Bergmann analysis and Degrees of Freedom of Coincident\n  $f(Q)$-gravity","comments":"26 pages. v2: Added references and footnotes, revised main text and\n  appendix, for submission. 26 pages","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 physical degrees of freedom of $f(Q)$-gravity in a\n$4$-dimensional space-time under the imposition of the coincident gauge by\nperforming the Dirac-Bergmann analysis. In this work, we start with a top-down\nreconstruction of the metric-affine gauge theory of gravity based only on the\nconcept of a vector bundle. Then, the so-called geometrical trinity of gravity\nis introduced and the role of the coincident GR is clarified. After that, we\nreconstruct the Dirac-Bergmann analysis and reveal relationships between the\nboundary terms in the variational principle and the symplectic structure of the\ntheory in order to confirm the validity of the analysis for our studied\ntheories. Then, as examples, we revisit the analysis of GR and its\n$f(\\lc{R})$-extensions. Finally, after reviewing the Dirac-Bergmann analysis of\nthe coincident GR, we perform the analysis of coincident $f(Q)$-gravity. We\nfind that the theory has five primary, three secondary, and two tertiary\nconstraint densities and all these constraint densities are classified into\nsecond-class constraint density; the number six is the physical degrees of\nfreedom of the theory and there are no longer any remaining gauge degrees of\nfreedom.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:24:17 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:44:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tomonari","Kyosuke",""],["Bahamonde","Sebastian",""]]}
{"id":"2308.06470","submitter":"Zhenyuan Zhu","authors":"Zhenyuan Zhu, Fan Chen, Junyu Zhang, Zaiwen Wen","title":"On the Optimal Lower and Upper Complexity Bounds for a Class of\n  Composite Optimization Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the optimal lower and upper complexity bounds for finding\napproximate solutions to the composite problem $\\min_x\\ f(x)+h(Ax-b)$, where\n$f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$,\nfor strongly convex, convex, and nonconvex $f$, we design efficient first order\nalgorithms with complexities\n$\\tilde{O}\\left(\\kappa_A\\sqrt{\\kappa_f}\\log\\left(1/{\\epsilon}\\right)\\right)$,\n$\\tilde{O}\\left(\\kappa_A\\sqrt{L_f}D/\\sqrt{\\epsilon}\\right)$, and\n$\\tilde{O}\\left(\\kappa_A L_f\\Delta/\\epsilon^2\\right)$, respectively. Here,\n$\\kappa_A$ is the condition number of the matrix $A$ in the composition, $L_f$\nis the smoothness constant of $f$, and $\\kappa_f$ is the condition number of\n$f$ in the strongly convex case. $D$ is the initial point distance and $\\Delta$\nis the initial function value gap. Tight lower complexity bounds for the three\ncases are also derived and they match the upper bounds up to logarithmic\nfactors, thereby demonstrating the optimality of both the upper and lower\nbounds proposed in this paper.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:28:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Zhenyuan",""],["Chen","Fan",""],["Zhang","Junyu",""],["Wen","Zaiwen",""]]}
{"id":"2308.06471","submitter":"Athilingam Ramamoorthy","authors":"Karthik R., and Ramamoorthy A.","title":"Volterra Accentuated Non-Linear Dynamical Admittance (VANYA) to model\n  Deforestation: An Exemplification from the Amazon Rainforest","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligent automation supports us against cyclones, droughts, and seismic\nevents with recent technology advancements. Algorithmic learning has advanced\nfields like neuroscience, genetics, and human-computer interaction. Time-series\ndata boosts progress. Challenges persist in adopting these approaches in\ntraditional fields. Neural networks face comprehension and bias issues. AI's\nexpansion across scientific areas is due to adaptable descriptors and\ncombinatorial argumentation. This article focuses on modeling Forest loss using\nthe VANYA Model, incorporating Prey Predator Dynamics. VANYA predicts forest\ncover, demonstrated on Amazon Rainforest data against other forecasters like\nLong Short-Term Memory, N-BEATS, RCN.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:28:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["R.","Karthik",""],["A.","Ramamoorthy",""]]}
{"id":"2308.06472","submitter":"Kumari Nishu","authors":"Kumari Nishu, Minsik Cho, Paul Dixon, Devang Naik","title":"Flexible Keyword Spotting based on Homogeneous Audio-Text Embedding","comments":null,"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":"  Spotting user-defined/flexible keywords represented in text frequently uses\nan expensive text encoder for joint analysis with an audio encoder in an\nembedding space, which can suffer from heterogeneous modality representation\n(i.e., large mismatch) and increased complexity. In this work, we propose a\nnovel architecture to efficiently detect arbitrary keywords based on an\naudio-compliant text encoder which inherently has homogeneous representation\nwith audio embedding, and it is also much smaller than a compatible text\nencoder. Our text encoder converts the text to phonemes using a\ngrapheme-to-phoneme (G2P) model, and then to an embedding using representative\nphoneme vectors, extracted from the paired audio encoder on rich speech\ndatasets. We further augment our method with confusable keyword generation to\ndevelop an audio-text embedding verifier with strong discriminative power.\nExperimental results show that our scheme outperforms the state-of-the-art\nresults on Libriphrase hard dataset, increasing Area Under the ROC Curve (AUC)\nmetric from 84.21% to 92.7% and reducing Equal-Error-Rate (EER) metric from\n23.36% to 14.4%.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:41:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nishu","Kumari",""],["Cho","Minsik",""],["Dixon","Paul",""],["Naik","Devang",""]]}
{"id":"2308.06473","submitter":"Attila Krasznahorkay","authors":"A.J. Krasznahorkay, A. Krasznahorkay, M. Csatl\\'os, L. Csige, J.\n  Tim\\'ar, M. Begala, A. Krak\\'o, I. Rajta, I. Vajda","title":"Observation of the X17 anomaly in the decay of the Giant Dipole\n  Resonance of $^8$Be","comments":"5 pages, 7 figures. arXiv admin note: text overlap with\n  arXiv:2209.10795","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Angular correlation spectra of $e^+e^-$ pairs produced in the\n$^{7}$Li($p$,$\\gamma$)$^{8}$Be nuclear reaction were studied at a proton beam\nenergy of $E_p$~=~4.0~MeV, which corresponds to the excitation energy of the\nGiant Dipole Resonance (GDR) in $^8$Be. The spectra measured show a peak like\nanomaly at 120$^\\circ$ and a broader anomaly also above 140$^\\circ$. Both\nanomalies could consistently be described by assuming that the same\nhypothetical X17 particle was created both in the ground-state transition and\nin the transition going to the broad ($\\Gamma$=1.5~MeV), first excited state in\n$^8$Be. The invariant mass of the particle, which was derived to be $m_Xc^2 =\n16.95 \\pm 0.48$(stat.)~MeV, agrees well with our previously published values.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:49:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Krasznahorkay","A. J.",""],["Krasznahorkay","A.",""],["Csatl\u00f3s","M.",""],["Csige","L.",""],["Tim\u00e1r","J.",""],["Begala","M.",""],["Krak\u00f3","A.",""],["Rajta","I.",""],["Vajda","I.",""]]}
{"id":"2308.06474","submitter":"Xin Qin","authors":"Xin Qin, Navid Hashemi, Lars Lindemann, Jyotirmoy V. Deshmukh","title":"Conformance Testing for Stochastic Cyber-Physical Systems","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":"  Conformance is defined as a measure of distance between the behaviors of two\ndynamical systems. The notion of conformance can accelerate system design when\nmodels of varying fidelities are available on which analysis and control design\ncan be done more efficiently. Ultimately, conformance can capture distance\nbetween design models and their real implementations and thus aid in robust\nsystem design. In this paper, we are interested in the conformance of\nstochastic dynamical systems. We argue that probabilistic reasoning over the\ndistribution of distances between model trajectories is a good measure for\nstochastic conformance. Additionally, we propose the non-conformance risk to\nreason about the risk of stochastic systems not being conformant. We show that\nboth notions have the desirable transference property, meaning that conformant\nsystems satisfy similar system specifications, i.e., if the first model\nsatisfies a desirable specification, the second model will satisfy (nearly) the\nsame specification. Lastly, we propose how stochastic conformance and the\nnon-conformance risk can be estimated from data using statistical tools such as\nconformal prediction. We present empirical evaluations of our method on an F-16\naircraft, an autonomous vehicle, a spacecraft, and Dubin's vehicle.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:52:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qin","Xin",""],["Hashemi","Navid",""],["Lindemann","Lars",""],["Deshmukh","Jyotirmoy V.",""]]}
{"id":"2308.06475","submitter":"Justin Talbot","authors":"Justin J. Talbot, Juan E. Arias-Martinez, Stephen J. Cotton, and\n  Martin Head-Gordon","title":"Fantastical Excited State Optimized Structures and Where to Find Them","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantum chemistry community has developed analytic forces for approximate\nelectronic excited states to enable walking on excited state potential energy\nsurfaces (PES). One can thereby computationally characterize excited state\nminima and saddle points. Always implicit in using this machinery is the fact\nthat an excited state PES only exists within the realm of the Born-Oppenheimer\napproximation, where the nuclear and electronic degrees of freedom separate.\nThis work demonstrates through ab initio calculations and simple nonadiabatic\ndynamics that some excited state minimum structures are fantastical: they\nappear to exist as stable configurations only as a consequence of the PES\nconstruct, rather than being physically observable. One such case is the S2\nexcited state of phosphine and a second case are local minima of a number of\nstates of tris(bipyridine)ruthenium(II). Each fantastical structure exhibits an\nunphysically high predicted harmonic frequency and associated force constant.\nThis fact can serve as a valuable diagnostic of when an optimized excited state\nstructure is non-observable. Their origin lies in the coupling between\ndifferent electronic states, and the resulting avoided crossings. The upper\nstate may exhibit a minimum very close to the crossing, where the force\nconstant relates to the strength of the electronic coupling rather than to any\ncharacteristic excited state vibration. Nonadiabatic dynamics results using a\nLandau-Zener model illustrate that fantastical excited state structures have\nextremely short lifetimes on the order of a few femtoseconds. Their appearance\nin a calculation signals the presence of a nearby avoided crossing or conical\nintersection through which the system will rapidly cross to a lower surface.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:53:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Talbot","Justin J.",""],["Arias-Martinez","Juan E.",""],["Cotton","Stephen J.",""],["Head-Gordon","Martin",""]]}
{"id":"2308.06476","submitter":"Priyabrat Gochhayat","authors":"Akash Meher and Priyabrat Gochhayat","title":"Improved Bohr radius for $ k$-fold symmetric univalent logharmonic\n  mappings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the $k$-fold symmetric starlike univalent logharmonic mappings of\nthe form $f(z)=zh(z)\\overline{g(z)}$ in the unit disk $\\mathbb{D}:= \\lbrace z\n\\in \\mathbb{C}: |z|<1 \\rbrace$ with several examples, where $h(z)=\\exp\n\\left(\\sum_{n=1}^{\\infty}a_{nk}z^{nk}\\right)$ and $g(z)=\\exp\n\\left(\\sum_{n=1}^{\\infty}b_{nk}z^{nk}\\right)$ are analytic in $\\mathbb{D}.$ The\ndistortion bounds of these functions are obtained, which give area bounds.\nImproved Bohr radii for this family are calculated. We also introduce the\npre-Schwarzian and Schwarzian derivatives of logharmonic mappings that vanish\nat the origin.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:03:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Meher","Akash",""],["Gochhayat","Priyabrat",""]]}
{"id":"2308.06477","submitter":"Alvaro Fernandez-Quilez","authors":"Tim Nikolass Lindeijer, Tord Martin Ytredal, Trygve Eftest{\\o}l,\n  Tobias Nordstr\\\"om, Fredrik J\\\"aderling, Martin Eklund and Alvaro\n  Fernandez-Quilez","title":"Leveraging multi-view data without annotations for prostate MRI\n  segmentation: A contrastive approach","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  An accurate prostate delineation and volume characterization can support the\nclinical assessment of prostate cancer. A large amount of automatic prostate\nsegmentation tools consider exclusively the axial MRI direction in spite of the\navailability as per acquisition protocols of multi-view data. Further, when\nmulti-view data is exploited, manual annotations and availability at test time\nfor all the views is commonly assumed. In this work, we explore a contrastive\napproach at training time to leverage multi-view data without annotations and\nprovide flexibility at deployment time in the event of missing views. We\npropose a triplet encoder and single decoder network based on U-Net, tU-Net\n(triplet U-Net). Our proposed architecture is able to exploit non-annotated\nsagittal and coronal views via contrastive learning to improve the segmentation\nfrom a volumetric perspective. For that purpose, we introduce the concept of\ninter-view similarity in the latent space. To guide the training, we combine a\ndice score loss calculated with respect to the axial view and its manual\nannotations together with a multi-view contrastive loss. tU-Net shows\nstatistical improvement in dice score coefficient (DSC) with respect to only\naxial view (91.25+-0.52% compared to 86.40+-1.50%,P<.001). Sensitivity analysis\nreveals the volumetric positive impact of the contrastive loss when paired with\ntU-Net (2.85+-1.34% compared to 3.81+-1.88%,P<.001). Further, our approach\nshows good external volumetric generalization in an in-house dataset when\ntested with multi-view data (2.76+-1.89% compared to 3.92+-3.31%,P=.002),\nshowing the feasibility of exploiting non-annotated multi-view data through\ncontrastive learning whilst providing flexibility at deployment in the event of\nmissing views.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:07:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lindeijer","Tim Nikolass",""],["Ytredal","Tord Martin",""],["Eftest\u00f8l","Trygve",""],["Nordstr\u00f6m","Tobias",""],["J\u00e4derling","Fredrik",""],["Eklund","Martin",""],["Fernandez-Quilez","Alvaro",""]]}
{"id":"2308.06478","submitter":"Shih Yu Chang","authors":"Shih-Yu Chang","title":"Tail bounds for Multivariate Random Tensor Means","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OA math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our recent research endeavors, we have delved into the realm of tail\nbounds problems concerning bivariate random tensor means. In this context,\ntensors are treated as finite-dimensional operators. However, the longstanding\nchallenge of extending the concept of operator means to scenarios involving\nmore than two variables had persisted. The primary objective of this present\nstudy is to unveil a collection of tail bounds applicable to multivariate\nrandom tensor means. These encompass the weighted arithmetic mean, weighted\nharmonic mean, and the Karcher mean. These bounds are derived through the\nutilization of Ando-Hiai's inequalities, alongside tail bounds specifically\ntailored for multivariate random tensor means employing reverse Ando-Hiai's\ninequalities, which are rooted in Kantorovich constants. Notably, our\nmethodology involves employing the concept of deformation for operator means\nwith multiple variables, following the principles articulated in Hiai, Seo and\nWada's recent work. Additionally, our research contributes to the expansion\nabout the Karcher mean differentiable region from the vicinity of the diagonal\nidentity element within the Cartesian product space of positive definite\ntensors to the vicinity of the general element within the Cartesian product\nspace of positive definite tensors via the application of the inverse and\nimplicit function theorem.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:12:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chang","Shih-Yu",""]]}
{"id":"2308.06479","submitter":"Jia Zhang","authors":"Jia Zhang, Xin Na, Rui Xi, Yimiao Sun, Yuan He","title":"mmHawkeye: Passive UAV Detection with a COTS mmWave Radar","comments":"9 pages, 14 figures, IEEE SECON2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Small Unmanned Aerial Vehicles (UAVs) are becoming potential threats to\nsecurity-sensitive areas and personal privacy. A UAV can shoot photos at\nheight, but how to detect such an uninvited intruder is an open problem. This\npaper presents mmHawkeye, a passive approach for UAV detection with a COTS\nmillimeter wave (mmWave) radar. mmHawkeye doesn't require prior knowledge of\nthe type, motions, and flight trajectory of the UAV, while exploiting the\nsignal feature induced by the UAV's periodic micro-motion (PMM) for long-range\naccurate detection. The design is therefore effective in dealing with low-SNR\nand uncertain reflected signals from the UAV. mmHawkeye can further track the\nUAV's position with dynamic programming and particle filtering, and identify it\nwith a Long Short-Term Memory (LSTM) based detector. We implement mmHawkeye on\na commercial mmWave radar and evaluate its performance under varied settings.\nThe experimental results show that mmHawkeye has a detection accuracy of 95.8%\nand can realize detection at a range up to 80m.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:14:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Jia",""],["Na","Xin",""],["Xi","Rui",""],["Sun","Yimiao",""],["He","Yuan",""]]}
{"id":"2308.06480","submitter":"Yunshan Ma","authors":"Yunshan Ma, Chenchen Ye, Zijian Wu, Xiang Wang, Yixin Cao, Tat-Seng\n  Chua","title":"Context-aware Event Forecasting via Graph Disentanglement","comments":"KDD 2023, 9 pages, 7 figures, 4 tables","journal-ref":null,"doi":"10.1145/3580305.3599285","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Event forecasting has been a demanding and challenging task throughout the\nentire human history. It plays a pivotal role in crisis alarming and disaster\nprevention in various aspects of the whole society. The task of event\nforecasting aims to model the relational and temporal patterns based on\nhistorical events and makes forecasting to what will happen in the future. Most\nexisting studies on event forecasting formulate it as a problem of link\nprediction on temporal event graphs. However, such pure structured formulation\nsuffers from two main limitations: 1) most events fall into general and\nhigh-level types in the event ontology, and therefore they tend to be\ncoarse-grained and offers little utility which inevitably harms the forecasting\naccuracy; and 2) the events defined by a fixed ontology are unable to retain\nthe out-of-ontology contextual information. To address these limitations, we\npropose a novel task of context-aware event forecasting which incorporates\nauxiliary contextual information. First, the categorical context provides\nsupplementary fine-grained information to the coarse-grained events. Second and\nmore importantly, the context provides additional information towards specific\nsituation and condition, which is crucial or even determinant to what will\nhappen next. However, it is challenging to properly integrate context into the\nevent forecasting framework, considering the complex patterns in the\nmulti-context scenario. Towards this end, we design a novel framework named\nSeparation and Collaboration Graph Disentanglement (short as SeCoGD) for\ncontext-aware event forecasting. Since there is no available dataset for this\nnovel task, we construct three large-scale datasets based on GDELT.\nExperimental results demonstrate that our model outperforms a list of SOTA\nmethods.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:23:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Yunshan",""],["Ye","Chenchen",""],["Wu","Zijian",""],["Wang","Xiang",""],["Cao","Yixin",""],["Chua","Tat-Seng",""]]}
{"id":"2308.06481","submitter":"Alvaro Fernandez-Quilez","authors":"Alvaro Fernandez-Quilez, Linas Vidziunas, {\\O}rjan Kl{\\o}vfjell\n  Thoresen, Ketil Oppedal, Svein Reidar Kjosavik, Trygve Eftest{\\o}l","title":"Out-of-distribution multi-view auto-encoders for prostate cancer lesion\n  detection","comments":"Accepted and presented in ISBI 2023. To be published in Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Traditional deep learning (DL) approaches based on supervised learning\nparadigms require large amounts of annotated data that are rarely available in\nthe medical domain. Unsupervised Out-of-distribution (OOD) detection is an\nalternative that requires less annotated data. Further, OOD applications\nexploit the class skewness commonly present in medical data. Magnetic resonance\nimaging (MRI) has proven to be useful for prostate cancer (PCa) diagnosis and\nmanagement, but current DL approaches rely on T2w axial MRI, which suffers from\nlow out-of-plane resolution. We propose a multi-stream approach to accommodate\ndifferent T2w directions to improve the performance of PCa lesion detection in\nan OOD approach. We evaluate our approach on a publicly available data-set,\nobtaining better detection results in terms of AUC when compared to a single\ndirection approach (73.1 vs 82.3). Our results show the potential of OOD\napproaches for PCa lesion detection based on MRI.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:33:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fernandez-Quilez","Alvaro",""],["Vidziunas","Linas",""],["Thoresen","\u00d8rjan Kl\u00f8vfjell",""],["Oppedal","Ketil",""],["Kjosavik","Svein Reidar",""],["Eftest\u00f8l","Trygve",""]]}
{"id":"2308.06482","submitter":"Felipe Taha Sant'Ana","authors":"Oleksandr Gamayun, Mi{\\l}osz Panfil, Felipe Taha Sant'Ana","title":"Kubo-Martin-Schwinger relation for an interacting mobile impurity","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas math-ph math.MP nlin.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we study the Kubo-Martin-Schwinger (KMS) relation in the\nYang-Gaudin model of an interacting mobile impurity. We use the integrability\nof the model to compute the dynamic injection and ejection Green's functions at\nfinite temperatures. We show that due to separability of the Hilbert space with\nan impurity, the ejection Green's in a canonical ensemble cannot be reduced to\na single expectation value as per microcanonical picture. Instead, it involves\na thermal average over contributions from different subspaces of the Hilbert\nspace which, due to the integrability, are resolved using the so-called spin\nrapidity. It is then natural to consider the injection and ejection Green's\nfunctions within each subspace. By means of reformulating the original KMS\ncondition as a Riemann-Hilbert problem, we analytically demonstrate that such\nGreen's functions obey a refined analogous relation, which is finally\ncorroborated by numerical evaluation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:40:07 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 20:06:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gamayun","Oleksandr",""],["Panfil","Mi\u0142osz",""],["Sant'Ana","Felipe Taha",""]]}
{"id":"2308.06483","submitter":"Yenan Zhang","authors":"Yenan Zhang and Hiroshi Watanabe","title":"BigWavGAN: A Wave-To-Wave Generative Adversarial Network for Music\n  Super-Resolution","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":"  Generally, Deep Neural Networks (DNNs) are expected to have high performance\nwhen their model size is large. However, large models failed to produce\nhigh-quality results commensurate with their scale in music Super-Resolution\n(SR). We attribute this to that DNNs cannot learn information commensurate with\ntheir size from standard mean square error losses. To unleash the potential of\nlarge DNN models in music SR, we propose BigWavGAN, which incorporates Demucs,\na large-scale wave-to-wave model, with State-Of-The-Art (SOTA) discriminators\nand adversarial training strategies. Our discriminator consists of Multi-Scale\nDiscriminator (MSD) and Multi-Resolution Discriminator (MRD). During inference,\nsince only the generator is utilized, there are no additional parameters or\ncomputational resources required compared to the baseline model Demucs.\nObjective evaluation affirms the effectiveness of BigWavGAN in music SR.\nSubjective evaluations indicate that BigWavGAN can generate music with\nsignificantly high perceptual quality over the baseline model. Notably,\nBigWavGAN surpasses the SOTA music SR model in both simulated and real-world\nscenarios. Moreover, BigWavGAN represents its superior generalization ability\nto address out-of-distribution data. The conducted ablation study reveals the\nimportance of our discriminators and training strategies. Samples are available\non the demo page.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:40:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Yenan",""],["Watanabe","Hiroshi",""]]}
{"id":"2308.06484","submitter":"Nazanin Hadiniya","authors":"Nazanin Hadiniya, Mohammad Ghodsi","title":"A parallel algorithm for Delaunay triangulation of moving points on the\n  plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Delaunay Triangulation(DT) is one of the important geometric problems that is\nused in various branches of knowledge such as computer vision, terrain\nmodeling, spatial clustering and networking. Kinetic data structures have\nbecome very important in computational geometry for dealing with moving\nobjects. However, when dealing with moving points, maintaining a dynamically\nchanging Delaunay triangulation can be challenging. So, In this case, we have\nto update triangulation repeatedly. If points move so far, it is better to\nrebuild the triangulation. One approach to handle moving points is to use an\nincremental algorithm. For the case that points move slowly, we can give a\nfaster algorithm than rebuilding it. Furthermore, sequential algorithms can be\ncomputationally expensive for large datasets. So, one way to compute as fast as\npossible is parallelism. In this paper, we propose a parallel algorithm for\nmoving points. we propose an algorithm that divides datasets into equal\npartitions and give every partition to one block. Each block satisfay the\nDelaunay constraints after each time step and uses delete and insert algorithms\nto do this. We show this algorithm works faster than serial algorithms.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:48:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hadiniya","Nazanin",""],["Ghodsi","Mohammad",""]]}
{"id":"2308.06485","submitter":"Dong Cheng","authors":"Xiaoxiao Hu, Kit Ian Kou, Cuiming Zou, Dong Cheng","title":"The Color Clifford Hardy Signal: Application to Color Edge Detection and\n  Optical Flow","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces the idea of the color Clifford Hardy signal, which can\nbe used to process color images. As a complex analytic function's\nhigh-dimensional analogue, the color Clifford Hardy signal inherits many\ndesirable qualities of analyticity. A crucial tool for getting the color and\nstructural data is the local feature representation of a color image in the\ncolor Clifford Hardy signal. By looking at the extended Cauchy-Riemann\nequations in the high-dimensional space, it is possible to see the connection\nbetween the different parts of the color Clifford Hardy signal. Based on the\ndistinctive and important local amplitude and local phase generated by the\ncolor Clifford Hardy signal, we propose five methods to identify the edges of\ncolor images with relation to a certain color. To prove the superiority of the\noffered methodologies, numerous comparative studies employing image quality\nassessment criteria are used. Specifically by using the multi-scale structure\nof the color Clifford Hardy signal, the proposed approaches are resistant to a\nvariety of noises. In addition, a color optical flow detection method with\nanti-noise ability is provided as an example of application.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:52:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Xiaoxiao",""],["Kou","Kit Ian",""],["Zou","Cuiming",""],["Cheng","Dong",""]]}
{"id":"2308.06486","submitter":"Wenbin Li","authors":"Ziye Zhu, Jingshan Qi, Xiaorui Zheng, Xiao Lin, Wenbin Li","title":"Polar discontinuities and interfacial electronic properties of\n  Bi$_2$O$_2$Se on SrTiO$_3$","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The layered oxychalcogenide semiconductor Bi$_2$O$_2$Se (BOS) hosts a\nmultitude of unusual properties including high electron mobility. Owing to\nsimilar crystal symmetry and lattice constants, the perovskite oxide SrTiO$_3$\n(STO) has been demonstrated to be an excellent substrate for wafer-scale growth\nof atomically thin BOS films. However, the structural and electronic properties\nof the BOS/STO interface remain poorly understood. Here, through\nfirst-principles study, we reveal that polar discontinuities and interfacial\ncontact configurations have a strong impact on the electronic properties of\nideal BOS/STO interfaces. The lowest-energy [Bi-TiO$_2$] contact type, which\nfeatures the contact between a Bi$_2$O$_2$ layer of BOS with the\nTiO$_2$-terminated surface of STO, incurs significant interfacial charge\ntransfer from BOS to STO, producing a BOS/STO-mixed, $n$-type metallic state at\nthe interface. By contrast, the [Se-SrO] contact type, which is the most stable\ncontact configuration between BOS and SrO-terminated STO substrate, has a much\nsmaller interfacial charge transfer from STO to BOS and exhibits $p$-type\nelectronic structure with much weaker interfacial hybridization between BOS and\nSTO. These results indicate that BOS grown on TiO$_2$-terminated STO substrates\ncould be a fruitful system for exploring emergent phenomena at the interface\nbetween an oxychalcogenide and an oxide, whereas BOS grown on SrO-terminated\nsubstrates may be more advantageous for preserving the excellent intrinsic\ntransport properties of BOS.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 06:55:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Ziye",""],["Qi","Jingshan",""],["Zheng","Xiaorui",""],["Lin","Xiao",""],["Li","Wenbin",""]]}
{"id":"2308.06487","submitter":"Gamal G.L. Nashed","authors":"G. G. L. Nashed and Kazuharu Bamba","title":"Slow Kerr-NUT black hole solution in dynamical Chern-Simons modified\n  gravity","comments":"14 pages","journal-ref":"Nuclear Physics B Volume 994, September 2023, 116325","doi":"10.1016/j.nuclphysb.2023.116325","report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The slow rotation of Kerr-NUT spacetime is explored by taking into account\nthe linear form of rotation and NUT parameters in the dynamical Chern-Simon\ngravity theory, which can be formulated from a scalar field describing the\nbackground. We show that in the absence of the potential scalar field, the\nmetric potential does not respect the effect of the NUT parameter, although the\nscalar field is affected by the rotation and NUT parameters. Consequently,\nunlike the gradually spinning black hole solution outlined in\n\\cite{Alexander:2009tp}, the mixed component of the metric potential,\nencompassing both rotational and NUT parameters, doesn't make a contribution at\nthe primary level of the initial perturbation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:07:33 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 10:51:39 GMT"},{"version":"v3","created":"Sun, 20 Aug 2023 08:22:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nashed","G. G. L.",""],["Bamba","Kazuharu",""]]}
{"id":"2308.06488","submitter":"Tahsina Hashem","authors":"Tahsina Hashem, Weiqing Wang, Derry Tanti Wijaya, Mohammed Eunus Ali,\n  Yuan-Fang Li","title":"Generating Faithful Text From a Knowledge Graph with Noisy Reference\n  Text","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge Graph (KG)-to-Text generation aims at generating fluent\nnatural-language text that accurately represents the information of a given\nknowledge graph. While significant progress has been made in this task by\nexploiting the power of pre-trained language models (PLMs) with appropriate\ngraph structure-aware modules, existing models still fall short of generating\nfaithful text, especially when the ground-truth natural-language text contains\nadditional information that is not present in the graph. In this paper, we\ndevelop a KG-to-text generation model that can generate faithful\nnatural-language text from a given graph, in the presence of noisy reference\ntext. Our framework incorporates two core ideas: Firstly, we utilize\ncontrastive learning to enhance the model's ability to differentiate between\nfaithful and hallucinated information in the text, thereby encouraging the\ndecoder to generate text that aligns with the input graph. Secondly, we empower\nthe decoder to control the level of hallucination in the generated text by\nemploying a controllable text generation technique. We evaluate our model's\nperformance through the standard quantitative metrics as well as a\nChatGPT-based quantitative and qualitative analysis. Our evaluation\ndemonstrates the superior performance of our model over state-of-the-art\nKG-to-text models on faithfulness.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:12:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hashem","Tahsina",""],["Wang","Weiqing",""],["Wijaya","Derry Tanti",""],["Ali","Mohammed Eunus",""],["Li","Yuan-Fang",""]]}
{"id":"2308.06489","submitter":"Li Li","authors":"Qibo Ma and Li Li","title":"The well-posedness of three-dimensional Navier-Stokes and\n  magnetohydrodynamic equations with partial fractional dissipation","comments":"44 pages, 0 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is well-known that if one replaces standard velocity and magnetic\ndissipation by $(-\\Delta)^\\alpha u$ and $(-\\Delta)^\\beta b$ respectively, the\nmagnetohydrodynamic equations are well-posed for $\\alpha\\ge\\frac{5}{4}$ and\n$\\alpha + \\beta \\ge \\frac{5}{2}$. This paper considers the 3D Navier-Stokes and\nmagnetohydrodynamic equations with partial fractional hyper-dissipation. It is\nproved that when each component of the velocity and magnetic field lacks\ndissipation along some direction, the existence and conditional uniqueness of\nthe solution still hold. This paper extends the previous results in (Yang, Jiu\nand Wu J. Differential Equations 266(1): 630-652, 2019) to a more general case.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:22:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Qibo",""],["Li","Li",""]]}
{"id":"2308.06490","submitter":"Tianyuan Yu","authors":"Tianyuan Yu, Xinyu Ma, Hongcheng Xie, Xiaohua Jia, Lixia Zhang","title":"On the Security Bootstrapping in Named Data Networking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By requiring all data packets been cryptographically authenticatable, the\nNamed Data Networking (NDN) architecture design provides a basic building block\nfor secured networking. This basic NDN function requires that all entities in\nan NDN network go through a security bootstrapping process to obtain the\ninitial security credentials. Recent years have witnessed a number of proposed\nsolutions for NDN security bootstrapping protocols. Built upon the existing\nresults, in this paper we take the next step to develop a systematic model of\nsecurity bootstrapping: Trust-domain Entity Bootstrapping (TEB). This model is\nbased on the emerging concept of trust domain and describes the steps and their\ndependencies in the bootstrapping process. We evaluate the expressiveness and\nsufficiency of this model by using it to describe several current bootstrapping\nprotocols.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:27:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yu","Tianyuan",""],["Ma","Xinyu",""],["Xie","Hongcheng",""],["Jia","Xiaohua",""],["Zhang","Lixia",""]]}
{"id":"2308.06491","submitter":"Kalyan Dasgupta","authors":"Mostafizur Rahaman Laskar, Kalyan Dasgupta, Atanu Bhattacharya","title":"A Proposed Quantum Hamiltonian Encoding Framework for Time Evolution\n  Operator Design of Potential Energy Function","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The exploration of potential energy operators in quantum systems holds\nparamount significance, offering profound insights into atomic behaviour,\ndefining interactions, and enabling precise prediction of molecular dynamics.\nBy embracing the Born-Oppenheimer picture, we delve into the intricate quantum\nevolution due to potential energy, facilitating accurate modelling and\nsimulation of atomic phenomena with improved quantum fidelity. This research\ndelves into time evolution operation due to potential energy functions for\napplications spanning quantum chemistry and condensed matter physics.\nChallenges in practical implementation, encompassing the formidable curse of\ndimensionality and intricate entangled interactions, are thoughtfully examined.\nDrawing upon seminal works, we lay a robust foundation for comprehensive\ninvestigations into potential energy landscapes with two proposed algorithms.\nIn one methodology, we have shown a systematic decomposition of the potential\nenergy function into Hadamard bases with composite construction of Pauli-Z,\nidentity and RZ gates which can construct the unitary time evolution operator\ncorresponding to the potential energy with a very high fidelity. The other\nmethod is a trade-off between complexity and fidelity, where we propose a novel\nquantum framework that can reduce the gate complexity from {\\Theta}(2n) to\n{\\Theta}(nCr ) (for some r < n). The proposed quantum algorithms are capable of\nefficiently simulating potential energy operators. The algorithms were\nimplemented in simulators and IBM quantum hardware to prove their efficacy\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:37:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Laskar","Mostafizur Rahaman",""],["Dasgupta","Kalyan",""],["Bhattacharya","Atanu",""]]}
{"id":"2308.06492","submitter":"Jessica Perrero","authors":"Jessica Perrero, Piero Ugliengo, Cecilia Ceccarelli, Albert Rimola","title":"Quantum mechanical modeling of the grain-surface formation of\n  acetaldehyde on H$_2$O:CO dirty ice surfaces","comments":"15 pages, 11 figures, Accepted for publication in Monthly Notices of\n  the Royal Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Acetaldehyde (CH$_3$CHO) is one of the most detected interstellar Complex\nOrganic Molecule (iCOM) in the interstellar medium (ISM). These species have a\npotential biological relevance, as they can be precursors of more complex\nspecies from which life could have emerged. The formation of iCOMs in the ISM\nis a challenge and a matter of debate, whether gas-phase, grain-surface\nchemistry or both are needed for their synthesis. In the gas-phase, CH$_3$CHO\ncan be efficiently synthesized from ethanol and/or ethyl radical. On the\ngrain-surfaces, radical-radical recombinations were traditionally invoked.\nHowever, several pitfalls have been recently identified, such as the presence\nof energy barriers and competitive side reactions (i.e., H abstractions). Here\nwe investigate a new grain-surface reaction pathway for the formation of\nacetaldehyde, namely the reaction between CH$_3$ and a CO molecule of a dirty\nwater/CO ice followed by hydrogenation of its product, CH$_3$CO. To this end,\nwe carried out \\textit{ab initio} computations of the reaction occurring on an\nice composed by 75% water and 25% CO molecules. We found that the CH$_3$ +\nCO$_{(ice)}$ reaction exhibits barriers difficult to overcome in the ISM,\neither adopting a Langmuir-Hinshelwood or an Eley-Rideal mechanism. The\nsubsequent hydrogenation step is found to be barrierless, provided that the two\nreacting species have the correct orientation. Therefore, this pathway seems\nunlikely to occur in the ISM.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:41:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Perrero","Jessica",""],["Ugliengo","Piero",""],["Ceccarelli","Cecilia",""],["Rimola","Albert",""]]}
{"id":"2308.06493","submitter":"Jiaxi Jiang","authors":"Jiaxi Jiang, Paul Streli, Manuel Meier, Christian Holz","title":"EgoPoser: Robust Real-Time Ego-Body Pose Estimation in Large Scenes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Full-body ego-pose estimation from head and hand poses alone has become an\nactive area of research to power articulate avatar representation on\nheadset-based platforms. However, existing methods over-rely on the confines of\nthe motion-capture spaces in which datasets were recorded, while simultaneously\nassuming continuous capture of joint motions and uniform body dimensions. In\nthis paper, we propose EgoPoser, which overcomes these limitations by 1)\nrethinking the input representation for headset-based ego-pose estimation and\nintroducing a novel motion decomposition method that predicts full-body pose\nindependent of global positions, 2) robustly modeling body pose from\nintermittent hand position and orientation tracking only when inside a\nheadset's field of view, and 3) generalizing across various body sizes for\ndifferent users. Our experiments show that EgoPoser outperforms\nstate-of-the-art methods both qualitatively and quantitatively, while\nmaintaining a high inference speed of over 600 fps. EgoPoser establishes a\nrobust baseline for future work, where full-body pose estimation needs no\nlonger rely on outside-in capture and can scale to large-scene environments.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:46:50 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 14:50:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiang","Jiaxi",""],["Streli","Paul",""],["Meier","Manuel",""],["Holz","Christian",""]]}
{"id":"2308.06494","submitter":"Marin Lauber Dr","authors":"Marin Lauber, Gabriel D. Weymouth, Georges Limbert","title":"Immersed-Boundary Fluid-Structure Interaction of Membranes and Shells","comments":"11 pages, 6 figures, paper presented at EuroDyn 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a general and robust method for the fluid-structure\ninteraction of membranes and shells undergoing large displacement and large\nadded-mass effects by coupling an immersed-boundary method with a shell\nfinite-element model. The immersed boundary method can accurately simulate the\nfluid velocity and pressure induced by dynamic bodies undergoing large\ndisplacements using a computationally efficient pressure projection finite\nvolume solver. The structural solver can be applied to bending and\nmembrane-related problems, making our partitioned solver very general. We use a\nstrongly-coupled algorithm that avoids the expensive computation of the inverse\nJacobian within the root-finding iterations by constructing it from\ninput-output pairs of the coupling variables from the previous time steps.\nUsing two examples with large deformations and added mass contributions, we\ndemonstrate that the resulting quasi-Newton scheme is stable, accurate, and\ncomputationally efficient.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:56:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lauber","Marin",""],["Weymouth","Gabriel D.",""],["Limbert","Georges",""]]}
{"id":"2308.06495","submitter":"Bartosz Malman","authors":"Bartosz Malman","title":"Shift operators, Cauchy integrals and approximations","comments":"Version 1.0. Any input and comments are highly welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article consists of two connected parts, results of which might be of\nindependent interest. In the first part, we study the shift invariant subspaces\nin certain $\\mathcal{P}^2(\\mu)$-spaces, which are the closures of analytic\npolynomials in the Lebesgue spaces $\\mathcal{L}^2(\\mu)$ defined by a class of\nmeasures $\\mu$ living on the closed unit disk $\\overline{\\mathbb{D}}$. The\nmeasures $\\mu$ which occur in our study have a part on the open disk\n$\\mathbb{D}$ which is radial and decreases at least exponentially fast near the\nboundary. Our focus is on those shift invariant subspaces which are generated\nby a bounded function in $H^\\infty$. In this context, our results are\ndefinitive. We give a characterization of the cyclic singular inner functions\nby an explicit and readily verifiable condition, and we establish certain\npermanence properties of non-cyclic ones which are important in the\napplications. Our applications take up the second part of the article, and\nconcern removal of singularities, \\`a la Khrushchev, of Cauchy integrals, a\nproblem which is in many ways similar to the problem of characterizing density\nof certain classes of functions in de Branges-Rovnyak spaces $\\mathcal{H}(b)$.\nWe prove that if a function $g \\in \\mathcal{L}^1(\\mathbb{T})$ on the unit\ncircle $\\mathbb{T}$ has a Cauchy transform with Taylor coefficients of order\n$O(\\exp(-c \\sqrt{n})$ for some $c > 0$, then the set $U = \\{x \\in \\mathbb{T} :\n|g(x) > 0 \\}$ is essentially open and $\\log |g|$ is locally integrable on $U$.\nAnother one of our results establishes a simple characterization of those\nsymbols $b$ with the property that the space $\\mathcal{H}(b)$ contains a dense\nsubset of functions which, in a sense, just barely fail to have an analytic\ncontinuation to a disk of radius larger than 1. We indicate how close our\nresults are to being optimal and pose a few questions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:56:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Malman","Bartosz",""]]}
{"id":"2308.06496","submitter":"Zhigang Yan","authors":"Zhigang Yan and Dong Li","title":"Performance Analysis for Resource Constrained Decentralized Federated\n  Learning Over Wireless Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.PF eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) can lead to significant communication overhead and\nreliance on a central server. To address these challenges, decentralized\nfederated learning (DFL) has been proposed as a more resilient framework. DFL\ninvolves parameter exchange between devices through a wireless network. This\nstudy analyzes the performance of resource-constrained DFL using different\ncommunication schemes (digital and analog) over wireless networks to optimize\ncommunication efficiency. Specifically, we provide convergence bounds for both\ndigital and analog transmission approaches, enabling analysis of the model\nperformance trained on DFL. Furthermore, for digital transmission, we\ninvestigate and analyze resource allocation between computation and\ncommunication and convergence rates, obtaining its communication complexity and\nthe minimum probability of correction communication required for convergence\nguarantee. For analog transmission, we discuss the impact of channel fading and\nnoise on the model performance and the maximum errors accumulation with\nconvergence guarantee over fading channels. Finally, we conduct numerical\nsimulations to evaluate the performance and convergence rate of convolutional\nneural networks (CNNs) and Vision Transformer (ViT) trained in the DFL\nframework on fashion-MNIST and CIFAR-10 datasets. Our simulation results\nvalidate our analysis and discussion, revealing how to improve performance by\noptimizing system parameters under different communication conditions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:56:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yan","Zhigang",""],["Li","Dong",""]]}
{"id":"2308.06497","submitter":"Sabine Andergassen","authors":"Sarah Heinzelmann, Alessandro Toschi, and Sabine Andergassen","title":"Entangled magnetic, charge, and superconducting pairing correlations in\n  the two-dimensional Hubbard model: a functional renormalization-group\n  analysis","comments":"31 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using the recently introduced multiloop extension of the functional\nrenormalization group, we compute the magnetic, density, and superconducting\nsusceptibilities of the two-dimensional Hubbard model at weak coupling and\npresent a detailed analysis of their evolution with temperature, interaction\nstrength, and loop order. By breaking down the susceptibilities into\ncontributions from the bare susceptibility and the individual channels, we\ninvestigate their relative importance as well as the channel interplay. In\nparticular, we trace the influence of antiferromagnetic fluctuations on the\n$d$-wave superconductivity and provide an analytical understanding for the\nobserved behavior.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:21:56 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 15:58:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Heinzelmann","Sarah",""],["Toschi","Alessandro",""],["Andergassen","Sabine",""]]}
{"id":"2308.06498","submitter":"Kaiqi Chen","authors":"Kaiqi Chen, Jing Yu Lim, Kingsley Kuan, Harold Soh","title":"Latent Emission-Augmented Perspective-Taking (LEAPT) for Human-Robot\n  Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC cs.RO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Perspective-taking is the ability to perceive or understand a situation or\nconcept from another individual's point of view, and is crucial in daily human\ninteractions. Enabling robots to perform perspective-taking remains an unsolved\nproblem; existing approaches that use deterministic or handcrafted methods are\nunable to accurately account for uncertainty in partially-observable settings.\nThis work proposes to address this limitation via a deep world model that\nenables a robot to perform both perception and conceptual perspective taking,\ni.e., the robot is able to infer what a human sees and believes. The key\ninnovation is a decomposed multi-modal latent state space model able to\ngenerate and augment fictitious observations/emissions. Optimizing the ELBO\nthat arises from this probabilistic graphical model enables the learning of\nuncertainty in latent space, which facilitates uncertainty estimation from\nhigh-dimensional observations. We tasked our model to predict human\nobservations and beliefs on three partially-observable HRI tasks. Experiments\nshow that our method significantly outperforms existing baselines and is able\nto infer visual observations available to other agent and their internal\nbeliefs.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:22:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Kaiqi",""],["Lim","Jing Yu",""],["Kuan","Kingsley",""],["Soh","Harold",""]]}
{"id":"2308.06499","submitter":"Daniele Peri","authors":"Daniele Peri","title":"Regularization of Kriging interpolation on irregularly spaced data","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":"  Interpolation models are critical for a wide range of applications, from\nnumerical optimization to artificial intelligence. The reliability of the\nprovided interpolated value is of utmost importance, and it is crucial to avoid\nthe insurgence of spurious noise. Noise sources can be prevented using proper\ncountermeasures when the training set is designed, but the data sparsity is\ninevitable in some cases. A typical example is represented by the application\nof an optimization algorithm: the area where the minimum or maximum of the\nobjective function is assumed to be present is where new data is abundantly\nadded, but other areas of design variable space are significantly neglected. In\nthese cases, a regularization of the interpolation model becomes absolutely\ncrucial. In this paper we are presenting an approach for the regularization of\nan interpolator based on the control of its kernel function via the condition\nnumber of the self-correlation matrix.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:24:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Peri","Daniele",""]]}
{"id":"2308.06500","submitter":"Yuan Liu","authors":"Liu Yuan","title":"On the Isomorphic Means and Comparison Inequalities","comments":"4 illustrations. Keywords: Isomorphic frame; Dual-variable-isomorphic\n  function; Isomorphic mean; Elastic mean; Cauchy mean value; Stolarsky mean","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.CA math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Based on collection of bijections, variable and function are extended into\n``isomorphic variable'' and ``dual-variable-isomorphic function'', then mean\nvalues such as arithmetic mean and mean of a function are extended to\n``isomorphic means''. 7 sub-classes of isomorphic mean of a function are\ndistinguished. Comparison problems of isomorphic means are discussed. A\nsub-class(class V) of isomorphic mean of a function related to Cauchy mean\nvalue is utilized for generation of bivariate means e.g. quasi-Stolarsky means.\nDemonstrated as an example of math related to ``isomorphic frames'', this paper\nattempts to unify current common means into a better extended family of means.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:25:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yuan","Liu",""]]}
{"id":"2308.06501","submitter":"Siheng Li","authors":"Siheng Li, Yichun Yin, Cheng Yang, Wangjie Jiang, Yiwei Li, Zesen\n  Cheng, Lifeng Shang, Xin Jiang, Qun Liu, Yujiu Yang","title":"NewsDialogues: Towards Proactive News Grounded Conversation","comments":"Accepted to ACL 2023 Conference (Long Paper; Findings)","journal-ref":null,"doi":"10.18653/v1/2023.findings-acl.224","report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hot news is one of the most popular topics in daily conversations. However,\nnews grounded conversation has long been stymied by the lack of well-designed\ntask definition and scarce data. In this paper, we propose a novel task,\nProactive News Grounded Conversation, in which a dialogue system can\nproactively lead the conversation based on some key topics of the news. In\naddition, both information-seeking and chit-chat scenarios are included\nrealistically, where the user may ask a series of questions about the news\ndetails or express their opinions and be eager to chat. To further develop this\nnovel task, we collect a human-to-human Chinese dialogue dataset\n\\ts{NewsDialogues}, which includes 1K conversations with a total of 14.6K\nutterances and detailed annotations for target topics and knowledge spans.\nFurthermore, we propose a method named Predict-Generate-Rank, consisting of a\ngenerator for grounded knowledge prediction and response generation, and a\nranker for the ranking of multiple responses to alleviate the exposure bias. We\nconduct comprehensive experiments to demonstrate the effectiveness of the\nproposed method and further present several key findings and challenges to\nprompt future research.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:33:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Siheng",""],["Yin","Yichun",""],["Yang","Cheng",""],["Jiang","Wangjie",""],["Li","Yiwei",""],["Cheng","Zesen",""],["Shang","Lifeng",""],["Jiang","Xin",""],["Liu","Qun",""],["Yang","Yujiu",""]]}
{"id":"2308.06502","submitter":"Ond\\v{r}ej Pl\\'atek","authors":"Ond\\v{r}ej Pl\\'atek and Vojt\\v{e}ch Hude\\v{c}ek and Patricia\n  Schmidtov\\'a and Mateusz Lango and Ond\\v{r}ej Du\\v{s}ek","title":"Three Ways of Using Large Language Models to Evaluate Chat","comments":"Accepted to DSTC11 workshop https://dstc11.dstc.community/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes the systems submitted by team6 for ChatEval, the DSTC 11\nTrack 4 competition. We present three different approaches to predicting\nturn-level qualities of chatbot responses based on large language models\n(LLMs). We report improvement over the baseline using dynamic few-shot examples\nfrom a vector store for the prompts for ChatGPT. We also analyze the\nperformance of the other two approaches and report needed improvements for\nfuture work. We developed the three systems over just two weeks, showing the\npotential of LLMs for this task. An ablation study conducted after the\nchallenge deadline shows that the new Llama 2 models are closing the\nperformance gap between ChatGPT and open-source LLMs. However, we find that the\nLlama 2 models do not benefit from few-shot examples in the same way as\nChatGPT.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:34:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pl\u00e1tek","Ond\u0159ej",""],["Hude\u010dek","Vojt\u011bch",""],["Schmidtov\u00e1","Patricia",""],["Lango","Mateusz",""],["Du\u0161ek","Ond\u0159ej",""]]}
{"id":"2308.06503","submitter":"Dingzhu Wen","authors":"Zeming Zhuang, Dingzhu Wen, Yuanming Shi, Guangxu Zhu, Sheng Wu, and\n  Dusit Niyato","title":"Integrated Sensing-Communication-Computation for Over-the-Air Edge AI\n  Inference","comments":"This work was accepted by IEEE Transactions on Wireless\n  Communications on Aug. 12, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Edge-device co-inference refers to deploying well-trained artificial\nintelligent (AI) models at the network edge under the cooperation of devices\nand edge servers for providing ambient intelligent services. For enhancing the\nutilization of limited network resources in edge-device co-inference tasks from\na systematic view, we propose a task-oriented scheme of integrated sensing,\ncomputation and communication (ISCC) in this work. In this system, all devices\nsense a target from the same wide view to obtain homogeneous noise-corrupted\nsensory data, from which the local feature vectors are extracted. All local\nfeature vectors are aggregated at the server using over-the-air computation\n(AirComp) in a broadband channel with the\northogonal-frequency-division-multiplexing technique for suppressing the\nsensing and channel noise. The aggregated denoised global feature vector is\nfurther input to a server-side AI model for completing the downstream inference\ntask. A novel task-oriented design criterion, called maximum minimum pair-wise\ndiscriminant gain, is adopted for classification tasks. It extends the distance\nof the closest class pair in the feature space, leading to a balanced and\nenhanced inference accuracy. Under this criterion, a problem of joint sensing\npower assignment, transmit precoding and receive beamforming is formulated. The\nchallenge lies in three aspects: the coupling between sensing and AirComp, the\njoint optimization of all feature dimensions' AirComp aggregation over a\nbroadband channel, and the complicated form of the maximum minimum pair-wise\ndiscriminant gain. To solve this problem, a task-oriented ISCC scheme with\nAirComp is proposed. Experiments based on a human motion recognition task are\nconducted to verify the advantages of the proposed scheme over the existing\nscheme and a baseline.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:38:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhuang","Zeming",""],["Wen","Dingzhu",""],["Shi","Yuanming",""],["Zhu","Guangxu",""],["Wu","Sheng",""],["Niyato","Dusit",""]]}
{"id":"2308.06504","submitter":"Jianwen Jie","authors":"Zeqing Wang, Yao Lu, Yi Peng, Ran Qi, Yucheng Wang, Jianwen Jie","title":"Accelerating Relaxation Dynamics in Open Quantum System with Liouvillian\n  Skin Effect","comments":"9 pages, 6 figures, To be published in PRB","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.other cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate a non-Hermitian model featuring non-reciprocal gradient\nhoppings. Through an in-depth analysis of the Liouvillian spectrum and\ndynamics, we confirm the emergence of the Liouvillian skin effect resulting\nfrom the non-reciprocal nature of hoppings in this model. Furthermore, we\nobserve that the presence of gradient hopping strength leads to an accelerated\nrelaxation time for the system. Through numerical investigations of the\nLiouvillian gap, relaxation time, and steady-state localization length, we\ndiscover that the relaxation time in this model cannot be explained by the\ncurrently established relationship associated with the Liouvillian skin effect.\nThis discrepancy highlights the need for further exploration and theoretical\nadvancements to fully comprehend the intricate mechanisms underlying quantum\nrelaxation processes. Motivated by these findings, we propose a theoretical\napproach to realize this non-Hermitian model in an atomic system with a\nsideband structure by employing adiabatic elimination technique. These results\ncontribute to our deeper comprehension of quantum relaxation dynamics and\nprovide theoretical backing for the development of techniques aimed at\ncontrolling quantum relaxation processes.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:41:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zeqing",""],["Lu","Yao",""],["Peng","Yi",""],["Qi","Ran",""],["Wang","Yucheng",""],["Jie","Jianwen",""]]}
{"id":"2308.06505","submitter":"Tanisha Joshi","authors":"Tanisha Joshi","title":"Unified Lagrangian for Tachyon, Quintessence, and Phantom Scalar Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel unified Lagrangian density that combines the\nbehaviors of tachyon, quintessence, and phantom scalar fields within the realms\nof theoretical physics and cosmology. The unified Lagrangian is formulated,\nwhere \\(f(\\alpha)\\) is a function that accommodates different scenarios and\ncaptures the distinct characteristics of these scalar fields. The potential\nfunction \\(V(\\phi)\\) is incorporated to account for the specific properties of\nthe scalar fields. The study employs numerical simulations in Python to\nthoroughly analyze the dynamics of the scalar fields for various \\(\\alpha\\)\nvalues, investigating the cosmological behavior.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:46:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Joshi","Tanisha",""]]}
{"id":"2308.06506","submitter":"Jian Liu","authors":"Lei Wang, Qinglin Niu, Jinjuan Zhang, Jian Liu and Zhongzhou Ren","title":"New extended method for $\\psi^{\\prime}$ scaling function of inclusive\n  electron scattering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scaling analyses have been successfully applied to study the inclusive\nelectron scattering $(\\textit{e}, \\textit{e}^{\\prime})$ over the past few\ndecades. In this paper, we utilize the $\\psi^{\\prime}$ scaling function in\nmomentum space to analyze the $(\\textit{e}, \\textit{e}^{\\prime})$ cross\nsections, where the nucleon momentum distributions are derived from\nself-consistent mean-field calculations. By further introducing the energy and\nmomentum conservation in the scaling analysis, an improved $\\psi^{\\prime}$\nscaling function is proposed to investigate the high-momentum part of the\nmomentum distributions. Using the proposed scaling function, we systematically\nexplore the effects of the nucleon-nucleon short-range correlation\n($\\textit{NN}$-SRC) on the $(\\textit{e}, \\textit{e}^{\\prime})$ cross sections.\nFrom the experimental $(\\textit{e}, \\textit{e}^{\\prime})$ data, the\n\\textit{NN}-SRC strength is further extracted within the framework of the\nimproved $\\psi^{\\prime}$ scaling function. The studies in this paper offer a\nnew method to investigate the nucleon momentum distributions and the\n$\\textit{NN}$-SRC effects in nuclei.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:48:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Lei",""],["Niu","Qinglin",""],["Zhang","Jinjuan",""],["Liu","Jian",""],["Ren","Zhongzhou",""]]}
{"id":"2308.06507","submitter":"Siheng Li","authors":"Siheng Li, Cheng Yang, Yichun Yin, Xinyu Zhu, Zesen Cheng, Lifeng\n  Shang, Xin Jiang, Qun Liu, Yujiu Yang","title":"AutoConv: Automatically Generating Information-seeking Conversations\n  with Large Language Models","comments":"Accepted to ACL 2023 Main Conference (Short)","journal-ref":null,"doi":"10.18653/v1/2023.acl-short.149","report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information-seeking conversation, which aims to help users gather information\nthrough conversation, has achieved great progress in recent years. However, the\nresearch is still stymied by the scarcity of training data. To alleviate this\nproblem, we propose AutoConv for synthetic conversation generation, which takes\nadvantage of the few-shot learning ability and generation capacity of large\nlanguage models (LLM). Specifically, we formulate the conversation generation\nproblem as a language modeling task, then finetune an LLM with a few human\nconversations to capture the characteristics of the information-seeking process\nand use it for generating synthetic conversations with high quality.\nExperimental results on two frequently-used datasets verify that AutoConv has\nsubstantial improvements over strong baselines and alleviates the dependence on\nhuman annotation. In addition, we also provide several analysis studies to\npromote future research.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 08:52:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Siheng",""],["Yang","Cheng",""],["Yin","Yichun",""],["Zhu","Xinyu",""],["Cheng","Zesen",""],["Shang","Lifeng",""],["Jiang","Xin",""],["Liu","Qun",""],["Yang","Yujiu",""]]}
{"id":"2308.06508","submitter":"Shitao Li","authors":"Shitao Li, Yang Li, Minjia Shi, Shixin Zhu","title":"Characterization and mass formulas of symplectic self-orthogonal and LCD\n  codes and their application","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The object of this paper is to study two very important classes of codes in\ncoding theory, namely self-orthogonal (SO) and linear complementary dual (LCD)\ncodes under the symplectic inner product, involving characterization,\nconstructions, and their application. Using such a characterization, we\ndetermine the mass formulas of symplectic SO and LCD codes by considering the\naction of the symplectic group, and further obtain some asymptotic results.\nFinally, under the Hamming distance, we obtain some symplectic SO (resp. LCD)\ncodes with improved parameters directly compared with Euclidean SO (resp. LCD)\ncodes. Under the symplectic distance, we obtain some additive SO (resp.\nadditive complementary dual) codes with improved parameters directly compared\nwith Hermitian SO (resp. LCD) codes. Further, we also construct many good\nadditive codes outperform the best-known linear codes in Grassl's code table.\nAs an application, we construct a number of record-breaking\n(entanglement-assisted) quantum error-correcting codes, which improve Grassl's\ncode table.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:00:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Shitao",""],["Li","Yang",""],["Shi","Minjia",""],["Zhu","Shixin",""]]}
{"id":"2308.06509","submitter":"Michael Unterkalmsteiner","authors":"Elizabeth Bjarnason, Michael Unterkalmsteiner, Emelie Engstr\\\"om,\n  Markus Borg","title":"An Industrial Case Study on Test Cases as Requirements","comments":"Proceedings of XP 2015: 27-39","journal-ref":null,"doi":"10.1007/978-3-319-18612-2_3","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  It is a conundrum that agile projects can succeed 'without requirements' when\nweak requirements engineering is a known cause for project failures. While\nAgile development projects often manage well without extensive requirements\ndocumentation, test cases are commonly used as requirements. We have\ninvestigated this agile practice at three companies in order to understand how\ntest cases can fill the role of requirements. We performed a case study based\non twelve interviews performed in a previous study. The findings include a\nrange of benefits and challenges in using test cases for eliciting, validating,\nverifying, tracing and managing requirements. In addition, we identified three\nscenarios for applying the practice, namely as a mature practice, as a de facto\npractice and as part of an agile transition. The findings provide insights into\nhow the role of requirements may be met in agile development including\nchallenges to consider.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:06:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bjarnason","Elizabeth",""],["Unterkalmsteiner","Michael",""],["Engstr\u00f6m","Emelie",""],["Borg","Markus",""]]}
{"id":"2308.06510","submitter":"Irum Baseer","authors":"Irum Baseer, Israel Valverde, Abdel H. Moustafa, Josep Blat and Oscar\n  Camara","title":"Evaluation of cinematic volume rendering open-source and commercial\n  solutions for the exploration of congenital heart data","comments":"5 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.HC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Detailed anatomical information is essential to optimize medical decisions\nfor surgical and pre-operative planning in patients with congenital heart\ndisease. The visualization techniques commonly used in clinical routine for the\nexploration of complex cardiac data are based on multi-planar reformations,\nmaximum intensity projection, and volume rendering, which rely on basic\nlighting models prone to image distortion. On the other hand, cinematic\nrendering (CR), a three-dimensional visualization technique based on\nphysically-based rendering methods, can create volumetric images with high\nfidelity. However, there are a lot of parameters involved in CR that affect the\nvisualization results, thus being dependent on the user's experience and\nrequiring detailed evaluation protocols to compare available solutions. In this\nstudy, we have analyzed the impact of the most relevant parameters in a CR\npipeline developed in the open-source version of the MeVisLab framework for the\nvisualization of the heart anatomy of three congenital patients and two adults\nfrom CT images. The resulting visualizations were compared to a commercial tool\nused in the clinics with a questionnaire filled in by clinical users, providing\nsimilar definitions of structures, depth perception, texture appearance,\nrealism, and diagnostic ability.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:10:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Baseer","Irum",""],["Valverde","Israel",""],["Moustafa","Abdel H.",""],["Blat","Josep",""],["Camara","Oscar",""]]}
{"id":"2308.06511","submitter":"Harald Schmid","authors":"Harald Schmid","title":"On the connection coefficients for linear differential systems with\n  applications to the spheroidal and ellipsoidal wave equation","comments":"20 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA cs.NA math-ph math.MP math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with the connection coefficients between the local\nfundamental solutions of a $2\\times 2$ linear ordinary differential system with\ntwo neighboring regular singular points at $z=0$ and $z=1$. We derive an\nasymptotic formula for the connection coefficients which can be used for\nnumerical calculations and, in particular, for determining the eigenvalues of\nsome spectral problems arising in mathematical physics. As an application, new\nalgorithms for computing the eigenvalues of the ellipsoidal wave equation and\nthe spheroidal wave equation are presented.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:22:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Schmid","Harald",""]]}
{"id":"2308.06512","submitter":"V\\'ictor Guti\\'errez-Basulto","authors":"Zhiwei Hu, V\\'ictor Guti\\'errez-Basulto, Zhiliang Xiang, Ru Li, Jeff\n  Z. Pan","title":"HyperFormer: Enhancing Entity and Relation Interaction for\n  Hyper-Relational Knowledge Graph Completion","comments":"Accepted at CIKM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyper-relational knowledge graphs (HKGs) extend standard knowledge graphs by\nassociating attribute-value qualifiers to triples, which effectively represent\nadditional fine-grained information about its associated triple.\nHyper-relational knowledge graph completion (HKGC) aims at inferring unknown\ntriples while considering its qualifiers. Most existing approaches to HKGC\nexploit a global-level graph structure to encode hyper-relational knowledge\ninto the graph convolution message passing process. However, the addition of\nmulti-hop information might bring noise into the triple prediction process. To\naddress this problem, we propose HyperFormer, a model that considers\nlocal-level sequential information, which encodes the content of the entities,\nrelations and qualifiers of a triple. More precisely, HyperFormer is composed\nof three different modules: an entity neighbor aggregator module allowing to\nintegrate the information of the neighbors of an entity to capture different\nperspectives of it; a relation qualifier aggregator module to integrate\nhyper-relational knowledge into the corresponding relation to refine the\nrepresentation of relational content; a convolution-based bidirectional\ninteraction module based on a convolutional operation, capturing pairwise\nbidirectional interactions of entity-relation, entity-qualifier, and\nrelation-qualifier. realize the depth perception of the content related to the\ncurrent statement. Furthermore, we introduce a Mixture-of-Experts strategy into\nthe feed-forward layers of HyperFormer to strengthen its representation\ncapabilities while reducing the amount of model parameters and computation.\nExtensive experiments on three well-known datasets with four different\nconditions demonstrate HyperFormer's effectiveness. Datasets and code are\navailable at https://github.com/zhiweihu1103/HKGC-HyperFormer.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:31:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Zhiwei",""],["Guti\u00e9rrez-Basulto","V\u00edctor",""],["Xiang","Zhiliang",""],["Li","Ru",""],["Pan","Jeff Z.",""]]}
{"id":"2308.06513","submitter":"Burak \\\"Oz","authors":"Burak \\\"Oz, Jonas Gebele, Filip Rezabek, Felix Hoops, Florian Matthes","title":"A First Study of MEV on an Up-and-Coming Blockchain: Algorand","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Maximal Extractable Value (MEV) significantly influences network incentives,\nconsensus safety, and economic dynamics, and has been extensively studied\nwithin the Ethereum blockchain domain. However, MEV is not specific to\nEthereum, and extends to other blockchain platforms with differing properties,\nsuch as Algorand. Algorand, a smart-contract-based blockchain employing a\nByzantine-Fault Tolerant consensus mechanism and Pure-Proof-of-Stake, is\ncharacterized by a First-Come-First-Serve transaction ordering mechanism and\nminimal fixed transaction fees. This paper provides the first exploration of\nthe MEV landscape on Algorand, focusing on arbitrage MEV patterns, key actors,\ntheir strategic preferences, transaction positioning strategies, and the\ninfluence of Algorand's network infrastructure on MEV searching. We observed\n1,142,970 arbitrage cases, with a single searcher executing 653,001. Different\nsearchers demonstrated diverse strategies, reflected in the varied distribution\nof profitable block positions. Nonetheless, the even spread of arbitrage\npositions across a block indicates an emphasis on immediate backrunning\nexecutions. Furthermore, we identified 265,637 instances of Batch Transaction\nIssuances, where an address occupied over 80% of a block with a singular\ntransaction type.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:37:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["\u00d6z","Burak",""],["Gebele","Jonas",""],["Rezabek","Filip",""],["Hoops","Felix",""],["Matthes","Florian",""]]}
{"id":"2308.06514","submitter":"Edouard B. Sonin","authors":"Edouard Sonin","title":"Joe Vinen and transverse force on vortex","comments":"16 pages, 1 figure. The paper for the special JLTP issue in honor of\n  Joe Vinen","journal-ref":"J. Low Temp. Phys. 212, 306 (2023)","doi":null,"report-no":null,"categories":"cond-mat.other","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper gives a glimpse on the problem of transverse force on a vortex, its\nproper determination in general and the role in the process of quantum vortex\nnucleation. Investigation of this problem is an essential part of the\nscientific heritage of Joe Vinen as an experimentalist and a theoretician.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:37:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sonin","Edouard",""]]}
{"id":"2308.06515","submitter":"Chuntao Ding","authors":"Zhichao Lu and Chuntao Ding and Shangguang Wang and Ran Cheng and\n  Felix Juefei-Xu and Vishnu Naresh Boddeti","title":"Seed Feature Maps-based CNN Models for LEO Satellite Remote Sensing\n  Services","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deploying high-performance convolutional neural network (CNN) models on\nlow-earth orbit (LEO) satellites for rapid remote sensing image processing has\nattracted significant interest from industry and academia. However, the limited\nresources available on LEO satellites contrast with the demands of\nresource-intensive CNN models, necessitating the adoption of ground-station\nserver assistance for training and updating these models. Existing approaches\noften require large floating-point operations (FLOPs) and substantial model\nparameter transmissions, presenting considerable challenges. To address these\nissues, this paper introduces a ground-station server-assisted framework. With\nthe proposed framework, each layer of the CNN model contains only one learnable\nfeature map (called the seed feature map) from which other feature maps are\ngenerated based on specific rules. The hyperparameters of these rules are\nrandomly generated instead of being trained, thus enabling the generation of\nmultiple feature maps from the seed feature map and significantly reducing\nFLOPs. Furthermore, since the random hyperparameters can be saved using a few\nrandom seeds, the ground station server assistance can be facilitated in\nupdating the CNN model deployed on the LEO satellite. Experimental results on\nthe ISPRS Vaihingen, ISPRS Potsdam, UAVid, and LoveDA datasets for semantic\nsegmentation services demonstrate that the proposed framework outperforms\nexisting state-of-the-art approaches. In particular, the SineFM-based model\nachieves a higher mIoU than the UNetFormer on the UAVid dataset, with 3.3x\nfewer parameters and 2.2x fewer FLOPs.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:41:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lu","Zhichao",""],["Ding","Chuntao",""],["Wang","Shangguang",""],["Cheng","Ran",""],["Juefei-Xu","Felix",""],["Boddeti","Vishnu Naresh",""]]}
{"id":"2308.06516","submitter":"Robert McLachlan","authors":"Robert I McLachlan","title":"Runge--Kutta methods determined from extended phase space methods for\n  Hamiltonian systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study two existing extended phase space integrators for Hamiltonian\nsystems, the {\\em midpoint projection method} and the {\\em symmetric projection\nmethod}, showing that the first is a pseudosymplectic and pseudosymmetric\nRunge--Kutta method and the second is a monoimplicit symplectic Runge--Kutta\nmethod.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:45:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["McLachlan","Robert I",""]]}
{"id":"2308.06517","submitter":"Roman Sauer","authors":"Uri Bader and Roman Sauer","title":"Higher Kazhdan property and unitary cohomology of arithmetic groups","comments":"52 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.AT math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the restriction in unitary cohomology from the real points of a\nsimple algebraic group $\\mathbf{G}$ over a number field $k$ to the arithmetic\ngroup is an isomorphism in degrees below the rank. Unitary cohomology means\n(continuous) cohomology with arbitrary unitary coefficients. For the adelic\nversion we obtain an isomorphism in all degrees. Results about the bijectivity\nof the restriction map are related to vanishing results for the cohomology of\n$\\mathbf{G}(k\\otimes\\mathbb{R})$ and $\\mathbf{G}(\\mathscr{O})$ with unitary\ncoefficients. A prototype example of our vanishing results is that the\ncohomology of $SL_n(\\mathbb{Z})$ vanishes for all unitary coefficients without\ninvariant vectors and all degrees below $n-1$. We regard this phenomenon as a\nhigher form of Kazhdan property T.\n  We put an emphasis on arbitrary unitary coefficients. Previous works often\nwere limited to irreducible representations or unitary inductions of\nfinite-dimensional representations. A novelty of our approach is the use of\nmethods from geometric group theory and -- in the rank 1 case -- from (global)\nrepresentation theory pertaining to the spectral gap property.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:00:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bader","Uri",""],["Sauer","Roman",""]]}
{"id":"2308.06518","submitter":"Manikandan Rangaswamy","authors":"Salini K, Arya P S, Manikandan Rangaswamy","title":"Queueing-inventory Systems: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Queueing-inventory systems are integrated systems consisting of two emerging\nfields in applied probability, namely \"Queues\" and \"Inventory\". In this paper,\nwe present a comprehensive review of the theory and applications of\nqueueing-inventory systems from 2016 to 2023 and a detailed discussion of the\nrecent literature by encompassing the topics like product-form solutions,\nproduction-inventory, perishable inventory, the retrial of unsatisfied\ncustomers/vacation/vacation interruption, multi-servers, multi-commodity,\nmulti-class customers, postponed demands, and game-theoretic analysis on\nqueueing-inventory systems, and other applications in various fields such as\nenergy harvesting in the wireless network, supply chain, etc. The review\nprovides insights into the importance of queueing-inventory systems,\nsystematically discussing the developments and their applications, challenges,\nand future directions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:08:00 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 11:09:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["K","Salini",""],["S","Arya P",""],["Rangaswamy","Manikandan",""]]}
{"id":"2308.06519","submitter":"Aman Shukla","authors":"Aman Shukla, Raghavendra Chaubey","title":"Dynamical Systems Analysis of $f(R, L_m)$ Gravity Model","comments":"14 Pages, 8 Figures, EPJ plus","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, the expanding nature of the universe within the context of\n$f(R, L_m)$ gravity theory, where $R$ is Ricci Scalar and $L_m$ is matter\nLagrangian, is explored. By employing a specific form $f(R, L_m) = \\Lambda +\n\\frac{\\alpha}{2} R + \\beta L_m^n$, where $\\Lambda$, $\\alpha$, $\\beta$, $n$ are\nmodel parameters, with the matter Lagrangian given by $L_m = -p$. We solve the\nfield equations by considering the equation of state (EoS) parameter $\\omega$,\ndefined as $p = \\omega \\rho $, where $p$ represents the isotropic pressure and\n$\\rho$ represents the energy density of the perfect fluid. We thoroughly\ninvestigate the model through phase plane analysis, actively studying the\nevolution of cosmological solutions using dynamical system techniques. To\nanalyse the evolution equations, we have introduced suitable transformation of\nvariables. The evolution of corresponding solutions is presented by curves in\nthe phase-plane diagram. The nature of critical points are analysed and stable\nattractors are examined for $f(R, L_m)$ gravity cosmological model. We\ndetermine the classical stabilities of these cosmologies. We also examine the\ntransition of early decelerating stage of the universe to present accelerating\nstage of the universe. We analyze the evolution of the effective equation of\nstate parameters and statefinder diagnostics for different parameter values. We\nexamine and analyze the nature of critical points from a cosmological\nperspective.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:11:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shukla","Aman",""],["Chaubey","Raghavendra",""]]}
{"id":"2308.06520","submitter":"Fran\\c{c}ois Sellier","authors":"Fran\\c{c}ois Sellier","title":"Parameterized Matroid-Constrained Maximum Coverage","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce the concept of Density-Balanced Subset in a\nmatroid, in which independent sets can be sampled so as to guarantee that (i)\neach element has the same probability to be sampled, and (ii) those events are\nnegatively correlated. These Density-Balanced Subsets are subsets in the ground\nset of a matroid in which the traditional notion of uniform random sampling can\nbe extended. We then provide an application of this concept to the\nMatroid-Constrained Maximum Coverage problem. In this problem, given a matroid\n$\\mathcal{M} = (V, \\mathcal{I})$ of rank $k$ on a ground set $V$ and a coverage\nfunction $f$ on $V$, the goal is to find an independent set $S \\in \\mathcal{I}$\nmaximizing $f(S)$. This problem is an important special case of the\nmuch-studied submodular function maximization problem subject to a matroid\nconstraint; this is also a generalization of the maximum $k$-cover problem in a\ngraph. In this paper, assuming that the coverage function has a bounded\nfrequency $\\mu$ (i.e., any element of the underlying universe of the coverage\nfunction appears in at most $\\mu$ sets), we design a procedure, parameterized\nby some integer $\\rho$, to extract in polynomial time an approximate kernel of\nsize $\\rho \\cdot k$ that is guaranteed to contain a $1 - (\\mu - 1)/\\rho$\napproximation of the optimal solution. This procedure can then be used to get a\nFixed-Parameter Tractable Approximation Scheme (FPT-AS) providing a $1 -\n\\varepsilon$ approximation in time $(\\mu/\\varepsilon)^{O(k)} \\cdot |V|^{O(1)}$.\nThis generalizes and improves the results of [Manurangsi, 2019] and [Huang and\nSellier, 2022], providing the first FPT-AS working on an arbitrary matroid.\nMoreover, because of its simplicity, the kernel construction can be performed\nin the streaming setting.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:20:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sellier","Fran\u00e7ois",""]]}
{"id":"2308.06521","submitter":"Rahul Lr","authors":"Rahul LR, Albert Shaiju and Soumya Jana","title":"3-Lead to 12-Lead ECG Reconstruction: A Novel AI-based Spatio-Temporal\n  Method","comments":"6 pages, 4 figures, 2 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Diagnosis of cardiovascular diseases usually relies on the widely used\nstandard 12-Lead (S12) ECG system. However, such a system could be bulky, too\nresource-intensive, and too specialized for personalized home-based monitoring.\nIn contrast, clinicians are generally not trained on the alternative proposal,\ni.e., the reduced lead (RL) system. This necessitates mapping RL to S12. In\nthis context, to improve upon traditional linear transformation (LT)\ntechniques, artificial intelligence (AI) approaches like long short-term memory\n(LSTM) networks capturing non-linear temporal dependencies, have been\nsuggested. However, LSTM does not adequately interpolate spatially (in 3D). To\nfill this gap, we propose a combined LSTM-UNet model that also handles spatial\naspects of the problem, and demonstrate performance improvement. Evaluated on\nPhysioNet PTBDB database, our LSTM-UNet achieved a mean R^2 value of 94.37%,\nsurpassing LSTM by 0.79% and LT by 2.73%. Similarly, for PhysioNet INCARTDB\ndatabase, LSTM-UNet achieved a mean R^2 value of 93.91%, outperforming LSTM by\n1.78% and LT by 12.17%.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:31:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["LR","Rahul",""],["Shaiju","Albert",""],["Jana","Soumya",""]]}
{"id":"2308.06522","submitter":"Sara Babakniya","authors":"Sara Babakniya, Ahmed Roushdy Elkordy, Yahya H. Ezzeldin, Qingfeng\n  Liu, Kee-Bong Song, Mostafa El-Khamy, Salman Avestimehr","title":"SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transfer learning via fine-tuning pre-trained transformer models has gained\nsignificant success in delivering state-of-the-art results across various NLP\ntasks. In the absence of centralized data, Federated Learning (FL) can benefit\nfrom distributed and private data of the FL edge clients for fine-tuning.\nHowever, due to the limited communication, computation, and storage\ncapabilities of edge devices and the huge sizes of popular transformer models,\nefficient fine-tuning is crucial to make federated training feasible. This work\nexplores the opportunities and challenges associated with applying parameter\nefficient fine-tuning (PEFT) methods in different FL settings for language\ntasks. Specifically, our investigation reveals that as the data across users\nbecomes more diverse, the gap between fully fine-tuning the model and employing\nPEFT methods widens. To bridge this performance gap, we propose a method called\nSLoRA, which overcomes the key limitations of LoRA in high heterogeneous data\nscenarios through a novel data-driven initialization technique. Our\nexperimental results demonstrate that SLoRA achieves performance comparable to\nfull fine-tuning, with significant sparse updates with approximately $\\sim 1\\%$\ndensity while reducing training time by up to $90\\%$.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:33:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Babakniya","Sara",""],["Elkordy","Ahmed Roushdy",""],["Ezzeldin","Yahya H.",""],["Liu","Qingfeng",""],["Song","Kee-Bong",""],["El-Khamy","Mostafa",""],["Avestimehr","Salman",""]]}
{"id":"2308.06523","submitter":"Ali Taherifar","authors":"Ali Taherifar","title":"Homotopic subsets of continuous functions and their applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce the notion of bi-homotopy between subsets of\ncontinuous functions. A map $\\phi$ from $A$ to $B$ is called an $h$-map if, for\neach two homotopic maps $f, g\\in A$, their image (i.e., $\\phi(f), \\phi(g)$) are\nhomotopic in $B$. We call an $h$-map $\\phi$ from $A$ to $B$ a bi-homotopy if it\nsatisfies two conditions. First, for any $f, g \\in A$, $\\phi(f)$ is homotopic\nto $\\phi(g)$ in $B$ implies $f$ is homotopic to $g$ in $A$. Next, for each $g\n\\in B$, there exists an $f \\in A$ such that $\\phi(f)$ is homotopic to $g$ in\n$B$. We establish the concept of homotopy equivalence between subsets $A$ and\n$B$ (denoted as $A \\simeq B$) as the existence of two bi-homotopies $\\phi$ from\n$A$ to $B$ and $\\psi$ from $B$ to $A$, satisfying $\\phi\\psi(h)$ is homotopic to\n$h$ for every $h \\in B$, and $\\psi\\phi(h)$ is homotopic to $h$ for every $h \\in\nA$. We then apply this definition to characterize homotopic subsets of\ncontinuous functions and introduce novel categories of subsets of $C(X, Y)$,\nnotably the category $\\mathcal{P}(C(X, Y))$, where $X, Y$ are two topological\nspaces. In this category, objects represent subsets of $C(X, Y)$, morphisms\ndenote bi-homotopies between any two objects, and a composition law governs the\ncombination of morphisms. Furthermore, we extend this framework to define\nhomotopic groups (resp., rings) of continuous functions when $Y$ is a\ntopological group (resp., topological ring). Leveraging topological properties\nof $X$ and $Y$, we investigate the group (resp., ring) properties of $C(X, Y)$.\nWe discuss potential applications and implications of the introduced\nbi-homotopy concept in the study of continuous functions and their subsets.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:39:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Taherifar","Ali",""]]}
{"id":"2308.06524","submitter":"Soloman Raju Thokala","authors":"Thokala Soloman Raju and T Shreecharan","title":"Exotic Phase Space Dynamics Generated by Orthogonal Polynomial\n  Self-interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The phase space dynamics generated by different orthogonal polynomial\nself-interactions exhibited in higher order nonlinear Schr\\\"{o}dinger equation\n(NLSE) are often less intuitive than those ofcubic and quintic nonlinearities.\nEven for nonlinearities as simple as a cubic in NLSE, the dynamics for generic\ninitial states shows surprising features. In this Letter, for the first time,\nwe identify the higher-order nonlinearities in terms of orthogonal polynomials\nin the generalized NLSE/GPE. More pertinently, we explicate different exotic\nphase space structures for three specific examples: (i) Hermite, (ii)\nChebyshev, and (iii) Laguerre polynomial self-interactions. For the first two\nself-interactions, we exhibit that the alternating signs of the various\nhigher-order nonlinearities are naturally embedded in these orthogonal\npolynomials that confirm to the experimental conditions. To simulate the\nphase-space dynamics that bring about by the Laguerre self-interactions, a\nsource term should {\\it necessarily} be included in the modified NLSE/GPE.\nRecent experiments suggest that this modified GPE captures the dynamics of\nself-bound quantum droplets, in the presence of external source.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:44:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Raju","Thokala Soloman",""],["Shreecharan","T",""]]}
{"id":"2308.06525","submitter":"Siddhartha Chakrabarty","authors":"Deb Narayan Barik and Siddhartha P. Chakrabarty","title":"Loan portfolio management and Liquidity Risk: The impact of limited\n  liability and haircut","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.RM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we consider the problem of a bank's loan portfolio in the\ncontext of liquidity risk, while allowing for the limited liability protection\nenjoyed by the bank. Accordingly, we construct a novel loan portfolio model\nwith limited liability, while maintaining a threshold level of haircut in the\nportfolio. For the constructed three-time step loan portfolio, at the initial\ntime, the bank raises capital via debt and equity, investing the same in\nseveral classes of loans, while at the final time, the bank either meets its\nliabilities or becomes insolvent. At the intermediate time step, a fraction of\nthe deposits are withdrawn, resulting in liquidation of some of the bank's\nassets. The liquidated portfolio is designed with the goal of minimizing the\nliquidation cost. Our theoretical results show that model with the haircut\nconstraint leads to lesser liquidity risk, as compared to the scenario of no\nhaircut constraint being imposed. Finally, we present numerical results to\nillustrate the theoretical results which were obtained.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:50:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Barik","Deb Narayan",""],["Chakrabarty","Siddhartha P.",""]]}
{"id":"2308.06526","submitter":"Dariya Savchenko V","authors":"M. Holiatkina, A. P\\\"oppl, E. Kalabukhova, J. Lan\\v{c}ok, D. Savchenko","title":"Spin exchange dynamics in 4H SiC monocrystals with different nitrogen\n  donor concentrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  4H silicon carbide (SiC) polytype is preferred over other SiC polytypes for\nhigh-power, high-voltage, and high-frequency applications due to its superior\nelectrical, thermal, and structural characteristics. In this manuscript, we\nprovide a comprehensive study of the spin coupling dynamic between conduction\nelectrons and nitrogen (N) donors in monocrystalline 4H SiC with various\nconcentrations of uncompensated N donors from 10^17 cm^-3 to 5x10^19 cm^-3 by\ncontinuous wave, pulsed EPR, and microwave perturbation techniques at T=4.2-300\nK. At low temperatures two triplets due to N donors in cubic (Nk) hexagonal\n(Nh) positions and triplet arisen from spin-interaction between Nh and Nk were\nobserved in 4H SiC having Nd-Na=10^17 cm^-3. A single S-line (S=1/2) dominates\nthe EPR spectra in all investigated 4H SiC monocrystals at high temperatures.\nIt was established that this line occurs due to the exchange coupling of\nlocalized electrons (dominate at low temperatures) and non-localized electrons\n(dominate at high temperatures). The localized electrons were attributed to Nh\nfor Nd-Na=10^17 cm^-3 and Nk donors for Nd-Na>=5x10^18 cm^-3. We have concluded\nthat the conduction electrons in 4H SiC monocrystals are characterized by\ngpar=2.0053(3) gper=2.0011(3) for Nd-Na<=5x10^18 cm^-3 and gpar=2.0057(3) and\ngper=2.0019(3) for Nd-Na=5x10^19 cm^-3. Using the theoretical fitting of the\ntemperature variation of S-line EPR linewidth in 4H SiC having Nd-Na<5x10^18\ncm-^3, the energy levels of 57-65 meV that correlate with the valley-orbit\nsplitting values for Nk donors in 4H SiC monocrystals were obtained.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:55:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Holiatkina","M.",""],["P\u00f6ppl","A.",""],["Kalabukhova","E.",""],["Lan\u010dok","J.",""],["Savchenko","D.",""]]}
{"id":"2308.06527","submitter":"Ond\\v{r}ej Pl\\'atek","authors":"Ond\\v{r}ej Pl\\'atek and Mateusz Lango and Ond\\v{r}ej Du\\v{s}ek","title":"With a Little Help from the Authors: Reproducing Human Evaluation of an\n  MT Error Detector","comments":"Submitted to\n  https://www.aclweb.org/portal/content/repronlp-shared-task-reproducibility-evaluations-nlp-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents our efforts to reproduce the results of the human\nevaluation experiment presented in the paper of Vamvas and Sennrich (2022),\nwhich evaluated an automatic system detecting over- and undertranslations\n(translations containing more or less information than the original) in machine\ntranslation (MT) outputs. Despite the high quality of the documentation and\ncode provided by the authors, we discuss some problems we found in reproducing\nthe exact experimental setup and offer recommendations for improving\nreproducibility. Our replicated results generally confirm the conclusions of\nthe original study, but in some cases, statistically significant differences\nwere observed, suggesting a high variability of human annotation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:00:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pl\u00e1tek","Ond\u0159ej",""],["Lango","Mateusz",""],["Du\u0161ek","Ond\u0159ej",""]]}
{"id":"2308.06528","submitter":"Krzysztof Krawiec","authors":"Jakub Kwiatkowski and Krzysztof Krawiec","title":"Learning Abstract Visual Reasoning via Task Decomposition: A Case Study\n  in Raven Progressive Matrices","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the challenges in learning to perform abstract reasoning is that\nproblems are often posed as monolithic tasks, with no intermediate subgoals. In\nRaven Progressive Matrices (RPM), the task is to choose one of the available\nanswers given a context, where both contexts and answers are composite images\nfeaturing multiple objects in various spatial arrangements. As this high-level\ngoal is the only guidance available, learning is challenging and most\ncontemporary solvers tend to be opaque. In this study, we propose a deep\nlearning architecture based on the transformer blueprint which, rather than\ndirectly making the above choice, predicts the visual properties of individual\nobjects and their arrangements. The multidimensional predictions obtained in\nthis way are then directly juxtaposed to choose the answer. We consider a few\nways in which the model parses the visual input into tokens and several regimes\nof masking parts of the input in self-supervised training. In experimental\nassessment, the models not only outperform state-of-the-art methods but also\nprovide interesting insights and partial explanations about the inference. The\ndesign of the method also makes it immune to biases that are known to exist in\nsome RPM benchmarks.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:02:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kwiatkowski","Jakub",""],["Krawiec","Krzysztof",""]]}
{"id":"2308.06529","submitter":"Wei Liu","authors":"Wei Liu, Ziqing Xie, Yongjun Yuan","title":"Convergence analysis of a spectral-Galerkin-type search extension method\n  for finding multiple solutions to semilinear problems","comments":"23 pages, 7 figures; Chinese version of this paper is published in\n  SCIENTIA SINICA Mathematica, Vol. 51 (2021), pp. 1407-1431","journal-ref":"SCIENTIA SINICA Mathematica, Vol. 51 (2021), pp. 1407-1431","doi":"10.1360/SCM-2019-0357","report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we develop an efficient spectral-Galerkin-type search\nextension method (SGSEM) for finding multiple solutions to semilinear elliptic\nboundary value problems. This method constructs effective initial data for\nmultiple solutions based on the linear combinations of some eigenfunctions of\nthe corresponding linear eigenvalue problem, and thus takes full advantage of\nthe traditional search extension method in constructing initials for multiple\nsolutions. Meanwhile, it possesses a low computational cost and high accuracy\ndue to the employment of an interpolated coefficient Legendre-Galerkin spectral\ndiscretization. By applying the Schauder's fixed point theorem and other\ntechnical strategies, the existence and spectral convergence of the numerical\nsolution corresponding to a specified true solution are rigorously proved. In\naddition, the uniqueness of the numerical solution in a sufficiently small\nneighborhood of each specified true solution is strictly verified. Numerical\nresults demonstrate the feasibility and efficiency of our algorithm and present\ndifferent types of multiple solutions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:03:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Wei",""],["Xie","Ziqing",""],["Yuan","Yongjun",""]]}
{"id":"2308.06530","submitter":"Miaoyu Li","authors":"Miaoyu Li, Yachao Zhang, Xu MA, Yanyun Qu, Yun Fu","title":"BEV-DG: Cross-Modal Learning under Bird's-Eye View for Domain\n  Generalization of 3D Semantic Segmentation","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":"  Cross-modal Unsupervised Domain Adaptation (UDA) aims to exploit the\ncomplementarity of 2D-3D data to overcome the lack of annotation in a new\ndomain. However, UDA methods rely on access to the target domain during\ntraining, meaning the trained model only works in a specific target domain. In\nlight of this, we propose cross-modal learning under bird's-eye view for Domain\nGeneralization (DG) of 3D semantic segmentation, called BEV-DG. DG is more\nchallenging because the model cannot access the target domain during training,\nmeaning it needs to rely on cross-modal learning to alleviate the domain gap.\nSince 3D semantic segmentation requires the classification of each point,\nexisting cross-modal learning is directly conducted point-to-point, which is\nsensitive to the misalignment in projections between pixels and points. To this\nend, our approach aims to optimize domain-irrelevant representation modeling\nwith the aid of cross-modal learning under bird's-eye view. We propose\nBEV-based Area-to-area Fusion (BAF) to conduct cross-modal learning under\nbird's-eye view, which has a higher fault tolerance for point-level\nmisalignment. Furthermore, to model domain-irrelevant representations, we\npropose BEV-driven Domain Contrastive Learning (BDCL) with the help of\ncross-modal learning under bird's-eye view. We design three domain\ngeneralization settings based on three 3D datasets, and BEV-DG significantly\noutperforms state-of-the-art competitors with tremendous margins in all\nsettings.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:09:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Miaoyu",""],["Zhang","Yachao",""],["MA","Xu",""],["Qu","Yanyun",""],["Fu","Yun",""]]}
{"id":"2308.06531","submitter":"Chunhua Shen","authors":"Muzhi Zhu, Hengtao Li, Hao Chen, Chengxiang Fan, Weian Mao, Chenchen\n  Jing, Yifan Liu, Chunhua Shen","title":"SegPrompt: Boosting Open-world Segmentation via Category-level Prompt\n  Learning","comments":"Accepted to Proc. Int. Conf. Computer Vision (ICCV) 2023. Code is at:\n  https://github.com/aim-uofa/SegPrompt","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Current closed-set instance segmentation models rely on pre-defined class\nlabels for each mask during training and evaluation, largely limiting their\nability to detect novel objects. Open-world instance segmentation (OWIS) models\naddress this challenge by detecting unknown objects in a class-agnostic manner.\nHowever, previous OWIS approaches completely erase category information during\ntraining to keep the model's ability to generalize to unknown objects. In this\nwork, we propose a novel training mechanism termed SegPrompt that uses category\ninformation to improve the model's class-agnostic segmentation ability for both\nknown and unknown categories. In addition, the previous OWIS training setting\nexposes the unknown classes to the training set and brings information leakage,\nwhich is unreasonable in the real world. Therefore, we provide a new open-world\nbenchmark closer to a real-world scenario by dividing the dataset classes into\nknown-seen-unseen parts. For the first time, we focus on the model's ability to\ndiscover objects that never appear in the training set images.\n  Experiments show that SegPrompt can improve the overall and unseen detection\nperformance by 5.6% and 6.1% in AR on our new benchmark without affecting the\ninference efficiency. We further demonstrate the effectiveness of our method on\nexisting cross-dataset transfer and strongly supervised settings, leading to\n5.5% and 12.3% relative improvement.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:25:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Muzhi",""],["Li","Hengtao",""],["Chen","Hao",""],["Fan","Chengxiang",""],["Mao","Weian",""],["Jing","Chenchen",""],["Liu","Yifan",""],["Shen","Chunhua",""]]}
{"id":"2308.06532","submitter":"Min Zhao","authors":"Min Zhao, Meirong Tang, Zhaoyi Xu","title":"Test of dark matter core via quasinormal modes of supermassive black\n  hole","comments":null,"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, the effect of the constant density core of dark matter\nin the vicinity of supermassive black hole quasinormal modes of the black hole\nis studied.Based on black hole perturbation theory, the effective potential\nequations for two kinds of perturbations in the spacetime of the dark matter\nconstant density core-black hole system as well as the time evolution\ncorresponding to these two kinds of perturbations are derived, and quasinormal\nmodes frequencies are computed by means of the third-order and sixth-order WKB\napproximations.And by analyzing quasinormal modes effects of the dark matter\nconstant density core parameter r 0 and the angular quantum number l on the\nstudied dark matter constant density core-black hole spacetime, it is found\nthat the decay frequency increases significantly with the increase of the dark\nmatter constant density core parameter r 0 , and that the increase of the\nangular quantum number l significantly increases the oscillation frequency.In\naddition the imaginary part of quasinormal modes frequency is always negative,\nwhich indicates that the spacetime is stable.Our results show that it is\npossible to detect constant density core of dark matter in the vicinity of\nsupermassive black hole using black hole quasinormal modes.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:26:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Min",""],["Tang","Meirong",""],["Xu","Zhaoyi",""]]}
{"id":"2308.06533","submitter":"Ye Mao","authors":"Wenqiang Lai, Qihan Yang, Ye Mao, Endong Sun, Jiangnan Ye","title":"Knowledge Distilled Ensemble Model for sEMG-based Silent Speech\n  Interface","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Voice disorders affect millions of people worldwide. Surface\nelectromyography-based Silent Speech Interfaces (sEMG-based SSIs) have been\nexplored as a potential solution for decades. However, previous works were\nlimited by small vocabularies and manually extracted features from raw data. To\naddress these limitations, we propose a lightweight deep learning\nknowledge-distilled ensemble model for sEMG-based SSI (KDE-SSI). Our model can\nclassify a 26 NATO phonetic alphabets dataset with 3900 data samples, enabling\nthe unambiguous generation of any English word through spelling. Extensive\nexperiments validate the effectiveness of KDE-SSI, achieving a test accuracy of\n85.9\\%. Our findings also shed light on an end-to-end system for portable,\npractical equipment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 03:52:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lai","Wenqiang",""],["Yang","Qihan",""],["Mao","Ye",""],["Sun","Endong",""],["Ye","Jiangnan",""]]}
{"id":"2308.06534","submitter":"Daniel Wolf","authors":"Daniel Wolf, Tristan Payer, Catharina Silvia Lisson, Christoph Gerhard\n  Lisson, Meinrad Beer, Timo Ropinski, Michael G\\\"otz","title":"Dealing with Small Datasets for Deep Learning in Medical Imaging: An\n  Evaluation of Self-Supervised Pre-Training on CT Scans Comparing Contrastive\n  and Masked Autoencoder Methods for Convolutional Models","comments":"This paper is under review. The code will be released if accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning in medical imaging has the potential to minimize the risk of\ndiagnostic errors, reduce radiologist workload, and accelerate diagnosis.\nTraining such deep learning models requires large and accurate datasets, with\nannotations for all training samples. However, in the medical imaging domain,\nannotated datasets for specific tasks are often small due to the high\ncomplexity of annotations, limited access, or the rarity of diseases. To\naddress this challenge, deep learning models can be pre-trained on large image\ndatasets without annotations using methods from the field of self-supervised\nlearning. After pre-training, small annotated datasets are sufficient to\nfine-tune the models for a specific task. The most popular self-supervised\npre-training approaches in medical imaging are based on contrastive learning.\nHowever, recent studies in natural image processing indicate a strong potential\nfor masked autoencoder approaches. Our work compares state-of-the-art\ncontrastive learning methods with the recently introduced masked autoencoder\napproach \"SparK\" for convolutional neural networks (CNNs) on medical images.\nTherefore we pre-train on a large unannotated CT image dataset and fine-tune on\nseveral CT classification tasks. Due to the challenge of obtaining sufficient\nannotated training data in medical imaging, it is of particular interest to\nevaluate how the self-supervised pre-training methods perform when fine-tuning\non small datasets. By experimenting with gradually reducing the training\ndataset size for fine-tuning, we find that the reduction has different effects\ndepending on the type of pre-training chosen. The SparK pre-training method is\nmore robust to the training dataset size than the contrastive methods. Based on\nour results, we propose the SparK pre-training for medical imaging tasks with\nonly small annotated datasets.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:31:01 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 12:26:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wolf","Daniel",""],["Payer","Tristan",""],["Lisson","Catharina Silvia",""],["Lisson","Christoph Gerhard",""],["Beer","Meinrad",""],["Ropinski","Timo",""],["G\u00f6tz","Michael",""]]}
{"id":"2308.06535","submitter":"Cynthia A. Huang","authors":"Cynthia A. Huang","title":"Visualising category recoding and numeric redistributions","comments":"6 pages, 3 figures. Accepted to (Vis + Prov) x Domain workshop at\n  IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes graphical representations of data and rationale\nprovenance in workflows that convert both category labels and associated\nnumeric data between distinct but semantically related taxonomies. We motivate\nthe graphical representations with a new task abstraction, the cross-taxonomy\ntransformation, and associated graph-based information structure, the crossmap.\nThe task abstraction supports the separation of category recoding and numeric\nredistribution decisions from the specifics of data manipulation in ex-post\ndata harmonisation. The crossmap structure is illustrated using an example\nconversion of numeric statistics from a country-specific taxonomy to an\ninternational classification standard. We discuss the opportunities and\nchallenges of using visualisation to audit and communicate cross-taxonomy\ntransformations and present candidate graphical representations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:40:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Cynthia A.",""]]}
{"id":"2308.06536","submitter":"Tanisha Joshi","authors":"Tanisha Joshi","title":"Entropy based Model Independent Diagnostic to Discriminate Dark Energy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose utilizing entropy as a diagnostic tool to distinguish between\nconstant and dynamical dark energy models. Entropy, a measure of the system's\ndisorder or information content, captures the complexity and evolution of the\nuniverse. By analyzing the entropy measure over cosmic time, we can uncover\ndistinct patterns and trends that differentiate constant and dynamical dark\nenergy scenarios. By analyzing the entropy measure over cosmic time, we reveal\ndistinctive patterns and trends that differentiate constant dark energy, such\nas the cosmological constant, from dynamical dark energy scenarios. Our\nfindings demonstrate the effectiveness of entropy as a powerful tool to\ndistinguish between these two classes of dark energy models, providing valuable\ninsights into the nature of cosmic acceleration and advancing our understanding\nof the fundamental physics driving the universe's evolution. By deriving an\nentropy measure from the cosmic expansion history, we present a novel approach\nto distinguish between various dark energy scenarios. We establish the\nmathematical framework, analyze the behavior of the entropy measure for\nconstant and dynamical dark energy models, and discuss the implications of our\nfindings for deepening our understanding of the nature of dark energy.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:40:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Joshi","Tanisha",""]]}
{"id":"2308.06537","submitter":"Siyang Wang","authors":"Siyang Wang, Zonghao Shen, Aigerim Omirkhan, Oriol Gavalda-Diaz, Mary\n  P. Ryan, Finn Giuliani","title":"Determining the Fundamental Failure Modes in Ni-rich Lithium Ion Battery\n  Cathodes","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":"  Challenges associated with in-service mechanical degradation of Li-ion\nbattery cathodes has prompted a transition from polycrystalline to single\ncrystal cathode materials. Whilst for single crystal materials,\ndislocation-assisted crack formation is assumed to be the dominating failure\nmechanism throughout battery life, there is little direct information about\ntheir mechanical behaviour, and mechanistic understanding remains elusive.\nHere, we demonstrated, using in situ micromechanical testing, direct\nmeasurement of local mechanical properties within LiNi0.8Mn0.1Co0.1O2 single\ncrystalline domains. We elucidated the dislocation slip systems, their critical\nstresses, and how slip facilitate cracking. We then compared single crystal and\npolycrystal deformation behaviour. Our findings answer two fundamental\nquestions critical to understanding cathode degradation: What dislocation slip\nsystems operate in Ni-rich cathode materials? And how does slip cause fracture?\nThis knowledge unlocks our ability to develop tools for lifetime prediction and\nfailure risk assessment, as well as in designing novel cathode materials with\nincreased toughness in-service.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:42:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Siyang",""],["Shen","Zonghao",""],["Omirkhan","Aigerim",""],["Gavalda-Diaz","Oriol",""],["Ryan","Mary P.",""],["Giuliani","Finn",""]]}
{"id":"2308.06538","submitter":"Michael Assaf","authors":"Ohad Vilk, Ralf Metzler and Michael Assaf","title":"Non-Markovian gene expression","comments":"6 pages, 3 figures + Supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech q-bio.MN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study two non-Markovian gene-expression models in which protein production\nis a stochastic process with a fat-tailed non-exponential distribution of\nwaiting times. For both models, we find two distinct scaling regimes separated\nby an exponentially long time, proportional to the mean first passage time\n(MFPT) to a ground state of the dynamics, from which the system can only exit\nvia a non-exponential reaction. At times shorter than the MFPT the dynamics are\nstationary and ergodic while at times longer than the MFPT the dynamics are\nnonstationary and nonergodic. The MFPT to the ground state is shown to directly\naffect the average population sizes and we postulate that the transition to\nnonergodicity is a universal feature of models with a non-Markovian state.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:43:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vilk","Ohad",""],["Metzler","Ralf",""],["Assaf","Michael",""]]}
{"id":"2308.06539","submitter":"Trinh Van Chien","authors":"Trinh Van Chien and Cuong V. Le and Huynh Thi Thanh Binh and Hien Quoc\n  Ngo and Symeon Chatzinotas","title":"Phase Shift Design for RIS-Aided Cell-Free Massive MIMO with Improved\n  Differential Evolution","comments":"5 pages, 2 figures. Accepted by IEEE WCL","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 a novel phase shift design for cell-free massive\nmultiple-input and multiple-output (MIMO) systems assisted by reconfigurable\nintelligent surface (RIS), which only utilizes channel statistics to achieve\nthe uplink sum ergodic throughput maximization under spatial channel\ncorrelations. Due to the non-convexity and the scale of the derived\noptimization problem, we develop an improved version of the differential\nevolution (DE) algorithm. The proposed scheme is capable of providing\nhigh-quality solutions within reasonable computing time. Numerical results\ndemonstrate superior improvements of the proposed phase shift designs over the\nother benchmarks, particularly in scenarios where direct links are highly\nprobable.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:49:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Van Chien","Trinh",""],["Le","Cuong V.",""],["Binh","Huynh Thi Thanh",""],["Ngo","Hien Quoc",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.06540","submitter":"Michael Assaf","authors":"Gil Parnass, Osnat Levtzion-Korach, Renana Peres and Michael Assaf","title":"Mitigating Emergency Department Crowding With Stochastic Population\n  Models","comments":"21 pages, 6 figures + Supplementary information","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Environments such as shopping malls, airports, or hospital emergency\ndepartments often experience crowding, with many people simultaneously\nrequesting service. Crowding is highly noisy, with sudden overcrowding\n\"spikes\". Past research has either focused on average behavior or used\ncontext-specific non-generalizable models. Here we show that a stochastic\npopulation model, previously applied to a broad range of natural phenomena, can\naptly describe hospital emergency-department crowding, using data from\nfive-year minute-by-minute emergency-department records. The model provides\nreliable forecasting of the crowding distribution. Overcrowding is highly\nsensitive to the patient arrival-flux and length-of-stay: a 10% increase in\narrivals triples the probability of overcrowding events. Expediting patient\nexit-rate to shorten the typical length-of-stay by just 20 minutes (8.5%)\nreduces severe overcrowding events by 50%. Such forecasting is crucial in\nprevention and mitigation of breakdown events. Our results demonstrate that\ndespite its high volatility, crowding follows a dynamic behavior common to many\nnatural systems.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:53:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Parnass","Gil",""],["Levtzion-Korach","Osnat",""],["Peres","Renana",""],["Assaf","Michael",""]]}
{"id":"2308.06541","submitter":"Hans Rabus","authors":"Hans Rabus","title":"Comment on \"Reproducibility study of Monte Carlo simulations for\n  nanoparticle dose enhancement and biological modeling of cell survival\n  curves\" by Velten et al. [Biomed Phys Eng Express 2023;9:045004]","comments":"4 pages, no figures, submitted to Biomed Phys Eng Express","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This comment highlights two methodological issues with the recent article by\nVelten et al. [Biomed Phys Eng Express 2023;9:045004]\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:53:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rabus","Hans",""]]}
{"id":"2308.06542","submitter":"Siyang Wang","authors":"Siyang Wang, Oriol Gavalda-Diaz, Jack Lyons, Finn Giuliani","title":"Shear and delamination behaviour of basal planes in Zr3AlC2 MAX phase\n  studied by micromechanical testing","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 mechanical properties of layered, hexagonal-structured MAX phases often\nshow the combined merits of metals and ceramics, making them promising material\ncandidates for safety critical applications. While their unique mechanical\nperformance largely arises from the crystal structure, the effect of chemistry\non the properties of these materials remains unclear. To study this, here we\nemployed two in situ electron microscope small scale testing approaches to\nexamine the micromechanical properties of Zr3AlC2, and compared the results\nwith the properties of Ti3SiC2: we used micropillar compression tests to\nmeasure basal slip strength, and double cantilever beam splitting tests to\nevaluate fracture energy for basal plane delamination. We observed distinct and\nsystematic differences in these measured properties between Zr3AlC2 and\nTi3SiC2, where Zr3AlC2 appeared to be stronger but more brittle at the\nmicroscale, and discussed the implications of the results in the selection,\ndesign, and engineering of MAX phases for targeted engineering applications.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:54:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Siyang",""],["Gavalda-Diaz","Oriol",""],["Lyons","Jack",""],["Giuliani","Finn",""]]}
{"id":"2308.06543","submitter":"Yixin Ma","authors":"Chao Xu, Yixin Ma, and Shenghan Jiang","title":"Unveiling Correlated Topological Insulators through Fermionic Tensor\n  Network States -- Classification, Edge Theories and Variational Wavefunctions","comments":"32+20 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of topological band insulators has revealed fascinating phases\ncharacterized by band topology indices, harboring extraordinary boundary modes\nprotected by anomalous symmetry actions. In strongly correlated systems, where\nthe traditional notion of electronic bands becomes obsolete, it has been\nestablished that topological insulator phases persist as stable phases,\nseparate from trivial insulators. However, due to the inability to express the\nground states of such systems as Slater determinants, the formulation of\ngeneric variational wavefunctions for numerical simulations is highly\ndesirable. In this paper, we tackle this challenge by developing a\ncomprehensive framework for fermionic tensor network states. Starting from\nsimple assumptions, we obtain possible sets of tensor equations for any given\nsymmetry group, capturing consistent relations governing symmetry\ntransformation rules on tensor legs. We then examine the connections between\nthese tensor equations and topological insulators by construing edge theories\nand extracting quantum anomaly data from each set of tensor equations. By\nexhaustively exploring all possible sets of equations, we achieve a systematic\nclassification of topological insulator phases. Imposing the solutions of a\ngiven set of equations onto local tensors, we obtain generic variational\nwavefunctions for corresponding topological insulator phases. Our methodology\nprovides a crucial first step towards simulating topological insulators in\nstrongly correlated systems. We discuss the limitations and potential\ngeneralizations of our results, paving the way for further advancements in this\nfield.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:55:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Chao",""],["Ma","Yixin",""],["Jiang","Shenghan",""]]}
{"id":"2308.06544","submitter":"Jeffrey Shallit","authors":"Jeffrey Shallit","title":"Proving properties of some greedily-defined integer recurrences via\n  automata theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.FL math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Venkatachala on the one hand, and Avdispahi\\'c & Zejnulahi on the other, both\nstudiied integer sequences with an unusual sum property defined in a greedy\nway, and proved many results about them. However, their proofs were rather\nlengthy and required numerous cases. In this paper, I provide a different\napproach, via finite automata, that can prove the same results (and more) in a\nsimple, unified way. Instead of case analysis, we use a decision procedure\nimplemented in the free software Walnut. Using these ideas, we can prove a\nconjecture of Quet and find connections between Quet's sequence and the\n\"married\" functions of Hofstadter.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:59:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shallit","Jeffrey",""]]}
{"id":"2308.06545","submitter":"Chukwuma Okolie","authors":"Chukwuma Okolie, Jon Mills, Adedayo Adeleke, Julian Smit","title":"Digital elevation model correction in urban areas using extreme gradient\n  boosting, land cover and terrain parameters","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accuracy of digital elevation models (DEMs) in urban areas is influenced\nby numerous factors including land cover and terrain irregularities. Moreover,\nbuilding artifacts in global DEMs cause artificial blocking of surface flow\npathways. This compromises their quality and adequacy for hydrological and\nenvironmental modelling in urban landscapes where precise and accurate terrain\ninformation is needed. In this study, the extreme gradient boosting (XGBoost)\nensemble algorithm is adopted for enhancing the accuracy of two\nmedium-resolution 30m DEMs over Cape Town, South Africa: Copernicus GLO-30 and\nALOS World 3D (AW3D). XGBoost is a scalable, portable and versatile gradient\nboosting library that can solve many environmental modelling problems. The\ntraining datasets are comprised of eleven predictor variables including\nelevation, urban footprints, slope, aspect, surface roughness, topographic\nposition index, terrain ruggedness index, terrain surface texture, vector\nroughness measure, forest cover and bare ground cover. The target variable\n(elevation error) was calculated with respect to highly accurate airborne\nLiDAR. After training and testing, the model was applied for correcting the\nDEMs at two implementation sites. The correction achieved significant accuracy\ngains which are competitive with other proposed methods. The root mean square\nerror (RMSE) of Copernicus DEM improved by 46 to 53% while the RMSE of AW3D DEM\nimproved by 72 to 73%. These results showcase the potential of gradient boosted\ntrees for enhancing the quality of DEMs, and for improved hydrological\nmodelling in urban catchments.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:03:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Okolie","Chukwuma",""],["Mills","Jon",""],["Adeleke","Adedayo",""],["Smit","Julian",""]]}
{"id":"2308.06546","submitter":"Jie Yang","authors":"Jie Yang and Soyeon Caren Han and Siqu Long and Josiah Poon and Goran\n  Nenadic","title":"MC-DRE: Multi-Aspect Cross Integration for Drug Event/Entity Extraction","comments":"Accepted at CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extracting meaningful drug-related information chunks, such as adverse drug\nevents (ADE), is crucial for preventing morbidity and saving many lives. Most\nADEs are reported via an unstructured conversation with the medical context, so\napplying a general entity recognition approach is not sufficient enough. In\nthis paper, we propose a new multi-aspect cross-integration framework for drug\nentity/event detection by capturing and aligning different\ncontext/language/knowledge properties from drug-related documents. We first\nconstruct multi-aspect encoders to describe semantic, syntactic, and medical\ndocument contextual information by conducting those slot tagging tasks, main\ndrug entity/event detection, part-of-speech tagging, and general medical named\nentity recognition. Then, each encoder conducts cross-integration with other\ncontextual information in three ways: the key-value cross, attention cross, and\nfeedforward cross, so the multi-encoders are integrated in depth. Our model\noutperforms all SOTA on two widely used tasks, flat entity detection and\ndiscontinuous event extraction.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:03:41 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 07:28:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Jie",""],["Han","Soyeon Caren",""],["Long","Siqu",""],["Poon","Josiah",""],["Nenadic","Goran",""]]}
{"id":"2308.06547","submitter":"Han Zhu","authors":"Han Zhu, Dongji Gao, Gaofeng Cheng, Daniel Povey, Pengyuan Zhang,\n  Yonghong Yan","title":"Alternative Pseudo-Labeling for Semi-Supervised Automatic Speech\n  Recognition","comments":"Accepted by IEEE/ACM Transactions on Audio, Speech and Language\n  Processing (TASLP), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When labeled data is insufficient, semi-supervised learning with the\npseudo-labeling technique can significantly improve the performance of\nautomatic speech recognition. However, pseudo-labels are often noisy,\ncontaining numerous incorrect tokens. Taking noisy labels as ground-truth in\nthe loss function results in suboptimal performance. Previous works attempted\nto mitigate this issue by either filtering out the nosiest pseudo-labels or\nimproving the overall quality of pseudo-labels. While these methods are\neffective to some extent, it is unrealistic to entirely eliminate incorrect\ntokens in pseudo-labels. In this work, we propose a novel framework named\nalternative pseudo-labeling to tackle the issue of noisy pseudo-labels from the\nperspective of the training objective. The framework comprises several\ncomponents. Firstly, a generalized CTC loss function is introduced to handle\nnoisy pseudo-labels by accepting alternative tokens in the positions of\nincorrect tokens. Applying this loss function in pseudo-labeling requires\ndetecting incorrect tokens in the predicted pseudo-labels. In this work, we\nadopt a confidence-based error detection method that identifies the incorrect\ntokens by comparing their confidence scores with a given threshold, thus\nnecessitating the confidence score to be discriminative. Hence, the second\nproposed technique is the contrastive CTC loss function that widens the\nconfidence gap between the correctly and incorrectly predicted tokens, thereby\nimproving the error detection ability. Additionally, obtaining satisfactory\nperformance with confidence-based error detection typically requires extensive\nthreshold tuning. Instead, we propose an automatic thresholding method that\nuses labeled data as a proxy for determining the threshold, thus saving the\npain of manual tuning.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:13:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Han",""],["Gao","Dongji",""],["Cheng","Gaofeng",""],["Povey","Daniel",""],["Zhang","Pengyuan",""],["Yan","Yonghong",""]]}
{"id":"2308.06548","submitter":"Shuning Chang","authors":"Shuning Chang, Pichao Wang, Hao Luo, Fan Wang, Mike Zheng Shou","title":"Revisiting Vision Transformer from the View of Path Ensemble","comments":"Accepted by ICCV 2023, oral presentation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision Transformers (ViTs) are normally regarded as a stack of transformer\nlayers. In this work, we propose a novel view of ViTs showing that they can be\nseen as ensemble networks containing multiple parallel paths with different\nlengths. Specifically, we equivalently transform the traditional cascade of\nmulti-head self-attention (MSA) and feed-forward network (FFN) into three\nparallel paths in each transformer layer. Then, we utilize the identity\nconnection in our new transformer form and further transform the ViT into an\nexplicit multi-path ensemble network. From the new perspective, these paths\nperform two functions: the first is to provide the feature for the classifier\ndirectly, and the second is to provide the lower-level feature representation\nfor subsequent longer paths. We investigate the influence of each path for the\nfinal prediction and discover that some paths even pull down the performance.\nTherefore, we propose the path pruning and EnsembleScale skills for\nimprovement, which cut out the underperforming paths and re-weight the ensemble\ncomponents, respectively, to optimize the path combination and make the short\npaths focus on providing high-quality representation for subsequent paths. We\nalso demonstrate that our path combination strategies can help ViTs go deeper\nand act as high-pass filters to filter out partial low-frequency signals. To\nfurther enhance the representation of paths served for subsequent paths,\nself-distillation is applied to transfer knowledge from the long paths to the\nshort paths. This work calls for more future research to explain and design\nViTs from new perspectives.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:18:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chang","Shuning",""],["Wang","Pichao",""],["Luo","Hao",""],["Wang","Fan",""],["Shou","Mike Zheng",""]]}
{"id":"2308.06549","submitter":"Tanvir Islam","authors":"Tanvir Islam, Anika Rahman Joyita, Md. Golam Rabiul Alam, Mohammad\n  Mehedi Hassan, Md. Rafiul Hassan, Raffaele Gravina","title":"Human Behavior-based Personalized Meal Recommendation and Menu Planning\n  Social System","comments":null,"journal-ref":"IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS. 2022","doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The traditional dietary recommendation systems are basically nutrition or\nhealth-aware where the human feelings on food are ignored. Human affects vary\nwhen it comes to food cravings, and not all foods are appealing in all moods. A\nquestionnaire-based and preference-aware meal recommendation system can be a\nsolution. However, automated recognition of social affects on different foods\nand planning the menu considering nutritional demand and social-affect has some\nsignificant benefits of the questionnaire-based and preference-aware meal\nrecommendations. A patient with severe illness, a person in a coma, or patients\nwith locked-in syndrome and amyotrophic lateral sclerosis (ALS) cannot express\ntheir meal preferences. Therefore, the proposed framework includes a\nsocial-affective computing module to recognize the affects of different meals\nwhere the person's affect is detected using electroencephalography signals. EEG\nallows to capture the brain signals and analyze them to anticipate affective\ntoward a food. In this study, we have used a 14-channel wireless Emotive Epoc+\nto measure affectivity for different food items. A hierarchical ensemble method\nis applied to predict affectivity upon multiple feature extraction methods and\nTOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) is\nused to generate a food list based on the predicted affectivity. In addition to\nthe meal recommendation, an automated menu planning approach is also proposed\nconsidering a person's energy intake requirement, affectivity, and nutritional\nvalues of the different menus. The bin-packing algorithm is used for the\npersonalized menu planning of breakfast, lunch, dinner, and snacks. The\nexperimental findings reveal that the suggested affective computing, meal\nrecommendation, and menu planning algorithms perform well across a variety of\nassessment parameters.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:19:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Islam","Tanvir",""],["Joyita","Anika Rahman",""],["Alam","Md. Golam Rabiul",""],["Hassan","Mohammad Mehedi",""],["Hassan","Md. Rafiul",""],["Gravina","Raffaele",""]]}
{"id":"2308.06550","submitter":"Pranshu Chittora","authors":"Pranshu Chittora, Nikhil Kumar, G. Malarselvi","title":"Decentralised Service Allocation using Blockchain","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CE cs.CR cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The growing demand for short-term property renting has led to the boom of a\nnew category called PropTech (Property + Technology). Such a rise in demand\nattracted many entrepreneurs and investors leading to the inception of powerful\nand centralised players in the category (like Airbnb). Unfortunately, some big\nplayers are controlling the entire industry in a centralised way in turn,\nperforming anti-competitive practices which leave no room for the small\nplayers. Such an ecosystem can be made more transparent and decentralised by\nexecuting transactions and order-fulfilment on a blockchain. To extend the\nfunctionality of the system, we can also perform the renting of small services\nand appliances via the integration of IoT. Implementing such a system will make\nthe process more transparent, robust and decentralised.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:37:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chittora","Pranshu",""],["Kumar","Nikhil",""],["Malarselvi","G.",""]]}
{"id":"2308.06551","submitter":"Balarka Sen","authors":"Balarka Sen","title":"h-principle for loose Legendrian embeddings","comments":"72 pages, 23 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":"  This article provides an exposition of Emmy Murphy's work on loose Legendrian\nembeddings. After a brief review of the rudiments of contact topology, we state\nand discuss some foundational results from the theory of h-principles,\nproviding many relevant examples from contact topology on the way. We then\nproceed to prove Murphy's h-principle for loose Legendrian embeddings. We also\nprovide an accessible exposition of some background material from microlocal\nsheaf theory. As applications, we demonstrate the existence of non-loose\nLegendrian embeddings, and prove a version of Gromov's nonsqueezing theorem for\nloose charts.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:37:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sen","Balarka",""]]}
{"id":"2308.06552","submitter":"Jian Yang","authors":"Zixiang Wang, Linzheng Chai, Jian Yang, Jiaqi Bai, Yuwei Yin, Jiaheng\n  Liu, Hongcheng Guo, Tongliang Li, Liqun Yang, Hebboul Zine el-abidine,\n  Zhoujun Li","title":"MT4CrossOIE: Multi-stage Tuning for Cross-lingual Open Information\n  Extraction","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-lingual open information extraction aims to extract structured\ninformation from raw text across multiple languages. Previous work uses a\nshared cross-lingual pre-trained model to handle the different languages but\nunderuses the potential of the language-specific representation. In this paper,\nwe propose an effective multi-stage tuning framework called MT4CrossIE,\ndesigned for enhancing cross-lingual open information extraction by injecting\nlanguage-specific knowledge into the shared model. Specifically, the\ncross-lingual pre-trained model is first tuned in a shared semantic space\n(e.g., embedding matrix) in the fixed encoder and then other components are\noptimized in the second stage. After enough training, we freeze the pre-trained\nmodel and tune the multiple extra low-rank language-specific modules using\nmixture-of-LoRAs for model-based cross-lingual transfer. In addition, we\nleverage two-stage prompting to encourage the large language model (LLM) to\nannotate the multi-lingual raw data for data-based cross-lingual transfer. The\nmodel is trained with multi-lingual objectives on our proposed dataset\nOpenIE4++ by combing the model-based and data-based transfer techniques.\nExperimental results on various benchmarks emphasize the importance of\naggregating multiple plug-in-and-play language-specific modules and demonstrate\nthe effectiveness of MT4CrossIE in cross-lingual\nOIE\\footnote{\\url{https://github.com/CSJianYang/Multilingual-Multimodal-NLP}}.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:38:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zixiang",""],["Chai","Linzheng",""],["Yang","Jian",""],["Bai","Jiaqi",""],["Yin","Yuwei",""],["Liu","Jiaheng",""],["Guo","Hongcheng",""],["Li","Tongliang",""],["Yang","Liqun",""],["el-abidine","Hebboul Zine",""],["Li","Zhoujun",""]]}
{"id":"2308.06553","submitter":"I. S. Burmistrov","authors":"A.A. Lyublinskaya and I.S. Burmistrov","title":"Diffusive modes of two-band fermions under number-conserving dissipative\n  dynamics","comments":"6 pages, 2 figures, to appear in JETP Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mes-hall cond-mat.quant-gas quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Driven-dissipative protocols are proposed to control and create nontrivial\nquantum many-body correlated states. Protocols conserving the number of\nparticles stand apart. As well-known, in quantum systems with the unitary\ndynamics the particle number conservation and random scattering yield diffusive\nbehavior of two-particle excitations (diffusons and cooperons). Existence of\ndiffusive modes in the particle-number-conserving dissipative dynamics is not\nwell studied yet. We explicitly demonstrate the existence of diffusons in a\nparadigmatic model of a two-band system, with dissipative dynamics aiming to\nempty one fermion band and to populate the other one. The studied model is\ngeneralization of the model introduced in F. Tonielli, J. C. Budich, A.\nAltland, and S. Diehl, Phys. Rev. Lett. 124, 240404 (2020). We find how the\ndiffusion coefficient depends on details of a model and the rate of\ndissipation. We discuss how the existence of diffusive modes complicates\nengineering of macroscopic many-body correlated states.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:52:56 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 05:36:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lyublinskaya","A. A.",""],["Burmistrov","I. S.",""]]}
{"id":"2308.06554","submitter":"Hyeongjin Nam","authors":"Hyeongjin Nam, Daniel Sungho Jung, Yeonguk Oh, Kyoung Mu Lee","title":"Cyclic Test-Time Adaptation on Monocular Video for 3D Human Mesh\n  Reconstruction","comments":"Published at ICCV 2023, 16 pages including the supplementary material","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Despite recent advances in 3D human mesh reconstruction, domain gap between\ntraining and test data is still a major challenge. Several prior works tackle\nthe domain gap problem via test-time adaptation that fine-tunes a network\nrelying on 2D evidence (e.g., 2D human keypoints) from test images. However,\nthe high reliance on 2D evidence during adaptation causes two major issues.\nFirst, 2D evidence induces depth ambiguity, preventing the learning of accurate\n3D human geometry. Second, 2D evidence is noisy or partially non-existent\nduring test time, and such imperfect 2D evidence leads to erroneous adaptation.\nTo overcome the above issues, we introduce CycleAdapt, which cyclically adapts\ntwo networks: a human mesh reconstruction network (HMRNet) and a human motion\ndenoising network (MDNet), given a test video. In our framework, to alleviate\nhigh reliance on 2D evidence, we fully supervise HMRNet with generated 3D\nsupervision targets by MDNet. Our cyclic adaptation scheme progressively\nelaborates the 3D supervision targets, which compensate for imperfect 2D\nevidence. As a result, our CycleAdapt achieves state-of-the-art performance\ncompared to previous test-time adaptation methods. The codes are available at\nhttps://github.com/hygenie1228/CycleAdapt_RELEASE.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:55:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nam","Hyeongjin",""],["Jung","Daniel Sungho",""],["Oh","Yeonguk",""],["Lee","Kyoung Mu",""]]}
{"id":"2308.06555","submitter":"Thomas Gross","authors":"Rachel Crowder and George Price and Thomas Gro{\\ss}","title":"Simply tell me how -- On Trustworthiness and Technology Acceptance of\n  Attribute-Based Credentials","comments":"15 pages. Work funded by the ERC Starting Grant CASCAde (GA no\n  716980)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Attribute-based Credential Systems (ACS) have been long proposed as\nprivacy-preserving means of attribute-based authentication, yet neither been\nconsidered particularly usable nor found wide-spread adoption, to date. To\nestablish what variables drive the adoption of \\ACS as a usable security and\nprivacy technology, we investigated how intrinsic and presentation properties\nimpact their perceived trustworthiness and behavioral intent to adopt them. We\nconducted two confirmatory, fractional-factorial, between-subject,\nrandom-controlled trials with a total UK-representative sample of $N = 812$\nparticipants. Each participant inspected one of 24 variants of Anonymous\nCredential System Web site, which encoded a combination of three intrinsic\nfactors (\\textsf{provider}, \\textsf{usage}, \\textsf{benefits}) and three\npresentation factors (\\textsf{simplicity}, presence of \\textsf{people}, level\nof available \\textsf{support}). Participants stated their privacy and\nfaith-in-technology subjective norms before the trial. After having completed\nthe Web site inspection, they reported on the perceived trustworthiness, the\ntechnology adoption readiness, and their behavioral intention to follow\nthrough. We established a robust covariance-based structural equation model of\nthe perceived trustworthiness and technology acceptance, showing that\ncommunicating facilitating conditions as well as demonstrating results drive\nthe overall acceptance and behavioral intent. Of the manipulated causal\nvariables, communicating with simplicity and on the everyday usage had the\ngreatest and most consistently positive impact on the overall technology\nacceptance. After earlier correlational empirical research on ACS technology\nacceptance, ours is the first research showing cause-effect relations in a\nstructural latent factor model with substantial sample size.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:57:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Crowder","Rachel",""],["Price","George",""],["Gro\u00df","Thomas",""]]}
{"id":"2308.06556","submitter":"Andres Ferraro","authors":"Andres Ferraro, Jaehun Kim, Sergio Oramas, Andreas Ehmann, Fabien\n  Gouyon","title":"Contrastive Learning for Cross-modal Artist Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Music retrieval and recommendation applications often rely on content\nfeatures encoded as embeddings, which provide vector representations of items\nin a music dataset. Numerous complementary embeddings can be derived from\nprocessing items originally represented in several modalities, e.g., audio\nsignals, user interaction data, or editorial data. However, data of any given\nmodality might not be available for all items in any music dataset. In this\nwork, we propose a method based on contrastive learning to combine embeddings\nfrom multiple modalities and explore the impact of the presence or absence of\nembeddings from diverse modalities in an artist similarity task. Experiments on\ntwo datasets suggest that our contrastive method outperforms single-modality\nembeddings and baseline algorithms for combining modalities, both in terms of\nartist retrieval accuracy and coverage. Improvements with respect to other\nmethods are particularly significant for less popular query artists. We\ndemonstrate our method successfully combines complementary information from\ndiverse modalities, and is more robust to missing modality data (i.e., it\nbetter handles the retrieval of artists with different modality embeddings than\nthe query artist's).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:58:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ferraro","Andres",""],["Kim","Jaehun",""],["Oramas","Sergio",""],["Ehmann","Andreas",""],["Gouyon","Fabien",""]]}
{"id":"2308.06557","submitter":"Zhifeng Chen Dr","authors":"Kaibao Sun, Zhifeng Chen, Guangyu Dan, Qingfei Luo, Lirong Yan, Feng\n  Liu, and Xiaohong Joe Zhou","title":"Three-dimensional echo-shifted EPI with simultaneous blip-up and\n  blip-down acquisitions for correcting geometric distortion","comments":"8 figures, peer-reviewed journal paper","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Purpose: Echo-planar imaging (EPI) with blip-up/down acquisition (BUDA) can\nprovide high-quality images with minimal distortions by using two readout\ntrains with opposing phase-encoding gradients. Because of the need for two\nseparate acquisitions, BUDA doubles the scan time and degrades the temporal\nresolution when compared to single-shot EPI, presenting a major challenge for\nmany applications, particularly functional MRI (fMRI). This study aims at\novercoming this challenge by developing an echo-shifted EPI BUDA (esEPI-BUDA)\ntechnique to acquire both blip-up and blip-down datasets in a single shot.\nMethods: A three-dimensional (3D) esEPI-BUDA pulse sequence was designed by\nusing an echo-shifting strategy to produce two EPI readout trains. These\nreadout trains produced a pair of k-space datasets whose k-space trajectories\nwere interleaved with opposite phase-encoding gradient directions. The two\nk-space datasets were separately reconstructed using a 3D SENSE algorithm, from\nwhich time-resolved B0-field maps were derived using TOPUP in FSL and then\ninput into a forward model of joint parallel imaging reconstruction to correct\nfor geometric distortion. In addition, Hankel structured low-rank constraint\nwas incorporated into the reconstruction framework to improve image quality by\nmitigating the phase errors between the two interleaved k-space datasets.\nResults: The 3D esEPI-BUDA technique was demonstrated in a phantom and an fMRI\nstudy on healthy human subjects. Geometric distortions were effectively\ncorrected in both phantom and human brain images. In the fMRI study, the visual\nactivation volumes and their BOLD responses were comparable to those from\nconventional 3D echo-planar images. Conclusion: The improved imaging efficiency\nand dynamic distortion correction capability afforded by 3D esEPI-BUDA are\nexpected to benefit many EPI applications.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:02:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sun","Kaibao",""],["Chen","Zhifeng",""],["Dan","Guangyu",""],["Luo","Qingfei",""],["Yan","Lirong",""],["Liu","Feng",""],["Zhou","Xiaohong Joe",""]]}
{"id":"2308.06558","submitter":"Subhadip Bisal","authors":"Subhadip Bisal and Debottam Das","title":"Testing $Z$ boson rare decays $Z\\to H_1 \\gamma, A_1 \\gamma$ with\n  $(g-2)_{\\mu}$, $\\delta M_W$, and $BR(h_{\\rm SM}\\to Z\\gamma)$ in the NMSSM","comments":"32 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the rare decay process of $Z$ boson into photon, accompanied by a\nCP-even or CP-odd scalar. We present the analytical delineation of the\nprocesses through the model-independent parametrizations of the new physics\ncouplings and, finally, consider the Next-to-Minimal Supersymmetric Standard\nModel to mark out the parameter space where the branching fraction can have the\nmaximum value. As a part of the necessary phenomenological and experimental\ncross-checks, we aim to fit the anomalous magnetic moment of the muon and $W$\nboson mass anomaly through the supersymmetric contributions. We also find that\nthe decays $Z\\to H_1 \\gamma, A_1 \\gamma$ can serve as an excellent\ncomplementary test to $BR(h_{\\rm SM}\\to Z\\gamma)$. In fact, to facilitate\nfuture searches, we unveil a few benchmark points that additionally satisfy the\ndeviation of $BR(h_{\\rm SM}\\to Z\\gamma)$ from the SM value based on the recent\nmeasurements of ATLAS and CMS. Future proposals such as ILC, CEPC, and FCC-ee\nare anticipated to operate for multiple years, focusing on center-of-mass\nenergy near the $Z$ pole. Consequently, these projects will be capable of\nconducting experiments at the Giga-$Z$ ($10^{9}$ of $Z$ bosons) and Tera-$Z$\n($10^{12}$ of $Z$ bosons) phases, which may probe the aforesaid rare decay\nprocesses, thus the model as well. These unconventional yet complementary\nsearches offer different routes to explore the supersymmetric models with\nextended Higgs sectors like NMSSM.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:04:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bisal","Subhadip",""],["Das","Debottam",""]]}
{"id":"2308.06559","submitter":"Maria Loukaki","authors":"Stefanos Aivazidis, Maria Loukaki, Benjamin Sambale","title":"Common transversals and complements in abelian groups","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a finite abelian group $G$ and cyclic subgroups $A$, $B$, $C$ of $G$ of\nthe same order, we find necessary and sufficient conditions for $A$, $B$, $C$\nto admit a common transversal for the cosets they afford. For an arbitrary\nnumber of cyclic subgroups we give a sufficient criterion when there exists a\ncommon complement. Moreover, in several cases where a common transversal\nexists, we provide concrete constructions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:07:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Aivazidis","Stefanos",""],["Loukaki","Maria",""],["Sambale","Benjamin",""]]}
{"id":"2308.06560","submitter":"Jie Wang","authors":"Jie Wang and Youde Wang","title":"Rigidity and {\\epsilon}-regularity theorems of Ricci shrinkers","comments":"31 papers","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 rigidity and {\\epsilon}-regularity theorems of\nRicci shrinkers. First we prove the rigidity of the asymptotic volume ratio and\nlocal volume around a base point of a non-compact Ricci shrinker. Next we\nobtain some {\\epsilon}-regularity theorems of local entropy and curvature,\nwhich improve the previous corresponding results essentially and use them to\nstudy the structure of Ricci shrinkers at infinity. Especially, if the\ncurvature of a non-compact Ricci shrinker satisfies some natural integral\nconditions, then it is asymptotic to a cone.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:11:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jie",""],["Wang","Youde",""]]}
{"id":"2308.06561","submitter":"Mohammad Hadi Foroughmand Araabi","authors":"Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Kasra Alishahi","title":"An Approximation Algorithm for Ancestral Maximum-Likelihood and\n  Phylogeography Inference Problems under Time Reversible Markov Evolutionary\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CC q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ancestral maximum-likelihood and phylogeography problems are two\nfundamental problems involving evolutionary studies. The ancestral\nmaximum-likelihood problem involves identifying a rooted tree alongside\ninternal node sequences that maximizes the probability of observing a given set\nof sequences as leaves. The phylogeography problem extends the ancestral\nmaximum-likelihood problem to incorporate geolocation of leaf and internal\nnodes. While a constant factor approximation algorithm has been established for\nthe ancestral maximum-likelihood problem concerning two-state sequences, no\nsuch algorithm has been devised for any generalized instances of the problem.\nIn this paper, we focus on a generalization of the two-state model, the time\nreversible Markov evolutionary models for sequences and geolocations. Under\nthis evolutionary model, we present a $2\\log_2 k $-approximation algorithm,\nwhere $k$ is the number of input samples, addressing both the ancestral\nmaximum-likelihood and phylogeography problems. This is the first approximation\nalgorithm for the phylogeography problem. Furthermore, we show how to apply the\nalgorithm on popular evolutionary models like generalized time-reversible (GTR)\nmodel and its specialization Jukes and Cantor 69 (JC69).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:14:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Foroughmand-Araabi","Mohammad-Hadi",""],["Goliaei","Sama",""],["Alishahi","Kasra",""]]}
{"id":"2308.06562","submitter":"Xingyu Zhou","authors":"Xingyu Zhou, Le Liang, Jing Zhang, Chao-Kai Wen, and Shi Jin","title":"Gradient-Based Markov Chain Monte Carlo for MIMO Detection","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately detecting symbols transmitted over multiple-input multiple-output\n(MIMO) wireless channels is crucial in realizing the benefits of MIMO\ntechniques. However, optimal MIMO detection is associated with a complexity\nthat grows exponentially with the MIMO dimensions and quickly becomes\nimpractical. Recently, stochastic sampling-based Bayesian inference techniques,\nsuch as Markov chain Monte Carlo (MCMC), have been combined with the gradient\ndescent (GD) method to provide a promising framework for MIMO detection. In\nthis work, we propose to efficiently approach optimal detection by exploring\nthe discrete search space via MCMC random walk accelerated by Nesterov's\ngradient method. Nesterov's GD guides MCMC to make efficient searches without\nthe computationally expensive matrix inversion and line search. Our proposed\nmethod operates using multiple GDs per random walk, achieving sufficient\ndescent towards important regions of the search space before adding random\nperturbations, guaranteeing high sampling efficiency. To provide augmented\nexploration, extra samples are derived through the trajectory of Nesterov's GD\nby simple operations, effectively supplementing the sample list for statistical\ninference and boosting the overall MIMO detection performance. Furthermore, we\ndesign an early stopping tactic to terminate unnecessary further searches,\nremarkably reducing the complexity. Simulation results and complexity analysis\nreveal that the proposed method achieves near-optimal performance in both\nuncoded and coded MIMO systems, adapts to realistic channel models, and scales\nwell to large MIMO dimensions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:15:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhou","Xingyu",""],["Liang","Le",""],["Zhang","Jing",""],["Wen","Chao-Kai",""],["Jin","Shi",""]]}
{"id":"2308.06563","submitter":"Chengxi Wang","authors":"Chengxi Wang","title":"Fano varieties with conjecturally largest Fano index","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For Fano varieties of various singularities such as canonical and terminal,\nwe construct examples with large Fano index. By low-dimensional evidence, we\nconjecture that our examples have the largest Fano index for all dimensions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:16:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Chengxi",""]]}
{"id":"2308.06564","submitter":"Kehua Chen","authors":"Kehua Chen, Xianda Chen, Zihan Yu, Meixin Zhu, Hai Yang","title":"EquiDiff: A Conditional Equivariant Diffusion Model For Trajectory\n  Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurate trajectory prediction is crucial for the safe and efficient\noperation of autonomous vehicles. The growing popularity of deep learning has\nled to the development of numerous methods for trajectory prediction. While\ndeterministic deep learning models have been widely used, deep generative\nmodels have gained popularity as they learn data distributions from training\ndata and account for trajectory uncertainties. In this study, we propose\nEquiDiff, a deep generative model for predicting future vehicle trajectories.\nEquiDiff is based on the conditional diffusion model, which generates future\ntrajectories by incorporating historical information and random Gaussian noise.\nThe backbone model of EquiDiff is an SO(2)-equivariant transformer that fully\nutilizes the geometric properties of location coordinates. In addition, we\nemploy Recurrent Neural Networks and Graph Attention Networks to extract social\ninteractions from historical trajectories. To evaluate the performance of\nEquiDiff, we conduct extensive experiments on the NGSIM dataset. Our results\ndemonstrate that EquiDiff outperforms other baseline models in short-term\nprediction, but has slightly higher errors for long-term prediction.\nFurthermore, we conduct an ablation study to investigate the contribution of\neach component of EquiDiff to the prediction accuracy. Additionally, we present\na visualization of the generation process of our diffusion model, providing\ninsights into the uncertainty of the prediction.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:17:09 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 06:25:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Kehua",""],["Chen","Xianda",""],["Yu","Zihan",""],["Zhu","Meixin",""],["Yang","Hai",""]]}
{"id":"2308.06565","submitter":"Giacomo Cordoni","authors":"Giacomo Cordoni, Anna F. Marino, Antonino P. Milone, Emanuele\n  Dondoglio, Edoardo P. Lagioia, Maria Vittoria Legnardi, Anjana Mohandasan,\n  Sohee Jang and Tuila Ziliotto","title":"Multiple Stellar Populations outside the tidal radius of NGC1851 through\n  Gaia DR3 XP Spectra","comments":"13 pages, 10 figures, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ancient Galactic Globular Clusters (GCs) have long fascinated astronomers due\nto their intriguing multiple stellar populations characterized by variations in\nlight-element abundances. Among these clusters, Type-II GCs stand out as they\nexhibit stars with large differences in heavy-element chemical abundances.\nThese enigmatic clusters, comprising approximately 17\\% of analyzed GCs with\nMPs, have been hypothesized to be the remnants of accreted dwarf galaxies. We\nfocus on one of the most debated Type~II GCs, NGC1851, to investigate its MPs\nacross a wide spatial range of up to 50 arcmin from the cluster center. By\nusing Gaia DR3 low-resolution XP spectra, we generate synthetic photometry to\nperform a comprehensive analysis of the spatial distribution and kinematics of\nthe canonical and anomalous populations within this GC. By using appropriate\nCMDs from the synthetic photometry in the BVI bands and in the $\\rm f415^{25}$\nband introduced in this work, we identify distinct stellar sequences associated\nwith different heavy-element chemical composition. Our results suggest that the\ncanonical and the anomalous populations reside both inside and outside the\ntidal radius of NGC1851, up to a distance that exceeds by 3.5 times its tidal\nradius. However, $\\sim$80\\% of stars outside the tidal radius are consistent\nwith belonging to the canonical population, emphasizing its dominance in the\ncluster's outer regions. Remarkably, canonical stars exhibit a more circular\non-sky morphology, while the anomalous population displays an elliptical shape.\nFurthermore, we delve into the kinematics of the multiple populations. Our\nresults reveal a flat/increasing velocity dispersion profile in the outer\nregions and hints of a tangentially anisotropic motion in the outer regions,\nindicating a preference for stars to escape on radial orbits.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:17:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cordoni","Giacomo",""],["Marino","Anna F.",""],["Milone","Antonino P.",""],["Dondoglio","Emanuele",""],["Lagioia","Edoardo P.",""],["Legnardi","Maria Vittoria",""],["Mohandasan","Anjana",""],["Jang","Sohee",""],["Ziliotto","Tuila",""]]}
{"id":"2308.06566","submitter":"Daisuke Saida","authors":"Daisuke Saida, Mutsuo Hidaka, and Yuki Yamanashi","title":"4-bit Factorization Circuit Composed of Multiplier Units with\n  Superconducting Flux Qubits toward Quantum Annealing","comments":"Main text (9 pages, 5 figures) and Appendix (8 pages, 7 figures).\n  Submitted in IEEE Transactions on Applied Superconductivity (under review)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prime factorization (P = M*N) is considered to be a promising application in\nquantum computations. We perform 4-bit factorization in experiments using a\nsuperconducting flux qubit toward quantum annealing. Our proposed method uses a\nsuperconducting quantum circuit implementing a multiplier Hamiltonian, which\nprovides combinations of M and N as a factorization solution after quantum\nannealing when the integer P is initially set. The circuit comprises multiple\nmultiplier units combined with connection qubits. The key points are a native\nimplementation of the multiplier Hamiltonian to the superconducting quantum\ncircuit and its fabrication using a Nb multilayer process with a Josephson\njunction dedicated to the qubit. The 4-bit factorization circuit comprises 32\nsuperconducting flux qubits. Our method has superior scalability because the\nHamiltonian is implemented with fewer qubits than in conventional methods using\na chimera graph architecture. We perform experiments at 10 mK to clarify the\nvalidity of interconnections of a multiplier unit using qubits. We demonstrate\nexperiments at 4.2 K and simulations for the factorization of integers 4, 6,\nand 9.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:24:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Saida","Daisuke",""],["Hidaka","Mutsuo",""],["Yamanashi","Yuki",""]]}
{"id":"2308.06567","submitter":"Zuo Wang","authors":"Zuo Wang, Shi-Liang Zhu, Li-Jun Lang, Liang He","title":"Measurement-induced integer families of critical dynamical scaling in\n  quantum many-body systems","comments":"4.5 pages (3 figures) + supplemental material (7 figures)","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":"  A quantum many-body system can undergo transitions in the presence of\ncontinuous measurement. In this work, we find that a generic class of critical\ndynamical scaling behavior can emerge at these measurement-induced transitions.\nRemarkably, depending on the symmetry that can be respected by the system,\ndifferent integer families of dynamical scaling can emerge. The origin of these\nscaling families can be traced back to the presence of hierarchies of high\norder exceptional points in the effective non-Hermitian descriptions of the\nsystems. Direct experimental observation of this class of dynamical scaling\nbehavior can be readily achieved using ultracold atoms in optical lattices or\nthrough intermediate-scale quantum computing systems.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:27:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zuo",""],["Zhu","Shi-Liang",""],["Lang","Li-Jun",""],["He","Liang",""]]}
{"id":"2308.06568","submitter":"Hanna Halaburda","authors":"Joshua S. Gans and Hanna Halaburda","title":"\"Zero Cost'' Majority Attacks on Permissionless Blockchains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.GT econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The core premise of permissionless blockchains is their reliable and secure\noperation without the need to trust any individual agent. At the heart of\nblockchain consensus mechanisms is an explicit cost (whether work or stake) for\nparticipation in the network and the opportunity to add blocks to the\nblockchain. A key rationale for that cost is to make attacks on the network,\nwhich could be theoretically carried out if a majority of nodes were controlled\nby a single entity, too expensive to be worthwhile. We demonstrate that a\nmajority attacker can successfully attack with a {\\em negative cost}, which\nshows that the protocol mechanisms are insufficient to create a secure network,\nand emphasizes the importance of socially driven mechanisms external to the\nprotocol. At the same time, negative cost enables a new type of majority attack\nthat is more likely to elude external scrutiny.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:38:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gans","Joshua S.",""],["Halaburda","Hanna",""]]}
{"id":"2308.06569","submitter":"Vedran Sohinger","authors":"Andrew Rout and Vedran Sohinger","title":"A microscopic derivation of Gibbs measures for the 1D focusing quintic\n  nonlinear Schr\\\"{o}dinger equation","comments":"61 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we obtain a microscopic derivation of Gibbs measures for the\nfocusing quintic (nonlocal) nonlinear Schr\\\"{o}dinger equation (NLS) on\n$\\mathbb{T}$ from many-body quantum Gibbs states. On the quantum many-body\nlevel, the quintic nonlinearity corresponds to a three-body interaction. This\nis a continuation of our previous work. In the aforementioned work, we studied\nthe cubic problem, which corresponds to a two-body interaction on the quantum\nmany-body level.\n  In our setup, we truncate the mass of the classical free field in the\nclassical setting and the rescaled particle number in the quantum setting. Our\nmethods are based on a perturbative expansion previously developed in the work\nof Fr\\\"{o}hlich, Knowles, Schlein, and the second author. A challenge consists\nin analysing the nonlocal quintic NLS obtained in the classical limit. We prove\nresults both in the time-independent and in the time-dependent setting. This is\nthe first such known result in the three-body regime. Furthermore, this gives\nthe first microscopic derivation of time-dependent correlation functions for\nGibbs measures corresponding to the quintic NLS, as studied in the work of\nBourgain.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:43:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rout","Andrew",""],["Sohinger","Vedran",""]]}
{"id":"2308.06570","submitter":"Kristian Fischer","authors":"Kristian Fischer and Christian Herglotz and Andr\\'e Kaup","title":"On Versatile Video Coding at UHD with Machine-Learning-Based\n  Super-Resolution","comments":"Originally published as conference paper at QoMEX 2020","journal-ref":null,"doi":"10.1109/QoMEX48832.2020.9123140","report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Coding 4K data has become of vital interest in recent years, since the amount\nof 4K data is significantly increasing. We propose a coding chain with spatial\ndown- and upscaling that combines the next-generation VVC codec with machine\nlearning based single image super-resolution algorithms for 4K. The\ninvestigated coding chain, which spatially downscales the 4K data before\ncoding, shows superior quality than the conventional VVC reference software for\nlow bitrate scenarios. Throughout several tests, we find that up to 12 % and 18\n% Bjontegaard delta rate gains can be achieved on average when coding 4K\nsequences with VVC and QP values above 34 and 42, respectively. Additionally,\nthe investigated scenario with up- and downscaling helps to reduce the loss of\ndetails and compression artifacts, as it is shown in a visual example.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:47:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fischer","Kristian",""],["Herglotz","Christian",""],["Kaup","Andr\u00e9",""]]}
{"id":"2308.06571","submitter":"Hangjie Yuan","authors":"Jiuniu Wang, Hangjie Yuan, Dayou Chen, Yingya Zhang, Xiang Wang,\n  Shiwei Zhang","title":"ModelScope Text-to-Video Technical Report","comments":"Technical report. Project page:\n  \\url{https://modelscope.cn/models/damo/text-to-video-synthesis/summary}","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 introduces ModelScopeT2V, a text-to-video synthesis model that\nevolves from a text-to-image synthesis model (i.e., Stable Diffusion).\nModelScopeT2V incorporates spatio-temporal blocks to ensure consistent frame\ngeneration and smooth movement transitions. The model could adapt to varying\nframe numbers during training and inference, rendering it suitable for both\nimage-text and video-text datasets. ModelScopeT2V brings together three\ncomponents (i.e., VQGAN, a text encoder, and a denoising UNet), totally\ncomprising 1.7 billion parameters, in which 0.5 billion parameters are\ndedicated to temporal capabilities. The model demonstrates superior performance\nover state-of-the-art methods across three evaluation metrics. The code and an\nonline demo are available at\n\\url{https://modelscope.cn/models/damo/text-to-video-synthesis/summary}.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:53:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jiuniu",""],["Yuan","Hangjie",""],["Chen","Dayou",""],["Zhang","Yingya",""],["Wang","Xiang",""],["Zhang","Shiwei",""]]}
{"id":"2308.06572","submitter":"Oded Regev","authors":"Oded Regev","title":"An Efficient Quantum Factoring Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that $n$-bit integers can be factorized by independently running a\nquantum circuit with $\\tilde{O}(n^{3/2})$ gates for $\\sqrt{n}+4$ times, and\nthen using polynomial-time classical post-processing. The correctness of the\nalgorithm relies on a number-theoretic heuristic assumption reminiscent of\nthose used in subexponential classical factorization algorithms. It is\ncurrently not clear if the algorithm can lead to improved physical\nimplementations in practice.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:57:38 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 16:49:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Regev","Oded",""]]}
{"id":"2308.06573","submitter":"Shouyi Lu","authors":"Guirong Zhuo, Shouyi Lu, Huanyu Zhou, Lianqing Zheng, Lu Xiong","title":"4DRVO-Net: Deep 4D Radar-Visual Odometry Using Multi-Modal and\n  Multi-Scale Adaptive Fusion","comments":"14 pages,12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Four-dimensional (4D) radar--visual odometry (4DRVO) integrates complementary\ninformation from 4D radar and cameras, making it an attractive solution for\nachieving accurate and robust pose estimation. However, 4DRVO may exhibit\nsignificant tracking errors owing to three main factors: 1) sparsity of 4D\nradar point clouds; 2) inaccurate data association and insufficient feature\ninteraction between the 4D radar and camera; and 3) disturbances caused by\ndynamic objects in the environment, affecting odometry estimation. In this\npaper, we present 4DRVO-Net, which is a method for 4D radar--visual odometry.\nThis method leverages the feature pyramid, pose warping, and cost volume (PWC)\nnetwork architecture to progressively estimate and refine poses. Specifically,\nwe propose a multi-scale feature extraction network called Radar-PointNet++\nthat fully considers rich 4D radar point information, enabling fine-grained\nlearning for sparse 4D radar point clouds. To effectively integrate the two\nmodalities, we design an adaptive 4D radar--camera fusion module (A-RCFM) that\nautomatically selects image features based on 4D radar point features,\nfacilitating multi-scale cross-modal feature interaction and adaptive\nmulti-modal feature fusion. In addition, we introduce a velocity-guided\npoint-confidence estimation module to measure local motion patterns, reduce the\ninfluence of dynamic objects and outliers, and provide continuous updates\nduring pose refinement. We demonstrate the excellent performance of our method\nand the effectiveness of each module design on both the VoD and in-house\ndatasets. Our method outperforms all learning-based and geometry-based methods\nfor most sequences in the VoD dataset. Furthermore, it has exhibited promising\nperformance that closely approaches that of the 64-line LiDAR odometry results\nof A-LOAM without mapping optimization.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:00:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhuo","Guirong",""],["Lu","Shouyi",""],["Zhou","Huanyu",""],["Zheng","Lianqing",""],["Xiong","Lu",""]]}
{"id":"2308.06574","submitter":"George Janelidze","authors":"George Janelidze","title":"Ideally exact categories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this paper is to initiate a development of a new non-pointed\ncounterpart of semi-abelian categorical algebra. We are making, however, only\nthe first step in it by giving equivalent definitions of what we call ideally\nexact categories, and showing that these categories admit a description of\nquotient objects by means of intrinsically defined ideals, in spite of being\nnon-pointed. As a tool we involve a new notion of essentially nullary monad,\nand show that Bourn protomodularity condition makes cartesian monads\nessentially nullary. All semi-abelian categories, all non-trivial Bourn\nprotomodular varieties of universal algebras, and all cotoposes are ideally\nexact.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:03:35 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 20:11:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Janelidze","George",""]]}
{"id":"2308.06575","submitter":"Zhenqiang Ma","authors":"Jie Zhou, Ashok Dheenan, Jiarui Gong, Carolina Adamo, Patrick\n  Marshall, Moheb Sheikhi, Tsung-Han Tsai, Nathan Wriedt, Clincy Cheung,\n  Shuoyang Qiu, Tien Khee Ng, Qiaoqiang Gan, Gambin Vincent, Boon S. Ooi,\n  Siddharth Rajan, Zhenqiang Ma","title":"Initial demonstration of AlGaAs-GaAsP-beta-Ga2O3 n-p-n double\n  heterojunctions","comments":"12 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":"  Beta phase gallium oxides, an ultrawide-bandgap semiconductor, has great\npotential for future power and RF electronics applications but faces challenges\nin bipolar device applications due to the lack of p-type dopants. In this work,\nwe demonstrate monocrystalline AlGaAs_GaAsP_beta phase gallium oxides n-p-n\ndouble-heterojunctions, synthesized using semiconductor grafting technology. By\ntransfer printing an n-AlGaAs_p-GaAsP nanomembrane to the n-beta\nphase-Ga$_2$O$_3$ epitaxial substrate, we simultaneously achieved AlGaAs_GaAsP\nepitaxial n-p junction diode with an ideality factor of 1.29 and a\nrectification ratio of 2.57E3 at +/- 2 V, and grafted GaAsP_beta_phase_gallium\noxides p-n junction diode exhibiting an ideality factor of 1.36 and a\nrectification ratio of 4.85E2 at +/- 2 V.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:10:32 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 00:48:17 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhou","Jie",""],["Dheenan","Ashok",""],["Gong","Jiarui",""],["Adamo","Carolina",""],["Marshall","Patrick",""],["Sheikhi","Moheb",""],["Tsai","Tsung-Han",""],["Wriedt","Nathan",""],["Cheung","Clincy",""],["Qiu","Shuoyang",""],["Ng","Tien Khee",""],["Gan","Qiaoqiang",""],["Vincent","Gambin",""],["Ooi","Boon S.",""],["Rajan","Siddharth",""],["Ma","Zhenqiang",""]]}
{"id":"2308.06576","submitter":"Oona Rainio","authors":"Oona Rainio and Rahim Kargar","title":"Intrinsic metrics defined with arithmetic and logarithmic mean values","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We introduce several new functions that measure the distance between two\npoints $x$ and $y$ in a domain $G\\subsetneq\\mathbb{R}^n$ by using the\narithmetic or the logarithmic mean of the Euclidean distances from the points\n$x$ and $y$ to the boundary of $G$. We study in which domains these functions\nare metrics and find sharp inequalities between them and the hyperbolic metric.\nWe also present one result about their distortion under quasiregular mappings.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:20:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rainio","Oona",""],["Kargar","Rahim",""]]}
{"id":"2308.06577","submitter":"Haibo Li","authors":"Haibo Li","title":"A preconditioned Krylov subspace method for linear inverse problems with\n  general-form Tikhonov regularization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tikhonov regularization is a widely used technique in solving inverse\nproblems that can enforce prior properties on the desired solution. In this\npaper, we propose a Krylov subspace based iterative method for solving linear\ninverse problems with general-form Tikhonov regularization term $x^TMx$, where\n$M$ is a positive semi-definite matrix. An iterative process called the\npreconditioned Golub-Kahan bidiagonalization (pGKB) is designed, which\nimplicitly utilizes a proper preconditioner to generate a series of solution\nsubspaces with desirable properties encoded by the regularizer $x^TMx$. Based\non the pGKB process, we propose an iterative regularization algorithm via\nprojecting the original problem onto small dimensional solution subspaces. We\nanalyze regularization effect of this algorithm, including the incorporation of\nprior properties of the desired solution into the solution subspace and the\nsemi-convergence behavior of regularized solution. To overcome instabilities\ncaused by semi-convergence, we further propose two pGKB based hybrid\nregularization algorithms. All the proposed algorithms are tested on both\nsmall-scale and large-scale linear inverse problems. Numerical results\ndemonstrate that these iterative algorithms exhibit excellent performance,\noutperforming other state-of-the-art algorithms in some cases.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:21:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Haibo",""]]}
{"id":"2308.06578","submitter":"Gal Haspel","authors":"Gal Haspel (NJIT), Edward S Boyden (MIT), Jeffrey Brown (MIT), George\n  Church (Harvard University), Netta Cohen (University of Leeds), Christopher\n  Fang-Yen (Ohio State University), Steven Flavell (MIT), Miriam B Goodman\n  (Stanford University), Anne C Hart (Brown University), Oliver Hobert\n  (Columbia University), Konstantinos Kagias (MIT), Shawn Lockery (University\n  of Oregon), Yangning Lu (MIT), Adam Marblestone (Convergent Research), Jordan\n  Matelsky (University of Pennsylvania), Hanspeter Pfister (Harvard\n  University), Horacio G Rotstein (NJIT), Monika Scholz (Max Planck Institute\n  for Neurobiology of Behavior), Eli Shlizerman (University of Washington),\n  Quilee Simeon (MIT), Michael A Skuhersky (MIT), Vivek Venkatachalam\n  (Northeastern University), Guangyu Robert Yang (MIT), Eviatar Yemini\n  (University of Massachusetts), Manuel Zimmer (University of Vienna), Konrad P\n  Kording (University of Pennsylvania)","title":"To reverse engineer an entire nervous system","comments":"23 pages, 2 figures, opinion paper","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  There are many theories of how behavior may be controlled by neurons. Testing\nand refining these theories would be greatly facilitated if we could correctly\nsimulate an entire nervous system so we could replicate the brain dynamics in\nresponse to any stimuli or contexts. Besides, simulating a nervous system is in\nitself one of the big dreams in systems neuroscience. However, doing so\nrequires us to identify how each neuron's output depends on its inputs, a\nprocess we call reverse engineering. Current efforts at this focus on the\nmammalian nervous system, but these brains are mind-bogglingly complex,\nallowing only recordings of tiny subsystems. Here we argue that the time is\nripe for systems neuroscience to embark on a concerted effort to reverse\nengineer a smaller system and that Caenorhabditis elegans is the ideal\ncandidate system as the established optophysiology techniques can capture and\ncontrol each neuron's activity and scale to hundreds of thousands of\nexperiments. Data across populations and behaviors can be combined because\nacross individuals the nervous system is largely conserved in form and\nfunction. Modern machine-learning-based modeling should then enable a\nsimulation of C. elegans' impressive breadth of brain states and behaviors. The\nability to reverse engineer an entire nervous system will benefit the design of\nartificial intelligence systems and all of systems neuroscience, enabling\nfundamental insights as well as new approaches for investigations of\nprogressively larger nervous systems.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:26:38 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 10:45:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Haspel","Gal","","NJIT"],["Boyden","Edward S","","MIT"],["Brown","Jeffrey","","MIT"],["Church","George","","Harvard University"],["Cohen","Netta","","University of Leeds"],["Fang-Yen","Christopher","","Ohio State University"],["Flavell","Steven","","MIT"],["Goodman","Miriam B","","Stanford University"],["Hart","Anne C","","Brown University"],["Hobert","Oliver","","Columbia University"],["Kagias","Konstantinos","","MIT"],["Lockery","Shawn","","University\n  of Oregon"],["Lu","Yangning","","MIT"],["Marblestone","Adam","","Convergent Research"],["Matelsky","Jordan","","University of Pennsylvania"],["Pfister","Hanspeter","","Harvard\n  University"],["Rotstein","Horacio G","","NJIT"],["Scholz","Monika","","Max Planck Institute\n  for Neurobiology of Behavior"],["Shlizerman","Eli","","University of Washington"],["Simeon","Quilee","","MIT"],["Skuhersky","Michael A","","MIT"],["Venkatachalam","Vivek","","Northeastern University"],["Yang","Guangyu Robert","","MIT"],["Yemini","Eviatar","","University of Massachusetts"],["Zimmer","Manuel","","University of Vienna"],["Kording","Konrad P","","University of Pennsylvania"]]}
{"id":"2308.06579","submitter":"Mohammed Al Kobaisi Dr.","authors":"Omar Chaabi and Mohammed Al Kobaisi","title":"Algorithmic Monotone Multiscale Finite Volume Methods for Porous Media\n  Flow","comments":"29 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":"  Multiscale finite volume methods are known to produce reduced systems with\nmultipoint stencils which, in turn, could give non-monotone and out-of-bound\nsolutions. We propose a novel solution to the monotonicity issue of multiscale\nmethods. The proposed algorithmic monotone (AM- MsFV/MsRSB) framework is based\non an algebraic modification to the original MsFV/MsRSB coarse-scale stencil.\nThe AM-MsFV/MsRSB guarantees monotonic and within bound solutions without\ncompromising accuracy for various coarsening ratios; hence, it effectively\naddresses the challenge of multiscale methods' sensitivity to coarse grid\npartitioning choices. Moreover, by preserving the near null space of the\noriginal operator, the AM-MsRSB showed promising performance when integrated in\niterative formulations using both the control volume and the Galerkin-type\nrestriction operators. We also propose a new approach to enhance the\nperformance of MsRSB for MPFA discretized systems, particularly targeting the\nconstruction of the prolongation operator. Results show the potential of our\napproach in terms of accuracy of the computed basis functions and the overall\nconvergence behavior of the multiscale solver while ensuring a monotone\nsolution at all times.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:30:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chaabi","Omar",""],["Kobaisi","Mohammed Al",""]]}
{"id":"2308.06580","submitter":"Kevin Liu","authors":"Ann Clifton, Eva Czabarka, Kevin Liu, Sarah Loeb, Utku Okur, Laszlo\n  Szekely, Kristina Wicke","title":"Universal rooted phylogenetic tree shapes and universal tanglegrams","comments":"18 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide an $\\Omega(n\\log n) $ lower bound and an $O(n^2)$ upper bound for\nthe smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes),\nwhich are universal for rooted binary trees with $n$ leaves, i.e., contain all\nof them as induced binary subtrees. We explicitly compute the smallest\nuniversal trees for $n\\leq 11$. We also provide an $\\Omega(n^2) $ lower bound\nand an $O(n^4)$ upper bound for the smallest size of tanglegrams, which are\nuniversal for size $n$ tanglegrams, i.e., which contain all of them as induced\nsubtanglegrams. Some of our results generalize to rooted $d$-ary trees and to\n$d$-ary tanglegrams.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:35:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Clifton","Ann",""],["Czabarka","Eva",""],["Liu","Kevin",""],["Loeb","Sarah",""],["Okur","Utku",""],["Szekely","Laszlo",""],["Wicke","Kristina",""]]}
{"id":"2308.06581","submitter":"Larry Bull","authors":"Larry Bull and Haixia Liu","title":"On Cooperative Coevolution and Global Crossover","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cooperative coevolutionary algorithms (CCEAs) divide a given problem in to a\nnumber of subproblems and use an evolutionary algorithm to solve each\nsubproblem. This short paper is concerned with the scenario under which only a\nsingle, global fitness measure exists. By removing the typically used\nsubproblem partnering mechanism, it is suggested that such CCEAs can be viewed\nas making use of a generalised version of the global crossover operator\nintroduced in early Evolution Strategies. Using the well-known NK model of\nfitness landscapes, the effects of varying aspects of global crossover with\nrespect to the ruggedness of the underlying fitness landscape are explored.\nResults suggest improvements over the most widely used form of CCEAs, something\nfurther demonstrated using other well-known test functions.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:41:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bull","Larry",""],["Liu","Haixia",""]]}
{"id":"2308.06582","submitter":"Xuerui Qiu","authors":"Xuerui Qiu, Rui-Jie Zhu, Yuhong Chou, Zhaorui Wang, Liang-jian Deng,\n  Guoqi Li","title":"Gated Attention Coding for Training High-performance and Efficient\n  Spiking Neural Networks","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spiking neural networks (SNNs) are emerging as an energy-efficient\nalternative to traditional artificial neural networks (ANNs) due to their\nunique spike-based event-driven nature. Coding is crucial in SNNs as it\nconverts external input stimuli into spatio-temporal feature sequences.\nHowever, most existing deep SNNs rely on direct coding that generates powerless\nspike representation and lacks the temporal dynamics inherent in human vision.\nHence, we introduce Gated Attention Coding (GAC), a plug-and-play module that\nleverages the multi-dimensional gated attention unit to efficiently encode\ninputs into powerful representations before feeding them into the SNN\narchitecture. GAC functions as a preprocessing layer that does not disrupt the\nspike-driven nature of the SNN, making it amenable to efficient neuromorphic\nhardware implementation with minimal modifications. Through an observer model\ntheoretical analysis, we demonstrate GAC's attention mechanism improves\ntemporal dynamics and coding efficiency. Experiments on CIFAR10/100 and\nImageNet datasets demonstrate that GAC achieves state-of-the-art accuracy with\nremarkable efficiency. Notably, we improve top-1 accuracy by 3.10\\% on CIFAR100\nwith only 6-time steps and 1.07\\% on ImageNet while reducing energy usage to\n66.9\\% of the previous works. To our best knowledge, it is the first time to\nexplore the attention-based dynamic coding scheme in deep SNNs, with\nexceptional effectiveness and efficiency on large-scale datasets.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:42:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qiu","Xuerui",""],["Zhu","Rui-Jie",""],["Chou","Yuhong",""],["Wang","Zhaorui",""],["Deng","Liang-jian",""],["Li","Guoqi",""]]}
{"id":"2308.06583","submitter":"John Carter","authors":"John D. Carter","title":"Instability of Near-Extreme Solutions to the Whitham Equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Whitham equation is a model for the evolution of small-amplitude,\nunidirectional waves of all wavelengths on shallow water. It has been shown to\naccurately model the evolution of waves in laboratory experiments. We compute\n$2\\pi$-periodic traveling-wave solutions of the Whitham equation and\nnumerically study their stability with a focus on solutions with large\nsteepness. We show that the Hamiltonian oscillates as a function of wave\nsteepness when the solutions are sufficiently steep. We show that a\nsuperharmonic instability is created at each extremum of the Hamiltonian and\nthat between each extremum the stability spectra undergo similar bifurcations.\nFinally, we compare these results with those from the Euler equations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:42:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carter","John D.",""]]}
{"id":"2308.06584","submitter":"Yujie Wang","authors":"Shuyang Zhang, Zhikun Zeng, Houfei Yuan, Zihang Xu, Xinyu Ai, Lewei\n  He, Zhifeng Li, and Yujie Wang","title":"Experimental Study of Granular Clogging in Two-Dimensional Hopper","comments":"22 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 experimentally investigate the clogging process of granular materials in a\ntwo-dimensional hopper, and present a self-consistent physical mechanism of\nclogging based on preformed dynamic chain structures in the flow. We found that\nthese chain structures follow a specific modified restricted random walk, and\nclogging occurs when they are mechanically stable enough to withstand the flow\nfluctuations, resulting in the formation of an arch at the outlet. We introduce\na simple model which can explain the clogging probability by incorporating an\nanalytical expression for chain formation and its transition into an arch. Our\nresults provide insight into the microscopic mechanism of clogging in hopper\nflow.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:43:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Shuyang",""],["Zeng","Zhikun",""],["Yuan","Houfei",""],["Xu","Zihang",""],["Ai","Xinyu",""],["He","Lewei",""],["Li","Zhifeng",""],["Wang","Yujie",""]]}
{"id":"2308.06585","submitter":"Pasquale Minervini","authors":"Michael Cochez, Dimitrios Alivanistos, Erik Arakelyan, Max Berrendorf,\n  Daniel Daza, Mikhail Galkin, Pasquale Minervini, Mathias Niepert, Hongyu Ren","title":"Approximate Answering of Graph Queries","comments":"Preprint of Ch. 17 \"Approximate Answering of Graph Queries\" in\n  \"Compendium of Neurosymbolic Artificial Intelligence\",\n  https://ebooks.iospress.nl/ISBN/978-1-64368-406-2","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DB cs.LO cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge graphs (KGs) are inherently incomplete because of incomplete world\nknowledge and bias in what is the input to the KG. Additionally, world\nknowledge constantly expands and evolves, making existing facts deprecated or\nintroducing new ones. However, we would still want to be able to answer queries\nas if the graph were complete. In this chapter, we will give an overview of\nseveral methods which have been proposed to answer queries in such a setting.\nWe will first provide an overview of the different query types which can be\nsupported by these methods and datasets typically used for evaluation, as well\nas an insight into their limitations. Then, we give an overview of the\ndifferent approaches and describe them in terms of expressiveness, supported\ngraph types, and inference capabilities.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:47:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cochez","Michael",""],["Alivanistos","Dimitrios",""],["Arakelyan","Erik",""],["Berrendorf","Max",""],["Daza","Daniel",""],["Galkin","Mikhail",""],["Minervini","Pasquale",""],["Niepert","Mathias",""],["Ren","Hongyu",""]]}
{"id":"2308.06586","submitter":"Dallas Albritton","authors":"Dallas Albritton, Nicola De Nitti","title":"Sharp bounds on enstrophy growth for viscous scalar conservation laws","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We prove sharp bounds on the enstrophy growth in viscous scalar conservation\nlaws. The upper bound is, up to a prefactor, the enstrophy created by the\nsteepest viscous shock admissible by the $L^\\infty$ and total variation bounds\nand viscosity. This answers a conjecture by D. Ayala and B. Protas\n(\\emph{Physica D}, 2011), based on numerical evidence, for the viscous Burgers\nequation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:47:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Albritton","Dallas",""],["De Nitti","Nicola",""]]}
{"id":"2308.06587","submitter":"Owura Asare","authors":"Owura Asare, Meiyappan Nagappan, N. Asokan","title":"Copilot Security: A User Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Code generation tools driven by artificial intelligence have recently become\nmore popular due to advancements in deep learning and natural language\nprocessing that have increased their capabilities. The proliferation of these\ntools may be a double-edged sword because while they can increase developer\nproductivity by making it easier to write code, research has shown that they\ncan also generate insecure code. In this paper, we perform a user-centered\nevaluation GitHub's Copilot to better understand its strengths and weaknesses\nwith respect to code security. We conduct a user study where participants solve\nprogramming problems, which have potentially vulnerable solutions, with and\nwithout Copilot assistance. The main goal of the user study is to determine how\nthe use of Copilot affects participants' security performance. In our set of\nparticipants (n=25), we find that access to Copilot accompanies a more secure\nsolution when tackling harder problems. For the easier problem, we observe no\neffect of Copilot access on the security of solutions. We also observe no\ndisproportionate impact of Copilot use on particular kinds of vulnerabilities.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:49:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Asare","Owura",""],["Nagappan","Meiyappan",""],["Asokan","N.",""]]}
{"id":"2308.06588","submitter":"Carlo Beltran","authors":"Carlo Beltran, Alexey Bobtsov, Romeo Ortega, Diego Langarica-Cordoba,\n  Rafael Cisneros, Luis H. Diaz-Saldierna","title":"On-line Parameter Estimation of the Polarization Curve of a Fuel Cell\n  with Guaranteed Convergence Properties: Theoretical and Experimental Results","comments":"16 pages, 18 figures, requires IEEEtran.cls 2015/08/26 version V1.8b","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we address the problem of online parameter estimation of a\nProton Exchange Membrane Fuel Cell (PEMFC) polarization curve, that is the\nstatic relation between the voltage and the current of the PEMFC. The task of\ndesigning this estimator -- even off-line -- is complicated by the fact that\nthe uncertain parameters enter the curve in a highly nonlinear fashion, namely\nin the form of nonseparable nonlinearities. We consider several scenarios for\nthe model of the polarization curve, starting from the standard full model and\nincluding several popular simplifications to this complicated mathematical\nfunction. In all cases, we derive separable regression equations -- either\nlinearly or nonlinearly parameterized -- which are instrumental for the\nimplementation of the parameter estimators. We concentrate our attention on\non-line estimation schemes for which, under suitable excitation conditions,\nglobal parameter convergence is ensured. Due to these global convergence\nproperties, the estimators are robust to unavoidable additive noise and\nstructural uncertainty. Moreover, their on-line nature endows the schemes with\nthe ability to track (slow) parameter variations, that occur during the\noperation of the PEMFC. These two features -- unavailable in time-consuming\noff-line data-fitting procedures -- make the proposed estimators helpful for\non-line time-saving characterization of a given PEMFC, and the implementation\nof fault-detection procedures and model-based adaptive control strategies.\nSimulation and experimental results that validate the theoretical claims are\npresented.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:53:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Beltran","Carlo",""],["Bobtsov","Alexey",""],["Ortega","Romeo",""],["Langarica-Cordoba","Diego",""],["Cisneros","Rafael",""],["Diaz-Saldierna","Luis H.",""]]}
{"id":"2308.06589","submitter":"Satyabrata Patnaik","authors":"H. Singh, A. Gautam, M.Singh, P. Saha, P. Kumar, P.Das, M. Lamba, K.\n  Yadav, P. K. Mishra, S. Patnaik and A. Ganguli","title":"On the Experimental Evidence for Possible Superconductivity in LK99","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":"  The desire to create an energy efficient world is bound to be incomplete\nwithout the discovery of a room temperature superconductor at ambient pressure.\nA recent report on the room-temperature ambient-pressure superconductor has\ninspired scientists to study the Cu doped Lead apatite named as LK-99. Here, we\nhave synthesized Cu doped LK-99 and Ni-doped LK-99 compounds and studied their\ntemperature dependent transport and magnetization behavior. In spite of the\npresence of impurity phase Cu$_2$S, the temperature dependent resistance shows\nan insulating nature of the sample. The radio frequency penetration depth\nmeasurement unveils the absence of diamagnetic flux expulsion in this sample.\nThe temperature dependent ac susceptibility measurements reveal the\nparamagnetic nature of the Ni doped LK-99.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:54:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Singh","H.",""],["Gautam","A.",""],["Singh","M.",""],["Saha","P.",""],["Kumar","P.",""],["Das","P.",""],["Lamba","M.",""],["Yadav","K.",""],["Mishra","P. K.",""],["Patnaik","S.",""],["Ganguli","A.",""]]}
{"id":"2308.06590","submitter":"Carlos Luis","authors":"Carlos E. Luis, Alessandro G. Bottero, Julia Vinogradska, Felix\n  Berkenkamp, Jan Peters","title":"Value-Distributional Model-Based 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":"  Quantifying uncertainty about a policy's long-term performance is important\nto solve sequential decision-making tasks. We study the problem from a\nmodel-based Bayesian reinforcement learning perspective, where the goal is to\nlearn the posterior distribution over value functions induced by parameter\n(epistemic) uncertainty of the Markov decision process. Previous work restricts\nthe analysis to a few moments of the distribution over values or imposes a\nparticular distribution shape, e.g., Gaussians. Inspired by distributional\nreinforcement learning, we introduce a Bellman operator whose fixed-point is\nthe value distribution function. Based on our theory, we propose Epistemic\nQuantile-Regression (EQR), a model-based algorithm that learns a value\ndistribution function that can be used for policy optimization. Evaluation\nacross several continuous-control tasks shows performance benefits with respect\nto established model-based and model-free algorithms.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:59:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Luis","Carlos E.",""],["Bottero","Alessandro G.",""],["Vinogradska","Julia",""],["Berkenkamp","Felix",""],["Peters","Jan",""]]}
{"id":"2308.06591","submitter":"Leonardo Fallani","authors":"Leonardo Fallani","title":"Multicomponent spin mixtures of two-electron fermions","comments":"33 pages, 13 figures, Lecture notes for the Proceedings of the\n  International School of Physics \"Enrico Fermi\" Course 211 \"Quantum Mixtures\n  with Ultra-Cold Atoms\" (Varenna, Italy, 2022)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  These lecture notes contain an introduction to the physics of quantum\nmixtures of ultracold atoms trapped in multiple internal states. I will discuss\nthe case of fermionic isotopes of alkaline-earth atoms, which feature an\nintrinsic SU($N$) interaction symmetry and convenient methods for the optical\nmanipulation of their nuclear spin. Some research directions will be presented,\nwith focus on experiments performed in Florence with nuclear-spin mixtures of\n$^{173}$Yb atoms in optical lattices.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:07:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fallani","Leonardo",""]]}
{"id":"2308.06592","submitter":"Laurel Ohm","authors":"Laurel Ohm","title":"On an angle-averaged Neumann-to-Dirichlet map for thin filaments","comments":"56 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the Laplace equation in the exterior of a thin filament in\n$\\mathbb{R}^3$ and perform a detailed decomposition of a notion of slender body\nNeumann-to-Dirichlet (NtD) and Dirichlet-to-Neumann (DtN) maps along the\nfilament surface. The decomposition is motivated by a filament evolution\nequation in Stokes flow for which the Laplace setting serves as an important\ntoy problem. Given a general curved, closed filament with constant radius\n$\\epsilon>0$, we show that both the slender body DtN and NtD maps may be\ndecomposed into the corresponding operator about a straight, periodic filament\nplus lower order remainders. For the straight, periodic filament, both the\nslender body NtD and DtN maps are given by explicit Fourier multipliers and it\nis straightforward to compute their mapping properties. The remainder terms are\nlower order in the sense that they are small with respect to $\\epsilon$ or\nsmoother. While the strategy here is meant to serve as a blueprint for the\nStokes setting, the Laplace problem may be of independent interest.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:11:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ohm","Laurel",""]]}
{"id":"2308.06593","submitter":"Martin Bootsma","authors":"Martin Bootsma, Danny Chan, Odo Diekmann and Hisashi Inaba","title":"The effect of host population heterogeneity on epidemic outbreaks","comments":"36 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the first part of this paper, we review old and new results about the\ninfluence of host population heterogeneity on (various characteristics of)\nepidemic outbreaks. In the second part we highlight a modelling issue that so\nfar has received little attention: how do contact patterns, and hence\ntransmission opportunities, depend on the size and the composition of the host\npopulation? Without any claim on completeness, we offer a range of potential\n(quasi-mechanistic) submodels. The overall aim of the paper is to describe the\nstate-of-the-art and to catalyse new work.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:16:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bootsma","Martin",""],["Chan","Danny",""],["Diekmann","Odo",""],["Inaba","Hisashi",""]]}
{"id":"2308.06594","submitter":"Jumman Hossain","authors":"Jumman Hossain, Abu-Zaher Faridee, Nirmalya Roy, Anjan Basak, Derrik\n  E. Asher","title":"CoverNav: Cover Following Navigation Planning in Unstructured Outdoor\n  Environment with Deep Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous navigation in offroad environments has been extensively studied in\nthe robotics field. However, navigation in covert situations where an\nautonomous vehicle needs to remain hidden from outside observers remains an\nunderexplored area. In this paper, we propose a novel Deep Reinforcement\nLearning (DRL) based algorithm, called CoverNav, for identifying covert and\nnavigable trajectories with minimal cost in offroad terrains and jungle\nenvironments in the presence of observers. CoverNav focuses on unmanned ground\nvehicles seeking shelters and taking covers while safely navigating to a\npredefined destination. Our proposed DRL method computes a local cost map that\nhelps distinguish which path will grant the maximal covertness while\nmaintaining a low cost trajectory using an elevation map generated from 3D\npoint cloud data, the robot's pose, and directed goal information. CoverNav\nhelps robot agents to learn the low elevation terrain using a reward function\nwhile penalizing it proportionately when it experiences high elevation. If an\nobserver is spotted, CoverNav enables the robot to select natural obstacles\n(e.g., rocks, houses, disabled vehicles, trees, etc.) and use them as shelters\nto hide behind. We evaluate CoverNav using the Unity simulation environment and\nshow that it guarantees dynamically feasible velocities in the terrain when fed\nwith an elevation map generated by another DRL based navigation algorithm.\nAdditionally, we evaluate CoverNav's effectiveness in achieving a maximum goal\ndistance of 12 meters and its success rate in different elevation scenarios\nwith and without cover objects. We observe competitive performance comparable\nto state of the art (SOTA) methods without compromising accuracy.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:19:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hossain","Jumman",""],["Faridee","Abu-Zaher",""],["Roy","Nirmalya",""],["Basak","Anjan",""],["Asher","Derrik E.",""]]}
{"id":"2308.06595","submitter":"Yonatan Bitton","authors":"Yonatan Bitton, Hritik Bansal, Jack Hessel, Rulin Shao, Wanrong Zhu,\n  Anas Awadalla, Josh Gardner, Rohan Taori, Ludwig Schimdt","title":"VisIT-Bench: A Benchmark for Vision-Language Instruction Following\n  Inspired by Real-World Use","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce VisIT-Bench (Visual InsTruction Benchmark), a benchmark for\nevaluation of instruction-following vision-language models for real-world use.\nOur starting point is curating 70 'instruction families' that we envision\ninstruction tuned vision-language models should be able to address. Extending\nbeyond evaluations like VQAv2 and COCO, tasks range from basic recognition to\ngame playing and creative generation. Following curation, our dataset comprises\n592 test queries, each with a human-authored instruction-conditioned caption.\nThese descriptions surface instruction-specific factors, e.g., for an\ninstruction asking about the accessibility of a storefront for wheelchair\nusers, the instruction-conditioned caption describes ramps/potential obstacles.\nThese descriptions enable 1) collecting human-verified reference outputs for\neach instance; and 2) automatic evaluation of candidate multimodal generations\nusing a text-only LLM, aligning with human judgment. We quantify quality gaps\nbetween models and references using both human and automatic evaluations; e.g.,\nthe top-performing instruction-following model wins against the GPT-4 reference\nin just 27% of the comparison. VisIT-Bench is dynamic to participate,\npractitioners simply submit their model's response on the project website;\nData, code and leaderboard is available at visit-bench.github.io.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:27:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bitton","Yonatan",""],["Bansal","Hritik",""],["Hessel","Jack",""],["Shao","Rulin",""],["Zhu","Wanrong",""],["Awadalla","Anas",""],["Gardner","Josh",""],["Taori","Rohan",""],["Schimdt","Ludwig",""]]}
{"id":"2308.06596","submitter":"Xuran Li","authors":"Xuran Li, Shuaishuai Guo, Tuo Li, Xiaofeng Zou, Dengwang Li","title":"On the Performance Trade-off of Distributed Integrated Sensing and\n  Communication Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this letter, we analyze the performance trade-off in distributed\nintegrated sensing and communication (ISAC) networks. Specifically, with the\naid of stochastic geometry theory, we derive the probability of detection of\nthat of the coverage given user number. Based on the analytical derivations, we\nprovide a quantitative description of the performance limits and the\nperformance trade-off between sensing and communication in a distributed ISAC\nnetwork under the given transmit power and bandwidth budget. Extensive\nsimulations are conducted and the numerical results validate the accuracy of\nour derivations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:30:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Xuran",""],["Guo","Shuaishuai",""],["Li","Tuo",""],["Zou","Xiaofeng",""],["Li","Dengwang",""]]}
{"id":"2308.06597","submitter":"Alessandro Oneto","authors":"Alessandro Oneto and Nick Vannieuwenhoven","title":"Hadamard-Hitchcock decompositions: identifiability and computation","comments":"25 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"BCSim-2022-s04","categories":"math.AG cs.NA math.NA math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Hadamard-Hitchcock decomposition of a multidimensional array is a\ndecomposition that expresses the latter as a Hadamard product of several tensor\nrank decompositions. Such decompositions can encode probability distributions\nthat arise from statistical graphical models associated to complete bipartite\ngraphs with one layer of observed random variables and one layer of hidden\nones, usually called restricted Boltzmann machines. We establish generic\nidentifiability of Hadamard-Hitchcock decompositions by exploiting the reshaped\nKruskal criterion for tensor rank decompositions. A flexible algorithm\nleveraging existing decomposition algorithms for tensor rank decomposition is\nintroduced for computing a Hadamard-Hitchcock decomposition. Numerical\nexperiments illustrate its computational performance and numerical accuracy.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:33:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Oneto","Alessandro",""],["Vannieuwenhoven","Nick",""]]}
{"id":"2308.06598","submitter":"Yuri Obukhov","authors":"Yuri N. Obukhov, Friedrich W. Hehl","title":"Hyperfluid model revisited","comments":"Revtex, 15 paegs, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A new variational theory of a hyperfluid is constructed which is free of the\nsupplementary condition issue and provides a consistent model of the classical\nmatter source in the metric-affine gravity theory.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:45:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Obukhov","Yuri N.",""],["Hehl","Friedrich W.",""]]}
{"id":"2308.06599","submitter":"Yuan Zheng","authors":"Yuan Zheng, Fengyu Wang, Wenjun Xu, Miao Pan, and Ping Zhang","title":"Semantic Communications with Explicit Semantic Base for Image\n  Transmission","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semantic communications, aiming at ensuring the successful delivery of the\nmeaning of information, are expected to be one of the potential techniques for\nthe next generation communications. However, the knowledge forming and\nsynchronizing mechanism that enables semantic communication systems to extract\nand interpret the semantics of information according to the communication\nintents is still immature. In this paper, we propose a semantic image\ntransmission framework with explicit semantic base (Seb), where Sebs are\ngenerated and employed as the knowledge shared between the transmitter and the\nreceiver with flexible granularity. To represent images with Sebs, a novel\nSeb-based reference image generator is proposed to generate Sebs and then\ndecompose the transmitted images. To further encode/decode the residual\ninformation for precise image reconstruction, a Seb-based image encoder/decoder\nis proposed. The key components of the proposed framework are optimized jointly\nby end-to-end (E2E) training, where the loss function is dedicated designed to\ntackle the problem of nondifferentiable operation in Seb-based reference image\ngenerator by introducing a gradient approximation mechanism. Extensive\nexperiments show that the proposed framework outperforms state-of-art works by\n0.5 - 1.5 dB in peak signal-to-noise ratio (PSNR) w.r.t. different\nsignal-to-noise ratio (SNR).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:47:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Yuan",""],["Wang","Fengyu",""],["Xu","Wenjun",""],["Pan","Miao",""],["Zhang","Ping",""]]}
{"id":"2308.06600","submitter":"Dor Minzer","authors":"Amey Bhangale, Subhash Khot, Dor Minzer","title":"Effective Bounds for Restricted $3$-Arithmetic Progressions in\n  $\\mathbb{F}_p^n$","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":"  For a prime $p$, a restricted arithmetic progression in $\\mathbb{F}_p^n$ is a\ntriplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a\nnon-zero element from $\\{0,1,2\\}^n$. What is the size of the largest\n$A\\subseteq \\mathbb{F}_p^n$ that is free of restricted arithmetic progressions?\nWe show that the density of any such set is at most $\\frac{C}{(\\log\\log\\log\nn)^c}$, where $c,C>0$ depend only on $p$, giving the first reasonable bounds\nfor the density of such sets. Previously, the best known bound was\n$O(1/\\log^{*} n)$, which follows from the density Hales-Jewett theorem.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:55:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bhangale","Amey",""],["Khot","Subhash",""],["Minzer","Dor",""]]}
{"id":"2308.06601","submitter":"Rafael Izbicki","authors":"Victor Candido Reis and Rafael Izbicki","title":"Spectral smooth tests for goodness-of-fit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Goodness-of-fit tests are crucial tools for assessing the validity of\nstatistical models. In this paper, we introduce a novel approach, the Spectral\nSmooth Test (SST), that generalizes Neyman's smooth test to high-dimensional\ndata settings. While conventional goodness-of-fit tests for univariate data are\nwell-established, extending them to high dimensions, such as images,\ntrajectories, and SNPs, poses significant challenges. Our proposed SST\nleverages spectral bases, which adapt naturally to the geometry of feature\nspaces, to model multivariate distributions. Unlike traditional orthogonal\nbases, these spectral bases are tailored to the data distribution, enabling\nmore effective function modeling. The SST framework offers a principled way to\nestimate the underlying model, thereby providing actionable insights even when\nthe null hypothesis is rejected. We present experimental results demonstrating\nthe robustness of SST across various tuning parameter choices and compare its\nperformance against other goodness-of-fit tests. Furthermore, we apply SST to\nthe MNIST dataset as a real-world example, showcasing its effectiveness in\nhigh-dimensional scenarios.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 15:58:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Reis","Victor Candido",""],["Izbicki","Rafael",""]]}
{"id":"2308.06602","submitter":"Dave Dunbar","authors":"David C. Dunbar","title":"Identities amongst the Two Loop Partial Amplitudes of Yang-Mills theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterise possible identities among the two-loop partial amplitudes of\ngluon scattering in Yang-Mills theory. We use known amplitudes in an exhaustive\nsearch to identify potential new relations. We find two candidate relations\nwhich may extend to all-$n$ amplitudes.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:08:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dunbar","David C.",""]]}
{"id":"2308.06603","submitter":"Tonghui Zou","authors":"Tonghui Zou","title":"LadleNet: Translating Thermal Infrared Images to Visible Light Images\n  Using A Scalable Two-stage U-Net","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":"  The translation of thermal infrared (TIR) images to visible light (VI) images\npresents a challenging task with potential applications spanning various\ndomains such as TIR-VI image registration and fusion. Leveraging supplementary\ninformation derived from TIR image conversions can significantly enhance model\nperformance and generalization across these applications. However, prevailing\nissues within this field include suboptimal image fidelity and limited model\nscalability. In this paper, we introduce an algorithm, LadleNet, based on the\nU-Net architecture. LadleNet employs a two-stage U-Net concatenation structure,\naugmented with skip connections and refined feature aggregation techniques,\nresulting in a substantial enhancement in model performance. Comprising\n'Handle' and 'Bowl' modules, LadleNet's Handle module facilitates the\nconstruction of an abstract semantic space, while the Bowl module decodes this\nsemantic space to yield mapped VI images. The Handle module exhibits\nextensibility by allowing the substitution of its network architecture with\nsemantic segmentation networks, thereby establishing more abstract semantic\nspaces to bolster model performance. Consequently, we propose LadleNet+, which\nreplaces LadleNet's Handle module with the pre-trained DeepLabv3+ network,\nthereby endowing the model with enhanced semantic space construction\ncapabilities. The proposed method is evaluated and tested on the KAIST dataset,\naccompanied by quantitative and qualitative analyses. Compared to existing\nmethodologies, our approach achieves state-of-the-art performance in terms of\nimage clarity and perceptual quality. The source code will be made available at\nhttps://github.com/Ach-1914/LadleNet/tree/main/.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:14:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zou","Tonghui",""]]}
{"id":"2308.06604","submitter":"Jun Zhang","authors":"Julien Dardennes, Jean Gutt, Vinicius G. B. Ramos, Jun Zhang","title":"Coarse distance from dynamically convex to convex","comments":"minor changes; add Remarks 1.1, 1.4, and 1.5","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Chaidez and Edtmair have recently found the first example of dynamically\nconvex domains in $\\mathbb R^4$ that are not symplectomorphic to convex domains\n(called symplectically convex domains), answering a long-standing open\nquestion. In this paper, we discover new examples of such domains without\nreferring to Chaidez-Edtmair's criterion. We also show that these domains are\narbitrarily far from the set of symplectically convex domains in $\\mathbb R^4$\nwith respect to the coarse symplectic Banach-Mazur distance by using an\nexplicit numerical criterion for symplectic non-convexity.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:19:27 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 08:23:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dardennes","Julien",""],["Gutt","Jean",""],["Ramos","Vinicius G. B.",""],["Zhang","Jun",""]]}
{"id":"2308.06605","submitter":"Yuhang Fu","authors":"Yuhang Fu, Weiqi Shen, Jiahuan Cui, Yao Zheng, Guangwen Yang, Zhao\n  Liu, Jifa Zhang, Tingwei Ji, Fangfang Xie, Xiaojing Lv, Hanyue Liu, Xu Liu,\n  Xiyang Liu, Xiaoyu Song, Guocheng Tao, Yan Yan, Paul Tucker, Steven A.E.\n  Miller, Shirui Luo, Seid Koric and Weimin Zheng","title":"Towards Exascale Computation for Turbomachinery Flows","comments":"SC23, November, 2023, Denver, CO., USA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A state-of-the-art large eddy simulation code has been developed to solve\ncompressible flows in turbomachinery. The code has been engineered with a high\ndegree of scalability, enabling it to effectively leverage the many-core\narchitecture of the new Sunway system. A consistent performance of 115.8\nDP-PFLOPs has been achieved on a high-pressure turbine cascade consisting of\nover 1.69 billion mesh elements and 865 billion Degree of Freedoms (DOFs). By\nleveraging a high-order unstructured solver and its portability to large\nheterogeneous parallel systems, we have progressed towards solving the grand\nchallenge problem outlined by NASA, which involves a time-dependent simulation\nof a complete engine, incorporating all the aerodynamic and heat transfer\ncomponents.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:26:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fu","Yuhang",""],["Shen","Weiqi",""],["Cui","Jiahuan",""],["Zheng","Yao",""],["Yang","Guangwen",""],["Liu","Zhao",""],["Zhang","Jifa",""],["Ji","Tingwei",""],["Xie","Fangfang",""],["Lv","Xiaojing",""],["Liu","Hanyue",""],["Liu","Xu",""],["Liu","Xiyang",""],["Song","Xiaoyu",""],["Tao","Guocheng",""],["Yan","Yan",""],["Tucker","Paul",""],["Miller","Steven A. E.",""],["Luo","Shirui",""],["Koric","Seid",""],["Zheng","Weimin",""]]}
{"id":"2308.06606","submitter":"Justin Lyle","authors":"Ela Celikbas, Olgur Celikbas, Justin Lyle, Ryo Takahashi, Yongwei Yao","title":"On a generalization of Ulrich modules and its applications","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a modified version of the classical Ulrich modules, which we call\n$c$-Ulrich. Unlike the traditional setting, $c$-Ulrich modules always exist. We\nprove that these modules retain many of the essential properties and\napplications observed in the literature. Additionally, we reveal their\nsignificance as obstructions to Cohen-Macaulay properties of tensor products.\nLeveraging this insight, we show the utility of these modules in testing the\nfiniteness of homological dimensions across various scenarios.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:44:51 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:08:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Celikbas","Ela",""],["Celikbas","Olgur",""],["Lyle","Justin",""],["Takahashi","Ryo",""],["Yao","Yongwei",""]]}
{"id":"2308.06607","submitter":"Giampaolo Bonomi","authors":"Giampaolo Bonomi","title":"The Disagreement Dividend","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study how disagreement influences the productive performance of a group in\na simple repeated game with alternative production technologies and positive\nexternalities. Players can disagree, i.e. hold different views about the\ncharacteristics and quality of the technologies. This disagreement has two main\ncharacteristics. First, different views lead to different technology and effort\nchoices -- \"optimistic\" views justify higher effort than \"skeptical\" views.\nSecond, views are resilient -- changed only if falsified by surprising\nevidence. When only one production technology is available, disagreement over\nits productivity (i) incentivizes the optimistic agent to work harder than when\nmatched with a like-minded player; (ii) can reduce the effort of the skeptic\nagent. The first force lies at the core of what we call the \"disagreement\ndividend.\" We show that if externalities are sufficiently strong, a team of\nlike-minded optimists is outperformed -- in terms of expected output -- by a\ndisagreeing team. Next, we find that when different production technologies are\navailable, disagreement over which technology works best always drives up all\nplayers' efforts: each agent believes that their preferred approach is the most\nsuccessful and tries harder to obtain the early successes that would convince\nothers to adopt it. As a result, average group production always increases if\nthe technologies are similar according to the true production process. Our main\nresults are driven by players' incentives to persuade others to change their\nminds.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:44:58 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:06:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bonomi","Giampaolo",""]]}
{"id":"2308.06608","submitter":"Andre Luckow","authors":"Nishant Saurabh, Shantenu Jha and Andre Luckow","title":"A Conceptual Architecture for a Quantum-HPC Middleware","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computing promises potential for science and industry by solving\ncertain computationally complex problems faster than classical computers.\nQuantum computing systems evolved from monolithic systems towards modular\narchitectures comprising multiple quantum processing units (QPUs) coupled to\nclassical computing nodes (HPC). With the increasing scale, middleware systems\nthat facilitate the efficient coupling of quantum-classical computing are\nbecoming critical. Through an in-depth analysis of quantum applications,\nintegration patterns and systems, we identified a gap in understanding\nQuantum-HPC middleware systems. We present a conceptual middleware to\nfacilitate reasoning about quantum-classical integration and serve as the basis\nfor a future middleware system. An essential contribution of this paper lies in\nleveraging well-established high-performance computing abstractions for\nmanaging workloads, tasks, and resources to integrate quantum computing into\nHPC systems seamlessly.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:48:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Saurabh","Nishant",""],["Jha","Shantenu",""],["Luckow","Andre",""]]}
{"id":"2308.06609","submitter":"Giulio Del Zanna","authors":"G. Del Zanna, M. Weberg, H.P. Warren","title":"Hinode EIS: updated in-flight radiometric calibration","comments":"submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an update to the in-flight radiometric calibration of the Hinode\nEUV Imaging Spectrometer (EIS), revising and extending our previous studies. We\nanalyze full-spectral EIS observations of quiet Sun and active regions from\n2007 until 2022. Using CHIANTI version 10, we adjust the EIS relative effective\nareas for a selection of dates with emission measure analyses of off-limb quiet\nSun. We find generally good agreement (within typically $\\pm$ 15%) between\nmeasured and expected line intensities. We then consider selected intensity\nratios for all the dates and apply an automatic fitting method to adjust the\nrelative effective areas. To constrain the absolute values from 2010 we force\nagreement between EIS and Solar Dynamics Observatory (SDO) Atmospheric Imaging\nAssembly (AIA) 193 Angstroms observations. The resulting calibration, with an\nuncertainty of about $\\pm$ 20%, is then validated in various ways, including\nflare line ratios from Fe XXIV and Fe XVII, emission measure analyses of cool\nactive region loops, and several density-dependent line ratios.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:56:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Del Zanna","G.",""],["Weberg","M.",""],["Warren","H. P.",""]]}
{"id":"2308.06610","submitter":"Ambrose Robinson","authors":"Ambrose Robinson, William Thorne, Ben P. Wu, Abdullah Pandor, Munira\n  Essat, Mark Stevenson, Xingyi Song","title":"Bio-SIEVE: Exploring Instruction Tuning Large Language Models for\n  Systematic Review Automation","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":"  Medical systematic reviews can be very costly and resource intensive. We\nexplore how Large Language Models (LLMs) can support and be trained to perform\nliterature screening when provided with a detailed set of selection criteria.\nSpecifically, we instruction tune LLaMA and Guanaco models to perform abstract\nscreening for medical systematic reviews. Our best model, Bio-SIEVE,\noutperforms both ChatGPT and trained traditional approaches, and generalises\nbetter across medical domains. However, there remains the challenge of adapting\nthe model to safety-first scenarios. We also explore the impact of multi-task\ntraining with Bio-SIEVE-Multi, including tasks such as PICO extraction and\nexclusion reasoning, but find that it is unable to match single-task\nBio-SIEVE's performance. We see Bio-SIEVE as an important step towards\nspecialising LLMs for the biomedical systematic review process and explore its\nfuture developmental opportunities. We release our models, code and a list of\nDOIs to reconstruct our dataset for reproducibility.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:56:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Robinson","Ambrose",""],["Thorne","William",""],["Wu","Ben P.",""],["Pandor","Abdullah",""],["Essat","Munira",""],["Stevenson","Mark",""],["Song","Xingyi",""]]}
{"id":"2308.06611","submitter":"Xiao-Yu Ouyang","authors":"Xiao-Yu Ouyang and Jing Yang","title":"Switchable polarization manipulation, optical logical gates and conveyor\n  belt based on U-shaped $\\ce{VO2}$ nanoholes","comments":null,"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":"  Based on U-shaped plasmonic nanoholes in an $\\ce{Au-VO2-Au}$ film, we propose\nto achieve several switchable functions at the telecom wavelength by transition\nfrom the $\\ce{VO2}$ semiconductive state to the metallic state. The first is\nthe polarization manipulation of four different polarization states\n($x\\&y$-polarization, LCP, and RCP). An array of U-shaped holes constitutes of\nthe high efficiency SPP splitter, and thus the spin-encoded optical logical\ngates can be achieved. Furthurmore, we prove that a nano-optical conveyor belt\ncan be build up with such U-shaped holes, making the transport of nanoparticles\nover the film efficiency by transforming between two spin states periodically,\nand the transport direction switchably along with the $\\ce{VO2}$ phase.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:04:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ouyang","Xiao-Yu",""],["Yang","Jing",""]]}
{"id":"2308.06612","submitter":"Paul Gavrikov","authors":"Paul Gavrikov and Janis Keuper","title":"On the Interplay of Convolutional Padding and Adversarial Robustness","comments":"Accepted as full paper at ICCV-W 2023 BRAVO","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":"  It is common practice to apply padding prior to convolution operations to\npreserve the resolution of feature-maps in Convolutional Neural Networks (CNN).\nWhile many alternatives exist, this is often achieved by adding a border of\nzeros around the inputs. In this work, we show that adversarial attacks often\nresult in perturbation anomalies at the image boundaries, which are the areas\nwhere padding is used. Consequently, we aim to provide an analysis of the\ninterplay between padding and adversarial attacks and seek an answer to the\nquestion of how different padding modes (or their absence) affect adversarial\nrobustness in various scenarios.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:06:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gavrikov","Paul",""],["Keuper","Janis",""]]}
{"id":"2308.06613","submitter":"Ke Yang","authors":"Ke Yang, Yue-Zhe Chen, Zheng-Qiao Duan, Ju-Ying Zhao","title":"Static and spherically symmetric black holes in gravity with a\n  background Kalb-Ramond field","comments":"21 pages and 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The Lorentz symmetry of gravity is spontaneously broken when the\nnon-minimally coupled Kalb-Ramond field acquires a nonzero vacuum expectation\nvalue. In this work, we present exact solutions for static and spherically\nsymmetric black holes in the framework of this Lorentz-violating gravity\ntheory. In order to explore the physical implications of Lorentz violation, we\nanalyze the thermodynamic properties of the obtained solutions and evaluate its\nimpact on some classical gravitational experiments within the Solar System.\nFurthermore, the Lorentz-violating parameter is constrained by using the\nmeasured results of these experiments.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:08:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Ke",""],["Chen","Yue-Zhe",""],["Duan","Zheng-Qiao",""],["Zhao","Ju-Ying",""]]}
{"id":"2308.06614","submitter":"Jinpeng Miao","authors":"Jinpeng Miao, Dasari Rajasekhar, Shivakant Mishra, Sanjeet Kumar\n  Nayak, Ramanarayan Yadav","title":"A Fog-based Smart Agriculture System to Detect Animal Intrusion","comments":"9 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Smart agriculture is one of the most promising areas where IoT-enabled\ntechnologies have the potential to substantially improve the quality and\nquantity of the crops and reduce the associated operational cost. However,\nbuilding a smart agriculture system presents several challenges, including high\nlatency and bandwidth consumption associated with cloud computing, frequent\nInternet disconnections in rural areas, and the need to keep costs low for\nfarmers. This paper presents an end-to-end, fog-based smart agriculture\ninfrastructure that incorporates edge computing and LoRa-based communication to\naddress these challenges. Our system is deployed to transform traditional\nagriculture land of rural areas into smart agriculture. We address the top\nconcern of farmers - animals intruding - by proposing a solution that detects\nanimal intrusion using low-cost PIR sensors, cameras, and computer vision. In\nparticular, we propose three different sensor layouts and a novel algorithm for\npredicting animals' future locations. Our system can detect animals before they\nintrude into the field, identify them, predict their future locations, and\nalert farmers in a timely manner. Our experiments show that the system can\neffectively and quickly detect animal intrusions while maintaining a much lower\ncost than current state-of-the-art systems.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:10:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Miao","Jinpeng",""],["Rajasekhar","Dasari",""],["Mishra","Shivakant",""],["Nayak","Sanjeet Kumar",""],["Yadav","Ramanarayan",""]]}
{"id":"2308.06615","submitter":"Yu Liu","authors":"Yu Liu (Institute of High Energy Physics, Chinese Academy of Sciences)","title":"Software refactoring and rewriting: from the perspective of code\n  transformations","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  To refactor already working code while keeping reliability, compatibility and\nperhaps security, we can borrow ideas from micropass/nanopass compilers. By\ntreating the procedure of software refactoring as composing code\ntransformations, and compressing repetitive transformations with automation\ntools, we can often obtain representations of refactoring processes short\nenough that their correctness can be analysed manually. Unlike in compilers, in\nrefactoring we usually only need to consider the codebase in question, so\nregular text processing can be extensively used, fully exploiting patterns only\npresent in the codebase. Aside from the direct application of code\ntransformations from compilers, many other kinds of equivalence properties may\nalso be exploited. In this paper, two refactoring projects are given as the\nmain examples, where 10-100 times simplification has been achieved with the\napplication of a few kinds of useful transformations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:11:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yu","","Institute of High Energy Physics, Chinese Academy of Sciences"]]}
{"id":"2308.06616","submitter":"Jose Mar\\'ia Ezquiaga","authors":"Jose Mar\\'ia Ezquiaga, Wayne Hu, Rico K. L. Lo","title":"Identifying strongly lensed gravitational waves through their phase\n  consistency","comments":"14+7 pages, 12+7 figures, 2 tables, code at\n  https://github.com/ezquiaga/phazap","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Strongly lensed gravitational waves (GWs) from binary coalescence manifest as\nrepeated chirps from the original merger. At the detectors, the phase of the\nlensed GWs and its arrival time differences will be consistent modulo a fixed\nconstant phase shift. We develop a fast and reliable method to efficiently\nreject event pairs that are not-lensed copies and appropriately rank the most\ninteresting candidates. Our method exploits that detector phases are the best\nmeasured GW parameter, with errors only of a fraction of a radian and\ndifferences across the frequency band that are better measured than the chirp\nmass. The arrival time phase differences also avoid the shortcomings of looking\nfor overlaps in highly non-Gaussian sky maps. Our basic statistic determining\nthe consistency with lensing is the distance between the phase posteriors of\ntwo events and it directly provides information about the lens-source geometry\nwhich helps inform electromagnetic followups. We demonstrate that for simulated\nsignals of not-lensed binaries with many shared parameters none of the pairs\nhave phases closer than $3\\sigma$, and most cases reject the lensing hypothesis\nby $5\\sigma$. Looking at the latest catalog, GWTC3, we find that only $6\\%$ of\nthe pairs are consistent with lensing at $99\\%$ confidence level. Moreover, we\nreject about half of the pairs that would otherwise favor lensing by their\nparameter overlaps and demonstrate good correlation with detailed joint\nparameter estimation results. This reduction of the false alarm rate will be of\nparamount importance in the upcoming observing runs and the eventual discovery\nof lensed GWs. Our code is publicly available and could be applied beyond\nlensing to test possible deviations in the phase evolution from modified\ntheories of gravity and constrain GW birefringence.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:13:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ezquiaga","Jose Mar\u00eda",""],["Hu","Wayne",""],["Lo","Rico K. L.",""]]}
{"id":"2308.06617","submitter":"Christis Katsouris","authors":"Christis Katsouris","title":"Quantile Time Series Regression Models Revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article discusses recent developments in the literature of quantile time\nseries models in the cases of stationary and nonstationary underline stochastic\nprocesses.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:21:54 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:46:09 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 07:50:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Katsouris","Christis",""]]}
{"id":"2308.06618","submitter":"Maria Skopina","authors":"Yu. Farkov, M. Skopina","title":"Harmonic Analysis on the Space of M-positive Vectors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a dilation matrix M, a so-called space of M-positive vectors in the\nEuclidean space is introduced and studied. An algebraic structure of this space\nis similar to the positive half-line equipped with the termwise addition modulo\n2, which is used in the Walsh analysis. The role of harmonics is played by some\nanalogues of the classical Walsh functions. The concept of Fourier transform is\nintroduced, and the Poisson summation formula, Plancherel theorem,\nVilenkin-Chrestenson formulas and so on are proved. A kind of analogue of the\nSchwartz class is studied. This class consists of functions such that both the\nfunction itself and its Fourier transform have compact support.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:22:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Farkov","Yu.",""],["Skopina","M.",""]]}
{"id":"2308.06619","submitter":"Enzo Tartaglione","authors":"Zhu Liao, Victor Qu\\'etu, Van-Tam Nguyen, Enzo Tartaglione","title":"Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pruning is a widely used technique for reducing the size of deep neural\nnetworks while maintaining their performance. However, such a technique,\ndespite being able to massively compress deep models, is hardly able to remove\nentire layers from a model (even when structured): is this an addressable task?\nIn this study, we introduce EGP, an innovative Entropy Guided Pruning algorithm\naimed at reducing the size of deep neural networks while preserving their\nperformance. The key focus of EGP is to prioritize pruning connections in\nlayers with low entropy, ultimately leading to their complete removal. Through\nextensive experiments conducted on popular models like ResNet-18 and Swin-T,\nour findings demonstrate that EGP effectively compresses deep neural networks\nwhile maintaining competitive performance levels. Our results not only shed\nlight on the underlying mechanism behind the advantages of unstructured\npruning, but also pave the way for further investigations into the intricate\nrelationship between entropy, pruning techniques, and deep learning\nperformance. The EGP algorithm and its insights hold great promise for\nadvancing the field of network compression and optimization. The source code\nfor EGP is released open-source.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:27:49 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 13:00:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liao","Zhu",""],["Qu\u00e9tu","Victor",""],["Nguyen","Van-Tam",""],["Tartaglione","Enzo",""]]}
{"id":"2308.06620","submitter":"Veljko Zlati\\'c","authors":"V. Zlatic and I. Aviani","title":"The phase diagram of heavy fermions with Cerium and Europium ions","comments":"6 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":"  Doniach phase diagram of heavy fermions with Ce and Eu ions is explained by\nthe scaling solution of the Anderson model. At high temperatures, where the\nrear earth ions behave as nearly independent local moments (LM) the system has\na large paramagnetic entropy and its properties are defined by Kondo\ntemperature, $T_K(p)$, where $p$ is the external parameter, like pressure or\ndoping. For a given $T_K(p)$, the scaling law allows an estimate of the\npressure or doping dependence of the coupling constant which is then used to\nfind the dependence of the RKKY temperature $T_{RKKY}(p)$ and N\\'eel\ntemperature $T_N(p)$ on the control parameter. The competition between the\non-site Kondo coupling and the off-site RKKY coupling determines the mechanism\nby which the system removes the paramagnetic entropy at low temperatures. The\npressure-induced change of the ground state is explained by the differences in\nthe functional form of $T_K(p)$ and $T_{RKKY}(p)$. Our theoretical results\ncapture the main features shown by the Doniach diagram of CeRu$_2$Ge$_2$,\nCeCu$_2$(Ge$_{1-x}$Si$_{x})_2$ or EuCu$_2$(Ge$_{1-x}$Si$_{x})_2$.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:33:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zlatic","V.",""],["Aviani","I.",""]]}
{"id":"2308.06621","submitter":"Richard Sattel","authors":"Richard Sattel, Christoph Spang, Carsten Heinz and Andreas Koch","title":"PQC-HA: A Framework for Prototyping and In-Hardware Evaluation of\n  Post-Quantum Cryptography Hardware Accelerators","comments":"20 pages, 6 figures, Open Source Software available","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In the third round of the NIST Post-Quantum Cryptography standardization\nproject, the focus is on optimizing software and hardware implementations of\ncandidate schemes. The winning schemes are CRYSTALS Kyber and CRYSTALS\nDilithium, which serve as a Key Encapsulation Mechanism (KEM) and Digital\nSignature Algorithm (DSA), respectively. This study utilizes the TaPaSCo\nopen-source framework to create hardware building blocks for both schemes using\nHigh-level Synthesis (HLS) from minimally modified ANSI C software reference\nimplementations across all security levels. Additionally, a generic TaPaSCo\nhost runtime application is developed in Rust to verify their functionality\nthrough the standard NIST interface, utilizing the corresponding Known Answer\nTest mechanism on actual hardware. Building on this foundation, the\ncommunication overhead for TaPaSCo hardware accelerators on PCIe-connected FPGA\ndevices is evaluated and compared with previous work and optimized AVX2\nsoftware reference implementations. The results demonstrate the feasibility of\nverifying and evaluating the performance of Post-Quantum Cryptography\naccelerators on real hardware using TaPaSCo. Furthermore, the off-chip\naccelerator communication overhead of the NIST standard interface is measured,\nwhich, on its own, outweighs the execution wall clock time of the optimized\nsoftware reference implementation of Kyber at Security Level 1.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:35:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sattel","Richard",""],["Spang","Christoph",""],["Heinz","Carsten",""],["Koch","Andreas",""]]}
{"id":"2308.06622","submitter":"Shunxin Wang","authors":"Shunxin Wang, Christoph Brune, Raymond Veldhuis and Nicola\n  Strisciuglio","title":"DFM-X: Augmentation by Leveraging Prior Knowledge of Shortcut Learning","comments":"Accepted at ICCVW2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks are prone to learn easy solutions from superficial statistics\nin the data, namely shortcut learning, which impairs generalization and\nrobustness of models. We propose a data augmentation strategy, named DFM-X,\nthat leverages knowledge about frequency shortcuts, encoded in Dominant\nFrequencies Maps computed for image classification models. We randomly select\nX% training images of certain classes for augmentation, and process them by\nretaining the frequencies included in the DFMs of other classes. This strategy\ncompels the models to leverage a broader range of frequencies for\nclassification, rather than relying on specific frequency sets. Thus, the\nmodels learn more deep and task-related semantics compared to their counterpart\ntrained with standard setups. Unlike other commonly used augmentation\ntechniques which focus on increasing the visual variations of training data,\nour method targets exploiting the original data efficiently, by distilling\nprior knowledge about destructive learning behavior of models from data. Our\nexperimental results demonstrate that DFM-X improves robustness against common\ncorruptions and adversarial attacks. It can be seamlessly integrated with other\naugmentation techniques to further enhance the robustness of models.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:39:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Shunxin",""],["Brune","Christoph",""],["Veldhuis","Raymond",""],["Strisciuglio","Nicola",""]]}
{"id":"2308.06623","submitter":"Risab Biswas","authors":"Risab Biswas","title":"Polyp-SAM++: Can A Text Guided SAM Perform Better for Polyp\n  Segmentation?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Meta recently released SAM (Segment Anything Model) which is a\ngeneral-purpose segmentation model. SAM has shown promising results in a wide\nvariety of segmentation tasks including medical image segmentation. In the\nfield of medical image segmentation, polyp segmentation holds a position of\nhigh importance, thus creating a model which is robust and precise is quite\nchallenging. Polyp segmentation is a fundamental task to ensure better\ndiagnosis and cure of colorectal cancer. As such in this study, we will see how\nPolyp-SAM++, a text prompt-aided SAM, can better utilize a SAM using text\nprompting for robust and more precise polyp segmentation. We will evaluate the\nperformance of a text-guided SAM on the polyp segmentation task on benchmark\ndatasets. We will also compare the results of text-guided SAM vs unprompted\nSAM. With this study, we hope to advance the field of polyp segmentation and\ninspire more, intriguing research. The code and other details will be made\npublically available soon at https://github.com/RisabBiswas/Polyp-SAM++.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:45:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Biswas","Risab",""]]}
{"id":"2308.06624","submitter":"Berker Demirel","authors":"Berker Demirel, Erchan Aptoula and Huseyin Ozkan","title":"ADRMX: Additive Disentanglement of Domain Features with Remix Loss","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":"  The common assumption that train and test sets follow similar distributions\nis often violated in deployment settings. Given multiple source domains, domain\ngeneralization aims to create robust models capable of generalizing to new\nunseen domains. To this end, most of existing studies focus on extracting\ndomain invariant features across the available source domains in order to\nmitigate the effects of inter-domain distributional changes. However, this\napproach may limit the model's generalization capacity by relying solely on\nfinding common features among the source domains. It overlooks the potential\npresence of domain-specific characteristics that could be prevalent in a subset\nof domains, potentially containing valuable information. In this work, a novel\narchitecture named Additive Disentanglement of Domain Features with Remix Loss\n(ADRMX) is presented, which addresses this limitation by incorporating domain\nvariant features together with the domain invariant ones using an original\nadditive disentanglement strategy. Moreover, a new data augmentation technique\nis introduced to further support the generalization capacity of ADRMX, where\nsamples from different domains are mixed within the latent space. Through\nextensive experiments conducted on DomainBed under fair conditions, ADRMX is\nshown to achieve state-of-the-art performance. Code will be made available at\nGitHub after the revision process.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:52:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Demirel","Berker",""],["Aptoula","Erchan",""],["Ozkan","Huseyin",""]]}
{"id":"2308.06625","submitter":"Anestis Fotiadis","authors":"A. Fotiadis and C. Daskaloyannis","title":"Harmonic diffeomorphisms between pseudo-riemannian surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We study locally harmonic maps between a Riemann surface or Lorentz surface\n$M$ and a Riemann surface or Lorentz surface $N$. All four cases are studied in\na unified way.\n  Harmonic maps to a constant curvature Riemann surface or Lorentz surface $N$\nare classified by the classification of the solutions of a generalized\nsine-Gordon equation. We then study the one-soliton solutions of this equation\nand we find the corresponding harmonic maps in a unified way.\n  Next, we discuss a B\\\"acklund transformation that provides a connection\nbetween the solutions of two sine-Gordon type equations. Finally, we give an\nexample of a harmonic map that is constructed by the use of a B\\\"acklund\ntransformation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 17:58:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fotiadis","A.",""],["Daskaloyannis","C.",""]]}
{"id":"2308.06626","submitter":"Oleksiy Dovgoshey","authors":"Oleksiy Dovgoshey and Alexander Kostikov","title":"Locally finite ultrametric spaces and labeled trees","comments":"29 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that a locally finite ultrametric space $(X, d)$ is generated by\nlabeled tree if and only if, for every open ball $B \\subseteq X$, there is a\npoint $c \\in B$ such that $d(x, c) = \\operatorname{diam} B$ whenever $x \\in B$\nand $x \\neq c$. For every finite ultrametric space $Y$ we construct an\nultrametric space $Z$ having the smallest possible number of points such that\n$Z$ is generated by labeled tree and $Y$ is isometric to a subspace of $Z$. It\nis proved that for a given $Y$, such a space $Z$ is unique up to isometry.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dovgoshey","Oleksiy",""],["Kostikov","Alexander",""]]}
{"id":"2308.06627","submitter":"G\\\"okalp Alpan","authors":"G\\\"okalp Alpan, Rostyslav Kozhan","title":"Multiplicative non-Hermitian perturbations of classical\n  $\\beta$-ensembles","comments":null,"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 compute the joint eigenvalue distribution for a multiplicative\nnon-Hermitian perturbation $(I+i\\Gamma)H$, $\\operatorname{rank}\\,\\Gamma=1$ of a\nrandom matrix $H$ from the Gaussian, Laguerre, and chiral Gaussian\n$\\beta$-ensembles.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:02:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alpan","G\u00f6kalp",""],["Kozhan","Rostyslav",""]]}
{"id":"2308.06628","submitter":"Muhammad Monjurul Karim","authors":"Muhammad Monjurul Karim, Ruwen Qin, Yinhai Wang","title":"Fusion-GRU: A Deep Learning Model for Future Bounding Box Prediction of\n  Traffic Agents in Risky Driving Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To ensure the safe and efficient navigation of autonomous vehicles and\nadvanced driving assistance systems in complex traffic scenarios, predicting\nthe future bounding boxes of surrounding traffic agents is crucial. However,\nsimultaneously predicting the future location and scale of target traffic\nagents from the egocentric view poses challenges due to the vehicle's egomotion\ncausing considerable field-of-view changes. Moreover, in anomalous or risky\nsituations, tracking loss or abrupt motion changes limit the available\nobservation time, requiring learning of cues within a short time window.\nExisting methods typically use a simple concatenation operation to combine\ndifferent cues, overlooking their dynamics over time. To address this, this\npaper introduces the Fusion-Gated Recurrent Unit (Fusion-GRU) network, a novel\nencoder-decoder architecture for future bounding box localization. Unlike\ntraditional GRUs, Fusion-GRU accounts for mutual and complex interactions among\ninput features. Moreover, an intermediary estimator coupled with a\nself-attention aggregation layer is also introduced to learn sequential\ndependencies for long range prediction. Finally, a GRU decoder is employed to\npredict the future bounding boxes. The proposed method is evaluated on two\npublicly available datasets, ROL and HEV-I. The experimental results showcase\nthe promising performance of the Fusion-GRU, demonstrating its effectiveness in\npredicting future bounding boxes of traffic agents.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:35:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Karim","Muhammad Monjurul",""],["Qin","Ruwen",""],["Wang","Yinhai",""]]}
{"id":"2308.06629","submitter":"Patrick Steil","authors":"Patrick Steil","title":"Optimal FIFO grouping in public transit networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This technical report is about grouping vehicles (so-called trips) in public\ntransport into routes (or, as they are more commonly known: lines) so that two\nvehicles of a route do not overtake each other. We say that such a set of\nroutes satisfies the FIFO property. An interesting question is: Given a set of\ntrips, find a minimal FIFO grouping into routes. This question is especially\ninteresting for route planning algorithms since a better route grouping leads\nto a better runtime. This contribution is structured as follows: First, all\nnecessary details are formalised and defined, and then the algorithmic\ncomplexity of this problem is explained and proven.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:38:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Steil","Patrick",""]]}
{"id":"2308.06630","submitter":"Oliver Butterley","authors":"Oliver Butterley, Minsung Kim","title":"Anisotropic spaces and nilmanifold automorphisms","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce anisotropic Banach spaces on Heisenberg nilmanifolds and study\nthe resonance spectrum associated to partially hyperbolic automorphisms. In\nthis work we describe an alternative proof of the spectrum which takes\nadvantage of geometric-style anisotropic norms.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:48:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Butterley","Oliver",""],["Kim","Minsung",""]]}
{"id":"2308.06631","submitter":"Nicholas Bender Dr.","authors":"Nicholas Bender, Henry Haig, Demetrios N. Christodoulides, Frank Wise","title":"Spectral Speckle Customization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Speckle patterns are used in a broad range of applications including\nmicroscopy, imaging, and light-matter interactions. Tailoring speckles'\nstatistics can dramatically enhance their performance in applications. We\npresent an experimental technique for customizing the spatio-spectral speckled\nintensity statistics of optical pulses at the output of a complex medium (a\ndisordered multimode fiber) by controlling the spatial profile of the input\nlight. We demonstrate that it is possible to create ensembles of independent\nspeckle patterns with arbitrary statistics at a single wavelength,\nsimultaneously at decorrelated wavelengths, and even tailored statistics across\nan entire pulse spectrum.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:50:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bender","Nicholas",""],["Haig","Henry",""],["Christodoulides","Demetrios N.",""],["Wise","Frank",""]]}
{"id":"2308.06632","submitter":"Samuel Goldberg","authors":"A. Anas Chentouf, Catherine Cossaboom, Samuel Goldberg, Jack B. Miller","title":"Patterns of primes in joint Sato--Tate distributions","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For $j=1,2$, let $f_j(z) = \\sum_{n=1}^{\\infty} a_{j}(n) e^{2\\pi i nz}$ be a\nholomorphic, non-CM cuspidal newform of even weight $k_j \\ge 2$ with trivial\nnebentypus. For each prime $p$, let $\\theta_{j}(p)\\in[0,\\pi]$ be the angle such\nthat $a_j(p) = 2p^{(k-1)/2} \\cos \\theta_{j}(p)$. The now-proven Sato--Tate\nconjecture states that the angles $(\\theta_j(p))$ equidistribute with respect\nto the measure $d\\mu_{\\mathrm ST} = \\frac{2}{\\pi}\\sin^2\\theta\\,d\\theta$. We\nshow that, if $f_1$ is not a character twist of $f_2$, then for subintervals\n$I_1,I_2 \\subset [0,\\pi]$, there exist infinitely many bounded gaps between the\nprimes $p$ such that $\\theta_1(p) \\in I_1$ and $\\theta_2(p) \\in I_2$. We also\nprove a common generalization of the bounded gaps with the Green--Tao theorem.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:55:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chentouf","A. Anas",""],["Cossaboom","Catherine",""],["Goldberg","Samuel",""],["Miller","Jack B.",""]]}
{"id":"2308.06633","submitter":"Paul E. Gunnells","authors":"Herbert Gangl, Paul E. Gunnells, Jonathan Hanke, Dan Yasaki","title":"On the cohomology of GL_2 and SL_2 over imaginary quadratic fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on computations of the cohomology of GL_2(O_D) and SL_2(O_D), where\nD<0 is a fundamental discriminant. These computations go well beyond earlier\nresults of Vogtmann and Scheutzow. We use the technique of homology of Voronoi\ncomplexes, and our computations recover the integral cohomology away from the\nprimes 2, 3. We observed exponential growth in the torsion subgroup of H^2 as\n$D$ increases, and compared our data to bounds of Rohlfs.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 18:57:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gangl","Herbert",""],["Gunnells","Paul E.",""],["Hanke","Jonathan",""],["Yasaki","Dan",""]]}
{"id":"2308.06634","submitter":"Junyao Zhang","authors":"Junyao Zhang, Hanrui Wang, Gokul Subramanian Ravi, Frederic T. Chong,\n  Song Han, Frank Mueller, Yiran Chen","title":"DISQ: Dynamic Iteration Skipping for Variational Quantum Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes DISQ to craft a stable landscape for VQA training and\ntackle the noise drift challenge. DISQ adopts a \"drift detector\" with a\nreference circuit to identify and skip iterations that are severely affected by\nnoise drift errors. Specifically, the circuits from the previous training\niteration are re-executed as a reference circuit in the current iteration to\nestimate noise drift impacts. The iteration is deemed compromised by noise\ndrift errors and thus skipped if noise drift flips the direction of the ideal\noptimization gradient. To enhance noise drift detection reliability, we further\npropose to leverage multiple reference circuits from previous iterations to\nprovide a well founded judge of current noise drift. Nevertheless, multiple\nreference circuits also introduce considerable execution overhead. To mitigate\nextra overhead, we propose Pauli-term subsetting (prime and minor subsets) to\nexecute only observable circuits with large coefficient magnitudes (prime\nsubset) during drift detection. Only this minor subset is executed when the\ncurrent iteration is drift-free. Evaluations across various applications and\nQPUs demonstrate that DISQ can mitigate a significant portion of the noise\ndrift impact on VQAs and achieve 1.51-2.24x fidelity improvement over the\ntraditional baseline. DISQ's benefit is 1.1-1.9x over the best alternative\napproach while boosting average noise detection speed by 2.07x\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 19:08:19 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 20:16:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Junyao",""],["Wang","Hanrui",""],["Ravi","Gokul Subramanian",""],["Chong","Frederic T.",""],["Han","Song",""],["Mueller","Frank",""],["Chen","Yiran",""]]}
{"id":"2308.06635","submitter":"Shuxiao Ding","authors":"Shuxiao Ding, Eike Rehder, Lukas Schneider, Marius Cordts and Juergen\n  Gall","title":"3DMOTFormer: Graph Transformer for Online 3D Multi-Object Tracking","comments":"17 pages, 8 figures, 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":"  Tracking 3D objects accurately and consistently is crucial for autonomous\nvehicles, enabling more reliable downstream tasks such as trajectory prediction\nand motion planning. Based on the substantial progress in object detection in\nrecent years, the tracking-by-detection paradigm has become a popular choice\ndue to its simplicity and efficiency. State-of-the-art 3D multi-object tracking\n(MOT) approaches typically rely on non-learned model-based algorithms such as\nKalman Filter but require many manually tuned parameters. On the other hand,\nlearning-based approaches face the problem of adapting the training to the\nonline setting, leading to inevitable distribution mismatch between training\nand inference as well as suboptimal performance. In this work, we propose\n3DMOTFormer, a learned geometry-based 3D MOT framework building upon the\ntransformer architecture. We use an Edge-Augmented Graph Transformer to reason\non the track-detection bipartite graph frame-by-frame and conduct data\nassociation via edge classification. To reduce the distribution mismatch\nbetween training and inference, we propose a novel online training strategy\nwith an autoregressive and recurrent forward pass as well as sequential batch\noptimization. Using CenterPoint detections, our approach achieves 71.2% and\n68.2% AMOTA on the nuScenes validation and test split, respectively. In\naddition, a trained 3DMOTFormer model generalizes well across different object\ndetectors. Code is available at: https://github.com/dsx0511/3DMOTFormer.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 19:19:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ding","Shuxiao",""],["Rehder","Eike",""],["Schneider","Lukas",""],["Cordts","Marius",""],["Gall","Juergen",""]]}
{"id":"2308.06636","submitter":"Kilian Keller","authors":"Kilian Richard Keller, Ricardo Rojas-Aedo, Aline Vanderhaegen, Markus\n  Ludwig, and Daniele Brida","title":"High stability white light generation in water at multi-kilohertz\n  repetition rate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficient supercontinuum (SC) generation featuring high spectral intensity\nacross a large bandwidth requires high peak powers of several megawatt from\npulsed lasers. Under these conditions and at multi-kilohertz (kHz) repetition\nrates, the SC generated in most materials is unstable due to thermal effects.\nIn this work, we leverage the superior dispersion properties of water to\nmaximize the spectral width of the SC, while avoiding stability issues due to\nthermal loading by means of a constant laminar flow of the liquid. This flow is\ncontrolled by a differential pressure scheme that allows to precisely adjust\nthe fluid velocity to an optimum value for maximum stability of the SC. This\napproach is successfully implemented for repetition rates of 50 kHz and 100 kHz\nand two different pump wavelengths in the visible (VIS) and near infrared (NIR)\nspectral region with stability of the SC signal only limited by the driving\npulses. The resulting water SC spans more than one octave covering the VIS to\nNIR range. Compared to established materials, such as yttrium aluminum garnet\n(YAG) and sapphire, the spectral bandwidth is increased by 60 % and 40 %\nrespectively. Our scheme has the potential to be implemented with other liquids\nsuch as bromine or carbon disulfide (CS2), which promise even wider broadening\nand operation up to the mid-infrared.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 19:28:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Keller","Kilian Richard",""],["Rojas-Aedo","Ricardo",""],["Vanderhaegen","Aline",""],["Ludwig","Markus",""],["Brida","Daniele",""]]}
{"id":"2308.06637","submitter":"Zanyar Ameen","authors":"Zanyar A. Ameen, Ramadhan A. Mohammed, Tareq M. Al-shami, and Baravan\n  A. Asaad","title":"Novel fuzzy topologies from old through fuzzy primals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce a novel fuzzy structure named \"fuzzy primal\". We\nstudy the essential properties and discuss basic operations on it. A fuzzy\noperator (.)$^\\diamond$ on the family of all fuzzy sets is introduced here by\napplying the q-neighborhood structure to a primal fuzzy topological space along\nwith the Lukasiewicz disjunction. We explore the main characterizations of\n(.)$^\\diamond$. Then, we define another fuzzy operator, symbolized by\nCl$^\\diamond$, with the utilization of (.)$^\\diamond$. These fuzzy operators\nare studied in order to deduce a new fuzzy topology from the original one. Such\na new fuzzy topology is called primal fuzzy topology. The fundamental\nstructure, particularly a fuzzy base that generates primal fuzzy topologies, as\nwell as many relationships between different fuzzy primals and fuzzy\ntopologies, are also analyzed. Lastly, the concept of compatibility between\nfuzzy primals and fuzzy topologies is introduced, and some equivalent\nconditions related to this are examined. It is shown that if a fuzzy primal is\ncompatible with a fuzzy topology, then the fuzzy base that generates the primal\nfuzzy topology is itself a fuzzy topology.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 19:53:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ameen","Zanyar A.",""],["Mohammed","Ramadhan A.",""],["Al-shami","Tareq M.",""],["Asaad","Baravan A.",""]]}
{"id":"2308.06638","submitter":"Thomas Devereaux","authors":"Thomas P. Devereaux, Martin Claassen, Xu-Xin Huang, Michael Zaletel,\n  Joel E. Moore, Dirk Morr, Fahad Mahmood, Peter Abbamonte, and Zhi-Xun Shen","title":"Angle-Resolved Pair Photoemission Theory for Correlated Electrons","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider the possibility and conditions for pair\nphotoemission whereby two incident photons emit pairs of electrons from a\ncandidate material as a novel method to measure and visualize electronic\ncorrelations. As opposed to double photoemission - where a single photon\nprecipitates the ejection of a pair electrons via a subsequent electron energy\nloss scattering process - we show that pair photoemission need not be limited\nto interference between initial photoelectrons and valence electrons, and\nmoreover, can occur without the energy penalty of two work functions. This\nenables detection of pairs of electrons at high energy resolution that may be\ncorrelated in the same quantum many-body states.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 19:59:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Devereaux","Thomas P.",""],["Claassen","Martin",""],["Huang","Xu-Xin",""],["Zaletel","Michael",""],["Moore","Joel E.",""],["Morr","Dirk",""],["Mahmood","Fahad",""],["Abbamonte","Peter",""],["Shen","Zhi-Xun",""]]}
{"id":"2308.06639","submitter":"Huaishu Peng","authors":"Zeyu Yan, Hsuanling Lee, Liang He, Huaishu Peng","title":"3D Printing Magnetophoretic Displays","comments":null,"journal-ref":"UIST 2023","doi":"10.1145/3586183.3606804","report-no":null,"categories":"cs.HC cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a pipeline for printing interactive and always-on magnetophoretic\ndisplays using affordable Fused Deposition Modeling (FDM) 3D printers. Using\nour pipeline, an end-user can convert the surface of a 3D shape into a matrix\nof voxels. The generated model can be sent to an FDM 3D printer equipped with\nan additional syringe-based injector. During the printing process, an oil and\niron powder-based liquid mixture is injected into each voxel cell, allowing the\nappearance of the once-printed object to be editable with external magnetic\nsources. To achieve this, we made modifications to the 3D printer hardware and\nthe firmware. We also developed a 3D editor to prepare printable models. We\ndemonstrate our pipeline with a variety of examples, including a printed\nStanford bunny with customizable appearances, a small espresso mug that can be\nused as a post-it note surface, a board game figurine with a computationally\nupdated display, and a collection of flexible wearable accessories with\neditable visuals.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 20:07:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yan","Zeyu",""],["Lee","Hsuanling",""],["He","Liang",""],["Peng","Huaishu",""]]}
{"id":"2308.06640","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan and T. A. Avakyan","title":"Strong Movable Categories and Strong Movability of Topological Spaces","comments":"9 pages","journal-ref":"Journal of Contemporary Mathematical Analysis, 2010, Vol. 45, No.\n  1, pp. 52--59","doi":"10.3103/S1068362310010061","report-no":null,"categories":"math.AT math.CT math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper is devoted to one of the important notions of the shape theory:\nthat of strong movability, which was primarily introduced by K. Borsuk for\nmetrizable compacts. A strong movability criterion is proved for topological\nspaces, which in particular reveals a new, categorical approach to the strong\nmovability.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 20:15:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gevorgyan","Pavel S.",""],["Avakyan","T. A.",""]]}
{"id":"2308.06641","submitter":"Duo Xu","authors":"Duo Xu, Shuo Kong, Avichal Kaul, Hector G. Arce, Volker\n  Ossenkopf-Okada","title":"CMR exploration II -- filament identification with machine learning","comments":"ApJ accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We adopt magnetohydrodynamics (MHD) simulations that model the formation of\nfilamentary molecular clouds via the collision-induced magnetic reconnection\n(CMR) mechanism under varying physical conditions. We conduct radiative\ntransfer using RADMC-3D to generate synthetic dust emission of CMR filaments.\nWe use the previously developed machine learning technique CASI-2D along with\nthe diffusion model to identify the location of CMR filaments in dust emission.\nBoth models showed a high level of accuracy in identifying CMR filaments in the\ntest dataset, with detection rates of over 80% and 70%, respectively, at a\nfalse detection rate of 5%. We then apply the models to real Herschel dust\nobservations of different molecular clouds, successfully identifying several\nhigh-confidence CMR filament candidates. Notably, the models are able to detect\nhigh-confidence CMR filament candidates in Orion A from dust emission, which\nhave previously been identified using molecular line emission.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 20:36:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Duo",""],["Kong","Shuo",""],["Kaul","Avichal",""],["Arce","Hector G.",""],["Ossenkopf-Okada","Volker",""]]}
{"id":"2308.06642","submitter":"Paul Goldsmith-Pinkham","authors":"Dong Beom Choi, Paul Goldsmith-Pinkham and Tanju Yorulmazer","title":"Contagion Effects of the Silicon Valley Bank Run","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC q-fin.GN","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper analyzes the contagion effects associated with the failure of\nSilicon Valley Bank (SVB) and identifies bank-specific vulnerabilities\ncontributing to the subsequent declines in banks' stock returns. We find that\nuninsured deposits, unrealized losses in held-to-maturity securities, bank\nsize, and cash holdings had a significant impact, while better-quality assets\nor holdings of liquid securities did not help mitigate the negative spillovers.\nInterestingly, banks whose stocks performed worse post SVB also had lower\nreturns in the previous year following Federal Reserve interest rate hikes. The\nstock market partially anticipated risks associated with uninsured deposit\nreliance, but did not price in unrealized losses due to interest rate hikes nor\nrisks linked to bank size. While mid-sized banks experienced particular stress\nimmediately after the SVB failure, over time negative spillovers became\nwidespread except for the largest banks.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 20:45:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Choi","Dong Beom",""],["Goldsmith-Pinkham","Paul",""],["Yorulmazer","Tanju",""]]}
{"id":"2308.06643","submitter":"Ka Ho Wong","authors":"Tushar Pandey, Ka Ho Wong","title":"Geometry of fundamental shadow link complements and applications to the\n  1-loop conjecture","comments":"52 pages, 22 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 construct a geometric ideal triangulation for every fundamental shadow\nlink complement and solve the gluing equation explicitly in terms of the\nholonomies of the meridians of the link for any generic character in the\ndistinguished component of the $\\mathrm{PSL}(2;\\mathbb{C})$-character variety\nof the link complement. As an application, we obtain a new formula for the\nvolume of a hyperideal tetrahedron in terms of its dihedral angles. Moreover,\nby using the ideal triangulation, we verify the 1-loop conjecture proposed by\nDimofte and Garoufalidis for every fundamental shadow link complement. We also\nprove a surgery formula for the 1-loop invariant with respect to certain nice\nideal triangulations of 3-manifolds with toroidal boundary.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 21:08:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pandey","Tushar",""],["Wong","Ka Ho",""]]}
{"id":"2308.06644","submitter":"Junwei Huang","authors":"Junwei Huang, Zhiqing Sun, Yiming Yang","title":"Accelerating Diffusion-based Combinatorial Optimization Solvers by\n  Progressive Distillation","comments":"Published at ICML 2023, Sampling and Optimization in Discrete Space\n  Workshop. The implementation is at\n  https://github.com/jwrh/Accelerating-Diffusion-based-Combinatorial-Optimization-Solvers-by-Progressive-Distillation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph-based diffusion models have shown promising results in terms of\ngenerating high-quality solutions to NP-complete (NPC) combinatorial\noptimization (CO) problems. However, those models are often inefficient in\ninference, due to the iterative evaluation nature of the denoising diffusion\nprocess. This paper proposes to use progressive distillation to speed up the\ninference by taking fewer steps (e.g., forecasting two steps ahead within a\nsingle step) during the denoising process. Our experimental results show that\nthe progressively distilled model can perform inference 16 times faster with\nonly 0.019% degradation in performance on the TSP-50 dataset.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 21:25:24 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 22:25:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Junwei",""],["Sun","Zhiqing",""],["Yang","Yiming",""]]}
{"id":"2308.06645","submitter":"Jinyu Wang","authors":"Jinyu Wang, Kun Meng, Fenghai Duan","title":"Hypothesis testing for medical imaging analysis via the smooth Euler\n  characteristic transform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shape-valued data are of interest in applied sciences, particularly in\nmedical imaging. In this paper, inspired by a specific medical imaging example,\nwe introduce a hypothesis testing method via the smooth Euler characteristic\ntransform to detect significant differences among collections of shapes. Our\nproposed method has a solid mathematical foundation and is computationally\nefficient. Through simulation studies, we illustrate the performance of our\nproposed method. We apply our method to images of lung cancer tumors from the\nNational Lung Screening Trial database, comparing its performance to a\nstate-of-the-art machine learning model.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 21:33:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jinyu",""],["Meng","Kun",""],["Duan","Fenghai",""]]}
{"id":"2308.06646","submitter":"Ilya Pavlyukevich","authors":"Ilya Pavlyukevich and Georgiy Shevchenko","title":"Stochastic selection problem for a Stratonovich SDE with power\n  non-linearity","comments":"15 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our paper [Bernoulli 26(2), 2020, 1381--1409], we found all strong Markov\nsolutions that spend zero time at $0$ of the Stratonovich stochastic\ndifferential equation $d X=|X|^{\\alpha}\\circ dB$, $\\alpha\\in (0,1)$. These\nsolutions have the form $X_t^\\theta=F(B^\\theta_t)$, where\n$F(x)=\\frac{1}{1-\\alpha}|x|^{1/(1-\\alpha)}\\text{sign}\\, x$ and $B^\\theta$ is\nthe skew Brownian motion with skewness parameter $\\theta\\in [-1,1]$ starting at\n$F^{-1}(X_0)$. In this paper we show how an addition of small external additive\nnoise $\\varepsilon W$ restores uniqueness. In the limit as $\\varepsilon\\to 0$,\nwe recover heterogeneous diffusion corresponding to the physically symmetric\ncase $\\theta=0$.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 21:37:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pavlyukevich","Ilya",""],["Shevchenko","Georgiy",""]]}
{"id":"2308.06647","submitter":"Babak Badnava","authors":"Babak Badnava, Keenan Roach, Kenny Cheung, Morteza Hashemi, Ness B\n  Shroff","title":"Energy-Efficient Deadline-Aware Edge Computing: Bandit Learning with\n  Partial Observations in Multi-Channel Systems","comments":"2023 IEEE Global Communications Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.DC cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider a task offloading problem in a multi-access edge\ncomputing (MEC) network, in which edge users can either use their local\nprocessing unit to compute their tasks or offload their tasks to a nearby edge\nserver through multiple communication channels each with different\ncharacteristics. The main objective is to maximize the energy efficiency of the\nedge users while meeting computing tasks deadlines. In the multi-user\nmulti-channel offloading scenario, users are distributed with partial\nobservations of the system states. We formulate this problem as a stochastic\noptimization problem and leverage \\emph{contextual neural multi-armed bandit}\nmodels to develop an energy-efficient deadline-aware solution, dubbed E2DA. The\nproposed E2DA framework only relies on partial state information (i.e.,\ncomputation task features) to make offloading decisions. Through extensive\nnumerical analysis, we demonstrate that the E2DA algorithm can efficiently\nlearn an offloading policy and achieve close-to-optimal performance in\ncomparison with several baseline policies that optimize energy consumption\nand/or response time. Furthermore, we provide a comprehensive set of results on\nthe MEC system performance for various applications such as augmented reality\n(AR) and virtual reality (VR).\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 21:48:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Badnava","Babak",""],["Roach","Keenan",""],["Cheung","Kenny",""],["Hashemi","Morteza",""],["Shroff","Ness B",""]]}
{"id":"2308.06648","submitter":"Andrew Snowden","authors":"Andrew Snowden","title":"On the representation theory of the symmetry group of the Cantor set","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In previous work with Harman, we introduced a new class of representations\nfor an oligomorphic group $G$, depending on an auxiliary piece of data called a\nmeasure. In this paper, we look at this theory when $G$ is the symmetry group\nof the Cantor set. We show that $G$ admits exactly two measures $\\mu$ and\n$\\nu$. The representation theory of $(G, \\mu)$ is the linearization of the\ncategory of $\\mathbf{F}_2$-vector spaces, studied in recent work of the author\nand closely connected to work of Kuhn and Kov\\'acs. The representation theory\nof $(G, \\nu)$ is the linearization of the category of vector spaces over the\nBoolean semi-ring (or, equivalently, the correspondence category), studied by\nBouc--Th\\'evenaz. The latter case yields an important counterexample in the\ngeneral theory.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 22:02:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Snowden","Andrew",""]]}
{"id":"2308.06649","submitter":"Evgeny Sevost'yanov","authors":"Victoria Desyatka and Evgeny Sevost'yanov","title":"On isolated singularities of mappings with inverse moduli inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider open discrete mappings that satisfy the modulus condition of the\ninverse Poletsky inequality type. We study the case when the majorant in it is\nintegrable, or more generally, has finite averages over infinitesimal spheres.\nWe proved that such mappings have a continuous extension to an isolated point\nof the boundary of some domain without any a priori requirements on the\ncorresponding mapped domain for integrable majorants. In the case of majorants,\nintegrable on spheres, we require only the boundedness of the mapped domain. We\ndo not require any other topological conditions on the mappings.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 22:30:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Desyatka","Victoria",""],["Sevost'yanov","Evgeny",""]]}
{"id":"2308.06650","submitter":"Marco Fatuzzo","authors":"Marco Fatuzzo, Fred C. Adams, Adina D. Feinstein and Darryl Z.\n  Seligman","title":"Avalanches and the Distribution of Reconnection Events in Magnetized\n  Circumstellar Disks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cosmic rays produced by young stellar objects can potentially alter the\nionization structure, heating budget, chemical composition, and accretion\nactivity in circumstellar disks. The inner edges of these disks are truncated\nby strong magnetic fields, which can reconnect and produce flaring activity\nthat accelerates cosmic radiation. The resulting cosmic rays can provide a\nsource of ionization and produce spallation reactions that alter the\ncomposition of planetesimals. This reconnection and particle acceleration are\nanalogous to the physical processes that produce flaring in and heating of\nstellar coronae. Flaring events on the surface of the Sun exhibit a power-law\ndistribution of energy, reminiscent of those measured for Earthquakes and\navalanches. Numerical lattice-reconnection models are capable of reproducing\nthe observed power-law behavior of solar flares under the paradigm of\nself-organized criticality. One interpretation of these experiments is that the\nsolar corona maintains a nonlinear attractor -- or ``critical'' -- state by\nbalancing energy input via braided magnetic fields and output via reconnection\nevents. Motivated by these results, we generalize the lattice-reconnection\nformalism for applications in the truncation region of magnetized disks. Our\nnumerical experiments demonstrate that these nonlinear dynamical systems are\ncapable of both attaining and maintaining criticality in the presence of\nKeplerian shear and other complications. The resulting power-law spectrum of\nflare energies in the equilibrium attractor state is found to be nearly\nuniversal in magnetized disks. This finding indicates that magnetic\nreconnection and flaring in the inner regions of circumstellar disks occur in a\nmanner similar to activity on stellar surfaces.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 22:50:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fatuzzo","Marco",""],["Adams","Fred C.",""],["Feinstein","Adina D.",""],["Seligman","Darryl Z.",""]]}
{"id":"2308.06651","submitter":"Yongwei Cui","authors":"Yongwei Cui, Zhaoqing Li, Haoran Chen, Yue Chen, Yunzhuo Wu, Ke Pei,\n  Tong Wu, Nian Xie, Renchao Che, Xuepeng Qiu, Yi Liu, Zhe Yuan, and Yizheng Wu","title":"In-plane Hall effect in rutile oxide films induced by the Lorentz force","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The conventional Hall effect is linearly proportional to the field component\nor magnetization component perpendicular to a film. Despite the increasing\ntheoretical proposals on the Hall effect to the in-plane field or magnetization\nin various special systems induced by the Berry curvature, such an\nunconventional Hall effect has only been experimentally reported in Weyl\nsemimetals and in a heterodimensional superlattice. Here, we report an\nunambiguous experimental observation of the in-plane Hall effect (IPHE) in\ncentrosymmetric rutile RuO2 and IrO2 single-crystal films under an in-plane\nmagnetic field. The measured Hall resistivity is found to be proportional to\nthe component of the applied in-plane magnetic field along a particular crystal\naxis and to be independent of the current direction or temperature. Both the\nexperimental observations and theoretical calculations confirm that the IPHE in\nrutile oxide films is induced by the Lorentz force. Our findings can be\ngeneralized to ferromagnetic materials for the discovery of in-plane anomalous\nHall effects and quantum anomalous Hall effects. In addition to significantly\nexpanding knowledge of the Hall effect, this work opens the door to explore new\nmembers in the Hall effect family.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 23:05:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cui","Yongwei",""],["Li","Zhaoqing",""],["Chen","Haoran",""],["Chen","Yue",""],["Wu","Yunzhuo",""],["Pei","Ke",""],["Wu","Tong",""],["Xie","Nian",""],["Che","Renchao",""],["Qiu","Xuepeng",""],["Liu","Yi",""],["Yuan","Zhe",""],["Wu","Yizheng",""]]}
{"id":"2308.06652","submitter":"David Anthony Clarke","authors":"Luis Altenkort, David Anthony Clarke, Jishnu Goswami, Hauke Sandmeyer","title":"Streamlined data analysis in Python","comments":"9 pages, 1 figure, presented at the 40th International Symposium on\n  Lattice Field Theory","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Python is a particularly appealing language to carry out data analysis, owing\nin part to its user-friendly character as well as its access to well maintained\nand powerful libraries like NumPy and SciPy. Still, for the purpose of\nanalyzing data in a lattice QCD context, some desirable functionality is\nmissing from these libraries. Moreover, scripting languages tend to be slower\nthan compiled ones. To help address these points we present the LatticeToolbox,\na collection of Python modules to facilitate lattice QCD data analysis. Some\nhighlighted features include general-purpose jackknife and bootstrap routines;\nmodules for reading in and storing gauge configurations; a module to carry out\nhadron resonance gas model calculations; and convenience wrappers for SciPy\nintegration, curve fitting, and splines. These features are sped up behind the\nscenes using parallelization and just-in-time compilation.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 23:07:43 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 16:34:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Altenkort","Luis",""],["Clarke","David Anthony",""],["Goswami","Jishnu",""],["Sandmeyer","Hauke",""]]}
{"id":"2308.06653","submitter":"Srijoni Majumdar Dr","authors":"Srijoni Majumdar and Partha Pratim Das","title":"Smart Knowledge Transfer using Google-like Search","comments":"3 pages, 2 figures, accepted in the NDLI-UNESCO International\n  Symposium on Knowledge Engineering for Digital Library Design 2019 (KEDL) as\n  an extended abstract and poster","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To address the issue of rising software maintenance cost due to program\ncomprehension challenges, we propose SMARTKT (Smart Knowledge Transfer), a\nsearch framework, which extracts and integrates knowledge related to various\naspects of an application in form of a semantic graph. This graph supports\nsyntax and semantic queries and converts the process of program comprehension\ninto a {\\em google-like} search problem.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 23:38:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Majumdar","Srijoni",""],["Das","Partha Pratim",""]]}
{"id":"2308.06654","submitter":"Mahsa Golchoubian","authors":"Mahsa Golchoubian, Moojan Ghafurian, Kerstin Dautenhahn, Nasser\n  Lashgarian Azad","title":"Polar Collision Grids: Effective Interaction Modelling for Pedestrian\n  Trajectory Prediction in Shared Space Using Collision Checks","comments":"Accepted for publication as a conference paper in IEEE Intelligent\n  Transportation Systems Conference (ITSC), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.HC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting pedestrians' trajectories is a crucial capability for autonomous\nvehicles' safe navigation, especially in spaces shared with pedestrians.\nPedestrian motion in shared spaces is influenced by both the presence of\nvehicles and other pedestrians. Therefore, effectively modelling both\npedestrian-pedestrian and pedestrian-vehicle interactions can increase the\naccuracy of the pedestrian trajectory prediction models. Despite the huge\nliterature on ways to encode the effect of interacting agents on a pedestrian's\npredicted trajectory using deep-learning models, limited effort has been put\ninto the effective selection of interacting agents. In the majority of cases,\nthe interaction features used are mainly based on relative distances while\npaying less attention to the effect of the velocity and approaching direction\nin the interaction formulation. In this paper, we propose a heuristic-based\nprocess of selecting the interacting agents based on collision risk\ncalculation. Focusing on interactions of potentially colliding agents with a\ntarget pedestrian, we propose the use of time-to-collision and the approach\ndirection angle of two agents for encoding the interaction effect. This is done\nby introducing a novel polar collision grid map. Our results have shown\npredicted trajectories closer to the ground truth compared to existing methods\n(used as a baseline) on the HBS dataset.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 00:20:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Golchoubian","Mahsa",""],["Ghafurian","Moojan",""],["Dautenhahn","Kerstin",""],["Azad","Nasser Lashgarian",""]]}
{"id":"2308.06655","submitter":"Stephane Lafortune","authors":"St\\'ephane Lafortune","title":"Spectral and linear stability of peakons in the Novikov equation","comments":"19 pages, no figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Novikov equation is a peakon equation with cubic nonlinearity which, like\nthe Camassa-Holm and the Degasperis-Procesi, is completely integrable. In this\narticle, we study the spectral and linear stability of peakon solutions of the\nNovikov equation. We prove spectral instability of the peakons in\n$L^2(\\mathbb{R})$. To do so, we start with a linearized operator defined on\n$H^1(\\mathbb{R})$ and extend it to a linearized operator defined on weaker\nfunctions in $L^2(\\mathbb{R})$. The spectrum of the linearized operator in\n$L^2(\\mathbb{R})$ is proven to cover a closed vertical strip of the complex\nplane. Furthermore, we prove that the peakons are spectrally unstable on\n$W^{1,\\infty}(\\mathbb{R})$ and linearly and spectrally stable on\n$H^1(\\mathbb{R})$. The result on $W^{1,\\infty}(\\mathbb{R})$ are in agreement\nwith previous work about linear stability, while our results on\n$H^1(\\mathbb{R})$ are in agreement with the orbital stability obtained\npreviously.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 00:21:04 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 20:14:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lafortune","St\u00e9phane",""]]}
{"id":"2308.06656","submitter":"Priyan Vaithilingam","authors":"Priyan Vaithilingam, Yewen Pu, Elena L. Glassman","title":"The Usability of Pragmatic Communication in Regular Expression Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Programming-by-example (PBE) systems aim to alleviate the burden of\nprogramming. However, user-specified examples are often ambiguous, leaving\nmultiple programs to satisfy the specification. Consequently, in most prior\nwork, users have had to provide additional examples, particularly negative\nones, to further constrain the search over compatible programs. Recent work\nresolves additional ambiguity by modeling program synthesis tasks as pragmatic\ncommunication, showing promising results on a graphics domain using a\nrudimentary user-study. We adapt pragmatic reasoning to a sub-domain of regular\nexpressions and rigorously study its usability as a means of communication both\nwith and without the ability to provide negative examples. Our user study\n(N=30) demonstrates that, with a pragmatic synthesizer, end-users can more\nsuccessfully communicate a target regex using positive examples alone (95%)\ncompared to using a non-pragmatic synthesizer (51%). Further, users can\ncommunicate more efficiently (57% fewer examples) with a pragmatic synthesizer\ncompared to a non-pragmatic one.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 00:31:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vaithilingam","Priyan",""],["Pu","Yewen",""],["Glassman","Elena L.",""]]}
{"id":"2308.06657","submitter":"Sidong Feng","authors":"Sidong Feng, Haochuan Lu, Ting Xiong, Yuetang Deng, Chunyang Chen","title":"Towards Efficient Record and Replay: A Case Study in WeChat","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  WeChat, a widely-used messenger app boasting over 1 billion monthly active\nusers, requires effective app quality assurance for its complex features.\nRecord-and-replay tools are crucial in achieving this goal. Despite the\nextensive development of these tools, the impact of waiting time between replay\nevents has been largely overlooked. On one hand, a long waiting time for\nexecuting replay events on fully-rendered GUIs slows down the process. On the\nother hand, a short waiting time can lead to events executing on\npartially-rendered GUIs, negatively affecting replay effectiveness. An optimal\nwaiting time should strike a balance between effectiveness and efficiency. We\nintroduce WeReplay, a lightweight image-based approach that dynamically adjusts\ninter-event time based on the GUI rendering state. Given the real-time\nstreaming on the GUI, WeReplay employs a deep learning model to infer the\nrendering state and synchronize with the replaying tool, scheduling the next\nevent when the GUI is fully rendered. Our evaluation shows that our model\nachieves 92.1% precision and 93.3% recall in discerning GUI rendering states in\nthe WeChat app. Through assessing the performance in replaying 23 common WeChat\nusage scenarios, WeReplay successfully replays all scenarios on the same and\ndifferent devices more efficiently than the state-of-the-practice baselines.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:02:00 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 09:14:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Feng","Sidong",""],["Lu","Haochuan",""],["Xiong","Ting",""],["Deng","Yuetang",""],["Chen","Chunyang",""]]}
{"id":"2308.06658","submitter":"Igor Spasojevic","authors":"Igor Spasojevic, Xu Liu, Ankit Prabhu, Alejandro Ribeiro, George J.\n  Pappas, Vijay Kumar","title":"Robust Localization of Aerial Vehicles via Active Control of Identical\n  Ground Vehicles","comments":"To appear in IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses the problem of active collaborative localization in\nheterogeneous robot teams with unknown data association. It involves\npositioning a small number of identical unmanned ground vehicles (UGVs) at\ndesired positions so that an unmanned aerial vehicle (UAV) can, through\nunlabelled measurements of UGVs, uniquely determine its global pose. We model\nthe problem as a sequential two player game, in which the first player\npositions the UGVs and the second identifies the two distinct hypothetical\nposes of the UAV at which the sets of measurements to the UGVs differ by as\nlittle as possible. We solve the underlying problem from the vantage point of\nthe first player for a subclass of measurement models using a mixture of local\noptimization and exhaustive search procedures. Real-world experiments with a\nteam of UAV and UGVs show that our method can achieve centimeter-level global\nlocalization accuracy. We also show that our method consistently outperforms\nrandom positioning of UGVs by a large margin, with as much as a 90% reduction\nin position and angular estimation error. Our method can tolerate a significant\namount of random as well as non-stochastic measurement noise. This indicates\nits potential for reliable state estimation on board size, weight, and power\n(SWaP) constrained UAVs. This work enables robust localization in\nperceptually-challenged GPS-denied environments, thus paving the road for\nlarge-scale multi-robot navigation and mapping.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:06:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Spasojevic","Igor",""],["Liu","Xu",""],["Prabhu","Ankit",""],["Ribeiro","Alejandro",""],["Pappas","George J.",""],["Kumar","Vijay",""]]}
{"id":"2308.06659","submitter":"Brendan Mulkerin Dr","authors":"Brendan C. Mulkerin, Jesper Levinsen, and Meera M. Parish","title":"Rabi oscillations and magnetization of a mobile spin-1/2 impurity in a\n  Fermi sea","comments":"18 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the behavior of a mobile spin-1/2 impurity atom immersed in a\nFermi gas, where the interacting spin-$\\uparrow$ and non-interacting\nspin-$\\downarrow$ states of the impurity are Rabi coupled via an external\nfield. This scenario resembles the classic problem of a two-state system\ninteracting with a dissipative environment, but with an added dimension\nprovided by the impurity momentum degree of freedom. In this case, the impurity\ncan become \"dressed\" by excitations of the Fermi sea to form a Fermi polaron\nquasiparticle. For the steady-state system, where the impurity has thermalized\nwith the medium, we derive exact thermodynamic relations that connect the\nimpurity magnetization with quasiparticle properties such as the number of\nfermions in the dressing cloud. We show how the thermodynamic properties evolve\nwith increasing Rabi coupling and we present exact analytical results in the\nlimits of weak and strong Rabi coupling. For the dynamics of the Rabi-driven\nFermi polaron, we formulate a theoretical approach based on correlation\nfunctions that respects conservation laws and allows the efficient calculation\nof Rabi oscillations for a range of time scales and impurity momenta beyond\nwhat has been achieved previously. Our results are in good agreement with\nrecent experiments on the Rabi oscillations of the attractive polaron, and they\nreveal how the Rabi oscillations are influenced by the interplay between the\npolaron and its dressing cloud.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:37:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mulkerin","Brendan C.",""],["Levinsen","Jesper",""],["Parish","Meera M.",""]]}
{"id":"2308.06660","submitter":"Andrew Snowden","authors":"Nate Harman, Ilia Nekrasov, Andrew Snowden","title":"Arboreal tensor categories","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce some new tensor categories based on the combinatorics of trees:\nwe define categories $\\mathcal{D}(n)$, for $n \\ge 3$ an integer, and categories\n$\\mathcal{C}(t)$, for $t \\ne 1$ a complex number. The category $\\mathcal{D}(n)$\nis semi-simple and pre-Tannakian, and is the semi-simplification of\n$\\mathcal{C}(n)$. If $t$ is not a natural number then $\\mathcal{C}(t)$ is\nsemi-simple and pre-Tannakian. The categories $\\mathcal{C}(t)$ interpolate the\ncategories $\\mathcal{D}(n)$, and the entire situation is closely analogous to\nDeligne's interpolation of the symmetric groups.\n  The category $\\mathcal{C}(t)$ is the first example of a 1-parameter family of\npre-Tannakian categories of superexponential growth that cannot be obtained by\ninterpolating categories of moderate growth.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:42:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Harman","Nate",""],["Nekrasov","Ilia",""],["Snowden","Andrew",""]]}
{"id":"2308.06661","submitter":"Fuming Xu","authors":"Xueying Zuo, Jingjing Cheng, Yulin Liang, Fuming Xu, and Yanxia Xing","title":"High-efficiency photoelectric detector based on a p-n homojunction of\n  monolayer black phosphorus","comments":null,"journal-ref":"Phys. Rev. Applied 20, 024027 (2023)","doi":"10.1103/PhysRevApplied.20.024027","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We numerically investigate the high-efficiency photovoltaic effect in lateral\np-n homojunction based on monolayer black phosphorus (MBP) by using the\nnon-equilibrium Green's function combined with the density functional theory.\nDue to the built-in electric field of the p-n junction and the wrinkle\nstructure of MBP, the photocurrent excited by either linearly or elliptically\npolarized light is significantly enhanced in a wide photon energy range.\nMoreover, because of the electron-photon interaction, the photocurrent is\nrelated to atomic orbitals through the polarizing angle of polarized light.\nTherefore, we can read the orbital information of the band structure from the\npolarizing angular distribution of photocurrent. These findings suggest the\npromising application of MBP-based p-n homojunction in high-efficiency\nphotoelectric devices and orbital-resolved photovoltaic detection.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:49:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zuo","Xueying",""],["Cheng","Jingjing",""],["Liang","Yulin",""],["Xu","Fuming",""],["Xing","Yanxia",""]]}
{"id":"2308.06662","submitter":"Sukanta Das","authors":"Sukanta Das, Suvasis Swain, and Vaibhav S. Prabhudesai","title":"Dynamics of the dissociative electron attachment to Ethanol","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the detailed dynamics of the site selectivity observed in the\ndissociative electron attachment (DEA) process in ethanol based on the momentum\nimages obtained using the velocity slice imaging technique. The H- dissociation\nchannel shows the site selectivity where the anion signal from the O-H site\npeaks at 6.5 eV and 8 eV, and that from the C-H site peaks at 9.5 eV. The\nmomentum images also show the two-body dissociation dynamics for the O-H site\nbreak-up. This dissociation channel shows a substantial effect of the torsion\nmode of vibrations on the electron attachment process. In contrast, the C-H\nsite dissociation results from the many-body break-up consistent with the\nearlier reports of DEA dynamics from organic molecules. We have also found that\nthe OH- channel has a resonance at 9.3eV and is produced with very little\nkinetic energy. Using the isotope substitution, we show the role of H atom\nscrambling in the C-O bond dissociation leading to the OH- channel. This\nchannel shows a substantial deviation from the corresponding photodissociation\ndynamics.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 01:59:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Das","Sukanta",""],["Swain","Suvasis",""],["Prabhudesai","Vaibhav S.",""]]}
{"id":"2308.06663","submitter":"Md Abul Bashar","authors":"Md Abul Bashar, Richi Nayak","title":"ALGAN: Time Series Anomaly Detection with Adjusted-LSTM GAN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly detection in time series data, to identify points that deviate from\nnormal behaviour, is a common problem in various domains such as manufacturing,\nmedical imaging, and cybersecurity. Recently, Generative Adversarial Networks\n(GANs) are shown to be effective in detecting anomalies in time series data.\nThe neural network architecture of GANs (i.e. Generator and Discriminator) can\nsignificantly improve anomaly detection accuracy. In this paper, we propose a\nnew GAN model, named Adjusted-LSTM GAN (ALGAN), which adjusts the output of an\nLSTM network for improved anomaly detection in both univariate and multivariate\ntime series data in an unsupervised setting. We evaluate the performance of\nALGAN on 46 real-world univariate time series datasets and a large multivariate\ndataset that spans multiple domains. Our experiments demonstrate that ALGAN\noutperforms traditional, neural network-based, and other GAN-based methods for\nanomaly detection in time series data.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:17:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bashar","Md Abul",""],["Nayak","Richi",""]]}
{"id":"2308.06664","submitter":"Gentil Dias de Moraes Neto","authors":"He-Guang Xu, Jiasen Jin, G.D.M. Neto and Norton G. de Almeida","title":"Universal quantum Otto heat machine based on the Dicke model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study a quantum Otto thermal machine where the working\nsubstance is composed of N identical qubits coupled to a single mode of a\nbosonic field, where the atoms and the field interact with a reservoir, as\ndescribed by the so-called open Dicke model. By controlling the relevant and\nexperimentally accessible parameters of the model we show that it is possible\nto build a universal quantum heat machine (UQHM) that can function as an\nengine, refrigerator, heater or accelerator. The heat and work exchanges are\ncomputed taking into account the growth of the number N of atoms as well as the\ncoupling regimes characteristic of the Dicke model for several ratios of\ntemperatures of the two thermal reservoirs. The analysis of quantum features\nsuch as entanglement and second-order correlation shows that these quantum\nresources do not affect either the efficiency or the performance of the UQHM\nbased on the open Dicke Model. In addition, we show that the improvement in\nboth efficiency and coefficient of performance of our UQHM occurs for regions\naround the critical value of the phase transition parameter of the model.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:27:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","He-Guang",""],["Jin","Jiasen",""],["Neto","G. D. M.",""],["de Almeida","Norton G.",""]]}
{"id":"2308.06665","submitter":"Jiexiang Wang","authors":"Jiexiang Wang, Chaoqi Chen","title":"Unsupervised Adaptation of Polyp Segmentation Models via Coarse-to-Fine\n  Self-Supervision","comments":"Accepted by IPMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised Domain Adaptation~(UDA) has attracted a surge of interest over\nthe past decade but is difficult to be used in real-world applications.\nConsidering the privacy-preservation issues and security concerns, in this\nwork, we study a practical problem of Source-Free Domain Adaptation (SFDA),\nwhich eliminates the reliance on annotated source data. Current SFDA methods\nfocus on extracting domain knowledge from the source-trained model but neglects\nthe intrinsic structure of the target domain. Moreover, they typically utilize\npseudo labels for self-training in the target domain, but suffer from the\nnotorious error accumulation problem. To address these issues, we propose a new\nSFDA framework, called Region-to-Pixel Adaptation Network~(RPANet), which\nlearns the region-level and pixel-level discriminative representations through\ncoarse-to-fine self-supervision. The proposed RPANet consists of two modules,\nForeground-aware Contrastive Learning (FCL) and Confidence-Calibrated\nPseudo-Labeling (CCPL), which explicitly address the key challenges of ``how to\ndistinguish'' and ``how to refine''. To be specific, FCL introduces a\nsupervised contrastive learning paradigm in the region level to contrast\ndifferent region centroids across different target images, which efficiently\ninvolves all pseudo labels while robust to noisy samples. CCPL designs a novel\nfusion strategy to reduce the overconfidence problem of pseudo labels by fusing\ntwo different target predictions without introducing any additional network\nmodules. Extensive experiments on three cross-domain polyp segmentation tasks\nreveal that RPANet significantly outperforms state-of-the-art SFDA and UDA\nmethods without access to source data, revealing the potential of SFDA in\nmedical applications.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:37:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jiexiang",""],["Chen","Chaoqi",""]]}
{"id":"2308.06666","submitter":"Reinhold Willcox","authors":"Reinhold Willcox, Morgan MacLeod, Ilya Mandel, Ryosuke Hirai","title":"The Impact of Angular Momentum Loss on the Outcomes of Binary Mass\n  Transfer","comments":"16 pages, 7 figures","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":"  We use the rapid binary population synthesis code COMPAS to investigate\ncommonly used prescriptions for the determination of mass transfer stability in\nclose binaries and the orbital separations after stable mass transfer. The\ndegree of orbital tightening during non-conservative mass transfer episodes is\ngoverned by the poorly-constrained angular momentum carried away by the ejected\nmaterial. Increased orbital tightening drives systems towards unstable mass\ntransfer leading to a common envelope. We find that the fraction of interacting\nbinaries that will undergo only stable mass transfer throughout their lives\nfluctuates between a few and $\\sim 20\\%$ due to uncertainty in the angular\nmomentum loss alone. If mass transfer is significantly non-conservative,\nstability prescriptions that rely on the assumption of conservative mass\ntransfer under-predict the number of systems which experience unstable mass\ntransfer and stellar mergers. This may substantially impact predictions about\nthe rates of various transients, including luminous red novae,\nstripped-envelope supernovae, X-ray binaries, and the progenitors of coalescing\ncompact binaries.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:41:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Willcox","Reinhold",""],["MacLeod","Morgan",""],["Mandel","Ilya",""],["Hirai","Ryosuke",""]]}
{"id":"2308.06667","submitter":"Rodney Anderson","authors":"Rodney L. Anderson, Robert W. Easton, Martin W. Lo","title":"Isolating Neighborhood Trajectory Computations in Non-Autonomous Systems\n  Including the Elliptic Restricted Three-Body Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Isolating block and isolating neighborhood methods have previously been\nimplemented to find transit trajectories and orbits around libration points in\nthe autonomous circular restricted three-body problem. For some applications,\nthe direct computation of these types of trajectories in non-autonomous models\nmore closely approximating real-world ephemerides is beneficial. Here, we apply\nisolating neighborhood methods to non-autonomous systems, including the\nelliptic restricted three-body problem (ERTBP). Specifically, simplified\nisolating neighborhood boundaries are computed around libration points in the\nERTBP. These boundaries are used in combination with a bisection method to\ncompute the forward asymptotic trajectories of the isolated invariant set and\ntrack orbits around a libration point.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:48:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Anderson","Rodney L.",""],["Easton","Robert W.",""],["Lo","Martin W.",""]]}
{"id":"2308.06668","submitter":"Jiajia Li","authors":"Jiajia Li, Mingle Xu, Lirong Xiang, Dong Chen, Weichao Zhuang, Xunyuan\n  Yin and Zhaojian Li","title":"Foundation Models in Smart Agriculture: Basics, Opportunities, and\n  Challenges","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The past decade has witnessed the rapid development of ML and DL\nmethodologies in agricultural systems, showcased by great successes in variety\nof agricultural applications. However, these conventional ML/DL models have\ncertain limitations: They heavily rely on large, costly-to-acquire labeled\ndatasets for training, require specialized expertise for development and\nmaintenance, and are mostly tailored for specific tasks, thus lacking\ngeneralizability. Recently, foundation models have demonstrated remarkable\nsuccesses in language and vision tasks across various domains. These models are\ntrained on a vast amount of data from multiple domains and modalities. Once\ntrained, they can accomplish versatile tasks with just minor fine-tuning and\nminimal task-specific labeled data. Despite their proven effectiveness and huge\npotential, there has been little exploration of applying FMs to agriculture\nfields. Therefore, this study aims to explore the potential of FMs in the field\nof smart agriculture. In particular, we present conceptual tools and technical\nbackground to facilitate the understanding of the problem space and uncover new\nresearch directions in this field. To this end, we first review recent FMs in\nthe general computer science domain and categorize them into four categories:\nlanguage FMs, vision FMs, multimodal FMs, and reinforcement learning FMs.\nSubsequently, we outline the process of developing agriculture FMs and discuss\ntheir potential applications in smart agriculture. We also discuss the unique\nchallenges associated with developing AFMs, including model training,\nvalidation, and deployment. Through this study, we contribute to the\nadvancement of AI in agriculture by introducing AFMs as a promising paradigm\nthat can significantly mitigate the reliance on extensive labeled datasets and\nenhance the efficiency, effectiveness, and generalization of agricultural AI\nsystems.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 02:59:36 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 14:16:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Jiajia",""],["Xu","Mingle",""],["Xiang","Lirong",""],["Chen","Dong",""],["Zhuang","Weichao",""],["Yin","Xunyuan",""],["Li","Zhaojian",""]]}
{"id":"2308.06669","submitter":"Christine Aidala","authors":"Gabriele Carcassi, Francisco Calderon, Christine A. Aidala","title":"The unphysicality of Hilbert spaces","comments":"5 pages plus mathematical appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that Hilbert spaces should not be considered the ``correct'' spaces\nto represent quantum states mathematically. We first prove that the\nrequirements posited by complex inner product spaces are physically justified.\nWe then show that completeness in the infinite-dimensional case requires the\ninclusion of states with infinite expectations, coordinate transformations that\ntake finite expectations to infinite ones and vice-versa, and time evolutions\nthat transform finite expectations to infinite ones in finite time. This makes\nHilbert spaces physically unsound as they model a potential infinity as an\nactual infinity. We suspect that at least some problems in quantum theory\nrelated to infinities may be ultimately caused by the wrong space being used.\nWe strongly believe a better solution can be found, and we look at Schwartz\nspaces for inspiration, as, among other things, they guarantee that the\nexpectation of all polynomials of position and momentum are finite, guarantee\nsolution to the moment problem and are the only space closed under Fourier\ntransform.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:03:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carcassi","Gabriele",""],["Calderon","Francisco",""],["Aidala","Christine A.",""]]}
{"id":"2308.06670","submitter":"Boris Brimkov","authors":"Boris Brimkov, Valentin Brimkov","title":"Graphs with degree sequence $\\{m^{m-1},n^{n-1}\\}$ and $\\{m^n,n^m\\}$","comments":"Feedback is welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study the class of graphs $G_{m,n}$ that have the same\ndegree sequence as two disjoint cliques $K_m$ and $K_n$, as well as the class\n$\\overline G_{m,n}$ of the complements of such graphs. We establish various\nproperties of $G_{m,n}$ and $\\overline G_{m,n}$ related to recognition,\nconnectivity, diameter, bipartiteness, Hamiltonicity, and pancyclicity. We also\nshow that several classical optimization problems on these graphs are NP-hard.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:06:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Brimkov","Boris",""],["Brimkov","Valentin",""]]}
{"id":"2308.06671","submitter":"Liu Ziyin","authors":"Liu Ziyin, Hongchao Li, Masahito Ueda","title":"Law of Balance and Stationary Distribution of Stochastic Gradient\n  Descent","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The stochastic gradient descent (SGD) algorithm is the algorithm we use to\ntrain neural networks. However, it remains poorly understood how the SGD\nnavigates the highly nonlinear and degenerate loss landscape of a neural\nnetwork. In this work, we prove that the minibatch noise of SGD regularizes the\nsolution towards a balanced solution whenever the loss function contains a\nrescaling symmetry. Because the difference between a simple diffusion process\nand SGD dynamics is the most significant when symmetries are present, our\ntheory implies that the loss function symmetries constitute an essential probe\nof how SGD works. We then apply this result to derive the stationary\ndistribution of stochastic gradient flow for a diagonal linear network with\narbitrary depth and width. The stationary distribution exhibits complicated\nnonlinear phenomena such as phase transitions, broken ergodicity, and\nfluctuation inversion. These phenomena are shown to exist uniquely in deep\nnetworks, implying a fundamental difference between deep and shallow models.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:13:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ziyin","Liu",""],["Li","Hongchao",""],["Ueda","Masahito",""]]}
{"id":"2308.06672","submitter":"Yong Wang","authors":"Yong Wang and Yanzhong Yao and Jiawei Guo and Zhiming Gao","title":"A deep learning framework for multi-scale models based on\n  physics-informed neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physics-informed neural networks (PINN) combine deep neural networks with the\nsolution of partial differential equations (PDEs), creating a new and promising\nresearch area for numerically solving PDEs. Faced with a class of multi-scale\nproblems that include loss terms of different orders of magnitude in the loss\nfunction, it is challenging for standard PINN methods to obtain an available\nprediction. In this paper, we propose a new framework for solving multi-scale\nproblems by reconstructing the loss function. The framework is based on the\nstandard PINN method, and it modifies the loss function of the standard PINN\nmethod by applying different numbers of power operations to the loss terms of\ndifferent magnitudes, so that the individual loss terms composing the loss\nfunction have approximately the same order of magnitude among themselves. In\naddition, we give a grouping regularization strategy, and this strategy can\ndeal well with the problem which varies significantly in different subdomains.\nThe proposed method enables loss terms with different magnitudes to be\noptimized simultaneously, and it advances the application of PINN for\nmulti-scale problems.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:26:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Yong",""],["Yao","Yanzhong",""],["Guo","Jiawei",""],["Gao","Zhiming",""]]}
{"id":"2308.06673","submitter":"Anwesh Ray","authors":"Anwesh Ray","title":"Remarks on Greenberg's conjecture for Galois representations associated\n  to elliptic curves","comments":"23 pages, initial date of submission 28 May 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $E_{/\\mathbb{Q}}$ be an elliptic curve and $p$ be an odd prime number at\nwhich $E$ has good ordinary reduction. Let $Sel_{p^\\infty}(\\mathbb{Q}_\\infty,\nE)$ denote the $p$-primary Selmer group of $E$ considered over the cyclotomic\n$\\mathbb{Z}_p$-extension of $\\mathbb{Q}$. The (algebraic)\n\\emph{$\\mu$-invariant} of $Sel_{p^\\infty}(\\mathbb{Q}_\\infty, E)$ is denoted\n$\\mu_p(E)$. Denote by $\\bar{\\rho}_{E,\np}:Gal(\\bar{\\mathbb{Q}}/\\mathbb{Q})\\rightarrow GL_2(\\mathbb{Z}/p\\mathbb{Z})$\nthe Galois representation on the $p$-torsion subgroup of $E(\\bar{\\mathbb{Q}})$.\nGreenberg conjectured that if $\\bar{\\rho}_{E, p}$ is reducible, then there is a\nrational isogeny $E\\rightarrow E'$ whose degree is a power of $p$, and such\nthat $\\mu_p(E')=0$. In this article, we study this conjecture by showing that\nit is satisfied provided some purely Galois theoretic conditions hold that are\nexpressed in terms of the representation $\\bar{\\rho}_{E,p}$. In establishing\nour results, we leverage a theorem of Coates and Sujatha on the algebraic\nstructure of the fine Selmer group. Furthermore, in the case when\n$\\bar{\\rho}_{E, p}$ is irreducible, we show that our hypotheses imply that\n$\\mu_p(E)=0$ provided the classical Iwasawa $\\mu$-invariant vanishes for the\nsplitting field $\\mathbb{Q}(E[p]):=\\bar{\\mathbb{Q}}^{ker\\bar{\\rho}_{E,p}}$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:29:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ray","Anwesh",""]]}
{"id":"2308.06674","submitter":"Pei-Zi Zhao","authors":"P. Z. Zhao, D. M. Tong","title":"Nonadiabatic holonomic quantum computation based on commutation relation","comments":"7 pages, 2 figures","journal-ref":"Phys. Rev. A 108, 012619 (2023)","doi":"10.1103/PhysRevA.108.012619","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nonadiabatic holonomic quantum computation has received increasing attention\ndue to the merits of both robustness against control errors and high-speed\nimplementation. A crucial step in realizing nonadiabatic holonomic quantum\ncomputation is to remove the dynamical phase from the total phase. For this\nreason, previous schemes of nonadiabatic holonomic quantum computation have to\nresort to the parallel transport condition, i.e., requiring the instantaneous\ndynamical phase to be always zero. In this paper, we put forward a strategy to\ndesign nonadiabatic holonomic quantum computation, which is based on a\ncommutation relation rather than the parallel transport condition. Instead of\nrequiring the instantaneous dynamical phase to be always zero, the dynamical\npart of the total phase is separated from the geometric part and then removed\nby properly choosing evolution parameters. This strategy enhances the\nflexibility to realize nonadiabatic holonomic quantum computation as the\ncommutation relation is more relaxed than the parallel transport condition. It\nprovides more options for realizing nonadiabatic holonomic quantum computation\nand hence allows us to optimize realizations such as the evolution time and\nevolution paths.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:30:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","P. Z.",""],["Tong","D. M.",""]]}
{"id":"2308.06675","submitter":"Suryanarayana Maddu","authors":"Suryanarayana Maddu, Scott Weady, Michael J. Shelley","title":"Learning fast, accurate, and stable closures of a kinetic theory of an\n  active fluid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Important classes of active matter systems can be modeled using kinetic\ntheories. However, kinetic theories can be high dimensional and challenging to\nsimulate. Reduced-order representations based on tracking only low-order\nmoments of the kinetic model serve as an efficient alternative, but typically\nrequire closure assumptions to model unrepresented higher-order moments. In\nthis study, we present a learning framework based on neural networks that\nexploit rotational symmetries in the closure terms to learn accurate closure\nmodels directly from kinetic simulations. The data-driven closures demonstrate\nexcellent a-priori predictions comparable to the state-of-the-art Bingham\nclosure. We provide a systematic comparison between different neural network\narchitectures and demonstrate that nonlocal effects can be safely ignored to\nmodel the closure terms. We develop an active learning strategy that enables\naccurate prediction of the closure terms across the entire parameter space\nusing a single neural network without the need for retraining. We also propose\na data-efficient training procedure based on time-stepping constraints and a\ndifferentiable pseudo-spectral solver, which enables the learning of stable\nclosures suitable for a-posteriori inference. The coarse-grained simulations\nequipped with data-driven closure models faithfully reproduce the mean velocity\nstatistics, scalar order parameters, and velocity power spectra observed in\nsimulations of the kinetic theory. Our differentiable framework also\nfacilitates the estimation of parameters in coarse-grained descriptions\nconditioned on data.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:33:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Maddu","Suryanarayana",""],["Weady","Scott",""],["Shelley","Michael J.",""]]}
{"id":"2308.06676","submitter":"Sanjib Basu","authors":"Sanjib Basu and abhit Chandra Pramanik","title":"Sum of two rare sets in a category base can be absolutely non-baire","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we give generalized version in category bases of a result of\nKharazishvili dealing with absolute nonmeasurability of the Minkowski sum of\ncertain universal measure zero sets which were based on an earlier result of\nErdos, Kunen and Mauldin in the real line.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:45:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Basu","Sanjib",""],["Pramanik","abhit Chandra",""]]}
{"id":"2308.06677","submitter":"Luis Alejandro Masmela-Caita","authors":"Luis Alejandro Masmela-Caita, Thais Paiva Galletti, Marcos Oliveira\n  Prates","title":"Imputation of missing data using multivariate Gaussian Linear\n  Cluster-Weighted Modeling","comments":"23 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Missing data arises when certain values are not recorded or observed for\nvariables of interest. However, most of the statistical theory assume complete\ndata availability. To address incomplete databases, one approach is to fill the\ngaps corresponding to the missing information based on specific criteria, known\nas imputation. In this study, we propose a novel imputation methodology for\ndatabases with non-response units by leveraging additional information from\nfully observed auxiliary variables. We assume that the variables included in\nthe database are continuous and that the auxiliary variables, which are fully\nobserved, help to improve the imputation capacity of the model. Within a fully\nBayesian framework, our method utilizes a flexible mixture of multivariate\nnormal distributions to jointly model the response and auxiliary variables. By\nemploying the principles of Gaussian Cluster-Weighted modeling, we construct a\npredictive model to impute the missing values by leveraging information from\nthe covariates. We present simulation studies and a real data illustration to\ndemonstrate the imputation capacity of our method across various scenarios,\ncomparing it to other methods in the literature\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:45:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Masmela-Caita","Luis Alejandro",""],["Galletti","Thais Paiva",""],["Prates","Marcos Oliveira",""]]}
{"id":"2308.06678","submitter":"Craig O. Heinke","authors":"Craig O. Heinke (Univ. of Alberta)","title":"Chance coincidences between black hole low-mass X-ray binaries and\n  supernova remnants","comments":"ApJ, in press. 5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I argue that black hole low-mass X-ray binaries (BH LMXBs) are very unlikely\nto be physically associated with supernova remnants (SNRs). The timescales of\nBH LMXBs are so much longer than those of SNRs, that there is only a 0.2%\nchance of any BH LMXB being identified within its natal SNR. However, the\nprobability of a BH LMXB being projected within a SNR is significant; I\nestimate that 2 BH LMXBs should be projected within SNRs from our perspective.\nI look more closely at the suggestion by Balakrishnan and collaborators of an\nassociation between the BH X-ray binary Swift J1728.9-3613 and the SNR\nG351.9-0.9, and show that this is most likely a chance coincidence.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:53:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Heinke","Craig O.","","Univ. of Alberta"]]}
{"id":"2308.06679","submitter":"Siyuan Xing","authors":"Siyuan Xing and Jianqiao Sun","title":"Separable Gaussian Neural Networks: Structure, Analysis, and Function\n  Approximations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Gaussian-radial-basis function neural network (GRBFNN) has been a popular\nchoice for interpolation and classification. However, it is computationally\nintensive when the dimension of the input vector is high. To address this\nissue, we propose a new feedforward network - Separable Gaussian Neural Network\n(SGNN) by taking advantage of the separable property of Gaussian functions,\nwhich splits input data into multiple columns and sequentially feeds them into\nparallel layers formed by uni-variate Gaussian functions. This structure\nreduces the number of neurons from O(N^d) of GRBFNN to O(dN), which\nexponentially improves the computational speed of SGNN and makes it scale\nlinearly as the input dimension increases. In addition, SGNN can preserve the\ndominant subspace of the Hessian matrix of GRBFNN in gradient descent training,\nleading to a similar level of accuracy to GRBFNN. It is experimentally\ndemonstrated that SGNN can achieve 100 times speedup with a similar level of\naccuracy over GRBFNN on tri-variate function approximations. The SGNN also has\nbetter trainability and is more tuning-friendly than DNNs with RuLU and Sigmoid\nfunctions. For approximating functions with complex geometry, SGNN can lead to\nthree orders of magnitude more accurate results than a RuLU-DNN with twice the\nnumber of layers and the number of neurons per layer.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 03:54:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xing","Siyuan",""],["Sun","Jianqiao",""]]}
{"id":"2308.06680","submitter":"Noman Bashir","authors":"Diptyaroop Maji, Noman Bashir, David Irwin, Prashant Shenoy, Ramesh K.\n  Sitaraman","title":"Untangling Carbon-free Energy Attribution and Carbon Intensity\n  Estimation for Carbon-aware Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many organizations, including governments, utilities, and businesses, have\nset ambitious targets to reduce carbon emissions as a part of their\nsustainability goals. To achieve these targets, these organizations\nincreasingly use power purchase agreements (PPAs) to obtain renewable energy\ncredits, which they use to offset their ``brown'' energy consumption. However,\nthe details of these PPAs are often private and not shared with important\nstakeholders, such as grid operators and carbon information services, who\nmonitor and report the grid's carbon emissions. This often results in incorrect\ncarbon accounting where the same renewable energy production could be factored\ninto grid carbon emission reports and also separately claimed by organizations\nthat own PPAs. Such ``double counting'' of renewable energy production could\nlead to organizations with PPAs to understate their carbon emissions and\noverstate their progress towards their sustainability goals. Further, we show\nthat commonly-used carbon reduction measures, such as load shifting, can have\nthe opposite effect of increasing emissions if such measures were to use\ninaccurate carbon intensity signals. For instance, users may increase energy\nconsumption because the grid's carbon intensity appears low even though carbon\nintensity may actually be high when renewable energy attributed to PPAs are\nexcluded. Unfortunately, there is currently no consensus on how to accurately\ncompute the grid's carbon intensity by properly accounting for PPAs. The goal\nof our work is to shed quantitative light on the renewable energy attribution\nproblem and evaluate its impact of inaccurate accounting on carbon-aware\nsystems.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 04:02:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Maji","Diptyaroop",""],["Bashir","Noman",""],["Irwin","David",""],["Shenoy","Prashant",""],["Sitaraman","Ramesh K.",""]]}
{"id":"2308.06681","submitter":"Madhurjya P Bora Dr","authors":"Mridusmita Das and Madhurjya P. Bora","title":"The possibility of hypersonic electrostatic solitons in a plasma with\n  turbulence heating","comments":"12 pages, 5 figures","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":"  Here, we show that electrostatic solitons in a plasma with turbulent heating\nof the electrons through an accelerating electric field, can form with very\nhigh velocities, reaching up to several order of magnitudes larger than the\nion-sound speed. We call these solitons hypersonic solitons. The possible\nparameter regime, where this work may be relevant, can be found the so-called\n``dead zones'' of a protoplanetary disk. These zones are stable to\nmagnetorotational instability but the resultant turbulence can in effect heat\nthe electrons make them follow a highly non-Maxwellian velocity distribution.\nWe show that these hypersonic solitons can also reach very high velocities.\nWith electron velocity distribution described by Davydov distribution function,\nwe argue that these solitons can be an effective mechanism for energy\nequilibration in such a situation through soliton decay and radiation.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 04:25:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Das","Mridusmita",""],["Bora","Madhurjya P.",""]]}
{"id":"2308.06682","submitter":"Ziqi Guo","authors":"Ziqi Guo","title":"Explicit Kodaira-Spencer map over Hilbert modular varieties","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this paper is to explicitly compute the Kodaira-Spencer maps over\nHilbert-Siegel modular varieties and twisted Hilbert modular varieties and\ntheir effects on the metrics of the Hodge bundle. Our result is a\ngeneralization of the result in \\cite{arXiv:2205.11334}.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 04:26:38 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 01:59:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Guo","Ziqi",""]]}
{"id":"2308.06683","submitter":"Szilard Fazekas","authors":"Szil\\'ard Zsolt Fazekas, Robert Merca\\c{s}","title":"Sweep Complexity Revisited","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the sweep complexity of DFA in one-way jumping mode answering\nseveral questions posed earlier. This measure is the number of times in the\nworst case that such machines have to return to the beginning of their input\nafter having skipped some of the symbols. The class of languages accepted by\nthese machines strictly includes the regular class and constant sweep\ncomplexity allows exactly the acceptance of regular languages. However, we show\nthat there exist machines with higher than constant complexity still only\naccepting regular languages and that in general the sweep complexity of an\nautomaton does not distinguish between accepting regular and non-regular\nlanguages. We establish separation results for asymptotic classes defined by\nthis complexity measure and give a surprising exponential/logarithmic relation\nbetween factors of certain inputs which can be verified by such machines.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:02:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fazekas","Szil\u00e1rd Zsolt",""],["Merca\u015f","Robert",""]]}
{"id":"2308.06684","submitter":"Itai Panas","authors":"Itai Panas","title":"Entertaining the Possibility of RT Superconductivity in LK-99","comments":"6 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":"  An intuitive chemical perspective on the LK-99 material is outlined and\nsupported by DFT calculations. A hidden flat Lead band that exhibits\ninstability toward charge density wave formation is exposed. Electron transfer\nbetween Lead CDW/conduction bands and Cu$_3$d$^9$/Cu$_3$d$^{10}$ impurity\nstates is suggested to embody the observed phenomenology reminiscent of room\ntemperature superconductivity. The inter-system electronic instability is\nreflected in a chemical instability involving 2Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O\n=> Pb$_{20-2x}$Cu$_{2x}$(PO$_4$)$_{12}$(O$_2$). Implications for tuning\nposttreatments as well as handling of the LK-99 material emerge.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:15:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Panas","Itai",""]]}
{"id":"2308.06685","submitter":"Yutao Jin","authors":"Yutao Jin, Bin Liu, Jing Wang","title":"Video Captioning with Aggregated Features Based on Dual Graphs and Gated\n  Fusion","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 video captioning models aims at translating the content of\nvideos by using accurate natural language. Due to the complex nature inbetween\nobject interaction in the video, the comprehensive understanding of\nspatio-temporal relations of objects remains a challenging task. Existing\nmethods often fail in generating sufficient feature representations of video\ncontent. In this paper, we propose a video captioning model based on dual\ngraphs and gated fusion: we adapt two types of graphs to generate feature\nrepresentations of video content and utilize gated fusion to further understand\nthese different levels of information. Using a dual-graphs model to generate\nappearance features and motion features respectively can utilize the content\ncorrelation in frames to generate various features from multiple perspectives.\nAmong them, dual-graphs reasoning can enhance the content correlation in frame\nsequences to generate advanced semantic features; The gated fusion, on the\nother hand, aggregates the information in multiple feature representations for\ncomprehensive video content understanding. The experiments conducted on worldly\nused datasets MSVD and MSR-VTT demonstrate state-of-the-art performance of our\nproposed approach.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:18:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jin","Yutao",""],["Liu","Bin",""],["Wang","Jing",""]]}
{"id":"2308.06686","submitter":"Aaditya Naik","authors":"Aaditya Naik, Adam Stein, Yinjun Wu, Eric Wong, Mayur Naik","title":"MDB: Interactively Querying Datasets and Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.LG cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As models are trained and deployed, developers need to be able to\nsystematically debug errors that emerge in the machine learning pipeline. We\npresent MDB, a debugging framework for interactively querying datasets and\nmodels. MDB integrates functional programming with relational algebra to build\nexpressive queries over a database of datasets and model predictions. Queries\nare reusable and easily modified, enabling debuggers to rapidly iterate and\nrefine queries to discover and characterize errors and model behaviors. We\nevaluate MDB on object detection, bias discovery, image classification, and\ndata imputation tasks across self-driving videos, large language models, and\nmedical records. Our experiments show that MDB enables up to 10x faster and\n40\\% shorter queries than other baselines. In a user study, we find developers\ncan successfully construct complex queries that describe errors of machine\nlearning models.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:22:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Naik","Aaditya",""],["Stein","Adam",""],["Wu","Yinjun",""],["Wong","Eric",""],["Naik","Mayur",""]]}
{"id":"2308.06687","submitter":"Shibsankar Das","authors":"Shibsankar Das, Adrish Banerjee, and Zilong Liu","title":"Root Cross Z-Complementary Pairs with Large ZCZ Width","comments":"This work has been presented in 2022 IEEE International Symposium on\n  Information Theory (ISIT), Espoo, Finland","journal-ref":"2022 IEEE International Symposium on Information Theory (ISIT),\n  Espoo, Finland, 2022, pp. 522-527","doi":"10.1109/ISIT50566.2022.9834651","report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a new family of cross $Z$-complementary pairs\n(CZCPs) based on generalized Boolean functions and two roots of unity. Our key\nidea is to consider an arbitrary partition of the set $\\{1,2,\\cdots, n\\}$ with\ntwo subsets corresponding to two given roots of unity for which two truncated\nsequences of new alphabet size determined by the two roots of unity are\nobtained. We show that these two truncated sequences form a new $q$-ary CZCP\nwith flexible sequence length and large zero-correlation zone width.\nFurthermore, we derive an enumeration formula by considering the Stirling\nnumber of the second kind for the partitions and show that the number of\nconstructed CZCPs increases significantly compared to the existing works.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:27:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Das","Shibsankar",""],["Banerjee","Adrish",""],["Liu","Zilong",""]]}
{"id":"2308.06688","submitter":"Minghui Ding","authors":"Ming-Hui Ding, Hongyu Liu, Guang-Hui Zheng","title":"Determining a stationary mean field game system from full/partial\n  boundary measurement","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 propose and study the utilization of the\nDirichlet-to-Neumann (DN) map to uniquely identify the discount functions $r,\nk$ and cost function $F$ in a stationary mean field game (MFG) system. This\nstudy features several technical novelties that make it highly intriguing and\nchallenging. Firstly, it involves a coupling of two nonlinear elliptic partial\ndifferential equations. Secondly, the simultaneous recovery of multiple\nparameters poses a significant implementation challenge. Thirdly, there is the\nprobability measure constraint of the coupled equations to consider. Finally,\nthe limited information available from partial boundary measurements adds\nanother layer of complexity to the problem. Considering these challenges and\nproblems, we present an enhanced higher-order linearization method to tackle\nthe inverse problem related to the MFG system. Our proposed approach involves\nlinearizing around a pair of zero solutions and fulfilling the probability\nmeasurement constraint by adjusting the positive input at the boundary. It is\nworth emphasizing that this technique is not only applicable for uniquely\nidentifying multiple parameters using full-boundary measurements but also\nhighly effective for utilizing partial-boundary measurements.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:37:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ding","Ming-Hui",""],["Liu","Hongyu",""],["Zheng","Guang-Hui",""]]}
{"id":"2308.06689","submitter":"Xiao-Ming Wu","authors":"Xiao-Ming Wu, Dian Zheng, Zuhao Liu, Wei-Shi Zheng","title":"Estimator Meets Equilibrium Perspective: A Rectified Straight Through\n  Estimator for Binary Neural Networks Training","comments":"10 pages, 6 figures. Accepted in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Binarization of neural networks is a dominant paradigm in neural networks\ncompression. The pioneering work BinaryConnect uses Straight Through Estimator\n(STE) to mimic the gradients of the sign function, but it also causes the\ncrucial inconsistency problem. Most of the previous methods design different\nestimators instead of STE to mitigate it. However, they ignore the fact that\nwhen reducing the estimating error, the gradient stability will decrease\nconcomitantly. These highly divergent gradients will harm the model training\nand increase the risk of gradient vanishing and gradient exploding. To fully\ntake the gradient stability into consideration, we present a new perspective to\nthe BNNs training, regarding it as the equilibrium between the estimating error\nand the gradient stability. In this view, we firstly design two indicators to\nquantitatively demonstrate the equilibrium phenomenon. In addition, in order to\nbalance the estimating error and the gradient stability well, we revise the\noriginal straight through estimator and propose a power function based\nestimator, Rectified Straight Through Estimator (ReSTE for short). Comparing to\nother estimators, ReSTE is rational and capable of flexibly balancing the\nestimating error with the gradient stability. Extensive experiments on CIFAR-10\nand ImageNet datasets show that ReSTE has excellent performance and surpasses\nthe state-of-the-art methods without any auxiliary modules or losses.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:38:47 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:51:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Xiao-Ming",""],["Zheng","Dian",""],["Liu","Zuhao",""],["Zheng","Wei-Shi",""]]}
{"id":"2308.06690","submitter":"Shibsankar Das","authors":"Shibsankar Das, Adrish Banerjee, and Udaya Parampalli","title":"Two-Dimensional Z-Complementary Array Quads with Low Column Sequence\n  PMEPRs","comments":"This work has been presented in 2023 IEEE International Symposium on\n  Information Theory (ISIT), Taipei, Taiwan","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we first propose a new design strategy of 2D $Z$-complementary\narray quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four\ndistinct unimodular arrays satisfying zero 2D auto-correlation sums for\nnon-trivial 2D time-shifts within certain zone. Then, we obtain the upper\nbounds on the column sequence peak-to-mean envelope power ratio (PMEPR) of the\nconstructed 2D-ZCAQs by using specific auto-correlation properties of some seed\nsequences. The constructed 2D-ZCAQs with bounded column sequence PMEPR can be\nused as a potential alternative to 2D Golay complementary array sets for\npractical applications\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:46:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Das","Shibsankar",""],["Banerjee","Adrish",""],["Parampalli","Udaya",""]]}
{"id":"2308.06691","submitter":"Ryohei Miyadera Dr","authors":"Shoei Takahashi, Unchone Lee, Hikaru Manabe, Aoi Murakami, Daisuke\n  Minematsu, Kou Omori and Ryohei Miyadera","title":"Curious Properties of Iterative Sequences","comments":"This is already submitted to a journal","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, several interesting iterative sequences were investigated.\nFirst, we define the iterative sequences. We fix function f(n). An iterative\nsequence starts with a natural number n, and calculates the sequence\nf(n),f(f(n)), ...f(f(f(f(n)))),... We then search for interesting features in\nthis sequence. We study Kaprekar's routine, the digit factorial process, and\nthe digit power process. The authors presented new variants of Kaprekar's\nroutine.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:52:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Takahashi","Shoei",""],["Lee","Unchone",""],["Manabe","Hikaru",""],["Murakami","Aoi",""],["Minematsu","Daisuke",""],["Omori","Kou",""],["Miyadera","Ryohei",""]]}
{"id":"2308.06692","submitter":"Mingkai Zheng","authors":"Mingkai Zheng, Shan You, Lang Huang, Chen Luo, Fei Wang, Chen Qian,\n  Chang Xu","title":"SimMatchV2: Semi-Supervised Learning with Graph Consistency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semi-Supervised image classification is one of the most fundamental problem\nin computer vision, which significantly reduces the need for human labor. In\nthis paper, we introduce a new semi-supervised learning algorithm - SimMatchV2,\nwhich formulates various consistency regularizations between labeled and\nunlabeled data from the graph perspective. In SimMatchV2, we regard the\naugmented view of a sample as a node, which consists of a label and its\ncorresponding representation. Different nodes are connected with the edges,\nwhich are measured by the similarity of the node representations. Inspired by\nthe message passing and node classification in graph theory, we propose four\ntypes of consistencies, namely 1) node-node consistency, 2) node-edge\nconsistency, 3) edge-edge consistency, and 4) edge-node consistency. We also\nuncover that a simple feature normalization can reduce the gaps of the feature\nnorm between different augmented views, significantly improving the performance\nof SimMatchV2. Our SimMatchV2 has been validated on multiple semi-supervised\nlearning benchmarks. Notably, with ResNet-50 as our backbone and 300 epochs of\ntraining, SimMatchV2 achieves 71.9\\% and 76.2\\% Top-1 Accuracy with 1\\% and\n10\\% labeled examples on ImageNet, which significantly outperforms the previous\nmethods and achieves state-of-the-art performance. Code and pre-trained models\nare available at\n\\href{https://github.com/mingkai-zheng/SimMatchV2}{https://github.com/mingkai-zheng/SimMatchV2}.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 05:56:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Mingkai",""],["You","Shan",""],["Huang","Lang",""],["Luo","Chen",""],["Wang","Fei",""],["Qian","Chen",""],["Xu","Chang",""]]}
{"id":"2308.06693","submitter":"Yichen Yuan","authors":"Yichen Yuan, Yifan Wang, Lijun Wang, Xiaoqi Zhao, Huchuan Lu, Yu Wang,\n  Weibo Su, Lei Zhang","title":"Isomer: Isomerous Transformer for Zero-shot Video Object Segmentation","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent leading zero-shot video object segmentation (ZVOS) works devote to\nintegrating appearance and motion information by elaborately designing feature\nfusion modules and identically applying them in multiple feature stages. Our\npreliminary experiments show that with the strong long-range dependency\nmodeling capacity of Transformer, simply concatenating the two modality\nfeatures and feeding them to vanilla Transformers for feature fusion can\ndistinctly benefit the performance but at a cost of heavy computation. Through\nfurther empirical analysis, we find that attention dependencies learned in\nTransformer in different stages exhibit completely different properties: global\nquery-independent dependency in the low-level stages and semantic-specific\ndependency in the high-level stages. Motivated by the observations, we propose\ntwo Transformer variants: i) Context-Sharing Transformer (CST) that learns the\nglobal-shared contextual information within image frames with a lightweight\ncomputation. ii) Semantic Gathering-Scattering Transformer (SGST) that models\nthe semantic correlation separately for the foreground and background and\nreduces the computation cost with a soft token merging mechanism. We apply CST\nand SGST for low-level and high-level feature fusions, respectively,\nformulating a level-isomerous Transformer framework for ZVOS task. Compared\nwith the baseline that uses vanilla Transformers for multi-stage fusion, ours\nsignificantly increase the speed by 13 times and achieves new state-of-the-art\nZVOS performance. Code is available at https://github.com/DLUT-yyc/Isomer.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:12:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yuan","Yichen",""],["Wang","Yifan",""],["Wang","Lijun",""],["Zhao","Xiaoqi",""],["Lu","Huchuan",""],["Wang","Yu",""],["Su","Weibo",""],["Zhang","Lei",""]]}
{"id":"2308.06694","submitter":"Ryohei Miyadera Dr","authors":"Ryohei Miyadera, Shoei Takahashi. Aoi Murakami, Akito Tsujii, Hikaru\n  Manabe","title":"Impartial and Partizan Restricted Chocolate Bar Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider impartial and partizan restricted chocolate bar\ngames. In impartial restricted chocolate bar games, players cut a chocolate bar\ninto two pieces along any horizontal or vertical line and eat whichever piece\nis smaller. If the two pieces are the same size, a player can eat either one.\nIn constrast, partizan restricted chocolate bar games include players\ndesignated as Left and Right and chocolate bars with black and white stripes.\nLeft cuts the chocolate bar in two as above and eats the part with fewer black\nblocks. Similarly, Right cuts the bar and eats the part with fewer white\nblocks. A player loses when they cannot eat the remaining chocolate bar. We\nprovide formulas that describe the winning positions of the previous player,\nRight, and Left players. We also present an interesting similarity in the\ngraphs of previous players' winning positions for impartial and partizan\nchocolate bar games.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:14:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Miyadera","Ryohei",""],["Murakami","Shoei Takahashi. Aoi",""],["Tsujii","Akito",""],["Manabe","Hikaru",""]]}
{"id":"2308.06695","submitter":"Prianka Mandal","authors":"Prianka Mandal, Sunil Manandhar, Kaushal Kafle, Kevin Moran, Denys\n  Poshyvanyk, Adwait Nadkarni","title":"Helion: Enabling Natural Testing of Smart Homes","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. arXiv admin note: text overlap with arXiv:1907.00124","journal-ref":null,"doi":"10.1145/3611643.3613095","report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Prior work has developed numerous systems that test the security and safety\nof smart homes. For these systems to be applicable in practice, it is necessary\nto test them with realistic scenarios that represent the use of the smart home,\ni.e., home automation, in the wild. This demo paper presents the technical\ndetails and usage of Helion, a system that uses n-gram language modeling to\nlearn the regularities in user-driven programs, i.e., routines developed for\nthe smart home, and predicts natural scenarios of home automation, i.e., event\nsequences that reflect realistic home automation usage. We demonstrate the\nHelionHA platform, developed by integrating Helion with the popular Home\nAssistant smart home platform. HelionHA allows an end-to-end exploration of\nHelion's scenarios by executing them as test cases with real and virtual smart\nhome devices.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:17:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mandal","Prianka",""],["Manandhar","Sunil",""],["Kafle","Kaushal",""],["Moran","Kevin",""],["Poshyvanyk","Denys",""],["Nadkarni","Adwait",""]]}
{"id":"2308.06696","submitter":"Yichi Zhang","authors":"Yichi Zhang, Zhuo Chen, Wen Zhang","title":"MACO: A Modality Adversarial and Contrastive Framework for\n  Modality-missing Multi-modal Knowledge Graph Completion","comments":"This is the ArXiv version of our paper accepted by NLPCC 2023. The\n  code will be released soon","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.MM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recent years have seen significant advancements in multi-modal knowledge\ngraph completion (MMKGC). MMKGC enhances knowledge graph completion (KGC) by\nintegrating multi-modal entity information, thereby facilitating the discovery\nof unobserved triples in the large-scale knowledge graphs (KGs). Nevertheless,\nexisting methods emphasize the design of elegant KGC models to facilitate\nmodality interaction, neglecting the real-life problem of missing modalities in\nKGs. The missing modality information impedes modal interaction, consequently\nundermining the model's performance. In this paper, we propose a modality\nadversarial and contrastive framework (MACO) to solve the modality-missing\nproblem in MMKGC. MACO trains a generator and discriminator adversarially to\ngenerate missing modality features that can be incorporated into the MMKGC\nmodel. Meanwhile, we design a cross-modal contrastive loss to improve the\nperformance of the generator. Experiments on public benchmarks with further\nexplorations demonstrate that MACO could achieve state-of-the-art results and\nserve as a versatile framework to bolster various MMKGC models. Our code and\nbenchmark data are available at https://github.com/zjukg/MACO.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:29:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Yichi",""],["Chen","Zhuo",""],["Zhang","Wen",""]]}
{"id":"2308.06697","submitter":"Sergei Blinnikov","authors":"S.E. Kuratov, I.S. Menshov, S.Yu. Igashov, E.M. Urvachev, S.I.\n  Blinnikov, D.S. Shidlovski, S.I. Glazyrin","title":"Novel hydrodynamic cumulation mechanism caused by quantum shell effects","comments":"49 pages, pdf only","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The computational and theoretical analysis carried out in this article\ndemonstrates the existence of a nontrivial mechanism for the compression of a\nsubmicron-sized gas bubble formed by a gas of classical ions and a gas of\ndegenerate electrons. This mechanism fundamentally differs from conventional\ncompression mechanisms. It is shown that taking into account the quantum effect\nof a large spatial scale in the distribution of electrons qualitatively changes\nthe character of cumulative processes. Because of a large-scale electric field\ncaused by quantum shell effects, the compression process is characterized by\nthe formation of multiple shock waves. The values of gas temperature and\npressure achieved during compression occur higher by two orders of magnitude as\ncompared with the classical adiabatic regime. The analysis is carried out\nwithin the framework of the following model: the dynamics of the electron\nsubsystem is described by equations of a quantum electron fluid, while the\nhydrodynamic approximation is adopted for the ionic subsystem. The large scale\neffect is taken into account by means of effective external field acting on\nelectrons. The theoretical analysis carried out within this approach clarifies\nthe nature of the cumulative process in the system under consideration; some\nquantitative characteristics obtained with numerical simulation are presented.\nThe possibility of experimental observation of this cumulative mechanism is\nanalyzed. It is suggested that the manifestation of the effect can be observed\nduring laser compression of a system of submicron targets by measuring the\nneutron yield.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:34:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kuratov","S. E.",""],["Menshov","I. S.",""],["Igashov","S. Yu.",""],["Urvachev","E. M.",""],["Blinnikov","S. I.",""],["Shidlovski","D. S.",""],["Glazyrin","S. I.",""]]}
{"id":"2308.06698","submitter":"Mohammed Saad Qadri","authors":"Mohammed Saad Qadri","title":"On Higher Multiplicity upon Restriction from $\\rm{GL}(n)$ to\n  $\\rm{GL}(n-1)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $F$ be a non-archimedean local field. Let $\\Pi$ be a principal series\nrepresentation of $\\rm{GL}_n(F)$ induced from a cuspidal representation of a\nLevi subgroup. When $\\pi$ is an essentially square integrable representation of\n$\\rm{GL}_{n-1}(F)$ we prove that $\\rm{Hom}_{\\rm{GL}_{n-1}}(\\Pi,\\pi) =\n\\mathbb{C}$ and $\\rm{Ext}^i_{\\rm{GL}_{n-1}}(\\Pi,\\pi) = 0$ for all integers\n$i\\geq 1$, with exactly one exception (up to twists), namely, when $\\Pi=\n\\nu^{-(\\frac{n-1}{2})} \\times \\nu^{-(\\frac{n-3}{2})} \\times \\ldots \\times\n\\nu^{(\\frac{n-1}{2})}$ and $\\pi$ is the Steinberg. When $\\Pi=\n\\nu^{-(\\frac{n-1}{2})} \\times \\nu^{-(\\frac{n-3}{2})} \\times \\ldots \\times\n\\nu^{(\\frac{n-1}{2})}$ and $\\pi$ is the Steinberg of $\\rm{GL}_{n-1}(F)$, then\n$\\dim \\rm{Hom}_{\\rm{GL}_{n-1}(F)}(\\Pi,\\pi)=n$. We also exhibit specific\nprincipal series for which each of the intermediate multiplicities $2, 3,\n\\cdots, (n-1)$ are attained.\n  Along the way, we also give a complete list of those irreducible non-generic\nrepresentations of $\\rm{GL}_{n}(F)$ that have the Steinberg of\n$\\rm{GL}_{n-1}(F)$ as a quotient upon restriction to $\\rm{GL}_{n-1}(F)$. We\nalso show that there do not exist non-generic irreducible representations of\n$\\rm{GL}_{n}(F)$ that have the generalized Steinberg as a quotient upon\nrestriction to $\\rm{GL}_{n-1}(F)$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:39:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qadri","Mohammed Saad",""]]}
{"id":"2308.06699","submitter":"Jia Li","authors":"Jia Li, Ziling Chen, Xiaolong Wu, Lu Wang, Beibei Wang, Lei Zhang","title":"Neural Super-Resolution for Real-time Rendering with Radiance\n  Demodulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rendering high-resolution images in real-time applications (e.g., video\ngames, virtual reality) is time-consuming, thus super-resolution technology\nbecomes more and more crucial in real-time rendering. However, it is still\nchallenging to preserve sharp texture details, keep the temporal stability and\navoid the ghosting artifacts in the real-time rendering super-resolution. To\nthis end, we introduce radiance demodulation into real-time rendering\nsuper-resolution, separating the rendered image or radiance into a lighting\ncomponent and a material component, due to the fact that the light component\ntends to be smoother than the rendered image and the high-resolution material\ncomponent with detailed textures can be easily obtained. Therefore, we perform\nthe super-resolution only on the lighting component and re-modulate with the\nhigh-resolution material component to obtain the final super-resolution image.\nIn this way, the texture details can be preserved much better. Then, we propose\na reliable warping module by explicitly pointing out the unreliable occluded\nregions with a motion mask to remove the ghosting artifacts. We further enhance\nthe temporal stability by designing a frame-recurrent neural network to\naggregate the previous and current frames, which better captures the\nspatial-temporal correlation between reconstructed frames. As a result, our\nmethod is able to produce temporally stable results in real-time rendering with\nhigh-quality details, even in the highly challenging 4 $\\times$ 4\nsuper-resolution scenarios.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:40:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Jia",""],["Chen","Ziling",""],["Wu","Xiaolong",""],["Wang","Lu",""],["Wang","Beibei",""],["Zhang","Lei",""]]}
{"id":"2308.06700","submitter":"Yue-Ran Shi","authors":"Yue-Ran Shi, Yuan-Yao He, Ruijin Liu, and Wei Zhang","title":"Gaussian variational method to Fermi Hubbard model in one and two\n  dimensions","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study of ground-state properties of the Fermi-Hubbard model is a\nlong-lasting task in the research of strongly correlated systems. Owing to the\nexponentially growing complexity of the system, a quantitative analysis usually\ndemands high computational cost and is restricted to small samples, especially\nin two or higher dimensions. Here, we introduce a variational method in the\nframe of fermionic Gaussian states, and obtain the ground states of one- and\ntwo-dimensional attractive Hubbard models via imaginary-time evolution. We\ncalculate the total energy and benchmark the results in a wide range of\ninteraction strength and filling factor with those obtained via exact two-body\nresults, the density matrix renormalization group based on matrix product\nstates (MPS), and projector Quantum Monte Carlo (QMC) method. For both 1D and\n2D cases, the Gaussian variational method presents accurate results for total\nenergy with a maximum systematic error ~4% in the intermediate interaction\nregion. The accuracy of these results has negligible dependence on the system\nsize. We further calculate the double occupancy and find excellent agreement\nwith MPS and QMC, as well as the experimental results of cold quantum gases in\noptical lattices. The results suggest that the Gaussian pairing state is a good\napproximation to the ground states of attractive Hubbard model, in particular\nin the strong and weak coupling limits. Moreover, we generalize the method to\nthe attractive Hubbard model with a finite spin-polarization, which can be\nmapped to the repulsive interaction case via particle-hole transformation, and\nobtain accurate results of ground state energy and double occupancy. Our work\ndemonstrates the ability of the Gaussian variational method to extract ground\nstate properties of strongly correlated many-body systems with negligible\ncomputational cost, especially of large size and in higher dimensions.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:50:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shi","Yue-Ran",""],["He","Yuan-Yao",""],["Liu","Ruijin",""],["Zhang","Wei",""]]}
{"id":"2308.06701","submitter":"Haichao Zhang","authors":"Haichao Zhang, Can Qin, Yu Yin, Yun Fu","title":"Camouflaged Image Synthesis Is All You Need to Boost Camouflaged\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Camouflaged objects that blend into natural scenes pose significant\nchallenges for deep-learning models to detect and synthesize. While camouflaged\nobject detection is a crucial task in computer vision with diverse real-world\napplications, this research topic has been constrained by limited data\navailability. We propose a framework for synthesizing camouflage data to\nenhance the detection of camouflaged objects in natural scenes. Our approach\nemploys a generative model to produce realistic camouflage images, which can be\nused to train existing object detection models. Specifically, we use a\ncamouflage environment generator supervised by a camouflage distribution\nclassifier to synthesize the camouflage images, which are then fed into our\ngenerator to expand the dataset. Our framework outperforms the current\nstate-of-the-art method on three datasets (COD10k, CAMO, and CHAMELEON),\ndemonstrating its effectiveness in improving camouflaged object detection. This\napproach can serve as a plug-and-play data generation and augmentation module\nfor existing camouflaged object detection tasks and provides a novel way to\nintroduce more diversity and distributions into current camouflage datasets.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:55:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Haichao",""],["Qin","Can",""],["Yin","Yu",""],["Fu","Yun",""]]}
{"id":"2308.06702","submitter":"Zhiqing Wei","authors":"Zhiqing Wei, Ruizhong Xu, Zhiyong Feng, Huici Wu, Ning Zhang, Wangjun\n  Jiang, Xiaoyu Yang","title":"Symbol-level Integrated Sensing and Communication enabled Multiple Base\n  Stations Cooperative Sensing","comments":"15 pages, 17 figures, 2 tables","journal-ref":null,"doi":"10.1109/TVT.2023.3304856","report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the support of integrated sensing and communication (ISAC) technology,\nmobile communication system will integrate the function of wireless sensing,\nthereby facilitating new intelligent applications such as smart city and\nintelligent transportation. Due to the limited sensing accuracy and sensing\nrange of single base station (BS), multi-BS cooperative sensing can be applied\nto realize high-accurate, long-range and continuous sensing, exploiting the\nspecific advantages of large-scale networked mobile communication system. This\npaper proposes a cooperative sensing method suitable to mobile communication\nsystems, which applies symbol-level sensing information fusion to estimate the\nlocation and velocity of target. With the demodulation symbols obtained from\nthe echo signals of multiple BSs, the phase features contained in the\ndemodulation symbols are used in the fusion procedure, which realizes\ncooperative sensing with the synchronization level of mobile communication\nsystem. Compared with the signal-level fusion in the area of distributed\naperture coherence-synthetic radars, the requirement of synchronization is much\nlower. When signal-to-noise ratio (SNR) is -5 dB, it is evaluated that\nsymbol-level multi-BS cooperative sensing effectively improves the accuracy of\ndistance and velocity estimation of target. Compared with single-BS sensing,\nthe accuracy of distance and velocity estimation is improved by 40% and 72%,\nrespectively. Compared with data-level multi-BS cooperative sensing based on\nmaximum likelihood (ML) estimation, the accuracy of location and velocity\nestimation is improved by 12% and 63%, respectively. This work may provide a\nguideline for the design of multi-BS cooperative sensing system to exploit the\nwidely deployed networked mobile communication system.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 06:57:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wei","Zhiqing",""],["Xu","Ruizhong",""],["Feng","Zhiyong",""],["Wu","Huici",""],["Zhang","Ning",""],["Jiang","Wangjun",""],["Yang","Xiaoyu",""]]}
{"id":"2308.06703","submitter":"Avery Ma","authors":"Avery Ma, Yangchen Pan and Amir-massoud Farahmand","title":"Understanding the robustness difference between stochastic gradient\n  descent and adaptive gradient methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stochastic gradient descent (SGD) and adaptive gradient methods, such as Adam\nand RMSProp, have been widely used in training deep neural networks. We\nempirically show that while the difference between the standard generalization\nperformance of models trained using these methods is small, those trained using\nSGD exhibit far greater robustness under input perturbations. Notably, our\ninvestigation demonstrates the presence of irrelevant frequencies in natural\ndatasets, where alterations do not affect models' generalization performance.\nHowever, models trained with adaptive methods show sensitivity to these\nchanges, suggesting that their use of irrelevant frequencies can lead to\nsolutions sensitive to perturbations. To better understand this difference, we\nstudy the learning dynamics of gradient descent (GD) and sign gradient descent\n(signGD) on a synthetic dataset that mirrors natural signals. With a\nthree-dimensional input space, the models optimized with GD and signGD have\nstandard risks close to zero but vary in their adversarial risks. Our result\nshows that linear models' robustness to $\\ell_2$-norm bounded changes is\ninversely proportional to the model parameters' weight norm: a smaller weight\nnorm implies better robustness. In the context of deep learning, our\nexperiments show that SGD-trained neural networks show smaller Lipschitz\nconstants, explaining the better robustness to input perturbations than those\ntrained with adaptive gradient methods.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:03:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Avery",""],["Pan","Yangchen",""],["Farahmand","Amir-massoud",""]]}
{"id":"2308.06704","submitter":"Prof. Dr. M. W. Wu","authors":"F. Yang and M. W. Wu","title":"Diamagnetic property and optical absorption in conventional\n  superconductors with magnetic impurities","comments":"14 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":"  By solving the renormalization of the $s$-$d$ interaction from magnetic\nimpurities embeded in conventional superconductors at low concentration, we\nderive the macroscopic superconducting phase fluctuation and electromagnetic\nproperties within the path-integral approach. It is found that there exist two\nsuperconducting phase modes, both exhibiting similar behaviors of the\nNambu-Goldstone mode. The existence of two phase modes suggests that in\naddition to the conventional free Cooper pairs as in the BCS case, there\nemerges a small part of the localized Cooper pairs around magnetic impurities\ndue to the quantum correlation by the $s$-$d$ interaction, acting as Josephson\nislands. The emerging impurity Shiba bands inside the superconducting gap then\ncorrespond to the excitations of the ground state of the localized Cooper\npairs, associated with the breaking of these Cooper pairs. In the diamagnetic\nresponse, the state of the free Cooper pairs gives rise to the conventional\nreal contribution in the generated supercurrent, whereas the one of the\nlocalized Cooper pairs results in an imaginary contribution, leading to the\nsuperconducting Friedel oscillation, i.e., oscillation in the decay of the\nvector potential in the Meissner effect. As for the optical absorption of a\nconventional superconductor lying in the anomalous-skin-effect region, it is\nfound that besides the conventional interband transition of Bogoliubov\nquasiparticles as revealed by Mattis-Bardeen theory, there also exist the\ninterband transition between the impurity Shiba bands as well as all interband\ntransitions between Bogoliubov quasiparticle and impurity Shiba bands. These\ntransitions exhibit clear and separate resonance characters, providing a\nfeasible scheme for the experimental detection.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:29:53 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 14:30:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","F.",""],["Wu","M. W.",""]]}
{"id":"2308.06705","submitter":"Guo-Liang Yu","authors":"Jie Lu, Guo-Liang Yu, Zhi-Gang Wang, Bin Wu","title":"Analysis of the strong vertices of $\\Sigma_{c}\\Delta D^{*}$ and\n  $\\Sigma_{b}\\Delta B^{*}$ in QCD sum rules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we analyze the strong vertices $\\Sigma_{c}\\Delta D^{*}$ and\n$\\Sigma_{b}\\Delta B^{*}$ using the three-point QCD sum rules under the tensor\nstructures $i\\epsilon^{\\rho\\tau\\alpha\\beta}p_{\\alpha}p_{\\beta}$,\n$p^{\\rho}p'^{\\tau}$ and $p^{\\rho}p^{\\tau}$. We firstly calculate the momentum\ndependent strong coupling constants $g(Q^{2})$ by considering contributions of\nthe perturbative part and the condensate terms $\\langle\\overline{q}q\\rangle$,\n$\\langle g_{s}^{2}GG \\rangle$, $\\langle\\overline{q}g_{s}\\sigma Gq\\rangle$ and\n$\\langle\\overline{q}q\\rangle^{2}$. By fitting these coupling constants into\nanalytical functions and extrapolating them into time-like regions, we then\nobtain the on-shell values of strong coupling constants for these vertices. The\nresults are $g_{1\\Sigma_{c}\\Delta D^{*}}=5.13^{+0.39}_{-0.49}$ GeV$^{-1}$,\n$g_{2\\Sigma_{c}\\Delta D^{*}}=-3.03^{+0.27}_{-0.35}$ GeV$^{-2}$,\n$g_{3\\Sigma_{c}\\Delta D^{*}}=17.64^{+1.51}_{-1.95}$ GeV$^{-2}$,\n$g_{1\\Sigma_{b}\\Delta B^{*}}=20.97^{+2.15}_{-2.39}$ GeV$^{-1}$,\n$g_{2\\Sigma_{b}\\Delta B^{*}}=-11.42^{+1.17}_{-1.28}$ GeV$^{-2}$ and\n$g_{3\\Sigma_{b}\\Delta B^{*}}=24.87^{+2.57}_{-2.82}$ GeV$^{-2}$. These strong\ncoupling constants are important parameters which can help us to understand the\nstrong decay behaviors of hadrons.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:43:51 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:49:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lu","Jie",""],["Yu","Guo-Liang",""],["Wang","Zhi-Gang",""],["Wu","Bin",""]]}
{"id":"2308.06706","submitter":"Ole Steuernagel","authors":"Ole Steuernagel and Ray-Kuang Lee","title":"Wigner's Phase Space Current for the Conditional Dynamics in Entangled\n  Two Mode Systems -Seeing Beam Splitters in a New Light-","comments":"5 figures. arXiv admin note: text overlap with arXiv:2307.16510","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study quantum dynamics in phase space for a continuous single mode system\nwhich is entangled with another such mode. As our main example we use the\nstrongly mode mixing dynamics of a variable beam splitter which makes the\ndynamics of each mode conditional on the other mode. We derive and study the\nform of the conditional Wigner current J of one mode after tracing out the\nother. Since in other representations of quantum theory no analogue for J\nexists, only the Wigner representation can be used for this type of visual\nstudy of such conditional dynamics.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:50:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Steuernagel","Ole",""],["Lee","Ray-Kuang",""]]}
{"id":"2308.06707","submitter":"Xiaohu Huang","authors":"Xiaohu Huang, Xinggang Wang, Zhidianqiu Jin, Bo Yang, Botao He, Bin\n  Feng, and Wenyu Liu","title":"Condition-Adaptive Graph Convolution Learning for Skeleton-Based Gait\n  Recognition","comments":"Accepted by TIP journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph convolutional networks have been widely applied in skeleton-based gait\nrecognition. A key challenge in this task is to distinguish the individual\nwalking styles of different subjects across various views. Existing\nstate-of-the-art methods employ uniform convolutions to extract features from\ndiverse sequences and ignore the effects of viewpoint changes. To overcome\nthese limitations, we propose a condition-adaptive graph (CAG) convolution\nnetwork that can dynamically adapt to the specific attributes of each skeleton\nsequence and the corresponding view angle. In contrast to using fixed weights\nfor all joints and sequences, we introduce a joint-specific filter learning\n(JSFL) module in the CAG method, which produces sequence-adaptive filters at\nthe joint level. The adaptive filters capture fine-grained patterns that are\nunique to each joint, enabling the extraction of diverse spatial-temporal\ninformation about body parts. Additionally, we design a view-adaptive topology\nlearning (VATL) module that generates adaptive graph topologies. These graph\ntopologies are used to correlate the joints adaptively according to the\nspecific view conditions. Thus, CAG can simultaneously adjust to various\nwalking styles and viewpoints. Experiments on the two most widely used datasets\n(i.e., CASIA-B and OU-MVLP) show that CAG surpasses all previous skeleton-based\nmethods. Moreover, the recognition performance can be enhanced by simply\ncombining CAG with appearance-based methods, demonstrating the ability of CAG\nto provide useful complementary information.The source code will be available\nat https://github.com/OliverHxh/CAG.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:51:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Xiaohu",""],["Wang","Xinggang",""],["Jin","Zhidianqiu",""],["Yang","Bo",""],["He","Botao",""],["Feng","Bin",""],["Liu","Wenyu",""]]}
{"id":"2308.06708","submitter":"Yuta Hasegawa","authors":"Yuuichi Asahi, Yuta Hasegawa, Naoyuki Onodera, Takashi Shimokawabe,\n  Hayato Shiba, Yasuhiro Idomura","title":"Generating observation guided ensembles for data assimilation with\n  denoising diffusion probabilistic model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an ensemble data assimilation method using the pseudo\nensembles generated by denoising diffusion probabilistic model. Since the model\nis trained against noisy and sparse observation data, this model can produce\ndivergent ensembles close to observations. Thanks to the variance in generated\nensembles, our proposed method displays better performance than the\nwell-established ensemble data assimilation method when the simulation model is\nimperfect.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:55:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Asahi","Yuuichi",""],["Hasegawa","Yuta",""],["Onodera","Naoyuki",""],["Shimokawabe","Takashi",""],["Shiba","Hayato",""],["Idomura","Yasuhiro",""]]}
{"id":"2308.06709","submitter":"Tianyou Zeng","authors":"Ming-Chih Lai, Yongcun Song, Xiaoming Yuan, Hangrui Yue, Tianyou Zeng","title":"The Hard-Constraint PINNs for Interface Optimal Control Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the physics-informed neural networks (PINNs), in combination\nwith some recently developed discontinuity capturing neural networks, can be\napplied to solve optimal control problems subject to partial differential\nequations (PDEs) with interfaces and some control constraints. The resulting\nalgorithm is mesh-free and scalable to different PDEs, and it ensures the\ncontrol constraints rigorously. Since the boundary and interface conditions, as\nwell as the PDEs, are all treated as soft constraints by lumping them into a\nweighted loss function, it is necessary to learn them simultaneously and there\nis no guarantee that the boundary and interface conditions can be satisfied\nexactly. This immediately causes difficulties in tuning the weights in the\ncorresponding loss function and training the neural networks. To tackle these\ndifficulties and guarantee the numerical accuracy, we propose to impose the\nboundary and interface conditions as hard constraints in PINNs by developing a\nnovel neural network architecture. The resulting hard-constraint PINNs approach\nguarantees that both the boundary and interface conditions can be satisfied\nexactly and they are decoupled from the learning of the PDEs. Its efficiency is\npromisingly validated by some elliptic and parabolic interface optimal control\nproblems.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:56:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lai","Ming-Chih",""],["Song","Yongcun",""],["Yuan","Xiaoming",""],["Yue","Hangrui",""],["Zeng","Tianyou",""]]}
{"id":"2308.06710","submitter":"Diksha Gupta","authors":"Mousomi Bhakta, Debdip Ganguly, Diksha Gupta, Alok Kumar Sahoo","title":"Global compactness result and multiplicity of solutions for a class of\n  critical exponent problem in the hyperbolic space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper deals with the global compactness and multiplicity of positive\nsolutions to problems of the type $$ -\\Delta_{\\mathbb B^N} u -\\lambda u=a(x)\n|u|^{2^*-2}u+f(x) \\quad\\text{in } \\mathbb B^N, \\quad u\\in H^1(\\mathbb B^N),$$\n  where $\\mathbb B^N$ denotes the ball model of the hyperbolic space of\ndimension $N\\geq 4$, $2^*=\\frac{2N}{N-2}$,\n$\\frac{N(N-2)}{4}<\\lambda<\\frac{(N-1)^2}{4}$ and $f\\in H^{-1}(\\mathbb B^N)$\n($f\\not\\equiv 0$) is a non-negative functional in the dual space of\n$H^1(\\mathbb B^N)$. The potential $a\\in L^\\infty(\\mathbb B^N)$ is assumed to be\nstrictly positive, such that $\\lim_{ d(x,0)\\to \\infty}a(x)=1$, where $d(x,0)$\ndenotes the geodesic distance. We establish profile decomposition of the\nassociated functional. We show that concentration takes place along two\ndifferent profiles, namely along hyperbolic bubbles and localized Aubin-Talenti\nbubbles. For $f=0$ and $a\\equiv 1$, profile decomposition was studied by Bhakta\nand Sandeep [Calc. Var. PDE, 2012]. However, due to the presence of $a(.)$, an\nextension of profile decomposition to the present set-up is highly nontrivial\nand requires several delicate estimates and geometric arguments concerning the\nisometry group (M\\\"obius group) of the hyperbolic space. Further, using the\ndecomposition result, we derive various energy estimates involving the\ninteracting hyperbolic bubbles and hyperbolic bubbles with localized\nAubin-Talenti bubbles. Finally, combining these estimates with topological and\nvariational arguments, we establish a multiplicity of positive solutions in the\ncases: $a\\geq 1$ and $a<1$ separately. The equation studied in this article can\nbe thought of as a variant of a scalar-field equation with a critical exponent\nin the hyperbolic space, although such a critical exponent problem in the\nEuclidean space $\\mathbb{R}^N$ has only a trivial solution when $f \\equiv 0,$\n$a(x)\\equiv1$ and $\\lambda < 0.$\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 07:58:55 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 09:09:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhakta","Mousomi",""],["Ganguly","Debdip",""],["Gupta","Diksha",""],["Sahoo","Alok Kumar",""]]}
{"id":"2308.06711","submitter":"Tao Li","authors":"Jianhua Yang and Tao Li","title":"Instability of the $U(1)$ spin liquid with a large spinon Fermi surface\n  in the Heisenberg-ring exchange model on the triangular lattice","comments":"16 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is widely believed that the $U(1)$ spin liquid with a large spinon Fermi\nsurface(SFS state) can be realized in the spin-$\\frac{1}{2}$ $J_{1}-J_{4}$\nmodel on the triangular lattice, when the ring exchange coupling $J_{4}$ is\nsufficiently strong to suppress the 120 degree magnetic ordered state. This\nbelief is supported by many variational studies on this model and seems to be\nconsistent with observations on the organic spin liquid materials such as\n$\\kappa$-(BEDT-TTF)$_{2}$Cu$_{2}$(CN)$_{3}$, a system that is close to Mott\ntransition and thus has large ring exchange coupling. Here we show through a\nsystematic variational search that such a state is never favored in the\n$J_{1}-J_{4}$ model on the triangular lattice. Instead, a state with broken\nspatial symmetry is favored in the most probable parameter regime for the SFS\nstate, with an energy much lower than that of the SFS state and other\npreviously proposed variational states. More specifically, we find that for\n$J_{4}\\ge 0.09J_{1}$, the system favors a valence bond solid state with a\n$4\\times6$ period in its local spin correlation pattern, with a variational\nenergy that is about $5\\%$ lower than that of the SFS state. This state is\nseparated form the $\\pi$-flux state for $J_{4}\\le 0.045J_{1}$ by an\nintermediate valence bond solid state with a zigzag pattern in its local spin\ncorrelation. We find that the variational phase digram is in qualitative\nagreement with that obtained from exact diagonalization on a $6\\times6$\ncluster.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:00:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Jianhua",""],["Li","Tao",""]]}
{"id":"2308.06712","submitter":"Lin Li","authors":"Lin Li, Guikun Chen, Jun Xiao, Yi Yang, Chunping Wang, Long Chen","title":"Compositional Feature Augmentation for Unbiased Scene Graph Generation","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":"  Scene Graph Generation (SGG) aims to detect all the visual relation triplets\n<sub, pred, obj> in a given image. With the emergence of various advanced\ntechniques for better utilizing both the intrinsic and extrinsic information in\neach relation triplet, SGG has achieved great progress over the recent years.\nHowever, due to the ubiquitous long-tailed predicate distributions, today's SGG\nmodels are still easily biased to the head predicates. Currently, the most\nprevalent debiasing solutions for SGG are re-balancing methods, e.g., changing\nthe distributions of original training samples. In this paper, we argue that\nall existing re-balancing strategies fail to increase the diversity of the\nrelation triplet features of each predicate, which is critical for robust SGG.\nTo this end, we propose a novel Compositional Feature Augmentation (CFA)\nstrategy, which is the first unbiased SGG work to mitigate the bias issue from\nthe perspective of increasing the diversity of triplet features. Specifically,\nwe first decompose each relation triplet feature into two components: intrinsic\nfeature and extrinsic feature, which correspond to the intrinsic\ncharacteristics and extrinsic contexts of a relation triplet, respectively.\nThen, we design two different feature augmentation modules to enrich the\nfeature diversity of original relation triplets by replacing or mixing up\neither their intrinsic or extrinsic features from other samples. Due to its\nmodel-agnostic nature, CFA can be seamlessly incorporated into various SGG\nframeworks. Extensive ablations have shown that CFA achieves a new\nstate-of-the-art performance on the trade-off between different metrics.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:02:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Lin",""],["Chen","Guikun",""],["Xiao","Jun",""],["Yang","Yi",""],["Wang","Chunping",""],["Chen","Long",""]]}
{"id":"2308.06713","submitter":"Binbin Yang","authors":"Binbin Yang, Yi Luo, Ziliang Chen, Guangrun Wang, Xiaodan Liang, Liang\n  Lin","title":"LAW-Diffusion: Complex Scene Generation by Diffusion with Layouts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Thanks to the rapid development of diffusion models, unprecedented progress\nhas been witnessed in image synthesis. Prior works mostly rely on pre-trained\nlinguistic models, but a text is often too abstract to properly specify all the\nspatial properties of an image, e.g., the layout configuration of a scene,\nleading to the sub-optimal results of complex scene generation. In this paper,\nwe achieve accurate complex scene generation by proposing a semantically\ncontrollable Layout-AWare diffusion model, termed LAW-Diffusion. Distinct from\nthe previous Layout-to-Image generation (L2I) methods that only explore\ncategory-aware relationships, LAW-Diffusion introduces a spatial dependency\nparser to encode the location-aware semantic coherence across objects as a\nlayout embedding and produces a scene with perceptually harmonious object\nstyles and contextual relations. To be specific, we delicately instantiate each\nobject's regional semantics as an object region map and leverage a\nlocation-aware cross-object attention module to capture the spatial\ndependencies among those disentangled representations. We further propose an\nadaptive guidance schedule for our layout guidance to mitigate the trade-off\nbetween the regional semantic alignment and the texture fidelity of generated\nobjects. Moreover, LAW-Diffusion allows for instance reconfiguration while\nmaintaining the other regions in a synthesized image by introducing a\nlayout-aware latent grafting mechanism to recompose its local regional\nsemantics. To better verify the plausibility of generated scenes, we propose a\nnew evaluation metric for the L2I task, dubbed Scene Relation Score (SRS) to\nmeasure how the images preserve the rational and harmonious relations among\ncontextual objects. Comprehensive experiments demonstrate that our\nLAW-Diffusion yields the state-of-the-art generative performance, especially\nwith coherent object relations.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:06:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Binbin",""],["Luo","Yi",""],["Chen","Ziliang",""],["Wang","Guangrun",""],["Liang","Xiaodan",""],["Lin","Liang",""]]}
{"id":"2308.06714","submitter":"Yu Song","authors":"Yu Song and Donglin Wang","title":"Learning on Graphs with Out-of-Distribution Nodes","comments":"Accepted by KDD'22","journal-ref":null,"doi":"10.1145/3534678.3539457","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Neural Networks (GNNs) are state-of-the-art models for performing\nprediction tasks on graphs. While existing GNNs have shown great performance on\nvarious tasks related to graphs, little attention has been paid to the scenario\nwhere out-of-distribution (OOD) nodes exist in the graph during training and\ninference. Borrowing the concept from CV and NLP, we define OOD nodes as nodes\nwith labels unseen from the training set. Since a lot of networks are\nautomatically constructed by programs, real-world graphs are often noisy and\nmay contain nodes from unknown distributions. In this work, we define the\nproblem of graph learning with out-of-distribution nodes. Specifically, we aim\nto accomplish two tasks: 1) detect nodes which do not belong to the known\ndistribution and 2) classify the remaining nodes to be one of the known\nclasses. We demonstrate that the connection patterns in graphs are informative\nfor outlier detection, and propose Out-of-Distribution Graph Attention Network\n(OODGAT), a novel GNN model which explicitly models the interaction between\ndifferent kinds of nodes and separate inliers from outliers during feature\npropagation. Extensive experiments show that OODGAT outperforms existing\noutlier detection methods by a large margin, while being better or comparable\nin terms of in-distribution classification.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:10:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Song","Yu",""],["Wang","Donglin",""]]}
{"id":"2308.06715","submitter":"Chen Wang","authors":"Chen Wang, Zhongcai Pei, Shuang Qiu, Yachun Wang, Zhiyong Tang","title":"StairNetV3: Depth-aware Stair Modeling using Deep Learning","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":"  Vision-based stair perception can help autonomous mobile robots deal with the\nchallenge of climbing stairs, especially in unfamiliar environments. To address\nthe problem that current monocular vision methods are difficult to model stairs\naccurately without depth information, this paper proposes a depth-aware stair\nmodeling method for monocular vision. Specifically, we take the extraction of\nstair geometric features and the prediction of depth images as joint tasks in a\nconvolutional neural network (CNN), with the designed information propagation\narchitecture, we can achieve effective supervision for stair geometric feature\nlearning by depth information. In addition, to complete the stair modeling, we\ntake the convex lines, concave lines, tread surfaces and riser surfaces as\nstair geometric features and apply Gaussian kernels to enable the network to\npredict contextual information within the stair lines. Combined with the depth\ninformation obtained by depth sensors, we propose a stair point cloud\nreconstruction method that can quickly get point clouds belonging to the stair\nstep surfaces. Experiments on our dataset show that our method has a\nsignificant improvement over the previous best monocular vision method, with an\nintersection over union (IOU) increase of 3.4 %, and the lightweight version\nhas a fast detection speed and can meet the requirements of most real-time\napplications. Our dataset is available at\nhttps://data.mendeley.com/datasets/6kffmjt7g2/1.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:11:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Chen",""],["Pei","Zhongcai",""],["Qiu","Shuang",""],["Wang","Yachun",""],["Tang","Zhiyong",""]]}
{"id":"2308.06716","submitter":"Jian-Min Zhang","authors":"Wen-Ti Guo, Ningjing Yang, Zhigao Huang, Jian-Min Zhang","title":"Novel magnetic topological insulator FeBi$_2$Te$_4$ with controllable\n  topological quantum phase","comments":null,"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":"  Here, we report a new intrinsic magnetic topological insulator FeBi$_2$Te$_4$\nbased on first-principles calculations and it can achieve a rich topological\nphase under pressure modulation. Without pressure, we predict that both\nFeBi$_2$Te$_4$ ferromagnetic and antiferromagnetic orders are non-trivial\ntopological insulators. Furthermore, FeBi$_2$Te$_4$ of FM-z order will undergo\na series of phase transitions from topological insulator to semimetals and then\nto trivial insulator under pressure. Finally, we further clarify and verify\ntopological phase transitions with low-energy effective model calculations.\nThis topological phase transition process is attributed to the synergy of the\nmagnetic moment and the spin-orbit coupling. The unique topological properties\nof FeBi$_2$Te$_4$ will be of great interest in driving the development of\nquantum effects.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:11:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Guo","Wen-Ti",""],["Yang","Ningjing",""],["Huang","Zhigao",""],["Zhang","Jian-Min",""]]}
{"id":"2308.06717","submitter":"Ilgin Dogan","authors":"Ilgin Dogan, Zuo-Jun Max Shen, Anil Aswani","title":"Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden\n  Rewards","comments":"72 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2304.07407","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.GT stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In practice, incentive providers (i.e., principals) often cannot observe the\nreward realizations of incentivized agents, which is in contrast to many\nprincipal-agent models that have been previously studied. This information\nasymmetry challenges the principal to consistently estimate the agent's unknown\nrewards by solely watching the agent's decisions, which becomes even more\nchallenging when the agent has to learn its own rewards. This complex setting\nis observed in various real-life scenarios ranging from renewable energy\nstorage contracts to personalized healthcare incentives. Hence, it offers not\nonly interesting theoretical questions but also wide practical relevance. This\npaper explores a repeated adverse selection game between a self-interested\nlearning agent and a learning principal. The agent tackles a multi-armed bandit\n(MAB) problem to maximize their expected reward plus incentive. On top of the\nagent's learning, the principal trains a parallel algorithm and faces a\ntrade-off between consistently estimating the agent's unknown rewards and\nmaximizing their own utility by offering adaptive incentives to lead the agent.\nFor a non-parametric model, we introduce an estimator whose only input is the\nhistory of principal's incentives and agent's choices. We unite this estimator\nwith a proposed data-driven incentive policy within a MAB framework. Without\nrestricting the type of the agent's algorithm, we prove finite-sample\nconsistency of the estimator and a rigorous regret bound for the principal by\nconsidering the sequential externality imposed by the agent. Lastly, our\ntheoretical results are reinforced by simulations justifying applicability of\nour framework to green energy aggregator contracts.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:12:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dogan","Ilgin",""],["Shen","Zuo-Jun Max",""],["Aswani","Anil",""]]}
{"id":"2308.06718","submitter":"Feng Xie","authors":"Feng Xie, Biwei Huang, Zhengming Chen, Ruichu Cai, Clark Glymour, Zhi\n  Geng, and Kun Zhang","title":"Generalized Independent Noise Condition for Estimating Causal Structure\n  with Latent Variables","comments":null,"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":"  We investigate the challenging task of learning causal structure in the\npresence of latent variables, including locating latent variables and\ndetermining their quantity, and identifying causal relationships among both\nlatent and observed variables. To address this, we propose a Generalized\nIndependent Noise (GIN) condition for linear non-Gaussian acyclic causal models\nthat incorporate latent variables, which establishes the independence between a\nlinear combination of certain measured variables and some other measured\nvariables. Specifically, for two observed random vectors $\\bf{Y}$ and $\\bf{Z}$,\nGIN holds if and only if $\\omega^{\\intercal}\\mathbf{Y}$ and $\\mathbf{Z}$ are\nindependent, where $\\omega$ is a non-zero parameter vector determined by the\ncross-covariance between $\\mathbf{Y}$ and $\\mathbf{Z}$. We then give necessary\nand sufficient graphical criteria of the GIN condition in linear non-Gaussian\nacyclic causal models. Roughly speaking, GIN implies the existence of an\nexogenous set $\\mathcal{S}$ relative to the parent set of $\\mathbf{Y}$ (w.r.t.\nthe causal ordering), such that $\\mathcal{S}$ d-separates $\\mathbf{Y}$ from\n$\\mathbf{Z}$. Interestingly, we find that the independent noise condition\n(i.e., if there is no confounder, causes are independent of the residual\nderived from regressing the effect on the causes) can be seen as a special case\nof GIN. With such a connection between GIN and latent causal structures, we\nfurther leverage the proposed GIN condition, together with a well-designed\nsearch procedure, to efficiently estimate Linear, Non-Gaussian Latent\nHierarchical Models (LiNGLaHs), where latent confounders may also be causally\nrelated and may even follow a hierarchical structure. We show that the\nunderlying causal structure of a LiNGLaH is identifiable in light of GIN\nconditions under mild assumptions. Experimental results show the effectiveness\nof the proposed approach.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:13:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xie","Feng",""],["Huang","Biwei",""],["Chen","Zhengming",""],["Cai","Ruichu",""],["Glymour","Clark",""],["Geng","Zhi",""],["Zhang","Kun",""]]}
{"id":"2308.06719","submitter":"Yiding Qiu","authors":"Yiding Qiu, Henrik I. Christensen","title":"3D Scene Graph Prediction on Point Clouds Using Knowledge Graphs","comments":"accepted at CASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  3D scene graph prediction is a task that aims to concurrently predict object\nclasses and their relationships within a 3D environment. As these environments\nare primarily designed by and for humans, incorporating commonsense knowledge\nregarding objects and their relationships can significantly constrain and\nenhance the prediction of the scene graph. In this paper, we investigate the\napplication of commonsense knowledge graphs for 3D scene graph prediction on\npoint clouds of indoor scenes. Through experiments conducted on a real-world\nindoor dataset, we demonstrate that integrating external commonsense knowledge\nvia the message-passing method leads to a 15.0 % improvement in scene graph\nprediction accuracy with external knowledge and $7.96\\%$ with internal\nknowledge when compared to state-of-the-art algorithms. We also tested in the\nreal world with 10 frames per second for scene graph generation to show the\nusage of the model in a more realistic robotics setting.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:20:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qiu","Yiding",""],["Christensen","Henrik I.",""]]}
{"id":"2308.06720","submitter":"Xintai Chen","authors":"Xintai Chen, Biqian Feng, Yongpeng Wu, Derrick Wing Kwan Ng, and\n  Robert Schober","title":"Joint Beamforming and Antenna Movement Design for Moveable Antenna\n  Systems Based on Statistical CSI","comments":"Accepted by GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies a novel movable antenna (MA)-enhanced multiple-input\nmultiple-output (MIMO) system to leverage the corresponding spatial degrees of\nfreedom (DoFs) for improving the performance of wireless communications. We aim\nto maximize the achievable rate by jointly optimizing the MA positions and the\ntransmit covariance matrix based on statistical channel state information\n(CSI). To solve the resulting design problem, we develop a constrained\nstochastic successive convex approximation (CSSCA) algorithm applicable for the\ngeneral movement mode. Furthermore, we propose two simplified antenna movement\nmodes, namely the linear movement mode and the planar movement mode, to\nfacilitate efficient antenna movement and reduce the computational complexity\nof the CSSCA algorithm. Numerical results show that the considered MA-enhanced\nsystem can significantly improve the achievable rate compared to conventional\nMIMO systems employing uniform planar arrays (UPAs) and that the proposed\nplanar movement mode performs closely to the performance upper bound achieved\nby the general movement mode.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:25:37 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 15:37:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Xintai",""],["Feng","Biqian",""],["Wu","Yongpeng",""],["Ng","Derrick Wing Kwan",""],["Schober","Robert",""]]}
{"id":"2308.06721","submitter":"Hu Ye","authors":"Hu Ye, Jun Zhang, Sibo Liu, Xiao Han, Wei Yang","title":"IP-Adapter: Text Compatible Image Prompt Adapter for Text-to-Image\n  Diffusion Models","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":"  Recent years have witnessed the strong power of large text-to-image diffusion\nmodels for the impressive generative capability to create high-fidelity images.\nHowever, it is very tricky to generate desired images using only text prompt as\nit often involves complex prompt engineering. An alternative to text prompt is\nimage prompt, as the saying goes: \"an image is worth a thousand words\".\nAlthough existing methods of direct fine-tuning from pretrained models are\neffective, they require large computing resources and are not compatible with\nother base models, text prompt, and structural controls. In this paper, we\npresent IP-Adapter, an effective and lightweight adapter to achieve image\nprompt capability for the pretrained text-to-image diffusion models. The key\ndesign of our IP-Adapter is decoupled cross-attention mechanism that separates\ncross-attention layers for text features and image features. Despite the\nsimplicity of our method, an IP-Adapter with only 22M parameters can achieve\ncomparable or even better performance to a fully fine-tuned image prompt model.\nAs we freeze the pretrained diffusion model, the proposed IP-Adapter can be\ngeneralized not only to other custom models fine-tuned from the same base\nmodel, but also to controllable generation using existing controllable tools.\nWith the benefit of the decoupled cross-attention strategy, the image prompt\ncan also work well with the text prompt to achieve multimodal image generation.\nThe project page is available at \\url{https://ip-adapter.github.io}.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:34:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ye","Hu",""],["Zhang","Jun",""],["Liu","Sibo",""],["Han","Xiao",""],["Yang","Wei",""]]}
{"id":"2308.06722","submitter":"Xi-Wen Guan","authors":"Xi-Wen Guan, Hai-Qing Lin","title":"Yang-Gaudin model: A paradigm of many-body physics","comments":"12 pages, 5 figures, brief feature review article for celebrating\n  professor C N Yang's 100th birthday","journal-ref":null,"doi":null,"report-no":"published in \"A Festschrift in Honour of the C N Yang\n  Centenary--Scientific Papers\" , pages 185-206, 2022 by World Scientific\n  Publishing Co. Pte. Ltd","categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using Bethe's hypothesis, C N Yang exactly solved the one-dimensional (1D)\ndelta-function interacting spin-1/2 Fermi gas with an arbitrary spin-imbalance\nin 1967. At that time, using a different method, M Gaudin solved the problem of\ninteracting fermions in a spin-balanced case. Later, the 1D delta-function\ninteracting fermion problem was named as the Yang-Gaudin model. It has been in\ngeneral agreed that a key discovery of C N Yang's work was the cubic matrix\nequation for the solvability conditions. % This equation was later\nindependently found by R J Baxter for commuting transfer matrices of 2D exactly\nsolvable vertex models. % The equation has since been referred to Yang-Baxter\nequation, being the master equation to integrability. % The Yang-Baxter\nequation has been used to solve a wide range of 1D many-body problems in\nphysics, such as 1D Hubbard model, $SU(N)$ Fermi gases, Kondo impurity problem\nand strongly correlated electronic systems etc.\n  % In this paper, we will briefly discuss recent developments of the\nYang-Gaudin model on several breakthroughs of many-body phenomena, ranging from\nthe universal thermodynamics to the Luttigner liquid, the spin charge\nseparation, the Fulde-Ferrell-Larkin-Ovchinnikov (FFLO)-like pairing state and\nthe quantum criticality.\n  %\n  These developments demonstrate that the Yang-Gaudin model has laid out a\nprofound legacy of the Yang-Baxter equation.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:44:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Guan","Xi-Wen",""],["Lin","Hai-Qing",""]]}
{"id":"2308.06723","submitter":"Vivek Kumar Yadav","authors":"Vivek Kumar Yadav","title":"BN Doping in the Realm of Two-Dimensional Fullerene Network for\n  Unparalleled Structural, Electronic, Optical, and HER Advancements: A\n  Cutting-Edge DFT Investigation","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 doping of lighter non-metals like boron and nitrogen into graphene\nrepresents a promising advancement in the field of nano-electronic devices,\nparticularly in the development of field-effect transistors (FETs). These doped\ntwo-dimensional (2D) materials offer improved stability and enhanced adsorption\ncharacteristics compared to pure graphene. Notably, It displays semiconducting\nbehavior, resulting in higher conductivity and carrier mobility. In this study,\nwe investigate the structural, electronic, optical, and conductivity/carrier\ntransport properties of 2D polymer sheets made of fullerene, both with and\nwithout boron and nitrogen doping. We employ density functional theory (DFT)\nwith PBE and HSE functionals, considering the inclusion of van der Waals (vdW)\ninteractions. The research findings indicate that the 2D sheets of C60,\nC58B1N1, and C54B3N3 exhibit band gaps of approximately 0.97 eV (1.5 eV), 1.08\neV (1.9 eV), and 1.05 eV (1.6 eV), respectively, as obtained from PBE (HSE)\ncalculations. Moreover, according to the deformation potential theory, both\ndoped sheets exhibit ultra-high conductivity at elevated temperature). These\nresults are highly promising and underscore the significance of a single pair\nof BN dopants in fullerene (C58B1N1) monolayers for the advancement of\nnext-generation 2D nanoelectronic and photonics applications.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:54:31 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 03:27:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yadav","Vivek Kumar",""]]}
{"id":"2308.06724","submitter":"Lishai Shoham","authors":"Lishai Shoham, Maria Baskin, Yaron Kauffmann, Anna Zakharova, Teppei\n  Yoshida, Shigeki Miyasaka, Cinthia Piamonteze, and Lior Kornblum","title":"The impact of the near-surface region on the interpretation of x-ray\n  absorption spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transition metal oxides (TMOs) exhibit a broad spectrum of electronic,\nmagnetic, and optical properties, making them intriguing materials for various\ntechnological applications. Soft x-ray absorption spectroscopy (XAS) is widely\nused to study TMOs, shedding light on their chemical state, electronic\nstructure, orbital polarization, element-specific magnetism, and more.\nDifferent XAS acquisition modes feature different information depth regimes in\nthe sample. Here, we employ two XAS acquisition modes, having surface-sensitive\nversus bulk probing depths, on the prototypical TMO SrVO3. We illustrate and\nelucidate a strong apparent discrepancy between the different modes,\nemphasizing the impact of the near-surface region on the interpretation of XAS\ndata. These findings highlight the importance of the acquisition mode selection\nin XAS analysis. Moreover, the results highlight the role of the near-surface\nregion not only in the characterization of TMOs, but also in the design of\nfuture nanoscale oxide electronics.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:01:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shoham","Lishai",""],["Baskin","Maria",""],["Kauffmann","Yaron",""],["Zakharova","Anna",""],["Yoshida","Teppei",""],["Miyasaka","Shigeki",""],["Piamonteze","Cinthia",""],["Kornblum","Lior",""]]}
{"id":"2308.06725","submitter":"Yuyang Yin","authors":"Yuyang Yin, Dejia Xu, Chuangchuang Tan, Ping Liu, Yao Zhao, Yunchao\n  Wei","title":"CLE Diffusion: Controllable Light Enhancement Diffusion Model","comments":"Accepted In Proceedings of the 31st ACM International Conference on\n  Multimedia (MM' 23)","journal-ref":null,"doi":"10.1145/3581783.3612145","report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Low light enhancement has gained increasing importance with the rapid\ndevelopment of visual creation and editing. However, most existing enhancement\nalgorithms are designed to homogeneously increase the brightness of images to a\npre-defined extent, limiting the user experience. To address this issue, we\npropose Controllable Light Enhancement Diffusion Model, dubbed CLE Diffusion, a\nnovel diffusion framework to provide users with rich controllability. Built\nwith a conditional diffusion model, we introduce an illumination embedding to\nlet users control their desired brightness level. Additionally, we incorporate\nthe Segment-Anything Model (SAM) to enable user-friendly region\ncontrollability, where users can click on objects to specify the regions they\nwish to enhance. Extensive experiments demonstrate that CLE Diffusion achieves\ncompetitive performance regarding quantitative metrics, qualitative results,\nand versatile controllability. Project page:\nhttps://yuyangyin.github.io/CLEDiffusion/\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:05:56 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 04:27:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yin","Yuyang",""],["Xu","Dejia",""],["Tan","Chuangchuang",""],["Liu","Ping",""],["Zhao","Yao",""],["Wei","Yunchao",""]]}
{"id":"2308.06726","submitter":"Morteza Raeisi","authors":"Morteza Raeisi, Florent Bonneu, Edith Gabriel","title":"A spatio-temporal hybrid Strauss hardcore point process for forest fire\n  occurrences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a new point process model that combines, in the spatio-temporal\nsetting, both multi-scaling by hybridization and hardcore distances. Our\nso-called hybrid Strauss hardcore point process model allows different types of\ninteraction, at different spatial and/or temporal scales, that might be of\ninterest in environmental and biological applications. The inference and\nsimulation of the model are implemented using the logistic likelihood approach\nand the birth-death Metropolis-Hastings algorithm. Our model is illustrated and\ncompared to others on two datasets of forest fire occurrences respectively in\nFrance and Spain.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:06:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Raeisi","Morteza",""],["Bonneu","Florent",""],["Gabriel","Edith",""]]}
{"id":"2308.06727","submitter":"Abhishek Mathur","authors":"Abhishek Mathur","title":"Quantum Fields from Causal Order","comments":"PhD thesis 2023, Raman Research Institute, submitted to Jawaharlal\n  Nehru University","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study different aspects of observer independent formulation of quantum\nfield theory (QFT) in curved spacetime background. This thesis is broadly\ndivided into two parts, in the first part we study an observer independent\nscalar field vacuum, called as the Sorkin-Johnston (SJ) vacuum for a small mass\nscalar field in a 2d causal diamond, and conformally coupled scalar field in\nspacetimes which are conformally related to ultrastatic spacetime with time\ndependent conformal factor. We study several properties of the SJ vacuum in\nthese spacetimes and compare with the known vacua. In the second part of the\nthesis we study a spacetime formulation of entanglement entropy, called as the\nSorkin Spacetime Entanglement Entropy (SSEE), in curved spacetime, which makes\nuse of the Wightman function restricted to the region of interest and the\nspacetime field commutator. We study SSEE in cylinder slab spacetimes and\ncompare the result with the Calabrese-Cardy entanglement entropy. We also study\nSSEE of de Sitter and black hole horizons and compared with known results.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:07:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mathur","Abhishek",""]]}
{"id":"2308.06728","submitter":"Mukesh Kumar Vyas","authors":"Mukesh Kumar Vyas and Asaf Pe'er","title":"Optically thick jet base and explanation of edge brightening in AGN jets","comments":"Submitted to APJL, 9 pages. Suggestions, comments or feedback will be\n  appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The jet cores in blazars are resolved and found to harbour an edge brightened\nstructure where the jet base appears extended at sides compared to its\npropagation axis. This peculiar phenomenon invites various explanations. We\nshow that the photosphere of an optically thick jet base in Active Galactic\nNuclei (AGNs) is observed edge brightened if the jet Lorentz factor harbours an\nangular dependence. The jet assumes a higher Lorentz factor along the jet axis\nand decreases following a power law along its polar angle. For an observer near\nthe jet axis, the jet has a lower optical depth along its propagation axis\ncompared to off axis regions. Higher optical depths at the outer region makes\nthe jet photosphere appear to extend to larger radii compared to a deeper\nphotosphere along its propagation axis. We tackle the problem both analytically\nand numerically, confirming the edge brightening through Monte Carlo\nsimulations. Other than the edge brightening, the outcomes are significant as\nthey provide a unique tool to determine the jet structure and associated\nparameters by their resolved observed cores. The study paves way to explore the\nspectral properties of optically thick cores with structured Lorentz factors in\nthe future.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:07:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vyas","Mukesh Kumar",""],["Pe'er","Asaf",""]]}
{"id":"2308.06729","submitter":"Nhan Chau","authors":"Nhan Chau, Juan A. Aguilar (for the IceCube Collaboration)","title":"Indirect dark matter search in the Galactic Centre with 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-1394","categories":"astro-ph.HE hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is assumed that dark matter can annihilate or decay into Standard Model\nparticles which then can produce a neutrino flux detectable at IceCube. Such a\nsignal can be emitted from the Galactic Center thanks to the high density of\ndark matter abundance being gravitationally captured. This analysis aims at\nsearching for neutrino signals from dark matter annihilation and decay in the\nGalactic Center using $\\sim$9 years of IceCube-DeepCore data with an optimized\nselection for low energy. In this contribution, we present the sensitivities on\nthe thermally averaged dark matter self-annihilation cross-section for dark\nmatter masses ranging from 5 GeV up to 8 TeV.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:10:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chau","Nhan","","for the IceCube Collaboration"],["Aguilar","Juan A.","","for the IceCube Collaboration"]]}
{"id":"2308.06730","submitter":"Zain Ul Abideen","authors":"Zain Ul Abideen, Rui Wang, Tiago Diadami Perez, Geert-Jan Schrijen,\n  Samuel Pagliarini","title":"Impact of Orientation on the Bias of SRAM-Based PUFs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the impact of memory orientation on the bias pattern\nof SRAM-based PUFs. We designed and fabricated a 65nm CMOS chip that contains\neleven SRAM macros that exercise different memory- and chip-level parameters.\nAt the memory level, several parameters passed to the SRAM compiler are\nconsidered, including the number of addresses, the number of words, the aspect\nratio, and the chosen bitcell. Chip-level decisions are considered during the\nfloorplan, including the location and rotation of each SRAM macro in the\ntestchip. In this study, we conduct a comprehensive analysis of different\nmemory orientations and their effect on the biasing direction. Physical\nmeasurements performed on 50 fabricated chips revealed that specific memory\norientations, namely R270 and MY90, exhibit a distinct negative biasing\ndirection compared to other orientations. Importantly, this biasing direction\nremains consistent regardless of memory type, column mux ratio, memory size, or\nthe utilization of SRAMs with different bitcells. Overall, this study\nhighlights the significance of careful physical implementation and memory\norientation selection in designing SRAM-based PUFs. Our findings can guide\ndesigners in the selection of SRAM memories with properties that make for\nbetter PUFs that potentially require less error correction effort to compensate\nfor instability.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:10:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Abideen","Zain Ul",""],["Wang","Rui",""],["Perez","Tiago Diadami",""],["Schrijen","Geert-Jan",""],["Pagliarini","Samuel",""]]}
{"id":"2308.06731","submitter":"Shin'ichi Nojiri","authors":"Shin'ichi Nojiri and Sergei. D. Odintsov","title":"Propagation Speed of Gravitational Wave in\n  Scalar--Einstein--Gauss-Bonnet Gravity","comments":"LaTeX, 11 pages, References are added, some notations are corredted","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The propagation speed of the gravitational wave in\nscalar--Einstein--Gauss-Bonnet (sEGB) gravity is generally different from that\nof light. Using differential equation conditions for the speed of gravitational\nwaves to coincide with the light speed in the expanding universe, we\nconstructed a general class of sEGB gravities where this condition is satisfied\nand realistic inflation occurs. It is demonstrated that the condition that the\nspeed of gravitational wave coincides with that of the light in the\nFriedmann-Lema\\^{i}tre-Robertson-Walker (FRLW) universe is always different\nfrom the condition for gravitational wave speed in the sEGB black hole\nbackground. Moreover, it is shown that when gravitational wave speed in sEGB\nblack hole is equal to the speed of light the black hole spacetime geometry is\nchanging too so that formally there is no solution for such sEGB black hole.\nThis may indicate that sEGB black holes hardly can be considered as realistic\nblack holes unless some reasonable scenario to make gravitational wave speed to\nbe equal to that of light is proposed, at least asymptotically.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:27:35 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:20:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Nojiri","Shin'ichi",""],["Odintsov","Sergei. D.",""]]}
{"id":"2308.06732","submitter":"Zhiqing Wei","authors":"Yingying Zou, Zhiqing Wei, Yanpeng Cui, Xinyi Liu, and Zhiyong Feng","title":"UD-MAC: Delay Tolerant Multiple Access Control Protocol for Unmanned\n  Aerial Vehicle Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In unmanned aerial vehicle (UAV) networks, high-capacity data transmission is\nof utmost importance for applications such as intelligent transportation, smart\ncities, and forest monitoring, which rely on the mobility of UAVs to collect\nand transmit large amount of data, including video and image data. Due to the\nshort flight time of UAVs, the network capacity will be reduced when they\nreturn to the ground unit for charging. Hence, we suggest that UAVs can apply a\nstore-carry-and-forward (SCF) transmission mode to carry packets on their way\nback to the ground unit for improving network throughput. In this paper, we\npropose a novel protocol, named UAV delay-tolerant multiple access control\n(UD-MAC), which can support different transmission modes in UAV networks. We\nset a higher priority for SCF transmission and analyze the probability of being\nin SCF mode to derive network throughput. The simulation results show that the\nnetwork throughput of UD-MAC is improved by 57% to 83% compared to VeMAC.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:49:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zou","Yingying",""],["Wei","Zhiqing",""],["Cui","Yanpeng",""],["Liu","Xinyi",""],["Feng","Zhiyong",""]]}
{"id":"2308.06733","submitter":"Fabio Merizzi","authors":"Andrea Asperti, Fabio Merizzi, Alberto Paparella, Giorgio Pedrazzi,\n  Matteo Angelinelli and Stefano Colamonaco","title":"Precipitation nowcasting with generative diffusion models","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.ao-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In recent years traditional numerical methods for accurate weather prediction\nhave been increasingly challenged by deep learning methods. Numerous historical\ndatasets used for short and medium-range weather forecasts are typically\norganized into a regular spatial grid structure. This arrangement closely\nresembles images: each weather variable can be visualized as a map or, when\nconsidering the temporal axis, as a video. Several classes of generative\nmodels, comprising Generative Adversarial Networks, Variational Autoencoders,\nor the recent Denoising Diffusion Models have largely proved their\napplicability to the next-frame prediction problem, and is thus natural to test\ntheir performance on the weather prediction benchmarks. Diffusion models are\nparticularly appealing in this context, due to the intrinsically probabilistic\nnature of weather forecasting: what we are really interested to model is the\nprobability distribution of weather indicators, whose expected value is the\nmost likely prediction.\n  In our study, we focus on a specific subset of the ERA-5 dataset, which\nincludes hourly data pertaining to Central Europe from the years 2016 to 2021.\nWithin this context, we examine the efficacy of diffusion models in handling\nthe task of precipitation nowcasting. Our work is conducted in comparison to\nthe performance of well-established U-Net models, as documented in the existing\nliterature. Our proposed approach of Generative Ensemble Diffusion (GED)\nutilizes a diffusion model to generate a set of possible weather scenarios\nwhich are then amalgamated into a probable prediction via the use of a\npost-processing network. This approach, in comparison to recent deep learning\nmodels, substantially outperformed them in terms of overall performance.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:51:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Asperti","Andrea",""],["Merizzi","Fabio",""],["Paparella","Alberto",""],["Pedrazzi","Giorgio",""],["Angelinelli","Matteo",""],["Colamonaco","Stefano",""]]}
{"id":"2308.06734","submitter":"Lowhikan Sivanantha Sarma","authors":"Lowhikan Sivanantha Sarma, Chinthaka Mallikarachchi and Sumudu Herath","title":"Design-Informed Generative Modelling using Structural Optimization","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":"  Although various structural optimization techniques have a sound mathematical\nbasis, the practical constructability of optimal designs poses a great\nchallenge in the manufacturing stage. Currently, there is only a limited number\nof unified frameworks which output ready-to-manufacture parametric\nComputer-Aided Designs (CAD) of the optimal designs. From a generative design\nperspective, it is essential to have a single platform that outputs a\nstructurally optimized CAD model because CAD models are an integral part of\nmost industrial product development and manufacturing stages. This study\nfocuses on developing a novel unified workflow handling topology, layout and\nsize optimization in a single parametric platform, which subsequently outputs a\nready-to-manufacture CAD model. All such outputs are checked and validated for\nstructural requirements; strength, stiffness and stability in accordance with\nstandard codes of practice. In the proposed method, first, topology-optimal\nmodel is generated and converted to a one-pixel-wide chain model using\nskeletonization. Secondly, a spatial frame is extracted from the skeleton for\nits member size and layout optimization. Finally, the CAD model is generated\nusing constructive solid geometry trees and the structural integrity of each\nmember is assessed to ensure structural robustness prior to manufacturing.\nVarious examples presented in the paper showcase the validity of the proposed\nmethod across various engineering disciplines.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:54:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sarma","Lowhikan Sivanantha",""],["Mallikarachchi","Chinthaka",""],["Herath","Sumudu",""]]}
{"id":"2308.06735","submitter":"Shubo Liu","authors":"Shubo Liu and Hongsheng Zhang and Yuankai Qi and Peng Wang and Yaning\n  Zhang and Qi Wu","title":"AerialVLN: Vision-and-Language Navigation for UAVs","comments":"Accepted by ICCV 2023","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":"  Recently emerged Vision-and-Language Navigation (VLN) tasks have drawn\nsignificant attention in both computer vision and natural language processing\ncommunities. Existing VLN tasks are built for agents that navigate on the\nground, either indoors or outdoors. However, many tasks require intelligent\nagents to carry out in the sky, such as UAV-based goods delivery,\ntraffic/security patrol, and scenery tour, to name a few. Navigating in the sky\nis more complicated than on the ground because agents need to consider the\nflying height and more complex spatial relationship reasoning. To fill this gap\nand facilitate research in this field, we propose a new task named AerialVLN,\nwhich is UAV-based and towards outdoor environments. We develop a 3D simulator\nrendered by near-realistic pictures of 25 city-level scenarios. Our simulator\nsupports continuous navigation, environment extension and configuration. We\nalso proposed an extended baseline model based on the widely-used\ncross-modal-alignment (CMA) navigation methods. We find that there is still a\nsignificant gap between the baseline model and human performance, which\nsuggests AerialVLN is a new challenging task. Dataset and code is available at\nhttps://github.com/AirVLN/AirVLN.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:55:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Shubo",""],["Zhang","Hongsheng",""],["Qi","Yuankai",""],["Wang","Peng",""],["Zhang","Yaning",""],["Wu","Qi",""]]}
{"id":"2308.06736","submitter":"P{\\i}nar Kirezli","authors":"P{\\i}nar Kirezli","title":"Analyzes of Algebraic Classification of Higher Dimensional Kundt\n  Geometries with Large $D$ Method","comments":"Accepted for publication in Turkish Journal of Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, classification of higher dimensional Kundt geometry is\nrevisited as the dimension of the spacetime $D \\rightarrow\\infty$. In addition\nto previous studies, in order to Kundt geometry becomes algebraically special\nspacetime obligatory conditions are determined. Additionally, Type II, Type\nIII, Type N, Type O and Type D Kundt geometries are explicitly analyzed.\nClassification of several metrics such as pp-waves, non-gyratonic Kundt metric\nand VSI spacetime, which are well-known subclasses of Kundt geometry are\nstudied.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:58:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kirezli","P\u0131nar",""]]}
{"id":"2308.06737","submitter":"Gabdolla Akishev","authors":"G. Akishev","title":"On embedding theorems of spaces of functions with mixed logarithmic\n  smoothness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The article considers the Lorentz space $L_{p,\\tau}(\\mathbb{T}^{m})$, $2\\pi$\nof periodic functions of many variables and spaces with mixed logarithmic\nsmoothness. Equivalent norms of a space with mixed logarithmic smoothness are\nfound and embedding theorems are proved.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:02:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Akishev","G.",""]]}
{"id":"2308.06738","submitter":"SeungHyun Kim","authors":"SeungHyun Kim, Hyunsu Kim, EungGu Yun, Hwangrae Lee, Jaehun Lee, Juho\n  Lee","title":"Probabilistic Imputation for Time-series Classification with Missing\n  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":"  Multivariate time series data for real-world applications typically contain a\nsignificant amount of missing values. The dominant approach for classification\nwith such missing values is to impute them heuristically with specific values\n(zero, mean, values of adjacent time-steps) or learnable parameters. However,\nthese simple strategies do not take the data generative process into account,\nand more importantly, do not effectively capture the uncertainty in prediction\ndue to the multiple possibilities for the missing values. In this paper, we\npropose a novel probabilistic framework for classification with multivariate\ntime series data with missing values. Our model consists of two parts; a deep\ngenerative model for missing value imputation and a classifier. Extending the\nexisting deep generative models to better capture structures of time-series\ndata, our deep generative model part is trained to impute the missing values in\nmultiple plausible ways, effectively modeling the uncertainty of the\nimputation. The classifier part takes the time series data along with the\nimputed missing values and classifies signals, and is trained to capture the\npredictive uncertainty due to the multiple possibilities of imputations.\nImportantly, we show that na\\\"ively combining the generative model and the\nclassifier could result in trivial solutions where the generative model does\nnot produce meaningful imputations. To resolve this, we present a novel\nregularization technique that can promote the model to produce useful\nimputation values that help classification. Through extensive experiments on\nreal-world time series data with missing values, we demonstrate the\neffectiveness of our method.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:04:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kim","SeungHyun",""],["Kim","Hyunsu",""],["Yun","EungGu",""],["Lee","Hwangrae",""],["Lee","Jaehun",""],["Lee","Juho",""]]}
{"id":"2308.06739","submitter":"Junhao Zhang","authors":"David Junhao Zhang, Mutian Xu, Chuhui Xue, Wenqing Zhang, Xiaoguang\n  Han, Song Bai, Mike Zheng Shou","title":"Free-ATM: Exploring Unsupervised Learning on Diffusion-Generated Images\n  with Free Attention Masks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the rapid advancement of unsupervised learning in visual\nrepresentation, it requires training on large-scale datasets that demand costly\ndata collection, and pose additional challenges due to concerns regarding data\nprivacy. Recently, synthetic images generated by text-to-image diffusion\nmodels, have shown great potential for benefiting image recognition. Although\npromising, there has been inadequate exploration dedicated to unsupervised\nlearning on diffusion-generated images. To address this, we start by uncovering\nthat diffusion models' cross-attention layers inherently provide\nannotation-free attention masks aligned with corresponding text inputs on\ngenerated images. We then investigate the problems of three prevalent\nunsupervised learning techniques ( i.e., contrastive learning, masked modeling,\nand vision-language pretraining) and introduce customized solutions by fully\nexploiting the aforementioned free attention masks. Our approach is validated\nthrough extensive experiments that show consistent improvements in baseline\nmodels across various downstream tasks, including image classification,\ndetection, segmentation, and image-text retrieval. By utilizing our method, it\nis possible to close the performance gap between unsupervised pretraining on\nsynthetic data and real-world scenarios.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:07:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","David Junhao",""],["Xu","Mutian",""],["Xue","Chuhui",""],["Zhang","Wenqing",""],["Han","Xiaoguang",""],["Bai","Song",""],["Shou","Mike Zheng",""]]}
{"id":"2308.06740","submitter":"Wenwen Min","authors":"Wenwen Min, Taosheng Xu and Chris Ding","title":"Weighted Sparse Partial Least Squares for Joint Sample and Feature\n  Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sparse Partial Least Squares (sPLS) is a common dimensionality reduction\ntechnique for data fusion, which projects data samples from two views by\nseeking linear combinations with a small number of variables with the maximum\nvariance. However, sPLS extracts the combinations between two data sets with\nall data samples so that it cannot detect latent subsets of samples. To extend\nthe application of sPLS by identifying a specific subset of samples and remove\noutliers, we propose an $\\ell_\\infty/\\ell_0$-norm constrained weighted sparse\nPLS ($\\ell_\\infty/\\ell_0$-wsPLS) method for joint sample and feature selection,\nwhere the $\\ell_\\infty/\\ell_0$-norm constrains are used to select a subset of\nsamples. We prove that the $\\ell_\\infty/\\ell_0$-norm constrains have the\nKurdyka-\\L{ojasiewicz}~property so that a globally convergent algorithm is\ndeveloped to solve it. Moreover, multi-view data with a same set of samples can\nbe available in various real problems. To this end, we extend the\n$\\ell_\\infty/\\ell_0$-wsPLS model and propose two multi-view wsPLS models for\nmulti-view data fusion. We develop an efficient iterative algorithm for each\nmulti-view wsPLS model and show its convergence property. As well as numerical\nand biomedical data experiments demonstrate the efficiency of the proposed\nmethods.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:09:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Min","Wenwen",""],["Xu","Taosheng",""],["Ding","Chris",""]]}
{"id":"2308.06741","submitter":"Mansoor Rezghi","authors":"Mohammad Mehdi Nasiri, Mansoor Rezghi","title":"Heterogeneous Multi-Agent Reinforcement Learning via Mirror Descent\n  Policy Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an extension of the Mirror Descent method to overcome\nchallenges in cooperative Multi-Agent Reinforcement Learning (MARL) settings,\nwhere agents have varying abilities and individual policies. The proposed\nHeterogeneous-Agent Mirror Descent Policy Optimization (HAMDPO) algorithm\nutilizes the multi-agent advantage decomposition lemma to enable efficient\npolicy updates for each agent while ensuring overall performance improvements.\nBy iteratively updating agent policies through an approximate solution of the\ntrust-region problem, HAMDPO guarantees stability and improves performance.\nMoreover, the HAMDPO algorithm is capable of handling both continuous and\ndiscrete action spaces for heterogeneous agents in various MARL problems. We\nevaluate HAMDPO on Multi-Agent MuJoCo and StarCraftII tasks, demonstrating its\nsuperiority over state-of-the-art algorithms such as HATRPO and HAPPO. These\nresults suggest that HAMDPO is a promising approach for solving cooperative\nMARL problems and could potentially be extended to address other challenging\nproblems in the field of MARL.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:18:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nasiri","Mohammad Mehdi",""],["Rezghi","Mansoor",""]]}
{"id":"2308.06742","submitter":"Alberto Bertipaglia","authors":"Alberto Bertipaglia, Mohsen Alirezaei, Riender Happee, Barys Shyrokau","title":"Model Predictive Contouring Control for Vehicle Obstacle Avoidance at\n  the Limit of Handling","comments":"Accepted to the 28th IAVSD International Symposium on Dynamics of\n  Vehicles on Roads and Tracks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper proposes a non-linear Model Predictive Contouring Control (MPCC)\nfor obstacle avoidance in automated vehicles driven at the limit of handling.\nThe proposed controller integrates motion planning, path tracking and vehicle\nstability objectives, prioritising obstacle avoidance in emergencies. The\ncontroller's prediction model is a non-linear single-track vehicle model with\nthe Fiala tyre to capture the vehicle's non-linear behaviour. The MPCC computes\nthe optimal steering angle and brake torques to minimise tracking error in safe\nsituations and maximise the vehicle-to-obstacle distance in emergencies.\nFurthermore, the MPCC is extended with the tyre friction circle to fully\nexploit the vehicle's manoeuvrability and stability. The MPCC controller is\ntested using real-time rapid prototyping hardware to prove its real-time\ncapability. The performance is compared with a state-of-the-art Model\nPredictive Control (MPC) in a high-fidelity simulation environment. The double\nlane change scenario results demonstrate a significant improvement in\nsuccessfully avoiding obstacles and maintaining vehicle stability.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:23:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bertipaglia","Alberto",""],["Alirezaei","Mohsen",""],["Happee","Riender",""],["Shyrokau","Barys",""]]}
{"id":"2308.06743","submitter":"Baolin Liu","authors":"Baolin Liu and Zongyuan Yang and Pengfei Wang and Junjie Zhou and Ziqi\n  Liu and Ziyi Song and Yan Liu and Yongping Xiong","title":"TextDiff: Mask-Guided Residual Diffusion Models for Scene Text Image\n  Super-Resolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of scene text image super-resolution is to reconstruct\nhigh-resolution text-line images from unrecognizable low-resolution inputs. The\nexisting methods relying on the optimization of pixel-level loss tend to yield\ntext edges that exhibit a notable degree of blurring, thereby exerting a\nsubstantial impact on both the readability and recognizability of the text. To\naddress these issues, we propose TextDiff, the first diffusion-based framework\ntailored for scene text image super-resolution. It contains two modules: the\nText Enhancement Module (TEM) and the Mask-Guided Residual Diffusion Module\n(MRD). The TEM generates an initial deblurred text image and a mask that\nencodes the spatial location of the text. The MRD is responsible for\neffectively sharpening the text edge by modeling the residuals between the\nground-truth images and the initial deblurred images. Extensive experiments\ndemonstrate that our TextDiff achieves state-of-the-art (SOTA) performance on\npublic benchmark datasets and can improve the readability of scene text images.\nMoreover, our proposed MRD module is plug-and-play that effectively sharpens\nthe text edges produced by SOTA methods. This enhancement not only improves the\nreadability and recognizability of the results generated by SOTA methods but\nalso does not require any additional joint training. Available\nCodes:https://github.com/Lenubolim/TextDiff.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:02:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Baolin",""],["Yang","Zongyuan",""],["Wang","Pengfei",""],["Zhou","Junjie",""],["Liu","Ziqi",""],["Song","Ziyi",""],["Liu","Yan",""],["Xiong","Yongping",""]]}
{"id":"2308.06744","submitter":"Jungwook Choi","authors":"Minsoo Kim, Sihwa Lee, Janghwan Lee, Sukjin Hong, Du-Seong Chang,\n  Wonyong Sung, Jungwook Choi","title":"Token-Scaled Logit Distillation for Ternary Weight Generative Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative Language Models (GLMs) have shown impressive performance in tasks\nsuch as text generation, understanding, and reasoning. However, the large model\nsize poses challenges for practical deployment. To solve this problem,\nQuantization-Aware Training (QAT) has become increasingly popular. However,\ncurrent QAT methods for generative models have resulted in a noticeable loss of\naccuracy. To counteract this issue, we propose a novel knowledge distillation\nmethod specifically designed for GLMs. Our method, called token-scaled logit\ndistillation, prevents overfitting and provides superior learning from the\nteacher model and ground truth. This research marks the first evaluation of\nternary weight quantization-aware training of large-scale GLMs with less than\n1.0 degradation in perplexity and no loss of accuracy in a reasoning task.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:07:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kim","Minsoo",""],["Lee","Sihwa",""],["Lee","Janghwan",""],["Hong","Sukjin",""],["Chang","Du-Seong",""],["Sung","Wonyong",""],["Choi","Jungwook",""]]}
{"id":"2308.06745","submitter":"Cristina Costantini","authors":"Cristina Costantini","title":"Existence and uniqueness of obliquely reflecting Brownian motion in\n  nonpolyhedral, piecewise smooth cones, with an example of application to\n  diffusion approximation of bandwidth sharing queues","comments":"arXiv admin note: text overlap with arXiv:2106.07208","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The paper considers the stochastic differential equation with reflection that\ndefines a semimartingale Brownian motion in a nonpolyhedral, piecewise smooth\ncone, with radially constant direction of reflection on each face. Existence\nand uniqueness in distribution of the solution are proved, under suitable\nassumptions. The assumptions are shown to be verified by the stochastic\ndifferential equation with reflection satisfied by the conjectured limit, under\ndiffusive space-time scaling, of the workload process in an example of\nstochastic network operating under a 2-fair bandwidth sharing policy, thus\nensuring that the conjectured limit is uniquely characterized. This is a key\nstep in proving diffusion approximation for the network.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:16:07 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 17:35:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Costantini","Cristina",""]]}
{"id":"2308.06746","submitter":"YuTing Zhu","authors":"Yuting Zhu and Qiang He and Yudong Yao and Yueyang Teng","title":"Self-supervised Noise2noise Method Utilizing Corrupted Images with a\n  Modular Network for LDCT Denoising","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":"  Deep learning is a very promising technique for low-dose computed tomography\n(LDCT) image denoising. However, traditional deep learning methods require\npaired noisy and clean datasets, which are often difficult to obtain. This\npaper proposes a new method for performing LDCT image denoising with only LDCT\ndata, which means that normal-dose CT (NDCT) is not needed. We adopt a\ncombination including the self-supervised noise2noise model and the\nnoisy-as-clean strategy. First, we add a second yet similar type of noise to\nLDCT images multiple times. Note that we use LDCT images based on the\nnoisy-as-clean strategy for corruption instead of NDCT images. Then, the\nnoise2noise model is executed with only the secondary corrupted images for\ntraining. We select a modular U-Net structure from several candidates with\nshared parameters to perform the task, which increases the receptive field\nwithout increasing the parameter size. The experimental results obtained on the\nMayo LDCT dataset show the effectiveness of the proposed method compared with\nthat of state-of-the-art deep learning methods. The developed code is available\nat https://github.com/XYuan01/Self-supervised-Noise2Noise-for-LDCT.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:26:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Yuting",""],["He","Qiang",""],["Yao","Yudong",""],["Teng","Yueyang",""]]}
{"id":"2308.06747","submitter":"Moti Fridman","authors":"Elad Schniderman, Yahav Avraham, Shir Shahal, Hamootal Duadi, Nir\n  Davidson, Moti Fridman","title":"How synchronized human networks escape local minima","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding the global minimum in complex networks while avoiding local minima is\nchallenging in many types of networks. We study the dynamics of complex human\nnetworks and observed that humans have different methods to avoid local minima\nthan other networks. Humans can change the coupling strength between them or\nchange their tempo. This leads to different dynamics than other networks and\nmakes human networks more robust and better resilient against perturbations. We\nobserved high-order vortex states, oscillation death, and amplitude death, due\nto the unique dynamics of the network. This research may have implications in\npolitics, economics, pandemic control, decision-making, and predicting the\ndynamics of networks with artificial intelligence.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:46:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Schniderman","Elad",""],["Avraham","Yahav",""],["Shahal","Shir",""],["Duadi","Hamootal",""],["Davidson","Nir",""],["Fridman","Moti",""]]}
{"id":"2308.06748","submitter":"Jianfei Hu","authors":"Hanxi Li, Jianfei Hu, Bo Li, Hao Chen, Yongbin Zheng, Chunhua Shen","title":"Target before Shooting: Accurate Anomaly Detection and Localization\n  under One Millisecond via Cascade Patch Retrieval","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":"  In this work, by re-examining the \"matching\" nature of Anomaly Detection\n(AD), we propose a new AD framework that simultaneously enjoys new records of\nAD accuracy and dramatically high running speed. In this framework, the anomaly\ndetection problem is solved via a cascade patch retrieval procedure that\nretrieves the nearest neighbors for each test image patch in a coarse-to-fine\nfashion. Given a test sample, the top-K most similar training images are first\nselected based on a robust histogram matching process. Secondly, the nearest\nneighbor of each test patch is retrieved over the similar geometrical locations\non those \"global nearest neighbors\", by using a carefully trained local metric.\nFinally, the anomaly score of each test image patch is calculated based on the\ndistance to its \"local nearest neighbor\" and the \"non-background\" probability.\nThe proposed method is termed \"Cascade Patch Retrieval\" (CPR) in this work.\nDifferent from the conventional patch-matching-based AD algorithms, CPR selects\nproper \"targets\" (reference images and locations) before \"shooting\"\n(patch-matching). On the well-acknowledged MVTec AD, BTAD and MVTec-3D AD\ndatasets, the proposed algorithm consistently outperforms all the comparing\nSOTA methods by remarkable margins, measured by various AD metrics.\nFurthermore, CPR is extremely efficient. It runs at the speed of 113 FPS with\nthe standard setting while its simplified version only requires less than 1 ms\nto process an image at the cost of a trivial accuracy drop. The code of CPR is\navailable at https://github.com/flyinghu123/CPR.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:49:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Hanxi",""],["Hu","Jianfei",""],["Li","Bo",""],["Chen","Hao",""],["Zheng","Yongbin",""],["Shen","Chunhua",""]]}
{"id":"2308.06749","submitter":"Wenhao Li","authors":"Wenhao Li, Guangyang Wu, Wenyi Wang, Peiran Ren and Xiaohong Liu","title":"FastLLVE: Real-Time Low-Light Video Enhancement with Intensity-Aware\n  Lookup Table","comments":"11pages, 9 Figures, and 6 Tables. Accepted by ACMMM 2023","journal-ref":null,"doi":"10.1145/3581783.3611933","report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Low-Light Video Enhancement (LLVE) has received considerable attention in\nrecent years. One of the critical requirements of LLVE is inter-frame\nbrightness consistency, which is essential for maintaining the temporal\ncoherence of the enhanced video. However, most existing single-image-based\nmethods fail to address this issue, resulting in flickering effect that\ndegrades the overall quality after enhancement. Moreover, 3D Convolution Neural\nNetwork (CNN)-based methods, which are designed for video to maintain\ninter-frame consistency, are computationally expensive, making them impractical\nfor real-time applications. To address these issues, we propose an efficient\npipeline named FastLLVE that leverages the Look-Up-Table (LUT) technique to\nmaintain inter-frame brightness consistency effectively. Specifically, we\ndesign a learnable Intensity-Aware LUT (IA-LUT) module for adaptive\nenhancement, which addresses the low-dynamic problem in low-light scenarios.\nThis enables FastLLVE to perform low-latency and low-complexity enhancement\noperations while maintaining high-quality results. Experimental results on\nbenchmark datasets demonstrate that our method achieves the State-Of-The-Art\n(SOTA) performance in terms of both image quality and inter-frame brightness\nconsistency. More importantly, our FastLLVE can process 1,080p videos at\n$\\mathit{50+}$ Frames Per Second (FPS), which is $\\mathit{2 \\times}$ faster\nthan SOTA CNN-based methods in inference time, making it a promising solution\nfor real-time applications. The code is available at\nhttps://github.com/Wenhao-Li-777/FastLLVE.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:54:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Wenhao",""],["Wu","Guangyang",""],["Wang","Wenyi",""],["Ren","Peiran",""],["Liu","Xiaohong",""]]}
{"id":"2308.06750","submitter":"Yan Jiang","authors":"Yan Jiang, Jiang-Tao Li, Yu Gao, Joel N. Bregman, Li Ji, Xuejian\n  Jiang, Qinghua Tan, Jianfa Wang, Q. Daniel Wang, Yang Yang","title":"CO-CHANGES I: IRAM 30m CO Observations of Molecular Gas in the Sombrero\n  Galaxy","comments":"21 pages, 13 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Molecular gas plays a critical role in explaining the quiescence of star\nformation (SF) in massive isolated spiral galaxies, which could be a result of\neither the low molecular gas content and/or the low SF efficiency. We present\nIRAM 30m observations of the CO lines in the Sombrero galaxy (NGC~4594), the\nmost massive spiral at $d\\lesssim30\\rm~Mpc$. We detect at least one of the\nthree CO lines covered by our observations in all 13 observed positions located\nat the galactic nucleus and along a $\\sim25\\rm~kpc$-diameter dusty ring. The\ntotal extrapolated molecular gas mass of the galaxy is $M_{\\rm\nH_2}\\approx4\\times10^{8}\\rm~M_\\odot$. The measured maximum CO gas rotation\nvelocity of $\\approx379\\rm~km~s^{-1}$ suggests that NGC~4594 locates in a dark\nmatter halo with a mass $M_{\\rm200}\\gtrsim10^{13}\\rm~M_\\odot$. Comparing to\nother galaxy samples, NGC~4594 is extremely gas poor and SF inactive, but the\nSF efficiency is apparently not inconsistent with that predicted by the\nKennicutt-Schmidt law, so there is no evidence of enhanced SF quenching in this\nextremely massive spiral with a huge bulge. We also calculate the predicted gas\nsupply rate from various sources to replenish the cold gas consumed in SF, and\nfind that the galaxy must experienced a starburst stage at high redshift, then\nthe leftover or recycled gas provides SF fuels to maintain the gradual growth\nof the galactic disk at a gentle rate.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 11:55:55 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 02:10:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jiang","Yan",""],["Li","Jiang-Tao",""],["Gao","Yu",""],["Bregman","Joel N.",""],["Ji","Li",""],["Jiang","Xuejian",""],["Tan","Qinghua",""],["Wang","Jianfa",""],["Wang","Q. Daniel",""],["Yang","Yang",""]]}
{"id":"2308.06751","submitter":"Alexandru Chirv\\u{a}situ L.","authors":"Alexandru Chirvasitu","title":"Compactified symplectic leaves in bundle moduli spaces","comments":"32 pages + references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathcal{E}$ be a rank-2 vector bundle over an elliptic curve $E$,\ndecomposable as a sum of line bundles of degrees $d'>d\\ge 2$, and $\\mathcal{L}$\nthe determinant of $\\mathcal{E}$. The subspace $L(\\mathcal{E})\\subset\n\\mathbb{P}^{n-1}\\cong \\mathbb{P}\\mathrm{Ext}^1(\\mathcal{L},\\mathcal{O}_E)$\nconsisting of classes of extensions with middle term isomorphic to\n$\\mathcal{E}$ is one of the symplectic leaves of a remarkable Poisson structure\non $\\mathbb{P}^{n-1}$ defined by Feigin-Odesskii/Polishchuk, and all symplectic\nleaves arise in this manner, as shown in earlier work that realizes\n$L(\\mathcal{E})$ as the base space of a principal\n$\\mathrm{Aut}(\\mathcal{E})$-fibration.\n  Here, we embed $L(\\mathcal{E})$ into a larger, projective base space\n$\\widetilde{L}(\\mathcal{E})$ of a principal\n$\\mathrm{Aut}(\\mathcal{E})$-fibration whose total space consists of sections of\n$\\mathcal{E}$. The embedding realizes $L(\\mathcal{E})\\subset\n\\widetilde{L}(\\mathcal{E})$ as a complement of an anticanonical divisor $Y$\n(one of the main results), and we give an explicit description of the\nnormalization of $Y$ as a projective-space bundle over a projective space. For\n$d=2$ $\\widetilde{L}(\\mathcal{E})$ is one of the three Hirzebruch surfaces\n$\\Sigma_i$, $i=0,1,2$; we determine which occurs when and hence also the cases\nwhen $L(\\mathcal{E})$ is affine.\n  Separately, we prove that for $d<\\frac n2$ the singular locus of the secant\nslice $\\mathrm{Sec}_{d,z}(E)\\subset \\mathbb{P}^{n-1}$, the portion of the\n$d^{th}$ secant variety of $E$ consisting of points lying on spans of\n$d$-tuples with sum $z\\in E$, is precisely $\\mathrm{Sec}_{d-2}$. This\nstrengthens result that $L(\\mathcal{E})$ is smooth, appearing in prior joint\nwork with R. Kanda and S.P. Smith.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:01:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chirvasitu","Alexandru",""]]}
{"id":"2308.06752","submitter":"Yuki Uematsu Dr.","authors":"Haruto Iwasaki, Yasuyuki Kimura, and Yuki Uematsu","title":"Ubiquitous preferential water adsorption to electrodes in\n  water/1-propanol mixtures detected by electrochemical impedance spectroscopy","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The electric double layer is an important structure that appears at charged\nliquid interfaces, and it determines the performance of various electrochemical\ndevices such as supercapacitors and electrokinetic energy converters. Here the\ndouble-layer capacitance of the interface between aluminum electrodes and\nwater/1-propanol electrolyte solutions is investigated using electrochemical\nimpedance spectroscopy. The double-layer capacitances of mixture solvents are\nalmost the same as those of water-only electrolyte solutions, and the\ndouble-layer capacitance of 1-propanol-only solutions are significantly smaller\nthan those of other volume fractions of water. The qualitative variation of the\ndouble-layer capacitances with the water volume fraction is independent of the\nelectrolyte types and their concentrations. Therefore, these results can be\nexplained by ubiquitous preferential water adsorption caused by the\nhydrophilicity of the electrode surface.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:03:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Iwasaki","Haruto",""],["Kimura","Yasuyuki",""],["Uematsu","Yuki",""]]}
{"id":"2308.06753","submitter":"Ji Li","authors":"Yanping Chen, Zhenbing Gong, Ji Li, Edward McDonald and Dmitriy Zanin","title":"Calder\\'on's commutator on Stratified Lie groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the recent work of Gimperlein and Goffeng on Calder\\'on's\ncommutator on compact Heisenberg type manifolds and the related weak Schatten\nclass estimates, we establish the characterisation of $L^p$ boundedness for\nCalderon's commutator on stratified Lie groups. We further study the related\nweak Schatten class estimates on two step stratified Lie groups, which include\nthe Heisenberg groups.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:05:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Yanping",""],["Gong","Zhenbing",""],["Li","Ji",""],["McDonald","Edward",""],["Zanin","Dmitriy",""]]}
{"id":"2308.06754","submitter":"Srirang Manohar","authors":"M. Dantuma, F. Lucka, S. C. Kruitwagen, A. Javaherian, L. Alink, R. P.\n  Pompe van Meerdervoort, M. Nanninga, T.J.P.M. Op 't Root, B. De Santi, J.\n  Budisky, G. Bordovsky, E. Coffy, M. Wilm, T. Kasponas, S.H. Aarnink, L. F. de\n  Geus-Oei, F. Brochin, T. Martinez, A. Michailovas, W. Muller Kobold, J.\n  Jaros, J. Veltman, B. Cox, and S. Manohar","title":"Fully three-dimensional sound speed-corrected multi-wavelength\n  photoacoustic breast tomography","comments":"33 pages Main Body, 9 pages Supplementary Material","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Photoacoustic tomography is a contrast agent-free imaging technique capable\nof visualizing blood vessels and tumor-associated vascularization in breast\ntissue. While sophisticated breast imaging systems have been recently\ndeveloped, there is yet much to be gained in imaging depth, image quality and\ntissue characterization capability before clinical translation is possible. In\nresponse, we have developed a hybrid photoacoustic and ultrasound-transmission\ntomographic system PAM3. The photoacoustic component has for the first time\nthree-dimensional multi-wavelength imaging capability, and implements\nsubstantial technical advancements in critical hardware and software\nsub-systems. The ultrasound component enables for the first time, a\nthree-dimensional sound speed map of the breast to be incorporated in\nphotoacoustic reconstruction to correct for inhomogeneities, enabling accurate\ntarget recovery. The results demonstrate the deepest photoacoustic breast\nimaging to date namely 48 mm, with a more uniform field of view than hitherto,\nand an isotropic spatial resolution that rivals that of Magnetic Resonance\nImaging. The in vivo performance achieved, and the diagnostic value of\ninterrogating angiogenesis-driven optical contrast as well as tumor mass sound\nspeed contrast, gives confidence in the system's clinical potential.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:10:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dantuma","M.",""],["Lucka","F.",""],["Kruitwagen","S. C.",""],["Javaherian","A.",""],["Alink","L.",""],["van Meerdervoort","R. P. Pompe",""],["Nanninga","M.",""],["Root","T. J. P. M. Op 't",""],["De Santi","B.",""],["Budisky","J.",""],["Bordovsky","G.",""],["Coffy","E.",""],["Wilm","M.",""],["Kasponas","T.",""],["Aarnink","S. H.",""],["de Geus-Oei","L. F.",""],["Brochin","F.",""],["Martinez","T.",""],["Michailovas","A.",""],["Kobold","W. Muller",""],["Jaros","J.",""],["Veltman","J.",""],["Cox","B.",""],["Manohar","S.",""]]}
{"id":"2308.06755","submitter":"Hongrong Cheng","authors":"Hongrong Cheng, Miao Zhang, Javen Qinfeng Shi","title":"Influence Function Based Second-Order Channel Pruning-Evaluating True\n  Loss Changes For Pruning Is Possible Without Retraining","comments":"chrome-extension://ogjibjphoadhljaoicdnjnmgokohngcc/assets/icon-50207e67.png","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A challenge of channel pruning is designing efficient and effective criteria\nto select channels to prune. A widely used criterion is minimal performance\ndegeneration. To accurately evaluate the truth performance degeneration\nrequires retraining the survived weights to convergence, which is prohibitively\nslow. Hence existing pruning methods use previous weights (without retraining)\nto evaluate the performance degeneration. However, we observe the loss changes\ndiffer significantly with and without retraining. It motivates us to develop a\ntechnique to evaluate true loss changes without retraining, with which channels\nto prune can be selected more reliably and confidently. We first derive a\nclosed-form estimator of the true loss change per pruning mask change, using\ninfluence functions without retraining. Influence function which is from robust\nstatistics reveals the impacts of a training sample on the model's prediction\nand is repurposed by us to assess impacts on true loss changes. We then show\nhow to assess the importance of all channels simultaneously and develop a novel\nglobal channel pruning algorithm accordingly. We conduct extensive experiments\nto verify the effectiveness of the proposed algorithm. To the best of our\nknowledge, we are the first that shows evaluating true loss changes for pruning\nwithout retraining is possible. This finding will open up opportunities for a\nseries of new paradigms to emerge that differ from existing pruning methods.\nThe code is available at https://github.com/hrcheng1066/IFSO.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:23:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheng","Hongrong",""],["Zhang","Miao",""],["Shi","Javen Qinfeng",""]]}
{"id":"2308.06756","submitter":"Bangti Jin","authors":"Bangti Jin, Jing Li, Yifeng Xu, Shengfeng Zhu","title":"An Adaptive Phase-Field Method for Structural Topology Optimization","comments":"30 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we develop an adaptive algorithm for the efficient numerical\nsolution of the minimum compliance problem in topology optimization. The\nalgorithm employs the phase field approximation and continuous density field.\nThe adaptive procedure is driven by two residual type a posteriori error\nestimators, one for the state variable and the other for the objective\nfunctional. The adaptive algorithm is provably convergent in the sense that the\nsequence of numerical approximations generated by the adaptive algorithm\ncontains a subsequence convergent to a solution of the continuous first-order\noptimality system. We provide several numerical simulations to show the\ndistinct features of the algorithm.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:28:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jin","Bangti",""],["Li","Jing",""],["Xu","Yifeng",""],["Zhu","Shengfeng",""]]}
{"id":"2308.06757","submitter":"Itay Mangel","authors":"Itay Mangel and Amit Keren","title":"The Ground-state Inter-plane Superconducting Coherence Length of\n  La$_{1.875}$Sr$_{0.125}$CuO$_4$ Measured by a \"Xiometer\"","comments":"6 pages with 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con physics.ins-det","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A long excitation coil piercing a superconducting (SC) ring is used to\ngenerate ever increasing persistent current in the ring, until the current\ndestroys the order parameter. Given that the penetration depth $\\lambda$ is\nknown, this experiment measures, hypothetically, the coherence length $\\xi$,\nhence the name \"Xiometer\". We examine various aspects of this theoretically\ndriven hypothesis by testing niobium rings with different dimensions, and by\ncomparing the results to the known values of $\\xi$. We then apply the method to\ntwo La$_{1.875}$Sr$_{0.125}$CuO$_4$ rings at $T \\rightarrow 0$. In one, the\ncurrent flows in the CuO$_2$ planes hence it is set by $\\xi_{ab}$. In the\nother, the current must cross planes and is determined by $\\xi_{c}$. We find\nthat $\\xi_{c}=1.3 \\pm 0.1$~nm, and $\\xi_{ab}<2.3~$nm indicating that at low\ntemperatures the Cooper pairs are three dimensional.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:34:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mangel","Itay",""],["Keren","Amit",""]]}
{"id":"2308.06758","submitter":"Lorenzo Amato","authors":"Lorenzo Amato, Markus M\\\"uller","title":"Ultrafast light-induced long range antiferromagnetic correlations in\n  paramagnets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose and analyze a laser-driven protocol to generate long-range ordered\npatterns in paramagnets, based on non-adiabatically driven aggregation\ndynamics. We derive the optimal driving parameters that maximize, respectively,\nthe correlation length or the size of defect-free antiferromagnetic clusters in\na one-dimensional chain. We show that one can reach correlation lengths that\nare exponentially larger than those achieved by adiabatic pumping schemes. The\nresonantly driven dynamics of cluster fronts is shown to map to an exactly\nsolvable model of free fermions.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:40:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Amato","Lorenzo",""],["M\u00fcller","Markus",""]]}
{"id":"2308.06759","submitter":"Riccardo Campana","authors":"R. Campana, C. Evola, C. Labanti, L. Ferro, M. Moita, E. Virgilli, E.\n  J. Marchesini, F. Frontera, P. Rosati","title":"Measurement of the non-linearity in the gamma-ray response of the\n  GAGG:Ce inorganic scintillator","comments":"22 pages, 11 figures. Accepted for publication in NIM A","journal-ref":"Nuclear Inst. and Methods in Physics Research, A 1056 (2023)\n  168587","doi":"10.1016/j.nima.2023.168587","report-no":null,"categories":"physics.ins-det astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A characteristic of every inorganic scintillator crystal is its light yield,\ni.e., the amount of emitted scintillation photons per unit of energy deposited\nin the crystal. Light yield is known to be usually non-linear with energy,\nwhich impacts the spectroscopic properties of the scintillator. Cerium-doped\ngadolinium-aluminium-gallium garnet (GAGG:Ce) is a recently developed\nscintillator with several interesting properties, which make it very promising\nfor space-based gamma-ray detectors, such as in the HERMES nanosatellite\nmission. In this paper we report an accurate measurement of the GAGG:Ce\nnon-linearity in the 20-662 keV gamma-ray energy interval, using a setup\ncomposed of three samples of GAGG:Ce crystals read out by Silicon Drift\nDetectors (SDDs).\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:41:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Campana","R.",""],["Evola","C.",""],["Labanti","C.",""],["Ferro","L.",""],["Moita","M.",""],["Virgilli","E.",""],["Marchesini","E. J.",""],["Frontera","F.",""],["Rosati","P.",""]]}
{"id":"2308.06760","submitter":"Hyeongock Yun","authors":"Hyeongock Yun, Sungsik Noh, Sanghoon Lim, Taesoo Song, Juhee Hong,\n  Aaron Park, Su Houng Lee, Benjamin D\\\"onigus","title":"Diquarks and the production of charmed baryons","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Utilizing a quark model characterized by parameters that effectively\nreplicate the masses of ground state hadrons, we illustrate that $(us)$ or\n$(ds)$ diquarks exhibit greater compactness in comparison to $(ud)$ diquarks.\nConcretely, the binding energy of the $(us)$ diquark - defined as the diquark's\nmass minus the combined masses of its individual quarks - is found to be more\nattractive than that of the $(ud)$ diquark. This heightened attraction present\nin $(us)$ diquarks could lead to enhanced production of $\\Xi_c/D$ particles in\nhigh-energy pp or ultrarelativistic heavy-ion collisions.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:44:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yun","Hyeongock",""],["Noh","Sungsik",""],["Lim","Sanghoon",""],["Song","Taesoo",""],["Hong","Juhee",""],["Park","Aaron",""],["Lee","Su Houng",""],["D\u00f6nigus","Benjamin",""]]}
{"id":"2308.06761","submitter":"Moh. Adhib Ulil Absor","authors":"Arif Lukmantoro and Moh. Adhib Ulil Absor","title":"Anisotropic Rashba splitting dominated by out-of-plane spin polarization\n  in two-dimensional Janus $XA_{2}Y$ ($A$= Si, Sn, Ge; $X,Y$= Sb, Bi) with\n  surface imperfection","comments":"5 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The anisotropic Rashba effect allows for the manipulation of electron spins\nin a more precise and tunable manner since the magnitude of the Rashba\nsplitting and orientation of the spin textures can be simply controlled by\ntuning the direction of the externally applied electric field. Herein, we\npredict the emergence of the anisotropic Rashba effect in the two-dimensional\n(2D) Janus $XA_{2}Y$ constructed from the group IV ($A$= Si, Sn, Ge) and group\nV ($X,Y$ = Sb, Bi) elements having trigonal prismatic structures but lacking\nin-plane mirror symmetry. Due to the lowering point group symmetry of the\ncrystal, the Rashba spin splitting is enforced to becomes anisotropic around\ncertain high symmetry points in the Brillouin zone and preserves the\nout-of-plane spin textures. We illustrate this behavior using density\nfunctional theory calculations supplemented with $\\vec{k}\\cdot\\vec{p}$ analysis\non the Janus SbSi$_{2}$Bi monolayer as a representative example. Specifically,\nwe observed large and anisotropic Rashba splitting with prominence contribution\nof the out-of-plane spin textures in the conduction band minimum around the $M$\npoint and valence band maximum around the $\\Gamma$ point. More importantly, the\nanisotropic spin splitting and out-of-plane spin polarization are sensitively\naffected by surface imperfections, depending on the concentration and\nconfiguration of the $X$ and $Y$ elements in the 2D Janus $XA_{2}Y$ surface.\nOur study offer the possibility to realize the present systems for spintronics\napplications.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:45:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lukmantoro","Arif",""],["Absor","Moh. Adhib Ulil",""]]}
{"id":"2308.06762","submitter":"Huang Shijie","authors":"Shijie Huang, Xukun Zhang, Zhiming Cui, He Zhang, Geng Chen, Dinggang\n  Shen","title":"Tissue Segmentation of Thick-Slice Fetal Brain MR Scans with Guidance\n  from High-Quality Isotropic Volumes","comments":"10 pages, 9 figures, 5 tables, Fetal MRI, Brain tissue segmentation,\n  Unsupervised domain adaptation, Cycle-consistency","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate tissue segmentation of thick-slice fetal brain magnetic resonance\n(MR) scans is crucial for both reconstruction of isotropic brain MR volumes and\nthe quantification of fetal brain development. However, this task is\nchallenging due to the use of thick-slice scans in clinically-acquired fetal\nbrain data. To address this issue, we propose to leverage high-quality\nisotropic fetal brain MR volumes (and also their corresponding annotations) as\nguidance for segmentation of thick-slice scans. Due to existence of significant\ndomain gap between high-quality isotropic volume (i.e., source data) and\nthick-slice scans (i.e., target data), we employ a domain adaptation technique\nto achieve the associated knowledge transfer (from high-quality <source>\nvolumes to thick-slice <target> scans). Specifically, we first register the\navailable high-quality isotropic fetal brain MR volumes across different\ngestational weeks to construct longitudinally-complete source data. To capture\ndomain-invariant information, we then perform Fourier decomposition to extract\nimage content and style codes. Finally, we propose a novel Cycle-Consistent\nDomain Adaptation Network (C2DA-Net) to efficiently transfer the knowledge\nlearned from high-quality isotropic volumes for accurate tissue segmentation of\nthick-slice scans. Our C2DA-Net can fully utilize a small set of annotated\nisotropic volumes to guide tissue segmentation on unannotated thick-slice\nscans. Extensive experiments on a large-scale dataset of 372 clinically\nacquired thick-slice MR scans demonstrate that our C2DA-Net achieves much\nbetter performance than cutting-edge methods quantitatively and qualitatively.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 12:51:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Shijie",""],["Zhang","Xukun",""],["Cui","Zhiming",""],["Zhang","He",""],["Chen","Geng",""],["Shen","Dinggang",""]]}
{"id":"2308.06763","submitter":"Mohammad Dehghani","authors":"Mohammad Dehghani, Zahra Yazdanparast, Mobin Mohammadi","title":"Discovering the Symptom Patterns of COVID-19 from Recovered and Deceased\n  Patients Using Apriori Association Rule Mining","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The COVID-19 pandemic has a devastating impact globally, claiming millions of\nlives and causing significant social and economic disruptions. In order to\noptimize decision-making and allocate limited resources, it is essential to\nidentify COVID-19 symptoms and determine the severity of each case. Machine\nlearning algorithms offer a potent tool in the medical field, particularly in\nmining clinical datasets for useful information and guiding scientific\ndecisions. Association rule mining is a machine learning technique for\nextracting hidden patterns from data. This paper presents an application of\nassociation rule mining based Apriori algorithm to discover symptom patterns\nfrom COVID-19 patients. The study, using 2875 records of patient, identified\nthe most common symptoms as apnea (72%), cough (64%), fever (59%), weakness\n(18%), myalgia (14.5%), and sore throat (12%). The proposed method provides\nclinicians with valuable insight into disease that can assist them in managing\nand treating it effectively.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:00:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dehghani","Mohammad",""],["Yazdanparast","Zahra",""],["Mohammadi","Mobin",""]]}
{"id":"2308.06764","submitter":"Jinghua Zhang","authors":"Jinghua Zhang and Li Liu and Olli Silven and Matti Pietik\\\"ainen and\n  Dewen Hu","title":"Few-shot Class-incremental Learning: 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":"  Few-shot Class-Incremental Learning (FSCIL) presents a unique challenge in\nmachine learning, as it necessitates the continuous learning of new classes\nfrom sparse labeled training samples without forgetting previous knowledge.\nWhile this field has seen recent progress, it remains an active area of\nexploration. This paper aims to provide a comprehensive and systematic review\nof FSCIL. In our in-depth examination, we delve into various facets of FSCIL,\nencompassing the problem definition, the discussion of primary challenges of\nunreliable empirical risk minimization and the stability-plasticity dilemma,\ngeneral schemes, and relevant problems of incremental learning and few-shot\nlearning. Besides, we offer an overview of benchmark datasets and evaluation\nmetrics. Furthermore, we introduce the classification methods in FSCIL from\ndata-based, structure-based, and optimization-based approaches and the object\ndetection methods in FSCIL from anchor-free and anchor-based approaches. Beyond\nthese, we illuminate several promising research directions within FSCIL that\nmerit further investigation.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:01:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Jinghua",""],["Liu","Li",""],["Silven","Olli",""],["Pietik\u00e4inen","Matti",""],["Hu","Dewen",""]]}
{"id":"2308.06765","submitter":"Ali Shahidikia","authors":"Ali Shahidikia","title":"Strongly primeness of skew Hurwitz polynomial rings","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a ring R and an endomorphism {\\alpha} of R, we characterize the left and\nright strongly primeness of skew Hurwitz polynomial ring (hR, {\\alpha}).\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:11:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shahidikia","Ali",""]]}
{"id":"2308.06766","submitter":"Eugene Kanzieper","authors":"Peng Tian, Roman Riser and Eugene Kanzieper","title":"Statistics of local level spacings in quantum chaology","comments":"Main text: 7 pages, 1 figure and 3 tables. Supplemental material: 8\n  pages and 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.dis-nn hep-th math.MP nlin.SI quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a notion of local level spacings and study their statistics\nwithin a random-matrix-theory approach. In the limit of infinite-dimensional\nrandom matrices, we identify the two universal classes of local spacings\ndistributions which describe unfolded spectra of quantum systems with fully\nchaotic and completely integrable classical dynamics, respectively. We further\nargue, and explicitly demonstrate by exact diagonalisation of the\nSachdev-Ye-Kitaev (SYK) Hamitonians, that the ratios of averaged local spacings\ncomputed for raw spectra maintain their universality thus offering a framework\nto monitor spectral statistics in quantum many-body systems.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:30:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tian","Peng",""],["Riser","Roman",""],["Kanzieper","Eugene",""]]}
{"id":"2308.06767","submitter":"Hongrong Cheng","authors":"Hongrong Cheng, Miao Zhang, Javen Qinfeng Shi","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis,\n  and Recommendations","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":"  Modern deep neural networks, particularly recent large language models, come\nwith massive model sizes that require significant computational and storage\nresources. To enable the deployment of modern models on resource-constrained\nenvironments and accelerate inference time, researchers have increasingly\nexplored pruning techniques as a popular research direction in neural network\ncompression. However, there is a dearth of up-to-date comprehensive review\npapers on pruning. To address this issue, in this survey, we provide a\ncomprehensive review of existing research works on deep neural network pruning\nin a taxonomy of 1) universal/specific speedup, 2) when to prune, 3) how to\nprune, and 4) fusion of pruning and other compression techniques. We then\nprovide a thorough comparative analysis of seven pairs of contrast settings for\npruning (e.g., unstructured/structured) and explore emerging topics, including\npost-training pruning, different levels of supervision for pruning, and broader\napplications (e.g., adversarial robustness) to shed light on the commonalities\nand differences of existing methods and lay the foundation for further method\ndevelopment. To facilitate future research, we build a curated collection of\ndatasets, networks, and evaluations on different applications. Finally, we\nprovide some valuable recommendations on selecting pruning methods and prospect\npromising research directions. We build a repository at\nhttps://github.com/hrcheng1066/awesome-pruning.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:34:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheng","Hongrong",""],["Zhang","Miao",""],["Shi","Javen Qinfeng",""]]}
{"id":"2308.06768","submitter":"Zi-Long Man","authors":"Shi-Yuan Li, Yan-Rui Liu, Zi-Long Man, Zong-Guo Si, and Jing Wu","title":"The $X(3960)$, $X_0(4140)$, and other $cs\\bar{c}\\bar{s}$ compact states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the spectrum and rearrangement decays of S-wave $cs\\bar{c}\\bar{s}$\ntetraquark states in a simplified quark model. The masses and widths are\nestimated by assuming that the $X(4140)$ is the lower $1^{++}$\n$cs\\bar{c}\\bar{s}$ tetraquark. Comparing our results with experimental\nmeasurements, we find that the recently observed $X(3960)$ by LHCb can be\nassigned as the lowest $0^{++}$ $cs\\bar{c}\\bar{s}$ tetraquark state and the\n$X_0(4140)$ could be the second lowest $0^{++}$ $cs\\bar{c}\\bar{s}$ tetraquark.\nPredictions of ratios between partial widths for the involved tetraquarks are\ngiven. We call for searches for more $cs\\bar{c}\\bar{s}$ tetraquarks with\n$J^{PC}=1^{+-}$, $0^{++}$, and $2^{++}$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:40:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Shi-Yuan",""],["Liu","Yan-Rui",""],["Man","Zi-Long",""],["Si","Zong-Guo",""],["Wu","Jing",""]]}
{"id":"2308.06769","submitter":"Rui Luo","authors":"Rui Luo and Vikram Krishnamurthy","title":"Fr\\'echet Statistics Based Change Point Detection in Multivariate Hawkes\n  Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.SI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a new approach for change point detection in causal\nnetworks of multivariate Hawkes processes using Frechet statistics. Our method\nsplits the point process into overlapping windows, estimates kernel matrices in\neach window, and reconstructs the signed Laplacians by treating the kernel\nmatrices as the adjacency matrices of the causal network. We demonstrate the\neffectiveness of our method through experiments on both simulated and\nreal-world cryptocurrency datasets. Our results show that our method is capable\nof accurately detecting and characterizing changes in the causal structure of\nmultivariate Hawkes processes, and may have potential applications in fields\nsuch as finance and neuroscience. The proposed method is an extension of\nprevious work on Frechet statistics in point process settings and represents an\nimportant contribution to the field of change point detection in multivariate\npoint processes.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:46:38 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 14:08:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Luo","Rui",""],["Krishnamurthy","Vikram",""]]}
{"id":"2308.06770","submitter":"Liu Hong","authors":"Liangrong Peng, Liu Hong","title":"Thermodynamics for Reduced Models of Chemical Reactions by PEA and QSSA","comments":"30 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Partial equilibrium approximation (PEA) and quasi-steady-state approximation\n(QSSA) are two classical methods for reducing complex macroscopic chemical\nreactions into simple computable ones. Previous studies mainly focus on the\naccuracy of solutions before and after applying model reduction. While, in this\npaper we start from a thermodynamic view, and try to establish a quantitative\nconnection on the essential thermodynamic quantities, like entropy production\nrate, free energy dissipation rate and entropy flow rate, between the original\nreversible chemical mass-action equations and the reduced models by either PEA\nor QSSA. Our results reveal that the PEA and QSSA do not necessarily preserve\nthe nice thermodynamic structure of the original full model during the\nreduction procedure (e.g. the loss of non-negativity of free energy dissipation\nrate), especially when adopting the algebraic relations in replace of\ndifferential equations. These results are further validated though the\napplication to Michaelis-Menten reactions analytically and numerically as a\nprototype. We expect our study would motivate a re-examination on the\neffectiveness of various model reduction or approximation methods from a new\nperspective of non-equilibrium thermodynamics.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:49:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Peng","Liangrong",""],["Hong","Liu",""]]}
{"id":"2308.06771","submitter":"Kun Jiang","authors":"Kun Jiang, Ziqiang Wang, Fu-Chun Zhang","title":"High Temperature Superconductivity in La$_3$Ni$_2$O$_7$","comments":"4 pages and 3 figures with supplemental materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Motivated by the recent discovery of high-temperature superconductivity in\nbilayer La$_3$Ni$_2$O$_7$ under pressure, we study its electronic properties\nand superconductivity due to strong electron correlation. Using the inversion\nsymmetry, we decouple the low-energy electronic structure into block-diagonal\nsymmetric and antisymmetric sectors. We find that the antisymmetric sector can\nbe reduced to a one-band system near half filling, while the symmetric bands\noccupied by about two electrons are heavily overdoped individually. Using the\nstrong coupling mean field theory, we obtain strong superconducting pairing\nwith $B_{1g}$ symmetry in the antisymmetric sector. We propose that due to the\nspin-orbital exchange coupling between the two sectors, $B_{1g}$ pairing is\ninduced in the symmetric bands, which in-turn boosts the pairing gap in the\nantisymmetric band and enhances the high-temperature superconductivity with a\ncongruent $d$-wave symmetry in pressurized La$_3$Ni$_2$O$_7$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:56:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Kun",""],["Wang","Ziqiang",""],["Zhang","Fu-Chun",""]]}
{"id":"2308.06772","submitter":"Kwadwo Antwi-Fordjour","authors":"Kwadwo Antwi-Fordjour, Sarah P. Westmoreland, Kendall H. Bearden","title":"Dual fear phenomenon in an eco-epidemiological model with prey\n  aggregation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study presents a thorough analysis of an eco-epidemiological model that\nintegrates infectious diseases in prey, prey aggregation, and the dual fear\neffect induced by predators. We establish criteria for determining the\nexistence of equilibrium points, which carry substantial biological\nsignificance. We establish the conditions for the occurrence of Hopf,\nsaddle-node, and transcritical bifurcations by employing fear parameters as key\nbifurcation parameters. Furthermore, through numerical simulations, we\ndemonstrate the occurrence of multiple zero-Hopf (ZH) and saddle-node\ntranscritical (SNTC) bifurcations around the endemic steady states by varying\nspecific key parameters across the two-parametric plane. We demonstrate that\nthe introduction of predator-induced fear, which hinders the growth rate of\nsusceptible prey, can lead to the finite time extinction of an initially stable\nsusceptible prey population. Finally, we discuss management strategies aimed at\nregulating disease transmission, focusing on fear-based interventions and\nselective predation via predator attack rate on infectious prey.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:00:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Antwi-Fordjour","Kwadwo",""],["Westmoreland","Sarah P.",""],["Bearden","Kendall H.",""]]}
{"id":"2308.06773","submitter":"Dario Juki\\'c","authors":"Dario Juki\\'c, Silvije Domazet, Ante Ivanko, David Raca, Sini\\v{s}a\n  Nikoli\\'c, Marin Kne\\v{z}evi\\'c, Filip Jovi\\'c, Nenad Raca, and Hrvoje Buljan","title":"Determining the presence and the number of people by using a Wi-Fi\n  signal","comments":"are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present experimental results and theoretical methods for the precise\ndetermination of the presence and the number of people in an observed area by\nusing Wi-Fi signals. Our setup does not require active cooperation of persons\npresent in the Wi-Fi field, and relies only on the received signal strength\nindicator (RSSI), which is read by the detectors. We first show that the\nstandard deviation of the measured RSSI data can be used as a practical tool to\nestablish the presence of a person (or more persons) with high precision, in\nparticular when the signal source is inside the measurement room. For the more\ndifficult problem of counting the number of persons, we have employed machine\nlearning algorithms to analyze data collected on nine different detectors and\nup to nine people present in our experiment. We have achieved excellent results\n(prediction accuracy of 98% and above) for counting already with only few\ndetectors utilized in the analysis.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:01:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Juki\u0107","Dario",""],["Domazet","Silvije",""],["Ivanko","Ante",""],["Raca","David",""],["Nikoli\u0107","Sini\u0161a",""],["Kne\u017eevi\u0107","Marin",""],["Jovi\u0107","Filip",""],["Raca","Nenad",""],["Buljan","Hrvoje",""]]}
{"id":"2308.06774","submitter":"Yongheng Sun","authors":"Yongheng Sun, Fan Wang, Jun Shu, Haifeng Wang, Li Wang. Deyu Meng,\n  Chunfeng Lian","title":"Dual Meta-Learning with Longitudinally Generalized Regularization for\n  One-Shot Brain Tissue Segmentation Across the Human Lifespan","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Brain tissue segmentation is essential for neuroscience and clinical studies.\nHowever, segmentation on longitudinal data is challenging due to dynamic brain\nchanges across the lifespan. Previous researches mainly focus on\nself-supervision with regularizations and will lose longitudinal generalization\nwhen fine-tuning on a specific age group. In this paper, we propose a dual\nmeta-learning paradigm to learn longitudinally consistent representations and\npersist when fine-tuning. Specifically, we learn a plug-and-play feature\nextractor to extract longitudinal-consistent anatomical representations by\nmeta-feature learning and a well-initialized task head for fine-tuning by\nmeta-initialization learning. Besides, two class-aware regularizations are\nproposed to encourage longitudinal consistency. Experimental results on the\niSeg2019 and ADNI datasets demonstrate the effectiveness of our method. Our\ncode is available at https://github.com/ladderlab-xjtu/DuMeta.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:02:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sun","Yongheng",""],["Wang","Fan",""],["Shu","Jun",""],["Wang","Haifeng",""],["Meng","Li Wang. Deyu",""],["Lian","Chunfeng",""]]}
{"id":"2308.06775","submitter":"Da Li","authors":"Da Li, Jingjing Wu, Qingrun Zhang","title":"Stochastic Gradient Descent in the Viewpoint of Graduated Optimization","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic gradient descent (SGD) method is popular for solving non-convex\noptimization problems in machine learning. This work investigates SGD from a\nviewpoint of graduated optimization, which is a widely applied approach for\nnon-convex optimization problems. Instead of the actual optimization problem, a\nseries of smoothed optimization problems that can be achieved in various ways\nare solved in the graduated optimization approach. In this work, a formal\nformulation of the graduated optimization is provided based on the nonnegative\napproximate identity, which generalizes the idea of Gaussian smoothing. Also,\nan asymptotic convergence result is achieved with the techniques in variational\nanalysis. Then, we show that the traditional SGD method can be applied to solve\nthe smoothed optimization problem. The Monte Carlo integration is used to\nachieve the gradient in the smoothed problem, which may be consistent with\ndistributed computing schemes in real-life applications. From the assumptions\non the actual optimization problem, the convergence results of SGD for the\nsmoothed problem can be derived straightforwardly. Numerical examples show\nevidence that the graduated optimization approach may provide more accurate\ntraining results in certain cases.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:02:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Da",""],["Wu","Jingjing",""],["Zhang","Qingrun",""]]}
{"id":"2308.06776","submitter":"Xin Lin","authors":"Xin Lin, Chao Ren, Xiao Liu, Jie Huang, Yinjie Lei","title":"Unsupervised Image Denoising in Real-World Scenarios via\n  Self-Collaboration Parallel Generative Adversarial Branches","comments":"Accepted to ICCV 2023","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 have shown remarkable performance in image denoising,\nparticularly when trained on large-scale paired datasets. However, acquiring\nsuch paired datasets for real-world scenarios poses a significant challenge.\nAlthough unsupervised approaches based on generative adversarial networks offer\na promising solution for denoising without paired datasets, they are difficult\nin surpassing the performance limitations of conventional GAN-based\nunsupervised frameworks without significantly modifying existing structures or\nincreasing the computational complexity of denoisers. To address this problem,\nwe propose a SC strategy for multiple denoisers. This strategy can achieve\nsignificant performance improvement without increasing the inference complexity\nof the GAN-based denoising framework. Its basic idea is to iteratively replace\nthe previous less powerful denoiser in the filter-guided noise extraction\nmodule with the current powerful denoiser. This process generates better\nsynthetic clean-noisy image pairs, leading to a more powerful denoiser for the\nnext iteration. This baseline ensures the stability and effectiveness of the\ntraining network. The experimental results demonstrate the superiority of our\nmethod over state-of-the-art unsupervised methods.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:04:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lin","Xin",""],["Ren","Chao",""],["Liu","Xiao",""],["Huang","Jie",""],["Lei","Yinjie",""]]}
{"id":"2308.06777","submitter":"Lihe Yang","authors":"Lihe Yang, Zhen Zhao, Lei Qi, Yu Qiao, Yinghuan Shi, Hengshuang Zhao","title":"Shrinking Class Space for Enhanced Certainty in Semi-Supervised Learning","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":"  Semi-supervised learning is attracting blooming attention, due to its success\nin combining unlabeled data. To mitigate potentially incorrect pseudo labels,\nrecent frameworks mostly set a fixed confidence threshold to discard uncertain\nsamples. This practice ensures high-quality pseudo labels, but incurs a\nrelatively low utilization of the whole unlabeled set. In this work, our key\ninsight is that these uncertain samples can be turned into certain ones, as\nlong as the confusion classes for the top-1 class are detected and removed.\nInvoked by this, we propose a novel method dubbed ShrinkMatch to learn\nuncertain samples. For each uncertain sample, it adaptively seeks a shrunk\nclass space, which merely contains the original top-1 class, as well as\nremaining less likely classes. Since the confusion ones are removed in this\nspace, the re-calculated top-1 confidence can satisfy the pre-defined\nthreshold. We then impose a consistency regularization between a pair of\nstrongly and weakly augmented samples in the shrunk space to strive for\ndiscriminative representations. Furthermore, considering the varied reliability\namong uncertain samples and the gradually improved model during training, we\ncorrespondingly design two reweighting principles for our uncertain loss. Our\nmethod exhibits impressive performance on widely adopted benchmarks. Code is\navailable at https://github.com/LiheYoung/ShrinkMatch.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:05:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Lihe",""],["Zhao","Zhen",""],["Qi","Lei",""],["Qiao","Yu",""],["Shi","Yinghuan",""],["Zhao","Hengshuang",""]]}
{"id":"2308.06778","submitter":"Dario Wei{\\ss}mann","authors":"Dario Weissmann","title":"Stratifying the moduli space of stable vector bundles by decomposition\n  type","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The moduli space of slope-stable vector bundles on a normal projective\nvariety over an algebraically closed field of characteristic $p\\geq 0$ is\nstratified with respect to the decomposition type. On a smooth projective curve\nof genus at least 2 we obtain mostly sharp dimension estimates for these\nstrata.\n  As an application, we obtain a dimension estimate for the closure of the\nprime to p trivializable stable bundles in the moduli space of stable vector\nbundles.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:15:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Weissmann","Dario",""]]}
{"id":"2308.06779","submitter":"Marie Fayolle","authors":"M. Fayolle, D. Dirkx, V. Lainey, L.I. Gurvits, P.N.A.M. Visser","title":"Decoupled and coupled moons' ephemerides estimation strategies --\n  Application to the JUICE mission","comments":null,"journal-ref":"Planetary and Space Science 219 (2022): 105531","doi":"10.1016/j.pss.2022.105531","report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When reconstructing natural satellites' ephemerides from space missions'\ntracking data, the dynamics of the spacecraft and natural bodies are often\nsolved for separately, in a decoupled manner. Alternatively, the ephemeris\ngeneration and spacecraft orbit determination can be performed concurrently.\nThis method directly maps the available data set to the estimated parameters'\ncovariances while fully accounting for all dynamical couplings. It thus\nprovides a statistically consistent solution to the estimation problem, whereas\nthis is not directly ensured with the decoupled strategy. For the Galilean\nmoons in particular, the JUICE mission provides a unique opportunity for\nephemerides improvement. For such a dynamically coupled problem, choosing\nbetween the two strategies will be influential. This paper provides a detailed,\nexplicit formulation for the coupled approach, before comparing the\nperformances of the two state estimation methods for the JUICE test case. To\nthis end, we used both decoupled and coupled models on simulated JUICE\nradiometric data. We compared the resulting covariances for the Galilean moons'\nstates, and showed that the decoupled approach yields slightly lower formal\nerrors for the moons' tangential positions. On the other hand, the coupled\nmodel can reduce the state uncertainties by more than one order of magnitude in\nthe radial direction. It also proved more sensitive to the dynamical coupling\nbetween Io, Europa and Ganymede, allowing the solutions for the first two moons\nto fully benefit from JUICE orbital phase around Ganymede. However, many issues\nremain to be solved before a concurrent estimation strategy can be successfully\napplied to reconstruct the moons' dynamics over long timescales. Nonetheless,\nour analysis highlights promising ephemerides improvements and thus motivates\nfuture efforts to reach a coupled state solution for the Galilean moons.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:22:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fayolle","M.",""],["Dirkx","D.",""],["Lainey","V.",""],["Gurvits","L. I.",""],["Visser","P. N. A. M.",""]]}
{"id":"2308.06780","submitter":"Sahel Mohammad Iqbal","authors":"Sahel Mohammad Iqbal and Subhankar Mishra","title":"Neural Networks at a Fraction with Pruned Quaternions","comments":null,"journal-ref":"In Proceedings of the 6th Joint International Conference on Data\n  Science & Management of Data (CODS-COMAD '23). ACM. 19-27 (2023)","doi":"10.1145/3570991.3570997","report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Contemporary state-of-the-art neural networks have increasingly large numbers\nof parameters, which prevents their deployment on devices with limited\ncomputational power. Pruning is one technique to remove unnecessary weights and\nreduce resource requirements for training and inference. In addition, for ML\ntasks where the input data is multi-dimensional, using higher-dimensional data\nembeddings such as complex numbers or quaternions has been shown to reduce the\nparameter count while maintaining accuracy. In this work, we conduct pruning on\nreal and quaternion-valued implementations of different architectures on\nclassification tasks. We find that for some architectures, at very high\nsparsity levels, quaternion models provide higher accuracies than their real\ncounterparts. For example, at the task of image classification on CIFAR-10\nusing Conv-4, at $3\\%$ of the number of parameters as the original model, the\npruned quaternion version outperforms the pruned real by more than $10\\%$.\nExperiments on various network architectures and datasets show that for\ndeployment in extremely resource-constrained environments, a sparse quaternion\nnetwork might be a better candidate than a real sparse model of similar\narchitecture.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:25:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Iqbal","Sahel Mohammad",""],["Mishra","Subhankar",""]]}
{"id":"2308.06781","submitter":"Yash Deo","authors":"Yash Deo, Haoran Dou, Nishant Ravikumar, Alejandro F. Frangi, Toni\n  Lassila","title":"Shape-guided Conditional Latent Diffusion Models for Synthesising Brain\n  Vasculature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Circle of Willis (CoW) is the part of cerebral vasculature responsible\nfor delivering blood to the brain. Understanding the diverse anatomical\nvariations and configurations of the CoW is paramount to advance research on\ncerebrovascular diseases and refine clinical interventions. However,\ncomprehensive investigation of less prevalent CoW variations remains\nchallenging because of the dominance of a few commonly occurring\nconfigurations. We propose a novel generative approach utilising a conditional\nlatent diffusion model with shape and anatomical guidance to generate realistic\n3D CoW segmentations, including different phenotypical variations. Our\nconditional latent diffusion model incorporates shape guidance to better\npreserve vessel continuity and demonstrates superior performance when compared\nto alternative generative models, including conditional variants of 3D GAN and\n3D VAE. We observed that our model generated CoW variants that are more\nrealistic and demonstrate higher visual fidelity than competing approaches with\nan FID score 53\\% better than the best-performing GAN-based model.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:27:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deo","Yash",""],["Dou","Haoran",""],["Ravikumar","Nishant",""],["Frangi","Alejandro F.",""],["Lassila","Toni",""]]}
{"id":"2308.06782","submitter":"Gelei Deng","authors":"Gelei Deng, Yi Liu, V\\'ictor Mayoral-Vilches, Peng Liu, Yuekang Li,\n  Yuan Xu, Tianwei Zhang, Yang Liu, Martin Pinzger, Stefan Rass","title":"PentestGPT: An LLM-empowered Automatic Penetration Testing Tool","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Penetration testing, a crucial industrial practice for ensuring system\nsecurity, has traditionally resisted automation due to the extensive expertise\nrequired by human professionals. Large Language Models (LLMs) have shown\nsignificant advancements in various domains, and their emergent abilities\nsuggest their potential to revolutionize industries. In this research, we\nevaluate the performance of LLMs on real-world penetration testing tasks using\na robust benchmark created from test machines with platforms. Our findings\nreveal that while LLMs demonstrate proficiency in specific sub-tasks within the\npenetration testing process, such as using testing tools, interpreting outputs,\nand proposing subsequent actions, they also encounter difficulties maintaining\nan integrated understanding of the overall testing scenario.\n  In response to these insights, we introduce PentestGPT, an LLM-empowered\nautomatic penetration testing tool that leverages the abundant domain knowledge\ninherent in LLMs. PentestGPT is meticulously designed with three\nself-interacting modules, each addressing individual sub-tasks of penetration\ntesting, to mitigate the challenges related to context loss. Our evaluation\nshows that PentestGPT not only outperforms LLMs with a task-completion increase\nof 228.6\\% compared to the \\gptthree model among the benchmark targets but also\nproves effective in tackling real-world penetration testing challenges. Having\nbeen open-sourced on GitHub, PentestGPT has garnered over 4,700 stars and\nfostered active community engagement, attesting to its value and impact in both\nthe academic and industrial spheres.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:35:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deng","Gelei",""],["Liu","Yi",""],["Mayoral-Vilches","V\u00edctor",""],["Liu","Peng",""],["Li","Yuekang",""],["Xu","Yuan",""],["Zhang","Tianwei",""],["Liu","Yang",""],["Pinzger","Martin",""],["Rass","Stefan",""]]}
{"id":"2308.06783","submitter":"Shuqing Li","authors":"Shuqing Li, Lili Wei, Yepang Liu, Cuiyun Gao, Shing-Chi Cheung and\n  Michael R. Lyu","title":"Towards Modeling Software Quality of Virtual Reality Applications from\n  Users' Perspectives","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":"  Virtual Reality (VR) technology has become increasingly popular in recent\nyears as a key enabler of the Metaverse. VR applications have unique\ncharacteristics, including the revolutionized human-computer interaction\nmechanisms, that distinguish them from traditional software. Hence, user\nexpectations for the software quality of VR applications diverge from those for\ntraditional software. Investigating these quality expectations is crucial for\nthe effective development and maintenance of VR applications, which remains an\nunder-explored area in prior research.\n  To bridge the gap, we conduct the first large-scale empirical study to model\nthe software quality of VR applications from users' perspectives. To this end,\nwe analyze 1,132,056 user reviews of 14,150 VR applications across seven app\nstores through a semiautomatic review mining approach. We construct a taxonomy\nof 12 software quality attributes that are of major concern to VR users. Our\nanalysis reveals that the VR-specific quality attributes are of utmost\nimportance to users, which are closely related to the most unique properties of\nVR applications like revolutionized interaction mechanisms and immersive\nexperiences. Our examination of relevant user complaints reveals the major\nfactors impacting user satisfaction with VR-specific quality attributes. We\nidentify that poor design or implementation of the movement mechanisms, control\nmechanisms, multimedia systems, and physics, can significantly degrade the user\nexperience. Moreover, we discuss the implications of VR quality assurance for\nboth developers and researchers to shed light on future work. For instance, we\nsuggest developers implement sufficient accessibility and comfort options for\nusers with mobility limitations, sensory impairments, and other specific needs\nto customize the interaction mechanisms. Our datasets and results will be\nreleased to facilitate follow-up studies.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:42:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Shuqing",""],["Wei","Lili",""],["Liu","Yepang",""],["Gao","Cuiyun",""],["Cheung","Shing-Chi",""],["Lyu","Michael R.",""]]}
{"id":"2308.06784","submitter":"Yuquan Wang","authors":"Yuquan Wang, Arnaud Tanguy, and Abderrahmane Kheddar","title":"Impact-Aware Multi-Contact Balance Criteria","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intentionally applying impacts while maintaining balance is challenging for\nlegged robots. This study originated from observing experimental data of the\nhumanoid robot HRP-4 intentionally hitting a wall with its right arm while\nstanding on two feet. Strangely, violating the usual zero moment point balance\ncriteria did not systematically result in a fall. To investigate this\nphenomenon, we propose the zero-step capture region for non-coplanar contacts,\ndefined as the center of mass (CoM) velocity area, and validated it with\npush-recovery experiments employing the HRP-4 balancing on two non-coplanar\ncontacts. To further enable on-purpose impacts, we compute the set of candidate\npost-impact CoM velocities accounting for frictional-impact dynamics in three\ndimensions, and restrict the entire set within the CoM velocity area to\nmaintain balance with the sustained contacts during and after impacts. We\nillustrate the maximum contact velocity for various HRP-4 stances in\nsimulation, indicating potential for integration into other task-space\nwhole-body controllers or planners. This study is the first to address the\nchallenging problem of applying an intentional impact with a\nkinematic-controlled humanoid robot on non-coplanar contacts.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:53:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Yuquan",""],["Tanguy","Arnaud",""],["Kheddar","Abderrahmane",""]]}
{"id":"2308.06785","submitter":"Ichiro Hasuo","authors":"James Haydon, Martin Bondu, Clovis Eberhart, J\\'er\\'emy Dubut and\n  Ichiro Hasuo","title":"Formal Verification of Intersection Safety for Automated Driving","comments":"To appear in ITSC 2023. With appendices. 9 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We build on our recent work on formalization of responsibility-sensitive\nsafety (RSS) and present the first formal framework that enables mathematical\nproofs of the safety of control strategies in intersection scenarios.\nIntersection scenarios are challenging due to the complex interaction between\nvehicles; to cope with it, we extend the program logic dFHL in the previous\nwork and introduce a novel formalism of hybrid control flow graphs on which our\nalgorithm can automatically discover an RSS condition that ensures safety. An\nRSS condition thus discovered is experimentally evaluated; we observe that it\nis safe (as our safety proof says) and is not overly conservative.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:53:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Haydon","James",""],["Bondu","Martin",""],["Eberhart","Clovis",""],["Dubut","J\u00e9r\u00e9my",""],["Hasuo","Ichiro",""]]}
{"id":"2308.06786","submitter":"Xubo Gu","authors":"Xubo Gu, Hanyu Bai, Xiaofan Cui, Juner Zhu, Weichao Zhuang, Zhaojian\n  Li, Xiaosong Hu, Ziyou Song","title":"Challenges and Opportunities for Second-life Batteries: A Review of Key\n  Technologies and Economy","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":"  Due to the increasing volume of Electric Vehicles in automotive markets and\nthe limited lifetime of onboard lithium-ion batteries (LIBs), the large-scale\nretirement of LIBs is imminent. The battery packs retired from Electric\nVehicles still own 70%-80% of the initial capacity, thus having the potential\nto be utilized in scenarios with lower energy and power requirements to\nmaximize the value of LIBs. However, spent batteries are commonly less reliable\nthan fresh batteries due to their degraded performance, thereby necessitating a\ncomprehensive assessment from safety and economic perspectives before further\nutilization. To this end, this paper reviews the key technological and economic\naspects of second-life batteries (SLBs). Firstly, we introduce various\ndegradation models for first-life batteries and identify an opportunity to\ncombine physics-based theories with data-driven methods to establish\nexplainable models with physical laws that can be generalized. However,\ndegradation models specifically tailored to SLBs are currently absent.\nTherefore, we analyze the applicability of existing battery degradation models\ndeveloped for first-life batteries in SLB applications. Secondly, we\ninvestigate fast screening and regrouping techniques and discuss the regrouping\nstandards for the first time to guide the classification procedure and enhance\nthe performance and safety of SLBs. Thirdly, we scrutinize the economic\nanalysis of SLBs and summarize the potentially profitable applications.\nFinally, we comprehensively examine and compare power electronics technologies\nthat can substantially improve the performance of SLBs, including\nhigh-efficiency energy transformation technologies, active equalization\ntechnologies, and technologies to improve reliability and safety.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:57:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gu","Xubo",""],["Bai","Hanyu",""],["Cui","Xiaofan",""],["Zhu","Juner",""],["Zhuang","Weichao",""],["Li","Zhaojian",""],["Hu","Xiaosong",""],["Song","Ziyou",""]]}
{"id":"2308.06787","submitter":"Yufei Guo","authors":"Yufei Guo, Xiaode Liu, Yuanpei Chen, Liwen Zhang, Weihang Peng, Yuhan\n  Zhang, Xuhui Huang, Zhe Ma","title":"RMP-Loss: Regularizing Membrane Potential Distribution for Spiking\n  Neural Networks","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spiking Neural Networks (SNNs) as one of the biology-inspired models have\nreceived much attention recently. It can significantly reduce energy\nconsumption since they quantize the real-valued membrane potentials to 0/1\nspikes to transmit information thus the multiplications of activations and\nweights can be replaced by additions when implemented on hardware. However,\nthis quantization mechanism will inevitably introduce quantization error, thus\ncausing catastrophic information loss. To address the quantization error\nproblem, we propose a regularizing membrane potential loss (RMP-Loss) to adjust\nthe distribution which is directly related to quantization error to a range\nclose to the spikes. Our method is extremely simple to implement and\nstraightforward to train an SNN. Furthermore, it is shown to consistently\noutperform previous state-of-the-art methods over different network\narchitectures and datasets.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 14:59:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Guo","Yufei",""],["Liu","Xiaode",""],["Chen","Yuanpei",""],["Zhang","Liwen",""],["Peng","Weihang",""],["Zhang","Yuhan",""],["Huang","Xuhui",""],["Ma","Zhe",""]]}
{"id":"2308.06788","submitter":"Johne Marcus Jarske Ms.","authors":"Johne Jarske, Jorge Rady, Lucia V. L. Filgueiras, Leandro M. Velloso,\n  Tania L. Santos","title":"Modeling the Dashboard Provenance","comments":"8 pages, 4 figures, one table, to be published in VIS 2023 (Vis +\n  Prov) x Domain","journal-ref":null,"doi":null,"report-no":"1003","categories":"cs.HC cs.CL cs.DB cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Organizations of all kinds, whether public or private, profit-driven or\nnon-profit, and across various industries and sectors, rely on dashboards for\neffective data visualization. However, the reliability and efficacy of these\ndashboards rely on the quality of the visual and data they present. Studies\nshow that less than a quarter of dashboards provide information about their\nsources, which is just one of the expected metadata when provenance is\nseriously considered. Provenance is a record that describes people,\norganizations, entities, and activities that had a role in the production,\ninfluence, or delivery of a piece of data or an object. This paper aims to\nprovide a provenance representation model, that entitles standardization,\nmodeling, generation, capture, and visualization, specifically designed for\ndashboards and its visual and data components. The proposed model will offer a\ncomprehensive set of essential provenance metadata that enables users to\nevaluate the quality, consistency, and reliability of the information presented\non dashboards. This will allow a clear and precise understanding of the context\nin which a specific dashboard was developed, ultimately leading to better\ndecision-making.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:03:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jarske","Johne",""],["Rady","Jorge",""],["Filgueiras","Lucia V. L.",""],["Velloso","Leandro M.",""],["Santos","Tania L.",""]]}
{"id":"2308.06789","submitter":"Tim Button","authors":"Tim Button","title":"Wand/set theories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Here is a template for introducing mathematical objects: \"Objects are found\nin stages. For every stage S: (1) for any things found before S, you find at S\nthe bland set whose members are exactly those things; (2) for anything, $x$,\nwhich was found before S, you find at S the result of tapping $x$ with any\nmagic wand (provided that the result is not itself a bland set); you find\nnothing else at S.\"\n  This Template has rich applications, it realizes John Conway's (1976)\nMathematicians' Liberation Movement, and it generalizes a lovely idea due to\nAlonzo Church (1974). Some parts of this Template are familiar: the bit about\n\"bland sets\" is just the ordinary story we tell about the cumulative iterative\nconception of set. But the talk of \"magic wands\" is new and different.\nMoreover, parts of the story are left unspecified.\n  This under-specification is deliberate: we want to be able to flesh out the\nTemplate in umpteen different ways. The Main Theorem of the paper is that any\nloosely constructive way of fleshing out the Template is synonymous with a\nZF-like theory.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:18:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Button","Tim",""]]}
{"id":"2308.06790","submitter":"Geza Kovacs","authors":"Geza Kovacs and Johanna Jurcsik","title":"Toward more accurate RR Lyrae metallicities","comments":"Submitted to A&A. After the 2nd (less negative/almost positive)\n  referee report. 1.2Mb, 10 pages (7+3 with appendices). Aesthetic\n  old-fashioned references with clickable ADS links","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By using a large sample of published spectroscopic iron abundances, we point\nout the importance of gravity correction in deriving more accurate metal\nabundances for RR Lyrae stars. For the 197 stars with multiple spectra we find\noverall [Fe/H] standard deviations of 0.167 (as published), 0.145 (shifted by\ndata source zero points) and 0.121 (both zero point-shifted and\ngravity-corrected). These improvements are significant at the ~2 sigma level at\neach correction step, leading to a clearly significant improvement after both\ncorrections applied. The higher quality of the gravity-corrected metallicities\nis strongly supported also by the tighter correlation with the metallicities\npredicted from the period and Fourier phase phi_31. This work underlines the\nneed for using some external estimates of the temporal gravity in the chemical\nabundance analysis rather than relying on a full-fetched spectrum fit that\nleads to large correlated errors in the estimated parameters.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:22:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kovacs","Geza",""],["Jurcsik","Johanna",""]]}
{"id":"2308.06791","submitter":"Yongxin Shao","authors":"Yongxin Shao and Aihong Tan and Zhetao Sun and Enhui Zheng and\n  Tianhong Yan","title":"PV-SSD: A Projection and Voxel-based Double Branch Single-Stage 3D\n  Object Detector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LIDAR-based 3D object detection and classification is crucial for autonomous\ndriving. However, inference in real-time from extremely sparse 3D data poses a\nformidable challenge. To address this issue, a common approach is to project\npoint clouds onto a bird's-eye or perspective view, effectively converting them\ninto an image-like data format. However, this excessive compression of point\ncloud data often leads to the loss of information. This paper proposes a 3D\nobject detector based on voxel and projection double branch feature extraction\n(PV-SSD) to address the problem of information loss. We add voxel features\ninput containing rich local semantic information, which is fully fused with the\nprojected features in the feature extraction stage to reduce the local\ninformation loss caused by projection. A good performance is achieved compared\nto the previous work. In addition, this paper makes the following\ncontributions: 1) a voxel feature extraction method with variable receptive\nfields is proposed; 2) a feature point sampling method by weight sampling is\nused to filter out the feature points that are more conducive to the detection\ntask; 3) the MSSFA module is proposed based on the SSFA module. To verify the\neffectiveness of our method, we designed comparison experiments.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:30:02 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:49:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Shao","Yongxin",""],["Tan","Aihong",""],["Sun","Zhetao",""],["Zheng","Enhui",""],["Yan","Tianhong",""]]}
{"id":"2308.06792","submitter":"Aine Fairbrother-Browne","authors":"Aine Fairbrother-Browne, Sonia Garc\\'ia-Ruiz, Regina H Reynolds, Mina\n  Ryten, Alan Hodgkinson","title":"ensemblQueryR: fast, flexible and high-throughput querying of Ensembl LD\n  API endpoints in R","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present ensemblQueryR, a package providing an R interface to the Ensembl\nREST API that facilitates flexible, fast, user-friendly and R workflow\nintegrable querying of Ensembl REST API linkage disequilibrium (LD) endpoints,\noptimised for high-throughput querying. ensemblQueryR achieves this through\nfunctions that are intuitive and amenable to custom code integration, use of\nfamiliar R object types as inputs and outputs, code optimisation and optional\nparallelisation functionality. For each LD endpoint, ensemblQueryR provides two\nfunctions, permitting both single-query and multi-query modes of operation. The\nmulti-query functions are optimised for large query sizes and provide optional\nparallelisation to leverage available computational resources and minimise\nprocessing time. We demonstrate that ensemblQueryR has improved performance in\nterms of random access memory (RAM) usage and speed, delivering a 10-fold speed\nincrease over analogous software whilst using a third of the RAM. Finally,\nensemblQueryR is near-agnostic to operating system and computational\narchitecture through availability of Docker and singularity images, making this\ntool widely accessible to the scientific community.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:41:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fairbrother-Browne","Aine",""],["Garc\u00eda-Ruiz","Sonia",""],["Reynolds","Regina H",""],["Ryten","Mina",""],["Hodgkinson","Alan",""]]}
{"id":"2308.06793","submitter":"Yuexin Zhou","authors":"Yuexin Zhou, Chao Ding, Yangjing Zhang","title":"Strong variational sufficiency of nonsmooth optimization problems on\n  Riemannian manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Riemannian augmented Lagrangian method (RALM) is proposed to solve the\nnonsmooth optimization problems on Riemannian manifolds. However, the local\nconvergence rate of this algorithm still remains unknown without imposing any\nconstraint qualifications. In this paper, we introduce the manifold variational\nsufficient condition and show that its strong version is equivalent to the\nmanifold strong second-order sufficient condition (M-SSOSC) in some cases. More\nimportantly, we formulate a local dual problem based on this condition,\nconsequently establishing the R-linear convergence rate of RALM. Furthermore,\nthe validity of the semismooth Newton method for solving the RALM subproblem is\ndemonstrated under the M-SSOSC.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:41:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhou","Yuexin",""],["Ding","Chao",""],["Zhang","Yangjing",""]]}
{"id":"2308.06794","submitter":"Gao-Xiang Deng","authors":"Gao-xiang Deng, Haoqiang Ai, Bingcheng Wang, Wei Shao, Yu Liu, Zheng\n  Cui","title":"Exploring the Optimal Cycle for Quantum Heat Engine using Reinforcement\n  Learning","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 thermodynamic relationships in emerging nanodevices are significant\nbut often complex to deal with. The application of machine learning in quantum\nthermodynamics has provided a new perspective. This study employs reinforcement\nlearning to output the optimal cycle of quantum heat engine. Specifically, the\nsoft actor-critic algorithm is adopted to optimize the cycle of three-level\ncoherent quantum heat engine with the aim of maximal average power. The results\nshow that the optimal average output power of the coherent three-level heat\nengine is 1.28 times greater than the original cycle (steady limit). Meanwhile,\nthe efficiency of the optimal cycle is greater than the Curzon-Ahlborn\nefficiency as well as reporting by other researchers. Notably, this optimal\ncycle can be fitted as an Otto-like cycle by applying the Boltzmann function\nduring the compression and expansion processes, which illustrates the\neffectiveness of the method.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:43:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deng","Gao-xiang",""],["Ai","Haoqiang",""],["Wang","Bingcheng",""],["Shao","Wei",""],["Liu","Yu",""],["Cui","Zheng",""]]}
{"id":"2308.06795","submitter":"Evan Crothers","authors":"Evan Crothers, Herna Viktor, Nathalie Japkowicz","title":"Faithful to Whom? Questioning Interpretability Measures in NLP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A common approach to quantifying model interpretability is to calculate\nfaithfulness metrics based on iteratively masking input tokens and measuring\nhow much the predicted label changes as a result. However, we show that such\nmetrics are generally not suitable for comparing the interpretability of\ndifferent neural text classifiers as the response to masked inputs is highly\nmodel-specific. We demonstrate that iterative masking can produce large\nvariation in faithfulness scores between comparable models, and show that\nmasked samples are frequently outside the distribution seen during training. We\nfurther investigate the impact of adversarial attacks and adversarial training\non faithfulness scores, and demonstrate the relevance of faithfulness measures\nfor analyzing feature salience in text adversarial attacks. Our findings\nprovide new insights into the limitations of current faithfulness metrics and\nkey considerations to utilize them appropriately.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:44:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Crothers","Evan",""],["Viktor","Herna",""],["Japkowicz","Nathalie",""]]}
{"id":"2308.06796","submitter":"Hong Cheng","authors":"Hong Cheng, Rebekah Leamons, Ahmad Al Shami","title":"Modified Topological Image Preprocessing for Skin Lesion Classifications","comments":"Presented at CSCE 2022, The 2022 World Congress in Computer Science,\n  Computer Engineering & Applied Computing, July 25-28, 2022, Las Vegas, USA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a modified Topological Data Analysis model for skin\nimages preprocessing and enhancements. The skin lesion dataset HAM10000 used\nwith the intention of identifying the important objects in relevant regions of\nthe images. In order to evaluate both the original dataset and the preprocessed\ndataset, Deep Convolutional Neural Network and Vision Transformer models were\nutilized to train both models. After training, the experimental results\ndemonstrate that the images preprocessed using the Modified Topological Data\nAnalysis consistently perform better.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:45:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheng","Hong",""],["Leamons","Rebekah",""],["Shami","Ahmad Al",""]]}
{"id":"2308.06797","submitter":"Giovanni Bartolomeo","authors":"Giovanni Bartolomeo","title":"A Zero-Knowledge Revocable Credential Verification Protocol Using\n  Attribute-Based Encryption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a zero-knowledge credential verification protocol leveraging on\nCiphertext Policy Attribute-Based Encryption. The protocol supports revocation\nthrough cryptographic accumulators.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:45:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bartolomeo","Giovanni",""]]}
{"id":"2308.06798","submitter":"Anshuman Sinha","authors":"Anshuman Sinha, Amarendra K. Singh","title":"Computational study of non-isothermal slag eye formation and its effects\n  on ladle refining","comments":"21 pages, 17 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ladle refining is one of the most important aspects of high-quality steel\nproduction. Ladle argon purging which facilitates the refining process also\nleads to the unwarranted opening of the slag cover known as Slag Eye-opening\nand has a deleterious effect on the quality of steel. Slag eye-opening has been\nanalysed in past under isothermal conditions whereas ladle refining is a\ntransient and non-isothermal operation. The current study deals with the\nmodelling of slag-eye opening and its effects on ladle refining under\nnon-isothermal conditions. The bubble plume is modelled with the help of\nDiscrete Phase modelling (DPM) coupled with a discrete random walk model for\nincluding the particle level turbulence. Temperature-dependent thermophysical\nproperties of slag are obtained from FactSage. Opening of slag-metal interface\ncools the slag-eye region, which causes changes in the thermophysical\nproperties of the slag phase. These changes are then reflected in the flow\ncharacteristics of this complex fluid. The slags flow profile and eye formation\nare compared and explained between cold modelling techniques and actual ladle\nmetallurgy. The consequences of changing thermophysical prop during ladle\nrefining manifest in their influence on the overall mass transfer coefficient\nand the kinetics of desulfurization. This can be achieved without the\nrequirement to solve computationally demanding species transport equations,\nthereby enhancing the practical efficiency of this approach.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:51:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sinha","Anshuman",""],["Singh","Amarendra K.",""]]}
{"id":"2308.06799","submitter":"Kenji Fukaya","authors":"Kenji Fukaya","title":"Homological algebra and moduli spaces in topological field theories","comments":"56 pages 12 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a survey of various types of Floer theories (both in symplectic\ngeometry and gauge theory) and relations among them.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:53:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fukaya","Kenji",""]]}
{"id":"2308.06800","submitter":"Jin Wang","authors":"Jin Wang, Ruiqi Ruan, Xinrong Ma","title":"Some q-Identities derived by the ordinary derivative operator","comments":"22 pages","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 applications of the ordinary derivative\noperator, instead of the $q$-derivative operator, to the theory of $q$-series.\nAs main results, many new summation and transformation formulas are established\nwhich are closely related to some well-known formulas such as the $q$-binomial\ntheorem, Ramanujan's ${}_1\\psi_1$ formula, the quintuple product identity,\nGasper's $q$-Clausen product formula, and Rogers' ${}_6\\phi_5$ formula, etc.\nAmong these results is a finite form of the Rogers-Ramanujan identity and a\nshort way to Eisenstein's theorem on Lambert series.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:54:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jin",""],["Ruan","Ruiqi",""],["Ma","Xinrong",""]]}
{"id":"2308.06801","submitter":"Jintang Li","authors":"Jie Liao, Jintang Li, Liang Chen, Bingzhe Wu, Yatao Bian, Zibin Zheng","title":"SAILOR: Structural Augmentation Based Tail Node Representation Learning","comments":"Accepted by CIKM 2023; Code is available at\n  https://github.com/Jie-Re/SAILOR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Neural Networks (GNNs) have achieved state-of-the-art performance in\nrepresentation learning for graphs recently. However, the effectiveness of\nGNNs, which capitalize on the key operation of message propagation, highly\ndepends on the quality of the topology structure. Most of the graphs in\nreal-world scenarios follow a long-tailed distribution on their node degrees,\nthat is, a vast majority of the nodes in the graph are tail nodes with only a\nfew connected edges. GNNs produce inferior node representations for tail nodes\nsince they lack structural information. In the pursuit of promoting the\nexpressiveness of GNNs for tail nodes, we explore how the deficiency of\nstructural information deteriorates the performance of tail nodes and propose a\ngeneral Structural Augmentation based taIL nOde Representation learning\nframework, dubbed as SAILOR, which can jointly learn to augment the graph\nstructure and extract more informative representations for tail nodes.\nExtensive experiments on public benchmark datasets demonstrate that SAILOR can\nsignificantly improve the tail node representations and outperform the\nstate-of-the-art baselines.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:04:03 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 01:08:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liao","Jie",""],["Li","Jintang",""],["Chen","Liang",""],["Wu","Bingzhe",""],["Bian","Yatao",""],["Zheng","Zibin",""]]}
{"id":"2308.06802","submitter":"Xiangliang Kong","authors":"Xiangliang Kong","title":"Locally repairable convertible codes with optimal access costs","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern large-scale distributed storage systems use erasure codes to protect\nagainst node failures with low storage overhead. In practice, the failure rate\nand other factors of storage devices in the system may vary significantly over\ntime, and leads to changes of the ideal code parameters. To maintain the\nstorage efficiency, this requires the system to adjust parameters of the\ncurrently used codes. The changing process of code parameters on encoded data\nis called code conversion.\n  As an important class of storage codes, locally repairable codes (LRCs) can\nrepair any codeword symbol using a small number of other symbols. This feature\nmakes LRCs highly efficient for addressing single node failures in the storage\nsystems. In this paper, we investigate the code conversions for locally\nrepairable codes in the merge regime. We establish a lower bound on the access\ncost of code conversion for general LRCs and propose a general construction of\nLRCs that can perform code conversions with access cost matching this bound.\nThis construction provides a family of LRCs together with optimal conversion\nprocess over the field of size linear in the code length.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:09:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kong","Xiangliang",""]]}
{"id":"2308.06803","submitter":"Luca Guido Molinari","authors":"Carlo Alberto Mantica and Luca Guido Molinari","title":"A note on Harada's Conformal Killing gravity","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that ''Gravity at cosmological distances: Explaining the accelerating\nexpansion without dark energy'' recently proposed by J. Harada [6] is\nequivalent to the Einstein equation extended by the presence of an arbitrary\nconformal Killing tensor. This turns Harada's equations of third order in the\nderivatives of the metric tensor to second order, and offers a simple strategy\nof solution that shortcuts Harada's derivation and obtains both modified\nFriedmann equations. An application is presented for the case of flat space and\nconstant curvature.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:13:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mantica","Carlo Alberto",""],["Molinari","Luca Guido",""]]}
{"id":"2308.06804","submitter":"Mijanur Islam","authors":"Mijanur Islam and Saurabh Basu","title":"Tunable persistent currents in a spin-orbit coupled pseudospin-1\n  fermionic quantum ring","comments":"24 pages, 20 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 conduct a thorough study of the persistent currents in a spin-orbit\ncoupled ${\\alpha}-T_3$ pseudospin-1 fermionic quantum ring (QR) that smoothly\ninterpolates between graphene (${\\alpha} = 0$, pseudospin-1/2) and a dice\nlattice (${\\alpha} = 1$, pseudospin-1). In particular, we have considered both\nintrinsic spin-orbit coupling (ISOC) and Rashba spin-orbit coupling (RSOC) in\naddition to an external magnetic field, and have systematically enumerated\ntheir individual and combined effects on the charge, valley and the\nspin-polarized persistent currents. The energy levels of the system comprise of\nthe conduction bands, valence bands, and flat bands which show non-monotonic\ndependencies on the ring radius, R of the QR, in the sense that, for small R,\nthe energy levels vary as 1/R, while the variation is linear in R for large R.\nThe cases corresponding to zero magnetic fields are benchmarked with those for\nfinite external fields. Further, it is noted that the flat bands demonstrate\ndispersive behavior, and hence can contribute to the transport properties only\nwhen ISOC is non-zero. Moreover, the RSOC yields spin-split bands, thereby\ncontributing to the spin-resolved currents, together with distinct degeneracies\nfor different spin branches. The persistent currents in the charge, valley, and\nspin sectors for each of these cases oscillate as a function of the magnetic\nfield with a period equal to the flux quantum, as they should be, and depend\nupon the spin-orbit coupling terms. Further, we have explored the role played\nby the parameter ${\\alpha}$ in our entire analysis to ascertain the effect of\nthe flat bands.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:23:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Islam","Mijanur",""],["Basu","Saurabh",""]]}
{"id":"2308.06805","submitter":"Ricardo Landim","authors":"Marcelo V. dos Santos, Ricardo G. Landim, Gabriel A. Hoerning, Filipe\n  B. Abdalla, Amilcar Queiroz, Elcio Abdalla, Carlos A. Wuensche, Bin Wang,\n  Luciano Barosi, Thyrso Villela, Alessandro Marins, Chang Feng, Edmar Gurjao,\n  Camila P. Novaes, Larissa C. O. Santos, Joao R.L. Santos, Jiajun Zhang,\n  Vincenzo Liccardo, Xue Zhang, Yu Sang, Frederico Vieira, Pablo Motta","title":"The BINGO Project IX: Search for Fast Radio Bursts -- A Forecast for the\n  BINGO Interferometry System","comments":"12 pages, 9 figures, 5 tables, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Baryon Acoustic Oscillations (BAO) from Integrated Neutral Gas\nObservations (BINGO) radio telescope will use the neutral Hydrogen emission\nline to map the Universe in the redshift range $0.127 \\le z \\le 0.449$, with\nthe main goal of probing BAO. In addition, the instrument optical design and\nhardware configuration support the search for Fast Radio Bursts (FRBs). In this\nwork, we propose the use of a BINGO Interferometry System (BIS) including new\nauxiliary, smaller, radio telescopes (hereafter \\emph{outriggers}). The\ninterferometric approach makes it possible to pinpoint the FRB sources in the\nsky. We present here the results of several BIS configurations combining BINGO\nhorns with and without mirrors ($4$ m, $5$ m, and $6$ m) and 5, 7, 9, or 10 for\nsingle horns. We developed a new {\\tt Python} package, the {\\tt FRBlip}, which\ngenerates synthetic FRB mock catalogs and computes, based on a telescope model,\nthe observed signal-to-noise ratio (S/N) that we used to compute numerically\nthe detection rates of the telescopes and how many interferometry pairs of\ntelescopes (\\emph{baselines}) can observe an FRB. FRBs observed by more than\none baseline are the ones whose location can be determined. We thus evaluate\nthe performance of BIS regarding FRB localization. We found that BIS will be\nable to localize 23 FRBs yearly with single horn outriggers in the best\nconfiguration (using 10 outriggers of 6 m mirrors), with redshift $z \\leq\n0.96$; the full localization capability depends on the number and the type of\nthe outriggers. Wider beams are best to pinpoint FRB sources because potential\ncandidates will be observed by more baselines, while narrow beams look deep in\nredshift. The BIS can be a powerful extension of the regular BINGO telescope,\ndedicated to observe hundreds of FRBs during Phase 1. Many of them will be well\nlocalized with a single horn + 6 m dish as outriggers.(Abridged)\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:32:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Santos","Marcelo V. dos",""],["Landim","Ricardo G.",""],["Hoerning","Gabriel A.",""],["Abdalla","Filipe B.",""],["Queiroz","Amilcar",""],["Abdalla","Elcio",""],["Wuensche","Carlos A.",""],["Wang","Bin",""],["Barosi","Luciano",""],["Villela","Thyrso",""],["Marins","Alessandro",""],["Feng","Chang",""],["Gurjao","Edmar",""],["Novaes","Camila P.",""],["Santos","Larissa C. O.",""],["Santos","Joao R. L.",""],["Zhang","Jiajun",""],["Liccardo","Vincenzo",""],["Zhang","Xue",""],["Sang","Yu",""],["Vieira","Frederico",""],["Motta","Pablo",""]]}
{"id":"2308.06806","submitter":"Fei Hu","authors":"Fei Hu, Kunal Mehta, Shivakant Mishra, Mohammad AlMutawa","title":"A Dynamic Distributed Scheduler for Computing on the Edge","comments":"11 pages,14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Edge computing has become a promising computing paradigm for building IoT\n(Internet of Things) applications, particularly for applications with specific\nconstraints such as latency or privacy requirements. Due to resource\nconstraints at the edge, it is important to efficiently utilize all available\ncomputing resources to satisfy these constraints. A key challenge in utilizing\nthese computing resources is the scheduling of different computing tasks in a\ndynamically varying, highly hybrid computing environment. This paper described\nthe design, implementation, and evaluation of a distributed scheduler for the\nedge that constantly monitors the current state of the computing infrastructure\nand dynamically schedules various computing tasks to ensure that all\napplication constraints are met. This scheduler has been extensively evaluated\nwith real-world AI applications under different scenarios and demonstrates that\nit outperforms current scheduling approaches in satisfying various application\nconstraints.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:36:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Fei",""],["Mehta","Kunal",""],["Mishra","Shivakant",""],["AlMutawa","Mohammad",""]]}
{"id":"2308.06807","submitter":"Samuel Bosch","authors":"Samuel Bosch, Bobak Kiani, Rui Yang, Adrian Lupascu, and Seth Lloyd","title":"Neural Networks for Programming Quantum Annealers","comments":"15 pages and 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum machine learning has the potential to enable advances in artificial\nintelligence, such as solving problems intractable on classical computers. Some\nfundamental ideas behind quantum machine learning are similar to kernel methods\nin classical machine learning. Both process information by mapping it into\nhigh-dimensional vector spaces without explicitly calculating their numerical\nvalues. We explore a setup for performing classification on labeled classical\ndatasets, consisting of a classical neural network connected to a quantum\nannealer. The neural network programs the quantum annealer's controls and\nthereby maps the annealer's initial states into new states in the Hilbert\nspace. The neural network's parameters are optimized to maximize the distance\nof states corresponding to inputs from different classes and minimize the\ndistance between quantum states corresponding to the same class. Recent\nliterature showed that at least some of the \"learning\" is due to the quantum\nannealer, connecting a small linear network to a quantum annealer and using it\nto learn small and linearly inseparable datasets. In this study, we consider a\nsimilar but not quite the same case, where a classical fully-fledged neural\nnetwork is connected with a small quantum annealer. In such a setting, the\nfully-fledged classical neural-network already has built-in nonlinearity and\nlearning power, and can already handle the classification problem alone, we\nwant to see whether an additional quantum layer could boost its performance. We\nsimulate this system to learn several common datasets, including those for\nimage and sound recognition. We conclude that adding a small quantum annealer\ndoes not provide a significant benefit over just using a regular (nonlinear)\nclassical neural network.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:43:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bosch","Samuel",""],["Kiani","Bobak",""],["Yang","Rui",""],["Lupascu","Adrian",""],["Lloyd","Seth",""]]}
{"id":"2308.06808","submitter":"An Ning","authors":"An Ning","title":"A Mean Convection Finite Difference Method for Solving Black Scholes\n  Model for Option Pricing","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 research, we proposed a Mean Convection Finite Difference Method\n(MCFDM) for European options pricing. The Black-Scholes model, which describes\nthe dynamics of a financial asset, was first transformed into a\nconvection-diffusion equation. We then used the finite difference method to\ndiscretize time and price, and introduced a tuning parameter to enhance the\nconvection term. Specified the boundary and initial conditions for call and put\noptions of European options, and performed numerical calculations to obtain a\nnumerical solution and error estimation. By varying the strength of the strike\nprice and risk-free interest rate, we explored the accuracy and stability of\nour predicted prices. Finally, we compared our proposed method with those\nobtained using the Crank-Nicolson Finite Difference Method (CFDM) and Monte\nCarlo method. Our numerical results demonstrate the efficiency and accuracy of\nour proposed method, which outperformed the CFDM and Monte Carlo methods in\nterms of accuracy and speed.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:44:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ning","An",""]]}
{"id":"2308.06809","submitter":"Alexei Skorobogatov","authors":"Jean-Louis Colliot-Th\\'el\\`ene and Alexei N. Skorobogatov","title":"Low degree unramified cohomology of generic diagonal hypersurfaces","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the i-th unramified cohomology group of the generic diagonal\nhypersurface in the projective space of dimension n>i is trivial for i=1,2,3.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:47:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Colliot-Th\u00e9l\u00e8ne","Jean-Louis",""],["Skorobogatov","Alexei N.",""]]}
{"id":"2308.06810","submitter":"Yue Cao","authors":"Yue Cao and C.S. George Lee","title":"Ground Manipulator Primitive Tasks to Executable Actions using Large\n  Language Models","comments":"The abstract of this paper is accepted as a late-breaking result\n  poster in 2023 IEEE/RSJ International Conference on Intelligent Robots and\n  Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Layered architectures have been widely used in robot systems. The majority of\nthem implement planning and execution functions in separate layers. However,\nthere still lacks a straightforward way to transit high-level tasks in the\nplanning layer to the low-level motor commands in the execution layer. In order\nto tackle this challenge, we propose a novel approach to ground the manipulator\nprimitive tasks to robot low-level actions using large language models (LLMs).\nWe designed a program-like prompt based on the task frame formalism. In this\nway, we enable LLMs to generate position/force set-points for hybrid control.\nEvaluations over several state-of-the-art LLMs are provided.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:52:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cao","Yue",""],["Lee","C. S. George",""]]}
{"id":"2308.06811","submitter":"Nouran Abdalazim","authors":"Nouran Abdalazim, Leonardo Alchieri, Lidia Alecci, Silvia Santini","title":"BiHeartS: Bilateral Heart Rate from multiple devices and body positions\n  for Sleep measurement Dataset","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Sleep is the primary mean of recovery from accumulated fatigue and thus plays\na crucial role in fostering people's mental and physical well-being. Sleep\nquality monitoring systems are often implemented using wearables that leverage\ntheir sensing capabilities to provide sleep behaviour insights and\nrecommendations to users. Building models to estimate sleep quality from sensor\ndata is a challenging task, due to the variability of both physiological data,\nperception of sleep quality, and the daily routine across users. This challenge\ngauges the need for a comprehensive dataset that includes information about the\ndaily behaviour of users, physiological signals as well as the perceived sleep\nquality. In this paper, we try to narrow this gap by proposing Bilateral Heart\nrate from multiple devices and body positions for Sleep measurement (BiHeartS)\ndataset. The dataset is collected in the wild from 10 participants for 30\nconsecutive nights. Both research-grade and commercial wearable devices are\nincluded in the data collection campaign. Also, comprehensive self-reports are\ncollected about the sleep quality and the daily routine.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:53:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Abdalazim","Nouran",""],["Alchieri","Leonardo",""],["Alecci","Lidia",""],["Santini","Silvia",""]]}
{"id":"2308.06812","submitter":"Yang Li","authors":"Xianghui Cao, Yang Li, and James P. Vary","title":"Forces inside a strongly-coupled scalar nucleon","comments":"30 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the gravitational form factors of a strongly coupled scalar\ntheory that mimic the interaction between the nucleon and the pion. The\nnon-perturbative calculation is based on the light-front Hamiltonian formalism.\nWe renormalize the energy-momentum tensor with a Fock sector dependent scheme.\nWe also systematically analyze the Lorentz structure of the energy-momentum\ntensor and identify the suitable hadron matrix elements to extract the form\nfactors, avoiding the contamination of spurious contributions. We verify that\nthe extracted form factors obey momentum conservation as well as the mechanical\nstability condition. From the gravitational form factors, we compute the energy\nand pressure distributions of the system. Furthermore, we show that utilizing\nthe Hamiltonian eigenvalue equation, the off-diagonal Fock sector contributions\nfrom the interaction term can be converted to diagonal Fock sector\ncontributions, yielding a systematic non-perturbative light-front wave function\nrepresentation of the energies and forces inside the system.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:54:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cao","Xianghui",""],["Li","Yang",""],["Vary","James P.",""]]}
{"id":"2308.06813","submitter":"Myles Sherman","authors":"Myles B. Sherman, Liam Connor, Vikram Ravi, Casey Law, Ge Chen, Morgan\n  Catha, Jakob T. Faber, Gregg Hallinan, Charlie Harnach, Greg Hellbourg, Rick\n  Hobbs, David Hodge, Mark Hodges, James W. Lamb, Paul Rasmussen, Kritti\n  Sharma, Jun Shi, Dana Simard, Jean Somalwar, Reynier Squillace, Sander\n  Weinreb, David P. Woody, Nitika Yadlapalli","title":"Deep Synoptic Array Science: Polarimetry of 25 New Fast Radio Bursts\n  Provides Insights into their Origins","comments":"43 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on a full-polarization analysis of the first 25 as yet\nnon-repeating FRBs detected at 1.4 GHz by the 110-antenna Deep Synoptic Array\n(DSA-110) during commissioning observations. We present details of the data\nreduction, calibration, and analysis procedures developed for this novel\ninstrument. The data have 32 $\\mu$s time resolution and sensitivity to Faraday\nrotation measures (RMs) between $\\pm10^{6} $rad m$^{-2}$. RMs are detected for\n20 FRBs with magnitudes ranging from $4-4670$ rad m$^{-2}$. $9/25$ FRBs are\nfound to have high ($\\ge 70\\%$) linear-polarization fractions. The remaining\nFRBs exhibit significant circular polarization ($3/25$), or are either\npartially depolarized ($8/25$) or unpolarized ($5/25$). We investigate the\nmechanism of depolarization, disfavoring stochastic RM variations within a\nscattering screen as a dominant cause. Polarization-state and possible RM\nvariations are observed in the four FRBs with multiple sub-components, but only\none other FRB shows a change in polarization state. We combine the DSA-110\nsample with polarimetry of previously published FRBs, and compare the\npolarization properties of FRB sub-populations and FRBs with Galactic pulsars.\nAlthough FRBs are typically far more polarized than the average profiles of\nGalactic pulsars, and exhibit greater spread in polarization fractions than\npulsar single pulses, we find a remarkable similarity between FRB polarization\nfractions and the youngest (characteristic ages $<10^{5}$ yr) pulsars. Our\nresults support a scenario wherein FRB emission is intrinsically highly\nlinearly polarized, and where propagation effects within progenitor\nmagnetospheres can result in conversion to circular polarization and\ndepolarization. Young pulsar emission and magnetospheric-propagation geometries\nmay form a useful analogy for the origin of FRB polarization.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:56:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sherman","Myles B.",""],["Connor","Liam",""],["Ravi","Vikram",""],["Law","Casey",""],["Chen","Ge",""],["Catha","Morgan",""],["Faber","Jakob T.",""],["Hallinan","Gregg",""],["Harnach","Charlie",""],["Hellbourg","Greg",""],["Hobbs","Rick",""],["Hodge","David",""],["Hodges","Mark",""],["Lamb","James W.",""],["Rasmussen","Paul",""],["Sharma","Kritti",""],["Shi","Jun",""],["Simard","Dana",""],["Somalwar","Jean",""],["Squillace","Reynier",""],["Weinreb","Sander",""],["Woody","David P.",""],["Yadlapalli","Nitika",""]]}
{"id":"2308.06814","submitter":"Jinbang Hu","authors":"Jinbang Hu and Xiansi Wang and Justin W Wells","title":"(chiral) Quantum well Rashba splitting in Sb monolayer on Au(111)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present atomic and electronic structure investigations of Single-layer\n(110) surface of rhombohedral crystal formed Sb on Au(111) substrate. Low\nenergy electron diffraction (LEED) and scanning tunneling microscopy (STM)\nreveal a pure 2D Sb stripe structure with mirror symmetry broken along the x\naxis direction. The electronic band structure is determined by angle-resolved\nphotoemission spectroscopy (ARPES). The significantly complex surface band\nstructure results from a combination of a surface band originating from the\nthree different azimuthal orientations of the (110) rhombohedral phase and\nUmklapp scattered branches of Au sp band. The experimental bands are compared\nto the calculated band structure of $3\\times\\sqrt{3}$ periodicity of Sb(110).\nMost of the experimental band dispersions are qualitatively reproduced by the\ntheoretical band structure except Umklapp scattered surface band. Taking\nadvantage of our DFT calculations, we found the quantum well(QW) Rashba\nsplitting bands appear at both $\\bar{\\Gamma}$ point and $\\bar{X}$ point.\nConsidering the surface Brillouin zone (SBZ) relationship between Sb(110)\nsub-unit cell and Au(111) surface, the distinct in energy position of QW states\nat $\\bar{\\Gamma}$ point and $\\bar{X}$ point is found be a combination of the\nrelative spin-orbital coupling(SOC) and the buckling of Sb monolayer on Au\nsurface that work together. The orbital decomposition of the Sb(110) projected\nband structure indicates hybridization between Sb py state and Au state can\nmodify the spin splitting of QW states due to the intrinsic large SOC of Au\nstate introduced into the QW states.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:10:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hu","Jinbang",""],["Wang","Xiansi",""],["Wells","Justin W",""]]}
{"id":"2308.06815","submitter":"Tiemo Bang","authors":"Tiemo Bang, Conor Power, Siavash Ameli, Natacha Crooks, Joseph M.\n  Hellerstein","title":"Optimizing the cloud? Don't train models. Build oracles!","comments":"Initial conference submission limited to 6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose cloud oracles, an alternative to machine learning for online\noptimization of cloud configurations. Our cloud oracle approach guarantees\ncomplete accuracy and explainability of decisions for problems that can be\nformulated as parametric convex optimizations. We give experimental evidence of\nthis technique's efficacy and share a vision of research directions for\nexpanding its applicability.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:12:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bang","Tiemo",""],["Power","Conor",""],["Ameli","Siavash",""],["Crooks","Natacha",""],["Hellerstein","Joseph M.",""]]}
{"id":"2308.06816","submitter":"Liam Connor","authors":"Myles B. Sherman, Liam Connor, Vikram Ravi, Casey Law, Ge Chen, Kritti\n  Sharma, Morgan Catha, Jakob T. Faber, Gregg Hallinan, Charlie Harnach, Greg\n  Hellbourg, Rick Hobbs, David Hodge, Mark Hodges, James W. Lamb, Paul\n  Rasmussen, Jun Shi, Dana Simard, Jean Somalwar, Reynier Squillace, Sander\n  Weinreb, David P. Woody, Nitika Yadlapalli","title":"Deep Synoptic Array Science: Implications of Faraday Rotation Measures\n  of Localized Fast Radio Bursts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Faraday rotation measures (RMs) of fast radio bursts (FRBs) offer the\nprospect of directly measuring extragalactic magnetic fields. We present an\nanalysis of the RMs of ten as yet non-repeating FRBs detected and localized to\nhost galaxies by the 110-antenna Deep Synoptic Array (DSA-110). We combine this\nsample with published RMs of 15 localized FRBs, nine of which are repeating\nsources. For each FRB in the combined sample, we estimate the host-galaxy\ndispersion measure (DM) contributions and extragalactic RM. We find compelling\nevidence that the extragalactic components of FRB RMs are often dominated by\ncontributions from the host-galaxy interstellar medium (ISM). Specifically, we\nfind that both repeating and as yet non-repeating FRBs show a correlation\nbetween the host-DM and host-RM in the rest frame, and we find an\nanti-correlation between extragalactic RM (in the observer frame) and redshift\nfor non-repeaters, as expected if the magnetized plasma is in the host galaxy.\nImportant exceptions to the ISM origin include a dense, magnetized circum-burst\nmedium in some repeating FRBs, and the intra-cluster medium (ICM) of host or\nintervening galaxy clusters. We find that the estimated ISM magnetic-field\nstrengths, $B_{||}$, are characteristically larger than those inferred from\nGalactic radio pulsars. This suggests either increased ISM magnetization in FRB\nhosts in comparison with the Milky Way, or that FRBs preferentially reside in\nregions of increased magnetic-field strength within their hosts.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:17:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sherman","Myles B.",""],["Connor","Liam",""],["Ravi","Vikram",""],["Law","Casey",""],["Chen","Ge",""],["Sharma","Kritti",""],["Catha","Morgan",""],["Faber","Jakob T.",""],["Hallinan","Gregg",""],["Harnach","Charlie",""],["Hellbourg","Greg",""],["Hobbs","Rick",""],["Hodge","David",""],["Hodges","Mark",""],["Lamb","James W.",""],["Rasmussen","Paul",""],["Shi","Jun",""],["Simard","Dana",""],["Somalwar","Jean",""],["Squillace","Reynier",""],["Weinreb","Sander",""],["Woody","David P.",""],["Yadlapalli","Nitika",""]]}
{"id":"2308.06817","submitter":"Zhuqing Jia","authors":"Haobo Jia and Zhuqing Jia","title":"The Asymptotic Capacity of $X$-Secure $T$-Private Linear Computation\n  with Graph Based Replicated Storage","comments":"39 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of $X$-secure $T$-private linear computation with graph based\nreplicated storage (GXSTPLC) is to enable the user to retrieve a linear\ncombination of messages privately from a set of $N$ distributed servers where\nevery message is only allowed to store among a subset of servers subject to an\n$X$-security constraint, i.e., any groups of up to $X$ colluding servers must\nreveal nothing about the messages. Besides, any groups of up to $T$ servers\ncannot learn anything about the coefficients of the linear combination\nretrieved by the user. In this work, we completely characterize the asymptotic\ncapacity of GXSTPLC, i.e., the supremum of average number of desired symbols\nretrieved per downloaded symbol, in the limit as the number of messages $K$\napproaches infinity. Specifically, it is shown that a prior linear programming\nbased upper bound on the asymptotic capacity of GXSTPLC due to Jia and Jafar is\ntight by constructing achievability schemes. Notably, our achievability scheme\nalso settles the exact capacity (i.e., for finite $K$) of $X$-secure linear\ncombination with graph based replicated storage (GXSLC). Our achievability\nproof builds upon an achievability scheme for a closely related problem named\nasymmetric $\\mathbf{X}$-secure $\\mathbf{T}$-private linear computation with\ngraph based replicated storage (Asymm-GXSTPLC) that guarantees non-uniform\nsecurity and privacy levels across messages and coefficients. In particular, by\ncarefully designing Asymm-GXSTPLC settings for GXSTPLC problems, the\ncorresponding Asymm-GXSTPLC schemes can be reduced to asymptotic capacity\nachieving schemes for GXSTPLC. In regard to the achievability scheme for\nAsymm-GXSTPLC, interesting aspects of our construction include a novel query\nand answer design which makes use of a Vandermonde decomposition of Cauchy\nmatrices, and a trade-off among message replication, security and privacy\nthresholds.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:20:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jia","Haobo",""],["Jia","Zhuqing",""]]}
{"id":"2308.06818","submitter":"L Mahadevan","authors":"Petur Bryde, Ian C. Davenport, and L. Mahadevan","title":"Optimal strategies for kiiking: active pumping to invert a swing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.pop-ph cond-mat.soft cs.SY eess.SY physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kiiking is an extreme sport in which athletes alternate between standing and\nsquatting to pump a standing swing till it is inverted and completes a\nrotation. A minimal model of the sport may be cast in terms of the control of\nan actively driven pendulum of varying length to determine optimal strategies.\nWe show that an optimal control perspective, subject to known biological\nconstraints, yields time-optimal control strategy similar to a greedy algorithm\nthat aims to maximize the potential energy gain at the end of every cycle. A\nreinforcement learning algorithms with a simple reward is consistent with the\noptimal control strategy. When accounting for air drag, our theoretical\nframework is quantitatively consistent with experimental observations while\npointing to the ultimate limits of kiiking performance.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:21:17 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bryde","Petur",""],["Davenport","Ian C.",""],["Mahadevan","L.",""]]}
{"id":"2308.06819","submitter":"Jo\\~ao Vitorino","authors":"Jo\\~ao Vitorino, Isabel Pra\\c{c}a, Eva Maia","title":"SoK: Realistic Adversarial Attacks and Defenses for Intelligent Network\n  Intrusion Detection","comments":"31 pages, 3 tables, 6 figures, Computers and Security journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning (ML) can be incredibly valuable to automate anomaly\ndetection and cyber-attack classification, improving the way that Network\nIntrusion Detection (NID) is performed. However, despite the benefits of ML\nmodels, they are highly susceptible to adversarial cyber-attack examples\nspecifically crafted to exploit them. A wide range of adversarial attacks have\nbeen created and researchers have worked on various defense strategies to\nsafeguard ML models, but most were not intended for the specific constraints of\na communication network and its communication protocols, so they may lead to\nunrealistic examples in the NID domain. This Systematization of Knowledge (SoK)\nconsolidates and summarizes the state-of-the-art adversarial learning\napproaches that can generate realistic examples and could be used in real ML\ndevelopment and deployment scenarios with real network traffic flows. This SoK\nalso describes the open challenges regarding the use of adversarial ML in the\nNID domain, defines the fundamental properties that are required for an\nadversarial example to be realistic, and provides guidelines for researchers to\nensure that their future experiments are adequate for a real communication\nnetwork.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:23:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vitorino","Jo\u00e3o",""],["Pra\u00e7a","Isabel",""],["Maia","Eva",""]]}
{"id":"2308.06820","submitter":"Jan O. Bauer","authors":"Jan O. Bauer","title":"Hierarchical variable clustering using singular value decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we present a novel method for hierarchically variable\nclustering using singular value decomposition. Our proposed approach provides a\nnon-parametric solution to identify block diagonal patterns in covariance\n(correlation) matrices, thereby grouping variables according to their\ndissimilarity. We explain the methodology and outline the incorporation of\nlinkage functions to assess dissimilarities between clusters. To validate the\nefficiency of our method, we perform both a simulation study and an analysis of\nreal-world data. Our findings show the approach's robustness. We conclude by\ndiscussing potential extensions and future directions for research in this\nfield. Supplementary materials for this article can be accessed online.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:26:16 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 07:59:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bauer","Jan O.",""]]}
{"id":"2308.06821","submitter":"Mohammed Talha Alam","authors":"Raza Imam, Mohammed Talha Alam","title":"Optimizing Brain Tumor Classification: A Comprehensive Study on Transfer\n  Learning and Imbalance Handling in Deep Learning Models","comments":"Our code is available at\n  https://github.com/Razaimam45/AI701-Project-Transfer-Learning-approach-for-imbalance-classification-of-Brain-Tumor-MRI-","journal-ref":"E-pi UAI workshop (UAI 2023)","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning has emerged as a prominent field in recent literature,\nshowcasing the introduction of models that utilize transfer learning to achieve\nremarkable accuracies in the classification of brain tumor MRI images. However,\nthe majority of these proposals primarily focus on balanced datasets,\nneglecting the inherent data imbalance present in real-world scenarios.\nConsequently, there is a pressing need for approaches that not only address the\ndata imbalance but also prioritize precise classification of brain cancer. In\nthis work, we present a novel deep learning-based approach, called Transfer\nLearning-CNN, for brain tumor classification using MRI data. The proposed model\nleverages the predictive capabilities of existing publicly available models by\nutilizing their pre-trained weights and transferring those weights to the CNN.\nBy leveraging a publicly available Brain MRI dataset, the experiment evaluated\nvarious transfer learning models for classifying different tumor types,\nincluding meningioma, glioma, and pituitary tumors. We investigate the impact\nof different loss functions, including focal loss, and oversampling methods,\nsuch as SMOTE and ADASYN, in addressing the data imbalance issue. Notably, the\nproposed strategy, which combines VGG-16 and CNN, achieved an impressive\naccuracy rate of 96%, surpassing alternative approaches significantly.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:30:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Imam","Raza",""],["Alam","Mohammed Talha",""]]}
{"id":"2308.06822","submitter":"Yongcun Song","authors":"Ziqi Wang, Yongcun Song, Enrique Zuazua","title":"Approximate and Weighted Data Reconstruction Attack in Federated\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a distributed learning paradigm that enables\nmultiple clients to collaborate on building a machine learning model without\nsharing their private data. Although FL is considered privacy-preserved by\ndesign, recent data reconstruction attacks demonstrate that an attacker can\nrecover clients' training data based on the parameters shared in FL. However,\nmost existing methods fail to attack the most widely used horizontal Federated\nAveraging (FedAvg) scenario, where clients share model parameters after\nmultiple local training steps. To tackle this issue, we propose an\ninterpolation-based approximation method, which makes attacking FedAvg\nscenarios feasible by generating the intermediate model updates of the clients'\nlocal training processes. Then, we design a layer-wise weighted loss function\nto improve the data quality of reconstruction. We assign different weights to\nmodel updates in different layers concerning the neural network structure, with\nthe weights tuned by Bayesian optimization. Finally, experimental results\nvalidate the superiority of our proposed approximate and weighted attack (AWA)\nmethod over the other state-of-the-art methods, as demonstrated by the\nsubstantial improvement in different evaluation metrics for image data\nreconstructions.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:40:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Ziqi",""],["Song","Yongcun",""],["Zuazua","Enrique",""]]}
{"id":"2308.06823","submitter":"Julia Baligacs","authors":"Julia Baligacs, Yann Disser, Irene Heinrich, Pascal Schweitzer","title":"Exploration of graphs with excluded minors","comments":"to appear at ESA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the online graph exploration problem proposed by Kalyanasundaram and\nPruhs (1994) and prove a constant competitive ratio on minor-free graphs. This\nresult encompasses and significantly extends the graph classes that were\npreviously known to admit a constant competitive ratio. The main ingredient of\nour proof is that we find a connection between the performance of the\nparticular exploration algorithm Blocking and the existence of light spanners.\nConversely, we exploit this connection to construct light spanners of bounded\ngenus graphs. In particular, we achieve a lightness that improves on the best\nknown upper bound for genus g>0 and recovers the known tight bound for the\nplanar case (g=0).\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:41:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Baligacs","Julia",""],["Disser","Yann",""],["Heinrich","Irene",""],["Schweitzer","Pascal",""]]}
{"id":"2308.06824","submitter":"John Salzer","authors":"David J. Carr, John J. Salzer, Caryl Gronwall, and Anna L. Williams","title":"Metal Abundances of Intermediate-Redshift AGN: Evidence for a Population\n  of Lower-Metallicty Seyfert 2 Galaxies at z = 0.3-0.4","comments":"17 pages, 12 figures; accepted for publication in the Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive oxygen abundances for two samples of Seyfert 2 (Sy2) active\ngalactic nuclei (AGN) selected from the KPNO International Spectroscopic Survey\n(KISS). The two samples from KISS include 17 intermediate-redshift (0.29 < z <\n0.42) Sy2s detected via their [O III] lines, and 35 low-redshift (z < 0.1),\nHalpha-detected Sy2s. The primary goal of this work is to explore whether the\nmetallicity distribution of these two samples changes with redshift. To\ndetermine the oxygen abundances of the KISS galaxies, we use Cloudy to create a\nlarge number of photoionization model grids by varying the temperature of the\naccretion disk, the ratio of X-ray to UV continuum light, the ionization\nparameter, the hydrogen density, and the metallicity of the narrow-line region\nclouds. We link the results of these models to the observed [O III]/H-beta and\n[N II]/H-alpha emission-line ratios of the KISS sample on the BPT diagram,\ninterpolating across the model grids to derive metallicity. The two redshift\nsamples overlap substantially in terms of derived metal abundances, but we find\nthat some of the intermediate-redshift Sy2 galaxies possess lower abundances\nthan their local universe counterparts. Our analysis provides evidence for\nmodest levels of chemical evolution (0.18 +/- 0.06 dex) over 3-4 Gyrs of\nlook-back time. We compare our results to other AGN abundance derivation\nmethods from the literature.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:52:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carr","David J.",""],["Salzer","John J.",""],["Gronwall","Caryl",""],["Williams","Anna L.",""]]}
{"id":"2308.06825","submitter":"Bhalchandra Pujari","authors":"Bhalchandra S. Pujari, Sagar Gehlot, Mihir Arjunwadkar, Dilip G.\n  Kanhere, Raymond Duraiswami","title":"On the relative abundances of Cavansite and Pentagonite","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cavansite is a visually stunning blue vanadosilicate mineral with limited\noccurrences worldwide, whereas Pentagonite is a closely related dimorph with\nsimilar physical and chemical properties, yet is extremely rare. The reasons\nbehind Pentagonite's exceptional rarity remain largely unknown. In this study,\nwe utilize density functional theory (DFT) to investigate the electronic\nstructures of Cavansite and Pentagonite at ground state and finite pressures.\nWe then employ the Boltzmann probability model to construct a comprehensive\nphase diagram that reveals the abundance of each species across a wide range of\npressure and temperature conditions. Our analysis reveals the key factors that\ncontribute to the relative scarcity of Pentagonite, including differences in\nstructural arrangement and electronic configurations between the two minerals.\nSpecifically, because of the peculiar arrangements of SiO4 polyhedra, Cavansite\nforms a compact structure (about 2.7% less in volume) resulting in lower\nenergy. We also show that at a temperature of about 600K only about 1%\nPentagonite can be formed. This probability is only slightly enhanced within a\npressure range of up to about 3GPa. We also find that vanadium induces a highly\nlocalized state in both of these otherwise large band gap insulators resulting\nin extremely weak magnetic phase that is unlikely to be observed at any\nreasonable finite temperature. Finally, our dehydration studies reveal that\nwater molecules are loosely bound inside the microporous crystals of Cavansite\nand Pentagonite, suggesting potential applications of these minerals in various\ntechnological fields.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 17:54:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pujari","Bhalchandra S.",""],["Gehlot","Sagar",""],["Arjunwadkar","Mihir",""],["Kanhere","Dilip G.",""],["Duraiswami","Raymond",""]]}
{"id":"2308.06826","submitter":"Jun Kitagawa","authors":"Seonghyeon Jeong and Jun Kitagawa","title":"Conditions for existence of single valued optimal transport maps on\n  convex boundaries with nontwisted cost","comments":"34 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that if $\\Omega\\subset \\mathbb{R}^{n+1}$ is a (not necessarily\nstrictly) convex, $C^1$ domain, and $\\mu$ and $\\bar{\\mu}$ are probability\nmeasures absolutely continuous with respect to surface measure on $\\partial\n\\Omega$, with densities bounded away from zero and infinity, whose\n$2$-Monge-Kantorovich distance is sufficiently small, then there exists a\ncontinuous Monge solution to the optimal transport problem with cost function\ngiven by the quadratic distance on the ambient space $\\mathbb{R}^{n+1}$. This\nresult is also shown to be sharp, via a counterexample when $\\Omega$ is\nuniformly convex but not $C^1$. Additionally, if $\\Omega$ is $C^{1, \\alpha}$\nregular for some $\\alpha$, then the Monge solution is shown to be H\\\"older\ncontinuous.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:12:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jeong","Seonghyeon",""],["Kitagawa","Jun",""]]}
{"id":"2308.06827","submitter":"Yue Liu","authors":"Yue Liu, Ke Liang, Jun Xia, Xihong Yang, Sihang Zhou, Meng Liu,\n  Xinwang Liu, Stan Z. Li","title":"Reinforcement Graph Clustering with Unknown Cluster Number","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep graph clustering, which aims to group nodes into disjoint clusters by\nneural networks in an unsupervised manner, has attracted great attention in\nrecent years. Although the performance has been largely improved, the excellent\nperformance of the existing methods heavily relies on an accurately predefined\ncluster number, which is not always available in the real-world scenario. To\nenable the deep graph clustering algorithms to work without the guidance of the\npredefined cluster number, we propose a new deep graph clustering method termed\nReinforcement Graph Clustering (RGC). In our proposed method, cluster number\ndetermination and unsupervised representation learning are unified into a\nuniform framework by the reinforcement learning mechanism. Concretely, the\ndiscriminative node representations are first learned with the contrastive\npretext task. Then, to capture the clustering state accurately with both local\nand global information in the graph, both node and cluster states are\nconsidered. Subsequently, at each state, the qualities of different cluster\nnumbers are evaluated by the quality network, and the greedy action is executed\nto determine the cluster number. In order to conduct feedback actions, the\nclustering-oriented reward function is proposed to enhance the cohesion of the\nsame clusters and separate the different clusters. Extensive experiments\ndemonstrate the effectiveness and efficiency of our proposed method. The source\ncode of RGC is shared at https://github.com/yueliu1999/RGC and a collection\n(papers, codes and, datasets) of deep graph clustering is shared at\nhttps://github.com/yueliu1999/Awesome-Deep-Graph-Clustering on Github.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:12:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yue",""],["Liang","Ke",""],["Xia","Jun",""],["Yang","Xihong",""],["Zhou","Sihang",""],["Liu","Meng",""],["Liu","Xinwang",""],["Li","Stan Z.",""]]}
{"id":"2308.06828","submitter":"Sanad Aburass","authors":"Sanad Aburass and Osama Dorgham","title":"An Ensemble Approach to Question Classification: Integrating Electra\n  Transformer, GloVe, and LSTM","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":"  Natural Language Processing (NLP) has emerged as a crucial technology for\nunderstanding and generating human language, playing an essential role in tasks\nsuch as machine translation, sentiment analysis, and more pertinently, question\nclassification. As a subfield within NLP, question classification focuses on\ndetermining the type of information being sought, a fundamental step for\ndownstream applications like question answering systems. This study presents an\ninnovative ensemble approach for question classification, combining the\nstrengths of Electra, GloVe, and LSTM models. Rigorously tested on the\nwell-regarded TREC dataset, the model demonstrates how the integration of these\ndisparate technologies can lead to superior results. Electra brings in its\ntransformer-based capabilities for complex language understanding, GloVe offers\nglobal vector representations for capturing word-level semantics, and LSTM\ncontributes its sequence learning abilities to model long-term dependencies. By\nfusing these elements strategically, our ensemble model delivers a robust and\nefficient solution for the complex task of question classification. Through\nrigorous comparisons with well-known models like BERT, RoBERTa, and DistilBERT,\nthe ensemble approach verifies its effectiveness by attaining an 80% accuracy\nscore on the test dataset.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:14:10 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 23:49:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aburass","Sanad",""],["Dorgham","Osama",""]]}
{"id":"2308.06829","submitter":"Hao Xu","authors":"Hao Xu, Yunqing Sun, Xiaoshuai Zhang, Erwu Liu and Chih-Lin I","title":"When Web 3.0 Meets Reality: A Hyperdimensional Fractal Polytope P2P\n  Ecosystems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AR cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Web 3.0 opens the world of new existence of the crypto-network-entity, which\nis independently defined by the public key pairs for entities and the\nconnection to the Web 3.0 cyberspace. In this paper, we first discover a\nspacetime coordinate system based on fractal polytope in any dimensions with\ndiscrete time offered by blockchain and consensus. Second, the novel network\nentities and functions are defined to make use of hyperdimensional\ndeterministic switching and routing protocols and blockchain-enabled mutual\nauthentication. In addition to spacetime network architecture, we also define a\nmulti-tier identity scheme which extends the native Web 3.0\ncrypto-network-entity to outer cyber and physical world, offering\nlegal-compliant anonymity and linkability to all derived identifiers of\nentities. In this way, we unify the holistic Web 3.0 network based on\npersistent spacetime and its entity extension to our cyber and physical world.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:14:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Hao",""],["Sun","Yunqing",""],["Zhang","Xiaoshuai",""],["Liu","Erwu",""],["I","Chih-Lin",""]]}
{"id":"2308.06830","submitter":"Ilan Hirshberg","authors":"Ilan Hirshberg","title":"Exotic circle actions on classifiable C*-algebras","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct an example of a simple nuclear separable unital stably finite\nZ-stable C*-algebra along with an action of the circle such that the crossed\nproduct is simple but not Z-stable.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:20:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hirshberg","Ilan",""]]}
{"id":"2308.06831","submitter":"Andrew Sims","authors":"Andrew Sims, D. Leann Long, Hemant K. Tiwari, Jinhong Cui, Dustin M.\n  Long, Todd M. Brown, Melissa J. Smith, and Emily B. Levitan","title":"Population-average mediation analysis for zero-inflated count outcomes","comments":"34 pages, 2 figures, 4 tables, 49 pages of Supplemental material, 2\n  supplemental figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mediation analysis is an increasingly popular statistical method for\nexplaining causal pathways to inform intervention. While methods have\nincreased, there is still a dearth of robust mediation methods for count\noutcomes with excess zeroes. Current mediation methods addressing this issue\nare computationally intensive, biased, or challenging to interpret. To overcome\nthese limitations, we propose a new mediation methodology for zero-inflated\ncount outcomes using the marginalized zero-inflated Poisson (MZIP) model and\nthe counterfactual approach to mediation. This novel work gives\npopulation-average mediation effects whose variance can be estimated rapidly\nvia delta method. This methodology is extended to cases with exposure-mediator\ninteractions. We apply this novel methodology to explore if diabetes diagnosis\ncan explain BMI differences in healthcare utilization and test model\nperformance via simulations comparing the proposed MZIP method to existing\nzero-inflated and Poisson methods. We find that our proposed method minimizes\nbias and computation time compared to alternative approaches while allowing for\nstraight-forward interpretations.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:21:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sims","Andrew",""],["Long","D. Leann",""],["Tiwari","Hemant K.",""],["Cui","Jinhong",""],["Long","Dustin M.",""],["Brown","Todd M.",""],["Smith","Melissa J.",""],["Levitan","Emily B.",""]]}
{"id":"2308.06832","submitter":"Nicholas Lindsay","authors":"Panagiotis Konstantis, Nicholas Lindsay","title":"Exotic almost complex circle actions on 6-manifolds","comments":"13 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Jang has proven a remarkable classification of $6$-dimensional manifolds\nhaving an almost complex circle action with $4$ fixed points. Jang classifies\nthe weights and associated multigraph into six cases, leaving the existence of\nconnected manifolds fitting into three of the cases unknown. We show that one\nof the unknown cases may be constructed by a surgery construction of Kustarev,\nand the underlying manifold is diffeomorphic to $S^4 \\times S^2$. We show that\nthe action is not equivariantly diffeomorphic to a linear one, thus giving a\nnew exotic $S^1$-action of on a product of spheres that preserves an almost\ncomplex structure. We also prove a uniqueness statement for the almost complex\nstructures produced by Kustarev's construction and prove some topological\napplications of Jang's classification.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:39:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Konstantis","Panagiotis",""],["Lindsay","Nicholas",""]]}
{"id":"2308.06833","submitter":"Moshe White","authors":"Moshe White","title":"A Van Kampen type obstruction for string graphs","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we prove that a graph is a string graph (the intersection graph\nof curves in the plane) if and only if it admits a drawing in the plane with\ncertain properties. This also allows us to define an algebraic obstruction,\nsimilar to the Van Kampen obstruction to embeddability, which must vanish for\nevery string graph. However, unlike in the case of graph planarity this\nobstruction is incomplete.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:46:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["White","Moshe",""]]}
{"id":"2308.06834","submitter":"Thomas Savage","authors":"Thomas Savage, Ashwin Nayak, Robert Gallo, Ekanath Rangan, Jonathan H\n  Chen","title":"Diagnostic Reasoning Prompts Reveal the Potential for Large Language\n  Model Interpretability in Medicine","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the major barriers to using large language models (LLMs) in medicine\nis the perception they use uninterpretable methods to make clinical decisions\nthat are inherently different from the cognitive processes of clinicians. In\nthis manuscript we develop novel diagnostic reasoning prompts to study whether\nLLMs can perform clinical reasoning to accurately form a diagnosis. We find\nthat GPT4 can be prompted to mimic the common clinical reasoning processes of\nclinicians without sacrificing diagnostic accuracy. This is significant because\nan LLM that can use clinical reasoning to provide an interpretable rationale\noffers physicians a means to evaluate whether LLMs can be trusted for patient\ncare. Novel prompting methods have the potential to expose the black box of\nLLMs, bringing them one step closer to safe and effective use in medicine.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:04:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Savage","Thomas",""],["Nayak","Ashwin",""],["Gallo","Robert",""],["Rangan","Ekanath",""],["Chen","Jonathan H",""]]}
{"id":"2308.06835","submitter":"Bowen Yan","authors":"Bowen Yan, Shawn X. Cui","title":"Generalized Kitaev Spin Liquid model and Emergent Twist Defect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Kitaev spin liquid model on honeycomb lattice offers an intriguing\nfeature that encapsulates both Abelian and non-Abelian anyons. Recent studies\nsuggest that the comprehensive phase diagram of possible generalized Kitaev\nmodel largely depends on the specific details of the discrete lattice, which\nsomewhat deviates from the traditional understanding of \"topological\" phases.\nIn this paper, we propose an adapted version of the Kitaev spin liquid model on\narbitrary planar lattices. Our revised model recovers the toric code model\nunder certain parameter selections within the Hamiltonian terms. Our research\nindicates that changes in parameters can initiate the emergence of holes,\ndomain walls, or twist defects. Notably, the twist defect, which presents as a\nlattice dislocation defect, exhibits non-Abelian braiding statistics upon\ntuning the coefficients of the Hamiltonian on a standard translationally\ninvariant lattice. Additionally, we illustrate that the creation, movement, and\nfusion of these defects can be accomplished through natural time evolution by\nlinearly interpolating the static Hamiltonian. These defects demonstrate the\nIsing anyon fusion rule as anticipated. Our findings hint at possible\nimplementation in actual physical materials owing to a more realistically\nachievable two-body interaction.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:04:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yan","Bowen",""],["Cui","Shawn X.",""]]}
{"id":"2308.06836","submitter":"Yang Liu","authors":"Yang Liu","title":"Global Weak Solutions for the Half-Wave Maps Equation in $\\mathbb{R}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish the existence of weak global solutions of the half-wave maps\nequation with the target $S^2$ on $\\mathbb{R}^{1+1}$ with large initial data in\n$\\dot{H}^1 \\cap \\dot{H}^{\\frac{1}{2}}(\\mathbb{R})$. We first prove the global\nwell-posedness of a regularized equation. Then we show that the weak limit of\nthe regularized solutions is a weak solution of the half-wave maps equation as\nthe regularization parameter $\\varepsilon \\rightarrow 0$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:19:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yang",""]]}
{"id":"2308.06837","submitter":"Anton Klyachko","authors":"Filipp D. Denissov and Anton A. Klyachko","title":"The centre of a finitely generated strongly verbally closed group is\n  almost always pure","comments":"5 pages. A Russian version of this paper is at\n  http://halgebra.math.msu.su/staff/klyachko/papers.htm","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The assertion in the title implies that many interesting groups (e.g., all\nnon-abelian braid groups or ${\\bf SL}_{100}(\\mathbb Z)$) are not strongly\nverbally closed, i.e., they embed into some finitely generated groups as\nverbally closed subgroups, which are not retracts.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:33:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Denissov","Filipp D.",""],["Klyachko","Anton A.",""]]}
{"id":"2308.06838","submitter":"Quang Truong","authors":"Quang Truong and Peter Chin","title":"Generalizing Topological Graph Neural Networks with Paths","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While Graph Neural Networks (GNNs) have made significant strides in diverse\nareas, they are hindered by a theoretical constraint known as the\n1-Weisfeiler-Lehmann test. Even though latest advancements in higher-order GNNs\ncan overcome this boundary, they typically center around certain graph\ncomponents like cliques or cycles. However, our investigation goes a different\nroute. We put emphasis on paths, which are inherent in every graph. We are able\nto construct a more general topological perspective and form a bridge to\ncertain established theories about other topological domains. Interestingly,\nwithout any assumptions on graph sub-structures, our approach surpasses earlier\ntechniques in this field, achieving state-of-the-art performance on several\nbenchmarks.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:45:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Truong","Quang",""],["Chin","Peter",""]]}
{"id":"2308.06839","submitter":"David T. Nguyen","authors":"David T. Nguyen","title":"Generalized divisor functions in arithmetic progressions: I","comments":"in: J. Number Theory 227 (2021), pp. 30-93","journal-ref":"J. Number Theory 227 (2021), pp. 30-93","doi":"10.1016/j.jnt.2021.03.021","report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove some distribution results for the $k$-fold divisor function in\narithmetic progressions to moduli that exceed the square-root of length $X$ of\nthe sum, with appropriate constrains and averaging on the moduli, saving a\npower of $X$ from the trivial bound. On assuming the Generalized Riemann\nHypothesis, we obtain uniform power saving error terms that are independent of\n$k$.\n  We follow and specialize Y.T. Zhang's method on bounded gaps between primes\nto our setting. Our arguments are essentially self-contained, with the\nexception on the use of Deligne's work on the Riemann Hypothesis for varieties\nover finite fields. In particular, we avoid the reliance on Siegel's theorem,\nleading to some effective estimates.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:46:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nguyen","David T.",""]]}
{"id":"2308.06840","submitter":"Oliver Schmidt","authors":"Tianyi Chu, Oliver T. Schmidt","title":"Mesh-Free Hydrodynamic Stability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A specialized mesh-free radial basis function-based finite difference\n(RBF-FD) discretization is used to solve the large eigenvalue problems arising\nin hydrodynamic stability analyses of flows in complex domains. Polyharmonic\nspline functions with polynomial augmentation (PHS+poly) are used to construct\nthe discrete linearized incompressible and compressible Navier-Stokes operators\non scattered nodes. Rigorous global and local eigenvalue stability studies of\nthese global operators and their constituent RBF stencils provide a set of\nparameters that guarantee stability while balancing accuracy and computational\nefficiency. Specialized elliptical stencils to compute boundary-normal\nderivatives are introduced and the treatment of the pole singularity in\ncylindrical coordinates is discussed. The numerical framework is demonstrated\nand validated on a number of hydrodynamic stability methods ranging from\nclassical linear theory of laminar flows to state-of-the-art non-modal\napproaches that are applicable to turbulent mean flows. The examples include\nlinear stability, resolvent, and wavemaker analyses of cylinder flow at\nReynolds numbers ranging from 47 to 180, and resolvent and wavemaker analyses\nof the self-similar flat-plate boundary layer at a Reynolds number as well as\nthe turbulent mean of a high-Reynolds-number transonic jet at Mach number 0.9.\nAll previously-known results are found in close agreement with the literature.\nFinally, the resolvent-based wavemaker analyses of the Blasius boundary layer\nand turbulent jet flows offer new physical insight into the modal and non-modal\ngrowth in these flows.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:49:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chu","Tianyi",""],["Schmidt","Oliver T.",""]]}
{"id":"2308.06841","submitter":"Oleg V. Zaboronski","authors":"Roger Tribe and Oleg Zaboronski","title":"Averages of products of characteristic polynomials and the law of real\n  eigenvalues for the real Ginibre ensemble","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An elementary derivation of the Borodin-Sinclair-Forrester-Nagao Pfaffian\npoint process, which characterises the law of real eigenvalues for the real\nGinibre ensemble in the large matrix size limit, uses the averages of products\nof characteristic polynomials. This derivation reveals a number of interesting\nstructures associated with the real Ginibre ensemble such as the hidden\nsymplectic symmetry of the statistics of real eigenvalues and an integral\nrepresentation for the $K$-point correlation function for any $K\\in \\mathbb{N}$\nin terms of an asymptotically exact integral over the symmetric space\n$U(2K)/USp(2K)$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 19:59:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tribe","Roger",""],["Zaboronski","Oleg",""]]}
{"id":"2308.06842","submitter":"Noemie Globus","authors":"No\\'emie Globus, Anatoli Fedynitch, Roger Blandford","title":"Extreme Energy Cosmic Rays \"Treasure Maps\": a new methodology to unveil\n  the nature of cosmic accelerators","comments":"8 pages, 2 figures, accepted for publication on Proceedings of\n  Science for the 38th International Cosmic Ray Conference (ICRC2023)","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":"  Extreme Energy Cosmic Rays, EECRs -- cosmic rays with energies beyond the GZK\ncutoff (i.e. greater than 100 EeV) are scarce. Only a few of such events have\nbeen detected by air shower experiments and the nature of the primary particles\nare still unknown. Individual EECRs sources become more prominent, relative to\nthe background, as the horizon diminishes. We show that an event-by-event,\ncomposition-dependent observatory would allow us to limit the character of the\nsources and learn about the intervening magnetic fields, as the deflections in\nthe intervening Galactic and extragalactic magnetic fields depend on the nature\nof the particle. A major goal here is to provide a methodology to distinguish\nbetween steady and transient sources.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 20:07:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Globus","No\u00e9mie",""],["Fedynitch","Anatoli",""],["Blandford","Roger",""]]}
{"id":"2308.06843","submitter":"Artur L Gower","authors":"Aris Karnezis, Paulo S. Piva, Art L. Gower","title":"The average transmitted wave in random particulate materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microwave remote sensing is significantly altered when passing through clouds\nor dense ice. This phenomenon isn't unique to microwaves; for instance,\nultrasound is also disrupted when traversing through heterogeneous tissues.\nUnderstanding the average transmission in particle-filled environments is\ncentral to improve data extraction or even to create materials that can\nselectively block or absorb certain wave frequencies. Most methods that\ncalculate the average transmitted field assume that it satisfies a wave\nequation with a complex effective wavenumber. However, recent theoretical work\nhas predicted more than one effective wave propagating even in a material which\nis statistical isotropic and for scalar waves. In this work we provide the\nfirst clear evidence of these predicted multiple effective waves by using high\nfidelity Monte-Carlo simulations that do not make any statistical assumptions.\nTo achieve this, we also had to fill in a missing link in the theory for\nparticulate materials: we prove that the incident wave does not propagate\nwithin the material, which is usually taken as an assumption called the\nEwald-Oseen extinction theorem. By proving this we conclude that the extinction\nlength - the distance it takes for the incident wave to be extinct - is equal\nto the correlation length between the particles.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 20:31:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Karnezis","Aris",""],["Piva","Paulo S.",""],["Gower","Art L.",""]]}
{"id":"2308.06844","submitter":"Pavel Mnev","authors":"Olga Chekeres, Santosh Kandel, Andrey Losev, Pavel Mnev, Konstantin\n  Wernli, Donald R. Youmans","title":"On enumerative problems for maps and quasimaps: freckles and scars","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the question of counting maps between projective spaces such that\nimages of cycles on the source intersect cycles on the target. In this paper we\ndo it by embedding maps into quasimaps that form a projective space of their\nown. When a quasimap is not a map, it contains freckles (studied earlier)\nand/or scars, appearing when the complex dimension of the source is greater\nthan one. We consider a lot of examples showing that freckle/scar calculus\n(using excess intersection theory) works. We also propose the \"smooth\nconjecture\" that may lead to computation of the number of maps by an integral\nover the space of quasimaps.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 20:41:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chekeres","Olga",""],["Kandel","Santosh",""],["Losev","Andrey",""],["Mnev","Pavel",""],["Wernli","Konstantin",""],["Youmans","Donald R.",""]]}
{"id":"2308.06845","submitter":"Matthew Williams","authors":"Ryan Hornby and Matthew R. Williams and Terrance D. Savitsky and\n  Mahmoud Elkasabi","title":"csSampling: An R Package for Bayesian Models for Complex Survey Data","comments":"22 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present csSampling, an R package for estimation of Bayesian models for\ndata collected from complex survey samples. csSampling combines functionality\nfrom the probabilistic programming language Stan (via the rstan and brms R\npackages) and the handling of complex survey data from the survey R package.\nUnder this approach, the user creates a survey-weighted model in brms or\nprovides a custom weighted model via rstan. Survey design information is\nprovided via the svydesign function of the survey package. The cs_sampling\nfunction of csSampling estimates the weighted stan model and provides an\nasymptotic covariance correction for model mis-specification due to using\nsurvey sampling weights as plug-in values in the likelihood. This is often\nknown as a ``design effect'' which is the ratio between the variance from a\ncomplex survey sample and a simple random sample of the same size. The\nresulting adjusted posterior draws can then be used for the usual Bayesian\ninference while also achieving frequentist properties of asymptotic consistency\nand correct uncertainty (e.g. coverage).\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 20:49:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hornby","Ryan",""],["Williams","Matthew R.",""],["Savitsky","Terrance D.",""],["Elkasabi","Mahmoud",""]]}
{"id":"2308.06846","submitter":"Sudipa Mondal","authors":"Tathagata Mandal, Sudipa Mondal","title":"Contribution of symmetric power transfers to the cuspidal cohomology of\n  ${\\rm GL_n}$","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\pi$ be a cuspidal automorphic representation of ${\\mathrm\n{GL}}_2(\\mathbb{A}_\\mathbb{Q})$. Newton and Thorne have proved that for every\n$n\\geq 1$, the symmetric power lifting ${{\\mathrm {sym}}^n(\\pi)}$ is\nautomorphic if $\\pi$ is attached to a non-CM Hecke eigenform. In this article,\nwe establish an asymptotic estimate of the number of cuspidal automorphic\nrepresentations of ${\\mathrm {GL}}_{n+1}(\\mathbb{A}_\\mathbb{Q})$ which\ncontribute to the cuspidal cohomology of ${\\mathrm {GL}}_{n+1}$ and are\nobtained by symmetric $n$th transfer of cuspidal representations of ${\\mathrm\n{GL}}_2(\\mathbb{A}_\\mathbb{Q})$. Here we fix the weight and vary the level.\nThis generalises the previous works done for ${\\mathrm {GL}}_3$ and ${\\mathrm\n{GL}}_4$.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:09:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mandal","Tathagata",""],["Mondal","Sudipa",""]]}
{"id":"2308.06847","submitter":"Mario Maurelli","authors":"Mario Maurelli, Daniela Morale, Stefania Ugolini","title":"Well-posedness of a reaction-diffusion model with stochastic dynamical\n  boundary conditions","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 study the well-posedness of a nonlinear reaction diffusion partial\ndifferential equation system on the half-line coupled with a stochastic\ndynamical boundary condition, a random system arising in the description of the\nevolution of the chemical reaction of sulphur dioxide with the surface of\ncalcium carbonate stones. The boundary condition is given by a Jacobi process,\nsolution to a Brownian motion-driven stochastic differential equation with a\nmean reverting drift and a bounded diffusion coefficient. The main result is\nthe global existence and the pathwise uniqueness of mild solutions. The proof\nrelies on a splitting strategy, which allows to deal with the low regularity of\nthe dynamical boundary condition.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:11:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Maurelli","Mario",""],["Morale","Daniela",""],["Ugolini","Stefania",""]]}
{"id":"2308.06848","submitter":"Christian Ketterer","authors":"Christian Ketterer","title":"Glued spaces and lower Ricci curvature bounds","comments":"38 pages, Corollary 1.9 added, improved Theorem 1.1, comments are\n  welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider Riemannian manifolds $M_i$, ${i=0,1}$, with boundary and\n$\\Phi_i\\in C^{\\infty}(M_i)$ non-negative such that the pair $(M_i, \\Phi_i)$\nadmits Bakry-Emery $N$-Ricci curvature bounded from below by $K$. Let $Y_0$ and\n$Y_1$ be isometric, compact components of the boundary of $M_0$ and $M_1$\nrespectively and assume $\\Phi_0=\\Phi_1$ on $Y_0\\simeq Y_1$. We assume that\n$\\Pi_0+\\Pi_1=\\Pi \\geq 0$ (*), and $d\\Phi_0(\\nu_0)+ d\\Phi_1(\\nu_1)\\leq\n\\mbox{tr}\\Pi$ on $Y_0\\simeq Y_1$ (**) where $\\Pi_i$ is the second fundamental\nform and $\\nu_i$ is inner unit normal field along $\\partial M_i$. We show that\nunder assumptions on $\\partial M_i \\backslash Y_i$ the metric glued space\n$M=M_0\\cup_{\\mathcal I}M_1$ together with the measure $\\Phi d\\mathcal H^n$\nsatisfies the curvature-dimension condition $CD(K,\\lceil N \\rceil)$ where\n$\\Phi: M\\rightarrow [0,\\infty)$ arises tautologically from $\\Phi_1$ and\n$\\Phi_2$. Moreover, $(M, \\Phi d\\mathcal H^n)$ is the collapsed Gromov-Hausdorff\nlimit of smooth, $\\lceil N \\rceil$-dimensional Riemannian manifolds with Ricci\ncurvature bounded from below by $K- \\epsilon$ and is also the measured\nGromov-Hausdorff limit of smooth, weighted Riemannian manifolds such that the\nBakry-Emery $\\lceil N \\rceil$-Ricci curvature is bounded from below by\n$K-\\epsilon$.\n  On the other hand we show that given a glued manifold as described it\nsatisfies the curvature-dimension condition $CD(K,N)$ only if the condition (*)\nand (**) hold. The latter statement generalizes a theorem of Kosovski\\u{\\i} for\nsectional lower curvature bounds and especially applies for the unweighted case\nwhere a lower Ricci curvature bound and $\\dim_{M_i}\\leq N$ replaces a lower\nBakry-Emery $N$-Ricci curvature bound.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:37:19 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 17:38:12 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 19:00:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ketterer","Christian",""]]}
{"id":"2308.06849","submitter":"Hongxiang Fan","authors":"Hongxiang Fan and Hao Chen and Liam Castelli and Zhiqiang Que and He\n  Li and Kenneth Long and Wayne Luk","title":"When Monte-Carlo Dropout Meets Multi-Exit: Optimizing Bayesian Neural\n  Networks on FPGA","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":"  Bayesian Neural Networks (BayesNNs) have demonstrated their capability of\nproviding calibrated prediction for safety-critical applications such as\nmedical imaging and autonomous driving. However, the high algorithmic\ncomplexity and the poor hardware performance of BayesNNs hinder their\ndeployment in real-life applications. To bridge this gap, this paper proposes a\nnovel multi-exit Monte-Carlo Dropout (MCD)-based BayesNN that achieves\nwell-calibrated predictions with low algorithmic complexity. To further reduce\nthe barrier to adopting BayesNNs, we propose a transformation framework that\ncan generate FPGA-based accelerators for multi-exit MCD-based BayesNNs. Several\nnovel optimization techniques are introduced to improve hardware performance.\nOur experiments demonstrate that our auto-generated accelerator achieves higher\nenergy efficiency than CPU, GPU, and other state-of-the-art hardware\nimplementations.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:42:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fan","Hongxiang",""],["Chen","Hao",""],["Castelli","Liam",""],["Que","Zhiqiang",""],["Li","He",""],["Long","Kenneth",""],["Luk","Wayne",""]]}
{"id":"2308.06850","submitter":"Laurie Williams","authors":"William Enck, Yasemin Acar, Michel Cukier, Alexandros Kapravelos,\n  Christian K\\\"astner, Laurie Williams","title":"S3C2 Summit 2023-06: Government Secure Supply Chain Summit","comments":"arXiv admin note: text overlap with arXiv:2307.16557,\n  arXiv:2307.15642","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent years have shown increased cyber attacks targeting less secure\nelements in the software supply chain and causing fatal damage to businesses\nand organizations. Past well-known examples of software supply chain attacks\nare the SolarWinds or log4j incidents that have affected thousands of customers\nand businesses. The US government and industry are equally interested in\nenhancing software supply chain security. On June 7, 2023, researchers from the\nNSF-supported Secure Software Supply Chain Center (S3C2) conducted a Secure\nSoftware Supply Chain Summit with a diverse set of 17 practitioners from 13\ngovernment agencies. The goal of the Summit was two-fold: (1) to share our\nobservations from our previous two summits with industry, and (2) to enable\nsharing between individuals at the government agencies regarding practical\nexperiences and challenges with software supply chain security. For each\ndiscussion topic, we presented our observations and take-aways from the\nindustry summits to spur conversation. We specifically focused on the Executive\nOrder 14028, software bill of materials (SBOMs), choosing new dependencies,\nprovenance and self-attestation, and large language models. The open\ndiscussions enabled mutual sharing and shed light on common challenges that\ngovernment agencies see as impacting government and industry practitioners when\nsecuring their software supply chain. In this paper, we provide a summary of\nthe Summit.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:51:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Enck","William",""],["Acar","Yasemin",""],["Cukier","Michel",""],["Kapravelos","Alexandros",""],["K\u00e4stner","Christian",""],["Williams","Laurie",""]]}
{"id":"2308.06851","submitter":"Eamon Mukhopadhyay","authors":"Eamon Mukhopadhyay","title":"Optimizing Offensive Gameplan in the National Basketball Association\n  with Machine Learning","comments":"6 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":"  Throughout the analytical revolution that has occurred in the NBA, the\ndevelopment of specific metrics and formulas has given teams, coaches, and\nplayers a new way to see the game. However - the question arises - how can we\nverify any metrics? One method would simply be eyeball approximation (trying\nout many different gameplans) and/or trial and error - an estimation-based and\ncostly approach. Another approach is to try to model already existing metrics\nwith a unique set of features using machine learning techniques. The key to\nthis approach is that with these features that are selected, we can try to\ngauge the effectiveness of these features combined, rather than using\nindividual analysis in simple metric evaluation. If we have an accurate model,\nit can particularly help us determine the specifics of gameplan execution. In\nthis paper, the statistic ORTG (Offensive Rating, developed by Dean Oliver) was\nfound to have a correlation with different NBA playtypes using both a linear\nregression model and a neural network regression model, although ultimately, a\nneural network worked slightly better than linear regression. Using the\naccuracy of the models as a justification, the next step was to optimize the\noutput of the model with test examples, which would demonstrate the combination\nof features to best achieve a highly functioning offense.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:03:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mukhopadhyay","Eamon",""]]}
{"id":"2308.06852","submitter":"Ivan Dimitrov","authors":"Ivan Dimitrov and Rita Fioresi","title":"Generalied root systems","comments":"39 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the notion of a root system by relaxing the conditions that\nensure that it is invariant under reflections and study the resulting\nstructures, which we call generalized root systems (GRSs for short). Since both\nKostant root systems and root systems of Lie superalgebras are examples of\nGRSs, studying GRSs provides a uniform axiomatic approach to studying both of\nthem. GRSs inherit many of the properties of root systems. In order to\ncompensate for the lack of reflections (and hence of a Weyl group), we\nintroduce the notion of a virtual reflection.\n  The most significant new feature of GRSs is that, along with subsystems, one\ncan define quotient GRSs. Both Kostant root systems and root systems of Lie\nsuperalgebras are equivalent to quotients of root systems and all root systems\nare isomorphic to quotients of simply-laced root systems. We classify all rank\n2 GRSs and show that they are equivalent to quotients of root systems. Finally,\nwe determine all isomorphisms between quotients of root systems, providing a\ndifferent point of view on flag manifolds and reproving results of Alekseevsky\nand Graev.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:09:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dimitrov","Ivan",""],["Fioresi","Rita",""]]}
{"id":"2308.06853","submitter":"Xinyi Wang","authors":"Xinyi Wang, Angeliki Katsenou, and David Bull","title":"UGC Quality Assessment: Exploring the Impact of Saliency in Deep\n  Feature-Based Quality Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The volume of User Generated Content (UGC) has increased in recent years. The\nchallenge with this type of content is assessing its quality. So far, the\nstate-of-the-art metrics are not exhibiting a very high correlation with\nperceptual quality. In this paper, we explore state-of-the-art metrics that\nextract/combine natural scene statistics and deep neural network features. We\nexperiment with these by introducing saliency maps to improve perceptibility.\nWe train and test our models using public datasets, namely, YouTube-UGC and\nKoNViD-1k. Preliminary results indicate that high correlations are achieved by\nusing only deep features while adding saliency is not always boosting the\nperformance. Our results and code will be made publicly available to serve as a\nbenchmark for the research community and can be found on our project page:\nhttps://github.com/xinyiW915/SPIE-2023-Supplementary.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:14:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Xinyi",""],["Katsenou","Angeliki",""],["Bull","David",""]]}
{"id":"2308.06854","submitter":"Ruofan Jiang","authors":"Ruofan Jiang","title":"Characteristic $p$ analogues of the Mumford--Tate and Andr\\'e--Oort\n  conjectures for ordinary GSpin Shimura varieties","comments":"43 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $p$ be an odd prime. We state characteristic $p$ analogues of the\nMumford--Tate conjecture and the Andr\\'e--Oort conjecture for ordinary strata\nof mod $p$ Shimura varieties. We prove the conjectures in the case of GSpin\nShimura varieties and products of modular curves. The two conjectures are both\nrelated to a notion of linearity for mod $p$ Shimura varieties, about which\nChai has formulated the Tate-linear conjecture. We will first treat the\nTate-linear conjecture, above which we then build the proof of the\ncharacteristic $p$ analogue of the Mumford--Tate conjecture. Finally, we use\nthe Tate-linear conjecture and the characteristic $p$ analogue of the\nMumford--Tate conjecture to prove the characteristic $p$ analogue of the\nAndr\\'e--Oort conjecture. The proofs of these conjectures use Chai's results on\nmonodromy of $p$-divisible groups and rigidity theorems for formal tori, as\nwell as Crew's parabolicity conjecture which is recently proven by D'Addezio.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:18:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Ruofan",""]]}
{"id":"2308.06855","submitter":"Matt O'Shaughnessy","authors":"Matthew O'Shaughnessy and Mark Davenport and Christopher Rozell","title":"Distance preservation in state-space methods for detecting causal\n  interactions in dynamical systems","comments":"24 pages, 8 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze the popular ``state-space'' class of algorithms for detecting\ncasual interaction in coupled dynamical systems. These algorithms are often\njustified by Takens' embedding theorem, which provides conditions under which\nrelationships involving attractors and their delay embeddings are continuous.\nIn practice, however, state-space methods often do not directly test\ncontinuity, but rather the stronger property of how these relationships\npreserve inter-point distances. This paper theoretically and empirically\nexplores state-space algorithms explicitly from the perspective of distance\npreservation. We first derive basic theoretical guarantees applicable to simple\ncoupled systems, providing conditions under which the distance preservation of\na certain map reveals underlying causal structure. Second, we demonstrate\nempirically that typical coupled systems do not satisfy distance preservation\nassumptions. Taken together, our results underline the dependence of\nstate-space algorithms on intrinsic system properties and the relationship\nbetween the system and the function used to measure it -- properties that are\nnot directly associated with causal interaction.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:35:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["O'Shaughnessy","Matthew",""],["Davenport","Mark",""],["Rozell","Christopher",""]]}
{"id":"2308.06856","submitter":"Xiaoxu Wu","authors":"Avy Soffer, Jiayan Wu, Xiaoxu Wu, Ting Zhang","title":"On the large time asymptotics of bi-laplacian Schr\\\"odinger equation\n  with general data","comments":"27 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study the bi-laplacian Schr\\\"odinger equation with a general interaction\nterm, which can be either linear or nonlinear, and is time-dependent. We prove\nthat the global solutions for this equation are asymptotically given by a free\nwave and a weakly localized part. The proof relies on constructing the Free\nChannel Wave Operator in a new way, based on the method developed from recent\nstudies \\cite{SW20221}.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:45:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Soffer","Avy",""],["Wu","Jiayan",""],["Wu","Xiaoxu",""],["Zhang","Ting",""]]}
{"id":"2308.06857","submitter":"Zhenwei Yao","authors":"Honghui Sun and Zhenwei Yao","title":"Conformal order and Poincar$\\rm{\\acute{e}}$-Klein mapping underlying\n  electrostatics-driven inhomogeneity in tethered membranes","comments":"14 pages, 9 figures","journal-ref":"Physical Review E 108, 024115 (2023)","doi":"10.1103/PhysRevE.108.024115","report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Understanding the organization of matter under the long-range electrostatic\nforce is a fundamental problem in multiple fields. In this work, based on the\nelectrically charged tethered membrane model, we reveal regular structures\nunderlying the lowest-energy states of inhomogeneously stretched planar\nlattices by a combination of numerical simulation and analytical geometric\nanalysis. Specifically, we show the conformal order characterized by the\npreserved bond angle in the lattice deformation, and reveal the\nPoincar$\\rm{\\acute{e}}$-Klein mapping underlying the electrostatics-driven\ninhomogeneity. The discovery of the Poincar$\\rm{\\acute{e}}$-Klein mapping,\nwhich connects the Poincar$\\rm{\\acute{e}}$ disk and the Klein disk for the\nhyperbolic plane, implies the connection of long-range electrostatic force and\nhyperbolic geometry. We also discuss lattices with patterned charges of\nopposite signs for modulating in-plane inhomogeneity and even creating 3D\nshapes, which may have a connection to metamaterials design. This work suggests\nthe geometric analysis as a promising approach for elucidating the organization\nof matter under the long-range force.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:57:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sun","Honghui",""],["Yao","Zhenwei",""]]}
{"id":"2308.06858","submitter":"Huijie Qiao","authors":"Huijie Qiao and Shengqing Zhu","title":"Large deviation principles of nonlinear filtering for McKean-Vlasov\n  stochastic differential equations","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 study large deviation principles of nonlinear filtering for\nMcKean-Vlasov stochastic differential equations. First of all, we establish the\nlarge deviation principle for the space-distribution dependent Zakai equation\nby a weak convergence approach. Then based on the obtained result and the\nrelationship between the space-distribution dependent Zakai equation and the\nspace-distribution dependent Kushner-Stratonovich equation, the large deviation\nprinciple for the latter is proved.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:57:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qiao","Huijie",""],["Zhu","Shengqing",""]]}
{"id":"2308.06859","submitter":"Jean-Simon Lemay","authors":"Jean-Simon Pacaud Lemay","title":"Cartesian Differential Kleisli Categories","comments":"For the proceedings of MFPS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cartesian differential categories come equipped with a differential\ncombinator which axiomatizes the fundamental properties of the total derivative\nfrom differential calculus. The objective of this paper is to understand when\nthe Kleisli category of a monad is a Cartesian differential category. We\nintroduce Cartesian differential monads, which are monads whose Kleisli\ncategory is a Cartesian differential category by way of lifting the\ndifferential combinator from the base category. Examples of Cartesian\ndifferential monads include tangent bundle monads and reader monads. We give a\nprecise characterization of Cartesian differential categories which are Kleisli\ncategories of Cartesian differential monads using abstract Kleisli categories.\nWe also show that the Eilenberg-Moore category of a Cartesian differential\nmonad is a tangent category.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:13:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lemay","Jean-Simon Pacaud",""]]}
{"id":"2308.06860","submitter":"Ioannis Hadjifrangiskou","authors":"Ioannis Hadjifrangiskou, Liam J. Ruske, Julia M. Yeomans","title":"Active nematics with deformable particles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hydrodynamic theory of active nematics has been often used to describe\nthe spatio-temporal dynamics of cell flows and motile topological defects\nwithin soft confluent tissues. Those theories, however, often rely on the\nassumption that tissues consist of cells with a fixed, anisotropic shape and do\nnot resolve dynamical cell shape changes due to flow gradients. In this paper\nwe extend the continuum theory of active nematics to include cell shape\ndeformability. We find that circular cells in tissues must generate sufficient\nactive stress to overcome an elastic barrier to deforming their shape in order\nto drive tissue-scale flows. Above this threshold the systems enter a dynamical\nsteady-state with regions of elongated cells and strong flows coexisting with\nquiescent regions of isotropic cells.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:26:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hadjifrangiskou","Ioannis",""],["Ruske","Liam J.",""],["Yeomans","Julia M.",""]]}
{"id":"2308.06861","submitter":"Fahimeh Fooladgar","authors":"Fahimeh Fooladgar, Minh Nguyen Nhat To, Parvin Mousavi, Purang\n  Abolmaesumi","title":"Manifold DivideMix: A Semi-Supervised Contrastive Learning Framework for\n  Severe Label Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks have proven to be highly effective when large amounts of\ndata with clean labels are available. However, their performance degrades when\ntraining data contains noisy labels, leading to poor generalization on the test\nset. Real-world datasets contain noisy label samples that either have similar\nvisual semantics to other classes (in-distribution) or have no semantic\nrelevance to any class (out-of-distribution) in the dataset. Most\nstate-of-the-art methods leverage ID labeled noisy samples as unlabeled data\nfor semi-supervised learning, but OOD labeled noisy samples cannot be used in\nthis way because they do not belong to any class within the dataset. Hence, in\nthis paper, we propose incorporating the information from all the training data\nby leveraging the benefits of self-supervised training. Our method aims to\nextract a meaningful and generalizable embedding space for each sample\nregardless of its label. Then, we employ a simple yet effective K-nearest\nneighbor method to remove portions of out-of-distribution samples. By\ndiscarding these samples, we propose an iterative \"Manifold DivideMix\"\nalgorithm to find clean and noisy samples, and train our model in a\nsemi-supervised way. In addition, we propose \"MixEMatch\", a new algorithm for\nthe semi-supervised step that involves mixup augmentation at the input and\nfinal hidden representations of the model. This will extract better\nrepresentations by interpolating both in the input and manifold spaces.\nExtensive experiments on multiple synthetic-noise image benchmarks and\nreal-world web-crawled datasets demonstrate the effectiveness of our proposed\nframework. Code is available at https://github.com/Fahim-F/ManifoldDivideMix.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:33:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fooladgar","Fahimeh",""],["To","Minh Nguyen Nhat",""],["Mousavi","Parvin",""],["Abolmaesumi","Purang",""]]}
{"id":"2308.06862","submitter":"Erfan Loghmani","authors":"Erfan Loghmani, MohammadAmin Fazli","title":"Effect of Choosing Loss Function when Using T-batching for\n  Representation Learning on Dynamic Networks","comments":"29 pages, 10 figures, 4 tables, Submitted to Information Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Representation learning methods have revolutionized machine learning on\nnetworks by converting discrete network structures into continuous domains.\nHowever, dynamic networks that evolve over time pose new challenges. To address\nthis, dynamic representation learning methods have gained attention, offering\nbenefits like reduced learning time and improved accuracy by utilizing temporal\ninformation.\n  T-batching is a valuable technique for training dynamic network models that\nreduces training time while preserving vital conditions for accurate modeling.\nHowever, we have identified a limitation in the training loss function used\nwith t-batching. Through mathematical analysis, we propose two alternative loss\nfunctions that overcome these issues, resulting in enhanced training\nperformance.\n  We extensively evaluate the proposed loss functions on synthetic and\nreal-world dynamic networks. The results consistently demonstrate superior\nperformance compared to the original loss function. Notably, in a real-world\nnetwork characterized by diverse user interaction histories, the proposed loss\nfunctions achieved more than 26.9% enhancement in Mean Reciprocal Rank (MRR)\nand more than 11.8% improvement in Recall@10. These findings underscore the\nefficacy of the proposed loss functions in dynamic network modeling.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:34:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Loghmani","Erfan",""],["Fazli","MohammadAmin",""]]}
{"id":"2308.06863","submitter":"Mihai Ciucu","authors":"Mihai Ciucu and Christian Krattenthaler","title":"Boundary dents, the arctic circle and the arctic ellipse","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The original motivation for this paper goes back to the mid-1990's, when\nJames Propp was interested in natural situations when the number of domino\ntilings of a region increases if some of its unit squares are deleted. Guided\nin part by the intuition one gets from earlier work on parallels between the\nnumber of tilings of a region with holes and the 2D Coulomb energy of the\ncorresponding system of electric charges, we consider Aztec diamond regions\nwith unit square defects along two adjacent sides. We show that for large\nregions, if these defects are at fixed distances from a corner, the ratio\nbetween the number of domino tilings of the Aztec diamond with defects and the\nnumber of tilings of the entire Aztec diamond approaches a Delannoy number.\n  When the locations of the defects are not fixed but instead approach given\npoints on the boundary of the scaling limit $S$ (a square) of the Aztec\ndiamonds, we prove that, provided the line segment connecting these points is\noutside the circle inscribed in $S$, this ratio has the same asymptotics as the\nDelannoy number corresponding to the locations of the defects; if the segment\ncrosses the circle, the asymptotics is radically different. We use this to\ndeduce (under the assumption that an arctic curve exists) that the arctic curve\nfor domino tilings of Aztec diamonds is the circle inscribed in $S$. We also\ndiscuss counterparts of this phenomenon for lozenge tilings of hexagons.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:35:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ciucu","Mihai",""],["Krattenthaler","Christian",""]]}
{"id":"2308.06864","submitter":"Galina Levitina","authors":"Alan Carey, Galina Levitina","title":"On a conjectured property of the Witten index and an application to\n  Levinson's theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A few years ago Fritz Gesztesy raised the issue of whether there was a\ncomposition rule for the Witten index analogous to that satisfied by Fredholm\noperators. In this note we prove a result in this direction and provide an\napplication to Levinson's theorem.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:37:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carey","Alan",""],["Levitina","Galina",""]]}
{"id":"2308.06865","submitter":"Nan Wang","authors":"Nan Wang, Julian Evans, Chenxi Li, Victor M. Pergamenshchik and\n  Sailing He","title":"Colloidal Directional Structures at a Nematic Liquid Crystal-Air\n  Interface","comments":"Liquid Crystals (2023)","journal-ref":null,"doi":"10.1080/02678292.2023.2226625","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a variety of structures formed by colloidal droplets at a nematic\nliquid crystal-air interface, where the elastic dipole-dipole,\nquadrupole-quadrupole, and dipole-quadrupole interactions are all essentially\ninvolved. The colloidal structures observed not only include chains with kinks\nor clusters, but also comprise directional structures, such as directional\nchains and branches, whose direction is associated with the tilting director in\nthe liquid crystal layer. The dipole-quadrupole interaction, originating from\nthe polydispersity of the droplets, plays a central role for the formation of\nthese directional structures. Clusters consisting of directional branches and\nchains are also observed and found to be fractal statistically.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:41:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Nan",""],["Evans","Julian",""],["Li","Chenxi",""],["Pergamenshchik","Victor M.",""],["He","Sailing",""]]}
{"id":"2308.06866","submitter":"Md Mahedi Hasan","authors":"Md Mahedi Hasan and Nasser Nasrabadi","title":"Improving Face Recognition from Caption Supervision with Multi-Granular\n  Contextual Feature Aggregation","comments":"This article has been accepted for publication in the IEEE\n  International Joint Conference on Biometrics (IJCB), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce caption-guided face recognition (CGFR) as a new framework to\nimprove the performance of commercial-off-the-shelf (COTS) face recognition\n(FR) systems. In contrast to combining soft biometrics (eg., facial marks,\ngender, and age) with face images, in this work, we use facial descriptions\nprovided by face examiners as a piece of auxiliary information. However, due to\nthe heterogeneity of the modalities, improving the performance by directly\nfusing the textual and facial features is very challenging, as both lie in\ndifferent embedding spaces. In this paper, we propose a contextual feature\naggregation module (CFAM) that addresses this issue by effectively exploiting\nthe fine-grained word-region interaction and global image-caption association.\nSpecifically, CFAM adopts a self-attention and a cross-attention scheme for\nimproving the intra-modality and inter-modality relationship between the image\nand textual features, respectively. Additionally, we design a textual feature\nrefinement module (TFRM) that refines the textual features of the pre-trained\nBERT encoder by updating the contextual embeddings. This module enhances the\ndiscriminative power of textual features with a cross-modal projection loss and\nrealigns the word and caption embeddings with visual features by incorporating\na visual-semantic alignment loss. We implemented the proposed CGFR framework on\ntwo face recognition models (ArcFace and AdaFace) and evaluated its performance\non the Multi-Modal CelebA-HQ dataset. Our framework significantly improves the\nperformance of ArcFace in both 1:1 verification and 1:N identification\nprotocol.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:52:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hasan","Md Mahedi",""],["Nasrabadi","Nasser",""]]}
{"id":"2308.06867","submitter":"Francesca Angrisani","authors":"Francesca Angrisani, Franco Rampazzo","title":"Goh and Legendre-Clebsh conditions for nonsmooth control systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Higher order necessary conditions for a minimizer of an optimal control\nproblem are generally obtained for systems whose dynamics is at least\ncontinuously differentiable in the state variable. Here, by making use of the\nnotion of set-valued Lie bracket introduced in \"Set-valued differentials and a\nnonsmooth version of Chow-Rashevski's theorem\" by F. Rampazzo and H.J.Sussmann\nand extended in \"Iterated Lie brackets for nonsmooth vector fields\" by E.\nFeleqi and F.Rampazzo , we obtain Goh and Legendre-Clebsh type conditions for a\ncontrol affine system with Lipschitz continuous dynamics. In order to manage\nthe simultaneous lack of smoothness of the adjoint equation and of the Lie\nbracket-like variations, we will exploit the notion of Quasi Differential\nQuotient, introduced in \"A geometrically based criterion to avoid infimum-gaps\nin Optimal Control\" by M. Palladino and F.Rampazzo. \\\\ We finally exhibit an\nexample where the established higher order condition is capable to rule out the\noptimality of a control verifying a first order Maximum Principle.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 00:12:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Angrisani","Francesca",""],["Rampazzo","Franco",""]]}
{"id":"2308.06868","submitter":"Ahmed Alkhateeb","authors":"Gouranga Charan, Muhammad Alrabeiah, Tawfik Osman, and Ahmed Alkhateeb","title":"Camera Based mmWave Beam Prediction: Towards Multi-Candidate Real-World\n  Scenarios","comments":"Dataset and code files are available on the DeepSense 6G website\n  https://deepsense6g.net/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CV eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Leveraging sensory information to aid the millimeter-wave (mmWave) and\nsub-terahertz (sub-THz) beam selection process is attracting increasing\ninterest. This sensory data, captured for example by cameras at the\nbasestations, has the potential of significantly reducing the beam sweeping\noverhead and enabling highly-mobile applications. The solutions developed so\nfar, however, have mainly considered single-candidate scenarios, i.e.,\nscenarios with a single candidate user in the visual scene, and were evaluated\nusing synthetic datasets. To address these limitations, this paper extensively\ninvestigates the sensing-aided beam prediction problem in a real-world\nmulti-object vehicle-to-infrastructure (V2I) scenario and presents a\ncomprehensive machine learning-based framework. In particular, this paper\nproposes to utilize visual and positional data to predict the optimal beam\nindices as an alternative to the conventional beam sweeping approaches. For\nthis, a novel user (transmitter) identification solution has been developed, a\nkey step in realizing sensing-aided multi-candidate and multi-user beam\nprediction solutions. The proposed solutions are evaluated on the large-scale\nreal-world DeepSense $6$G dataset. Experimental results in realistic V2I\ncommunication scenarios indicate that the proposed solutions achieve close to\n$100\\%$ top-5 beam prediction accuracy for the scenarios with single-user and\nclose to $95\\%$ top-5 beam prediction accuracy for multi-candidate scenarios.\nFurthermore, the proposed approach can identify the probable transmitting\ncandidate with more than $93\\%$ accuracy across the different scenarios. This\nhighlights a promising approach for nearly eliminating the beam training\noverhead in mmWave/THz communication systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 00:15:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Charan","Gouranga",""],["Alrabeiah","Muhammad",""],["Osman","Tawfik",""],["Alkhateeb","Ahmed",""]]}
{"id":"2308.06869","submitter":"Shenyuan Liang","authors":"Shenyuan Liang, Mauricio Pamplona Segundo, Sathyanarayanan N. Aakur,\n  Sudeep Sarkar, Anuj Srivastava","title":"Shape-Graph Matching Network (SGM-net): Registration for Statistical\n  Shape Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper focuses on the statistical analysis of shapes of data objects\ncalled shape graphs, a set of nodes connected by articulated curves with\narbitrary shapes. A critical need here is a constrained registration of points\n(nodes to nodes, edges to edges) across objects. This, in turn, requires\noptimization over the permutation group, made challenging by differences in\nnodes (in terms of numbers, locations) and edges (in terms of shapes,\nplacements, and sizes) across objects. This paper tackles this registration\nproblem using a novel neural-network architecture and involves an unsupervised\nloss function developed using the elastic shape metric for curves. This\narchitecture results in (1) state-of-the-art matching performance and (2) an\norder of magnitude reduction in the computational cost relative to baseline\napproaches. We demonstrate the effectiveness of the proposed approach using\nboth simulated data and real-world 2D and 3D shape graphs. Code and data will\nbe made publicly available after review to foster research.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 00:42:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liang","Shenyuan",""],["Segundo","Mauricio Pamplona",""],["Aakur","Sathyanarayanan N.",""],["Sarkar","Sudeep",""],["Srivastava","Anuj",""]]}
{"id":"2308.06870","submitter":"Jean-Stefan Koskivirta","authors":"Jean-Stefan Koskivirta","title":"A vanishing theorem for vector-valued Siegel automorphic forms in\n  characteristic $p$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the space of vector-valued Siegel automorphic forms in\ncharacteristic $p$ is zero when the weight is outside of an explicit locus.\nThis result is a special case of a general conjecture about Hodge-type Shimura\nvarieties formulated in previous work with W. Goldring.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 00:47:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Koskivirta","Jean-Stefan",""]]}
{"id":"2308.06871","submitter":"Gr\\'egory Cordeiro Fonseca","authors":"Gregory Fonseca, Igor Poltavsky, Alexandre Tkatchenko","title":"Force Field Analysis Software and Tools (FFAST): Assessing Machine\n  Learning Force Fields Under the Microscope","comments":"22 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  As the sophistication of Machine Learning Force Fields (MLFF) increases to\nmatch the complexity of extended molecules and materials, so does the need for\ntools to properly analyze and assess the practical performance of MLFFs. To go\nbeyond average error metrics and into a complete picture of a model's\napplicability and limitations, we develop FFAST (Force Field Analysis Software\nand Tools): a cross-platform software package designed to gain detailed\ninsights into a model's performance and limitations, complete with an\neasy-to-use graphical user interface. The software allows the user to gauge the\nperformance of many popular state-of-the-art MLFF models on various popular\ndataset types, providing general prediction error overviews, outlier detection\nmechanisms, atom-projected errors, and more. It has a 3D visualizer to find and\npicture problematic configurations, atoms, or clusters in a large dataset. In\nthis paper, the example of the MACE and Nequip models are used on two datasets\nof interest -- stachyose and docosahexaenoic acid (DHA) -- to illustrate the\nuse cases of the software. With it, it was found that carbons and oxygens\ninvolved in or near glycosidic bonds inside the stachyose molecule present\nincreased prediction errors. In addition, prediction errors on DHA rise as the\nmolecule folds, especially for the carboxylic group at the edge of the\nmolecule. We emphasize the need for a systematic assessment of MLFF models for\nensuring their successful application to study the dynamics of molecules and\nmaterials.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 00:53:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fonseca","Gregory",""],["Poltavsky","Igor",""],["Tkatchenko","Alexandre",""]]}
{"id":"2308.06872","submitter":"Xiaodan Zhou","authors":"Qing Liu, Nageswari Shanmugalingam, Xiaodan Zhou","title":"Discontinuous eikonal equations in metric measure spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the eikonal equation in metric measure spaces, where\nthe inhomogeneous term is allowed to be discontinuous, unbounded and merely\n$p$-integrable in the domain with a finite $p$. For continuous eikonal\nequations, it is known that the notion of Monge solutions is equivalent to the\nstandard definition of viscosity solutions. Generalizing the notion of Monge\nsolutions in our setting, we establish uniqueness and existence results for the\nassociated Dirichlet boundary problem. The key in our approach is to adopt a\nnew metric, based on the optimal control interpretation, which integrates the\ndiscontinuous term and converts the eikonal equation to a standard continuous\nform. We also discuss the Holder continuity of the unique solution with respect\nto the original metric under regularity assumptions on the space and the\ninhomogeneous term.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:00:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Qing",""],["Shanmugalingam","Nageswari",""],["Zhou","Xiaodan",""]]}
{"id":"2308.06873","submitter":"Xiaofei Wang","authors":"Xiaofei Wang, Manthan Thakker, Zhuo Chen, Naoyuki Kanda, Sefik Emre\n  Eskimez, Sanyuan Chen, Min Tang, Shujie Liu, Jinyu Li, Takuya Yoshioka","title":"SpeechX: Neural Codec Language Model as a Versatile Speech Transformer","comments":"See https://aka.ms/speechx for demo samples","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":"  Recent advancements in generative speech models based on audio-text prompts\nhave enabled remarkable innovations like high-quality zero-shot text-to-speech.\nHowever, existing models still face limitations in handling diverse audio-text\nspeech generation tasks involving transforming input speech and processing\naudio captured in adverse acoustic conditions. This paper introduces SpeechX, a\nversatile speech generation model capable of zero-shot TTS and various speech\ntransformation tasks, dealing with both clean and noisy signals. SpeechX\ncombines neural codec language modeling with multi-task learning using\ntask-dependent prompting, enabling unified and extensible modeling and\nproviding a consistent way for leveraging textual input in speech enhancement\nand transformation tasks. Experimental results show SpeechX's efficacy in\nvarious tasks, including zero-shot TTS, noise suppression, target speaker\nextraction, speech removal, and speech editing with or without background\nnoise, achieving comparable or superior performance to specialized models\nacross tasks. See https://aka.ms/speechx for demo samples.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:01:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Xiaofei",""],["Thakker","Manthan",""],["Chen","Zhuo",""],["Kanda","Naoyuki",""],["Eskimez","Sefik Emre",""],["Chen","Sanyuan",""],["Tang","Min",""],["Liu","Shujie",""],["Li","Jinyu",""],["Yoshioka","Takuya",""]]}
{"id":"2308.06874","submitter":"Zhiqing Wei","authors":"Mingyue Zhu, Zhiqing Wei, Chen Qiu, Wangjun Jiang, Huici Wu, and\n  Zhiying Feng","title":"Joint Data Collection and Sensor Positioning in Multi-UAV-Assisted\n  Wireless Sensor Network","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":"  Due to the high mobility and easy deployment, unmanned aerial vehicles (UAVs)\nhave attracted much attention in the field of wireless communication and\npositioning. To meet the challenges of lack of infrastructure coverage,\nuncertain sensor position and large amount of sensing data collection in\nwireless sensor network (WSN), this paper presents an efficient joint data\ncollection and sensor positioning scheme for WSN supported by multiple UAVs.\nSpecifically, a UAV is set as the main UAV to collect data, and other UAVs are\nused as auxiliary UAVs for sensor positioning using time difference of arrival\n(TDoA). A mixed-integer non-convex optimization problem with uncertain sensor\nposition is established. The goal is to minimize the average positioning error\nof all sensors by jointly optimizing the UAV trajectories, sensor transmission\nschedule and positioning observation points (POPs). To solve this optimization\nmodel, the original problem is decomposed into two sub-problems based on the\npath discrete method. Firstly, the block coordinate descent (BCD) and\nsuccessive convex approximation (SCA) techniques are applied to iteratively\noptimize the trajectory of the main UAV and the sensor transmission schedule,\nso as to maximize the minimum amount of data uploaded by the sensor. Then,\nbased on the trajectory of the main UAV, a particle swarm optimization\n(PSO)-based algorithm is designed to optimize the POPs of UAVs. Finally, the\nspline curve is applied to generate the trajectories of auxiliary UAVs. The\nsimulation results show that the proposed scheme can meet the requirements of\ndata collection and has a good positioning performance.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:05:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Mingyue",""],["Wei","Zhiqing",""],["Qiu","Chen",""],["Jiang","Wangjun",""],["Wu","Huici",""],["Feng","Zhiying",""]]}
{"id":"2308.06875","submitter":"Jungseek Hwang","authors":"Seokbae Lee, Yu-Seong Seo, Seulki Roh, Dongjoon Song, Hiroshi Eisaki,\n  and Jungseek Hwang","title":"Doping-dependent superconducting physical quantities of K-doped\n  BaFe$_2$As$_2$ obtained through infrared spectroscopy","comments":"16 pages, 4 figures, 1 table","journal-ref":"Scientific Reports 12, 19950 (2022)","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 four single crystals of K-doped BaFe$_2$As$_2$ (Ba-122),\nBa$_{1-x}$K$_x$Fe$_2$As$_2$ with $x$ = 0.29, 0.36, 0.40, and 0.51, using\ninfrared spectroscopy. We explored a wide variety of doping levels, from under-\nto overdoped. We obtained the superfluid plasma frequencies\n($\\Omega_{\\mathrm{sp}}$) and corresponding London penetration depths\n($\\lambda_{\\mathrm{L}}$) from the measured optical conductivity spectra. We\nalso extracted the electron-boson spectral density (EBSD) functions using a\ntwo-parallel charge transport channel approach in the superconducting (SC)\nstate. From the extracted EBSD functions, the maximum SC transition\ntemperatures ($T_c^{\\mathrm{Max}}$) were determined using a generalized\nMcMillan formula and the SC coherence lengths ($\\xi_{\\mathrm{SC}}$) were\ncalculated using the timescales encoded in the EBSD functions and reported\nFermi velocities. We identified some similarities and differences in the\ndoping-dependent SC quantities between the K-doped Ba-122 and the hole-doped\ncuprates. We expect that the various SC quantities obtained across the wide\ndoping range will provide helpful information for establishing the microscopic\npairing mechanism in Fe-pnictide superconductors.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:11:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Seokbae",""],["Seo","Yu-Seong",""],["Roh","Seulki",""],["Song","Dongjoon",""],["Eisaki","Hiroshi",""],["Hwang","Jungseek",""]]}
{"id":"2308.06876","submitter":"Dmitry Polyakov","authors":"I. V. Gornyi and D. G. Polyakov","title":"Two-dimensional electron hydrodynamics in an obstacle array:\n  Magnetoresistivity, Hall viscosity, and the Landauer dipole","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn cond-mat.str-el physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We formulate a general framework to study flow of the electron liquid in two\ndimensions past a random array of impenetrable obstacles in the presence of a\nmagnetic field. We derive a linear-response formula for the resistivity tensor\n$\\hat\\rho$ in hydrodynamics with obstacles, which expresses $\\hat\\rho$ in terms\nof the vorticity and its harmonic conjugate, both on the boundary of obstacles.\nIn the limit of rare obstacles, in which we calculate $\\hat\\rho$, the\ncontributions of the flow-induced electric field to the dissipative resistivity\nfrom the area covered by the liquid and the area inside obstacles are shown to\nbe equal to each other. We demonstrate that the averaged electric fields\noutside and inside obstacles are rotated by Hall viscosity from the direction\nof flow. For the diffusive boundary condition on the obstacles, this effect\nexactly cancels in $\\hat\\rho$. By contrast, for the specular boundary\ncondition, the total electric field is rotated by Hall viscosity, which means\nthe emergence of a Hall-viscosity-induced effective -- proportional to the\nobstacle density -- magnetic field. Its effect on the Hall resistivity is\nparticularly notable in that it leads to a deviation of the Hall constant from\nits universal value. We show that the applied magnetic field enhances\nhydrodynamic lubrication, giving rise to a strong negative magnetoresistance.\nWe combine the hydrodynamic and electrostatic perspectives by discussing the\ndistribution of charges that create the flow-induced electric field around\nobstacles. We provide a connection between the tensor $\\hat\\rho$ and the\ndisorder-averaged electric dipole induced by viscosity at the obstacle. This\nestablishes a conceptual link between the resistivity in hydrodynamics with\nobstacles and the notion of the Landauer dipole. We show that the\nviscosity-induced dipole is rotated from the direction of flow by Hall\nviscosity.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:18:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gornyi","I. V.",""],["Polyakov","D. G.",""]]}
{"id":"2308.06877","submitter":"Lyndsay Shand","authors":"Drew Yarger, Benjamin Wagman, Lyndsay Shand, Kenny Chowdhary","title":"Autocalibration of the E3SM version 2 atmosphere model using a PCA-based\n  surrogate for spatial fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Global Climate Model (GCM) tuning (calibration) is a tedious and\ntime-consuming process, with high-dimensional input and output fields. Experts\ntypically tune by iteratively running climate simulations with hand-picked\nvalues of tuning parameters. Many, in both the statistical and climate\nliterature, have proposed alternative calibration methods, but most are\nimpractical or difficult to implement. We present a practical, robust and\nrigorous calibration approach on the atmosphere-only model of the Department of\nEnergy's Energy Exascale Earth System Model (E3SM) version 2. Our approach can\nbe summarized into two main parts: (1) the training of a surrogate that\npredicts E3SM output in a fraction of the time compared to running E3SM, and\n(2) gradient-based parameter optimization. To train the surrogate, we generate\na set of designed ensemble runs that span our input parameter space and use\npolynomial chaos expansions on a reduced output space to fit the E3SM output.\nWe use this surrogate in an optimization scheme to identify values of the input\nparameters for which our model best matches gridded spatial fields of climate\nobservations. To validate our choice of parameters, we run E3SMv2 with the\noptimal parameter values and compare prediction results to expertly-tuned\nsimulations across 45 different output fields. This flexible, robust, and\nautomated approach is straightforward to implement, and we demonstrate that the\nresulting model output matches present day climate observations as well or\nbetter than the corresponding output from expert tuned parameter values, while\nconsidering high-dimensional output and operating in a fraction of the time.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:21:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yarger","Drew",""],["Wagman","Benjamin",""],["Shand","Lyndsay",""],["Chowdhary","Kenny",""]]}
{"id":"2308.06878","submitter":"Jiahao Liu","authors":"Sijia Liu, Jiahao Liu, Hansu Gu, Dongsheng Li, Tun Lu, Peng Zhang,\n  Ning Gu","title":"AutoSeqRec: Autoencoder for Efficient Sequential Recommendation","comments":"10 pages, accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sequential recommendation demonstrates the capability to recommend items by\nmodeling the sequential behavior of users. Traditional methods typically treat\nusers as sequences of items, overlooking the collaborative relationships among\nthem. Graph-based methods incorporate collaborative information by utilizing\nthe user-item interaction graph. However, these methods sometimes face\nchallenges in terms of time complexity and computational efficiency. To address\nthese limitations, this paper presents AutoSeqRec, an incremental\nrecommendation model specifically designed for sequential recommendation tasks.\nAutoSeqRec is based on autoencoders and consists of an encoder and three\ndecoders within the autoencoder architecture. These components consider both\nthe user-item interaction matrix and the rows and columns of the item\ntransition matrix. The reconstruction of the user-item interaction matrix\ncaptures user long-term preferences through collaborative filtering. In\naddition, the rows and columns of the item transition matrix represent the item\nout-degree and in-degree hopping behavior, which allows for modeling the user's\nshort-term interests. When making incremental recommendations, only the input\nmatrices need to be updated, without the need to update parameters, which makes\nAutoSeqRec very efficient. Comprehensive evaluations demonstrate that\nAutoSeqRec outperforms existing methods in terms of accuracy, while showcasing\nits robustness and efficiency.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:23:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Sijia",""],["Liu","Jiahao",""],["Gu","Hansu",""],["Li","Dongsheng",""],["Lu","Tun",""],["Zhang","Peng",""],["Gu","Ning",""]]}
{"id":"2308.06879","submitter":"Jungsoo Lee","authors":"Jungsoo Lee, Debasmit Das, Jaegul Choo, Sungha Choi","title":"Towards Open-Set Test-Time Adaptation Utilizing the Wisdom of Crowds in\n  Entropy Minimization","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":"  Test-time adaptation (TTA) methods, which generally rely on the model's\npredictions (e.g., entropy minimization) to adapt the source pretrained model\nto the unlabeled target domain, suffer from noisy signals originating from 1)\nincorrect or 2) open-set predictions. Long-term stable adaptation is hampered\nby such noisy signals, so training models without such error accumulation is\ncrucial for practical TTA. To address these issues, including open-set TTA, we\npropose a simple yet effective sample selection method inspired by the\nfollowing crucial empirical finding. While entropy minimization compels the\nmodel to increase the probability of its predicted label (i.e., confidence\nvalues), we found that noisy samples rather show decreased confidence values.\nTo be more specific, entropy minimization attempts to raise the confidence\nvalues of an individual sample's prediction, but individual confidence values\nmay rise or fall due to the influence of signals from numerous other\npredictions (i.e., wisdom of crowds). Due to this fact, noisy signals\nmisaligned with such 'wisdom of crowds', generally found in the correct\nsignals, fail to raise the individual confidence values of wrong samples,\ndespite attempts to increase them. Based on such findings, we filter out the\nsamples whose confidence values are lower in the adapted model than in the\noriginal model, as they are likely to be noisy. Our method is widely applicable\nto existing TTA methods and improves their long-term adaptation performance in\nboth image classification (e.g., 49.4% reduced error rates with TENT) and\nsemantic segmentation (e.g., 11.7% gain in mIoU with TENT).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:24:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Jungsoo",""],["Das","Debasmit",""],["Choo","Jaegul",""],["Choi","Sungha",""]]}
{"id":"2308.06880","submitter":"Joel Kamnitzer","authors":"Aleksei Ilin, Joel Kamnitzer, Yu Li, Piotr Przytycki, Leonid Rybnikov","title":"The moduli space of cactus flower curves and the virtual cactus group","comments":"69 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.GR math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The space $ \\mathfrak{ft}_n = \\mathbb C^n/\\mathbb C $ of $n$ points on the\nline modulo translation has a natural compactification $\n\\overline{\\mathfrak{ft}}_n $ as a matroid Schubert variety. In this space,\npairwise distances between points can be infinite; we call such a configuration\nof points a ``flower curve'', since we imagine multiple components joined into\na flower. Within $ \\mathfrak{ft}_n $, we have the space $ F_n = \\mathbb C^n\n\\setminus \\Delta / \\mathbb C $ of $ n$ distinct points. We introduce a natural\ncompatification $ \\overline F_n $ along with a map $ \\overline F_n \\rightarrow\n\\overline{\\mathfrak{ft}}_n $, whose fibres are products of genus 0\nDeligne-Mumford spaces. We show that both $\\overline{\\mathfrak{ft}}_n$ and\n$\\overline F_n$ are special fibers of $1$-parameter families whose generic\nfibers are, respectively, Losev-Manin and Deligne-Mumford moduli spaces of\nstable genus $0$ curves with $n+2$ marked points.\n  We find combinatorial models for the real loci $\n\\overline{\\mathfrak{ft}}_n(\\mathbb R) $ and $ \\overline F_n(\\mathbb R) $. Using\nthese models, we prove that these spaces are aspherical and that their\nequivariant fundamental groups are the virtual symmetric group and the virtual\ncactus groups, respectively. The deformation of $\\overline F_n(\\mathbb{R})$ to\na real locus of the Deligne-Mumford space gives rise to a natural homomorphism\nfrom the affine cactus group to the virtual cactus group.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:25:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ilin","Aleksei",""],["Kamnitzer","Joel",""],["Li","Yu",""],["Przytycki","Piotr",""],["Rybnikov","Leonid",""]]}
{"id":"2308.06881","submitter":"Jungseek Hwang","authors":"Myounghoon Lee, Yu-Seong Seo, Seulki Roh, Seokbae Lee, Jihyun Kim,\n  Junwon Kim, Tuson Park, Ji Hoon Shim, andJungseek Hwang","title":"Temperature-dependent $f$-electron evolution in CeCoIn$_5$ via a\n  comparative infrared study with LaCoIn$_5$","comments":"23 pages, 8 figures","journal-ref":"Results in Physics 47, 106376 (2023)","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 investigated CeCoIn$_5$ and LaCoIn$_5$ single crystals, which have the\nsame HoCoGa$_5$-type tetragonal crystal structure, using infrared spectroscopy.\nHowever, while CeCoIn$_5$ has 4$f$ electrons, LaCoIn$_5$ does not. By comparing\nthese two material systems, we extracted the temperature-dependent electronic\nevolution of the $f$ electrons of CeCoIn$_5$. We observed that the differences\ncaused by the $f$ electrons are more obvious in low-energy optical spectra at\nlow temperatures. We introduced a complex optical resistivity and obtained a\nmagnetic optical resistivity from the difference in the optical resistivity\nspectra of the two material systems. From the temperature-dependent average\nmagnetic resistivity, we found that the onset temperature of the Kondo effect\nis much higher than the known onset temperature of Kondo scattering ($\\simeq$\n200 K) of CeCoIn$_5$. Based on momentum-dependent hybridization, the periodic\nAnderson model, and a maximum entropy approach, we obtained the hybridization\ngap distribution function of CeCoIn$_5$ and found that the resulting gap\ndistribution function of CeCoIn$_5$ was mainly composed of two (small and\nlarge) components (or gaps). We assigned the small and large gaps to the\nin-plane and out-of-plane hybridization gaps, respectively. We expect that our\nresults will provide useful information for understanding the\ntemperature-dependent electronic evolution of $f$-electron systems near Fermi\nlevel.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:26:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Myounghoon",""],["Seo","Yu-Seong",""],["Roh","Seulki",""],["Lee","Seokbae",""],["Kim","Jihyun",""],["Kim","Junwon",""],["Park","Tuson",""],["Shim","Ji Hoon",""],["Hwang","andJungseek",""]]}
{"id":"2308.06882","submitter":"Dhagash Mehta","authors":"Dhruv Desai, Ashmita Dhiman, Tushar Sharma, Deepika Sharma, Dhagash\n  Mehta, Stefano Pasquali","title":"Quantifying Outlierness of Funds from their Categories using Supervised\n  Similarity","comments":"8 pages, 5 tables, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.LG q-fin.CP stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mutual fund categorization has become a standard tool for the investment\nmanagement industry and is extensively used by allocators for portfolio\nconstruction and manager selection, as well as by fund managers for peer\nanalysis and competitive positioning. As a result, a (unintended)\nmiscategorization or lack of precision can significantly impact allocation\ndecisions and investment fund managers. Here, we aim to quantify the effect of\nmiscategorization of funds utilizing a machine learning based approach. We\nformulate the problem of miscategorization of funds as a distance-based outlier\ndetection problem, where the outliers are the data-points that are far from the\nrest of the data-points in the given feature space. We implement and employ a\nRandom Forest (RF) based method of distance metric learning, and compute the\nso-called class-wise outlier measures for each data-point to identify outliers\nin the data. We test our implementation on various publicly available data\nsets, and then apply it to mutual fund data. We show that there is a strong\nrelationship between the outlier measures of the funds and their future returns\nand discuss the implications of our findings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:28:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Desai","Dhruv",""],["Dhiman","Ashmita",""],["Sharma","Tushar",""],["Sharma","Deepika",""],["Mehta","Dhagash",""],["Pasquali","Stefano",""]]}
{"id":"2308.06883","submitter":"Siddharth Vadnerkar","authors":"Siddharth Vadnerkar","title":"Superselection sectors in the 3d Toric Code","comments":"33 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.str-el hep-th math.MP quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We rigorously define superselection sectors in the 3d (spatial dimensions)\nToric Code Model on the infinite lattice $\\mathbb{Z}^3$. We begin by\nconstructing automorphisms that correspond to infinite flux strings, a\nphenomenon that's only possible in open manifolds. We then classify all ground\nstate superselection sectors containing infinite flux strings, and find a rich\nstructure that depends on the geometry and number of strings in the\nconfiguration. In particular, for a single infinite flux string configuration\nto be a ground state, it must be monotonic. For configurations containing\nmultiple infinite flux strings, we define \"infinity directions\" and use that to\nestablish a necessary and sufficient condition for a state to be in a ground\nstate superselection sector. Notably, we also find that if a state contains\nmore than 3 infinite flux strings, then it is not in a ground state\nsuperselection sector.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:28:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Vadnerkar","Siddharth",""]]}
{"id":"2308.06884","submitter":"Tugba Erpek","authors":"Yalin E. Sagduyu, Tugba Erpek, Aylin Yener, Sennur Ulukus","title":"Multi-Receiver Task-Oriented Communications via Multi-Task Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.IT cs.LG eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies task-oriented, otherwise known as goal-oriented,\ncommunications, in a setting where a transmitter communicates with multiple\nreceivers, each with its own task to complete on a dataset, e.g., images,\navailable at the transmitter. A multi-task deep learning approach that involves\ntraining a common encoder at the transmitter and individual decoders at the\nreceivers is presented for joint optimization of completing multiple tasks and\ncommunicating with multiple receivers. By providing efficient resource\nallocation at the edge of 6G networks, the proposed approach allows the\ncommunications system to adapt to varying channel conditions and achieves\ntask-specific objectives while minimizing transmission overhead. Joint training\nof the encoder and decoders using multi-task learning captures shared\ninformation across tasks and optimizes the communication process accordingly.\nBy leveraging the broadcast nature of wireless communications, multi-receiver\ntask-oriented communications (MTOC) reduces the number of transmissions\nrequired to complete tasks at different receivers. Performance evaluation\nconducted on the MNIST, Fashion MNIST, and CIFAR-10 datasets (with image\nclassification considered for different tasks) demonstrates the effectiveness\nof MTOC in terms of classification accuracy and resource utilization compared\nto single-task-oriented communication systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:34:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sagduyu","Yalin E.",""],["Erpek","Tugba",""],["Yener","Aylin",""],["Ulukus","Sennur",""]]}
{"id":"2308.06885","submitter":"Petr Kasalicky","authors":"Petr Kasalick\\'y, Rodrigo Alves, Pavel Kord\\'ik","title":"Bridging Offline-Online Evaluation with a Time-dependent and Popularity\n  Bias-free Offline Metric for Recommenders","comments":"Accepted to evalRS 2023@KDD","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The evaluation of recommendation systems is a complex task. The offline and\nonline evaluation metrics for recommender systems are ambiguous in their true\nobjectives. The majority of recently published papers benchmark their methods\nusing ill-posed offline evaluation methodology that often fails to predict true\nonline performance. Because of this, the impact that academic research has on\nthe industry is reduced. The aim of our research is to investigate and compare\nthe online performance of offline evaluation metrics. We show that penalizing\npopular items and considering the time of transactions during the evaluation\nsignificantly improves our ability to choose the best recommendation model for\na live recommender system. Our results, averaged over five large-size\nreal-world live data procured from recommenders, aim to help the academic\ncommunity to understand better offline evaluation and optimization criteria\nthat are more relevant for real applications of recommender systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:37:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kasalick\u00fd","Petr",""],["Alves","Rodrigo",""],["Kord\u00edk","Pavel",""]]}
{"id":"2308.06886","submitter":"John Andrew Snoap","authors":"John A. Snoap, Dimitrie C. Popescu, Chad M. Spooner","title":"Novel Nonlinear Neural-Network Layers for High Performance and\n  Generalization in Modulation-Recognition Applications","comments":"6 pages, 7 figures, to be published in IEEE MILCOM 2023: IEEE\n  Military Communications Conference 2023. arXiv admin note: text overlap with\n  arXiv:2211.00232","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The paper presents a novel type of capsule network (CAP) that uses\ncustom-defined neural network (NN) layers for blind classification of digitally\nmodulated signals using their in-phase/quadrature (I/Q) components. The custom\nNN layers of the CAP are inspired by cyclostationary signal processing (CSP)\ntechniques and implement feature extraction capabilities that are akin to the\ncalculation of the cyclic cumulant (CC) features employed in conventional\nCSP-based approaches to blind modulation classification and signal\nidentification. The classification performance and the generalization abilities\nof the proposed CAP are tested using two distinct datasets that contain similar\nclasses of digitally modulated signals but that have been generated\nindependently, and numerical results obtained reveal that the proposed CAP with\nnovel NN feature extraction layers achieves high classification accuracy while\nalso outperforming alternative deep learning (DL)-based approaches for signal\nclassification in terms of both classification accuracy and generalization\nabilities.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:38:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Snoap","John A.",""],["Popescu","Dimitrie C.",""],["Spooner","Chad M.",""]]}
{"id":"2308.06887","submitter":"Guy Gaziv","authors":"Guy Gaziv, Michael J. Lee, James J. DiCarlo","title":"Robustified ANNs Reveal Wormholes Between Human Category Percepts","comments":"*Equal contribution","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The visual object category reports of artificial neural networks (ANNs) are\nnotoriously sensitive to tiny, adversarial image perturbations. Because human\ncategory reports (aka human percepts) are thought to be insensitive to those\nsame small-norm perturbations -- and locally stable in general -- this argues\nthat ANNs are incomplete scientific models of human visual perception.\nConsistent with this, we show that when small-norm image perturbations are\ngenerated by standard ANN models, human object category percepts are indeed\nhighly stable. However, in this very same \"human-presumed-stable\" regime, we\nfind that robustified ANNs reliably discover low-norm image perturbations that\nstrongly disrupt human percepts. These previously undetectable human perceptual\ndisruptions are massive in amplitude, approaching the same level of sensitivity\nseen in robustified ANNs. Further, we show that robustified ANNs support\nprecise perceptual state interventions: they guide the construction of low-norm\nimage perturbations that strongly alter human category percepts toward specific\nprescribed percepts. These observations suggest that for arbitrary starting\npoints in image space, there exists a set of nearby \"wormholes\", each leading\nthe subject from their current category perceptual state into a semantically\nvery different state. Moreover, contemporary ANN models of biological visual\nprocessing are now accurate enough to consistently guide us to those portals.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 01:47:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gaziv","Guy",""],["Lee","Michael J.",""],["DiCarlo","James J.",""]]}
{"id":"2308.06888","submitter":"Ed Bueler","authors":"Ed Bueler and Patrick E. Farrell","title":"A full approximation scheme multilevel method for nonlinear variational\n  inequalities","comments":"25 pages, 9 figures","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 full approximation scheme constraint decomposition (FASCD)\nmultilevel method for solving variational inequalities (VIs). FASCD is a common\nextension of both the full approximation scheme (FAS) multigrid technique for\nnonlinear partial differential equations, due to A.~Brandt, and the constraint\ndecomposition (CD) method introduced by X.-C.~Tai for VIs arising in\noptimization. We extend the CD idea by exploiting the telescoping nature of\ncertain function space subset decompositions arising from multilevel mesh\nhierarchies. When a reduced-space (active set) Newton method is applied as a\nsmoother, with work proportional to the number of unknowns on a given mesh\nlevel, FASCD V-cycles exhibit nearly mesh-independent convergence rates, and\nfull multigrid cycles are optimal solvers. The example problems include\ndifferential operators which are symmetric linear, nonsymmetric linear, and\nnonlinear, in unilateral and bilateral VI problems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:01:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bueler","Ed",""],["Farrell","Patrick E.",""]]}
{"id":"2308.06889","submitter":"Mobarakol Islam","authors":"Mobarakol Islam and Zeju Li and Ben Glocker","title":"Robustness Stress Testing in Medical Image Classification","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks have shown impressive performance for image-based\ndisease detection. Performance is commonly evaluated through clinical\nvalidation on independent test sets to demonstrate clinically acceptable\naccuracy. Reporting good performance metrics on test sets, however, is not\nalways a sufficient indication of the generalizability and robustness of an\nalgorithm. In particular, when the test data is drawn from the same\ndistribution as the training data, the iid test set performance can be an\nunreliable estimate of the accuracy on new data. In this paper, we employ\nstress testing to assess model robustness and subgroup performance disparities\nin disease detection models. We design progressive stress testing using five\ndifferent bidirectional and unidirectional image perturbations with six\ndifferent severity levels. As a use case, we apply stress tests to measure the\nrobustness of disease detection models for chest X-ray and skin lesion images,\nand demonstrate the importance of studying class and domain-specific model\nbehaviour. Our experiments indicate that some models may yield more robust and\nequitable performance than others. We also find that pretraining\ncharacteristics play an important role in downstream robustness. We conclude\nthat progressive stress testing is a viable and important tool and should\nbecome standard practice in the clinical validation of image-based disease\ndetection models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:02:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Islam","Mobarakol",""],["Li","Zeju",""],["Glocker","Ben",""]]}
{"id":"2308.06890","submitter":"Allison Miller","authors":"Randall Johanningsmeier, Hillary Kim, and Allison N. Miller","title":"A partial resolution of Hedden's conjecture on satellite homomorphisms","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A pattern knot in a solid torus defines a self-map of the smooth knot\nconcordance group. We prove that if the winding number of a pattern is even but\nnot divisible by 8, then the corresponding map is not a homomorphism, thus\npartially establishing a conjecture of Hedden.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:07:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Johanningsmeier","Randall",""],["Kim","Hillary",""],["Miller","Allison N.",""]]}
{"id":"2308.06891","submitter":"Chunhao Peng","authors":"Chunhao Peng, Dapeng Yang, Ming Cheng, Jinghui Dai, Deyu Zhao, Li\n  Jiang","title":"Viia-hand: a Reach-and-grasp Restoration System Integrating Voice\n  interaction, Computer vision and Auditory feedback for Blind Amputees","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":"  Visual feedback plays a crucial role in the process of amputation patients\ncompleting grasping in the field of prosthesis control. However, for blind and\nvisually impaired (BVI) amputees, the loss of both visual and grasping\nabilities makes the \"easy\" reach-and-grasp task a feasible challenge. In this\npaper, we propose a novel multi-sensory prosthesis system helping BVI amputees\nwith sensing, navigation and grasp operations. It combines modules of voice\ninteraction, environmental perception, grasp guidance, collaborative control,\nand auditory/tactile feedback. In particular, the voice interaction module\nreceives user instructions and invokes other functional modules according to\nthe instructions. The environmental perception and grasp guidance module\nobtains environmental information through computer vision, and feedbacks the\ninformation to the user through auditory feedback modules (voice prompts and\nspatial sound sources) and tactile feedback modules (vibration stimulation).\nThe prosthesis collaborative control module obtains the context information of\nthe grasp guidance process and completes the collaborative control of grasp\ngestures and wrist angles of prosthesis in conjunction with the user's control\nintention in order to achieve stable grasp of various objects. This paper\ndetails a prototyping design (named viia-hand) and presents its preliminary\nexperimental verification on healthy subjects completing specific\nreach-and-grasp tasks. Our results showed that, with the help of our new\ndesign, the subjects were able to achieve a precise reach and reliable grasp of\nthe target objects in a relatively cluttered environment. Additionally, the\nsystem is extremely user-friendly, as users can quickly adapt to it with\nminimal training.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:09:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Peng","Chunhao",""],["Yang","Dapeng",""],["Cheng","Ming",""],["Dai","Jinghui",""],["Zhao","Deyu",""],["Jiang","Li",""]]}
{"id":"2308.06892","submitter":"Michael Wang","authors":"Michael Wang and Gregory Grason","title":"Thermal stability and secondary aggregation of self-limiting,\n  geometrically-frustrated assemblies: Chain assembly of incommensurate\n  polybricks","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":"  In geometrically frustrated assemblies, equilibrium self-limitation manifests\nin the form of a minimum in the free energy per subunit at a finite,\nmulti-subunit size which results from the competition between the elastic costs\nof frustration within an assembly and the surface energy at its boundaries.\nPhysical realizations -- from ill-fitting particle assemblies to self-twisting\nprotein superstructures -- are capable of multiple mechanisms of escaping the\ncumulative costs of frustration, resulting in unlimited equilibrium assembly,\nincluding elastic modes of ``shape-flattening'' and the formation of weak,\ndefective bonds that screen intra-assembly stresses. Here we study a model of\n1D chain assembly of incommensurate ``polybricks'', and determine its\nequilibrium assembly as a function of temperature, concentration, degree of\nshape frustration, elasticity and inter-particle binding, notably focusing on\nhow weakly cohesive, defective bonds give rise to strongly\ntemperature-dependent assembly. Complex assembly behavior derives from the\ncompetition between multiple distinct local minima in the free energy\nlandscape, including self-limiting chains, weakly-bound aggregates of\nself-limiting chains, and strongly-bound, elastically defrustrated assemblies.\nWe show that this scenario, in general, gives rise to anomalous {\\it multiple\naggregation} behavior, in which disperse subunits first exhibit a primary\naggregation transition to self-limiting chains (at intermediate concentration\nand temperature) which are ultimately unstable to condensation into unlimited\nassembly of finite-chains through weak binding at a secondary aggregation\ntransition (at low temperature and high concentration). We show that window of\nstable self-limitation is determined both by the elastic costs of frustration\nin the assembly as well as energetic and entropic features of inter-subunit\nbinding.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:14:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Michael",""],["Grason","Gregory",""]]}
{"id":"2308.06893","submitter":"Michael Galperin","authors":"Jiayang Zhou, Anqi Li, and Michael Galperin","title":"Quantum Thermodynamics: Inside-Outside Perspective","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce an energy-resolved variant of quantum thermodynamics for open\nsystems strongly coupled to their baths. The approach generalizes the\nLandauer-Buttiker inside-outside duality method [Phys. Rev. Lett. 120, 107701\n(2018)] to interacting systems subjected to arbitrary external driving. It is\nconsistent with the underlying dynamical quantum transport description and is\ncapable of overcoming limitations of the only other consistent approach [New J.\nPhys. 12, 013013 (2010)]. We illustrate viability of the generalized\ninside-outside method with numerical simulations for generic junction models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:18:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhou","Jiayang",""],["Li","Anqi",""],["Galperin","Michael",""]]}
{"id":"2308.06894","submitter":"David Koop","authors":"David Koop","title":"When Provenance Aids and Complicates Reproducibility Judgments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is well-established that the provenance of a scientific result is\nimportant, sometimes more important than the actual result. For computational\nanalyses that involve visualization, this provenance information may contain\nthe steps involved in generating visualizations from raw data. Specifically,\ndata provenance tracks the lineage of data and process provenance tracks the\nsteps executed. In this paper, we argue that the utility of computational\nprovenance may not be as clear-cut as we might like. One common use case for\nprovenance is that the information can be used to reproduce the original\nresult. However, in visualization, the goal is often to communicate results to\na user or viewer, and thus the insights obtained are ultimately most important.\nViewers can miss important changes or react to unimportant ones. Here,\ninteraction provenance, which tracks a user's actions with a visualization, or\ninsight provenance, which tracks the decision-making process, can help capture\nwhat happened but don't remove the issues. In this paper, we present scenarios\nwhere provenance impacts reproducibility in different ways. We also explore how\nprovenance and visualizations can be better related.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:24:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Koop","David",""]]}
{"id":"2308.06895","submitter":"Saurav Prakash","authors":"Saurav Prakash, Jin Sima, Chao Pan, Eli Chien, Olgica Milenkovic","title":"Federated Classification in Hyperbolic Spaces via Secure Aggregation of\n  Convex Hulls","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":"  Hierarchical and tree-like data sets arise in many applications, including\nlanguage processing, graph data mining, phylogeny and genomics. It is known\nthat tree-like data cannot be embedded into Euclidean spaces of finite\ndimension with small distortion. This problem can be mitigated through the use\nof hyperbolic spaces. When such data also has to be processed in a distributed\nand privatized setting, it becomes necessary to work with new federated\nlearning methods tailored to hyperbolic spaces. As an initial step towards the\ndevelopment of the field of federated learning in hyperbolic spaces, we propose\nthe first known approach to federated classification in hyperbolic spaces. Our\ncontributions are as follows. First, we develop distributed versions of convex\nSVM classifiers for Poincar\\'e discs. In this setting, the information conveyed\nfrom clients to the global classifier are convex hulls of clusters present in\nindividual client data. Second, to avoid label switching issues, we introduce a\nnumber-theoretic approach for label recovery based on the so-called integer\n$B_h$ sequences. Third, we compute the complexity of the convex hulls in\nhyperbolic spaces to assess the extent of data leakage; at the same time, in\norder to limit the communication cost for the hulls, we propose a new\nquantization method for the Poincar\\'e disc coupled with Reed-Solomon-like\nencoding. Fourth, at server level, we introduce a new approach for aggregating\nconvex hulls of the clients based on balanced graph partitioning. We test our\nmethod on a collection of diverse data sets, including hierarchical single-cell\nRNA-seq data from different patients distributed across different repositories\nthat have stringent privacy constraints. The classification accuracy of our\nmethod is up to $\\sim 11\\%$ better than its Euclidean counterpart,\ndemonstrating the importance of privacy-preserving learning in hyperbolic\nspaces.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:25:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Prakash","Saurav",""],["Sima","Jin",""],["Pan","Chao",""],["Chien","Eli",""],["Milenkovic","Olgica",""]]}
{"id":"2308.06896","submitter":"Sanghamitra Neogi","authors":"Manoj Settipalli and Sanghamitra Neogi","title":"Investigation of Phonon Lifetimes and Magnon-Phonon Coupling in YIG/GGG\n  Hybrid Magnonic Systems in the Diffraction Limited Regime","comments":"19 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum memories facilitate the storage and retrieval of quantum information\nfor on-chip and long-distance quantum communications. Thus, they play a\ncritical role in quantum information processing (QIP) and have diverse\napplications ranging from aerospace to medical imaging. It is well established\nthat quantized vibrations (phonons) in mechanical oscillators can behave\nquantum mechanically and play an important role in QIP. Bulk acoustic wave\n(BAW) phonons are promising candidates for storing quantum information due to\ntheir long lifetimes. In this work, we investigate a hybrid magnonic system,\nwhere BAW phonons are excited in a Gadolinium Iron Garnet (GGG) thick film via\ncoupling with quantized electron spin-waves (magnons) in a Yttrium Iron Garnet\n(YIG) thin film. Recent experiments of a YIG/GGG device show that the memories\nare limited by the phonon lifetime of 0.2 $\\mu$s at room temperature. The\nphonon lifetime is expected to be longer in the milliKelvin regime. However,\nthe phonon lifetime could be limited by diffraction in that regime, especially\nfor small scale devices. A complete understanding of the diffraction-limited\nperformance of the hybrid magnonic devices is not available. We present\ntheoretical and numerical analyses of the diffraction-limited BAW phonon\nlifetimes, modeshapes, and their coupling strengths to magnons in planar and\nconfocal high-overtone bulk aoustic wave resonator (HBAR) structures. We\nutilize Fourier beam propagation and Hankel transform eigenvalue problem\napproaches and discuss the effectiveness of the two methods to predict the HBAR\nBAW phonons. Our analyses predicts the diffraction-limited phonon lifetime to\nbe on the order of 100 milliseconds in confocal HBAR structures. We illustrate\nthat a focusing dome could significantly improve the performance of hybrid\nmagnonic HBAR structures, for quantum memory and transduction applications.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:26:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Settipalli","Manoj",""],["Neogi","Sanghamitra",""]]}
{"id":"2308.06897","submitter":"Yan Zhu","authors":"Yan Zhu, Junbao Zhuo, Bin Ma, Jiajia Geng, Xiaoming Wei, Xiaolin Wei,\n  Shuhui Wang","title":"Orthogonal Temporal Interpolation for Zero-Shot Video Recognition","comments":null,"journal-ref":"Proceedings of the 31st ACM International Conference on Multimedia\n  (MM '23), October 29-November 3, 2023","doi":"10.1145/3581783.361190","report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-shot video recognition (ZSVR) is a task that aims to recognize video\ncategories that have not been seen during the model training process. Recently,\nvision-language models (VLMs) pre-trained on large-scale image-text pairs have\ndemonstrated impressive transferability for ZSVR. To make VLMs applicable to\nthe video domain, existing methods often use an additional temporal learning\nmodule after the image-level encoder to learn the temporal relationships among\nvideo frames. Unfortunately, for video from unseen categories, we observe an\nabnormal phenomenon where the model that uses spatial-temporal feature performs\nmuch worse than the model that removes temporal learning module and uses only\nspatial feature. We conjecture that improper temporal modeling on video\ndisrupts the spatial feature of the video. To verify our hypothesis, we propose\nFeature Factorization to retain the orthogonal temporal feature of the video\nand use interpolation to construct refined spatial-temporal feature. The model\nusing appropriately refined spatial-temporal feature performs better than the\none using only spatial feature, which verifies the effectiveness of the\northogonal temporal feature for the ZSVR task. Therefore, an Orthogonal\nTemporal Interpolation module is designed to learn a better refined\nspatial-temporal video feature during training. Additionally, a Matching Loss\nis introduced to improve the quality of the orthogonal temporal feature. We\npropose a model called OTI for ZSVR by employing orthogonal temporal\ninterpolation and the matching loss based on VLMs. The ZSVR accuracies on\npopular video datasets (i.e., Kinetics-600, UCF101 and HMDB51) show that OTI\noutperforms the previous state-of-the-art method by a clear margin.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:26:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Yan",""],["Zhuo","Junbao",""],["Ma","Bin",""],["Geng","Jiajia",""],["Wei","Xiaoming",""],["Wei","Xiaolin",""],["Wang","Shuhui",""]]}
{"id":"2308.06898","submitter":"Qingyuan Liang","authors":"Qingyuan Liang, Zeyu Sun, Qihao Zhu, Junhao Hu, Yifan Zhao, Lu Zhang","title":"CupCleaner: A Data Cleaning Approach for Comment Updating","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recently, deep learning-based techniques have shown promising performance on\nvarious tasks related to software engineering. For these learning-based\napproaches to perform well, obtaining high-quality data is one fundamental and\ncrucial issue. The comment updating task is an emerging software engineering\ntask aiming at automatically updating the corresponding comments based on\nchanges in source code. However, datasets for the comment updating tasks are\nusually crawled from committed versions in open source software repositories\nsuch as GitHub, where there is lack of quality control of comments. In this\npaper, we focus on cleaning existing comment updating datasets with considering\nsome properties of the comment updating process in software development. We\npropose a semantic and overlapping-aware approach named CupCleaner (Comment\nUPdating's CLEANER) to achieve this purpose. Specifically, we calculate a score\nbased on semantics and overlapping information of the code and comments. Based\non the distribution of the scores, we filter out the data with low scores in\nthe tail of the distribution to get rid of possible unclean data. We first\nconducted a human evaluation on the noise data and high-quality data identified\nby CupCleaner. The results show that the human ratings of the noise data\nidentified by CupCleaner are significantly lower. Then, we applied our data\ncleaning approach to the training and validation sets of three existing comment\nupdating datasets while keeping the test set unchanged. Our experimental\nresults show that even after filtering out over 30\\% of the data using\nCupCleaner, there is still an improvement in all performance metrics. The\nexperimental results on the cleaned test set also suggest that CupCleaner may\nprovide help for constructing datasets for updating-related tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:27:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liang","Qingyuan",""],["Sun","Zeyu",""],["Zhu","Qihao",""],["Hu","Junhao",""],["Zhao","Yifan",""],["Zhang","Lu",""]]}
{"id":"2308.06899","submitter":"Anya Katsevich","authors":"Anya Katsevich","title":"Improved Scaling with Dimension in the Bernstein-von Mises Theorem for\n  Two Statistical Models","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":"  Past works have shown that the Bernstein-von Mises theorem, on the asymptotic\nnormality of posterior distributions, holds if the parameter dimension $d$\ngrows slower than the cube root of sample size $n$. Here, we prove the first\nBernstein-von Mises theorem in the regime $d^2\\ll n$. We establish this result\nfor 1) exponential families and 2) logistic regression with Gaussian design.\nThe proof builds on our recent work on the accuracy of the Laplace\napproximation to posterior distributions, in which we showed the approximation\nerror in TV distance scales as $d/\\sqrt n$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:35:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Katsevich","Anya",""]]}
{"id":"2308.06900","submitter":"Wenjun Li","authors":"Wen-jun Li, Kai Xu, Heng Fan, Shi-ju Ran, and Gang Su","title":"Efficient Quantum Mixed-State Tomography with Unsupervised Tensor\n  Network Machine Learning","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum state tomography (QST) is plagued by the ``curse of dimensionality''\ndue to the exponentially-scaled complexity in measurement and data\npost-processing. Efficient QST schemes for large-scale mixed states are\ncurrently missing. In this work, we propose an efficient and robust mixed-state\ntomography scheme based on the locally purified state ansatz. We demonstrate\nthe efficiency and robustness of our scheme on various randomly initiated\nstates with different purities. High tomography fidelity is achieved with much\nsmaller numbers of positive-operator-valued measurement (POVM) bases than the\nconventional least-square (LS) method. On the superconducting quantum\nexperimental circuit [Phys. Rev. Lett. 119, 180511 (2017)], our scheme\naccurately reconstructs the Greenberger-Horne-Zeilinger (GHZ) state and\nexhibits robustness to experimental noises. Specifically, we achieve the\nfidelity $F \\simeq 0.92$ for the 10-qubit GHZ state with just $N_m = 500$ POVM\nbases, which far outperforms the fidelity $F \\simeq 0.85$ by the LS method\nusing the full $N_m = 3^{10} = 59049$ bases. Our work reveals the prospects of\napplying tensor network state ansatz and the machine learning approaches for\nefficient QST of many-body states.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:35:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Wen-jun",""],["Xu","Kai",""],["Fan","Heng",""],["Ran","Shi-ju",""],["Su","Gang",""]]}
{"id":"2308.06901","submitter":"Hugues Beauchesne","authors":"Hugues Beauchesne and Cheng-Wei Chiang","title":"Contributions of inert electroweak multiplets to Higgs properties","comments":"25 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  New physics could manifest itself in the form of electroweak multiplets that\ninteract at tree level with the Higgs boson but do not mix with Standard Model\nfields or acquire expectation values. In this paper, we study the potential\ncontributions of such inert multiplets to several crucial Higgs properties,\nnamely, the branching ratio of the Higgs to a $Z$ boson and a photon (or\nmassless dark photon) and the triple Higgs coupling. Constraints from the Higgs\nsignal strengths, oblique parameters and unitarity are taken into account.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:37:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Beauchesne","Hugues",""],["Chiang","Cheng-Wei",""]]}
{"id":"2308.06902","submitter":"Yuji Kodama","authors":"Yuji Kodama","title":"KP solitons and the Riemann theta functions","comments":"15 pages, added a brief remark on the Prym theta function and the BKP\n  solitons","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI hep-th math-ph math.AG math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the $\\tau$-functions of the regular KP solitons from the totally\nnonnegative Grassmannians can be expressed by the Riemann theta functions on\nsingular curves. We explicitly write the parameters in the Riemann theta\nfunction in terms of those of the KP soliton. We give a short remark on the\nPrym theta function on a double covering of singular curves. We also discuss\nthe KP soliton on quasi-periodic background, which is obtained by applying the\nvertex operators to the Riemann theta function.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:43:47 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 06:58:30 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 04:01:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kodama","Yuji",""]]}
{"id":"2308.06903","submitter":"Huaxue Zhou","authors":"Hua-Xue Zhou, Chong-Li Yang, Shi-Lin Li, Shota Kobayashi, Qifeng Yao,\n  Katsumi Tanigaki, Hidekazu Shimotani","title":"Superior surface modification layer of poly(styrene) on SiO$_2$ gate\n  insulator in rubrene single crystal field-effect transistor","comments":"9 pages, 5figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conduct comparative research on the density of states of electron- and\nhole- carrier trap levels (DTR(E)), dispersing inside the energy gap of a\nrubrene single crystal in a field effect transistor (FET) struction with Ca and\nAu hetero-electrodes for an ambipolar carrier injection mode, by using\npolymeric protection-layer materials on a Si substrate. Three different types\nof polymeric materials, poly(methyl-methacrylate) (PMMA), poly(styrene) (PS)\nand poly(chloro-styrene) (PCS) are employed. From the temperature (T)-dependent\nsource-drain current and gate voltage (ISD-VG) transfer characteristics, the\nvalues of DTR(E) are evaluated. PS exhibits the most efficiently-balanced\nambipolar carrier transport, which is superior to PMMA that is most typically\nused as the standard protection layer on a SiO$_2$/doped-Si substrate.\nDiscussions are made in the framework of a carrier multiple trap and release\n(CMTR) model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:49:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhou","Hua-Xue",""],["Yang","Chong-Li",""],["Li","Shi-Lin",""],["Kobayashi","Shota",""],["Yao","Qifeng",""],["Tanigaki","Katsumi",""],["Shimotani","Hidekazu",""]]}
{"id":"2308.06904","submitter":"Ben Kang","authors":"Ben Kang, Xin Chen, Dong Wang, Houwen Peng and Huchuan Lu","title":"Exploring Lightweight Hierarchical Vision Transformers for Efficient\n  Visual Tracking","comments":"This paper was 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 visual trackers have demonstrated significant progress\nowing to their superior modeling capabilities. However, existing trackers are\nhampered by low speed, limiting their applicability on devices with limited\ncomputational power. To alleviate this problem, we propose HiT, a new family of\nefficient tracking models that can run at high speed on different devices while\nretaining high performance. The central idea of HiT is the Bridge Module, which\nbridges the gap between modern lightweight transformers and the tracking\nframework. The Bridge Module incorporates the high-level information of deep\nfeatures into the shallow large-resolution features. In this way, it produces\nbetter features for the tracking head. We also propose a novel dual-image\nposition encoding technique that simultaneously encodes the position\ninformation of both the search region and template images. The HiT model\nachieves promising speed with competitive performance. For instance, it runs at\n61 frames per second (fps) on the Nvidia Jetson AGX edge device. Furthermore,\nHiT attains 64.6% AUC on the LaSOT benchmark, surpassing all previous efficient\ntrackers.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:51:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kang","Ben",""],["Chen","Xin",""],["Wang","Dong",""],["Peng","Houwen",""],["Lu","Huchuan",""]]}
{"id":"2308.06905","submitter":"Odest Jenkins","authors":"Odest Chadwicke Jenkins, Jessy Grizzle, Ella Atkins, Leia Stirling,\n  Elliott Rouse, Mark Guzdial, Damen Provost, Kimberly Mann, and Joanna\n  Millunchick","title":"The Michigan Robotics Undergraduate Curriculum: Defining the Discipline\n  of Robotics for Equity and Excellence","comments":"49 pages, approximately 25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV cs.HC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Robotics Major at the University of Michigan was successfully launched in\nthe 2022-23 academic year as an innovative step forward to better serve\nstudents, our communities, and our society. Building on our guiding principle\nof \"Robotics with Respect\" and our larger Robotics Pathways model, the Michigan\nRobotics Major was designed to define robotics as a true academic discipline\nwith both equity and excellence as our highest priorities. Understanding that\ntalent is equally distributed but opportunity is not, the Michigan Robotics\nMajor has embraced an adaptable curriculum that is accessible through a\ndiversity of student pathways and enables successful and sustained career-long\nparticipation in robotics, AI, and automation professions. The results after\nour planning efforts (2019-22) and first academic year (2022-23) have been\nhighly encouraging: more than 100 students declared Robotics as their major,\ncompletion of the Robotics major by our first two graduates, soaring\nenrollments in our Robotics classes, thriving partnerships with Historically\nBlack Colleges and Universities. This document provides our original curricular\nproposal for the Robotics Undergraduate Program at the University of Michigan,\nsubmitted to the Michigan Association of State Universities in April 2022 and\napproved in June 2022. The dissemination of our program design is in the spirit\nof continued growth for higher education towards realizing equity and\nexcellence.\n  The most recent version of this document is also available on Google Docs\nthrough this link: https://ocj.me/robotics_major\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:53:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jenkins","Odest Chadwicke",""],["Grizzle","Jessy",""],["Atkins","Ella",""],["Stirling","Leia",""],["Rouse","Elliott",""],["Guzdial","Mark",""],["Provost","Damen",""],["Mann","Kimberly",""],["Millunchick","Joanna",""]]}
{"id":"2308.06906","submitter":"Zhifeng Liu Dr","authors":"Xiao-Hong Wang, Meng-Chen Yue, Zhi-Feng Liu, Wei-Dong Cao, Yong Wang,\n  Jun Hu, Chang-Hao Xiao, Yao-Yong Li","title":"Numerical strategy on the grid orientation effect in the simulation for\n  two-phase flow in porous media by using the adaptive artificial viscosity\n  method","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.flu-dyn","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  It is a challenge to numerically solve nonlinear partial differential\nequations whose solution involves discontinuity. In the context of numerical\nsimulators for multi-phase flow in porous media, there exists a long-standing\nissue known as Grid Orientation Effect (GOE), wherein different numerical\nsolutions can be obtained when considering grids with different orientations\nunder certain unfavorable conditions. Our perspective is that GOE arises due to\nnumerical instability near displacement fronts, where spurious oscillations\naccompanied by sharp fronts, if not adequately suppressed, lead to GOE. To\nreduce or even eliminate GOE, we propose augmenting adaptive artificial\nviscosity when solving the saturation equation. It has been demonstrated that\nappropriate artificial viscosity can effectively reduce or even eliminate GOE.\nThe proposed numerical method can be easily applied in practical engineering\nproblems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:56:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Xiao-Hong",""],["Yue","Meng-Chen",""],["Liu","Zhi-Feng",""],["Cao","Wei-Dong",""],["Wang","Yong",""],["Hu","Jun",""],["Xiao","Chang-Hao",""],["Li","Yao-Yong",""]]}
{"id":"2308.06907","submitter":"Yonathan Arbel","authors":"Yonathan A. Arbel and David Hoffman","title":"Generative Interpretation","comments":null,"journal-ref":"99 NYU Law Review (2024)","doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CY cs.LG econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce generative interpretation, a new approach to estimating\ncontractual meaning using large language models. As AI triumphalism is the\norder of the day, we proceed by way of grounded case studies, each illustrating\nthe capabilities of these novel tools in distinct ways. Taking well-known\ncontracts opinions, and sourcing the actual agreements that they adjudicated,\nwe show that AI models can help factfinders ascertain ordinary meaning in\ncontext, quantify ambiguity, and fill gaps in parties' agreements. We also\nillustrate how models can calculate the probative value of individual pieces of\nextrinsic evidence. After offering best practices for the use of these models\ngiven their limitations, we consider their implications for judicial practice\nand contract theory. Using LLMs permits courts to estimate what the parties\nintended cheaply and accurately, and as such generative interpretation\nunsettles the current interpretative stalemate. Their use responds to\nefficiency-minded textualists and justice-oriented contextualists, who argue\nabout whether parties will prefer cost and certainty or accuracy and fairness.\nParties--and courts--would prefer a middle path, in which adjudicators strive\nto predict what the contract really meant, admitting just enough context to\napproximate reality while avoiding unguided and biased assimilation of\nevidence. As generative interpretation offers this possibility, we argue it can\nbecome the new workhorse of contractual interpretation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:59:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Arbel","Yonathan A.",""],["Hoffman","David",""]]}
{"id":"2308.06908","submitter":"Zhu An","authors":"Yuanjun Xu, Zhu An, Ning Huang, Peng Wang, Ze He, Zihan Chen","title":"Recent developments in comprehensive analytical instruments for the\n  culture heritage objects-A review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.app-ph physics.atom-ph physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces the necessity and significance of the investigation of\ncultural heritage objects. The multi-technique method is useful for the study\nof cultural heritage objects, but a comprehensive analytical instrument is a\nbetter choice since it can guarantee that different types of information are\nalways obtained from the same analytical point on the surface of cultural\nheritage objects, which may be crucial for some situations. Thus, the X-ray\nfluorescence (XRF)/X-ray diffraction (XRD) and X-ray fluorescence (XRF)/Raman\nspectroscopy (RS) comprehensive analytical instruments are more and more widely\nused to study cultural heritage objects. The two types of comprehensive\nanalytical instruments are discussed in detail and the XRF/XRD instruments are\nfurther classified into different types on the basis of structure, type and\nnumber of detectors. A new comprehensive analytical instrument prototype that\ncan perform XRF, XRD and RS measurements simultaneously has been successfully\ndeveloped by our team and the preliminary application has shown the analysis\nperformance and application potential. This overview contributes to better\nunderstand the research progress and development tendency of comprehensive\nanalytical instruments for the study of cultural heritage objects. The new\ncomprehensive instruments will make researchers obtain more valuable\ninformation on cultural heritage objects and further promote the study on\ncultural heritage objects.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:07:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Yuanjun",""],["An","Zhu",""],["Huang","Ning",""],["Wang","Peng",""],["He","Ze",""],["Chen","Zihan",""]]}
{"id":"2308.06909","submitter":"Weichen Fan","authors":"Weichen Fan, Jinghuan Chen, Ziwei Liu","title":"Hierarchy Flow For High-Fidelity Image-to-Image Translation","comments":"arXiv admin note: text overlap with arXiv:2207.01909","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image-to-image (I2I) translation comprises a wide spectrum of tasks. Here we\ndivide this problem into three levels: strong-fidelity translation,\nnormal-fidelity translation, and weak-fidelity translation, indicating the\nextent to which the content of the original image is preserved. Although\nexisting methods achieve good performance in weak-fidelity translation, they\nfail to fully preserve the content in both strong- and normal-fidelity tasks,\ne.g. sim2real, style transfer and low-level vision. In this work, we propose\nHierarchy Flow, a novel flow-based model to achieve better content preservation\nduring translation. Specifically, 1) we first unveil the drawbacks of standard\nflow-based models when applied to I2I translation. 2) Next, we propose a new\ndesign, namely hierarchical coupling for reversible feature transformation and\nmulti-scale modeling, to constitute Hierarchy Flow. 3) Finally, we present a\ndedicated aligned-style loss for a better trade-off between content\npreservation and stylization during translation. Extensive experiments on a\nwide range of I2I translation benchmarks demonstrate that our approach achieves\nstate-of-the-art performance, with convincing advantages in both strong- and\nnormal-fidelity tasks. Code and models will be at\nhttps://github.com/WeichenFan/HierarchyFlow.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:11:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fan","Weichen",""],["Chen","Jinghuan",""],["Liu","Ziwei",""]]}
{"id":"2308.06910","submitter":"Qisheng Wu","authors":"Corey M. Efaw, Qisheng Wu, Ningshengjie Gao, Yugang Zhang, Haoyu Zhou,\n  Kevin Gering, Michael F. Hurley, Hui Xiong, Enyuan Hu, Xia Cao, Wu Xu,\n  Ji-Guang Zhang, Eric J. Dufek, Jie Xiao, Xiao-Qing Yang, Jun Liu, Yue Qi, Bin\n  Li","title":"Localized High-Concentration Electrolytes Get More Localized Through\n  Micelle-Like Structures","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":"  Liquid electrolytes in batteries are typically treated as macroscopically\nhomogeneous ionic transport media despite having complex chemical composition\nand atomistic solvation structures, leaving a knowledge gap of microstructural\ncharacteristics. Here, we reveal a unique micelle-like structure in a localized\nhigh-concentration electrolyte (LHCE), in which the solvent acts as a\nsurfactant between an insoluble salt in diluent. The miscibility of the solvent\nwith the diluent and simultaneous solubility of the salt results in a\nmicelle-like structure with a smeared interface and an increased salt\nconcentration at the centre of the salt-solvent clusters that extends the salt\nsolubility. These intermingling miscibility effects have temperature\ndependencies, wherein an exemplified LHCE peaks in localized cluster salt\nconcentration near room temperature and is utilized to form a stable\nsolid-electrolyte interphase (SEI) on Li-metal anode. These findings serve as a\nguide to predicting a stable ternary phase diagram and connecting the\nelectrolyte microstructure with electrolyte formulation and formation protocols\nto form stable SEI for enhanced battery cyclability.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:12:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Efaw","Corey M.",""],["Wu","Qisheng",""],["Gao","Ningshengjie",""],["Zhang","Yugang",""],["Zhou","Haoyu",""],["Gering","Kevin",""],["Hurley","Michael F.",""],["Xiong","Hui",""],["Hu","Enyuan",""],["Cao","Xia",""],["Xu","Wu",""],["Zhang","Ji-Guang",""],["Dufek","Eric J.",""],["Xiao","Jie",""],["Yang","Xiao-Qing",""],["Liu","Jun",""],["Qi","Yue",""],["Li","Bin",""]]}
{"id":"2308.06911","submitter":"Pengfei Liu","authors":"Pengfei Liu, Yiming Ren and Zhixiang Ren","title":"GIT-Mol: A Multi-modal Large Language Model for Molecular Science with\n  Graph, Image, and Text","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models have made significant strides in natural language\nprocessing, paving the way for innovative applications including molecular\nrepresentation and generation. However, most existing single-modality\napproaches cannot capture the abundant and complex information in molecular\ndata. Here, we introduce GIT-Mol, a multi-modal large language model that\nintegrates the structure Graph, Image, and Text information, including the\nSimplified Molecular Input Line Entry System (SMILES) and molecular captions.\nTo facilitate the integration of multi-modal molecular data, we propose\nGIT-Former, a novel architecture capable of mapping all modalities into a\nunified latent space. Our study develops an innovative any-to-language\nmolecular translation strategy and achieves a 10%-15% improvement in molecular\ncaptioning, a 5%-10% accuracy increase in property prediction, and a 20% boost\nin molecule generation validity compared to baseline or single-modality models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:12:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Pengfei",""],["Ren","Yiming",""],["Ren","Zhixiang",""]]}
{"id":"2308.06912","submitter":"Nan Ding","authors":"Nan Ding, Tomer Levinboim, Jialin Wu, Sebastian Goodman, Radu Soricut","title":"CausalLM is not optimal for in-context learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent empirical evidence indicates that transformer based in-context\nlearning performs better when using a prefix language model (prefixLM), in\nwhich in-context samples can all attend to each other, compared to causal\nlanguage models (causalLM), which use auto-regressive attention that prohibits\nin-context samples to attend to future samples. While this result is intuitive,\nit is not understood from a theoretical perspective. In this paper we take a\ntheoretical approach and analyze the convergence behavior of prefixLM and\ncausalLM under a certain parameter construction. Our analysis shows that both\nLM types converge to their stationary points at a linear rate, but that while\nprefixLM converges to the optimal solution of linear regression, causalLM\nconvergence dynamics follows that of an online gradient descent algorithm,\nwhich is not guaranteed to be optimal even as the number of samples grows\ninfinitely. We supplement our theoretical claims with empirical experiments\nover synthetic and real tasks and using various types of transformers. Our\nexperiments verify that causalLM consistently underperforms prefixLM in all\nsettings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:14:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ding","Nan",""],["Levinboim","Tomer",""],["Wu","Jialin",""],["Goodman","Sebastian",""],["Soricut","Radu",""]]}
{"id":"2308.06913","submitter":"JoonHo Lee","authors":"JoonHo Lee, Jonathan Che, Sophia Rabe-Hesketh, Avi Feller, Luke\n  Miratrix","title":"Improving the Estimation of Site-Specific Effects and their Distribution\n  in Multisite Trials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In multisite trials, statistical goals often include obtaining individual\nsite-specific treatment effects, determining their rankings, and examining\ntheir distribution across multiple sites. This paper explores two strategies\nfor improving inferences related to site-specific effects: (a) semiparametric\nmodeling of the prior distribution using Dirichlet process mixture (DPM) models\nto relax the normality assumption, and (b) using estimators other than the\nposterior mean, such as the constrained Bayes or triple-goal estimators, to\nsummarize the posterior. We conduct a large-scale simulation study, calibrated\nto multisite trials common in education research. We then explore the\nconditions and degrees to which these strategies and their combinations succeed\nor falter in the limited data environments. We found that the average\nreliability of within-site effect estimates is crucial for determining\neffective estimation strategies. In settings with low-to-moderate data\ninformativeness, flexible DPM models perform no better than the simple\nparametric Gaussian model coupled with a posterior summary method tailored to a\nspecific inferential goal. DPM models outperform Gaussian models only in select\nhigh-information settings, indicating considerable sensitivity to the level of\ncross-site information available in the data. We discuss the implications of\nour findings for balancing trade-offs associated with shrinkage for the design\nand analysis of future multisite randomized experiments.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:15:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","JoonHo",""],["Che","Jonathan",""],["Rabe-Hesketh","Sophia",""],["Feller","Avi",""],["Miratrix","Luke",""]]}
{"id":"2308.06914","submitter":"Ruihui Wang","authors":"Ruihui Wang, Jie Jiang, and Yukun Luo","title":"Towards a live homogeneous database of solar active regions based on\n  SOHO/MDI and SDO/HMI synoptic magnetograms. I. Automatic detection and\n  calibration","comments":"Accepted for publication in the Astrophysical Journal Supplement\n  Series. 14 pages, 8 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent studies indicate that a small number of rogue solar active regions\n(ARs) may have a significant impact on the end-of-cycle polar field and the\nlong-term behavior of solar activity. The impact of individual ARs can be\nqualified based on their magnetic field distribution. This motivates us to\nbuild a live homogeneous AR database in a series of papers. As the first of the\nseries, we develop a method to automatically detect ARs from 1996 onwards based\non SOHO/MDI and SDO/HMI synoptic magnetograms. The method shows its advantages\nin excluding decayed ARs and unipolar regions and being compatible with any\navailable synoptic magnetograms. The identified AR flux and area are calibrated\nbased on the co-temporal SDO/HMI and SOHO/MDI data. The homogeneity and\nreliability of the database are further verified by comparing it with other\nrelevant databases. We find that ARs with weaker flux have a weaker cycle\ndependence. Stronger ARs show the weaker cycle 24 compared with cycle 23.\nSeveral basic parameters, namely, location, area, and flux of negative and\npositive polarities of identified ARs are provided in the paper. This paves the\nway for AR's new parameters quantifying the impact on the long-term behavior of\nsolar activity to be presented in the subsequent paper of the series. The\nconstantly updated database covering more than two full solar cycles will be\nbeneficial for the understanding and prediction of the solar cycle. The\ndatabase and the detection codes are accessible online.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:15:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Ruihui",""],["Jiang","Jie",""],["Luo","Yukun",""]]}
{"id":"2308.06915","submitter":"Alfredo Urbano","authors":"Lorenzo Frosina and Alfredo Urbano","title":"On the inflationary interpretation of the nHz gravitational-wave\n  background","comments":"17 pages (in double-column format) and 11 figures; v2: minor changes,\n  refs. added","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 construct a single-field model of inflation that achieves remarkable\nagreement with Planck and BICEP/Keck cosmological observations. The model, via\nthe presence of an ultra-slow-roll phase, generates a sizable scalar-induced\ngravitational wave (GW) signal at nHz frequencies. We elucidate the distinctive\nfeatures of this signal concerning its connection to the recent measurement of\nthe low-frequency GW background reported by the NANOGrav collaboration.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:21:06 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 10:32:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Frosina","Lorenzo",""],["Urbano","Alfredo",""]]}
{"id":"2308.06916","submitter":"WeiHan Hsiao","authors":"Wei-Han Hsiao","title":"Gauge field fluctuation corrected QED3 effective action by fermionic\n  particle-vortex duality","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a non-perturbative framework to incorporate gauge field\nfluctuations into QED3 effective actions in the infrared by fermionic\nparticle-vortex duality. The utility is demonstrated by the application to\nmodels containing N species of 2-component Dirac fermions in a couple of\nsolvable and interpretable electromagnetic backgrounds: N = 1 or 2. For the N =\n1 model, we establish a correspondence between fermion Casimir energy at finite\ndensity and the magnetic Euler-Heisenberg Lagrangian, and we further evaluate\nthe correction to their amplitudes. This in turn predicts the amplification of\ncharge susceptibility and the reduction of magnetic permeability. We\nadditionally supply physical interpretations to each component of our\ncalculation as well as alternative derivations based on energy density\nmeasurements in different characteristic lengths. For N = 2, we show that the\nmagnetic catalysis is erased in a U(1)$\\times$U(1) QED3 and therefore there is\nno breakdown of chiral symmetry. Some reasoning is offered based on the\nproperties of the lowest Landau level wave functions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:23:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hsiao","Wei-Han",""]]}
{"id":"2308.06917","submitter":"Carter Butts","authors":"Selena M. Livas, Scott Leo Renshaw, and Carter T. Butts","title":"Calling The Dead: Resilience In The WTC Communication Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Organizations in emergency settings must cope with various sources of\ndisruption, most notably personnel loss. Death, incapacitation, or isolation of\nindividuals within an organizational communication network can impair\ninformation passing, coordination, and connectivity, and may drive maladaptive\nresponses such as repeated attempts to contact lost personnel (``calling the\ndead'') that themselves consume scarce resources. At the same time,\norganizations may respond to such disruption by reorganizing to restore\nfunction, a behavior that is fundamental to organizational resilience. Here, we\nuse empirically calibrated models of communication for 17 groups of responders\nto the World Trade Center Disaster to examine the impact of exogenous removal\nof personnel on communication activity and network resilience. We find that\nremoval of high-degree personnel and those in institutionally coordinative\nroles is particularly damaging to these organizations, with specialist\nresponders being slower to adapt to losses. However, all organizations show\nadaptations to disruption, in some cases becoming better connected and making\nmore complete use of personnel relative to control after experiencing losses.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:29:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Livas","Selena M.",""],["Renshaw","Scott Leo",""],["Butts","Carter T.",""]]}
{"id":"2308.06918","submitter":"Daniel McPherson","authors":"Daniel K. McPherson, Deanne B. Fisher, Nikole M. Nielsen, Glenn G.\n  Kacprzak, Bronwyn Reichardt Chu, Alex J. Cameron, Alberto D. Bolatto, John\n  Chisholm, Drummond B. Fielding, Danielle Berg, Rodrigo Herrera-Camus, Miao\n  Li, Ryan J. Rickards Vaught, Karin Sandstrom","title":"DUVET Survey: Mapping Outflows in the Metal-Poor Starburst Mrk 1486","comments":"12 Pages, 6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method to characterize star-formation driven outflows from\nedge-on galaxies and apply this method to the metal-poor starburst galaxy, Mrk\n1486. Our method uses the distribution of emission line flux (from H$\\beta$ and\n[OIII] 5007) to identify the location of the outflow and measure the extent\nabove the disk, the opening angle, and the transverse kinematics. We show that\nthis simple technique recovers a similar distribution of the outflow without\nrequiring complex modelling of line-splitting or multi-Gaussian components, and\nis therefore applicable to lower spectral resolution data. In Mrk 1486 we\nobserve an asymmetric outflow in both the location of the peak flux and total\nflux from each lobe. We estimate an opening angle of $17-37^{\\circ}$ depending\non the method and assumptions adopted. Within the minor axis outflows, we\nestimate a total mass outflow rate of $\\sim2.5$ M$_{\\odot}$ yr$^{-1}$, which\ncorresponds to a mass loading factor of $\\eta=0.7$. We observe a non-negligible\namount of flux from ionized gas outflowing along the edge of the disk\n(perpendicular to the biconical components), with a mass outflow rate $\\sim0.9$\nM$_{\\odot}$ yr$^{-1}$. Our results are intended to demonstrate a method that\ncan be applied to high-throughput, low spectral resolution observations, such\nas narrow band filters or low spectral resolution IFS that may be more able to\nrecover the faint emission from outflows.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:33:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["McPherson","Daniel K.",""],["Fisher","Deanne B.",""],["Nielsen","Nikole M.",""],["Kacprzak","Glenn G.",""],["Chu","Bronwyn Reichardt",""],["Cameron","Alex J.",""],["Bolatto","Alberto D.",""],["Chisholm","John",""],["Fielding","Drummond B.",""],["Berg","Danielle",""],["Herrera-Camus","Rodrigo",""],["Li","Miao",""],["Vaught","Ryan J. Rickards",""],["Sandstrom","Karin",""]]}
{"id":"2308.06919","submitter":"Graham Smith","authors":"Graham Smith","title":"Clifford structures, bilegendrian surfaces, and extrinsic curvature","comments":"36 pages. Dedicated to Fran\\c{c}ois Labourie on the occasion of his\n  60th birthday","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use Clifford algebras to construct a unified formalism for studying\nconstant extrinsic curvature immersed surfaces in riemannian and\nsemi-riemannian $3$-manifolds in terms of immersed bilegendrian surfaces in\ntheir unitary bundles. As an application, we provide full classifications of\nboth complete and compact immersed bilegendrian surfaces in the unit tangent\nbundle $\\text{U}\\Bbb{S}^3$ of the $3$-sphere.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:40:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Smith","Graham",""]]}
{"id":"2308.06920","submitter":"Rui Wang","authors":"Rui Wang, Hongsong Feng, Guo-Wei Wei","title":"Chatbots in Drug Discovery: A Case Study on Anti-Cocaine Addiction Drug\n  Development with ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The birth of ChatGPT, a cutting-edge language model chatbot developed by\nOpenAI, ushered in a new era in AI, and this paper vividly showcases its\ninnovative application within the field of drug discovery. Focused specifically\non developing anti-cocaine addiction drugs, the study employs GPT-4 as a\nvirtual guide, offering strategic and methodological insights to researchers\nworking on generative models for drug candidates. The primary objective is to\ngenerate optimal drug-like molecules with desired properties. By leveraging the\ncapabilities of ChatGPT, the study introduces a novel approach to the drug\ndiscovery process. This symbiotic partnership between AI and researchers\ntransforms how drug development is approached. Chatbots become facilitators,\nsteering researchers towards innovative methodologies and productive paths for\ncreating effective drug candidates. This research sheds light on the\ncollaborative synergy between human expertise and AI assistance, wherein\nChatGPT's cognitive abilities enhance the design and development of potential\npharmaceutical solutions. This paper not only explores the integration of\nadvanced AI in drug discovery but also reimagines the landscape by advocating\nfor AI-powered chatbots as trailblazers in revolutionizing therapeutic\ninnovation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:43:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Rui",""],["Feng","Hongsong",""],["Wei","Guo-Wei",""]]}
{"id":"2308.06921","submitter":"Mark Liffiton","authors":"Mark Liffiton, Brad Sheese, Jaromir Savelka, Paul Denny","title":"CodeHelp: Using Large Language Models with Guardrails for Scalable\n  Support in Programming Classes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing educators face significant challenges in providing timely support\nto students, especially in large class settings. Large language models (LLMs)\nhave emerged recently and show great promise for providing on-demand help at a\nlarge scale, but there are concerns that students may over-rely on the outputs\nproduced by these models. In this paper, we introduce CodeHelp, a novel\nLLM-powered tool designed with guardrails to provide on-demand assistance to\nprogramming students without directly revealing solutions. We detail the design\nof the tool, which incorporates a number of useful features for instructors,\nand elaborate on the pipeline of prompting strategies we use to ensure\ngenerated outputs are suitable for students. To evaluate CodeHelp, we deployed\nit in a first-year computer and data science course with 52 students and\ncollected student interactions over a 12-week period. We examine students'\nusage patterns and perceptions of the tool, and we report reflections from the\ncourse instructor and a series of recommendations for classroom use. Our\nfindings suggest that CodeHelp is well-received by students who especially\nvalue its availability and help with resolving errors, and that for instructors\nit is easy to deploy and complements, rather than replaces, the support that\nthey provide to students.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:52:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liffiton","Mark",""],["Sheese","Brad",""],["Savelka","Jaromir",""],["Denny","Paul",""]]}
{"id":"2308.06922","submitter":"Peng Zhao","authors":"Peng Zhao","title":"Probabilistic contingent planning based on HTN for high-quality plans","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deterministic planning assumes that the planning evolves along a fully\npredictable path, and therefore it loses the practical value in most real\nprojections. A more realistic view is that planning ought to take into\nconsideration partial observability beforehand and aim for a more flexible and\nrobust solution. What is more significant, it is inevitable that the quality of\nplan varies dramatically in the partially observable environment. In this paper\nwe propose a probabilistic contingent Hierarchical Task Network (HTN) planner,\nnamed High-Quality Contingent Planner (HQCP), to generate high-quality plans in\nthe partially observable environment. The formalisms in HTN planning are\nextended into partial observability and are evaluated regarding the cost. Next,\nwe explore a novel heuristic for high-quality plans and develop the integrated\nplanning algorithm. Finally, an empirical study verifies the effectiveness and\nefficiency of the planner both in probabilistic contingent planning and for\nobtaining high-quality plans.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:55:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhao","Peng",""]]}
{"id":"2308.06923","submitter":"Ming Lu","authors":"Ming Lu, Runze Shang","title":"Hall algebras and quantum symmetric pairs of Kac-Moody type II","comments":"17 pages, to appear in Acta Math Sin Engl Ser. arXiv admin note: text\n  overlap with arXiv:2107.06023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We extend the $\\imath$Hall algebra realization of $\\imath$quantum groups\narising from quantum symmetric pairs, % from virtually acyclic to arbitrary\n$\\imath$quivers, which establishes an injective homomorphism from the universal\n$\\imath$quantum group of Kac-Moody type to the $\\imath$Hall algebra associated\nto an arbitrary $\\imath$quiver (not necessarily virtually acyclic). This\ngeneralizes Lu-Wang's result.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:58:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lu","Ming",""],["Shang","Runze",""]]}
{"id":"2308.06924","submitter":"Pan Wang","authors":"Pan Wang, Zeyi Li, Mengyi Fu, Zixuan Wang, Ze Zhang, MinYao Liu","title":"FedEdge AI-TC: A Semi-supervised Traffic Classification Method based on\n  Trusted Federated Deep Learning for Mobile Edge Computing","comments":"13 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As a typical entity of MEC (Mobile Edge Computing), 5G CPE (Customer Premise\nEquipment)/HGU (Home Gateway Unit) has proven to be a promising alternative to\ntraditional Smart Home Gateway. Network TC (Traffic Classification) is a vital\nservice quality assurance and security management method for communication\nnetworks, which has become a crucial functional entity in 5G CPE/HGU. In recent\nyears, many researchers have applied Machine Learning or Deep Learning (DL) to\nTC, namely AI-TC, to improve its performance. However, AI-TC faces challenges,\nincluding data dependency, resource-intensive traffic labeling, and user\nprivacy concerns. The limited computing resources of 5G CPE further complicate\nefficient classification. Moreover, the \"black box\" nature of AI-TC models\nraises transparency and credibility issues. The paper proposes the FedEdge\nAI-TC framework, leveraging Federated Learning (FL) for reliable Network TC in\n5G CPE. FL ensures privacy by employing local training, model parameter\niteration, and centralized training. A semi-supervised TC algorithm based on\nVariational Auto-Encoder (VAE) and convolutional neural network (CNN) reduces\ndata dependency while maintaining accuracy. To optimize model light-weight\ndeployment, the paper introduces XAI-Pruning, an AI model compression method\ncombined with DL model interpretability. Experimental evaluation demonstrates\nFedEdge AI-TC's superiority over benchmarks in terms of accuracy and efficient\nTC performance. The framework enhances user privacy and model credibility,\noffering a comprehensive solution for dependable and transparent Network TC in\n5G CPE, thus enhancing service quality and security.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:03:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Pan",""],["Li","Zeyi",""],["Fu","Mengyi",""],["Wang","Zixuan",""],["Zhang","Ze",""],["Liu","MinYao",""]]}
{"id":"2308.06925","submitter":"Quanziang Wang","authors":"Quanziang Wang, Renzhen Wang, Yichen Wu, Xixi Jia, Deyu Meng","title":"CBA: Improving Online Continual Learning via Continual Bias Adaptor","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Online continual learning (CL) aims to learn new knowledge and consolidate\npreviously learned knowledge from non-stationary data streams. Due to the\ntime-varying training setting, the model learned from a changing distribution\neasily forgets the previously learned knowledge and biases toward the newly\nreceived task. To address this problem, we propose a Continual Bias Adaptor\n(CBA) module to augment the classifier network to adapt to catastrophic\ndistribution change during training, such that the classifier network is able\nto learn a stable consolidation of previously learned tasks. In the testing\nstage, CBA can be removed which introduces no additional computation cost and\nmemory overhead. We theoretically reveal the reason why the proposed method can\neffectively alleviate catastrophic distribution shifts, and empirically\ndemonstrate its effectiveness through extensive experiments based on four\nrehearsal-based baselines and three public continual learning benchmarks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:03:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Quanziang",""],["Wang","Renzhen",""],["Wu","Yichen",""],["Jia","Xixi",""],["Meng","Deyu",""]]}
{"id":"2308.06926","submitter":"Fulin Gao","authors":"Fulin Gao, Weimin Zhong, Zhixing Cao, Xin Peng, Zhi Li","title":"OpenGCD: Assisting Open World Recognition with Generalized Category\n  Discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A desirable open world recognition (OWR) system requires performing three\ntasks: (1) Open set recognition (OSR), i.e., classifying the known (classes\nseen during training) and rejecting the unknown (unseen$/$novel classes)\nonline; (2) Grouping and labeling these unknown as novel known classes; (3)\nIncremental learning (IL), i.e., continual learning these novel classes and\nretaining the memory of old classes. Ideally, all of these steps should be\nautomated. However, existing methods mostly assume that the second task is\ncompletely done manually. To bridge this gap, we propose OpenGCD that combines\nthree key ideas to solve the above problems sequentially: (a) We score the\norigin of instances (unknown or specifically known) based on the uncertainty of\nthe classifier's prediction; (b) For the first time, we introduce generalized\ncategory discovery (GCD) techniques in OWR to assist humans in grouping\nunlabeled data; (c) For the smooth execution of IL and GCD, we retain an equal\nnumber of informative exemplars for each class with diversity as the goal.\nMoreover, we present a new performance evaluation metric for GCD called\nharmonic clustering accuracy. Experiments on two standard classification\nbenchmarks and a challenging dataset demonstrate that OpenGCD not only offers\nexcellent compatibility but also substantially outperforms other baselines.\nCode: https://github.com/Fulin-Gao/OpenGCD.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:10:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gao","Fulin",""],["Zhong","Weimin",""],["Cao","Zhixing",""],["Peng","Xin",""],["Li","Zhi",""]]}
{"id":"2308.06927","submitter":"Aram Ebtekar","authors":"Aram Ebtekar","title":"The algorithmic second law of thermodynamics","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  G\\'acs' coarse-grained algorithmic entropy leverages universal computation to\nquantify the information content of any given state. Unlike the Boltzmann and\nShannon-Gibbs entropies, it requires no prior commitment to a partition of\nphase space or to probabilistic ensembles. Whereas earlier work had made loose\nconnections between the entropy of thermodynamic systems and\ninformation-processing systems, the algorithmic entropy formally unifies them\nboth. For a close variant of G\\'acs' definition, we prove a very general second\nlaw of thermodynamics, and discuss its advantages over previous formulations.\nOur law is a general property of Markov processes, which can be derived as\ncoarse-grainings of certain time-reversible dynamical systems. Finally, taking\ninspiration from Maxwell's demon, we model an information engine powered by\ncompressible data.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:13:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ebtekar","Aram",""]]}
{"id":"2308.06928","submitter":"Tasbolat Taunyazov","authors":"Tasbolat Taunyazov, Heng Zhang, John Patrick Eala, Na Zhao and Harold\n  Soh","title":"Refining 6-DoF Grasps with Context-Specific Classifiers","comments":"IROS 2023, Code and Datasets are available at\n  https://github.com/tasbolat1/graspflow","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 present GraspFlow, a refinement approach for generating\ncontext-specific grasps. We formulate the problem of grasp synthesis as a\nsampling problem: we seek to sample from a context-conditioned probability\ndistribution of successful grasps. However, this target distribution is\nunknown. As a solution, we devise a discriminator gradient-flow method to\nevolve grasps obtained from a simpler distribution in a manner that mimics\nsampling from the desired target distribution. Unlike existing approaches,\nGraspFlow is modular, allowing grasps that satisfy multiple criteria to be\nobtained simply by incorporating the relevant discriminators. It is also simple\nto implement, requiring minimal code given existing auto-differentiation\nlibraries and suitable discriminators. Experiments show that GraspFlow\ngenerates stable and executable grasps on a real-world Panda robot for a\ndiverse range of objects. In particular, in 60 trials on 20 different household\nobjects, the first attempted grasp was successful 94% of the time, and 100%\ngrasp success was achieved by the second grasp. Moreover, incorporating a\nfunctional discriminator for robot-human handover improved the functional\naspect of the grasp by up to 33%.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:13:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Taunyazov","Tasbolat",""],["Zhang","Heng",""],["Eala","John Patrick",""],["Zhao","Na",""],["Soh","Harold",""]]}
{"id":"2308.06929","submitter":"Seifey Mohammad","authors":"Sam Chapman, Seifey Mohammad, Kimberly Villegas","title":"Predicting Listing Prices In Dynamic Short Term Rental Markets Using\n  Machine Learning Models","comments":"40 pages, 10 tables, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our research group wanted to take on the difficult task of predicting prices\nin a dynamic market. And short term rentals such as Airbnb listings seemed to\nbe the perfect proving ground to do such a thing. Airbnb has revolutionized the\ntravel industry by providing a platform for homeowners to rent out their\nproperties to travelers. The pricing of Airbnb rentals is prone to high\nfluctuations, with prices changing frequently based on demand, seasonality, and\nother factors. Accurate prediction of Airbnb rental prices is crucial for hosts\nto optimize their revenue and for travelers to make informed booking decisions.\nIn this project, we aim to predict the prices of Airbnb rentals using a machine\nlearning modeling approach.\n  Our project expands on earlier research in the area of analyzing Airbnb\nrental prices by taking a methodical machine learning approach as well as\nincorporating sentiment analysis into our feature engineering. We intend to\ngain a deeper understanding on periodic changes of Airbnb rental prices. The\nprimary objective of this study is to construct an accurate machine learning\nmodel for predicting Airbnb rental prices specifically in Austin, Texas. Our\nproject's secondary objective is to identify the key factors that drive Airbnb\nrental prices and to investigate how these factors vary across different\nlocations and property types.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:15:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chapman","Sam",""],["Mohammad","Seifey",""],["Villegas","Kimberly",""]]}
{"id":"2308.06930","submitter":"Daosheng Deng","authors":"Li Chen, Feng Wang, Yingrui Wang, Peng Huo, Yuqi Li, Xi Gu, Man Hu,\n  and Daosheng Deng","title":"Vertical-supercooling-controlled interfacial instability for a spreading\n  liquid film","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thermal effect is essential to regulate the interfacial instabilities for\ndiverse technology applications. Here we report the fingering instability at\nthe propagation front for a spreading liquid film subjected to the supercooling\nat the vertical direction. We find the onset timescale of hydrodynamic\ninstability is strongly correlated with that of the vertical solidification\nprocess. This correlation is further validated in a non-uniform geometry,\ndemonstrating the capability of controlling fingering instability by structure\ndesign. Moreover, based on the experimental observations, we propose a physical\nmechanism by considering thermal Marangoni effect at the spreading front, and\nthe predicted wavelength from the linear stability analysis agrees with\nexperiments excellently. This work offers another valuable dimension by gating\nthe vertical temperature to exploit the interfacial stabilities and steer\nliquid flow, consequently shedding light on the microfluidic cooling for\nelectronics, and the advanced functional fibers and fabrics.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:17:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Li",""],["Wang","Feng",""],["Wang","Yingrui",""],["Huo","Peng",""],["Li","Yuqi",""],["Gu","Xi",""],["Hu","Man",""],["Deng","Daosheng",""]]}
{"id":"2308.06931","submitter":"Siyu Teng","authors":"Siyu Teng, Luxi Li, Yuchen Li, Xuemin Hu, Lingxi Li, Yunfeng Ai, Long\n  Chen","title":"FusionPlanner: A Multi-task Motion Planner for Mining Trucks using\n  Multi-sensor Fusion Method","comments":"2Pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, significant achievements have been made in motion planning\nfor intelligent vehicles. However, as a typical unstructured environment,\nopen-pit mining attracts limited attention due to its complex operational\nconditions and adverse environmental factors. A comprehensive paradigm for\nunmanned transportation in open-pit mines is proposed in this research,\nincluding a simulation platform, a testing benchmark, and a trustworthy and\nrobust motion planner. \\textcolor{red}{Firstly, we propose a multi-task motion\nplanning algorithm, called FusionPlanner, for autonomous mining trucks by the\nMulti-sensor fusion method to adapt both lateral and longitudinal control tasks\nfor unmanned transportation. Then, we develop a novel benchmark called\nMiningNav, which offers three validation approaches to evaluate the\ntrustworthiness and robustness of well-trained algorithms in transportation\nroads of open-pit mines. Finally, we introduce the Parallel Mining Simulator\n(PMS), a new high-fidelity simulator specifically designed for open-pit mining\nscenarios. PMS enables the users to manage and control open-pit mine\ntransportation from both the single-truck control and multi-truck scheduling\nperspectives.} \\textcolor{red}{The performance of FusionPlanner is tested by\nMiningNav in PMS, and the empirical results demonstrate a significant reduction\nin the number of collisions and takeovers of our planner. We anticipate our\nunmanned transportation paradigm will bring mining trucks one step closer to\ntrustworthiness and robustness in continuous round-the-clock unmanned\ntransportation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:18:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Teng","Siyu",""],["Li","Luxi",""],["Li","Yuchen",""],["Hu","Xuemin",""],["Li","Lingxi",""],["Ai","Yunfeng",""],["Chen","Long",""]]}
{"id":"2308.06932","submitter":"Sudipta Paria","authors":"Sudipta Paria, Aritra Dasgupta and Swarup Bhunia","title":"DIVAS: An LLM-based End-to-End Framework for SoC Security Analysis and\n  Policy-based Protection","comments":"15 pages, 7 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Securing critical assets in a bus-based System-On-Chip (SoC) is imperative to\nmitigate potential vulnerabilities and prevent unauthorized access, ensuring\nthe integrity, availability, and confidentiality of the system. Ensuring\nsecurity throughout the SoC design process is a formidable task owing to the\ninherent intricacies in SoC designs and the dispersion of assets across diverse\nIPs. Large Language Models (LLMs), exemplified by ChatGPT (OpenAI) and BARD\n(Google), have showcased remarkable proficiency across various domains,\nincluding security vulnerability detection and prevention in SoC designs. In\nthis work, we propose DIVAS, a novel framework that leverages the knowledge\nbase of LLMs to identify security vulnerabilities from user-defined SoC\nspecifications, map them to the relevant Common Weakness Enumerations (CWEs),\nfollowed by the generation of equivalent assertions, and employ security\nmeasures through enforcement of security policies. The proposed framework is\nimplemented using multiple ChatGPT and BARD models, and their performance was\nanalyzed while generating relevant CWEs from the SoC specifications provided.\nThe experimental results obtained from open-source SoC benchmarks demonstrate\nthe efficacy of our proposed framework.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:21:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Paria","Sudipta",""],["Dasgupta","Aritra",""],["Bhunia","Swarup",""]]}
{"id":"2308.06933","submitter":"Weihang Dai","authors":"Weihang Dai, Xiaomeng Li, Taihui Yu, Di Zhao, Jun Shen, Kwang-Ting\n  Cheng","title":"Radiomics-Informed Deep Learning for Classification of Atrial\n  Fibrillation Sub-Types from Left-Atrium CT Volumes","comments":"Accepted by MICCAI23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atrial Fibrillation (AF) is characterized by rapid, irregular heartbeats, and\ncan lead to fatal complications such as heart failure. The disease is divided\ninto two sub-types based on severity, which can be automatically classified\nthrough CT volumes for disease screening of severe cases. However, existing\nclassification approaches rely on generic radiomic features that may not be\noptimal for the task, whilst deep learning methods tend to over-fit to the\nhigh-dimensional volume inputs. In this work, we propose a novel\nradiomics-informed deep-learning method, RIDL, that combines the advantages of\ndeep learning and radiomic approaches to improve AF sub-type classification.\nUnlike existing hybrid techniques that mostly rely on na\\\"ive feature\nconcatenation, we observe that radiomic feature selection methods can serve as\nan information prior, and propose supplementing low-level deep neural network\n(DNN) features with locally computed radiomic features. This reduces DNN\nover-fitting and allows local variations between radiomic features to be better\ncaptured. Furthermore, we ensure complementary information is learned by deep\nand radiomic features by designing a novel feature de-correlation loss.\nCombined, our method addresses the limitations of deep learning and radiomic\napproaches and outperforms state-of-the-art radiomic, deep learning, and hybrid\napproaches, achieving 86.9% AUC for the AF sub-type classification task. Code\nis available at https://github.com/xmed-lab/RIDL.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:22:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dai","Weihang",""],["Li","Xiaomeng",""],["Yu","Taihui",""],["Zhao","Di",""],["Shen","Jun",""],["Cheng","Kwang-Ting",""]]}
{"id":"2308.06934","submitter":"Zongyu Zuo","authors":"Zirui Chen and Zongyu Zuo","title":"Non-singular Cooperative Guiding Vector Field Under a Homotopy\n  Equivalence Transformation","comments":"12 pages, 12 figures, submitting to TAC at present","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The present article advances the concept of a non-singular cooperative\nguiding vector field under a homotopy equivalence transformation. Firstly, the\nderivation of a guiding vector field, based on a non-singular vector field, is\nelaborated to navigate a transformed path from another frame. The existence of\nsuch vector fields is also deliberated herein. Subsequently, a coordination\nvector field derived from the guiding vector field is presented, incorporating\nan in-depth analysis concerning the impact of the vector field parameters.\nLastly, the practical implementation of this novel vector field is demonstrated\nby its applications to 2-D and 3-D cooperative moving path following issues,\nestablishing its efficacy.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:32:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Zirui",""],["Zuo","Zongyu",""]]}
{"id":"2308.06935","submitter":"Yufei Zhang","authors":"Tanut Treetanthiploet, Yufei Zhang, Lukasz Szpruch, Isaac\n  Bowers-Barnard, Henrietta Ridley, James Hickey, Chris Pearce","title":"Insurance pricing on price comparison websites via reinforcement\n  learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PR cs.LG q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence of price comparison websites (PCWs) has presented insurers with\nunique challenges in formulating effective pricing strategies. Operating on\nPCWs requires insurers to strike a delicate balance between competitive\npremiums and profitability, amidst obstacles such as low historical conversion\nrates, limited visibility of competitors' actions, and a dynamic market\nenvironment. In addition to this, the capital intensive nature of the business\nmeans pricing below the risk levels of customers can result in solvency issues\nfor the insurer. To address these challenges, this paper introduces\nreinforcement learning (RL) framework that learns the optimal pricing policy by\nintegrating model-based and model-free methods. The model-based component is\nused to train agents in an offline setting, avoiding cold-start issues, while\nmodel-free algorithms are then employed in a contextual bandit (CB) manner to\ndynamically update the pricing policy to maximise the expected revenue. This\nfacilitates quick adaptation to evolving market dynamics and enhances algorithm\nefficiency and decision interpretability. The paper also highlights the\nimportance of evaluating pricing policies using an offline dataset in a\nconsistent fashion and demonstrates the superiority of the proposed methodology\nover existing off-the-shelf RL/CB approaches. We validate our methodology using\nsynthetic data, generated to reflect private commercially available data within\nreal-world insurers, and compare against 6 other benchmark approaches. Our\nhybrid agent outperforms these benchmarks in terms of sample efficiency and\ncumulative reward with the exception of an agent that has access to perfect\nmarket information which would not be available in a real-world set-up.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:44:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Treetanthiploet","Tanut",""],["Zhang","Yufei",""],["Szpruch","Lukasz",""],["Bowers-Barnard","Isaac",""],["Ridley","Henrietta",""],["Hickey","James",""],["Pearce","Chris",""]]}
{"id":"2308.06936","submitter":"Liming Yang","authors":"Liming Yang","title":"The Commutant of Multiplication by z on the Closure of Rational\n  Functions in $L^t(\\mu)$","comments":"arXiv admin note: text overlap with arXiv:2212.10811","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a compact set $K\\subset \\mathbb C,$ a finite positive Borel measure $\\mu$\non $K,$ and $1 \\le t < \\i,$ let $\\text{Rat}(K)$ be the set of rational\nfunctions with poles off $K$ and let $R^t(K, \\mu)$ be the closure of\n$\\text{Rat}(K)$ in $L^t(\\mu).$ For a bounded Borel subset $\\mathcal D\\subset\n\\mathbb C,$ let $\\area_{\\mathcal D}$ denote the area (Lebesgue) measure\nrestricted to $\\mathcal D$ and let $H^\\i (\\mathcal D)$ be the weak-star closed\nsub-algebra of $L^\\i(\\area_{\\mathcal D})$ spanned by $f,$ bounded and analytic\non $\\mathbb C\\setminus E_f$ for some compact subset $E_f \\subset \\mathbb\nC\\setminus \\mathcal D.$ We show that if $R^t(K, \\mu)$ contains no non-trivial\ndirect $L^t$ summands, then there exists a Borel subset $\\mathcal R \\subset K$\nwhose closure contains the support of $\\mu$ and there exists an isometric\nisomorphism and a weak-star homeomorphism $\\rho$ from $R^t(K, \\mu) \\cap\nL^\\infty(\\mu)$ onto $H^\\infty(\\mathcal R)$ such that $\\rho(r) = r$ for all\n$r\\in\\text{Rat}(K).$ Consequently, we obtain some structural decomposition\ntheorems for $\\rtkmu$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:47:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Liming",""]]}
{"id":"2308.06937","submitter":"Zongyu Zuo","authors":"Zirui Chen and Zongyu Zuo","title":"A Frequency-Domain Path-Following Method for Discrete Data-Based Paths","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 novel frequency-domain approach for path following\nproblem, specifically designed to handle paths described by discrete data. The\nproposed algorithm utilizes the fast Fourier Transform (FFT) to process the\ndiscrete path data, enabling the construction of a non-singular guiding vector\nfield. This vector field serves as a reference direction for the controlled\nrobot, offering the ability to adapt to different levels of precision.\nAdditionally, the frequency-domain nature of the vector field allows for the\nreduction of computational complexity and effective noise suppression. The\nefficacy of the proposed approach is demonstrated through a numerical\nsimulation, and theoretical analysis provides an upper bound for the ultimate\nmean-square path-following error.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 04:57:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chen","Zirui",""],["Zuo","Zongyu",""]]}
{"id":"2308.06938","submitter":"Wei-Tse Hsu","authors":"Wei-Tse Hsu and Michael R. Shirts","title":"Ensemble of expanded ensembles: A generalized ensemble approach with\n  enhanced flexibility and parallelizability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past decade, alchemical free energy methods like Hamiltonian replica\nexchange (HREX) and expanded ensemble (EXE) have gained popularity for the\ncomputation of solvation free energies and binding free energies. These methods\nconnect the end states of interest via nonphysical pathways defined by states\nwith different modified Hamiltonians. However, there exist systems where\ntraversing all alchemical intermediate states is challenging, even if\nalchemical biases (e.g., in EXE) or coordinate exchanges (e.g., in HREX) are\napplied. This issue is exacerbated when the state space is multidimensional,\nwhich can require extensive communications between hundreds of cores that\ncurrent parallelization schemes do not fully support.\n  To address this challenge, we present the method of ensemble of expanded\nensembles (EEXE), which integrates the principles of EXE and HREX.\nSpecifically, the EEXE method periodically exchanges coordinates of EXE\nreplicas sampling different ranges of states and allows combining weights\nacross replicas. With the solvation free energy calculation of anthracene, we\nshow that the EEXE method achieves accuracy akin to the EXE and HREX methods in\nfree energy calculations, while offering higher flexibility in parameter\nspecification. Additionally, its parallelizability opens the door to wider\napplications, such as estimating free energy profiles of serial mutations.\nImportantly, extensions to the EEXE approach can be done asynchronously,\nallowing looser communications between larger numbers of loosely coupled\nprocessors, such as when using cloud computing, than methods such as replica\nexchange. They also allow adaptive changes to the parameters of ensembles in\nresponse to data collected. All algorithms for the EEXE method are available in\nthe Python package ensemble_md, which offers an interface for EEXE simulation\nmanagement without modifying the source code in GROMACS.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:02:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hsu","Wei-Tse",""],["Shirts","Michael R.",""]]}
{"id":"2308.06939","submitter":"Miguel Arratia","authors":"Sebouh J. Paul, Miguel Arratia","title":"Leveraging Staggered Tessellation for Enhanced Spatial Resolution in\n  High-Granularity Calorimeters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We advance the concept of high-granularity calorimeters with staggered\ntessellations, underscoring the effectiveness of a design incorporating\nmultifold staggering cycles based on hexagonal cells to enhance position\nresolution. Moreover, we introduce HEXPLIT, a sub-cell re-weighting algorithm\ntailored to harness staggered designs, resulting in additional performance\nimprovements. By combining our proposed staggered design with HEXPLIT, we\nachieve an approximately twofold enhancement in position resolution for\nneutrons across a wide energy range, as compared to unstaggered designs. These\nfindings hold the potential to elevate particle-flow performance across various\nforthcoming facilities.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:06:46 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 04:28:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Paul","Sebouh J.",""],["Arratia","Miguel",""]]}
{"id":"2308.06940","submitter":"Benjamin Seibold","authors":"Rujeko Chinomona, Kiera Kean, Benjamin Seibold, Jacob Woods","title":"Moment Methods for Advection on Networks and an Application to Forest\n  Pest Life Cycle Models","comments":"31 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper develops low-dimensional moment methods for advective problems on\nnetworks of domains. The evolution of a density function is described by a\nlinear advection-diffusion-reaction equation on each domain, combined via\nadvective flux coupling across domains in the network graph. The PDEs'\ncoefficients vary in time and across domains but they are fixed along each\ndomain. As a result, the solution on each domain is frequently close to a\nGaussian that moves, decays, and widens. For that reason, this work studies\nmoment methods that track only three degrees of freedom per domain -- in\ncontrast to traditional PDE discretization methods that tend to require many\nmore variables per domain. A simple ODE-based moment method is developed, as\nwell as an asymptotic-preserving scheme. We apply the methodology to an\napplication that models the life cycle of forest pests that undergo different\nlife stages and developmental pathways. The model is calibrated for the spotted\nlanternfly, an invasive species present in the Eastern USA. We showcase that\nthe moment method, despite its significant low-dimensionality, can successfully\nreproduce the prediction of the pest's establishment potential, compared to\nmuch higher-dimensional computational approaches.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:10:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chinomona","Rujeko",""],["Kean","Kiera",""],["Seibold","Benjamin",""],["Woods","Jacob",""]]}
{"id":"2308.06941","submitter":"Bivudutta Mishra Dr.","authors":"Abhilipsa Sahoo, S.K. Tripathy, B. Mishra, Saibal Ray","title":"Casimir wormhole with GUP correction in extended symmetric teleparallel\n  gravity","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum mechanical concept such as the Casimir effect is explored to model\ntraversable wormholes in an extended teleparallel gravity theory. The minimal\nlength concept leading to the generalized uncertainty principle (GUP) is used\nto obtain the Casimir energy density. The effect of the GUP correction in the\ngeometrical and physical properties of traversable Casimir wormholes are\ninvestigated. It is noted that the GUP correction has a substantial effect on\nthe wormhole geometry and it modifies the energy condition. From a detailed\ncalculation of the exotic matter content of the GUP corrected Casimir wormhole,\nit is shown that, a minimal amount of exotic matter is sufficient to support\nthe stability of the wormhole.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:16:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sahoo","Abhilipsa",""],["Tripathy","S. K.",""],["Mishra","B.",""],["Ray","Saibal",""]]}
{"id":"2308.06942","submitter":"Cynthia Huang","authors":"Cynthia Huang, Yuqing Xie, Zhiying Jiang, Jimmy Lin, Ming Li","title":"Approximating Human-Like Few-shot Learning with GPT-based Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we conceptualize the learning process as information\ncompression. We seek to equip generative pre-trained models with human-like\nlearning capabilities that enable data compression during inference. We present\na novel approach that utilizes the Generative Pre-trained Transformer (GPT) to\napproximate Kolmogorov complexity, with the aim of estimating the optimal\nInformation Distance for few-shot learning. We first propose using GPT as a\nprior for lossless text compression, achieving a noteworthy compression ratio.\nExperiment with LLAMA2-7B backbone achieves a compression ratio of 15.5 on\nenwik9. We justify the pre-training objective of GPT models by demonstrating\nits equivalence to the compression length, and, consequently, its ability to\napproximate the information distance for texts. Leveraging the approximated\ninformation distance, our method allows the direct application of GPT models in\nquantitative text similarity measurements. Experiment results show that our\nmethod overall achieves superior performance compared to embedding and prompt\nbaselines on challenging NLP tasks, including semantic similarity, zero and\none-shot text classification, and zero-shot text ranking.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:22:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Huang","Cynthia",""],["Xie","Yuqing",""],["Jiang","Zhiying",""],["Lin","Jimmy",""],["Li","Ming",""]]}
{"id":"2308.06943","submitter":"Jack Li","authors":"Jianhua Li, Sophie Mckenzie, Richard Dazeley, Frank Jiang, Keshav Sood","title":"Current Status and Trends of Engineering Entrepreneurship Education in\n  Australian Universities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research sheds light on the present and future landscape of Engineering\nEntrepreneurship Education (EEE) by exploring varied approaches and models\nadopted in Australian universities, evaluating program effectiveness, and\noffering recommendations for curriculum enhancement. While EEE programs have\nbeen in existence for over two decades, their efficacy remains underexplored.\nUsing a multi-method approach encompassing self-reflection, scoping review,\nsurveys, and interviews, this study addresses key research questions regarding\nthe state, challenges, trends, and effectiveness of EEE. Findings reveal\nchallenges like resource limitations and propose solutions such as experiential\nlearning and industry partnerships. These insights underscore the importance of\ntailored EEE and inform teaching strategies and curriculum development,\nbenefiting educators and policymakers worldwide.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:23:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Jianhua",""],["Mckenzie","Sophie",""],["Dazeley","Richard",""],["Jiang","Frank",""],["Sood","Keshav",""]]}
{"id":"2308.06944","submitter":"Ratko Grbi\\'c","authors":"Brando Koch, Ratko Grbi\\'c","title":"One-shot lip-based biometric authentication: extending behavioral\n  features with authentication phrase information","comments":"28 pages, 10 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lip-based biometric authentication (LBBA) is an authentication method based\non a person's lip movements during speech in the form of video data captured by\na camera sensor. LBBA can utilize both physical and behavioral characteristics\nof lip movements without requiring any additional sensory equipment apart from\nan RGB camera. State-of-the-art (SOTA) approaches use one-shot learning to\ntrain deep siamese neural networks which produce an embedding vector out of\nthese features. Embeddings are further used to compute the similarity between\nan enrolled user and a user being authenticated. A flaw of these approaches is\nthat they model behavioral features as style-of-speech without relation to what\nis being said. This makes the system vulnerable to video replay attacks of the\nclient speaking any phrase. To solve this problem we propose a one-shot\napproach which models behavioral features to discriminate against what is being\nsaid in addition to style-of-speech. We achieve this by customizing the GRID\ndataset to obtain required triplets and training a siamese neural network based\non 3D convolutions and recurrent neural network layers. A custom triplet loss\nfor batch-wise hard-negative mining is proposed. Obtained results using an\nopen-set protocol are 3.2% FAR and 3.8% FRR on the test set of the customized\nGRID dataset. Additional analysis of the results was done to quantify the\ninfluence and discriminatory power of behavioral and physical features for\nLBBA.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:34:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Koch","Brando",""],["Grbi\u0107","Ratko",""]]}
{"id":"2308.06945","submitter":"Jinhyun Jang","authors":"Jinhyun Jang, Taeyong Song, Kwanghoon Sohn","title":"Semantic-aware Network for Aerial-to-Ground Image Synthesis","comments":"ICIP 2021. Code is available at https://github.com/jinhyunj/SANet","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aerial-to-ground image synthesis is an emerging and challenging problem that\naims to synthesize a ground image from an aerial image. Due to the highly\ndifferent layout and object representation between the aerial and ground\nimages, existing approaches usually fail to transfer the components of the\naerial scene into the ground scene. In this paper, we propose a novel framework\nto explore the challenges by imposing enhanced structural alignment and\nsemantic awareness. We introduce a novel semantic-attentive feature\ntransformation module that allows to reconstruct the complex geographic\nstructures by aligning the aerial feature to the ground layout. Furthermore, we\npropose semantic-aware loss functions by leveraging a pre-trained segmentation\nnetwork. The network is enforced to synthesize realistic objects across various\nclasses by separately calculating losses for different classes and balancing\nthem. Extensive experiments including comparisons with previous methods and\nablation studies show the effectiveness of the proposed framework both\nqualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:37:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jang","Jinhyun",""],["Song","Taeyong",""],["Sohn","Kwanghoon",""]]}
{"id":"2308.06946","submitter":"Raghav Govind Jha","authors":"Raghav G. Jha, Felix Ringer, George Siopsis, Shane Thompson","title":"Toward quantum computations of the $O(3)$ model using qumodes","comments":"Proceedings for the 40th International Symposium on Lattice Field\n  Theory (31 July - 4 August 2023) at Fermilab. 8 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We express the discrete 1+1-dimensional $O(3)$ non-linear sigma model\n(NL$\\sigma$M) in a form well-suited for the continuous variable approach to\nquantum computing. Within the Schwinger boson formulation, we need two qumodes\n(quantum-mechanical oscillators) at each lattice site. We envision that it\nmight be possible to reach the scaling regime of this model and observe\nasymptotic freedom on near-term photonic quantum devices in the coming decade.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:37:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jha","Raghav G.",""],["Ringer","Felix",""],["Siopsis","George",""],["Thompson","Shane",""]]}
{"id":"2308.06947","submitter":"Jinhyun Jang","authors":"Jinhyun Jang, Jungin Park, Jin Kim, Hyeongjun Kwon, Kwanghoon Sohn","title":"Knowing Where to Focus: Event-aware Transformer for Video Grounding","comments":"ICCV 2023. Code is available at https://github.com/jinhyunj/EaTR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent DETR-based video grounding models have made the model directly predict\nmoment timestamps without any hand-crafted components, such as a pre-defined\nproposal or non-maximum suppression, by learning moment queries. However, their\ninput-agnostic moment queries inevitably overlook an intrinsic temporal\nstructure of a video, providing limited positional information. In this paper,\nwe formulate an event-aware dynamic moment query to enable the model to take\nthe input-specific content and positional information of the video into\naccount. To this end, we present two levels of reasoning: 1) Event reasoning\nthat captures distinctive event units constituting a given video using a slot\nattention mechanism; and 2) moment reasoning that fuses the moment queries with\na given sentence through a gated fusion transformer layer and learns\ninteractions between the moment queries and video-sentence representations to\npredict moment timestamps. Extensive experiments demonstrate the effectiveness\nand efficiency of the event-aware dynamic moment queries, outperforming\nstate-of-the-art approaches on several video grounding benchmarks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:54:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jang","Jinhyun",""],["Park","Jungin",""],["Kim","Jin",""],["Kwon","Hyeongjun",""],["Sohn","Kwanghoon",""]]}
{"id":"2308.06948","submitter":"Yu Liang","authors":"Yu Liang, Shiliang Zhang, Yaowei Wang, Sheng Xiao, Kenli Li, Xiaoyu\n  Wang","title":"MixBCT: Towards Self-Adapting Backward-Compatible Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exponential growth of data, alongside advancements in model structures\nand loss functions, has necessitated the enhancement of image retrieval systems\nthrough the utilization of new models with superior feature embeddings.\nHowever, the expensive process of updating the old retrieval database by\nreplacing embeddings poses a challenge. As a solution, backward-compatible\ntraining can be employed to avoid the necessity of updating old retrieval\ndatasets. While previous methods achieved backward compatibility by aligning\nprototypes of the old model, they often overlooked the distribution of the old\nfeatures, thus limiting their effectiveness when the old model's low quality\nleads to a weakly discriminative feature distribution. On the other hand,\ninstance-based methods like L2 regression take into account the distribution of\nold features but impose strong constraints on the performance of the new model\nitself. In this paper, we propose MixBCT, a simple yet highly effective\nbackward-compatible training method that serves as a unified framework for old\nmodels of varying qualities. Specifically, we summarize four constraints that\nare essential for ensuring backward compatibility in an ideal scenario, and we\nconstruct a single loss function to facilitate backward-compatible training.\nOur approach adaptively adjusts the constraint domain for new features based on\nthe distribution of the old embeddings. We conducted extensive experiments on\nthe large-scale face recognition datasets MS1Mv3 and IJB-C to verify the\neffectiveness of our method. The experimental results clearly demonstrate its\nsuperiority over previous methods. Code is available at\nhttps://github.com/yuleung/MixBCT\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:55:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liang","Yu",""],["Zhang","Shiliang",""],["Wang","Yaowei",""],["Xiao","Sheng",""],["Li","Kenli",""],["Wang","Xiaoyu",""]]}
{"id":"2308.06949","submitter":"Xingchao Jian","authors":"Xingchao Jian, Wee Peng Tay, Yonina C. Eldar","title":"Kernel Based Reconstruction for Generalized Graph Signal Processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In generalized graph signal processing (GGSP), the signal associated with\neach vertex in a graph is an element from a Hilbert space. In this paper, we\nstudy GGSP signal reconstruction as a kernel ridge regression (KRR) problem. By\ndevising an appropriate kernel, we show that this problem has a solution that\ncan be evaluated in a distributed way. We interpret the problem and solution\nusing both deterministic and Bayesian perspectives and link them to existing\ngraph signal processing and GGSP frameworks. We then provide an online\nimplementation via random Fourier features. Under the Bayesian framework, we\ninvestigate the statistical performance under the asymptotic sampling scheme.\nFinally, we validate our theory and methods on real-world datasets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:56:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jian","Xingchao",""],["Tay","Wee Peng",""],["Eldar","Yonina C.",""]]}
{"id":"2308.06950","submitter":"Taiyang Xu","authors":"Taiyang Xu, Yiling Yang, Lun Zhang","title":"Transient asymptotics of the modified Camassa-Holm equation","comments":"58 pages, 16 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate long time asymptotics of the modified Camassa-Holm equation in\nthree transition zones under a nonzero background. The first transition zone\nlies between the soliton region and the first oscillatory region, the second\none lies between the second oscillatory region and the fast decay region, and\npossibly, the third one, namely, the collisionless shock region, that bridges\nthe first transition region and the first oscillatory region. Under a low\nregularity condition on the initial data, we obtain Painlev\\'e-type asymptotic\nformulas in the first two transition regions, while the transient asymptotics\nin the third region involves the Jacobi theta function. We establish our\nresults by performing a $\\bar{\\partial}$ nonlinear steepest descent analysis to\nthe associated Riemann-Hilbert problem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:01:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Taiyang",""],["Yang","Yiling",""],["Zhang","Lun",""]]}
{"id":"2308.06951","submitter":"Xiaolei Li","authors":"Xiaolei Li, Ryan E. Keeley, Arman Shafieloo and Kai Liao","title":"A Model-independent Method to Determine $H_0$ using Time-Delay Lensing,\n  Quasars and Type Ia Supernova","comments":"9 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":"  Absolute distances from strong lensing can anchor Type Ia Supernovae (SNe Ia)\nat cosmological distances giving a model-independent inference of the Hubble\nconstant ($H_0$). Future observations could provide strong lensing time delay\ndistances with source redshifts up to $z\\,\\simeq\\,4$, which are much higher\nthan the maximum redshift of SNe Ia observed so far. Quasars are also observed\nat high redshifts and can be potentially used as standard candles based on a\nlinear relation between the log of the ultraviolet (UV) and X-ray luminosities.\nIn order to make full use of time delay distances measured at higher redshifts,\nwe use quasars as a complementary cosmic probe to measure cosmological\ndistances at redshifts beyond those of SNe Ia and provide a model-independent\nmethod to determine the Hubble constant. In this work, we demonstrate a\nmodel-independent, joint constraint of SNe Ia, quasars, and time-delay\ndistances. We first generate mock datasets of SNe Ia, quasar, and time-delay\ndistances based on a fiducial cosmological model. Then, we calibrate quasar\nparameters model independently using Gaussian process (GP) regression with mock\nSNe Ia data. Finally, we determine the value of $H_0$ model-independently using\nGP regression from mock quasars and time-delay distances from strong lensing\nsystems. As a comparison, we also show the $H_0$ results obtained from mock SNe\nIa in combination with time delay lensing systems whose redshifts overlap with\nSNe Ia. Our results show that quasars at higher redshifts show great potential\nto extend the redshift coverage of SNe Ia and thus enables the full use of\nstrong lens time-delay distance measurements from ongoing cosmic surveys and\nimprove the accuracy of the estimation of $H_0$ from $2.1\\%$ to $1.3\\%$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:03:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Xiaolei",""],["Keeley","Ryan E.",""],["Shafieloo","Arman",""],["Liao","Kai",""]]}
{"id":"2308.06952","submitter":"Hui Kang","authors":"Hui Kang, Sheng Liu, Huaxi Huang, Tongliang Liu","title":"Channel-Wise Contrastive Learning for Learning with Noisy Labels","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 real-world datasets, noisy labels are pervasive. The challenge of learning\nwith noisy labels (LNL) is to train a classifier that discerns the actual\nclasses from given instances. For this, the model must identify features\nindicative of the authentic labels. While research indicates that genuine label\ninformation is embedded in the learned features of even inaccurately labeled\ndata, it's often intertwined with noise, complicating its direct application.\nAddressing this, we introduce channel-wise contrastive learning (CWCL). This\nmethod distinguishes authentic label information from noise by undertaking\ncontrastive learning across diverse channels. Unlike conventional instance-wise\ncontrastive learning (IWCL), CWCL tends to yield more nuanced and resilient\nfeatures aligned with the authentic labels. Our strategy is twofold: firstly,\nusing CWCL to extract pertinent features to identify cleanly labeled samples,\nand secondly, progressively fine-tuning using these samples. Evaluations on\nseveral benchmark datasets validate our method's superiority over existing\napproaches.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:04:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kang","Hui",""],["Liu","Sheng",""],["Huang","Huaxi",""],["Liu","Tongliang",""]]}
{"id":"2308.06953","submitter":"David Heineman","authors":"David Heineman, Yao Dou, Wei Xu","title":"Thresh: A Unified, Customizable and Deployable Platform for Fine-Grained\n  Text Evaluation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Fine-grained, span-level human evaluation has emerged as a reliable and\nrobust method for evaluating text generation tasks such as summarization,\nsimplification, machine translation and news generation, and the derived\nannotations have been useful for training automatic metrics and improving\nlanguage models. However, existing annotation tools implemented for these\nevaluation frameworks lack the adaptability to be extended to different domains\nor languages, or modify annotation settings according to user needs. And the\nabsence of a unified annotated data format inhibits the research in multi-task\nlearning. In this paper, we introduce Thresh, a unified, customizable and\ndeployable platform for fine-grained evaluation. By simply creating a YAML\nconfiguration file, users can build and test an annotation interface for any\nframework within minutes -- all in one web browser window. To facilitate\ncollaboration and sharing, Thresh provides a community hub that hosts a\ncollection of fine-grained frameworks and corresponding annotations made and\ncollected by the community, covering a wide range of NLP tasks. For deployment,\nThresh offers multiple options for any scale of annotation projects from small\nmanual inspections to large crowdsourcing ones. Additionally, we introduce a\nPython library to streamline the entire process from typology design and\ndeployment to annotation processing. Thresh is publicly accessible at\nhttps://thresh.tools.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:09:51 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:34:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Heineman","David",""],["Dou","Yao",""],["Xu","Wei",""]]}
{"id":"2308.06954","submitter":"Kaifeng Chen","authors":"Shihao Shao, Kaifeng Chen, Arjun Karpur, Qinghua Cui, Andre Araujo,\n  and Bingyi Cao","title":"Global Features are All You Need for Image Retrieval and Reranking","comments":"ICCV23 camera-ready + appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Image retrieval systems conventionally use a two-stage paradigm, leveraging\nglobal features for initial retrieval and local features for reranking.\nHowever, the scalability of this method is often limited due to the significant\nstorage and computation cost incurred by local feature matching in the\nreranking stage. In this paper, we present SuperGlobal, a novel approach that\nexclusively employs global features for both stages, improving efficiency\nwithout sacrificing accuracy. SuperGlobal introduces key enhancements to the\nretrieval system, specifically focusing on the global feature extraction and\nreranking processes. For extraction, we identify sub-optimal performance when\nthe widely-used ArcFace loss and Generalized Mean (GeM) pooling methods are\ncombined and propose several new modules to improve GeM pooling. In the\nreranking stage, we introduce a novel method to update the global features of\nthe query and top-ranked images by only considering feature refinement with a\nsmall set of images, thus being very compute and memory efficient. Our\nexperiments demonstrate substantial improvements compared to the state of the\nart in standard benchmarks. Notably, on the Revisited Oxford+1M Hard dataset,\nour single-stage results improve by 7.1%, while our two-stage gain reaches 3.7%\nwith a strong 64,865x speedup. Our two-stage system surpasses the current\nsingle-stage state-of-the-art by 16.3%, offering a scalable, accurate\nalternative for high-performing image retrieval systems with minimal time\noverhead. Code: https://github.com/ShihaoShao-GH/SuperGlobal.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:13:27 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 06:15:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shao","Shihao",""],["Chen","Kaifeng",""],["Karpur","Arjun",""],["Cui","Qinghua",""],["Araujo","Andre",""],["Cao","Bingyi",""]]}
{"id":"2308.06955","submitter":"Xuechao Wang","authors":"Xuechao Wang and Sarah Azouvi and Marko Vukoli\\'c","title":"Security Analysis of Filecoin's Expected Consensus in the Byzantine vs\n  Honest Model","comments":"AFT 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Filecoin is the largest storage-based open-source blockchain, both by storage\ncapacity (>11EiB) and market capitalization. This paper provides the first\nformal security analysis of Filecoin's consensus (ordering) protocol, Expected\nConsensus (EC). Specifically, we show that EC is secure against an arbitrary\nadversary that controls a fraction $\\beta$ of the total storage for $\\beta m<\n1- e^{-(1-\\beta)m}$, where $m$ is a parameter that corresponds to the expected\nnumber of blocks per round, currently $m=5$ in Filecoin. We then present an\nattack, the $n$-split attack, where an adversary splits the honest miners\nbetween multiple chains, and show that it is successful for $\\beta m \\ge 1-\ne^{-(1-\\beta)m}$, thus proving that $\\beta m= 1- e^{-(1-\\beta)m}$ is the tight\nsecurity threshold of EC. This corresponds roughly to an adversary with $20\\%$\nof the total storage pledged to the chain. Finally, we propose two improvements\nto EC security that would increase this threshold. One of these two fixes is\nbeing implemented as a Filecoin Improvement Proposal (FIP).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:20:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Xuechao",""],["Azouvi","Sarah",""],["Vukoli\u0107","Marko",""]]}
{"id":"2308.06956","submitter":"Kanghee Park","authors":"Kanghee Park, Keith J.C. Johnson, Loris D'Antoni, Thomas Reps","title":"Modular System Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes a way to improve the scalability of program synthesis by\nexploiting modularity: larger programs are synthesized from smaller programs.\nThe key issue is to make each \"larger-created-from-smaller\" synthesis\nsub-problem be of a similar nature, so that the kind of synthesis sub-problem\nthat needs to be solved--and the size of each search space--has roughly the\nsame character at each level. This work holds promise for creating\nprogram-synthesis tools that have far greater capabilities than currently\navailable tools, and opens new avenues for synthesis research: how synthesis\ntools should support modular system design, and how synthesis applications can\nbest exploit such capabilities.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:20:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Park","Kanghee",""],["Johnson","Keith J. C.",""],["D'Antoni","Loris",""],["Reps","Thomas",""]]}
{"id":"2308.06957","submitter":"Dongik Shin","authors":"Dongik Shin, Beomsuk Kim and Seungjun Baek","title":"CEmb-SAM: Segment Anything Model with Condition Embedding for Joint\n  Learning from Heterogeneous Datasets","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":"  Automated segmentation of ultrasound images can assist medical experts with\ndiagnostic and therapeutic procedures. Although using the common modality of\nultrasound, one typically needs separate datasets in order to segment, for\nexample, different anatomical structures or lesions with different levels of\nmalignancy. In this paper, we consider the problem of jointly learning from\nheterogeneous datasets so that the model can improve generalization abilities\nby leveraging the inherent variability among datasets. We merge the\nheterogeneous datasets into one dataset and refer to each component dataset as\na subgroup. We propose to train a single segmentation model so that the model\ncan adapt to each sub-group. For robust segmentation, we leverage recently\nproposed Segment Anything model (SAM) in order to incorporate sub-group\ninformation into the model. We propose SAM with Condition Embedding block\n(CEmb-SAM) which encodes sub-group conditions and combines them with image\nembeddings from SAM. The conditional embedding block effectively adapts SAM to\neach image sub-group by incorporating dataset properties through learnable\nparameters for normalization. Experiments show that CEmb-SAM outperforms the\nbaseline methods on ultrasound image segmentation for peripheral nerves and\nbreast cancer. The experiments highlight the effectiveness of Cemb-SAM in\nlearning from heterogeneous datasets in medical image segmentation tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:22:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shin","Dongik",""],["Kim","Beomsuk",""],["Baek","Seungjun",""]]}
{"id":"2308.06958","submitter":"Haoran Deng","authors":"Haoran Deng, Bo Yang, Mo-Yuen Chow, Gang Yao, Cailian Chen, and\n  Xinping Guan","title":"Hydrogen Supply Infrastructure Network Planning Approach towards\n  Chicken-egg Conundrum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In the early commercialization stage of hydrogen fuel cell vehicles (HFCVs),\nreasonable hydrogen supply infrastructure (HSI) planning decisions is a premise\nfor promoting the popularization of HFCVs. However, there is a strong causality\nbetween HFCVs and hydrogen refueling stations (HRSs): the planning decisions of\nHRSs could affect the hydrogen refueling demand of HFCVs, and the growth of\ndemand would in turn stimulate the further investment in HRSs, which is also\nknown as the ``chicken and egg'' conundrum. Meanwhile, the hydrogen demand is\nuncertain with insufficient prior knowledge, and thus there is a\ndecision-dependent uncertainty (DDU) in the planning issue. This poses great\nchallenges to solving the optimization problem. To this end, this work\nestablishes a multi-network HSI planning model coordinating hydrogen, power,\nand transportation networks. Then, to reflect the causal relationship between\nHFCVs and HRSs effectively without sufficient historical data, a\ndistributionally robust optimization framework with decision-dependent\nuncertainty is developed. The uncertainty of hydrogen demand is modeled as a\nWasserstein ambiguity set with a decision-dependent empirical probability\ndistribution. Subsequently, to reduce the computational complexity caused by\nthe introduction of a large number of scenarios and high-dimensional nonlinear\nconstraints, we developed an improved distribution shaping method and\ntechniques of scenario and variable reduction to derive the solvable form with\nless computing burden. Finally, the simulation results demonstrate that this\nmethod can reduce costs by at least 10.4% compared with traditional methods and\nwill be more effective in large-scale HSI planning issues. Further, we put\nforward effective suggestions for the policymakers and investors to formulate\nrelevant policies and decisions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:27:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deng","Haoran",""],["Yang","Bo",""],["Chow","Mo-Yuen",""],["Yao","Gang",""],["Chen","Cailian",""],["Guan","Xinping",""]]}
{"id":"2308.06959","submitter":"Mathias Kraus","authors":"Mathias Kraus, Stefan Feuerriegel, Maytal Saar-Tsechansky","title":"Data-Driven Allocation of Preventive Care With Application to Diabetes\n  Mellitus Type II","comments":"Accepted by Manufacturing & Service Operations Management","journal-ref":null,"doi":"10.1287/msom.2021.0251","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Problem Definition. Increasing costs of healthcare highlight the importance\nof effective disease prevention. However, decision models for allocating\npreventive care are lacking.\n  Methodology/Results. In this paper, we develop a data-driven decision model\nfor determining a cost-effective allocation of preventive treatments to\npatients at risk. Specifically, we combine counterfactual inference, machine\nlearning, and optimization techniques to build a scalable decision model that\ncan exploit high-dimensional medical data, such as the data found in modern\nelectronic health records. Our decision model is evaluated based on electronic\nhealth records from 89,191 prediabetic patients. We compare the allocation of\npreventive treatments (metformin) prescribed by our data-driven decision model\nwith that of current practice. We find that if our approach is applied to the\nU.S. population, it can yield annual savings of $1.1 billion. Finally, we\nanalyze the cost-effectiveness under varying budget levels.\n  Managerial Implications. Our work supports decision-making in health\nmanagement, with the goal of achieving effective disease prevention at lower\ncosts. Importantly, our decision model is generic and can thus be used for\neffective allocation of preventive care for other preventable diseases.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:29:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kraus","Mathias",""],["Feuerriegel","Stefan",""],["Saar-Tsechansky","Maytal",""]]}
{"id":"2308.06960","submitter":"Shimin Di","authors":"Zhili Wang, Shimin Di, Lei Chen, Xiaofang Zhou","title":"Search to Fine-tune Pre-trained Graph Neural Networks for Graph-level\n  Tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recently, graph neural networks (GNNs) have shown its unprecedented success\nin many graph-related tasks. However, GNNs face the label scarcity issue as\nother neural networks do. Thus, recent efforts try to pre-train GNNs on a\nlarge-scale unlabeled graph and adapt the knowledge from the unlabeled graph to\nthe target downstream task. The adaptation is generally achieved by fine-tuning\nthe pre-trained GNNs with a limited number of labeled data. Despite the\nimportance of fine-tuning, current GNNs pre-training works often ignore\ndesigning a good fine-tuning strategy to better leverage transferred knowledge\nand improve the performance on downstream tasks. Only few works start to\ninvestigate a better fine-tuning strategy for pre-trained GNNs. But their\ndesigns either have strong assumptions or overlook the data-aware issue for\nvarious downstream datasets. Therefore, we aim to design a better fine-tuning\nstrategy for pre-trained GNNs to improve the model performance in this paper.\nGiven a pre-trained GNN, we propose to search to fine-tune pre-trained graph\nneural networks for graph-level tasks (S2PGNN), which adaptively design a\nsuitable fine-tuning framework for the given labeled data on the downstream\ntask. To ensure the improvement brought by searching fine-tuning strategy, we\ncarefully summarize a proper search space of fine-tuning framework that is\nsuitable for GNNs. The empirical studies show that S2PGNN can be implemented on\nthe top of 10 famous pre-trained GNNs and consistently improve their\nperformance. Besides, S2PGNN achieves better performance than existing\nfine-tuning strategies within and outside the GNN area. Our code is publicly\navailable at \\url{https://anonymous.4open.science/r/code_icde2024-A9CB/}.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:32:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zhili",""],["Di","Shimin",""],["Chen","Lei",""],["Zhou","Xiaofang",""]]}
{"id":"2308.06961","submitter":"Oliver Niggemann","authors":"Jan Lukas Augustin and Oliver Niggemann","title":"Graph Structural Residuals: A Learning Approach to Diagnosis","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":"  Traditional model-based diagnosis relies on constructing explicit system\nmodels, a process that can be laborious and expertise-demanding. In this paper,\nwe propose a novel framework that combines concepts of model-based diagnosis\nwith deep graph structure learning. This data-driven approach leverages data to\nlearn the system's underlying structure and provide dynamic observations,\nrepresented by two distinct graph adjacency matrices. Our work facilitates a\nseamless integration of graph structure learning with model-based diagnosis by\nmaking three main contributions: (i) redefining the constructs of system\nrepresentation, observations, and faults (ii) introducing two distinct versions\nof a self-supervised graph structure learning model architecture and (iii)\ndemonstrating the potential of our data-driven diagnostic method through\nexperiments on a system of coupled oscillators.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:32:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Augustin","Jan Lukas",""],["Niggemann","Oliver",""]]}
{"id":"2308.06962","submitter":"Licheng Zhong","authors":"Licheng Zhong, Lixin Yang, Kailin Li, Haoyu Zhen, Mei Han, Cewu Lu","title":"Color-NeuS: Reconstructing Neural Implicit Surfaces with Color","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The reconstruction of object surfaces from multi-view images or monocular\nvideo is a fundamental issue in computer vision. However, much of the recent\nresearch concentrates on reconstructing geometry through implicit or explicit\nmethods. In this paper, we shift our focus towards reconstructing mesh in\nconjunction with color. We remove the view-dependent color from neural volume\nrendering while retaining volume rendering performance through a relighting\nnetwork. Mesh is extracted from the signed distance function (SDF) network for\nthe surface, and color for each surface vertex is drawn from the global color\nnetwork. To evaluate our approach, we conceived a in hand object scanning task\nfeaturing numerous occlusions and dramatic shifts in lighting conditions. We've\ngathered several videos for this task, and the results surpass those of any\nexisting methods capable of reconstructing mesh alongside color. Additionally,\nour method's performance was assessed using public datasets, including DTU,\nBlendedMVS, and OmniObject3D. The results indicated that our method performs\nwell across all these datasets. Project page:\nhttps://colmar-zlicheng.github.io/color_neus.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:32:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhong","Licheng",""],["Yang","Lixin",""],["Li","Kailin",""],["Zhen","Haoyu",""],["Han","Mei",""],["Lu","Cewu",""]]}
{"id":"2308.06963","submitter":"Roberto Dillon","authors":"Roberto Dillon","title":"The Future of Cybersecurity in Southeast Asia along the Maritime Silk\n  Road","comments":"8 pages, 2 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes an analysis of the prospects of the cyber security\nindustry and educational ecosystems in four Southeast Asian countries, namely\nVietnam, Singapore, Malaysia, and Indonesia, which are along the Maritime Silk\nRoad, by using two novel metrics: the \"Cybersecurity Education Prospects Index\"\n(CEPI) and the \"Cybersecurity Industry Prospects Index\" (CIPI). The CEPI\nevaluates the state of cybersecurity education by assessing the availability\nand quality of cybersecurity degrees together with their ability to attract new\nstudents. On the other hand, the CIPI measures the potential for the\ncybersecurity industry's growth and development by assessing the talent pool\nneeded to build and sustain its growth. Ultimately, this study emphasizes the\nvital importance of a healthy cybersecurity ecosystem where education is\nresponsible for supporting the industry to ensure the security and reliability\nof commercial operations in these countries against a complex and evolving\ncyber threat landscape.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:37:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dillon","Roberto",""]]}
{"id":"2308.06964","submitter":"Parinaz Roshanzamir","authors":"Parinaz Roshanzamir, Hassan Rivaz, Joshua Ahn, Hamza Mirza, Neda\n  Naghdi, Meagan Anstruther, Michele C. Batti\\'e, Maryse Fortin, and Yiming\n  Xiao","title":"How inter-rater variability relates to aleatoric and epistemic\n  uncertainty: a case study with deep learning-based paraspinal muscle\n  segmentation","comments":"Accepted in UNSURE 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":"  Recent developments in deep learning (DL) techniques have led to great\nperformance improvement in medical image segmentation tasks, especially with\nthe latest Transformer model and its variants. While labels from fusing\nmulti-rater manual segmentations are often employed as ideal ground truths in\nDL model training, inter-rater variability due to factors such as training\nbias, image noise, and extreme anatomical variability can still affect the\nperformance and uncertainty of the resulting algorithms. Knowledge regarding\nhow inter-rater variability affects the reliability of the resulting DL\nalgorithms, a key element in clinical deployment, can help inform better\ntraining data construction and DL models, but has not been explored\nextensively. In this paper, we measure aleatoric and epistemic uncertainties\nusing test-time augmentation (TTA), test-time dropout (TTD), and deep ensemble\nto explore their relationship with inter-rater variability. Furthermore, we\ncompare UNet and TransUNet to study the impacts of Transformers on model\nuncertainty with two label fusion strategies. We conduct a case study using\nmulti-class paraspinal muscle segmentation from T2w MRIs. Our study reveals the\ninterplay between inter-rater variability and uncertainties, affected by\nchoices of label fusion strategies and DL models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:40:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Roshanzamir","Parinaz",""],["Rivaz","Hassan",""],["Ahn","Joshua",""],["Mirza","Hamza",""],["Naghdi","Neda",""],["Anstruther","Meagan",""],["Batti\u00e9","Michele C.",""],["Fortin","Maryse",""],["Xiao","Yiming",""]]}
{"id":"2308.06965","submitter":"Ziru Liu","authors":"Ziru Liu, Kecheng Chen, Fengyi Song, Bo Chen, Xiangyu Zhao, Huifeng\n  Guo, Ruiming Tang","title":"AutoAssign+: Automatic Shared Embedding Assignment in Streaming\n  Recommendation","comments":null,"journal-ref":"Knowledge and Information Systems 2023","doi":"10.1007/s10115-023-01951-1","report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the domain of streaming recommender systems, conventional methods for\naddressing new user IDs or item IDs typically involve assigning initial ID\nembeddings randomly. However, this practice results in two practical\nchallenges: (i) Items or users with limited interactive data may yield\nsuboptimal prediction performance. (ii) Embedding new IDs or low-frequency IDs\nnecessitates consistently expanding the embedding table, leading to unnecessary\nmemory consumption. In light of these concerns, we introduce a reinforcement\nlearning-driven framework, namely AutoAssign+, that facilitates Automatic\nShared Embedding Assignment Plus. To be specific, AutoAssign+ utilizes an\nIdentity Agent as an actor network, which plays a dual role: (i) Representing\nlow-frequency IDs field-wise with a small set of shared embeddings to enhance\nthe embedding initialization, and (ii) Dynamically determining which ID\nfeatures should be retained or eliminated in the embedding table. The policy of\nthe agent is optimized with the guidance of a critic network. To evaluate the\neffectiveness of our approach, we perform extensive experiments on three\ncommonly used benchmark datasets. Our experiment results demonstrate that\nAutoAssign+ is capable of significantly enhancing recommendation performance by\nmitigating the cold-start problem. Furthermore, our framework yields a\nreduction in memory usage of approximately 20-30%, verifying its practical\neffectiveness and efficiency for streaming recommender systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:43:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Ziru",""],["Chen","Kecheng",""],["Song","Fengyi",""],["Chen","Bo",""],["Zhao","Xiangyu",""],["Guo","Huifeng",""],["Tang","Ruiming",""]]}
{"id":"2308.06966","submitter":"Yangning Li","authors":"Yangning Li, Shirong Ma, Xiaobin Wang, Shen Huang, Chengyue Jiang,\n  Hai-Tao Zheng, Pengjun Xie, Fei Huang, Yong Jiang","title":"EcomGPT: Instruction-tuning Large Language Models with Chain-of-Task\n  Tasks for E-commerce","comments":"Initial version of EcomGPT","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, instruction-following Large Language Models (LLMs) , represented by\nChatGPT, have exhibited exceptional performance in general Natural Language\nProcessing (NLP) tasks. However, the unique characteristics of E-commerce data\npose significant challenges to general LLMs. An LLM tailored specifically for\nE-commerce scenarios, possessing robust cross-dataset/task generalization\ncapabilities, is a pressing necessity. To solve this issue, in this work, we\nproposed the first e-commerce instruction dataset EcomInstruct, with a total of\n2.5 million instruction data. EcomInstruct scales up the data size and task\ndiversity by constructing atomic tasks with E-commerce basic data types, such\nas product information, user reviews. Atomic tasks are defined as intermediate\ntasks implicitly involved in solving a final task, which we also call\nChain-of-Task tasks. We developed EcomGPT with different parameter scales by\ntraining the backbone model BLOOMZ with the EcomInstruct. Benefiting from the\nfundamental semantic understanding capabilities acquired from the Chain-of-Task\ntasks, EcomGPT exhibits excellent zero-shot generalization capabilities.\nExtensive experiments and human evaluations demonstrate that EcomGPT\noutperforms ChatGPT in term of cross-dataset/task generalization on E-commerce\ntasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:49:53 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 04:12:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Yangning",""],["Ma","Shirong",""],["Wang","Xiaobin",""],["Huang","Shen",""],["Jiang","Chengyue",""],["Zheng","Hai-Tao",""],["Xie","Pengjun",""],["Huang","Fei",""],["Jiang","Yong",""]]}
{"id":"2308.06967","submitter":"Yuqing Wu","authors":"Yingchao Li, Yuqing Wu, Suolin Li, Lin Liu, Xiaoyi Zhang, Jiaxun Lv,\n  Qinqin Li","title":"Intestinal Microecology in Pediatric Surgery-Related Gastrointestinal\n  Diseases Current Insights and Future Perspectives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intestinal microecology is established from birth and is constantly changing\nuntil homeostasis is reached. Intestinal microecology is involved in the immune\ninflammatory response of the intestine and regulates the intestinal barrier\nfunction. The imbalance of intestinal microecology is closely related to the\noccurrence and development of digestive system diseases. In some\ngastrointestinal diseases related to pediatric surgery, intestinal microecology\nand its metabolites undergo a series of changes, which can provide a certain\nbasis for the diagnosis of diseases. The continuous development of\nmicroecological agents and fecal microbiota transplantation technology has\nprovided a new means for its clinical treatment. We review the relationship\nbetween pathogenesis, diagnosis and treatment of pediatric surgery-related\ngastrointestinal diseases and intestinal microecology, in order to provide new\nideas and methods for clinical diagnosis, treatment and research.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:55:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Yingchao",""],["Wu","Yuqing",""],["Li","Suolin",""],["Liu","Lin",""],["Zhang","Xiaoyi",""],["Lv","Jiaxun",""],["Li","Qinqin",""]]}
{"id":"2308.06968","submitter":"Ihyeok Seo","authors":"Sunghwan Moon, Ihyeok Seo","title":"Inversions of two wave-forward operators with variable coefficients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the most successful example of a hybrid tomographic technique,\nphotoacoustic tomography is based on generating acoustic waves inside an object\nof interest by stimulating electromagnetic waves. This acoustic wave is\nmeasured outside the object and converted into a diagnostic image. One\nmathematical problem is determining the initial function from the measured\ndata. The initial function describes the spatial distribution of energy\nabsorption, and the acoustic wave satisfies the wave equation with variable\nspeed. In this article, we consider two types of problems: inverse problem with\nRobin boundary condition and inverse problem with Dirichlet boundary condition.\nWe define two wave-forward operators that assign the solution of the wave\nequation based on the initial function to a given function and provide their\ninversions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:06:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Moon","Sunghwan",""],["Seo","Ihyeok",""]]}
{"id":"2308.06969","submitter":"EPTCS","authors":"Marco T. Moraz\\'an (Seton Hall University)","title":"Regular Expressions in a CS Formal Languages Course","comments":"In Proceedings TFPIE 2023, arXiv:2308.06110","journal-ref":"EPTCS 382, 2023, pp. 45-63","doi":"10.4204/EPTCS.382.3","report-no":null,"categories":"cs.PL cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Regular expressions in an Automata Theory and Formal Languages course are\nmostly treated as a theoretical topic. That is, to some degree their\nmathematical properties and their role to describe languages is discussed. This\napproach fails to capture the interest of most Computer Science students. It is\na missed opportunity to engage Computer Science students that are far more\nmotivated by practical applications of theory. To this end, regular expressions\nmay be discussed as the description of an algorithm to generate words in a\nlanguage that is easily programmed. This article describes a programming-based\nmethodology to introduce students to regular expressions in an Automata Theory\nand Formal Languages course. The language of instruction is FSM in which there\nis a regular expression type. Thus, facilitating the study of regular\nexpressions and of algorithms based on regular expressions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:07:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Moraz\u00e1n","Marco T.","","Seton Hall University"]]}
{"id":"2308.06970","submitter":"EPTCS","authors":"Nadine Karsten (Technische Universit\\\"at Berlin), Frederik Krogsdal\n  Jacobsen (Technical University of Denmark), Kim Jana Eiken (Technische\n  Universit\\\"at Berlin), Uwe Nestmann (Technische Universit\\\"at Berlin),\n  J{\\o}rgen Villadsen (Technical University of Denmark)","title":"ProofBuddy: A Proof Assistant for Learning and Monitoring","comments":"In Proceedings TFPIE 2023, arXiv:2308.06110","journal-ref":"EPTCS 382, 2023, pp. 1-21","doi":"10.4204/EPTCS.382.1","report-no":null,"categories":"cs.LO cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Proof competence, i.e. the ability to write and check (mathematical) proofs,\nis an important skill in Computer Science, but for many students it represents\na difficult challenge. The main issues are the correct use of formal language\nand the ascertainment of whether proofs, especially the students' own, are\ncomplete and correct. Many authors have suggested using proof assistants to\nassist in teaching proof competence, but the efficacy of the approach is\nunclear. To improve the state of affairs, we introduce ProofBuddy: a web-based\ntool using the Isabelle proof assistant which enables researchers to conduct\nstudies of the efficacy of approaches to using proof assistants in education by\ncollecting fine-grained data about the way students interact with proof\nassistants. We have performed a preliminary usability study of ProofBuddy at\nthe Technical University of Denmark.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:08:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Karsten","Nadine","","Technische Universit\u00e4t Berlin"],["Jacobsen","Frederik Krogsdal","","Technical University of Denmark"],["Eiken","Kim Jana","","Technische\n  Universit\u00e4t Berlin"],["Nestmann","Uwe","","Technische Universit\u00e4t Berlin"],["Villadsen","J\u00f8rgen","","Technical University of Denmark"]]}
{"id":"2308.06971","submitter":"EPTCS","authors":"Brent A. Yorgey (Hendrix College)","title":"Disco: A Functional Programming Language for Discrete Mathematics","comments":"In Proceedings TFPIE 2023, arXiv:2308.06110","journal-ref":"EPTCS 382, 2023, pp. 64-81","doi":"10.4204/EPTCS.382.4","report-no":null,"categories":"cs.PL cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Disco is a pure, strict, statically typed functional programming language\ndesigned to be used in the setting of a discrete mathematics course. The goals\nof the language are to introduce students to functional programming concepts\nearly, and to enhance their learning of mathematics by providing a\ncomputational platform for them to play with. It features\nmathematically-inspired notation, property-based testing, equirecursive\nalgebraic types, subtyping, built-in list, bag, and finite set types, a REPL,\nand student-focused documentation. Disco is implemented in Haskell, with source\ncode available on GitHub [https://github.com/disco-lang/disco], and interactive\nweb-based REPL available through replit\n[https://replit.com/@BrentYorgey/Disco#README.md].\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:09:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yorgey","Brent A.","","Hendrix College"]]}
{"id":"2308.06972","submitter":"Angela Marino","authors":"Angela Marino, Giovanni Soldi, Domenico Gaglione, Augusto Aubry, Paolo\n  Braca, Antonio De Maio, and Peter Willett","title":"3D Localization and Tracking Methods for Multi-Platform Radar Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-platform radar networks (MPRNs) are an emerging sensing technology due\nto their ability to provide improved surveillance capabilities over plain\nmonostatic and bistatic systems. The design of advanced detection,\nlocalization, and tracking algorithms for efficient fusion of information\nobtained through multiple receivers has attracted much attention. However,\nconsiderable challenges remain. This article provides an overview on recent\nunconstrained and constrained localization techniques as well as multitarget\ntracking (MTT) algorithms tailored to MPRNs. In particular, two data-processing\nmethods are illustrated and explored in detail, one aimed at accomplishing\nlocalization tasks the other tracking functions. As to the former, assuming a\nMPRN with one transmitter and multiple receivers, the angular and range\nconstrained estimator (ARCE) algorithm capitalizes on the knowledge of the\ntransmitter antenna beamwidth. As to the latter, the scalable sum-product\nalgorithm (SPA) based MTT technique is presented. Additionally, a solution to\ncombine ARCE and SPA-based MTT is investigated in order to boost the accuracy\nof the overall surveillance system. Simulated experiments show the benefit of\nthe combined algorithm in comparison with the conventional baseline SPA-based\nMTT and the stand-alone ARCE localization, in a 3D sensing scenario.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:09:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Marino","Angela",""],["Soldi","Giovanni",""],["Gaglione","Domenico",""],["Aubry","Augusto",""],["Braca","Paolo",""],["De Maio","Antonio",""],["Willett","Peter",""]]}
{"id":"2308.06973","submitter":"Sijie He","authors":"Sijie He, Ziye Jia, Chao Dong, Wei Wang, Yilu Cao, Yang Yang, and\n  Qihui Wu","title":"Routing Recovery for UAV Networks with Deliberate Attacks: A\n  Reinforcement Learning based Approach","comments":"IEEE GLOBECOM 2023, 6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unmanned aerial vehicle (UAV) network is popular these years due to its\nvarious applications. In the UAV network, routing is significantly affected by\nthe distributed network topology, leading to the issue that UAVs are vulnerable\nto deliberate damage. Hence, this paper focuses on the routing plan and\nrecovery for UAV networks with attacks. In detail, a deliberate attack model\nbased on the importance of nodes is designed to represent enemy attacks. Then,\na node importance ranking mechanism is presented, considering the degree of\nnodes and link importance. However, it is intractable to handle the routing\nproblem by traditional methods for UAV networks, since link connections change\nwith the UAV availability. Hence, an intelligent algorithm based on\nreinforcement learning is proposed to recover the routing path when UAVs are\nattacked. Simulations are conducted and numerical results verify the proposed\nmechanism performs better than other referred methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:11:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["He","Sijie",""],["Jia","Ziye",""],["Dong","Chao",""],["Wang","Wei",""],["Cao","Yilu",""],["Yang","Yang",""],["Wu","Qihui",""]]}
{"id":"2308.06974","submitter":"Xiangchao Gan","authors":"Jiexiong Xu, Weikun Zhao, Zhiyan Tang and Xiangchao Gan","title":"A One Stop 3D Target Reconstruction and multilevel Segmentation Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  3D object reconstruction and multilevel segmentation are fundamental to\ncomputer vision research. Existing algorithms usually perform 3D scene\nreconstruction and target objects segmentation independently, and the\nperformance is not fully guaranteed due to the challenge of the 3D\nsegmentation. Here we propose an open-source one stop 3D target reconstruction\nand multilevel segmentation framework (OSTRA), which performs segmentation on\n2D images, tracks multiple instances with segmentation labels in the image\nsequence, and then reconstructs labelled 3D objects or multiple parts with\nMulti-View Stereo (MVS) or RGBD-based 3D reconstruction methods. We extend\nobject tracking and 3D reconstruction algorithms to support continuous\nsegmentation labels to leverage the advances in the 2D image segmentation,\nespecially the Segment-Anything Model (SAM) which uses the pretrained neural\nnetwork without additional training for new scenes, for 3D object segmentation.\nOSTRA supports most popular 3D object models including point cloud, mesh and\nvoxel, and achieves high performance for semantic segmentation, instance\nsegmentation and part segmentation on several 3D datasets. It even surpasses\nthe manual segmentation in scenes with complex structures and occlusions. Our\nmethod opens up a new avenue for reconstructing 3D targets embedded with rich\nmulti-scale segmentation information in complex scenes. OSTRA is available from\nhttps://github.com/ganlab/OSTRA.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:12:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Jiexiong",""],["Zhao","Weikun",""],["Tang","Zhiyan",""],["Gan","Xiangchao",""]]}
{"id":"2308.06975","submitter":"Anthony Colas","authors":"Anthony Colas, Haodi Ma, Xuanli He, Yang Bai, Daisy Zhe Wang","title":"Can Knowledge Graphs Simplify Text?","comments":"Accepted as a Main Conference Long Paper at CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge Graph (KG)-to-Text Generation has seen recent improvements in\ngenerating fluent and informative sentences which describe a given KG. As KGs\nare widespread across multiple domains and contain important entity-relation\ninformation, and as text simplification aims to reduce the complexity of a text\nwhile preserving the meaning of the original text, we propose KGSimple, a novel\napproach to unsupervised text simplification which infuses KG-established\ntechniques in order to construct a simplified KG path and generate a concise\ntext which preserves the original input's meaning. Through an iterative and\nsampling KG-first approach, our model is capable of simplifying text when\nstarting from a KG by learning to keep important information while harnessing\nKG-to-text generation to output fluent and descriptive sentences. We evaluate\nvarious settings of the KGSimple model on currently-available KG-to-text\ndatasets, demonstrating its effectiveness compared to unsupervised text\nsimplification models which start with a given complex text. Our code is\navailable on GitHub.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:20:49 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 20:51:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Colas","Anthony",""],["Ma","Haodi",""],["He","Xuanli",""],["Bai","Yang",""],["Wang","Daisy Zhe",""]]}
{"id":"2308.06976","submitter":"Jingbo Dou","authors":"Jingbo Dou and Jingjing Ma","title":"Hardy-Littlewood-Sobolev inequalities with partial variable weight on\n  the upper half space and related inequalities","comments":null,"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 establish a class of Hardy-Littlewood-Sobolev inequality\nwith partial variable weight functions on the upper half space using a weighted\nHardy type inequality. Overcoming the impact of weighted functions, the\nexistence of extremal functions is proved via the concentration compactness\nprinciple, whereas Riesz rearrangement inequality is not available. Moreover,\nthe cylindrical symmetry with respect to $t$-axis and the explicit forms on the\nboundary of all nonnegative extremal functions are discussed via the method of\nmoving planes and method of moving spheres, as well as, regularity results are\nobtained by the regularity lift lemma and bootstrap technique. As applications,\nwe obtain some weighted Sobolev inequalities with partial variable weight\nfunction for Laplacian and fractional Laplacian.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:25:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dou","Jingbo",""],["Ma","Jingjing",""]]}
{"id":"2308.06977","submitter":"Chaowei Jiang","authors":"Chaowei Jiang, Xueshang Feng, Xinkai Bian, Peng Zou, Aiying Duan,\n  Xiaoli Yan, Qiang Hu, Wen He, Xinyi Wang, Pingbing Zuo, and Yi Wang","title":"Data-driven MHD simulation of a sunspot rotating active region leading\n  to solar eruption","comments":"Accept by A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solar eruptions are the leading driver of space weather, and it is vital for\nspace weather forecast to understand in what conditions the solar eruptions can\nbe produced and how they are initiated. The rotation of sunspots around their\numbral center has long been considered as an important condition in causing\nsolar eruptions. To unveil the underlying mechanisms, here we carried out a\ndata-driven magnetohydrodynamics simulation for the event of a large sunspot\nwith rotation for days in solar active region NOAA 12158 leading to a major\neruption. The photospheric velocity as recovered from the time sequence of\nvector magnetograms are inputted directly at the bottom boundary of the\nnumerical model as the driving flow. Our simulation successfully follows the\nlong-term quasi-static evolution of the active region until the fast eruption,\nwith magnetic field structure consistent with the observed coronal emission and\nonset time of simulated eruption matches rather well with the observations.\nAnalysis of the process suggests that through the successive rotation of the\nsunspot the coronal magnetic field is sheared with a vertical current sheet\ncreated progressively, and once fast reconnection sets in at the current sheet,\nthe eruption is instantly triggered, with a highly twisted flux rope\noriginating from the eruption. This data-driven simulation stresses magnetic\nreconnection as the key mechanism in sunspot rotation leading to eruption.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:28:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Chaowei",""],["Feng","Xueshang",""],["Bian","Xinkai",""],["Zou","Peng",""],["Duan","Aiying",""],["Yan","Xiaoli",""],["Hu","Qiang",""],["He","Wen",""],["Wang","Xinyi",""],["Zuo","Pingbing",""],["Wang","Yi",""]]}
{"id":"2308.06978","submitter":"Neal Thomas","authors":"Neal Titus Thomas, S. B. Gudennavar and S. G. Bubbly","title":"NuSTAR and AstroSat observations of GX 9$+$1: Spectral and temporal\n  studies","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2379","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have studied the spectro-temporal properties of the neutron star low mass\nX-ray binary GX 9$+$1 using data from \\textit{NuSTAR/FPM} and\n\\textit{AstroSat/SXT} and \\textit{LAXPC}. The hardness-intensity diagram of the\nsource showed it to be in the soft spectral state during both observations.\n\\textit{NuSTAR} spectral analysis yielded an inclination angle ($\\theta$) $=$\n29$\\substack{+3\\\\-4}^{\\circ}$ and inner disk radius ($R_{in}$) $\\leq$ 19.01 km.\nAssuming that the accretion disk was truncated at the Alfv\\'en radius during\nthe observation, the upper limit of the magnetic dipole moment ($\\mu$) and the\nmagnetic field strength ($B$) at the poles of the neutron star in GX 9$+$1 were\ncalculated to be 1.45$\\times$$10^{26}$ G cm$^3$ and 2.08$\\times$$10^8$ G,\nrespectively (for $k_A$ $=$ 1). Flux resolved spectral analysis with\n\\textit{AstroSat} data showed the source to be in the soft spectral state\n($F_{disk}$/$F_{total}$ $\\sim$0.9) with a monotonic increase in mass accretion\nrate ($\\dot{m}$) along the banana branch. The analysis also showed the presence\nof absorption edges at $\\sim$1.9 and $\\sim$2.4 keV, likely due to Si XIII and S\nXV, respectively. Temporal analysis with \\textit{LAXPC-20} data in the 0.02 $-$\n100 Hz range revealed the presence of noise components, which could be\ncharacterized with broad Lorentzian components.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:29:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Thomas","Neal Titus",""],["Gudennavar","S. B.",""],["Bubbly","S. G.",""]]}
{"id":"2308.06979","submitter":"Yuki Mitsufuji","authors":"Giorgio Fabbro, Stefan Uhlich, Chieh-Hsin Lai, Woosung Choi, Marco\n  Mart\\'inez-Ram\\'irez, Weihsiang Liao, Igor Gadelha, Geraldo Ramos, Eddie Hsu,\n  Hugo Rodrigues, Fabian-Robert St\\\"oter, Alexandre D\\'efossez, Yi Luo, Jianwei\n  Yu, Dipam Chakraborty, Sharada Mohanty, Roman Solovyev, Alexander\n  Stempkovskiy, Tatiana Habruseva, Nabarun Goswami, Tatsuya Harada, Minseok\n  Kim, Jun Hyung Lee, Yuanliang Dong, Xinran Zhang, Jiafeng Liu, Yuki Mitsufuji","title":"The Sound Demixing Challenge 2023 $\\unicode{x2013}$ Music Demixing Track","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper summarizes the music demixing (MDX) track of the Sound Demixing\nChallenge (SDX'23). We provide a summary of the challenge setup and introduce\nthe task of robust music source separation (MSS), i.e., training MSS models in\nthe presence of errors in the training data. We propose a formalization of the\nerrors that can occur in the design of a training dataset for MSS systems and\nintroduce two new datasets that simulate such errors: SDXDB23_LabelNoise and\nSDXDB23_Bleeding1. We describe the methods that achieved the highest scores in\nthe competition. Moreover, we present a direct comparison with the previous\nedition of the challenge (the Music Demixing Challenge 2021): the best\nperforming system under the standard MSS formulation achieved an improvement of\nover 1.6dB in signal-to-distortion ratio over the winner of the previous\ncompetition, when evaluated on MDXDB21. Besides relying on the\nsignal-to-distortion ratio as objective metric, we also performed a listening\ntest with renowned producers/musicians to study the perceptual quality of the\nsystems and report here the results. Finally, we provide our insights into the\norganization of the competition and our prospects for future editions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:32:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fabbro","Giorgio",""],["Uhlich","Stefan",""],["Lai","Chieh-Hsin",""],["Choi","Woosung",""],["Mart\u00ednez-Ram\u00edrez","Marco",""],["Liao","Weihsiang",""],["Gadelha","Igor",""],["Ramos","Geraldo",""],["Hsu","Eddie",""],["Rodrigues","Hugo",""],["St\u00f6ter","Fabian-Robert",""],["D\u00e9fossez","Alexandre",""],["Luo","Yi",""],["Yu","Jianwei",""],["Chakraborty","Dipam",""],["Mohanty","Sharada",""],["Solovyev","Roman",""],["Stempkovskiy","Alexander",""],["Habruseva","Tatiana",""],["Goswami","Nabarun",""],["Harada","Tatsuya",""],["Kim","Minseok",""],["Lee","Jun Hyung",""],["Dong","Yuanliang",""],["Zhang","Xinran",""],["Liu","Jiafeng",""],["Mitsufuji","Yuki",""]]}
{"id":"2308.06980","submitter":"Anton Krause","authors":"Anton Krause, Mohd Danish Khursheed, Philipp Schulz, Friedrich\n  Burmeister, Gerhard Fettweis","title":"Digital Twin of the Radio Environment: A Novel Approach for Anomaly\n  Detection in Wireless Networks","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increasing relevance of resilience in wireless connectivity for Industry\n4.0 stems from the growing complexity and interconnectivity of industrial\nsystems, where a single point of failure can disrupt the entire network,\nleading to significant downtime and productivity losses. It is thus essential\nto constantly monitor the network and identify any anomaly such as a jammer.\nHereby, technologies envisioned to be integrated in 6G, in particular joint\ncommunications and sensing (JCAS) and accurate indoor positioning of\ntransmitters, open up the possibility to build a digital twin (DT) of the radio\nenvironment. This paper proposes a new approach for anomaly detection in\nwireless networks enabled by such a DT which allows to integrate contextual\ninformation on the network in the anomaly detection procedure. The basic\napproach is thereby to compare expected received signal strengths (RSSs) from\nthe DT with measurements done by distributed sensing units (SUs). Employing\nsimulations, different algorithms are compared regarding their ability to infer\nfrom the comparison on the presence or absence of an anomaly, particular a\njammer. Overall, the feasibility of anomaly detection using the proposed\napproach is demonstrated which integrates in the ongoing research on employing\nDTs for comprehensive monitoring of wireless networks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:32:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Krause","Anton",""],["Khursheed","Mohd Danish",""],["Schulz","Philipp",""],["Burmeister","Friedrich",""],["Fettweis","Gerhard",""]]}
{"id":"2308.06981","submitter":"Yuki Mitsufuji","authors":"Stefan Uhlich, Giorgio Fabbro, Masato Hirano, Shusuke Takahashi,\n  Gordon Wichern, Jonathan Le Roux, Dipam Chakraborty, Sharada Mohanty, Kai Li,\n  Yi Luo, Jianwei Yu, Rongzhi Gu, Roman Solovyev, Alexander Stempkovskiy,\n  Tatiana Habruseva, Mikhail Sukhovei, Yuki Mitsufuji","title":"The Sound Demixing Challenge 2023 $\\unicode{x2013}$ Cinematic Demixing\n  Track","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper summarizes the cinematic demixing (CDX) track of the Sound\nDemixing Challenge 2023 (SDX'23). We provide a comprehensive summary of the\nchallenge setup, detailing the structure of the competition and the datasets\nused. Especially, we detail CDXDB23, a new hidden dataset constructed from real\nmovies that was used to rank the submissions. The paper also offers insights\ninto the most successful approaches employed by participants. Compared to the\ncocktail-fork baseline, the best-performing system trained exclusively on the\nsimulated Divide and Remaster (DnR) dataset achieved an improvement of 1.8dB in\nSDR whereas the top performing system on the open leaderboard, where any data\ncould be used for training, saw a significant improvement of 5.7dB.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:34:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Uhlich","Stefan",""],["Fabbro","Giorgio",""],["Hirano","Masato",""],["Takahashi","Shusuke",""],["Wichern","Gordon",""],["Roux","Jonathan Le",""],["Chakraborty","Dipam",""],["Mohanty","Sharada",""],["Li","Kai",""],["Luo","Yi",""],["Yu","Jianwei",""],["Gu","Rongzhi",""],["Solovyev","Roman",""],["Stempkovskiy","Alexander",""],["Habruseva","Tatiana",""],["Sukhovei","Mikhail",""],["Mitsufuji","Yuki",""]]}
{"id":"2308.06982","submitter":"Xiao Lin","authors":"Xiao Lin, Xiaokai Chen, Chenyang Wang, Hantao Shu, Linfeng Song, Biao\n  Li, Peng jiang","title":"Discrete Conditional Diffusion for Reranking in Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reranking plays a crucial role in modern multi-stage recommender systems by\nrearranging the initial ranking list to model interplay between items.\nConsidering the inherent challenges of reranking such as combinatorial\nsearching space, some previous studies have adopted the evaluator-generator\nparadigm, with a generator producing feasible sequences and a evaluator\nselecting the best one based on estimated listwise utility. Inspired by the\nremarkable success of diffusion generative models, this paper explores the\npotential of diffusion models for generating high-quality sequences in\nreranking. However, we argue that it is nontrivial to take diffusion models as\nthe generator in the context of recommendation. Firstly, diffusion models\nprimarily operate in continuous data space, differing from the discrete data\nspace of item permutations. Secondly, the recommendation task is different from\nconventional generation tasks as the purpose of recommender systems is to\nfulfill user interests. Lastly, real-life recommender systems require\nefficiency, posing challenges for the inference of diffusion models. To\novercome these challenges, we propose a novel Discrete Conditional Diffusion\nReranking (DCDR) framework for recommendation. DCDR extends traditional\ndiffusion models by introducing a discrete forward process with tractable\nposteriors, which adds noise to item sequences through step-wise discrete\noperations (e.g., swapping). Additionally, DCDR incorporates a conditional\nreverse process that generates item sequences conditioned on expected user\nresponses. Extensive offline experiments conducted on public datasets\ndemonstrate that DCDR outperforms state-of-the-art reranking methods.\nFurthermore, DCDR has been deployed in a real-world video app with over 300\nmillion daily active users, significantly enhancing online recommendation\nquality.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:35:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lin","Xiao",""],["Chen","Xiaokai",""],["Wang","Chenyang",""],["Shu","Hantao",""],["Song","Linfeng",""],["Li","Biao",""],["jiang","Peng",""]]}
{"id":"2308.06983","submitter":"Himanshu Buckchash","authors":"Momojit Biswas, Himanshu Buckchash, Dilip K. Prasad","title":"pNNCLR: Stochastic Pseudo Neighborhoods for Contrastive Learning based\n  Unsupervised Representation Learning Problems","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nearest neighbor (NN) sampling provides more semantic variations than\npre-defined transformations for self-supervised learning (SSL) based image\nrecognition problems. However, its performance is restricted by the quality of\nthe support set, which holds positive samples for the contrastive loss. In this\nwork, we show that the quality of the support set plays a crucial role in any\nnearest neighbor based method for SSL. We then provide a refined baseline\n(pNNCLR) to the nearest neighbor based SSL approach (NNCLR). To this end, we\nintroduce pseudo nearest neighbors (pNN) to control the quality of the support\nset, wherein, rather than sampling the nearest neighbors, we sample in the\nvicinity of hard nearest neighbors by varying the magnitude of the resultant\nvector and employing a stochastic sampling strategy to improve the performance.\nAdditionally, to stabilize the effects of uncertainty in NN-based learning, we\nemploy a smooth-weight-update approach for training the proposed network.\nEvaluation of the proposed method on multiple public image recognition and\nmedical image recognition datasets shows that it performs up to 8 percent\nbetter than the baseline nearest neighbor method, and is comparable to other\npreviously proposed SSL methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:35:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Biswas","Momojit",""],["Buckchash","Himanshu",""],["Prasad","Dilip K.",""]]}
{"id":"2308.06984","submitter":"Kari J. Eskola","authors":"Kari J. Eskola, Christopher A. Flett, Vadim Guzey, Topi L\\\"oyt\\\"ainen,\n  Hannu Paukkunen","title":"Exclusive quarkonium photoproduction in $A$+$A$ UPCs at the LHC in NLO\n  pQCD","comments":"6 pages, 5 figures, contributed talk by K.J.E. at the 11th\n  International Conference on Hard and Electromagnetic Probes of High-Energy\n  Nuclear Collisions, Hard Probes 2023, 26-31 March 2023, Aschaffenburg,\n  Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first study of coherent exclusive quarkonium ($J/\\psi$,\n$\\Upsilon$) photoproduction in ultraperipheral nucleus-nucleus collisions\n(UPCs) at the LHC in the framework of collinear factorization and\nnext-to-leading order (NLO) perturbative QCD (pQCD). We make NLO predictions\nfor the $J/\\psi$ and $\\Upsilon$ rapidity distributions for lead (Pb) and oxygen\n(O) beams, and quantify their dependence on the factorization/renormalization\nscale, nuclear parton distribution functions (PDFs) and their uncertainties,\nand on differences between nuclear PDFs and generalized parton distribution\nfunctions (GPDs). We show that within the PDF-originating uncertainties our\napproach provides a good description of the available $J/\\psi$ photoproduction\ndata in Pb+Pb UPCs at the LHC but that the scale uncertainty is significant. We\ndemonstrate that at NLO pQCD the quark contributions are important in the\n$J/\\psi$ case but that gluons clearly dominate the $\\Upsilon$ cross sections.\nWe also study how the scale dependence could be tamed by considering O+O/Pb+Pb\nratios of the exclusive $J/\\psi$ UPC cross sections, and how HERA and p+p/Pb\nLHC data can help in obtaining better-controlled NLO predictions in the\n$\\Upsilon$ case.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:43:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Eskola","Kari J.",""],["Flett","Christopher A.",""],["Guzey","Vadim",""],["L\u00f6yt\u00e4inen","Topi",""],["Paukkunen","Hannu",""]]}
{"id":"2308.06985","submitter":"Oren Shrout","authors":"Oren Shrout, Ori Nitzan, Yizhak Ben-Shabat, Ayellet Tal","title":"PatchContrast: Self-Supervised Pre-training for 3D Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurately detecting objects in the environment is a key challenge for\nautonomous vehicles. However, obtaining annotated data for detection is\nexpensive and time-consuming. We introduce PatchContrast, a novel\nself-supervised point cloud pre-training framework for 3D object detection. We\npropose to utilize two levels of abstraction to learn discriminative\nrepresentation from unlabeled data: proposal-level and patch-level. The\nproposal-level aims at localizing objects in relation to their surroundings,\nwhereas the patch-level adds information about the internal connections between\nthe object's components, hence distinguishing between different objects based\non their individual components. We demonstrate how these levels can be\nintegrated into self-supervised pre-training for various backbones to enhance\nthe downstream 3D detection task. We show that our method outperforms existing\nstate-of-the-art models on three commonly-used 3D detection datasets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:45:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shrout","Oren",""],["Nitzan","Ori",""],["Ben-Shabat","Yizhak",""],["Tal","Ayellet",""]]}
{"id":"2308.06986","submitter":"Jiaan Qi","authors":"Jiaan Qi, Zhi-Hai Liu and H. Q. Xu","title":"Spin-Orbit Interaction Enabled High-Fidelity Two-Qubit Gates","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":"  We study the implications of spin-orbit interaction (SOI) for two-qubit gates\n(TQGs) in semiconductor spin qubit platforms. The exchange interaction\ngoverning qubit pairs is anisotropic under SOI, posing a problem for\nconventional TQGs derived under the Heisenberg exchange. After developing a\nconcise form of the effective two-qubit Hamiltonian under SOI, we use it to\nderive properties of rotating-frame evolution. Two main observations are made.\nFirst, in contrary to past belief, we find that an appropriate amount of SOI\ncan significantly enhance the controlled-phase gate fidelity compared to the\nno-SOI case. Second, SOI enables novel two-qubit dynamics, that are\nconventionally inaccessible through DC evolution, such as the reflection gate\nand the controlled-not gate.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:47:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qi","Jiaan",""],["Liu","Zhi-Hai",""],["Xu","H. Q.",""]]}
{"id":"2308.06987","submitter":"Payman Goodarzi","authors":"Payman Goodarzi, Yannick Robin, Andreas Sch\\\"utze, Tizian Schneider","title":"Deep convolutional neural networks for cyclic sensor data","comments":"4 pages, 3 figures, submitted to the IEEE Sensors Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predictive maintenance plays a critical role in ensuring the uninterrupted\noperation of industrial systems and mitigating the potential risks associated\nwith system failures. This study focuses on sensor-based condition monitoring\nand explores the application of deep learning techniques using a hydraulic\nsystem testbed dataset. Our investigation involves comparing the performance of\nthree models: a baseline model employing conventional methods, a single CNN\nmodel with early sensor fusion, and a two-lane CNN model (2L-CNN) with late\nsensor fusion. The baseline model achieves an impressive test error rate of 1%\nby employing late sensor fusion, where feature extraction is performed\nindividually for each sensor. However, the CNN model encounters challenges due\nto the diverse sensor characteristics, resulting in an error rate of 20.5%. To\nfurther investigate this issue, we conduct separate training for each sensor\nand observe variations in accuracy. Additionally, we evaluate the performance\nof the 2L-CNN model, which demonstrates significant improvement by reducing the\nerror rate by 33% when considering the combination of the least and most\noptimal sensors. This study underscores the importance of effectively\naddressing the complexities posed by multi-sensor systems in sensor-based\ncondition monitoring.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:51:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Goodarzi","Payman",""],["Robin","Yannick",""],["Sch\u00fctze","Andreas",""],["Schneider","Tizian",""]]}
{"id":"2308.06988","submitter":"Andrew Yuan","authors":"Andrew C. Yuan","title":"Absence of Vestigial Time-reversal Symmetry Breaking above $T_c$ in the\n  Strong-coupling Limit of a Twisted Bilayer Superconductor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.supr-con math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phase ordering in a 2D superconductor occurs via a BKT transition. However,\nin bilayer systems with vanishing first-order interlayer Josephson coupling,\nthe superconducting phase can also exhibit spontaneous time-reversal symmetry\nbreaking (TRSB) due to the locking of the phase difference $\\phi$ across the\njunction via a second-order Josephson coupling $J_2 \\cos (2\\phi)$ with a sign\nthat favors $\\phi = \\pm \\pi/2$. In particular, in unconventional\nsuperconductors (SC), the first-order term $-J_1(\\theta) \\cos \\phi$ can be\ntuned to vanish via twisting the relative orientation (e.g., by $\\theta=\\pi/4$\nin a $d$-wave SC), so that the second order coupling $J_2 \\cos (2\\phi)$ becomes\nthe dominant interlayer interaction. However, it remains unsettled whether TRSB\noccurs above the BKT transition in the normal state (\\textit{vestigial order}).\nHere we show that in the strong-coupling (large $J_2$) limit, the TRSB onsets\nprecisely at the superconducting transition when $J_1= 0$, and at a lower\ncritical temperature when $J_1>0$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:51:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yuan","Andrew C.",""]]}
{"id":"2308.06989","submitter":"Lukas Johannes Splitthoff","authors":"Lukas Johannes Splitthoff, Jaap Joachim Wesdorp, Marta Pita-Vidal,\n  Arno Bargerbos, Christian Kraglund Andersen","title":"Gate-tunable kinetic inductance parametric amplifier","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconducting parametric amplifiers play a crucial role in the preparation\nand readout of quantum states at microwave frequencies, enabling high-fidelity\nmeasurements of superconducting qubits. Most existing implementations of these\namplifiers rely on the nonlinearity from Josephson junctions, superconducting\nquantum interference devices or disordered superconductors. Additionally,\nfrequency tunability arises typically from either flux or current biasing. In\ncontrast, semiconductor-based parametric amplifiers are tunable by local\nelectric fields, which impose a smaller thermal load on the cryogenic setup\nthan current and flux biasing and lead to vanishing crosstalk to other on-chip\nquantum systems. In this work, we present a gate-tunable parametric amplifier\nthat operates without Josephson junctions, utilizing a proximitized\nsemiconducting nanowire. This design achieves near-quantum-limited performance,\nfeaturing more than 20 dB gain and a 30 MHz gain-bandwidth product. The absence\nof Josephson junctions allows for advantages, including substantial saturation\npowers of -120dBm, magnetic field compatibility up to 500 mT and frequency\ntunability over a range of 15 MHz. Our realization of a parametric amplifier\nsupplements efforts towards gate-controlled superconducting electronics,\nfurther advancing the abilities for high-performing quantum measurements of\nsemiconductor-based and superconducting quantum devices.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:54:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Splitthoff","Lukas Johannes",""],["Wesdorp","Jaap Joachim",""],["Pita-Vidal","Marta",""],["Bargerbos","Arno",""],["Andersen","Christian Kraglund",""]]}
{"id":"2308.06990","submitter":"Gerold Schefer","authors":"Gerold Schefer","title":"A note on logarithmic equidistribution","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For every algebraic number $\\kappa$ on the unit circle which is not a root of\nunity we prove the existence of a strict sequence of algebraic numbers whose\nheight tends to zero, such that the averages of the evaluation of\n$f_\\kappa(z)=\\log|z -\\kappa|$ in the conjugates are essentially bounded from\nabove by $-h(\\kappa)$. This completes a characterisation on functions\n$f_\\kappa$ initiated by Autissier and Baker-Masser, who cover the cases\n$\\kappa=2$ and $|\\kappa|\\ne 1$ respectively. Using the same ideas we also prove\nanalogues in the $p$-adic setting.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:56:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Schefer","Gerold",""]]}
{"id":"2308.06991","submitter":"Lei-Hong Zhang","authors":"Lei-Hong Zhang and Linyi Yang and Wei Hong Yang and Ya-Nan Zhang","title":"A convex dual programming for the rational minimax approximation and\n  Lawson's iteration","comments":"38 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing the discrete rational minimax approximation in the complex plane is\nchallenging. Apart from Ruttan's sufficient condition, there are few other\nsufficient conditions for global optimality. The state-of-the-art rational\napproximation algorithms, such as the adaptive Antoulas-Anderson (AAA),\nAAA-Lawson, and the rational Krylov fitting (RKFIT) method, perform highly\nefficiently, but the computed rational approximants may be near-best. In this\npaper, we propose a convex programming approach, the solution of which is\nguaranteed to be the rational minimax approximation under Ruttan's sufficient\ncondition. Furthermore, we present a new version of Lawson's iteration for\nsolving this convex programming problem. The computed solution can be easily\nverified as the rational minimax approximant. Our numerical experiments\ndemonstrate that this updated version of Lawson's iteration generally converges\nmonotonically with respect to the objective function of the convex programming.\nIt is an effective competitive approach for the rational minimax problem,\ncompared to the highly efficient AAA, AAA-Lawson, and the stabilized\nSanathanan-Koerner iteration.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:00:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Lei-Hong",""],["Yang","Linyi",""],["Yang","Wei Hong",""],["Zhang","Ya-Nan",""]]}
{"id":"2308.06992","submitter":"Xuexing Lu","authors":"Xuexing Lu","title":"A new definition of upward planar order","comments":"3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a more coherent and apparent definition of upward planar order.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:01:16 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 05:56:47 GMT"},{"version":"v3","created":"Fri, 18 Aug 2023 13:51:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Xuexing",""]]}
{"id":"2308.06993","submitter":"De-Hua Wen","authors":"Hongyi Sun and Dehua Wen","title":"Implications of supermassive neutron stars for the form of the equation\n  of state of hybrid stars","comments":"12 pages, 5 figures","journal-ref":"Physical Review C 108, 025801 (2023)","doi":"10.1103/PhysRevC.108.025801","report-no":null,"categories":"nucl-th astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The observations of PSR J0952-0607 and the second object in GW190814 event\nindicate the possible existence of supermassive neutron stars. In this work, by\nusing the Constant-Sound-Speed (CSS) parametrization to describe the equation\nof state (EOS) of quark matter, the constraints on the EOS parameters from\nsupermassive hybrid stars are investigated through the Maxwell and Gibbs\nconstructions. It is shown that to support a supermassive hybrid star, a lower\ntransition energy density, a smaller energy density discontinuity and a higher\nsound speed of quark matter are favored. For the constructed hybrid star EOS\nmodel, the maximum mass of the corresponding hybrid stars will not meet the\nlower mass limit of the second object in GW190814 if the energy density\ndiscontinuity takes a value higher than $180~{\\rm MeV~fm^{-3}}$. Moreover, it\nis confirmed that the supermassive neutron star observation can also rule out\nthe existence of twin stars as a supermassive hybrid star requires a relatively\nsmall energy density discontinuity. Finally, we give a rough estimate of the\nlower limit of the dimensionless tidal deformability of neutron stars which\nranges from 2 to 3.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:01:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sun","Hongyi",""],["Wen","Dehua",""]]}
{"id":"2308.06994","submitter":"Hebzibha Isravel","authors":"Hebzibha Isravel, Damien Begue, Asaf Pe'er","title":"Hybrid Emission Modeling of GRB 221009A: Shedding Light on TeV Emission\n  Origins in Long-GRBs","comments":"15 pages and 4 figures (Accepted to be published in ApJ)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Observations of long duration gamma-ray bursts (GRBs) with TeV emission\nduring their afterglow have been on the rise. Recently, GRB 221009A, the most\nenergetic GRB ever observed, was detected by the {LHAASO} experiment in the\nenergy band 0.2 - 7 TeV. Here, we interpret its afterglow in the context of a\nhybrid model in which the TeV spectral component is explained by the\nproton-synchrotron process while the low energy emission from optical to X-ray\nis due to synchrotron radiation from electrons. We constrained the model\nparameters using the observed optical, X-ray and TeV data. By comparing the\nparameters of this burst and of GRB 190114C, we deduce that the VHE emission at\nenergies $\\geq$ 1 TeV in the GRB afterglow requires large explosion kinetic\nenergy, $E \\gtrsim 10^{54}$~erg and a reasonable circumburst density, $n\\gtrsim\n10$~cm$^{-3}$. This results in a small injection fractions of particles\naccelerated to a power-law, $\\sim 10^{-2}$. {A significant fraction of shock\nenergy must be allocated to a near equipartition magnetic field, $\\epsilon_B\n\\sim 10^{-1}$, while electrons should only carry a small fraction of this\nenergy, $\\epsilon_e \\sim 10^{-3}$. Under these conditions required for a proton\nsynchrotron model, namely $\\epsilon_B \\gg \\epsilon_e$, the SSC component is\nsubstantially sub-dominant over proton-synchrotron as a source of TeV photons.}\nThese results lead us to suggest that proton-synchrotron process is a strong\ncontender for the radiative mechanisms explaining GRB afterglows in the TeV\nband.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:04:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Isravel","Hebzibha",""],["Begue","Damien",""],["Pe'er","Asaf",""]]}
{"id":"2308.06995","submitter":"Micha{\\l} T. Seweryn","authors":"Marc Distel, Robert Hickingbotham, Micha{\\l} T. Seweryn, David R. Wood","title":"Powers of planar graphs, product structure, and blocking partitions","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 the $k$-power of any planar graph $G$ is contained in\n$H\\boxtimes P\\boxtimes K_{f(\\Delta(G),k)}$ for some graph $H$ with treewidth\n$15\\,288\\,899$, some path $P$, and some function $f$. This resolves an open\nproblem of Ossona de Mendez. In fact, we prove a more general result in terms\nof shallow minors that implies similar results for many `beyond planar' graph\nclasses, without dependence on $\\Delta(G)$. For example, we prove that every\n$k$-planar graph is contained in $H\\boxtimes P\\boxtimes K_{f(k)}$ for some\ngraph $H$ with treewidth $15\\,288\\,899$ and some path $P$, and some function\n$f$. This resolves an open problem of Dujmovi\\'c, Morin and Wood. We generalise\nall these results for graphs of bounded Euler genus, still with an absolute\nbound on the treewidth.\n  At the heart of our proof is the following new concept of independent\ninterest. An $\\ell$-blocking partition of a graph $G$ is a partition of $V(G)$\ninto connected sets such that every path of length greater than $\\ell$ in $G$\ncontains at least two vertices in one part. We prove that every graph of Euler\ngenus $g$ has a $894$-blocking partition with parts of size bounded by a\nfunction of $\\Delta(G)$ and $g$. Motivated by this result, we study blocking\npartitions in their own right. We show that every graph has a $2$-blocking\npartition with parts of size bounded by a function of $\\Delta(G)$ and\n$\\textrm{tw}(G)$. On the other hand, we show that 4-regular graphs do not have\n$\\ell$-blocking partitions with bounded size parts.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:10:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Distel","Marc",""],["Hickingbotham","Robert",""],["Seweryn","Micha\u0142 T.",""],["Wood","David R.",""]]}
{"id":"2308.06996","submitter":"Philipp Reiser","authors":"Philipp Reiser and David J. Wraith","title":"A generalization of the Perelman gluing theorem and applications","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a gluing result that allows to glue two Riemannian manifolds of\npositive intermediate Ricci curvature along their boundaries, provided the\nboundaries are isometric and the sum of second fundamental forms is positive\nsemi-definite. This holds in particular for positive sectional curvature and\ngeneralizes a result of Perelman for positive Ricci curvature. As application\nwe derive a sufficient condition for the existence of a metric with positive\nintermediate Ricci curvature and totally geodesic boundary, and obtain results\non the observer moduli space of metrics of positive intermediate Ricci\ncurvature on the sphere.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:11:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Reiser","Philipp",""],["Wraith","David J.",""]]}
{"id":"2308.06997","submitter":"Marco Edoardo Rosti","authors":"Rahul K. Singh, Prasad Perlekar, Dhrubaditya Mitra, Marco E. Rosti","title":"Intermittency in the not-so-smooth elastic turbulence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Elastic turbulence is the chaotic fluid motion resulting from elastic\ninstabilities due to the addition of polymers in small concentrations at very\nsmall Reynolds ($Re$) numbers. Our direct numerical simulations show that\nelastic turbulence, though a low $Re$ phenomenon, has more in common with\nclassical, Newtonian turbulence than previously thought. In particular, we find\npower-law spectra for kinetic energy $E(k) \\sim k^{-4}$, and polymeric energy,\n$E_\\rm{p}(k) \\sim k^{-3/2}$, independent of the Deborah ($De$) number. This is\nfurther supported by calculation of scale-by-scale energy budget which shows a\nbalance between the viscous term and the polymeric term in the momentum\nequation. In real space, as expected, the velocity field is smooth, i.e., the\nvelocity difference across a length scale $r$, $\\delta u \\sim r$ but,\ncrucially, with a non-trivial sub-leading contribution $r^{3/2}$ which we\nextract by using the second difference of velocity. The structure functions of\nsecond difference of velocity up to order $6$ show clear evidence of\nintermittency/multifractality. We provide additional evidence in support of\nthis intermittent nature by calculating moments of dissipation rate of kinetic\nenergy averaged over a ball of radius $r$, $\\epsilon_r$, from which we\ncalculate the multifractal spectrum.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:15:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Singh","Rahul K.",""],["Perlekar","Prasad",""],["Mitra","Dhrubaditya",""],["Rosti","Marco E.",""]]}
{"id":"2308.06998","submitter":"Hao Shen","authors":"Hao Shen, Zhong-Qiu Zhao, Yulun Zhang, Zhao Zhang","title":"Mutual Information-driven Triple Interaction Network for Efficient Image\n  Dehazing","comments":"Accepted 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":"  Multi-stage architectures have exhibited efficacy in image dehazing, which\nusually decomposes a challenging task into multiple more tractable sub-tasks\nand progressively estimates latent hazy-free images. Despite the remarkable\nprogress, existing methods still suffer from the following shortcomings: (1)\nlimited exploration of frequency domain information; (2) insufficient\ninformation interaction; (3) severe feature redundancy. To remedy these issues,\nwe propose a novel Mutual Information-driven Triple interaction Network\n(MITNet) based on spatial-frequency dual domain information and two-stage\narchitecture. To be specific, the first stage, named amplitude-guided haze\nremoval, aims to recover the amplitude spectrum of the hazy images for haze\nremoval. And the second stage, named phase-guided structure refined, devotes to\nlearning the transformation and refinement of the phase spectrum. To facilitate\nthe information exchange between two stages, an Adaptive Triple Interaction\nModule (ATIM) is developed to simultaneously aggregate cross-domain,\ncross-scale, and cross-stage features, where the fused features are further\nused to generate content-adaptive dynamic filters so that applying them to\nenhance global context representation. In addition, we impose the mutual\ninformation minimization constraint on paired scale encoder and decoder\nfeatures from both stages. Such an operation can effectively reduce information\nredundancy and enhance cross-stage feature complementarity. Extensive\nexperiments on multiple public datasets exhibit that our MITNet performs\nsuperior performance with lower model complexity.The code and models are\navailable at https://github.com/it-hao/MITNet.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:23:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shen","Hao",""],["Zhao","Zhong-Qiu",""],["Zhang","Yulun",""],["Zhang","Zhao",""]]}
{"id":"2308.06999","submitter":"Arora Simran","authors":"Simran Arora, Shivesh Yadav, Amandeep Kaur, Bhabani Prasad Sahu,\n  Zainab Hussain and Subhabrata Dhar","title":"Ni cluster embedded (111)NiO layers grown on (0001)GaN films using\n  pulsed laser deposition technique","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":"  (111) NiO epitaxial layers embedded with crystallographically oriented\nNi-clusters are grown on c-GaN/Sapphire templates using pulsed laser deposition\ntechnique. Structural and magnetic properties of the films are examined by a\nvariety of techniques including high resolution x-ray diffraction,\nprecession-electron diffraction and superconducting quantum interference device\nmagnetometry. The study reveals that the inclusion, orientation, shape, size,\ndensity and magnetic properties of these clusters depend strongly on the growth\ntemperature (TG). Though, most of the Ni-clusters are found to be\ncrystallographically aligned with the NiO matrix with Ni(111) parallel to\nNiO(111), clusters with other orientations also exist, especially in samples\ngrown at lower temperatures. Average size and density of the clusters increase\nwith TG . Proportion of the Ni(111) parallel to NiO(111) oriented clusters also\nimproves as TG is increased. All cluster embedded films show ferromagnetic\nbehaviour even at room temperature. Easy-axis is found to be oriented in the\nlayer plane in samples grown at relatively lower temperatures. However, it\nturns perpendicular to the layer plane for samples grown at sufficiently high\ntemperatures. This reversal of easy-axis has been attributed to the size\ndependent competition between the shape, magnetoelastic and the surface\nanisotropies of the clusters. This composite material thus has great potential\nto serve as spin-injector and spinstorage medium in GaN based spintronics of\nthe future.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:28:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Arora","Simran",""],["Yadav","Shivesh",""],["Kaur","Amandeep",""],["Sahu","Bhabani Prasad",""],["Hussain","Zainab",""],["Dhar","Subhabrata",""]]}
{"id":"2308.07000","submitter":"Giorgio Poggesi Dr","authors":"Giorgio Poggesi","title":"Remarks about the mean value property and some weighted Poincar\\'e-type\n  inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We start providing a quantitative stability theorem for the rigidity of an\noverdetermined problem involving harmonic functions in a punctured domain. Our\napproach is inspired by and based on the proof of rigidity established by\nEnciso and Peralta-Salas, and reveals essential differences with respect to the\nstability results obtained in the literature for the classical overdetermined\nSerrin problem.\n  Secondly, we provide new weighted Poincar\\'e-type inequalities for vector\nfields. These are crucial tools for the study of the quantitative stability\nissue initiated by the author concerning a class of rigidity results involving\nmixed boundary value problems.\n  Finally, we provide a mean value-type property and an associated weighted\nPoincar\\'e-type inequality for harmonic functions in cones. A duality relation\nbetween this new mean value property and a partially overdetermined boundary\nvalue problem is discussed, providing an extension of a classical result due to\nPayne and Schaefer.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:30:01 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:27:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Poggesi","Giorgio",""]]}
{"id":"2308.07001","submitter":"Teddy Lazebnik Dr.","authors":"Ariel Alexi, Teddy Lazebnik, Ariel Rosenfeld","title":"The Scientometrics and Reciprocality Underlying Co-Authorship Panels in\n  Google Scholar Profiles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.IR cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Online academic profiles are used by scholars to reflect a desired image to\ntheir online audience. In Google Scholar, scholars can select a subset of\nco-authors for presentation in a central location on their profile using a\nsocial feature called the Co-authroship panel. In this work, we examine whether\nscientometrics and reciprocality can explain the observed selections. To this\nend, we scrape and thoroughly analyze a novel set of 120,000 Google Scholar\nprofiles, ranging across four disciplines and various academic institutions.\nOur results suggest that scholars tend to favor co-authors with higher\nscientometrics over others for inclusion in their co-authorship panels.\nInterestingly, as one's own scientometrics are higher, the tendency to include\nco-authors with high scientometrics is diminishing. Furthermore, we find that\nreciprocality is central to explaining scholars' selections.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:32:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alexi","Ariel",""],["Lazebnik","Teddy",""],["Rosenfeld","Ariel",""]]}
{"id":"2308.07002","submitter":"Fabien Thiesset","authors":"Fabien Thiesset, Christoph Federrath","title":"Structure of iso-density sets in supersonic isothermal turbulence","comments":"15 pages, 14 figures","journal-ref":"Astronomy and Astrophysics, 676, A12 (2023)","doi":"10.1051/0004-6361/202346575","report-no":null,"categories":"physics.flu-dyn astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Context: The gas density structure of the cold molecular phase of the\ninterstellar medium is the main controller of star formation. Aims: A\ntheoretical framework is proposed to describe the structural content of the\ndensity field in isothermal supersonic turbulence. Methods: It makes use of\ncorrelation and structure functions of the phase indicator field defined for\ndifferent iso-density values. The relations between these two-point statistics\nand the geometrical features of iso-density sets such as the volume fraction,\nthe surface density, the curvature, and fractal characteristics are provided.\nAn exact scale-by-scale budget equation is further derived revealing the role\nof the turbulent cascade and dilation on the structural evolution of the\ndensity field. Although applicable to many flow situations, this tool is here\nfirst invoked for characterising supersonic isothermal turbulence, using data\nfrom the currently best-resolved numerical simulation. Results: We show that\niso-density sets are surface fractals rather than mass fractals, with\ndimensions that markedly differ between dilute, neutral, and dense regions. The\nsurface-size relation is established for different iso-density values. We\nfurther find that the turbulent cascade of iso-density sets is directed from\nlarge towards smaller scales, in agreement with the classical picture that\nturbulence acts to concentrate more surface into smaller volumes. Intriguingly,\nthere is no range of scales that complies with a constant transfer rate in the\ncascade, challenging our fundamental understanding of interstellar turbulence.\nFinally, we recast the virial theorem in a new formulation drawing an explicit\nrelation between the aforementioned geometrical measures and the dynamics of\niso-density sets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:33:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Thiesset","Fabien",""],["Federrath","Christoph",""]]}
{"id":"2308.07003","submitter":"Lukas Fisch","authors":"Lukas Fisch, Stefan Zumdick, Carlotta Barkhau, Daniel Emden, Jan\n  Ernsting, Ramona Leenings, Kelvin Sarink, Nils R. Winter, Benjamin Risse, Udo\n  Dannlowski, Tim Hahn","title":"Deepbet: Fast brain extraction of T1-weighted MRI using Convolutional\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Brain extraction in magnetic resonance imaging (MRI) data is an important\nsegmentation step in many neuroimaging preprocessing pipelines. Image\nsegmentation is one of the research fields in which deep learning had the\nbiggest impact in recent years enabling high precision segmentation with\nminimal compute. Consequently, traditional brain extraction methods are now\nbeing replaced by deep learning-based methods. Here, we used a unique dataset\ncomprising 568 T1-weighted (T1w) MR images from 191 different studies in\ncombination with cutting edge deep learning methods to build a fast,\nhigh-precision brain extraction tool called deepbet. deepbet uses LinkNet, a\nmodern UNet architecture, in a two stage prediction process. This increases its\nsegmentation performance, setting a novel state-of-the-art performance during\ncross-validation with a median Dice score (DSC) of 99.0% on unseen datasets,\noutperforming current state of the art models (DSC = 97.8% and DSC = 97.9%).\nWhile current methods are more sensitive to outliers, resulting in Dice scores\nas low as 76.5%, deepbet manages to achieve a Dice score of > 96.9% for all\nsamples. Finally, our model accelerates brain extraction by a factor of ~10\ncompared to current methods, enabling the processing of one image in ~2 seconds\non low level hardware.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:39:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fisch","Lukas",""],["Zumdick","Stefan",""],["Barkhau","Carlotta",""],["Emden","Daniel",""],["Ernsting","Jan",""],["Leenings","Ramona",""],["Sarink","Kelvin",""],["Winter","Nils R.",""],["Risse","Benjamin",""],["Dannlowski","Udo",""],["Hahn","Tim",""]]}
{"id":"2308.07004","submitter":"Xiao Mao","authors":"Xiao Mao","title":"$(1-\\epsilon)$-Approximation of Knapsack in Nearly Quadratic Time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knapsack is one of the most fundamental problems in theoretical computer\nscience. In the $(1 - \\epsilon)$-approximation setting, although there is a\nfine-grained lower bound of $(n + 1 / \\epsilon) ^ {2 - o(1)}$ based on the\n$(\\min, +)$-convolution hypothesis ([K{\\\"u}nnemann, Paturi and Stefan\nSchneider, ICALP 2017] and [Cygan, Mucha, Wegrzycki and Wlodarczyk, 2017]), the\nbest algorithm is randomized and runs in $\\tilde O(n + (1 / \\epsilon) ^\n{11/5})$ time [Deng, Jin and Mao, SODA 2023], and it remains an important open\nproblem whether an algorithm with a running time that matches the lower bound\n(up to a sub-polynomial factor) exists. We answer the problem positively by\nshowing a deterministic $(1 - \\epsilon)$-approximation scheme for knapsack that\nruns in $\\tilde O(n + (1 / \\epsilon) ^ {2})$ time. We first extend a known\nlemma in a recursive way to reduce the problem to $n \\epsilon$-additve\napproximation for $n$ items. Then we give a simple efficient geometry-based\nalgorithm for the reduced problem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:40:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mao","Xiao",""]]}
{"id":"2308.07005","submitter":"Athul Pradeepkumar Girija","authors":"Athul Pradeepkumar Girija","title":"Planetary Entry Probe Dataset: Analysis and Rules of Thumb for Future\n  Missions","comments":"15 pages, 15 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":"  Since the beginning of robotic interplanetary exploration nearly six decades\nago, successful atmospheric entry has been accomplished at Venus, Earth, Mars,\nJupiter, and Titan. More entry probe missions are planned to Venus, Titan, and\nUranus in the next decade. Atmospheric entry subjects the vehicle to rapid\ndeceleration and aerothermal loads which the vehicle must be designed for, to\ndeliver the robotic instruments inside the atmosphere. The design of planetary\nprobes and their mission architecture is complex, and involves various\nengineering constraints such as peak deceleration, heating rate, heating load,\nand communications which must be satisfied within the budget and schedule of\ncost constrained mission opportunities. Engineering design data from previous\nentry probe missions serve as a valuable reference for designing future\nmissions. The present study compiles an augmented version of the blue book\nentry probe dataset, performs a comparative analysis of the entry conditions,\nand provides engineering rules of thumb for design of future missions. Using\nthe dataset, the present study proposes a new empirical correlation which aims\nto more accurately predict the thermal protection system mass fraction for high\nheat load conditions during entry and aerocapture at Uranus and Neptune.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:48:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Girija","Athul Pradeepkumar",""]]}
{"id":"2308.07006","submitter":"Tim de Laat","authors":"Tim de Laat, Federico Vigolo and Jeroen Winkel","title":"Dynamical propagation and Roe algebras of warped spaces","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.DS math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a non-singular action $\\Gamma \\curvearrowright (X,\\mu)$, we define the\n$*$-algebra $\\mathbb C_{\\rm fp}[\\Gamma \\curvearrowright X]$ of operators of\nfinite dynamical propagation associated with this action. This assignment is\ncompletely canonical and only depends on the measure class of $\\mu$. We prove\nthat the algebraic crossed product $L^{\\infty}X \\rtimes_{\\rm alg} \\Gamma$\nsurjects onto $\\mathbb C_{\\rm fp}[\\Gamma \\curvearrowright X]$ and that this\nsurjection is a $\\ast$-isomorphism whenever the action is essentially free. As\na consequence, we canonically characterize ergodicity and strong ergodicity of\nthe action in terms of structural properties of $\\mathbb C_{\\rm fp}[\\Gamma\n\\curvearrowright X]$ and its closure. We also use these techniques to describe\nthe Roe algebra of a warped space in terms of the Roe algebra of the\n(non-warped) space and the group action. We apply this result to Roe algebras\nof warped cones.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:51:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["de Laat","Tim",""],["Vigolo","Federico",""],["Winkel","Jeroen",""]]}
{"id":"2308.07007","submitter":"Vladyslav Usenko C.","authors":"Mikolaj Lasota, Olena Kovalenko, Vladyslav C. Usenko","title":"Robustness of entanglement-based discrete- and continuous-variable\n  quantum key distribution against channel noise","comments":"24 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Discrete-variable (DV) and continuous-variable (CV) schemes constitute the\ntwo major families of quantum key distribution (QKD) protocols. Unfortunately,\nsince the setup elements required by these schemes are quite different, making\na fair comparison of their potential performance in particular applications is\noften troublesome, limiting the experimenters' capability to choose an optimal\nsolution. In this work we perform a general comparison of the major\nentanglement-based DV and CV QKD protocols in terms of their resistance to the\nchannel noise, with the otherwise perfect setup, showing the definite\nsuperiority of the DV family. We analytically derive fundamental bounds on the\ntolerable channel noise and attenuation for entanglement-based CV QKD\nprotocols. We also investigate the influence of DV QKD setup imperfections on\nthe obtained results in order to determine benchmarks for the parameters of\nrealistic photon sources and detectors, allowing the realistic DV protocols to\noutperform even the ideal CV QKD analogs. Our results indicate the realistic\nadvantage of DV EPR-based schemes over their CV counterparts and suggests the\npractical efforts for maximizing this advantage.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:51:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lasota","Mikolaj",""],["Kovalenko","Olena",""],["Usenko","Vladyslav C.",""]]}
{"id":"2308.07008","submitter":"Wanyue Xu","authors":"Wanyue Xu and Zhongzhi Zhang","title":"Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics","comments":"This paper has been accepted in CIKM'23 conference","journal-ref":null,"doi":"10.1145/3583780.3614968","report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The operation of creating edges has been widely applied to optimize relevant\nquantities of opinion dynamics. In this paper, we consider a problem of\npolarization optimization for the leader-follower opinion dynamics in a noisy\nsocial network with $n$ nodes and $m$ edges, where a group $Q$ of $q$ nodes are\nleaders, and the remaining $n-q$ nodes are followers. We adopt the popular\nleader-follower DeGroot model, where the opinion of every leader is identical\nand remains unchanged, while the opinion of every follower is subject to white\nnoise. The polarization is defined as the steady-state variance of the\ndeviation of each node's opinion from leaders' opinion, which equals one half\nof the effective resistance $\\mathcal{R}_Q$ between the node group $Q$ and all\nother nodes. Concretely, we propose and study the problem of minimizing\n$\\mathcal{R}_Q$ by adding $k$ new edges with each incident to a node in $Q$. We\nshow that the objective function is monotone and supermodular. We then propose\na simple greedy algorithm with an approximation factor $1-1/e$ that\napproximately solves the problem in $O((n-q)^3)$ time. To speed up the\ncomputation, we also provide a fast algorithm to compute\n$(1-1/e-\\eps)$-approximate effective resistance $\\mathcal{R}_Q$, the running\ntime of which is $\\Otil (mk\\eps^{-2})$ for any $\\eps>0$, where the $\\Otil\n(\\cdot)$ notation suppresses the ${\\rm poly} (\\log n)$ factors. Extensive\nexperiment results show that our second algorithm is both effective and\nefficient.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:52:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Wanyue",""],["Zhang","Zhongzhi",""]]}
{"id":"2308.07009","submitter":"Naufal Suryanto","authors":"Naufal Suryanto, Yongsu Kim, Harashta Tatimma Larasati, Hyoeun Kang,\n  Thi-Thu-Huong Le, Yoonyoung Hong, Hunmin Yang, Se-Yoon Oh, Howon Kim","title":"ACTIVE: Towards Highly Transferable 3D Physical Camouflage for Universal\n  and Robust Vehicle Evasion","comments":"Accepted for ICCV 2023. Main Paper with Supplementary Material.\n  Project Page: https://islab-ai.github.io/active-iccv2023/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adversarial camouflage has garnered attention for its ability to attack\nobject detectors from any viewpoint by covering the entire object's surface.\nHowever, universality and robustness in existing methods often fall short as\nthe transferability aspect is often overlooked, thus restricting their\napplication only to a specific target with limited performance. To address\nthese challenges, we present Adversarial Camouflage for Transferable and\nIntensive Vehicle Evasion (ACTIVE), a state-of-the-art physical camouflage\nattack framework designed to generate universal and robust adversarial\ncamouflage capable of concealing any 3D vehicle from detectors. Our framework\nincorporates innovative techniques to enhance universality and robustness,\nincluding a refined texture rendering that enables common texture application\nto different vehicles without being constrained to a specific texture map, a\nnovel stealth loss that renders the vehicle undetectable, and a smooth and\ncamouflage loss to enhance the naturalness of the adversarial camouflage. Our\nextensive experiments on 15 different models show that ACTIVE consistently\noutperforms existing works on various public detectors, including the latest\nYOLOv7. Notably, our universality evaluations reveal promising transferability\nto other vehicle classes, tasks (segmentation models), and the real world, not\njust other vehicles.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:52:41 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 09:47:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Suryanto","Naufal",""],["Kim","Yongsu",""],["Larasati","Harashta Tatimma",""],["Kang","Hyoeun",""],["Le","Thi-Thu-Huong",""],["Hong","Yoonyoung",""],["Yang","Hunmin",""],["Oh","Se-Yoon",""],["Kim","Howon",""]]}
{"id":"2308.07010","submitter":"Yupeng Yang","authors":"Yupeng Yang, Xiujuan Li and Gang Li","title":"Constraints on primordial black holes in the mixed dark matter scenarios\n  using the ratio $\\rm (^3{He}+D)/H$","comments":"6 pages, 1 figure. 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 derive the upper limit on the dark matter (DM) fraction in primordial\nblack holes (PBHs) in the mixed DM scenarios. In this scenarios, a PBH can\naccrete weakly interacting massive particles (WIMPs) to form a ultracompact\nminihalo (UCMH) with a density profile of $\\rho_{\\rm DM}(r)\\sim r^{-9/4}$. The\nenergy released from UCMHs due to dark matter annihilation has influence on the\nphotodissociation of $^{4}{\\rm He}$, producing the $^{3}{\\rm He}$ and the D. By\nrequiring that the ratio $\\rm (^3{He}+D)/H$ caused by UCMHs does not exceed the\nmeasured value, we derive the upper limit on the dark matter fraction in PBHs.\nFor the canonical value of DM thermally averaged annihilation cross section\n$\\left<\\sigma v\\right>=3\\times 10^{-26}\\rm cm^{3}s^{-1}$, we find that the\nupper limit is $f_{\\rm PBH} < 0.35(0.75)$ for DM mass $m_{\\chi}=1(10)~\\rm GeV$.\nCompared with other limits obtained by different astronomical measurements,\nalthough our limit is not the strongest, we provide a different way of\nconstraining the cosmological abundance of PBHs.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:53:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Yupeng",""],["Li","Xiujuan",""],["Li","Gang",""]]}
{"id":"2308.07011","submitter":"Walter Van Assche","authors":"Walter Van Assche","title":"Unique special solution for discrete Painlev\\'e II","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the discrete Painlev\\'e II equation with starting value\n$a_{-1}=-1$ has a unique solution for which $-1 < a_n < 1$ for every $n \\geq\n0$. This solution corresponds to the Verblunsky coefficients of a family of\northogonal polynomials on the unit circle. This result was already proved for\ncertain values of the parameter in the equation and recently a full proof was\ngiven by Duits and Holcomb. In the present paper we give a different proof that\nis based on an idea put forward by Tomas Lasic Latimer which uses orthogonal\npolynomials. We also give an upper bound for this special solution.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:54:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Van Assche","Walter",""]]}
{"id":"2308.07012","submitter":"Felipe Tobar Dr","authors":"Jou-Hui Ho, Felipe Tobar","title":"Greedy online change point detection","comments":"Accepted at IEEE MLSP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Standard online change point detection (CPD) methods tend to have large false\ndiscovery rates as their detections are sensitive to outliers. To overcome this\ndrawback, we propose Greedy Online Change Point Detection (GOCPD), a\ncomputationally appealing method which finds change points by maximizing the\nprobability of the data coming from the (temporal) concatenation of two\nindependent models. We show that, for time series with a single change point,\nthis objective is unimodal and thus CPD can be accelerated via ternary search\nwith logarithmic complexity. We demonstrate the effectiveness of GOCPD on\nsynthetic data and validate our findings on real-world univariate and\nmultivariate settings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:59:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ho","Jou-Hui",""],["Tobar","Felipe",""]]}
{"id":"2308.07013","submitter":"Dingheng Mo","authors":"Dingheng Mo, Fanchao Chen, Siqiang Luo, Caihua Shan","title":"Learning to Optimize LSM-trees: Towards A Reinforcement Learning based\n  Key-Value Store for Dynamic Workloads","comments":"25 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LSM-trees are widely adopted as the storage backend of key-value stores.\nHowever, optimizing the system performance under dynamic workloads has not been\nsufficiently studied or evaluated in previous work. To fill the gap, we present\nRusKey, a key-value store with the following new features: (1) RusKey is a\nfirst attempt to orchestrate LSM-tree structures online to enable robust\nperformance under the context of dynamic workloads; (2) RusKey is the first\nstudy to use Reinforcement Learning (RL) to guide LSM-tree transformations; (3)\nRusKey includes a new LSM-tree design, named FLSM-tree, for an efficient\ntransition between different compaction policies -- the bottleneck of dynamic\nkey-value stores. We justify the superiority of the new design with theoretical\nanalysis; (4) RusKey requires no prior workload knowledge for system\nadjustment, in contrast to state-of-the-art techniques. Experiments show that\nRusKey exhibits strong performance robustness in diverse workloads, achieving\nup to 4x better end-to-end performance than the RocksDB system under various\nsettings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:00:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mo","Dingheng",""],["Chen","Fanchao",""],["Luo","Siqiang",""],["Shan","Caihua",""]]}
{"id":"2308.07014","submitter":"Ching-Yi Lai","authors":"Nai-Hui Chia, Ching-Yi Lai, Han-Hsuan Lin","title":"Efficient learning of $t$-doped stabilizer states with single-copy\n  measurements","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the primary objectives in the field of quantum state learning is to\ndevelop algorithms that are time-efficient for learning states generated from\nquantum circuits. Earlier investigations have demonstrated time-efficient\nalgorithms for states generated from Clifford circuits with at most $\\log(n)$\nnon-Clifford gates. However, these algorithms necessitate multi-copy\nmeasurements, posing implementation challenges in the near term due to the\nrequisite quantum memory. On the contrary, using solely single-qubit\nmeasurements in the computational basis is insufficient in learning even the\noutput distribution of a Clifford circuit with one additional $T$ gate under\nreasonable post-quantum cryptographic assumptions. In this work, we introduce\nan efficient quantum algorithm that employs only nonadaptive single-copy\nmeasurement to learn states produced by Clifford circuits with a maximum of\n$O(\\log n)$ non-Clifford gates, filling a gap between the previous positive and\nnegative results.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:01:47 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 05:51:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chia","Nai-Hui",""],["Lai","Ching-Yi",""],["Lin","Han-Hsuan",""]]}
{"id":"2308.07015","submitter":"Josua Schott","authors":"Rafael B. Andrist, Gene Freudenburg, Gaofeng Huang, Frank\n  Kutzschebauch, Josua Schott","title":"A Criterion for the Density Property of Stein Manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalize a criterion for the density property of Stein manifolds. As an\napplication, we give a new, simple proof of the fact that the Danielewski\nsurfaces have the algebraic density property. Furthermore, we have found new\nexamples of Stein manifolds with the density property.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:03:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Andrist","Rafael B.",""],["Freudenburg","Gene",""],["Huang","Gaofeng",""],["Kutzschebauch","Frank",""],["Schott","Josua",""]]}
{"id":"2308.07016","submitter":"Tan Yuedong","authors":"Yuedong Tan","title":"HHTrack: Hyperspectral Object Tracking Using Hybrid Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hyperspectral imagery provides abundant spectral information beyond the\nvisible RGB bands, offering rich discriminative details about objects in a\nscene. Leveraging such data has the potential to enhance visual tracking\nperformance. In this paper, we propose a hyperspectral object tracker based on\nhybrid attention (HHTrack). The core of HHTrack is a hyperspectral hybrid\nattention (HHA) module that unifies feature extraction and fusion within one\ncomponent through token interactions. A hyperspectral bands fusion (HBF) module\nis also introduced to selectively aggregate spatial and spectral signatures\nfrom the full hyperspectral input. Extensive experiments demonstrate the\nstate-of-the-art performance of HHTrack on benchmark Near Infrared (NIR), Red\nNear Infrared (Red-NIR), and Visible (VIS) hyperspectral tracking datasets. Our\nwork provides new insights into harnessing the strengths of transformers and\nhyperspectral fusion to advance robust object tracking.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:04:06 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:01:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tan","Yuedong",""]]}
{"id":"2308.07017","submitter":"Lin Chieh Huang","authors":"Lin-Chieh Huang, Hung-Hsu Tsai","title":"Contrastive Bi-Projector for Unsupervised Domain Adaption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel unsupervised domain adaption (UDA) method based\non contrastive bi-projector (CBP), which can improve the existing UDA methods.\nIt is called CBPUDA here, which effectively promotes the feature extractors\n(FEs) to reduce the generation of ambiguous features for classification and\ndomain adaption. The CBP differs from traditional bi-classifier-based methods\nat that these two classifiers are replaced with two projectors of performing a\nmapping from the input feature to two distinct features. These two projectors\nand the FEs in the CBPUDA can be trained adversarially to obtain more refined\ndecision boundaries so that it can possess powerful classification performance.\nTwo properties of the proposed loss function are analyzed here. The first\nproperty is to derive an upper bound of joint prediction entropy, which is used\nto form the proposed loss function, contrastive discrepancy (CD) loss. The CD\nloss takes the advantages of the contrastive learning and the bi-classifier.\nThe second property is to analyze the gradient of the CD loss and then overcome\nthe drawback of the CD loss. The result of the second property is utilized in\nthe development of the gradient scaling (GS) scheme in this paper. The GS\nscheme can be exploited to tackle the unstable problem of the CD loss because\ntraining the CBPUDA requires using contrastive learning and adversarial\nlearning at the same time. Therefore, using the CD loss with the GS scheme\novercomes the problem mentioned above to make features more compact for\nintra-class and distinguishable for inter-class. Experimental results express\nthat the CBPUDA is superior to conventional UDA methods under consideration in\nthis paper for UDA and fine-grained UDA tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:06:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Lin-Chieh",""],["Tsai","Hung-Hsu",""]]}
{"id":"2308.07018","submitter":"Ruifeng Yuan","authors":"Ruifeng Yuan and Lei Wu","title":"An efficient topology optimization method for steady gas flows in all\n  flow regimes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An efficient topology optimization method applicable to both continuum and\nrarefied gas flows is proposed in the framework of gas-kinetic theory. The\nareas of gas and solid are marked by the material density, based on which a\nfictitious porosity model is used to reflect the effect of the solid on the gas\nand mimic the diffuse boundary condition on the gas-solid interface. The\nformula of this fictitious porosity model is modified to make the model work\nwell in all flow regimes, i.e., from the continuum to free-molecular flow\nregimes. To find the optimized material density, a gradient-based optimizer is\nadopted and the design sensitivity is obtained by the continuous adjoint\nmethod. To solve the primal kinetic equation and the corresponding adjoint\nequation, the numerical schemes efficient and accurate in all flow regimes are\nconstructed. Several airfoil optimization problems are solved to demonstrate\nthe good performance and high efficiency of the present topology optimization\nmethod, covering the flow conditions from continuum to rarefied, and from\nsubsonic to supersonic.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:06:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yuan","Ruifeng",""],["Wu","Lei",""]]}
{"id":"2308.07019","submitter":"Vahid Jannesary","authors":"Vahid Jannesary, Vahid Karimipour","title":"A simple construction of Entanglement Witnesses for arbitrary and\n  different dimensions","comments":"22 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a simple approach for generation of a diverse set of positive maps\nbetween spaces of different dimensions. The proposed method enables the\nconstruction of Entanglement Witnesses tailored for systems characterized by\n$d_1 \\times d_2$ dimensions. We also present an alternative argument for\ndirectly generating a wide range of Entanglement Witnesses in these dimensions.\nWith this method, it is possible to construct Entanglement Witnesses that\nconsist solely of a chosen set of desired measurements. We demonstrate the\neffectiveness and generality of our approach using concrete examples.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:07:21 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 10:43:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jannesary","Vahid",""],["Karimipour","Vahid",""]]}
{"id":"2308.07020","submitter":"Ratnadip Mandal","authors":"Minati De, Anil Maheshwari, and Ratnadip Mandal","title":"Online Class Cover Problem","comments":"27 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the online class cover problem where a (finite or\ninfinite) family $\\cal F$ of geometric objects and a set ${\\cal P}_r$ of red\npoints in $\\mathbb{R}^d$ are given a prior, and blue points from $\\mathbb{R}^d$\narrives one after another. Upon the arrival of a blue point, the online\nalgorithm must make an irreversible decision to cover it with objects from\n$\\cal F$ that do not cover any points of ${\\cal P}_r$. The objective of the\nproblem is to place the minimum number of objects. When $\\cal F$ consists of\nall possible translates of a square in $\\mathbb{R}^2$, we prove that the\ncompetitive ratio of any deterministic online algorithm is $\\Omega(\\log |{\\cal\nP}_r|)$. On the other hand, when the objects are all possible translates of a\nrectangle in $\\mathbb{R}^2$, we propose an $O(\\log |{\\cal P}_r|)$-competitive\ndeterministic algorithm for the problem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:08:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["De","Minati",""],["Maheshwari","Anil",""],["Mandal","Ratnadip",""]]}
{"id":"2308.07021","submitter":"Aakanksha Jain","authors":"Aakanksha Jain, Kaushal Verma","title":"Weighted Szeg\\H{o} Kernels on Planar Domains","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study properties of weighted Szeg\\H{o} and Garabedian kernels on planar\ndomains. Motivated by the unweighted case as explained in Bell's work, the\nstarting point is a weighted Kerzman-Stein formula that yields boundary\nsmoothness of the weighted Szeg\\H{o} kernel. This provides information on the\ndependence of the weighted Szeg\\H{o} kernel as a function of the weight. When\nthe weights are close to the constant function $1$ (which corresponds to the\nunweighted case), it is shown that some properties of the unweighted Szeg\\H{o}\nkernel propagate to the weighted Szeg\\H{o} kernel as well. Finally, it is shown\nthat the reduced Bergman kernel and higher order reduced Bergman kernels can be\nwritten as a rational combination of three unweighted Szeg\\H{o} kernels and\ntheir conjugates, thereby extending Bell's list of kernel functions that are\nmade up of simpler building blocks that involve the Szeg\\H{o} kernel.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:09:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jain","Aakanksha",""],["Verma","Kaushal",""]]}
{"id":"2308.07022","submitter":"Jin Li","authors":"Jin Li","title":"The Legendre transform, the Laplace transform and valuations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We first prove that the Legendre transform is the only continuous and\n$\\mathrm{SL}(n)$ contravariant valuation that behaves as a conjugation of two\nimportant translations on super-coercive, lower semi-continuous, and convex\nfunctions. Then we turn to a similar setting on log-concave functions and find\ncharacterizations of not merely the duality transform but also the Laplace\ntransform on log-concave functions. With the notion of dual valuation, we also\nobtain characterizations of the identity transform on finite convex functions\nand positive log-concave functions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:10:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Jin",""]]}
{"id":"2308.07023","submitter":"Rui Santos","authors":"Pedro Gabriel, Margarete M\\\"uhlleitner, Daniel Neacsu, Rui Santos","title":"Dark Coloured Scalars Impact on Single and Di-Higgs Production at the\n  LHC","comments":"35 pages, 19 figures","journal-ref":null,"doi":null,"report-no":"KA-TP-18-2023","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The search for Dark Matter (DM) at colliders is primarily pursued via the\ndetection of missing energy in particular final states. These searches are\nbased on the production and decay processes where final states include DM\nparticles and at least one Standard Model (SM) particle. DM will then reveal\nitself as missing energy. An alternative form to get a hint of a dark sector is\nvia loop contribution to SM processes. In this case, it is not even relevant if\nthe new particles have their origin in the dark sector of the model. In this\nwork we discuss the impact of an arbitrary number of coloured scalars in single\nHiggs and double Higgs production at the Large Hadron Collider (LHC), and we\nshow their complementarity. We determine the range of variation of the\ncorrections relative to the SM for an arbitrary number of coloured scalars $n$,\nand discuss in more detail the cases $n=1$ and $n=2$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:15:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gabriel","Pedro",""],["M\u00fchlleitner","Margarete",""],["Neacsu","Daniel",""],["Santos","Rui",""]]}
{"id":"2308.07024","submitter":"Jui-Min Hsu","authors":"Yu-Ting Li, Ching-Te Chiu, An-Ting Hsieh, Mao-Hsiu Hsu, Long Wenyong,\n  Jui-Min Hsu","title":"PGT-Net: Progressive Guided Multi-task Neural Network for Small-area Wet\n  Fingerprint Denoising and Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fingerprint recognition on mobile devices is an important method for identity\nverification. However, real fingerprints usually contain sweat and moisture\nwhich leads to poor recognition performance. In addition, for rolling out\nslimmer and thinner phones, technology companies reduce the size of recognition\nsensors by embedding them with the power button. Therefore, the limited size of\nfingerprint data also increases the difficulty of recognition. Denoising the\nsmall-area wet fingerprint images to clean ones becomes crucial to improve\nrecognition performance. In this paper, we propose an end-to-end trainable\nprogressive guided multi-task neural network (PGT-Net). The PGT-Net includes a\nshared stage and specific multi-task stages, enabling the network to train\nbinary and non-binary fingerprints sequentially. The binary information is\nregarded as guidance for output enhancement which is enriched with the ridge\nand valley details. Moreover, a novel residual scaling mechanism is introduced\nto stabilize the training process. Experiment results on the FW9395 and\nFT-lightnoised dataset provided by FocalTech shows that PGT-Net has promising\nperformance on the wet-fingerprint denoising and significantly improves the\nfingerprint recognition rate (FRR). On the FT-lightnoised dataset, the FRR of\nfingerprint recognition can be declined from 17.75% to 4.47%. On the FW9395\ndataset, the FRR of fingerprint recognition can be declined from 9.45% to\n1.09%.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:19:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Yu-Ting",""],["Chiu","Ching-Te",""],["Hsieh","An-Ting",""],["Hsu","Mao-Hsiu",""],["Wenyong","Long",""],["Hsu","Jui-Min",""]]}
{"id":"2308.07025","submitter":"Lukas Birkemeyer","authors":"Lukas Birkemeyer, Julian Fuchs, Alessio Gambi, Ina Schaefer","title":"SOTIF-Compliant Scenario Generation Using Semi-Concrete Scenarios and\n  Parameter Sampling","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":"  The SOTIF standard (ISO 21448) requires scenario-based testing to verify and\nvalidate Advanced Driver Assistance Systems and Automated Driving Systems but\ndoes not suggest any practical way to do so effectively and efficiently.\nExisting scenario generation approaches either focus on exploring or exploiting\nthe scenario space. This generally leads to test suites that cover many known\ncases but potentially miss edge cases or focused test suites that are effective\nbut also contain less diverse scenarios. To generate SOTIF-compliant test\nsuites that achieve higher coverage and find more faults, this paper proposes\nsemi-concrete scenarios and combines them with parameter sampling to adequately\nbalance scenario space exploration and exploitation. Semi-concrete scenarios\nenable combinatorial scenario generation techniques that systematically explore\nthe scenario space, while parameter sampling allows for the exploitation of\ncontinuous parameters. Our experimental results show that the proposed concept\ncan generate more effective test suites than state-of-the-art coverage-based\nsampling. Moreover, our results show that including a feedback mechanism to\ndrive parameter sampling further increases test suites' effectiveness.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:25:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Birkemeyer","Lukas",""],["Fuchs","Julian",""],["Gambi","Alessio",""],["Schaefer","Ina",""]]}
{"id":"2308.07026","submitter":"Ziqi Zhou","authors":"Ziqi Zhou, Shengshan Hu, Minghui Li, Hangtao Zhang, Yechao Zhang, Hai\n  Jin","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal\n  Contrastive Learning","comments":"This paper has been accepted by the ACM International Conference on\n  Multimedia (ACM MM '23, October 29-November 3, 2023, Ottawa, ON, Canada)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal contrastive learning aims to train a general-purpose feature\nextractor, such as CLIP, on vast amounts of raw, unlabeled paired image-text\ndata. This can greatly benefit various complex downstream tasks, including\ncross-modal image-text retrieval and image classification. Despite its\npromising prospect, the security issue of cross-modal pre-trained encoder has\nnot been fully explored yet, especially when the pre-trained encoder is\npublicly available for commercial use.\n  In this work, we propose AdvCLIP, the first attack framework for generating\ndownstream-agnostic adversarial examples based on cross-modal pre-trained\nencoders. AdvCLIP aims to construct a universal adversarial patch for a set of\nnatural images that can fool all the downstream tasks inheriting the victim\ncross-modal pre-trained encoder. To address the challenges of heterogeneity\nbetween different modalities and unknown downstream tasks, we first build a\ntopological graph structure to capture the relevant positions between target\nsamples and their neighbors. Then, we design a topology-deviation based\ngenerative adversarial network to generate a universal adversarial patch. By\nadding the patch to images, we minimize their embeddings similarity to\ndifferent modality and perturb the sample distribution in the feature space,\nachieving unviersal non-targeted attacks. Our results demonstrate the excellent\nattack performance of AdvCLIP on two types of downstream tasks across eight\ndatasets. We also tailor three popular defenses to mitigate AdvCLIP,\nhighlighting the need for new defense mechanisms to defend cross-modal\npre-trained encoders.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:29:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhou","Ziqi",""],["Hu","Shengshan",""],["Li","Minghui",""],["Zhang","Hangtao",""],["Zhang","Yechao",""],["Jin","Hai",""]]}
{"id":"2308.07027","submitter":"Liqin Ding","authors":"Liqin Ding, Jiliang Zhang and Erik G. Str\\\"om","title":"Spatial Bandwidth Asymptotic Analysis for 3D Large-Scale Antenna Array\n  Communications","comments":"15pages, 11 figures. To be published in IEEE Transactions on Wireless\n  Communications, with additional content","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we study the spatial bandwidth for line-of-sight (LOS)\nchannels with linear large-scale antenna arrays (LSAAs) in 3D space. We provide\napproximations to the spatial bandwidth at the center of the receiving array,\nof the form $C R^{-B}$, where $R$ is the radial distance, and $C$ and $B$ are\ndirectional-dependent and piecewise constant in $R$. The approximations are\nvalid in the entire radiative region, that is, for $R$ greater than a few\nwavelengths. When the length of the receiving array is small relative to $R$,\nthe product of the array length and the spatial bandwidth provides an estimate\nof the available spatial degree-of-freedom (DOF) in the channel. In a case\nstudy, we apply these approximations to the evaluation of spatial multiplexing\nregions under random orientation conditions. The goodness-of-fit of the\napproximations is demonstrated and some interesting findings about the DOF\nperformance of the channel under 3D and 2D orientation restrictions are\nobtained, e.g., that, under some conditions, it is better to constrain the\nreceiving array orientation to be uniform over the unit circle in the 2D ground\nplane rather than uniform over the 3D unit sphere.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:30:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ding","Liqin",""],["Zhang","Jiliang",""],["Str\u00f6m","Erik G.",""]]}
{"id":"2308.07028","submitter":"Quan Situ","authors":"Quan Situ","title":"Category $\\mathcal{O}$ for hybrid quantum groups and non-commutative\n  Springer resolutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a coherent model for the principal block of the category\n$\\mathcal{O}$ for hybrid quantum group at roots of unity, using the\nnon-commutative Springer resolution defined by Bezrukavnikov--Mirkovi\\'{c}.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:31:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Situ","Quan",""]]}
{"id":"2308.07029","submitter":"Hyungbin Park","authors":"Jiuk Jang and Hyungbin Park","title":"A discretization scheme for path-dependent FBSDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-fin.CP q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies a discretization scheme for solutions to forward-backward\nstochastic differential equations (FBSDEs) with path-dependent coefficients. We\nshow the convergence of the Picard-type iteration to the FBDSE solution and\nprovide its convergence rate. To the best of our knowledge, this is the first\nresult of discretization scheme for path-dependent FBSDEs. Using this result,\nwe establish a numerical method for solutions to second-order parabolic\npath-dependent partial differential equations. To achieve this, weak\napproximation of martingale representation theorem (Cont, Rama, and Yi Lu.\n``Weak approximation of martingale representations.\" Stochastic Processes and\ntheir Applications 2016) is employed. Our results generalize the scheme for\nMarkovian cases in (Bender, Christian, and Robert Denk. ``A forward scheme for\nbackward SDEs.\" Stochastic processes and their applications, 2007)\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:36:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jang","Jiuk",""],["Park","Hyungbin",""]]}
{"id":"2308.07030","submitter":"Roger Colbeck","authors":"Lewis Wooltorton and Peter Brown and Roger Colbeck","title":"Expanding bipartite Bell inequalities for maximum multi-partite\n  randomness","comments":"14+18 pages, several figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nonlocal tests on multipartite quantum correlations form the basis of\nprotocols that certify randomness in a device-independent (DI) way. Such\ncorrelations admit a rich structure, making the task of choosing an appropriate\ntest difficult. For example, extremal Bell inequalities are tight witnesses of\nnonlocality, however achieving their maximum violation places constraints on\nthe underlying quantum system, which can reduce the rate of randomness\ngeneration. As a result there is often a trade-off between maximum randomness\nand the amount of violation of a given Bell inequality. Here, we explore this\ntrade-off for more than two parties. More precisely, we study the maximum\namount of randomness that can be certified by correlations exhibiting a\nviolation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. We find\nthat maximum quantum violation and maximum randomness are incompatible for any\neven number of parties, with incompatibility diminishing as the number of\nparties grow, and conjecture the precise trade-off. We also show that maximum\nMABK violation is not necessary for maximum randomness for odd numbers of\nparties. To obtain our results, we derive new families of Bell inequalities\ncertifying maximum randomness from a technique for randomness certification,\nwhich we call \"expanding Bell inequalities\". Our technique allows one to take a\nbipartite Bell expression, known as the seed, and transform it into a\nmultipartite Bell inequality tailored for randomness certification, showing how\nintuition learned in the bipartite case can find use in more complex scenarios.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:41:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wooltorton","Lewis",""],["Brown","Peter",""],["Colbeck","Roger",""]]}
{"id":"2308.07031","submitter":"Athanasios Sourmelidis","authors":"Athanasios Sourmelidis","title":"Continuous and discrete universality of zeta-functions: Two sides of the\n  same coin?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 1975 Voronin proved the universality theorem for the Riemann zeta-function\n$\\zeta(s)$ which roughly says that any admissible function $f(s)$ is\napproximated by $\\zeta(s)$. A few years later Reich proved a discrete analogue\nof this result. The proofs of these theorems are almost identical but it is not\nknown whether one of them implies the other. We will see that if we translate\nthe question in the language of linear dynamics then there is a link which we\nexploit to obtain in a straightforward way a big variety of discrete\nuniversality results appearing in the literature.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:45:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sourmelidis","Athanasios",""]]}
{"id":"2308.07032","submitter":"Zeke Xie","authors":"Zeke Xie, Xindi Yang, Yujie Yang, Qi Sun, Yixiang Jiang, Haoran Wang,\n  Yunfeng Cai, Mingming Sun","title":"S3IM: Stochastic Structural SIMilarity and Its Unreasonable\n  Effectiveness for Neural Fields","comments":"ICCV 2023 main conference. Code: https://github.com/Madaoer/S3IM. 14\n  pages, 5 figures, 17 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Neural Radiance Field (NeRF) has shown great success in rendering\nnovel-view images of a given scene by learning an implicit representation with\nonly posed RGB images. NeRF and relevant neural field methods (e.g., neural\nsurface representation) typically optimize a point-wise loss and make\npoint-wise predictions, where one data point corresponds to one pixel.\nUnfortunately, this line of research failed to use the collective supervision\nof distant pixels, although it is known that pixels in an image or scene can\nprovide rich structural information. To the best of our knowledge, we are the\nfirst to design a nonlocal multiplex training paradigm for NeRF and relevant\nneural field methods via a novel Stochastic Structural SIMilarity (S3IM) loss\nthat processes multiple data points as a whole set instead of process multiple\ninputs independently. Our extensive experiments demonstrate the unreasonable\neffectiveness of S3IM in improving NeRF and neural surface representation for\nnearly free. The improvements of quality metrics can be particularly\nsignificant for those relatively difficult tasks: e.g., the test MSE loss\nunexpectedly drops by more than 90% for TensoRF and DVGO over eight novel view\nsynthesis tasks; a 198% F-score gain and a 64% Chamfer $L_{1}$ distance\nreduction for NeuS over eight surface reconstruction tasks. Moreover, S3IM is\nconsistently robust even with sparse inputs, corrupted images, and dynamic\nscenes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:45:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xie","Zeke",""],["Yang","Xindi",""],["Yang","Yujie",""],["Sun","Qi",""],["Jiang","Yixiang",""],["Wang","Haoran",""],["Cai","Yunfeng",""],["Sun","Mingming",""]]}
{"id":"2308.07033","submitter":"Ipsita Ray","authors":"Rusa Mandal, Soumitra Nandi, Ipsita Ray","title":"Constraining inverse moment of $B$-meson distribution amplitude using\n  Lattice QCD data","comments":"15 pages, 9 tables, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We constrain the inverse moment of the $B$-meson light-cone distribution\namplitude (LCDA), $\\lambda_B$ in heavy quark effective theory, using form\nfactor estimates from Lattice QCD collaboration. The estimation of the\nparameter $\\lambda_B$ has, until now, relied solely on QCD sum rule methods and\ndeals with significant uncertainty. In this work, we express the form factors\nfor the $B \\to K$ channel, calculated within the light-cone sum rule (LCSR)\napproach, in terms of the $B$-meson LCDAs. By incorporating recent Lattice\nresults from the HPQCD collaboration for the $B \\to K$ form factors at zero\nmomentum transfer ($q^2$ = 0), we impose constraints on this parameter.\nConsequently, we achieve a twofold reduction in uncertainty compared to the QCD\nsum rule estimate, yielding $\\lambda_B=338\\pm 68$ MeV, when the $B$-meson LCDAs\nare expressed in the Exponential model. Additionally, we compare the form\nfactor predictions, using the constrained $\\lambda_B$ value, with the earlier\nanalyses for other channels as well, such as $B\\to \\pi$ and $B \\to D$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:48:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mandal","Rusa",""],["Nandi","Soumitra",""],["Ray","Ipsita",""]]}
{"id":"2308.07034","submitter":"Ibrahim Alsolami","authors":"Ibrahim Alsolami and Tomoki Fukai","title":"An Inherent Trade-Off in Noisy Neural Communication with Rank-Order\n  Coding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rank-order coding, a form of temporal coding, has emerged as a promising\nscheme to explain the rapid ability of the mammalian brain. Owing to its speed\nas well as efficiency, rank-order coding is increasingly gaining interest in\ndiverse research areas beyond neuroscience. However, much uncertainty still\nexists about the performance of rank-order coding under noise. Herein we show\nwhat information rates are fundamentally possible and what trade-offs are at\nstake. An unexpected finding in this paper is the emergence of a special class\nof errors that, in a regime, increase with less noise.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:53:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Alsolami","Ibrahim",""],["Fukai","Tomoki",""]]}
{"id":"2308.07035","submitter":"Shikhar Nilabh","authors":"Shikhar Nilabh and Fidel Grandia","title":"Role of the clay lenses within sandy aquifers in the migration pathway\n  of infiltrating DNAPL plume: A numerical investigation","comments":null,"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 use of numerical based multi-phase fluid flow simulation can\nsignificantly aid in the development of an effective remediation strategy for\ngroundwater systems contaminated with Dense Non Aqueous Phase Liquid (DNAPL).\nIncorporating the lithological heterogeneities of the aquifer into the model\ndomain is a crucial aspect in the development of robust numerical simulators.\nPrevious research studies have attempted to incorporate lithological\nheterogeneities into the domain; however, most of these numerical simulators\nare based on Finite Volume Method (FVM) and Finite Difference Method (FDM)\nwhich have limited applicability in the field-scale aquifers. Finite Element\nMethod (FEM) can be highly useful in developing the field-scale simulation of\nDNAPL infiltration due to its consistent accuracy on irregular study domain,\nand the availability of higher orders of basis functions.\n  In this research work, FEM based model has been developed to simulate the\nDNAPL infiltration in a hypothetical field-scale aquifer. The model results\ndemonstrate the effect of meso-scale heterogeneities, specifically clay lenses,\non the migration and accumulation of Dense Non Aqueous Phase Liquid (DNAPL)\nwithin the aquifer. Furthermore, this research provides valuable insights for\nthe development of an appropriate remediation strategy for a general\ncontaminated aquifer.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:54:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nilabh","Shikhar",""],["Grandia","Fidel",""]]}
{"id":"2308.07036","submitter":"Nazma Husain","authors":"Nazma Husain, Akash Garg, Ranjeev Misra, Somasri Sen","title":"Investigating the Energy-Dependent Temporal Nature of Black Hole Binary\n  System H 1743-322","comments":"6 Figures, 3 Tables, Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Black hole X-ray binaries routinely exhibit Quasi Periodic Oscillations\n(QPOs) in their Power density spectrum. Studies of QPOs have demonstrated\nimmense ability to understand these dynamical systems although their\nunambiguous origin still remains a challenge. We investigate the\nenergy-dependent properties of the Type-C QPOs detected for H 1743-322 as\nobserved with AstroSat in its two X-ray outbursts of 2016 and 2017. The\ncombined broadband LAXPC and SXT spectrum is well modelled with a soft thermal\nand a hard Comptonization component. The QPO exhibits soft/negative lags i.e.\nvariation in soft band lags the variation in hard band, although the upper\nharmonic shows opposite behaviour i.e. hard/positive lags. Here, we model\nenergy-dependent properties (fractional root mean square and time-lag variation\nwith energy) of the QPO and its upper harmonic individually with a general\nscheme that fits these properties by utilizing the spectral information and\nconsequently allows to identify the radiative component responsible for\nproducing the variability. Considering the truncated disk picture of accretion\nflow, a simple model with variation in inner disk temperature, heating rate and\nfractional scattering with time delays is able to describe the fractional RMS\nand time-lag spectra. In this work, we show that this technique can\nsuccessfully describe the energy-dependent features and identify the spectral\nparameters generating the variability.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:55:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Husain","Nazma",""],["Garg","Akash",""],["Misra","Ranjeev",""],["Sen","Somasri",""]]}
{"id":"2308.07037","submitter":"Alex Graves","authors":"Alex Graves, Rupesh Kumar Srivastava, Timothy Atkinson, Faustino Gomez","title":"Bayesian Flow 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":"  This paper introduces Bayesian Flow Networks (BFNs), a new class of\ngenerative model in which the parameters of a set of independent distributions\nare modified with Bayesian inference in the light of noisy data samples, then\npassed as input to a neural network that outputs a second, interdependent\ndistribution. Starting from a simple prior and iteratively updating the two\ndistributions yields a generative procedure similar to the reverse process of\ndiffusion models; however it is conceptually simpler in that no forward process\nis required. Discrete and continuous-time loss functions are derived for\ncontinuous, discretised and discrete data, along with sample generation\nprocedures. Notably, the network inputs for discrete data lie on the\nprobability simplex, and are therefore natively differentiable, paving the way\nfor gradient-based sample guidance and few-step generation in discrete domains\nsuch as language modelling. The loss function directly optimises data\ncompression and places no restrictions on the network architecture. In our\nexperiments BFNs achieve competitive log-likelihoods for image modelling on\ndynamically binarized MNIST and CIFAR-10, and outperform all known discrete\ndiffusion models on the text8 character-level language modelling task.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:56:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Graves","Alex",""],["Srivastava","Rupesh Kumar",""],["Atkinson","Timothy",""],["Gomez","Faustino",""]]}
{"id":"2308.07038","submitter":"Pawe{\\l}  Bor\\'owka","authors":"Pawe{\\l} Borowka and Anatoli Shatsila","title":"Hyperelliptic genus 3 curves with involutions and a Prym map","comments":"14 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterise genus 3 complex smooth hyperelliptic curves that contain two\nadditional involutions as curves that can be build from five points in\n$\\mathbb{P}^1$ with a distinguished triple. We are able to write down explicit\nequations for the curves and all their quotient curves. We show that, fixing\none of the elliptic quotient curve, the Prym map becomes a 2:1 map and\ntherefore the hyperelliptic Klein Prym map, constructed recently by the first\nauthor with A. Ortega, is also 2:1 in this case. As a by-product we show an\nexplicit family of $(1, d)$ polarised abelian surfaces (for d > 1), such that\nany surface in the family satisfying a certain explicit condition is abstractly\nnon-isomorphic to its dual abelian surface.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:57:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Borowka","Pawe\u0142",""],["Shatsila","Anatoli",""]]}
{"id":"2308.07039","submitter":"Amy Nelson","authors":"Amy PK Nelson, Joe Mole, Guilherme Pombo, Robert J Gray, James K\n  Ruffle, Edgar Chan, Geraint E Rees, Lisa Cipolotti, Parashkev Nachev","title":"The minimal computational substrate of fluid intelligence","comments":"26 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The quantification of cognitive powers rests on identifying a behavioural\ntask that depends on them. Such dependence cannot be assured, for the powers a\ntask invokes cannot be experimentally controlled or constrained a priori,\nresulting in unknown vulnerability to failure of specificity and\ngeneralisability. Evaluating a compact version of Raven's Advanced Progressive\nMatrices (RAPM), a widely used clinical test of fluid intelligence, we show\nthat LaMa, a self-supervised artificial neural network trained solely on the\ncompletion of partially masked images of natural environmental scenes, achieves\nhuman-level test scores a prima vista, without any task-specific inductive bias\nor training. Compared with cohorts of healthy and focally lesioned\nparticipants, LaMa exhibits human-like variation with item difficulty, and\nproduces errors characteristic of right frontal lobe damage under degradation\nof its ability to integrate global spatial patterns. LaMa's narrow training and\nlimited capacity -- comparable to the nervous system of the fruit fly --\nsuggest RAPM may be open to computationally simple solutions that need not\nnecessarily invoke abstract reasoning.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:02:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nelson","Amy PK",""],["Mole","Joe",""],["Pombo","Guilherme",""],["Gray","Robert J",""],["Ruffle","James K",""],["Chan","Edgar",""],["Rees","Geraint E",""],["Cipolotti","Lisa",""],["Nachev","Parashkev",""]]}
{"id":"2308.07040","submitter":"Matthias Waidele","authors":"M. Waidele and Junwei Zhao","title":"Observed Power and Frequency Variations of Solar Rossby Waves with Solar\n  Cycles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Several recent studies utilizing different helioseismic methods have\nconfirmed the presence of large-scale vorticity waves known as solar Rossby\nwaves within the Sun. Rossby waves are distinct from acoustic waves, typically\nwith longer periods and lifetimes; and their general properties, even if only\nmeasured at the surface, may be used to infer properties of the deeper\nconvection zone, such as the turbulent viscosity and entropy gradients which\nare otherwise difficult to observe. In this study, we utilize $12~$years of\ninverted subsurface velocity fields derived from the SDO/HMI's time--distance\nand ring-diagram pipelines to investigate the propoerty of the solar equatorial\nRossby waves. By covering the maximum and the decline phases of Solar Cycle 24,\nthese datasets enable a systematic analysis of any potential cycle dependence\nof these waves. Our analysis provides evidence of a correlation between the\naverage power of equatorial Rossby waves and the solar cycle, with stronger\nRossby waves during the solar maximum and weaker waves during the minimum. Our\nresult also shows that the frequency of the Rossby waves is lower during the\nmagnetic active years, implying a larger retrograde drift relative to the solar\nrotation. Although the underlying mechanism that enhances the Rossby wave power\nand lowers its frequency during the cycle maximum is not immediately known,\nthis observation has the potential to provide new insights into the interaction\nof large-scale flows with the solar cycle.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:03:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Waidele","M.",""],["Zhao","Junwei",""]]}
{"id":"2308.07041","submitter":"Marco Henriques Pereira","authors":"Matthias Hafner, Marco Henriques Pereira, Helmut Dietl, Juan Beccuti","title":"The four types of stablecoins: A comparative analysis","comments":null,"journal-ref":null,"doi":null,"report-no":"ChainScience/2023/6","categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stablecoins have gained significant popularity recently, with their market\ncap rising to over $180 billion. However, recent events have raised concerns\nabout their stability. In this paper, we classify stablecoins into four types\nbased on the source and management of collateral and investigate the stability\nof each type under different conditions. We highlight each type's potential\ninstabilities and underlying tradeoffs using agent-based simulations. The\nresults emphasize the importance of carefully evaluating the origin of a\nstablecoin's collateral and its collateral management mechanism to ensure\nstability and minimize risks. Enhanced understanding of stablecoins should be\ninformative to regulators, policymakers, and investors alike.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:03:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hafner","Matthias",""],["Pereira","Marco Henriques",""],["Dietl","Helmut",""],["Beccuti","Juan",""]]}
{"id":"2308.07042","submitter":"Balazs Pozsgay","authors":"Bal\\'azs Pozsgay and Ian M. Wanless","title":"Tensor network decompositions for absolutely maximally entangled states","comments":"21 pages","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":"  Absolutely maximally entangled (AME) states of $k$ qudits (also known as\nperfect tensors) are quantum states that have maximal entanglement for all\npossible bipartitions of the sites/parties. We consider the problem of whether\nsuch states can be decomposed into a tensor network with a small number of\ntensors, such that all physical and all auxiliary spaces have the same\ndimension $D$. We find that certain AME states with $k=6$ can be decomposed\ninto a network with only three 4-leg tensors; we provide concrete solutions for\nlocal dimension $D=5$ and higher. Our result implies that certain AME states\nwith six parties can be created with only three two-site unitaries from a\nproduct state of three Bell pairs, or equivalently, with six two-site unitaries\nacting on a product state on six qudits. We also consider the problem for\n$k=8$, where we find similar tensor network decompositions with six 4-leg\ntensors.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:05:01 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pozsgay","Bal\u00e1zs",""],["Wanless","Ian M.",""]]}
{"id":"2308.07043","submitter":"Senthil Kumar Chidambaram Dr.","authors":"R. Radha and C. Senthil Kumar","title":"Comment on `Painlev\\'e Integrability and Multi-wave pattern for (2+1)\n  dimensional Long wave-Short wave Resonance Interaction system'","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the paper by Sivatharani et al [1], the authors make a tall claim about\nthe integrability of a 2 component (2+1) dimensional Long wave Short wave\nResonance Interaction (2C(2+1)LSRI) equation with mixed sign which was already\nclaimed to be non integrable and hence known not to satisfy Painlev\\'e [2]\nproperty which the authors show to pass Painlev\\'e test. We have categorically\nshown how the system does not pass Painlev\\'e test and hence non-integrable\nreinforcing the claim made by Maruno et al [2]. The authors claim to derive the\nsolutions of 2C(2+1)LSRI equation which ironically do not satisfy the equation.\nTo top it all, the authors claim to have generated lumps and dromions which\nagain defy their very own definition.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:08:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Radha","R.",""],["Kumar","C. Senthil",""]]}
{"id":"2308.07044","submitter":"Fabian Sch\\\"ussler","authors":"Fabian Sch\\\"ussler, Mathieu de Bony de Lavergne, Atilla Kaan Alkan,\n  Jayson Mourier, Patrick Reichherzer","title":"Astro-COLIBRI: An Advanced Platform for Real-Time Multi-Messenger\n  Astrophysics","comments":"Proceedings 38th International Cosmic Ray Conference (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.1469","report-no":"PoS(ICRC2023)1469","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observations of transient phenomena like Gamma-Ray Bursts (GRBs), Fast Radio\nBursts (FRBs), stellar flares and explosions (novae and supernovae), combined\nwith the detection of novel cosmic messengers like high-energy neutrinos and\ngravitational waves has revolutionized astrophysics over the last years. The\ndiscovery potential of both ulti-messenger and multi-wavelength follow-up\nobservations as well as serendipitous observations could be maximized with a\nnovel tool which allows for quickly acquiring an overview over relevant\ninformation associated with each new detection. Here we present Astro-COLIBRI,\na novel and comprehensive platform for this challenge.\n  Astro-COLIBRI's architecture comprises a public RESTful API, real-time\ndatabases, a cloud-based alert system and a website as well as apps for iOS and\nAndroid as clients for users. Astro-COLIBRI evaluates incoming messages of\nastronomical observations from all available alert streams in real time,\nfilters them by user specified criteria and puts them into their MWL and MM\ncontext. The clients provide a graphical representation with an easy to grasp\nsummary of the relevant data to allow for the fast identification of\ninteresting phenomena, provides an assessment of observing conditions at a\nlarge selection of observatories around the world, and much more.\n  Here the key features of Astro-COLIBRI are presented. We outline the\narchitecture, summarize the used data resources, and provide examples for\napplications and use cases. Focussing on the high-energy domain, we'll discuss\nthe use of the platform in searches for high-energy gamma-ray counterparts to\nhigh-energy neutrinos, gamma-ray bursts and gravitational waves.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:08:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sch\u00fcssler","Fabian",""],["de Lavergne","Mathieu de Bony",""],["Alkan","Atilla Kaan",""],["Mourier","Jayson",""],["Reichherzer","Patrick",""]]}
{"id":"2308.07045","submitter":"James Dalby","authors":"James Luke Dalby, Apala Majumdar, Yue Wu, Asha Kisan Dond","title":"Stochastic effects on solution landscapes for nematic liquid crystals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the effects of additive and multiplicative noise on the solution\nlandscape of nematic liquid crystals confined to a square domain within the\nLandau-de Gennes framework, as well as the impact of additive noise on the\nsymmetric radial hedgehog solution for nematic droplets. The introduction of\nrandom noise can be used to capture material uncertainties and imperfections,\nwhich are always present in physical systems. We implement random noise in our\nframework by introducing a Q-Wiener stochastic process to the governing\ndifferential equations. On the square, the solution landscape for the\ndeterministic problem is well understood, enabling us to compare and contrast\nthe deterministic predictions and the stochastic predictions, while we\ndemonstrate that the symmetry of the radial hedgehog solution can be violated\nby noise. This approach of introducing noise to deterministic equations can be\nused to test the robustness and validity of predictions from deterministic\nliquid crystal models, which essentially capture idealised situations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:12:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Dalby","James Luke",""],["Majumdar","Apala",""],["Wu","Yue",""],["Dond","Asha Kisan",""]]}
{"id":"2308.07046","submitter":"Evangelos Achilleas Paraskevas","authors":"Evangelos A. Paraskevas and Leandros Perivolaropoulos","title":"The density of virialized clusters as a probe of dark energy","comments":"13 pages, 8 figures, proof of equation (3) added, references added.\n  The Mathematica v12 numerical analysis files can be found to\n  https://github.com/vaggelis01/Density-of-Virialized-Clusters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the spherical collapse model to demonstrate that the observable\naverage density of virialized clusters depends on the properties of dark energy\nalong with the properties of gravity on cluster scales and can therefore be\nused as a probe of these properties. As an application of this approach we\nderive the predicted virialized densities and radii of cluster mass structures\nfor a wide range of values of the cosmological constant (including negative\nvalues) as a function of the turnaround redshift. For the value of\n$\\Omega_{\\Lambda,0}=-0.7$ (with $\\Omega_{m,0}=0.3$) preferred by $\\Lambda$\nsign-switching models ($\\Lambda_s\\text{CDM}$) proposed for the resolution of\nthe Hubble and $S_8$ tensions, we find an amplification of the density of\nvirialized clusters which can be as large as $80\\%$ compared to \\plcdm for a\nturnaround redshift $z_{\\text{max}} \\gtrsim 2$. Such an amplification may lead\nto more efficient early galaxy formation in this class of models in accordance\nwith the recent findings of JWST.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:15:32 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 11:05:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Paraskevas","Evangelos A.",""],["Perivolaropoulos","Leandros",""]]}
{"id":"2308.07047","submitter":"Xiang Li","authors":"Xiang Li and Songcan Chen","title":"No Regularization is Needed: An Efficient and Effective Model for\n  Incomplete Label Distribution Learning","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Label Distribution Learning (LDL) assigns soft labels, a.k.a. degrees, to a\nsample. In reality, it is always laborious to obtain complete degrees, giving\nbirth to the Incomplete LDL (InLDL). However, InLDL often suffers from\nperformance degeneration. To remedy it, existing methods need one or more\nexplicit regularizations, leading to burdensome parameter tuning and extra\ncomputation. We argue that label distribution itself may provide useful prior,\nwhen used appropriately, the InLDL problem can be solved without any explicit\nregularization. In this paper, we offer a rational alternative to use such a\nprior. Our intuition is that large degrees are likely to get more concern, the\nsmall ones are easily overlooked, whereas the missing degrees are completely\nneglected in InLDL. To learn an accurate label distribution, it is crucial not\nto ignore the small observed degrees but to give them properly large weights,\nwhile gradually increasing the weights of the missing degrees. To this end, we\nfirst define a weighted empirical risk and derive upper bounds between the\nexpected risk and the weighted empirical risk, which reveals in principle that\nweighting plays an implicit regularization role. Then, by using the prior of\ndegrees, we design a weighted scheme and verify its effectiveness. To sum up,\nour model has four advantages, it is 1) model selection free, as no explicit\nregularization is imposed; 2) with closed form solution (sub-problem) and\neasy-to-implement (a few lines of codes); 3) with linear computational\ncomplexity in the number of samples, thus scalable to large datasets; 4)\ncompetitive with state-of-the-arts even without any explicit regularization.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:16:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Xiang",""],["Chen","Songcan",""]]}
{"id":"2308.07048","submitter":"Lei Pan","authors":"Lei Pan and Von-Wun Soo","title":"UIPC-MF: User-Item Prototype Connection Matrix Factorization for\n  Explainable Collaborative Filtering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommending items to potentially interested users has been an important\ncommercial task that faces two main challenges: accuracy and explainability.\nWhile most collaborative filtering models rely on statistical computations on a\nlarge scale of interaction data between users and items and can achieve high\nperformance, they often lack clear explanatory power. We propose UIPC-MF, a\nprototype-based matrix factorization method for explainable collaborative\nfiltering recommendations. In UIPC-MF, both users and items are associated with\nsets of prototypes, capturing general collaborative attributes. To enhance\nexplainability, UIPC-MF learns connection weights that reflect the associative\nrelations between user and item prototypes for recommendations. UIPC-MF\noutperforms other prototype-based baseline methods in terms of Hit Ratio and\nNormalized Discounted Cumulative Gain on three datasets, while also providing\nbetter transparency.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:18:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pan","Lei",""],["Soo","Von-Wun",""]]}
{"id":"2308.07049","submitter":"Henry Tsz-King Wong","authors":"M.K. Singh, H.B. Li, H.T. Wong, V. Sharma, and L. Singh","title":"Projections of Discovery Potentials from Expected Background","comments":"13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.data-an","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Background with certain uncertainties are usually known in searches of novel\nphenomena prior to the experiments are conducted at their design stage. We\nquantitatively study the projected sensitivities in terms of discovery\npotentials. These are essential for the optimizations of the experimental\nspecifications as well as of the cost-effectiveness in various investment.\nSensitivities in counting analysis are derived with complete Poisson statistics\nand its continuous approximation, and are compared with those using maximum\nlikelihood analysis in which additional measurables are included as signatures.\nThe roles and effects due to uncertainties in the background estimates are\nstudied. Two expected features to establish positive effects are verified and\nquantified: (i) In counting-only experiments, the required signal strength can\nbe derived with complete Poisson analysis, and the continuous approximation\nwould underestimate the results. (ii) Incorporating continuous variables as\nadditional constraints would reduce the required signal strength relative to\nthat of counting-only analysis. The formulations are applied to the case on the\nexperimental searches of neutrinoless double beta decay in which both ambient\nand two-neutrino background are considered.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:18:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Singh","M. K.",""],["Li","H. B.",""],["Wong","H. T.",""],["Sharma","V.",""],["Singh","L.",""]]}
{"id":"2308.07050","submitter":"Fabio Poiesi","authors":"Runyu Jiao, Yi Wan, Fabio Poiesi, Yiming Wang","title":"Survey on video anomaly detection in dynamic scenes with moving cameras","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increasing popularity of compact and inexpensive cameras, e.g.~dash\ncameras, body cameras, and cameras equipped on robots, has sparked a growing\ninterest in detecting anomalies within dynamic scenes recorded by moving\ncameras. However, existing reviews primarily concentrate on Video Anomaly\nDetection (VAD) methods assuming static cameras. The VAD literature with moving\ncameras remains fragmented, lacking comprehensive reviews to date. To address\nthis gap, we endeavor to present the first comprehensive survey on Moving\nCamera Video Anomaly Detection (MC-VAD). We delve into the research papers\nrelated to MC-VAD, critically assessing their limitations and highlighting\nassociated challenges. Our exploration encompasses three application domains:\nsecurity, urban transportation, and marine environments, which in turn cover\nsix specific tasks. We compile an extensive list of 25 publicly-available\ndatasets spanning four distinct environments: underwater, water surface,\nground, and aerial. We summarize the types of anomalies these datasets\ncorrespond to or contain, and present five main categories of approaches for\ndetecting such anomalies. Lastly, we identify future research directions and\ndiscuss novel contributions that could advance the field of MC-VAD. With this\nsurvey, we aim to offer a valuable reference for researchers and practitioners\nstriving to develop and advance state-of-the-art MC-VAD methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:21:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiao","Runyu",""],["Wan","Yi",""],["Poiesi","Fabio",""],["Wang","Yiming",""]]}
{"id":"2308.07051","submitter":"Saif Jabari","authors":"Bilal Thonnam Thodi and Sai Venkata Ramana Ambadipudi and Saif Eddin\n  Jabari","title":"Fourier neural operator for learning solutions to macroscopic traffic\n  flow models: Application to the forward and inverse problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning methods are emerging as popular computational tools for solving\nforward and inverse problems in traffic flow. In this paper, we study a neural\noperator framework for learning solutions to nonlinear hyperbolic partial\ndifferential equations with applications in macroscopic traffic flow models. In\nthis framework, an operator is trained to map heterogeneous and sparse traffic\ninput data to the complete macroscopic traffic state in a supervised learning\nsetting. We chose a physics-informed Fourier neural operator ($\\pi$-FNO) as the\noperator, where an additional physics loss based on a discrete conservation law\nregularizes the problem during training to improve the shock predictions. We\nalso propose to use training data generated from random piecewise constant\ninput data to systematically capture the shock and rarefied solutions. From\nexperiments using the LWR traffic flow model, we found superior accuracy in\npredicting the density dynamics of a ring-road network and urban signalized\nroad. We also found that the operator can be trained using simple traffic\ndensity dynamics, e.g., consisting of $2-3$ vehicle queues and $1-2$ traffic\nsignal cycles, and it can predict density dynamics for heterogeneous vehicle\nqueue distributions and multiple traffic signal cycles $(\\geq 2)$ with an\nacceptable error. The extrapolation error grew sub-linearly with input\ncomplexity for a proper choice of the model architecture and training data.\nAdding a physics regularizer aided in learning long-term traffic density\ndynamics, especially for problems with periodic boundary data.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:22:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Thodi","Bilal Thonnam",""],["Ambadipudi","Sai Venkata Ramana",""],["Jabari","Saif Eddin",""]]}
{"id":"2308.07052","submitter":"Hrishabh Tiwari","authors":"Hrishabh Tiwari, Jatin Moolchandani, Shamla Mantri","title":"Diagnosis of Scalp Disorders using Machine Learning and Deep Learning\n  Approach -- A Review","comments":null,"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":"  The morbidity of scalp diseases is minuscule compared to other diseases, but\nthe impact on the patient's life is enormous. It is common for people to\nexperience scalp problems that include Dandruff, Psoriasis, Tinea-Capitis,\nAlopecia and Atopic-Dermatitis. In accordance with WHO research, approximately\n70% of adults have problems with their scalp. It has been demonstrated in\ndescriptive research that hair quality is impaired by impaired scalp, but these\nimpacts are reversible with early diagnosis and treatment. Deep Learning\nadvances have demonstrated the effectiveness of CNN paired with FCN in\ndiagnosing scalp and skin disorders. In one proposed Deep-Learning-based scalp\ninspection and diagnosis system, an imaging microscope and a trained model are\ncombined with an app that classifies scalp disorders accurately with an average\nprecision of 97.41%- 99.09%. Another research dealt with classifying the\nPsoriasis using the CNN with an accuracy of 82.9%. As part of another study, an\nML based algorithm was also employed. It accurately classified the healthy\nscalp and alopecia areata with 91.4% and 88.9% accuracy with SVM and KNN\nalgorithms. Using deep learning models to diagnose scalp related diseases has\nimproved due to advancements i computation capabilities and computer vision,\nbut there remains a wide horizon for further improvements.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:23:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tiwari","Hrishabh",""],["Moolchandani","Jatin",""],["Mantri","Shamla",""]]}
{"id":"2308.07053","submitter":"Bastian Lampe","authors":"Bastian Lampe, Lennart Reiher, Lukas Zanger, Timo Woopen, Raphael van\n  Kempen, Lutz Eckstein","title":"RobotKube: Orchestrating Large-Scale Cooperative Multi-Robot Systems\n  with Kubernetes and ROS","comments":"7 pages, 2 figures, 2 tables; Accepted to be published as part of the\n  26th IEEE International Conference on Intelligent Transportation Systems\n  (ITSC), Bilbao, Spain, September 24-28, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.DC cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Modern cyber-physical systems (CPS) such as Cooperative Intelligent Transport\nSystems (C-ITS) are increasingly defined by the software which operates these\nsystems. In practice, microservice architectures can be employed, which may\nconsist of containerized microservices running in a cluster comprised of robots\nand supporting infrastructure. These microservices need to be orchestrated\ndynamically according to ever changing requirements posed at the system.\nAdditionally, these systems are embedded in DevOps processes aiming at\ncontinually updating and upgrading both the capabilities of CPS components and\nof the system as a whole. In this paper, we present RobotKube, an approach to\norchestrating containerized microservices for large-scale cooperative\nmulti-robot CPS based on Kubernetes. We describe how to automate the\norchestration of software across a CPS, and include the possibility to monitor\nand selectively store relevant accruing data. In this context, we present two\nmain components of such a system: an event detector capable of, e.g.,\nrequesting the deployment of additional applications, and an application\nmanager capable of automatically configuring the required changes in the\nKubernetes cluster. By combining the widely adopted Kubernetes platform with\nthe Robot Operating System (ROS), we enable the use of standard tools and\npractices for developing, deploying, scaling, and monitoring microservices in\nC-ITS. We demonstrate and evaluate RobotKube in an exemplary and reproducible\nuse case that we make publicly available at\nhttps://github.com/ika-rwth-aachen/robotkube .\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:27:20 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lampe","Bastian",""],["Reiher","Lennart",""],["Zanger","Lukas",""],["Woopen","Timo",""],["van Kempen","Raphael",""],["Eckstein","Lutz",""]]}
{"id":"2308.07054","submitter":"James Price","authors":"James Price, Colm Connaughton","title":"Distinguishing Risk Preferences using Repeated Gambles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sequences of repeated gambles provide an experimental tool to characterize\nthe risk preferences of humans or artificial decision-making agents. The\ndifficulty of this inference depends on factors including the details of the\ngambles offered and the number of iterations of the game played. In this paper\nwe explore in detail the practical challenges of inferring risk preferences\nfrom the observed choices of artificial agents who are presented with finite\nsequences of repeated gambles. We are motivated by the fact that the strategy\nto maximize long-run wealth for sequences of repeated additive gambles (where\ngains and losses are independent of current wealth) is different to the\nstrategy for repeated multiplicative gambles (where gains and losses are\nproportional to current wealth.) Accurate measurement of risk preferences would\nbe needed to tell whether an agent is employing the optimal strategy or not. To\ngeneralize the types of gambles our agents face we use the Yeo-Johnson\ntransformation, a tool borrowed from feature engineering for time series\nanalysis, to construct a family of gambles that interpolates smoothly between\nthe additive and multiplicative cases. We then analyze the optimal strategy for\nthis family, both analytically and numerically. We find that it becomes\nincreasingly difficult to distinguish the risk preferences of agents as their\nwealth increases. This is because agents with different risk preferences\neventually make the same decisions for sufficiently high wealth. We believe\nthat these findings are informative for the effective design of experiments to\nmeasure risk preferences in humans.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:27:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Price","James",""],["Connaughton","Colm",""]]}
{"id":"2308.07055","submitter":"Evgeny Panov","authors":"Evgeny Yu. Panov","title":"On solutions of an ill-posed Stefan problem","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study multi-phase Stefan problem with increasing Riemann initial data and\nwith generally negative latent specific heats for the phase transitions. We\npropose the variational formulation of self-similar solutions, which allows to\nfind precise conditions for existence and uniqueness of the solution.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:28:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Panov","Evgeny Yu.",""]]}
{"id":"2308.07056","submitter":"Yuke Lin","authors":"Yuke Lin, Xiaoyi Qin, Ming Cheng, Ning Jiang, Guoqing Zhao, Ming Li","title":"VoxBlink: X-Large Speaker Verification Dataset on Camera","comments":"submit to ICASSP2024","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.MM cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we contribute a novel and extensive dataset for speaker\nverification, which contains noisy 38k identities/1.45M utterances (VoxBlink)\nand relatively cleaned 18k identities/1.02M (VoxBlink-Clean) utterances for\ntraining. Firstly, we accumulate a 60K+ users' list with their avatars and\ndownload their short videos on YouTube. We then established an automatic and\nscalable pipeline to extract relevant speech and video segments from these\nvideos. To our knowledge, the VoxBlink dataset is one of the largest speaker\nrecognition datasets available. Secondly, we conduct a series of experiments\nbased on different backbones trained on a mix of the VoxCeleb2 and the\nVoxBlink-Clean. Our findings highlight a notable performance improvement,\nranging from 13% to 30%, across different backbone architectures upon\nintegrating our dataset for training. The dataset will be made publicly\navailable shortly.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:31:29 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 01:58:26 GMT"},{"version":"v3","created":"Sun, 20 Aug 2023 14:39:06 GMT"},{"version":"v4","created":"Wed, 23 Aug 2023 06:39:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lin","Yuke",""],["Qin","Xiaoyi",""],["Cheng","Ming",""],["Jiang","Ning",""],["Zhao","Guoqing",""],["Li","Ming",""]]}
{"id":"2308.07057","submitter":"Andreas Happe","authors":"Andreas Happe, J\\\"urgen Cito","title":"Understanding Hackers' Work: An Empirical Study of Offensive Security\n  Practitioners","comments":null,"journal-ref":null,"doi":"10.1145/3611643.3613900","report-no":null,"categories":"cs.SE cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Offensive security-tests are a common way to pro-actively discover potential\nvulnerabilities. They are performed by specialists, often called\npenetration-testers or white-hat hackers. The chronic lack of available\nwhite-hat hackers prevents sufficient security test coverage of software.\nResearch into automation tries to alleviate this problem by improving the\nefficiency of security testing. To achieve this, researchers and tool builders\nneed a solid understanding of how hackers work, their assumptions, and pain\npoints.\n  In this paper, we present a first data-driven exploratory qualitative study\nof twelve security professionals, their work and problems occurring therein. We\nperform a thematic analysis to gain insights into the execution of security\nassignments, hackers' thought processes and encountered challenges.\n  This analysis allows us to conclude with recommendations for researchers and\ntool builders to increase the efficiency of their automation and identify novel\nareas for research.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:35:26 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 16:36:52 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 11:24:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Happe","Andreas",""],["Cito","J\u00fcrgen",""]]}
{"id":"2308.07058","submitter":"Giulia Cencetti","authors":"Giulia Cencetti, Lorenzo Lucchini, Gabriele Santin, Federico\n  Battiston, Esteban Moro, Alex Pentland, Bruno Lepri","title":"Temporal clustering of social interactions trades-off disease spreading\n  and knowledge diffusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-pharmaceutical measures such as preventive quarantines, remote working,\nschool and workplace closures, lockdowns, etc. have shown effectivenness from\nan epidemic control perspective; however they have also significant negative\nconsequences on social life and relationships, work routines, and community\nengagement. In particular, complex ideas, work and school collaborations,\ninnovative discoveries, and resilient norms formation and maintenance, which\noften require face-to-face interactions of two or more parties to be developed\nand synergically coordinated, are particularly affected. In this study, we\npropose an alternative hybrid solution that balances the slowdown of epidemic\ndiffusion with the preservation of face-to-face interactions. Our approach\ninvolves a two-step partitioning of the population. First, we tune the level of\nnode clustering, creating \"social bubbles\" with increased contacts within each\nbubble and fewer outside, while maintaining the average number of contacts in\neach network. Second, we tune the level of temporal clustering by pairing, for\na certain time interval, nodes from specific social bubbles. Our results\ndemonstrate that a hybrid approach can achieve better trade-offs between\nepidemic control and complex knowledge diffusion. The versatility of our model\nenables tuning and refining clustering levels to optimally achieve the desired\ntrade-off, based on the potentially changing characteristics of a disease or\nknowledge diffusion process.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:37:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cencetti","Giulia",""],["Lucchini","Lorenzo",""],["Santin","Gabriele",""],["Battiston","Federico",""],["Moro","Esteban",""],["Pentland","Alex",""],["Lepri","Bruno",""]]}
{"id":"2308.07059","submitter":"Thomas Thiemann","authors":"J. Neuser, T. Thiemann","title":"Smooth, invariant orthonormal basis for singular potential Schroedinger\n  operators","comments":"5 p","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent contribution we showed that there exists a smooth, dense domain\nfor singular potential Schr\\\"odinger operators on the real line which is\ninvariant under taking derivatives of arbitrary order and under multiplication\nby positive and negative integer powers of the coordinate. Moreover, inner\nproducts between basis elements of that domain were shown to be easily\ncomputable analytically.\n  A task left open was to construct an orthonormal basis from elements of that\ndomain by using Gram-Schmidt orthonormalisation. We perform that step in the\npresent manuscript. We also consider the application of these methods to the\npositive real line for which one can no longer perform the integrals\nanalytically but for which one can give tight analytical estimates.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:38:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Neuser","J.",""],["Thiemann","T.",""]]}
{"id":"2308.07060","submitter":"Stefan Metzger","authors":"Stefan Metzger","title":"A convergent stochastic scalar auxiliary variable method","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":"  We discuss an extension of the scalar auxiliary variable approach which was\noriginally introduced by Shen et al.~([Shen, Xu, Yang, J.~Comput.~Phys., 2018])\nfor the discretization of deterministic gradient flows. By introducing an\nadditional scalar auxiliary variable, this approach allows to derive a linear\nscheme, while still maintaining unconditional stability. Our extension augments\nthe approximation of the evolution of this scalar auxiliary variable with\nhigher order terms, which enables its application to stochastic partial\ndifferential equations. Using the stochastic Allen--Cahn equation as a\nprototype for nonlinear stochastic partial differential equations with\nmultiplicative noise, we propose an unconditionally energy stable, linear,\nfully discrete finite element scheme based on our stochastic scalar auxiliary\nvariable method. Recovering a discrete version of the energy estimate and\nestablishing Nikolskii estimates with respect to time, we are able to prove\nconvergence of appropriate subsequences of discrete solutions towards pathwise\nunique martingale solutions by applying Jakubowski's generalization of\nSkorokhod's theorem. A generalization of the Gy\\\"ongy--Krylov characterization\nof convergence in probability to quasi-Polish spaces finally provides\nconvergence of fully discrete solutions towards strong solutions of the\nstochastic Allen--Cahn equation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:42:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Metzger","Stefan",""]]}
{"id":"2308.07061","submitter":"Jie Xu","authors":"Jie Xu, Zihan Wu, Cong Wang and Xiaohua Jia","title":"Machine Unlearning: Solutions and Challenges","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":"  Machine learning models may inadvertently memorize sensitive, unauthorized,\nor malicious data, posing risks of privacy violations, security breaches, and\nperformance deterioration. To address these issues, machine unlearning has\nemerged as a critical technique to selectively remove specific training data\npoints' influence on trained models. This paper provides a comprehensive\ntaxonomy and analysis of machine unlearning research. We categorize existing\nresearch into exact unlearning that algorithmically removes data influence\nentirely and approximate unlearning that efficiently minimizes influence\nthrough limited parameter updates. By reviewing the state-of-the-art solutions,\nwe critically discuss their advantages and limitations. Furthermore, we propose\nfuture directions to advance machine unlearning and establish it as an\nessential capability for trustworthy and adaptive machine learning. This paper\nprovides researchers with a roadmap of open problems, encouraging impactful\ncontributions to address real-world needs for selective data removal.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:45:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Jie",""],["Wu","Zihan",""],["Wang","Cong",""],["Jia","Xiaohua",""]]}
{"id":"2308.07062","submitter":"Nuno Freitas","authors":"Nicolas Billerey, Imin Chen, Luis Dielefait, Nuno Freitas","title":"On Darmon's program for the Generalized Fermat equation, II","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain additional Diophantine applications of the methods surrounding\nDarmon's program for the generalized Fermat equation developed in the first\npart of this series of papers. As a first application, we use a multi-Frey\napproach combining two Frey elliptic curves over totally real fields, a Frey\nhyperelliptic curve over $\\mathbb{Q}$ due to Kraus, and ideas from the Darmon\nprogram to give a complete resolution of the generalized Fermat equation $$x^7\n+ y^7 = 3 z^n$$ for all integers $n \\ge 2$. Moreover, we explain how the use of\nhigher dimensional Frey abelian varieties allows a more efficient proof of this\nresult due to additional structures that they afford, compared to using only\nFrey elliptic curves.\n  As a second application, we use some of these additional structures that Frey\nabelian varieties possess to show that a full resolution of the generalized\nFermat equation $x^7 + y^7 = z^n$ depends only on the Cartan case of Darmon's\nbig image conjecture. In the process, we solve the previous equation for\nsolutions $(a,b,c)$ such that $a + b$ satisfies certain $2$ or $7$-adic\nconditions and all $n \\ge 2$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:45:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Billerey","Nicolas",""],["Chen","Imin",""],["Dielefait","Luis",""],["Freitas","Nuno",""]]}
{"id":"2308.07063","submitter":"Jos\\'e Luis Sainz-Pardo Au\\~n\\'on","authors":"Justo Puerto and Jos\\'e L. Sainz-Pardo","title":"Budget-constrained cut problems","comments":"21 pages, 6 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The minimum and maximum cuts of an undirected edge-weighted graph are classic\nproblems in graph theory. While the Min-Cut Problem can be solved in P, the\nMax-Cut Problem is NP-Complete. Exact and heuristic methods have been developed\nfor solving them. For both problems, we introduce a natural extension in which\ncutting an edge induces a cost. Our goal is to find a cut that minimizes the\nsum of the cut weights but, at the same time, restricts its total cut cost to a\ngiven budget. We prove that both restricted problems are NPComplete and we also\nstudy some of its properties. Finally, we develop exact algorithms to solve\nboth as well as a non-exact algorithm for the min-cut case based on a\nLagreangean relaxation that generally provides optimal solutions. Their\nperformance is reported by an extensive computational experience.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:53:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Puerto","Justo",""],["Sainz-Pardo","Jos\u00e9 L.",""]]}
{"id":"2308.07064","submitter":"Christian D'Elb\\'ee","authors":"Christian d'Elb\\'ee","title":"Axiomatic Theory of Independence Relations in Model Theory","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This course introduces the fruitful links between model theory and a\ncombinatoric of sets given by independence relations. An independence relation\non a set is a ternary relation between subsets. Chapter 1 should be considered\nas an introductory chapter. It does not mention first-order theories or\nformulas. It introduces independence relations in a naive set theory framework.\nIts goal is to get the reader familiar with basic axioms of independence\nrelations (which do not need an ambient theory to be stated) as well as\nintroduce closure operators and pregeometries. Chapter 2 introduces the\nmodel-theoretic context. The two main examples (algebraically closed fields and\nthe random graph) are described as well as independence relations in those\nexamples. Chapter 3 gives the axioms of independence relations in a\nmodel-theoretic context. It introduces the general toolbox of the\nmodel-theorists (indiscernible sequences, Ramsey/Erdos-Rado and compactness)\nand the independence relations of heirs/coheirs with two main applications:\nAdler's theorem of symmetry (how symmetry emerges from a weaker set of axioms,\nwhich is rooted in the work of Kim and Pillay) and a criterion for NSOP4 using\nstationary independence relations in the style of Conant. Independence\nrelations satisfying Adler's theorem of symmetry are here called 'Adler\nindependence relations' or AIR. Chapter 4 treats forking and dividing. It is\nproved that dividing independence is always stronger than any AIR (even though\nit is not an AIR in general) a connection between the independence theorem and\nforking independence, which holds in all generality and is based on\nKim-Pillay's approach. Then, simplicity is defined and the interesting\ndirection of the Kim-Pillay theorem (namely that the existence of an Adler\nindependence relation satisfying the independence theorem yields simplicity) is\ndeduced from earlier results.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:54:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["d'Elb\u00e9e","Christian",""]]}
{"id":"2308.07065","submitter":"Jeremy Worsfold","authors":"Jeremy Worsfold and Tim Rogers","title":"Stay in your lane: Density fluctuations in multi-lane traffic","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When a new vehicle joins a lane, those behind may have to temporarily slow to\naccommodate them. Changing lane can be forced due to lane drops or junctions,\nbut may also take place spontaneously at discretion of drivers, and recent\nstudies have found that traffic jams and traffic oscillations can form even\nwithout such bottlenecks. Understanding how lane changing behaviour affects\ntraffic flow is important for learning how to design roads and control traffic\nmore effectively. Here, we present a stochastic model of spontaneous lane\nchanging which exhibits a reduction in the overall flow of traffic. By\nexamining the average flow rate both analytically and through simulations we\nfind a definitive slow down of vehicles due to random switching between lanes.\nBy extending the model to three lane traffic we find a larger impact on the\nflow of the middle lane compared to the side lanes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:55:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Worsfold","Jeremy",""],["Rogers","Tim",""]]}
{"id":"2308.07066","submitter":"Mikhail Bashkanov","authors":"M. Bashkanov, D.P. Watts, G. Clash, M. Mocanu, M. Nicol","title":"Dibaryons and where to find them","comments":"arXiv admin note: text overlap with arXiv:2012.11449","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 there has been tremendous progress in the investigation of\nbound systems of quarks with multiplicities beyond the more usual two- and\nthree-quark systems. Experimental and theoretical progress has been made in the\nfour-, five- and even six-quark sectors. In this paper, we review the possible\nlightest six-quark states using a simple ansatz based on SU(3) symmetry and\nevaluate the most promising decay branches. The work will be useful to help\nfocus future experimental searches in this six-quark sector.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:01:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bashkanov","M.",""],["Watts","D. P.",""],["Clash","G.",""],["Mocanu","M.",""],["Nicol","M.",""]]}
{"id":"2308.07067","submitter":"He Lu","authors":"Kui An, Zilei Liu, Ting Zhang, Siqi Li, You Zhou, Xiao Yuan, Leiran\n  Wang, Wenfu Zhang, Guoxi Wang, and He Lu","title":"Efficient Characterizations of Multiphoton States with Ultra-thin\n  Integrated Photonics","comments":"15 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":"  Metasurface enables the generation and manipulation of multiphoton\nentanglement with flat optics, providing a more efficient platform for\nlarge-scale photonic quantum information processing. Here, we show that a\nsingle metasurface optical chip would allow more efficient characterizations of\nmultiphoton entangled states, such as shadow tomography, which generally\nrequires fast and complicated control of optical setups to perform projective\nmeasurements in different bases, a demanding task using conventional optics.\nThe compact and stable device here allows implementations of general positive\nobservable value measures with a reduced sample complexity and significantly\nalleviates the experimental complexity to implement shadow tomography.\nIntegrating self-learning and calibration algorithms, we observe notable\nadvantages in the reconstruction of multiphoton entanglement, including using\nfewer measurements, having higher accuracy, and being robust against optical\nloss. Our work unveils the feasibility of metasurface as a favorable integrated\noptical device for efficient characterization of multiphoton entanglement, and\nsheds light on scalable photonic quantum technologies with ultra-thin\nintegrated optics.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:03:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["An","Kui",""],["Liu","Zilei",""],["Zhang","Ting",""],["Li","Siqi",""],["Zhou","You",""],["Yuan","Xiao",""],["Wang","Leiran",""],["Zhang","Wenfu",""],["Wang","Guoxi",""],["Lu","He",""]]}
{"id":"2308.07068","submitter":"He Lu","authors":"Ting Zhang, Graeme Smith, John A. Smolin, Lu Liu, Xu-Jie Peng, Qi\n  Zhao, Davide Girolami, Xiongfeng Ma, Xiao Yuan and He Lu","title":"Quantification of Entanglement and Coherence with Purity Detection","comments":"12 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:1707.09928","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Entanglement and coherence are fundamental properties of quantum systems,\npromising to power the near future quantum technologies. Yet, their\nquantification, rather than mere detection, generally requires reconstructing\nthe spectrum of quantum states, i.e., experimentally challenging measurement\nsets that increase exponentially with the system size. Here, we demonstrate\nquantitative bounds to operationally useful entanglement and coherence that are\nuniversally valid, analytically computable, and experimentally friendly.\nSpecifically, our main theoretical results are lower and upper bounds to the\ncoherent information and the relative entropy of coherence in terms of local\nand global purities of quantum states. To validate our proposal, we\nexperimentally implement two purity detection methods in an optical system:\nshadow estimation with random measurements and collective measurements on pairs\nof state copies. The experiment shows that both the coherent information and\nthe relative entropy of coherence of pure and mixed unknown quantum states can\nbe bounded by purity functions. Our research offers an efficient means of\nverifying large-scale quantum information processing without spectrum\nreconstruction.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:03:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Ting",""],["Smith","Graeme",""],["Smolin","John A.",""],["Liu","Lu",""],["Peng","Xu-Jie",""],["Zhao","Qi",""],["Girolami","Davide",""],["Ma","Xiongfeng",""],["Yuan","Xiao",""],["Lu","He",""]]}
{"id":"2308.07069","submitter":"Gang Liu","authors":"Gang Liu, Zhihuan Zhou, Yuhao Mu and Lixin Xu","title":"Kinetically Coupled Scalar Fields Model and Cosmological Tensions","comments":"9 pages, 7 figures","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 the kinetically coupled early dark energy (EDE)\nand scalar field dark matter to address cosmological tensions. The EDE model\npresents an intriguing theoretical approach to resolving the Hubble tension,\nbut it introduces challenges such as the \"why then\" problem of why EDE was\ninjected during the epoch of matter-radiation equality, and exacerbates\nexisting large-scale structure tension. Therefore, we consider the interaction\nbetween dark matter and EDE, such that the dynamics of EDE are triggered by the\ndark matter, and the drag effect of dark energy on dark matter suppresses\nstructure growth, which can alleviate large-scale structure tension. We replace\ncold dark matter with scalar field dark matter, which has the property of\nsuppressing structure growth on small scales. We employed the Markov Chain\nMonte Carlo method to constrain the model parameters by utilising a variety of\ncosmological data, our new model reveals a non-zero coupling constant of $0.030\n\\pm 0.026$ at a 68\\% confidence level. The coupled model yields a Hubble\nconstant value of $72.38^{+0.71}_{-0.82}$ \\,km\\,/\\,s\\,/\\,Mpc, which resolves\nthe Hubble tension. However, similar to the EDE model, it also obtains a larger\n$S_8$ value compared to the $\\Lambda$CDM model, further exacerbating the\nlarge-scale structure tension. The best-fit $S_8$ value for the EDE model is\n$0.8316$, whereas our new model yields a smaller value of $0.8134$.\nAdditionally, the coupled model exhibits a smaller $\\chi^2_\\mathrm{tot}$ value\ncompared to the EDE model and the $\\Lambda$CDM model, indicating a better fit\nto the data.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:04:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Gang",""],["Zhou","Zhihuan",""],["Mu","Yuhao",""],["Xu","Lixin",""]]}
{"id":"2308.07070","submitter":"Nicolas Klenert","authors":"Nicolas Klenert, Verena Lepper, Daniel Baum","title":"A Local Iterative Approach for the Extraction of 2D Manifolds from\n  Strongly Curved and Folded Thin-Layer Structures","comments":"16 pages, 21 figures, to be published in IEEE Transactions on\n  Visualization and Computer Graphics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ridge surfaces represent important features for the analysis of 3-dimensional\n(3D) datasets in diverse applications and are often derived from varying\nunderlying data including flow fields, geological fault data, and point data,\nbut they can also be present in the original scalar images acquired using a\nplethora of imaging techniques. Our work is motivated by the analysis of image\ndata acquired using micro-computed tomography (Micro-CT) of ancient, rolled and\nfolded thin-layer structures such as papyrus, parchment, and paper as well as\nsilver and lead sheets. From these documents we know that they are\n2-dimensional (2D) in nature. Hence, we are particularly interested in\nreconstructing 2D manifolds that approximate the document's structure. The\nimage data from which we want to reconstruct the 2D manifolds are often very\nnoisy and represent folded, densely-layered structures with many artifacts,\nsuch as ruptures or layer splitting and merging. Previous ridge-surface\nextraction methods fail to extract the desired 2D manifold for such challenging\ndata. We have therefore developed a novel method to extract 2D manifolds. The\nproposed method uses a local fast marching scheme in combination with a\nseparation of the region covered by fast marching into two sub-regions. The 2D\nmanifold of interest is then extracted as the surface separating the two\nsub-regions. The local scheme can be applied for both automatic propagation as\nwell as interactive analysis. We demonstrate the applicability and robustness\nof our method on both artificial data as well as real-world data including\nfolded silver and papyrus sheets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:05:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Klenert","Nicolas",""],["Lepper","Verena",""],["Baum","Daniel",""]]}
{"id":"2308.07071","submitter":"Shreyash Gupta","authors":"Shreyash Gupta, Abhinav Kumar, Niladri S. Tripathy, Suril V. Shah","title":"RL-based Variable Horizon Model Predictive Control of Multi-Robot\n  Systems using Versatile On-Demand Collision Avoidance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-robot systems have become very popular in recent years because of their\nwide spectrum of applications, ranging from surveillance to cooperative payload\ntransportation. Model Predictive Control (MPC) is a promising controller for\nmulti-robot control because of its preview capability and ability to handle\nconstraints easily. The performance of the MPC widely depends on many\nparameters, among which the prediction horizon is the major contributor.\nIncreasing the prediction horizon beyond a limit drastically increases the\ncomputation cost. Tuning the value of the prediction horizon can be very\ntime-consuming, and the tuning process must be repeated for every task.\nMoreover, instead of using a fixed horizon for an entire task, a better balance\nbetween performance and computation cost can be established if different\nprediction horizons can be employed for every robot at each time step. Further,\nfor such variable prediction horizon MPC for multiple robots, on-demand\ncollision avoidance is the key requirement. We propose Versatile On-demand\nCollision Avoidance (VODCA) strategy to comply with the variable horizon model\npredictive control. We also present a framework for learning the prediction\nhorizon for the multi-robot system as a function of the states of the robots\nusing the Soft Actor-Critic (SAC) RL algorithm. The results are illustrated and\nvalidated numerically for different multi-robot tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:05:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gupta","Shreyash",""],["Kumar","Abhinav",""],["Tripathy","Niladri S.",""],["Shah","Suril V.",""]]}
{"id":"2308.07072","submitter":"Li Ye","authors":"Shangxuan Li, Yu Du, Li Ye, Chichi Li, Yanshu Fang, Cheng Wang, Wu\n  Zhou","title":"Teeth And Root Canals Segmentation Using ZXYFormer With Uncertainty\n  Guidance And Weight Transfer","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 study attempts to segment teeth and root-canals simultaneously from CBCT\nimages, but there are very challenging problems in this process. First, the\nclinical CBCT image data is very large (e.g., 672 *688 * 688), and the use of\ndownsampling operation will lose useful information about teeth and root\ncanals. Second, teeth and root canals are very different in morphology, and it\nis difficult for a simple network to identify them precisely. In addition,\nthere are weak edges at the tooth, between tooth and root canal, which makes it\nvery difficult to segment such weak edges. To this end, we propose a\ncoarse-to-fine segmentation method based on inverse feature fusion transformer\nand uncertainty estimation to address above challenging problems. First, we use\nthe downscaled volume data (e.g., 128 * 128 * 128) to conduct coarse\nsegmentation and map it to the original volume to obtain the area of teeth and\nroot canals. Then, we design a transformer with reverse feature fusion, which\ncan bring better segmentation effect of different morphological objects by\ntransferring deeper features to shallow features. Finally, we design an\nauxiliary branch to calculate and refine the difficult areas in order to\nimprove the weak edge segmentation performance of teeth and root canals.\nThrough the combined tooth and root canal segmentation experiment of 157\nclinical high-resolution CBCT data, it is verified that the proposed method is\nsuperior to the existing tooth or root canal segmentation methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:06:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Shangxuan",""],["Du","Yu",""],["Ye","Li",""],["Li","Chichi",""],["Fang","Yanshu",""],["Wang","Cheng",""],["Zhou","Wu",""]]}
{"id":"2308.07073","submitter":"Uri Onn","authors":"Uri Onn, Amritanshu Prasad, and Pooja Singla","title":"Representation zeta functions of arithmetic groups of type $A_2$ in\n  positive characteristic","comments":"Preliminary draft, comments are welcomed!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove two conjectures regarding the representation growth of groups of\ntype $A_2$. The first, conjectured by Avni, Klopsch, Onn and Voll, regards the\nuniformity of representation zeta functions over local complete discrete\nvaluation rings. The second is the Larsen--Lubotzky conjecture on the\nrepresentation growth of irreducible lattices in groups of type $A_2$ in\npositive characteristic assuming Serre's conjecture on the congruence subgroup\nproblem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:09:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Onn","Uri",""],["Prasad","Amritanshu",""],["Singla","Pooja",""]]}
{"id":"2308.07074","submitter":"Keming Lu","authors":"Keming Lu, Hongyi Yuan, Zheng Yuan, Runji Lin, Junyang Lin, Chuanqi\n  Tan, Chang Zhou, Jingren Zhou","title":"#InsTag: Instruction Tagging for Analyzing Supervised Fine-tuning of\n  Large 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":"  Foundation language models obtain the instruction-following ability through\nsupervised fine-tuning (SFT). Diversity and complexity are considered critical\nfactors of a successful SFT dataset, while their definitions remain obscure and\nlack quantitative analyses. In this work, we propose InsTag, an open-set\nfine-grained tagger, to tag samples within SFT datasets based on semantics and\nintentions and define instruction diversity and complexity regarding tags. We\nobtain 6.6K tags to describe comprehensive user queries. Then we analyze\npopular open-sourced SFT datasets and find that the model ability grows with\nmore diverse and complex data. Based on this observation, we propose a data\nselector based on InsTag to select 6K diverse and complex samples from\nopen-source datasets and fine-tune models on InsTag-selected data. The\nresulting models, TagLM, outperform open-source models based on considerably\nlarger SFT data evaluated by MT-Bench, echoing the importance of query\ndiversity and complexity. We open-source InsTag in\nhttps://github.com/OFA-Sys/InsTag.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:16:28 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 07:37:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lu","Keming",""],["Yuan","Hongyi",""],["Yuan","Zheng",""],["Lin","Runji",""],["Lin","Junyang",""],["Tan","Chuanqi",""],["Zhou","Chang",""],["Zhou","Jingren",""]]}
{"id":"2308.07075","submitter":"Kaili Jiang","authors":"Kaili Jiang, Dechang Wang, Kailun Tian, Hancong Feng, Yuxin Zhao, Sen\n  Cao, Jian Gao, Xuying Zhang, Yanfei Li, Junyu Yuan, Ying Xiong and Bin Tang","title":"Wideband Power Spectrum Sensing: a Fast Practical Solution for Nyquist\n  Folding Receiver","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The limited availability of spectrum resources has been growing into a\ncritical problem in wireless communications, remote sensing, and electronic\nsurveillance, etc. To address the high-speed sampling bottleneck of wideband\nspectrum sensing, a fast and practical solution of power spectrum estimation\nfor Nyquist folding receiver (NYFR) is proposed in this paper. The NYFR\narchitectures is can theoretically achieve the full-band signal sensing with a\nhundred percent of probability of intercept. But the existing algorithm is\ndifficult to realize in real-time due to its high complexity and complicated\ncalculations. By exploring the sub-sampling principle inherent in NYFR, a\ncomputationally efficient method is introduced with compressive covariance\nsensing. That can be efficient implemented via only the non-uniform fast\nFourier transform, fast Fourier transform, and some simple multiplication\noperations. Meanwhile, the state-of-the-art power spectrum reconstruction model\nfor NYFR of time-domain and frequency-domain is constructed in this paper as a\ncomparison. Furthermore, the computational complexity of the proposed method\nscales linearly with the Nyquist-rate sampled number of samples and the\nsparsity of spectrum occupancy. Simulation results and discussion demonstrate\nthat the low complexity in sampling and computation is a more practical\nsolution to meet the real-time wideband spectrum sensing applications.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:17:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Kaili",""],["Wang","Dechang",""],["Tian","Kailun",""],["Feng","Hancong",""],["Zhao","Yuxin",""],["Cao","Sen",""],["Gao","Jian",""],["Zhang","Xuying",""],["Li","Yanfei",""],["Yuan","Junyu",""],["Xiong","Ying",""],["Tang","Bin",""]]}
{"id":"2308.07076","submitter":"Myoung-Jae Lee Prof","authors":"Myoungjae Lee","title":"Righteous Way to Find Heterogeneous Effects of Multiple Treatments for\n  Any Outcome Variable","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With a categorical treatment D=0,1,...,J, the ubiquitous practice is making\ndummy variables D(1),...,D(J) to apply the OLS of an outcome Y on D(1),...,D(J)\nand covariates X. With m(d,X) being the X-heterogeneous effect of D(d) given X,\nthis paper shows that, for \"saturated models\", the OLS D(d) slope is consistent\nfor a sum of weighted averages of m(1,X),...,m(J,X) where the sum of the\nweights for m(d,X) is one whereas the sum of the weights for the other\nX-heterogeneous effects is zero. Hence, if all m(1,X),...,m(J,X) are constant\nwith m(d,X)=b(d), then the OLS D(d) slope is consistent for b(d); otherwise,\nthe OLS is inconsistent in saturated models, as heterogeneous effects of other\ncategories \"interfere\". For unsaturated models, in general, OLS is inconsistent\neven for binary D. What can be done instead is the OLS of Y on D(d)-E{D(d)|X,\nD=0,d} using only the subsample D=0,d to find the effect of D(d) separately for\neach d=1,...,J. This subsample OLS is consistent for the \"overlap-weight\"\naverage of m(d,X). Although we parametrize E{D(d)|X, D=0,d} for practicality,\nusing Y-E(Y|X, D=0,d) or its variation instead of Y makes the OLS robust to\nmisspecifications in E{D(d)|X, D=0,d}.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:19:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Myoungjae",""]]}
{"id":"2308.07077","submitter":"Kaili Jiang","authors":"Kaili Jiang, Kailun Tian, Hancong Feng, Yuxin Zhao, Dechang Wang, Sen\n  Cao, Jian Gao, Xuying Zhang, Yanfei Li, Junyu Yuan, Ying Xiong and Bin Tang","title":"Distributed UAV Swarm Augmented Wideband Spectrum Sensing Using Nyquist\n  Folding Receiver","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Distributed unmanned aerial vehicle (UAV) swarms are formed by multiple UAVs\nwith increased portability, higher levels of sensing capabilities, and more\npowerful autonomy. These features make them attractive for many recent\napplica-tions, potentially increasing the shortage of spectrum resources. In\nthis paper, wideband spectrum sensing augmented technology is discussed for\ndistributed UAV swarms to improve the utilization of spectrum. However, the\nsub-Nyquist sampling applied in existing schemes has high hardware complexity,\npower consumption, and low recovery efficiency for non-strictly sparse\nconditions. Thus, the Nyquist folding receiver (NYFR) is considered for the\ndistributed UAV swarms, which can theoretically achieve full-band spectrum\ndetection and reception using a single analog-to-digital converter (ADC) at low\nspeed for all circuit components. There is a focus on the sensing model of two\nmultichannel scenarios for the distributed UAV swarms, one with a complete\nfunctional receiver for the UAV swarm with RIS, and another with a\ndecentralized UAV swarm equipped with a complete functional receiver for each\nUAV element. The key issue is to consider whether the application of RIS\ntechnology will bring advantages to spectrum sensing and the data fusion\nproblem of decentralized UAV swarms based on the NYFR architecture. Therefore,\nthe property for multiple pulse reconstruction is analyzed through the\nGershgorin circle theorem, especially for very short pulses. Further, the block\nsparse recovery property is analyzed for wide bandwidth signals. The proposed\ntechnology can improve the processing capability for multiple signals and wide\nbandwidth signals while reducing interference from folded noise and subsampled\nharmonics. Experiment results show augmented spectrum sensing efficiency under\nnon-strictly sparse conditions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:21:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Kaili",""],["Tian","Kailun",""],["Feng","Hancong",""],["Zhao","Yuxin",""],["Wang","Dechang",""],["Cao","Sen",""],["Gao","Jian",""],["Zhang","Xuying",""],["Li","Yanfei",""],["Yuan","Junyu",""],["Xiong","Ying",""],["Tang","Bin",""]]}
{"id":"2308.07078","submitter":"Chaohui Yu","authors":"Chaohui Yu, Qiang Zhou, Zhibin Wang, Fan Wang","title":"ICPC: Instance-Conditioned Prompting with Contrastive Learning for\n  Semantic Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern supervised semantic segmentation methods are usually finetuned based\non the supervised or self-supervised models pre-trained on ImageNet. Recent\nwork shows that transferring the knowledge from CLIP to semantic segmentation\nvia prompt learning can achieve promising performance. The performance boost\ncomes from the feature enhancement with multimodal alignment, i.e., the dot\nproduct between vision and text embeddings. However, how to improve the\nmultimodal alignment for better transfer performance in dense tasks remains\nunderexplored. In this work, we focus on improving the quality of vision-text\nalignment from two aspects of prompting design and loss function, and present\nan instance-conditioned prompting with contrastive learning (ICPC) framework.\nFirst, compared with the static prompt designs, we reveal that dynamic\nprompting conditioned on image content can more efficiently utilize the text\nencoder for complex dense tasks. Second, we propose an align-guided contrastive\nloss to refine the alignment of vision and text embeddings. We further propose\nlightweight multi-scale alignment for better performance. Extensive experiments\non three large-scale datasets (ADE20K, COCO-Stuff10k, and ADE20K-Full)\ndemonstrate that ICPC brings consistent improvements across diverse backbones.\nTaking ResNet-50 as an example, ICPC outperforms the state-of-the-art\ncounterpart by 1.71%, 1.05%, and 1.41% mIoU on the three datasets,\nrespectively.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:21:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yu","Chaohui",""],["Zhou","Qiang",""],["Wang","Zhibin",""],["Wang","Fan",""]]}
{"id":"2308.07079","submitter":"Kaili Jiang","authors":"Kaili Jiang, Kailun Tian, Hancong Feng, Junyu Yuan, and Bin Tang","title":"Wideband Spectrum Acquisition for UAV Swarm Using the Sparse Coding\n  Fourier Transform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  As the trend towards small, safe, smart, speedy and swarm development grows,\nunmanned aerial vehicles (UAVs) are becoming increasingly popular for a wide\nrange of applications. In this letter, the challenge of wideband spectrum\nacquisition for the UAV swarms is studied by proposing a processing method that\nfeatures lower power consumption, higher compression rates, and a lower\nsignal-to-noise ratio. Our system is equipped with multiple UAVs, each with a\ndifferent sub-sampling rate. That allows for frequency backetization and\nestimation based on sparse Fourier transform theory. Unlike other techniques,\nthe collisions and iterations caused by non-sparsity environ-ments are\nconsidered. We introduce sparse coding Fourier transform to address these\nissues. The key is to code the entire spectrum and decode it through spectrum\ncorrelation in the code. Simulation results show that our proposed method\nperforms well in acquiring both narrowband and wideband signals simultaneously,\ncompared to the other methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:24:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jiang","Kaili",""],["Tian","Kailun",""],["Feng","Hancong",""],["Yuan","Junyu",""],["Tang","Bin",""]]}
{"id":"2308.07080","submitter":"Anthony Phillips","authors":"Anthony E. Phillips, Helen C. Walker","title":"On (not) deriving the entropy of barocaloric phase transitions from\n  crystallography and neutron spectroscopy","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review well-known signatures of disorder in crystallographic and inelastic\nneutron scattering data. We show that these can arise from different types of\ndisorder, corresponding to different values of the system entropy. Correlating\nthe entropy of a material with its atomistic structure and dynamics is in\ngeneral a difficult problem that requires correlating information between\nmultiple experimental techniques including crystallography, spectroscopy, and\ncalorimetry. These comments are illustrated with particular reference to\nbarocalorics, but are relevant to a broad range of calorics and other\ndisordered crystalline materials.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:25:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Phillips","Anthony E.",""],["Walker","Helen C.",""]]}
{"id":"2308.07081","submitter":"Jivnesh Sandhan","authors":"Jivnesh Sandhan, Amruta Barbadikar, Malay Maity, Pavankumar Satuluri,\n  Tushar Sandhan, Ravi M. Gupta, Pawan Goyal and Laxmidhar Behera","title":"Aesthetics of Sanskrit Poetry from the Perspective of Computational\n  Linguistics: A Case Study Analysis on Siksastaka","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sanskrit poetry has played a significant role in shaping the literary and\ncultural landscape of the Indian subcontinent for centuries. However, not much\nattention has been devoted to uncovering the hidden beauty of Sanskrit poetry\nin computational linguistics. This article explores the intersection of\nSanskrit poetry and computational linguistics by proposing a roadmap of an\ninterpretable framework to analyze and classify the qualities and\ncharacteristics of fine Sanskrit poetry. We discuss the rich tradition of\nSanskrit poetry and the significance of computational linguistics in\nautomatically identifying the characteristics of fine poetry. The proposed\nframework involves a human-in-the-loop approach that combines deterministic\naspects delegated to machines and deep semantics left to human experts. We\nprovide a deep analysis of Siksastaka, a Sanskrit poem, from the perspective of\n6 prominent kavyashastra schools, to illustrate the proposed framework.\nAdditionally, we provide compound, dependency, anvaya (prose order linearised\nform), meter, rasa (mood), alankar (figure of speech), and riti (writing style)\nannotations for Siksastaka and a web application to illustrate the poem's\nanalysis and annotations. Our key contributions include the proposed framework,\nthe analysis of Siksastaka, the annotations and the web application for future\nresearch. Link for interactive analysis:\nhttps://sanskritshala.github.io/shikshastakam/\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:26:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sandhan","Jivnesh",""],["Barbadikar","Amruta",""],["Maity","Malay",""],["Satuluri","Pavankumar",""],["Sandhan","Tushar",""],["Gupta","Ravi M.",""],["Goyal","Pawan",""],["Behera","Laxmidhar",""]]}
{"id":"2308.07082","submitter":"Denis Sych","authors":"D. Sych, A. Kodukhov, V. Pastushenko, N. Kirsanov, D. Kronberg, M.\n  Pflitsch","title":"Applicability of QKD: TerraQuantum view on the NSA's scepticism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.pop-ph physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum communication offers unique features that have no classical analog,\nin particular, it enables provably secure quantum key distribution (QKD).\nDespite the benefits of quantum communication are well understood within the\nscientific community, the practical implementations sometimes meet with\nscepticism or even resistance. In a recent publication [1], NSA claims that QKD\nis inferior to \"quantum-resistant\" cryptography and does not recommend it for\nuse. Here we show that such a sceptical approach to evaluation of quantum\nsecurity is not well justified. We hope that our arguments will be helpful to\nclarify the issue.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:27:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sych","D.",""],["Kodukhov","A.",""],["Pastushenko","V.",""],["Kirsanov","N.",""],["Kronberg","D.",""],["Pflitsch","M.",""]]}
{"id":"2308.07083","submitter":"Abhimanyu Rana","authors":"Neeraj Kumar Sharma, Anchal Rana, O. S. Panwar, Abhimanyu Singh Rana","title":"Nanomechanical inhomogeneities in CVA-deposited titanium nitride thin\n  films: Nanoindentation and Finite Element Method Investigations","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":"  Refractory metals that can withstand at high temperatures and harsh\nconditions are of utmost importance for solar-thermal and energy storage\napplications. Thin films of TiN have been deposited using cathodic vacuum arc\ndeposition (CVA) at relatively low temperatures ~ 300 oC using the substrate\nbias ~ -60V. The nanomechanical properties of these films were investigated\nusing nanoindentation and the spatial fluctuations were observed. The\nnanoindentation results were simulated using finite element method (FEM)\nthrough Johnson-Cook model. We have found the local nitridation plays an\nimportant role on nanomechanical properties of TiN thin films and confirms that\nthe nitrogen deficient regions are ductile with low yield stress and hardening\nmodulus. This study further opens the opportunities of modelling the nanoscale\nsystem using FEM analysis.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:28:21 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 06:10:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sharma","Neeraj Kumar",""],["Rana","Anchal",""],["Panwar","O. S.",""],["Rana","Abhimanyu Singh",""]]}
{"id":"2308.07084","submitter":"Kirill Petrovnin","authors":"Kirill Petrovnin, Jiaming Wang, Michael Perelshtein, Pertti Hakonen,\n  Gheorghe Sorin Paraoanu","title":"Microwave photon detection at parametric criticality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The detection of microwave fields at single-photon power levels is a much\nsought-after technology, with practical applications in nanoelectronics and\nquantum information science. Here we demonstrate a simple yet powerful\ncriticality-enhanced method of microwave photon detection by operating a\nmagnetic-field tunable Kerr Josephson parametric amplifier near a first-order\nquantum phase transition. We obtain a 73% efficiency and a dark-count rate of\n167 kHz, corresponding to a responsivity of $1.3 \\times\n10^{17}~\\mathrm{W}^{-1}$ and noise-equivalent power of 3.28 zW/$\\sqrt{\\rm Hz}$.\nWe verify the single-photon operation by extracting the Poissonian statistics\nof a coherent probe signal.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:28:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Petrovnin","Kirill",""],["Wang","Jiaming",""],["Perelshtein","Michael",""],["Hakonen","Pertti",""],["Paraoanu","Gheorghe Sorin",""]]}
{"id":"2308.07085","submitter":"Junjielong Xu","authors":"Junjielong Xu, Qiuai Fu, Zhouruixing Zhu, Yutong Cheng, Zhijing Li,\n  Yuchi Ma, Pinjia He","title":"Hue: A User-Adaptive Parser for Hybrid Logs","comments":"Accepted by ESEC/FSE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Log parsing, which extracts log templates from semi-structured logs and\nproduces structured logs, is the first and the most critical step in automated\nlog analysis. While existing log parsers have achieved decent results, they\nsuffer from two major limitations by design. First, they do not natively\nsupport hybrid logs that consist of both single-line logs and multi-line logs\n(\\eg Java Exception and Hadoop Counters). Second, they fall short in\nintegrating domain knowledge in parsing, making it hard to identify ambiguous\ntokens in logs. This paper defines a new research problem, \\textit{hybrid log\nparsing}, as a superset of traditional log parsing tasks, and proposes\n\\textit{Hue}, the first attempt for hybrid log parsing via a user-adaptive\nmanner. Specifically, Hue converts each log message to a sequence of special\nwildcards using a key casting table and determines the log types via line\naggregating and pattern extracting. In addition, Hue can effectively utilize\nuser feedback via a novel merge-reject strategy, making it possible to quickly\nadapt to complex and changing log templates. We evaluated Hue on three hybrid\nlog datasets and sixteen widely-used single-line log datasets (\\ie Loghub). The\nresults show that Hue achieves an average grouping accuracy of 0.845 on hybrid\nlogs, which largely outperforms the best results (0.563 on average) obtained by\nexisting parsers. Hue also exhibits SOTA performance on single-line log\ndatasets. Furthermore, Hue has been successfully deployed in a real production\nenvironment for daily hybrid log parsing.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:28:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xu","Junjielong",""],["Fu","Qiuai",""],["Zhu","Zhouruixing",""],["Cheng","Yutong",""],["Li","Zhijing",""],["Ma","Yuchi",""],["He","Pinjia",""]]}
{"id":"2308.07086","submitter":"Sean Eberhard","authors":"Sean Eberhard","title":"Diameter of classical groups generated by transvections","comments":"38 pages. Minor correction","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a finite classical group generated by transvections, i.e., one of\n$\\operatorname{SL}_n(q)$, $\\operatorname{SU}_n(q)$,\n$\\operatorname{Sp}_{2n}(q)$, or $\\operatorname{O}^\\pm_{2n}(q)$ ($q$ even), and\nlet $X$ be a generating set for $G$ containing at least one transvection.\nBuilding on work of Garonzi, Halasi, and Somlai, we prove that the diameter of\nthe Cayley graph $\\operatorname{Cay}(G, X)$ is bounded by $(n \\log q)^C$ for\nsome constant $C$. This confirms Babai's conjecture on the diameter of finite\nsimple groups in the case of generating sets containing a transvection.\n  By combining this with a result of the author and Jezernik it follows that if\n$G$ is one of $\\operatorname{SL}_n(q)$, $\\operatorname{SU}_n(q)$,\n$\\operatorname{Sp}_{2n}(q)$ and $X$ contains three random generators then with\nhigh probability the diameter $\\operatorname{Cay}(G, X)$ is bounded by\n$n^{O(\\log q)}$. This confirms Babai's conjecture for non-orthogonal classical\nsimple groups over small fields and three random generators.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:29:12 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 10:24:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Eberhard","Sean",""]]}
{"id":"2308.07087","submitter":"Roland Pulch","authors":"Roland Pulch and Olivier S\\`ete","title":"Stochastic Galerkin method and port-Hamiltonian form for linear\n  first-order ordinary differential equations","comments":"26 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":"  We consider linear first-order systems of ordinary differential equations\n(ODEs) in port-Hamiltonian (pH) form. Physical parameters are remodelled as\nrandom variables to conduct an uncertainty quantification. A stochastic\nGalerkin projection yields a larger deterministic system of ODEs, which does\nnot exhibit a pH form in general. We apply transformations of the original\nsystems such that the stochastic Galerkin projection becomes\nstructure-preserving. Furthermore, we investigate meaning and properties of the\nHamiltonian function belonging to the stochastic Galerkin system. A large\nnumber of random variables implies a highdimensional stochastic Galerkin\nsystem, which suggests itself to apply model order reduction (MOR) generating a\nlow-dimensional system of ODEs. We discuss structure preservation in\nprojection-based MOR, where the smaller systems of ODEs feature pH form again.\nResults of numerical computations are presented using two test examples.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:31:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pulch","Roland",""],["S\u00e8te","Olivier",""]]}
{"id":"2308.07088","submitter":"Marcel Hernandez","authors":"Marcel Hernandez, Angel Garcia-Fernandez and Simon Maskell","title":"Non-Myopic Sensor Control for Target Search and Track Using a\n  Sample-Based GOSPA Implementation","comments":"The paper has been submitted for publication in IEEE Transactions on\n  Aerospace and Electronic Systems and is currently in review","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is concerned with sensor management for target search and track\nusing the generalised optimal subpattern assignment (GOSPA) metric. Utilising\nthe GOSPA metric to predict future system performance is computationally\nchallenging, because of the need to account for uncertainties within the\nscenario, notably the number of targets, the locations of targets, and the\nmeasurements generated by the targets subsequent to performing sensing actions.\nIn this paper, efficient sample-based techniques are developed to calculate the\npredicted mean square GOSPA metric. These techniques allow for missed\ndetections and false alarms, and thereby enable the metric to be exploited in\nscenarios more complex than those previously considered. Furthermore, the GOSPA\nmethodology is extended to perform non-myopic (i.e. multi-step) sensor\nmanagement via the development of a Bellman-type recursion that optimises a\nconditional GOSPA-based metric. Simulations for scenarios with missed\ndetections, false alarms, and planning horizons of up to three time steps\ndemonstrate the approach, in particular showing that optimal plans align with\nan intuitive understanding of how taking into account the opportunity to make\nfuture observations should influence the current action. It is concluded that\nthe GOSPA-based, non-myopic search and track algorithm offers a powerful\nmechanism for sensor management.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:34:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hernandez","Marcel",""],["Garcia-Fernandez","Angel",""],["Maskell","Simon",""]]}
{"id":"2308.07089","submitter":"Markus Schlarb","authors":"Markus Schlarb","title":"Covariant Derivatives on Homogeneous Spaces -- Horizontal Lifts and\n  Parallel Transport","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider invariant covariant derivatives on reductive homogeneous spaces\ncorresponding to the well-known invariant affine connections. These invariant\ncovariant derivatives are expressed in terms of horizontally lifted vector\nfields on the Lie group. This point of view allows for a characterization of\nparallel vector fields along curves. Moreover, metric invariant covariant\nderivatives on a reductive homogeneous space equipped with an invariant\npseudo-Riemannian metric are characterized. As a by-product, a new proof for\nthe existence of invariant covariant derivatives on reductive homogeneous\nspaces and their the one-to-one correspondence to certain bilinear maps is\nobtained.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:38:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Schlarb","Markus",""]]}
{"id":"2308.07090","submitter":"Santiago Torres","authors":"Enrique Miguel Garc\\'ia-Zamora, Santiago Torres and Alberto\n  Rebassa-Mansergas","title":"White dwarf Random Forest classification through Gaia spectral\n  coefficients","comments":"15 pages, 17 figures, 3 tables. Submitted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The third data release of Gaia has provided approximately 220 million low\nresolution spectra. Among these, about 100,000 correspond to white dwarfs. The\nmagnitude of this quantity of data precludes the possibility of performing\nspectral analysis and type determination by human inspection. In order to\ntackle this issue, we explore the possibility of utilising a machine learning\napproach, based on a Random Forest algorithm. We aim to analyze the viability\nof the Random Forest algorithm for the spectral classification of the white\ndwarf population within 100 pc from the Sun, based on the Hermite coefficients\nof Gaia spectra. We utilized the assigned spectral type from the Montreal White\nDwarf Database for training and testing our Random Forest algorithm. Once\nvalidated, our algorithm model is applied to the rest of unclassified white\ndwarfs within 100 pc. First, we started by classifying the two major spectral\ntype groups of white dwarfs: hydrogen-rich (DA) and hydrogen-deficient\n(non-DA). Next, we explored the possibility of classifying the various spectral\nsubtypes, including in some cases the secondary spectral types. Our Random\nForest classification presented a very high recall (>80%) for DA and DB white\ndwarfs, and a very high precision (>90%) for DB, DQ and DZ white dwarfs. As a\nresult we have assigned a spectral type to 9,446 previously unclassified white\ndwarfs: 4,739 DAs, 76 DBs (60 of them DBAs), 4,437 DCs, 132 DZs and 62 DQs (9\nof them DQpec). Despite the low resolution of Gaia spectra, the Random Forest\nalgorithm applied to the Gaia spectral coefficients proves to be a highly\nvaluable tool for spectral classification.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:39:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Garc\u00eda-Zamora","Enrique Miguel",""],["Torres","Santiago",""],["Rebassa-Mansergas","Alberto",""]]}
{"id":"2308.07091","submitter":"Anh Dung Le","authors":"Tuomas Lappi and Anh Dung Le and Heikki M\\\"antysaari","title":"Coherently diffractive dissociation in electron-hadron collisions: from\n  HERA to the future EIC","comments":"9 pages, 3 figures; contribution to DIS2023: XXX International\n  Workshop on Deep-Inelastic Scattering and Related Subjects, Michigan State\n  University, USA, 27-31 March 2023 (talk by ADL)","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present numerical results on diffractive dissociation with large invariant\nmass diffractive final states in the scattering of an electron off a hadron.\nThe diffractive large-mass resummation is performed using the nonlinear\nKovchegov-Levin equation, taking into account running coupling corrections. For\nthe scattering off the proton, a (modified) McLerran-Venugopalan amplitude is\nused as the initial condition for the nonlinear evolution, with free parameters\nbeing constrained by the HERA inclusive data. The results show a reasonable\ndescription of the HERA diffractive structure function data at moderately large\ndiffractive mass when the impact parameter profile is constrained by the\nlow-mass diffractive cross section data. The calculation is extended to nuclear\nscattering, where the initial condition is generalized from the proton case\nemploying the optical Glauber model. The nonlinear large-mass resummation\npredicts a strong nuclear modification in diffractive scattering off a nuclear\ntarget in kinematics accessible at the future Electron-Ion collider.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:45:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lappi","Tuomas",""],["Le","Anh Dung",""],["M\u00e4ntysaari","Heikki",""]]}
{"id":"2308.07092","submitter":"Yunyao Mao","authors":"Yunyao Mao, Jiajun Deng, Wengang Zhou, Yao Fang, Wanli Ouyang,\n  Houqiang Li","title":"Masked Motion Predictors are Strong 3D Action Representation Learners","comments":"To appear in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 3D human action recognition, limited supervised data makes it challenging\nto fully tap into the modeling potential of powerful networks such as\ntransformers. As a result, researchers have been actively investigating\neffective self-supervised pre-training strategies. In this work, we show that\ninstead of following the prevalent pretext task to perform masked\nself-component reconstruction in human joints, explicit contextual motion\nmodeling is key to the success of learning effective feature representation for\n3D action recognition. Formally, we propose the Masked Motion Prediction (MAMP)\nframework. To be specific, the proposed MAMP takes as input the masked\nspatio-temporal skeleton sequence and predicts the corresponding temporal\nmotion of the masked human joints. Considering the high temporal redundancy of\nthe skeleton sequence, in our MAMP, the motion information also acts as an\nempirical semantic richness prior that guide the masking process, promoting\nbetter attention to semantically rich temporal regions. Extensive experiments\non NTU-60, NTU-120, and PKU-MMD datasets show that the proposed MAMP\npre-training substantially improves the performance of the adopted vanilla\ntransformer, achieving state-of-the-art results without bells and whistles. The\nsource code of our MAMP is available at https://github.com/maoyunyao/MAMP.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:56:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mao","Yunyao",""],["Deng","Jiajun",""],["Zhou","Wengang",""],["Fang","Yao",""],["Ouyang","Wanli",""],["Li","Houqiang",""]]}
{"id":"2308.07093","submitter":"Chenwei Wang","authors":"Chenwei Wang, Jifang Pei, Zhiyong Wang, Yulin Huang, Junjie Wu,\n  Haiguang Yang, Jianyu Yang","title":"When Deep Learning Meets Multi-Task Learning in SAR ATR: Simultaneous\n  Target Recognition and Segmentation","comments":null,"journal-ref":"Remote Sensing. 2020, 12(23), 3863","doi":"10.3390/rs12233863","report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the recent advances of deep learning, automatic target recognition (ATR)\nof synthetic aperture radar (SAR) has achieved superior performance. By not\nbeing limited to the target category, the SAR ATR system could benefit from the\nsimultaneous extraction of multifarious target attributes. In this paper, we\npropose a new multi-task learning approach for SAR ATR, which could obtain the\naccurate category and precise shape of the targets simultaneously. By\nintroducing deep learning theory into multi-task learning, we first propose a\nnovel multi-task deep learning framework with two main structures: encoder and\ndecoder. The encoder is constructed to extract sufficient image features in\ndifferent scales for the decoder, while the decoder is a tasks-specific\nstructure which employs these extracted features adaptively and optimally to\nmeet the different feature demands of the recognition and segmentation.\nTherefore, the proposed framework has the ability to achieve superior\nrecognition and segmentation performance. Based on the Moving and Stationary\nTarget Acquisition and Recognition (MSTAR) dataset, experimental results show\nthe superiority of the proposed framework in terms of recognition and\nsegmentation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:03:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Chenwei",""],["Pei","Jifang",""],["Wang","Zhiyong",""],["Huang","Yulin",""],["Wu","Junjie",""],["Yang","Haiguang",""],["Yang","Jianyu",""]]}
{"id":"2308.07094","submitter":"Ahmad Moursy ElSayed","authors":"George Lazarides, Rinku Maji, Ahmad Moursy, Qaisar Shafi","title":"Inflation, superheavy metastable strings and gravitational waves in\n  non-supersymmetric flipped SU(5)","comments":"18 pages, 2 figures and 5 tables. Additional references and two\n  footnotes have been included in version 2","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the NANOGrav 15 year data and other recent investigations of\nstochastic gravitational background radiation based on pulsar timing arrays, we\nshow how superheavy strings survive inflation but the slightly heavier\nmonopoles do not in a non-supersymmetric hybrid inflation model based on\nflipped $SU(5)$. With the dimensionless string tension parameter $G \\mu\\approx\n10^{-7}-10^{-6}$, the gravitational wave spectrum emitted by the strings, which\nare metastable due to breaking caused by monopole-antimonopole quantum\nmechanical tunneling, is compatible with the latest NANOGrav measurement as\nwell as the advanced LIGO-VIRGO third run data. For $G \\mu \\approx 10^{-6}$,\nthe string network undergoes about 30 $e$-foldings of inflation which\nsuppresses the spectrum in the LIGO-VIRGO frequency range. With the symmetry\nbreaking chain $SU(5) \\times U(1)_X \\to SU(3)_c \\times SU(2)_L\\times U(1)_Z\n\\times U(1)_X \\to SU(3)_c \\times SU(2)_L \\times U(1)_ Y$, the estimated proton\nlifetime is of order $10^{34}-10^{36}$ yrs.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:05:52 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 03:05:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lazarides","George",""],["Maji","Rinku",""],["Moursy","Ahmad",""],["Shafi","Qaisar",""]]}
{"id":"2308.07095","submitter":"Moritz Jasper","authors":"Moritz Jasper and Stefan K\\\"opsell","title":"Secure and Dynamic Publish/Subscribe: LCMsec","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose LCMsec, a brokerless, decentralised Publish/Subscribe protocol. It\naims to provide low-latency and high-throughput message-passing for IoT and\nautomotive applications while providing much-needed security functionalities to\ncombat emerging cyber-attacks in that domain. LCMsec is an extension for the\nLightweight Communications and Marshalling (LCM) protocol. We extend this\nprotocol by providing not only authenticated encryption of the messages in\ntransit, but also a group discovery protocol inspired by the Raft consensus\nprotocol. The Dutta-Barua group key agreement is used to agree upon a shared\nsymmetric key among subscribers and publishers on a topic. By using a shared\ngroup key, we reduce the key agreement overhead and the number of message\nauthentication codes (MACs) per message compared to existing proposals for\nsecure brokerless Publish/Subscribe protocols, which establish a symmetric key\nbetween each publisher and subscriber and append multiple MACs to each message.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:08:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jasper","Moritz",""],["K\u00f6psell","Stefan",""]]}
{"id":"2308.07096","submitter":"Mohammed Kharma","authors":"Mohammed Kharma, Ahmed Sabbah and Mustafa Jarrar","title":"Towards a Cloud-Based Ontology for Service Model Security -- Technical\n  Report","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The adoption of cloud computing has brought significant advancements in the\noperational models of businesses. However, this shift also brings new security\nchallenges by expanding the attack surface. The offered services in cloud\ncomputing have various service models. Each cloud service model has a defined\nresponsibility divided based on the stack layers between the service user and\ntheir cloud provider. Regardless of its service model, each service is\nconstructed from sub-components and services running on the underlying layers.\nIn this paper, we aim to enable more transparency and visibility by designing\nan ontology that links the provider's services with the sub-components used to\ndeliver the service. Such breakdown for each cloud service sub-components\nenables the end user to track the vulnerabilities on the service level or one\nof its sub-components. Such information can result in a better understanding\nand management of reported vulnerabilities on the sub-components level and\ntheir impact on the offered services by the cloud provider. Our ontology and\nsource code are published as an open-source and accessible via GitHub:\n\\href{https://github.com/mohkharma/cc-ontology}{mohkharma/cc-ontology}\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:08:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kharma","Mohammed",""],["Sabbah","Ahmed",""],["Jarrar","Mustafa",""]]}
{"id":"2308.07097","submitter":"Achment Chalil","authors":"A. Chalil (1 and 2), O. Litaize (1) T. Materna (2), A. Chebboubi (1)\n  ((1) CEA, DES, IRESNE, DER, Cadarache F-13108 Saint-Paul-Lez-Durance, France,\n  (2) IRFU, CEA, Universit\\'e Paris-Saclay, 91191 Gif-sur-Yvette, France)","title":"Quantification of spin alignment in fission by simultaneous treatment of\n  gamma and conversion electron angular distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The study of the angular momentum properties of fission fragments can shed\nlight about the complex mechanisms that characterize the fission process. One\nquantity that is of significant interest, and has not yet been studied\nadequately, is the alignment of the fragments, which is the cause of anisotropy\nof the {\\gamma} rays along the fission axis and has been observed in various\npast and recent experiments. In this work, we have performed calculations using\nthe FIFRELIN code, in an attempt to quantify the alignment of the nuclear spins\nafter neutron-emission. Under the statistical tensor formalism of angular\ndistributions, the conversion-electron and the {\\gamma}-ray angular\ndistributions can be treated simultaneously in an event-by-event calculation.\nThis enables a first prediction of the conversion-electron angular distribution\nwith respect to the fission axis. An average value for the alignment of fission\nfragments is deduced for 252Cf, with the use of recent experimental data. The\nmethod used for the present work can serve as a starting point for future\ntheoretical and experimental studies in terms of {\\gamma} and\nconversion-electron spectroscopy in view of studying the spin alignment of\nindividual fission fragments, which could further improve our understanding on\nthe process of fission.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:12:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chalil","A.","","1 and 2"],["Litaize","O.",""],["Materna","T.",""],["Chebboubi","A.",""]]}
{"id":"2308.07098","submitter":"Alvaro P. Raposo","authors":"Juan J. Morales-Ruiz and \\'Alvaro P. Raposo","title":"A note on the geodesic deviation equation for null geodesics in the\n  Schwarzschild black-hole","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We use the Hamiltonian formulation of the geodesic equation in the\nSchwarzschild space-time so as to get the variational equation as the\ncounterpart of the Jacobi equation in this approach. In this context we are\nable to apply the Morales-Ramis theorem to link the integrability of the\ngeodesic equation to the integrability, in the sense of differential Galois\ntheory, of the variational equation. This link is strong enough to hold even on\ngeodesics for which the usual conserved quantities fail to be independent, as\nis the case of circular geodesics. We show explicitly the particular cases of\nsome null geodesics and their variational equations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:20:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Morales-Ruiz","Juan J.",""],["Raposo","\u00c1lvaro P.",""]]}
{"id":"2308.07099","submitter":"Tanmay Inamdar","authors":"Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh,\n  Meirav Zehavi","title":"Kernelization for Spreading Points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the following problem about dispersing points. Given a set of\npoints in the plane, the task is to identify whether by moving a small number\nof points by small distance, we can obtain an arrangement of points such that\nno pair of points is ``close\" to each other. More precisely, for a family of\n$n$ points, an integer $k$, and a real number $d > 0$, we ask whether at most\n$k$ points could be relocated, each point at distance at most $d$ from its\noriginal location, such that the distance between each pair of points is at\nleast a fixed constant, say $1$. A number of approximation algorithms for\nvariants of this problem, under different names like distant representatives,\ndisk dispersing, or point spreading, are known in the literature. However, to\nthe best of our knowledge, the parameterized complexity of this problem remains\nwidely unexplored. We make the first step in this direction by providing a\nkernelization algorithm that, in polynomial time, produces an equivalent\ninstance with $O(d^2k^3)$ points. As a byproduct of this result, we also design\na non-trivial fixed-parameter tractable (FPT) algorithm for the problem,\nparameterized by $k$ and $d$. Finally, we complement the result about\npolynomial kernelization by showing a lower bound that rules out the existence\nof a kernel whose size is polynomial in $k$ alone, unless $\\mathsf{NP}\n\\subseteq \\mathsf{coNP}/\\text{poly}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:23:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fomin","Fedor V.",""],["Golovach","Petr A.",""],["Inamdar","Tanmay",""],["Saurabh","Saket",""],["Zehavi","Meirav",""]]}
{"id":"2308.07100","submitter":"William Wolf","authors":"William J. Wolf and James Read","title":"The Non-Relativistic Geometric Trinity of Gravity","comments":"v2 minor formatting/typo corrections","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We complete a non-relativistic geometric trinity of gravity, by (a) taking\nthe non-relativistic limit of the well-known geometric trinity of gravity, and\n(b) converting the curvature degrees of freedom of Newton-Cartan theory to\npurely non-metric degrees of freedom.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:24:17 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 02:22:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wolf","William J.",""],["Read","James",""]]}
{"id":"2308.07101","submitter":"Thomas Karam","authors":"Thomas Karam","title":"Small sunflowers and the structure of slice rank decompositions","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $d \\ge 3$ be an integer. We show that whenever an order-$d$ tensor admits\n$d+1$ decompositions according to Tao's slice rank, if the linear subspaces\nspanned by their one-variable functions constitute a sunflower for each choice\nof special coordinate, then the tensor admits a decomposition where these\nlinear subspaces are contained in the centers of these respective sunflowers.\nAs an application, we deduce that for every nonnegative integer $k$ and every\nfinite field $\\mathbb{F}$ there exists an integer $C(d,k,|\\mathbb{F}|)$ such\nthat every order-$d$ tensor with slice rank $k$ over $\\mathbb{F}$ admits at\nmost $C(d,k,|\\mathbb{F}|)$ decompositions with length $k$, up to a class of\ntransformations that can be easily described.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:29:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Karam","Thomas",""]]}
{"id":"2308.07102","submitter":"Xiao Wang","authors":"Tian Gan, Xiao Wang, Yan Sun, Jianlong Wu, Qingpei Guo, and Liqiang\n  Nie","title":"Temporal Sentence Grounding in Streaming Videos","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612120","report-no":null,"categories":"cs.CV cs.CL cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper aims to tackle a novel task - Temporal Sentence Grounding in\nStreaming Videos (TSGSV). The goal of TSGSV is to evaluate the relevance\nbetween a video stream and a given sentence query. Unlike regular videos,\nstreaming videos are acquired continuously from a particular source, and are\nalways desired to be processed on-the-fly in many applications such as\nsurveillance and live-stream analysis. Thus, TSGSV is challenging since it\nrequires the model to infer without future frames and process long historical\nframes effectively, which is untouched in the early methods. To specifically\naddress the above challenges, we propose two novel methods: (1) a TwinNet\nstructure that enables the model to learn about upcoming events; and (2) a\nlanguage-guided feature compressor that eliminates redundant visual frames and\nreinforces the frames that are relevant to the query. We conduct extensive\nexperiments using ActivityNet Captions, TACoS, and MAD datasets. The results\ndemonstrate the superiority of our proposed methods. A systematic ablation\nstudy also confirms their effectiveness.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:30:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gan","Tian",""],["Wang","Xiao",""],["Sun","Yan",""],["Wu","Jianlong",""],["Guo","Qingpei",""],["Nie","Liqiang",""]]}
{"id":"2308.07103","submitter":"Mat\\v{e}j Stehl\\'ik","authors":"Tom\\'a\\v{s} Kaiser, Mat\\v{e}j Stehl\\'ik","title":"Fan's lemma via bistellar moves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pachner proved that all closed combinatorially equivalent combinatorial\nmanifolds can be transformed into each other by a finite sequence of bistellar\nmoves. We prove an analogue of Pachner's theorem for combinatorial manifolds\nwith a free Z2-action, and use it to give a combinatorial proof of Fan's lemma\nabout labellings of centrally symmetric triangulations of spheres. Similarly to\nother combinatorial proofs, we must assume an additional property of the\ntriangulation for the proof to work. However, unlike the other combinatorial\nproofs, no such assumption is needed for dimensions at most 3.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:32:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kaiser","Tom\u00e1\u0161",""],["Stehl\u00edk","Mat\u011bj",""]]}
{"id":"2308.07104","submitter":"Kailun Yang","authors":"Zhonghua Yi, Hao Shi, Kailun Yang, Qi Jiang, Yaozu Ye, Ze Wang, Kaiwei\n  Wang","title":"FocusFlow: Boosting Key-Points Optical Flow Estimation for Autonomous\n  Driving","comments":"The source code of FocusFlow will be available at\n  https://github.com/ZhonghuaYi/FocusFlow_official","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Key-point-based scene understanding is fundamental for autonomous driving\napplications. At the same time, optical flow plays an important role in many\nvision tasks. However, due to the implicit bias of equal attention on all\npoints, classic data-driven optical flow estimation methods yield less\nsatisfactory performance on key points, limiting their implementations in\nkey-point-critical safety-relevant scenarios. To address these issues, we\nintroduce a points-based modeling method that requires the model to learn\nkey-point-related priors explicitly. Based on the modeling method, we present\nFocusFlow, a framework consisting of 1) a mix loss function combined with a\nclassic photometric loss function and our proposed Conditional Point Control\nLoss (CPCL) function for diverse point-wise supervision; 2) a conditioned\ncontrolling model which substitutes the conventional feature encoder by our\nproposed Condition Control Encoder (CCE). CCE incorporates a Frame Feature\nEncoder (FFE) that extracts features from frames, a Condition Feature Encoder\n(CFE) that learns to control the feature extraction behavior of FFE from input\nmasks containing information of key points, and fusion modules that transfer\nthe controlling information between FFE and CFE. Our FocusFlow framework shows\noutstanding performance with up to +44.5% precision improvement on various key\npoints such as ORB, SIFT, and even learning-based SiLK, along with exceptional\nscalability for most existing data-driven optical flow methods like PWC-Net,\nRAFT, and FlowFormer. Notably, FocusFlow yields competitive or superior\nperformances rivaling the original models on the whole frame. The source code\nwill be available at https://github.com/ZhonghuaYi/FocusFlow_official.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:35:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yi","Zhonghua",""],["Shi","Hao",""],["Yang","Kailun",""],["Jiang","Qi",""],["Ye","Yaozu",""],["Wang","Ze",""],["Wang","Kaiwei",""]]}
{"id":"2308.07105","submitter":"Michael Baake","authors":"Michael Baake (U Bielefeld), Alan Haynes (U Houston)","title":"Convergence of Fourier--Bohr coefficients for regular Euclidean model\n  sets","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math-ph math.MP math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is well known that the Fourier--Bohr coefficients of regular model sets\nexist and are uniformly converging, volume-averaged exponential sums. Several\nproofs for this statement are known, all of which use fairly abstract\nmachinery. For instance, there is one proof that uses dynamical systems theory\nand another one based on Meyer's theory of harmonious sets. Nevertheless, since\nthe coefficients can be defined in an elementary way, it would be nice to have\nan alternative proof by similarly elementary means, which is to say by standard\nestimates of exponential sums under an appropriate use of the Poisson summation\nformula. Here, we present such a proof for the class of regular Euclidean model\nsets, that is, model sets with Euclidean physical and internal spaces and\ntopologically regular windows with almost no boundary.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:36:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Baake","Michael","","U Bielefeld"],["Haynes","Alan","","U Houston"]]}
{"id":"2308.07106","submitter":"Michael Hoss","authors":"Michael Hoss","title":"Checklist to Transparently Define Test Oracles for TP, FP, and FN\n  Objects in Automated Driving","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Popular test oracles for the perception subsystem of driving automation\nsystems identify true-positive (TP), false-positive (FP), and false-negative\n(FN) objects. Oracle transparency is needed for comparing test results and for\nsafety cases. To date, there exists a common notion of TPs, FPs, and FNs in the\nfield, but apparently no published way to comprehensively define their oracles.\nTherefore, this paper provides a checklist of functional aspects and\nimplementation details that affect the oracle behavior. Besides labeling\npolicies of the test set, we cover fields of view, occlusion handling,\nsafety-relevant areas, matching criteria, temporal and probabilistic issues,\nand further aspects. Even though our checklist can hardly be formalized, it can\nhelp practitioners maximize the transparency of their oracles, which, in turn,\nmakes statements on object perception more reliable and comparable.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:38:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hoss","Michael",""]]}
{"id":"2308.07107","submitter":"Yutao Zhu","authors":"Yutao Zhu, Huaying Yuan, Shuting Wang, Jiongnan Liu, Wenhan Liu,\n  Chenlong Deng, Zhicheng Dou, and Ji-Rong Wen","title":"Large Language Models for Information Retrieval: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a primary means of information acquisition, information retrieval (IR)\nsystems, such as search engines, have integrated themselves into our daily\nlives. These systems also serve as components of dialogue, question-answering,\nand recommender systems. The trajectory of IR has evolved dynamically from its\norigins in term-based methods to its integration with advanced neural models.\nWhile the neural models excel at capturing complex contextual signals and\nsemantic nuances, thereby reshaping the IR landscape, they still face\nchallenges such as data scarcity, interpretability, and the generation of\ncontextually plausible yet potentially inaccurate responses. This evolution\nrequires a combination of both traditional methods (such as term-based sparse\nretrieval methods with rapid response) and modern neural architectures (such as\nlanguage models with powerful language understanding capacity). Meanwhile, the\nemergence of large language models (LLMs), typified by ChatGPT and GPT-4, has\nrevolutionized natural language processing due to their remarkable language\nunderstanding, generation, generalization, and reasoning abilities.\nConsequently, recent research has sought to leverage LLMs to improve IR\nsystems. Given the rapid evolution of this research trajectory, it is necessary\nto consolidate existing methodologies and provide nuanced insights through a\ncomprehensive overview. In this survey, we delve into the confluence of LLMs\nand IR systems, including crucial aspects such as query rewriters, retrievers,\nrerankers, and readers. Additionally, we explore promising directions within\nthis expanding field.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:47:22 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 12:09:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhu","Yutao",""],["Yuan","Huaying",""],["Wang","Shuting",""],["Liu","Jiongnan",""],["Liu","Wenhan",""],["Deng","Chenlong",""],["Dou","Zhicheng",""],["Wen","Ji-Rong",""]]}
{"id":"2308.07108","submitter":"Yamir Moreno","authors":"Elena Candellone, Alberto Aleta, Henrique Ferraz de Arruda, Erik\n  Meijaard and Yamir Moreno","title":"Understanding the Vegetable Oil Debate and Its Implications for\n  Sustainability through Social Media","comments":"26 pages including figures and the SM","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The global production and consumption of vegetable oils have sparked several\ndiscussions on sustainable development. This study analyzes over 20 million\ntweets related to vegetable oils to explore the key factors shaping public\nopinion. We found that coconut, olive, and palm oils dominate social media\ndiscourse despite their lower contribution to overall global vegetable\nproduction. The discussion about olive and palm oils remarkably correlates with\nTwitter's growth, while coconut increases more significantly with bursts of\nactivity. Discussions around coconut and olive oils primarily focus on health,\nbeauty, and food, while palm draws attention to pressing environmental\nconcerns. Overall, virality is related to environmental issues and negative\nconnotations. In the context of Sustainable Development Goals, this study\nhighlights the multifaceted nature of the vegetable oil debate and its\ndisconnection from scientific discussions. Our research sheds light on the\npower of social media in shaping public perception, providing insights into\nsustainable development strategies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:48:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Candellone","Elena",""],["Aleta","Alberto",""],["de Arruda","Henrique Ferraz",""],["Meijaard","Erik",""],["Moreno","Yamir",""]]}
{"id":"2308.07109","submitter":"Romain Tirole","authors":"Romain Tirole, Benjamin Tilmann, Leonardo de S. Menezes, Stefano\n  Vezzoli, Riccardo Sapienza, Stefan A. Maier","title":"Nonlinear dielectric epsilon near-zero hybrid nanogap antennas","comments":"main: 18 pages, 4 figues, supplemental: 8 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-index Mie-resonant dielectric nanostructures provide a new framework to\nmanipulate light at the nanoscale. In particular their local field confinement\ntogether with their inherently low losses at frequencies below their band-gap\nenergy allows to efficiently boost and control linear and nonlinear optical\nprocesses. Here, we investigate nanoantennas composed of a thin indium-tin\noxide layer in the center of a dielectric Gallium Phosphide nanodisk. While the\nlinear response is similar to that of a pure GaP nanodisk, we show that the\nsecond and third-harmonic signals of the nanogap antenna are boosted at\nresonance. Linear and nonlinear finite-difference time-domain simulations show\nthat the high refractive index contrast leads to strong field confinement\ninside the antenna's ITO layer. Measurement of ITO and GaP nonlinear\nsusceptibilities deliver insight on how to engineer nonlinear nanogap antennas\nfor higher efficiencies for future nanoscale devices.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:49:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tirole","Romain",""],["Tilmann","Benjamin",""],["Menezes","Leonardo de S.",""],["Vezzoli","Stefano",""],["Sapienza","Riccardo",""],["Maier","Stefan A.",""]]}
{"id":"2308.07110","submitter":"Xijun Wang","authors":"Xijun Wang, Xiaojie Chu, Chunrui Han, Xiangyu Zhang","title":"SCSC: Spatial Cross-scale Convolution Module to Strengthen both CNNs and\n  Transformers","comments":"ICCV2023 Workshop (New Ideas in Vision Transformers)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a module, Spatial Cross-scale Convolution (SCSC), which\nis verified to be effective in improving both CNNs and Transformers. Nowadays,\nCNNs and Transformers have been successful in a variety of tasks. Especially\nfor Transformers, increasing works achieve state-of-the-art performance in the\ncomputer vision community. Therefore, researchers start to explore the\nmechanism of those architectures. Large receptive fields, sparse connections,\nweight sharing, and dynamic weight have been considered keys to designing\neffective base models. However, there are still some issues to be addressed:\nlarge dense kernels and self-attention are inefficient, and large receptive\nfields make it hard to capture local features. Inspired by the above analyses\nand to solve the mentioned problems, in this paper, we design a general module\ntaking in these design keys to enhance both CNNs and Transformers. SCSC\nintroduces an efficient spatial cross-scale encoder and spatial embed module to\ncapture assorted features in one layer. On the face recognition task,\nFaceResNet with SCSC can improve 2.7% with 68% fewer FLOPs and 79% fewer\nparameters. On the ImageNet classification task, Swin Transformer with SCSC can\nachieve even better performance with 22% fewer FLOPs, and ResNet with CSCS can\nimprove 5.3% with similar complexity. Furthermore, a traditional network (e.g.,\nResNet) embedded with SCSC can match Swin Transformer's performance.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:49:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Xijun",""],["Chu","Xiaojie",""],["Han","Chunrui",""],["Zhang","Xiangyu",""]]}
{"id":"2308.07111","submitter":"Taras Radul","authors":"Dawid Krasi\\'nski, Taras Radul","title":"On idempotent convexities and idempotent barycenter maps","comments":"arXiv admin note: text overlap with arXiv:2307.12787","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider an isomorphism between the idempotent convexity based on the\nmaximum and the addition operations and the idempotent measure convexity on the\nmaximum and the multiplication operations. We use this isomorphism to\ninvestigate topological properties of the barycenter map related to the maximum\nand the multiplication operations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:50:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Krasi\u0144ski","Dawid",""],["Radul","Taras",""]]}
{"id":"2308.07112","submitter":"Alexander Sandrock","authors":"Alexander Sandrock, Jean-Marco Alameddine and Felix Riehn (for the\n  CORSIKA 8 collaboration)","title":"Validation of Electromagnetic Showers in CORSIKA 8","comments":"Proceedings of the 38th International Cosmic Ray Conference (ICRC) in\n  Nagoya, Japan","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":"  The air shower simulation code CORSIKA has served as a key part of the\nsimulation chain for numerous astroparticle physics experiments over the past\ndecades. Due to retirement of the original developers and the increasingly\ndifficult maintenance of the monolithic Fortran code of CORSIKA, a new air\nshower simulation framework has been developed over the course of the last\nyears in C++, called CORSIKA 8. Besides the hadronic and muonic component, the\nelectromagnetic component is one of the key constituents of an air shower. The\ncascade producing the electromagnetic component of an air shower is driven by\nbremsstrahlung and photoproduction of electron-positron pairs. At ultrahigh\nenergies or in media with high densities, the bremsstrahlung and pair\nproduction processes are suppressed by the Landau-Pomeranchuk-Migdal (LPM)\neffect, which leads to more elongated showers compared to showers without the\nLPM suppression. Furthermore, photons at higher energies can produce muon pairs\nor interact hadronically with nucleons in the target medium, producing a muon\ncomponent in electromagnetic air showers. In this contribution, we compare\nelectromagnetic showers simulated with the latest Fortran version of CORSIKA\nand CORSIKA 8, which uses the library PROPOSAL for the electromagnetic\ncomponent. While earlier validations of CORSIKA 8 electromagnetic showers\nfocused on showers of lower energy, the recent implementation of the LPM\neffect, photo pair production of muons, and of photohadronic interactions\nallows now to make a physics-complete comparison also at high energies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:50:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sandrock","Alexander","","for the\n  CORSIKA 8 collaboration"],["Alameddine","Jean-Marco","","for the\n  CORSIKA 8 collaboration"],["Riehn","Felix","","for the\n  CORSIKA 8 collaboration"]]}
{"id":"2308.07113","submitter":"Sergei Kuzenko","authors":"Sergei M. Kuzenko and Jake C. Stirling","title":"New duality-invariant models for nonlinear supersymmetric\n  electrodynamics","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a new family of $\\mathsf{U}(1)$ duality-invariant models for\nnonlinear ${\\cal N}=1$ supersymmetric electrodynamics coupled to supergravity.\nThis family includes the Cribiori-Farakos-Tournoy-van Proeyen\nsupergravity-matter theory for spontaneously broken local supersymmetry with a\nnovel Fayet-Iliopoulos term without gauged $R$-symmetry. We present\nsuperconformal duality-invariant models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:50:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kuzenko","Sergei M.",""],["Stirling","Jake C.",""]]}
{"id":"2308.07114","submitter":"Hector Pasten","authors":"Hector Pasten","title":"Szpiro's conjecture when the denominator of the $j$-invariant is small","comments":"References updated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove Szpiro's conjecture for elliptic curves over the rationals having\n$j$-invariant with denominator of logarithmic size with respect to its\nnumerator.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:53:39 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 13:46:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pasten","Hector",""]]}
{"id":"2308.07115","submitter":"Barbara Roos","authors":"Barbara Roos, Robert Seiringer","title":"Enhanced BCS Superconductivity at a Corner","comments":"32 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.supr-con math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the critical temperature for superconductivity, defined via the\nlinear BCS equation. We prove that at weak coupling the critical temperature\nfor a sample confined to a quadrant in two dimensions is strictly larger than\nthe one for a half-space, which in turn is strictly larger than the one for\n$\\mathbb{R}^2$. Furthermore, we prove that the relative difference of the\ncritical temperatures vanishes in the weak coupling limit.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:54:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Roos","Barbara",""],["Seiringer","Robert",""]]}
{"id":"2308.07116","submitter":"Bernat Bassols Cornudella","authors":"Bernat Bassols-Cornudella and Jeroen S.W. Lamb","title":"Noise-induced chaos: a conditioned random dynamics perspective","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider transitions to chaos in random dynamical systems induced by an\nincrease of noise amplitude. We show how the emergence of chaos (indicated by a\npositive Lyapunov exponent) in a logistic map with bounded additive noise can\nbe analysed in the framework of conditioned random dynamics through expected\nescape times and conditioned Lyapunov exponents for a compartmental model\nrepresenting the competition between contracting and expanding behaviour. We\nfind that the noise-induced transition to chaos is caused by a rapid decay of\nthe expected escape time from the contracting compartment, while all other\norder parameters remain approximately constant.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:55:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bassols-Cornudella","Bernat",""],["Lamb","Jeroen S. W.",""]]}
{"id":"2308.07117","submitter":"Takuhiro Kaneko","authors":"Takuhiro Kaneko, Hirokazu Kameoka, Kou Tanaka, Shogo Seki","title":"iSTFTNet2: Faster and More Lightweight iSTFT-Based Neural Vocoder Using\n  1D-2D CNN","comments":"Accepted to Interspeech 2023. Project page:\n  https://www.kecl.ntt.co.jp/people/kaneko.takuhiro/projects/istftnet2/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The inverse short-time Fourier transform network (iSTFTNet) has garnered\nattention owing to its fast, lightweight, and high-fidelity speech synthesis.\nIt obtains these characteristics using a fast and lightweight 1D CNN as the\nbackbone and replacing some neural processes with iSTFT. Owing to the\ndifficulty of a 1D CNN to model high-dimensional spectrograms, the frequency\ndimension is reduced via temporal upsampling. However, this strategy\ncompromises the potential to enhance the speed. Therefore, we propose\niSTFTNet2, an improved variant of iSTFTNet with a 1D-2D CNN that employs 1D and\n2D CNNs to model temporal and spectrogram structures, respectively. We designed\na 2D CNN that performs frequency upsampling after conversion in a few-frequency\nspace. This design facilitates the modeling of high-dimensional spectrograms\nwithout compromising the speed. The results demonstrated that iSTFTNet2 made\niSTFTNet faster and more lightweight with comparable speech quality. Audio\nsamples are available at\nhttps://www.kecl.ntt.co.jp/people/kaneko.takuhiro/projects/istftnet2/.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:56:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kaneko","Takuhiro",""],["Kameoka","Hirokazu",""],["Tanaka","Kou",""],["Seki","Shogo",""]]}
{"id":"2308.07118","submitter":"Eugen \\v{S}lapak","authors":"Eugen \\v{S}lapak, Enric Pardo, Mat\\'u\\v{s} Dopiriak, Taras Maksymyuk\n  and Juraj Gazda","title":"Neural radiance fields in the industrial and robotics domain:\n  applications, research opportunities and use cases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The proliferation of technologies, such as extended reality (XR), has\nincreased the demand for high-quality three-dimensional (3D) graphical\nrepresentations. Industrial 3D applications encompass computer-aided design\n(CAD), finite element analysis (FEA), scanning, and robotics. However, current\nmethods employed for industrial 3D representations suffer from high\nimplementation costs and reliance on manual human input for accurate 3D\nmodeling. To address these challenges, neural radiance fields (NeRFs) have\nemerged as a promising approach for learning 3D scene representations based on\nprovided training 2D images. Despite a growing interest in NeRFs, their\npotential applications in various industrial subdomains are still unexplored.\nIn this paper, we deliver a comprehensive examination of NeRF industrial\napplications while also providing direction for future research endeavors. We\nalso present a series of proof-of-concept experiments that demonstrate the\npotential of NeRFs in the industrial domain. These experiments include\nNeRF-based video compression techniques and using NeRFs for 3D motion\nestimation in the context of collision avoidance. In the video compression\nexperiment, our results show compression savings up to 48\\% and 74\\% for\nresolutions of 1920x1080 and 300x168, respectively. The motion estimation\nexperiment used a 3D animation of a robotic arm to train Dynamic-NeRF (D-NeRF)\nand achieved an average peak signal-to-noise ratio (PSNR) of disparity map with\nthe value of 23 dB and an structural similarity index measure (SSIM) 0.97.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:57:12 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 10:46:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["\u0160lapak","Eugen",""],["Pardo","Enric",""],["Dopiriak","Mat\u00fa\u0161",""],["Maksymyuk","Taras",""],["Gazda","Juraj",""]]}
{"id":"2308.07119","submitter":"Allen Zhang","authors":"Yilun Zhang, Yuqian Fu, Xingjun Ma, Lizhe Qi, Jingjing Chen, Zuxuan\n  Wu, Yu-Gang Jiang","title":"On the Importance of Spatial Relations for Few-shot Action Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning has achieved great success in video recognition, yet still\nstruggles to recognize novel actions when faced with only a few examples. To\ntackle this challenge, few-shot action recognition methods have been proposed\nto transfer knowledge from a source dataset to a novel target dataset with only\none or a few labeled videos. However, existing methods mainly focus on modeling\nthe temporal relations between the query and support videos while ignoring the\nspatial relations. In this paper, we find that the spatial misalignment between\nobjects also occurs in videos, notably more common than the temporal\ninconsistency. We are thus motivated to investigate the importance of spatial\nrelations and propose a more accurate few-shot action recognition method that\nleverages both spatial and temporal information. Particularly, a novel Spatial\nAlignment Cross Transformer (SA-CT) which learns to re-adjust the spatial\nrelations and incorporates the temporal information is contributed. Experiments\nreveal that, even without using any temporal information, the performance of\nSA-CT is comparable to temporal based methods on 3/4 benchmarks. To further\nincorporate the temporal information, we propose a simple yet effective\nTemporal Mixer module. The Temporal Mixer enhances the video representation and\nimproves the performance of the full SA-CT model, achieving very competitive\nresults. In this work, we also exploit large-scale pretrained models for\nfew-shot action recognition, providing useful insights for this research\ndirection.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:58:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Yilun",""],["Fu","Yuqian",""],["Ma","Xingjun",""],["Qi","Lizhe",""],["Chen","Jingjing",""],["Wu","Zuxuan",""],["Jiang","Yu-Gang",""]]}
{"id":"2308.07120","submitter":"Alexandra Sasha Luccioni","authors":"Alexandra Sasha Luccioni and Anna Rogers","title":"Mind your Language (Model): Fact-Checking LLMs and their Role in NLP\n  Research and Practice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Much of the recent discourse within the NLP research community has been\ncentered around Large Language Models (LLMs), their functionality and potential\n-- yet not only do we not have a working definition of LLMs, but much of this\ndiscourse relies on claims and assumptions that are worth re-examining. This\nposition paper contributes a definition of LLMs, explicates some of the\nassumptions made regarding their functionality, and outlines the existing\nevidence for and against them. We conclude with suggestions for research\ndirections and their framing in future work.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:00:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Luccioni","Alexandra Sasha",""],["Rogers","Anna",""]]}
{"id":"2308.07121","submitter":"Lukas Rauch","authors":"Lukas Rauch, Raphael Schwinger, Moritz Wirth, Bernhard Sick, Sven\n  Tomforde, Christoph Scholz","title":"Active Bird2Vec: Towards End-to-End Bird Sound Monitoring with\n  Transformers","comments":"Accepted @AI4S ECAI2023. This is the author's version of the work","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.HC cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a shift towards end-to-end learning in bird sound monitoring by\ncombining self-supervised (SSL) and deep active learning (DAL). Leveraging\ntransformer models, we aim to bypass traditional spectrogram conversions,\nenabling direct raw audio processing. ActiveBird2Vec is set to generate\nhigh-quality bird sound representations through SSL, potentially accelerating\nthe assessment of environmental changes and decision-making processes for wind\nfarms. Additionally, we seek to utilize the wide variety of bird vocalizations\nthrough DAL, reducing the reliance on extensively labeled datasets by human\nexperts. We plan to curate a comprehensive set of tasks through Huggingface\nDatasets, enhancing future comparability and reproducibility of bioacoustic\nresearch. A comparative analysis between various transformer models will be\nconducted to evaluate their proficiency in bird sound recognition tasks. We aim\nto accelerate the progression of avian bioacoustic research and contribute to\nmore effective conservation strategies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:06:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rauch","Lukas",""],["Schwinger","Raphael",""],["Wirth","Moritz",""],["Sick","Bernhard",""],["Tomforde","Sven",""],["Scholz","Christoph",""]]}
{"id":"2308.07122","submitter":"Jose Fontanari","authors":"Jos\\'e F. Fontanari, Viviane M. de Oliveira and Paulo R. A. Campos","title":"Evolving division of labor in a response threshold model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE nlin.AO nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The response threshold model explains the emergence of division of labor\n(i.e., task specialization) in an unstructured population by assuming that the\nindividuals have different propensities to work on different tasks. The\nincentive to attend to a particular task increases when the task is left\nunattended and decreases when individuals work on it. Here we derive mean-field\nequations for the stimulus dynamics and show that they exhibit complex\nattractors through period-doubling bifurcation cascades when the noise\ndisrupting the thresholds is small. In addition, we show how the fixed\nthreshold can be set to ensure specialization in both the transient and\nequilibrium regimes of the stimulus dynamics. However, a complete explanation\nof the emergence of division of labor requires that we address the question of\nwhere the threshold variation comes from, starting from a homogeneous\npopulation. We then study a structured population scenario, where the\npopulation is divided into a large number of independent groups of equal size,\nand the fitness of a group is proportional to the weighted mean work performed\non the tasks during a fixed period of time. Using a winner-take-all strategy to\nmodel group competition and assuming an initial homogeneous metapopulation, we\nfind that a substantial fraction of workers specialize in each task, without\nthe need to penalize task switching.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:07:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fontanari","Jos\u00e9 F.",""],["de Oliveira","Viviane M.",""],["Campos","Paulo R. A.",""]]}
{"id":"2308.07123","submitter":"Gabriele Goletto","authors":"Chiara Plizzari, Gabriele Goletto, Antonino Furnari, Siddhant Bansal,\n  Francesco Ragusa, Giovanni Maria Farinella, Dima Damen, Tatiana Tommasi","title":"An Outlook into the Future of Egocentric Vision","comments":"We invite comments, suggestions and corrections here:\n  https://openreview.net/forum?id=V3974SUk1w","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  What will the future be? We wonder! In this survey, we explore the gap\nbetween current research in egocentric vision and the ever-anticipated future,\nwhere wearable computing, with outward facing cameras and digital overlays, is\nexpected to be integrated in our every day lives. To understand this gap, the\narticle starts by envisaging the future through character-based stories,\nshowcasing through examples the limitations of current technology. We then\nprovide a mapping between this future and previously defined research tasks.\nFor each task, we survey its seminal works, current state-of-the-art\nmethodologies and available datasets, then reflect on shortcomings that limit\nits applicability to future research. Note that this survey focuses on software\nmodels for egocentric vision, independent of any specific hardware. The paper\nconcludes with recommendations for areas of immediate explorations so as to\nunlock our path to the future always-on, personalised and life-enhancing\negocentric vision.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:10:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Plizzari","Chiara",""],["Goletto","Gabriele",""],["Furnari","Antonino",""],["Bansal","Siddhant",""],["Ragusa","Francesco",""],["Farinella","Giovanni Maria",""],["Damen","Dima",""],["Tommasi","Tatiana",""]]}
{"id":"2308.07124","submitter":"Niklas Muennighoff","authors":"Niklas Muennighoff, Qian Liu, Armel Zebaze, Qinkai Zheng, Binyuan Hui,\n  Terry Yue Zhuo, Swayam Singh, Xiangru Tang, Leandro von Werra, Shayne Longpre","title":"OctoPack: Instruction Tuning Code Large Language Models","comments":"57 pages (9 main), 39 figures, 16 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Finetuning large language models (LLMs) on instructions leads to vast\nperformance improvements on natural language tasks. We apply instruction tuning\nusing code, leveraging the natural structure of Git commits, which pair code\nchanges with human instructions. We compile CommitPack: 4 terabytes of Git\ncommits across 350 programming languages. We benchmark CommitPack against other\nnatural and synthetic code instructions (xP3x, Self-Instruct, OASST) on the 16B\nparameter StarCoder model, and achieve state-of-the-art performance among\nmodels not trained on OpenAI outputs, on the HumanEval Python benchmark (46.2%\npass@1). We further introduce HumanEvalPack, expanding the HumanEval benchmark\nto a total of 3 coding tasks (Code Repair, Code Explanation, Code Synthesis)\nacross 6 languages (Python, JavaScript, Java, Go, C++, Rust). Our models,\nOctoCoder and OctoGeeX, achieve the best performance across HumanEvalPack among\nall permissive models, demonstrating CommitPack's benefits in generalizing to a\nwider set of languages and natural coding tasks. Code, models and data are\nfreely available at https://github.com/bigcode-project/octopack.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:53:54 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Muennighoff","Niklas",""],["Liu","Qian",""],["Zebaze","Armel",""],["Zheng","Qinkai",""],["Hui","Binyuan",""],["Zhuo","Terry Yue",""],["Singh","Swayam",""],["Tang","Xiangru",""],["von Werra","Leandro",""],["Longpre","Shayne",""]]}
{"id":"2308.07125","submitter":"C. Viallet","authors":"C.M. Viallet","title":"An exercise in experimental mathematics: calculation of the algebraic\n  entropy of a map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We illustrate the use of the notion of derived recurrences introduced earlier\nto evaluate the algebraic entropy of self-maps of projective spaces. We in\nparticular give an example, where a complete proof is still awaited, but where\ndifferent approaches are in such perfect agreement that we can trust we get to\nan exact result. This is an instructive example of experimental mathematics.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:11:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Viallet","C. M.",""]]}
{"id":"2308.07126","submitter":"Christos Chatzis","authors":"Christos Chatzis, Max Pfeffer, Pedro Lind, Evrim Acar","title":"A Time-aware tensor decomposition for tracking evolving patterns","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time-evolving data sets can often be arranged as a higher-order tensor with\none of the modes being the time mode. While tensor factorizations have been\nsuccessfully used to capture the underlying patterns in such higher-order data\nsets, the temporal aspect is often ignored, allowing for the reordering of time\npoints. In recent studies, temporal regularizers are incorporated in the time\nmode to tackle this issue. Nevertheless, existing approaches still do not allow\nunderlying patterns to change in time (e.g., spatial changes in the brain,\ncontextual changes in topics). In this paper, we propose temporal PARAFAC2\n(tPARAFAC2): a PARAFAC2-based tensor factorization method with temporal\nregularization to extract gradually evolving patterns from temporal data.\nThrough extensive experiments on synthetic data, we demonstrate that tPARAFAC2\ncan capture the underlying evolving patterns accurately performing better than\nPARAFAC2 and coupled matrix factorization with temporal smoothness\nregularization.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:13:50 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 09:39:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chatzis","Christos",""],["Pfeffer","Max",""],["Lind","Pedro",""],["Acar","Evrim",""]]}
{"id":"2308.07127","submitter":"Taige Chang","authors":"Taige Chang, Xianghui Cao and Wei Xing Zheng","title":"A Lightweight Sensor Scheduler Based on AoI Function for Remote State\n  Estimation over Lossy Wireless Channels","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 investigates the problem of sensor scheduling for remotely\nestimating the states of heterogeneous dynamical systems over resource-limited\nand lossy wireless channels. Considering the low time complexity and high\nversatility requirements of schedulers deployed on the transport layer, we\npropose a lightweight scheduler based on an Age of Information (AoI) function\nbuilt with the tight scalar upper bound of the remote estimation error. We show\nthat the proposed scheduler is indexable and sub-optimal. We derive an upper\nand a lower bound of the proposed scheduler and give stability conditions for\nestimation error. Numerical simulations demonstrate that, compared to existing\npolicies, the proposed scheduler achieves estimation performance very close to\nthe optimal at a much lower computation time.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:24:23 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 11:26:51 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chang","Taige",""],["Cao","Xianghui",""],["Zheng","Wei Xing",""]]}
{"id":"2308.07128","submitter":"Federico Santagati","authors":"Matteo Levi, Stefano Meda, Federico Santagati, Maria Vallarino","title":"Hardy-Littlewood maximal operators on trees with bounded geometry","comments":"30 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 study the $L^p$ boundedness of the centred and the uncentred\nHardy--Littlewood maximal operators on the class $\\Upsilon_{a,b}$, $2\\leq a\\leq\nb$, of trees with $(a,b)$-bounded geometry. We find the sharp range of $p$,\ndepending on $a$ and $b$, where the centred maximal operator is bounded on\n$L^p(\\mathfrak T)$ for all $\\mathfrak T$ in $\\Upsilon_{a,b}$. We show that\nthere exists a tree in $\\Upsilon_{a,b}$ for which the uncentred maximal\nfunction is bounded on $L^p$ if and only if $p=\\infty$. We also extend these\nresults to graphs which are strictly roughly isometric, in the sense of Kanai,\nto trees in the class $\\Upsilon_{a,b}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:28:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Levi","Matteo",""],["Meda","Stefano",""],["Santagati","Federico",""],["Vallarino","Maria",""]]}
{"id":"2308.07129","submitter":"Viktorija Paneva","authors":"Alicja Kiluk, Viktorija Paneva, Sofia Seinfeld, J\\\"org M\\\"uller","title":"The Impact of Different Virtual Work Environments on Flow, Performance,\n  User Emotions, and Preferences","comments":"6 pages, 8 figures. This is the author's version. Final version of\n  records is to appear in 2023 IEEE International Symposium on Mixed and\n  Augmented Reality Adjunct (ISMAR-Adjunct)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research explores how different virtual work environments, differing in\nthe type and amount of elements they include, impact users' flow, performance,\nemotional state, and preferences. Pre-study interviews were conducted to inform\nthe design of three VR work environments: the Dark Room, the Empty Room, and\nthe Furnished Room. Fifteen participants took part in a user study where they\nengaged in a logic-based task simulating deep work while experiencing each\nenvironment. The findings suggest that while objective performance measures did\nnot differ significantly, subjective experiences and perceptions varied across\nthe environments. Participants reported feeling less distracted and more\nfocused in the Dark Room and the Empty Room compared to the Furnished Room. The\nEmpty Room was associated with the highest levels of relaxation and calmness,\nwhile the Furnished Room was perceived as visually appealing yet more\ndistracting. These findings highlight the variability of user preferences and\nemphasise the importance of considering user comfort and well-being in the\ndesign of virtual work environments. The study contributes to the better\nunderstanding of virtual workspaces and provides insights for designing\nenvironments that promote flow, productivity, and user well-being.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:29:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kiluk","Alicja",""],["Paneva","Viktorija",""],["Seinfeld","Sofia",""],["M\u00fcller","J\u00f6rg",""]]}
{"id":"2308.07130","submitter":"Hernan Haimovich","authors":"Jose L. Mancilla-Aguilar and Hernan Haimovich","title":"Time-delay systems that defy intuition: nonrobust forward completeness\n  and related (non)properties","comments":"Submitted to Automatica. Print ISSN: 0005-1098, Online ISSN:\n  1873-2836","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An example of a time-invariant time-delay system that is uniformly globally\nattractive and Lyapunov stable, hence forward complete, but whose reachability\nsets from bounded initial conditions are not bounded over compact time\nintervals is provided. This gives a negative answer to two current conjectures\nby showing that (i) forward completeness is not equivalent to robust forward\ncompleteness and (ii) global asymptotic stability is not equivalent to uniform\nglobal asymptotic stability. In addition, a novel characterization of robust\nforward completeness for usually encountered classes of time-delay systems is\nprovided. This characterization relates robust forward completeness of the\ntime-delay system with the forward completeness of an associated nondelayed\nfinite-dimensional system.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:35:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mancilla-Aguilar","Jose L.",""],["Haimovich","Hernan",""]]}
{"id":"2308.07131","submitter":"Afsaneh Mahanipour","authors":"Afsaneh Mahanipour, Hana Khamfroush","title":"Multimodal Multiple Federated Feature Construction Method for IoT\n  Environments","comments":"This paper has been accepted at 2023 IEEE Global Communications\n  Conference: IoT and Sensor Networks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fast development of Internet-of-Things (IoT) devices and applications has\nled to vast data collection, potentially containing irrelevant, noisy, or\nredundant features that degrade learning model performance. These collected\ndata can be processed on either end-user devices (clients) or edge/cloud\nserver. Feature construction is a pre-processing technique that can generate\ndiscriminative features and reveal hidden relationships between original\nfeatures within a dataset, leading to improved performance and reduced\ncomputational complexity of learning models. Moreover, the communication cost\nbetween clients and edge/cloud server can be minimized in situations where a\ndataset needs to be transmitted for further processing. In this paper, the\nfirst federated feature construction (FFC) method called multimodal multiple\nFFC (MMFFC) is proposed by using multimodal optimization and gravitational\nsearch programming algorithm. This is a collaborative method for constructing\nmultiple high-level features without sharing clients' datasets to enhance the\ntrade-off between accuracy of the trained model and overall communication cost\nof the system, while also reducing computational complexity of the learning\nmodel. We analyze and compare the accuracy-cost trade-off of two scenarios,\nnamely, 1) MMFFC federated learning (FL), using vanilla FL with pre-processed\ndatasets on clients and 2) MMFFC centralized learning, transferring\npre-processed datasets to an edge server and using centralized learning model.\nThe results on three datasets for the first scenario and eight datasets for the\nsecond one demonstrate that the proposed method can reduce the size of datasets\nfor about 60\\(\\%\\), thereby reducing communication cost and improving accuracy\nof the learning models tested on almost all datasets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:36:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mahanipour","Afsaneh",""],["Khamfroush","Hana",""]]}
{"id":"2308.07132","submitter":"Sai Subramanyam Thoota","authors":"Sai Subramanyam Thoota, Joao Vieira, and Erik G. Larsson","title":"Data-Driven Robust Beamforming for Initial Access","comments":"6 pages, 6 figures, Accepted in 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":"  We consider a robust beamforming problem where large amount of downlink (DL)\nchannel state information (CSI) data available at a multiple antenna access\npoint (AP) is used to improve the link quality to a user equipment (UE) for\nbeyond-5G and 6G applications such as environment-specific initial access (IA)\nor wireless power transfer (WPT). As the DL CSI available at the current\ninstant may be imperfect or outdated, we propose a novel scheme which utilizes\nthe (unknown) correlation between the antenna domain and physical domain to\nlocalize the possible future UE positions from the historical CSI database.\nThen, we develop a codebook design procedure to maximize the minimum sum\nbeamforming gain to that localized CSI neighborhood. We also incorporate a UE\nspecific parameter to enlarge the neighborhood to robustify the link further.\nWe adopt an indoor channel model to demonstrate the performance of our\nsolution, and benchmark against a usually optimal (but now sub-optimal due to\noutdated CSI) maximum ratio transmission (MRT) and a subspace based method.We\nnumerically show that our algorithm outperforms the other methods by a large\nmargin. This shows that customized environment-specific solutions are important\nto solve many future wireless applications, and we have paved the way to\ndevelop further data-driven approaches.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:38:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Thoota","Sai Subramanyam",""],["Vieira","Joao",""],["Larsson","Erik G.",""]]}
{"id":"2308.07133","submitter":"Shi-Ping He","authors":"Shi-Ping He","title":"Handbook of the analytic and expansion formulae for the muon $g-2$\n  anomaly","comments":"25 pages, 1 captioned figure, 2 tables. This manuscript will continue\n  to be updated. Suggestions and comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Since announcement of the muon $g-2$ anomaly, plenty of papers have devoted\nto this anomaly. The approximate formulae are always adopted when determining\nthe new physics contributions to $(g-2)_{\\mu}$, while clear scope of\napplications are always absent. This manuscript is dedicated to the\ncomprehensive analytical results and approximations for the canonical\ninteractions at one-loop level, which can be a useful handbook for the model\nbuilders. Here, we only collect the analytic and approximate expressions for\nthe scalar mediator case. For the expressions of vector mediator case, they\nwill appear in the future.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:39:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["He","Shi-Ping",""]]}
{"id":"2308.07134","submitter":"Yongfeng Zhang","authors":"Ruosong Ye, Caiqi Zhang, Runhui Wang, Shuyuan Xu, Yongfeng Zhang","title":"Natural Language is All a Graph Needs","comments":"21 pages, 2 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence of large-scale pre-trained language models, such as ChatGPT,\nhas revolutionized various research fields in artificial intelligence.\nTransformers-based large language models (LLMs) have gradually replaced CNNs\nand RNNs to unify fields of computer vision and natural language processing.\nCompared with the data that exists relatively independently such as images,\nvideos or texts, graph is a type of data that contains rich structural and\nrelational information. Meanwhile, natural language, as one of the most\nexpressive mediums, excels in describing complex structures. However, existing\nwork on incorporating graph learning problems into the generative language\nmodeling framework remains very limited. As the importance of large language\nmodels continues to grow, it becomes essential to explore whether LLMs can also\nreplace GNNs as the foundation model for graphs. In this paper, we propose\nInstructGLM (Instruction-finetuned Graph Language Model), systematically design\nhighly scalable prompts based on natural language instructions, and use natural\nlanguage to describe the geometric structure and node features of the graph for\ninstruction tuning an LLM to perform learning and inference on graphs in a\ngenerative manner. Our method exceeds all competitive GNN baselines on\nogbn-arxiv, Cora and PubMed datasets, which demonstrates the effectiveness of\nour method and sheds light on generative large language models as the\nfoundation model for graph machine learning.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:41:09 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 01:38:31 GMT"},{"version":"v3","created":"Thu, 24 Aug 2023 03:54:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ye","Ruosong",""],["Zhang","Caiqi",""],["Wang","Runhui",""],["Xu","Shuyuan",""],["Zhang","Yongfeng",""]]}
{"id":"2308.07135","submitter":"Shanmugasundaram Sundar","authors":"Piyasa Sarkar and S. Sundar","title":"Induced Isometric Representations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\sigma$ be an isometric representation of $\\mathbb{N}^d$ on a Hilbert\nspace $\\mathcal{H}$. We induce $\\sigma$ to an isometric representation $V$ of\n$\\mathbb{R}_{+}^{d}$ on another Hilbert space $\\mathcal{K}$. We show that the\nmap $\\sigma \\to V$, restricted to strongly pure isometric representations,\npreserves index and irreducibility. As an application, we show that, for $k \\in\n\\{0, 1,2,\\cdots\\} \\cup \\{\\infty\\}$, there is a continuum of prime\nmultiparameter CCR flows (i.e, not a tensor product of two non-trivial\n$E_0$-semigroups) with index $k$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:41:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sarkar","Piyasa",""],["Sundar","S.",""]]}
{"id":"2308.07136","submitter":"Umberto Lupo","authors":"Umberto Lupo, Damiano Sgarbossa, Anne-Florence Bitbol","title":"Pairing interacting protein sequences using masked language modeling","comments":"33 pages, 14 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predicting which proteins interact together from amino-acid sequences is an\nimportant task. We develop a method to pair interacting protein sequences which\nleverages the power of protein language models trained on multiple sequence\nalignments, such as MSA Transformer and the EvoFormer module of AlphaFold. We\nformulate the problem of pairing interacting partners among the paralogs of two\nprotein families in a differentiable way. We introduce a method called DiffPALM\nthat solves it by exploiting the ability of MSA Transformer to fill in masked\namino acids in multiple sequence alignments using the surrounding context. MSA\nTransformer encodes coevolution between functionally or structurally coupled\namino acids. We show that it captures inter-chain coevolution, while it was\ntrained on single-chain data, which means that it can be used\nout-of-distribution. Relying on MSA Transformer without fine-tuning, DiffPALM\noutperforms existing coevolution-based pairing methods on difficult benchmarks\nof shallow multiple sequence alignments extracted from ubiquitous prokaryotic\nprotein datasets. It also outperforms an alternative method based on a\nstate-of-the-art protein language model trained on single sequences. Paired\nalignments of interacting protein sequences are a crucial ingredient of\nsupervised deep learning methods to predict the three-dimensional structure of\nprotein complexes. DiffPALM substantially improves the structure prediction of\nsome eukaryotic protein complexes by AlphaFold-Multimer, without significantly\ndeteriorating any of those we tested. It also achieves competitive performance\nwith using orthology-based pairing.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:42:09 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lupo","Umberto",""],["Sgarbossa","Damiano",""],["Bitbol","Anne-Florence",""]]}
{"id":"2308.07137","submitter":"Hui Zeng","authors":"Hui Zeng, Wenhui Duan, Huaqing Huang","title":"Generalization of the Nested Wilson Loop Formalism in Topological Dirac\n  Semimetals with Higher-order Fermi Arcs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the nested Wilson loop formalism, which has been playing an\nimportant role in the study of topological quadrupole insulators, to\ntwo-dimensional (2D) and 3D nonsymmorphic materials with higher-order topology.\nIn particular, certain 3D Dirac semimetals exhibit 1D higher-order Fermi arc\n(HOFA) states localizing on hinges where two surfaces meet and connecting the\nprojection of the bulk Dirac points. We discover that the generalized nested\nBerry phase (gNBP) derived from this formalism is the bulk topological\nindicator determining the existence/absence of HOFAs, revealing a direct\nbulk-hinge correspondence in 3D Dirac semimetals. Finally, we study the Dirac\nsemimetals NaCuSe and KMgBi based on first-principles calculations and\nexplicitly show that the change in gNBP adjacent to the Dirac point corresponds\nto the termination of HOFAs at the projection of Dirac points on the hinge. Our\nfindings not only improve the understanding of the bulk-hinge correspondence in\ntopological Dirac semimetals but also provide a general formalism for studying\nthe higher-order topology in nonsymmorphic systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:43:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zeng","Hui",""],["Duan","Wenhui",""],["Huang","Huaqing",""]]}
{"id":"2308.07138","submitter":"Mario B. Schulz","authors":"Alessandro Carlotto, Mario B. Schulz, David Wiygul","title":"Disc stackings and their Morse index","comments":"55 pages, 8 figures","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 free boundary minimal disc stackings, with any number of strata,\nin the three-dimensional Euclidean unit ball, and prove uniform, linear lower\nand upper bounds on the Morse index of all such surfaces. Among other things,\nour work implies for any positive integer $k$ the existence of $k$-tuples of\ndistinct, pairwise non-congruent, embedded free boundary minimal surfaces all\nhaving the same topological type. In addition, since we prove that the\nequivariant Morse index of any such free boundary minimal stacking, with\nrespect to its maximal symmetry group, is bounded from below by (the integer\npart of) half the number of layers and from above strictly by twice the same\nnumber, it follows that any possible realization of such surfaces via an\nequivariant min-max method would need to employ sweepouts with an arbitrarily\nlarge number of parameters. This also shows that it is only for $N=2$ and $N=3$\nlayers that free boundary minimal disc stackings are achievable by means of\none-dimensional mountain pass schemes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:43:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Carlotto","Alessandro",""],["Schulz","Mario B.",""],["Wiygul","David",""]]}
{"id":"2308.07139","submitter":"Kebin Fan","authors":"Hao Ma, Andrey B. Evlyukhin, Andrey E. Miroshnichenko, Fengjie Zhu,\n  Siyu Duan, Jingbo Wu, Caihong Zhang, Jian Chen, Biao-Bing Jin, Willie J.\n  Padilla, and Kebin Fan","title":"Extremely thin perfect absorber by generalized multipole bianisotropic\n  effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Symmetry breaking plays a crucial role in understanding the fundamental\nphysics underlying numerous physical phenomena, including the electromagnetic\nresponse in resonators, giving rise to intriguing effects such as directional\nlight scattering, supercavity lasing, and topologically protected states. In\nthis work, we demonstrate that adding a small fraction of lossy metal (as low\nas $1\\times10^{-6}$ in volume), to a lossless dielectric resonator breaks\ninversion symmetry thereby lifting its degeneracy, leading to a strong\nbianisotropic response. In the case of the metasurface composed of such\nresonators, this effect leads to unidirectional perfect absorption while\nmaintaining nearly perfect reflection from the opposite direction. We have\ndeveloped more general Onsager-Casimir relations for the polarizabilities of\nparticle arrays, taking into account the contributions of quadrupoles, which\nshows that bianisotropy is not solely due to dipoles, but also involves\nhigh-order multipoles. Our experimental validation demonstrates an extremely\nthin terahertz-perfect absorber with a wavelength-to-thickness ratio of up to\n25,000, where the material thickness is only 2% of the theoretical minimum\nthickness dictated by the fundamental limit. Our findings have significant\nimplications for a variety of applications, including energy harvesting,\nthermal management, single-photon detection, and low-power directional\nemission.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:44:45 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Hao",""],["Evlyukhin","Andrey B.",""],["Miroshnichenko","Andrey E.",""],["Zhu","Fengjie",""],["Duan","Siyu",""],["Wu","Jingbo",""],["Zhang","Caihong",""],["Chen","Jian",""],["Jin","Biao-Bing",""],["Padilla","Willie J.",""],["Fan","Kebin",""]]}
{"id":"2308.07140","submitter":"Jingfeng Wang","authors":"Jingfeng Wang and Guanghui Hu","title":"Towards the efficient calculation of quantity of interest from steady\n  Euler equations II: a CNNs-based automatic implementation","comments":"In this papers, we use the CNNs architecture to solve the dual\n  equations problem","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In \\cite{wang2023towards}, a dual-consistent dual-weighted residual-based\n$h$-adaptive method has been proposed based on a Newton-GMG framework, towards\nthe accurate calculation of a given quantity of interest from Euler equations.\nThe performance of such a numerical method is satisfactory, i.e., the stable\nconvergence of the quantity of interest can be observed in all numerical\nexperiments. In this paper, we will focus on the efficiency issue to further\ndevelop this method, since efficiency is vital for numerical methods in\npractical applications such as the optimal design of the vehicle shape. Three\napproaches are studied for addressing the efficiency issue, i.e., i). using\nconvolutional neural networks as a solver for dual equations, ii). designing an\nautomatic adjustment strategy for the tolerance in the $h$-adaptive process to\nconduct the local refinement and/or coarsening of mesh grids, and iii).\nintroducing OpenMP, a shared memory parallelization technique, to accelerate\nthe module such as the solution reconstruction in the method. The feasibility\nof each approach and numerical issues are discussed in depth, and significant\nacceleration from those approaches in simulations can be observed clearly from\na number of numerical experiments. In convolutional neural networks, it is\nworth mentioning that the dual consistency plays an important role to guarantee\nthe efficiency of the whole method and that unstructured meshes are employed in\nall simulations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:46:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Jingfeng",""],["Hu","Guanghui",""]]}
{"id":"2308.07141","submitter":"Weimin Zhang","authors":"Weimin Zhang","title":"Existence and Multiplicity of Solutions for Fractional $p$-Laplacian\n  Equation Involving Critical Concave-convex Nonlinearities","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 following fractional $p$-Laplacian equation \\[\n\\begin{cases} \\begin{aligned} (-\\Delta)_p^s u&=\\lambda\n|u|^{q-2}u+|u|^{p_s^*-2}u &&\\text{in}~\\Omega,\\\\ u &=0 &&\\text{in}~\n\\mathbb{R}^n\\setminus\\Omega, \\end{aligned} \\end{cases} \\] where $s\\in (0,1)$,\n$p>q>1$, $n>sp$, $\\lambda>0$, $p_s^*=\\frac{np}{n-sp}$ and $\\Omega$ is a bounded\ndomain (with $C^{1, 1}$ boundary). Firstly, we get a dichotomy result for the\nexistence of positive solution with respect to $\\lambda$. For $p\\ge 2$,\n$p-1<q<p$, $n>\\frac{sp(q+1)}{q+1-p}$, we provide two positive solutions for\nsmall $\\lambda$. Finally, without sign constraint, for $\\lambda$ sufficiently\nsmall, we show the existence of infinitely many solutions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:48:22 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 10:03:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Weimin",""]]}
{"id":"2308.07142","submitter":"Felipe Asenjo","authors":"Sergio A. Hojman and Felipe A. Asenjo","title":"Cosmological electromagnetic hopfions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that any mathematical solution for null electromagnetic field\nknots in flat spacetime is also a null field knotted solution for cosmological\nelectromagnetic fields that may be obtained by replacing the time $t\\rightarrow\n\\tau=\\int dt/a$, where $a=a(t)$ is the scale factor of the Universe described\nby the Friedman-Lema\\^itre-Robertson-Walker (FLRW) cosmology, and by adequately\nrewriting the (empty flat spacetimes) electromagnetic fields solutions in a\nmedium defined by the FLRW metric. We found that the dispersion (evolutoion) of\nelectromagnetic hopfions is faster on cosmological scenarios. We discuss the\nimplications of these results for different cosmological models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:48:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hojman","Sergio A.",""],["Asenjo","Felipe A.",""]]}
{"id":"2308.07143","submitter":"Mikhail V. Fistul","authors":"Oliver Neyenhuys, Mikhail V. Fistul, and Ilya M. Eremin","title":"Long-range Ising spins models emerging from frustrated Josephson\n  junctions arrays with topological constraints","comments":"10 pages, 9 figures and 2 Appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Geometrical frustration in correlated systems can give rise to a plethora of\nnovel ordered states and intriguing phases. Here, we analyze theoretically\nvertex-sharing frustrated Kagome lattice of Josephson junctions and identify\nvarious classical and quantum phases. The frustration is provided by\nperiodically arranged $0$- and $\\pi$- Josephson junctions. In the frustrated\nregime the macroscopic phases are composed of different patterns of\nvortex/antivortex penetrating each basic element of the Kagome lattice, i.e., a\nsuperconducting triangle interrupted by three Josephson junctions. We obtain\nthat numerous topological constraints, related to the flux quantization in any\nhexagon loop, lead to highly anisotropic and long-range interaction between\nwell separated vortices (antivortices). Taking into account this interaction\nand a possibility of macroscopic \"tunneling\" between vortex and antivortex in\nsingle superconducting triangles we derive an effective Ising-type spin\nHamiltonian with strongly anisotropic long-range interaction. In the\nclassically frustrated regime we calculate numerically the\ntemperature-dependent spatially averaged spins polarization, $\\overline{m}(T)$,\ncharacterizing the crossover between the ordered and disordered\nvortex/antivortex states. In the coherent quantum regime we analyze the lifting\nof the degeneracy of the ground state and the appearance of the highly\nentangled states.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:49:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Neyenhuys","Oliver",""],["Fistul","Mikhail V.",""],["Eremin","Ilya M.",""]]}
{"id":"2308.07144","submitter":"Bernhard L\\\"uscher","authors":"Bernhard L\\\"uscher, Fr\\'ed\\'eric Mila, Natalia Chepiga","title":"Critical properties of the quantum Ashkin-Teller chain with chiral\n  perturbations","comments":"6 Pages, 8 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the nature of the phase transitions in the quantum\nAshkin-Teller chain in the presence of chiral perturbations. We locate the\nLifshitz line separating a region of direct chiral transitions from the region\nwhere the transition is through an intermediate floating phase. Furthermore, we\nidentify a small region in the vicinity of the four-state Potts point where\nchiral perturbations are irrelevant and where the transition remains conformal.\nImplications to Rydberg atoms experiments are briefly discussed.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:49:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["L\u00fcscher","Bernhard",""],["Mila","Fr\u00e9d\u00e9ric",""],["Chepiga","Natalia",""]]}
{"id":"2308.07145","submitter":"Wen Wu","authors":"Wen Wu, Chao Zhang, Philip C. Woodland","title":"Integrating Emotion Recognition with Speech Recognition and Speaker\n  Diarisation for Conversations","comments":"Interspeech 2023","journal-ref":null,"doi":"10.21437/Interspeech.2023-293","report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although automatic emotion recognition (AER) has recently drawn significant\nresearch interest, most current AER studies use manually segmented utterances,\nwhich are usually unavailable for dialogue systems. This paper proposes\nintegrating AER with automatic speech recognition (ASR) and speaker diarisation\n(SD) in a jointly-trained system. Distinct output layers are built for four\nsub-tasks including AER, ASR, voice activity detection and speaker\nclassification based on a shared encoder. Taking the audio of a conversation as\ninput, the integrated system finds all speech segments and transcribes the\ncorresponding emotion classes, word sequences, and speaker identities. Two\nmetrics are proposed to evaluate AER performance with automatic segmentation\nbased on time-weighted emotion and speaker classification errors. Results on\nthe IEMOCAP dataset show that the proposed system consistently outperforms two\nbaselines with separately trained single-task systems on AER, ASR and SD.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:50:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wu","Wen",""],["Zhang","Chao",""],["Woodland","Philip C.",""]]}
{"id":"2308.07146","submitter":"Hongguang Zhu","authors":"Hongguang Zhu, Yunchao Wei, Xiaodan Liang, Chunjie Zhang, Yao Zhao","title":"CTP: Towards Vision-Language Continual Pretraining via Compatible\n  Momentum Contrast and Topology Preservation","comments":"Accepted by ICCV 2023. Code: https://github.com/KevinLight831/CTP","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":"  Vision-Language Pretraining (VLP) has shown impressive results on diverse\ndownstream tasks by offline training on large-scale datasets. Regarding the\ngrowing nature of real-world data, such an offline training paradigm on\never-expanding data is unsustainable, because models lack the continual\nlearning ability to accumulate knowledge constantly. However, most continual\nlearning studies are limited to uni-modal classification and existing\nmulti-modal datasets cannot simulate continual non-stationary data stream\nscenarios. To support the study of Vision-Language Continual Pretraining\n(VLCP), we first contribute a comprehensive and unified benchmark dataset P9D\nwhich contains over one million product image-text pairs from 9 industries. The\ndata from each industry as an independent task supports continual learning and\nconforms to the real-world long-tail nature to simulate pretraining on web\ndata. We comprehensively study the characteristics and challenges of VLCP, and\npropose a new algorithm: Compatible momentum contrast with Topology\nPreservation, dubbed CTP. The compatible momentum model absorbs the knowledge\nof the current and previous-task models to flexibly update the modal feature.\nMoreover, Topology Preservation transfers the knowledge of embedding across\ntasks while preserving the flexibility of feature adjustment. The experimental\nresults demonstrate our method not only achieves superior performance compared\nwith other baselines but also does not bring an expensive training burden.\nDataset and codes are available at https://github.com/KevinLight831/CTP.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:53:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Hongguang",""],["Wei","Yunchao",""],["Liang","Xiaodan",""],["Zhang","Chunjie",""],["Zhao","Yao",""]]}
{"id":"2308.07147","submitter":"Deepak Gaur","authors":"Deepak Gaur, Hrushikesh Sable, D. Angom","title":"Exact-diagonalization method for soft-core bosons in optical lattices\n  using hierarchical wavefunctions","comments":"11 pages, 6 figures, Comments are most welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we describe a new technique for numerical\nexact-diagonalization. The method is particularly suitable for cold bosonic\natoms in optical lattices, in which multiple atoms can occupy a lattice site.\nWe describe the use of the method for Bose-Hubbard model as an example,\nhowever, the method is general and can be applied to other lattice models. The\nproposed numerical technique focuses in detail on how to construct the basis\nstates as a hierarchy of wavefunctions. Starting from single-site Fock states\nwe construct the basis set in terms of row-states and cluster-states. This\nsimplifies the application of constraints and calculation of the Hamiltonian\nmatrix. Each step of the method can be parallelized to accelerate the\ncomputation. In addition, we have illustrated the computation of the spatial\nbipartite entanglement entropy in the correlated $\\nu =1/2$ fractional quantum\nHall state.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:55:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gaur","Deepak",""],["Sable","Hrushikesh",""],["Angom","D.",""]]}
{"id":"2308.07148","submitter":"Bulat Nasrulin","authors":"Bulat Nasrulin, Rowdy Chotkan, Johan Pouwelse","title":"Sustainable Cooperation in Peer-To-Peer Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditionally, peer-to-peer systems have relied on altruism and reciprocity.\nAlthough incentive-based models have gained prominence in new-generation\npeer-to-peer systems, it is essential to recognize the continued importance of\ncooperative principles in achieving performance, fairness, and correctness. The\nlack of this acknowledgment has paved the way for selfish peers to gain unfair\nadvantages in these systems. As such, we address the challenge of selfish peers\nby devising a mechanism to reward sustained cooperation. Instead of relying on\nglobal accountability mechanisms, we propose a protocol that naturally\naggregates local evaluations of cooperation. Traditional mechanisms are often\nvulnerable to Sybil and misreporting attacks. However, our approach overcomes\nthese issues by limiting the benefits selfish peers can gain without incurring\nany cost. The viability of our algorithm is proven with a deployment to 27,259\nInternet users and a realistic simulation of a blockchain gossip protocol. We\nshow that our protocol sustains cooperation even in the presence of a majority\nof selfish peers while incurring only negligible overhead.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:55:49 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nasrulin","Bulat",""],["Chotkan","Rowdy",""],["Pouwelse","Johan",""]]}
{"id":"2308.07149","submitter":"Jeong-Hyuck Park","authors":"Hocheol Lee, Jeong-Hyuck Park, Liliana Velasco-Sevilla, and Lu Yin","title":"Late-time Cosmology without Dark Sector but with Closed String Massless\n  Sector","comments":"8+9 pages, 5+8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose to solve the dark energy problem by postulating the massless\nsector of closed strings. This sector constitutes the gravitational multiplet\nof string theory and, when applied to four-dimensional cosmology, predicts that\nthe expansion of an open Universe defined in string frame is readily\naccelerating. We confront the prediction with the late-time cosmological data\nof Type Ia supernovae and quasar absorption spectrum, which probe the\nevolutions of the Hubble parameter and possibly the fine-structure constant. We\nreport that the observations are in admirable agreement with the prediction\nwithout any dark sector. We estimate the Hubble constant, $H_{0}\\simeq 71.2\\pm\n0.2\\,\\mathrm{km/s/Mpc}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:57:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Hocheol",""],["Park","Jeong-Hyuck",""],["Velasco-Sevilla","Liliana",""],["Yin","Lu",""]]}
{"id":"2308.07150","submitter":"Wei Zhong","authors":"Wei Zhong, Wen-Yi Zhu, Yang Li, Lan Zhou, Ming-Ming Du, Yu-Bo Sheng","title":"Relation between quantum illumination and quantum parameter 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":"  Quantum illumination (QI) leverages entangled lights to detect the potential\npresence of low-reflective objects in a region surrounded by a thermal bath.\nHomologously, quantum parameter estimation utilizes non-classical probes to\naccurately estimate the value of the unknown parameter(s) of interest in a\nsystem. There appears to be a certain connection between these two areas.\nHowever, they are commonly studied using different figures of merit:\nsignal-to-noise ratio and quantum Fisher information. In this study, we prove\nthat the two measures are equivalent to QI in the limit of zero object\nreflectivity. We further demonstrate this equivalence by investigating QI\nprotocols employing non-Gaussian states, which are obtained by de-Gaussifying\nthe two-mode squeezed vacuum state with photon addition and photon subtraction.\nHowever, our analysis leads to a no-go result which demonstrates that\nde-Gaussification operations do not offer an advantage compared to the null\ncase.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:57:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhong","Wei",""],["Zhu","Wen-Yi",""],["Li","Yang",""],["Zhou","Lan",""],["Du","Ming-Ming",""],["Sheng","Yu-Bo",""]]}
{"id":"2308.07151","submitter":"Dario Cioni","authors":"Dario Cioni, Lorenzo Berlincioni, Federico Becattini, Alberto del\n  Bimbo","title":"Diffusion Based Augmentation for Captioning and Retrieval in Cultural\n  Heritage","comments":"Accepted at ICCV 2023 4th Workshop on e-Heritage","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Cultural heritage applications and advanced machine learning models are\ncreating a fruitful synergy to provide effective and accessible ways of\ninteracting with artworks. Smart audio-guides, personalized art-related content\nand gamification approaches are just a few examples of how technology can be\nexploited to provide additional value to artists or exhibitions. Nonetheless,\nfrom a machine learning point of view, the amount of available artistic data is\noften not enough to train effective models. Off-the-shelf computer vision\nmodules can still be exploited to some extent, yet a severe domain shift is\npresent between art images and standard natural image datasets used to train\nsuch models. As a result, this can lead to degraded performance. This paper\nintroduces a novel approach to address the challenges of limited annotated data\nand domain shifts in the cultural heritage domain. By leveraging generative\nvision-language models, we augment art datasets by generating diverse\nvariations of artworks conditioned on their captions. This augmentation\nstrategy enhances dataset diversity, bridging the gap between natural images\nand artworks, and improving the alignment of visual cues with knowledge from\ngeneral-purpose datasets. The generated variations assist in training vision\nand language models with a deeper understanding of artistic characteristics and\nthat are able to generate better captions with appropriate jargon.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:59:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cioni","Dario",""],["Berlincioni","Lorenzo",""],["Becattini","Federico",""],["del Bimbo","Alberto",""]]}
{"id":"2308.07152","submitter":"Bin Cheng","authors":"Michael J. Bremner, Bin Cheng and Zhengfeng Ji","title":"IQP Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and\n  Classical Security","comments":"22 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sampling problems demonstrating beyond classical computing power with noisy\nintermediate-scale quantum (NISQ) devices have been experimentally realized. In\nthose realizations, however, our trust that the quantum devices faithfully\nsolve the claimed sampling problems is usually limited to simulations of\nsmaller-scale instances and is, therefore, indirect. The problem of verifiable\nquantum advantage aims to resolve this critical issue and provides us with\ngreater confidence in a claimed advantage. Instantaneous quantum\npolynomial-time (IQP) sampling has been proposed to achieve beyond classical\ncapabilities with a verifiable scheme based on quadratic-residue codes (QRC).\nUnfortunately, this verification scheme was recently broken by an attack\nproposed by Kahanamoku-Meyer. In this work, we revive IQP-based verifiable\nquantum advantage by making two major contributions. Firstly, we introduce a\nfamily of IQP sampling protocols called the \\emph{stabilizer scheme}, which\nbuilds on results linking IQP circuits, the stabilizer formalism, coding\ntheory, and an efficient characterization of IQP circuit correlation functions.\nThis construction extends the scope of existing IQP-based schemes while\nmaintaining their simplicity and verifiability. Secondly, we introduce the\n\\emph{Hidden Structured Code} (HSC) problem as a well-defined mathematical\nchallenge that underlies the stabilizer scheme. To assess classical security,\nwe explore a class of attacks based on secret extraction, including the\nKahanamoku-Meyer's attack as a special case. We provide evidence of the\nsecurity of the stabilizer scheme, assuming the hardness of the HSC problem. We\nalso point out that the vulnerability observed in the original QRC scheme is\nprimarily attributed to inappropriate parameter choices, which can be naturally\nrectified with proper parameter settings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:03:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bremner","Michael J.",""],["Cheng","Bin",""],["Ji","Zhengfeng",""]]}
{"id":"2308.07153","submitter":"Sk Aziz Ali","authors":"Sk Aziz Ali, Djamila Aouada, Gerd Reis, Didier Stricker","title":"DELO: Deep Evidential LiDAR Odometry using Partial Optimal Transport","comments":"Accepted in ICCV 2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate, robust, and real-time LiDAR-based odometry (LO) is imperative for\nmany applications like robot navigation, globally consistent 3D scene map\nreconstruction, or safe motion-planning. Though LiDAR sensor is known for its\nprecise range measurement, the non-uniform and uncertain point sampling density\ninduce structural inconsistencies. Hence, existing supervised and unsupervised\npoint set registration methods fail to establish one-to-one matching\ncorrespondences between LiDAR frames. We introduce a novel deep learning-based\nreal-time (approx. 35-40ms per frame) LO method that jointly learns accurate\nframe-to-frame correspondences and model's predictive uncertainty (PU) as\nevidence to safe-guard LO predictions. In this work, we propose (i) partial\noptimal transportation of LiDAR feature descriptor for robust LO estimation,\n(ii) joint learning of predictive uncertainty while learning odometry over\ndriving sequences, and (iii) demonstrate how PU can serve as evidence for\nnecessary pose-graph optimization when LO network is either under or over\nconfident. We evaluate our method on KITTI dataset and show competitive\nperformance, even superior generalization ability over recent state-of-the-art\napproaches. Source codes are available.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:06:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ali","Sk Aziz",""],["Aouada","Djamila",""],["Reis","Gerd",""],["Stricker","Didier",""]]}
{"id":"2308.07155","submitter":"Qing-Guo Huang","authors":"Chen Yuan, De-Shuang Meng, and Qing-Guo Huang","title":"Full analysis of the scalar-induced gravitational waves for the\n  curvature perturbation with local-type non-Gaussianities","comments":"21 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Primordial black holes (PBHs) are supposed to form through the gravitational\ncollapse of regions with large density fluctuations. The formation of PBHs\ninevitably leads to the emission of scalar-induced gravitational wave (SIGW)\nsignals, offering a unique opportunity to test the hypothesis of PBHs as a\nconstituent of dark matter (DM). Previous studies have calculated the energy\nspectrum of SIGWs in local-type non-Gaussian models, primarily considering the\ncontributions from the $F_{\\mathrm{NL}}$-order or the $G_{\\mathrm{NL}}$-order\nwhile neglecting connected diagrams. In this study, we extend the previous work\nby (i) considering the full contribution of non-Gaussian diagrams up to the\n$G_{\\mathrm{NL}}$-order; (ii) deriving the generic scaling of the SIGW energy\nspectrum in the infrared region. We derive semi-analytical results applicable\nto arbitrary primordial power spectra and numerically evaluate the energy\nspectrum of SIGWs for a log-normal power spectrum.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:09:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yuan","Chen",""],["Meng","De-Shuang",""],["Huang","Qing-Guo",""]]}
{"id":"2308.07156","submitter":"An Wang","authors":"An Wang, Mobarakol Islam, Mengya Xu, Yang Zhang, Hongliang Ren","title":"SAM Meets Robotic Surgery: An Empirical Study on Generalization,\n  Robustness and Adaptation","comments":"Accepted as Oral Presentation at MedAGI Workshop - MICCAI 2023 1st\n  International Workshop on Foundation Models for General Medical AI. arXiv\n  admin note: substantial text overlap with arXiv:2304.14674","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Segment Anything Model (SAM) serves as a fundamental model for semantic\nsegmentation and demonstrates remarkable generalization capabilities across a\nwide range of downstream scenarios. In this empirical study, we examine SAM's\nrobustness and zero-shot generalizability in the field of robotic surgery. We\ncomprehensively explore different scenarios, including prompted and unprompted\nsituations, bounding box and points-based prompt approaches, as well as the\nability to generalize under corruptions and perturbations at five severity\nlevels. Additionally, we compare the performance of SAM with state-of-the-art\nsupervised models. We conduct all the experiments with two well-known robotic\ninstrument segmentation datasets from MICCAI EndoVis 2017 and 2018 challenges.\nOur extensive evaluation results reveal that although SAM shows remarkable\nzero-shot generalization ability with bounding box prompts, it struggles to\nsegment the whole instrument with point-based prompts and unprompted settings.\nFurthermore, our qualitative figures demonstrate that the model either failed\nto predict certain parts of the instrument mask (e.g., jaws, wrist) or\npredicted parts of the instrument as wrong classes in the scenario of\noverlapping instruments within the same bounding box or with the point-based\nprompt. In fact, SAM struggles to identify instruments in complex surgical\nscenarios characterized by the presence of blood, reflection, blur, and shade.\nAdditionally, SAM is insufficiently robust to maintain high performance when\nsubjected to various forms of data corruption. We also attempt to fine-tune SAM\nusing Low-rank Adaptation (LoRA) and propose SurgicalSAM, which shows the\ncapability in class-wise mask prediction without prompt. Therefore, we can\nargue that, without further domain-specific fine-tuning, SAM is not ready for\ndownstream surgical tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:09:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","An",""],["Islam","Mobarakol",""],["Xu","Mengya",""],["Zhang","Yang",""],["Ren","Hongliang",""]]}
{"id":"2308.07157","submitter":"Swaetha Ramkumar","authors":"Swaetha Ramkumar, Neale P. Gibson, Stevanus K. Nugroho, Cathal\n  Maguire, Mark Fortune","title":"High-resolution emission spectroscopy retrievals of MASCARA-1b with\n  CRIRES+: Strong detections of CO, H$_2$O and Fe emission lines and a C$/$O\n  consistent with solar","comments":"21 pages, 18 figures, 4 tables, accepted for publication in Monthly\n  Notices of the Royal Astronomical Society","journal-ref":null,"doi":"10.1093/mnras/stad2476","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The characterization of exoplanet atmospheres has proven to be successful\nusing high-resolution spectroscopy. Phase curve observations of hot/ultra-hot\nJupiters can reveal their compositions and thermal structures, thereby allowing\nthe detection of molecules and atoms in the planetary atmosphere using the\ncross-correlation technique. We present pre-eclipse observations of the\nultra-hot Jupiter, MASCARA-1b, observed with the recently upgraded CRIRES+\nhigh-resolution infrared spectrograph at the VLT. We report a detection of $\\rm\nFe$ ($\\approx$8.3$\\sigma$) in the K-band and confirm previous detections of\n$\\rm CO$ (>15$\\sigma$) and $\\rm H_2O$ (>10$\\sigma$) in the day-side atmosphere\nof MASCARA-1b. Using a Bayesian inference framework, we retrieve the abundances\nof the detected species and constrain planetary orbital velocities, $T$-$P$\nprofiles, and the carbon-to-oxygen ratio ($\\rm C/O$). A free retrieval results\nin an elevated $\\rm CO$ abundance ($\\log_{10}$($\\chi_{\\rm{{}^{12}CO}}$) =\n$-2.85^{+0.57}_{-0.69}$), leading to a super-solar $\\rm C/O$ ratio. More\nrealistically, allowing for vertically-varying chemistry in the atmosphere by\nincorporating a chemical-equilibrium model results in a $\\rm C/O$ of\n$0.68^{+0.12}_{-0.22}$ and a metallicity of $[\\rm M/H] = 0.62^{+0.28}_{-0.55}$,\nboth consistent with solar values. Finally, we also report a slight offset of\nthe $\\rm Fe$ feature in both K$_{\\rm p}$ and v$_{\\rm sys}$ that could be a\nsignature of atmospheric dynamics. Due to the 3D structure of exoplanet\natmospheres and the exclusion of time/phase dependence in our 1D forward\nmodels, further follow-up observations and analysis are required to confirm or\nrefute this result.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:10:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ramkumar","Swaetha",""],["Gibson","Neale P.",""],["Nugroho","Stevanus K.",""],["Maguire","Cathal",""],["Fortune","Mark",""]]}
{"id":"2308.07158","submitter":"Mattias Ergon","authors":"Mattias Ergon, Peter Lundqvist, Claes Fransson, Hanindyo Kuncarayakti,\n  Kaustav K. Das, Kishalay De, Lucia Ferrari, Christoffer Fremling, Kyle\n  Medler, Keiichi Maeda, Andrea Pastorello, Jesper Sollerman, Maximilian D.\n  Stritzinger","title":"Lightcurve and spectral modelling of the Type IIb SN 2020acat. Evidence\n  for a strong Ni bubble effect on the diffusion time","comments":"Accepted for publication by Astronomy and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the light curve and spectral synthesis code JEKYLL to calculate a set\nof macroscopically mixed Type IIb supernova (SN) models, which are compared to\nboth previously published and new late-phase observations of SN 2020acat. The\nmodels differ in the initial mass, the radial mixing and expansion of the\nradioactive material, and the properties of the hydrogen envelope. The best\nmatch to the photospheric and nebular spectra and lightcurves of SN 2020acat is\nfound for a model with an initial mass of 17 solar masses, strong radial mixing\nand expansion of the radioactive material, and a 0.1 solar mass hydrogen\nenvelope with a low hydrogen mass-fraction of 0.27. The most interesting result\nis that strong expansion of the clumps containing radioactive material seems to\nbe required to fit the observations of SN 2020acat both in the diffusion phase\nand the nebular phase. These \"Ni bubbles\" are expected to expand due to heating\nfrom radioactive decays, but the degree of expansion is poorly constrained.\nWithout strong expansion there is a tension between the diffusion phase and the\nsubsequent evolution, and models that fit the nebular phase produce a diffusion\npeak that is too broad. The diffusion phase lightcurve is sensitive to the\nexpansion of the \"Ni bubbles\", as the resulting Swiss-cheese-like geometry\ndecreases the effective opacity and therefore the diffusion time. This effect\nhas not been taken into account in previous lightcurve modelling of\nstripped-envelope SNe, which may lead to a systematic underestimate of their\nejecta masses. It should be emphasized, though, that JEKYLL is limited to a\ngeometry that is spherically symmetric on average, and large-scale asymmetries\nmay also play a role. The relatively high initial mass found for the progenitor\nof SN 2020acat places it at the upper end of the mass distribution of Type IIb\nSN progenitors, and a single star origin can not be excluded.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:10:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ergon","Mattias",""],["Lundqvist","Peter",""],["Fransson","Claes",""],["Kuncarayakti","Hanindyo",""],["Das","Kaustav K.",""],["De","Kishalay",""],["Ferrari","Lucia",""],["Fremling","Christoffer",""],["Medler","Kyle",""],["Maeda","Keiichi",""],["Pastorello","Andrea",""],["Sollerman","Jesper",""],["Stritzinger","Maximilian D.",""]]}
{"id":"2308.07159","submitter":"Georg Schmidt","authors":"Bikash Das-Mohapatra, Reza Rouzegar, Evangelos Th. Papaioannou, Tobias\n  Kampfrath, and Georg Schmidt","title":"Shaping THz emission spectra by using sub-wavelength nanopatterned\n  spintronic THz emitters","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show in theory and experiment that in periodically patterned spintronic\nTHz emitters (STE), charge dynamics can modify the emission spectrum in a\nwell-controlled way. Characterization of sub-wavelength patterned STE at\nfrequencies up to 30 THz shows that the STE's emission spectrum systematically\nchanges with emitter size. The spectral intensity exhibits significant\nreductions at frequencies below 4 THz, accompanied by pronounced dips at around\n15 THz and 24 THz. While reducing the STE size enhances the modulation of all\nfeatures, it does not alter the dip frequencies. The effect originates from the\ncharging of the structure's edges by THz currents, causing a backflow that\ninterferes with the primary current pulse. An analytical model quantitatively\nreproduces these results and agrees well with control experiments. Our findings\nenable a detailed investigation of the charge dynamics in STE and provide\nadditional means for controlled shaping of STE emission spectra by nano\npatterning.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:15:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Das-Mohapatra","Bikash",""],["Rouzegar","Reza",""],["Papaioannou","Evangelos Th.",""],["Kampfrath","Tobias",""],["Schmidt","Georg",""]]}
{"id":"2308.07160","submitter":"Shin-Ted Lin","authors":"Ming-Xuan Li, Qian-Yun Li, Ren-Ming-Jie Li, Shin-Ted Lin, Shu-Kui Liu,\n  Chang-Jian Tang, Hao-Yang Xing, Jing-Jun Zhu and Qian Yue","title":"Low Radon Concentration Measurement with a Radon-Dissolved Liquid\n  Scintillator Pilot Detector","comments":"14 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We construct a high sensitivity radon pilot detector using liquid\nscientillator dissolved radon for the CDEX rare-event searches program. The\nCDEX-10 project employs a germanium detector array immersed in a massive liquid\nnitrogen tank. However, radon emanated from the surface of the tank can\ncontribute background. As a result, radon contamination in the liquid nitrogen\ntank must be regulated and monitored, which necessitates the use of a low-level\nRn measuring device. The radon-dissolved liquid scintillator (LS) detectors\nutilizes cascade decay selections, yielding a unique signature. All background\nevents occurring in the LS, with regard to the system and co-efficiency of Rn\nabsorption, have been studied. Background activity is mearsured to be\n59.8$\\pm$18.4 $\\mu$Bq per 300 mL LS. Meanwhile, it shows that radon\nconcentration absorbed by LS will be saturated and is linearly related to radon\nconcentration in nitrogen gas. Furthermore, the co-efficiency factor can be\noptimized by lowering temperature or raising pressure. Eventually the detection\nlimit for 222Rn in nitrogen gas is observed to be 9.6 mBq/m^3.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:15:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Ming-Xuan",""],["Li","Qian-Yun",""],["Li","Ren-Ming-Jie",""],["Lin","Shin-Ted",""],["Liu","Shu-Kui",""],["Tang","Chang-Jian",""],["Xing","Hao-Yang",""],["Zhu","Jing-Jun",""],["Yue","Qian",""]]}
{"id":"2308.07161","submitter":"Genevieve Clark","authors":"Genevieve Clark, Hamza Raniwala, Matthew Koppa, Kevin Chen, Andrew\n  Leenheer, Matthew Zimmermann, Mark Dong, Linsen Li, Y. Henry Wen, Daniel\n  Dominguez, Matthew Trusheim, Gerald Gilbert, Matt Eichenfield, Dirk Englund","title":"Nanoelectromechanical control of spin-photon interfaces in a hybrid\n  quantum system on chip","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Atom-like defects or color centers (CC's) in nanostructured diamond are a\nleading platform for optically linked quantum technologies, with recent\nadvances including memory-enhanced quantum communication, multi-node quantum\nnetworks, and spin-mediated generation of photonic cluster states. Scaling to\npractically useful applications motivates architectures meeting the following\ncriteria: C1 individual optical addressing of spin qubits; C2 frequency tuning\nof CC spin-dependent optical transitions; C3 coherent spin control in CC ground\nstates; C4 active photon routing; C5 scalable manufacturability; and C6 low\non-chip power dissipation for cryogenic operations. However, no architecture\nmeeting C1-C6 has thus far been demonstrated. Here, we introduce a hybrid\nquantum system-on-chip (HQ-SoC) architecture that simultaneously achieves\nC1-C6. Key to this advance is the realization of piezoelectric strain control\nof diamond waveguide-coupled tin vacancy centers to meet C2 and C3, with\nultra-low power dissipation necessary for C6. The DC response of our device\nallows emitter transition tuning by over 20 GHz, while the large frequency\nrange (exceeding 2 GHz) enables low-power AC control. We show acoustic\nmanipulation of integrated tin vacancy spins and estimate single-phonon\ncoupling rates over 1 kHz in the resolved sideband regime. Combined with\nhigh-speed optical routing with negligible static hold power, this HQ-SoC\nplatform opens the path to scalable single-qubit control with optically\nmediated entangling gates.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:17:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Clark","Genevieve",""],["Raniwala","Hamza",""],["Koppa","Matthew",""],["Chen","Kevin",""],["Leenheer","Andrew",""],["Zimmermann","Matthew",""],["Dong","Mark",""],["Li","Linsen",""],["Wen","Y. Henry",""],["Dominguez","Daniel",""],["Trusheim","Matthew",""],["Gilbert","Gerald",""],["Eichenfield","Matt",""],["Englund","Dirk",""]]}
{"id":"2308.07162","submitter":"David Guillermo Fajardo Ortiz Dr.","authors":"David Fajardo-Ortiz, Bart Thijs, Wolfgang Glanzel, Karin R. Sipido","title":"Evolution of priorities in strategic funding for collaborative health\n  research. A comparison of the European Union Framework Programmes to the\n  program funding by the United States National Institutes of Health","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The historical research-funding model, based on the curiosity and academic\ninterests of researchers, is giving way to new strategic funding models that\nseek to meet societal needs. We investigated the impact of this trend on health\nresearch funded by the two leading funding bodies worldwide, i.e. the National\nInstitutes of Health (NIH) in the United States, and the framework programs of\nthe European Union (EU). To this end, we performed a quantitative analysis of\nthe content of projects supported through programmatic funding by the EU and\nNIH, in the period 2008-2014 and 2015-2020. We used machine learning for\nclassification of projects as basic biomedical research, or as more\nimplementation directed clinical therapeutic research, diagnostics research,\npopulation research, or policy and management research. In addition, we\nanalyzed funding for major disease areas (cancer, cardio-metabolic and\ninfectious disease). We found that EU collaborative health research projects\nclearly shifted towards more implementation research. In the US, the recently\nimplemented UM1 program has a similar profile with strong clinical therapeutic\nresearch, while other NIH programs remain heavily oriented to basic biomedical\nresearch. Funding for cancer research is present across all NIH and EU\nprograms, and in biomedical as well as more implementation directed projects,\nwhile infectious diseases is an emerging theme. We conclude that demand for\nsolutions for medical needs leads to expanded funding for implementation- and\nimpact-oriented research. Basic biomedical research remains present in programs\ndriven by scientific initiative and strategies based on excellence, but may be\nat risk of declining funding opportunities.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:17:34 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fajardo-Ortiz","David",""],["Thijs","Bart",""],["Glanzel","Wolfgang",""],["Sipido","Karin R.",""]]}
{"id":"2308.07163","submitter":"Timo Kaiser","authors":"Patrick Glandorf and Timo Kaiser and Bodo Rosenhahn","title":"HyperSparse Neural Networks: Shifting Exploration to Exploitation\n  through Adaptive Regularization","comments":"ICCV'23 Workshops","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sparse neural networks are a key factor in developing resource-efficient\nmachine learning applications. We propose the novel and powerful sparse\nlearning method Adaptive Regularized Training (ART) to compress dense into\nsparse networks. Instead of the commonly used binary mask during training to\nreduce the number of model weights, we inherently shrink weights close to zero\nin an iterative manner with increasing weight regularization. Our method\ncompresses the pre-trained model knowledge into the weights of highest\nmagnitude. Therefore, we introduce a novel regularization loss named\nHyperSparse that exploits the highest weights while conserving the ability of\nweight exploration. Extensive experiments on CIFAR and TinyImageNet show that\nour method leads to notable performance gains compared to other sparsification\nmethods, especially in extremely high sparsity regimes up to 99.8 percent model\nsparsity. Additional investigations provide new insights into the patterns that\nare encoded in weights with high magnitudes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:18:11 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 06:52:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Glandorf","Patrick",""],["Kaiser","Timo",""],["Rosenhahn","Bodo",""]]}
{"id":"2308.07164","submitter":"Justin Edwards","authors":"Philip R. Doyle, Iona Gessinger, Justin Edwards, Leigh Clark, Odile\n  Dumbleton, Diego Garaialde, Daniel Rough, Anna Bleakley, Holly P. Branigan,\n  Benjamin R. Cowan","title":"The Partner Modelling Questionnaire: A validated self-report measure of\n  perceptions toward machines as dialogue partners","comments":"Submitted (TOCHI)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent work has looked to understand user perceptions of speech agent\ncapabilities as dialogue partners (termed partner models), and how this affects\nuser interaction. Yet, currently partner model effects are inferred from\nlanguage production as no metrics are available to quantify these subjective\nperceptions more directly. Through three studies, we develop and validate the\nPartner Modelling Questionnaire (PMQ): an 18-item self-report semantic\ndifferential scale designed to reliably measure people's partner models of\nnon-embodied speech interfaces. Through principal component analysis and\nconfirmatory factor analysis, we show that the PMQ scale consists of three\nfactors: communicative competence and dependability, human-likeness in\ncommunication, and communicative flexibility. Our studies show that the measure\nconsistently demonstrates good internal reliability, strong test-retest\nreliability over 12 and 4-week intervals, and predictable convergent/divergent\nvalidity. Based on our findings we discuss the multidimensional nature of\npartner models, whilst identifying key future research avenues that the\ndevelopment of the PMQ facilitates. Notably, this includes the need to identify\nthe activation, sensitivity, and dynamism of partner models in speech interface\ninteraction.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:19:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Doyle","Philip R.",""],["Gessinger","Iona",""],["Edwards","Justin",""],["Clark","Leigh",""],["Dumbleton","Odile",""],["Garaialde","Diego",""],["Rough","Daniel",""],["Bleakley","Anna",""],["Branigan","Holly P.",""],["Cowan","Benjamin R.",""]]}
{"id":"2308.07165","submitter":"Jan-Vincent Harre","authors":"Jan-Vincent Harre, Alexis M. S. Smith, Teruyuki Hirano, Szil\\'ard\n  Csizmadia, Amaury H. M. J. Triaud, David R. Anderson","title":"The Orbit of Warm Jupiter WASP-106 b is aligned with its Star","comments":"12 pages, 3 figures, 4 tables, submitted to AAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Understanding orbital obliquities, or the misalignment angles between a\nstar's rotation axis and the orbital axis of its planets, is crucial for\nunraveling the mechanisms of planetary formation and migration. In this study,\nwe present an analysis of Rossiter-McLaughlin (RM) observations of the warm\nJupiter exoplanet WASP-106 b. The high-precision radial velocity measurements\nwere made with HARPS and HARPS-N during the transit of this planet. We aim to\nconstrain the orientation of the planet's orbit relative to its host star's\nrotation axis. The RM observations are analyzed using a code which models the\nRM anomaly together with the Keplerian orbit given several parameters in\ncombination with a Markov chain Monte Carlo implementation. We measure the\nprojected stellar obliquity in the WASP-106 system for the first time and find\n$\\lambda = (-1 \\pm 11)^\\circ$, supporting the theory of quiescent migration\nthrough the disk.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:21:14 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Harre","Jan-Vincent",""],["Smith","Alexis M. S.",""],["Hirano","Teruyuki",""],["Csizmadia","Szil\u00e1rd",""],["Triaud","Amaury H. M. J.",""],["Anderson","David R.",""]]}
{"id":"2308.07166","submitter":"Chen Zhang","authors":"Chen Zhang, Xin Zhang","title":"Magnetic monopole meets primordial black hole: An extended analysis","comments":"31 pages, 1 figure. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate gravitational capture of magnetic monopoles by primordial\nblack holes (PBH) that evaporate before Big Bang Nucleosynthesis (BBN), a\nhypothetical process which was once proposed as an alternative solution to the\nmonopole problem. Magnetic monopoles produced in phase transitions of a grand\nor partially unified gauge theory are considered. We prove analytically that\nfor all extended PBH mass functions that preserve radiation domination, it is\nimpossible to reduce the monopole abundance via gravitational capture by PBHs\nto values significantly below the one set by monopole annihilation (or below\nits initial abundance if it is smaller), regardless of the nature of the\ncapture process (diffusive or non-diffusive). Therefore, the monopole problem\ncannot be solved by PBH capture in a radiation-dominated era in the early\nuniverse.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:21:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Chen",""],["Zhang","Xin",""]]}
{"id":"2308.07167","submitter":"Pramit Rej","authors":"Pramit Rej and Akashdip Karmakar","title":"Charged strange star coupled to anisotropic dark energy in\n  Tolman-Kuchowicz spacetime","comments":"18 pages, 11 figures, 1 table","journal-ref":"Eur. Phys. J. C 83 (8), 699 (2023)","doi":"10.1140/epjc/s10052-023-11880-6","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of dark energy can be used as a possible option to prevent the\ngravitational collapse of compact objects into singularities. It affects the\nuniverse on the largest scale, as it is responsible for our universe's\naccelerated expansion. As a consequence, it seems possible that dark energy\nwill interact with any compact astrophysical stellar object [Phys. Rev. D 103,\n084042 (2021)]. In this work, our prime focus is to develop a simplified model\nof a charged strange star coupled to anisotropic dark energy in\nTolman-Kuchowicz spacetime (Tolman, Phys Rev 55:364, 1939; Kuchowicz, Acta Phys\nPol 33:541, 1968) within the context of general relativity. To develop our\nmodel, here we consider a particular strange star object, Her X-1 with observed\nvalues of mass $=(0.85 \\pm 0.15)M_{\\odot}$ and radius $= 8.1_{-0.41}^{+0.41}$\nkm. respectively. In this context, we initially started with the equation of\nstate (EoS) to model the dark energy, in which the dark energy density is\nproportional to the isotropic perfect fluid matter-energy density. The unknown\nconstants present in the metric have been calculated by using the\nDarmois-Israel condition. We perform an in-depth analysis of the stability and\nforce equilibrium of our proposed stellar configuration as well as multiple\nphysical attributes of the model such as metric function, pressure, density,\nmass-radius relation, and dark energy parameters by varying dark energy\ncoupling parameter $\\alpha$. Thus after a thorough theoretical analysis, we\nfound that our proposed model is free from any singularity and also satisfies\nall stability criteria to be a stable and physically realistic stellar model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:21:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rej","Pramit",""],["Karmakar","Akashdip",""]]}
{"id":"2308.07168","submitter":"Clara Stegehuis","authors":"Ercan S\\\"onmez and Clara Stegehuis","title":"On the distances within cliques in a soft random geometric graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the distances of edges within cliques in a soft random geometric\ngraph on a torus, where the vertices are points of a homogeneous Poisson point\nprocess, and far-away points are less likely to be connected than nearby\npoints. We obtain the scaling of the maximal distance between any two points\nwithin a clique of size $k$. Moreover, we show that asymptotically in all\ncliques with large distances, there is only one remote point and all other\npoints are nearby. Furthermore, we prove that a re-scaled version of the\nmaximal $k$-clique distance converges in distribution to a Fr\\'echet\ndistribution. Thereby, we describe the order of magnitude according to which\nthe largest distance between two points in a clique decreases with the clique\nsize.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:21:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["S\u00f6nmez","Ercan",""],["Stegehuis","Clara",""]]}
{"id":"2308.07169","submitter":"Jarkko Peuron","authors":"Kirill Boguslavski, Aleksi Kurkela, Tuomas Lappi, Florian Lindenbauer,\n  Jarkko Peuron","title":"Heavy quark diffusion coefficient during hydrodynamization --\n  non-equilibrium vs. equilibrium","comments":"6 pages, 5 figures, proceedings for 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":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the heavy quark momentum diffusion coefficient using effective\nkinetic theory for a system going through bottom-up isotropization until\napproximate hydrodynamization. We find that when comparing the nonthermal\ndiffusion coefficient to the thermal one for the same energy density, the\nobserved deviations throughout the whole evolution are within 30% from the\nthermal value. For thermal systems matched to other quantities we observe\nconsiderably larger deviations. We also observe that the diffusion coefficient\nin the transverse direction dominates at large occupation number, whereas for\nan underoccupied system the longitudinal diffusion coefficient dominates.\nSimilarly, we study the jet quenching parameter, where we obtain a smooth\nevolution connecting the large values of the glasma phase with the smaller\nvalues in the hydrodynamical regime.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:24:55 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Boguslavski","Kirill",""],["Kurkela","Aleksi",""],["Lappi","Tuomas",""],["Lindenbauer","Florian",""],["Peuron","Jarkko",""]]}
{"id":"2308.07170","submitter":"Jeremy Cochoy","authors":"Jeremy Cochoy","title":"PitchNet: A Fully Convolutional Neural Network for Pitch Estimation","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 the domain of music and sound processing, pitch extraction plays a pivotal\nrole. This research introduces \"PitchNet\", a convolutional neural network\ntailored for pitch extraction from the human singing voice, including acapella\nperformances. Integrating autocorrelation with deep learning techniques,\nPitchNet aims to optimize the accuracy of pitch detection. Evaluation across\ndatasets comprising synthetic sounds, opera recordings, and time-stretched\nvowels demonstrates its efficacy. This work paves the way for enhanced pitch\nextraction in both music and voice settings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:26:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cochoy","Jeremy",""]]}
{"id":"2308.07171","submitter":"Zong-Xing Xiong","authors":"Zong-Xing Xiong, Yongli Zhang","title":"Genuine nonlocality of generalized GHZ states in many-partite systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A set of orthogonal multipartite quantum states is said to be\ndistinguishability-based genuinely nonlocal (also genuinely nonlocal, for\nabbreviation) if the states are locally indistinguishable across any\nbipartition of the subsystems. In this work, we study the\n(distinguishability-based) genuine nonlocality of the generalized GHZ states,\nprimarily for the case when a large number of partites are considered. For the\nN-qubit case, we show that genuinely nonlocal subsets of the GHZ basis with\ncardianlity {\\Theta}(2^(N/2)) exist. We also generalize this result to the\ncases when d > 2 is an even number.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:27:51 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Xiong","Zong-Xing",""],["Zhang","Yongli",""]]}
{"id":"2308.07172","submitter":"Aurelio Patelli Dr","authors":"Bernardo Caldarola, Dario Mazzilli, Lorenzo Napolitano, Aurelio\n  Patelli, Angelica Sbardella","title":"Economic complexity and the sustainability transition: A review of data,\n  methods, and literature","comments":"57 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Economic Complexity (EC) methods have gained increasing popularity across\nfields and disciplines. In particular, the EC toolbox has proved particularly\npromising in the study of complex and interrelated phenomena, such as the\ntransition towards a greener economy. Using the EC approach, scholars have been\ninvestigating the relationship between EC and sustainability, proposing to\nidentify the distinguishing characteristics of green products and to assess the\nreadiness of productive and technological structures for the sustainability\ntransition. This article proposes to review and summarize the data, methods,\nand empirical literature that are relevant to the study of the sustainability\ntransition from an EC perspective. We review three distinct but connected\nblocks of literature on EC and environmental sustainability. First, we survey\nthe evidence linking measures of EC to indicators related to environmental\nsustainability. Second, we review articles that strive to assess the green\ncompetitiveness of productive systems. Third, we examine evidence on green\ntechnological development and its connection to non-green knowledge bases.\nFinally, we summarize the findings for each block and identify avenues for\nfurther research in this recent and growing body of empirical literature.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:28:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Caldarola","Bernardo",""],["Mazzilli","Dario",""],["Napolitano","Lorenzo",""],["Patelli","Aurelio",""],["Sbardella","Angelica",""]]}
{"id":"2308.07173","submitter":"Daegyu Lee","authors":"Daegyu Lee, Hyunwoo Nam, Chanhoe Ryu, Sungwon Nah, Seongwoo Moon and\n  D. Hyunchul Shim","title":"Enhancing State Estimator for Autonomous Race Car : Leveraging\n  Multi-modal System and Managing Computing Resources","comments":"arXiv admin note: text overlap with arXiv:2207.12232","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper introduces an innovative approach to enhance the state estimator\nfor high-speed autonomous race cars, addressing challenges related to\nunreliable measurements, localization failures, and computing resource\nmanagement. The proposed robust localization system utilizes a Bayesian-based\nprobabilistic approach to evaluate multimodal measurements, ensuring the use of\ncredible data for accurate and reliable localization, even in harsh racing\nconditions. To tackle potential localization failures during intense racing, we\npresent a resilient navigation system. This system enables the race car to\ncontinue track-following by leveraging direct perception information in\nplanning and execution, ensuring continuous performance despite localization\ndisruptions. Efficient computing resource management is critical to avoid\noverload and system failure. We optimize computing resources using an efficient\nLiDAR-based state estimation method. Leveraging CUDA programming and GPU\nacceleration, we perform nearest points search and covariance computation\nefficiently, overcoming CPU bottlenecks. Real-world and simulation tests\nvalidate the system's performance and resilience. The proposed approach\nsuccessfully recovers from failures, effectively preventing accidents and\nensuring race car safety.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:31:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Daegyu",""],["Nam","Hyunwoo",""],["Ryu","Chanhoe",""],["Nah","Sungwon",""],["Moon","Seongwoo",""],["Shim","D. Hyunchul",""]]}
{"id":"2308.07174","submitter":"Yogesh S S Patil","authors":"Jinyong Ma, Y. S. S. Patil, Jiaxin Yu, Yiqi Wang, J. G. E. Harris","title":"A proposal for detecting the spin of a single electron in superfluid\n  helium","comments":"Main text: 5 pages, 5 figures. Supplement: 11 pages, 2 figures, 1\n  table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The electron bubble in superfluid helium has two degrees of freedom that may\noffer exceptionally low dissipation: the electron's spin and the bubble's\nmotion. If these degrees of freedom can be read out and controlled with\nsufficient sensitivity, they would provide a novel platform for realizing a\nrange of quantum technologies and for exploring open questions in the physics\nof superfluid helium. Here we propose a practical scheme for accomplishing this\nby trapping an electron bubble inside a superfluid-filled opto-acoustic cavity.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:31:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ma","Jinyong",""],["Patil","Y. S. S.",""],["Yu","Jiaxin",""],["Wang","Yiqi",""],["Harris","J. G. E.",""]]}
{"id":"2308.07175","submitter":"Sabee Grewal","authors":"Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang","title":"Efficient Learning of Quantum States Prepared With Few Non-Clifford\n  Gates II: Single-Copy Measurements","comments":"22 pages. arXiv admin note: text overlap with arXiv:2305.13409","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent work has shown that $n$-qubit quantum states output by circuits with\nat most $t$ single-qubit non-Clifford gates can be learned to trace distance\n$\\epsilon$ using $\\mathsf{poly}(n,2^t,1/\\epsilon)$ time and samples. All prior\nalgorithms achieving this runtime use entangled measurements across two copies\nof the input state. In this work, we give a similarly efficient algorithm that\nlearns the same class of states using only single-copy measurements.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:32:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Grewal","Sabee",""],["Iyer","Vishnu",""],["Kretschmer","William",""],["Liang","Daniel",""]]}
{"id":"2308.07176","submitter":"George Leigh","authors":"George M. Leigh (1), Wen-Hsi Yang (2), Montana E. Wickens (1) and\n  Amanda R. Northrop (1) ((1) Queensland Department of Agriculture and\n  Fisheries, (2) The University of Queensland)","title":"Perfect simulation from unbiased simulation","comments":"17 pages, 4 figures; for associated R scripts, see\n  https://github.com/George-Leigh/PerfectSimulation","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that any application of the technique of unbiased simulation becomes\nperfect simulation when coalescence of the two coupled Markov chains can be\npractically assured in advance. This happens when a fixed number of iterations\nis high enough that the probability of needing any more to achieve coalescence\nis negligible; we suggest a value of $10^{-20}$. This finding enormously\nincreases the range of problems for which perfect simulation, which exactly\nfollows the target distribution, can be implemented. We design a new algorithm\nto make practical use of the high number of iterations by producing extra\nperfect sample points with little extra computational effort, at a cost of a\nsmall, controllable amount of serial correlation within sample sets of about 20\npoints. Different sample sets remain completely independent. The algorithm\nincludes maximal coupling for continuous processes, to bring together chains\nthat are already close. We illustrate the methodology on a simple, two-state\nMarkov chain and on standard normal distributions up to 20 dimensions. Our\ntechnical formulation involves a nonzero probability, which can be made\narbitrarily small, that a single perfect sample point may have its place taken\nby a \"string\" of many points which are assigned weights, each equal to $\\pm 1$,\nthat sum to~$1$. A point with a weight of $-1$ is a \"hole\", which is an object\nthat can be cancelled by an equivalent point that has the same value but\nopposite weight $+1$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:35:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Leigh","George M.",""],["Yang","Wen-Hsi",""],["Wickens","Montana E.",""],["Northrop","Amanda R.",""]]}
{"id":"2308.07177","submitter":"Adilson Bonifacio","authors":"Adilson Luiz Bonifacio","title":"Conformance Checking for Pushdown Reactive Systems based on Visibly\n  Pushdown Languages","comments":"arXiv admin note: substantial text overlap with arXiv:2107.11421","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Testing pushdown reactive systems is deemed important to guarantee a precise\nand robust software development process. Usually, such systems can be specified\nby the formalism of Input/Output Visibly Pushdown Labeled Transition System\n(IOVPTS), where the interaction with the environment is regulated by a pushdown\nmemory. Hence a conformance checking can be applied in a testing process to\nverify whether an implementation is in compliance to a specification using an\nappropriate conformance relation. In this work we establish a novelty\nconformance relation based on Visibly Pushdown Languages (VPLs) that can model\nsets of desirable and undesirable behaviors of systems. Further, we show that\ntest suites with a complete fault coverage can be generated using this\nconformance relation for pushdown reactive systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:37:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bonifacio","Adilson Luiz",""]]}
{"id":"2308.07178","submitter":"Henrique Lima","authors":"Henrique Santos Lima, Matheus M. A. Paix\\~ao and Constantino Tsallis","title":"de Broglie-Bohm analysis of a nonlinear membrane: From quantum to\n  classical chaos","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Within the de Broglie-Bohm theory, we numerically study a generic\ntwo-dimensional anharmonic oscillator including cubic and quartic interactions.\nOur analysis of the quantum velocity fields and trajectories reveals the\nemergence of dynamical vortices. In their vicinity, fingerprints of chaotic\nbehavior such as unpredictability and sensitivity to initial conditions are\ndetected. The simultaneous presence of off-diagonal and nonlinear terms leads\nto robust quantum chaos very analogous to its classical version.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:38:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lima","Henrique Santos",""],["Paix\u00e3o","Matheus M. A.",""],["Tsallis","Constantino",""]]}
{"id":"2308.07179","submitter":"S. Magal\\'i L\\'opez Cortez","authors":"S. Magal\\'i L\\'opez Cortez and Cassandra L. Jacobs","title":"Incorporating Annotator Uncertainty into Representations of Discourse\n  Relations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Annotation of discourse relations is a known difficult task, especially for\nnon-expert annotators. In this paper, we investigate novice annotators'\nuncertainty on the annotation of discourse relations on spoken conversational\ndata. We find that dialogue context (single turn, pair of turns within speaker,\nand pair of turns across speakers) is a significant predictor of confidence\nscores. We compute distributed representations of discourse relations from\nco-occurrence statistics that incorporate information about confidence scores\nand dialogue context. We perform a hierarchical clustering analysis using these\nrepresentations and show that weighting discourse relation representations with\ninformation about confidence and dialogue context coherently models our\nannotators' uncertainty about discourse relation labels.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:39:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cortez","S. Magal\u00ed L\u00f3pez",""],["Jacobs","Cassandra L.",""]]}
{"id":"2308.07180","submitter":"Vic De Ridder","authors":"Vic De Ridder, Bappaditya Dey, Enrique Dehaerne, Sandip Halder, Stefan\n  De Gendt, Bartel Van Waeyenberge","title":"SEMI-CenterNet: A Machine Learning Facilitated Approach for\n  Semiconductor Defect Inspection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual shrinking of pattern dimensions in the semiconductor domain is\nmaking it increasingly difficult to inspect defects due to factors such as the\npresence of stochastic noise and the dynamic behavior of defect patterns and\ntypes. Conventional rule-based methods and non-parametric supervised machine\nlearning algorithms like KNN mostly fail at the requirements of semiconductor\ndefect inspection at these advanced nodes. Deep Learning (DL)-based methods\nhave gained popularity in the semiconductor defect inspection domain because\nthey have been proven robust towards these challenging scenarios. In this\nresearch work, we have presented an automated DL-based approach for efficient\nlocalization and classification of defects in SEM images. We have proposed\nSEMI-CenterNet (SEMI-CN), a customized CN architecture trained on SEM images of\nsemiconductor wafer defects. The use of the proposed CN approach allows\nimproved computational efficiency compared to previously studied DL models.\nSEMI-CN gets trained to output the center, class, size, and offset of a defect\ninstance. This is different from the approach of most object detection models\nthat use anchors for bounding box prediction. Previous methods predict\nredundant bounding boxes, most of which are discarded in postprocessing. CN\nmitigates this by only predicting boxes for likely defect center points. We\ntrain SEMI-CN on two datasets and benchmark two ResNet backbones for the\nframework. Initially, ResNet models pretrained on the COCO dataset undergo\ntraining using two datasets separately. Primarily, SEMI-CN shows significant\nimprovement in inference time against previous research works. Finally,\ntransfer learning (using weights of custom SEM dataset) is applied from ADI\ndataset to AEI dataset and vice-versa, which reduces the required training time\nfor both backbones to reach the best mAP against conventional training method.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:39:06 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 16:58:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["De Ridder","Vic",""],["Dey","Bappaditya",""],["Dehaerne","Enrique",""],["Halder","Sandip",""],["De Gendt","Stefan",""],["Van Waeyenberge","Bartel",""]]}
{"id":"2308.07181","submitter":"Rumpa Masanta","authors":"Rumpa Masanta","title":"Kobayashi complete domains in complex manifolds","comments":"7 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 give sufficient conditions for Cauchy-completeness of\nKobayashi hyperbolic domains in complex manifolds. The first result gives a\nsufficient condition for completeness for relatively compact domains in several\nlarge classes of manifolds. This follows from our second result, which may be\nof independent interest, in a much more general setting. This extends a result\nof Gaussier to the setting of manifolds.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:40:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Masanta","Rumpa",""]]}
{"id":"2308.07182","submitter":"Hector Rosero-Garc\\'ia","authors":"Valter Borges and Hector Rosero-Garc\\'ia and Jo\\~ao Paulo dos Santos","title":"Ends of shrinking gradient $\\rho$-Einstein solitons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that all ends of a gradient shrinking $\\rho$-Einstein soliton are\n$\\varphi$-non-parabolic, provided $\\rho$ is nonnegative and the soliton has\nbounded and nonnegative scalar curvature, where the weight $\\varphi$ is a\nnegative multiple of the potential function. We also show these solitons are\nconnected at infinity for $\\rho \\in\\left[0,1/2(n-1)\\right)$, $n\\geq4$, and a\nsuitable bound for the scalar curvature.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:41:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Borges","Valter",""],["Rosero-Garc\u00eda","Hector",""],["Santos","Jo\u00e3o Paulo dos",""]]}
{"id":"2308.07183","submitter":"Wujie Shi","authors":"Rulin Shen, Wujie Shi and Feng Tang","title":"On Thompson Problem","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In 1987, the second author of this paper reported his conjecture, all finite\nsimple groups $S$ can be characterized uniformly using the order of $S$ and the\nset of element orders in $S$, to Prof. J. G. Thompson. In their communications,\nThompson posed his problem about the judgment of solvability of finite groups\n$G$. In this paper we give a positive answer for Thompson's problem if the\nprime graph of $G$ is not connection.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:42:28 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Shen","Rulin",""],["Shi","Wujie",""],["Tang","Feng",""]]}
{"id":"2308.07184","submitter":"Tina LY Wu","authors":"Tina LY Wu, Anna Murphy, Chao Chen, and Dana Kulic","title":"Auditory cueing strategy for stride length and cadence modification: a\n  feasibility study with healthy adults","comments":"6 pages, 4 figures; the paper is accepted and presented at EMBC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  People with Parkinson's Disease experience gait impairments that\nsignificantly impact their quality of life. Visual, auditory, and tactile cues\ncan alleviate gait impairments, but they can become less effective due to the\nprogressive nature of the disease and changes in people's motor capability. In\nthis study, we develop a human-in-the-loop (HIL) framework that monitors two\nkey gait parameters, stride length and cadence, and continuously learns a\nperson-specific model of how the parameters change in response to the feedback.\nThe model is then used in an optimization algorithm to improve the gait\nparameters. This feasibility study examines whether auditory cues can be used\nto influence stride length in people without gait impairments. The results\ndemonstrate the benefits of the HIL framework in maintaining people's stride\nlength in the presence of a secondary task.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:44:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wu","Tina LY",""],["Murphy","Anna",""],["Chen","Chao",""],["Kulic","Dana",""]]}
{"id":"2308.07185","submitter":"Nick Harkiolakis","authors":"Nick Harkiolakis","title":"The Cycle of Value The Cycle of Value -- A Conservationist Approach to\n  Economics","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":"  A representation of economic activity in the form of a law of conservation of\nvalue is presented based on the definition of value as potential to act in an\nenvironment. This allows the encapsulation of the term as a conserved quantity\nthroughout transactions. Marginal value and speed of marginal value are defined\nas derivatives of value and marginal value, respectively. Traditional economic\nstatements are represented here as cycles of value where value is conserved.\nProducer-consumer dyads, shortage and surplus, as well as the role of the value\nin representing the market and the economy are explored. The role of the\ngovernment in the economy is also explained through the cycles of value the\ngovernment is involved in. Traditional economic statements and assumptions\nproduce existing hypotheses as outcomes of the law of conservation of value.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:27:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Harkiolakis","Nick",""]]}
{"id":"2308.07186","submitter":"Xun Yu","authors":"Song Yang, Xun Yu, Zigang Zhu","title":"Automorphism groups of cubic fivefolds and fourfolds","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce notions of partitionability and characteristic\nsets of homogeneous polynomials and give a complete classification of groups\nfaithfully acting on smooth cubic fivefolds. Specifically, we prove that there\nexist 20 maximal ones among all such groups. As an application, we classify all\npossible subgroups of the automorphism groups of smooth cubic fourfolds.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:45:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Yang","Song",""],["Yu","Xun",""],["Zhu","Zigang",""]]}
{"id":"2308.07187","submitter":"Hoang Ta","authors":"Quoc-Tung Le and Hoang Ta","title":"Asymptotic nonnegative rank of matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CC math.AC math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nonnegative rank of nonnegative matrices is an important quantity that\nappears in many fields, such as combinatorial optimization, communication\ncomplexity, and information theory. In this paper, we study the asymptotic\ngrowth of the nonnegative rank of a fixed nonnegative matrix under Kronecker\nproduct. This quantity is called the asymptotic nonnegative rank, which is\nalready studied in information theory. By applying the theory of asymptotic\nspectra of V. Strassen (J. Reine Angew. Math. 1988), we introduce the\nasymptotic spectrum of nonnegative matrices and give a dual characterization of\nthe asymptotic nonnegative rank. As the opposite of nonnegative rank, we\nintroduce the notion of the subrank of a nonnegative matrix and show that it is\nexactly equal to the size of the maximum induced matching of the bipartite\ngraph defined on the support of the matrix (therefore, independent of the value\nof entries). Finally, we show that two matrix parameters, namely rank and\nfractional cover number, belong to the asymptotic spectrum of nonnegative\nmatrices.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:46:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Le","Quoc-Tung",""],["Ta","Hoang",""]]}
{"id":"2308.07188","submitter":"Jozef Han\\v{c}","authors":"Jozef Han\\v{c}, Martina Han\\v{c}ov\\'a, Dominik Borovsk\\'y","title":"Social Reader Perusall -- a Highly Effective Tool and Source of\n  Formative Assessment Data","comments":"8 pages, 4 Figures, conference DIDSCI2022 preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The contribution provides a detailed exploration of the online platform\nPerusall as an advanced social annotation technology in teaching and learning\nSTEM disciplines. This exploration is based on the authors' insights and\nexperiences from three years of implementing Perusall at P.J. \\v{S}af\\'arik\nUniversity in Ko\\v{s}ice, Slovakia. While the concept of social annotation\ntechnology and its educational applications are not novel, Perusall's advanced\nfeatures, including AI and data science reports, enable its use in both\nsynchronous and asynchronous blended and flipped learning environments. In this\ncontext, Perusall serves as a digital tool for collecting formative data,\nmonitoring student progress, and identifying areas of difficulty. This\nassessment data can be effectively utilized in preparing and personalizing\nsubsequent face-to-face group interactions, thereby enhancing and improving the\nlearning experience. From a pedagogical viewpoint, Perusall's role was\nparticularly significant during the Covid-19 pandemic, enabling effective,\ncontinuous, and engaging learning amidst social distancing and physical\nrestrictions. Today, Perusall has become a key tool in blended learning,\nfacilitating higher-order cognitive processes during the educational process\nand, with its multifaceted applications, serves as a modern catalyst in\nredefining educational experiences and outcomes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:50:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Han\u010d","Jozef",""],["Han\u010dov\u00e1","Martina",""],["Borovsk\u00fd","Dominik",""]]}
{"id":"2308.07189","submitter":"Adri\\'an Rodr\\'iguez Colucci","authors":"Adri\\'an Rodr\\'iguez, Bruno Morgado and Nelson Callegari Jr","title":"Dynamical characterization of the 6/1 mean motion resonance between\n  Quaoar's ring and Weywot","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, it has been reported the discovery of a dense ring around the\ntrans-Neptunian object 50000 Quaoar. The ring particles seem to be very close\nto the 6/1 mean motion resonance with Weywot, the only known satellite in the\nsystem. In this work we investigate the dynamical environment in the close\nvicinity of the 6/1 orbital resonance in the context of the restricted three\nbody problem. We aim to analyze whether, in view of observational constraints,\nthe ring could be effectively evolving in resonant motion with the satellite.\nThrough the technique of dynamical maps we identify and characterize the 6/1\nmean motion resonance, finding that the main location of the resonance deviates\nby only $29$ km from the central part of the ring. This difference lies within\nthe 3$\\sigma$ confidence level, considering the uncertainties in the\nobservational parameters. We also show that the Weywot's eccentricity plays a\nsignificant role in the dynamical structure of the 6/1 resonance. The results\nshow that the resonance width is smaller than the estimated ring's width. Under\nassumption of a ring with eccentricity smaller than 0.05, clumping of test\nparticles appears at the position of the different resonant multiplets,\nconsidering the nominal value of Weywot's eccentricity. This is in agreement\nwith observations, which indicate that the estimated resonance width ($\\leq$ 10\nkm) is comparable with the narrow and dense arc of material within Quaoar's\nring. Our results may be an indicative that the 6/1 resonance resonance plays a\nkey role in confining the arc ring.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:50:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rodr\u00edguez","Adri\u00e1n",""],["Morgado","Bruno",""],["Callegari","Nelson","Jr"]]}
{"id":"2308.07190","submitter":"Takamori Kato","authors":"Takamori Kato and Kotaro Tsugawa","title":"Cancellation properties and unconditional well-posedness for the fifth\n  order KdV type equations with periodic boundary condition","comments":"59 page","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the fifth order KdV type equations and prove the unconditional\nwell-posedness in $H^s(\\mathbb{T})$ for $s \\ge 1$. The main idea is to employ\nthe normal form reduction and a kinds of cancellation properties to deal with\nthe derivative losses.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:50:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kato","Takamori",""],["Tsugawa","Kotaro",""]]}
{"id":"2308.07191","submitter":"Oleg Kibis","authors":"O. V. Kibis, M. V. Boev, D. S. Eliseev, V. M. Kovalev","title":"Optically induced delocalization of electrons bound by attractive\n  potentials","comments":"Published version","journal-ref":"Phys. Rev. B 108, L081107 (2023)","doi":"10.1103/PhysRevB.108.L081107","report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within the Floquet theory of periodically driven quantum systems, we\ndemonstrate that a circularly polarized off-resonant electromagnetic field can\ndestroy the electron states bound by three-dimensional attractive potentials.\nAs a consequence, the optically induced delocalization of bound electrons\nappears. The effect arises from the changing of topological structure of a\npotential landscape under a circularly polarized off-resonant electromagnetic\nfield which turns simply connected potentials into doubly connected ones.\nPossible manifestations of the effect are discussed for conduction electrons in\ncondensed-matter structures.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:51:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kibis","O. V.",""],["Boev","M. V.",""],["Eliseev","D. S.",""],["Kovalev","V. M.",""]]}
{"id":"2308.07192","submitter":"Aleksandr Petrov","authors":"Aleksandr Petrov and Craig Macdonald","title":"gSASRec: Reducing Overconfidence in Sequential Recommendation Trained\n  with Negative Sampling","comments":"Accepted at ACM RecSys 2023","journal-ref":null,"doi":"10.1145/3604915.3608783","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A large catalogue size is one of the central challenges in training\nrecommendation models: a large number of items makes them memory and\ncomputationally inefficient to compute scores for all items during training,\nforcing these models to deploy negative sampling. However, negative sampling\nincreases the proportion of positive interactions in the training data, and\ntherefore models trained with negative sampling tend to overestimate the\nprobabilities of positive interactions a phenomenon we call overconfidence.\nWhile the absolute values of the predicted scores or probabilities are not\nimportant for the ranking of retrieved recommendations, overconfident models\nmay fail to estimate nuanced differences in the top-ranked items, resulting in\ndegraded performance. In this paper, we show that overconfidence explains why\nthe popular SASRec model underperforms when compared to BERT4Rec. This is\ncontrary to the BERT4Rec authors explanation that the difference in performance\nis due to the bi-directional attention mechanism. To mitigate overconfidence,\nwe propose a novel Generalised Binary Cross-Entropy Loss function (gBCE) and\ntheoretically prove that it can mitigate overconfidence. We further propose the\ngSASRec model, an improvement over SASRec that deploys an increased number of\nnegatives and the gBCE loss. We show through detailed experiments on three\ndatasets that gSASRec does not exhibit the overconfidence problem. As a result,\ngSASRec can outperform BERT4Rec (e.g. +9.47% NDCG on the MovieLens-1M dataset),\nwhile requiring less training time (e.g. -73% training time on MovieLens-1M).\nMoreover, in contrast to BERT4Rec, gSASRec is suitable for large datasets that\ncontain more than 1 million items.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:56:40 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Petrov","Aleksandr",""],["Macdonald","Craig",""]]}
{"id":"2308.07193","submitter":"Sahraoui Dhelim Dr","authors":"Abdenacer Naouri, Nabil Abdelkader Nouri, Attia Qammar, Feifei Shi,\n  Huansheng Ning and Sahraoui Dhelim","title":"Task Offloading for Smart Glasses in Healthcare: Enhancing Detection of\n  Elevated Body Temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wearable devices like smart glasses have gained popularity across various\napplications. However, their limited computational capabilities pose challenges\nfor tasks that require extensive processing, such as image and video\nprocessing, leading to drained device batteries. To address this, offloading\nsuch tasks to nearby powerful remote devices, such as mobile devices or remote\nservers, has emerged as a promising solution. This paper focuses on analyzing\ntask-offloading scenarios for a healthcare monitoring application performed on\nsmart wearable glasses, aiming to identify the optimal conditions for\noffloading. The study evaluates performance metrics including task completion\ntime, computing capabilities, and energy consumption under realistic\nconditions. A specific use case is explored within an indoor area like an\nairport, where security agents wearing smart glasses to detect elevated body\ntemperature in individuals, potentially indicating COVID-19. The findings\nhighlight the potential benefits of task offloading for wearable devices in\nhealthcare settings, demonstrating its practicality and relevance.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:57:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Naouri","Abdenacer",""],["Nouri","Nabil Abdelkader",""],["Qammar","Attia",""],["Shi","Feifei",""],["Ning","Huansheng",""],["Dhelim","Sahraoui",""]]}
{"id":"2308.07194","submitter":"Zhidan Luo","authors":"Zhidan Luo","title":"Star-critical Ramsey numbers and regular Ramsey numbers for stars","comments":null,"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, $H$ be a subgraph of $G$, and let $G- H$ be the graph\nobtained from $G$ by removing a copy of $H$. Let $K_{1, n}$ be the star on $n+\n1$ vertices. Let $t\\geq 2$ be an integer and $H_{1}, \\dots, H_{t}$ and $H$ be\ngraphs, and let $H\\rightarrow (H_{1}, \\dots, H_{t})$ denote that every $t$\ncoloring of $E(H)$ yields a monochromatic copy of $H_{i}$ in color $i$ for some\n$i\\in [t]$. Ramsey number $r(H_{1}, \\dots, H_{t})$ is the minimum integer $N$\nsuch that $K_{N}\\rightarrow (H_{1}, \\dots, H_{t})$. Star-critical Ramsey number\n$r_{*}(H_{1}, \\dots, H_{t})$ is the minimum integer $k$ such that $K_{N}- K_{1,\nN- 1- k}\\rightarrow (H_{1}, \\dots, H_{t})$ where $N= r(H_{1}, \\dots, H_{t})$.\nLet $rr(H_{1}, \\dots, H_{t})$ be the regular Ramsey number for $H_{1}, \\dots,\nH_{t}$, which is the minimum integer $r$ such that if $G$ is an $r$-regular\ngraph on $r(H_{1}, \\dots, H_{t})$ vertices, then $G\\rightarrow (H_{1}, \\dots,\nH_{t})$. Let $m_{1}, \\dots, m_{t}$ be integers larger than one, exactly $k$ of\nwhich are even. In this paper, we prove that if $k\\geq 2$ is even, then\n$r_{*}(K_{1, m_{1}}, \\dots, K_{1, m_{t}})= \\sum_{i= 1}^{t} m_{i}- t+ 1-\n\\frac{k}{2}$ which disproves a conjecture of Budden and DeJonge in 2022.\nFurthermore, we prove that if $k\\geq 2$ is even, then $rr(K_{1, m_{1}}, \\dots,\nK_{1, m_{t}})= \\sum_{i= 1}^{t} m_{i}- t$. Otherwise, $rr(K_{1, m_{1}}, \\dots,\nK_{1, m_{t}})= \\sum_{i= 1}^{t} m_{i}- t+ 1$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:58:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Luo","Zhidan",""]]}
{"id":"2308.07195","submitter":"Mat\\'ias Pavez-Sign\\'e","authors":"Richard Montgomery, Mat\\'ias Pavez-Sign\\'e","title":"Counting spanning subgraphs in dense hypergraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a simple method to estimate the number of distinct copies of some\nclasses of spanning subgraphs in hypergraphs with high minimum degree. In\nparticular, for each $k\\geq 2$ and $1\\leq \\ell\\leq k-1$, we show that every\n$k$-graph on $n$ vertices with minimum codegree at least\n  $$\\cases{\\left(\\dfrac{1}{2}+o(1)\\right)n & if $(k-\\ell)\\mid k$,\\\\ & \\\\\n\\left(\\dfrac{1}{\\lceil \\frac{k}{k-\\ell}\\rceil(k-\\ell)}+o(1)\\right)n & if\n$(k-\\ell)\\nmid k$,}$$\n  contains $\\exp(n\\log n-\\Theta(n))$ Hamilton $\\ell$-cycles as long as\n$(k-\\ell)\\mid n$. When $(k-\\ell)\\mid k$ this gives a simple proof of a result\nof Glock, Gould, Joos, K\\\"uhn and Osthus, while, when $(k-\\ell)\\nmid k$ this\ngives a weaker count than that given by Ferber, Hardiman and Mond or, when\n$\\ell<k/2$, by Ferber, Krivelevich and Sudakov, but one that holds for an\nasymptotically optimal minimum codegree bound.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:05:02 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Montgomery","Richard",""],["Pavez-Sign\u00e9","Mat\u00edas",""]]}
{"id":"2308.07196","submitter":"Mohammed Saif","authors":"M. Ali Saif","title":"Nonequilibrium phase transition of a one dimensional system reaches the\n  absorbing state by two different ways","comments":"14 page, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech stat.CO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We study the nonequilibrium phase transitions from the absorbing phase to the\nactive phase for the model of disease spreading\n(Susceptible-Infected-Refractory-Susceptible (SIRS)) on a regular one\ndimensional lattice. In this model, particles of three species (S, I and R) on\na lattice react as follows: $S+I\\rightarrow 2I$ with probability $\\lambda$,\n$I\\rightarrow R$ after infection time $\\tau_I$ and $R\\rightarrow I$ after\nrecovery time $\\tau_R$. In the case of $\\tau_R>\\tau_I$, this model has been\nfound to has two critical thresholds separate the active phase from absorbing\nphases \\cite{ali1}. The first critical threshold $\\lambda_{c1}$ is\ncorresponding to a low infection probability and second critical threshold\n$\\lambda_{c2}$ is corresponding to a high infection probability. At the first\ncritical threshold $\\lambda_{c1}$, our Monte Carlo simulations of this model\nsuggest the phase transition to be of directed percolation class (DP). However,\nat the second critical threshold $\\lambda_{c2}$ we observe that, the system\nbecomes so sensitive to initial values conditions which suggests the phase\ntransition to be discontinuous transition. We confirm this result using order\nparameter quasistationary probability distribution and finite-size analysis for\nthis model at $\\lambda_{c2}$. Additionally, the typical space-time evolution of\nthis model at $\\lambda_{c2}$ shows that, the spreading of active particles are\ncompact in a behavior which remind us the spreading behavior in the compact\ndirected percolation.14\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:05:10 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Saif","M. Ali",""]]}
{"id":"2308.07197","submitter":"Hamza Atac","authors":"H. Atac, A. Camsonne, M. K. Jones, M. Paolone, N. Sparveris, N.\n  Sayadat, S. Shesthra, R. Li, S. Webster, J-P. Chen, S. Covrig-Dusa, A. Deur,\n  M. D. McCaughan, A. Tadepalli, W. Armstrong, S. Joosten, Z.E. Meziani, C.\n  Peng, M. Ali, A.T. Katramatou, G.G. Petratos, E. Brash, J. Bernauer, E.\n  Cline, W. Li, G. Huber, Z. Zhao, N. Liyanage, M. Nycz, R. Gilman, C. Ayerbe\n  Gayoso, M. Mihovilovi\\v{c}, S. \\v{S}irca, M. Demirci, D. Androi\\v{c}, P.\n  Markowitz, A. Arora, D. Ruth, N. Santiesteban K. Slifer, A. Zec","title":"Measurement of the Generalized Polarizabilities of the Proton in Virtual\n  Compton Scattering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose to conduct a measurement of the Virtual Compton Scattering\nreaction in Hall C that will allow the precise extraction of the two scalar\nGeneralized Polarizabilities (GPs) of the proton in the region of\n$Q^2=0.05~(GeV/c)^2$ to $Q^2=0.50~(GeV/c)^2$. The Generalized Polarizabilities\nare fundamental properties of the proton, that characterize the system's\nresponse to an external electromagnetic (EM) field. They describe how easily\nthe charge and magnetization distributions inside the system are distorted by\nthe EM field, mapping out the resulting deformation of the densities in the\nproton. As such, they reveal unique information regarding the underlying system\ndynamics and provide a key for decoding the proton structure in terms of the\ntheory of the strong interaction that binds its elementary quark and gluon\nconstituents together. Recent measurements of the proton GPs have challenged\nthe theoretical predictions, particularly in regard to the electric\npolarizability. The magnetic GP, on the other hand, can provide valuable\ninsight to the competing paramagnetic and diamagnetic contributions in the\nproton, but it is poorly known within the region where the interplay of these\nprocesses is very dynamic and rapidly changing.The unique capabilities of Hall\nC, namely the high resolution of the spectrometers combined with the ability to\nplace the spectrometers in small angles, will allow to pin down the dynamic\nsignature of the GPs through high precision measurements combined with a fine\nmapping as a function of $Q^2$. The experimental setup utilizes standard Hall C\nequipment, as was previously employed in the VCS-I (E12-15-001) experiment,\nnamely the HMS and SHMS spectrometers and a 10 cm liquid hydrogen target. A\ntotal of 59 days of unpolarized 75 $\\mu A$ electron beam with energy of 1100\nMeV (6 days) and 2200 MeV (53 days) is requested for this experiment.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:07:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Atac","H.",""],["Camsonne","A.",""],["Jones","M. K.",""],["Paolone","M.",""],["Sparveris","N.",""],["Sayadat","N.",""],["Shesthra","S.",""],["Li","R.",""],["Webster","S.",""],["Chen","J-P.",""],["Covrig-Dusa","S.",""],["Deur","A.",""],["McCaughan","M. D.",""],["Tadepalli","A.",""],["Armstrong","W.",""],["Joosten","S.",""],["Meziani","Z. E.",""],["Peng","C.",""],["Ali","M.",""],["Katramatou","A. T.",""],["Petratos","G. G.",""],["Brash","E.",""],["Bernauer","J.",""],["Cline","E.",""],["Li","W.",""],["Huber","G.",""],["Zhao","Z.",""],["Liyanage","N.",""],["Nycz","M.",""],["Gilman","R.",""],["Gayoso","C. Ayerbe",""],["Mihovilovi\u010d","M.",""],["\u0160irca","S.",""],["Demirci","M.",""],["Androi\u010d","D.",""],["Markowitz","P.",""],["Arora","A.",""],["Ruth","D.",""],["Slifer","N. Santiesteban K.",""],["Zec","A.",""]]}
{"id":"2308.07198","submitter":"Patrick Altmeyer","authors":"Patrick Altmeyer and Arie van Deursen and Cynthia C. S. Liem","title":"Explaining Black-Box Models through Counterfactuals","comments":"13 pages, 9 figures, originally published in The Proceedings of the\n  JuliaCon Conferences (JCON)","journal-ref":"JuliaCon Proceedings, 1(1), 130 (2023)","doi":"10.21105/jcon.00130","report-no":null,"categories":"cs.LG cs.AI cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present CounterfactualExplanations.jl: a package for generating\nCounterfactual Explanations (CE) and Algorithmic Recourse (AR) for black-box\nmodels in Julia. CE explain how inputs into a model need to change to yield\nspecific model predictions. Explanations that involve realistic and actionable\nchanges can be used to provide AR: a set of proposed actions for individuals to\nchange an undesirable outcome for the better. In this article, we discuss the\nusefulness of CE for Explainable Artificial Intelligence and demonstrate the\nfunctionality of our package. The package is straightforward to use and\ndesigned with a focus on customization and extensibility. We envision it to one\nday be the go-to place for explaining arbitrary predictive models in Julia\nthrough a diverse suite of counterfactual generators.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:07:05 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Altmeyer","Patrick",""],["van Deursen","Arie",""],["Liem","Cynthia C. S.",""]]}
{"id":"2308.07199","submitter":"Jozef Han\\v{c}","authors":"Dominik Borovsk\\'y, Jozef Han\\v{c}, Martina Han\\v{c}ov\\'a","title":"Scientific Computing with Open SageMath not only for Physics Education","comments":"9 pages, 3 figures, 1 table, conference DIDSCI2022","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nowadays interactive digital scientific environments have become an integral\npart of scientific computing in solving various scientific tasks in research,\nbut also STEM education. We introduce SageMath or shortly Sage -- a free open\nPython-based alternative to the well-known commercial software -- in the frame\nof our course Methods of Physical Problems Solving for future scientists and\nscience teachers. Particularly, in the 1st illustrative example from the\nPhysics Olympiad, we present Sage as a scientific open data source, symbolic,\nnumerical, and visualization tool. The 2nd example from the Young Physicists'\nTournament shows Sage as a multimedia, modeling, and programming tool. By\nemploying SageMath as an open digital environment for scientific computing in\nthe education of all STEM disciplines, teachers and students are empowered not\nonly with a universal educational tool, but a real research tool, enabling them\nto engage in interactive visualization, modeling, programming, and solving of\nauthentic, complex interdisciplinary problems, thus naturally enhancing their\nmotivation to pursue science in alignment with the core mission of STEM\neducation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:07:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Borovsk\u00fd","Dominik",""],["Han\u010d","Jozef",""],["Han\u010dov\u00e1","Martina",""]]}
{"id":"2308.07200","submitter":"He Zhang","authors":"Qingxu Zhu, He Zhang, Mengting Lan, Lei Han","title":"Neural Categorical Priors for Physics-Based Character Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in learning reusable motion priors have demonstrated their\neffectiveness in generating naturalistic behaviors. In this paper, we propose a\nnew learning framework in this paradigm for controlling physics-based\ncharacters with significantly improved motion quality and diversity over\nexisting state-of-the-art methods. The proposed method uses reinforcement\nlearning (RL) to initially track and imitate life-like movements from\nunstructured motion clips using the discrete information bottleneck, as adopted\nin the Vector Quantized Variational AutoEncoder (VQ-VAE). This structure\ncompresses the most relevant information from the motion clips into a compact\nyet informative latent space, i.e., a discrete space over vector quantized\ncodes. By sampling codes in the space from a trained categorical prior\ndistribution, high-quality life-like behaviors can be generated, similar to the\nusage of VQ-VAE in computer vision. Although this prior distribution can be\ntrained with the supervision of the encoder's output, it follows the original\nmotion clip distribution in the dataset and could lead to imbalanced behaviors\nin our setting. To address the issue, we further propose a technique named\nprior shifting to adjust the prior distribution using curiosity-driven RL. The\noutcome distribution is demonstrated to offer sufficient behavioral diversity\nand significantly facilitates upper-level policy learning for downstream tasks.\nWe conduct comprehensive experiments using humanoid characters on two\nchallenging downstream tasks, sword-shield striking and two-player boxing game.\nOur results demonstrate that the proposed framework is capable of controlling\nthe character to perform considerably high-quality movements in terms of\nbehavioral strategies, diversity, and realism. Videos, codes, and data are\navailable at https://tencent-roboticsx.github.io/NCP/.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:10:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhu","Qingxu",""],["Zhang","He",""],["Lan","Mengting",""],["Han","Lei",""]]}
{"id":"2308.07201","submitter":"Chi-Min Chan","authors":"Chi-Min Chan, Weize Chen, Yusheng Su, Jianxuan Yu, Wei Xue, Shanghang\n  Zhang, Jie Fu, Zhiyuan Liu","title":"ChatEval: Towards Better LLM-based Evaluators through Multi-Agent Debate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text evaluation has historically posed significant challenges, often\ndemanding substantial labor and time cost. With the emergence of large language\nmodels (LLMs), researchers have explored LLMs' potential as alternatives for\nhuman evaluation. While these single-agent-based approaches show promise,\nexperimental results suggest that further advancements are needed to bridge the\ngap between their current effectiveness and human-level evaluation quality.\nRecognizing that best practices of human evaluation processes often involve\nmultiple human annotators collaborating in the evaluation, we resort to a\nmulti-agent debate framework, moving beyond single-agent prompting strategies.\nThe multi-agent-based approach enables a group of LLMs to synergize with an\narray of intelligent counterparts, harnessing their distinct capabilities and\nexpertise to enhance efficiency and effectiveness in handling intricate tasks.\nIn this paper, we construct a multi-agent referee team called ChatEval to\nautonomously discuss and evaluate the quality of generated responses from\ndifferent models on open-ended questions and traditional natural language\ngeneration (NLG) tasks. Our analysis shows that ChatEval transcends mere\ntextual scoring, offering a human-mimicking evaluation process for reliable\nassessments. Our code is available at https://github.com/chanchimin/ChatEval.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:13:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chan","Chi-Min",""],["Chen","Weize",""],["Su","Yusheng",""],["Yu","Jianxuan",""],["Xue","Wei",""],["Zhang","Shanghang",""],["Fu","Jie",""],["Liu","Zhiyuan",""]]}
{"id":"2308.07202","submitter":"Xugong Qin","authors":"Xugong Qin, Pengyuan Lyu, Chengquan Zhang, Yu Zhou, Kun Yao, Peng\n  Zhang, Hailun Lin, Weiping Wang","title":"Towards Robust Real-Time Scene Text Detection: From Semantic to Instance\n  Representation Learning","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to the flexible representation of arbitrary-shaped scene text and simple\npipeline, bottom-up segmentation-based methods begin to be mainstream in\nreal-time scene text detection. Despite great progress, these methods show\ndeficiencies in robustness and still suffer from false positives and instance\nadhesion. Different from existing methods which integrate multiple-granularity\nfeatures or multiple outputs, we resort to the perspective of representation\nlearning in which auxiliary tasks are utilized to enable the encoder to jointly\nlearn robust features with the main task of per-pixel classification during\noptimization. For semantic representation learning, we propose global-dense\nsemantic contrast (GDSC), in which a vector is extracted for global semantic\nrepresentation, then used to perform element-wise contrast with the dense grid\nfeatures. To learn instance-aware representation, we propose to combine\ntop-down modeling (TDM) with the bottom-up framework to provide implicit\ninstance-level clues for the encoder. With the proposed GDSC and TDM, the\nencoder network learns stronger representation without introducing any\nparameters and computations during inference. Equipped with a very light\ndecoder, the detector can achieve more robust real-time scene text detection.\nExperimental results on four public datasets show that the proposed method can\noutperform or be comparable to the state-of-the-art on both accuracy and speed.\nSpecifically, the proposed method achieves 87.2% F-measure with 48.2 FPS on\nTotal-Text and 89.6% F-measure with 36.9 FPS on MSRA-TD500 on a single GeForce\nRTX 2080 Ti GPU.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:14:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qin","Xugong",""],["Lyu","Pengyuan",""],["Zhang","Chengquan",""],["Zhou","Yu",""],["Yao","Kun",""],["Zhang","Peng",""],["Lin","Hailun",""],["Wang","Weiping",""]]}
{"id":"2308.07203","submitter":"Zhuangfei Wu","authors":"Zhuangfei Wu, Lin Bai and Lin Zhou","title":"Successive Refinement of Shannon Cipher System Under Maximal Leakage","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the successive refinement setting of Shannon cipher system (SCS)\nunder the maximal leakage constraint for discrete memoryless sources under\nbounded distortion measures. Specifically, we generalize the threat model for\nthe point-to-point rate-distortion setting of Issa, Wagner and Kamath (T-IT\n2020) to the multiterminal successive refinement setting. Under mild conditions\nthat correspond to partial secrecy, we characterize the asymptotically optimal\nnormalized maximal leakage region for both the joint excess-distortion\nprobability (JEP) and the expected distortion reliability constraints. Under\nJEP, in the achievability part, we propose a type-based coding scheme, analyze\nthe reliability guarantee for JEP and bound the leakage of the information\nsource through compressed versions. In the converse part, by analyzing a\nguessing scheme of the eavesdropper, we prove the optimality of our\nachievability result. Under expected distortion, the achievability part is\nestablished similarly to the JEP counterpart. The converse proof proceeds by\ngeneralizing the corresponding results for the rate-distortion setting of SCS\nby Schieler and Cuff (T-IT 2014) to the successive refinement setting. Somewhat\nsurprisingly, the normalized maximal leakage regions under both JEP and\nexpected distortion constraints are identical under certain conditions,\nalthough JEP appears to be a stronger reliability constraint.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:16:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wu","Zhuangfei",""],["Bai","Lin",""],["Zhou","Lin",""]]}
{"id":"2308.07204","submitter":"Manuel Radons","authors":"Lars Simon and Manuel Radons","title":"Algorithms for the Training of Neural Support Vector Machines","comments":"19 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural support vector machines (NSVMs) allow for the incorporation of domain\nknowledge in the design of the model architecture. In this article we introduce\na set of training algorithms for NSVMs that leverage the Pegasos algorithm and\nprovide a proof of concept by solving a set of standard machine learning tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:16:39 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Simon","Lars",""],["Radons","Manuel",""]]}
{"id":"2308.07205","submitter":"Terence C. Tao","authors":"Terence Tao","title":"The convergence of an alternating series of Erd\\H{o}s, assuming the\n  Hardy--Littlewood prime tuples conjecture","comments":"16 pages, no figures. A generalization to the main result added, as\n  well as some more references and open questions","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is an open question of Erd\\H{o}s as to whether the alternating series\n$\\sum_{n=1}^\\infty \\frac{(-1)^n n}{p_n}$ is (conditionally) convergent, where\n$p_n$ denotes the $n^{\\mathrm{th}}$ prime. By using a random sifted model of\nthe primes recently introduced by Banks, Ford, and the author, as well as\nvariants of a well known calculation of Gallagher, we show that the answer to\nthis question is affirmative assuming a suitably strong version of the\nHardy--Littlewood prime tuples conjecture.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:20:04 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 02:23:25 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 16:24:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tao","Terence",""]]}
{"id":"2308.07206","submitter":"Xiang Liu","authors":"Xue-Jian Li, Yu-Shuai Li, Fu-Lai Wang and Xiang Liu","title":"Whole $B_c$ meson spectroscopy under the unquenched picture","comments":"30 pages, 7 figures and 17 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this work, we investigate the spectroscopy of higher $B_c$ mesons, with a\nspecial focus on the consideration of the unquenched effects. To account for\nsuch effects, we employ the modified Godfrey-Isgur model and introduce a\nscreening potential. The resulting mass spectrum of the concerned higher $B_c$\nstates is then presented, showing significant deviations after considering the\nunquenched effects. This emphasizes the importance of considering the\nunquenched effects when studying of the higher $B_c$ mesons. Furthermore, we\ndetermine the corresponding spatial wave functions of these $B_c$ mesons, which\nhave practical applications in subsequent studies of their decays. These decays\ninclude two-body Okuba-Zweig-Iizuka allowed strong decays, dipion transitions\nbetween $B_c$ mesons, radiative decays, and some typical weak decays. With the\nongoing high-luminosity upgrade of the Large Hadron Collider, we expect the\ndiscovery of additional $B_c$ states in the near future. The knowledge gained\nfrom the mass spectrum and the different decay modes will undoubtedly provide\nvaluable insights for future experimental explorations of these higher $B_c$\nmesons.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:23:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Xue-Jian",""],["Li","Yu-Shuai",""],["Wang","Fu-Lai",""],["Liu","Xiang",""]]}
{"id":"2308.07207","submitter":"Mufeng Yao","authors":"Mufeng Yao, Jiaqi Wang, Jinlong Peng, Mingmin Chi, Chao Liu","title":"FOLT: Fast Multiple Object Tracking from UAV-captured Videos Based on\n  Optical Flow","comments":"Accepted by ACM Multi-Media 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multiple object tracking (MOT) has been successfully investigated in computer\nvision.\n  However, MOT for the videos captured by unmanned aerial vehicles (UAV) is\nstill challenging due to small object size, blurred object appearance, and very\nlarge and/or irregular motion in both ground objects and UAV platforms.\n  In this paper, we propose FOLT to mitigate these problems and reach fast and\naccurate MOT in UAV view.\n  Aiming at speed-accuracy trade-off, FOLT adopts a modern detector and\nlight-weight optical flow extractor to extract object detection features and\nmotion features at a minimum cost.\n  Given the extracted flow, the flow-guided feature augmentation is designed to\naugment the object detection feature based on its optical flow, which improves\nthe detection of small objects.\n  Then the flow-guided motion prediction is also proposed to predict the\nobject's position in the next frame, which improves the tracking performance of\nobjects with very large displacements between adjacent frames.\n  Finally, the tracker matches the detected objects and predicted objects using\na spatially matching scheme to generate tracks for every object.\n  Experiments on Visdrone and UAVDT datasets show that our proposed model can\nsuccessfully track small objects with large and irregular motion and outperform\nexisting state-of-the-art methods in UAV-MOT tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:24:44 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 02:59:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yao","Mufeng",""],["Wang","Jiaqi",""],["Peng","Jinlong",""],["Chi","Mingmin",""],["Liu","Chao",""]]}
{"id":"2308.07208","submitter":"Marco Muzio","authors":"Marco Stein Muzio, Luis A. Anchordoqui, Michael Unger","title":"Data-driven analysis for understanding ultrahigh energy cosmic ray\n  source spectra","comments":null,"journal-ref":null,"doi":"10.22323/1.444.0293","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most challenging open questions regarding the origin of ultrahigh\nenergy cosmic rays (UHECRs) deals with the shape of the source emission\nspectra. A commonly-used simplifying assumption is that the source spectra of\nthe highest energy cosmic rays trace a Peters cycle, in which the maximum\ncosmic-ray energy scales linearly with $Z$, i.e., with the charge of the UHECR\nin units of the proton charge. However, this would only be a natural assumption\nfor models in which UHECRs escape the acceleration region without suffering\nsignificant energy losses. In most cases, however, UHECRs interact in the\nacceleration region and/or in the source environment changing the shape of the\nsource emission spectra. Energy losses are typically parameterized in terms of\n$Z$ and the UHECR baryon number $A$, and therefore one would expect the source\nemission spectra to be a function of both $Z$ and $A$. Taking a pragmatic\napproach, we investigate whether existing data favor any region of the $(Z,A)$\nparameter space. Using data from the Pierre Auger Observatory, we carry out a\nmaximum likelihood analysis of the observed spectrum and nuclear composition to\nshape the source emission spectra for the various particle species. We also\nstudy the impact of possible systematic uncertainties driven by hadronic models\ndescribing interactions in the atmosphere.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:25:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Muzio","Marco Stein",""],["Anchordoqui","Luis A.",""],["Unger","Michael",""]]}
{"id":"2308.07209","submitter":"Shipeng Bai","authors":"Shipeng Bai, Jun Chen, Xintian Shen, Yixuan Qian, Yong Liu","title":"Unified Data-Free Compression: Pruning and Quantization without\n  Fine-Tuning","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Structured pruning and quantization are promising approaches for reducing the\ninference time and memory footprint of neural networks. However, most existing\nmethods require the original training dataset to fine-tune the model. This not\nonly brings heavy resource consumption but also is not possible for\napplications with sensitive or proprietary data due to privacy and security\nconcerns. Therefore, a few data-free methods are proposed to address this\nproblem, but they perform data-free pruning and quantization separately, which\ndoes not explore the complementarity of pruning and quantization. In this\npaper, we propose a novel framework named Unified Data-Free Compression(UDFC),\nwhich performs pruning and quantization simultaneously without any data and\nfine-tuning process. Specifically, UDFC starts with the assumption that the\npartial information of a damaged(e.g., pruned or quantized) channel can be\npreserved by a linear combination of other channels, and then derives the\nreconstruction form from the assumption to restore the information loss due to\ncompression. Finally, we formulate the reconstruction error between the\noriginal network and its compressed network, and theoretically deduce the\nclosed-form solution. We evaluate the UDFC on the large-scale image\nclassification task and obtain significant improvements over various network\narchitectures and compression methods. For example, we achieve a 20.54%\naccuracy improvement on ImageNet dataset compared to SOTA method with 30%\npruning ratio and 6-bit quantization on ResNet-34.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:25:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bai","Shipeng",""],["Chen","Jun",""],["Shen","Xintian",""],["Qian","Yixuan",""],["Liu","Yong",""]]}
{"id":"2308.07210","submitter":"Nikolai Krivulin","authors":"Nikolai Krivulin","title":"Algebraic solution of tropical best approximation problems","comments":"24 pages","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 discrete best approximation problems formulated and solved in the\nframework of tropical algebra that deals with semirings and semifields with\nidempotent addition. Given a set of samples each consisting of input and output\nof an unknown function defined on an idempotent semifield, the problems are to\nfind a best approximation of the function by tropical Puiseux polynomial and\nrational functions. A new solution approach is proposed which involves the\nreduction of the problem of polynomial approximation to best approximate\nsolution of a tropical linear vector equation with an unknown vector on one\nside (a one-sided equation). We derive a best approximate solution to the\none-sided equation end evaluate the inherent approximation error in a direct\nanalytical form. Furthermore, we reduce the rational approximation problem to\nthe best approximate solution of an equation with unknown vectors on both sides\n(a two-sided equation). A best approximate solution to the two-sided equation\nis obtained in numerical form by using an iterative alternating algorithm. To\nillustrate the technique developed, we solve example approximation problems in\nterms of a real semifield where addition is defined as maximum and\nmultiplication as arithmetic addition (max-plus algebra), which correspond to\nthe best Chebyshev approximation by piecewise linear functions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:27:16 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Krivulin","Nikolai",""]]}
{"id":"2308.07211","submitter":"Marco Muzio","authors":"Marco Stein Muzio, No\\'emie Globus","title":"Probing extreme astrophysical accelerators through neutrino anisotropy","comments":null,"journal-ref":null,"doi":"10.22323/1.444.1049","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the extent to which anisotropies in the ultrahigh energy neutrino\nsky can probe the distribution of extreme astrophysical accelerators in the\nuniverse. In this talk, we discuss the origin of an anisotropic neutrino sky\nand show how observers can use this anisotropy to measure the evolution of\nultrahigh energy neutrino sources - and therefore, the sources of ultrahigh\nenergy cosmic rays - for the very first time.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:29:30 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 15:18:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Muzio","Marco Stein",""],["Globus","No\u00e9mie",""]]}
{"id":"2308.07212","submitter":"Sovesh Mohapatra","authors":"Shashidhar Reddy Javaji, Sovesh Mohapatra, Advait Gosai, Gottfried\n  Schlaug","title":"Automated Ensemble-Based Segmentation of Pediatric Brain Tumors: A Novel\n  Approach Using the CBTN-CONNECT-ASNR-MICCAI BraTS-PEDs 2023 Challenge Data","comments":"3 Figs, 3 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Brain tumors remain a critical global health challenge, necessitating\nadvancements in diagnostic techniques and treatment methodologies. In response\nto the growing need for age-specific segmentation models, particularly for\npediatric patients, this study explores the deployment of deep learning\ntechniques using magnetic resonance imaging (MRI) modalities. By introducing a\nnovel ensemble approach using ONet and modified versions of UNet, coupled with\ninnovative loss functions, this study achieves a precise segmentation model for\nthe BraTS-PEDs 2023 Challenge. Data augmentation, including both single and\ncomposite transformations, ensures model robustness and accuracy across\ndifferent scanning protocols. The ensemble strategy, integrating the ONet and\nUNet models, shows greater effectiveness in capturing specific features and\nmodeling diverse aspects of the MRI images which result in lesion_wise dice\nscores of 0.52, 0.72 and 0.78 for enhancing tumor, tumor core and whole tumor\nlabels respectively. Visual comparisons further confirm the superiority of the\nensemble method in accurate tumor region coverage. The results indicate that\nthis advanced ensemble approach, building upon the unique strengths of\nindividual models, offers promising prospects for enhanced diagnostic accuracy\nand effective treatment planning for brain tumors in pediatric brains.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:29:32 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Javaji","Shashidhar Reddy",""],["Mohapatra","Sovesh",""],["Gosai","Advait",""],["Schlaug","Gottfried",""]]}
{"id":"2308.07213","submitter":"Houjiang Liu","authors":"Houjiang Liu, Anubrata Das, Alexander Boltz, Didi Zhou, Daisy Pinaroc,\n  Matthew Lease, Min Kyung Lee","title":"Human-centered NLP Fact-checking: Co-Designing with Fact-checkers using\n  Matchmaking for AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A key challenge in professional fact-checking is its limited scalability in\nrelation to the magnitude of false information. While many Natural Language\nProcessing (NLP) tools have been proposed to enhance fact-checking efficiency\nand scalability, both academic research and fact-checking organizations report\nlimited adoption of such tooling due to insufficient alignment with\nfact-checker practices, values, and needs. To address this gap, we investigate\na co-design method, Matchmaking for AI, which facilitates fact-checkers,\ndesigners, and NLP researchers to collaboratively discover what fact-checker\nneeds should be addressed by technology and how. Our co-design sessions with 22\nprofessional fact-checkers yielded a set of 11 novel design ideas. They assist\nin information searching, processing, and writing tasks for efficient and\npersonalized fact-checking; help fact-checkers proactively prepare for future\nmisinformation; monitor their potential biases; and support internal\norganization collaboration. Our work offers implications for human-centered\nfact-checking research and practice and AI co-design research.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:31:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Houjiang",""],["Das","Anubrata",""],["Boltz","Alexander",""],["Zhou","Didi",""],["Pinaroc","Daisy",""],["Lease","Matthew",""],["Lee","Min Kyung",""]]}
{"id":"2308.07214","submitter":"Sovesh Mohapatra","authors":"Chiranjeewee Prasad Koirala, Sovesh Mohapatra, Advait Gosai, Gottfried\n  Schlaug","title":"Automated Ensemble-Based Segmentation of Adult Brain Tumors: A Novel\n  Approach Using the BraTS AFRICA Challenge Data","comments":"3 figs and 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Brain tumors, particularly glioblastoma, continue to challenge medical\ndiagnostics and treatments globally. This paper explores the application of\ndeep learning to multi-modality magnetic resonance imaging (MRI) data for\nenhanced brain tumor segmentation precision in the Sub-Saharan Africa patient\npopulation. We introduce an ensemble method that comprises eleven unique\nvariations based on three core architectures: UNet3D, ONet3D, SphereNet3D and\nmodified loss functions. The study emphasizes the need for both age- and\npopulation-based segmentation models, to fully account for the complexities in\nthe brain. Our findings reveal that the ensemble approach, combining different\narchitectures, outperforms single models, leading to improved evaluation\nmetrics. Specifically, the results exhibit Dice scores of 0.82, 0.82, and 0.87\nfor enhancing tumor, tumor core, and whole tumor labels respectively. These\nresults underline the potential of tailored deep learning techniques in\nprecisely segmenting brain tumors and lay groundwork for future work to\nfine-tune models and assess performance across different brain regions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:34:22 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Koirala","Chiranjeewee Prasad",""],["Mohapatra","Sovesh",""],["Gosai","Advait",""],["Schlaug","Gottfried",""]]}
{"id":"2308.07215","submitter":"\\v{Z}ikica Luki\\'c","authors":"\\v{Z}ikica Luki\\'c, Bojana Milo\\v{s}evi\\'c","title":"A novel two-sample test within the space of symmetric positive definite\n  matrix distributions and its application in finance","comments":"13 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel two-sample test for a broad class of\northogonally equivalent positive definite symmetric matrix distributions. Our\ntest is the first of its kind and we derive its asymptotic distribution. To\nestimate the test power, we use a warp-speed bootstrap method and consider the\nmost common matrix distributions. We provide several real data examples,\nincluding the data for main cryptocurrencies and stock data of major US\ncompanies. The real data examples demonstrate the applicability of our test in\nthe context closely related to algorithmic trading. The popularity of matrix\ndistributions in many applications and the need for such a test in the\nliterature are reconciled by our findings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:37:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Luki\u0107","\u017dikica",""],["Milo\u0161evi\u0107","Bojana",""]]}
{"id":"2308.07216","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Measurement of the Higgs boson mass with $H \\rightarrow \\gamma\\gamma$\n  decays in 140 fb$^{-1}$ of $\\sqrt{s}=13$ TeV $pp$ collisions with the ATLAS\n  detector","comments":"37 pages in total, author list starting page 19, 3 figures, 2 tables,\n  submitted to Phys. Lett. B. All figures and tables including auxiliary\n  figures and tables are available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/HIGG-2019-16/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-160","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mass of the Higgs boson is measured in the $H\\to\\gamma\\gamma$ decay\nchannel, exploiting the high resolution of the invariant mass of photon pairs\nreconstructed from the decays of Higgs bosons produced in proton-proton\ncollisions at a centre-of-mass energy $\\sqrt{s}=13$ TeV. The dataset was\ncollected between 2015 and 2018 by the ATLAS detector at the Large Hadron\nCollider, and corresponds to an integrated luminosity of 140 fb$^{-1}$. The\nmeasured value of the Higgs boson mass is $125.17 \\pm 0.11 \\mathrm{(stat.)} \\pm\n0.09 \\mathrm{(syst.)}$ GeV and is based on an improved energy scale calibration\nfor photons, whose impact on the measurement is about four times smaller than\nin the previous publication. A combination with the corresponding measurement\nusing 7 and 8 TeV $pp$ collision ATLAS data results in a Higgs boson mass\nmeasurement of $125.22 \\pm 0.11 \\mathrm{(stat.)} \\pm 0.09 \\mathrm{(syst.)}$\nGeV. With an uncertainty of 1.1 per mille, this is currently the most precise\nmeasurement of the mass of the Higgs boson from a single decay channel.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:37:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.07217","submitter":"Willie Rush Lim","authors":"Willie Rush Lim","title":"Rigidity of J-rotational rational maps and critical quasicircle maps","comments":"56 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We say that a periodic quasicircle of a rational map is a rotation\nquasicircle if the return map is conjugate to an irrational rotation, and a\nHerman quasicircle if additionally it is not contained in the closure of any\nrotation domain. In the first part of this paper, we study rational maps which\nare geometrically finite away from rotation quasicircles of bounded type. We\nshow that the Julia set of such a map does not support any invariant line\nfield, and additionally has zero Lebesgue measure in the absence of Herman\nquasicircles. As an application, every rational map that admits a single\nbounded type Herman quasicircle of the simplest configuration must be\ncombinatorially rigid and it always arises as a genuine limit of degenerating\nHerman rings of the same rotation number. In the second part, we initiate the\nstudy of renormalization theory of critical quasicircle maps, i.e. analytic\nself homeomorphisms of a quasicircle with a single critical point. We prove\n$C^{1+\\alpha}$ rigidity of critical quasicircle maps with bounded type rotation\nnumber and construct the corresponding renormalization horseshoe. Our results\ngeneralize classical results of McMullen, de Faria, and de Melo.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:37:45 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 23:24:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lim","Willie Rush",""]]}
{"id":"2308.07218","submitter":"Tomas Kaiser","authors":"Roman \\v{C}ada, Adam Kabela, Tom\\'a\\v{s} Kaiser, Petr Vr\\'ana","title":"Packing $T$-connectors in graphs needs more connectivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strengthening the classical concept of Steiner trees, West and Wu [J. Combin.\nTheory Ser. B 102 (2012), 186--205] introduced the notion of a $T$-connector in\na graph $G$ with a set $T$ of terminals. They conjectured that if the set $T$\nis $3k$-edge-connected in $G$, then $G$ contains $k$ edge-disjoint\n$T$-connectors. We disprove this conjecture by constructing infinitely many\ncounterexamples for $k=1$ and for each even $k$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:38:18 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 14:10:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["\u010cada","Roman",""],["Kabela","Adam",""],["Kaiser","Tom\u00e1\u0161",""],["Vr\u00e1na","Petr",""]]}
{"id":"2308.07219","submitter":"Congkao Wen","authors":"Augustus Brown, Paul Heslop, Congkao Wen, Haitian Xie","title":"Integrated correlators in $\\mathcal{N}=4$ SYM beyond localisation","comments":"5 pages plus 1 appendix","journal-ref":null,"doi":null,"report-no":"QMUL-PH-23-13","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study integrated correlators of four superconformal primaries\n$\\mathcal{O}_{p}$ with arbitrary charges $p$ in $\\mathcal{N}{=}4$ super\nYang-Mills theory (SYM). The $ \\langle \\mathcal{O}_{2} \\mathcal{O}_{2}\n\\mathcal{O}_{p} \\mathcal{O}_{p} \\rangle$ integrated correlators can be computed\nby supersymmetric localisation, whereas correlators with more general charges\nare currently not accessible from this method and in general contain\ncomplicated multi-zeta values. Nevertheless we observe that if one sums over\nthe contributions from all different channels in a given correlator, then all\nthe multi-zeta values (and products of zeta's) cancel leaving only\n$\\zeta(2\\ell{+}1)$ at $\\ell$-loops. We then propose an exact expression of such\nintegrated correlators in the planar limit, valid for arbitrary 't Hooft\ncoupling. The expression matches with the known exact localisation-based\nresults for specific charges, as well as with all existing perturbative and\nstrong-coupling results in the literature for more general charges. As an\napplication, our result is used to determine certain $7$-loop Feynman integral\nperiods and fix previously unknown coefficients in the correlators at strong\ncoupling.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:40:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Brown","Augustus",""],["Heslop","Paul",""],["Wen","Congkao",""],["Xie","Haitian",""]]}
{"id":"2308.07220","submitter":"Houjun Zhang","authors":"Yu-Zhe Liu, Chao Zhang, Houjun Zhang","title":"Constructing projective resolution and taking cohomology for gentle\n  algebras in the geometric model","comments":"29 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The geometric models for the module category and derived category of any\ngentle algebra were introduced to realize the objects in module category and\nderived category by permissible curves and admissible curves respectively. The\npresent paper firstly unifies these two realizations of objects in module\ncategory and derived category via same surface for any gentle algebra, by the\nrotation of permissible curves corresponding to the objects in the module\ncategory. Secondly, the geometric characterization of the cohomology of\ncomplexes over gentle algebras is established by the truncation of projective\npermissible curves. It is worth mentioning that the rotation of permissible\ncurves and the truncation of projective permissible curves are mutually inverse\nprocesses to some extent. As applications, an alternative proof of ``no gaps\"\ntheorem as to cohomological length for the bounded derived categories of gentle\nalgebras is provided in terms of the geometric characterization of the\ncohomology of complexes. Moreover, we obtain a geometric proof for the strong\nNakayama conjecture for gentle algebras. Finally, we contain two examples to\nillustrate our results.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:42:15 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Yu-Zhe",""],["Zhang","Chao",""],["Zhang","Houjun",""]]}
{"id":"2308.07221","submitter":"Zhaohui Li","authors":"Zhaohui Li and Haitao Wang and Xinghua Jiang","title":"AudioFormer: Audio Transformer learns audio feature representations from\n  discrete acoustic codes","comments":"Need to supplement more detailed experiments","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We propose a method named AudioFormer,which learns audio feature\nrepresentations through the acquisition of discrete acoustic codes and\nsubsequently fine-tunes them for audio classification tasks. Initially,we\nintroduce a novel perspective by considering the audio classification task as a\nform of natural language understanding (NLU). Leveraging an existing neural\naudio codec model,we generate discrete acoustic codes and utilize them to train\na masked language model (MLM),thereby obtaining audio feature representations.\nFurthermore,we pioneer the integration of a Multi-Positive sample Contrastive\n(MPC) learning approach. This method enables the learning of joint\nrepresentations among multiple discrete acoustic codes within the same audio\ninput. In our experiments,we treat discrete acoustic codes as textual data and\ntrain a masked language model using a cloze-like methodology,ultimately\nderiving high-quality audio representations. Notably,the MPC learning technique\neffectively captures collaborative representations among distinct positive\nsamples. Our research outcomes demonstrate that AudioFormer attains\nsignificantly improved performance compared to prevailing monomodal audio\nclassification models across multiple datasets,and even outperforms\naudio-visual multimodal classification models on select datasets.\nSpecifically,our approach achieves remarkable results on datasets including\nAudioSet (2M,20K),and FSD50K,with performance scores of 53.9,45.1,and\n65.6,respectively. We have openly shared both the code and models:\nhttps://github.com/LZH-0225/AudioFormer.git.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:47:25 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 06:00:03 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 02:48:57 GMT"},{"version":"v4","created":"Mon, 21 Aug 2023 02:56:43 GMT"},{"version":"v5","created":"Wed, 23 Aug 2023 14:24:51 GMT"},{"version":"v6","created":"Fri, 25 Aug 2023 12:33:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Zhaohui",""],["Wang","Haitao",""],["Jiang","Xinghua",""]]}
{"id":"2308.07222","submitter":"Hao Wu","authors":"Hao Wu and Alejandro Ariza-Casabona and Bart{\\l}omiej Twardowski and\n  Tri Kurniawan Wijaya","title":"MM-GEF: Multi-modal representation meet collaborative filtering","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":"  In modern e-commerce, item content features in various modalities offer\naccurate yet comprehensive information to recommender systems. The majority of\nprevious work either focuses on learning effective item representation during\nmodelling user-item interactions, or exploring item-item relationships by\nanalysing multi-modal features. Those methods, however, fail to incorporate the\ncollaborative item-user-item relationships into the multi-modal feature-based\nitem structure. In this work, we propose a graph-based item structure\nenhancement method MM-GEF: Multi-Modal recommendation with Graph Early-Fusion,\nwhich effectively combines the latent item structure underlying multi-modal\ncontents with the collaborative signals. Instead of processing the content\nfeature in different modalities separately, we show that the early-fusion of\nmulti-modal features provides significant improvement. MM-GEF learns refined\nitem representations by injecting structural information obtained from both\nmulti-modal and collaborative signals. Through extensive experiments on four\npublicly available datasets, we demonstrate systematical improvements of our\nmethod over state-of-the-art multi-modal recommendation methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:47:36 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wu","Hao",""],["Ariza-Casabona","Alejandro",""],["Twardowski","Bart\u0142omiej",""],["Wijaya","Tri Kurniawan",""]]}
{"id":"2308.07223","submitter":"Melanie Roschewitz","authors":"M\\'elanie Roschewitz and Ben Glocker","title":"Distance Matters For Improving Performance Estimation Under Covariate\n  Shift","comments":"Accepted to ICCV Workshop on Uncertainty Quantification for Computer\n  Vision 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Performance estimation under covariate shift is a crucial component of safe\nAI model deployment, especially for sensitive use-cases. Recently, several\nsolutions were proposed to tackle this problem, most leveraging model\npredictions or softmax confidence to derive accuracy estimates. However, under\ndataset shifts, confidence scores may become ill-calibrated if samples are too\nfar from the training distribution. In this work, we show that taking into\naccount distances of test samples to their expected training distribution can\nsignificantly improve performance estimation under covariate shift. Precisely,\nwe introduce a \"distance-check\" to flag samples that lie too far from the\nexpected distribution, to avoid relying on their untrustworthy model outputs in\nthe accuracy estimation step. We demonstrate the effectiveness of this method\non 13 image classification tasks, across a wide-range of natural and synthetic\ndistribution shifts and hundreds of models, with a median relative MAE\nimprovement of 27% over the best baseline across all tasks, and SOTA\nperformance on 10 out of 13 tasks. Our code is publicly available at\nhttps://github.com/melanibe/distance_matters_performance_estimation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:49:19 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Roschewitz","M\u00e9lanie",""],["Glocker","Ben",""]]}
{"id":"2308.07224","submitter":"Marco Muzio","authors":"Marco Stein Muzio (for the RNO-G Collaboration)","title":"Multimessenger Potential of the Radio Neutrino Observatory in Greenland","comments":null,"journal-ref":null,"doi":"10.22323/1.444.1485","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Radio Neutrino Observatory in Greenland (RNO-G) is the only ultrahigh\nenergy (UHE, ${\\gtrsim}30$~PeV) neutrino monitor of the Northern sky and will\nsoon be the world's most sensitive high-uptime detector of UHE neutrinos.\nBecause of this, RNO-G represents an important piece of the multimessenger\nlandscape over the next decade. In this talk, we will highlight RNO-G's\nmultimessenger capabilities and its potential to provide key information in the\nsearch for the most extreme astrophysical accelerators. In particular, we will\nhighlight opportunities enabled by RNO-G's unique field-of-view, its potential\nto constrain the sources of UHE cosmic rays, and its complementarity with\nIceCube at lower energies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:49:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Muzio","Marco Stein","","for the RNO-G Collaboration"]]}
{"id":"2308.07225","submitter":"Xingyu Miao","authors":"Xingyu Miao, Yang Bai, Haoran Duan, Yawen Huang, Fan Wan, Xinxing Xu,\n  Yang Long, Yefeng Zheng","title":"DS-Depth: Dynamic and Static Depth Estimation via a Fusion Cost Volume","comments":null,"journal-ref":null,"doi":"10.1109/TCSVT.2023.3305776","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised monocular depth estimation methods typically rely on the\nreprojection error to capture geometric relationships between successive frames\nin static environments. However, this assumption does not hold in dynamic\nobjects in scenarios, leading to errors during the view synthesis stage, such\nas feature mismatch and occlusion, which can significantly reduce the accuracy\nof the generated depth maps. To address this problem, we propose a novel\ndynamic cost volume that exploits residual optical flow to describe moving\nobjects, improving incorrectly occluded regions in static cost volumes used in\nprevious work. Nevertheless, the dynamic cost volume inevitably generates extra\nocclusions and noise, thus we alleviate this by designing a fusion module that\nmakes static and dynamic cost volumes compensate for each other. In other\nwords, occlusion from the static volume is refined by the dynamic volume, and\nincorrect information from the dynamic volume is eliminated by the static\nvolume. Furthermore, we propose a pyramid distillation loss to reduce\nphotometric error inaccuracy at low resolutions and an adaptive photometric\nerror loss to alleviate the flow direction of the large gradient in the\nocclusion regions. We conducted extensive experiments on the KITTI and\nCityscapes datasets, and the results demonstrate that our model outperforms\npreviously published baselines for self-supervised monocular depth estimation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:57:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Miao","Xingyu",""],["Bai","Yang",""],["Duan","Haoran",""],["Huang","Yawen",""],["Wan","Fan",""],["Xu","Xinxing",""],["Long","Yang",""],["Zheng","Yefeng",""]]}
{"id":"2308.07226","submitter":"Jacob Linder","authors":"Sigrid Aunsmo and Jacob Linder","title":"Converting a triplet Cooper pair supercurrent into a spin-signal","comments":"16 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconductivity with spin-polarized Cooper pairs is known to emerge by\ncombining conventional spinless superconductors with materials that have\nspin-dependent interactions, such as magnetism and spin-orbit coupling. This\nenables a dissipationless and conserved flow of spin. However, actually\nutilizing the spin-polarization of such supercurrents have proven challenging.\nHere, we predict an experimental signature of current-carrying triplet Cooper\npairs in the form of an induced spin-signal. We show that a supercurrent\ncarried only by triplet Cooper pairs induces a non-local magnetization that is\ncontrolled by the polarization direction of the triplet Cooper pairs. This\nprovides a measurement protocol to directly use the spin-polarization of the\ntriplet Cooper pairs in supercurrents to transfer spin information in a\ndissipationless manner.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:01:30 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Aunsmo","Sigrid",""],["Linder","Jacob",""]]}
{"id":"2308.07227","submitter":"Bingyan Han","authors":"Erhan Bayraktar and Bingyan Han","title":"Existence of Markov equilibrium control in discrete time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For time-inconsistent stochastic controls in discrete time and finite\nhorizon, an open problem in Bj\\\"ork and Murgoci (Finance Stoch, 2014) is the\nexistence of an equilibrium control. A nonrandomized Borel measurable Markov\nequilibrium policy exists if the objective is inf-compact in every time step.\nWe provide a sufficient condition for the inf-compactness and thus existence,\nwith costs that are lower semicontinuous (l.s.c.) and bounded from below and\ntransition kernels that are continuous in controls under given states. The\ncontrol spaces need not to be compact.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:02:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bayraktar","Erhan",""],["Han","Bingyan",""]]}
{"id":"2308.07228","submitter":"Zhouxia Wang","authors":"Zhouxia Wang, Jiawei Zhang, Tianshui Chen, Wenping Wang, and Ping Luo","title":"RestoreFormer++: Towards Real-World Blind Face Restoration from\n  Undegraded Key-Value Pairs","comments":"Submitted to TPAMI. An extension of RestoreFormer","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Blind face restoration aims at recovering high-quality face images from those\nwith unknown degradations. Current algorithms mainly introduce priors to\ncomplement high-quality details and achieve impressive progress. However, most\nof these algorithms ignore abundant contextual information in the face and its\ninterplay with the priors, leading to sub-optimal performance. Moreover, they\npay less attention to the gap between the synthetic and real-world scenarios,\nlimiting the robustness and generalization to real-world applications. In this\nwork, we propose RestoreFormer++, which on the one hand introduces\nfully-spatial attention mechanisms to model the contextual information and the\ninterplay with the priors, and on the other hand, explores an extending\ndegrading model to help generate more realistic degraded face images to\nalleviate the synthetic-to-real-world gap. Compared with current algorithms,\nRestoreFormer++ has several crucial benefits. First, instead of using a\nmulti-head self-attention mechanism like the traditional visual transformer, we\nintroduce multi-head cross-attention over multi-scale features to fully explore\nspatial interactions between corrupted information and high-quality priors. In\nthis way, it can facilitate RestoreFormer++ to restore face images with higher\nrealness and fidelity. Second, in contrast to the recognition-oriented\ndictionary, we learn a reconstruction-oriented dictionary as priors, which\ncontains more diverse high-quality facial details and better accords with the\nrestoration target. Third, we introduce an extending degrading model that\ncontains more realistic degraded scenarios for training data synthesizing, and\nthus helps to enhance the robustness and generalization of our RestoreFormer++\nmodel. Extensive experiments show that RestoreFormer++ outperforms\nstate-of-the-art algorithms on both synthetic and real-world datasets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:04:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Zhouxia",""],["Zhang","Jiawei",""],["Chen","Tianshui",""],["Wang","Wenping",""],["Luo","Ping",""]]}
{"id":"2308.07229","submitter":"Jake Araujo-Simon","authors":"Jake Araujo-Simon","title":"Compositional nonlinear audio signal processing with Volterra series","comments":"This version differs from the previous one in that an assertion which\n  was made there - namely, that the Volterra series is a functor - but for\n  which no proof was provided, is here reframed as a conjecture","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD cs.SY eess.SP eess.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We develop a compositional theory of nonlinear audio signal processing based\non a categorification of the Volterra series. We begin by considering what it\nwould mean for the Volterra series to be functorial with respect to a base\ncategory whose objects are temperate distributions and whose morphisms are\ncertain linear transformations. This leads to formulae describing how the\noutcomes of nonlinear transformations are affected if their input signals are\nfirst linearly processed. We then consider how nonlinear audio systems change,\nand introduce as a model thereof a notion of morphism of Volterra series, which\nwe exhibit as a kind of lens map. We show how morphisms can be parameterized\nand used to generate indexed families of Volterra series, which are well-suited\nto model nonstationary or time-varying nonlinear phenomena. We then describe\nhow Volterra series and their morphisms organize into a category, which we call\nVolt. We exhibit the operations of sum, product, and series composition of\nVolterra series as monoidal products on Volt and identify, for each in turn,\nits corresponding universal property. We show, in particular, that the series\ncomposition of Volterra series is associative. We then bridge between our\nframework and a subject at the heart of audio signal processing: time-frequency\nanalysis. Specifically, we show that an equivalence between a certain class of\nsecond-order Volterra series and the bilinear time-frequency distributions\n(TFDs) can be extended to one between certain higher-order Volterra series and\nthe so-called polynomial TFDs. We end with prospects for future work, including\nthe incorporation of nonlinear system identification techniques and the\nextension of our theory to the settings of compositional graph and topological\naudio signal processing.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:05:38 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:01:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Araujo-Simon","Jake",""]]}
{"id":"2308.07230","submitter":"Alberto Elduque","authors":"Alberto Elduque and Mikhail Kochetov","title":"Almost fine gradings on algebras and classification of gradings up to\n  isomorphism","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of classifying gradings by groups on a\nfinite-dimensional algebra $A$ (with any number of multilinear operations) over\nan algebraically closed field. We introduce a class of gradings, which we call\nalmost fine, such that every $G$-grading on $A$ is obtained from an almost fine\ngrading on $A$ in an essentially unique way, which is not the case with fine\ngradings. For abelian groups, we give a method of obtaining all almost fine\ngradings if fine gradings are known. We apply these ideas to the case of\nsemisimple Lie algebras in characteristic $0$: to any abelian group grading\nwith nonzero identity component, we attach a (possibly nonreduced) root system\nand, in the simple case, construct an adapted grading by this root system.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:11:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Elduque","Alberto",""],["Kochetov","Mikhail",""]]}
{"id":"2308.07231","submitter":"Tao Liu","authors":"Tao Liu, Baohua Zhang","title":"Large-scale environment mapping and immersive human-robot interaction\n  for agricultural mobile robot teleoperation","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":"  Remote operation is a crucial solution to problems encountered in\nagricultural machinery operations. However, traditional video streaming control\nmethods fall short in overcoming the challenges of single perspective views and\nthe inability to obtain 3D information. In light of these issues, our research\nproposes a large-scale digital map reconstruction and immersive human-machine\nremote control framework for agricultural scenarios. In our methodology, a DJI\nunmanned aerial vehicle(UAV) was utilized for data collection, and a novel\nvideo segmentation approach based on feature points was introduced. To tackle\ntexture richness variability, an enhanced Structure from Motion (SfM) using\nsuperpixel segmentation was implemented. This method integrates the open\nMultiple View Geometry (openMVG) framework along with Local Features from\nTransformers (LoFTR). The enhanced SfM results in a point cloud map, which is\nfurther processed through Multi-View Stereo (MVS) to generate a complete map\nmodel. For control, a closed-loop system utilizing TCP for VR control and\npositioning of agricultural machinery was introduced. Our system offers a fully\nvisual-based immersive control method, where upon connection to the local area\nnetwork, operators can utilize VR for immersive remote control. The proposed\nmethod enhances both the robustness and convenience of the reconstruction\nprocess, thereby significantly facilitating operators in acquiring more\ncomprehensive on-site information and engaging in immersive remote control\noperations. The code is available at: https://github.com/LiuTao1126/Enhance-SFM\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:13:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Tao",""],["Zhang","Baohua",""]]}
{"id":"2308.07232","submitter":"Alex Deich","authors":"Alexander Deich, Nicol\\'as Yunes, Charles Gammie","title":"Lyapunov Exponents to Test General Relativity","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Photon rings are key targets for near-future space-based very-long baseline\ninterferometry missions. The ratio of flux measured between successive\nlight-rings is characterized by the Lyapunov exponents of the corresponding\nnearly-bound null geodesics. Therefore, understanding Lyapunov exponents in\nthis environment is of crucial importance to understanding black hole\nobservations in general, and in particular, they may offer a route for\nconstraining modified theories of gravity. While recent work has made\nsignificant progress in describing these geodesics for Kerr, a theory-agnostic\ndescription is complicated by the fact that Lyapunov exponents are\ntime-parameterization dependent, which necessitates care when comparing these\nexponents in two different theories. In this work, we present a robust\nnumerical framework for computing and comparing the Lyapunov exponents of null\ngeodesics in Kerr with those in an arbitrary modified theory. We then present\nresults obtained from calculating the Lyapunov exponents for null geodesics in\ntwo particular effective theories, scalar Gauss-Bonnet gravity and dynamical\nChern-Simons gravity. Using this framework, we determine accuracy lower-bounds\nrequired before a very-long baseline interferometry observation can constrain\nthese theories.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:16:03 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Deich","Alexander",""],["Yunes","Nicol\u00e1s",""],["Gammie","Charles",""]]}
{"id":"2308.07233","submitter":"Justin Veiner","authors":"Justin Veiner, Fady Alajaji, Bahman Gharesifard","title":"A Unifying Generator Loss Function for Generative Adversarial Networks","comments":"31 pages, 4 figures, 12 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A unifying $\\alpha$-parametrized generator loss function is introduced for a\ndual-objective generative adversarial network (GAN), which uses a canonical (or\nclassical) discriminator loss function such as the one in the original GAN\n(VanillaGAN) system. The generator loss function is based on a symmetric class\nprobability estimation type function, $\\mathcal{L}_\\alpha$, and the resulting\nGAN system is termed $\\mathcal{L}_\\alpha$-GAN. Under an optimal discriminator,\nit is shown that the generator's optimization problem consists of minimizing a\nJensen-$f_\\alpha$-divergence, a natural generalization of the Jensen-Shannon\ndivergence, where $f_\\alpha$ is a convex function expressed in terms of the\nloss function $\\mathcal{L}_\\alpha$. It is also demonstrated that this\n$\\mathcal{L}_\\alpha$-GAN problem recovers as special cases a number of GAN\nproblems in the literature, including VanillaGAN, Least Squares GAN (LSGAN),\nLeast $k$th order GAN (L$k$GAN) and the recently introduced\n$(\\alpha_D,\\alpha_G)$-GAN with $\\alpha_D=1$. Finally, experimental results are\nconducted on three datasets, MNIST, CIFAR-10, and Stacked MNIST to illustrate\nthe performance of various examples of the $\\mathcal{L}_\\alpha$-GAN system.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:16:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Veiner","Justin",""],["Alajaji","Fady",""],["Gharesifard","Bahman",""]]}
{"id":"2308.07234","submitter":"Chen Min","authors":"Chen Min, Dawei Zhao, Liang Xiao, Yiming Nie, Bin Dai","title":"UniWorld: Autonomous Driving Pre-training via World Models","comments":"8 pages, 5 figures. arXiv admin note: substantial text overlap with\n  arXiv:2305.18829","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we draw inspiration from Alberto Elfes' pioneering work in\n1989, where he introduced the concept of the occupancy grid as World Models for\nrobots. We imbue the robot with a spatial-temporal world model, termed\nUniWorld, to perceive its surroundings and predict the future behavior of other\nparticipants. UniWorld involves initially predicting 4D geometric occupancy as\nthe World Models for foundational stage and subsequently fine-tuning on\ndownstream tasks. UniWorld can estimate missing information concerning the\nworld state and predict plausible future states of the world. Besides,\nUniWorld's pre-training process is label-free, enabling the utilization of\nmassive amounts of image-LiDAR pairs to build a Foundational Model.The proposed\nunified pre-training framework demonstrates promising results in key tasks such\nas motion prediction, multi-camera 3D object detection, and surrounding\nsemantic scene completion. When compared to monocular pre-training methods on\nthe nuScenes dataset, UniWorld shows a significant improvement of about 1.5% in\nIoU for motion prediction, 2.0% in mAP and 2.0% in NDS for multi-camera 3D\nobject detection, as well as a 3% increase in mIoU for surrounding semantic\nscene completion. By adopting our unified pre-training method, a 25% reduction\nin 3D training annotation costs can be achieved, offering significant practical\nvalue for the implementation of real-world autonomous driving. Codes are\npublicly available at https://github.com/chaytonmin/UniWorld.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:17:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Min","Chen",""],["Zhao","Dawei",""],["Xiao","Liang",""],["Nie","Yiming",""],["Dai","Bin",""]]}
{"id":"2308.07235","submitter":"Jiongzhi Zheng","authors":"Jiongzhi Zheng and Mingming Jin and Kun He","title":"KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper\n  Bound for the Maximum k-Defective Clique Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum\nk-defective clique in a given graph, where a k-defective clique is a relaxation\nclique missing at most k edges. MDCP is NP-hard and finds many real-world\napplications in analyzing dense but not necessarily complete subgraphs. Exact\nalgorithms for MDCP mainly follow the Branch-and-bound (BnB) framework, whose\nperformance heavily depends on the quality of the upper bound on the\ncardinality of a maximum k-defective clique. The state-of-the-art BnB MDCP\nalgorithms calculate the upper bound quickly but conservatively as they ignore\nmany possible missing edges. In this paper, we propose a novel CoLoring-based\nUpper Bound (CLUB) that uses graph coloring techniques ingeniously to detect\nindependent sets so as to detect missing edges ignored by the previous methods.\nWe then develop a new BnB algorithm for MDCP, called KD-Club, using CLUB in\nboth the preprocessing stage for graph reduction and the BnB searching process\nfor branch pruning. Extensive experiments show that KD-Club significantly\noutperforms state-of-the-art BnB MDCP algorithms on the number of solved\ninstances within the cut-off time, having much smaller search tree and shorter\nsolving time on various benchmarks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:17:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zheng","Jiongzhi",""],["Jin","Mingming",""],["He","Kun",""]]}
{"id":"2308.07236","submitter":"Amit Chanda","authors":"Amit Chanda, Christian Holzmann, Noah Schulz, Aladin Ullrich, Manfred\n  Albrecht, Miela J. Gross, Caroline A. Ross, Dario. A. Arena, Manh-Huong Phan,\n  and Hariharan Srikanth","title":"Controlling Magnonic Spin Current through Magnetic Anisotropy and\n  Gilbert Damping","comments":"5 main text figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The magnon propagation length, (MPL) of a ferro/ferrimagnet (FM) is one of\nthe key factors that controls the generation and propagation of\nthermally-driven spin current in FM/heavy metal (HM) bilayer based\nspincaloritronic devices. Theory predicts that for the FM layer, MPL is\ninversely proportional to the Gilbert damping (alpha) and the square root of\nthe effective magnetic anisotropy constant (K_eff). However, direct\nexperimental evidence of this relationship is lacking. To experimentally\nconfirm this prediction, we employ a combination of longitudinal spin Seebeck\neffect (LSSE), transverse susceptibility, and ferromagnetic resonance\nexperiments to investigate the temperature evolution of MPL and establish its\ncorrelation with the effective magnetic anisotropy field, H_K^eff (proportional\nto K_eff) and alpha in Tm3Fe5O12 (TmIG)/Pt bilayers. We observe concurrent\ndrops in the LSSE voltage and MPL below 200 K in TmIG/Pt bilayers regardless of\nTmIG film thickness and substrate choice and attribute it to the noticeable\nincreases in H_K^eff and alpha that occur within the same temperature range.\nThis study not only highlights the ability to manipulate MPL by controlling\nH_K^eff and alpha in FM/HM based spincaloritronic nanodevices, but also shows\nthat the tuning of alpha is more effective than H_K^eff in controlling MPL and,\nhence, the spincaloritronic efficiency.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:17:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chanda","Amit",""],["Holzmann","Christian",""],["Schulz","Noah",""],["Ullrich","Aladin",""],["Albrecht","Manfred",""],["Gross","Miela J.",""],["Ross","Caroline A.",""],["Arena","Dario. A.",""],["Phan","Manh-Huong",""],["Srikanth","Hariharan",""]]}
{"id":"2308.07237","submitter":"Ryota Tomaru","authors":"Ryota Tomaru, Chris Done, and Hirokazu Odaka","title":"X-ray polarisation properties of thermal-radiative winds in binary\n  systems","comments":"7 pages, 7 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":"  New X-ray polarisation results are challenging our understanding of the\naccretion flow geometry in black hole binary systems. Even spectra dominated by\na standard disc can give unexpected results, such as the high inclination black\nhole binary 4U 1630- 472, where the observed X-ray polarisation is much higher\nthan predicted. This system also shows a strong, highly ionised wind,\nconsistent with thermal-radiative driving from the outer disc, leading to\nspeculation that scattering in the wind is responsible for the unexpectedly\nhigh polarisation degree from a standard optically thick disk. Here we show\nthat this is not the case. The optically thin(ish) wind polarises the scattered\nlight in a direction orthogonal to that predicted from a standard optically\nthick disc, reducing about 2% rather than enhancing the predicted polarisation\nof the total emission. This value is consistent with the polarisation\ndifference between the disc-dominated soft state, where absorption lines by the\nwind are clearly seen, and the steep power-law state, where no absorption lines\nare seen. If this difference is genuinely due to the presence or absence of\nwind, the total polarisation direction must be orthogonal to the disc plane\nrather than parallel as expected from optically thick material.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:20:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tomaru","Ryota",""],["Done","Chris",""],["Odaka","Hirokazu",""]]}
{"id":"2308.07238","submitter":"Alexander Wilson","authors":"Alexander Wilson","title":"Super Multiset RSK and a Mixed Multiset Partition Algebra","comments":"28 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Through dualities on representations on tensor powers and symmetric powers\nrespectively, the partition algebra and multiset partition algebra have been\nused to study long-standing questions in the representation theory of the\nsymmetric group. In this paper we extend this story to exterior powers,\nintroducing the mixed multiset partition algebra as well as a generalization of\nthe Robinson-Schensted-Knuth algorithm to two-row arrays of multisets with\nelements from two alphabets. From this algorithm, we obtain enumerative results\nwhich reflect representation-theoretic decompositions of this algebra.\nFurthermore, we use the generalized RSK algorithm to describe the decomposition\nof a polynomial ring in sets of commuting and anti-commuting variables as a\nmodule over both the general linear group and the symmetric group.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:20:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wilson","Alexander",""]]}
{"id":"2308.07239","submitter":"Tobias Ried","authors":"Tobias Ried, Carlos Rom\\'an","title":"Domain branching in micromagnetism: scaling law for the global and local\n  energies","comments":"46 pages, 4 figues; strengthened the main theorem and fixed several\n  typos","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 occurrence of domain branching in a class of $(d+1)$-dimensional\nsharp interface models featuring the competition between an interfacial energy\nand a non-local field energy. Our motivation comes from branching in uniaxial\nferromagnets corresponding to $d=2$, but our result also covers twinning in\nshape-memory alloys near an austenite-twinned-martensite interface\n(corresponding to $d=1$, thereby recovering a result of Conti [Comm. Pure Appl.\nMath. 53 (2000), 1448-1474. https://doi.org/cgkvm4 ]).\n  We prove that the energy density of a minimising configuration in a large\ncuboid domain $Q_{L,T}=[-L,L]^d\\times [0,T]$ scales like $T^{-\\frac{2}{3}}$\n(irrespective of the dimension $d$) if $L\\gg T^{\\frac{2}{3}}$. While this\nalready provides a lot of insight into the nature of minimisers, it does not\ncharacterise their behaviour close to the top and bottom boundaries of the\nsample, i.e. in the region where the branching is concentrated. More\nsignificantly, we show that minimisers exhibit a self-similar behaviour near\nthe top and bottom boundaries in a statistical sense through local energy\nbounds: for any minimiser in $Q_{L,T}$, the energy density in a small cuboid\n$Q_{\\ell,t}$ centred at the top or bottom boundaries of the sample, with side\nlengths $\\ell \\gg t^{\\frac{2}{3}}$, satisfies the same scaling law, that is, it\nis of order $t^{-\\frac{2}{3}}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:21:51 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:58:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ried","Tobias",""],["Rom\u00e1n","Carlos",""]]}
{"id":"2308.07240","submitter":"Son Nguyen","authors":"Son Nguyen","title":"The Cactus Group Property for Ordinal Sums of Disjoint Unions of Chains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the action of Bender-Knuth involutions on linear extensions of\nposets and identify LE-cactus posets, i.e. those for which the cactus relations\nhold. It was conjectured in \\cite{chiang2023bender} that d-complete posets are\nLE-cactus. Among the non-d-complete posets that are LE-cactus, one notable\nfamily is ordinal sums of antichains. In this paper, we characterize the\nLE-cactus posets in a more general family, namely ordinal sums of disjoint\nunions of chains.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:22:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nguyen","Son",""]]}
{"id":"2308.07241","submitter":"Byeonghwi Kim","authors":"Byeonghwi Kim, Jinyeon Kim, Yuyeong Kim, Cheolhong Min, Jonghyun Choi","title":"Context-Aware Planning and Environment-Aware Memory for Instruction\n  Following Embodied Agents","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accomplishing household tasks requires to plan step-by-step actions\nconsidering the consequences of previous actions. However, the state-of-the-art\nembodied agents often make mistakes in navigating the environment and\ninteracting with proper objects due to imperfect learning by imitating experts\nor algorithmic planners without such knowledge. To improve both visual\nnavigation and object interaction, we propose to consider the consequence of\ntaken actions by CAPEAM (Context-Aware Planning and Environment-Aware Memory)\nthat incorporates semantic context (e.g., appropriate objects to interact with)\nin a sequence of actions, and the changed spatial arrangement and states of\ninteracted objects (e.g., location that the object has been moved to) in\ninferring the subsequent actions. We empirically show that the agent with the\nproposed CAPEAM achieves state-of-the-art performance in various metrics using\na challenging interactive instruction following benchmark in both seen and\nunseen environments by large margins (up to +10.70% in unseen env.).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:23:21 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 15:42:11 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 02:20:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Byeonghwi",""],["Kim","Jinyeon",""],["Kim","Yuyeong",""],["Min","Cheolhong",""],["Choi","Jonghyun",""]]}
{"id":"2308.07242","submitter":"Anselme Ndikumana","authors":"Anselme Ndikumana, Kim Khoa Nguyen, and Mohamed Cheriet","title":"Age of Processing-Based Data Offloading for Autonomous Vehicles in\n  Multi-RATs Open RAN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Today, vehicles use smart sensors to collect data from the road environment.\nThis data is often processed onboard of the vehicles, using expensive hardware.\nSuch onboard processing increases the vehicle's cost, quickly drains its\nbattery, and exhausts its computing resources. Therefore, offloading tasks onto\nthe cloud is required. Still, data offloading is challenging due to low latency\nrequirements for safe and reliable vehicle driving decisions. Moreover, age of\nprocessing was not considered in prior research dealing with low-latency\noffloading for autonomous vehicles. This paper proposes an age of\nprocessing-based offloading approach for autonomous vehicles using unsupervised\nmachine learning, Multi-Radio Access Technologies (multi-RATs), and Edge\nComputing in Open Radio Access Network (O-RAN). We design a collaboration space\nof edge clouds to process data in proximity to autonomous vehicles. To reduce\nthe variation in offloading delay, we propose a new communication planning\napproach that enables the vehicle to optimally preselect the available RATs\nsuch as Wi-Fi, LTE, or 5G to offload tasks to edge clouds when its local\nresources are insufficient. We formulate an optimization problem for age-based\noffloading that minimizes elapsed time from generating tasks and receiving\ncomputation output. To handle this non-convex problem, we develop a surrogate\nproblem. Then, we use the Lagrangian method to transform the surrogate problem\nto unconstrained optimization problem and apply the dual decomposition method.\nThe simulation results show that our approach significantly minimizes the age\nof processing in data offloading with 90.34 % improvement over similar method.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:23:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ndikumana","Anselme",""],["Nguyen","Kim Khoa",""],["Cheriet","Mohamed",""]]}
{"id":"2308.07243","submitter":"Niloufar Alipour Talemi","authors":"Niloufar Alipour Talemi, Hossein Kashiani, Sahar Rahimi Malakshan,\n  Mohammad Saeed Ebrahimi Saadabadi, Nima Najafzadeh, Mohammad Akyash, Nasser\n  M. Nasrabadi","title":"AAFACE: Attribute-aware Attentional Network for Face Recognition","comments":"Accepted to $30^{th}$ IEEE International Conference on Image\n  Processing (ICIP 2023) as an oral presentation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a new multi-branch neural network that\nsimultaneously performs soft biometric (SB) prediction as an auxiliary modality\nand face recognition (FR) as the main task. Our proposed network named AAFace\nutilizes SB attributes to enhance the discriminative ability of FR\nrepresentation. To achieve this goal, we propose an attribute-aware attentional\nintegration (AAI) module to perform weighted integration of FR with SB feature\nmaps. Our proposed AAI module is not only fully context-aware but also capable\nof learning complex relationships between input features by means of the\nsequential multi-scale channel and spatial sub-modules. Experimental results\nverify the superiority of our proposed network compared with the\nstate-of-the-art (SoTA) SB prediction and FR methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:24:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Talemi","Niloufar Alipour",""],["Kashiani","Hossein",""],["Malakshan","Sahar Rahimi",""],["Saadabadi","Mohammad Saeed Ebrahimi",""],["Najafzadeh","Nima",""],["Akyash","Mohammad",""],["Nasrabadi","Nasser M.",""]]}
{"id":"2308.07244","submitter":"Chia Wei Hsu","authors":"Zeyu Wang, Yiwen Zhang, and Chia Wei Hsu","title":"Numerical experiments of tomographic optical imaging inside scattering\n  media","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical imaging deep inside scattering media is an outstanding problem across\nmany disciplines. Numerical modeling can accelerate progress by providing the\nground truth, the flexibility to tailor the system and the imaging scheme, and\nthe ease of testing new methods. Here we realize quantitative modeling of five\nscattering-based imaging methods through multi-source simulations of the\ninhomogeneous wave equation in a two-dimensional scattering medium roughly 800\nwavelengths by 550 wavelengths in size. These large-scale simulations are\nenabled by a new \"augmented partial factorization\" numerical approach. We\nanalyze the recently proposed scattering matrix tomography method, reflectance\nconfocal microscopy, optical coherence tomography, optical coherence\nmicroscopy, and interferometric synthetic aperture microscopy for imaging\nembedded nanoparticle targets. Having access to the ground-truth configuration,\nwe can rigorously assess the performance and the limit of these methods while\nidentifying artifacts that are otherwise impossible to detect. Such numerical\nexperiments are cheap, convenient, versatile, accurate, and provide an ideal\ntestbed for developing new imaging methods and algorithms.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:24:53 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 04:48:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Zeyu",""],["Zhang","Yiwen",""],["Hsu","Chia Wei",""]]}
{"id":"2308.07245","submitter":"Subham De","authors":"Subham De","title":"On the proof of the Prime Number Theorem using Order Estimates for the\n  Chebyshev Theta Function","comments":"14 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we shall study the stellar work of Norwegian mathematician\nSelberg and Hungarian mathematician Erd\\H{o}s in providing an Elementary proof\nof the well-known \\textit{Prime Number Theorem}. In addition to introducing\nourselves to the notion of \\textit{Arithmetic Functions}, we shall primarily\nfocus our research on obtaining suitable estimates for the \\textit{Chebyshev\nTheta Function} $\\vartheta(x)$. Furthermore, we'll try to infer about the\nasymptotic properties of another function $\\rho(x)$, which shall be needed\nlater on in establishing an equivalent statement of our main result. All the\nmathematical terminologies pertinent to the proof have been discussed in the\nearlier sections of the text.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:27:47 GMT"}],"update_date":"2023-08-15","authors_parsed":[["De","Subham",""]]}
{"id":"2308.07246","submitter":"Israel Donato Ridgley","authors":"Israel L. Donato Ridgley, Randy A. Freeman, Kevin M. Lynch","title":"Self-Healing First-Order Distributed Optimization with Packet Loss","comments":"arXiv admin note: substantial text overlap with arXiv:2104.01959","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.MA cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We describe SH-SVL, a parameterized family of first-order distributed\noptimization algorithms that enable a network of agents to collaboratively\ncalculate a decision variable that minimizes the sum of cost functions at each\nagent. These algorithms are self-healing in that their convergence to the\ncorrect optimizer can be guaranteed even if they are initialized randomly,\nagents join or leave the network, or local cost functions change. We also\npresent simulation evidence that our algorithms are self-healing in the case of\ndropped communication packets. Our algorithms are the first single-Laplacian\nmethods for distributed convex optimization to exhibit all of these\ncharacteristics. We achieve self-healing by sacrificing internal stability, a\nfundamental trade-off for single-Laplacian methods.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:30:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ridgley","Israel L. Donato",""],["Freeman","Randy A.",""],["Lynch","Kevin M.",""]]}
{"id":"2308.07247","submitter":"Cl\\'ement Poiret","authors":"Clement Poiret, Antoine Grigis, Justin Thomas, Marion Noulhiane","title":"Can we Agree? On the Rash\\=omon Effect and the Reliability of Post-Hoc\n  Explainable AI","comments":"13 pages, 6 figures and 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Rash\\=omon effect poses challenges for deriving reliable knowledge from\nmachine learning models. This study examined the influence of sample size on\nexplanations from models in a Rash\\=omon set using SHAP. Experiments on 5\npublic datasets showed that explanations gradually converged as the sample size\nincreased. Explanations from <128 samples exhibited high variability, limiting\nreliable knowledge extraction. However, agreement between models improved with\nmore data, allowing for consensus. Bagging ensembles often had higher\nagreement. The results provide guidance on sufficient data to trust\nexplanations. Variability at low samples suggests that conclusions may be\nunreliable without validation. Further work is needed with more model types,\ndata domains, and explanation methods. Testing convergence in neural networks\nand with model-specific explanation methods would be impactful. The approaches\nexplored here point towards principled techniques for eliciting knowledge from\nambiguous models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:32:24 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Poiret","Clement",""],["Grigis","Antoine",""],["Thomas","Justin",""],["Noulhiane","Marion",""]]}
{"id":"2308.07248","submitter":"Yongdong Ouyang","authors":"Yongdong Ouyang, Monica Taljaard, Andrew B Forbes and Fan Li","title":"Maintaining the validity of inference from linear mixed models in\n  stepped-wedge cluster randomized trials under misspecified random-effects\n  structures","comments":"Correct figure legend and table Typos","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linear mixed models are commonly used in analyzing stepped-wedge cluster\nrandomized trials (SW-CRTs). A key consideration for analyzing a SW-CRT is\naccounting for the potentially complex correlation structure, which can be\nachieved by specifying a random effects structure. Common random effects\nstructures for a SW-CRT include random intercept, random cluster-by-period, and\ndiscrete-time decay. Recently, more complex structures, such as the random\nintervention structure, have been proposed. In practice, specifying appropriate\nrandom effects can be challenging. Robust variance estimators (RVE) may be\napplied to linear mixed models to provide consistent estimators of standard\nerrors of fixed effect parameters in the presence of random-effects\nmisspecification. However, there has been no empirical investigation of RVE for\nSW-CRT. In this paper, we first review five RVEs (both standard and\nsmall-sample bias-corrected RVEs) that are available for linear mixed models.\nWe then describe a comprehensive simulation study to examine the performance of\nthese RVEs for SW-CRTs with a continuous outcome under different data\ngenerators. For each data generator, we investigate whether the use of a RVE\nwith either the random intercept model or the random cluster-by-period model is\nsufficient to provide valid statistical inference for fixed effect parameters,\nwhen these working models are subject to misspecification. Our results indicate\nthat the random intercept and random cluster-by-period models with RVEs\nperformed similarly. The CR3 RVE estimator, coupled with the number of clusters\nminus two degrees of freedom correction, consistently gave the best coverage\nresults, but could be slightly anti-conservative when the number of clusters\nwas below 16. We summarize the implications of our results for linear mixed\nmodel analysis of SW-CRTs in practice.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:32:38 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 15:04:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ouyang","Yongdong",""],["Taljaard","Monica",""],["Forbes","Andrew B",""],["Li","Fan",""]]}
{"id":"2308.07249","submitter":"J\\\"orn Venderbos","authors":"Zhuoliang Ni, Daniil S. Antonenko, W. Joe Meese, Qi Tian, Nan Huang,\n  Amanda V. Haglund, Matthew Cothrine, David G. Mandrus, Rafael M. Fernandes,\n  J\\\"orn W. F. Venderbos, Liang Wu","title":"Signatures of Z$_3$ Vestigial Potts-nematic order in van der Waals\n  antiferromagnets","comments":"6 pages, 4 figures + supplementary material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Layered van der Waals magnets have attracted much recent attention as a\npromising and versatile platform for exploring intrinsic two-dimensional\nmagnetism. Within this broader class, the transition metal phosphorous\ntrichalcogenides $M$P$X_3$ stand out as particularly interesting, as they\nprovide a realization of honeycomb lattice magnetism and are known to display a\nvariety of magnetic ordering phenomena as well as superconductivity under\npressure. One example, found in a number of different materials, is\ncommensurate single-$Q$ zigzag antiferromagnetic order, which spontaneously\nbreaks the spatial threefold $(C_3)$ rotation symmetry of the honeycomb\nlattice. The breaking of multiple distinct symmetries in the magnetic phase\nsuggests the possibility of a sequence of distinct transitions as a function of\ntemperature, and a resulting intermediate $\\mathbb{Z}_3$-nematic phase which\nexists as a paramagnetic vestige of zigzag magnetic order -- a scenario known\nas vestigial ordering. Here, we report the observation of key signatures of\nvestigial Potts-nematic order in rhombohedral FePSe$_3$. By performing linear\ndichroism imaging measurements -- an ideal probe of rotational symmetry\nbreaking -- we find that the $C_3$ symmetry is already broken above the N\\'eel\ntemperature. We show that these observations are explained by a general\nGinzburg-Landau model of vestigial nematic order driven by magnetic\nfluctuations and coupled to residual strain. An analysis of the domain\nstructure as temperature is lowered and a comparison with zigzag-ordered\nmonoclinic FePS$_3$ reveals a broader applicability of the Ginzburg-Landau\nmodel in the presence of external strain, and firmly establishes the $M$P$X_3$\nmagnets as a new experimental venue for studying the interplay between\nPotts-nematicity, magnetism and superconductivity.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:32:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ni","Zhuoliang",""],["Antonenko","Daniil S.",""],["Meese","W. Joe",""],["Tian","Qi",""],["Huang","Nan",""],["Haglund","Amanda V.",""],["Cothrine","Matthew",""],["Mandrus","David G.",""],["Fernandes","Rafael M.",""],["Venderbos","J\u00f6rn W. F.",""],["Wu","Liang",""]]}
{"id":"2308.07250","submitter":"Kevin Fauvel","authors":"Kevin Fauvel, \\'Elisa Fromont, V\\'eronique Masson, Philippe Faverdin\n  and Alexandre Termier","title":"LCE: An Augmented Combination of Bagging and Boosting in Python","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  lcensemble is a high-performing, scalable and user-friendly Python package\nfor the general tasks of classification and regression. The package implements\nLocal Cascade Ensemble (LCE), a machine learning method that further enhances\nthe prediction performance of the current state-of-the-art methods Random\nForest and XGBoost. LCE combines their strengths and adopts a complementary\ndiversification approach to obtain a better generalizing predictor. The package\nis compatible with scikit-learn, therefore it can interact with scikit-learn\npipelines and model selection tools. It is distributed under the Apache 2.0\nlicense, and its source code is available at\nhttps://github.com/LocalCascadeEnsemble/LCE.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:34:47 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 19:08:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fauvel","Kevin",""],["Fromont","\u00c9lisa",""],["Masson","V\u00e9ronique",""],["Faverdin","Philippe",""],["Termier","Alexandre",""]]}
{"id":"2308.07251","submitter":"Liam Chalcroft","authors":"Liam Chalcroft, Ruben Louren\\c{c}o Pereira, Mikael Brudfors, Andrew S.\n  Kayser, Mark D'Esposito, Cathy J. Price, Ioannis Pappas, John Ashburner","title":"Large-kernel Attention for Efficient and Robust Brain Lesion\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision transformers are effective deep learning models for vision tasks,\nincluding medical image segmentation. However, they lack efficiency and\ntranslational invariance, unlike convolutional neural networks (CNNs). To model\nlong-range interactions in 3D brain lesion segmentation, we propose an\nall-convolutional transformer block variant of the U-Net architecture. We\ndemonstrate that our model provides the greatest compromise in three factors:\nperformance competitive with the state-of-the-art; parameter efficiency of a\nCNN; and the favourable inductive biases of a transformer. Our public\nimplementation is available at https://github.com/liamchalcroft/MDUNet .\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:38:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Chalcroft","Liam",""],["Pereira","Ruben Louren\u00e7o",""],["Brudfors","Mikael",""],["Kayser","Andrew S.",""],["D'Esposito","Mark",""],["Price","Cathy J.",""],["Pappas","Ioannis",""],["Ashburner","John",""]]}
{"id":"2308.07252","submitter":"Madeline Locus Dawsey","authors":"Katie Anders, Madeline Locus Dawsey, Bruce Reznick, and Simone\n  Sisneros-Thiry","title":"Representations of integers as quotients of sums of distinct powers of\n  three","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Which integers can be written as a quotient of sums of distinct powers of\nthree? We outline our first steps toward an answer to this question, beginning\nwith a necessary and almost sufficient condition. Then we discuss an algorithm\nthat indicates whether it is possible to represent a given integer as a\nquotient of sums of distinct powers of three. When the given integer is\nrepresentable, this same algorithm generates all possible representations. We\ndevelop a categorization of representations based on their connections to\n$0,1$-polynomials and give a complete description of the types of\nrepresentations for all integers up to 364. Finally, we discuss in detail the\nrepresentations of 7, 22, 34, 64, and 100, as well as some infinite families of\nintegers.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:38:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Anders","Katie",""],["Dawsey","Madeline Locus",""],["Reznick","Bruce",""],["Sisneros-Thiry","Simone",""]]}
{"id":"2308.07253","submitter":"Melissa Smith","authors":"Melissa J. Smith, Leslie A. McClure, D. Leann Long","title":"Path-specific causal decomposition analysis with multiple correlated\n  mediator variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A causal decomposition analysis allows researchers to determine whether the\ndifference in a health outcome between two groups can be attributed to a\ndifference in each group's distribution of one or more modifiable mediator\nvariables. With this knowledge, researchers and policymakers can focus on\ndesigning interventions that target these mediator variables. Existing methods\nfor causal decomposition analysis either focus on one mediator variable or\nassume that each mediator variable is conditionally independent given the group\nlabel and the mediator-outcome confounders. In this paper, we propose a\nflexible causal decomposition analysis method that can accommodate multiple\ncorrelated and interacting mediator variables, which are frequently seen in\nstudies of health behaviors and studies of environmental pollutants. We extend\na Monte Carlo-based causal decomposition analysis method to this setting by\nusing a multivariate mediator model that can accommodate any combination of\nbinary and continuous mediator variables. Furthermore, we state the causal\nassumptions needed to identify both joint and path-specific decomposition\neffects through each mediator variable. To illustrate the reduction in bias and\nconfidence interval width of the decomposition effects under our proposed\nmethod, we perform a simulation study. We also apply our approach to examine\nwhether differences in smoking status and dietary inflammation score explain\nany of the Black-White differences in incident diabetes using data from a\nnational cohort study.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:39:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Smith","Melissa J.",""],["McClure","Leslie A.",""],["Long","D. Leann",""]]}
{"id":"2308.07254","submitter":"Peng Ran","authors":"Peng Ran, Qingrui Yao, Juan Hui, Yirong Su, Lurong Yang, Cuifang\n  Kuang, Xu Liu, Yang (Michael) Yang","title":"Multi-energy X-ray linear-array detector enabled by the side-illuminated\n  metal halide scintillator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional scintillator-based X-ray imaging typically captures the full\nspectral of X-ray photons without distinguishing their energy. However, the\nabsence of X-ray spectral information often results in insufficient image\ncontrast, particularly for substances possessing similar atomic numbers and\ndensities. In this study, we present an innovative multi-energy X-ray\nlinear-array detector that leverages side-illuminated X-ray scintillation using\nemerging metal halide Cs3Cu2I5. The negligible self-absorption characteristic\nnot only improves the scintillation output but is also beneficial for improving\nthe energy resolution for the side-illuminated scintillation scenarios. By\nexploiting Beer's law, which governs the absorption of X-ray photons with\ndifferent energies, the incident X-ray spectral can be reconstructed by\nanalyzing the distribution of scintillation intensity when the scintillator is\nilluminated from the side. The relative error between the reconstructed and\nmeasured X-ray spectral was less than 5.63 %. Our method offers an additional\nenergy-resolving capability for X-ray linear-array detectors commonly used in\ncomputed tomography (CT) imaging setups, surpassing the capabilities of\nconventional energy-integration approaches, all without requiring extra\nhardware components. A proof-of-concept multi-energy CT imaging system\nfeaturing eight energy channels was successfully implemented. This study\npresents a simple and efficient strategy for achieving multi-energy X-ray\ndetection and CT imaging based on emerging metal halides.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:40:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ran","Peng","","Michael"],["Yao","Qingrui","","Michael"],["Hui","Juan","","Michael"],["Su","Yirong","","Michael"],["Yang","Lurong","","Michael"],["Kuang","Cuifang","","Michael"],["Liu","Xu","","Michael"],["Yang","","","Michael"],["Yang","","","Michael"]]}
{"id":"2308.07255","submitter":"Ryo Araki","authors":"Ryo Araki and Wouter J. T. Bos and Susumu Goto","title":"Space-local Navier--Stokes turbulence","comments":"22 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the physical-space locality of interactions in\nthree-dimensional incompressible turbulent flow. To that, we modify the\nnonlinear terms of the vorticity equation such that the vorticity field is\nadvected and stretched by the locally induced velocity. This space-local\nvelocity field is defined by the truncated Biot--Savart law, where only the\nneighboring vorticity field in a sphere of radius $R$ is integrated. We conduct\ndirect numerical simulations of the space-local system to investigate its\nstatistics in the inertial range. We observe a standard $E(k) \\propto k^{-5/3}$\nscaling of the energy spectrum associated with an energy cascade for scales\nsmaller than the space-local domain size $k \\gg R^{-1}$. This result is\nconsistent with the assumption Kolmogorov's 1941 paper made for the\nspace-locality of the nonlinear interactions. The enstrophy production is\nsuppressed for larger scales $k \\ll R^{-1}$, and for these scales, the system\nexhibits a scaling consistent with a conservative enstrophy cascade.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:41:15 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:59:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Araki","Ryo",""],["Bos","Wouter J. T.",""],["Goto","Susumu",""]]}
{"id":"2308.07256","submitter":"Oliver Pechenik","authors":"Chris Fraser, Rebecca Patrias, Oliver Pechenik, Jessica Striker","title":"Web invariants for flamingo Specht modules","comments":"32 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Webs yield an especially important realization of certain Specht modules,\nirreducible representations of symmetric groups, as they provide a pictorial\nbasis with a convenient diagrammatic calculus. In recent work, the last three\nauthors associated polynomials to noncrossing partitions without singleton\nblocks, so that the corresponding polynomials form a web basis of the pennant\nSpecht module $S^{(d,d,1^{n-2d})}$. These polynomials were interpreted as\nglobal sections of a line bundle on a 2-step partial flag variety.\n  Here, we both simplify and extend this construction. On the one hand, we show\nthat these polynomials can alternatively be situated in the homogeneous\ncoordinate ring of a Grassmannian, instead of a 2-step partial flag variety,\nand can be realized as tensor invariants of classical (but highly nonplanar)\ntensor diagrams. On the other hand, we extend these ideas from the pennant\nSpecht module $S^{(d,d,1^{n-2d})}$ to more general flamingo Specht modules\n$S^{(d^r,1^{n-rd})}$. In the hook case $r=1$, we obtain a spanning set that can\nbe restricted to a basis in various ways. In the case $r>2$, we obtain a basis\nof a well-behaved subspace of $S^{(d^r,1^{n-rd})}$, but not of the entire\nmodule.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:41:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fraser","Chris",""],["Patrias","Rebecca",""],["Pechenik","Oliver",""],["Striker","Jessica",""]]}
{"id":"2308.07257","submitter":"Shao-Jiang Wang","authors":"Song He, Li Li, Sai Wang, Shao-Jiang Wang","title":"Constraints on holographic QCD phase transitions from PTA observations","comments":"9 pages, 4 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":"  The underlying physics of QCD phase transition in the early Universe remains\nlargely unknown due to its strong-coupling nature during the quark-gluon\nplasma/hadron gas transition, yet a holographic model has been proposed to\nquantitatively fit the lattice QCD data while with its duration of the\nfirst-order phase transition (FoPT) left undetermined. At specific baryon\nchemical potential, the first-order QCD phase transition agrees with the\nobservational constraint of baryon asymmetry. It therefore provides a scenario\nfor phase transition gravitational waves (GWs) within the Standard Model of\nparticle physics. If these background GWs could contribute dominantly to the\nrecently claimed common-spectrum red noise from pulsar timing array (PTA)\nobservations, the duration of this FoPT can be well constrained but disfavored\nby the constraints from curvature perturbations. However, the associated\nprimordial black holes are still allowed by current observations. Therefore,\neither the QCD phase transition is not described by our holographic model or\nthe other GW sources must be presented to dominate over the GWs from this FoPT.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:41:35 GMT"}],"update_date":"2023-08-15","authors_parsed":[["He","Song",""],["Li","Li",""],["Wang","Sai",""],["Wang","Shao-Jiang",""]]}
{"id":"2308.07258","submitter":"Anselme Ndikumana","authors":"Anselme Ndikumana, Kim Khoa Nguyen, and Mohamed Cheriet","title":"Federated Learning Assisted Deep Q-Learning for Joint Task Offloading\n  and Fronthaul Segment Routing in Open RAN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Offloading computation-intensive tasks to edge clouds has become an efficient\nway to support resource constraint edge devices. However, task offloading delay\nis an issue largely due to the networks with limited capacities between edge\nclouds and edge devices. In this paper, we consider task offloading in Open\nRadio Access Network (O-RAN), which is a new 5G RAN architecture allowing Open\nCentral Unit (O-CU) to be co-located with Open Distributed Unit (DU) at the\nedge cloud for low-latency services. O-RAN relies on fronthaul network to\nconnect O-RAN Radio Units (O-RUs) and edge clouds that host O-DUs.\nConsequently, tasks are offloaded onto the edge clouds via wireless and\nfronthaul networks \\cite{10045045}, which requires routing. Since edge clouds\ndo not have the same available computation resources and tasks' computation\ndeadlines are different, we need a task distribution approach to multiple edge\nclouds. Prior work has never addressed this joint problem of task offloading,\nfronthaul routing, and edge computing. To this end, using segment routing,\nO-RAN intelligent controllers, and multiple edge clouds, we formulate an\noptimization problem to minimize offloading, fronthaul routing, and computation\ndelays in O-RAN. To determine the solution of this NP-hard problem, we use Deep\nQ-Learning assisted by federated learning with a reward function that reduces\nthe Cost of Delay (CoD). The simulation results show that our solution\nmaximizes the reward in minimizing CoD.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:43:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ndikumana","Anselme",""],["Nguyen","Kim Khoa",""],["Cheriet","Mohamed",""]]}
{"id":"2308.07259","submitter":"Alejandro Saenz","authors":"Hakon Volkmann (1), Raamamurthy Sathyanarayanan (1), Alejandro Saenz\n  (1), Karl Jansen (2), and Stefan K\\\"uhn (2) ((1) AG Moderne Optik, Institut\n  f\\\"ur Physik, Humboldt-Universit\\\"at zu Berlin, Germany, (2) CQTA, DESY\n  Zeuthen, Germany, and Computation-Based Science and Technology Research\n  Center, The Cyprus Institute, Nicosia, Cyprus)","title":"A qubit-ADAPT Implementation for H$_2$ Molecules using an Explicitly\n  Correlated Basis","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 recent advances in the development of devices capable of performing\nquantum computations, a growing interest in finding near-term applications has\nemerged in many areas of science. In the era of non-fault tolerant quantum\ndevices, algorithms that only require comparably short circuits accompanied by\nhigh repetition rates are considered to be a promising approach for assisting\nclassical machines with finding solution on computationally hard problems. The\nADAPT approach previously introduced in Nat. Commun. 10, 3007 (2019) extends\nthe class of variational quantum eigensolver (VQE) algorithms with dynamically\ngrowing ans\\\"atze in order to find approximations to ground and excited state\nenergies of molecules. In this work, the ADAPT algorithm has been combined with\na first-quantized formulation for the hydrogen molecule in the Born-Oppenheimer\napproximation, employing the explicitly correlated basis functions introduced\nin J. Chem. Phys. 43, 2429 (1965). By the virtue of their explicit electronic\ncorrelation properties, it is shown in classically performed simulations that\nrelatively short circuits yield chemical accuracy ($< 1.6$ mHa) for ground and\nexcited state potential curves that can compete with second quantized\napproaches such as Unitary Coupled Cluster.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:44:29 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Volkmann","Hakon",""],["Sathyanarayanan","Raamamurthy",""],["Saenz","Alejandro",""],["Jansen","Karl",""],["K\u00fchn","Stefan",""]]}
{"id":"2308.07260","submitter":"Armin Nabizadeh","authors":"Armin Nabizadeh, Erik Zackrisson, Fabio Pacucci, Peter W. Maksym,\n  Weihui Li, Francesca Civano, Seth H. Cohen, Jordan C. J. D'Silva, Anton M.\n  Koekemoer, Jake Summers, Rogier A. Windhorst, Nathan Adams, Christopher J.\n  Conselice, Dan Coe, Simon P. Driver, Brenda Frye, Norman A. Grogin, Rolf A.\n  Jansen, Madeline A. Marshall, Mario Nonino, Nor Pirzkal, Aaron Robotham,\n  Michael J. Rutkowski, Russell E. Ryan, Jr., Scott Tompkins, Christopher N. A.\n  Willmer, Haojing Yan, Jose M. Diego, Cheng Cheng, Steven L. Finkelstein, S.\n  P. Willner, Adi Zitrin, Rachana Bhatawdekar, and Hansung B. Gim","title":"A search for high-redshift direct collapse black hole candidates in the\n  PEARLS north ecliptic pole field","comments":"10 pages, 6 figures, 1 table, submitted to A&A","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":"  Direct-collapse black holes (DCBHs) of mass $\\sim 10^4$-$10^5 M_\\odot$ that\nform in HI-cooling halos in the early Universe are promising progenitors of the\n$\\gtrsim 10^9 M_\\odot$ supermassive black holes that fuel the observed $z\n\\gtrsim 7$ quasars. Efficient accretion of the surrounding gas onto such DCBH\nseeds may render them sufficiently bright for detection with the James Webb\nSpace Telescope (JWST) up to $z\\approx 15$. Additionally, the very steep and\nred spectral slope predicted across the $\\approx 1$-5 $\\mu$m wavelength range\nof the JWST/NIRSpec instrument during their initial growth phase should make\nthem photometrically identifiable up to very high redshifts. Here, we present a\nsearch for such DCBH candidates across the 34 arcmin$^{2}$ in the first two\nspokes of the JWST cycle-1 \"Prime Extragalactic Areas for Reionization and\nLensing Science\" (PEARLS) survey of the North Ecliptic Pole Time Domain Field\n(NEP), covering 8 NIRCam filters down to a maximum depth of $\\sim$ 29 AB mag.\nWe identify three objects with spectral energy distributions consistent with\nthe Pacucci et al. (2016) DCBH models. However, we also note that even with\ndata in 8 NIRCam filters, objects of this type remain degenerate with dusty\ngalaxies and obscured active galactic nuclei over a wide range of redshifts.\nFollow-up spectroscopy would be required to pin down the nature of these\nobjects, and two of our DCBH candidates are sufficiently bright to make this\npractical. Based on our sample of DCBH candidates and assumptions on the\ntypical duration of the DCBH steep-slope state, we set a conservative upper\nlimit of $\\approx 7\\times 10^{-4}$ comoving Mpc$^{-3}$ (cMpc$^{-3}$) on the\ncomoving density of host halos capable of hosting DCBHs with spectral energy\ndistributions similar to the Pacucci et al. (2016) models at $z\\approx 6$-13.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:46:06 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nabizadeh","Armin",""],["Zackrisson","Erik",""],["Pacucci","Fabio",""],["Maksym","Peter W.",""],["Li","Weihui",""],["Civano","Francesca",""],["Cohen","Seth H.",""],["D'Silva","Jordan C. J.",""],["Koekemoer","Anton M.",""],["Summers","Jake",""],["Windhorst","Rogier A.",""],["Adams","Nathan",""],["Conselice","Christopher J.",""],["Coe","Dan",""],["Driver","Simon P.",""],["Frye","Brenda",""],["Grogin","Norman A.",""],["Jansen","Rolf A.",""],["Marshall","Madeline A.",""],["Nonino","Mario",""],["Pirzkal","Nor",""],["Robotham","Aaron",""],["Rutkowski","Michael J.",""],["Ryan,","Russell E.","Jr."],["Tompkins","Scott",""],["Willmer","Christopher N. A.",""],["Yan","Haojing",""],["Diego","Jose M.",""],["Cheng","Cheng",""],["Finkelstein","Steven L.",""],["Willner","S. P.",""],["Zitrin","Adi",""],["Bhatawdekar","Rachana",""],["Gim","Hansung B.",""]]}
{"id":"2308.07261","submitter":"Niklas Witt","authors":"Niklas Witt, Liang Si, Jan M. Tomczak, Karsten Held, Tim Wehling","title":"No superconductivity in Pb$_9$Cu$_1$(PO$_4$)$_6$O found in orbital and\n  spin fluctuation exchange calculations","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding a material that turns superconducting under ambient conditions has\nbeen the goal of over a century of research, and recently\nPb$_{10-x}$Cu$_x$(PO$_4$)$_6$O aka LK-99 has been put forward as a possible\ncontestant. In this work, we study the possibility of electronically driven\nsuperconductivity in LK-99 also allowing for electron or hole doping. We use an\n$\\textit{ab initio}$ derived two-band model of the Cu $e_g$ orbitals for which\nwe determine interaction values from the constrained random phase approximation\n(cRPA). For this two-band model we perform calculations in the fluctuation\nexchange (FLEX) approach to assess the strength of orbital and spin\nfluctuations. We scan over a broad range of parameters and enforce no magnetic\nor orbital symmetry breaking. Even under optimized conditions for\nsuperconductivity, spin and orbital fluctuations turn out to be too weak for\nsuperconductivity anywhere near to room-temperature. We contrast this finding\nto non-self-consistent RPA, where it is possible to induce spin-singlet\n$d$-wave superconductivity at $T_{\\mathrm{c}}\\geq300$ K if the system is put\nclose enough to a magnetic instability.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:46:26 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Witt","Niklas",""],["Si","Liang",""],["Tomczak","Jan M.",""],["Held","Karsten",""],["Wehling","Tim",""]]}
{"id":"2308.07262","submitter":"Michael Grace","authors":"Michael R Grace, Saikat Guha, Zachary Dutton","title":"Detecting changes to sub-diffraction objects with quantum-optimal speed\n  and accuracy","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detecting if and when objects change is difficult in passive sub-diffraction\nimaging of dynamic scenes. We consider the best possible tradeoff between\nresponsivity and accuracy for detecting a change from one arbitrary object\nmodel to another in the context of sub-diffraction incoherent imaging. We\nanalytically evaluate the best possible average latency, for a fixed false\nalarm rate, optimizing over all physically allowed measurements of the optical\nfield collected by a finite 2D aperture. We find that direct focal-plane\ndetection of the incident optical intensity achieves sub-optimal detection\nlatencies compared to the best possible average latency, but that a three-mode\nspatial-mode demultiplexing measurement in concert with on-line statistical\nprocessing using the well-known CUSUM algorithm achieves this quantum limit for\nsub-diffraction objects. We verify these results via Monte Carlo simulation of\nthe change detection procedure and quantify a growing gap between the\nconventional and quantum-optimal receivers as the objects are more and more\ndiffraction-limited.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:48:18 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 14:24:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Grace","Michael R",""],["Guha","Saikat",""],["Dutton","Zachary",""]]}
{"id":"2308.07263","submitter":"Haoran Di","authors":"Haoran Di and Haihao Shi","title":"Can Planet 9 be an Axion Star?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The anomalous orbits of Trans-Neptunian Objects (TNOs) can be explained by\nthe Planet 9 hypothesis. We propose that the Planet 9 can be an axion star.\nAxion stars are gravitational bound clusters condensed by QCD axions or\naxion-like particles (ALPs), which we call axions for brevity. We find that the\nprobability of capturing an axion star is the same order of magnitude as the\nprobability of capturing an free floating planet (FFP), and even higher for the\ncase of axion star, with axion star mass $5M_\\oplus$ and\n$\\Omega_{\\rm{AS}}/\\Omega_{\\rm{DM}}\\simeq 1/10$. Although axion star can emit\nmonochromatic signals through two-photon decay, we find that the frequency of\ndecay photon is either not within the frequency range of the radio telescope,\nor the decay signal is too weak to be detected. Therefore, if Planet 9 is\ncomposed by an axion star, it will be difficult to distinguish it from an\nisolated primordial black hole by spontaneous decay of axion.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:48:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Di","Haoran",""],["Shi","Haihao",""]]}
{"id":"2308.07264","submitter":"Alexander Kyuroson","authors":"Alexander Kyuroson, Anton Koval and George Nikolakopoulos","title":"Efficient Real-time Smoke Filtration with 3D LiDAR for Search and Rescue\n  with Autonomous Heterogeneous Robotic Systems","comments":"Accepted in the 49th Annual Conference of the IEEE Industrial\n  Electronics Society [IECON2023]","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Search and Rescue (SAR) missions in harsh and unstructured Sub-Terranean\n(Sub-T) environments in the presence of aerosol particles have recently become\nthe main focus in the field of robotics. Aerosol particles such as smoke and\ndust directly affect the performance of any mobile robotic platform due to\ntheir reliance on their onboard perception systems for autonomous navigation\nand localization in Global Navigation Satellite System (GNSS)-denied\nenvironments. Although obstacle avoidance and object detection algorithms are\nrobust to the presence of noise to some degree, their performance directly\nrelies on the quality of captured data by onboard sensors such as Light\nDetection And Ranging (LiDAR) and camera. Thus, this paper proposes a novel\nmodular agnostic filtration pipeline based on intensity and spatial information\nsuch as local point density for removal of detected smoke particles from Point\nCloud (PCL) prior to its utilization for collision detection. Furthermore, the\nefficacy of the proposed framework in the presence of smoke during multiple\nfrontier exploration missions is investigated while the experimental results\nare presented to facilitate comparison with other methodologies and their\ncomputational impact. This provides valuable insight to the research community\nfor better utilization of filtration schemes based on available computation\nresources while considering the safe autonomous navigation of mobile robots.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:48:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kyuroson","Alexander",""],["Koval","Anton",""],["Nikolakopoulos","George",""]]}
{"id":"2308.07265","submitter":"Ruchi Pandey","authors":"Ruchi Pandey, Santosh Nannuru","title":"Localization of DOA trajectories -- Beyond the grid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The direction of arrival (DOA) estimation algorithms are crucial in\nlocalizing acoustic sources. Traditional localization methods rely on\nblock-level processing to extract the directional information from multiple\nmeasurements processed together. However, these methods assume that DOA remains\nconstant throughout the block, which may not be true in practical scenarios.\nAlso, the performance of localization methods is limited when the true\nparameters do not lie on the parameter search grid. In this paper we propose\ntwo trajectory models, namely the polynomial and bandlimited trajectory models,\nto capture the DOA dynamics. To estimate trajectory parameters, we adopt two\ngridless algorithms: i) Sliding Frank-Wolfe (SFW), which solves the Beurling\nLASSO problem and ii) Newtonized Orthogonal Matching Pursuit (NOMP), which\nimproves over OMP using cyclic refinement. Furthermore, we extend our analysis\nto include wideband processing. The simulation results indicate that the\nproposed trajectory localization algorithms exhibit improved performance\ncompared to grid-based methods in terms of resolution, robustness to noise, and\ncomputational efficiency.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:50:00 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pandey","Ruchi",""],["Nannuru","Santosh",""]]}
{"id":"2308.07266","submitter":"Chandan Kumar Sheemar","authors":"Chandan Kumar Sheemar, Sourabh Solanki, Eva Lagunas, Jorge Querol,\n  Symeon Chatzinotas, and Bj\\\"orn Ottersten","title":"Full Duplex Joint Communications and Sensing for 6G: Opportunities and\n  Challenges","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 paradigm of joint communications and sensing (JCAS) envisions a\nrevolutionary integration of communication and radar functionalities within a\nunified hardware platform. This novel concept not only opens up unprecedented\npossibilities, but also presents unique challenges. Its success is highly\ndependent on efficient full-duplex (FD) operation, which has the potential to\nenable simultaneous transmission and reception within the same frequency band.\nWhile ongoing research explores the potential of JCAS, there are related\navenues of investigation that hold tremendous potential to profoundly transform\nthe sixth generation (6G) and beyond cellular networks. This article sheds\nlight on the new opportunities and challenges presented by JCAS by taking into\naccount the key technical challenges of FD systems. Unlike simplified JCAS\nscenarios, we delve into the most comprehensive configuration, encompassing\nuplink (UL) and downlink (DL) users, as well as monostatic and bistatic radars,\nall harmoniously coexisting to jointly push the boundaries of both the\ncommunications and sensing performance. The performance improvements introduced\nby this advancement bring forth numerous new challenges, each meticulously\nexamined and expounded upon.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:50:12 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sheemar","Chandan Kumar",""],["Solanki","Sourabh",""],["Lagunas","Eva",""],["Querol","Jorge",""],["Chatzinotas","Symeon",""],["Ottersten","Bj\u00f6rn",""]]}
{"id":"2308.07267","submitter":"Kejia Zhang","authors":"Kejia Zhang, Mingyu Yang, Stephen D. J. Lang, Alistair M. McInnes,\n  Richard B. Sherley, Tilo Burghardt","title":"Diving with Penguins: Detecting Penguins and their Prey in Animal-borne\n  Underwater Videos via Deep Learning","comments":"5 pages, 5 figures, 4 Tables, \"3rd International Workshop on Camera\n  traps, AI, and Ecology (CamTrapAI)\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  African penguins (Spheniscus demersus) are an endangered species. Little is\nknown regarding their underwater hunting strategies and associated predation\nsuccess rates, yet this is essential for guiding conservation. Modern\nbio-logging technology has the potential to provide valuable insights, but\nmanually analysing large amounts of data from animal-borne video recorders\n(AVRs) is time-consuming. In this paper, we publish an animal-borne underwater\nvideo dataset of penguins and introduce a ready-to-deploy deep learning system\ncapable of robustly detecting penguins (mAP50@98.0%) and also instances of fish\n(mAP50@73.3%). We note that the detectors benefit explicitly from air-bubble\nlearning to improve accuracy. Extending this detector towards a dual-stream\nbehaviour recognition network, we also provide the first results for\nidentifying predation behaviour in penguin underwater videos. Whilst results\nare promising, further work is required for useful applicability of predation\nbehaviour detection in field scenarios. In summary, we provide a highly\nreliable underwater penguin detector, a fish detector, and a valuable first\nattempt towards an automated visual detection of complex behaviours in a marine\npredator. We publish the networks, the DivingWithPenguins video dataset,\nannotations, splits, and weights for full reproducibility and immediate\nusability by practitioners.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:50:27 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Zhang","Kejia",""],["Yang","Mingyu",""],["Lang","Stephen D. J.",""],["McInnes","Alistair M.",""],["Sherley","Richard B.",""],["Burghardt","Tilo",""]]}
{"id":"2308.07268","submitter":"Chinmay Sonar","authors":"Chinmay Sonar, Subhash Suri and Jie Xue","title":"Fault Tolerance in Euclidean Committee Selection","comments":"The paper will appear in the proceedings of ESA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.CG econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the committee selection problem, the goal is to choose a subset of size\n$k$ from a set of candidates $C$ that collectively gives the best\nrepresentation to a set of voters. We consider this problem in Euclidean\n$d$-space where each voter/candidate is a point and voters' preferences are\nimplicitly represented by Euclidean distances to candidates. We explore\nfault-tolerance in committee selection and study the following three variants:\n(1) given a committee and a set of $f$ failing candidates, find their optimal\nreplacement; (2) compute the worst-case replacement score for a given committee\nunder failure of $f$ candidates; and (3) design a committee with the best\nreplacement score under worst-case failures. The score of a committee is\ndetermined using the well-known (min-max) Chamberlin-Courant rule: minimize the\nmaximum distance between any voter and its closest candidate in the committee.\nOur main results include the following: (1) in one dimension, all three\nproblems can be solved in polynomial time; (2) in dimension $d \\geq 2$, all\nthree problems are NP-hard; and (3) all three problems admit a constant-factor\napproximation in any fixed dimension, and the optimal committee problem has an\nFPT bicriterion approximation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:50:48 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Sonar","Chinmay",""],["Suri","Subhash",""],["Xue","Jie",""]]}
{"id":"2308.07269","submitter":"Ningyu Zhang","authors":"Peng Wang, Ningyu Zhang, Xin Xie, Yunzhi Yao, Bozhong Tian, Mengru\n  Wang, Zekun Xi, Siyuan Cheng, Kangwei Liu, Guozhou Zheng, Huajun Chen","title":"EasyEdit: An Easy-to-use Knowledge Editing Framework for Large Language\n  Models","comments":"The project website is https://github.com/zjunlp/EasyEdit","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) usually suffer from knowledge cutoff or fallacy\nissues, which means they are unaware of unseen events or generate text with\nincorrect facts owing to the outdated/noisy data. To this end, many knowledge\nediting approaches for LLMs have emerged -- aiming to subtly inject/edit\nupdated knowledge or adjust undesired behavior while minimizing the impact on\nunrelated inputs. Nevertheless, due to significant differences among various\nknowledge editing methods and the variations in task setups, there is no\nstandard implementation framework available for the community, which hinders\npractitioners to apply knowledge editing to applications. To address these\nissues, we propose EasyEdit, an easy-to-use knowledge editing framework for\nLLMs. It supports various cutting-edge knowledge editing approaches and can be\nreadily apply to many well-known LLMs such as T5, GPT-J, LlaMA, etc.\nEmpirically, we report the knowledge editing results on LlaMA-2 with EasyEdit,\ndemonstrating that knowledge editing surpasses traditional fine-tuning in terms\nof reliability and generalization. We have released the source code on GitHub\nat https://github.com/zjunlp/EasyEdit, along with Google Colab tutorials and\ncomprehensive documentation for beginners to get started. Besides, we present\nan online system for real-time knowledge editing, and a demo video at\nhttp://knowlm.zjukg.cn/easyedit.mp4.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:52:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Wang","Peng",""],["Zhang","Ningyu",""],["Xie","Xin",""],["Yao","Yunzhi",""],["Tian","Bozhong",""],["Wang","Mengru",""],["Xi","Zekun",""],["Cheng","Siyuan",""],["Liu","Kangwei",""],["Zheng","Guozhou",""],["Chen","Huajun",""]]}
{"id":"2308.07270","submitter":"Pierrick Bousseau","authors":"H\\\"ulya Arg\\\"uz and Pierrick Bousseau","title":"Quivers and curves in higher dimension","comments":"38 pages, 3 figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG hep-th math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a correspondence between Donaldson-Thomas invariants of quivers with\npotential having trivial attractor invariants and genus zero punctured\nGromov-Witten invariants of holomorphic symplectic cluster varieties. The proof\nrelies on the comparison of the stability scattering diagram, describing the\nwall-crossing behavior of Donaldson-Thomas invariants, with a scattering\ndiagram capturing punctured Gromov-Witten invariants via tropical geometry.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:52:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Arg\u00fcz","H\u00fclya",""],["Bousseau","Pierrick",""]]}
{"id":"2308.07271","submitter":"Brian Hsu","authors":"Brian Hsu, Peter K. Blanchard, Edo Berger, Sebastian Gomez","title":"An Extensive $\\textit{Hubble Space Telescope}$ Study of the Offset and\n  Host Light Distributions of Type I Superluminous Supernovae","comments":"31 pages, 14 figures, 5 tables. Submitted to ApJ. Comments welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an extensive $\\textit{Hubble Space Telescope}$ ($\\textit{HST}$)\nrest-frame ultraviolet (UV) imaging study of the locations of Type I\nsuperluminous supernovae (SLSNe) within their host galaxies. The sample\nincludes 65 SLSNe with detected host galaxies in the redshift range $z\\approx\n0.05-2$. Using precise astrometric matching with SN images, we determine the\ndistributions of physical and host-normalized offsets relative to the host\ncenters, as well as the fractional flux distribution relative to the underlying\nUV light distribution. We find that the host-normalized offsets of SLSNe\nroughly track an exponential disk profile, but exhibit an overabundance of\nsources with large offsets of $1.5-4$ times their host half-light radius. The\nSLSNe normalized offsets are systematically larger than those of long gamma-ray\nbursts (LGRBs), and even Type Ib/c and II SNe. Furthermore, we find that about\n40\\% of all SLSNe occur in the dimmest regions of their host galaxies\n(fractional flux of 0), in stark contrast to LGRBs and Type Ib/c and II SNe. We\ndo not detect any significant trends in the locations of SLSNe as a function of\nredshift, or as a function of explosion and magnetar engine parameters inferred\nfrom modeling of their optical lights curves. The significant difference in\nSLSN locations compared to LGRBs (and normal core-collapse SNe) suggests that\nat least some of their progenitors follow a different evolutionary path. We\nspeculate that SLSNe arise from massive runaway stars from disrupted binary\nsystems, with velocities of $\\sim 10^2$ km s$^{-1}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:58:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hsu","Brian",""],["Blanchard","Peter K.",""],["Berger","Edo",""],["Gomez","Sebastian",""]]}
{"id":"2308.07272","submitter":"Yichen Wang","authors":"Chengzhengxu Li, Xiaoming Liu, Yichen Wang, Duyi Li, Yu Lan, Chao Shen","title":"Dialogue for Prompting: a Policy-Gradient-Based Discrete Prompt\n  Optimization for Few-shot Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prompt-based pre-trained language models (PLMs) paradigm have succeeded\nsubstantially in few-shot natural language processing (NLP) tasks. However,\nprior discrete prompt optimization methods require expert knowledge to design\nthe base prompt set and identify high-quality prompts, which is costly,\ninefficient, and subjective. Meanwhile, existing continuous prompt optimization\nmethods improve the performance by learning the ideal prompts through the\ngradient information of PLMs, whose high computational cost, and low\nreadability and generalizability are often concerning. To address the research\ngap, we propose a Dialogue-comprised Policy-gradient-based Discrete Prompt\nOptimization ($DP_2O$) method. We first design a multi-round dialogue alignment\nstrategy for readability prompt set generation based on GPT-4. Furthermore, we\npropose an efficient prompt screening metric to identify high-quality prompts\nwith linear complexity. Finally, we construct a reinforcement learning (RL)\nframework based on policy gradients to match the prompts to inputs optimally.\nBy training a policy network with only 0.67% of the PLM parameter size on the\ntasks in the few-shot setting, $DP_2O$ outperforms the state-of-the-art (SOTA)\nmethod by 1.52% in accuracy on average on four open-source datasets. Moreover,\nsubsequent experiments also demonstrate that $DP_2O$ has good universality,\nrobustness, and generalization ability.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 16:58:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Li","Chengzhengxu",""],["Liu","Xiaoming",""],["Wang","Yichen",""],["Li","Duyi",""],["Lan","Yu",""],["Shen","Chao",""]]}
{"id":"2308.07273","submitter":"Youssra Cheriguene","authors":"Youssra Cheriguene, Wael Jaafar, Chaker Abdelaziz Kerrache, Halim\n  Yanikomeroglu, Fatima Zohra Bousbaa, and Nasreddine Lagraa","title":"Data-Efficient Energy-Aware Participant Selection for UAV-Enabled\n  Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmanned aerial vehicle (UAV)-enabled edge federated learning (FL) has\nsparked a rise in research interest as a result of the massive and\nheterogeneous data collected by UAVs, as well as the privacy concerns related\nto UAV data transmissions to edge servers. However, due to the redundancy of\nUAV collected data, e.g., imaging data, and non-rigorous FL participant\nselection, the convergence time of the FL learning process and bias of the FL\nmodel may increase. Consequently, we investigate in this paper the problem of\nselecting UAV participants for edge FL, aiming to improve the FL model's\naccuracy, under UAV constraints of energy consumption, communication quality,\nand local datasets' heterogeneity. We propose a novel UAV participant selection\nscheme, called data-efficient energy-aware participant selection strategy\n(DEEPS), which consists of selecting the best FL participant in each sub-region\nbased on the structural similarity index measure (SSIM) average score of its\nlocal dataset and its power consumption profile. Through experiments, we\ndemonstrate that the proposed selection scheme is superior to the benchmark\nrandom selection method, in terms of model accuracy, training time, and UAV\nenergy consumption.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:00:13 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cheriguene","Youssra",""],["Jaafar","Wael",""],["Kerrache","Chaker Abdelaziz",""],["Yanikomeroglu","Halim",""],["Bousbaa","Fatima Zohra",""],["Lagraa","Nasreddine",""]]}
{"id":"2308.07274","submitter":"Alejandro Hnilo Dr.","authors":"Alejandro Hnilo","title":"The distinctive symmetry of Bell states","comments":"8 pages, no figures, 1 appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Bell's basis is composed of four maximally entangled states of two\nqubits, named Bell states. They are usual tools in many theoretical studies and\nexperiments. The aim of this paper is to find out the symmetries that determine\na Bell state. For this purpose, starting from a general density matrix,\nphysical constraints and symmetry conditions are added until the elements of\nthe Bell's basis are univocally determined. It is found that the usual physical\nconstraints and symmetry conditions do not suffice to determine a Bell state.\nThe additional restriction needed is named here atomic symmetry. It is a sort\nof global symmetry of the system, not derived from the action = reaction law.\nIt is also found that the imperfection in fulfilling the atomic symmetry is\nlinearly proportional to the deviation of the Concurrence from its maximum\nvalue. The atomic symmetry allows a different insight on the nature of\nentanglement, and might be useful as a criterion to define the condition of\nmaximal entanglement for states with more than two qubits.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:02:41 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Hnilo","Alejandro",""]]}
{"id":"2308.07275","submitter":"Connor Holmes","authors":"Connor Holmes, Frederike D\\\"umbgen and Timothy D Barfoot","title":"On Semidefinite Relaxations for Matrix-Weighted State-Estimation\n  Problems in Robotics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, there has been remarkable progress in the development of\nso-called certifiable perception methods, which leverage semidefinite, convex\nrelaxations to find global optima of perception problems in robotics. However,\nmany of these relaxations rely on simplifying assumptions that facilitate the\nproblem formulation, such as an isotropic measurement noise distribution. In\nthis paper, we explore the tightness of the semidefinite relaxations of\nmatrix-weighted (anisotropic) state-estimation problems and reveal the\nlimitations lurking therein: matrix-weighted factors can cause convex\nrelaxations to lose tightness. In particular, we show that the semidefinite\nrelaxations of localization problems with matrix weights may be tight only for\nlow noise levels. We empirically explore the factors that contribute to this\nloss of tightness and demonstrate that redundant constraints can be used to\nregain tightness, albeit at the expense of real-time performance. As a second\ntechnical contribution of this paper, we show that the state-of-the-art\nrelaxation of scalar-weighted SLAM cannot be used when matrix weights are\nconsidered. We provide an alternate formulation and show that its SDP\nrelaxation is not tight (even for very low noise levels) unless specific\nredundant constraints are used. We demonstrate the tightness of our\nformulations on both simulated and real-world data.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:04:08 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Holmes","Connor",""],["D\u00fcmbgen","Frederike",""],["Barfoot","Timothy D",""]]}
{"id":"2308.07276","submitter":"Steven Rodan","authors":"Steven Rodan, Christoph T\\\"onnis, Jiwoong Lee, Carsten Rott (for the\n  IceCube Collaboration)","title":"Operations plans and sensitivities of the IceCube Upgrade Camera System","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-1037","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Upgrade consists of seven new strings to be deployed in the\ncentral region of the existing IceCube detector. The goals of the IceCube\nUpgrade are two-fold: to enhance sensitivity to neutrinos in the GeV range, and\nto improve the calibration of the IceCube detector as a means of reducing\nsystematic uncertainties due to the optical properties of the ice. Among other\ncalibration devices designed to study ice properties, a novel camera system\nwill be deployed as part of the Upgrade. The system will include three cameras,\neach paired with an illumination LED, included in each of the Upgrade optical\nmodules. In total, 2,300 cameras will be deployed. A combination of\nphotographic images from transmitted and reflected light will measure optical\nproperties of both the bulk ice in-between strings and the local ice refrozen\nin the drill hole. In this contribution, we present the operations plans for\nthese two types of measurements and the sensitivities to the ice properties and\ngeometry of the new modules that can be achieved with the new camera system.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:06:18 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Rodan","Steven","","for the\n  IceCube Collaboration"],["T\u00f6nnis","Christoph","","for the\n  IceCube Collaboration"],["Lee","Jiwoong","","for the\n  IceCube Collaboration"],["Rott","Carsten","","for the\n  IceCube Collaboration"]]}
{"id":"2308.07277","submitter":"Agrim Sharma","authors":"Shri Hari Soundararaj, Agrim Sharma, Manish Jain","title":"Quantum MASALA: Quantum MAterialS Ab initio eLectronic-structure pAckage","comments":"42 pages, 5 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":"  We present QuantumMASALA, a compact package that implements different\nelectronic structure methods in Python. Within just 8000 lines of pure Python\ncode, we have implemented Density Functional Theory (DFT), Time dependent\nDensity Functional Theory (TD-DFT) and the GW Method. The program can run\nacross multiple process cores and in Graphical Processing Units (GPU) with the\nhelp of easily-accessible Python libraries. With QuantumESPRESSO and BerkeleyGW\nI/O interfaces implemented, it can also be used as a substitute for small scale\ncalculations, making it a perfect learning tool for ab initio methods. The\npackage is aimed to provide a framework with its modular and simple code design\nto rapidly build and test new methods for first-principles calculation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:06:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Soundararaj","Shri Hari",""],["Sharma","Agrim",""],["Jain","Manish",""]]}
{"id":"2308.07278","submitter":"Prajeesh A V","authors":"C.R. Pavithra, A. V. Prajeesh, V. S. Sarath","title":"Local antimagic chromatic number of partite graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a connected graph with $|V| = n$ and $|E| = m$. A bijection\n$f:E\\rightarrow \\{1,2,...,m\\}$ is called a local antimagic labeling of $G$ if\nfor any two adjacent vertices $u$ and $v$, $w(u) \\neq w(v)$, where $w(u) =\n\\sum_{e \\in E(u)}f(e)$, and $E(u)$ is the set of edges incident to $u$. Thus,\nany local antimagic labeling induces a proper vertex coloring of $G$ where the\nvertex $v$ is assigned the color $w(v)$. The local antimagic chromatic number\nis the minimum number of colors taken over all colorings induced by local\nantimagic labelings of $G$. Let $m,n > 1$. In this paper, the local antimagic\nchromatic number of a complete tripartite graph $K_{1,m,n}$, and $r$ copies of\na complete bipartite graph $K_{m,n}$ where $m \\not \\equiv n \\bmod 2$ are\ndetermined.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:10:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Pavithra","C. R.",""],["Prajeesh","A. V.",""],["Sarath","V. S.",""]]}
{"id":"2308.07279","submitter":"Manjary P.Gangan","authors":"Manjary P Gangan, Anoop Kadan, and Lajish V L","title":"A Robust Approach Towards Distinguishing Natural and Computer Generated\n  Images using Multi-Colorspace fused and Enriched Vision Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The works in literature classifying natural and computer generated images are\nmostly designed as binary tasks either considering natural images versus\ncomputer graphics images only or natural images versus GAN generated images\nonly, but not natural images versus both classes of the generated images. Also,\neven though this forensic classification task of distinguishing natural and\ncomputer generated images gets the support of the new convolutional neural\nnetworks and transformer based architectures that can give remarkable\nclassification accuracies, they are seen to fail over the images that have\nundergone some post-processing operations usually performed to deceive the\nforensic algorithms, such as JPEG compression, gaussian noise, etc. This work\nproposes a robust approach towards distinguishing natural and computer\ngenerated images including both, computer graphics and GAN generated images\nusing a fusion of two vision transformers where each of the transformer\nnetworks operates in different color spaces, one in RGB and the other in YCbCr\ncolor space. The proposed approach achieves high performance gain when compared\nto a set of baselines, and also achieves higher robustness and generalizability\nthan the baselines. The features of the proposed model when visualized are seen\nto obtain higher separability for the classes than the input image features and\nthe baseline features. This work also studies the attention map visualizations\nof the networks of the fused model and observes that the proposed methodology\ncan capture more image information relevant to the forensic task of classifying\nnatural and generated images.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:11:17 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Gangan","Manjary P",""],["Kadan","Anoop",""],["L","Lajish V",""]]}
{"id":"2308.07280","submitter":"Philippe Page Dr.","authors":"Philippe Page, Paul Knowles, Robert Mitwicki","title":"Distributed Governance: a Principal-Agent Approach to Data Governance --\n  Part 1 Background & Core Definitions","comments":"27 pages, 20 figures, basis of presentation at University of Geneva's\n  lectures on Information Security","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To address the need for regulating digital technologies without hampering\ninnovation or pre-digital transformation regulatory frameworks, we provide a\nmodel to evolve Data governance toward Information governance and precise the\nrelation between these two terms. This model bridges digital and non-digital\ninformation exchange. By considering the question of governed data usage\nthrough the angle of the Principal-Agent problem, we build a distributed\ngovernance model based on Autonomous Principals defined as entities capable of\nchoice, therefore capable of exercising a transactional sovereignty. Extending\nthe legal concept of the privacy sphere to a functional equivalent in the\ndigital space leads to the construction of a digital self to which rights and\naccountability can be attached. Ecosystems, defined as communities of\nautonomous principals bound by a legitimate authority, provide the basis of\ninteracting structures of increasing complexity endowed with a self-replicating\nproperty that mirrors physical world governance systems. The model proposes a\ngovernance concept for multi-stakeholder information systems operating across\njurisdictions. Using recent software engineering advances in decentralised\nauthentication and semantics, we provide a framework, Dynamic Data Economy to\ndeploy a distributed governance model embedding checks and balance between\nhuman and technological governance. Domain specific governance models are left\nfor further publications. Similarly, the technical questions related to the\nconnection between a digital-self and its physical world controller (e.g\nbiometric binding) will be treated in upcoming publications.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:12:07 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 04:48:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Page","Philippe",""],["Knowles","Paul",""],["Mitwicki","Robert",""]]}
{"id":"2308.07281","submitter":"Giovanni Barbarino","authors":"Giovanni Barbarino","title":"Ergodic Estimations for Toeplitz Sequences Generated by a Symbol","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 analyse the convergence of the ergodic formula for Toeplitz\nmatrix-sequences generated by a symbol and we produce explicit bounds depending\non the size of the matrix, the regularity of the symbol and the regularity of\nthe test function.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:12:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Barbarino","Giovanni",""]]}
{"id":"2308.07282","submitter":"Olesya Razuvayevskaya","authors":"Olesya Razuvayevskaya, Ben Wu, Joao A. Leite, Freddy Heppell, Ivan\n  Srba, Carolina Scarton, Kalina Bontcheva, Xingyi Song","title":"Comparison between parameter-efficient techniques and full fine-tuning:\n  A case study on multilingual news article classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adapters and Low-Rank Adaptation (LoRA) are parameter-efficient fine-tuning\ntechniques designed to make the training of language models more efficient.\nPrevious results demonstrated that these methods can even improve performance\non some classification tasks. This paper complements the existing research by\ninvestigating how these techniques influence the classification performance and\ncomputation costs compared to full fine-tuning when applied to multilingual\ntext classification tasks (genre, framing, and persuasion techniques detection;\nwith different input lengths, number of predicted classes and classification\ndifficulty), some of which have limited training data. In addition, we conduct\nin-depth analyses of their efficacy across different training scenarios\n(training on the original multilingual data; on the translations into English;\nand on a subset of English-only data) and different languages. Our findings\nprovide valuable insights into the applicability of the parameter-efficient\nfine-tuning techniques, particularly to complex multilingual and multilabel\nclassification tasks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:12:43 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Razuvayevskaya","Olesya",""],["Wu","Ben",""],["Leite","Joao A.",""],["Heppell","Freddy",""],["Srba","Ivan",""],["Scarton","Carolina",""],["Bontcheva","Kalina",""],["Song","Xingyi",""]]}
{"id":"2308.07283","submitter":"Alexander Kyuroson","authors":"Alexander Kyuroson, Anton Koval and George Nikolakopoulos","title":"Autonomous Point Cloud Segmentation for Power Lines Inspection in Smart\n  Grid","comments":"Accepted in the 22nd World Congress of the International Federation\n  of Automatic Control [IFAC WC 2023]","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LiDAR is currently one of the most utilized sensors to effectively monitor\nthe status of power lines and facilitate the inspection of remote power\ndistribution networks and related infrastructures. To ensure the safe operation\nof the smart grid, various remote data acquisition strategies, such as Airborne\nLaser Scanning (ALS), Mobile Laser Scanning (MLS), and Terrestrial Laser\nScanning (TSL) have been leveraged to allow continuous monitoring of regional\npower networks, which are typically surrounded by dense vegetation. In this\narticle, an unsupervised Machine Learning (ML) framework is proposed, to\ndetect, extract and analyze the characteristics of power lines of both high and\nlow voltage, as well as the surrounding vegetation in a Power Line Corridor\n(PLC) solely from LiDAR data. Initially, the proposed approach eliminates the\nground points from higher elevation points based on statistical analysis that\napplies density criteria and histogram thresholding. After denoising and\ntransforming of the remaining candidate points by applying Principle Component\nAnalysis (PCA) and Kd-tree, power line segmentation is achieved by utilizing a\ntwo-stage DBSCAN clustering to identify each power line individually. Finally,\nall high elevation points in the PLC are identified based on their distance to\nthe newly segmented power lines. Conducted experiments illustrate that the\nproposed framework is an agnostic method that can efficiently detect the power\nlines and perform PLC-based hazard analysis.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:14:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kyuroson","Alexander",""],["Koval","Anton",""],["Nikolakopoulos","George",""]]}
{"id":"2308.07284","submitter":"Wen Liang","authors":"Wen Liang, Zeng Fan, Youzhi Liang, Jianguo Jia","title":"Cross-Attribute Matrix Factorization Model with Shared User Embedding","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":"  Over the past few years, deep learning has firmly established its prowess\nacross various domains, including computer vision, speech recognition, and\nnatural language processing. Motivated by its outstanding success, researchers\nhave been directing their efforts towards applying deep learning techniques to\nrecommender systems. Neural collaborative filtering (NCF) and Neural Matrix\nFactorization (NeuMF) refreshes the traditional inner product in matrix\nfactorization with a neural architecture capable of learning complex and\ndata-driven functions. While these models effectively capture user-item\ninteractions, they overlook the specific attributes of both users and items.\nThis can lead to robustness issues, especially for items and users that belong\nto the \"long tail\". Such challenges are commonly recognized in recommender\nsystems as a part of the cold-start problem. A direct and intuitive approach to\naddress this issue is by leveraging the features and attributes of the items\nand users themselves. In this paper, we introduce a refined NeuMF model that\nconsiders not only the interaction between users and items, but also acrossing\nassociated attributes. Moreover, our proposed architecture features a shared\nuser embedding, seamlessly integrating with user embeddings to imporve the\nrobustness and effectively address the cold-start problem. Rigorous experiments\non both the Movielens and Pinterest datasets demonstrate the superiority of our\nCross-Attribute Matrix Factorization model, particularly in scenarios\ncharacterized by higher dataset sparsity.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:15:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liang","Wen",""],["Fan","Zeng",""],["Liang","Youzhi",""],["Jia","Jianguo",""]]}
{"id":"2308.07285","submitter":"Job Furtado Neto","authors":"J. Furtado","title":"Electronic states in a quantum Beltrami surface","comments":"6 pages, 7 figures, two column. Matches version to appear in Physics\n  Letters A","journal-ref":null,"doi":"10.1016/j.physleta.2023.129065","report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the influence of the geometry in the electronic\nstates of a quantum Beltrami surface. We have considered an electron governed\nby the spinless stationary Schr\\\"{o}dinger equation constrained to move on the\nBeltrami surface due to a confining potential from which the Da Costa potential\nemerges. We investigate the role played by the geometry and orbital angular\nmomentum on the electronic states of the system.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:17:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Furtado","J.",""]]}
{"id":"2308.07286","submitter":"Patrick Fernandes","authors":"Patrick Fernandes, Daniel Deutsch, Mara Finkelstein, Parker Riley,\n  Andr\\'e F. T. Martins, Graham Neubig, Ankush Garg, Jonathan H. Clark, Markus\n  Freitag, Orhan Firat","title":"The Devil is in the Errors: Leveraging Large Language Models for\n  Fine-grained Machine Translation Evaluation","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic evaluation of machine translation (MT) is a critical tool driving\nthe rapid iterative development of MT systems. While considerable progress has\nbeen made on estimating a single scalar quality score, current metrics lack the\ninformativeness of more detailed schemes that annotate individual errors, such\nas Multidimensional Quality Metrics (MQM). In this paper, we help fill this gap\nby proposing AutoMQM, a prompting technique which leverages the reasoning and\nin-context learning capabilities of large language models (LLMs) and asks them\nto identify and categorize errors in translations. We start by evaluating\nrecent LLMs, such as PaLM and PaLM-2, through simple score prediction\nprompting, and we study the impact of labeled data through in-context learning\nand finetuning. We then evaluate AutoMQM with PaLM-2 models, and we find that\nit improves performance compared to just prompting for scores (with\nparticularly large gains for larger models) while providing interpretability\nthrough error spans that align with human annotations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:17:21 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Fernandes","Patrick",""],["Deutsch","Daniel",""],["Finkelstein","Mara",""],["Riley","Parker",""],["Martins","Andr\u00e9 F. T.",""],["Neubig","Graham",""],["Garg","Ankush",""],["Clark","Jonathan H.",""],["Freitag","Markus",""],["Firat","Orhan",""]]}
{"id":"2308.07287","submitter":"Shmuel Friedland","authors":"Shmuel Friedland and Chi-Kwong Li","title":"On a semidefinite programming characterizations of the numerical radius\n  and its dual norm","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a semidefinite programming characterization of the dual norm of\nnumerical radius for matrices. This characterization yields a new proof of\nsemidefinite characterization of the numerical radius for matrices, which\nfollows from Ando's characterization. We show that the computation of the\nnumerical radius and its dual norm within $\\varepsilon$ precision are\npolynomially time computable in the data and $|\\log \\varepsilon |$ using the\nshort step, primal interior point method.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:19:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Friedland","Shmuel",""],["Li","Chi-Kwong",""]]}
{"id":"2308.07288","submitter":"Benjamin Antieau","authors":"Benjamin Antieau","title":"Spherical Witt vectors and integral models for spaces","comments":"comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a new construction of the spherical Witt vector functor of Lurie and\nBurklund-Schlank-Yuan and extend it to nonconnective objects using synthetic\nspectra and recent work of Holeman. The spherical Witt vectors are used to\nbuild spherical versions of perfect $\\lambda$-rings and to motivate new results\nin Grothendieck's schematization program, building on work of Ekedahl, Kriz,\nMandell, Lurie, Quillen, Sullivan, To\\\"en, and Yuan. In particular, there is an\n$\\infty$-category of perfect derived $\\lambda$-rings with trivializations of\nthe Adams operations $\\psi^p$ for all $p$ such that the functor sending a space\n$X$ to its integral cochains on $X$, viewed as such a derived $\\lambda$-ring,\nis fully faithful on a large class of nilpotent spaces. Our theorem is closely\nrelated to recent work of Horel and Kubrak-Shuklin-Zakharov. Finally, we answer\ntwo questions of Yuan on spherical cochains.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:21:23 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Antieau","Benjamin",""]]}
{"id":"2308.07289","submitter":"Jared Speck","authors":"Leonardo Abbrescia and Jared Speck","title":"The relativistic Euler equations: ESI notes on their geo-analytic\n  structures and implications for shocks in $1D$ and multi-dimensions","comments":"61 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":"  In this article, we provide notes that complement the lectures on the\nrelativistic Euler equations and shocks that were given by the second author at\nthe program Mathematical Perspectives of Gravitation Beyond the Vacuum Regime,\nwhich was hosted by the Erwin Schrodinger International Institute for\nMathematics and Physics in Vienna in February, 2022. We set the stage by\nintroducing a standard first-order formulation of the relativistic Euler\nequations and providing a brief overview of local well-posedness in Sobolev\nspaces. Then, using Riemann invariants, we provide the first detailed\nconstruction of a localized subset of the maximal globally hyperbolic\ndevelopments of an open set of initially smooth, shock-forming isentropic\nsolutions in 1D, with a focus on describing the singular boundary and the\nCauchy horizon that emerges from the singularity. Next, we provide an overview\nof the new second-order formulation of the 3D relativistic Euler equations\nderived in [41], its rich geometric and analytic structures, their implications\nfor the mathematical theory of shock waves, and their connection to the setup\nwe use in our 1D analysis of shocks. We then highlight some key prior results\non the study of shock formation and related problems. Furthermore, we provide\nan overview of how the formulation of the flow derived in [41] can be used to\nstudy shock formation in multiple spatial dimensions. Finally, we discuss\nvarious open problems tied to shocks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:27:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Abbrescia","Leonardo",""],["Speck","Jared",""]]}
{"id":"2308.07290","submitter":"Marcos Lopez-Garcia Dr.","authors":"L. Galo-Mendoza and M. L\\'opez-Garc\\'ia","title":"Boundary controllability for a 1D degenerate parabolic equation with a\n  Robin boundary condition","comments":"arXiv admin note: substantial text overlap with arXiv:2304.00178,\n  arXiv:2302.01197","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we prove the null controllability of a one-dimensional\ndegenerate parabolic equation with a weighted Robin boundary condition at the\nleft endpoint, where the potential has a singularity. We use some results from\nthe singular Sturm-Liouville theory to show the well-posedness of our system.\nWe obtain a spectral decomposition of a degenerate parabolic operator with\nRobin conditions at the endpoints, we use Fourier-Dini expansions and the\nmoment method introduced by Fattorini and Russell to prove the null\ncontrollability and to obtain an upper estimate of the cost of controllability.\nWe also get a lower estimate of the cost of controllability by using a\nrepresentation theorem for analytic functions of exponential type.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:27:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Galo-Mendoza","L.",""],["L\u00f3pez-Garc\u00eda","M.",""]]}
{"id":"2308.07291","submitter":"Paolo Cavicchioli","authors":"Paolo Cavicchioli and Sofia Lambropoulou","title":"Passing from plat closure to standard closure of braids in\n  $\\mathbb{R}^3$, in handlebodies and in thickened surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a knot or link in the form of plat closure of a braid, we describe an\nalgorithm to obtain a braid representing the same knot or link with the\nstandard closure, and vice-versa. We analyze the three cases of knots and\nlinks: in \\(\\mathbb{R}^3\\), in handlebodies and in thickened surfaces. We show\nthat the algorithm is quadratic in the number of crossings and loop generators\nof the braid when passing from plat to standard closure, while it is linear\nwhen passing from standard to plat closure.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:27:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Cavicchioli","Paolo",""],["Lambropoulou","Sofia",""]]}
{"id":"2308.07292","submitter":"Mohammad Ful Hossain Seikh","authors":"M.F.H Seikh, D.Z. Besson, S. Ali, P. Allison, S. Archambault, J.J.\n  Beatty, A. Bishop, P. Chen, Y.C. Chen, B.A. Clark, W. Clay, A. Connolly, K.\n  Couberly, L. Cremonesi, A. Cummings, P. Dasgupta, R. Debolt, S. De Kockere,\n  K.D. de Vries, C. Deaconu, M.A. DuVernois, J. Flaherty, E. Friedman, R.\n  Gaior, P. Giri, J. Hanson, N. Harty, B. Hendricks, K.D. Hoffman, J.J. Huang,\n  M.H. A. Huang, K. Hughes, A. Ishihara, A. Karle, J.L. Kelley, K.C. Kim, M.C.\n  Kim, I. Kravchenko, R. Krebs, C.Y. Kuo, K. Kurusu, U.A. Latif, C.H. Liu, T.C.\n  Liu, W. Luszczak, K. Mase, M.S. Muzio, J. Nam, R.J. Nichol, A. Novikov, A.\n  Nozdrina, E. Oberla, Y. Pan, C. Pfendner, N. Punsuebsay, J. Roth, A.\n  Salcedo-Gomez, D. Seckel, M.F.H. Seikh, Y.S. Shiao, D.J.B. Smith, S. Toscano,\n  J. Torres, J. Touart, N. van Eijndhoven, G.S. Varner, A. Vieregg, M.Z. Wang,\n  S.H. Wang, S.A. Wissel, C. Xie, S. Yoshida, R. Young","title":"Calibration and Physics with ARA Station 1: A Unique Askaryan Radio\n  Array Detector","comments":"10 pages","journal-ref":"PoS ICRC2023 (2023) 1163","doi":"10.22323/1.444.1163","report-no":null,"categories":"astro-ph.IM astro-ph.HE physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Askaryan Radio Array Station 1 (A1), the first among five autonomous\nstations deployed for the ARA experiment at the South Pole, is a unique\nultra-high energy neutrino (UHEN) detector based on the Askaryan effect that\nuses Antarctic ice as the detector medium. Its 16 radio antennas (distributed\nacross 4 strings, each with 2 Vertically Polarized (VPol), 2 Horizontally\nPolarized (HPol) receivers), and 2 strings of transmitting antennas\n(calibration pulsers, CPs), each with 1 VPol and 1 HPol channel, are deployed\nat depths less than 100 m within the shallow firn zone of the 2.8 km thick\nSouth Pole (SP) ice. We apply different methods to calibrate its Ice Ray\nSampler second generation (IRS2) chip for timing offset and ADC-to-Voltage\nconversion factors using a known continuous wave input signal to the digitizer,\nand achieve a precision of sub-nanoseconds. We achieve better calibration for\nodd, compared to even samples, and also find that the HPols under-perform\nrelative to the VPol channels. Our timing calibrated data is subsequently used\nto calibrate the ADC-to-Voltage conversion as well as precise antenna\nlocations, as a precursor to vertex reconstruction. The calibrated data will\nthen be analyzed for UHEN signals in the final step of data compression. The\nability of A1 to scan the firn region of SP ice sheet will contribute greatly\ntowards a 5-station analysis and will inform the design of the planned IceCube\nGen-2 radio array.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:29:11 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Seikh","M. F. H",""],["Besson","D. Z.",""],["Ali","S.",""],["Allison","P.",""],["Archambault","S.",""],["Beatty","J. J.",""],["Bishop","A.",""],["Chen","P.",""],["Chen","Y. C.",""],["Clark","B. A.",""],["Clay","W.",""],["Connolly","A.",""],["Couberly","K.",""],["Cremonesi","L.",""],["Cummings","A.",""],["Dasgupta","P.",""],["Debolt","R.",""],["De Kockere","S.",""],["de Vries","K. D.",""],["Deaconu","C.",""],["DuVernois","M. A.",""],["Flaherty","J.",""],["Friedman","E.",""],["Gaior","R.",""],["Giri","P.",""],["Hanson","J.",""],["Harty","N.",""],["Hendricks","B.",""],["Hoffman","K. D.",""],["Huang","J. J.",""],["Huang","M. H. A.",""],["Hughes","K.",""],["Ishihara","A.",""],["Karle","A.",""],["Kelley","J. L.",""],["Kim","K. C.",""],["Kim","M. C.",""],["Kravchenko","I.",""],["Krebs","R.",""],["Kuo","C. Y.",""],["Kurusu","K.",""],["Latif","U. A.",""],["Liu","C. H.",""],["Liu","T. C.",""],["Luszczak","W.",""],["Mase","K.",""],["Muzio","M. S.",""],["Nam","J.",""],["Nichol","R. J.",""],["Novikov","A.",""],["Nozdrina","A.",""],["Oberla","E.",""],["Pan","Y.",""],["Pfendner","C.",""],["Punsuebsay","N.",""],["Roth","J.",""],["Salcedo-Gomez","A.",""],["Seckel","D.",""],["Seikh","M. F. H.",""],["Shiao","Y. S.",""],["Smith","D. J. B.",""],["Toscano","S.",""],["Torres","J.",""],["Touart","J.",""],["van Eijndhoven","N.",""],["Varner","G. S.",""],["Vieregg","A.",""],["Wang","M. Z.",""],["Wang","S. H.",""],["Wissel","S. A.",""],["Xie","C.",""],["Yoshida","S.",""],["Young","R.",""]]}
{"id":"2308.07293","submitter":"Swapnil Bhosale","authors":"Swapnil Bhosale, Sauradip Nag, Diptesh Kanojia, Jiankang Deng, Xiatian\n  Zhu","title":"DiffSED: Sound Event Detection with Denoising Diffusion","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":"  Sound Event Detection (SED) aims to predict the temporal boundaries of all\nthe events of interest and their class labels, given an unconstrained audio\nsample. Taking either the splitand-classify (i.e., frame-level) strategy or the\nmore principled event-level modeling approach, all existing methods consider\nthe SED problem from the discriminative learning perspective. In this work, we\nreformulate the SED problem by taking a generative learning perspective.\nSpecifically, we aim to generate sound temporal boundaries from noisy proposals\nin a denoising diffusion process, conditioned on a target audio sample. During\ntraining, our model learns to reverse the noising process by converting noisy\nlatent queries to the groundtruth versions in the elegant Transformer decoder\nframework. Doing so enables the model generate accurate event boundaries from\neven noisy queries during inference. Extensive experiments on the Urban-SED and\nEPIC-Sounds datasets demonstrate that our model significantly outperforms\nexisting alternatives, with 40+% faster convergence in training.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:29:41 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 18:57:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhosale","Swapnil",""],["Nag","Sauradip",""],["Kanojia","Diptesh",""],["Deng","Jiankang",""],["Zhu","Xiatian",""]]}
{"id":"2308.07294","submitter":"Stefan Borgwardt","authors":"Christian Alrabbaa, Stefan Borgwardt, Tom Friese, Patrick Koopmann,\n  Mikhail Kotlov","title":"Why Not? Explaining Missing Entailments with Evee (Technical Report)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding logical entailments derived by a description logic reasoner is\nnot always straight-forward for ontology users. For this reason, various\nmethods for explaining entailments using justifications and proofs have been\ndeveloped and implemented as plug-ins for the ontology editor Prot\\'eg\\'e.\nHowever, when the user expects a missing consequence to hold, it is equally\nimportant to explain why it does not follow from the ontology. In this paper,\nwe describe a new version of $\\rm E{\\scriptsize VEE}$, a Prot\\'eg\\'e plugin\nthat now also provides explanations for missing consequences, via existing and\nnew techniques based on abduction and counterexamples.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:30:03 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 11:54:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Alrabbaa","Christian",""],["Borgwardt","Stefan",""],["Friese","Tom",""],["Koopmann","Patrick",""],["Kotlov","Mikhail",""]]}
{"id":"2308.07295","submitter":"Alexandru Bogdan Georgescu","authors":"Alexandru B. Georgescu","title":"Cu-doped Pb$_{10}$(PO$_4$)$_6$O, and V doped SrTiO$_3$ -- a tutorial on\n  electron-crystal lattice coupling in insulating materials with transition\n  metal dopants","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/4.0/","abstract":"  We provide two pedagogical examples to understand the mechanisms at play in\nstabilizing an insulating state, and an impurity level in the bandgap in two\ninsulators using DFT+U: Cu-doped Pb$_{10}$(PO$_4$)$_6$O and V-doped SrTiO$_3$\ntransition metal-doped insulators. We find both to be insulating, with isolated\nimpurity (flat) bands, regardless of doping location. In both cases, the\nelectron degeneracy and crystal lattice symmetry are broken, leading to an\ninsulating state, and a magnetically and orbitally polarized impurity state\nwithin the gap, clearly separated from the valence and conduction bands. We\nalso resolve previously noticed inconsistencies between DFT and experiment\nregarding doping site energetics, crystal structure, and transparency in\nCu-doped phosphate lead apatite 'LK-99'. Doping one of each type of site in the\nsame unit cell ($20 \\%$ doping) also simply leads to two spin-polarized\nimpurity bands in the material's gap. The local transition metal ion sites may\nbehave like color centers (or f-centers), possibly giving color at low\ntemperatures to what we predict to be a transparent, insulating material in the\nrecently synthesized LK-99. Weak ferromagnetism may be possible due to the\nrelatively delocalized unpaired spins in the valence band. Further work should\ntake into account the possibility of further changes in stoichiometry,\ndifferent doping locations, supercell effects, and quantification of magnetic\nexchange interactions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:30:25 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Georgescu","Alexandru B.",""]]}
{"id":"2308.07296","submitter":"Cynthia J. Olson Reichhardt","authors":"D. McDermott, C. Reichhardt, and C.J.O. Reichhardt","title":"Characterizing Different Motility Induced Regimes in Active Matter with\n  Machine Learning and Noise","comments":"11 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We examine motility-induced phase separation (MIPS) in two-dimensional run\nand tumble disk systems using both machine learning and noise fluctuation\nanalysis. Our measures suggest that within the MIPS state there are several\ndistinct regimes as a function of density and run time, so that systems with\nMIPS transitions exhibit an active fluid, an active crystal, and a critical\nregime. The different regimes can be detected by combining an order parameter\nextracted from principal component analysis with a cluster stability\nmeasurement. The principal component-derived order parameter is maximized in\nthe critical regime, remains low in the active fluid, and has an intermediate\nvalue in the active crystal regime. We demonstrate that machine learning can\nbetter capture dynamical properties of the MIPS regimes compared to more\nstandard structural measures such as the maximum cluster size. The different\nregimes can also be characterized via changes in the noise power of the\nfluctuations in the average speed. In the critical regime, the noise power\npasses through a maximum and has a broad spectrum with a $1/f^{1.6}$ signature,\nsimilar to the noise observed near depinning transitions or for solids\nundergoing plastic deformation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:30:50 GMT"}],"update_date":"2023-08-15","authors_parsed":[["McDermott","D.",""],["Reichhardt","C.",""],["Reichhardt","C. J. O.",""]]}
{"id":"2308.07297","submitter":"Bruno Miguel Silva De Oliveira","authors":"Stefan Antusch, Jan Hajer and Bruno M. S. Oliveira","title":"Heavy neutrino-antineutrino oscillations at the FCC-ee","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the impact of heavy neutrino-antineutrino oscillations (NNOs) on\nheavy neutral lepton (HNL) searches at proposed electron-positron colliders\nsuch as the future circular $e^+e^-$ collider (FCC-ee). During the $Z$ pole\nrun, HNLs can be produced alongside a light neutrino or antineutrino that\nescapes detection and can decay into a charged lepton or antilepton together\nwith an off-shell $W$ boson. In this case, signals of lepton number violation\nonly show up in the final state distributions. We discuss how NNOs, a typical\nfeature of collider-testable low-scale seesaw models where the heavy neutrinos\nform pseudo-Dirac pairs, modify such final state distributions. For example,\nthe forward-backward asymmetry (FBA) of the reconstructed heavy (anti)neutrinos\ndevelops an oscillatory dependence on the HNL lifetime. We show that these\noscillations can be resolvable for long-lived HNLs. We also discuss that when\nthe NNOs are not resolvable, they can nevertheless significantly modify the\ntheory predictions for FBAs and observables such as the ratio of the total\nnumber of HNL decays into $\\ell^-$ over ones into $\\ell^+$, in an interval of\nthe angle~$\\theta$ between the HNL and the beam axis. Our results show that\nNNOs should be included in collider simulations of HNLs at the FCCee.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:32:59 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Antusch","Stefan",""],["Hajer","Jan",""],["Oliveira","Bruno M. S.",""]]}
{"id":"2308.07298","submitter":"Jiazhang Wang","authors":"Jiazhang Wang, Tianfu Wang, Bingjie Xu, Oliver Cossairt, Florian\n  Willomitzer","title":"Accurate Eye Tracking from Dense 3D Surface Reconstructions using\n  Single-Shot Deflectometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Eye-tracking plays a crucial role in the development of virtual reality\ndevices, neuroscience research, and psychology. Despite its significance in\nnumerous applications, achieving an accurate, robust, and fast eye-tracking\nsolution remains a considerable challenge for current state-of-the-art methods.\nWhile existing reflection-based techniques (e.g., \"glint tracking\") are\nconsidered the most accurate, their performance is limited by their reliance on\nsparse 3D surface data acquired solely from the cornea surface. In this paper,\nwe rethink the way how specular reflections can be used for eye tracking: We\npropose a novel method for accurate and fast evaluation of the gaze direction\nthat exploits teachings from single-shot phase-measuring-deflectometry (PMD).\nIn contrast to state-of-the-art reflection-based methods, our method acquires\ndense 3D surface information of both cornea and sclera within only one single\ncamera frame (single-shot). Improvements in acquired reflection surface\npoints(\"glints\") of factors $>3300 \\times$ are easily achievable. We show the\nfeasibility of our approach with experimentally evaluated gaze errors of only\n$\\leq 0.25^\\circ$ demonstrating a significant improvement over the current\nstate-of-the-art.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:36:39 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 19:34:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Jiazhang",""],["Wang","Tianfu",""],["Xu","Bingjie",""],["Cossairt","Oliver",""],["Willomitzer","Florian",""]]}
{"id":"2308.07299","submitter":"Sebasti\\'an Bahamonde Dr","authors":"Juan Manuel Armaleo, Sebastian Bahamonde, Georg Trenkler, Leonardo G.\n  Trombetta","title":"Symmetric Teleparallel Gauss-Bonnet Gravity and its Extensions","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  General Teleparallel theories assume that curvature is vanishing in which\ncase gravity can be solely represented by torsion and/or nonmetricity. Using\ndifferential form language, we express the Riemannian Gauss-Bonnet invariant\nconcisely in terms of two General Teleparallel Gauss-Bonnet invariants, a bulk\nand a boundary one. Both terms are boundary terms in four dimensions. We also\nfind that the split is not unique and present two possible alternatives. In the\nabsence of nonmetricity our expressions coincide with the well-known Metric\nTeleparallel Gauss-Bonnet invariants for one of the splits. Next, we focus on\nthe description where only nonmetricity is present and show some examples in\ndifferent spacetimes. We finish our discussion by formulating novel modified\nSymmetric Teleparallel theories constructed with our new scalars.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:36:53 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Armaleo","Juan Manuel",""],["Bahamonde","Sebastian",""],["Trenkler","Georg",""],["Trombetta","Leonardo G.",""]]}
{"id":"2308.07300","submitter":"Tommaso Maria Botta","authors":"Tommaso Maria Botta, Richard Rimanyi","title":"Bow varieties: Stable envelopes and their 3d mirror symmetry","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math-ph math.MP math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we study the elliptic characteristic classes known as ''stable\nenvelopes'', which were introduced by M. Aganagic and A. Okounkov. We prove\nthat for a rich class of holomorphic symplectic\nvarieties$\\unicode{x2013}$called Cherkis bow varieties$\\unicode{x2013}$their\nelliptic stable envelopes exhibit a duality property inspired by mirror\nsymmetry in $d=3$, $\\mathcal N=4$ quantum field theories. A crucial step of our\nproof involves the process of ''resolving'' large charge branes into multiple\nsmaller charge branes. This phenomenon turns out to be the geometric\ncounterpart of the algebraic fusion procedure. Along the way we discover\nvarious new features in the geometry of bow varieties.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:37:46 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Botta","Tommaso Maria",""],["Rimanyi","Richard",""]]}
{"id":"2308.07301","submitter":"Esteve Valls Mascar\\'o","authors":"Esteve Valls Mascaro, Hyemin Ahn, Dongheui Lee","title":"A Unified Masked Autoencoder with Patchified Skeletons for Motion\n  Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The synthesis of human motion has traditionally been addressed through\ntask-dependent models that focus on specific challenges, such as predicting\nfuture motions or filling in intermediate poses conditioned on known key-poses.\nIn this paper, we present a novel task-independent model called UNIMASK-M,\nwhich can effectively address these challenges using a unified architecture.\nOur model obtains comparable or better performance than the state-of-the-art in\neach field. Inspired by Vision Transformers (ViTs), our UNIMASK-M model\ndecomposes a human pose into body parts to leverage the spatio-temporal\nrelationships existing in human motion. Moreover, we reformulate various\npose-conditioned motion synthesis tasks as a reconstruction problem with\ndifferent masking patterns given as input. By explicitly informing our model\nabout the masked joints, our UNIMASK-M becomes more robust to occlusions.\nExperimental results show that our model successfully forecasts human motion on\nthe Human3.6M dataset. Moreover, it achieves state-of-the-art results in motion\ninbetweening on the LaFAN1 dataset, particularly in long transition periods.\nMore information can be found on the project website\nhttps://sites.google.com/view/estevevallsmascaro/publications/unimask-m.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:39:44 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mascaro","Esteve Valls",""],["Ahn","Hyemin",""],["Lee","Dongheui",""]]}
{"id":"2308.07302","submitter":"Fabio Pasqualetti","authors":"Yuzhen Qin, Alberto Maria Nobili, Danielle S. Bassett, Fabio\n  Pasqualetti","title":"Vibrational Stabilization of Cluster Synchronization in Oscillator\n  Networks","comments":"Submitted to Open Journal of Control Systems","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":"  Cluster synchronization is of paramount importance for the normal functioning\nof numerous technological and natural systems. Deviations from normal cluster\nsynchronization patterns are closely associated with various malfunctions, such\nas neurological disorders in the brain. Therefore, it is crucial to restore\nnormal system functions by stabilizing the appropriate cluster synchronization\npatterns. Most existing studies focus on designing controllers based on state\nmeasurements to achieve system stabilization. However, in many real-world\nscenarios, measuring system states, such as neuronal activity in the brain,\nposes significant challenges, rendering the stabilization of such systems\ndifficult. To overcome this challenge, in this paper, we employ an open-loop\ncontrol strategy, vibrational control, which does not requires any state\nmeasurements. We establish some sufficient conditions under which vibrational\ninputs stabilize cluster synchronization. Further, we provide a tractable\napproach to design vibrational control. Finally, numerical experiments are\nconducted to demonstrate our theoretical findings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:41:58 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Qin","Yuzhen",""],["Nobili","Alberto Maria",""],["Bassett","Danielle S.",""],["Pasqualetti","Fabio",""]]}
{"id":"2308.07303","submitter":"Pierre-Fran\\c{c}ois Rodriguez","authors":"Hugo Duminil-Copin, Subhajit Goswami, Pierre-Fran\\c{c}ois Rodriguez,\n  Franco Severo and Augusto Teixeira","title":"Finite range interlacements and couplings","comments":"67 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we consider the interlacement set $\\mathcal{I}^u$ at level\n$u>0$ on $\\mathbb{Z}^d$, $d \\geq3$, and its finite range version\n$\\mathcal{I}^{u,L}$ for $L >0$, given by the union of the ranges of a Poisson\ncloud of random walks on $\\mathbb{Z}^d$ having intensity $u/L$ and killed after\n$L$ steps. As $L\\to \\infty$, the random set $\\mathcal{I}^{u,L}$ has a\nnon-trivial (local) limit, which is precisely $\\mathcal{I}^u$. A natural\nquestion is to understand how the sets $\\mathcal{I}^{u,L}$ and\n$\\mathcal{I}^{{u}}$ can be related, if at all, in such a way that their\nintersections with a box of large radius $R$ almost coincide. We address this\nquestion, which depends sensitively on $R$, by developing couplings allowing\nfor a similar comparison to hold with very high probability for\n$\\mathcal{I}^{u,L}$ and $\\mathcal{I}^{{u'},2L}$, with $u' \\approx u$. In\nparticular, for the vacant set $\\mathcal{V}^u=\\mathbb{Z}^d \\setminus\n\\mathcal{I}^u$ with values of $u$ near the critical threshold, our couplings\nremain effective at scales $R \\gg \\sqrt{L}$, which corresponds to a natural\nbarrier across which the walks of length $L$ comprised in $\\mathcal{I}^{u,L}$\nde-solidify inside $B_R$, i.e. lose their intrinsic long-range structure to\nbecome increasingly \"dust-like\". These mechanisms are complementary to the\nsolidification effects recently exhibited in arXiv:1706.07229. By iterating the\nresulting couplings over dyadic scales $L$, the models $\\mathcal{I}^{u,L}$ are\nseen to constitute a stationary finite range approximation of $\\mathcal{I}^u$\nat large spatial scales near the critical point $u_*$. Among others, these\ncouplings are important ingredients for the characterization of the phase\ntransition for percolation of the vacant sets of random walk and random\ninterlacements in two upcoming companion articles.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:42:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Duminil-Copin","Hugo",""],["Goswami","Subhajit",""],["Rodriguez","Pierre-Fran\u00e7ois",""],["Severo","Franco",""],["Teixeira","Augusto",""]]}
{"id":"2308.07304","submitter":"Ismat Jarin","authors":"Ismat Jarin, Yu Duan, Rahmadi Trimananda, Hao Cui, Salma Elmalaki,\n  Athina Markopoulou","title":"BehaVR: User Identification Based on VR Sensor Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Virtual reality (VR) platforms enable a wide range of applications, however\npose unique privacy risks. In particular, VR devices are equipped with a rich\nset of sensors that collect personal and sensitive information (e.g., body\nmotion, eye gaze, hand joints, and facial expression), which can be used to\nuniquely identify a user, even without explicit identifiers. In this paper, we\nare interested in understanding the extent to which a user can be identified\nbased on data collected by different VR sensors. We consider adversaries with\ncapabilities that range from observing APIs available within a single VR app\n(app adversary) to observing all, or selected, sensor measurements across all\napps on the VR device (device adversary). To that end, we introduce BEHAVR, a\nframework for collecting and analyzing data from all sensor groups collected by\nall apps running on a VR device. We use BEHAVR to perform a user study and\ncollect data from real users that interact with popular real-world apps. We use\nthat data to build machine learning models for user identification, with\nfeatures extracted from sensor data available within and across apps. We show\nthat these models can identify users with an accuracy of up to 100%, and we\nreveal the most important features and sensor groups, depending on the\nfunctionality of the app and the strength of the adversary, as well as the\nminimum time needed for user identification. To the best of our knowledge,\nBEHAVR is the first to analyze user identification in VR comprehensively, i.e.,\nconsidering jointly all sensor measurements available on a VR device (whether\nwithin an app or across multiple apps), collected by real-world, as opposed to\ncustom-made, apps.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:43:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Jarin","Ismat",""],["Duan","Yu",""],["Trimananda","Rahmadi",""],["Cui","Hao",""],["Elmalaki","Salma",""],["Markopoulou","Athina",""]]}
{"id":"2308.07305","submitter":"Tharindu Kumarage","authors":"Tharindu Kumarage and Huan Liu","title":"Neural Authorship Attribution: Stylometric Analysis on Large Language\n  Models","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":"  Large language models (LLMs) such as GPT-4, PaLM, and Llama have\nsignificantly propelled the generation of AI-crafted text. With rising concerns\nabout their potential misuse, there is a pressing need for AI-generated-text\nforensics. Neural authorship attribution is a forensic effort, seeking to trace\nAI-generated text back to its originating LLM. The LLM landscape can be divided\ninto two primary categories: proprietary and open-source. In this work, we\ndelve into these emerging categories of LLMs, focusing on the nuances of neural\nauthorship attribution. To enrich our understanding, we carry out an empirical\nanalysis of LLM writing signatures, highlighting the contrasts between\nproprietary and open-source models, and scrutinizing variations within each\ngroup. By integrating stylometric features across lexical, syntactic, and\nstructural aspects of language, we explore their potential to yield\ninterpretable results and augment pre-trained language model-based classifiers\nutilized in neural authorship attribution. Our findings, based on a range of\nstate-of-the-art LLMs, provide empirical insights into neural authorship\nattribution, paving the way for future investigations aimed at mitigating the\nthreats posed by AI-generated misinformation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:46:52 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Kumarage","Tharindu",""],["Liu","Huan",""]]}
{"id":"2308.07306","submitter":"Emilio Ceccotti","authors":"E. Ceccotti, A. R. Offringa, L. V. E. Koopmans, R. Timmerman, S. A.\n  Brackenhoff, B. K. Gehlot, F. G. Mertens, S. Munshi, V. N. Pandey, R. J. van\n  Weeren, S. Yatawatta, S. Zaroubi","title":"A novel radio imaging method for physical spectral index modelling","comments":"17 pages, 9 figures, 5 tables. Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new method, called \"forced-spectrum fitting\", for\nphysically-based spectral modelling of radio sources during deconvolution. This\nimproves upon current common deconvolution fitting methods, which often produce\ninaccurate spectra. Our method uses any pre-existing spectral index map to\nassign spectral indices to each model component cleaned during the\nmulti-frequency deconvolution of WSClean, where the pre-determined spectrum is\nfitted. The component magnitude is evaluated by performing a modified weighted\nlinear least-squares fit. We test this method on a simulated LOFAR-HBA\nobservation of the 3C196 QSO and a real LOFAR-HBA observation of the 4C+55.16\nFRI galaxy. We compare the results from the forced-spectrum fitting with\ntraditional joined-channel deconvolution using polynomial fitting. Because no\nprior spectral information was available for 4C+55.16, we demonstrate a method\nfor extracting spectral indices in the observed frequency band using\n\"clustering\". The models generated by the forced-spectrum fitting are used to\nimprove the calibration of the datasets. The final residuals are comparable to\nexisting multi-frequency deconvolution methods, but the output model agrees\nwith the provided spectral index map, embedding correct spectral information.\nWhile forced-spectrum fitting does not solve the determination of the spectral\ninformation itself, it enables the construction of accurate multi-frequency\nmodels that can be used for wide-band calibration and subtraction.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:49:57 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Ceccotti","E.",""],["Offringa","A. R.",""],["Koopmans","L. V. E.",""],["Timmerman","R.",""],["Brackenhoff","S. A.",""],["Gehlot","B. K.",""],["Mertens","F. G.",""],["Munshi","S.",""],["Pandey","V. N.",""],["van Weeren","R. J.",""],["Yatawatta","S.",""],["Zaroubi","S.",""]]}
{"id":"2308.07307","submitter":"Yuhe Nie","authors":"Yuhe Nie, Shaoming Zheng, Zhan Zhuang, Xuan Song","title":"Extend Wave Function Collapse to Large-Scale Content Generation","comments":"This paper is accepted by IEEE Conference on Games 2023 (nomination\n  of the Best Paper Award)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wave Function Collapse (WFC) is a widely used tile-based algorithm in\nprocedural content generation, including textures, objects, and scenes.\nHowever, the current WFC algorithm and related research lack the ability to\ngenerate commercialized large-scale or infinite content due to constraint\nconflict and time complexity costs. This paper proposes a Nested WFC (N-WFC)\nalgorithm framework to reduce time complexity. To avoid conflict and\nbacktracking problems, we offer a complete and sub-complete tileset preparation\nstrategy, which requires only a small number of tiles to generate aperiodic and\ndeterministic infinite content. We also introduce the weight-brush system that\ncombines N-WFC and sub-complete tileset, proving its suitability for game\ndesign. Our contribution addresses WFC's challenge in massive content\ngeneration and provides a theoretical basis for implementing concrete games.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:50:38 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Nie","Yuhe",""],["Zheng","Shaoming",""],["Zhuang","Zhan",""],["Song","Xuan",""]]}
{"id":"2308.07308","submitter":"Alec Helbling","authors":"Alec Helbling, Mansi Phute, Matthew Hull and Duen Horng Chau","title":"LLM Self Defense: By Self Examination, LLMs Know They Are Being Tricked","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 skyrocketed in popularity in recent years\ndue to their ability to generate high-quality text in response to human\nprompting. However, these models have been shown to have the potential to\ngenerate harmful content in response to user prompting (e.g., giving users\ninstructions on how to commit crimes). There has been a focus in the literature\non mitigating these risks, through methods like aligning models with human\nvalues through reinforcement learning. However, it has been shown that even\naligned language models are susceptible to adversarial attacks that bypass\ntheir restrictions on generating harmful text. We propose a simple approach to\ndefending against these attacks by having a large language model filter its own\nresponses. Our current results show that even if a model is not fine-tuned to\nbe aligned with human values, it is possible to stop it from presenting harmful\ncontent to users by validating the content using a language model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:54:10 GMT"},{"version":"v2","created":"Tue, 15 Aug 2023 01:33:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Helbling","Alec",""],["Phute","Mansi",""],["Hull","Matthew",""],["Chau","Duen Horng",""]]}
{"id":"2308.07309","submitter":"Yathin Kethepalli","authors":"Yathin Kethepalli, Rony Joseph, Sai Raja Vajrala, Jashwanth Vemula,\n  Nenavath Srinivas Naik","title":"Reinforcing Security and Usability of Crypto-Wallet with Post-Quantum\n  Cryptography and Zero-Knowledge Proof","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Crypto-wallets or digital asset wallets are a crucial aspect of managing\ncryptocurrencies and other digital assets such as NFTs. However, these wallets\nare not immune to security threats, particularly from the growing risk of\nquantum computing. The use of traditional public-key cryptography systems in\ndigital asset wallets makes them vulnerable to attacks from quantum computers,\nwhich may increase in the future. Moreover, current digital wallets require\nusers to keep track of seed-phrases, which can be challenging and lead to\nadditional security risks. To overcome these challenges, a new algorithm is\nproposed that uses post-quantum cryptography (PQC) and zero-knowledge proof\n(ZKP) to enhance the security of digital asset wallets. The research focuses on\nthe use of the Lattice-based Threshold Secret Sharing Scheme (LTSSS), Kyber\nAlgorithm for key generation and ZKP for wallet unlocking, providing a more\nsecure and user-friendly alternative to seed-phrase, brain and multi-sig\nprotocol wallets. This algorithm also includes several innovative security\nfeatures such as recovery of wallets in case of downtime of the server, and the\nability to rekey the private key associated with a specific username-password\ncombination, offering improved security and usability. The incorporation of PQC\nand ZKP provides a robust and comprehensive framework for securing digital\nassets in the present and future. This research aims to address the security\nchallenges faced by digital asset wallets and proposes practical solutions to\nensure their safety in the era of quantum computing.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:54:20 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 07:41:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kethepalli","Yathin",""],["Joseph","Rony",""],["Vajrala","Sai Raja",""],["Vemula","Jashwanth",""],["Naik","Nenavath Srinivas",""]]}
{"id":"2308.07310","submitter":"Kazuya Mameda","authors":"Kazuya Mameda, Keiya Takizawa","title":"Deconfinement transition in the revolving bag model","comments":"6 pages","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on the bag model, we revisit the deconfinement phase transition under\nrotation. On top of the usual rotational energy for noninteracting particles,\nwe perturbatively analyze the revolution effect of the hadron bag, i.e., of the\npotential confining quarks. The revolution effect can be phenomenologically\ntranslated into the rotational correction to the QCD vacuum energy or the gluon\ncondensate. We demonstrate that if the revolution effect is (is not) taken into\naccount, the transition temperature increases (decreases) as the angular\nvelocity increased. The `revolving bag model' provides a feasible explanation\nof the recent lattice simulations, contrary to effective models, showing that\nrotation favors the confined phase.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:54:42 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Mameda","Kazuya",""],["Takizawa","Keiya",""]]}
{"id":"2308.07311","submitter":"Cameron Owen","authors":"Cameron J. Owen, Yu Xie, Anders Johansson, Lixin Sun, Boris Kozinsky","title":"Stability, mechanisms and kinetics of emergence of Au surface\n  reconstructions using Bayesian force fields","comments":"Main: 17 pages, 7 figures, 1 table. SI: 9 pages, 15 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Metal surfaces have long been known to reconstruct, significantly influencing\ntheir structural and catalytic properties. Many key mechanistic aspects of\nthese subtle transformations remain poorly understood due to limitations of\nprevious simulation approaches. Using active learning of Bayesian\nmachine-learned force fields trained from ab initio calculations, we enable\nlarge-scale molecular dynamics simulations to describe the thermodynamics and\ntime evolution of the low-index mesoscopic surface reconstructions of Au (e.g.,\nthe Au(111)-`Herringbone,' Au(110)-(1$\\times$2)-`Missing-Row,' and\nAu(100)-`Quasi-Hexagonal' reconstructions). This capability yields direct\natomistic understanding of the dynamic emergence of these surface states from\ntheir initial facets, providing previously inaccessible information such as\nnucleation kinetics and a complete mechanistic interpretation of reconstruction\nunder the effects of strain and local deviations from the original\nstoichiometry. We successfully reproduce previous experimental observations of\nreconstructions on pristine surfaces and provide quantitative predictions of\nthe emergence of spinodal decomposition and localized reconstruction in\nresponse to strain at non-ideal stoichiometries. A unified mechanistic\nexplanation is presented of the kinetic and thermodynamic factors driving\nsurface reconstruction. Furthermore, we study surface reconstructions on Au\nnanoparticles, where characteristic (111) and (100) reconstructions\nspontaneously appear on a variety of high-symmetry particle morphologies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:55:07 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Owen","Cameron J.",""],["Xie","Yu",""],["Johansson","Anders",""],["Sun","Lixin",""],["Kozinsky","Boris",""]]}
{"id":"2308.07312","submitter":"Sudeshna Bhattacharjee","authors":"M\\'arton Bal\\'azs, Riddhipratim Basu, Sudeshna Bhattacharjee","title":"Geodesic trees in last passage percolation and some related problems","comments":"44 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the exactly solvable model of exponential last passage percolation on\n$\\mathbb{Z}^2$, it is known that given any non-axial direction, all the\nsemi-infinite geodesics starting from points in $\\mathbb{Z}^2$ in that\ndirection almost surely coalesce, thereby forming a geodesic tree which has\nonly one end. It is widely understood that the geodesic trees are important\nobjects in understanding the geometry of the LPP landscape. In this paper we\nstudy several natural questions about these geodesic trees and their\nintersections. In particular, we obtain optimal (up to constants) upper and\nlower bounds for the (power law) tails of the height and the volume of the\nbackward sub-tree rooted at a fixed point. We also obtain bounds for the\nprobability that the sub-tree contains a specific vertex, e.g. the sub-tree in\nthe direction $(1,1)$ rooted at the origin contains the vertex $-(n,n)$, which\nanswers a question analogous to the well-known midpoint problem in the context\nof semi-infinite geodesics. Furthermore, we obtain bounds for the probability\nthat a pair of intersecting geodesics both pass through a given vertex. These\nresults are interesting in their own right as well as useful in several other\napplications.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:57:37 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Bal\u00e1zs","M\u00e1rton",""],["Basu","Riddhipratim",""],["Bhattacharjee","Sudeshna",""]]}
{"id":"2308.07313","submitter":"Huan Liu","authors":"Huan Liu, Qiang Chen, Zichang Tan, Jiang-Jiang Liu, Jian Wang, Xiangbo\n  Su, Xiaolong Li, Kun Yao, Junyu Han, Errui Ding, Yao Zhao, Jingdong Wang","title":"Group Pose: A Simple Baseline for End-to-End Multi-person Pose\n  Estimation","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":"  In this paper, we study the problem of end-to-end multi-person pose\nestimation. State-of-the-art solutions adopt the DETR-like framework, and\nmainly develop the complex decoder, e.g., regarding pose estimation as keypoint\nbox detection and combining with human detection in ED-Pose, hierarchically\npredicting with pose decoder and joint (keypoint) decoder in PETR. We present a\nsimple yet effective transformer approach, named Group Pose. We simply regard\n$K$-keypoint pose estimation as predicting a set of $N\\times K$ keypoint\npositions, each from a keypoint query, as well as representing each pose with\nan instance query for scoring $N$ pose predictions. Motivated by the intuition\nthat the interaction, among across-instance queries of different types, is not\ndirectly helpful, we make a simple modification to decoder self-attention. We\nreplace single self-attention over all the $N\\times(K+1)$ queries with two\nsubsequent group self-attentions: (i) $N$ within-instance self-attention, with\neach over $K$ keypoint queries and one instance query, and (ii) $(K+1)$\nsame-type across-instance self-attention, each over $N$ queries of the same\ntype. The resulting decoder removes the interaction among across-instance\ntype-different queries, easing the optimization and thus improving the\nperformance. Experimental results on MS COCO and CrowdPose show that our\napproach without human box supervision is superior to previous methods with\ncomplex decoders, and even is slightly better than ED-Pose that uses human box\nsupervision. $\\href{https://github.com/Michel-liu/GroupPose-Paddle}{\\rm\nPaddle}$ and $\\href{https://github.com/Michel-liu/GroupPose}{\\rm PyTorch}$ code\nare available.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:58:04 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Liu","Huan",""],["Chen","Qiang",""],["Tan","Zichang",""],["Liu","Jiang-Jiang",""],["Wang","Jian",""],["Su","Xiangbo",""],["Li","Xiaolong",""],["Yao","Kun",""],["Han","Junyu",""],["Ding","Errui",""],["Zhao","Yao",""],["Wang","Jingdong",""]]}
{"id":"2308.07314","submitter":"Yu-Ju Tsai","authors":"Yu-Ju Tsai, Yu-Lun Liu, Lu Qi, Kelvin C.K. Chan, Ming-Hsuan Yang","title":"Dual Associated Encoder for Face Restoration","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Restoring facial details from low-quality (LQ) images has remained a\nchallenging problem due to its ill-posedness induced by various degradations in\nthe wild. The existing codebook prior mitigates the ill-posedness by leveraging\nan autoencoder and learned codebook of high-quality (HQ) features, achieving\nremarkable quality. However, existing approaches in this paradigm frequently\ndepend on a single encoder pre-trained on HQ data for restoring HQ images,\ndisregarding the domain gap between LQ and HQ images. As a result, the encoding\nof LQ inputs may be insufficient, resulting in suboptimal performance. To\ntackle this problem, we propose a novel dual-branch framework named DAEFR. Our\nmethod introduces an auxiliary LQ branch that extracts crucial information from\nthe LQ inputs. Additionally, we incorporate association training to promote\neffective synergy between the two branches, enhancing code prediction and\noutput quality. We evaluate the effectiveness of DAEFR on both synthetic and\nreal-world datasets, demonstrating its superior performance in restoring facial\ndetails.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:58:33 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Tsai","Yu-Ju",""],["Liu","Yu-Lun",""],["Qi","Lu",""],["Chan","Kelvin C. K.",""],["Yang","Ming-Hsuan",""]]}
{"id":"2308.07315","submitter":"Laurence Mayther","authors":"Laurence H. Mayther","title":"Unboundedness above of the Hitchin functional on $\\mathrm{G}_2$ 3-forms\n  and associated collapsing results","comments":"38 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 uses scaling arguments to prove the unboundedness above of the\nHitchin functional on closed $\\mathrm{G}_2$ 3-forms for two explicit closed\n7-manifolds. The first manifold is the product $X \\times S^1$ (where $X$ is the\nNakamura manifold constructed by de Bartolomeis-Tomassini) equipped with a\n4-dimensional family of closed $\\mathrm{G}_2$ 3-forms and is inspired by a\nshort paper of Fern\\'{a}ndez. The second is the manifold recently constructed\nby Fern\\'{a}ndez-Fino-Kovalev-Mu\\~{n}oz. In the latter example, careful\nresolution of singularities is required, in order to ensure that the rescaled\nforms are cohomologically constant. By combining suitable geometric estimates\nwith a general collapsing theorem for orbifolds recently obtained by the\nauthor, explicit descriptions of the large volume limits of both manifolds are\nalso obtained. The proofs in this paper are notable for not requiring explicit\nsolution of the Laplacian flow evolution PDE for closed\n$\\mathrm{G}_2$-structures, thereby allowing treatment of manifolds which lack\nthe high degree of symmetry generally required for Laplacian flow to be\nexplicitly soluble.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:59:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mayther","Laurence H.",""]]}
{"id":"2308.07316","submitter":"Alexander Martin","authors":"Alexander Martin and Haitian Zheng and Jie An and Jiebo Luo","title":"Jurassic World Remake: Bringing Ancient Fossils Back to Life via\n  Zero-Shot Long Image-to-Image Translation","comments":"9 pages, 10 figures, ACM Multimedia 2023","journal-ref":null,"doi":"10.1145/3581783.3612708","report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With a strong understanding of the target domain from natural language, we\nproduce promising results in translating across large domain gaps and bringing\nskeletons back to life. In this work, we use text-guided latent diffusion\nmodels for zero-shot image-to-image translation (I2I) across large domain gaps\n(longI2I), where large amounts of new visual features and new geometry need to\nbe generated to enter the target domain. Being able to perform translations\nacross large domain gaps has a wide variety of real-world applications in\ncriminology, astrology, environmental conservation, and paleontology. In this\nwork, we introduce a new task Skull2Animal for translating between skulls and\nliving animals. On this task, we find that unguided Generative Adversarial\nNetworks (GANs) are not capable of translating across large domain gaps.\nInstead of these traditional I2I methods, we explore the use of guided\ndiffusion and image editing models and provide a new benchmark model,\nRevive-2I, capable of performing zero-shot I2I via text-prompting latent\ndiffusion models. We find that guidance is necessary for longI2I because, to\nbridge the large domain gap, prior knowledge about the target domain is needed.\nIn addition, we find that prompting provides the best and most scalable\ninformation about the target domain as classifier-guided diffusion models\nrequire retraining for specific use cases and lack stronger constraints on the\ntarget domain because of the wide variety of images they are trained on.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:59:31 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Martin","Alexander",""],["Zheng","Haitian",""],["An","Jie",""],["Luo","Jiebo",""]]}
{"id":"2308.07317","submitter":"Ariel N. Lee","authors":"Ariel N. Lee, Cole J. Hunter, Nataniel Ruiz","title":"Platypus: Quick, Cheap, and Powerful Refinement of LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present $\\textbf{Platypus}$, a family of fine-tuned and merged Large\nLanguage Models (LLMs) that achieves the strongest performance and currently\nstands at first place in HuggingFace's Open LLM Leaderboard as of the release\ndate of this work. In this work we describe (1) our curated dataset\n$\\textbf{Open-Platypus}$, that is a subset of other open datasets and which\n$\\textit{we release to the public}$ (2) our process of fine-tuning and merging\nLoRA modules in order to conserve the strong prior of pretrained LLMs, while\nbringing specific domain knowledge to the surface (3) our efforts in checking\nfor test data leaks and contamination in the training data, which can inform\nfuture research. Specifically, the Platypus family achieves strong performance\nin quantitative LLM metrics across model sizes, topping the global Open LLM\nleaderboard while using just a fraction of the fine-tuning data and overall\ncompute that are required for other state-of-the-art fine-tuned LLMs. In\nparticular, a 13B Platypus model can be trained on $\\textit{a single}$ A100 GPU\nusing 25k questions in 5 hours. This is a testament of the quality of our\nOpen-Platypus dataset, and opens opportunities for more improvements in the\nfield. Project page: https://platypus-llm.github.io\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:59:56 GMT"}],"update_date":"2023-08-15","authors_parsed":[["Lee","Ariel N.",""],["Hunter","Cole J.",""],["Ruiz","Nataniel",""]]}
{"id":"2308.07324","submitter":"Anton Vasiliuk","authors":"Anton Vasiliuk and Daria Frolova and Mikhail Belyaev and Boris\n  Shirokikh","title":"Redesigning Out-of-Distribution Detection on 3D Medical Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting out-of-distribution (OOD) samples for trusted medical image\nsegmentation remains a significant challenge. The critical issue here is the\nlack of a strict definition of abnormal data, which often results in artificial\nproblem settings without measurable clinical impact. In this paper, we redesign\nthe OOD detection problem according to the specifics of volumetric medical\nimaging and related downstream tasks (e.g., segmentation). We propose using the\ndownstream model's performance as a pseudometric between images to define\nabnormal samples. This approach enables us to weigh different samples based on\ntheir performance impact without an explicit ID/OOD distinction. We incorporate\nthis weighting in a new metric called Expected Performance Drop (EPD). EPD is\nour core contribution to the new problem design, allowing us to rank methods\nbased on their clinical impact. We demonstrate the effectiveness of EPD-based\nevaluation in 11 CT and MRI OOD detection challenges.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 10:28:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vasiliuk","Anton",""],["Frolova","Daria",""],["Belyaev","Mikhail",""],["Shirokikh","Boris",""]]}
{"id":"2308.07325","submitter":"Rossella Aversa Dr.","authors":"Mehrdad Jalali, Matthias Mail, Rossella Aversa, and Christian K\\\"ubel","title":"MSLE: An ontology for Materials Science Laboratory Equipment.\n  Large-Scale Devices for Materials Characterization","comments":"Submitted to Materials Today Communication","journal-ref":"Mater. Today Commun. 35 (2023) 105532","doi":"10.1016/j.mtcomm.2023.105532","report-no":null,"categories":"cs.AI cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper introduces a new ontology for Materials Science Laboratory\nEquipment, termed MSLE. A fundamental issue with materials science laboratory\n(hereafter lab) equipment in the real world is that scientists work with\nvarious types of equipment with multiple specifications. For example, there are\nmany electron microscopes with different parameters in chemical and physical\nlabs. A critical development to unify the description is to build an equipment\ndomain ontology as basic semantic knowledge and to guide the user to work with\nthe equipment appropriately. Here, we propose to develop a consistent ontology\nfor equipment, the MSLE ontology. In the MSLE, two main existing ontologies,\nthe Semantic Sensor Network (SSN) and the Material Vocabulary (MatVoc), have\nbeen integrated into the MSLE core to build a coherent ontology. Since various\nacronyms and terms have been used for equipment, this paper proposes an\napproach to use a Simple Knowledge Organization System (SKOS) to represent the\nhierarchical structure of equipment terms. Equipment terms were collected in\nvarious languages and abbreviations and coded into the MSLE using the SKOS\nmodel. The ontology development was conducted in close collaboration with\ndomain experts and focused on the large-scale devices for materials\ncharacterization available in our research group. Competency questions are\nexpected to be addressed through the MSLE ontology. Constraints are modeled in\nthe Shapes Query Language (SHACL); a prototype is shown and validated to show\nthe value of the modeling constraints.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 12:39:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jalali","Mehrdad",""],["Mail","Matthias",""],["Aversa","Rossella",""],["K\u00fcbel","Christian",""]]}
{"id":"2308.07326","submitter":"David Noever","authors":"David Noever and Sam Hyams","title":"AI Text-to-Behavior: A Study In Steerability","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 research explores the steerability of Large Language Models (LLMs),\nparticularly OpenAI's ChatGPT iterations. By employing a behavioral psychology\nframework called OCEAN (Openness, Conscientiousness, Extroversion,\nAgreeableness, Neuroticism), we quantitatively gauged the model's\nresponsiveness to tailored prompts. When asked to generate text mimicking an\nextroverted personality, OCEAN scored the language alignment to that behavioral\ntrait. In our analysis, while \"openness\" presented linguistic ambiguity,\n\"conscientiousness\" and \"neuroticism\" were distinctly evoked in the OCEAN\nframework, with \"extroversion\" and \"agreeableness\" showcasing a notable overlap\nyet distinct separation from other traits. Our findings underscore GPT's\nversatility and ability to discern and adapt to nuanced instructions.\nFurthermore, historical figure simulations highlighted the LLM's capacity to\ninternalize and project instructible personas, precisely replicating their\nphilosophies and dialogic styles. However, the rapid advancements in LLM\ncapabilities and the opaque nature of some training techniques make metric\nproposals degrade rapidly. Our research emphasizes a quantitative role to\ndescribe steerability in LLMs, presenting both its promise and areas for\nfurther refinement in aligning its progress to human intentions.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 18:14:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Noever","David",""],["Hyams","Sam",""]]}
{"id":"2308.07327","submitter":"Juho Kim","authors":"Juho Kim","title":"PokerKit: A Comprehensive Python Library for Fine-Grained Multi-Variant\n  Poker Game Simulations","comments":"6 pages, 1 figure, submission to IEEE Transactions on Games","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  PokerKit is an open-source Python library designed to overcome the\nrestrictions of existing poker game simulation and hand evaluation tools, which\ntypically support only a handful of poker variants and lack flexibility in game\nstate control. In contrast, PokerKit significantly expands this scope by\nsupporting an extensive array of poker variants and it provides a flexible\narchitecture for users to define their custom games. This paper details the\ndesign and implementation of PokerKit, including its intuitive programmatic\nAPI, multi-variant game support, and a unified hand evaluation suite across\ndifferent hand types. The flexibility of PokerKit allows for applications in\ndiverse areas, such as poker AI development, tool creation, and online poker\ncasino implementation. PokerKit's reliability has been established through\nstatic type checking, extensive doctests, and unit tests, achieving 97\\% code\ncoverage. The introduction of PokerKit represents a significant contribution to\nthe field of computer poker, fostering future research and advanced AI\ndevelopment for a wide variety of poker games.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 13:54:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kim","Juho",""]]}
{"id":"2308.07328","submitter":"Yong-Hui Xia","authors":"Yuchao He, Yongli Song, Yonghui Xia","title":"Steady periodic irrotational blood flow with time-dependent body force","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 study steady 2D periodic blood flow propagating along blood\nvessels with free boundary conditions. In particular, we focus on the dynamic\nbehavior of irrotational flows with time dependent body force. An equivalent\nformulation with fix boundary is developed by utilizing flow force functions.\nThe local bifurcation result is obtained by Crandall-Rabinowitz theorem. The\nexistence of a local $C^1$-curve of small-amplitude solution is strictly\nproved.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:11:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["He","Yuchao",""],["Song","Yongli",""],["Xia","Yonghui",""]]}
{"id":"2308.07329","submitter":"Avish Buramdoyal","authors":"Avish Buramdoyal, Tim Gebbie","title":"Variations on the Reinforcement Learning performance of Blackjack","comments":"12 pages, 15 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG q-fin.TR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blackjack or \"21\" is a popular card-based game of chance and skill. The\nobjective of the game is to win by obtaining a hand total higher than the\ndealer's without exceeding 21. The ideal blackjack strategy will maximize\nfinancial return in the long run while avoiding gambler's ruin. The stochastic\nenvironment and inherent reward structure of blackjack presents an appealing\nproblem to better understand reinforcement learning agents in the presence of\nenvironment variations. Here we consider a q-learning solution for optimal play\nand investigate the rate of learning convergence of the algorithm as a function\nof deck size. A blackjack simulator allowing for universal blackjack rules is\nalso implemented to demonstrate the extent to which a card counter perfectly\nusing the basic strategy and hi-lo system can bring the house to bankruptcy and\nhow environment variations impact this outcome. The novelty of our work is to\nplace this conceptual understanding of the impact of deck size in the context\nof learning agent convergence.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 13:38:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Buramdoyal","Avish",""],["Gebbie","Tim",""]]}
{"id":"2308.07330","submitter":"Charles Fisher","authors":"Charles K. Fisher","title":"A Rule of Thumb for the Power Gain due to Covariate Adjustment in\n  Randomized Controlled Trials with Continuous Outcomes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Randomized Controlled Trials (RCTs) often adjust for baseline covariates in\norder to increase power. This technical note provides a short derivation of a\nsimple rule of thumb for approximating the ratio of the power of an adjusted\nanalysis to that of an unadjusted analysis. Specifically, if the unadjusted\nanalysis is powered to approximately 80\\%, then the ratio of the power of the\nadjusted analysis to the power of the unadjusted analysis is approximately $1 +\n\\frac{1}{2} R^2$, where $R$ is the correlation between the baseline covariate\nand the outcome.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 18:25:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fisher","Charles K.",""]]}
{"id":"2308.07331","submitter":"Yoshimasa Kurihara","authors":"Yoshimasa Kurihara","title":"Green's function in general relativity","comments":"20 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report provides Green's functions (classical propagators) of\ngravitational fields of vierbein and spin-connection in general relativity. The\nexistence of Green's function of the Laplace operator in curved space with an\nindefinite metric is ensured owing to the Hodge harmonic analysis. The\nanalyticity of Green's function is naturally determined intrinsically, keeping\na causality. This report proposed a novel definition of the momentum space in\ncurved space-time and the linearisation of the Einstein equation as a free\nfield consistent with that for the Yang-Mills gauge field. The proposed\nlinearisation does not utilize the weak-field approximation; thus, the method\napplies to highly caved space-time. We gave two examples of Green's function of\ngravitational fields, the plane wave solution and the Schwarzschild solution.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:37:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kurihara","Yoshimasa",""]]}
{"id":"2308.07332","submitter":"Stephan Mennicke","authors":"D\\\"orthe Arndt and Stephan Mennicke","title":"Notation3 as an Existential Rule Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Notation3 Logic (\\nthree) is an extension of RDF that allows the user to\nwrite rules introducing new blank nodes to RDF graphs. Many applications (e.g.,\nontology mapping) rely on this feature as blank nodes -- used directly or in\nauxiliary constructs -- are omnipresent on the Web. However, the number of fast\n\\nthree reasoners covering this very important feature of the logic is rather\nlimited. On the other hand, there are engines like VLog or Nemo which do not\ndirectly support Semantic Web rule formats but which are developed and\noptimized for very similar constructs: existential rules. In this paper, we\ninvestigate the relation between \\nthree rules with blank nodes in their heads\nand existential rules. We identify a subset of \\nthree which can be mapped\ndirectly to existential rules and define such a mapping preserving the\nequivalence of \\nthree formulae. In order to also illustrate that in some cases\n\\nthree reasoning could benefit from our translation, we then employ this\nmapping in an implementation to compare the performance of the \\nthree\nreasoners EYE and cwm to VLog and Nemo on \\nthree rules and their mapped\ncounterparts. Our tests show that the existential rule reasoners perform\nparticularly well for use cases containing many facts while especially the EYE\nreasoner is very fast when dealing with a high number of dependent rules. We\nthus provide a tool enabling the Semantic Web community to directly use\nexisting and future existential rule reasoners and benefit from the findings of\nthis active community.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:41:01 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Arndt","D\u00f6rthe",""],["Mennicke","Stephan",""]]}
{"id":"2308.07333","submitter":"Sheeba Samuel","authors":"Sheeba Samuel, Daniel Mietchen","title":"Computational reproducibility of Jupyter notebooks from biomedical\n  publications","comments":"arXiv admin note: substantial text overlap with arXiv:2209.04308","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Jupyter notebooks facilitate the bundling of executable code with its\ndocumentation and output in one interactive environment, and they represent a\npopular mechanism to document and share computational workflows. The\nreproducibility of computational aspects of research is a key component of\nscientific reproducibility but has not yet been assessed at scale for Jupyter\nnotebooks associated with biomedical publications. We address computational\nreproducibility at two levels: First, using fully automated workflows, we\nanalyzed the computational reproducibility of Jupyter notebooks related to\npublications indexed in PubMed Central. We identified such notebooks by mining\nthe articles full text, locating them on GitHub and re-running them in an\nenvironment as close to the original as possible. We documented reproduction\nsuccess and exceptions and explored relationships between notebook\nreproducibility and variables related to the notebooks or publications. Second,\nthis study represents a reproducibility attempt in and of itself, using\nessentially the same methodology twice on PubMed Central over two years. Out of\n27271 notebooks from 2660 GitHub repositories associated with 3467 articles,\n22578 notebooks were written in Python, including 15817 that had their\ndependencies declared in standard requirement files and that we attempted to\nre-run automatically. For 10388 of these, all declared dependencies could be\ninstalled successfully, and we re-ran them to assess reproducibility. Of these,\n1203 notebooks ran through without any errors, including 879 that produced\nresults identical to those reported in the original notebook and 324 for which\nour results differed from the originally reported ones. Running the other\nnotebooks resulted in exceptions. We zoom in on common problems, highlight\ntrends and discuss potential improvements to Jupyter-related workflows\nassociated with biomedical publications.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 01:39:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Samuel","Sheeba",""],["Mietchen","Daniel",""]]}
{"id":"2308.07334","submitter":"Mengmou Li","authors":"Mengmou Li, Taichi Tanaka, A. Daniel Carnerero, Yasuaki Wasa, Kenji\n  Hirata, Yasumasa Fujisaki, Yoshiaki Ushifusa, Takeshi Hatanaka","title":"Stochastic Optimal Investment Strategy for Net-Zero Energy Houses","comments":"Submitted to IET Renewable Power Generation","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN math.OC q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this research, we investigate Net-Zero Energy Houses (ZEH), which harness\nregionally produced electricity from photovoltaic(PV) panels and fuel cells,\nintegrating them into a local power system in pursuit of achieving carbon\nneutrality. This paper examines the impact of electricity sharing among users\nwho are working towards attaining ZEH status through the integration of PV\npanels and battery storage devices. We propose two potential scenarios: the\nfirst assumes that all users individually invest in storage devices, hence\nminimizing their costs on a local level without energy sharing; the second\nenvisions cost minimization through the collective use of a shared storage\ndevice, managed by a central manager. These two scenarios are formulated as a\nstochastic convex optimization and a cooperative game, respectively. To tackle\nthe stochastic challenges posed by multiple random variables, we apply the\nMonte Carlo sample average approximation (SAA) to the problems. To demonstrate\nthe practical applicability of these models, we implement the proposed\nscenarios in the Jono neighborhood in Kitakyushu, Japan.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 02:15:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Mengmou",""],["Tanaka","Taichi",""],["Carnerero","A. Daniel",""],["Wasa","Yasuaki",""],["Hirata","Kenji",""],["Fujisaki","Yasumasa",""],["Ushifusa","Yoshiaki",""],["Hatanaka","Takeshi",""]]}
{"id":"2308.07335","submitter":"Rajshekhar Bhat Vishweshwar","authors":"Akshay Kiran Jose, Gangadhar Karevvanavar, Rajshekhar V Bhat","title":"An Encoder-Decoder Approach for Packing Circles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.NE math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of packing smaller objects within a larger object has been of\ninterest since decades. In these problems, in addition to the requirement that\nthe smaller objects must lie completely inside the larger objects, they are\nexpected to not overlap or have minimum overlap with each other. Due to this,\nthe problem of packing turns out to be a non-convex problem, obtaining whose\noptimal solution is challenging. As such, several heuristic approaches have\nbeen used for obtaining sub-optimal solutions in general, and provably optimal\nsolutions for some special instances. In this paper, we propose a novel\nencoder-decoder architecture consisting of an encoder block, a perturbation\nblock and a decoder block, for packing identical circles within a larger\ncircle. In our approach, the encoder takes the index of a circle to be packed\nas an input and outputs its center through a normalization layer, the\nperturbation layer adds controlled perturbations to the center, ensuring that\nit does not deviate beyond the radius of the smaller circle to be packed, and\nthe decoder takes the perturbed center as input and estimates the index of the\nintended circle for packing. We parameterize the encoder and decoder by a\nneural network and optimize it to reduce an error between the decoder's\nestimated index and the actual index of the circle provided as input to the\nencoder. The proposed approach can be generalized to pack objects of higher\ndimensions and different shapes by carefully choosing normalization and\nperturbation layers. The approach gives a sub-optimal solution and is able to\npack smaller objects within a larger object with competitive performance with\nrespect to classical methods.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:14:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jose","Akshay Kiran",""],["Karevvanavar","Gangadhar",""],["Bhat","Rajshekhar V",""]]}
{"id":"2308.07336","submitter":"Terufumi Morishita","authors":"Terufumi Morishita, Gaku Morio, Atsuki Yamaguchi, Yasuhiro Sogawa","title":"Learning Deductive Reasoning from Synthetic Corpus based on Formal Logic","comments":null,"journal-ref":"Proceedings of the 40th International Conference on Machine\n  Learning, PMLR 202:25254-25274, 2023","doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a synthetic corpus-based approach for language models (LMs) to\nacquire logical deductive reasoning ability. The previous studies generated\ndeduction examples using specific sets of deduction rules. However, these rules\nwere limited or otherwise arbitrary. This can limit the generalizability of\nacquired deductive reasoning ability. We rethink this and adopt a well-grounded\nset of deduction rules based on formal logic theory, which can derive any other\ndeduction rules when combined in a multistep way. We empirically verify that\nLMs trained on the proposed corpora, which we name $\\textbf{FLD}$\n($\\textbf{F}$ormal $\\textbf{L}$ogic $\\textbf{D}$eduction), acquire more\ngeneralizable deductive reasoning ability. Furthermore, we identify the aspects\nof deductive reasoning ability on which deduction corpora can enhance LMs and\nthose on which they cannot. Finally, on the basis of these results, we discuss\nthe future directions for applying deduction corpora or other approaches for\neach aspect. We release the code, data, and models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 13:15:35 GMT"}],"update_date":"2023-08-18","authors_parsed":[["Morishita","Terufumi",""],["Morio","Gaku",""],["Yamaguchi","Atsuki",""],["Sogawa","Yasuhiro",""]]}
{"id":"2308.07337","submitter":"Halid Ziya Yerebakan","authors":"Halid Ziya Yerebakan, Yoshihisa Shinagawa, Mahesh Ranganath, Simon\n  Allen-Raffl, Gerardo Hermosillo Valadez","title":"A Hierarchical Descriptor Framework for On-the-Fly Anatomical Location\n  Matching between Longitudinal Studies","comments":"Registration Methods, 9 pages, MTSAIL & LEAF 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 a method to match anatomical locations between pairs of medical\nimages in longitudinal comparisons. The matching is made possible by computing\na descriptor of the query point in a source image based on a hierarchical\nsparse sampling of image intensities that encode the location information.\nThen, a hierarchical search operation finds the corresponding point with the\nmost similar descriptor in the target image. This simple yet powerful strategy\nreduces the computational time of mapping points to a millisecond scale on a\nsingle CPU. Thus, radiologists can compare similar anatomical locations in near\nreal-time without requiring extra architectural costs for precomputing or\nstoring deformation fields from registrations. Our algorithm does not require\nprior training, resampling, segmentation, or affine transformation steps. We\nhave tested our algorithm on the recently published Deep Lesion Tracking\ndataset annotations. We observed more accurate matching compared to Deep Lesion\nTracker while being 24 times faster than the most precise algorithm reported\ntherein. We also investigated the matching accuracy on CT and MR modalities and\ncompared the proposed algorithm's accuracy against ground truth consolidated\nfrom multiple radiologists.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 18:01:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yerebakan","Halid Ziya",""],["Shinagawa","Yoshihisa",""],["Ranganath","Mahesh",""],["Allen-Raffl","Simon",""],["Valadez","Gerardo Hermosillo",""]]}
{"id":"2308.07338","submitter":"Alon Gurman","authors":"Alon Gurman, Chia-Yu Hu, Amiel Sternberg, Ewine F. van Dishoeck","title":"[CII] Emission in a Self-Regulated Interstellar Medium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The [CII] 157.74 $\\mu$m fine structure transition is one of the brightest and\nmost well-studied emission lines in the far-infrared (FIR), produced in the\ninterstellar medium (ISM) of galaxies. We study its properties in sub-pc\nresolution hydrodynamical simulations for an ISM patch with gas surface density\nof $\\Sigma_{\\rm{g}}=10\\;M_{\\odot}\\;\\rm{pc}^{-2}$, coupled with time-dependent\nchemistry, far-ultraviolet (FUV) dust and gas shielding, star formation,\nphotoionization and supernova (SN) feedback, and full line-radiative transfer.\nThe [CII] 157.74 $\\mu$m line intensity correlates with star formation rate\n(SFR), and scales linearly with metallicity, and is, therefore, a good SFR\ntracer even in metal-poor environments, where molecular lines might be\nundetectable. We find a [CII]-to-H$_2$ conversion factor that is well described\nby the power law $X_{\\rm{[CII]}}=6.31\\times 10^{19} \\;Z^{\\prime\\;0.17}\\;\n(\\rm{cm}^{-2}\\;(\\rm{K}\\;\\rm{km}\\;\\rm{s}^{-1})^{-1})$. Our results are in\nagreement with galaxy surveys in all but the lowest metallicity run. We find\nthat resolving the clumpy structure of the dense interstellar medium (ISM) is\nimportant as it dominates [CII] 157.74 $\\mu$m emission. We compare our full\nradiative transfer computation with the optically-thin limit, and find that\n[CII] emission only begins approaching the optically thick limit at super-solar\nmetallicity, for our assumed gas surface density.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:08:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gurman","Alon",""],["Hu","Chia-Yu",""],["Sternberg","Amiel",""],["van Dishoeck","Ewine F.",""]]}
{"id":"2308.07339","submitter":"Annette Sobel","authors":"Annette L. Sobel (University of Missouri), Kenneth Yeh (MRIGlobal),\n  Elaine Bradford (MRIGlobal), Colin Price (MRIGlobal), Joseph Russell\n  (MRIGlobal), Gene Olinger (MRIGlobal), Sheila Grant (University of Missouri),\n  Chi-Ren Shyu (University of Missouri)","title":"Leveraging Geospatial Information to address Space Epidemiology through\n  Multi$\\unicode{x2013}$omics $\\unicode{x2013}$ Report of an Interdisciplinary\n  Workshop","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article will summarize the workshop proceedings of a workshop conducted\nat the University of Missouri that addressed the use of multi-omics fused with\ngeospatial information to assess and improve the precision and environmental\nanalysis of indicators of crew space health. The workshop addressed the state\nof the art of multi-omics research and practice and the potential future use of\nmulti-omics platforms in extreme environments. The workshop also focused on\npotential new strategies for data collection, analysis, and fusion with\ncrosstalk with the field of environmental health, biosecurity, and radiation\nsafety, addressing gaps and shortfalls and potential new approaches to\nenhancing astronaut health safety and security. Ultimately, the panel\nproceedings resulted in a synthesis of new research and translational\nopportunities to improve space and terrestrial epidemiology. In the future,\nearly disease prevention that employs new and expanded data sources enhanced by\nthe analytic precision of geospatial information and artificial intelligence\nalgorithms.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:41:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sobel","Annette L.","","University of Missouri"],["Yeh","Kenneth","","MRIGlobal"],["Bradford","Elaine","","MRIGlobal"],["Price","Colin","","MRIGlobal"],["Russell","Joseph","","MRIGlobal"],["Olinger","Gene","","MRIGlobal"],["Grant","Sheila","","University of Missouri"],["Shyu","Chi-Ren","","University of Missouri"]]}
{"id":"2308.07340","submitter":"Naresh Goud Boddu","authors":"Rishabh Batra, Naresh Goud Boddu, Rahul Jain","title":"Quantum secure non-malleable randomness encoder and its applications","comments":"arXiv admin note: text overlap with arXiv:2308.06466","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  \"Non-Malleable Randomness Encoder\"(NMRE) was introduced by Kanukurthi,\nObbattu, and Sekar~[KOS18] as a useful cryptographic primitive helpful in the\nconstruction of non-malleable codes. To the best of our knowledge, their\nconstruction is not known to be quantum secure.\n  We provide a construction of a first rate-$1/2$, $2$-split, quantum secure\nNMRE and use this in a black-box manner, to construct for the first time the\nfollowing:\n  1) rate $1/11$, $3$-split, quantum non-malleable code,\n  2) rate $1/3$, $3$-split, quantum secure non-malleable code,\n  3) rate $1/5$, $2$-split, average case quantum secure non-malleable code.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:23:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Batra","Rishabh",""],["Boddu","Naresh Goud",""],["Jain","Rahul",""]]}
{"id":"2308.07341","submitter":"Timm Weitkamp","authors":"Elisabeth Prause, Jeremias Hey, Florian Beuer, Jamila Yassine,\n  Bernhard Hesse, Timm Weitkamp, Javier Gerber, Franziska Schmidt","title":"Microstructural investigation of hybrid CAD/CAM restorative dental\n  materials by micro-CT and SEM","comments":"22 pages, 3 tables, 11 figures including supplementary material","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cond-mat.mtrl-sci physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objectives: An increasing number of CAD/CAM (computer-aided\ndesign/computer-aided manufacturing) hybrid materials have been introduced to\nthe dental market in recent years. In addition, CAD/CAM hybrid materials for\nadditive manufacturing (AM) are becoming more attractive in digital dentistry.\nStudies on material microstructures using micro-computed tomography ($\\mu$-CT)\ncombined with scanning electron microscopy (SEM) have only been available to a\nlimited extent so far.\n  Methods: One CAD/CAM three-dimensional- (3D-) printable hybrid material\n(VarseoSmile Crown plus) and two CAD/CAM millable hybrid materials (Vita\nEnamic; Voco Grandio), as well as one direct composite material (Ceram.x duo),\nwere included in the present study. Cylindrical samples with a diameter of 2 mm\nwere produced from each material and investigated by means of synchrotron\nradiation $\\mu$-CT at a voxel size of 0.65 $\\mu$m. Different samples from the\nsame materials, obtained by cutting and polishing, were investigated by SEM.\n  Results: The 3D-printed hybrid material showed some agglomerations and a more\nirregular distribution of fillers, as well as a visible layered macrostructure\nand a few spherical pores due to the printing process. The CAD/CAM millable\nhybrid materials revealed a more homogenous distribution of ceramic particles.\nThe direct composite material showed multiple air bubbles and microstructural\nirregularities based on manual processing.\n  Significance: The $\\mu$-CT and SEM analysis of the materials revealed\ndifferent microstructures even though they belong to the same class of\nmaterials. It could be shown that $\\mu$-CT and SEM imaging are valuable tools\nto understand microstructure and related mechanical properties of materials.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:33:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Prause","Elisabeth",""],["Hey","Jeremias",""],["Beuer","Florian",""],["Yassine","Jamila",""],["Hesse","Bernhard",""],["Weitkamp","Timm",""],["Gerber","Javier",""],["Schmidt","Franziska",""]]}
{"id":"2308.07342","submitter":"Ruxiao Chen","authors":"Ruxiao Chen, Shuaishuai Guo","title":"Emergent communication for AR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mobile augmented reality (MAR) is widely acknowledged as one of the\nubiquitous interfaces to the digital twin and Metaverse, demanding unparalleled\nlevels of latency, computational power, and energy efficiency. The existing\nsolutions for realizing MAR combine multiple technologies like edge, cloud\ncomputing, and fifth-generation (5G) networks. However, the inherent\ncommunication latency of visual data imposes apparent limitations on the\nquality of experience (QoE). To address the challenge, we propose an emergent\nsemantic communication framework to learn the communication protocols in MAR.\nSpecifically, we train two agents through a modified Lewis signaling game to\nemerge a discrete communication protocol spontaneously. Based on this protocol,\ntwo agents can communicate about the abstract idea of visual data through\nmessages with extremely small data sizes in a noisy channel, which leads to\nmessage errors. To better simulate real-world scenarios, we incorporate channel\nuncertainty into our training process. Experiments have shown that the proposed\nscheme has better generalization on unseen objects than traditional object\nrecognition used in MAR and can effectively enhance communication efficiency\nthrough the utilization of small-size messages.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 16:45:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Ruxiao",""],["Guo","Shuaishuai",""]]}
{"id":"2308.07343","submitter":"Bingcong Li","authors":"Bingcong Li, Georgios B. Giannakis","title":"Conic Descent Redux for Memory-Efficient Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conic programming has well-documented merits in a gamut of signal processing\nand machine learning tasks. This contribution revisits a recently developed\nfirst-order conic descent (CD) solver, and advances it in three aspects:\nintuition, theory, and algorithmic implementation. It is found that CD can\nafford an intuitive geometric derivation that originates from the dual problem.\nThis opens the door to novel algorithmic designs, with a momentum variant of\nCD, momentum conic descent (MOCO) exemplified. Diving deeper into the dual\nbehavior CD and MOCO reveals: i) an analytically justified stopping criterion;\nand, ii) the potential to design preconditioners to speed up dual convergence.\nLastly, to scale semidefinite programming (SDP) especially for low-rank\nsolutions, a memory efficient MOCO variant is developed and numerically\nvalidated.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 13:29:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Bingcong",""],["Giannakis","Georgios B.",""]]}
{"id":"2308.07344","submitter":"Jingjin Wu","authors":"Hang Yang, Jing Fu, Jingjin Wu, Moshe Zukerman","title":"A Study of a Loss System with Priorities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Erlang loss formula, also known as the Erlang B formula, has been known\nfor over a century and has been used in a wide range of applications, from\ntelephony to hospital intensive care unit management. It provides the blocking\nprobability of arriving customers to a loss system involving a finite number of\nservers without a waiting room. Because of the need to introduce priorities in\nmany services, an extension of the Erlang B formula to the case of a loss\nsystem with preemptive priority is valuable and essential. This paper\nanalytically establishes the consistency between the global balance (steady\nstate) equations for a loss system with preemptive priorities and a known\nresult obtained using traffic loss arguments for the same problem. This paper,\nfor the first time, derives this known result directly from the global balance\nequations based on the relevant multidimensional Markov chain. The paper also\naddresses the question of whether or not the well-known insensitivity property\nof the Erlang loss system is also applicable to the case of a loss system with\npreemptive priorities, provides explanations, and demonstrates through\nsimulations that, except for the blocking probability of the highest priority\ncustomers, the blocking probabilities of the other customers are sensitive to\nthe holding time distributions and that a higher variance of the service time\ndistribution leads to a lower blocking probability of the lower priority\ntraffic.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 15:14:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Hang",""],["Fu","Jing",""],["Wu","Jingjin",""],["Zukerman","Moshe",""]]}
{"id":"2308.07345","submitter":"Liang Liu","authors":"Liang Liu, Xue Ren and Jifan Hu","title":"Metallic states in Pb$_{10}$(PO$_4$)$_6$O induced by the Cu/O-insertions\n  and carrier doping","comments":"17 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The reports of room-temperature superconductivity in Cu-doped Pb-apatite draw\nintense interests and debates. Herein, based on the density functional theory,\nwe show that the Cu-insertion in Pb-apatite is thermodynamically stable and\nfurther carrier doping can convert the system CuPb$_{10}$(PO$_4$)$_6$O into\nmetal. The electric conduction is mainly along the one-dimensional (1D) Cu-O\nchains in the c-axis (out-of-plane). The calculated conductance along the\nc-axis is larger than the in-plane ones by 2 magnitude orders, indicating the\n1D conduction behavior. Moreover, the 1D Cu-O chain is an anti-ferromagnetic\nMott insulator at zero-doping point due to the super-exchange. Further\nelectron/hole-doping will erase the anti-ferromagnetism. Therefore, the\nCu-inserted system CuPb$_{10}$(PO$_4$)$_6$O show transport and magnetic\nfeatures similar to the cuprate superconductors. On the other hand, the\nO-insertion can also induce the metallic states, in which the conductance along\nthe out-of-plane direction is higher than the in-plane direction by 6-folds.\nOur results display the metallization of Pb$_{10}$(PO$_4$)$_6$O via\nCu/O-insertions, and suggesting the electric conductions along the c-axis might\ndominate the transport behaviors.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:22:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Liang",""],["Ren","Xue",""],["Hu","Jifan",""]]}
{"id":"2308.07346","submitter":"Joseph Ramsey","authors":"Joseph D. Ramsey, Bryan Andrews","title":"Py-Tetrad and RPy-Tetrad: A New Python Interface with R Support for\n  Tetrad Causal Search","comments":"Causal Analysis Workshop Series (CAWS) 2023, 12 pages, 4 Figures, 2\n  Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS cs.AI cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give novel Python and R interfaces for the (Java) Tetrad project for\ncausal modeling, search, and estimation. The Tetrad project is a mainstay in\nthe literature, having been under consistent development for over 30 years.\nSome of its algorithms are now classics, like PC and FCI; others are recent\ndevelopments. It is increasingly the case, however, that researchers need to\naccess the underlying Java code from Python or R. Existing methods for doing\nthis are inadequate. We provide new, up-to-date methods using the JPype\nPython-Java interface and the Reticulate Python-R interface, directly solving\nthese issues. With the addition of some simple tools and the provision of\nworking examples for both Python and R, using JPype and Reticulate to interface\nPython and R with Tetrad is straightforward and intuitive.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 16:29:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ramsey","Joseph D.",""],["Andrews","Bryan",""]]}
{"id":"2308.07347","submitter":"Swetha Varadarajan","authors":"Swetha Varadarajan and Darrell Whitley","title":"A Parallel Ensemble of Metaheuristic Solvers for the Traveling Salesman\n  Problem","comments":"First submission was made to Europar, 2021. Paper Rejected","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The travelling salesman problem (TSP) is one of the well-studied NP-hard\nproblems in the literature. The state-of-the art inexact TSP solvers are the\nLin-Kernighan-Helsgaun (LKH) heuristic and Edge Assembly crossover (EAX). A\nrecent study suggests that EAX with restart mechanisms perform well on a wide\nrange of TSP instances. However, this study is limited to 2,000 city problems.\nWe study for problems ranging from 2,000 to 85,900. We see that the performance\nof the solver varies with the type of the problem. However, combining these\nsolvers in an ensemble setup, we are able to outperform the individual solver's\nperformance. We see the ensemble setup as an efficient way to make use of the\nabundance of compute resources. In addition to EAX and LKH, we use several\nversions of the hybrid of EAX and Mixing Genetic Algorithm (MGA). A hybrid of\nMGA and EAX is known to solve some hard problems. We see that the ensemble of\nthe hybrid version outperforms the state-of-the-art solvers on problems larger\nthan 10,000 cities.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 21:12:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Varadarajan","Swetha",""],["Whitley","Darrell",""]]}
{"id":"2308.07348","submitter":"Maurice H. P. M. van Putten","authors":"Maryam A. Abchouyeh, Maurice H.P.M. van Putten, Lorenzo Amati","title":"Observational prospects of double neutrons star mergers and their\n  multi-messenger afterglows: LIGO discovery power, event rates and diversity","comments":"30 pages, 12+1 figures","journal-ref":"ApJ 952 157 (2023)","doi":"10.3847/1538-4357/acd114","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The double neutron star (DNS) merger event GW170817 signifies the first\nmultimessenger (MM) event with electromagnetic-gravitational (EM-GW)\nobservations. LIGO-Virgo-KAGRA observational runs O4-5 promise to detect\nsimilar events and as yet unknown GW signals, which require confirmation in two\nor more detectors with comparable performance. To this end, we quantify duty\ncycles of comparable science quality of data in coincident H1L1-observations,\nfurther to seek consistent event rates of astrophysical transients in upcoming\nEM-GW surveys. Quite generally, discovery power scales with exposure time,\nsensitivity, and critically depends on the percentage of time when detectors\noperate at high quality. We quantify coincident duty cycles over a\ntime-frequency domain $W\\times B$, defined by segments of duration $W=8$s,\nmotivated by a long-duration descending GW-chirp during GRB170817A, and the\nminimum detector noise over about $B=100-250\\,$Hz. This detector yield factor\nsatisfies $1\\%-25 \\%$ in S5-6 and O1-O3ab, significantly different from duty\ncycles of H1 and L1 individually with commensurable impact on consistency in\nevent rates in EM-GW surveys. Significant gain in discovery power for signals\nwhose frequency varies slowly in time may be derived from improving detector\nyield factors by deploying time-symmetric data analysis methods. For O4-5,\nthese can yield improvements by factors up to $\\mathcal{O}(10^5)$ relative to\nexisting data and methods. Furthermore, the diversity of MM afterglows to DNS\nmergers may be greatest for systems similar to GW170817 but possibly less so\nfor systems of substantially different mass such as GW190425. We summarize our\nfindings with an outlook on EM-GW surveys during O4-5 and perspectives for\nnext-generation GRB missions like THESEUS.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 05:37:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Abchouyeh","Maryam A.",""],["van Putten","Maurice H. P. M.",""],["Amati","Lorenzo",""]]}
{"id":"2308.07349","submitter":"Peisheng Yu","authors":"Peisheng Yu","title":"On a specific problem of partition of graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this short article, we consider a problem about $2$-partition of the\nvertices of a graph. If a graph admits such a partition into some 'small'\ngraphs, then the number of edges cross an arbitrary cut of the graph\n$e(S,S^{c})$ has a nice lower bound.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 06:38:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yu","Peisheng",""]]}
{"id":"2308.07350","submitter":"Winfried Van Den Dool","authors":"Winfried van den Dool, Tijmen Blankevoort, Max Welling, Yuki M. Asano","title":"Efficient Neural PDE-Solvers using Quantization Aware Training","comments":"Accepted at the ICCV 2023 Workshop on Resource Efficient Deep\n  Learning for Computer Vision","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 past years, the application of neural networks as an alternative to\nclassical numerical methods to solve Partial Differential Equations has emerged\nas a potential paradigm shift in this century-old mathematical field. However,\nin terms of practical applicability, computational cost remains a substantial\nbottleneck. Classical approaches try to mitigate this challenge by limiting the\nspatial resolution on which the PDEs are defined. For neural PDE solvers, we\ncan do better: Here, we investigate the potential of state-of-the-art\nquantization methods on reducing computational costs. We show that quantizing\nthe network weights and activations can successfully lower the computational\ncost of inference while maintaining performance. Our results on four standard\nPDE datasets and three network architectures show that quantization-aware\ntraining works across settings and three orders of FLOPs magnitudes. Finally,\nwe empirically demonstrate that Pareto-optimality of computational cost vs\nperformance is almost always achieved only by incorporating quantization.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:21:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Dool","Winfried van den",""],["Blankevoort","Tijmen",""],["Welling","Max",""],["Asano","Yuki M.",""]]}
{"id":"2308.07351","submitter":"Hao Li","authors":"Siyuan Li, Hao Li, Jin Zhang, Zhen Wang, Peng Liu, Chongjie Zhang","title":"IOB: Integrating Optimization Transfer and Behavior Transfer for\n  Multi-Policy Reuse","comments":"26 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Humans have the ability to reuse previously learned policies to solve new\ntasks quickly, and reinforcement learning (RL) agents can do the same by\ntransferring knowledge from source policies to a related target task. Transfer\nRL methods can reshape the policy optimization objective (optimization\ntransfer) or influence the behavior policy (behavior transfer) using source\npolicies. However, selecting the appropriate source policy with limited samples\nto guide target policy learning has been a challenge. Previous methods\nintroduce additional components, such as hierarchical policies or estimations\nof source policies' value functions, which can lead to non-stationary policy\noptimization or heavy sampling costs, diminishing transfer effectiveness. To\naddress this challenge, we propose a novel transfer RL method that selects the\nsource policy without training extra components. Our method utilizes the Q\nfunction in the actor-critic framework to guide policy selection, choosing the\nsource policy with the largest one-step improvement over the current target\npolicy. We integrate optimization transfer and behavior transfer (IOB) by\nregularizing the learned policy to mimic the guidance policy and combining them\nas the behavior policy. This integration significantly enhances transfer\neffectiveness, surpasses state-of-the-art transfer RL baselines in benchmark\ntasks, and improves final performance and knowledge transferability in\ncontinual learning scenarios. Additionally, we show that our optimization\ntransfer technique is guaranteed to improve target policy learning.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:22:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Siyuan",""],["Li","Hao",""],["Zhang","Jin",""],["Wang","Zhen",""],["Liu","Peng",""],["Zhang","Chongjie",""]]}
{"id":"2308.07352","submitter":"Shikhar Nilabh","authors":"Shikhar Nilabh and Fidel Grandia","title":"Bayesian Physics-Informed Neural Network for the Forward and Inverse\n  Simulation of Engineered Nano-particles Mobility in a Contaminated Aquifer","comments":"To be submitted to a NeurIPS 2023 workshop. arXiv admin note:\n  substantial text overlap with arXiv:2211.03525","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.comp-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Globally, there are many polluted groundwater sites that need an active\nremediation plan for the restoration of local ecosystem and environment.\nEngineered nanoparticles (ENPs) have proven to be an effective reactive agent\nfor the in-situ degradation of pollutants in groundwater. While the performance\nof these ENPs has been highly promising on the laboratory scale, their\napplication in real field case conditions is still limited. The complex\ntransport and retention mechanisms of ENPs hinder the development of an\nefficient remediation strategy. Therefore, a predictive tool to comprehend the\ntransport and retention behavior of ENPs is highly required. The existing tools\nin the literature are dominated with numerical simulators, which have limited\nflexibility and accuracy in the presence of sparse datasets and the aquifer\nheterogeneity. This work uses a Bayesian Physics-Informed Neural Network\n(B-PINN) framework to model the nano-particles mobility within an aquifer. The\nresult from the forward model demonstrates the effective capability of B-PINN\nin accurately predicting the ENPs mobility and quantifying the uncertainty. The\ninverse model output is then used to predict the governing parameters for the\nENPs mobility in a small-scale aquifer. The research demonstrates the\ncapability of the tool to provide predictive insights for developing an\nefficient groundwater remediation strategy.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:32:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nilabh","Shikhar",""],["Grandia","Fidel",""]]}
{"id":"2308.07353","submitter":"Vikash Kumar Ojha","authors":"Ramkumar Radhakrishnan, Mariyah Ughradar, Vikash Kumar Ojha","title":"Quantum information entropies for solitonic systems","comments":"14 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Particle with position-dependent mass is a useful concept in the context of\nsemiconductor physics. We study a particle with the solitonic mass distribution\nin two different forms of potential: the quartic and the symmetric potential.\nWe estimate the Shannon entropy and Fisher information associated with the\nground state of particle in these two scenarioes by obtaining the wave-function\nfrom Zhu-Kroemer equation. The ground state of the particle in each case\nsatisfies the Bialynicki-Birula-Mycielski inequality. Upon comparing all four\nmodels under consideration, we have observed that the Shannon entropy is\ngreater for the solitonic mass distribution when it is subjected to a quartic\npotential.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:15:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Radhakrishnan","Ramkumar",""],["Ughradar","Mariyah",""],["Ojha","Vikash Kumar",""]]}
{"id":"2308.07354","submitter":"Sunil Maurya DR.","authors":"Himanshu Chaudhary, Dhruv Arora, Ujjal Debnath, G.Mustafa, and S. K.\n  Maurya","title":"A New Cosmological Model: Exploring the Evolution of the Universe and\n  Unveiling Super-Accelerated Expansion","comments":"10 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a cosmological model designed to study the\nevolution of the universe based on a new parametrization of the deceleration\nparameter. The model considers a spatially flat, homogeneous, and isotropic\nFriedmann-Lema\\^itre-Robertson-Walker (FLRW) universe filled with radiation,\ndark matter (DM), and dark energy (DE). We derive the Friedmann equations and\nthe energy conservation equation for the universe, accounting for separate\nconservation equations for radiation, DM, and DE. Our proposed deceleration\nparameter is given by a formula involving constants $H_{0}$, $\\Omega_{r0}$,\n$\\Omega_{m0}$, $q_{2}$, $q_{1}$, $q_{0}$, $\\alpha$ and $\\beta$. which we\nsubsequently fit to observational data. To assess the model's viability, we\ncompare it with a diverse range of observational data, including cosmic\nchronometers, type Ia supernovae, baryon acoustic oscillations, and cosmic\nmicrowave background measurements. Employing the chi-square statistic and a\nMarkov Chain Monte Carlo (MCMC) method, we estimate the best-fit values for the\nfree parameters and investigate the constraints imposed by observational data\non the model. Our results indicate that our cosmological model provides an\nexcellent fit to the observed data and exhibits a remarkable agreement with the\nstandard $\\Lambda$CDM paradigm at higher redshifts. However, the most\nintriguing discovery lies in the model's prediction of a super-accelerated\nexpansion in the distant future, in contrast to the de Sitter phase predicted\nby $\\Lambda$CDM. This implies the presence of dark energy driving the\nuniverse's accelerated expansion. These findings suggest that our proposed\ncosmological model offers a compelling alternative to the $\\Lambda$CDM\nparadigm, shedding new light on the nature of dark energy and the future fate\nof the cosmos.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:08:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chaudhary","Himanshu",""],["Arora","Dhruv",""],["Debnath","Ujjal",""],["Mustafa","G.",""],["Maurya","S. K.",""]]}
{"id":"2308.07355","submitter":"Paola Carolina Moreira Delgado","authors":"Paola C. M. Delgado","title":"Introdu\\c{c}\\~ao \\`a Cosmologia Qu\\^antica","comments":"11 pages, in Portuguese, 3 figures, version accepted for publication\n  in Cadernos de Astronomia","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This review presents an introduction to Quantum Cosmology, including the\nmathematical methods essential to the canonical approach, some of the existing\nconceptual problems and the connection of the models to possible observables.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 11:48:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Delgado","Paola C. M.",""]]}
{"id":"2308.07356","submitter":"Gokul Manoj","authors":"Gokul Manoj, Sandeep Singh Sengar, Jac Fredo Agastinose Ronickom","title":"Age-Stratified Differences in Morphological Connectivity Patterns in\n  ASD: An sMRI and Machine Learning Approach","comments":"10 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Purpose: Age biases have been identified as an essential factor in the\ndiagnosis of ASD. The objective of this study was to compare the effect of\ndifferent age groups in classifying ASD using morphological features (MF) and\nmorphological connectivity features (MCF). Methods: The structural magnetic\nresonance imaging (sMRI) data for the study was obtained from the two publicly\navailable databases, ABIDE-I and ABIDE-II. We considered three age groups, 6 to\n11, 11 to 18, and 6 to 18, for our analysis. The sMRI data was pre-processed\nusing a standard pipeline and was then parcellated into 148 different regions\naccording to the Destrieux atlas. The area, thickness, volume, and mean\ncurvature information was then extracted for each region which was used to\ncreate a total of 592 MF and 10,878 MCF for each subject. Significant features\nwere identified using a statistical t-test (p<0.05) which was then used to\ntrain a random forest (RF) classifier. Results: The results of our study\nsuggested that the performance of the 6 to 11 age group was the highest,\nfollowed by the 6 to 18 and 11 to 18 ages in both MF and MCF. Overall, the MCF\nwith RF in the 6 to 11 age group performed better in the classification than\nthe other groups and produced an accuracy, F1 score, recall, and precision of\n75.8%, 83.1%, 86%, and 80.4%, respectively. Conclusion: Our study thus\ndemonstrates that morphological connectivity and age-related diagnostic model\ncould be an effective approach to discriminating ASD.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:11:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Manoj","Gokul",""],["Sengar","Sandeep Singh",""],["Ronickom","Jac Fredo Agastinose",""]]}
{"id":"2308.07357","submitter":"Mukul Singh","authors":"Mukul Singh, Jose Cambronero, Sumit Gulwani, Vu Le, Carina Negreanu,\n  Gust Verbruggen","title":"Demonstration of CORNET: A System For Learning Spreadsheet Formatting\n  Rules By Example","comments":"4 Pages, VLDB 2023 Demonstration Track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data management and analysis tasks are often carried out using spreadsheet\nsoftware. A popular feature in most spreadsheet platforms is the ability to\ndefine data-dependent formatting rules. These rules can express actions such as\n\"color red all entries in a column that are negative\" or \"bold all rows not\ncontaining error or failure.\" Unfortunately, users who want to exercise this\nfunctionality need to manually write these conditional formatting (CF) rules.\nWe introduce CORNET, a system that automatically learns such conditional\nformatting rules from user examples. CORNET takes inspiration from inductive\nprogram synthesis and combines symbolic rule enumeration, based on\nsemi-supervised clustering and iterative decision tree learning, with a neural\nranker to produce accurate conditional formatting rules. In this demonstration,\nwe show CORNET in action as a simple add-in to Microsoft Excel. After the user\nprovides one or two formatted cells as examples, CORNET generates formatting\nrule suggestions for the user to apply to the spreadsheet.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:15:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Singh","Mukul",""],["Cambronero","Jose",""],["Gulwani","Sumit",""],["Le","Vu",""],["Negreanu","Carina",""],["Verbruggen","Gust",""]]}
{"id":"2308.07358","submitter":"Amin Heyrani Nobari","authors":"Amin Heyrani Nobari, Justin Rey, Suhas Kodali, Matthew Jones, Faez\n  Ahmed","title":"Conformal Predictions Enhanced Expert-guided Meshing with Graph Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational Fluid Dynamics (CFD) is widely used in different engineering\nfields, but accurate simulations are dependent upon proper meshing of the\nsimulation domain. While highly refined meshes may ensure precision, they come\nwith high computational costs. Similarly, adaptive remeshing techniques require\nmultiple simulations and come at a great computational cost. This means that\nthe meshing process is reliant upon expert knowledge and years of experience.\nAutomating mesh generation can save significant time and effort and lead to a\nfaster and more efficient design process. This paper presents a machine\nlearning-based scheme that utilizes Graph Neural Networks (GNN) and expert\nguidance to automatically generate CFD meshes for aircraft models. In this\nwork, we introduce a new 3D segmentation algorithm that outperforms two\nstate-of-the-art models, PointNet++ and PointMLP, for surface classification.\nWe also present a novel approach to project predictions from 3D mesh\nsegmentation models to CAD surfaces using the conformal predictions method,\nwhich provides marginal statistical guarantees and robust uncertainty\nquantification and handling. We demonstrate that the addition of conformal\npredictions effectively enables the model to avoid under-refinement, hence\nfailure, in CFD meshing even for weak and less accurate models. Finally, we\ndemonstrate the efficacy of our approach through a real-world case study that\ndemonstrates that our automatically generated mesh is comparable in quality to\nexpert-generated meshes and enables the solver to converge and produce accurate\nresults. Furthermore, we compare our approach to the alternative of adaptive\nremeshing in the same case study and find that our method is 5 times faster in\nthe overall process of simulation. The code and data for this project are made\npublicly available at https://github.com/ahnobari/AutoSurf.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:39:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nobari","Amin Heyrani",""],["Rey","Justin",""],["Kodali","Suhas",""],["Jones","Matthew",""],["Ahmed","Faez",""]]}
{"id":"2308.07359","submitter":"Jonas H\\\"ugel","authors":"Jan Janosch Schneider and Marius Adler and Christoph Ammer-Herrmenau\n  and Alexander Otto K\\\"onig and Ulrich Sax and Jonas H\\\"ugel","title":"Improving ICD-based semantic similarity by accounting for varying\n  degrees of comorbidity","comments":"11 pages, 6 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding similar patients is a common objective in precision medicine,\nfacilitating treatment outcome assessment and clinical decision support.\nChoosing widely-available patient features and appropriate mathematical methods\nfor similarity calculations is crucial. International Statistical\nClassification of Diseases and Related Health Problems (ICD) codes are used\nworldwide to encode diseases and are available for nearly all patients.\nAggregated as sets consisting of primary and secondary diagnoses they can\ndisplay a degree of comorbidity and reveal comorbidity patterns. It is possible\nto compute the similarity of patients based on their ICD codes by using\nsemantic similarity algorithms. These algorithms have been traditionally\nevaluated using a single-term expert rated data set.\n  However, real-word patient data often display varying degrees of documented\ncomorbidities that might impair algorithm performance. To account for this, we\npresent a scale term that considers documented comorbidity-variance. In this\nwork, we compared the performance of 80 combinations of established algorithms\nin terms of semantic similarity based on ICD-code sets. The sets have been\nextracted from patients with a C25.X (pancreatic cancer) primary diagnosis and\nprovide a variety of different combinations of ICD-codes. Using our scale term\nwe yielded the best results with a combination of level-based information\ncontent, Leacock & Chodorow concept similarity and bipartite graph matching for\nthe set similarities reaching a correlation of 0.75 with our expert's ground\ntruth. Our results highlight the importance of accounting for comorbidity\nvariance while demonstrating how well current semantic similarity algorithms\nperform.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:56:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Schneider","Jan Janosch",""],["Adler","Marius",""],["Ammer-Herrmenau","Christoph",""],["K\u00f6nig","Alexander Otto",""],["Sax","Ulrich",""],["H\u00fcgel","Jonas",""]]}
{"id":"2308.07360","submitter":"Gabriel Le\\'on Ph.D.","authors":"Gabriel R. Bengochea, Gabriel Leon, Alejandro Perez and Daniel\n  Sudarsky","title":"A clarification on prevailing misconceptions in unimodular gravity","comments":"21 pages + Refs, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The traditional presentation of Unimodular Gravity (UG) consists on\nindicating that it is an alternative theory of gravity that restricts the\ngeneric diffeomorphism invariance of General Relativity. In particular, as\noften encountered in the literature, unlike General Relativity, Unimodular\nGravity is invariant solely under volume-preserving diffeomorphisms. That\ncharacterization of UG has led to some confusion and incorrect statements in\nvarious treatments on the subject. For instance, sometimes it is claimed\n(mistakenly) that only spacetime metrics such that $|$det $g_{\\mu \\nu}| = 1$\ncan be considered as valid solutions of the theory. Additionally, that same\n(incorrect) statement is often invoked to argue that some particular gauges\n(e.g. the Newtonian or synchronous gauge) are not allowed when dealing with\ncosmological perturbation theory in UG. The present article is devoted to\nclarify those and other misconceptions regarding the notion of diffeomorphism\ninvariance, in general, and its usage in the context of UG, in particular.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:50:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bengochea","Gabriel R.",""],["Leon","Gabriel",""],["Perez","Alejandro",""],["Sudarsky","Daniel",""]]}
{"id":"2308.07361","submitter":"A. Lawrence Gould","authors":"A. Lawrence Gould","title":"Dose Selection Balancing Efficacy and Toxicity Using Bayesian Model\n  Averaging","comments":"23 pages, 14 figures. R code, annotated session log, and datasets\n  available from goulda@merck.com","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Successful pharmaceutical drug development requires finding correct doses\nthat provide an optimum balance between efficacy and toxicity. Competing\nresponses to dose such as efficacy and toxicity often will increase with dose,\nand it is important to identify a range of doses to provide an acceptable\nefficacy response (minimum effective dose) while not causing unacceptable\nintolerance or toxicity (maximum tolerated dose). How this should be done is\nnot self-evident. Relating efficacy to dose conditionally on possible toxicity\nmay be problematic because whether toxicity occurs will not be known when a\ndose for a patient needs to be chosen. Copula models provide an appealing\napproach for incorporating an efficacy-toxicity association when the functional\nforms of the efficacy and toxicity dose-response models are known but may be\nless appealing in practice when the functional forms of the dose-response\nmodels and the particular copula association model are unknown. This paper\nexplores the use of the BMA-Mod Bayesian model averaging framework that\naccommodates efficacy and toxicity responses to provide a statistically valid,\ndistributionally flexible, and operationally practical model-agnostic strategy\nfor predicting efficacy and toxicity outcomes both in terms of expected\nresponses and in terms of predictions for individual patients. The performance\nof the approach is evaluated via simulation when efficacy and toxicity outcomes\nare considered marginally, when they are associated via gaussian and\nArchimedean copulas, and when they are expressed in terms of clinically\nmeaningful categories. In all cases, the BMA-Mod strategy identified consistent\nranges of acceptable doses.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:30:23 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 21:19:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gould","A. Lawrence",""]]}
{"id":"2308.07362","submitter":"Joey S. G. Mombarg","authors":"Joey S. G. Mombarg, Michel Rieutord, Francisco Espinosa Lara","title":"The first two-dimensional stellar structure and evolution models of\n  rotating stars","comments":"Accepted for publication in Astronomy & Astrophysics Letters, 9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rotation is a key ingredient in the theory of stellar structure and\nevolution. Until now, stellar evolution codes operate in a 1-D framework for\nwhich the validity domain in regards to the rotation rate is not well\nunderstood. This letter aims at presenting the first results of self-consistent\nstellar models in two spatial dimensions that compute the time evolution of a\nstar and its rotation rate along the main sequence together with a comparison\nto observations. We make use of an extended version of the ESTER code that\nsolves the stellar structure of a rotating star in two dimensions with time\nevolution, including chemical evolution, and an implementation of rotational\nmixing. We have computed evolution tracks for a 12Msun model, once for an\ninitial rotation rate equal to 15% of the critical frequency, and once for 50%.\nWe first show that our model initially rotating at 15% of the critical\nfrequency is able to reproduce all the observations of the $\\beta$ Cephei star\nHD 192575 recently studied by Burssens et al. with asteroseismology. Beyond the\nclassical surface parameters like effective temperature or luminosity, our\nmodel also reproduces the core mass along with the rotation rate of the core\nand envelope at the estimated age of the star. This particular model also shows\nthat the meridional circulation has a negligible influence on the transport of\nchemical elements, like nitrogen, for which the abundance may be increased at\nthe stellar surface. Furthermore, it shows that in the late main sequence,\nnuclear evolution is faster than the relaxation time needed to reach a steady\nstate of the star angular momentum distribution. We have demonstrated that we\nhave successfully taken the new step towards 2-D evolutionary modelling of\nrotating stars. It opens new perspectives on the understanding of the dynamics\nof fast rotating stars and on the way rotation impacts stellar evolution.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mombarg","Joey S. G.",""],["Rieutord","Michel",""],["Lara","Francisco Espinosa",""]]}
{"id":"2308.07363","submitter":"Ignacio A. Reyes","authors":"Ignacio A. Reyes","title":"Trace anomaly and compact stars","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A widespread assumption states that quantum effects of matter in curved\nspacetimes become relevant only when the inverse curvature radius approaches\nthe Planck mass $m_{\\text{P}}$. We challenge this view by showing that, relying\nsolely on universal properties of QFTs at high energies, the trace anomaly\nbecomes macroscopic instead at energy scales $ \\left( m/m_{\\text{P}}\n\\right)^{\\frac{1-\\alpha}{2-\\alpha}} m_{\\text{P}}$, where $m\\ll m_{\\text{P}}$\nand $\\alpha<1$ are, respectively, the mass scale and exponent appearing in the\nmatter equation of state at high energies. As an application, we consider\ncompact stars close to their Buchdahl limit, and examine the propagation of\nscalar waves on the resulting backreacted geometries. At the aforementioned\nenergy scale, the curvature becomes negative within a neighborhood of the the\nstar's center, implying a qualitative change in the behavior of the associated\nspectrum of modes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Reyes","Ignacio A.",""]]}
{"id":"2308.07364","submitter":"Paul-Konstantin Oehlmann","authors":"Lara B. Anderson, James Gray and Paul-Konstantin Oehlmann","title":"Twisted Fibrations in M/F-theory","comments":"81 + 10 pages, 15 Figures, comments are appreciated","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 investigate 5-dimensional theories obtained from M-theory on\ngenus one fibered threefolds which exhibit twisted algebras in their fibers. We\nprovide a base-independent algebraic description of the threefolds and compute\nlight 5D BPS states charged under finite sub-algebras of the twisted algebras.\nWe further construct the Jacobian fibrations that are associated to\n6-dimensional F-theory lifts, where the twisted algebra is absent. These\n6/5-dimensional theories are compared via twisted circle reductions of F-theory\nto M-theory. In the 5-dimensional theories we discuss several geometric\ntransitions that connect twisted with untwisted fibrations. We present detailed\ndiscussions of $\\mathfrak{e}_6^{(2)}, \\mathfrak{so}_8^{(3)}$ and\n$\\mathfrak{su}_3^{(2)}$ twisted fibers and provide several explicit example\nthreefolds via toric constructions. Finally, limits are considered in which\ngravity is decoupled, including Little String Theories for which we match\n2-group symmetries across twisted T-dual theories.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Anderson","Lara B.",""],["Gray","James",""],["Oehlmann","Paul-Konstantin",""]]}
{"id":"2308.07365","submitter":"Carlos O. Lousto","authors":"A. Ciarfella, G. Ficarra, C.O. Lousto (CCRG-RIT)","title":"Close Encounter of Three Black Holes Revisited","comments":"13 pages, 12 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the evolution of close triple black hole system with full numerical\nrelativity techniques. We consider an equal mass non spinning hierarchical\nsystem with an inner binary ten orbits away from merger and study the effects\nof the third outer black hole on the binary's merger time and its eccentricity\nevolution. We find a generic time delay and an increase in the number of orbits\nto merger of the binary, that can be modeled versus the distance $D$ to the\nthird black hole as $\\sim1/D^{2.5}$. On the other hand, we find that the\norientation of the third black hole orbit has little effect on the binary's\nmerger time when considering a fiducial initial distance of $D=30M$ to the\nbinary (with initial orbital separation $d=8M$). In those scenarios the\nevolution of the inner binary eccentricity presents a steady decay, roughly as\nexpected, but in addition shows a modulation with the time scale of the outer\nthird black hole orbital semiperiod around the binary, resembling a beating\nfrequency.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ciarfella","A.","","CCRG-RIT"],["Ficarra","G.","","CCRG-RIT"],["Lousto","C. O.","","CCRG-RIT"]]}
{"id":"2308.07366","submitter":"Federico Sestito","authors":"Federico Sestito, Christian R. Hayes, Kim A. Venn, Jaclyn Jensen, Alan\n  W. McConnachie, John Pazder, Fletcher Waller, Anke Arentsen, Pascale\n  Jablonka, Nicolas F. Martin, Tadafumi Matsuno, Julio F. Navarro, Else\n  Starkenburg, Sara Vitali, John Bassett, Ruben Diaz, Michael L. Edgar,\n  Veronica Firpo, Manuel Gomez-Jimenez, Venu Kalari, Sam Lambert, Jon Lawrence,\n  Gordon Robertson, Roque Ruiz-Carmona, Ricardo Salinas, Kim M. Sebo, and\n  Sudharshan Venkatesan","title":"GHOST Commissioning Science Results II: a very metal-poor star\n  witnessing the early Galactic assembly","comments":"Submitted to MNRAS. 8 figures, 15pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on Pristine$\\_180956.78$$-$$294759.8$ (hereafter P180956,\n[Fe/H] $=-1.95\\pm0.02$), a star selected from the Pristine Inner Galaxy Survey\n(PIGS), and followed-up with the recently commissioned Gemini High-resolution\nOptical SpecTrograph (GHOST) at the Gemini South telescope. The GHOST\nspectrograph's high efficiency in the blue spectral region ($3700-4800$~\\AA)\nenables the detection of elemental tracers of early supernovae (e.g. Al, Mn,\nSr, Eu), which were not accessible in the previous analysis of P180956. The\nstar exhibits chemical signatures resembling those found in ultra-faint dwarf\nsystems, characterised by very low abundances of neutron-capture elements (Sr,\nBa, Eu), which are uncommon among stars of comparable metallicity in the Milky\nWay. Our analysis suggests that P180956 bears the chemical imprints of a small\nnumber (2 or 4) of low-mass hypernovae ($\\sim10-15\\msun$), which are needed to\nreproduce the abundance pattern of the light-elements (e.g. [Si, Ti/Mg, Ca]\n$\\sim0.6$), and one fast-rotating intermediate-mass supernova ($\\sim300\\kms$,\n$\\sim80-120\\msun$). Both types of supernovae explain the high [Sr/Ba] of\nP180956 ($\\sim1.2$). The small pericentric ($\\sim0.7\\kpc$) and apocentric\n($\\sim13\\kpc$) distances and its orbit confined to the plane ($\\lesssim\n2\\kpc$), indicate that this star was likely accreted during the early Galactic\nassembly phase. Its chemo-dynamical properties suggest that P180956 formed in a\nsystem similar to an ultra-faint dwarf galaxy accreted either alone, as one of\nthe low-mass building blocks of the proto-Galaxy, or as a satellite of\nGaia-Sausage-Enceladus. The combination of Gemini's large aperture with GHOST's\nhigh efficiency and broad spectral coverage makes this new spectrograph one of\nthe leading instruments for near-field cosmology investigations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sestito","Federico",""],["Hayes","Christian R.",""],["Venn","Kim A.",""],["Jensen","Jaclyn",""],["McConnachie","Alan W.",""],["Pazder","John",""],["Waller","Fletcher",""],["Arentsen","Anke",""],["Jablonka","Pascale",""],["Martin","Nicolas F.",""],["Matsuno","Tadafumi",""],["Navarro","Julio F.",""],["Starkenburg","Else",""],["Vitali","Sara",""],["Bassett","John",""],["Diaz","Ruben",""],["Edgar","Michael L.",""],["Firpo","Veronica",""],["Gomez-Jimenez","Manuel",""],["Kalari","Venu",""],["Lambert","Sam",""],["Lawrence","Jon",""],["Robertson","Gordon",""],["Ruiz-Carmona","Roque",""],["Salinas","Ricardo",""],["Sebo","Kim M.",""],["Venkatesan","Sudharshan",""]]}
{"id":"2308.07367","submitter":"Clara Murgui","authors":"Pavel Fileviez Perez, Clara Murgui, Samuel Patrone, Adriano Testa,\n  Mark B. Wise","title":"Finite Naturalness and Quark-Lepton Unification","comments":"8 pages","journal-ref":null,"doi":null,"report-no":"Report-no: CALT-TH/2023-025","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the implications of finite naturalness in Pati-Salam models where\nSU(3)c is embedded in SU(4). For the minimal realization at low scale of\nquark-lepton unification, which employs the inverse seesaw for neutrino masses,\nwe find that radiative corrections to the Higgs boson mass are at least $\\delta\nm_h^2/m_h^2 \\sim {\\cal O}(10^3)$. We find that the one-loop contributions to\nthe Higgs mass are suppressed by four powers of the hypercharge gauge coupling.\nNaively, the two-loop contributions involving the heavy vector bosons are\nlarge. We find that for the vector leptoquarks these two-loop corrections\ncancel when the Dirac Yukawa couplings for neutrinos are equal to the up-type\nquark Yukawa couplings as predicted in the minimal theory for quark-lepton\nunification. We show that the two-loop corrections to the Higgs mass involving\nthe new heavy neutral gauge boson are suppressed. We mention a way to relax the\nlower bound on the vector leptoquark mass and have $\\delta m_h^2/m_h^2 \\sim\n{\\cal O}(1)$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Perez","Pavel Fileviez",""],["Murgui","Clara",""],["Patrone","Samuel",""],["Testa","Adriano",""],["Wise","Mark B.",""]]}
{"id":"2308.07368","submitter":"Chentao Yang","authors":"Chentao Yang, Alain Omont, Sergio Mart\\'in, Thomas G. Bisbas, Pierre\n  Cox, Alexandre Beelen, Eduardo Gonz\\'alez-Alfonso, Rapha\\\"el Gavazzi, Susanne\n  Aalto, Paola Andreani, Cecilia Ceccarelli, Yu Gao, Mark Gorski, Michel\n  Gu\\'elin, Hai Fu, Rob J. Ivison, Kirsten K. Knudsen, Matthew Lehnert, Hugo\n  Messias, Sebastien Muller, Roberto Neri, Dominik Riechers, Paul van der Werf,\n  and Zhi-Yu Zhang","title":"SUNRISE: The rich molecular inventory of high-redshift dusty galaxies\n  revealed by broadband spectral line surveys","comments":"Submitted to A&A; under review. Abstract abridged. 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":"  Understanding the nature of high-$z$ dusty galaxies requires a comprehensive\nview of their ISM and molecular complexity. However, the molecular ISM at high\nredshifts is commonly studied using only a few species beyond CO, limiting our\nunderstanding of the ISM in these objects. In this paper, we present the\nresults of deep 3 mm spectral line surveys using the NOEMA targeting two lensed\ndusty galaxies: APM 08279+5255 (APM), a quasar at redshift $z=3.911$, and\nNCv1.143 (NC), a $z=3.565$ starburst galaxy. The spectral line surveys cover\nrest-frame frequencies from about 330-550 GHz. We report the detection of 38\nand 25 emission lines in APM and NC, respectively. The spectra reveal the\nchemical richness and the complexity of the physical properties of the ISM. By\ncomparing the spectra of the two sources and combining the gas excitation\nanalysis, we find that the physical properties and the chemical imprints of the\nISM are different between them: the molecular gas is more excited in APM,\nexhibiting higher molecular-gas temperatures and densities compared to NC; the\nchemical abundances in APM are akin to the values of local AGN, showing boosted\nrelative abundances of the dense gas tracers that might be related to\nhigh-temperature chemistry and/or XDRs, while NC more closely resembles local\nstarburst galaxies. The most significant differences are found in H2O, where\nthe 448 GHz H2O line is significantly brighter in APM, likely linked to the\nintense far-infrared radiation from the dust powered by AGN. Our astrochemical\nmodel suggests that, at such high column densities, UV radiation is less\nimportant in regulating the ISM, while CRs (and/or X-rays and shocks) are the\nkey players in shaping the abundance of the molecules. Such deep spectral line\nsurveys open a new window to study the physical and chemical properties of the\nISM and the radiation field of galaxies in the early Universe. (abridged)\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Chentao",""],["Omont","Alain",""],["Mart\u00edn","Sergio",""],["Bisbas","Thomas G.",""],["Cox","Pierre",""],["Beelen","Alexandre",""],["Gonz\u00e1lez-Alfonso","Eduardo",""],["Gavazzi","Rapha\u00ebl",""],["Aalto","Susanne",""],["Andreani","Paola",""],["Ceccarelli","Cecilia",""],["Gao","Yu",""],["Gorski","Mark",""],["Gu\u00e9lin","Michel",""],["Fu","Hai",""],["Ivison","Rob J.",""],["Knudsen","Kirsten K.",""],["Lehnert","Matthew",""],["Messias","Hugo",""],["Muller","Sebastien",""],["Neri","Roberto",""],["Riechers","Dominik",""],["van der Werf","Paul",""],["Zhang","Zhi-Yu",""]]}
{"id":"2308.07369","submitter":"Nicholas Ballering","authors":"Nicholas P. Ballering, L. Ilsedore Cleeves, Thomas J. Haworth, John\n  Bally, Josh A. Eisner, Adam Ginsburg, Ryan D. Boyden, Min Fang, Jinyoung\n  Serena Kim","title":"Isolating Dust and Free-Free Emission in ONC Proplyds with ALMA Band 3\n  Observations","comments":"17 pages, 12 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Orion Nebula Cluster (ONC) hosts protoplanetary disks experiencing\nexternal photoevaporation by the cluster's intense UV field. These ``proplyds\"\nare comprised of a disk surrounded by an ionization front. We present ALMA Band\n3 (3.1 mm) continuum observations of 12 proplyds. Thermal emission from the\ndust disks and free-free emission from the ionization fronts are both detected,\nand the high-resolution (0.057\") of the observations allows us to spatially\nisolate these two components. The morphology is unique compared to images at\nshorter (sub)millimeter wavelengths, which only detect the disks, and images at\nlonger centimeter wavelengths, which only detect the ionization fronts. The\ndisks are small ($r_d$ = 6.4--38 au), likely due to truncation by ongoing\nphotoevaporation. They have low spectral indices ($\\alpha \\lesssim 2.1$)\nmeasured between Bands 7 and 3, suggesting the dust emission is optically\nthick. They harbor tens of Earth masses of dust as computed from the millimeter\nflux using the standard method, although their true masses may be larger due to\nthe high optical depth. We derive their photoevaporative mass-loss rates in two\nways: first, by invoking ionization equilibrium, and second using the\nbrightness of the free-free emission to compute the density of the outflow. We\nfind decent agreement between these measurements and $\\dot M$ = 0.6--18.4\n$\\times$ 10$^{-7}$ $M_\\odot$ yr$^{-1}$. The photoevaporation timescales are\ngenerally shorter than the $\\sim$1 Myr age of the ONC, underscoring the known\n``proplyd lifetime problem.\" Disk masses that are underestimated due to being\noptically thick remains one explanation to ease this discrepancy.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ballering","Nicholas P.",""],["Cleeves","L. Ilsedore",""],["Haworth","Thomas J.",""],["Bally","John",""],["Eisner","Josh A.",""],["Ginsburg","Adam",""],["Boyden","Ryan D.",""],["Fang","Min",""],["Kim","Jinyoung Serena",""]]}
{"id":"2308.07370","submitter":"Thallis Pessi","authors":"Thallis Pessi, Jose L. Prieto and Luc Dessart","title":"Very late-time spectroscopy of SN 2009ip: Constraints on the ongoing\n  H$\\alpha$ emission","comments":null,"journal-ref":"A&A 677, L1 (2023)","doi":"10.1051/0004-6361/202347319","report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The peculiar supernova (SN) 2009ip is an ambiguous event that spurred many\nquestions regarding its true origins. Here, we present very late-time\nspectroscopic and photometric observations of SN 2009ip, obtained 9 years (3274\ndays) after the 2012B outburst. We analyze the H$\\alpha$ emission still present\nin the very late-time spectrum of SN 2009ip. We also obtain photometric\nmeasurements in the $r$, $g,$ and $i$ bands. We obtained observations of SN\n2009ip on 2021 September 10 with the IMACS instrument at the 6.5 m Magellan\nBaade Telescope, located at the Las Campanas Observatory. SN 2009ip was\ndetected in the $r$, $g,$ and $i$ bands, with an absolute magnitude in $r$ band\nof $\\sim -8.66$~mag. We show that the source faded significantly since the last\nobservations in these bands. We further show that the very late-time spectrum\ncontains a persistent H$\\alpha$ emission, although no other emission lines were\ndetected. We measured a full width at half maximum (FWHM) of $930 \\pm 40 \\\n\\textrm{km s}^{-1}$ and luminosity of $\\sim 8.0 \\times 10^{37} \\ \\textrm{erg\ns}^{-1}$ for the H$\\alpha$ emission. The luminosity decreased relatively slowly\nin comparison to the last observations and its fading rate is very similar to\nother long-living interacting transients, such as SN 2005ip. Finally, we\nconclude that although these properties could be consistent with a non-regular\ncore-collapse SN, they may also be explained through non-terminal explosion\nscenarios.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pessi","Thallis",""],["Prieto","Jose L.",""],["Dessart","Luc",""]]}
{"id":"2308.07371","submitter":"Julian Y. G\\\"unther","authors":"Florian Domingo, Julian G\\\"unther, Jong Soo Kim, Zeren Simon Wang","title":"A C++ program for estimating detector sensitivities to long-lived\n  particles: Displaced Decay Counter","comments":"v1: 16 pages, 4 figures; v2: refs updated; the tool is publicly\n  accessible at https://github.com/wzeren/Displaced-Decay-Counter","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A series of far-detector programs have been proposed for operation at various\ninteraction points of the Large Hadron Collider during the upcoming runs.\nInvestigating the potential and complementarity of these experiments for\nnew-physics searches goes through the estimation of their sensitivity to\nspecific long-lived particle models. Here, we present an integrated numerical\ntool written in the C++ language and called Displaced Decay Counter, which we\nhave created to this end and which can be used in association with MadGraph5,\nPythia8, or any other state-of-the-art Monte-Carlo collider simulation tool.\nSeveral far-detector models have been implemented within the program,\naccounting for the geometry and integrated luminosity of projected detectors.\nAdditional or more accurate designs can be easily constructed through a\ndedicated interface. The functionality of this tool is exemplified through the\ndiscussion of three benchmark scenarios, which we considered for the validation\nof the implemented detector models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:04 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 09:36:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Domingo","Florian",""],["G\u00fcnther","Julian",""],["Kim","Jong Soo",""],["Wang","Zeren Simon",""]]}
{"id":"2308.07372","submitter":"Abhishodh Prakash","authors":"Abhishodh Prakash and Alain Goriely and S.L. Sondhi","title":"Classical Non-Relativistic Fractons","comments":"21 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We initiate the study of the classical mechanics of non-relativistic fractons\nin its simplest setting - that of identical one dimensional particles with\nlocal Hamiltonians characterized by by a conserved dipole moment in addition to\nthe usual symmetries of space and time translation invariance. We introduce a\nfamily of models and study the $N$ body problem for them. We find that locality\nleads to a ``Machian\" dynamics in which a given particle exhibits finite\ninertia only if within a specified distance of at least another one. For well\nseparated particles this leads to immobility, much as for quantum models of\nfractons discussed before. For two or more particles within inertial reach of\neach other at the start of motion we get an interesting interplay of inertia\nand interactions. Specifically for a solvable ``inertia only\" model of fractons\nwe find that $N=2$ particles always become immobile at long times. Remarkably\n$N =3$ particles generically evolve to a late time state with one immobile\nparticle and two that oscillate about a common center of mass with\ngeneralizations of such ``Machian clusters\" for $N > 3$ . Interestingly,\nMachian clusters exhibit physical limit cycles in a Hamiltonian system even\nthough mathematical limit cycles are forbidden by Liouville's theorem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Prakash","Abhishodh",""],["Goriely","Alain",""],["Sondhi","S. L.",""]]}
{"id":"2308.07373","submitter":"Emil Have","authors":"Jelle Hartong, Emil Have, Niels A. Obers, Igor Pikovski","title":"A coupling prescription for post-Newtonian corrections in Quantum\n  Mechanics","comments":"43 pages incl. 1 appendix, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The interplay between quantum theory and general relativity remains one of\nthe main challenges of modern physics. A renewed interest in the low-energy\nlimit is driven by the prospect of new experiments that could probe this\ninterface. Here we develop a covariant framework for expressing post-Newtonian\ncorrections to Schr\\\"odinger's equation on arbitrary gravitational backgrounds\nbased on a $1/c^2$ expansion of Lorentzian geometry, where $c$ is the speed of\nlight. Our framework provides a generic coupling prescription of quantum\nsystems to gravity that is valid in the intermediate regime between Newtonian\ngravity and General Relativity, and that retains the focus on geometry. At each\norder in $1/c^2$ this produces a nonrelativistic geometry to which quantum\nsystems at that order couple. By considering the gauge symmetries of both the\nnonrelativistic geometries and the $1/c^2$ expansion of the complex\nKlein--Gordon field, we devise a prescription that allows us to derive the\nSchr\\\"odinger equation and its post-Newtonian corrections on a gravitational\nbackground order-by-order in $1/c^2$. We also demonstrate that these results\ncan be obtained from a $1/c^2$ expansion of the complex Klein--Gordon\nLagrangian. We illustrate our methods by performing the $1/c^2$ expansion of\nthe Kerr metric up to $\\mathcal{O}(c^{-2})$, which leads to a special case of\nthe Hartle--Thorne metric. The associated Schr\\\"odinger equation captures novel\nand potentially measurable effects.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hartong","Jelle",""],["Have","Emil",""],["Obers","Niels A.",""],["Pikovski","Igor",""]]}
{"id":"2308.07374","submitter":"Matt Visser","authors":"Rudeep Gaur (Victoria University of Wellington) and Matt Visser\n  (Victoria University of Wellington)","title":"Black holes embedded in FLRW cosmologies","comments":"V1: 22 pages. V2: Two references added; no physics changes","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There has recently been some considerable interest expressed in a highly\nspeculative model of black hole evolution -- allegedly by a postulated direct\ncoupling between black holes and cosmological expansion independently of\naccretion or mergers. We wish to make several cautionary comments in this\nregard -- at least three exact solutions corresponding to black holes embedded\nin a FLRW background are known, (Kottler, McVittie, Kerr-de Sitter), and they\nshow no hint of this claimed effect -- thereby implying that this claimed\neffect (if it exists at all) is certainly nowhere near ubiquitous.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:07 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 03:56:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gaur","Rudeep","","Victoria University of Wellington"],["Visser","Matt","","Victoria University of Wellington"]]}
{"id":"2308.07375","submitter":"Sophie Klett","authors":"Sudip Jana, Sophie Klett","title":"Muonic Force and Neutrino Non-Standard Interactions at Muon Colliders","comments":"4 figures, 6 pages + references","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The discovery of neutrino oscillations implies that neutrinos are massive and\nmixed, necessitating an extension of the Standard Model, which may require the\nintroduction of non-standard neutrino interactions (NSI). We investigate the\npotential of a high-energy muon collider to probe such NSIs with muons,\nspecifically focusing on muonic forces. By analyzing the monophoton signal from\nthe process $\\mu^+ \\mu^- \\rightarrow \\nu \\overline{\\nu } \\gamma$, we explore\nfour-fermion contact interactions involving two muons and two neutrinos.\nMoreover, we examine minimal models that generate scalar and vector-mediated\nNSIs and study their phenomenology. Projected sensitivities for the strength of\nNSIs, $\\epsilon_{\\alpha \\beta}^{\\mu \\mu}$, are presented at a 95$\\%$ confidence\nlevel for a center-of-mass energy of 3 TeV and integrated luminosities of\n$\\mathcal{L} = 1$ and $10~\\mathrm{ab}^{-1}$, showcasing the complementarity\nbetween a muon collider and other experimental probes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jana","Sudip",""],["Klett","Sophie",""]]}
{"id":"2308.07376","submitter":"Paramita Dutta","authors":"Amartya Pal, Arijit Saha, and Paramita Dutta","title":"Transport signatures of Bogoliubov Fermi surfaces in normal\n  metal/time-reversal symmetry broken $d$-wave superconductor junctions","comments":"6+6 pages, 4+4 figures, comments welcome","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 recent times, Bogoliubov Fermi surfaces (BFSs) in superconductors (SCs)\nhave drawn significant attention due to a substantial population of Bogoliubov\nquasiparticles (BQPs) together with Cooper pairs (CPs) in them. The BQPs as\nzero energy excitations give rise to captivating and intricate charge dynamics\nwithin the BFSs. In this theoretical study, we propose to reveal the unique\nsignatures of the topologically protected BFSs in a normal metal/time-reversal\nsymmetry (TRS) broken $d$-wave SC, in terms of the differential conductance and\nFano factor (FF). For an isotropic $d$-wave SC, an enhancement in zero-bias\nconductance (ZBC) can be identified as a key signature of BFSs. However, for\nthe anisotropic SC, this feature does not replicate due to the presence of the\nlocalized Andreev bound state (ABS) at the interface. The interplay of ABS and\nBFSs gives rise to an anomalous behavior in ZBC. We explain this anomalous\nbehavior by analyzing the effective charge of the carriers in terms of the FF.\nThe simplicity of our setup based on $d$-wave SC makes our proposal persuasive.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:00:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pal","Amartya",""],["Saha","Arijit",""],["Dutta","Paramita",""]]}
{"id":"2308.07377","submitter":"Karri Koljonen","authors":"Karri I. I. Koljonen, Manuel Linares","title":"A Gaia view of the optical and X-ray luminosities of compact binary\n  millisecond pulsars","comments":"24 pages, 17 figures, 9 tables. This article has been accepted for\n  publication in MNRAS published by Oxford University Press on behalf of the\n  Royal Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study compact binary millisecond pulsars with low- and very\nlow-mass companion stars (spiders) in the Galactic field, using data from the\nlatest Gaia data release (DR3). We infer the parallax distances of the optical\ncounterparts to spiders, which we use to estimate optical and X-ray\nluminosities. We compare the parallax distances to those derived from radio\npulse dispersion measures and find that they have systematically larger values,\nby 40% on average. We also test the correlation between X-ray and spin-down\nluminosities, finding that most redbacks have a spin-down to X-ray luminosity\nconversion efficiency of $\\sim$0.1%, indicating a contribution from the\nintrabinary shock. On the other hand, most black widows have an efficiency of\n$\\sim$0.01%, similar to the majority of the pulsar population. Finally, we find\nthat the bolometric optical luminosity significantly correlates with the\norbital period, with a large scatter due to different irradiated stellar\ntemperatures and binary properties. We interpret this correlation as the effect\nof the increasing size of the Roche Lobe radius with the orbital period. With\nthis newly found correlation, an estimate of the optical magnitude can be\nobtained from the orbital period and a distance estimate.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:01:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Koljonen","Karri I. I.",""],["Linares","Manuel",""]]}
{"id":"2308.07378","submitter":"Kim Sung-Bin","authors":"Kwon Byung-Ki, Kim Sung-Bin, Tae-Hyun Oh","title":"The Devil in the Details: Simple and Effective Optical Flow Synthetic\n  Data Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent work on dense optical flow has shown significant progress, primarily\nin a supervised learning manner requiring a large amount of labeled data. Due\nto the expensiveness of obtaining large scale real-world data, computer\ngraphics are typically leveraged for constructing datasets. However, there is a\ncommon belief that synthetic-to-real domain gaps limit generalization to real\nscenes. In this paper, we show that the required characteristics in an optical\nflow dataset are rather simple and present a simpler synthetic data generation\nmethod that achieves a certain level of realism with compositions of elementary\noperations. With 2D motion-based datasets, we systematically analyze the\nsimplest yet critical factors for generating synthetic datasets. Furthermore,\nwe propose a novel method of utilizing occlusion masks in a supervised method\nand observe that suppressing gradients on occluded regions serves as a powerful\ninitial state in the curriculum learning sense. The RAFT network initially\ntrained on our dataset outperforms the original RAFT on the two most\nchallenging online benchmarks, MPI Sintel and KITTI 2015.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:01:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Byung-Ki","Kwon",""],["Sung-Bin","Kim",""],["Oh","Tae-Hyun",""]]}
{"id":"2308.07379","submitter":"Petter Taule","authors":"Petter Taule, Mathias Garny","title":"The two-loop power spectrum in redshift space","comments":"23 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the matter power spectrum in redshift space including two-loop\ncorrections. We follow a strictly perturbative approach incorporating all\nnon-linearities entering both via the redshift-space mapping and within real\nspace up to the required (fifth) order, complemented by suitable effective\nfield theory (EFT) corrections. This approach can a priori be viable up to\nscales of order $0.2h~\\mathrm{Mpc}^{-1}$ beyond which power suppression related\nto the finger-of-God effect becomes non-perturbatively strong. We extend a\nsimplified treatment of EFT corrections at two-loop order from real to redshift\nspace, making sure that the leading UV-sensitivity of both the single-hard and\ndouble-hard limit of the two-loop contributions to the power spectrum is\naccounted for, and featuring two free parameters for each multipole. Taking\nalso infrared-resummation into account, we calibrate with and compare to\nQuijote $N$-body simulations for the monopole and quadrupole at redshifts $z=0$\nand $z=0.5$. We find agreement within sample variance (at percent-level) up to\n$0.18h~\\mathrm{Mpc}^{-1}$ at two-loop order, compared to\n$0.1h~\\mathrm{Mpc}^{-1}$ at one-loop. We also investigate the role of\nhigher-derivative corrections.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:02:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Taule","Petter",""],["Garny","Mathias",""]]}
{"id":"2308.07380","submitter":"Zi Hong Liu","authors":"Zi Hong Liu, Yuan Da Liao, Gaopei Pan, Weilun Jiang, Chao-Ming Jian,\n  Yi-Zhuang You, Fakher F. Assaad, Zi Yang Meng, and Cenke Xu","title":"Disorder Operator and R\\'enyi Entanglement Entropy of Symmetric Mass\n  Generation","comments":"15 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":"  In recent years a consensus has gradually been reached that the previously\nproposed deconfined quantum critical point (DQCP) for spin-1/2 systems, an\narchetypal example of quantum phase transition beyond the classic Landau's\nparadigm, actually does not correspond to a true unitary conformal field theory\n(CFT). In this work we carefully investigate another type of quantum phase\ntransition supposedly beyond the similar classic paradigm, the so called\n``symmetric mass generation\" (SMG) transition proposed in recent years. We\nemploy the sharp diagnosis including the scaling of disorder operator and\nR\\'enyi entanglement entropy in large-scale lattice model quantum Monte Carlo\nsimulations. Our results strongly suggest that the SMG transition is indeed an\nunconventional quantum phase transition and it should correspond to a true\n$(2+1)d$ unitary CFT.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:03:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Zi Hong",""],["Da Liao","Yuan",""],["Pan","Gaopei",""],["Jiang","Weilun",""],["Jian","Chao-Ming",""],["You","Yi-Zhuang",""],["Assaad","Fakher F.",""],["Meng","Zi Yang",""],["Xu","Cenke",""]]}
{"id":"2308.07381","submitter":"Anne Inkenhaag","authors":"Anne Inkenhaag, Peter G. Jonker, Andrew J. Levan, Ashley A. Chrimes,\n  Andrew Mummery, Daniel A. Perley, Nial R. Tanvir","title":"Late time HST UV and optical observations of AT~2018cow: extracting a\n  cow from its background","comments":"16 pages, 10 figures. Accepted for publication in MNRAS","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 bright, blue, rapidly evolving AT2018cow is a well-studied peculiar\nextragalactic transient. Despite an abundance of multi-wavelength data, there\nstill is no consensus on the nature of the event. We present our analysis of\nthree epochs of Hubble Space Telescope (HST) observations spanning the period\nfrom 713-1474 days post burst, paying particular attention to uncertainties of\nthe transient photometry introduced by the complex background in which\nAT2018cow resides. Photometric measurements show evident fading in the UV and\nmore subtle but significant fading in the optical. During the last HST\nobservation, the transient's optical/UV colours were still bluer than those of\nthe substantial population of compact, young, star-forming regions in the host\nof AT2018cow, suggesting some continued transient contribution to the light.\nHowever, a compact source underlying the transient would substantially modify\nthe resulting spectral energy distribution, depending on its contribution in\nthe various bands. In particular, in the optical filters, the complex, diffuse\nbackground poses a problem for precise photometry. An underlying cluster is\nexpected for a supernova occurring within a young stellar environment or a\ntidal-disruption event (TDE) within a dense older one. While many recent works\nhave focused on the supernova interpretation, we note the substantial\nsimilarity in UV light-curve morphology between AT2018cow and several tidal\ndisruption events around supermassive black holes. Assuming AT2018cow arises\nfrom a TDE-like event, we fit the late-time emission with a disc model and find\n$M_{BH} = 10^{3.2{\\pm}0.8}$ M$_{\\odot}$. Further observations are necessary to\ndetermine the late-time evolution of the transient and its immediate\nenvironment.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:06:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Inkenhaag","Anne",""],["Jonker","Peter G.",""],["Levan","Andrew J.",""],["Chrimes","Ashley A.",""],["Mummery","Andrew",""],["Perley","Daniel A.",""],["Tanvir","Nial R.",""]]}
{"id":"2308.07382","submitter":"Dalius Stulga","authors":"Vlad-Mihai Mandric, Tim R. Morris and Dalius Stulga","title":"Off-shell divergences in quantum gravity","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate off-shell perturbative renormalisation of pure quantum gravity\nfor both background metric and quantum fluctuations. We show that at each new\nloop order, the divergences that do not vanish on-shell are constructed from\nonly the total metric, whilst those that vanish on-shell are renormalised by\ncanonical transformations involving the quantum fields. Purely background\nmetric divergences do not separately appear, and the background metric does not\nget renormalised. We highlight that renormalisation group identities play a\ncrucial role ensuring consistency in the renormalisation of BRST\ntransformations beyond one loop order. We verify these assertions by computing\nleading off-shell divergences to two loops, exploiting off-shell BRST\ninvariance and the renormalisation group equations. Although some divergences\ncan be absorbed by field redefinitions, we explain why this does not lead to\nfinite beta-functions for the corresponding field.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:07:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mandric","Vlad-Mihai",""],["Morris","Tim R.",""],["Stulga","Dalius",""]]}
{"id":"2308.07383","submitter":"Philipp R\\\"u{\\ss}mann","authors":"Philipp R\\\"u{\\ss}mann, David Antognini Silva, Mohammad Hemmati, Ilias\n  Klepetsanis, Bj\\\"orn Trauzettel, Phivos Mavropoulos, Stefan Bl\\\"ugel","title":"Density-functional description of materials for topological qubits and\n  superconducting spintronics","comments":null,"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":"  Interfacing superconductors with magnetic or topological materials offers a\nplayground where novel phenomena like topological superconductivity, Majorana\nzero modes, or superconducting spintronics are emerging. In this work, we\ndiscuss recent developments in the Kohn-Sham Bogoliubov-de Gennes method, which\nallows to perform material-specific simulations of complex superconducting\nheterostructures on the basis of density functional theory. As a model system\nwe study magnetically-doped Pb. In our analysis we focus on the interplay of\nmagnetism and superconductivity. This combination leads to Yu-Shiba-Rusinov\n(YSR) in-gap bound states at magnetic defects and the breakdown of\nsuperconductivity at larger impurity concentrations. Moreover, the influence of\nspin-orbit coupling and on orbital splitting of YSR states as well as the\nappearance of a triplet component in the order parameter is discussed. These\neffects can be exploited in S/F/S-type devices (S=superconductor,\nF=ferromagnet) in the field of superconducting spintronics.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:08:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["R\u00fc\u00dfmann","Philipp",""],["Silva","David Antognini",""],["Hemmati","Mohammad",""],["Klepetsanis","Ilias",""],["Trauzettel","Bj\u00f6rn",""],["Mavropoulos","Phivos",""],["Bl\u00fcgel","Stefan",""]]}
{"id":"2308.07384","submitter":"Arav Agarwal","authors":"Kira Adaricheva, Arav Agarwal, Na'ama Nevo","title":"Representation of convex geometries of convex dimension 3 by spheres","comments":"11 pages. 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A convex geometry is a closure system satisfying the anti-exchange property.\nThis paper, following the work of Adaricheva and Bolat (2019) and the Polymath\nREU (2020), continues to investigate representations of convex geometries with\nsmall convex dimension by convex shapes on the plane and in spaces of higher\ndimension. In particular, we answer in the negative the question raised by\nPolymath REU (2020): whether every convex geometry of $cdim=3$ is representable\nby the circles on the plane. We show there are geometries of $cdim=3$ that\ncannot be represented by spheres in any $\\mathbb{R}^k$, and this connects to\nposets not representable by spheres from the paper of Felsner, Fishburn and\nTrotter (1999). On the positive side, we use the result of Kincses (2015) to\nshow that every finite poset is an ellipsoid order.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:08:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Adaricheva","Kira",""],["Agarwal","Arav",""],["Nevo","Na'ama",""]]}
{"id":"2308.07385","submitter":"Micha({\\L}) Be({\\L})Dzi(\\'N)Ski","authors":"Micha{\\l} Be{\\l}dzi\\'nski, Marek Galewski, Igor Kossowski","title":"On a version of hybrid existence result for a system of nonlinear\n  equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Combining monotonicity theory related to the parametric version of the\nBrowder-Minty Theorem with fixed point arguments we obtain hybrid existence\nresults for a system of two operator equations. Applications are given to a\nsystem of boundary value problems with mixed nonlocal and Dirichlet conditions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:08:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Be\u0142dzi\u0144ski","Micha\u0142",""],["Galewski","Marek",""],["Kossowski","Igor",""]]}
{"id":"2308.07386","submitter":"Yang Zhang Dr.","authors":"Yang Zhang and Ling-Fang Lin and Adriana Moreo and Thomas A. Maier and\n  Elbio Dagotto","title":"Trends of electronic structures and $s_{\\pm}$-wave pairing for the\n  rare-earth series in bilayer nickelate superconductor $R_ 3$Ni$_2$O$_7$","comments":"Main text (6 pages, 5 figures) plus SM(9 pages, 13 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 recent discovery of pressure-induced superconductivity in the bilayer\nLa$_3$Ni$_2$O$_7$ (LNO) has opened a new platform for the study of\nunconventional superconductors. In this publication, we investigate\ntheoretically the whole family of bilayer 327-type nickelates $R_3$Ni$_2$O$_7$\n($R$ = Rare-earth elements) under pressure. From La to Lu, the lattice\nconstants and volume decrease, leading to enhanced in-plane and out-plane\nhoppings, resulting in an ``effectively'' reduced electronic correlation $U/W$.\nFurthermore, the Ni's $t_{2g}$ states shift away from the $e_g$ states, while\nthe crystal-field splitting between $d_{3z^2-r^2}$ and $d_{x^2-y^2}$ is almost\nunchanged. In addition, six candidates were found to become stable in the Fmmm\nphase, with increasing values of critical pressure as the atomic number\nincreases. Similar to the case of LNO, the $s_{\\pm}$-wave pairing tendency\ndominates in all candidates, due to the nesting between the {\\bf M}=$(\\pi,\\pi)$\nand the {\\bf X}=$(\\pi,0)$ and {\\bf Y}=$(0,\\pi)$ points in the Brillouin zone.\nThen, $T_c$ is expected to decrease as the radius of rare-earth (RE) ions\ndecreases. Our results suggest that LNO is already the ``optimal'' candidate\namong the whole RE bilayer nickelates, and to increase $T_c$ we suggest to grow\non special substrates with larger in-plane lattice spacings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:09:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yang",""],["Lin","Ling-Fang",""],["Moreo","Adriana",""],["Maier","Thomas A.",""],["Dagotto","Elbio",""]]}
{"id":"2308.07387","submitter":"Priyank Upadhya","authors":"Indu Joshi, Priyank Upadhya, Gaurav Kumar Nayak, Peter Sch\\\"uffler and\n  Nassir Navab","title":"DISBELIEVE: Distance Between Client Models is Very Essential for\n  Effective Local Model Poisoning Attacks","comments":"Accepted by MICCAI 2023 - DeCaF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.CV cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning is a promising direction to tackle the privacy issues\nrelated to sharing patients' sensitive data. Often, federated systems in the\nmedical image analysis domain assume that the participating local clients are\n\\textit{honest}. Several studies report mechanisms through which a set of\nmalicious clients can be introduced that can poison the federated setup,\nhampering the performance of the global model. To overcome this, robust\naggregation methods have been proposed that defend against those attacks. We\nobserve that most of the state-of-the-art robust aggregation methods are\nheavily dependent on the distance between the parameters or gradients of\nmalicious clients and benign clients, which makes them prone to local model\npoisoning attacks when the parameters or gradients of malicious and benign\nclients are close. Leveraging this, we introduce DISBELIEVE, a local model\npoisoning attack that creates malicious parameters or gradients such that their\ndistance to benign clients' parameters or gradients is low respectively but at\nthe same time their adverse effect on the global model's performance is high.\nExperiments on three publicly available medical image datasets demonstrate the\nefficacy of the proposed DISBELIEVE attack as it significantly lowers the\nperformance of the state-of-the-art \\textit{robust aggregation} methods for\nmedical image analysis. Furthermore, compared to state-of-the-art local model\npoisoning attacks, DISBELIEVE attack is also effective on natural images where\nwe observe a severe drop in classification performance of the global model for\nmulti-class classification on benchmark dataset CIFAR-10.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:09:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Joshi","Indu",""],["Upadhya","Priyank",""],["Nayak","Gaurav Kumar",""],["Sch\u00fcffler","Peter",""],["Navab","Nassir",""]]}
{"id":"2308.07388","submitter":"Micheline Soley","authors":"Micheline B. Soley and Deniz D. Yavuz","title":"Quantum Simulator Based on the Paraxial Wave Equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a paraxial quantum simulator that requires only widely available\noptical fibers or metamaterials. Such a simulator would facilitate\ncost-effective quantum simulation without specialized techniques. We show\ntheoretically that the method accurately simulates quantum dynamics and quantum\neffects for an example system, which invites extension of the method to\nmany-body systems using nonlinear optical elements and implementation of the\nparaxial quantum simulator to extend access to quantum computation and\nprototype quantum parity-time reversal ($\\mathcal{PT}$) symmetric technologies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:15:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Soley","Micheline B.",""],["Yavuz","Deniz D.",""]]}
{"id":"2308.07389","submitter":"Marcin Ma\\'zdziarz","authors":"Marcin Ma\\'zdziarz","title":"Transferability of interatomic potentials for germanene (2D germanium)","comments":"20 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The capacities of various interatomic potentials to reconstruct the\nproperties of germanene (2D germanium) allotropes were investigated. Structural\nand mechanical properties \\comm{, as well as phonon dispersion} of the flat\n(F), low-buckled (LB), trigonal dumbbell (TD) and large honeycomb dumbbell\n(LHD) single-layer germanium (germanene) phases, were obtained using the\ndensity functional theory (DFT) and molecular statics (MS) computations with\nTersoff, MEAM, Stillinger-Weber, EDIP, ReaxFF and machine-learning-based\n(ML-IAP) interatomic potentials. A systematic quantitative comparative study\nand discussion of the findings are given.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:16:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ma\u017adziarz","Marcin",""]]}
{"id":"2308.07390","submitter":"Olaf Lechtenfeld","authors":"Francisco Correa, Gonzalo Leal, Olaf Lechtenfeld, Ian Marquette","title":"A Casimir operator for the Calogero $W$ algebra","comments":"1+12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the nonlinear algebra $W_3$ generated by the 9 functionally\nindependent permutation-symmetric operators in the three-particle rational\nquantum Calogero model. Decoupling the center of mass, we pass to a smaller\nalgebra $W'_3$ generated by 7 operators, which fall into a spin-$1$ and a\nspin-$\\frac32$ representation of the conformal $sl(2)$ subalgebra. The\ncommutators of the spin-$\\frac32$ generators with each other are quadratic in\nthe spin-$1$ generators, with a central term depending on the Calogero\ncoupling. One expects this algebra to feature three Casimir operators, and we\nconstruct the lowest one explicitly in terms of Weyl-ordered products of the 7\ngenerators. It is a polynomial of degree 6 in these generators, with\ncoefficients being up to quartic in $\\hbar$ and quadratic polynomials in the\nCalogero coupling $\\hbar^2g(g{-}1)$. Putting back the center of mass, our\nCasimir operator for $W_3$ is a degree-9 polynomial in the 9 generators. The\ncomputations require the evaluation of nested Weyl orderings. The classical and\nfree-particle limits are also given. Our scheme can be extended to any finite\nnumber $N$ of Calogero particles and the corresponding nonlinear algebras $W_N$\nand $W'_N$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:17:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Correa","Francisco",""],["Leal","Gonzalo",""],["Lechtenfeld","Olaf",""],["Marquette","Ian",""]]}
{"id":"2308.07391","submitter":"Jiayi Liu","authors":"Jiayi Liu, Ali Mahdavi-Amiri, Manolis Savva","title":"PARIS: Part-level Reconstruction and Motion Analysis for Articulated\n  Objects","comments":"Presented at ICCV 2023. Project website:\n  https://3dlg-hcvc.github.io/paris/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the task of simultaneous part-level reconstruction and motion\nparameter estimation for articulated objects. Given two sets of multi-view\nimages of an object in two static articulation states, we decouple the movable\npart from the static part and reconstruct shape and appearance while predicting\nthe motion parameters. To tackle this problem, we present PARIS: a\nself-supervised, end-to-end architecture that learns part-level implicit shape\nand appearance models and optimizes motion parameters jointly without any 3D\nsupervision, motion, or semantic annotation. Our experiments show that our\nmethod generalizes better across object categories, and outperforms baselines\nand prior work that are given 3D point clouds as input. Our approach improves\nreconstruction relative to state-of-the-art baselines with a Chamfer-L1\ndistance reduction of 3.94 (45.2%) for objects and 26.79 (84.5%) for parts, and\nachieves 5% error rate for motion estimation across 10 object categories.\n  Video summary at: https://youtu.be/tDSrROPCgUc\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:18:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Jiayi",""],["Mahdavi-Amiri","Ali",""],["Savva","Manolis",""]]}
{"id":"2308.07392","submitter":"Tian-Zhu Xiang","authors":"Bo Dong, Jialun Pei, Rongrong Gao, Tian-Zhu Xiang, Shuo Wang, Huan\n  Xiong","title":"A Unified Query-based Paradigm for Camouflaged Instance Segmentation","comments":"This paper has been accepted by ACM MM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the high similarity between camouflaged instances and the background,\nthe recently proposed camouflaged instance segmentation (CIS) faces challenges\nin accurate localization and instance segmentation. To this end, inspired by\nquery-based transformers, we propose a unified query-based multi-task learning\nframework for camouflaged instance segmentation, termed UQFormer, which builds\na set of mask queries and a set of boundary queries to learn a shared composed\nquery representation and efficiently integrates global camouflaged object\nregion and boundary cues, for simultaneous instance segmentation and instance\nboundary detection in camouflaged scenarios. Specifically, we design a composed\nquery learning paradigm that learns a shared representation to capture object\nregion and boundary features by the cross-attention interaction of mask queries\nand boundary queries in the designed multi-scale unified learning transformer\ndecoder. Then, we present a transformer-based multi-task learning framework for\nsimultaneous camouflaged instance segmentation and camouflaged instance\nboundary detection based on the learned composed query representation, which\nalso forces the model to learn a strong instance-level query representation.\nNotably, our model views the instance segmentation as a query-based direct set\nprediction problem, without other post-processing such as non-maximal\nsuppression. Compared with 14 state-of-the-art approaches, our UQFormer\nsignificantly improves the performance of camouflaged instance segmentation.\nOur code will be available at https://github.com/dongbo811/UQFormer.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:23:18 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 12:37:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dong","Bo",""],["Pei","Jialun",""],["Gao","Rongrong",""],["Xiang","Tian-Zhu",""],["Wang","Shuo",""],["Xiong","Huan",""]]}
{"id":"2308.07393","submitter":"Andrew Rosenberg","authors":"Yochai Blau, Rohan Agrawal, Lior Madmony, Gary Wang, Andrew Rosenberg,\n  Zhehuai Chen, Zorik Gekhman, Genady Beryozkin, Parisa Haghani, Bhuvana\n  Ramabhadran","title":"Using Text Injection to Improve Recognition of Personal Identifiers in\n  Speech","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/4.0/","abstract":"  Accurate recognition of specific categories, such as persons' names, dates or\nother identifiers is critical in many Automatic Speech Recognition (ASR)\napplications. As these categories represent personal information, ethical use\nof this data including collection, transcription, training and evaluation\ndemands special care. One way of ensuring the security and privacy of\nindividuals is to redact or eliminate Personally Identifiable Information (PII)\nfrom collection altogether. However, this results in ASR models that tend to\nhave lower recognition accuracy of these categories. We use text-injection to\nimprove the recognition of PII categories by including fake textual substitutes\nof PII categories in the training data using a text injection method. We\ndemonstrate substantial improvement to Recall of Names and Dates in medical\nnotes while improving overall WER. For alphanumeric digit sequences we show\nimprovements to Character Error Rate and Sentence Accuracy.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:26:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Blau","Yochai",""],["Agrawal","Rohan",""],["Madmony","Lior",""],["Wang","Gary",""],["Rosenberg","Andrew",""],["Chen","Zhehuai",""],["Gekhman","Zorik",""],["Beryozkin","Genady",""],["Haghani","Parisa",""],["Ramabhadran","Bhuvana",""]]}
{"id":"2308.07394","submitter":"Jaclyn Jensen","authors":"Jaclyn Jensen, Christian R. Hayes, Federico Sestito, Alan W.\n  McConnachie, Fletcher Waller, Simon E. T. Smith, Julio Navarro, Kim Venn","title":"Small-scale stellar haloes: detecting low surface brightness features in\n  the outskirts of Milky Way dwarf satellites","comments":"24 pages, 13 figures, 4 tables, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dwarf galaxies are valuable laboratories for dynamical studies related to\ndark matter and galaxy evolution, yet it is currently unknown just how\nphysically extended their stellar components are. Satellites orbiting the\nGalaxy's potential may undergo tidal stripping by the host, or alternatively,\nmay themselves have accreted smaller systems whose debris populates the dwarf's\nown stellar halo. Evidence of these past interactions, if present, is best\nsearched for in the outskirts of the satellite. However, foreground\ncontamination dominates the signal at these large radial distances, making\nobservation of stars in these regions difficult. In this work, we introduce an\nupdated algorithm for application to Gaia data that identifies candidate member\nstars of dwarf galaxies, based on spatial, color-magnitude and proper motion\ninformation, and which allows for an outer component to the stellar\ndistribution. Our method shows excellent consistency with spectroscopically\nconfirmed members from the literature despite having no requirement for radial\nvelocity information. We apply the algorithm to all $\\sim$60 Milky Way dwarf\ngalaxy satellites, and we find 9 dwarfs (Bo\\\"otes 1, Bo\\\"otes 3, Draco 2, Grus\n2, Segue 1, Sculptor, Tucana 2, Tucana 3, and Ursa Minor) that exhibit evidence\nfor a secondary, low-density outer profile. We identify many member stars which\nare located beyond 5 half-light radii (and in some cases, beyond 10). We argue\nthese distant stars are likely tracers of dwarf stellar haloes or tidal\nstreams, though ongoing spectroscopic follow-up will be required to determine\nthe origin of these extended stellar populations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:26:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jensen","Jaclyn",""],["Hayes","Christian R.",""],["Sestito","Federico",""],["McConnachie","Alan W.",""],["Waller","Fletcher",""],["Smith","Simon E. T.",""],["Navarro","Julio",""],["Venn","Kim",""]]}
{"id":"2308.07395","submitter":"Shaan Bijwadia","authors":"Shaan Bijwadia, Shuo-yiin Chang, Weiran Wang, Zhong Meng, Hao Zhang,\n  Tara N. Sainath","title":"Text Injection for Capitalization and Turn-Taking Prediction in Speech\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text injection for automatic speech recognition (ASR), wherein unpaired\ntext-only data is used to supplement paired audio-text data, has shown\npromising improvements for word error rate. This study examines the use of text\ninjection for auxiliary tasks, which are the non-ASR tasks often performed by\nan E2E model. In this work, we use joint end-to-end and internal language model\ntraining (JEIT) as our text injection algorithm to train an ASR model which\nperforms two auxiliary tasks. The first is capitalization, which is a\nde-normalization task. The second is turn-taking prediction, which attempts to\nidentify whether a user has completed their conversation turn in a digital\nassistant interaction. We show results demonstrating that our text injection\nmethod boosts capitalization performance for long-tail data, and improves\nturn-taking detection recall.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:28:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bijwadia","Shaan",""],["Chang","Shuo-yiin",""],["Wang","Weiran",""],["Meng","Zhong",""],["Zhang","Hao",""],["Sainath","Tara N.",""]]}
{"id":"2308.07396","submitter":"Ren\\'e Brandenberg","authors":"Ren\\'e Brandenberg and Paul Stursberg","title":"Extremal solutions for Network Flow with Differential Constraints -- A\n  Generalization of Spanning Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In network flow problems, there is a well-known one-to-one relationship\nbetween extreme points of the feasibility region and trees in the associated\nundirected graph. The same is true for the dual differential problem. In this\npaper, we study problems where the constraints of both problems appear\nsimultaneously, a variant which is motivated by an application in the expansion\nplanning of energy networks. We show that all extreme points still directly\ncorrespond to graph-theoretical structures in the underlying network. The\nreverse is generally also true in all but certain exceptional cases. We\nfurthermore characterize graphs in which these exceptional cases never occur\nand present additional criteria for when those cases do not occur due to\nparameter values.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:31:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Brandenberg","Ren\u00e9",""],["Stursberg","Paul",""]]}
{"id":"2308.07397","submitter":"Cornelia Pokalyuk","authors":"Vianney Brouard, Cornelia Pokalyuk, Marco Seiler, Hung Tran","title":"Spatial Invasion of Cooperative Parasites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR q-bio.PE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we study invasion probabilities and invasion times of\ncooperative parasites spreading in spatially structured host populations. The\nspatial structure of the host population is given by a random geometric graph\non $[0,1]^n$, $n\\in \\mathbb{N}$, with a Poisson($N$)-distributed number of\nvertices and in which vertices are connected over an edge when they have a\ndistance of at most $r_N\\in \\Theta\\left(N^{\\frac{\\beta-1}{n}}\\right)$ for some\n$0<\\beta<1$ and $N\\rightarrow \\infty$. At a host infection many parasites are\ngenerated and parasites move along edges to neighbouring hosts. We assume that\nparasites have to cooperate to infect hosts, in the sense that at least two\nparasites need to attack a host simultaneously. We find lower and upper bounds\non the invasion probability of the parasites in terms of survival probabilities\nof branching processes with cooperation. Furthermore, we characterize the\nasymptotic invasion time.\n  An important ingredient of the proofs is a comparison with infection dynamics\nof cooperative parasites in host populations structured according to a complete\ngraph, i.e. in well-mixed host populations. For these infection processes we\ncan show that invasion probabilities are asymptotically equal to survival\nprobabilities of branching processes with cooperation.\n  Furthermore, we build in the proofs on techniques developed in [BP22], where\nan analogous invasion process has been studied for host populations structured\naccording to a configuration model.\n  We substantiate our results with simulations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:33:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Brouard","Vianney",""],["Pokalyuk","Cornelia",""],["Seiler","Marco",""],["Tran","Hung",""]]}
{"id":"2308.07398","submitter":"Paul Levy","authors":"Baohua Fu, Daniel Juteau, Paul Levy and Eric Sommers","title":"Local geometry of special pieces of nilpotent orbits","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Special nilpotent orbits in simple Lie algebras play an important role in\nrepresentation theory. The nilpotent cone of a reductive Lie algebra is\npartitioned into locally closed subvarieties called special pieces, each\ncontaining exactly one special orbit. Lusztig conjectured that each special\npiece is the quotient of some smooth variety by a precise finite group $H$, a\nresult proved for the classical types by Kraft and Procesi. The present work is\nabout exceptional types. Our main result is a local version of Lusztig's\nconjecture: the intersection of a special piece with a Slodowy slice transverse\nto the minimal orbit in the piece is isomorphic to the quotient of a vector\nspace by $H$. Along the way, we complete our previous work on the generic\nsingularities of nilpotent orbit closures, by providing proofs for the last two\n`exotic' singularities. Two further, non-isolated, exotic singularities are\nstudied: we show that quotients $\\overline{{\\mathcal O}_{\\rm\nmini}(\\mathfrak{so}_8)}/\\mathfrak{S}_4$ and $\\overline{{\\mathcal O}_{\\rm\nmini}(\\mathfrak{sl}_3)}/\\mathfrak{S}_4$ occur as Slodowy slice singularities\nbetween nilpotent orbits in types $F_4$ and $E_8$ respectively. We also extend,\nto fields other than ${\\mathbb C}$, the results of Brylinski and Kostant on\nshared orbit pairs. In the course of our analysis, we discover a shared pair\nwhich is missing from Brylinski and Kostant's classification.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:35:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fu","Baohua",""],["Juteau","Daniel",""],["Levy","Paul",""],["Sommers","Eric",""]]}
{"id":"2308.07399","submitter":"Jeff Eldredge","authors":"Jeff D. Eldredge and Mathieu Le Provost","title":"Bayesian inference of vorticity in unbounded flow from limited pressure\n  measurements","comments":"32 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study the instantaneous inference of an unbounded planar flow from sparse\nnoisy pressure measurements. The true flow field comprises configurations of\none or more regularized point vortices of various strength and size. We\ninterpret the true flow's measurements with a vortex estimator, also consisting\nof regularized point vortices, and attempt to infer the positions and strengths\nof this estimator assuming little prior knowledge. This problem often has\nseveral possible solutions, many due to a variety of symmetries --\nparticularly, the invariance of pressure to the sign of vortex strength. To\ndeal with this ill-posedness and quantify the uncertainty, we develop the\nvortex estimator in a Bayesian setting. We use Markov-chain Monte Carlo\ntechniques and a Gaussian mixture model to sample, characterize, and categorize\nthe probable vortex states in the posterior distribution, tailoring the prior\nto avoid spurious solutions that arise from symmetries. The eigensystem of the\ntrue covariance illuminates rank deficiency and problematic directions in the\nstate space. Through experiments with one or more true vortices, we reveal many\naspects of the vortex inference problem. With fewer sensors than states, the\nestimator can only infer a manifold of equally-possible states. Using one more\nsensor than states ensures that no cases of rank deficiency arise. Uncertainty\ngrows rapidly with distance when a vortex lies outside of the vicinity of the\nsensors. Vortex size cannot be reliably inferred, but the position and strength\nof a larger vortex can be estimated with a much smaller one. In estimates of\nmultiple vortices their individual signs are discernible because of the\nvortices' non-linear coupling in the pressure. When the true vortex state is\ninferred from an estimator of fewer vortices, the estimated state approximately\naggregates the true vortices where such aggregations are possible.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:36:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Eldredge","Jeff D.",""],["Provost","Mathieu Le",""]]}
{"id":"2308.07400","submitter":"Alexandra Mestre-Tor\\`a","authors":"Shuichi Iwakiri, Alexandra Mestre-Tor\\`a, El\\'ias Portol\\'es, Marieke\n  Visscher, Marta Perego, Giulia Zheng, Takashi Taniguchi, Kenji Watanabe,\n  Manfred Sigrist, Thomas Ihn, and Klaus Ensslin","title":"Tunable quantum interferometer for correlated moir\\'e electrons","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":"  Magic-angle twisted bilayer graphene (MATBG) can host an intriguing variety\nof gate-tunable correlated states, including superconducting and correlated\ninsulator states. Junction-based superconducting devices, such as Josephson\njunctions and SQUIDs, have been introduced recently and enable the exploration\nof the charge, spin, and orbital nature of superconductivity and the coherence\nof moir\\'e electrons in MATBG. However, complementary fundamental coherence\neffects - in particular, the Little-Parks effect in a superconducting and the\nAharonov-Bohm effect in a normal conducting ring - remained to be observed.\nHere, we report the observation of both these phenomena in a single\ngate-defined ring device where we can embed a superconducting or normal\nconducting ring in a correlated or band insulator. We directly observe the\nLittle-Parks effect in the superconducting phase diagram as a function of\ndensity and magnetic field, confirming the effective charge of $2e$. By\nmeasuring the Aharonov-Bohm effect, we find that in our device, the coherence\nlength of normal conducting moir\\'e electrons exceeds a few microns at 50 mK.\nSurprisingly, we also identify a regime characterized by $h/e$-periodic\noscillations but with superconductor-like nonlinear transport. Taken together,\nthese experiments establish a novel device platform in MATBG, and more\ngenerally in tunable 2D materials, to unravel the nature of superconductivity\nand other correlated quantum states in these materials.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:36:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Iwakiri","Shuichi",""],["Mestre-Tor\u00e0","Alexandra",""],["Portol\u00e9s","El\u00edas",""],["Visscher","Marieke",""],["Perego","Marta",""],["Zheng","Giulia",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Sigrist","Manfred",""],["Ihn","Thomas",""],["Ensslin","Klaus",""]]}
{"id":"2308.07401","submitter":"Abby Bishop","authors":"Abby Bishop, Austin Cummings, Ryan Krebs, William Luszczak (for the\n  ARA Collaboration)","title":"Benefits of Looking for Coincident Events, Taus, and Muons with the\n  Askaryan Radio Array","comments":"For 2023 ICRC, 8 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1169","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultra-High Energy (UHE) neutrinos over $10^{16}$ eV have yet to be observed\nbut the Askaryan Radio Array (ARA) is one in-ice neutrino observatory\nattempting to make this discovery. In anticipation of a thorough\nfull-observatory and full-livetime neutrino search, we estimate how many\nneutrino events can be detected accounting for secondary interactions, which\nare typically ignored in UHE neutrino simulations. Using the NuLeptonSim and\nPyREx simulation frameworks, we calculate the abundance and usefulness of\ncascades viewed by multiple ARA stations and observations made of taus, muons,\nand neutrinos generated during and after initial neutrino cascades. Analyses\nthat include these scenarios benefit from a considerable increase in effective\narea at key ARA neutrino energies, one example being a 30% increase in ARA's\neffective area when simulating taus and muons produced in $10^{19}$ eV neutrino\ninteractions. These analysis techniques could be utilized by other in-ice radio\nneutrino observatories, as has been explored by NuRadioMC developers. Our\ncontribution showcases full simulation results of neutrinos with energies\n$3\\times10^{17}$ - $10^{21}$ eV and visualizations of interesting triggered\nevent topologies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:43:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bishop","Abby","","for the\n  ARA Collaboration"],["Cummings","Austin","","for the\n  ARA Collaboration"],["Krebs","Ryan","","for the\n  ARA Collaboration"],["Luszczak","William","","for the\n  ARA Collaboration"]]}
{"id":"2308.07402","submitter":"Oliver Brown","authors":"Jakub Adamski and James Richings and Oliver Thomson Brown","title":"Energy Efficiency of Quantum Statevector Simulation at Scale","comments":"4 pages, 5 figures. Submitted to Sustainable Supercomputing at SC23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PF cs.DC quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Classical simulations are essential for the development of quantum computing,\nand their exponential scaling can easily fill any modern supercomputer. In this\npaper we consider the performance and energy consumption of large Quantum\nFourier Transform (QFT) simulations run on ARCHER2, the UK's National\nSupercomputing Service, with QuEST toolkit. We take into account CPU clock\nfrequency and node memory size, and use cache-blocking to rearrange the\ncircuit, which minimises communications. We find that using 2.00GHz instead of\n2.25GHz can save as much as 25% of energy at 5% increase in runtime. Higher\nnode memory also has the potential to be more efficient, and cost the user\nfewer CUs, but at higher runtime penalty. Finally, we present a cache-blocking\nQFT circuit, which halves the required communication. All our optimisations\ncombined result in 40% faster simulations and 35% energy savings in 44 qubit\nsimulations on 4,096 ARCHER2 nodes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:43:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Adamski","Jakub",""],["Richings","James",""],["Brown","Oliver Thomson",""]]}
{"id":"2308.07403","submitter":"Markus Meister","authors":"Markus Meister","title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural\n  networks","comments":"11 pages, 4 figures, see also https://github.com/markusmeister/APSP","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a directed graph of nodes and edges connecting them, a common problem\nis to find the shortest path between any two nodes. Here I show that the\nshortest path distances can be found by a simple matrix inversion: If the edges\nare given by the adjacency matrix $A_{ij}$ then with a suitably small value of\n$\\gamma$ the shortest path distances are $$ D_{ij} = \\operatorname{ceil} \\left(\n{\\frac{\\log {\\left[ {\\left({\\mathbf{1}}-\\gamma {\\mathbf{A}}\\right)^{-1}}\n\\right]}_{ij}}{\\log \\gamma}} \\right)$$ I derive some bounds on $\\gamma$ useful\nfor a practical application. Even when the distance function is not globally\naccurate across the entire graph, it still works locally to instruct pursuit of\nthe shortest path. In this mode, it also extends to weighted graphs with\npositive edge weights. For a wide range of dense graphs this distance function\nis computationally faster than the best available alternative. Finally I show\nthat this method leads naturally to a neural network solution of the\nall-pairs-shortest-path problem.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 05:43:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Meister","Markus",""]]}
{"id":"2308.07404","submitter":"Irfan Durmi\\'c","authors":"Irfan Durmi\\'c and Steven J.Miller","title":"Benford Behavior of a Higher-Dimensional Fragmentation Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nature and our world have a bias! Roughly $30\\%$ of the time the number $1$\noccurs as the leading digit in many datasets base $10$. This phenomenon is\nknown as Benford's law and it arrises in diverse fields such as the stock\nmarket, optimizing computers, street addresses, Fibonacci numbers, and is often\nused to detect possible fraud. Based on previous work, we know that different\nforms of a one-dimensional stick fragmentation result in pieces whose lengths\nfollow Benford's Law. We generalize this result and show that this can be\nextended to any finite-dimensional ``volume''. We further conjecture that even\nlower-dimensional volumes, under the unrestricted fragmentation process, follow\nBenford's Law.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:47:01 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Durmi\u0107","Irfan",""],["Miller","Steven J.",""]]}
{"id":"2308.07405","submitter":"Xu Yang","authors":"Xiao-Chuan Liu, Danni Peng, and Xu Yang","title":"More on Rainbow Cliques in Edge-Colored Graphs","comments":"16pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In an edge-colored graph $G$, a rainbow clique $K_k$ is a $k$-complete\nsubgraph in which all the edges have distinct colors. Let $e(G)$ and $c(G)$ be\nthe number of edges and colors in $G$, respectively. In this paper, we show\nthat for any $\\varepsilon>0$, if $e(G)+c(G) \\geq\n(1+\\frac{k-3}{k-2}+2\\varepsilon) {n\\choose 2}$ and $k\\geq 3$, then for\nsufficiently large $n$, the number of rainbow cliques $K_k$ in $G$ is\n$\\Omega(n^k)$.\n  We also characterize the extremal graphs $G$ without a rainbow clique $K_k$,\nfor $k=4,5$, when $e(G)+c(G)$ is maximum.\n  Our results not only address existing questions but also complete the\nfindings of Ehard and Mohr (Ehard and Mohr, Rainbow triangles and cliques in\nedge-colored graphs. {\\it European Journal of Combinatorics, 84:103037,2020}).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:49:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Xiao-Chuan",""],["Peng","Danni",""],["Yang","Xu",""]]}
{"id":"2308.07406","submitter":"Richard Szabo","authors":"Vladislav G. Kupriyanov, Alexey A. Sharapov, Richard J. Szabo","title":"Symplectic Groupoids and Poisson Electrodynamics","comments":"31 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":"EMPG-23-11","categories":"hep-th math-ph math.MP math.QA math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a geometric approach to Poisson electrodynamics, that is, the\nsemi-classical limit of noncommutative $U(1)$ gauge theory. Our framework is\nbased on an integrating symplectic groupoid for the underlying Poisson\nbrackets, which we interpret as the classical phase space of a point particle\non noncommutative spacetime. In this picture gauge fields arise as bisections\nof the symplectic groupoid while gauge transformations are parameterized by\nLagrangian bisections. We provide a geometric construction of a gauge invariant\naction functional which minimally couples a dynamical charged particle to a\nbackground electromagnetic field. Our constructions are elucidated by several\nexplicit examples, demonstrating the appearances of curved and even compact\nmomentum spaces, the interplay between gauge transformations and spacetime\ndiffeomorphisms, as well as emergent gravity phenomena.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:50:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kupriyanov","Vladislav G.",""],["Sharapov","Alexey A.",""],["Szabo","Richard J.",""]]}
{"id":"2308.07407","submitter":"Xuewen Yao","authors":"Xuewen Yao, Miriam Mikhelson, S. Craig Watkins, Eunsol Choi, Edison\n  Thomaz, Kaya de Barbaro","title":"Development and Evaluation of Three Chatbots for Postpartum Mood and\n  Anxiety Disorders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In collaboration with Postpartum Support International (PSI), a non-profit\norganization dedicated to supporting caregivers with postpartum mood and\nanxiety disorders, we developed three chatbots to provide context-specific\nempathetic support to postpartum caregivers, leveraging both rule-based and\ngenerative models. We present and evaluate the performance of our chatbots\nusing both machine-based metrics and human-based questionnaires. Overall, our\nrule-based model achieves the best performance, with outputs that are close to\nground truth reference and contain the highest levels of empathy. Human users\nprefer the rule-based chatbot over the generative chatbot for its\ncontext-specific and human-like replies. Our generative chatbot also produced\nempathetic responses and was described by human users as engaging. However,\nlimitations in the training dataset often result in confusing or nonsensical\nresponses. We conclude by discussing practical benefits of rule-based vs.\ngenerative models for supporting individuals with mental health challenges. In\nlight of the recent surge of ChatGPT and BARD, we also discuss the\npossibilities and pitfalls of large language models for digital mental\nhealthcare.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:52:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yao","Xuewen",""],["Mikhelson","Miriam",""],["Watkins","S. Craig",""],["Choi","Eunsol",""],["Thomaz","Edison",""],["de Barbaro","Kaya",""]]}
{"id":"2308.07408","submitter":"Benjamin T. Zhou","authors":"Benjamin T. Zhou, Marcel Franz","title":"Cu-substituted lead phosphate apatite as an inversion-asymmetric Weyl\n  semimetal","comments":"4 + 3 pages, 3 figures. Comments are welcome","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":"  Based on symmetry arguments and the latest density functional results for the\ncopper-substituted lead phosphate apatite (`LK-99'), we show that, at the\nnon-interacting level, the material is an inversion-asymmetric Weyl semimetal.\nA pair of Weyl nodes with opposite chiralities emerge at different energies in\nthe vicinity of the time-reversal-invariant $\\Gamma$ and ${\\rm A}$ points of\nthe 3D Brillouin zone. These are characterized by unusual Weyl charges of\n$C_{\\rm W} = \\pm 2$ and are connected by two branches of topologically\nprotected Fermi arc states on surfaces parallel to the principal $c$-axis. We\nfurther study important effects of the atomic spin-orbit coupling on the band\nstructure and the electronic properties of the material in general. Possible\nimplications of the proposed band topology on the strong correlation physics\nare also discussed.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:53:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhou","Benjamin T.",""],["Franz","Marcel",""]]}
{"id":"2308.07409","submitter":"Gabriel Kerr","authors":"Gabriel Kerr and Sophia Palcic","title":"Painted Tropical Complexes","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define the notion of a painted tropical $A$-complex and describe a poset\nstructure on the set of all such complexes. This poset is equivalent to the\nface lattice of a secondary polytope $\\Sigma (\\bar{A}_\\alpha )$ where\n$\\bar{A}_\\alpha$ is built from $A$ and an additional point $\\alpha$. As a\ncentral application, we show that multiplihedra are also secondary polytopes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:56:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kerr","Gabriel",""],["Palcic","Sophia",""]]}
{"id":"2308.07410","submitter":"Zekai Wang","authors":"Zekai Wang, Andrew Crawford, Ka Lok Lee, Srihari Jaganathan","title":"reslife: Residual Lifetime Analysis Tool in R","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mean residual lifetime is an important measure utilized in various fields,\nincluding pharmaceutical companies, manufacturing companies, and insurance\ncompanies for survival analysis. However, the computation of mean residual\nlifetime can be laborious and challenging. To address this issue, the R package\nreslife has been developed, which enables efficient calculation of mean\nresidual lifetime based on closed-form solution in a user-friendly manner.\nreslife offers the capability to utilize either the results of a flexsurv\nregression or user-provided parameters to compute mean residual lifetime.\nFurthermore, there are options to return median and percentile residual\nlifetime. If the user chooses to use the outputs of a flexsurv regression,\nthere is an option to input a data frame with unobserved data. In this article,\nwe present reslife, explain its underlying mathematical principles, illustrate\nits functioning, and provide examples on how to utilize the package. The aim is\nto facilitate the use of mean residual lifetime, making it more accessible and\nefficient for practitioners in various disciplines, particularly those involved\nin survival analysis within the pharmaceutical industry.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:57:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zekai",""],["Crawford","Andrew",""],["Lee","Ka Lok",""],["Jaganathan","Srihari",""]]}
{"id":"2308.07411","submitter":"Edward Junprung","authors":"Edward Junprung","title":"Exploring the Intersection of Large Language Models and Agent-Based\n  Modeling via Prompt Engineering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The final frontier for simulation is the accurate representation of complex,\nreal-world social systems. While agent-based modeling (ABM) seeks to study the\nbehavior and interactions of agents within a larger system, it is unable to\nfaithfully capture the full complexity of human-driven behavior. Large language\nmodels (LLMs), like ChatGPT, have emerged as a potential solution to this\nbottleneck by enabling researchers to explore human-driven interactions in\npreviously unimaginable ways. Our research investigates simulations of human\ninteractions using LLMs. Through prompt engineering, inspired by Park et al.\n(2023), we present two simulations of believable proxies of human behavior: a\ntwo-agent negotiation and a six-agent murder mystery game.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 18:58:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Junprung","Edward",""]]}
{"id":"2308.07412","submitter":"Juan Antonio Aguilar-Saavedra","authors":"J. A. Aguilar-Saavedra","title":"Decay of entangled fermion pairs with post-selection","comments":"LaTeX 8 pages. Enlarged discussion to clarify that causality is not\n  violated","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-106","categories":"hep-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a pair of unstable fermions in a spin-entangled state. A spin\nmeasurement on one fermion, with a Stern-Gerlach experiment or similar,\ndetermines the spin state of its partner - even if it already has decayed. This\npost-selection effect would be experimentally accessible using muon pairs in a\nmaximally-entangled state, produced either in the decay of a scalar particle,\nor in $e^+ e^-$ collisions at wide angles.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:00:50 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 05:28:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Aguilar-Saavedra","J. A.",""]]}
{"id":"2308.07413","submitter":"Charles Harris","authors":"Charles Harris, Kieran Didi, Arian R. Jamasb, Chaitanya K. Joshi,\n  Simon V. Mathis, Pietro Lio, Tom Blundell","title":"Benchmarking Generated Poses: How Rational is Structure-based Drug\n  Design with Generative Models?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep generative models for structure-based drug design (SBDD), where molecule\ngeneration is conditioned on a 3D protein pocket, have received considerable\ninterest in recent years. These methods offer the promise of higher-quality\nmolecule generation by explicitly modelling the 3D interaction between a\npotential drug and a protein receptor. However, previous work has primarily\nfocused on the quality of the generated molecules themselves, with limited\nevaluation of the 3D molecule \\emph{poses} that these methods produce, with\nmost work simply discarding the generated pose and only reporting a \"corrected\"\npose after redocking with traditional methods. Little is known about whether\ngenerated molecules satisfy known physical constraints for binding and the\nextent to which redocking alters the generated interactions. We introduce\nPoseCheck, an extensive analysis of multiple state-of-the-art methods and find\nthat generated molecules have significantly more physical violations and fewer\nkey interactions compared to baselines, calling into question the implicit\nassumption that providing rich 3D structure information improves molecule\ncomplementarity. We make recommendations for future research tackling\nidentified failure modes and hope our benchmark can serve as a springboard for\nfuture SBDD generative modelling work to have a real-world impact.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:01:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Harris","Charles",""],["Didi","Kieran",""],["Jamasb","Arian R.",""],["Joshi","Chaitanya K.",""],["Mathis","Simon V.",""],["Lio","Pietro",""],["Blundell","Tom",""]]}
{"id":"2308.07414","submitter":"Sanyukta Deshpande","authors":"Sanyukta Deshpande, Ian G Ludden, Sheldon H Jacobson","title":"Votemandering: Strategies and Fairness in Political Redistricting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gerrymandering, the deliberate manipulation of electoral district boundaries\nfor political advantage, is a persistent issue in U.S. redistricting cycles.\nThis paper introduces and analyzes a new phenomenon, 'votemandering'- a\nstrategic blend of gerrymandering and targeted political campaigning, devised\nto gain more seats by circumventing fairness measures. It leverages accurate\ndemographic and socio-political data to influence voter decisions, bolstered by\nadvancements in technology and data analytics, and executes better-informed\nredistricting. Votemandering is established as a Mixed Integer Program (MIP)\nthat performs fairness-constrained gerrymandering over multiple election\nrounds, via unit-specific variables for campaigns. To combat votemandering, we\npresent a computationally efficient heuristic for creating and testing district\nmaps that more robustly preserve voter preferences. We analyze the influence of\nvarious redistricting constraints and parameters on votemandering efficacy. We\nexplore the interconnectedness of gerrymandering, substantial campaign budgets,\nand strategic campaigning, illustrating their collective potential to generate\nbiased electoral maps. A Wisconsin State Senate redistricting case study\nsubstantiates our findings on real data, demonstrating how major parties can\nsecure additional seats through votemandering. Our findings underscore the\npractical implications of these manipulations, stressing the need for informed\npolicy and regulation to safeguard democratic processes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:03:28 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 00:48:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Deshpande","Sanyukta",""],["Ludden","Ian G",""],["Jacobson","Sheldon H",""]]}
{"id":"2308.07415","submitter":"Omer Gralnik","authors":"Omer Gralnik, Guy Gafni, Ariel Shamir","title":"Semantify: Simplifying the Control of 3D Morphable Models using CLIP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present Semantify: a self-supervised method that utilizes the semantic\npower of CLIP language-vision foundation model to simplify the control of 3D\nmorphable models. Given a parametric model, training data is created by\nrandomly sampling the model's parameters, creating various shapes and rendering\nthem. The similarity between the output images and a set of word descriptors is\ncalculated in CLIP's latent space. Our key idea is first to choose a small set\nof semantically meaningful and disentangled descriptors that characterize the\n3DMM, and then learn a non-linear mapping from scores across this set to the\nparametric coefficients of the given 3DMM. The non-linear mapping is defined by\ntraining a neural network without a human-in-the-loop. We present results on\nnumerous 3DMMs: body shape models, face shape and expression models, as well as\nanimal shapes. We demonstrate how our method defines a simple slider interface\nfor intuitive modeling, and show how the mapping can be used to instantly fit a\n3D parametric body shape to in-the-wild images.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:07:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gralnik","Omer",""],["Gafni","Guy",""],["Shamir","Ariel",""]]}
{"id":"2308.07416","submitter":"Charles Harris","authors":"Jos Torge, Charles Harris, Simon V. Mathis, Pietro Lio","title":"DiffHopp: A Graph Diffusion Model for Novel Drug Design via Scaffold\n  Hopping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Scaffold hopping is a drug discovery strategy to generate new chemical\nentities by modifying the core structure, the \\emph{scaffold}, of a known\nactive compound. This approach preserves the essential molecular features of\nthe original scaffold while introducing novel chemical elements or structural\nfeatures to enhance potency, selectivity, or bioavailability. However, there is\ncurrently a lack of generative models specifically tailored for this task,\nespecially in the pocket-conditioned context. In this work, we present\nDiffHopp, a conditional E(3)-equivariant graph diffusion model tailored for\nscaffold hopping given a known protein-ligand complex.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:08:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Torge","Jos",""],["Harris","Charles",""],["Mathis","Simon V.",""],["Lio","Pietro",""]]}
{"id":"2308.07417","submitter":"Jacob Levitt","authors":"Jake Levitt","title":"Ultrafast laser architectures for quantum control of nuclear fusion","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.plasm-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum control of nuclear fusion involves engineering quantum coherences in\na nuclear wavepacket to accelerate tunneling through the Coulomb barrier and\nmodifying the analytic structure of the $\\textit{S}$-matrix to facilitate\nlong-range reactive capture. We present a three-body fusion reaction which is\namenable to quantum control. The main result of the present inquiry is the\ndiscovery of an embodied class of ultrafast laser architectures [Levitt\n$\\textit{et al.}$, U.S. Patent Application No. 17/855,476 (2022)] which realize\nsolutions to the Schr\\\"odinger equation in a logically consistent manner as to\nthat presented in [Saha $\\textit{et al.}$, Mol. Phys. $\\textbf{110}$, 9-10\n(2012)]. Further, we provide some necessary (but not necessarily sufficient)\nconditions for net electrical power production using the optical designs here.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:11:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Levitt","Jake",""]]}
{"id":"2308.07418","submitter":"Mingxuan Han","authors":"Mingxuan Han, Varun Shankar, Jeff M Phillips, Chenglong Ye","title":"Locally Adaptive and Differentiable Regression","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":"  Over-parameterized models like deep nets and random forests have become very\npopular in machine learning. However, the natural goals of continuity and\ndifferentiability, common in regression models, are now often ignored in modern\noverparametrized, locally-adaptive models. We propose a general framework to\nconstruct a global continuous and differentiable model based on a weighted\naverage of locally learned models in corresponding local regions. This model is\ncompetitive in dealing with data with different densities or scales of function\nvalues in different local regions. We demonstrate that when we mix kernel ridge\nand polynomial regression terms in the local models, and stitch them together\ncontinuously, we achieve faster statistical convergence in theory and improved\nperformance in various practical settings.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:12:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Han","Mingxuan",""],["Shankar","Varun",""],["Phillips","Jeff M",""],["Ye","Chenglong",""]]}
{"id":"2308.07419","submitter":"Athul Krishna Sundarrajan","authors":"Athul Krishna Sundarrajan and Daniel R. Herber","title":"Using High-fidelity Time-Domain Simulation Data to Construct\n  Multi-fidelity State Derivative Function Surrogate Models for use in Control\n  and Optimization","comments":"14 pages,45 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":"  Models that balance accuracy against computational costs are advantageous\nwhen designing dynamic systems with optimization studies, as several hundred\npredictive function evaluations might be necessary to identify the optimal\nsolution. The efficacy and use of derivative function surrogate models (DFSMs),\nor approximate models of the state derivative function, have been\nwell-established in the literature. However, previous studies have assumed an a\npriori state dynamic model is available that can be directly evaluated to\nconstruct the DFSM. In this article, we propose an approach to extract the\nstate derivative information from system simulations using piecewise polynomial\napproximations. Once the required information is available, we propose a\nmulti-fidelity DFSM approach as a predictive model for the system's dynamic\nresponse. This multi-fidelity model consists of summation between a linear-fit\nlower-fidelity model and an additional nonlinear error corrective function that\ncompensates for the error between the high-fidelity simulations and\nlow-fidelity models. We validate the model by comparing the simulation results\nfrom the DFSM to the high-fidelity tools. The DFSM model is, on average, five\ntimes faster than the high-fidelity tools while capturing the key time domain\nand power spectral density~(PSD) trends. Then, an optimal control study using\nthe DFSM is conducted with outcomes showing that the DFSM approach can be used\nfor complex systems like floating offshore wind turbines~(FOWTs) and help\nidentify control trends and trade-offs.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:19:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sundarrajan","Athul Krishna",""],["Herber","Daniel R.",""]]}
{"id":"2308.07420","submitter":"Brian Wang","authors":"Brian H. Wang, Beatriz Asfora, Rachel Zheng, Aaron Peng, Jacopo Banfi,\n  and Mark Campbell","title":"Multiple-Hypothesis Path Planning with Uncertain Object Detections","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Path planning in obstacle-dense environments is a key challenge in robotics,\nand depends on inferring scene attributes and associated uncertainties. We\npresent a multiple-hypothesis path planner designed to navigate complex\nenvironments using obstacle detections. Path hypotheses are generated by\nreasoning about uncertainty and range, as initial detections are typically at\nfar ranges with high uncertainty, before subsequent detections reduce this\nuncertainty. Given estimated obstacles, we build a graph of pairwise\nconnections between objects based on the probability that the robot can safely\npass between the pair. The graph is updated in real time and pruned of unsafe\npaths, providing probabilistic safety guarantees. The planner generates path\nhypotheses over this graph, then trades between safety and path length to\nintelligently optimize the best route. We evaluate our planner on randomly\ngenerated simulated forests, and find that in the most challenging\nenvironments, it increases the navigation success rate over an A* baseline from\n20% to 75%. Results indicate that the use of evolving, range-based uncertainty\nand multiple hypotheses are critical for navigating dense environments.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:19:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Brian H.",""],["Asfora","Beatriz",""],["Zheng","Rachel",""],["Peng","Aaron",""],["Banfi","Jacopo",""],["Campbell","Mark",""]]}
{"id":"2308.07421","submitter":"Hamidreza Behjoo","authors":"Hamidreza Behjoo, Michael Chertkov","title":"U-Turn Diffusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive examination of score-based diffusion models of AI\nfor generating synthetic images. These models hinge upon a dynamic auxiliary\ntime mechanism driven by stochastic differential equations, wherein the score\nfunction is acquired from input images. Our investigation unveils a criterion\nfor evaluating efficiency of the score-based diffusion models: the power of the\ngenerative process depends on the ability to de-construct fast correlations\nduring the reverse/de-noising phase. To improve the quality of the produced\nsynthetic images, we introduce an approach coined \"U-Turn Diffusion\". The\nU-Turn Diffusion technique starts with the standard forward diffusion process,\nalbeit with a condensed duration compared to conventional settings.\nSubsequently, we execute the standard reverse dynamics, initialized with the\nconcluding configuration from the forward process. This U-Turn Diffusion\nprocedure, combining forward, U-turn, and reverse processes, creates a\nsynthetic image approximating an independent and identically distributed\n(i.i.d.) sample from the probability distribution implicitly described via\ninput samples. To analyze relevant time scales we employ various analytical\ntools, including auto-correlation analysis, weighted norm of the score-function\nanalysis, and Kolmogorov-Smirnov Gaussianity test. The tools guide us to\nestablishing that the Kernel Intersection Distance, a metric comparing the\nquality of synthetic samples with real data samples, is minimized at the\noptimal U-turn time.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:21:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Behjoo","Hamidreza",""],["Chertkov","Michael",""]]}
{"id":"2308.07422","submitter":"Annie Raymond","authors":"Grigoriy Blekherman and Annie Raymond","title":"Ubiquity of power sums in graph profiles","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph density profiles are fundamental objects in extremal combinatorics.\nVery few profiles are fully known, and all are two-dimensional. We show that\neven in high dimensions ratios of graph densities and numbers often form the\npower-sum profile (the limit of the image of the power-sum map) studied\nrecently by Acevedo, Blekherman, Debus and Riener. Our choice of graphs is\nmotivated by recent work by Blekherman, Raymond and Wei on undecidability of\npolynomial inequalities in graph densities. While the ratios do not determine\nthe complete density profile, they contain high-dimensional information. For\ninstance, to reconstruct the density profile of $4k$-cycles from our results,\none needs to solve only one-parameter extremal problems, for any number of\n$4k$-cycles.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:27:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Blekherman","Grigoriy",""],["Raymond","Annie",""]]}
{"id":"2308.07423","submitter":"Koichiro Furutani","authors":"Koichiro Furutani, Luca Salasnich","title":"Fokker-Planck equations for a trapped particle in a quantum-thermal\n  Ohmic bath: General theory and applications to Josephson junctions","comments":"17 pages, 2 figures; invited review article, to be published in AAPPS\n  Bulletin","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.quant-gas cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a particle trapped by a generic external potential and under the\ninfluence of a quantum-thermal Ohmic bath. Starting from the Langevin equation\nwe derive the corresponding Schwinger-Keldysh action. Then, within the\npath-integral formalism, we obtain both the semiclassical Fokker-Planck\nequation and the quantum Fokker-Planck equation for this out-of-equilibrium\nsystem. In the case of an external harmonic potential and in the underdamped\nregime, we find that our Fokker-Planck equations contain an effective\ntemperature $T_{\\rm eff}$, which crucially depends on the interplay between\nquantum and thermal fluctuations in contrast to the classical Fokker-Planck\nequation. In the regime of high temperatures, one recovers the classical\nFokker-Planck equation. As an application of our result, we also provide the\nstationary solution of the semiclassical Fokker-Planck equations for a\nsuperconducting Josephson circuit and for a Bose Josephson junction, which are\nexperimentally accessible.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:31:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Furutani","Koichiro",""],["Salasnich","Luca",""]]}
{"id":"2308.07424","submitter":"Minji Kim","authors":"Minji Kim, Seong Jin Lee, Bumsik Kim","title":"Addressing Distribution Shift in RTB Markets via Exponential Tilting","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":"  Distribution shift in machine learning models can be a primary cause of\nperformance degradation. This paper delves into the characteristics of these\nshifts, primarily motivated by Real-Time Bidding (RTB) market models. We\nemphasize the challenges posed by class imbalance and sample selection bias,\nboth potent instigators of distribution shifts. This paper introduces the\nExponential Tilt Reweighting Alignment (ExTRA) algorithm, as proposed by Marty\net al. (2023), to address distribution shifts in data. The ExTRA method is\ndesigned to determine the importance weights on the source data, aiming to\nminimize the KL divergence between the weighted source and target datasets. A\nnotable advantage of this method is its ability to operate using labeled source\ndata and unlabeled target data. Through simulated real-world data, we\ninvestigate the nature of distribution shift and evaluate the applicacy of the\nproposed model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:31:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kim","Minji",""],["Lee","Seong Jin",""],["Kim","Bumsik",""]]}
{"id":"2308.07425","submitter":"Youngmin Park","authors":"Youngmin Park, Dan Wilson","title":"N-Body Oscillator Interactions of Higher-Order Coupling Functions","comments":"29 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a method to identify phase equations that include $N$-body\ninteractions for general coupled oscillators valid far beyond the weak coupling\napproximation. This strategy is an extension of the theory from [Park and\nWilson, SIADS 20.3 (2021)] and yields coupling functions for $N\\geq2$\noscillators for arbitrary types of coupling (e.g., diffusive, gap-junction,\nchemical synaptic). These coupling functions enable the study of oscillator\nnetworks in terms of phase-locked states, whose stability can be determined\nusing straightforward linear stability arguments. We demonstrate the utility of\nour approach with two examples. First, we use $N=3$ diffusively coupled complex\nGinzburg-Landau (CGL) model and show that the loss of stability in its splay\nstate occurs through a Hopf bifurcation \\yp{as a function of non-weak diffusive\ncoupling. Our reduction also captures asymptotic limit-cycle dynamics in the\nphase differences}. Second, we use $N=3$ realistic conductance-based thalamic\nneuron models and show that our method correctly predicts a loss in stability\nof a splay state for non-weak synaptic coupling. In both examples, our theory\naccurately captures model behaviors that weak and recent non-weak coupling\ntheories can not.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:36:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Park","Youngmin",""],["Wilson","Dan",""]]}
{"id":"2308.07426","submitter":"Zehui Wang","authors":"Zehui Wang, Wolfram H\\\"opken, Dietmar Jannach","title":"A Survey on Point-of-Interest Recommendations Leveraging Heterogeneous\n  Data","comments":"35 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tourism is an important application domain for recommender systems. In this\ndomain, recommender systems are for example tasked with providing personalized\nrecommendations for transportation, accommodation, points-of-interest (POIs),\nor tourism services. Among these tasks, in particular the problem of\nrecommending POIs that are of likely interest to individual tourists has gained\ngrowing attention in recent years. Providing POI recommendations to tourists\n\\emph{during their trip} can however be especially challenging due to the\nvariability of the users' context. With the rapid development of the Web and\ntoday's multitude of online services, vast amounts of data from various sources\nhave become available, and these heterogeneous data sources represent a huge\npotential to better address the challenges of in-trip POI recommendation\nproblems. In this work, we provide a comprehensive survey of published research\non POI recommendation between 2017 and 2022 from the perspective of\nheterogeneous data sources. Specifically, we investigate which types of data\nare used in the literature and which technical approaches and evaluation\nmethods are predominant. Among other aspects, we find that today's research\nworks often focus on a narrow range of data sources, leaving great potential\nfor future works that better utilize heterogeneous data sources and diverse\ndata types for improved in-trip recommendations.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:36:57 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 10:10:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Zehui",""],["H\u00f6pken","Wolfram",""],["Jannach","Dietmar",""]]}
{"id":"2308.07427","submitter":"Jane Hsieh","authors":"Jane Hsieh, Joselyn Kim, Laura Dabbish, Haiyi Zhu","title":"Nip it in the Bud: Moderation Strategies in Open Source Software\n  Projects and the Role of Bots","comments":null,"journal-ref":null,"doi":"10.1145/3610092","report-no":null,"categories":"cs.HC cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Much of our modern digital infrastructure relies critically upon open sourced\nsoftware. The communities responsible for building this cyberinfrastructure\nrequire maintenance and moderation, which is often supported by volunteer\nefforts. Moderation, as a non-technical form of labor, is a necessary but often\noverlooked task that maintainers undertake to sustain the community around an\nOSS project. This study examines the various structures and norms that support\ncommunity moderation, describes the strategies moderators use to mitigate\nconflicts, and assesses how bots can play a role in assisting these processes.\nWe interviewed 14 practitioners to uncover existing moderation practices and\nways that automation can provide assistance. Our main contributions include a\ncharacterization of moderated content in OSS projects, moderation techniques,\nas well as perceptions of and recommendations for improving the automation of\nmoderation tasks. We hope that these findings will inform the implementation of\nmore effective moderation practices in open source communities.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:42:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hsieh","Jane",""],["Kim","Joselyn",""],["Dabbish","Laura",""],["Zhu","Haiyi",""]]}
{"id":"2308.07428","submitter":"Weijian Mai","authors":"Weijian Mai, Zhijun Zhang","title":"UniBrain: Unify Image Reconstruction and Captioning All in One Diffusion\n  Model from Human Brain Activity","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":"  Image reconstruction and captioning from brain activity evoked by visual\nstimuli allow researchers to further understand the connection between the\nhuman brain and the visual perception system. While deep generative models have\nrecently been employed in this field, reconstructing realistic captions and\nimages with both low-level details and high semantic fidelity is still a\nchallenging problem. In this work, we propose UniBrain: Unify Image\nReconstruction and Captioning All in One Diffusion Model from Human Brain\nActivity. For the first time, we unify image reconstruction and captioning from\nvisual-evoked functional magnetic resonance imaging (fMRI) through a latent\ndiffusion model termed Versatile Diffusion. Specifically, we transform fMRI\nvoxels into text and image latent for low-level information and guide the\nbackward diffusion process through fMRI-based image and text conditions derived\nfrom CLIP to generate realistic captions and images. UniBrain outperforms\ncurrent methods both qualitatively and quantitatively in terms of image\nreconstruction and reports image captioning results for the first time on the\nNatural Scenes Dataset (NSD) dataset. Moreover, the ablation experiments and\nfunctional region-of-interest (ROI) analysis further exhibit the superiority of\nUniBrain and provide comprehensive insight for visual-evoked brain decoding.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:49:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mai","Weijian",""],["Zhang","Zhijun",""]]}
{"id":"2308.07429","submitter":"Chia-Yi Su","authors":"Chia-Yi Su and Collin McMillan","title":"Semantic Similarity Loss for Neural Source Code Summarization","comments":"20 pages + 8 figures + 5 references. Preprint In Review Aug. 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents an improved loss function for neural source code\nsummarization. Code summarization is the task of writing natural language\ndescriptions of source code. Neural code summarization refers to automated\ntechniques for generating these descriptions using neural networks. Almost all\ncurrent approaches involve neural networks as either standalone models or as\npart of a pretrained large language models e.g., GPT, Codex, LLaMA. Yet almost\nall also use a categorical cross-entropy (CCE) loss function for network\noptimization. Two problems with CCE are that 1) it computes loss over each word\nprediction one-at-a-time, rather than evaluating a whole sentence, and 2) it\nrequires a perfect prediction, leaving no room for partial credit for synonyms.\nWe propose and evaluate a loss function to alleviate this problem. In essence,\nwe propose to use a semantic similarity metric to calculate loss over the whole\noutput sentence prediction per training batch, rather than just loss for each\nword. We also propose to combine our loss with traditional CCE for each word,\nwhich streamlines the training process compared to baselines. We evaluate our\napproach over several baselines and report an improvement in the vast majority\nof conditions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:51:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Su","Chia-Yi",""],["McMillan","Collin",""]]}
{"id":"2308.07430","submitter":"Ilaria Caiazzo","authors":"Ilaria Caiazzo, Kevin B. Burdge, Pier-Emmanuel Tremblay, James Fuller,\n  Lilia Ferrario, Boris T. Gaensicke, J. J. Hermes, Jeremy Heyl, Adela Kawka,\n  S. R. Kulkarni, Thomas R. Marsh, Przemek Mroz, Thomas A. Prince, Harvey B.\n  Richer, Antonio C. Rodriguez, Jan van Roestel, Zachary P. Vanderbosch,\n  Stephane Vennes, Dayal Wickramasinghe, Vikram S. Dhillon, Stuart P.\n  Littlefair, James Munday, Ingrid Pelisoli, Daniel Perley, Eric C. Bellm, Elme\n  Breedt, Alex J. Brown, Richard Dekany, Andrew Drake, Martin J. Dyer, Matthew\n  J. Graham, Matthew J. Green, Russ R. Laher, Paul Kerry, Steven G. Parsons,\n  Reed L. Riddle, Ben Rusholme, Dave I. Sahman","title":"A rotating white dwarf shows different compositions on its opposite\n  faces","comments":"45 pages, 11 figures","journal-ref":"Nature 620, 61-66 (2023)","doi":"10.1038/s41586-023-06171-9","report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  White dwarfs, the extremely dense remnants left behind by most stars after\ntheir death, are characterised by a mass comparable to that of the Sun\ncompressed into the size of an Earth-like planet. In the resulting strong\ngravity, heavy elements sink toward the centre and the upper layer of the\natmosphere contains only the lightest element present, usually hydrogen or\nhelium. Several mechanisms compete with gravitational settling to change a\nwhite dwarf's surface composition as it cools, and the fraction of white dwarfs\nwith helium atmospheres is known to increase by a factor ~2.5 below a\ntemperature of about 30,000 K; therefore, some white dwarfs that appear to have\nhydrogen-dominated atmospheres above 30,000 K are bound to transition to be\nhelium-dominated as they cool below it. Here we report observations of ZTF\nJ203349.8+322901.1, a transitioning white dwarf with two faces: one side of its\natmosphere is dominated by hydrogen and the other one by helium. This peculiar\nnature is likely caused by the presence of a small magnetic field, which\ncreates an inhomogeneity in temperature, pressure or mixing strength over the\nsurface. ZTF J203349.8+322901.1 might be the most extreme member of a class of\nmagnetic, transitioning white dwarfs -- together with GD 323, a white dwarf\nthat shows similar but much more subtle variations. This new class could help\nshed light on the physical mechanisms behind white dwarf spectral evolution.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:54:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Caiazzo","Ilaria",""],["Burdge","Kevin B.",""],["Tremblay","Pier-Emmanuel",""],["Fuller","James",""],["Ferrario","Lilia",""],["Gaensicke","Boris T.",""],["Hermes","J. J.",""],["Heyl","Jeremy",""],["Kawka","Adela",""],["Kulkarni","S. R.",""],["Marsh","Thomas R.",""],["Mroz","Przemek",""],["Prince","Thomas A.",""],["Richer","Harvey B.",""],["Rodriguez","Antonio C.",""],["van Roestel","Jan",""],["Vanderbosch","Zachary P.",""],["Vennes","Stephane",""],["Wickramasinghe","Dayal",""],["Dhillon","Vikram S.",""],["Littlefair","Stuart P.",""],["Munday","James",""],["Pelisoli","Ingrid",""],["Perley","Daniel",""],["Bellm","Eric C.",""],["Breedt","Elme",""],["Brown","Alex J.",""],["Dekany","Richard",""],["Drake","Andrew",""],["Dyer","Martin J.",""],["Graham","Matthew J.",""],["Green","Matthew J.",""],["Laher","Russ R.",""],["Kerry","Paul",""],["Parsons","Steven G.",""],["Riddle","Reed L.",""],["Rusholme","Ben",""],["Sahman","Dave I.",""]]}
{"id":"2308.07431","submitter":"Lev Vidmar","authors":"Jan \\v{S}untajs, Miroslav Hopjan, Wojciech De Roeck, Lev Vidmar","title":"Similarity between a many-body quantum avalanche model and the\n  ultrametric random matrix model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn cond-mat.str-el quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the field of ergodicity-breaking phases, it has been recognized that\nquantum avalanches can destabilize many-body localization at a wide range of\ndisorder strengths. This has in particular been demonstrated by the numerical\nstudy of a toy model, sometimes simply called the ''avalanche model'' or the\n''quantum sun model'' [Phys. Rev. Lett. 129, 060602 (2022)], which consists of\nan ergodic seed coupled to a perfectly localized material. In this paper, we\nconnect this toy model to a well-studied model in random matrix theory, the\nultrametric ensemble. We conjecture that the models share the following\nfeatures. 1) The location of the critical point is predicted sharply by\nanalytics. 2) On the localized site, both models exhibit Fock space\nlocalization. 3) There is a manifold of critical points. On the critical\nmanifold, the eigenvectors exhibit nontrivial multifractal behaviour that can\nbe tuned by moving on the manifold. 4) The spectral statistics is intermediate\nbetween Poisson statistics and random matrix statistics, also tunable on the\ncritical manifold. We confirm numerically these properties.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:54:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["\u0160untajs","Jan",""],["Hopjan","Miroslav",""],["De Roeck","Wojciech",""],["Vidmar","Lev",""]]}
{"id":"2308.07432","submitter":"Lena Downes","authors":"Lena M. Downes, Ted J. Steiner, Rebecca L. Russell, Jonathan P. How","title":"Wide-Area Geolocalization with a Limited Field of View Camera in\n  Challenging Urban Environments","comments":"10 pages, 16 figures. Extension of ICRA 2023 paper arXiv:2209.11854","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Cross-view geolocalization, a supplement or replacement for GPS, localizes an\nagent within a search area by matching ground-view images to overhead images.\nSignificant progress has been made assuming a panoramic ground camera.\nPanoramic cameras' high complexity and cost make non-panoramic cameras more\nwidely applicable, but also more challenging since they yield less scene\noverlap between ground and overhead images. This paper presents Restricted FOV\nWide-Area Geolocalization (ReWAG), a cross-view geolocalization approach that\ncombines a neural network and particle filter to globally localize a mobile\nagent with only odometry and a non-panoramic camera. ReWAG creates pose-aware\nembeddings and provides a strategy to incorporate particle pose into the\nSiamese network, improving localization accuracy by a factor of 100 compared to\na vision transformer baseline. This extended work also presents ReWAG*, which\nimproves upon ReWAG's generalization ability in previously unseen environments.\nReWAG* repeatedly converges accurately on a dataset of images we have collected\nin Boston with a 72 degree field of view (FOV) camera, a location and FOV that\nReWAG* was not trained on.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 19:57:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Downes","Lena M.",""],["Steiner","Ted J.",""],["Russell","Rebecca L.",""],["How","Jonathan P.",""]]}
{"id":"2308.07433","submitter":"Jie Ma","authors":"Jie Ma, Junqing Zhang, Guanxiong Shen, Alan Marshall and Chip-Hong\n  Chang","title":"White-Box Adversarial Attacks on Deep Learning-Based Radio Frequency\n  Fingerprint Identification","comments":"6 pages, 9 figures, Accepeted by International Conference on\n  Communications 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Radio frequency fingerprint identification (RFFI) is an emerging technique\nfor the lightweight authentication of wireless Internet of things (IoT)\ndevices. RFFI exploits unique hardware impairments as device identifiers, and\ndeep learning is widely deployed as the feature extractor and classifier for\nRFFI. However, deep learning is vulnerable to adversarial attacks, where\nadversarial examples are generated by adding perturbation to clean data for\ncausing the classifier to make wrong predictions. Deep learning-based RFFI has\nbeen shown to be vulnerable to such attacks, however, there is currently no\nexploration of effective adversarial attacks against a diversity of RFFI\nclassifiers. In this paper, we report on investigations into white-box attacks\n(non-targeted and targeted) using two approaches, namely the fast gradient sign\nmethod (FGSM) and projected gradient descent (PGD). A LoRa testbed was built\nand real datasets were collected. These adversarial examples have been\nexperimentally demonstrated to be effective against convolutional neural\nnetworks (CNNs), long short-term memory (LSTM) networks, and gated recurrent\nunits (GRU).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:01:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ma","Jie",""],["Zhang","Junqing",""],["Shen","Guanxiong",""],["Marshall","Alan",""],["Chang","Chip-Hong",""]]}
{"id":"2308.07434","submitter":"Martha L Sabogal De La Pava","authors":"Martha L. Sabogal De La Pava (1) and Emily L. Tucker (1 and 2) ((1)\n  Industrial Engineering Department, Clemson University, Clemson, United\n  States, (2) School of Health Research, Clemson University, Clemson, United\n  States)","title":"Effects of Geopolitical Strain on Global Pharmaceutical Supply Chain\n  Design and Drug Shortages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Pharmaceutical supply chains are global and exhibit geographic and industrial\nconcentration for some drugs. In this context, geopolitical risk and company\ndecisions threaten drug availability, where countries with low manufacturing\ncapacity are most at risk. We present the first supply chain design model that\nconsiders geopolitical strain, i.e., export bans and export ban-induced price\nincreases, and the role of alliances in mitigating those risks. Uncertainty is\nalso included in suppliers, production, and demand. The model takes the\ncompany's perspective as a decision-maker looking to locate plants and minimize\ncosts by satisfying worldwide demand. The model is solved by integrating the\nSample Average Approximation and L-shaped methods. Our case study is based on\nvincristine, a generic oncology drug. We find that geopolitical strain may\nreduce shortages in the short term and affect investment decisions and their\noutcomes. Bilateral alliances between nations result in minor improvements for\nthe company and drug shortages. The results also reveal disparities in drug\naccess. The global expected shortage at the base case is 21%. For high and\nupper-middle-income countries, expected shortages are 3.1% and 3.7%. However,\nexpected shortages are 98.7% and 95.2% for low and lower-middle-income\ncountries. New pricing policies may improve drug access.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:04:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["De La Pava","Martha L. Sabogal","","1 and 2"],["Tucker","Emily L.","","1 and 2"]]}
{"id":"2308.07435","submitter":"Saeed Parvar Dr","authors":"Saeed Parvar, Emad Chaparian, Outi Tammisola","title":"General hydrodynamic features of elastoviscoplastic fluid flows through\n  randomised porous media","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A numerical study of yield-stress fluids flowing in porous media is\npresented. The porous media is randomly constructed by non-overlapping\nmono-dispersed circular obstacles. Two class of rheological models are\ninvestigated: elastoviscoplastic fluids (i.e. Saramito model) and viscoplastic\nfluids (i.e. Bingham model). A wide range of practical Weissenberg and Bingham\nnumbers is studied at three different levels of porosities of the media. The\nemphasis is on revealing some physical transport mechanisms of yield-stress\nfluids in porous media when the elastic behaviour of this kind of fluids is\nincorporated. Thus, computations of elastoviscoplastic fluids are performed and\nare compared with the viscoplastic fluid flow properties. At a constant\nWeissenberg number, the pressure drop increases both with the Bingham number\nand the solid volume fraction of obstacles. However, the effect of elasticity\nis less trivial. At low Bingham numbers, the pressure drop of an\nelastoviscoplastic fluid increases compared to a viscoplastic fluid, while at\nhigh Bingham numbers we observe drag reduction by elasticity. At the yield\nlimit (i.e. infinitely large Bingham numbers), elasticity of the fluid\nsystematically promotes yielding: elastic stresses help the fluid to overcome\nthe yield stress resistance at smaller pressure gradients. We observe that\nelastic effects increase with both Weissenberg and Bingham numbers. In both\ncases, elastic effects finally make the elastoviscoplastic flow unsteady, which\nconsequently can result in chaos and turbulence. Keywords: Yield-stress fluids;\nViscoplastic fluids; Elastoviscoplastic fluids; Porous media\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:05:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Parvar","Saeed",""],["Chaparian","Emad",""],["Tammisola","Outi",""]]}
{"id":"2308.07436","submitter":"Niloufar Delfan","authors":"Niloufar Delfan, Mohammadreza Shahsavari, Sadiq Hussain, Robertas\n  Dama\\v{s}evi\\v{c}ius, U. Rajendra Acharya","title":"A Hybrid Deep Spatio-Temporal Attention-Based Model for Parkinson's\n  Disease Diagnosis Using Resting State EEG Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Parkinson's disease (PD), a severe and progressive neurological illness,\naffects millions of individuals worldwide. For effective treatment and\nmanagement of PD, an accurate and early diagnosis is crucial. This study\npresents a deep learning-based model for the diagnosis of PD using resting\nstate electroencephalogram (EEG) signal. The objective of the study is to\ndevelop an automated model that can extract complex hidden nonlinear features\nfrom EEG and demonstrate its generalizability on unseen data. The model is\ndesigned using a hybrid model, consists of convolutional neural network (CNN),\nbidirectional gated recurrent unit (Bi-GRU), and attention mechanism. The\nproposed method is evaluated on three public datasets (Uc San Diego Dataset,\nPRED-CT, and University of Iowa (UI) dataset), with one dataset used for\ntraining and the other two for evaluation. The results show that the proposed\nmodel can accurately diagnose PD with high performance on both the training and\nhold-out datasets. The model also performs well even when some part of the\ninput information is missing. The results of this work have significant\nimplications for patient treatment and for ongoing investigations into the\nearly detection of Parkinson's disease. The suggested model holds promise as a\nnon-invasive and reliable technique for PD early detection utilizing resting\nstate EEG.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:06:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Delfan","Niloufar",""],["Shahsavari","Mohammadreza",""],["Hussain","Sadiq",""],["Dama\u0161evi\u010dius","Robertas",""],["Acharya","U. Rajendra",""]]}
{"id":"2308.07437","submitter":"Xin Sun","authors":"Xin Sun","title":"Impact of COVID-19 Lockdown Measures on Chinese Startups and Local\n  Government Public Finance: Challenges and Policy Implications","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":"  This paper aims to assess the impact of COVID-19 on the public finance of\nChinese local governments, with a particular focus on the effect of lockdown\nmeasures on startups during the pandemic. The outbreak has placed significant\nfiscal pressure on local governments, as containment measures have led to\ndeclines in revenue and increased expenses related to public health and social\nwelfare. In tandem, startups have faced substantial challenges, including\nreduced funding and profitability, due to the negative impact of lockdown\nmeasures on entrepreneurship. Moreover, the pandemic has generated short- and\nlong-term economic shocks, affecting both employment and economic recovery. To\naddress these challenges, policymakers must balance health concerns with\neconomic development. In this regard, the government should consider\nimplementing more preferential policies that focus on startups to ensure their\nsurvival and growth. Such policies may include financial assistance, tax\nincentives, and regulatory flexibility to foster innovation and\nentrepreneurship. By and large, the COVID-19 pandemic has had a profound impact\non both the public finance of Chinese local governments and the startup\necosystem. Addressing the challenges faced by local governments and startups\nwill require a comprehensive approach that balances health and economic\nconsiderations and includes targeted policies to support entrepreneurship and\ninnovation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:13:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sun","Xin",""]]}
{"id":"2308.07438","submitter":"Sam Sanders","authors":"Sam Sanders","title":"Exploring the abyss in Kleene's computability theory","comments":"24 pages; this paper is a significant extension ('journal version')\n  of my CiE2023 proceedings paper arXiv:2302.07066","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kleene's computability theory based on the S1-S9 computation schemes\nconstitutes a model for computing with objects of any finite type and extends\nTuring's 'machine model' which formalises computing with real numbers. A\nfundamental distinction in Kleene's framework is between normal and non-normal\nfunctionals where the former compute the associated Kleene quantifier\n$\\exists^n$ and the latter do not. Historically, the focus was on normal\nfunctionals, but recently new non-normal functionals have been studied based on\nwell-known theorems, the weakest among which seems to be the uncountability of\nthe reals. These new non-normal functionals are fundamentally different from\nhistorical examples like Tait's fan functional: the latter is computable from\n$\\exists^2$, while the former are computable in $\\exists^3$ but not in weaker\noracles. Of course, there is a great divide or abyss separating $\\exists^2$ and\n$\\exists^3$ and we identify slight variations of our new non-normal functionals\nthat are again computable in $\\exists^2$, i.e. fall on different sides of this\nabyss. Our examples are based on mainstream mathematical notions, like\nquasi-continuity, Baire classes, bounded variation, and semi-continuity from\nreal analysis.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:15:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sanders","Sam",""]]}
{"id":"2308.07439","submitter":"Amr Abdelraouf","authors":"Amr Abdelraouf, Rohit Gupta, Kyungtae Han","title":"Interaction-Aware Personalized Vehicle Trajectory Prediction Using\n  Temporal Graph Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate prediction of vehicle trajectories is vital for advanced driver\nassistance systems and autonomous vehicles. Existing methods mainly rely on\ngeneric trajectory predictions derived from large datasets, overlooking the\npersonalized driving patterns of individual drivers. To address this gap, we\npropose an approach for interaction-aware personalized vehicle trajectory\nprediction that incorporates temporal graph neural networks. Our method\nutilizes Graph Convolution Networks (GCN) and Long Short-Term Memory (LSTM) to\nmodel the spatio-temporal interactions between target vehicles and their\nsurrounding traffic. To personalize the predictions, we establish a pipeline\nthat leverages transfer learning: the model is initially pre-trained on a\nlarge-scale trajectory dataset and then fine-tuned for each driver using their\nspecific driving data. We employ human-in-the-loop simulation to collect\npersonalized naturalistic driving trajectories and corresponding surrounding\nvehicle trajectories. Experimental results demonstrate the superior performance\nof our personalized GCN-LSTM model, particularly for longer prediction\nhorizons, compared to its generic counterpart. Moreover, the personalized model\noutperforms individual models created without pre-training, emphasizing the\nsignificance of pre-training on a large dataset to avoid overfitting. By\nincorporating personalization, our approach enhances trajectory prediction\naccuracy.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:20:26 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 01:29:39 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Abdelraouf","Amr",""],["Gupta","Rohit",""],["Han","Kyungtae",""]]}
{"id":"2308.07440","submitter":"Themis Matsoukas","authors":"Themis Matsoukas","title":"Quantum Probability and the Born Ensemble","comments":"13 pages including appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We formulate a discrete two-state stochastic model with elementary rules that\ngive rise to Born statistics and reproduce the probabilities of the Schrodinger\nequation under an associated Hamiltonian matrix, which we identify. We define\nthe probability to observe a state, classical or quantum, in proportion to the\nnumber of events at that state--number of ways the walker may materialize at a\npoint of observation at time t, starting from known initial state at t=0. The\nquantum stochastic process differs from its classical counterpart in that the\nquantum walker is a pair of qubits, each transmitted independently through all\npossible paths to a point of observation, and whose recombination may produce a\npositive or negative event. We represent the state of the walker via a square\nmatrix of recombination events, interpret the indeterminacy of the qubit state\nas rotations of this matrix, and show that the Born rule counts the number\nelements on this matrix that remain invariant over a full rotation.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:21:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Matsoukas","Themis",""]]}
{"id":"2308.07441","submitter":"Lianfa Li","authors":"Lianfa Li, Roxana Khalili, Frederick Lurmann, Nathan Pavlovic, Jun Wu,\n  Yan Xu, Yisi Liu, Karl O'Sharkey, Beate Ritz, Luke Oman, Meredith Franklin,\n  Theresa Bastain, Shohreh F. Farzan, Carrie Breton, Rima Habre","title":"Physics-Informed Deep Learning to Reduce the Bias in Joint Prediction of\n  Nitrogen Oxides","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":"  Atmospheric nitrogen oxides (NOx) primarily from fuel combustion have\nrecognized acute and chronic health and environmental effects. Machine learning\n(ML) methods have significantly enhanced our capacity to predict NOx\nconcentrations at ground-level with high spatiotemporal resolution but may\nsuffer from high estimation bias since they lack physical and chemical\nknowledge about air pollution dynamics. Chemical transport models (CTMs)\nleverage this knowledge; however, accurate predictions of ground-level\nconcentrations typically necessitate extensive post-calibration. Here, we\npresent a physics-informed deep learning framework that encodes\nadvection-diffusion mechanisms and fluid dynamics constraints to jointly\npredict NO2 and NOx and reduce ML model bias by 21-42%. Our approach captures\nfine-scale transport of NO2 and NOx, generates robust spatial extrapolation,\nand provides explicit uncertainty estimation. The framework fuses\nknowledge-driven physicochemical principles of CTMs with the predictive power\nof ML for air quality exposure, health, and policy applications. Our approach\noffers significant improvements over purely data-driven ML methods and has\nunprecedented bias reduction in joint NO2 and NOx prediction.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:26:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Lianfa",""],["Khalili","Roxana",""],["Lurmann","Frederick",""],["Pavlovic","Nathan",""],["Wu","Jun",""],["Xu","Yan",""],["Liu","Yisi",""],["O'Sharkey","Karl",""],["Ritz","Beate",""],["Oman","Luke",""],["Franklin","Meredith",""],["Bastain","Theresa",""],["Farzan","Shohreh F.",""],["Breton","Carrie",""],["Habre","Rima",""]]}
{"id":"2308.07442","submitter":"Habib Mostafaei","authors":"Habib Mostafaei, Maciej Pacut, Stefan Schmid","title":"RIFO: Pushing the Efficiency of Programmable Packet Schedulers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Packet scheduling is a fundamental networking task that recently received\nrenewed attention in the context of programmable data planes. Programmable\npacket scheduling systems such as those based on Push-In First-Out (PIFO)\nabstraction enabled flexible scheduling policies, but are too\nresource-expensive for large-scale line rate operation. This prompted research\ninto practical programmable schedulers (e.g., SP-PIFO, AIFO) approximating PIFO\nbehavior on regular hardware. Yet, their scalability remains limited due to\nextensive number of memory operations. To address this, we design an effective\nyet resource-efficient packet scheduler, Range-In First-Out (RIFO), which uses\nonly three mutable memory cells and one FIFO queue per PIFO queue. RIFO is\nbased on multi-criteria decision-making principles and uses small guaranteed\nadmission buffers. Our large-scale simulations in Netbench demonstrate that\ndespite using fewer resources, RIFO generally achieves competitive flow\ncompletion times across all studied workloads, and is especially effective in\nworkloads with a significant share of large flows, reducing flow completion\ntime up to 2.9x in Datamining workloads compared to state-of-the-art solutions.\nOur prototype implementation using P4 on Tofino switches requires only 650\nlines of code, is scalable, and runs at line rate.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:26:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mostafaei","Habib",""],["Pacut","Maciej",""],["Schmid","Stefan",""]]}
{"id":"2308.07443","submitter":"Michael Shara","authors":"Michael M. Shara, Steve B. Howell, Elise Furlan, James T. Garland,\n  Anthony F.J. Moffat, and David Zurek","title":"Speckle Imaging of Gamma2 Velorum: The Inner Wind Possibly Resolved","comments":"7 pages, 4 Figures, in press in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately quantifying the rates dM/dt at which massive stars lose mass is\nessential to any understanding of their evolution. All dM/dt estimates to date\nassume wind clumping factors; not allowing for clumping leads to overestimates\nof dM/dt and underestimates of lifetimes and masses when these stars explode as\nsupernovae. Mid-IR spectroscopy suggested that the wind of the nearest\nWolf-Rayet star, Gamma2 Vel, is resolved with a Full Width at 10 per cent\nintensity of 0.5 arcsec, or 171 AU at the 342 pc distance of the star. As the\nZorro speckle imager on Gemini-South is capable of 0.02 arcsec resolution, we\nhave used it to image Gamma2 Vel at two orbital phases (0.30 and 0.44) with two\nnarrowband and two intermediate-band filters in an attempt to resolve its wind.\nOur observations demonstrate that the wind of Gamma2 Vel may be resolved as a\n0.07 arcsec westward elongation through an 832 nm filter at orbital phase 0.3 .\nIf confirmed, this is the smallest scale (24 AU) at which a WR star wind\nasymmetry has been directly imaged. Similar imaging at multiple phases is\nneeded to determine if the asymmetry is due to stochastic wind clumping,\nco-rotating interaction regions or colliding-wind, cone-shaped shocks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:33:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shara","Michael M.",""],["Howell","Steve B.",""],["Furlan","Elise",""],["Garland","James T.",""],["Moffat","Anthony F. J.",""],["Zurek","David",""]]}
{"id":"2308.07444","submitter":"Levy Chaves","authors":"Levy Chaves, Alceu Bissoto, Eduardo Valle, Sandra Avila","title":"The Performance of Transferability Metrics does not Translate to Medical\n  Tasks","comments":"10 pages, 3 figures. Accepted at the DART workshop @ MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transfer learning boosts the performance of medical image analysis by\nenabling deep learning (DL) on small datasets through the knowledge acquired\nfrom large ones. As the number of DL architectures explodes, exhaustively\nattempting all candidates becomes unfeasible, motivating cheaper alternatives\nfor choosing them. Transferability scoring methods emerge as an enticing\nsolution, allowing to efficiently calculate a score that correlates with the\narchitecture accuracy on any target dataset. However, since transferability\nscores have not been evaluated on medical datasets, their use in this context\nremains uncertain, preventing them from benefiting practitioners. We fill that\ngap in this work, thoroughly evaluating seven transferability scores in three\nmedical applications, including out-of-distribution scenarios. Despite\npromising results in general-purpose datasets, our results show that no\ntransferability score can reliably and consistently estimate target performance\nin medical contexts, inviting further work in that direction.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:34:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chaves","Levy",""],["Bissoto","Alceu",""],["Valle","Eduardo",""],["Avila","Sandra",""]]}
{"id":"2308.07445","submitter":"Rafael Henrique Vareto Mr.","authors":"Rafael Henrique Vareto and William Robson Schwartz","title":"Open-set Face Recognition using Ensembles trained on Clustered Data","comments":"[Original paper title: Unconstrained Face Identification using\n  Ensembles trained on Clustered Data] [2020 IEEE International Joint\n  Conference on Biometrics (IJCB)]\n  [https://ieeexplore.ieee.org/document/9304882]","journal-ref":null,"doi":"10.1109/IJCB48548.2020.9304882","report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Open-set face recognition describes a scenario where unknown subjects, unseen\nduring the training stage, appear on test time. Not only it requires methods\nthat accurately identify individuals of interest, but also demands approaches\nthat effectively deal with unfamiliar faces. This work details a scalable\nopen-set face identification approach to galleries composed of hundreds and\nthousands of subjects. It is composed of clustering and an ensemble of binary\nlearning algorithms that estimates when query face samples belong to the face\ngallery and then retrieves their correct identity. The approach selects the\nmost suitable gallery subjects and uses the ensemble to improve prediction\nperformance. We carry out experiments on well-known LFW and YTF benchmarks.\nResults show that competitive performance can be achieved even when targeting\nscalability.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:34:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Vareto","Rafael Henrique",""],["Schwartz","William Robson",""]]}
{"id":"2308.07446","submitter":"Rodolfo Viera","authors":"Mircea Petrache and Rodolfo Viera","title":"Effective recovery of Fourier spectra and spectral approximation by\n  finite groups","comments":"40 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.GR math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a result on approximate recovery, with high probability, of\nsubgroups of a finite nonabelian group $\\Gamma$ from their random\nperturbations. We use this for ad-hoc sequences of $\\Gamma_n$ while passing to\nthe continuum limit, in order to obtain asymptotic almost sure recovery for\nrational lcsc nilpotent Lie groups. By comparison to limit theorems for groups\nof polynomial growth, it turns out that this setting is the natural general\nsetting for recovery results, under polynomial growth assumptions on the\n$\\Gamma_n$. This approach makes effective the convergence rate in previous\nFourier recovery theorems in Euclidean space, and extends them to the\nnonabelian setting. A series of interesting further directions are highlighted\nby this approach.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:35:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Petrache","Mircea",""],["Viera","Rodolfo",""]]}
{"id":"2308.07447","submitter":"Elias Gabriel Minian","authors":"Agust\\'in Nicol\\'as Barreto and Elias Gabriel Minian","title":"Local indicability of groups with homology circle presentations","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate conditions that guarantee local indicability of groups that\nadmit presentations with the homology of a circle, generalizing a result of J.\nHowie for two-relator presentations. We apply our results to investigate local\nindicability of LOT groups and some classes of non-cycle-free Adian\npresentations, extending previous results in that direction by J. Howie and D.\nWise.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:38:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Barreto","Agust\u00edn Nicol\u00e1s",""],["Minian","Elias Gabriel",""]]}
{"id":"2308.07448","submitter":"Katie Anders","authors":"Katie Anders, Madeline Locus Dawsey, Rajat Gupta, and Joseph Vandehey","title":"Non-standard binary representations and the Stern sequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that the number of short binary signed-digit representations of an\ninteger $n$ is equal to the $n$-th term in the Stern sequence. Various proofs\nare provided, including direct, bijective, and generating function proofs. We\nalso show that this result can be derived from recent work of Monroe on binary\nsigned-digit representations of a fixed length.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:38:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Anders","Katie",""],["Dawsey","Madeline Locus",""],["Gupta","Rajat",""],["Vandehey","Joseph",""]]}
{"id":"2308.07449","submitter":"Aiman Soliman","authors":"Aiman Soliman, Priyam Mazumdar, Aaron Hoyle-Katz, Brian Allan, and\n  Allison Gardner","title":"Integrated dataset for air travel and reported Zika virus cases in\n  Colombia (Data and Resources Paper)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This open-access dataset provides consistent records of air travel volumes\nbetween 205 airport catchments in Colombia and the associated number of\nreported human cases of Zika virus within these catchments during the arbovirus\noutbreak between October 2015 and September 2016. We associated in this dataset\nthe monthly air travel volumes provided by the Colombian Civil Aviation\nAuthority (AEROCIVIL) with the reported human cases of Zika Virus published by\nThe Pan American Health Organization (PAHO). Our methodology consists of\ngeocoding all the reported airports and identifying the catchment of each\nairport using the municipalities' boundaries since reported human cases of Zika\nVirus are available at the municipal level. In addition, we calculated the\ntotal population at risk in each airport catchment by combining the total\npopulation count in a catchment with the environmental suitability of the Aedes\naegypti mosquito, the vector for the Zika virus. We separated the monthly air\ntravel volumes into domestic and international based on the location of the\norigin airport. The current dataset includes the total air travel volumes of\n23,539,364 passengers on domestic flights and 11,592,197 on international ones.\nWe validated our dataset by comparing the monthly aggregated air travel volumes\nbetween airport catchments to those predicted by the gravity model. We hope the\nnovel dataset will provide a resource to researchers studying the role of human\nmobility in the spread of mosquito-borne diseases and modeling disease spread\nin realistic networks.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:38:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Soliman","Aiman",""],["Mazumdar","Priyam",""],["Hoyle-Katz","Aaron",""],["Allan","Brian",""],["Gardner","Allison",""]]}
{"id":"2308.07450","submitter":"Antoine Tordeux","authors":"Raphael Korbmacher, Alexandre Nicolas, Antoine Tordeux and Claudia\n  Totzeck","title":"Time-continuous microscopic pedestrian models: an overview","comments":"26 pages; chapter accepted for publication in Crowd Dynamics (vol. 4)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give an overview of time-continuous pedestrian models with a focus on\ndata-driven modelling. Starting from pioneer, reactive force-based models we\nmove forward to modern, active pedestrian models with sophisticated\ncollision-avoidance and anticipation techniques through optimisation problems.\nThe overview focuses on the mathematical aspects of the models and their\ndifferent components. We include methods used for data-based calibration of\nmodel parameters, hybrid approaches incorporating neural networks, and purely\ndata-based models fitted by deep learning. Some development perspectives of\nmodelling paradigms we expect to grow in the coming years are outlined in the\nconclusion.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:40:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Korbmacher","Raphael",""],["Nicolas","Alexandre",""],["Tordeux","Antoine",""],["Totzeck","Claudia",""]]}
{"id":"2308.07451","submitter":"Antoine Tordeux","authors":"Jakob Cordes, Mohcine Chraibi, Antoine Tordeux, Andreas Schadschneider","title":"Single-file pedestrian dynamics: a review of agent-following models","comments":"35 pages, 10 Figures; chapter accepted for publication in Crowd\n  Dynamics (vol. 4)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single-file dynamics has been studied intensively, both experimentally and\ntheoretically. It shows interesting collective effects, such as stop-and-go\nwaves, which are validation cornerstones for any agent-based modeling approach\nof traffic systems. Many models have been proposed, e.g. in the form of\ncar-following models for vehicular traffic. These approaches can be adapted for\npedestrian streams. In this study, we delve deeper into these models, with\nparticular attention on their interconnections. We do this by scrutinizing the\ninfluence of different parameters, including relaxation times, anticipation\ntime, and reaction time. Specifically, we analyze the inherent fundamental\nproblems with force-based models, a classical approach in pedestrian dynamics.\nFurthermore, we categorize car-following models into stimulus-response and\noptimal velocity models, highlighting their historical and conceptual\ndifferences. These classes can further be subdivided considering the conceptual\ndefinitions of the models, e.g. first-order vs. second-order models, or\nstochastic vs. deterministic models with and without noise. Our analysis shows\nhow car-following models originally developed for vehicular traffic can provide\nnew insights into pedestrian behavior. The focus on single-file motion, which\nis similar to single-lane vehicular traffic, allows for a detailed examination\nof the relevant interactions between pedestrians.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:40:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cordes","Jakob",""],["Chraibi","Mohcine",""],["Tordeux","Antoine",""],["Schadschneider","Andreas",""]]}
{"id":"2308.07452","submitter":"Xiaoyang Ruan","authors":"Xiaoyang Ruan, Liwei Wang, Charat Thongprayoon, Wisit Cheungpasitporn,\n  Hongfang Liu","title":"GRU-D-Weibull: A Novel Real-Time Individualized Endpoint Prediction","comments":"30 pages, 7 figures, 4 supplementary figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurate prediction models for individual-level endpoints and\ntime-to-endpoints are crucial in clinical practice. In this study, we propose a\nnovel approach, GRU-D-Weibull, which combines gated recurrent units with decay\n(GRU-D) to model the Weibull distribution. Our method enables real-time\nindividualized endpoint prediction and population-level risk management. Using\na cohort of 6,879 patients with stage 4 chronic kidney disease (CKD4), we\nevaluated the performance of GRU-D-Weibull in endpoint prediction. The C-index\nof GRU-D-Weibull was ~0.7 at the index date and increased to ~0.77 after 4.3\nyears of follow-up, similar to random survival forest. Our approach achieved an\nabsolute L1-loss of ~1.1 years (SD 0.95) at the CKD4 index date and a minimum\nof ~0.45 years (SD0.3) at 4 years of follow-up, outperforming competing methods\nsignificantly. GRU-D-Weibull consistently constrained the predicted survival\nprobability at the time of an event within a smaller and more fixed range\ncompared to other models throughout the follow-up period. We observed\nsignificant correlations between the error in point estimates and missing\nproportions of input features at the index date (correlations from ~0.1 to\n~0.3), which diminished within 1 year as more data became available. By\npost-training recalibration, we successfully aligned the predicted and observed\nsurvival probabilities across multiple prediction horizons at different time\npoints during follow-up. Our findings demonstrate the considerable potential of\nGRU-D-Weibull as the next-generation architecture for endpoint risk management,\ncapable of generating various endpoint estimates for real-time monitoring using\nclinical data.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:46:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ruan","Xiaoyang",""],["Wang","Liwei",""],["Thongprayoon","Charat",""],["Cheungpasitporn","Wisit",""],["Liu","Hongfang",""]]}
{"id":"2308.07453","submitter":"Alireza Mohammadi","authors":"Alireza Mohammadi, Mohammad Al Janaideh","title":"Sign Gradient Descent Algorithms for Kinetostatic Protein Folding","comments":"6 pages, Accepted in 2023 International Conference on Manipulation,\n  Automation and Robotics at Small Scales (MARSS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a sign gradient descent (SGD) algorithm for predicting\nthe three-dimensional folded protein molecule structures under the kinetostatic\ncompliance method (KCM). In the KCM framework, which can be used to simulate\nthe range of motion of peptide-based nanorobots/nanomachines, protein molecules\nare modeled as a large number of rigid nano-linkages that form a kinematic\nmechanism under motion constraints imposed by chemical bonds while folding\nunder the kinetostatic effect of nonlinear interatomic force fields. In a\ndeparture from the conventional successive kinetostatic fold compliance\nframework, the proposed SGD-based iterative algorithm in this paper results in\nconvergence to the local minima of the free energy of protein molecules\ncorresponding to their final folded conformations in a faster and more robust\nmanner. KCMbased folding dynamics simulations of the backbone chains of protein\nmolecules demonstrate the effectiveness of the proposed algorithm.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:48:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mohammadi","Alireza",""],["Janaideh","Mohammad Al",""]]}
{"id":"2308.07454","submitter":"Thiago Henrique Moreira","authors":"Thiago Henrique Moreira and Lucas Chibebe C\\'eleri","title":"Decoherence of a composite particle induced by a weak quantized\n  gravitational field","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the fact that we have some proposals for the quantum theory of\ngravity like string theory or loop quantum gravity, we do not have any\nexperimental evidence supporting any of these theories. Actually, we do not\nhave experimental evidence pointing in the direction that we really need a\nquantum description of the gravitational field. In this scenario, several\nproposals for experimentally investigating quantum gravitational effects far\nfrom Plank scale have recently appear in literature, like gravitationally\ninduced entanglement, for instance. An important issue of theses approaches is\nthe decoherence introduced by the quantum nature not only of the system under\nconsideration, but also from the gravitational field itself. Here, by means of\nthe Feynman-Vernon influence functional we study the decoherence of a quantum\nsystem induced by the quantized gravitational field and by its own quantum\nnature. Our results may be important in providing a better understanding of\nmany phenomena like the decoherence induced by the gravitational time-dilation,\nthe quantum reference frames and the quantum equivalence principle.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:49:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Moreira","Thiago Henrique",""],["C\u00e9leri","Lucas Chibebe",""]]}
{"id":"2308.07455","submitter":"Tanya Khovanova","authors":"Nikhil Byrapuram, Hwiseo (Irene) Choi, Adam Ge, Selena Ge, Tanya\n  Khovanova, Sylvia Zia Lee, Evin Liang, Rajarshi Mandal, Aika Oki, Daniel Wu,\n  and Michael Yang","title":"Quad Squares","comments":"24 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is\na card game with 64 cards where cards have 3 attributes with 4 values in each\nattribute. A quad is four cards with all attributes the same, all different, or\nhalf and half. We define Latin quad squares as squares where the cards in each\nrow and column have different values for each attribute. We define semimagic\nquad squares as squares where each row and column form a quad. For magic quad\nsquares, we add a requirement that the diagonals have to form a quad. We also\ndefine strongly magic quad squares. We analyze types of semimagic and strongly\nmagic quad squares. We also calculate the number of semimagic, magic, and\nstrongly magic quad squares for quad decks of any size. These squares can be\ndescribed in terms of integers. Four integers form a quad when their bitwise\nXOR is zero.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:49:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Byrapuram","Nikhil","","Irene"],["Hwiseo","","","Irene"],["Choi","",""],["Ge","Adam",""],["Ge","Selena",""],["Khovanova","Tanya",""],["Lee","Sylvia Zia",""],["Liang","Evin",""],["Mandal","Rajarshi",""],["Oki","Aika",""],["Wu","Daniel",""],["Yang","Michael",""]]}
{"id":"2308.07456","submitter":"Muhammad Zeeshan","authors":"Muhammad Zeeshan, Saima Masood, Saima Ashraf, Shehla G. Bokhar, Hafsa\n  Zainab, Saher Ijaz, Muhammad Usman, Ayesha Masood, Hafiz Faseeh U. Rehman,\n  Mirza M. Usman","title":"Efficacy of mannan-oligosaccharide and live yeast feed additives on\n  performance, rumen morphology, serum biochemical parameters and muscle\n  morphometric characteristics in buffalo calves","comments":"Pages 13, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The objective of the current study was to assess the effect of dietary\nsupplementations of mannan-oligosaccharide, live yeast, and a combination of\nthese two additives on growth performance, histo-morphology of the rumen, and\nmuscle morphometric attributes in buffalo calves. A total of twenty buffalo\ncalves (average weight of 25 kg) having 3 months of age were distributed\naccording to a complete randomized design. All animals were individually\nstalled in the shed and were fed ad-libitum. Experimental animals were divided\ninto four groups for 67 days: Control group(without the inclusion of dietary\nsupplementation); MOS group (Mannan oligosaccharide 5 g/clave/day; Yeast group\n(Live yeast 2g/calve/day) and Mixed group (MOS + Live Yeast 2.5g + 1g\n)/calve/day. Experimental results revealed that combined supplementation of MOS\nand Yeast and MOS alone resulted in an increased number of short-chain fatty\nacids in the rumen as well as ruminal pH (P<0.05). Results showed a significant\nimprovement in average daily gain and FCR of MOS and Mixed supplemented groups\n(P<0.05). Histomorphological evaluation of rumen mucosal epithelium showed a\nsignificant improvement in the mixed-supplemented group (P<0.05) as compared to\nthe yeast-supplemented and control groups. Muscle quality parameters such as\nmeat texture showed significant improvement in MOS and mix-supplemented groups.\nHistological examination of longissimus dorsi muscle cross-section showed a\nsignificantly higher(P<0.05) muscle fiber and muscle fascicle diameter in both\nMOS and mix-supplemented calves groups. In conclusion, the results of this\nexperiment revealed that the dietary addition of MOS, Live yeast, and their\ncombination have positive effects on growth performance, rumen histology\nindices, and muscle morphometric features in buffalo calves.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 20:58:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zeeshan","Muhammad",""],["Masood","Saima",""],["Ashraf","Saima",""],["Bokhar","Shehla G.",""],["Zainab","Hafsa",""],["Ijaz","Saher",""],["Usman","Muhammad",""],["Masood","Ayesha",""],["Rehman","Hafiz Faseeh U.",""],["Usman","Mirza M.",""]]}
{"id":"2308.07457","submitter":"Michael Wilbur","authors":"Michael Wilbur, Amutheezan Sivagnanam, Afiya Ayman, Samitha\n  Samaranayeke, Abhishek Dubey, Aron Laszka","title":"Artificial Intelligence for Smart Transportation","comments":"This is a pre-print for a book chapter to appear in Vorobeychik,\n  Yevgeniy., and Mukhopadhyay, Ayan., (Eds.). (2023). Artificial Intelligence\n  and Society. ACM Press","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There are more than 7,000 public transit agencies in the U.S. (and many more\nprivate agencies), and together, they are responsible for serving 60 billion\npassenger miles each year. A well-functioning transit system fosters the growth\nand expansion of businesses, distributes social and economic benefits, and\nlinks the capabilities of community members, thereby enhancing what they can\naccomplish as a society. Since affordable public transit services are the\nbackbones of many communities, this work investigates ways in which Artificial\nIntelligence (AI) can improve efficiency and increase utilization from the\nperspective of transit agencies. This book chapter discusses the primary\nrequirements, objectives, and challenges related to the design of AI-driven\nsmart transportation systems. We focus on three major topics. First, we discuss\ndata sources and data. Second, we provide an overview of how AI can aid\ndecision-making with a focus on transportation. Lastly, we discuss\ncomputational problems in the transportation domain and AI approaches to these\nproblems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:01:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wilbur","Michael",""],["Sivagnanam","Amutheezan",""],["Ayman","Afiya",""],["Samaranayeke","Samitha",""],["Dubey","Abhishek",""],["Laszka","Aron",""]]}
{"id":"2308.07458","submitter":"Oren Mizrahi","authors":"Oren S. Mizrahi, Austin Fikes, Alan Truong, Fabian Wiesem\\\"uller,\n  Sergio Pellegrino, Ali Hajimiri","title":"Popup Arrays for Large Space-Borne Apertures","comments":"12 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large apertures in space are critical for high-power and high-bandwidth\napplications spanning wireless power transfer (WPT) and communication, however\nprogress on this front is stunted by the geometric limitations of rocket\nflight. Here, we present a light and flexible 10GHz array, which is composed of\ndipole antennas co-cured to a glass-fiber composite. The arrays are designed to\ndynamically conform to new shapes and to be flexible enough to fold completely\nflat, coil, and pop back up upon deployment. The design was chosen to be\namenable to scalable, automated manufacturing - a requirement for the massive\nproduction necessary for large apertures. Moreover, the arrays passed the\nstandard gamut of required space-qualification testing: the antennas can\nsurvive mechanical stress, extreme temperatures, high-frequency temperature\ncycling, and prolonged stowage in the flattened configuration. The elements\nexhibit excellent electromagnetic performance - with a return ratio better than\n-10dB over a bandwidth of 1.5GHz and a single lobe half-power beam width of\ngreater than $110^\\circ$ suitable for broad range beamforming and with\nexcellent manufacturing consistency. Moreover, its mechanical durability\nvis-a-vis extreme temperatures and protracted stowage lends itself to demanding\nspace applications. This lightweight and scalable array is equipped to serve a\nhost of new space-based radio-frequency technologies and applications which\nleverage large, stowable and durable array apertures.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:05:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mizrahi","Oren S.",""],["Fikes","Austin",""],["Truong","Alan",""],["Wiesem\u00fcller","Fabian",""],["Pellegrino","Sergio",""],["Hajimiri","Ali",""]]}
{"id":"2308.07459","submitter":"Taylor Brysiewicz","authors":"Taylor Brysiewicz and Michael Joswig","title":"Polyhedral Geometry in OSCAR","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  OSCAR is an innovative new computer algebra system which combines and extends\nthe power of its four cornerstone systems - GAP (group theory), Singular\n(algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic\n(number theory). Here, we give an introduction to polyhedral geometry\ncomputations in OSCAR, as a chapter of the upcoming OSCAR book. In particular,\nwe define polytopes, polyhedra, and polyhedral fans, and we give a brief\noverview about computing convex hulls and solving linear programs. Three\ndetailed case studies are concerned with face numbers of random polytopes,\nconstructions and properties of Gelfand-Tsetlin polytopes, and secondary\npolytopes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:10:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Brysiewicz","Taylor",""],["Joswig","Michael",""]]}
{"id":"2308.07460","submitter":"Alessio Fiscella","authors":"Jo\\~ao Vitor da Silva, Alessio Fiscella, Victor A. Blanco Viloria","title":"Mixed local-nonlocal quasilinear problems with critical nonlinearities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study existence and multiplicity of nontrivial solutions of the following\nproblem $$ \\left\\{ \\begin{array}{rcll} -\\Delta_p u+(-\\Delta_p)^{s} u & = &\n\\lambda|u|^{q-2}u+|u|^{p^{\\ast}-2}u & \\mbox{ in }\\Omega,\\\\ u & = & 0 & \\mbox{\non } \\mathbb{R}^{N} \\setminus \\Omega, \\end{array} \\right. $$ where\n$\\Omega\\subset \\mathbb{R}^N$ is a bounded open set with smooth boundary,\ndimension $N\\geq 2$, parameter $\\lambda>0$, exponents $0<s<1<p<N$, while\n$q\\in(1,p^{\\ast})$ with $p^{\\ast}=\\frac{Np}{N-p}$. The problem is driven by an\noperator of mixed order obtained by the sum of the classical $p$-Laplacian and\nof the fractional $p$-Laplacian. We analyze three different scenarios depending\non exponent $q$. For this, we combine variational methods with some topological\ntechniques, such as the Krasnoselskii genus and the Lusternik-Schnirelman\ncategory theories.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:16:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["da Silva","Jo\u00e3o Vitor",""],["Fiscella","Alessio",""],["Viloria","Victor A. Blanco",""]]}
{"id":"2308.07461","submitter":"Nicholas Baldonado","authors":"Daniel Adamiak, Nicholas Baldonado, Yuri V. Kovchegov, W. Melnitchouk,\n  Daniel Pitonyak, Nobuo Sato, Matthew D. Sievert, Andrey Tarasov, Yossathorn\n  Tawabutr","title":"Global analysis of polarized DIS & SIDIS data with improved small-$x$\n  helicity evolution","comments":"42 Pages, 21 Figures,","journal-ref":null,"doi":null,"report-no":"JLAB-THY-23-3896","categories":"hep-ph hep-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze the world polarized deep-inelastic scattering (DIS) and\nsemi-inclusive DIS (SIDIS) data at low values of $x < 0.1$, using small-$x$\nevolution equations for the flavor singlet and nonsinglet helicity parton\ndistribution functions (hPDFs). The hPDFs for quarks, antiquarks, and gluons\nare extracted and evolved to lower values of $x$ to make predictions for the\nfuture Electron-Ion Collider (EIC). We improve on our earlier work by employing\nthe more realistic large-$N_c\\, \\& N_f$ limit of the revised small-$x$ helicity\nevolution, and incorporating running coupling corrections along with SIDIS data\ninto the fit. We find an anti-correlation between the signs of the gluon and\n$C$-even quark hPDFs as well as the $g_1$ structure function. While the\nexisting low-$x$ polarized DIS and SIDIS data are insufficient to constrain the\ninitial conditions for the polarized dipole amplitudes in the helicity\nevolution equations, future EIC data will allow more precise predictions for\nhPDFs and the $g_1$ structure function for $x$ values beyond those probed at\nthe EIC. Using the obtained hPDFs, we discuss the contributions to the proton\nspin from quark and gluon spins at small $x$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:18:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Adamiak","Daniel",""],["Baldonado","Nicholas",""],["Kovchegov","Yuri V.",""],["Melnitchouk","W.",""],["Pitonyak","Daniel",""],["Sato","Nobuo",""],["Sievert","Matthew D.",""],["Tarasov","Andrey",""],["Tawabutr","Yossathorn",""]]}
{"id":"2308.07462","submitter":"Pedro Reviriego","authors":"Pedro Reviriego, Javier Conde, Elena Merino-G\\'omez, Gonzalo\n  Mart\\'inez, Jos\\'e Alberto Hern\\'andez","title":"Playing with Words: Comparing the Vocabulary and Lexical Richness of\n  ChatGPT and Humans","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 introduction of Artificial Intelligence (AI) generative language models\nsuch as GPT (Generative Pre-trained Transformer) and tools such as ChatGPT has\ntriggered a revolution that can transform how text is generated. This has many\nimplications, for example, as AI-generated text becomes a significant fraction\nof the text, would this have an effect on the language capabilities of readers\nand also on the training of newer AI tools? Would it affect the evolution of\nlanguages? Focusing on one specific aspect of the language: words; will the use\nof tools such as ChatGPT increase or reduce the vocabulary used or the lexical\nrichness? This has implications for words, as those not included in\nAI-generated content will tend to be less and less popular and may eventually\nbe lost. In this work, we perform an initial comparison of the vocabulary and\nlexical richness of ChatGPT and humans when performing the same tasks. In more\ndetail, two datasets containing the answers to different types of questions\nanswered by ChatGPT and humans, and a third dataset in which ChatGPT\nparaphrases sentences and questions are used. The analysis shows that ChatGPT\ntends to use fewer distinct words and lower lexical richness than humans. These\nresults are very preliminary and additional datasets and ChatGPT configurations\nhave to be evaluated to extract more general conclusions. Therefore, further\nresearch is needed to understand how the use of ChatGPT and more broadly\ngenerative AI tools will affect the vocabulary and lexical richness in\ndifferent types of text and languages.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:19:44 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 11:09:16 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Reviriego","Pedro",""],["Conde","Javier",""],["Merino-G\u00f3mez","Elena",""],["Mart\u00ednez","Gonzalo",""],["Hern\u00e1ndez","Jos\u00e9 Alberto",""]]}
{"id":"2308.07463","submitter":"Ali Enayat","authors":"Ali Enayat","title":"Curious satisfaction classes","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present two new constructions of satisfaction/truth classes over models of\nPA (Peano Arithmetic) that provide a foil to the fact that the existence of a\ndisjunctively correct full truth class over a model M of PA implies that\nCon(PA) holds in M.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:20:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Enayat","Ali",""]]}
{"id":"2308.07464","submitter":"Fabian Offert","authors":"Leonardo Impett and Fabian Offert","title":"There Is a Digital Art History","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we revisit Johanna Drucker's question, \"Is there a digital art\nhistory?\" -- posed exactly a decade ago -- in the light of the emergence of\nlarge-scale, transformer-based vision models. While more traditional types of\nneural networks have long been part of digital art history, and digital\nhumanities projects have recently begun to use transformer models, their\nepistemic implications and methodological affordances have not yet been\nsystematically analyzed. We focus our analysis on two main aspects that,\ntogether, seem to suggest a coming paradigm shift towards a \"digital\" art\nhistory in Drucker's sense. On the one hand, the visual-cultural repertoire\nnewly encoded in large-scale vision models has an outsized effect on digital\nart history. The inclusion of significant numbers of non-photographic images\nallows for the extraction and automation of different forms of visual logics.\nLarge-scale vision models have \"seen\" large parts of the Western visual canon\nmediated by Net visual culture, and they continuously solidify and concretize\nthis canon through their already widespread application in all aspects of\ndigital life. On the other hand, based on two technical case studies of\nutilizing a contemporary large-scale visual model to investigate basic\nquestions from the fields of art history and urbanism, we suggest that such\nsystems require a new critical methodology that takes into account the\nepistemic entanglement of a model and its applications. This new methodology\nreads its corpora through a neural model's training data, and vice versa: the\nvisual ideologies of research datasets and training datasets become entangled.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:21:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Impett","Leonardo",""],["Offert","Fabian",""]]}
{"id":"2308.07465","submitter":"Nikolai Slavov","authors":"Andrew Leduc, Hannah Harens, and Nikolai Slavov","title":"Modeling and interpretation of single-cell proteogenomic data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN q-bio.BM q-bio.TO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Biological functions stem from coordinated interactions among proteins,\nnucleic acids and small molecules. Mass spectrometry technologies for reliable,\nhigh throughput single-cell proteomics will add a new modality to genomics and\nenable data-driven modeling of the molecular mechanisms coordinating proteins\nand nucleic acids at single-cell resolution. This promising potential requires\nestimating the reliability of measurements and computational analysis so that\nmodels can distinguish biological regulation from technical artifacts. We\ndiscuss approaches for developing both abstract and mechanistic models that aim\nto biologically interpret the measured differences across modalities.\nMechanistic models of direct molecular interactions will provide generalizable\nand predictive representations of biological systems.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:25:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Leduc","Andrew",""],["Harens","Hannah",""],["Slavov","Nikolai",""]]}
{"id":"2308.07466","submitter":"Felipe Gohring de Magalhaes Ph.D.","authors":"Felipe Gohring de Magalhaes, Mahdi Nikdast and Gabriela Nicolescu","title":"SerIOS: Enhancing Hardware Security in Integrated Optoelectronic Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Silicon photonics (SiPh) has different applications, from enabling fast and\nhigh-bandwidth communication for high-performance computing systems to\nrealizing energy-efficient optical computation for AI hardware accelerators.\nHowever, integrating SiPh with electronic sub-systems can introduce new\nsecurity vulnerabilities that cannot be adequately addressed using existing\nhardware security solutions for electronic systems. This paper introduces\nSerIOS, the first framework aimed at enhancing hardware security in\noptoelectronic systems by leveraging the unique properties of optical\nlithography. SerIOS employs cryptographic keys generated based on imperfections\nin the optical lithography process and an online detection mechanism to detect\nattacks. Simulation and synthesis results demonstrate SerIOS's effectiveness in\ndetecting and preventing attacks, with a small area footprint of less than 15%\nand a 100% detection rate across various attack scenarios and optoelectronic\narchitectures, including photonic AI accelerators.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:32:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["de Magalhaes","Felipe Gohring",""],["Nikdast","Mahdi",""],["Nicolescu","Gabriela",""]]}
{"id":"2308.07467","submitter":"Daniel Katz","authors":"Daniel J. Katz, Adeebur Rahman, and Michael J Ward","title":"Sequences with identical autocorrelation spectra","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.CA math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aperiodic autocorrelation measures the similarity between a finite-length\nsequence of complex numbers and translates of itself. Autocorrelation is\nimportant in communications, remote sensing, and scientific instrumentation.\nThe autocorrelation function reports the aperiodic autocorrelation at every\npossible translation. Knowing the autocorrelation function of a sequence is\nequivalent to knowing the magnitude of its Fourier transform. Resolving the\nlack of phase information is called the phase problem. We say that two\nsequences are isospectral to mean that they have the same aperiodic\nautocorrelation function. Sequences used in technological applications often\nhave restrictions on their terms: they are not arbitrary complex numbers, but\ncome from an alphabet that may reside in a proper subring of the complex field\nor may come from a finite set of values. For example, binary sequences involve\nterms equal to only $+1$ and $-1$. In this paper, we investigate the necessary\nand sufficient conditions for two sequences to be isospectral, where we take\ntheir alphabet into consideration. There are trivial forms of isospectrality\narising from modifications that predictably preserve the autocorrelation, for\nexample, negating sequences or both conjugating their terms and writing them in\nreverse order. By an exhaustive search of binary sequences up to length $34$,\nwe find that nontrivial isospectrality among binary sequences does occur, but\nis rare. We say that a positive integer $n$ is barren to mean that there are no\nnontrivially isospectral binary sequences of length $n$. For integers $n \\leq\n34$, we found that the barren ones are $1$--$8$, $10$, $11$, $13$, $14$, $19$,\n$22$, $23$, $26$, and $29$. We prove that any multiple of a non-barren number\nis also not barren, and pose an open question as to whether there are finitely\nor infinitely many barren numbers.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:37:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Katz","Daniel J.",""],["Rahman","Adeebur",""],["Ward","Michael J",""]]}
{"id":"2308.07468","submitter":"Cole Hill","authors":"Cole Hill, Mauricio Pamplona Segundo, Sudeep Sarkar","title":"Reducing Training Demands for 3D Gait Recognition with Deep Koopman\n  Operator Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Deep learning research has made many biometric recognition solution viable,\nbut it requires vast training data to achieve real-world generalization. Unlike\nother biometric traits, such as face and ear, gait samples cannot be easily\ncrawled from the web to form massive unconstrained datasets. As the human body\nhas been extensively studied for different digital applications, one can rely\non prior shape knowledge to overcome data scarcity. This work follows the\nrecent trend of fitting a 3D deformable body model into gait videos using deep\nneural networks to obtain disentangled shape and pose representations for each\nframe. To enforce temporal consistency in the network, we introduce a new\nLinear Dynamical Systems (LDS) module and loss based on Koopman operator\ntheory, which provides an unsupervised motion regularization for the periodic\nnature of gait, as well as a predictive capacity for extending gait sequences.\nWe compare LDS to the traditional adversarial training approach and use the USF\nHumanID and CASIA-B datasets to show that LDS can obtain better accuracy with\nless training data. Finally, we also show that our 3D modeling approach is much\nbetter than other 3D gait approaches in overcoming viewpoint variation under\nnormal, bag-carrying and clothing change conditions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:39:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hill","Cole",""],["Segundo","Mauricio Pamplona",""],["Sarkar","Sudeep",""]]}
{"id":"2308.07469","submitter":"Ashutosh Trivedi","authors":"Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh\n  Trivedi, Dominik Wojtczak","title":"Omega-Regular Reward Machines","comments":"To appear in ECAI-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reinforcement learning (RL) is a powerful approach for training agents to\nperform tasks, but designing an appropriate reward mechanism is critical to its\nsuccess. However, in many cases, the complexity of the learning objectives goes\nbeyond the capabilities of the Markovian assumption, necessitating a more\nsophisticated reward mechanism. Reward machines and omega-regular languages are\ntwo formalisms used to express non-Markovian rewards for quantitative and\nqualitative objectives, respectively. This paper introduces omega-regular\nreward machines, which integrate reward machines with omega-regular languages\nto enable an expressive and effective reward mechanism for RL. We present a\nmodel-free RL algorithm to compute epsilon-optimal strategies against\nomega-egular reward machines and evaluate the effectiveness of the proposed\nalgorithm through experiments.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:40:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hahn","Ernst Moritz",""],["Perez","Mateo",""],["Schewe","Sven",""],["Somenzi","Fabio",""],["Trivedi","Ashutosh",""],["Wojtczak","Dominik",""]]}
{"id":"2308.07470","submitter":"Lequn Chen","authors":"Lequn Chen, Weixin Deng, Anirudh Canumalla, Yu Xin, Matthai Philipose,\n  Arvind Krishnamurthy","title":"Symphony: Optimized Model Serving using Centralized Orchestration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The orchestration of deep neural network (DNN) model inference on GPU\nclusters presents two significant challenges: achieving high accelerator\nefficiency given the batching properties of model inference while meeting\nlatency service level objectives (SLOs), and adapting to workload changes both\nin terms of short-term fluctuations and long-term resource allocation. To\naddress these challenges, we propose Symphony, a centralized scheduling system\nthat can scale to millions of requests per second and coordinate tens of\nthousands of GPUs. Our system utilizes a non-work-conserving scheduling\nalgorithm capable of achieving high batch efficiency while also enabling robust\nautoscaling. Additionally, we developed an epoch-scale algorithm that allocates\nmodels to sub-clusters based on the compute and memory needs of the models.\nThrough extensive experiments, we demonstrate that Symphony outperforms prior\nsystems by up to 4.7x higher goodput.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:46:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Lequn",""],["Deng","Weixin",""],["Canumalla","Anirudh",""],["Xin","Yu",""],["Philipose","Matthai",""],["Krishnamurthy","Arvind",""]]}
{"id":"2308.07471","submitter":"Carla Lintzmayer","authors":"Cristina G. Fernandes, Carla N. Lintzmayer, Phablo F. S. Moura","title":"Approximations for the Steiner Multicycle Problem","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 Steiner Multicycle problem consists of, given a complete graph, a weight\nfunction on its vertices, and a collection of pairwise disjoint non-unitary\nsets called terminal sets, finding a minimum weight collection of\nvertex-disjoint cycles in the graph such that, for every terminal set, all of\nits vertices are in a same cycle of the collection. This problem generalizes\nthe Traveling Salesman problem and therefore is hard to approximate in general.\nOn the practical side, it models a collaborative less-than-truckload problem\nwith pickup and delivery locations. Using an algorithm for the Survivable\nNetwork Design problem and T -joins, we obtain a 3-approximation for the metric\ncase, improving on the previous best 4-approximation. Furthermore, we present\nan (11/9)-approximation for the particular case of the Steiner Multicycle in\nwhich each edge weight is 1 or 2. This algorithm can be adapted to obtain a\n(7/6)-approximation when every terminal set contains at least 4 vertices.\nFinally, we devise an O(lg n)-approximation algorithm for the asymmetric\nversion of the problem.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:51:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fernandes","Cristina G.",""],["Lintzmayer","Carla N.",""],["Moura","Phablo F. S.",""]]}
{"id":"2308.07472","submitter":"Chinmay Chinara","authors":"Thomas B Talbot and Chinmay Chinara","title":"Open Medical Gesture: An Open-Source Experiment in Naturalistic Physical\n  Interactions for Mixed and Virtual Reality Simulations","comments":"AHFE 2022","journal-ref":"Human Factors in Virtual Environments and Game Design. AHFE (2022)\n  International Conference. AHFE Open Access, vol 50, 1-7. AHFE International,\n  USA","doi":"10.54941/ahfe1002054","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mixed Reality (MR) and Virtual Reality (VR) simulations are hampered by\nrequirements for hand controllers or attempts to perseverate in use of\ntwo-dimensional computer interface paradigms from the 1980s. From our efforts\nto produce more naturalistic interactions for combat medic training for the\nmilitary, USC has developed an open-source toolkit that enables direct hand\ncontrolled responsive interactions that is sensor independent and can function\nwith depth sensing cameras, webcams or sensory gloves. Natural approaches we\nhave examined include the ability to manipulate virtual smart objects in a\nsimilar manner to how they are used in the real world. From this research and\nreview of current literature, we have discerned several best approaches for\nhand-based human computer interactions which provide intuitive, responsive,\nuseful, and low frustration experiences for VR users.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:56:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Talbot","Thomas B",""],["Chinara","Chinmay",""]]}
{"id":"2308.07473","submitter":"Neel Patel","authors":"Ramiro Deo-Campo Vuong and Shaddin Dughmi and Neel Patel and Aditya\n  Prasad","title":"On Supermodular Contracts and Dense Subgraphs","comments":"31 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the combinatorial contract design problem, introduced and studied by\nDutting et. al. (2021, 2022), in both the single and multi-agent settings.\nPrior work has examined the problem when the principal's utility function is\nsubmodular in the actions chosen by the agent(s).\n  We complement this emerging literature with an examination of the problem\nwhen the principal's utility is supermodular.\n  In the single-agent setting, we obtain a strongly polynomial time algorithm\nfor the optimal contract.\n  This stands in contrast to the NP-hardness of the problem with submodular\nprincipal utility due to Dutting et. al. (2021).\n  This result has two technical components, the first of which applies beyond\nsupermodular or submodular utilities.\n  This result strengthens and simplifies analogous enumeration algorithms from\nDutting et. al. (2021), and applies to any nondecreasing valuation function for\nthe principal.\n  Second, we show that supermodular valuations lead to a polynomial number of\nbreakpoints, analogous to a similar result by Dutting et. al. (2021) for gross\nsubstitutes valuations.\n  In the multi-agent setting, we obtain a mixed bag of positive and negative\nresults.\n  First, we show that it is NP-hard to obtain any finite multiplicative\napproximation, or an additive FPTAS.\n  This stands in contrast to the submodular case, where efficient computation\nof approximately optimal contracts was shown by Dutting et. al. (2022).\n  Second, we derive an additive PTAS for the problem in the instructive special\ncase of graph-based supermodular valuations, and equal costs.\n  En-route to this result, we discover an intimate connection between the\nmulti-agent contract problem and the notorious k-densest subgraph problem.\n  We build on and combine techniques from the literature on dense subgraph\nproblems to obtain our additive PTAS.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:57:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vuong","Ramiro Deo-Campo",""],["Dughmi","Shaddin",""],["Patel","Neel",""],["Prasad","Aditya",""]]}
{"id":"2308.07474","submitter":"Yichen Xu","authors":"Yichen Xu and Martin Odersky","title":"Degrees of Separation: A Flexible Type System for Data Race Prevention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data race is a notorious problem in parallel programming. There has been\ngreat research interest in type systems that statically prevent data races.\nDespite the progress in the safety and usability of these systems, lots of\nexisting approaches enforce strict anti-aliasing principles to prevent data\nraces. The adoption of them is often intrusive, in the sense that it\ninvalidates common programming patterns and requires paradigm shifts. We\npropose Capture Separation Calculus (System CSC), a calculus based on Capture\nCalculus (System CC<:box), that achieves static data race freedom while being\nnon-intrusive. It allows aliasing in general to permit common programming\npatterns, but tracks aliasing and controls them when that is necessary to\nprevent data races. We study the formal properties of System CSC by\nestablishing its type safety and data race freedom. Notably, we establish the\ndata race freedom property by proving the confluence of its reduction\nsemantics. To validate the usability of the calculus, we implement it as an\nextension to the Scala 3 compiler, and use it to type-check the examples.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:00:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xu","Yichen",""],["Odersky","Martin",""]]}
{"id":"2308.07475","submitter":"Todd Oliynyk","authors":"Florian Beyer and Todd A. Oliynyk","title":"Past stability of FLRW solutions to the Einstein-Euler-scalar field\n  equations and their big bang singularites","comments":"arXiv admin note: substantial text overlap with arXiv:2112.07730","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish, in spacetime dimensions $n\\geq 3$, the nonlinear stability in\nthe contracting direction of Friedmann-Lema\\^itre-Robertson-Walker (FLRW)\nsolutions to the Einstein-Euler-scalar field equations with linear equations of\nstate $P=c_s^2 \\rho$ for sounds speeds $c_s$ satisfying $1/(n-1)<c_s^2 < 1$. We\nfurther show that nonlinear perturbations of the FLRW solutions are\nasymptotically pointwise Kasner and terminate in crushing, asymptotically\nvelocity term dominated (AVTD) big bang singularities characterised by\ncurvature blow-up.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:01:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Beyer","Florian",""],["Oliynyk","Todd A.",""]]}
{"id":"2308.07476","submitter":"David Harris","authors":"David G. Harris","title":"Dependent rounding with strong negative-correlation, and scheduling on\n  unrelated machines to minimize completion time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe a new dependent-rounding algorithmic framework for bipartite\ngraphs. Given a fractional assignment $y$ of values to edges of graph $G = (U\n\\cup V, E)$, the algorithms return an integral solution $Y$ such that each\nright-node $v \\in V$ has at most one neighboring edge $f$ with $Y_f = 1$, and\nwhere the variables $Y_e$ also satisfy broad nonpositive-correlation\nproperties. In particular, for any edges $e_1, e_2$ sharing a left-node $u \\in\nU$, the variables $Y_{e_1}, Y_{e_2}$ have strong negative-correlation\nproperties, i.e. the expectation of $Y_{e_1} Y_{e_2}$ is significantly below\n$y_{e_1} y_{e_2}$.\n  This algorithm is a refinement of a dependent-rounding algorithm of Im \\&\nShadloo (2020) based on simulation of Poisson processes. Our algorithm allows\ngreater flexibility, in particular, it allows ``irregular'' fractional\nassignments, and it gives more refined bounds on the negative correlation.\n  Dependent rounding schemes with negative correlation properties have been\nused for approximation algorithms for job-scheduling on unrelated machines to\nminimize weighted completion times (Bansal, Srinivasan, & Svensson (2021), Im &\nShadloo (2020), Im & Li (2023)). Using our new dependent-rounding algorithm,\namong other improvements, we obtain a $1.407$-approximation for this problem.\nThis significantly improves over the prior $1.45$-approximation ratio of Im &\nLi (2023).\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:08:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Harris","David G.",""]]}
{"id":"2308.07477","submitter":"Anton Baumann","authors":"Anton Baumann, Thomas Ro{\\ss}berg, Michael Schmitt","title":"Probabilistic MIMO U-Net: Efficient and Accurate Uncertainty Estimation\n  for Pixel-wise Regression","comments":"8 pages (references do not count), Accepted at UnCV (Workshop on\n  Uncertainty Quantification for Computer Vision at ICCV)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Uncertainty estimation in machine learning is paramount for enhancing the\nreliability and interpretability of predictive models, especially in\nhigh-stakes real-world scenarios. Despite the availability of numerous methods,\nthey often pose a trade-off between the quality of uncertainty estimation and\ncomputational efficiency. Addressing this challenge, we present an adaptation\nof the Multiple-Input Multiple-Output (MIMO) framework -- an approach\nexploiting the overparameterization of deep neural networks -- for pixel-wise\nregression tasks. Our MIMO variant expands the applicability of the approach\nfrom simple image classification to broader computer vision domains. For that\npurpose, we adapted the U-Net architecture to train multiple subnetworks within\na single model, harnessing the overparameterization in deep neural networks.\nAdditionally, we introduce a novel procedure for synchronizing subnetwork\nperformance within the MIMO framework. Our comprehensive evaluations of the\nresulting MIMO U-Net on two orthogonal datasets demonstrate comparable accuracy\nto existing models, superior calibration on in-distribution data, robust\nout-of-distribution detection capabilities, and considerable improvements in\nparameter size and inference time. Code available at\ngithub.com/antonbaumann/MIMO-Unet\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:08:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Baumann","Anton",""],["Ro\u00dfberg","Thomas",""],["Schmitt","Michael",""]]}
{"id":"2308.07478","submitter":"Gil de Oliveira-Neto","authors":"G. Oliveira-Neto, A. Oliveira Castro Junior and G. A. Monerat","title":"Tunneling probability for the birth of an universe with radiation in\n  Horava-Lifshitz theory","comments":"The paper has 20 pages and 9 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, we study the birth of a homogeneous and isotropic\nFriedmann Lemaitre Robertson Walker (FLRW) cosmological model, considering\nHorava Lifshitz (HL) as the gravitational theory. The matter content of the\nmodel is a radiation perfect fluid. In order to study the birth of the universe\nin the present model, we consider the quantum cosmology mechanism of creation\nfrom nothing. In that mechanism, the universe appears after the wavefunction\nassociated to that universe tunnels through a potential barrier. We started\nstudying the classical model. We draw the phase portrait of the model and\nidentify qualitatively all types of dynamical behaviors associated to it. Then,\nwe write the Hamiltonian of the model and apply the Dirac quantization\nprocedure to quantize a constrained theory. We find the appropriate\nWheeler-DeWitt equation and solve it using the Wentzel Kramers Brillouin (WKB)\napproximation. Using the WKB solution, to the Wheeler DeWitt equation, we\ncompute the tunneling probabilities for the birth of that universe (TPWKB).\nSince the WKB wavefunction depends on the radiation energy (E) and the free\nparameters coming from the HL theory (gc, gr, gs, gLambda), we compute the\nbehavior of TPWKB as a function of E and all the HL parameters gc, gr, gs,\ngLambda.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:10:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Oliveira-Neto","G.",""],["Junior","A. Oliveira Castro",""],["Monerat","G. A.",""]]}
{"id":"2308.07479","submitter":"Elvira Lupoian","authors":"Elvira Lupoian","title":"Computing the Cuspidal Subgroup of the Modular Jacobian $J_{H}\\left( p\n  \\right)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a fixed prime $p$ congruent to $1$ modulo $4$ we may define the modular\ncurve $X_{H}\\left( p \\right)$ associated to the subgroup of non-zero squares\nmodulo $p$. This curve has four cusps and we consider the subgroup of the\nJacobian $J_{H}\\left( p \\right)$ of $X_{H}\\left( p \\right)$ generated by these\npoints, which we will call the cuspidal subgroup of $J_{H}\\left( p \\right)$.\nThis is a finite subgroup by the results of Manin and Drinfeld, and lies inside\nthe $\\mathbb{Q} \\left( \\sqrt{ p} \\right)$-rational torsion subgroup. In this\npaper we compute the cuspidal subgroup for all such curves of genus $g$, $2\n\\leq g \\leq 10$, namely those with $p \\in \\{ 29, 37, 41, 53, 61, 73 \\}$, and\ncompare this with $J_{H}\\left( \\mathbb{Q} \\left( \\sqrt{p} \\right)\n\\right)_{\\text{tors}}$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:11:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lupoian","Elvira",""]]}
{"id":"2308.07480","submitter":"Vahid Balazadeh","authors":"Hamidreza Kamkari, Vahid Zehtab, Vahid Balazadeh, Rahul G. Krishnan","title":"OCDaf: Ordered Causal Discovery with Autoregressive Flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose OCDaf, a novel order-based method for learning causal graphs from\nobservational data. We establish the identifiability of causal graphs within\nmultivariate heteroscedastic noise models, a generalization of additive noise\nmodels that allow for non-constant noise variances. Drawing upon the structural\nsimilarities between these models and affine autoregressive normalizing flows,\nwe introduce a continuous search algorithm to find causal structures. Our\nexperiments demonstrate state-of-the-art performance across the Sachs and\nSynTReN benchmarks in Structural Hamming Distance (SHD) and Structural\nIntervention Distance (SID). Furthermore, we validate our identifiability\ntheory across various parametric and nonparametric synthetic datasets and\nshowcase superior performance compared to existing baselines.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:17:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kamkari","Hamidreza",""],["Zehtab","Vahid",""],["Balazadeh","Vahid",""],["Krishnan","Rahul G.",""]]}
{"id":"2308.07481","submitter":"Massimiliano Vasile","authors":"Massimiliano Vasile, Lewis Walker, Andrew Campbell, Simao Marto, Paul\n  Murray, Stephen Marshall, and Vasili Savitski","title":"Space Object Identification and Classification from Hyperspectral\n  Material Analysis","comments":"30 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM cs.CV eess.IV physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents a data processing pipeline designed to extract\ninformation from the hyperspectral signature of unknown space objects. The\nmethodology proposed in this paper determines the material composition of space\nobjects from single pixel images. Two techniques are used for material\nidentification and classification: one based on machine learning and the other\nbased on a least square match with a library of known spectra. From this\ninformation, a supervised machine learning algorithm is used to classify the\nobject into one of several categories based on the detection of materials on\nthe object. The behaviour of the material classification methods is\ninvestigated under non-ideal circumstances, to determine the effect of\nweathered materials, and the behaviour when the training library is missing a\nmaterial that is present in the object being observed. Finally the paper will\npresent some preliminary results on the identification and classification of\nspace objects.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:21:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vasile","Massimiliano",""],["Walker","Lewis",""],["Campbell","Andrew",""],["Marto","Simao",""],["Murray","Paul",""],["Marshall","Stephen",""],["Savitski","Vasili",""]]}
{"id":"2308.07482","submitter":"Ge He","authors":"Ge He, Leander Peis, Emma Frances Cuddy, Zhen Zhao, Dong Li, Ramona\n  Stumberger, Brian Moritz, Haitao Yang, Hong-Jun Gao, Thomas Peter Devereaux,\n  Rudi Hackl","title":"Anharmonic Strong-Coupling Effects at the Origin of the Charge Density\n  Wave in CsV$_3$Sb$_5$","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The formation of charge density waves (CDW) is a long-standing open problem\nparticularly in dimensions higher than one. Various observations in the\nvanadium antimonides discovered recently, such as the missing Kohn anomaly in\nthe acoustic phonons or the latent heat at the transition $T_{\\rm CDW}$ = 95 K\n, further underpin this notion. Here, we study the Kagome metal CsV$_3$Sb$_5$\nusing polarized inelastic light scattering. The electronic energy gap $2\\Delta$\nas derived from the redistribution of the continuum is much larger than\nexpected from mean-field theory and reaches values above 20 for $2\\Delta/k_{\\rm\nB}T_{\\rm CDW}$. The A$_{1g}$ phonon has a discontinuity at $T_{\\rm CDW}$ and a\nprecursor starting 20 K above $T_{\\rm CDW}$. Density functional theory\nqualitatively reproduces the redistribution of the electronic continuum at the\nCDW transition and the phonon energies of the pristine and distorted\nstructures. The linewidths of all A$_{1g}$ and E$_{2g}$ phonon lines including\nthose emerging below $T_{\\rm CDW}$ were analyzed in terms of anharmonic\nsymmetric decay revealing strong phonon-phonon coupling. In addition, we\nobserve two CDW amplitude modes (AMs): one in A$_{1g}$ symmetry and one in\nE$_{2g}$ symmetry. The temperature dependence of both modes deviates from the\nprediction of mean-field theory. The A$_{1g}$ AM displays an asymmetric\nFano-type lineshape, suggestive of strong electron-phonon coupling. The\nasymmetric A$_{1g}$ AM, along with the discontinuity of the A$_{1g}$ phonon,\nthe large phonon-phonon coupling parameters and the large gap ratio, indicate\nthe importance of anharmonic strong phonon-phonon and electron-phonon coupling\nfor the CDW formation in CsV$_3$Sb$_5$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:23:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["He","Ge",""],["Peis","Leander",""],["Cuddy","Emma Frances",""],["Zhao","Zhen",""],["Li","Dong",""],["Stumberger","Ramona",""],["Moritz","Brian",""],["Yang","Haitao",""],["Gao","Hong-Jun",""],["Devereaux","Thomas Peter",""],["Hackl","Rudi",""]]}
{"id":"2308.07483","submitter":"Vesselin G. Gueorguiev","authors":"Vesselin G. Gueorguiev and Andre Maeder","title":"The Scale Invariant Vacuum Paradigm: Main Results plus the Current BBNS\n  Progress","comments":"10 pages, 3 figures, 2 tables; Comments and constructive suggestions\n  are highly welcome. Presentation slides are available at ResearchGate.net via\n  the link www.researchgate.net/publication/362388677; Contribution to the\n  Relativity Theory conference at the Bauman Moscow State Technical University,\n  Moscow, 4 July, 2023 (PIRT-2023 https://pirt.bmstu.ru/en/home-en/);. arXiv\n  admin note: substantial text overlap with arXiv:2202.08412","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We summarize the main results within the Scale Invariant Vacuum (SIV)\nparadigm as related to the Weyl Integrable Geometry (WIG) as an extension to\nthe standard Einstein General Relativity (EGR). After a short sketch of the\nmathematical framework, the main results until 2023 [1] are highlighted in\nrelation to: the inflation within the SIV [2], the growth of the density\nfluctuations [3], the application of the SIV to scale-invariant dynamics of\ngalaxies, MOND, dark matter, and the dwarf spheroidals [4],and the most recent\nresults on the BBNS light-elements' abundances within the SIV [5]. Keywords:\ncosmology: theory, dark matter, dark energy, inflation, BBNS; galaxies:\nformation, rotation; Weyl integrable geometry; Dirac co-calculus.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:30:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gueorguiev","Vesselin G.",""],["Maeder","Andre",""]]}
{"id":"2308.07484","submitter":"Shadan Ghassemi Tabrizi","authors":"Shadan Ghassemi Tabrizi","title":"Systematic determination of coupling constants in spin clusters from\n  broken-symmetry mean-field solutions","comments":"37 pages, 11 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum-chemical calculations aimed at deriving magnetic coupling constants\nin exchange-coupled spin clusters commonly utilize a broken-symmetry (BS)\napproach. This involves calculating several distinct collinear spin\nconfigurations, predominantly by density-functional theory (DFT). The energies\nof these configurations are interpreted in terms of the Heisenberg model to\ndetermine coupling constants for spin pairs. However, this energy-based\nprocedure has inherent limitations, primarily in its inability to provide\ninformation on isotropic spin interactions beyond those included in the\nHeisenberg model. Biquadratic exchange or multi-center terms, for example, are\nusually inaccessible and hence assumed to be negligible. The present work\nintroduces a novel approach employing BS mean-field solutions, specifically\nHartree-Fock wave functions, for the construction of effective spin\nHamiltonians. This expanded method facilitates the extraction of a broader\nrange of coupling parameters by considering not only the energies, but also\nHamiltonian and overlap elements between different BS states. We demonstrate\nhow comprehensive s = 1/2 Hamiltonians, including multi-center terms, can be\nstraightforwardly constructed from a complete set of BS solutions. The approach\nis exemplified for small clusters within the context of the half-filled\nsingle-band Hubbard model. This allows to contrast the current strategy against\nexact results, thereby offering an enriched understanding of the\nspin-Hamiltonian construction from BS solutions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:33:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tabrizi","Shadan Ghassemi",""]]}
{"id":"2308.07485","submitter":"Gustavo Moreira Sim\\~oes","authors":"David R. Junior, Luis E. Oxman, Gustavo M. Sim\\~oes","title":"Prospecting effective Yang-Mills-Higgs models for the asymptotic\n  confining flux tube","comments":"24 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we analyze a large class of effective Yang-Mills-Higgs models\nconstructed in terms of adjoint scalars. In particular, we reproduce asymptotic\nproperties of the confining string, suggested by lattice simulations of $SU(N)$\npure Yang-Mills theory, in models that are stable in the whole range of\nHiggs-field mass parameters. These properties include $N$-ality, Abelian-like\nflux-tube profiles, independence of the profiles with the $N$-ality of the\nquark representation, and Casimir scaling. We find that although these models\nare formulated in terms of many fields and possible Higgs potentials, a\ncollective behavior can be established in a large region of parameter space,\nwhere the desired asymptotic behavior is realized.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:34:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Junior","David R.",""],["Oxman","Luis E.",""],["Sim\u00f5es","Gustavo M.",""]]}
{"id":"2308.07486","submitter":"Murali Karthick Baskar","authors":"Murali Karthick Baskar, Andrew Rosenberg, Bhuvana Ramabhadran, Kartik\n  Audhkhasi","title":"O-1: Self-training with Oracle and 1-best Hypothesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce O-1, a new self-training objective to reduce training bias and\nunify training and evaluation metrics for speech recognition. O-1 is a faster\nvariant of Expected Minimum Bayes Risk (EMBR), that boosts the oracle\nhypothesis and can accommodate both supervised and unsupervised data. We\ndemonstrate the effectiveness of our approach in terms of recognition on\npublicly available SpeechStew datasets and a large-scale, in-house data set. On\nSpeechstew, the O-1 objective closes the gap between the actual and oracle\nperformance by 80\\% relative compared to EMBR which bridges the gap by 43\\%\nrelative. O-1 achieves 13\\% to 25\\% relative improvement over EMBR on the\nvarious datasets that SpeechStew comprises of, and a 12\\% relative gap\nreduction with respect to the oracle WER over EMBR training on the in-house\ndataset. Overall, O-1 results in a 9\\% relative improvement in WER over EMBR,\nthereby speaking to the scalability of the proposed objective for large-scale\ndatasets.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:36:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Baskar","Murali Karthick",""],["Rosenberg","Andrew",""],["Ramabhadran","Bhuvana",""],["Audhkhasi","Kartik",""]]}
{"id":"2308.07487","submitter":"Hongwei Chen","authors":"Hongwei Chen, Shiyang Chen, Joshua J. Turner, Adrian Feiguin","title":"Kernel Fusion in Atomistic Spin Dynamics Simulations on Nvidia GPUs\n  using Tensor Core","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":"  In atomistic spin dynamics simulations, the time cost of constructing the\nspace- and time-displaced pair correlation function in real space increases\nquadratically as the number of spins $N$, leading to significant computational\neffort. The GEMM subroutine can be adopted to accelerate the calculation of the\ndynamical spin-spin correlation function, but the computational cost of\nsimulating large spin systems ($>40000$ spins) on CPUs remains expensive. In\nthis work, we perform the simulation on the graphics processing unit (GPU), a\nhardware solution widely used as an accelerator for scientific computing and\ndeep learning. We show that GPUs can accelerate the simulation up to 25-fold\ncompared to multi-core CPUs when using the GEMM subroutine on both. To hide\nmemory latency, we fuse the element-wise operation into the GEMM kernel using\n$\\mathtt{CUTLASS}$ that can improve the performance by 26% $\\sim$ 33% compared\nto implementation based on $\\mathtt{cuBLAS}$. Furthermore, we perform the\non-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving\nintermediate results on global memory, which makes the large-scale atomistic\nspin dynamics simulation feasible and affordable.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:37:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Hongwei",""],["Chen","Shiyang",""],["Turner","Joshua J.",""],["Feiguin","Adrian",""]]}
{"id":"2308.07488","submitter":"Xiaoyu Liu Ms","authors":"Xiaoyu Liu, Chong Wang, Xiao-Wei Zhang, Ting Cao and Di Xiao","title":"Gate-tunable antiferromagnetic Chern insulator in twisted bilayer\n  transition metal dichalcogenides","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":"  A series of recent experimental works on twisted MoTe$_2$ homobilayers have\nunveiled an abundance of exotic states in this system. Valley-polarized quantum\nanomalous Hall states have been identified at hole doping of $\\nu = -1$, and\nthe fractional quantum anomalous Hall effect is observed at $\\nu = -2/3$ and\n$\\nu = -3/5$. In this work, we investigate the electronic properties of\nAA-stacked twisted bilayer MoTe$_2$ at $\\nu=-2$ by $k$-space Hartree-Fock\ncalculations. We find that the phase diagram is qualitatively similar to the\nphase diagram of a Kane-Mele-Hubbard with staggered onsite potential. A\nnoteworthy phase within the diagram is the antiferromagnetic Chern insulator,\nstabilized by the external electric field. We attribute the existence of this\nChern insulator to an antiferromagnetic instability at a topological phase\ntransition between the quantum spin hall phase and a band insulator phase. We\nhighlight that the antiferromagnetic Chern insulator phase is most evident at a\ntwist angle of approximately $4^\\circ$. Our research proposes the potential of\nrealizing a Chern insulator beyond $\\nu=-1$, and contributes fresh perspectives\non the interplay between band topology and electron-electron correlations in\nmoir\\'e superlattices.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:38:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Xiaoyu",""],["Wang","Chong",""],["Zhang","Xiao-Wei",""],["Cao","Ting",""],["Xiao","Di",""]]}
{"id":"2308.07489","submitter":"Matt Post","authors":"Matt Post and Thamme Gowda and Roman Grundkiewicz and Huda Khayrallah\n  and Rohit Jain and Marcin Junczys-Dowmunt","title":"SOTASTREAM: A Streaming Approach to Machine Translation Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many machine translation toolkits make use of a data preparation step wherein\nraw data is transformed into a tensor format that can be used directly by the\ntrainer. This preparation step is increasingly at odds with modern research and\ndevelopment practices because this process produces a static, unchangeable\nversion of the training data, making common training-time needs difficult\n(e.g., subword sampling), time-consuming (preprocessing with large data can\ntake days), expensive (e.g., disk space), and cumbersome (managing experiment\ncombinatorics). We propose an alternative approach that separates the\ngeneration of data from the consumption of that data. In this approach, there\nis no separate pre-processing step; data generation produces an infinite stream\nof permutations of the raw training data, which the trainer tensorizes and\nbatches as it is consumed. Additionally, this data stream can be manipulated by\na set of user-definable operators that provide on-the-fly modifications, such\nas data normalization, augmentation or filtering. We release an open-source\ntoolkit, SOTASTREAM, that implements this approach:\nhttps://github.com/marian-nmt/sotastream. We show that it cuts training time,\nadds flexibility, reduces experiment management complexity, and reduces disk\nspace, all without affecting the accuracy of the trained models.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:47:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Post","Matt",""],["Gowda","Thamme",""],["Grundkiewicz","Roman",""],["Khayrallah","Huda",""],["Jain","Rohit",""],["Junczys-Dowmunt","Marcin",""]]}
{"id":"2308.07490","submitter":"Michihiro Kuroki","authors":"Michihiro Kuroki, Toshihiko Yamasaki","title":"BSED: Baseline Shapley-Based Explainable Detector","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Explainable artificial intelligence (XAI) has witnessed significant advances\nin the field of object recognition, with saliency maps being used to highlight\nimage features relevant to the predictions of learned models. Although these\nadvances have made AI-based technology more interpretable to humans, several\nissues have come to light. Some approaches present explanations irrelevant to\npredictions, and cannot guarantee the validity of XAI (axioms). In this study,\nwe propose the Baseline Shapley-based Explainable Detector (BSED), which\nextends the Shapley value to object detection, thereby enhancing the validity\nof interpretation. The Shapley value can attribute the prediction of a learned\nmodel to a baseline feature while satisfying the explainability axioms. The\nprocessing cost for the BSED is within the reasonable range, while the original\nShapley value is prohibitively computationally expensive. Furthermore, BSED is\na generalizable method that can be applied to various detectors in a\nmodel-agnostic manner, and interpret various detection targets without\nfine-grained parameter tuning. These strengths can enable the practical\napplicability of XAI. We present quantitative and qualitative comparisons with\nexisting methods to demonstrate the superior performance of our method in terms\nof explanation validity. Moreover, we present some applications, such as\ncorrecting detection based on explanations from our method.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:47:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kuroki","Michihiro",""],["Yamasaki","Toshihiko",""]]}
{"id":"2308.07491","submitter":"Yoonsang Lee","authors":"Taesoo Kwon, Taehong Gu, Jaewon Ahn, Yoonsang Lee","title":"Adaptive Tracking of a Single-Rigid-Body Character in Various\n  Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the introduction of DeepMimic [Peng et al. 2018], subsequent research\nhas focused on expanding the repertoire of simulated motions across various\nscenarios. In this study, we propose an alternative approach for this goal, a\ndeep reinforcement learning method based on the simulation of a\nsingle-rigid-body character. Using the centroidal dynamics model (CDM) to\nexpress the full-body character as a single rigid body (SRB) and training a\npolicy to track a reference motion, we can obtain a policy that is capable of\nadapting to various unobserved environmental changes and controller transitions\nwithout requiring any additional learning. Due to the reduced dimension of\nstate and action space, the learning process is sample-efficient. The final\nfull-body motion is kinematically generated in a physically plausible way,\nbased on the state of the simulated SRB character. The SRB simulation is\nformulated as a quadratic programming (QP) problem, and the policy outputs an\naction that allows the SRB character to follow the reference motion. We\ndemonstrate that our policy, efficiently trained within 30 minutes on an\nultraportable laptop, has the ability to cope with environments that have not\nbeen experienced during learning, such as running on uneven terrain or pushing\na box, and transitions between learned policies, without any additional\nlearning.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 22:58:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kwon","Taesoo",""],["Gu","Taehong",""],["Ahn","Jaewon",""],["Lee","Yoonsang",""]]}
{"id":"2308.07492","submitter":"Shengze Duan","authors":"Shengze Duan","title":"generalized Radon transforms on fractal measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the setting of a general Borel measure $\\mu$ on $R^d$ with the natural\nball size condition $$\\mu[B(x,r)]\\leq Cr^s,$$ we establish the\n$L^p(\\mu)$-$L^q(\\mu)$-estimate for the generalized Radon transform\n$$(Af)(x):=\\int_{\\Phi(x,y)=0}(f\\mu)(y)\\psi(x,y)d\\sigma_x(y),$$ where $\\Phi$ is\na smooth function away from the diagonal.\n  Among other reasonable assumptions, an $L^2$-Sobolev bound on $A$ on $R^d$ is\nimposed. This bound is satisfied in many natural situations. The main result\nis, in general, sharp up to endpoints.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:03:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Duan","Shengze",""]]}
{"id":"2308.07493","submitter":"Gilberto Tavares-Velasco","authors":"A. Bola\\~nos-Carrera, M. Guiot-Lomel\\'i, G. Tavares-Velasco","title":"Neutrino charge radius and electromagnetic dipole moments via scalar and\n  vector leptoquarks","comments":"31 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The one-loop contribution of scalar and vector leptoquarks (LQs) to the\nelectromagnetic properties (NEPs) of massive Dirac neutrinos is presented via\nan effective Lagrangian approach, with emphasis on the effective neutrino\ncharge radius (NCR), which has never been calculated and is obtained by the\nbackground field formalism in a Yang-Mills-like scenario for gauge LQs.\nAnalytical results for nonzero neutrino mass are presented in terms of both\nFeynman-parameter integrals and Passarino-Veltman scalar functions, which can\nbe useful to obtain the NEPs of heavy neutrinos, out of which approximate\nexpressions are obtained for light neutrinos. For the numerical analysis we\nconcentrate on the only renormalizable scalar and vector LQ representations\nthat do not need extra symmetries to forbid tree-level proton decay.\nConstraints on the parameter space consistent with current experimental data\nare then discussed and it is found that the LQ representations\n$\\widetilde{R}_2$ and $U_1$ could yield the largest contributions to the NEPs\nprovided that they have couplings to both left- and right-handed neutrinos of\nthe order of $O(1)$. For a LQ mass of $1.5$ TeV, the magnetic dipole moment\n(MDM) of the tau neutrino can be of the order of $10^{-9}$ $\\mu_B$, whereas its\nneutrino electric dipole moment (EDM) can reach values as high as\n$10^{-20}$-$10^{-19}$ ecm. On the other hand, the NCR can reach values up to\n$10^{-35}$ cm$^2$ regardless of the neutrino flavor and even in the absence of\nright-handed neutrinos. In the latter scenario, the EDM vanishes and the\ncontribution to neutrino MDM would be negligible, of the order of $10^{-14}$\n$\\mu_B$ for the tau neutrino, whereas those for the muon and electron neutrinos\nwould be about two and seven orders of magnitude smaller, respectively. Our\nestimates could be severely suppressed due to a possible suppression of the LQ\ncoupling constants.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:04:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bola\u00f1os-Carrera","A.",""],["Guiot-Lomel\u00ed","M.",""],["Tavares-Velasco","G.",""]]}
{"id":"2308.07494","submitter":"Manuel Ignacio Castillo L\\'opez","authors":"Manuel Ignacio Castillo L\\'opez, Ana Libia Eslava Cervantes and\n  Gustavo de la Cruz Mart\\'inez","title":"Applying User Experience and User-Centered Design Software Processes in\n  Undergraduate Mobile Application Development Teaching","comments":"13 pages, 5 figures, conference","journal-ref":"International Journal on Cybernetics & Informatics, vol. 12, no.\n  5, october 2023, pp. 93-105","doi":"10.5121/ijci.2023.120510","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Agile methods in undergraduate courses have been explored by various authors\nlooking to close the gap between industry and professional profiles. We have\nstructured an Android application development course based on a tailored agile\nprocess for development of educational software tools. This process is based on\nboth Scrum and Extreme Programming in combination with User Experience (UX) and\nUser-Centered Design (UCD) approaches. The course is executed in two phases:\nthe first half of the course's semester presents theory on agile and mobile\napplications development, the latter half is managed as a workshop where\nstudents develop for an actual client. The introduction of UX and UCD\nexploiting the close relationship with stakeholders expected from an agile\nprocess can enhance Quality in Use features. Since 2019 two of the projects\nhave been extended in agreement between the client and students. Students,\nclients and users have found value in the generated products.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:20:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["L\u00f3pez","Manuel Ignacio Castillo",""],["Cervantes","Ana Libia Eslava",""],["Mart\u00ednez","Gustavo de la Cruz",""]]}
{"id":"2308.07495","submitter":"Yanming Sun","authors":"Yanming Sun and Chunyan Wang","title":"Brain Tumor Detection Based on a Novel and High-Quality Prediction of\n  the Tumor Pixel Distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a system to detect brain tumor in 3D MRI brain\nscans of Flair modality. It performs 2 functions: (a) predicting gray-level and\nlocational distributions of the pixels in the tumor regions and (b) generating\ntumor mask in pixel-wise precision. To facilitate 3D data analysis and\nprocessing, we introduced a 2D histogram presentation that comprehends the\ngray-level distribution and pixel-location distribution of a 3D object. In the\nproposed system, particular 2D histograms, in which tumor-related feature data\nget concentrated, are established by exploiting the left-right asymmetry of a\nbrain structure. A modulation function is generated from the input data of each\npatient case and applied to the 2D histograms to attenuate the element\nirrelevant to the tumor regions. The prediction of the tumor pixel distribution\nis done in 3 steps, on the axial, coronal and sagittal slice series,\nrespectively. In each step, the prediction result helps to identify/remove\ntumor-free slices, increasing the tumor information density in the remaining\ndata to be applied to the next step. After the 3-step removal, the 3D input is\nreduced to a minimum bounding box of the tumor region. It is used to finalize\nthe prediction and then transformed into a 3D tumor mask, by means of gray\nlevel thresholding and low-pass-based morphological operations. The final\nprediction result is used to determine the critical threshold. The proposed\nsystem has been tested extensively with the data of more than one thousand\npatient cases in the datasets of BraTS 2018~21. The test results demonstrate\nthat the predicted 2D histograms have a high degree of similarity with the true\nones. The system delivers also very good tumor detection results, comparable to\nthose of state-of-the-art CNN systems with mono-modality inputs, which is\nachieved at an extremely low computation cost and no need for training.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:28:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sun","Yanming",""],["Wang","Chunyan",""]]}
{"id":"2308.07496","submitter":"Yuqi Nie","authors":"Zepu Wang, Yuqi Nie, Peng Sun, Nam H. Nguyen, John Mulvey, H. Vincent\n  Poor","title":"ST-MLP: A Cascaded Spatio-Temporal Linear Framework with\n  Channel-Independence Strategy for Traffic Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The criticality of prompt and precise traffic forecasting in optimizing\ntraffic flow management in Intelligent Transportation Systems (ITS) has drawn\nsubstantial scholarly focus. Spatio-Temporal Graph Neural Networks (STGNNs)\nhave been lauded for their adaptability to road graph structures. Yet, current\nresearch on STGNNs architectures often prioritizes complex designs, leading to\nelevated computational burdens with only minor enhancements in accuracy. To\naddress this issue, we propose ST-MLP, a concise spatio-temporal model solely\nbased on cascaded Multi-Layer Perceptron (MLP) modules and linear layers.\nSpecifically, we incorporate temporal information, spatial information and\npredefined graph structure with a successful implementation of the\nchannel-independence strategy - an effective technique in time series\nforecasting. Empirical results demonstrate that ST-MLP outperforms\nstate-of-the-art STGNNs and other models in terms of accuracy and computational\nefficiency. Our finding encourages further exploration of more concise and\neffective neural network architectures in the field of traffic forecasting.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:34:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zepu",""],["Nie","Yuqi",""],["Sun","Peng",""],["Nguyen","Nam H.",""],["Mulvey","John",""],["Poor","H. Vincent",""]]}
{"id":"2308.07497","submitter":"Fouad Et-Tahri","authors":"Fouad Et-tahri, Jon Asier Barcena-Petisco, Idriss Boutaayamou and\n  Lahcen Maniar","title":"On uniform null-controllability of tangential transport-diffusion\n  equations with vanishing viscosity limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper aims to address an interesting open problem posed in the paper\n''Singular Optimal Control for a Transport-Diffusion Equation'' of Sergio\nGuerrero and Gilles Lebeau in 2007. The problem involves studying the\nnull-controllability cost of a transport-diffusion equation with Neumann\nconditions. Our objective is twofold. Firstly, we investigate the scenario\nwhere each trajectory of the tangential velocity enters the control region in a\nshorter time at a fixed entry time. By employing Agmon inequalities and\nCarleman estimates, we establish that the control cost remains bounded for\nsufficiently small diffusivity and large control time. Secondly, we explore the\ncase where at least one trajectory fails to enter the control region. In this\nscenario, we prove that the control cost explodes exponentially when the\ndiffusivity approaches zero and the control time is sufficiently small.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:36:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Et-tahri","Fouad",""],["Barcena-Petisco","Jon Asier",""],["Boutaayamou","Idriss",""],["Maniar","Lahcen",""]]}
{"id":"2308.07498","submitter":"Wenguan Wang","authors":"Hanqing Wang, Wei Liang, Luc Van Gool, Wenguan Wang","title":"DREAMWALKER: Mental Planning for Continuous Vision-Language Navigation","comments":"Accepted at ICCV 2023; Project page:\n  https://github.com/hanqingwangai/Dreamwalker","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  VLN-CE is a recently released embodied task, where AI agents need to navigate\na freely traversable environment to reach a distant target location, given\nlanguage instructions. It poses great challenges due to the huge space of\npossible strategies. Driven by the belief that the ability to anticipate the\nconsequences of future actions is crucial for the emergence of intelligent and\ninterpretable planning behavior, we propose DREAMWALKER -- a world model based\nVLN-CE agent. The world model is built to summarize the visual, topological,\nand dynamic properties of the complicated continuous environment into a\ndiscrete, structured, and compact representation. DREAMWALKER can simulate and\nevaluate possible plans entirely in such internal abstract world, before\nexecuting costly actions. As opposed to existing model-free VLN-CE agents\nsimply making greedy decisions in the real world, which easily results in\nshortsighted behaviors, DREAMWALKER is able to make strategic planning through\nlarge amounts of ``mental experiments.'' Moreover, the imagined future\nscenarios reflect our agent's intention, making its decision-making process\nmore transparent. Extensive experiments and ablation studies on VLN-CE dataset\nconfirm the effectiveness of the proposed approach and outline fruitful\ndirections for future work.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:45:01 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Hanqing",""],["Liang","Wei",""],["Van Gool","Luc",""],["Wang","Wenguan",""]]}
{"id":"2308.07499","submitter":"Christ Bartneck","authors":"Benjamin Lebrun, Sharon Temtsin, Andrew Vonasch, Christoph Bartneck","title":"Detecting The Corruption Of Online Questionnaires By Artificial\n  Intelligence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Online questionnaires that use crowd-sourcing platforms to recruit\nparticipants have become commonplace, due to their ease of use and low costs.\nArtificial Intelligence (AI) based Large Language Models (LLM) have made it\neasy for bad actors to automatically fill in online forms, including generating\nmeaningful text for open-ended tasks. These technological advances threaten the\ndata quality for studies that use online questionnaires. This study tested if\ntext generated by an AI for the purpose of an online study can be detected by\nboth humans and automatic AI detection systems. While humans were able to\ncorrectly identify authorship of text above chance level (76 percent accuracy),\ntheir performance was still below what would be required to ensure satisfactory\ndata quality. Researchers currently have to rely on the disinterest of bad\nactors to successfully use open-ended responses as a useful tool for ensuring\ndata quality. Automatic AI detection systems are currently completely unusable.\nIf AIs become too prevalent in submitting responses then the costs associated\nwith detecting fraudulent submissions will outweigh the benefits of online\nquestionnaires. Individual attention checks will no longer be a sufficient tool\nto ensure good data quality. This problem can only be systematically addressed\nby crowd-sourcing platforms. They cannot rely on automatic AI detection systems\nand it is unclear how they can ensure data quality for their paying clients.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:47:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lebrun","Benjamin",""],["Temtsin","Sharon",""],["Vonasch","Andrew",""],["Bartneck","Christoph",""]]}
{"id":"2308.07500","submitter":"Jos\\'e Matias","authors":"G. Carvalho, J. Matias, E. Zappale","title":"Asymptotic analysis of a clamped thin multidomain allowing for fractures\n  and discontinuities","comments":"32 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a thin multidomain of $\\mathbb R^3,$ consisting of a vertical rod\nupon a horizontal disk. The equilibrium configurations of the thin hyperelastic\nmultidomain, allowing for fracture and damage, are described by means of a bulk\nenergy density of the kind $W(\\nabla U)$, where $W$ is a Borel function with\nlinear growth and $\\nabla U$ denotes the gradient of the displacement, i.e. a\nvector valued function $U:\\Omega \\to \\mathbb R^3$. By assuming that the two\nvolumes tend to zero, under suitable boundary conditions and loads, and\nsuitable assumptions of the rate of convergence of the two volumes, we prove\nthat the limit model is well posed in the union of the limit domains, with\ndimensions, respectively, $1$ and $2$.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:49:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Carvalho","G.",""],["Matias","J.",""],["Zappale","E.",""]]}
{"id":"2308.07501","submitter":"Vishal Chakraborty","authors":"Vishal Chakraborty and Stacy Ann-Elvy and Sharad Mehrotra and Faisal\n  Nawab and Mohammad Sadoghi and Shantanu Sharma and Nalini Venkatsubhramanian\n  and Farhan Saeed","title":"Data-CASE: Grounding Data Regulations for Compliant Data Processing\n  Systems","comments":"To appear in EDBT '24","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Data regulations, such as GDPR, are increasingly being adopted globally to\nprotect against unsafe data management practices. Such regulations are, often\nambiguous (with multiple valid interpretations) when it comes to defining the\nexpected dynamic behavior of data processing systems. This paper argues that it\nis possible to represent regulations such as GDPR formally as invariants using\na (small set of) data processing concepts that capture system behavior. When\nsuch concepts are grounded, i.e., they are provided with a single unambiguous\ninterpretation, systems can achieve compliance by demonstrating that the\nsystem-actions they implement maintain the invariants (representing the\nregulations). To illustrate our vision, we propose Data-CASE, a simple yet\npowerful model that (a) captures key data processing concepts (b) a set of\ninvariants that describe regulations in terms of these concepts. We further\nillustrate the concept of grounding using \"deletion\" as an example and\nhighlight several ways in which end-users, companies, and software\ndesigners/engineers can use Data-CASE.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:50:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chakraborty","Vishal",""],["Ann-Elvy","Stacy",""],["Mehrotra","Sharad",""],["Nawab","Faisal",""],["Sadoghi","Mohammad",""],["Sharma","Shantanu",""],["Venkatsubhramanian","Nalini",""],["Saeed","Farhan",""]]}
{"id":"2308.07502","submitter":"Varun Viswanath","authors":"Yinan Xuan, Varun Viswanath, Sunny Chu, Owen Bartolf, Jessica\n  Echterhoff, and Edward Wang","title":"SpecTracle: Wearable Facial Motion Tracking from Unobtrusive Peripheral\n  Cameras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Facial motion tracking in head-mounted displays (HMD) has the potential to\nenable immersive \"face-to-face\" interaction in a virtual environment. However,\ncurrent works on facial tracking are not suitable for unobtrusive augmented\nreality (AR) glasses or do not have the ability to track arbitrary facial\nmovements. In this work, we demonstrate a novel system called SpecTracle that\ntracks a user's facial motions using two wide-angle cameras mounted right next\nto the visor of a Hololens. Avoiding the usage of cameras extended in front of\nthe face, our system greatly improves the feasibility to integrate full-face\ntracking into a low-profile form factor. We also demonstrate that a neural\nnetwork-based model processing the wide-angle cameras can run in real-time at\n24 frames per second (fps) on a mobile GPU and track independent facial\nmovement for different parts of the face with a user-independent model. Using a\nshort personalized calibration, the system improves its tracking performance by\n42.3% compared to the user-independent model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:52:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xuan","Yinan",""],["Viswanath","Varun",""],["Chu","Sunny",""],["Bartolf","Owen",""],["Echterhoff","Jessica",""],["Wang","Edward",""]]}
{"id":"2308.07503","submitter":"Alfonso Ballon Bayona","authors":"Alfonso Ballon-Bayona, Tobias Frederico, Luis A. H. Mamani and Wayne\n  de Paula","title":"A dynamical holographic QCD model for spontaneous chiral symmetry\n  breaking and confinement","comments":"36 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a holographic realization of spontaneous chiral\nsymmetry breaking and confinement. The latter is realized by building a\nsolution of 5d Einstein-dilaton gravity leading to a confining quark antiquark\npotential. The 4d currents and the quark mass operator associated with chiral\nsymmetry breaking and creation of meson states are mapped to 5d fields whose\ndynamics is given by a non-Abelian Higgs action. We introduce a non-minimal\ndilaton coupling to the tachyon potential which has two parameters, one of them\ncontrolling the presence or absence of spontaneous chiral symmetry breaking and\nthe other controlling the sign of the chiral condensate as the quark mass\ngrows. We calculate the masses of vector, scalar, axial-vector and pseudoscalar\nmesons, focusing on the effect of chiral symmetry breaking on the spectrum. In\nthe chiral limit we identify the emergence of a massless state in the\npseudoscalar meson spectrum, i.e., the pion. We calculate all meson decay\nconstants and confirm that the pion satisfies the Gell-Mann-Oakes relation in\nthe light quark regime.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 23:59:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ballon-Bayona","Alfonso",""],["Frederico","Tobias",""],["Mamani","Luis A. H.",""],["de Paula","Wayne",""]]}
{"id":"2308.07504","submitter":"Jifeng Shen","authors":"Jifeng Shen, Yifei Chen, Yue Liu, Xin Zuo, Heng Fan, Wankou Yang","title":"ICAFusion: Iterative Cross-Attention Guided Feature Fusion for\n  Multispectral Object Detection","comments":"submitted to Pattern Recognition Journal, minor revision","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Effective feature fusion of multispectral images plays a crucial role in\nmulti-spectral object detection. Previous studies have demonstrated the\neffectiveness of feature fusion using convolutional neural networks, but these\nmethods are sensitive to image misalignment due to the inherent deffciency in\nlocal-range feature interaction resulting in the performance degradation. To\naddress this issue, a novel feature fusion framework of dual cross-attention\ntransformers is proposed to model global feature interaction and capture\ncomplementary information across modalities simultaneously. This framework\nenhances the discriminability of object features through the query-guided\ncross-attention mechanism, leading to improved performance. However, stacking\nmultiple transformer blocks for feature enhancement incurs a large number of\nparameters and high spatial complexity. To handle this, inspired by the human\nprocess of reviewing knowledge, an iterative interaction mechanism is proposed\nto share parameters among block-wise multimodal transformers, reducing model\ncomplexity and computation cost. The proposed method is general and effective\nto be integrated into different detection frameworks and used with different\nbackbones. Experimental results on KAIST, FLIR, and VEDAI datasets show that\nthe proposed method achieves superior performance and faster inference, making\nit suitable for various practical scenarios. Code will be available at\nhttps://github.com/chanchanchan97/ICAFusion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:02:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shen","Jifeng",""],["Chen","Yifei",""],["Liu","Yue",""],["Zuo","Xin",""],["Fan","Heng",""],["Yang","Wankou",""]]}
{"id":"2308.07505","submitter":"Le Chen","authors":"Le Chen, Xianzhong Ding, Murali Emani, Tristan Vanderbruggen, Pei-hung\n  Lin, Chuanhua Liao","title":"Data Race Detection Using Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) are demonstrating significant promise as an\nalternate strategy to facilitate analyses and optimizations of high-performance\ncomputing programs, circumventing the need for resource-intensive manual tool\ncreation. In this paper, we explore a novel LLM-based data race detection\napproach combining prompting engineering and fine-tuning techniques. We create\na dedicated dataset named DRB-ML, which is derived from DataRaceBench, with\nfine-grain labels showing the presence of data race pairs and their associated\nvariables, line numbers, and read/write information. DRB-ML is then used to\nevaluate representative LLMs and fine-tune open-source ones. Our experiment\nshows that LLMs can be a viable approach to data race detection. However, they\nstill cannot compete with traditional data race detection tools when we need\ndetailed information about variable pairs causing data races.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:08:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Le",""],["Ding","Xianzhong",""],["Emani","Murali",""],["Vanderbruggen","Tristan",""],["Lin","Pei-hung",""],["Liao","Chuanhua",""]]}
{"id":"2308.07506","submitter":"Jadie Adams","authors":"Jadie Adams and Shireen Y. Elhabian","title":"Benchmarking Scalable Epistemic Uncertainty Quantification in Organ\n  Segmentation","comments":"Accepted to the UNSURE Workshop held in conjunction with 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":"  Deep learning based methods for automatic organ segmentation have shown\npromise in aiding diagnosis and treatment planning. However, quantifying and\nunderstanding the uncertainty associated with model predictions is crucial in\ncritical clinical applications. While many techniques have been proposed for\nepistemic or model-based uncertainty estimation, it is unclear which method is\npreferred in the medical image analysis setting. This paper presents a\ncomprehensive benchmarking study that evaluates epistemic uncertainty\nquantification methods in organ segmentation in terms of accuracy, uncertainty\ncalibration, and scalability. We provide a comprehensive discussion of the\nstrengths, weaknesses, and out-of-distribution detection capabilities of each\nmethod as well as recommendations for future improvements. These findings\ncontribute to the development of reliable and robust models that yield accurate\nsegmentations while effectively quantifying epistemic uncertainty.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:09:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Adams","Jadie",""],["Elhabian","Shireen Y.",""]]}
{"id":"2308.07507","submitter":"Melvin Drent","authors":"Collin Drent, Melvin Drent, and Joachim Arts","title":"Condition-Based Production for Stochastically Deteriorating Systems:\n  Optimal Policies and Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Production systems deteriorate stochastically due to usage and may eventually\nbreak down, resulting in high maintenance costs at scheduled maintenance\nmoments. This deterioration behavior is affected by the system's production\nrate. While producing at a higher rate generates more revenue, the system may\nalso deteriorate faster. Production should thus be controlled dynamically to\ntrade-off deterioration and revenue accumulation in between maintenance\nmoments. We study systems for which the relation between production and\ndeterioration is known and the same for each system as well as systems for\nwhich this relation differs from system to system and needs to be learned\non-the-fly. The decision problem is to find the optimal production policy given\nplanned maintenance moments (operational) and the optimal interval length\nbetween such maintenance moments (tactical). For systems with a known\nproduction-deterioration relation, we cast the operational decision problem as\na continuous-time Markov decision process and prove that the optimal policy has\nintuitive monotonic properties. We also present sufficient conditions for the\noptimality of bang-bang policies and we partially characterize the structure of\nthe optimal interval length, thereby enabling efficient joint optimization of\nthe operational and tactical decision problem. For systems that exhibit\nvariability in their production-deterioration relations, we propose a Bayesian\nprocedure to learn the unknown deterioration rate under any production policy.\nOur extensive numerical study indicates significant profit increases of our\napproaches compared to the state-of-the-art.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:20:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Drent","Collin",""],["Drent","Melvin",""],["Arts","Joachim",""]]}
{"id":"2308.07508","submitter":"Jonathan Gorard","authors":"Jonathan Gorard","title":"Computational General Relativity in the Wolfram Language using Gravitas\n  I: Symbolic and Analytic Computation","comments":"86 pages, 74 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc cs.SC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new, open-source computational general relativity framework\nfor the Wolfram Language called Gravitas, which boasts a number of novel and\ndistinctive features as compared to the many pre-existing computational and\nnumerical relativity frameworks currently available within the open-source\ncommunity. These include, but are not limited to: seamless integration of its\npowerful symbolic and numerical subsystems, and, by extension, seamless\ntransition between analytic/continuous representations and numerical/discrete\nrepresentations of arbitrary spacetime geometries; highly modular, general and\nextensible representations of spacetime geometries, spacetime topologies, gauge\nconditions, coordinate systems, matter fields, evolution equations and initial\ndata; ability to set up and run complex numerical relativity simulations, and\nto perform 2D and 3D visualizations, symbolic computations and numerical\nanalysis (including the extraction of gravitational wave signals) on the\nresulting data, all from within a single notebook environment; and a\ntotally-unstructured adaptive refinement scheme based on hypergraph rewriting,\nallowing for exceedingly efficient discretization and numerical evolution of\nCauchy initial data for a wide range of challenging computational problems\ninvolving strong relativistic field dynamics. In this first in a series of two\narticles covering the framework, we focus on the design and capabilities of\nGravitas's symbolic subsystem, including its general and flexible handling of\narbitrary geometries parametrized by arbitrary curvilinear coordinate systems\n(along with an in-built library of standard metrics and coordinate conditions),\nas well as its various high-level tensor calculus and differential geometry\nfeatures. We proceed to show how this subsystem can be used to solve the\nEinstein field equations both analytically and numerically.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:24:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gorard","Jonathan",""]]}
{"id":"2308.07509","submitter":"Khanh-Binh Nguyen","authors":"Khanh-Binh Nguyen, Joon-Sung Yang","title":"Boosting Semi-Supervised Learning by bridging high and low-confidence\n  predictions","comments":"Accepted to ICCVW2023 (Workshop on representation learning with very\n  limited images: the potential of self-, synthetic- and formula-supervision)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Pseudo-labeling is a crucial technique in semi-supervised learning (SSL),\nwhere artificial labels are generated for unlabeled data by a trained model,\nallowing for the simultaneous training of labeled and unlabeled data in a\nsupervised setting. However, several studies have identified three main issues\nwith pseudo-labeling-based approaches. Firstly, these methods heavily rely on\npredictions from the trained model, which may not always be accurate, leading\nto a confirmation bias problem. Secondly, the trained model may be overfitted\nto easy-to-learn examples, ignoring hard-to-learn ones, resulting in the\n\\textit{\"Matthew effect\"} where the already strong become stronger and the weak\nweaker. Thirdly, most of the low-confidence predictions of unlabeled data are\ndiscarded due to the use of a high threshold, leading to an underutilization of\nunlabeled data during training. To address these issues, we propose a new\nmethod called ReFixMatch, which aims to utilize all of the unlabeled data\nduring training, thus improving the generalizability of the model and\nperformance on SSL benchmarks. Notably, ReFixMatch achieves 41.05\\% top-1\naccuracy with 100k labeled examples on ImageNet, outperforming the baseline\nFixMatch and current state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:27:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nguyen","Khanh-Binh",""],["Yang","Joon-Sung",""]]}
{"id":"2308.07510","submitter":"Miguel Moreno","authors":"Miguel Moreno","title":"Shelah's Main Gap and the generalized Borel-reducibility","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We answer one of the main questions in generalized descriptive set theory,\nFriedman-Hyttinen-Kulikov conjecture on the Borel-reducibility of the Main Gap.\nWe show a correlation between Shelah's Main Gap and generalized\nBorel-reducibility notions of complexity. For any $\\kappa$ satisfying\n$\\kappa=\\lambda^+=2^\\lambda$ and\n$2^{\\mathfrak{c}}\\leq\\lambda=\\lambda^{\\omega_1}$, we show that if $T$ is a\nclassifiable theory and $T'$ not, then the isomorphism of models of $T'$ is\nstrictly above the isomorphism of models of $T$ with respect to\nBorel-reducibility. We also show that the following can be forced: for any\ncountable first-order theory in a countable vocabulary, $T$, the isomorphism of\nmodels of $T$ is either $\\Delta^1_1$ or analytically-complete.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:28:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Moreno","Miguel",""]]}
{"id":"2308.07511","submitter":"Xiucheng Wang","authors":"Longfei Ma, Nan Cheng, Xiucheng Wang, Zhisheng Yin, Haibo Zhou, Wei\n  Quan","title":"Distilling Knowledge from Resource Management Algorithms to Neural\n  Networks: A Unified Training Assistance Approach","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":"  As a fundamental problem, numerous methods are dedicated to the optimization\nof signal-to-interference-plus-noise ratio (SINR), in a multi-user setting.\nAlthough traditional model-based optimization methods achieve strong\nperformance, the high complexity raises the research of neural network (NN)\nbased approaches to trade-off the performance and complexity. To fully leverage\nthe high performance of traditional model-based methods and the low complexity\nof the NN-based method, a knowledge distillation (KD) based algorithm\ndistillation (AD) method is proposed in this paper to improve the performance\nand convergence speed of the NN-based method, where traditional SINR\noptimization methods are employed as ``teachers\" to assist the training of NNs,\nwhich are ``students\", thus enhancing the performance of unsupervised and\nreinforcement learning techniques. This approach aims to alleviate common\nissues encountered in each of these training paradigms, including the\ninfeasibility of obtaining optimal solutions as labels and overfitting in\nsupervised learning, ensuring higher convergence performance in unsupervised\nlearning, and improving training efficiency in reinforcement learning.\nSimulation results demonstrate the enhanced performance of the proposed\nAD-based methods compared to traditional learning methods. Remarkably, this\nresearch paves the way for the integration of traditional optimization insights\nand emerging NN techniques in wireless communication system optimization.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:30:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ma","Longfei",""],["Cheng","Nan",""],["Wang","Xiucheng",""],["Yin","Zhisheng",""],["Zhou","Haibo",""],["Quan","Wei",""]]}
{"id":"2308.07512","submitter":"Ans Qureshi","authors":"Ans Qureshi, David Smith, Trevor Gee, Mahla Nejati, Jalil Shahabi,\n  JongYoon Lim, Ho Seok Ahn, Ben McGuinness, Catherine Downes, Rahul Jangali,\n  Kale Black, Hin Lim, Mike Duke, Bruce MacDonald, Henry Williams","title":"Seeing the Fruit for the Leaves: Robotically Mapping Apple Fruitlets in\n  a Commercial Orchard","comments":"Accepted at the International Conference on Intelligent Robots and\n  Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Aotearoa New Zealand has a strong and growing apple industry but struggles to\naccess workers to complete skilled, seasonal tasks such as thinning. To ensure\neffective thinning and make informed decisions on a per-tree basis, it is\ncrucial to accurately measure the crop load of individual apple trees. However,\nthis task poses challenges due to the dense foliage that hides the fruitlets\nwithin the tree structure. In this paper, we introduce the vision system of an\nautomated apple fruitlet thinning robot, developed to tackle the labor shortage\nissue. This paper presents the initial design, implementation,and evaluation\nspecifics of the system. The platform straddles the 3.4 m tall 2D apple canopy\nstructures to create an accurate map of the fruitlets on each tree. We show\nthat this platform can measure the fruitlet load on an apple tree by scanning\nthrough both sides of the branch. The requirement of an overarching platform\nwas justified since two-sided scans had a higher counting accuracy of 81.17 %\nthan one-sided scans at 73.7 %. The system was also demonstrated to produce\nsize estimates within 5.9% RMSE of their true size.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:33:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Qureshi","Ans",""],["Smith","David",""],["Gee","Trevor",""],["Nejati","Mahla",""],["Shahabi","Jalil",""],["Lim","JongYoon",""],["Ahn","Ho Seok",""],["McGuinness","Ben",""],["Downes","Catherine",""],["Jangali","Rahul",""],["Black","Kale",""],["Lim","Hin",""],["Duke","Mike",""],["MacDonald","Bruce",""],["Williams","Henry",""]]}
{"id":"2308.07513","submitter":"Rafael Fuentes","authors":"J. R. Fuentes, Bradley W. Hindman, Junwei Zhao, Catherine C. Blume,\n  Maria E. Camisassa, Nicholas A. Featherstone, Thomas Hartlep, Lydia Korre,\n  Loren I. Matilsky","title":"Systematic Bias in Helioseismic Measurements of Meridional Circulation\n  Arising from Nonlocal Averaging Kernels","comments":"Submitted to AAS Journals","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Meridional circulation in the solar convection zone plays a profound role in\nregulating the interior dynamics of the Sun and its magnetism. While it is well\naccepted that meridional flows move from the equator towards the poles at the\nSun's surface, helioseismic observations have yet to provide a definitive\nanswer for the depth at which those flows return to the equator, or the number\nof circulation cells in depth. In this work, we investigate whether the\ndiscrepancies regarding the nature of the return flow are intrinsic to how\nhelioseismic observations are made. We examine the seismic signature of\npossible meridional flow profiles by convolving time-distance averaging kernels\nwith the mean flows obtained from 3-D hydrodynamic simulations of the solar\nconvection zone. At mid and high latitudes, we find that weak flow structures\nin the deeper regions of the convection zone can be strongly obscured by signal\nfrom the much stronger surface flows. This contamination is the result of\nextended side lobes in the averaging kernels and generates a spurious\nequatorward signal of 2--3 m s$^{-1}$ at those latitudes, and at $\\approx\n70~\\mathrm{Mm}$ depth. At low latitudes, however, the flows in the simulations\ntend to be stronger and multiple cells across the shell depth can produce a\nsufficiently strong seismic signal to survive the convolution process. The\nsignal associated with the deep equatorward return flow in the Sun is expected\nto be weak and in the same sense as the contamination from the surface. Hence,\nthe return flow needs to exceed $\\sim 2$--$3~ \\mathrm{m~s^{-1}}$ in magnitude\nfor reported detections to be considered significant.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:47:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fuentes","J. R.",""],["Hindman","Bradley W.",""],["Zhao","Junwei",""],["Blume","Catherine C.",""],["Camisassa","Maria E.",""],["Featherstone","Nicholas A.",""],["Hartlep","Thomas",""],["Korre","Lydia",""],["Matilsky","Loren I.",""]]}
{"id":"2308.07514","submitter":"Alejandro Soto-Gonz\\'alez","authors":"S. M. Grudsky, E. A. Maximenko, A. Soto-Gonz\\'alez","title":"Eigenvalues of laplacian matrices of the cycles with one\n  negative-weighted edge","comments":"28 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the individual behavior of the eigenvalues of the laplacian matrices\nof the cyclic graph of order $n$, where one edge has weight\n$\\alpha\\in\\mathbb{C}$, with $\\operatorname{Re}(\\alpha)<0$, and all the others\nhave weights $1$. This paper is a sequel of a previous one where we considered\n$\\operatorname{Re}(\\alpha) \\in[0,1]$ (Eigenvalues of laplacian matrices of the\ncycles with one weighted edge, Linear Algebra Appl. 653, 2022, 86--115). We\nprove that for $\\operatorname{Re}(\\alpha)<0$ and\n$n>\\operatorname{Re}(\\alpha-1)/\\operatorname{Re}(\\alpha)$, one eigenvalue is\nnegative while the others belong to $[0,4]$ and are distributed as the function\n$x\\mapsto 4\\sin^2(x/2)$. Additionally, we prove that as $n$ tends to $\\infty$,\nthe outlier eigenvalue converges exponentially to\n$4\\operatorname{Re}(\\alpha)^2/(2\\operatorname{Re}(\\alpha)-1)$. We give exact\nformulas for the half of the inner eigenvalues, while for the others we justify\nthe convergence of Newton's method and fixed-point iteration method. We find\nasymptotic expansions, as $n$ tends to $\\infty$, both for the eigenvalues\nbelonging to $[0,4]$ and the outlier. We also compute the eigenvectors and\ntheir norms.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:54:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Grudsky","S. M.",""],["Maximenko","E. A.",""],["Soto-Gonz\u00e1lez","A.",""]]}
{"id":"2308.07515","submitter":"Shuang Li","authors":"Shuang Li, Xichao Zhang, Motohiko Ezawa, Yan Zhou","title":"Universal quantum computing based on magnetic domain wall qubits","comments":"Submitted on August 7th","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computers allow to solve efficiently certain problems that are\nintractable for classical computers. For the realization of a quantum computer,\na qubit design as the basic building block is a nontrivial starting point. We\npropose the utilization of nanoscale magnetic domain walls, which are\nstabilized by achiral energy, as the building blocks for a universal quantum\ncomputer made of ferromagnetic racetracks. In contrast to the domain walls\nstabilized by conventional Dzyaloshinskii-Moriya interactions, these achiral\ndomain walls are bistable and show two degenerate chirality forms. When the\ndomain wall is extremely small, it can be viewed as a quantum mechanical object\nand the two degenerate chiralities of the domain walls can be used to encode\nthe qubit states $\\lvert 0 \\rangle$ and $\\lvert 1 \\rangle$. We show that the\nsingle-qubit quantum gates are regulated by magnetic and electric fields, while\nthe Ising exchange coupling facilitates the two-qubit gates. The integration of\nthese quantum gates allows for a universal quantum computation. Our findings\ndemonstrate a promising approach for achieving quantum computing through spin\ntextures that exist in ferromagnetic materials.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 00:59:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Shuang",""],["Zhang","Xichao",""],["Ezawa","Motohiko",""],["Zhou","Yan",""]]}
{"id":"2308.07516","submitter":"Ryan Johnson","authors":"Ryan S. Johnson, Stefano Di Cairano, Ricardo G. Sanfelice","title":"Robust Parameter Estimation for Hybrid Dynamical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of estimating a vector of unknown constant parameters\nfor a class of hybrid dynamical systems -- that is, systems whose state\nvariables exhibit both continuous (flow) and discrete (jump) evolution. Using a\nhybrid systems framework, we propose a hybrid estimation algorithm that can\noperate during both flows and jumps that, under a notion of hybrid persistence\nof excitation, guarantees convergence of the parameter estimate to the true\nvalue. Furthermore, we show that the parameter estimate is input-to-state\nstable with respect to a class of hybrid disturbances. Simulation results\nincluding a spacecraft application show the merits of our proposed approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:07:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Johnson","Ryan S.",""],["Di Cairano","Stefano",""],["Sanfelice","Ricardo G.",""]]}
{"id":"2308.07517","submitter":"Hyeonsu Kang","authors":"Hyeonsu B. Kang, Sherry Tongshuang Wu, Joseph Chee Chang, Aniket\n  Kittur","title":"Synergi: A Mixed-Initiative System for Scholarly Synthesis and\n  Sensemaking","comments":"ACM UIST'23","journal-ref":null,"doi":"10.1145/3586183.3606759","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficiently reviewing scholarly literature and synthesizing prior art are\ncrucial for scientific progress. Yet, the growing scale of publications and the\nburden of knowledge make synthesis of research threads more challenging than\never. While significant research has been devoted to helping scholars interact\nwith individual papers, building research threads scattered across multiple\npapers remains a challenge. Most top-down synthesis (and LLMs) make it\ndifficult to personalize and iterate on the output, while bottom-up synthesis\nis costly in time and effort. Here, we explore a new design space of\nmixed-initiative workflows. In doing so we develop a novel computational\npipeline, Synergi, that ties together user input of relevant seed threads with\ncitation graphs and LLMs, to expand and structure them, respectively. Synergi\nallows scholars to start with an entire threads-and-subthreads structure\ngenerated from papers relevant to their interests, and to iterate and customize\non it as they wish. In our evaluation, we find that Synergi helps scholars\nefficiently make sense of relevant threads, broaden their perspectives, and\nincreases their curiosity. We discuss future design implications for\nthread-based, mixed-initiative scholarly synthesis support tools.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:09:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kang","Hyeonsu B.",""],["Wu","Sherry Tongshuang",""],["Chang","Joseph Chee",""],["Kittur","Aniket",""]]}
{"id":"2308.07518","submitter":"Massimiliano Vasile","authors":"Massimiliano Vasile and Matteo Manzi","title":"Polynomial Stochastic Dynamical Indicators","comments":"42 pages, 20 figures","journal-ref":"Celestial Mechanics and Dynamical Astronomy 2023","doi":"10.1007/s10569-022-10116-1","report-no":null,"categories":"math-ph cs.CE math.MP math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper introduces three types of dynamical indicators that capture the\neffect of uncertainty on the time evolution of dynamical systems. Two\nindicators are derived from the definition of Finite Time Lyapunov Exponents\nwhile a third indicator directly exploits the property of the polynomial\nexpansion of the dynamics with respect to the uncertain quantities. The paper\npresents the derivation of the indicators and a number of numerical experiments\nthat illustrates the use of these indicators to depict a cartography of the\nphase space under parametric uncertainty and to identify robust initial\nconditions and regions of practical stability in the restricted three-body\nproblem.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:12:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vasile","Massimiliano",""],["Manzi","Matteo",""]]}
{"id":"2308.07519","submitter":"Michael Park","authors":"Pyung Nahm (Joe), Raviv Murciano-Goroff, Michael Park, Russell J. Funk","title":"Serendipity in Science","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Serendipity plays an important role in scientific discovery. Indeed, many of\nthe most important breakthroughs, ranging from penicillin to the electric\nbattery, have been made by scientists who were stimulated by a chance exposure\nto unsought but useful information. However, not all scientists are equally\nlikely to benefit from such serendipitous exposure. Although scholars generally\nagree that scientists with a prepared mind are most likely to benefit from\nserendipitous encounters, there is much less consensus over what precisely\nconstitutes a prepared mind, with some research suggesting the importance of\nopenness and others emphasizing the need for deep prior experience in a\nparticular domain. In this paper, we empirically investigate the role of\nserendipity in science by leveraging a policy change that exogenously shifted\nthe shelving location of journals in university libraries and subsequently\nexposed scientists to unsought scientific information. Using large-scale data\non 2.4 million papers published in 9,750 journals by 520,000 scientists at 115\nNorth American research universities, we find that scientists with greater\nopenness are more likely to benefit from serendipitous encounters. Following\nthe policy change, these scientists tended to cite less familiar and newer\nwork, and ultimately published papers that were more innovative. By contrast,\nwe find little effect on innovativeness for scientists with greater depth of\nexperience, who, in our sample, tended to cite more familiar and older work\nfollowing the policy change.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:22:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nahm","Pyung","","Joe"],["Murciano-Goroff","Raviv",""],["Park","Michael",""],["Funk","Russell J.",""]]}
{"id":"2308.07520","submitter":"Shuyan Wang","authors":"Shuyan Wang","title":"Nonlinearity, Feedback and Uniform Consistency in Causal Structural\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of Causal Discovery is to find automated search methods for learning\ncausal structures from observational data. In some cases all variables of the\ninterested causal mechanism are measured, and the task is to predict the\neffects one measured variable has on another. In contrast, sometimes the\nvariables of primary interest are not directly observable but instead inferred\nfrom their manifestations in the data. These are referred to as latent\nvariables. One commonly known example is the psychological construct of\nintelligence, which cannot directly measured so researchers try to assess\nthrough various indicators such as IQ tests. In this case, casual discovery\nalgorithms can uncover underlying patterns and structures to reveal the causal\nconnections between the latent variables and between the latent and observed\nvariables. This thesis focuses on two questions in causal discovery: providing\nan alternative definition of k-Triangle Faithfulness that (i) is weaker than\nstrong faithfulness when applied to the Gaussian family of distributions, (ii)\ncan be applied to non-Gaussian families of distributions, and (iii) under the\nassumption that the modified version of Strong Faithfulness holds, can be used\nto show the uniform consistency of a modified causal discovery algorithm;\nrelaxing the sufficiency assumption to learn causal structures with latent\nvariables. Given the importance of inferring cause-and-effect relationships for\nunderstanding and forecasting complex systems, the work in this thesis of\nrelaxing various simplification assumptions is expected to extend the causal\ndiscovery method to be applicable in a wider range with diversified causal\nmechanism and statistical phenomena.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:23:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Shuyan",""]]}
{"id":"2308.07521","submitter":"Aashwin Mishra","authors":"Aashwin Mishra, Nicholas Brennan, Tianyu Huang, Jason Jaquith, Hasan\n  Yavas, Matthew Seaberg","title":"Machine Learning Based Alignment For LCLS-II-HE Optics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hard X-ray instruments at the Linac Coherent Light Source are in the\ndesign phase for upgrades that will take full advantage of the high repetition\nrates that will become available with LCLS-II-HE. The current X-ray Correlation\nSpectroscopy instrument will be converted to the Dynamic X-ray Scattering\ninstrument, and will feature a meV-scale high-resolution monochromator at its\nfront end with unprecedented coherent flux. With the new capability come many\nengineering and design challenges, not least of which is the sensitivity to\nlong-term drift of the optics. With this in mind, we have estimated the system\ntolerance to angular drift and vibration for all the relevant optics ($\\sim$10\ncomponents) in terms of how the central energy out of the monochromator will be\naffected to inform the mechanical design. Additionally, we have started\nplanning for methods to correct for such drifts using available (both invasive\nand non-invasive) X-ray beam diagnostics. In simulations, we have demonstrated\nthe ability of trained Machine Learning models to correct misalignments to\nmaintain the desired central energy and optical axis within the necessary\ntolerances. Additionally, we exhibit the use of Bayesian Optimization to\nminimize the impact of thermal deformations of crystals as well as beam\nalignment from scratch. The initial results are very promising and efforts to\nfurther extend this work are ongoing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:23:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mishra","Aashwin",""],["Brennan","Nicholas",""],["Huang","Tianyu",""],["Jaquith","Jason",""],["Yavas","Hasan",""],["Seaberg","Matthew",""]]}
{"id":"2308.07522","submitter":"Victor Zitian Chen","authors":"Victor Zitian Chen","title":"Finding Stakeholder-Material Information from 10-K Reports using\n  Fine-Tuned BERT and LSTM Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  All public companies are required by federal securities law to disclose their\nbusiness and financial activities in their annual 10-K reports. Each report\ntypically spans hundreds of pages, making it difficult for human readers to\nidentify and extract the material information efficiently. To solve the\nproblem, I have fine-tuned BERT models and RNN models with LSTM layers to\nidentify stakeholder-material information, defined as statements that carry\ninformation about a company's influence on its stakeholders, including\ncustomers, employees, investors, and the community and natural environment. The\nexisting practice uses keyword search to identify such information, which is my\nbaseline model. Using business expert-labeled training data of nearly 6,000\nsentences from 62 10-K reports published in 2022, the best model has achieved\nan accuracy of 0.904 and an F1 score of 0.899 in test data, significantly above\nthe baseline model's 0.781 and 0.749 respectively. Furthermore, the same work\nwas replicated on more granular taxonomies, based on which four distinct groups\nof stakeholders (i.e., customers, investors, employees, and the community and\nnatural environment) are tested separately. Similarly, fined-tuned BERT models\noutperformed LSTM and the baseline. The implications for industry application\nand ideas for future extensions are discussed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:25:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Victor Zitian",""]]}
{"id":"2308.07523","submitter":"Syed Bahauddin Alam","authors":"Kazuma Kobayashi, Syed Bahauddin Alam","title":"Potential of Deep Operator Networks in Digital Twin-enabling Technology\n  for Nuclear System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research introduces the Deep Operator Network (DeepONet) as a robust\nsurrogate modeling method within the context of digital twin (DT) systems for\nnuclear engineering. With the increasing importance of nuclear energy as a\ncarbon-neutral solution, adopting DT technology has become crucial to enhancing\noperational efficiencies, safety, and predictive capabilities in nuclear\nengineering applications. DeepONet exhibits remarkable prediction accuracy,\noutperforming traditional ML methods. Through extensive benchmarking and\nevaluation, this study showcases the scalability and computational efficiency\nof DeepONet in solving a challenging particle transport problem. By taking\nfunctions as input data and constructing the operator $G$ from training data,\nDeepONet can handle diverse and complex scenarios effectively. However, the\napplication of DeepONet also reveals challenges related to optimal sensor\nplacement and model evaluation, critical aspects of real-world implementation.\nAddressing these challenges will further enhance the method's practicality and\nreliability. Overall, DeepONet presents a promising and transformative tool for\nnuclear engineering research and applications. Its accurate prediction and\ncomputational efficiency capabilities can revolutionize DT systems, advancing\nnuclear engineering research. This study marks an important step towards\nharnessing the power of surrogate modeling techniques in critical engineering\ndomains.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:25:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kobayashi","Kazuma",""],["Alam","Syed Bahauddin",""]]}
{"id":"2308.07524","submitter":"Bataa Lkhagvasuren","authors":"Hong Sung Jin, Minkyu Kwak and Bataa Lkhagvasuren","title":"A new stability result for the 2D Boussinesq equations with horizontal\n  dissipation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  For $\\mathbb{R}^2$, the stability of smooth solutions of 2D anisotropic\nBoussinesq equations with horizontal dissipation is an open problem. In this\nwork, we present a partial answer to this problem in a rougher function space\n$H^{0,s}(\\mathbb{R}^2)$. Moreover, the previous stability results with the\nregularity index $\\frac 12<s<1$ is extended to an integer $1\\le s$ and the\nelementary techniques are used.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:27:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jin","Hong Sung",""],["Kwak","Minkyu",""],["Lkhagvasuren","Bataa",""]]}
{"id":"2308.07525","submitter":"Andrei Broder","authors":"Andrei Z. Broder and Preston McAfee","title":"Delphic Costs and Benefits in Web Search: A utilitarian and historical\n  analysis","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new framework to conceptualize and operationalize the total user\nexperience of search, by studying the entirety of a search journey from an\nutilitarian point of view.\n  Web search engines are widely perceived as \"free\". But search requires time\nand effort: in reality there are many intermingled non-monetary costs (e.g.\ntime costs, cognitive costs, interactivity costs) and the benefits may be\nmarred by various impairments, such as misunderstanding and misinformation.\nThis characterization of costs and benefits appears to be inherent to the human\nsearch for information within the pursuit of some larger task: most of the\ncosts and impairments can be identified in interactions with any web search\nengine, interactions with public libraries, and even in interactions with\nancient oracles. To emphasize this innate connection, we call these costs and\nbenefits Delphic, in contrast to explicitly financial costs and benefits.\n  Our main thesis is that the users' satisfaction with a search engine mostly\ndepends on their experience of Delphic cost and benefits, in other words on\ntheir utility. The consumer utility is correlated with classic measures of\nsearch engine quality, such as ranking, precision, recall, etc., but is not\ncompletely determined by them. To argue our thesis, we catalog the Delphic\ncosts and benefits and show how the development of search engines over the last\nquarter century, from classic Information Retrieval roots to the integration of\nLarge Language Models, was driven to a great extent by the quest of decreasing\nDelphic costs and increasing Delphic benefits.\n  We hope that the Delphic costs framework will engender new ideas and new\nresearch for evaluating and improving the web experience for everyone.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:39:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Broder","Andrei Z.",""],["McAfee","Preston",""]]}
{"id":"2308.07526","submitter":"Mohammad Ali Sayed","authors":"Mohammad Ali Sayed, Mohsen Ghafouri, Ribal Atallah, Mourad Debbabi,\n  Chadi Assi","title":"Protecting the Future Grid: An Electric Vehicle Robust Mitigation Scheme\n  Against Load Altering Attacks on Power Grids","comments":"Accepted for publication in Applied Energy","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to the growing threat of climate change, the worlds governments have been\nencouraging the adoption of Electric Vehicles (EVs). As a result, EV numbers\nhave been growing exponentially which will introduce a large EV charging load\ninto the power grid. On this basis, we present a scheme to utilize EVs as a\ndefense mechanism to mitigate Load-Altering (LA) attacks against the grid. The\ndeveloped scheme relies on robust control theory and Linear Matrix Inequalities\n(LMIs). Our EV-based defense mechanism is formulated as a feedback controller\nsynthesized using H-2 and H-infinity control techniques to eliminate the impact\nof unknown LA attacks. The controller synthesis considers the grid topology and\nthe uncertainties of the EV connection to the grid. To demonstrate the\neffectiveness of the proposed mitigation scheme, it is tested against three\ntypes of LA attacks on the New England 39-bus grid. We test our mitigation\nscheme against 800 MW static, switching, and dynamic attacks in the presence of\nmultiple sources of uncertainty that can affect the EV load during deployment.\nThe results demonstrate how the grid remains stable under the LA attacks that\nwould otherwise lead to serious instabilities.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:47:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sayed","Mohammad Ali",""],["Ghafouri","Mohsen",""],["Atallah","Ribal",""],["Debbabi","Mourad",""],["Assi","Chadi",""]]}
{"id":"2308.07527","submitter":"Sammuel Ramos","authors":"Sammuel Ramos Silva and Rodrigo Silva","title":"FeatGeNN: Improving Model Performance for Tabular Data with\n  Correlation-based Feature Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated Feature Engineering (AutoFE) has become an important task for any\nmachine learning project, as it can help improve model performance and gain\nmore information for statistical analysis. However, most current approaches for\nAutoFE rely on manual feature creation or use methods that can generate a large\nnumber of features, which can be computationally intensive and lead to\noverfitting. To address these challenges, we propose a novel convolutional\nmethod called FeatGeNN that extracts and creates new features using correlation\nas a pooling function. Unlike traditional pooling functions like max-pooling,\ncorrelation-based pooling considers the linear relationship between the\nfeatures in the data matrix, making it more suitable for tabular data. We\nevaluate our method on various benchmark datasets and demonstrate that FeatGeNN\noutperforms existing AutoFE approaches regarding model performance. Our results\nsuggest that correlation-based pooling can be a promising alternative to\nmax-pooling for AutoFE in tabular data applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:48:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Silva","Sammuel Ramos",""],["Silva","Rodrigo",""]]}
{"id":"2308.07528","submitter":"Andre Ye","authors":"Andre Ye, Quan Ze Chen, Amy Zhang","title":"Confidence Contours: Uncertainty-Aware Annotation for Medical Semantic\n  Segmentation","comments":"10 pages content, 12 pages total. Accepted to HCOMP '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Medical image segmentation modeling is a high-stakes task where understanding\nof uncertainty is crucial for addressing visual ambiguity. Prior work has\ndeveloped segmentation models utilizing probabilistic or generative mechanisms\nto infer uncertainty from labels where annotators draw a singular boundary.\nHowever, as these annotations cannot represent an individual annotator's\nuncertainty, models trained on them produce uncertainty maps that are difficult\nto interpret. We propose a novel segmentation representation, Confidence\nContours, which uses high- and low-confidence ``contours'' to capture\nuncertainty directly, and develop a novel annotation system for collecting\ncontours. We conduct an evaluation on the Lung Image Dataset Consortium (LIDC)\nand a synthetic dataset. From an annotation study with 30 participants, results\nshow that Confidence Contours provide high representative capacity without\nconsiderably higher annotator effort. We also find that general-purpose\nsegmentation models can learn Confidence Contours at the same performance level\nas standard singular annotations. Finally, from interviews with 5 medical\nexperts, we find that Confidence Contour maps are more interpretable than\nBayesian maps due to representation of structural uncertainty.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:54:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ye","Andre",""],["Chen","Quan Ze",""],["Zhang","Amy",""]]}
{"id":"2308.07529","submitter":"Chengyi Wang Mr","authors":"Chengyi Wang, Krzysztof Bolejko and Geraint F. Lewis","title":"The Redshift Difference in Gravitational Lensed Systems: A Novel Probe\n  of Cosmology","comments":"10 pages, 12 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The exploration of the redshift drift, a direct measurement of cosmological\nexpansion, is expected to take several decades of observation with stable,\nsensitive instruments. We introduced a new method to probe cosmology which\nbypasses the long-period observation by observing the redshift difference, an\naccumulation of the redshift drift, in multiple-image gravitational lens\nsystems. With this, the photons observed in each image will have traversed\nthrough different paths between the source and the observer, and so the lensed\nimages will show different redshifts when observed at the same instance. Here,\nwe consider the impact of the underlying cosmology on the observed redshift\ndifference in gravitational lens systems, generating synthetic data for\nrealistic lens models and exploring the accuracy of determined cosmological\nparameters. We show that, whilst the redshift difference is sensitive to the\ndensities of matter and dark energy within a universe, it is independent of the\nHubble constant. Finally, we determine the observational considerations for\nusing the redshift difference as a cosmological probe, finding that one\nthousand lensed sources are enough to make robust determinations of the\nunderlying cosmological parameters. Upcoming cluster lens surveys, such as the\nEuclid, are expected to detect a sufficient number of such systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:56:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Chengyi",""],["Bolejko","Krzysztof",""],["Lewis","Geraint F.",""]]}
{"id":"2308.07530","submitter":"Yukun Luo","authors":"Yukun Luo, Jie Jiang, Ruihui Wang","title":"The Sun's Magnetic Power Spectra Over Two Solar Cycles. I. Calibration\n  Between SDO/HMI And SOHO/MDI Magnetograms","comments":"Accepted for publication in the Astrophysical Journal. 15 pages, 7\n  figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Sun's magnetic field is strongly structured over a broad range of scales.\nThe magnetic spatial power spectral analysis provides a powerful tool to\nunderstand the various scales of magnetic fields and their interaction with\nplasma motion. We aim to investigate the power spectra using spherical harmonic\ndecomposition of high-resolution SOHO/MDI and SDO/HMI synoptic magnetograms\ncovering three consecutive solar cycle minima in a series of papers. As the\nfirst of the series, we calibrate and analyze the power spectra based on\nco-temporal SDO/HMI and SOHO/MDI data in this paper. For the first time, we\nfind that the calibration factor $r$ between SOHO/MDI and SDO/HMI varies with\nthe spatial scale $l$ of the magnetic field, where $l$ is the degree of a\nspherical harmonics. The calibration factor satisfies $r(l)=\\sqrt{-0.021\nl^{0.64}+2} \\quad(5<\\mathrm{l}\\leq539)$. With the calibration function, most\ncontemporaneous SOHO/MDI and SDO/HMI magnetograms show consistent power spectra\nfrom about 8 Mm to the global scales over about 3 orders of magnitudes.\nMoreover, magnetic power spectra from SOHO/MDI and SDO/HMI maps show\npeaks/knees at $l\\approx120$ corresponding to the typical supergranular scale\n(about 35 Mm) constrained from direct velocimetric measurements. This study\npaves the way for investigating the solar-cycle dependence of supergranulation\nand magnetic power spectra in subsequent studies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:59:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Luo","Yukun",""],["Jiang","Jie",""],["Wang","Ruihui",""]]}
{"id":"2308.07531","submitter":"Wenhui Chen","authors":"Wenhui Chen and Yan Liu and Mengjun Ma and Xulong Qin","title":"Asymptotic behavior of solutions for the thermoviscous acoustic systems","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 some asymptotic properties of solutions for the acoustic coupled\nsystems in thermoviscous fluids which was proposed by [Karlsen-Bruus,\n\\emph{Phys. Rev. E} (2015)]. Basing on the WKB analysis and the Fourier\nanalysis, we derive optimal estimates and large time asymptotic profiles of the\nenergy term via diagonalization procedure, and of the velocity potential via\nreduction methodology. We found that the wave effect has a dominant influence\nfor lower dimensions comparing with thermal-viscous effects. Moreover, by\nemploying suitable energy methods, we rigorously demonstrate global (in time)\ninviscid limits as the momentum diffusion coefficient vanishes, whose limit\nmodel can be regarded as the thermoelastic acoustic systems in isotropic\nsolids. These results explain some influence of the momentum diffusion on\nasymptotic behavior of solutions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:04:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Wenhui",""],["Liu","Yan",""],["Ma","Mengjun",""],["Qin","Xulong",""]]}
{"id":"2308.07532","submitter":"Malena Rice","authors":"Josette Wright, Malena Rice, Xian-Yu Wang, Kyle Hixenbaugh, Songhu\n  Wang","title":"SOLES VII: The Spin-Orbit Alignment of WASP-106 b, a Warm Jupiter Along\n  the Kraft Break","comments":"9 pages, 2 figures. Submitted to AAS journals 8/7/23","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although close-orbiting, massive exoplanets -- known as hot and warm Jupiters\n-- are among the most observationally accessible known planets, their formation\npathways are still not universally agreed upon. One method to constrain the\npossible dynamical histories of such planets is to measure the systems'\nsky-projected spin-orbit angles using the Rossiter-McLaughlin effect. By\ndemonstrating whether planets orbit around the stellar equator or on offset\norbits, Rossiter-McLaughlin observations offer clues as to whether the planet\nhad a quiescent or violent formation history. Such measurements are, however,\nonly a reliable window into the history of the system if the planet in question\norbits sufficiently far from its host star; otherwise, tidal interactions with\nthe host star can erase evidence of past dynamical upheavals. We present a\nWIYN/NEID Rossiter-McLaughlin measurement of the tidally detached warm Jupiter\nWASP-106 b, which orbits a star along the Kraft break\n($T_{\\mathrm{eff}}=6002\\pm164$ K). We find that WASP-106 b is consistent with a\nlow spin-orbit angle ($\\lambda=6^{+17}_{-16}\\,^{\\circ}$ and $\\psi =\n26^{+12}_{-17}\\,^{\\circ}$), suggesting a relatively quiescent formation history\nfor the system. We conclude by comparing the stellar obliquities of hot and\nwarm Jupiter systems, with the WASP-106 system included, to gain insight into\nthe possible formation routes of these populations of exoplanets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:16:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wright","Josette",""],["Rice","Malena",""],["Wang","Xian-Yu",""],["Hixenbaugh","Kyle",""],["Wang","Songhu",""]]}
{"id":"2308.07533","submitter":"Yubo Shuai","authors":"Yubo Shuai","title":"The site frequency spectrum for coalescing Brownian motion","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider an expanding population on the plane. The genealogy of a sample\nfrom the population is modelled by coalescing Brownian motion on the circle. We\nestablish a weak law of large numbers for the site frequency spectrum in this\nmodel. A parallel result holds for a localized version where the genealogy is\nmodelled by coalescing Brownian motion on the line.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:32:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shuai","Yubo",""]]}
{"id":"2308.07534","submitter":"Benjamin Schweinhart","authors":"Paul Duncan and Benjamin Schweinhart","title":"A Sharp Deconfinement Transition for Potts Lattice Gauge Theory in\n  Codimension Two","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.AT math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that Wilson loop expectations in $(d-2)$-dimensional $q$-state Potts\nlattice gauge theory on $\\mathbb{Z}^d$ undergo a sharp phase transition dual to\nthat of the Potts model. This is a consequence of a more general theorem on the\nasymptotic probability that the boundary of a $(d-1)$-dimensional box is\nnull-homologous in the $(d-1)$-dimensional plaquette random-cluster model. Our\nproof is unconditional for Ising lattice gauge theory, but relies on a\nregularity conjecture for the random-cluster model in slabs when $q>2.$ As\nanother special case, we generalize a theorem of Aizenman, Chayes, Chayes,\nFr\\\"olich, and Russo for $2$-dimensional Bernoulli percolation on\n$\\mathbb{Z}^3$ to $(d-1)$-dimensional Bernoulli plaquette percolation on\n$\\mathbb{Z}^d.$\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:35:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Duncan","Paul",""],["Schweinhart","Benjamin",""]]}
{"id":"2308.07535","submitter":"Mohammad Rostami","authors":"Zeyu Shangguan and Mohammad Rostami","title":"Improved Region Proposal Network for Enhanced Few-Shot Object Detection","comments":"arXiv admin note: substantial text overlap with arXiv:2303.10422","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite significant success of deep learning in object detection tasks, the\nstandard training of deep neural networks requires access to a substantial\nquantity of annotated images across all classes. Data annotation is an arduous\nand time-consuming endeavor, particularly when dealing with infrequent objects.\nFew-shot object detection (FSOD) methods have emerged as a solution to the\nlimitations of classic object detection approaches based on deep learning. FSOD\nmethods demonstrate remarkable performance by achieving robust object detection\nusing a significantly smaller amount of training data. A challenge for FSOD is\nthat instances from novel classes that do not belong to the fixed set of\ntraining classes appear in the background and the base model may pick them up\nas potential objects. These objects behave similarly to label noise because\nthey are classified as one of the training dataset classes, leading to FSOD\nperformance degradation. We develop a semi-supervised algorithm to detect and\nthen utilize these unlabeled novel objects as positive samples during the FSOD\ntraining stage to improve FSOD performance. Specifically, we develop a\nhierarchical ternary classification region proposal network (HTRPN) to localize\nthe potential unlabeled novel objects and assign them new objectness labels to\ndistinguish these objects from the base training dataset classes. Our improved\nhierarchical sampling strategy for the region proposal network (RPN) also\nboosts the perception ability of the object detection model for large objects.\nWe test our approach and COCO and PASCAL VOC baselines that are commonly used\nin FSOD literature. Our experimental results indicate that our method is\neffective and outperforms the existing state-of-the-art (SOTA) FSOD methods.\nOur implementation is provided as a supplement to support reproducibility of\nthe results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:35:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shangguan","Zeyu",""],["Rostami","Mohammad",""]]}
{"id":"2308.07536","submitter":"Jincheng Cao","authors":"Jincheng Cao, Ruichen Jiang, Nazanin Abolfazli, Erfan Yazdandoost\n  Hamedani, Aryan Mokhtari","title":"Projection-Free Methods for Stochastic Simple Bilevel Optimization with\n  Convex Lower-level Problem","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":"  In this paper, we study a class of stochastic bilevel optimization problems,\nalso known as stochastic simple bilevel optimization, where we minimize a\nsmooth stochastic objective function over the optimal solution set of another\nstochastic convex optimization problem. We introduce novel stochastic bilevel\noptimization methods that locally approximate the solution set of the\nlower-level problem via a stochastic cutting plane, and then run a conditional\ngradient update with variance reduction techniques to control the error induced\nby using stochastic gradients. For the case that the upper-level function is\nconvex, our method requires\n$\\tilde{\\mathcal{O}}(\\max\\{1/\\epsilon_f^{2},1/\\epsilon_g^{2}\\}) $ stochastic\noracle queries to obtain a solution that is $\\epsilon_f$-optimal for the\nupper-level and $\\epsilon_g$-optimal for the lower-level. This guarantee\nimproves the previous best-known complexity of\n$\\mathcal{O}(\\max\\{1/\\epsilon_f^{4},1/\\epsilon_g^{4}\\})$. Moreover, for the\ncase that the upper-level function is non-convex, our method requires at most\n$\\tilde{\\mathcal{O}}(\\max\\{1/\\epsilon_f^{3},1/\\epsilon_g^{3}\\}) $ stochastic\noracle queries to find an $(\\epsilon_f, \\epsilon_g)$-stationary point. In the\nfinite-sum setting, we show that the number of stochastic oracle calls required\nby our method are $\\tilde{\\mathcal{O}}(\\sqrt{n}/\\epsilon)$ and\n$\\tilde{\\mathcal{O}}(\\sqrt{n}/\\epsilon^{2})$ for the convex and non-convex\nsettings, respectively, where $\\epsilon=\\min \\{\\epsilon_f,\\epsilon_g\\}$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:37:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cao","Jincheng",""],["Jiang","Ruichen",""],["Abolfazli","Nazanin",""],["Hamedani","Erfan Yazdandoost",""],["Mokhtari","Aryan",""]]}
{"id":"2308.07537","submitter":"Yunhao Li","authors":"Yunhao Li, Zhen Xiao, Lin Yang, Dan Meng, Xin Zhou, Heng Fan, Libo\n  Zhang","title":"AttMOT: Improving Multiple-Object Tracking by Introducing Auxiliary\n  Pedestrian Attributes","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) is a fundamental problem in computer vision with\nnumerous applications, such as intelligent surveillance and automated driving.\nDespite the significant progress made in MOT, pedestrian attributes, such as\ngender, hairstyle, body shape, and clothing features, which contain rich and\nhigh-level information, have been less explored. To address this gap, we\npropose a simple, effective, and generic method to predict pedestrian\nattributes to support general Re-ID embedding. We first introduce AttMOT, a\nlarge, highly enriched synthetic dataset for pedestrian tracking, containing\nover 80k frames and 6 million pedestrian IDs with different time, weather\nconditions, and scenarios. To the best of our knowledge, AttMOT is the first\nMOT dataset with semantic attributes. Subsequently, we explore different\napproaches to fuse Re-ID embedding and pedestrian attributes, including\nattention mechanisms, which we hope will stimulate the development of\nattribute-assisted MOT. The proposed method AAM demonstrates its effectiveness\nand generality on several representative pedestrian multi-object tracking\nbenchmarks, including MOT17 and MOT20, through experiments on the AttMOT\ndataset. When applied to state-of-the-art trackers, AAM achieves consistent\nimprovements in MOTA, HOTA, AssA, IDs, and IDF1 scores. For instance, on MOT17,\nthe proposed method yields a +1.1 MOTA, +1.7 HOTA, and +1.8 IDF1 improvement\nwhen used with FairMOT. To encourage further research on attribute-assisted\nMOT, we will release the AttMOT dataset.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:39:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Yunhao",""],["Xiao","Zhen",""],["Yang","Lin",""],["Meng","Dan",""],["Zhou","Xin",""],["Fan","Heng",""],["Zhang","Libo",""]]}
{"id":"2308.07538","submitter":"Guillermo Cabrera-Vives","authors":"Guillermo Cabrera-Vives, C\\'esar Bolivar, Francisco F\\\"orster,\n  Alejandra M. Mu\\~noz Arancibia, Manuel P\\'erez-Carrasco, Esteban Reyes","title":"Domain Adaptation via Minimax Entropy for Real/Bogus Classification of\n  Astronomical Alerts","comments":null,"journal-ref":"ICML 2023 Workshop on Machine Learning for Astrophysics","doi":null,"report-no":null,"categories":"astro-ph.IM cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time domain astronomy is advancing towards the analysis of multiple massive\ndatasets in real time, prompting the development of multi-stream machine\nlearning models. In this work, we study Domain Adaptation (DA) for real/bogus\nclassification of astronomical alerts using four different datasets: HiTS, DES,\nATLAS, and ZTF. We study the domain shift between these datasets, and improve a\nnaive deep learning classification model by using a fine tuning approach and\nsemi-supervised deep DA via Minimax Entropy (MME). We compare the balanced\naccuracy of these models for different source-target scenarios. We find that\nboth the fine tuning and MME models improve significantly the base model with\nas few as one labeled item per class coming from the target dataset, but that\nthe MME does not compromise its performance on the source dataset.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:40:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cabrera-Vives","Guillermo",""],["Bolivar","C\u00e9sar",""],["F\u00f6rster","Francisco",""],["Arancibia","Alejandra M. Mu\u00f1oz",""],["P\u00e9rez-Carrasco","Manuel",""],["Reyes","Esteban",""]]}
{"id":"2308.07539","submitter":"Shuai Chen","authors":"Chen Shuai, Meng Fanman, Zhang Runtong, Qiu Heqian, Li Hongliang, Wu\n  Qingbo, Xu Linfeng","title":"Visual and Textual Prior Guided Mask Assemble for Few-Shot Segmentation\n  and Beyond","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Few-shot segmentation (FSS) aims to segment the novel classes with a few\nannotated images. Due to CLIP's advantages of aligning visual and textual\ninformation, the integration of CLIP can enhance the generalization ability of\nFSS model. However, even with the CLIP model, the existing CLIP-based FSS\nmethods are still subject to the biased prediction towards base classes, which\nis caused by the class-specific feature level interactions. To solve this\nissue, we propose a visual and textual Prior Guided Mask Assemble Network\n(PGMA-Net). It employs a class-agnostic mask assembly process to alleviate the\nbias, and formulates diverse tasks into a unified manner by assembling the\nprior through affinity. Specifically, the class-relevant textual and visual\nfeatures are first transformed to class-agnostic prior in the form of\nprobability map. Then, a Prior-Guided Mask Assemble Module (PGMAM) including\nmultiple General Assemble Units (GAUs) is introduced. It considers diverse and\nplug-and-play interactions, such as visual-textual, inter- and intra-image,\ntraining-free, and high-order ones. Lastly, to ensure the class-agnostic\nability, a Hierarchical Decoder with Channel-Drop Mechanism (HDCDM) is proposed\nto flexibly exploit the assembled masks and low-level features, without relying\non any class-specific information. It achieves new state-of-the-art results in\nthe FSS task, with mIoU of $77.6$ on $\\text{PASCAL-}5^i$ and $59.4$ on\n$\\text{COCO-}20^i$ in 1-shot scenario. Beyond this, we show that without extra\nre-training, the proposed PGMA-Net can solve bbox-level and cross-domain FSS,\nco-segmentation, zero-shot segmentation (ZSS) tasks, leading an any-shot\nsegmentation framework.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:46:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shuai","Chen",""],["Fanman","Meng",""],["Runtong","Zhang",""],["Heqian","Qiu",""],["Hongliang","Li",""],["Qingbo","Wu",""],["Linfeng","Xu",""]]}
{"id":"2308.07540","submitter":"Andrew Zhu","authors":"Andrew Zhu and Lara J. Martin and Andrew Head and Chris Callison-Burch","title":"CALYPSO: LLMs as Dungeon Masters' Assistants","comments":"11 pages, 4 figures. AIIDE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The role of a Dungeon Master, or DM, in the game Dungeons & Dragons is to\nperform multiple tasks simultaneously. The DM must digest information about the\ngame setting and monsters, synthesize scenes to present to other players, and\nrespond to the players' interactions with the scene. Doing all of these tasks\nwhile maintaining consistency within the narrative and story world is no small\nfeat of human cognition, making the task tiring and unapproachable to new\nplayers. Large language models (LLMs) like GPT-3 and ChatGPT have shown\nremarkable abilities to generate coherent natural language text. In this paper,\nwe conduct a formative evaluation with DMs to establish the use cases of LLMs\nin D&D and tabletop gaming generally. We introduce CALYPSO, a system of\nLLM-powered interfaces that support DMs with information and inspiration\nspecific to their own scenario. CALYPSO distills game context into bite-sized\nprose and helps brainstorm ideas without distracting the DM from the game. When\ngiven access to CALYPSO, DMs reported that it generated high-fidelity text\nsuitable for direct presentation to players, and low-fidelity ideas that the DM\ncould develop further while maintaining their creative agency. We see CALYPSO\nas exemplifying a paradigm of AI-augmented tools that provide synchronous\ncreative assistance within established game worlds, and tabletop gaming more\nbroadly.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:57:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhu","Andrew",""],["Martin","Lara J.",""],["Head","Andrew",""],["Callison-Burch","Chris",""]]}
{"id":"2308.07541","submitter":"Siddharth Agarwal","authors":"Siddharth Agarwal, Maria A. Rodriguez, Rajkumar Buyya","title":"Reinforcement Learning (RL) Augmented Cold Start Frequency Reduction in\n  Serverless Computing","comments":"13 figures, 10 pages, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Function-as-a-Service is a cloud computing paradigm offering an event-driven\nexecution model to applications. It features serverless attributes by\neliminating resource management responsibilities from developers and offers\ntransparent and on-demand scalability of applications. Typical serverless\napplications have stringent response time and scalability requirements and\ntherefore rely on deployed services to provide quick and fault-tolerant\nfeedback to clients. However, the FaaS paradigm suffers from cold starts as\nthere is a non-negligible delay associated with on-demand function\ninitialization. This work focuses on reducing the frequency of cold starts on\nthe platform by using Reinforcement Learning. Our approach uses Q-learning and\nconsiders metrics such as function CPU utilization, existing function\ninstances, and response failure rate to proactively initialize functions in\nadvance based on the expected demand. The proposed solution was implemented on\nKubeless and was evaluated using a normalised real-world function demand trace\nwith matrix multiplication as the workload. The results demonstrate a\nfavourable performance of the RL-based agent when compared to Kubeless' default\npolicy and function keep-alive policy by improving throughput by up to 8.81%\nand reducing computation load and resource wastage by up to 55% and 37%,\nrespectively, which is a direct outcome of reduced cold starts.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:01:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Agarwal","Siddharth",""],["Rodriguez","Maria A.",""],["Buyya","Rajkumar",""]]}
{"id":"2308.07542","submitter":"Kyler Siegel","authors":"Dusa McDuff and Kyler Siegel","title":"Ellipsoidal superpotentials and singular curve counts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a closed symplectic manifold, we construct invariants which count (a)\nclosed rational pseudoholomorphic curves with prescribed cusp singularities and\n(b) punctured rational pseudoholomorphic curves with ellipsoidal negative ends.\nWe prove an explicit equivalence between these two frameworks, which in\nparticular gives a new geometric interpretation of various counts in symplectic\nfield theory. We show that these invariants encode important information about\nsingular symplectic curves and stable symplectic embedding obstructions. We\nalso prove a correspondence theorem between rigid unicuspidal curves and\nperfect exceptional classes, which we illustrate by classifying rigid\nunicuspidal (symplectic or algebraic) curves in the first Hirzebruch surface.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:05:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["McDuff","Dusa",""],["Siegel","Kyler",""]]}
{"id":"2308.07543","submitter":"Yanting Zhang","authors":"Yanting Zhang and Ligong Wang","title":"The $\\alpha$-index of graphs without intersecting triangles/quadrangles\n  as a minor","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $A_{\\alpha}$-matrix of a graph $G$ is the convex linear combination of\nthe adjacency matrix $A(G)$ and the diagonal matrix of vertex degrees $D(G)$,\ni.e., $A_{\\alpha}(G) = \\alpha D(G) + (1 - \\alpha)A(G)$, where $0\\leq\\alpha\n\\leq1$. The $\\alpha$-index of $G$ is the largest eigenvalue of $A_\\alpha(G)$.\nParticularly, the matrix $A_0(G)$ (resp. $2A_{\\frac{1}{2}}(G)$) is exactly the\nadjacency matrix (resp. signless Laplacian matrix) of $G$. He, Li and Feng\n[arXiv:2301.06008 (2023)] determined the extremal graphs with maximum adjacency\nspectral radius among all graphs of sufficiently large order without\nintersecting triangles and quadrangles as a minor, respectively. Motivated by\nthe above results of He, Li and Feng, in this paper we characterize the\nextremal graphs with maximum $\\alpha$-index among all graphs of sufficiently\nlarge order without intersecting triangles and quadrangles as a minor for any\n$0<\\alpha<1$, respectively. As by-products, we determine the extremal graphs\nwith maximum signless Laplacian radius among all graphs of sufficiently large\norder without intersecting triangles and quadrangles as a minor, respectively.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:18:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Yanting",""],["Wang","Ligong",""]]}
{"id":"2308.07544","submitter":"Zhe Wang","authors":"Zhe Wang, Jiashu Liang, Martin Head-Gordon","title":"Earth Mover's Distance as a metric to evaluate the extent of charge\n  transfer in excitations using discretized real-space densities","comments":"31 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel theoretical measure, $\\mu^{\\text{EMD}}$, based on\nthe Earth Mover's Distance, for quantifying the density shift caused by\nelectronic excitations in molecules. As input, the EMD metric uses only the\ndiscretized ground and excited state electron densities in real space,\nrendering it compatible with almost all electronic structure methods used to\ncalculate excited states. The EMD metric is compared against other popular\ntheoretical metrics for describing the extent of electron-hole separation in a\nwide range of excited states (valence, Rydberg, charge-transfer, etc). The\nresults showcase the EMD metric's effectiveness across all excitation types and\nsuggest that it is useful as an additional tool to characterize electronic\nexcitations. The study also reveals that $\\mu^{\\text{EMD}}$ can function as a\npromising diagnostic tool for predicting the failure of pure\nexchange-correlation functionals. Specifically, we show statistical\nrelationships between the functional-driven errors, the exact exchange content\nwithin the functional, and the magnitude of $\\mu^{\\text{EMD}}$ values.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:21:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zhe",""],["Liang","Jiashu",""],["Head-Gordon","Martin",""]]}
{"id":"2308.07545","submitter":"Xindi Wu","authors":"Xindi Wu, Zhiwei Deng, Olga Russakovsky","title":"Multimodal Dataset Distillation for Image-Text Retrieval","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dataset distillation methods offer the promise of reducing a large-scale\ndataset down to a significantly smaller set of (potentially synthetic) training\nexamples, which preserve sufficient information for training a new model from\nscratch. So far dataset distillation methods have been developed for image\nclassification. However, with the rise in capabilities of vision-language\nmodels, and especially given the scale of datasets necessary to train these\nmodels, the time is ripe to expand dataset distillation methods beyond image\nclassification. In this work, we take the first steps towards this goal by\nexpanding on the idea of trajectory matching to create a distillation method\nfor vision-language datasets. The key challenge is that vision-language\ndatasets do not have a set of discrete classes. To overcome this, our proposed\nmultimodal dataset distillation method jointly distill the images and their\ncorresponding language descriptions in a contrastive formulation. Since there\nare no existing baselines, we compare our approach to three coreset selection\nmethods (strategic subsampling of the training dataset), which we adapt to the\nvision-language setting. We demonstrate significant improvements on the\nchallenging Flickr30K and COCO retrieval benchmark: the best coreset selection\nmethod which selects 1000 image-text pairs for training is able to achieve only\n5.6% image-to-text retrieval accuracy (recall@1); in contrast, our dataset\ndistillation approach almost doubles that with just 100 (an order of magnitude\nfewer) training pairs.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:22:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wu","Xindi",""],["Deng","Zhiwei",""],["Russakovsky","Olga",""]]}
{"id":"2308.07546","submitter":"Daizong Liu","authors":"Yunbo Tao, Daizong Liu, Pan Zhou, Yulai Xie, Wei Du, Wei Hu","title":"3DHacker: Spectrum-based Decision Boundary Generation for Hard-label 3D\n  Point Cloud Attack","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":"  With the maturity of depth sensors, the vulnerability of 3D point cloud\nmodels has received increasing attention in various applications such as\nautonomous driving and robot navigation. Previous 3D adversarial attackers\neither follow the white-box setting to iteratively update the coordinate\nperturbations based on gradients, or utilize the output model logits to\nestimate noisy gradients in the black-box setting. However, these attack\nmethods are hard to be deployed in real-world scenarios since realistic 3D\napplications will not share any model details to users. Therefore, we explore a\nmore challenging yet practical 3D attack setting, \\textit{i.e.}, attacking\npoint clouds with black-box hard labels, in which the attacker can only have\naccess to the prediction label of the input. To tackle this setting, we propose\na novel 3D attack method, termed \\textbf{3D} \\textbf{H}ard-label\natt\\textbf{acker} (\\textbf{3DHacker}), based on the developed decision boundary\nalgorithm to generate adversarial samples solely with the knowledge of class\nlabels. Specifically, to construct the class-aware model decision boundary,\n3DHacker first randomly fuses two point clouds of different classes in the\nspectral domain to craft their intermediate sample with high imperceptibility,\nthen projects it onto the decision boundary via binary search. To restrict the\nfinal perturbation size, 3DHacker further introduces an iterative optimization\nstrategy to move the intermediate sample along the decision boundary for\ngenerating adversarial point clouds with smallest trivial perturbations.\nExtensive evaluations show that, even in the challenging hard-label setting,\n3DHacker still competitively outperforms existing 3D attacks regarding the\nattack performance as well as adversary quality.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:29:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tao","Yunbo",""],["Liu","Daizong",""],["Zhou","Pan",""],["Xie","Yulai",""],["Du","Wei",""],["Hu","Wei",""]]}
{"id":"2308.07547","submitter":"Xuemin Deng","authors":"Xuemin Deng, Yuelong Xiao, Aibin Zang","title":"Stability and inviscid limit of the 3D anisotropic MHD system near a\n  background magnetic field with mixed fractional partial dissipation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A main result of this paper establishes the global stability of the\nthree-dimensional MHD equations near a background magnetic field with mixed\nfractional partial dissipation with $\\alpha, \\beta\\in(\\frac{1}{2}, 1]$. Namely,\nthe velocity equations involve dissipation $(\\Lambda_1^{2\\alpha} +\n\\Lambda_2^{2\\alpha}+\\sigma \\Lambda_3^{2\\alpha})u$ with the case $\\sigma=1$ and\n$\\sigma=0$. The magnetic equations without partial magnetic diffusion\n$\\Lambda_i^{2\\beta} b_i $ but with the diffusion $(-\\Delta)^\\beta b$, where\n$\\Lambda_i^{s} (s>0)$ with $i=1, 2, 3$ are the directional fractional\noperators. Then we focus on the vanishing vertical kinematic viscosity\ncoefficient limit of the MHD system with the case $\\sigma=1$ to the case\n$\\sigma=0$. The convergent result is obtained in the sense of $H^1$-norm.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:29:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deng","Xuemin",""],["Xiao","Yuelong",""],["Zang","Aibin",""]]}
{"id":"2308.07548","submitter":"Wei-Bin Yan","authors":"Wei-Bin Yan, Zhong-Xiao Man, Ying-Jie Zhang, and Yun-Jie Xia","title":"Temperature-related single-photon transport in waveguide QED","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a scheme to realize the single-photon transport affected by the\ntemperature. The scheme is composed by a waveguide-atom interacting structure\nlinked to a thermal bath. The single-photon reflection coefficient can be tuned\nby adjusting the temperature of the thermal bath. This provides a thermal\ncontrol of the single-photon transport. Moreover, the temperature of the\nthermal bath can be estimated by measuring the single-photon transport. It is\nfeasible that the estimation on the temperature is sensitive to slight changes\nof low temperature. This implies an avenue for implementing the optical\nthermometer with the ability to accurately measure the sample temperature in\nthe low-temperature region.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:39:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yan","Wei-Bin",""],["Man","Zhong-Xiao",""],["Zhang","Ying-Jie",""],["Xia","Yun-Jie",""]]}
{"id":"2308.07549","submitter":"Jian-Min Zhang","authors":"Ning-Jing Yang, Wen-Ti Guo, Hai Yang, Zhigao Huang, and Jian-Min Zhang","title":"Topological Phases, Local Magnetic Moments, and Spin Polarization\n  Triggered by C558-Line Defects in Graphene","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the electronic properties of a novel topological defect structure\nfor graphene interspersed with C558-line defects along the Armchair boundary.\nThis system has the topological property of being topologically three-periodic\nand the type-II Dirac-fermionic character of the embedded topological phase. At\nthe same time, we show computationally that the topological properties of the\nsystem are overly dependent on the coupling of this line defect. Using strain\nengineering to regulate the magnitude of hopping at the defect, the position of\nthe energy level can be easily changed to achieve a topological phase\ntransition. We also discuss the local magnetic moment and the ferromagnetic\nground state in the context of line defects, which is the conclusion after\nconsidering additional Coulomb interactions. This leads to spin polarization of\nthe whole system. Finally, by modulating the local magnetic moment at the\nposition of the line defect, we achieve a tunable spin quantum conductance in a\none-dimensional nanoribbon. Near the Fermi energy level, it also has the\nproperty of complete spin polarization. Consequently, spin filtering can be\nachieved by varying the incident energy of the electrons.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:41:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Ning-Jing",""],["Guo","Wen-Ti",""],["Yang","Hai",""],["Huang","Zhigao",""],["Zhang","Jian-Min",""]]}
{"id":"2308.07550","submitter":"Jian-Min Zhang","authors":"Ning-Jing Yang and Jian-Min Zhang","title":"High-Order Topological Phase Diagram Revealed by Anomalous Nernst Effect\n  in Janus ScClI Monolayer","comments":"6 pages, 3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Higher-order topological properties of two-dimensional(2D) magnetic materials\nhave recently been proposed. In 2D ferromagnetic Janus materials, we find that\nScClI is a second-order topological insulator (SOTI). By means of a\nmulti-orbital tight-binding model, we analyze the orbital contributions of\nhigher-order topologies. Further, we give the complete high-order topological\nphase diagram of ScClI, based on the external field modulation of the\nmagneto-valley coupling and energy levels. 2D ScClI has a pronounced valley\npolarization, which causes different insulating phases to exhibit completely\ndifferent anomalous Nernst conductance. As a result, we use the matched\nanomalous Nernst effect to reveal the topological phase transition process of\nScClI. We utilize the characteristics of valley electronics to link\nhigher-order topological materials with the anomalous Nernst effect, which has\npotential implications for high-order topological insulators and valley\nelectronics.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:42:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Ning-Jing",""],["Zhang","Jian-Min",""]]}
{"id":"2308.07551","submitter":"Wenzhuo Zheng","authors":"Wenzhuo Zheng, Junhao Zhao, Xiaohong Liu, Yongyang Pan, Zhenghao Gan,\n  Haozhe Han, Ning Liu","title":"Multi-view 3D Face Reconstruction Based on Flame","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  At present, face 3D reconstruction has broad application prospects in various\nfields, but the research on it is still in the development stage. In this\npaper, we hope to achieve better face 3D reconstruction quality by combining\nmulti-view training framework with face parametric model Flame, propose a\nmulti-view training and testing model MFNet (Multi-view Flame Network). We\nbuild a self-supervised training framework and implement constraints such as\nmulti-view optical flow loss function and face landmark loss, and finally\nobtain a complete MFNet. We propose innovative implementations of multi-view\noptical flow loss and the covisible mask. We test our model on AFLW and\nfacescape datasets and also take pictures of our faces to reconstruct 3D faces\nwhile simulating actual scenarios as much as possible, which achieves good\nresults. Our work mainly addresses the problem of combining parametric models\nof faces with multi-view face 3D reconstruction and explores the implementation\nof a Flame based multi-view training and testing framework for contributing to\nthe field of face 3D reconstruction.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:42:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zheng","Wenzhuo",""],["Zhao","Junhao",""],["Liu","Xiaohong",""],["Pan","Yongyang",""],["Gan","Zhenghao",""],["Han","Haozhe",""],["Liu","Ning",""]]}
{"id":"2308.07552","submitter":"Abodh Poudyal","authors":"Shuva Paul, Abodh Poudyal, Shiva Poudel, Anamika Dubey, Zhaoyu Wang","title":"Resilience assessment and planning in power distribution systems:Past\n  and future considerations","comments":"27 pages, 7 figures, submitted for review to Renewable and\n  Sustainable Energy Reviews","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past decade, extreme weather events have significantly increased\nworldwide, leading to widespread power outages and blackouts. As these threats\ncontinue to challenge power distribution systems, the importance of mitigating\nthe impacts of extreme weather events has become paramount. Consequently,\nresilience has become crucial for designing and operating power distribution\nsystems. This work comprehensively explores the current landscape of resilience\nevaluation and metrics within the power distribution system domain, reviewing\nexisting methods and identifying key attributes that define effective\nresilience metrics. The challenges encountered during the formulation,\ndevelopment, and calculation of these metrics are also addressed. Additionally,\nthis review acknowledges the intricate interdependencies between power\ndistribution systems and critical infrastructures, including information and\ncommunication technology, transportation, water distribution, and natural gas\nnetworks. It is important to understand these interdependencies and their\nimpact on power distribution system resilience. Moreover, this work provides an\nin-depth analysis of existing research on planning solutions to enhance\ndistribution system resilience and support power distribution system operators\nand planners in developing effective mitigation strategies. These strategies\nare crucial for minimizing the adverse impacts of extreme weather events and\nfostering overall resilience within power distribution systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:43:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Paul","Shuva",""],["Poudyal","Abodh",""],["Poudel","Shiva",""],["Dubey","Anamika",""],["Wang","Zhaoyu",""]]}
{"id":"2308.07553","submitter":"Shijie Liu","authors":"Shijie Liu, Andrew C. Cullen, Paul Montague, Sarah M. Erfani, Benjamin\n  I. P. Rubinstein","title":"Enhancing the Antidote: Improved Pointwise Certifications against\n  Poisoning Attacks","comments":null,"journal-ref":"Proceedings of the 2023 AAAI Conference on Artificial\n  Intelligence, 37(7), 8861-8869","doi":"10.1609/aaai.v37i7.26065","report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Poisoning attacks can disproportionately influence model behaviour by making\nsmall changes to the training corpus. While defences against specific poisoning\nattacks do exist, they in general do not provide any guarantees, leaving them\npotentially countered by novel attacks. In contrast, by examining worst-case\nbehaviours Certified Defences make it possible to provide guarantees of the\nrobustness of a sample against adversarial attacks modifying a finite number of\ntraining samples, known as pointwise certification. We achieve this by\nexploiting both Differential Privacy and the Sampled Gaussian Mechanism to\nensure the invariance of prediction for each testing instance against finite\nnumbers of poisoned examples. In doing so, our model provides guarantees of\nadversarial robustness that are more than twice as large as those provided by\nprior certifications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:46:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Shijie",""],["Cullen","Andrew C.",""],["Montague","Paul",""],["Erfani","Sarah M.",""],["Rubinstein","Benjamin I. P.",""]]}
{"id":"2308.07554","submitter":"Nithiwadee Thaicharoen","authors":"Nithiwadee Thaicharoen, Ryan Cardman, Georg Raithel","title":"Rydberg-EIT of $^{85}$Rb vapor in a cell with Ne buffer gas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.ins-det physics.plasm-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate Rydberg electromagnetically induced transparency (EIT) of\n$^{85}$Rb atomic vapor in a glass cell that contains a 5-Torr neon buffer gas.\nAt low probe power, EIT lines exhibit a positive frequency shift of about\n70~MHz and a broadening of about 120~MHz, with minimal dependence on the\nprincipal quantum number of the Rydberg states. The EIT line shift arises from\ns-wave scattering between the Rydberg electron and the Ne atoms, which induces\na positive shift near 190~MHz, and from the polarization of the Ne atoms within\nthe Rydberg atom, which adds a negative shift near -120~MHz. The line\nbroadening is largely due to the Ne polarization. Our experimental results are\nin good qualitative agreement with our theoretical model, in which the shift is\nlinear in buffer-gas density. Our results suggest that Rydberg-EIT can serve as\na direct spectroscopic probe for buffer-gas density at low pressure, and that\nit is suitable for non-invasive measurement of electric fields in low-pressure\nnoble-gas discharge plasmas and in dusty plasmas.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:48:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Thaicharoen","Nithiwadee",""],["Cardman","Ryan",""],["Raithel","Georg",""]]}
{"id":"2308.07555","submitter":"Wang Zepu","authors":"Zepu Wang, Yifei Sun, Zhiyu Lei, Xincheng Zhu, Peng Sun","title":"SST: A Simplified Swin Transformer-based Model for Taxi Destination\n  Prediction based on Existing Trajectory","comments":"Accepted by IEEE ITSC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately predicting the destination of taxi trajectories can have various\nbenefits for intelligent location-based services. One potential method to\naccomplish this prediction is by converting the taxi trajectory into a\ntwo-dimensional grid and using computer vision techniques. While the Swin\nTransformer is an innovative computer vision architecture with demonstrated\nsuccess in vision downstream tasks, it is not commonly used to solve real-world\ntrajectory problems. In this paper, we propose a simplified Swin Transformer\n(SST) structure that does not use the shifted window idea in the traditional\nSwin Transformer, as trajectory data is consecutive in nature. Our\ncomprehensive experiments, based on real trajectory data, demonstrate that SST\ncan achieve higher accuracy compared to state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:49:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zepu",""],["Sun","Yifei",""],["Lei","Zhiyu",""],["Zhu","Xincheng",""],["Sun","Peng",""]]}
{"id":"2308.07556","submitter":"Adrian de Wynter","authors":"Adrian de Wynter, Anthony Hevia, Si-Qing Chen","title":"A User-Centered Evaluation of Spanish Text Simplification","comments":"Data at https://github.com/microsoft/BrevE-CLaro","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present an evaluation of text simplification (TS) in Spanish for a\nproduction system, by means of two corpora focused in both complex-sentence and\ncomplex-word identification. We compare the most prevalent Spanish-specific\nreadability scores with neural networks, and show that the latter are\nconsistently better at predicting user preferences regarding TS. As part of our\nanalysis, we find that multilingual models underperform against equivalent\nSpanish-only models on the same task, yet all models focus too often on\nspurious statistical features, such as sentence length. We release the corpora\nin our evaluation to the broader community with the hopes of pushing forward\nthe state-of-the-art in Spanish natural language processing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:49:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["de Wynter","Adrian",""],["Hevia","Anthony",""],["Chen","Si-Qing",""]]}
{"id":"2308.07557","submitter":"Keshav Dasu","authors":"Keshav Dasu, Yun-Hsin Kuo, Kwan-Liu Ma","title":"Character-Oriented Design for Visual Data Storytelling","comments":"Accepted to TVCG & VIS 2023 Pre-Print. Storytelling, Data Stories,\n  Explanatory, Narrative visualization, Visual metaphor","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When telling a data story, an author has an intention they seek to convey to\nan audience. This intention can be of many forms such as to persuade, to\neducate, to inform, or even to entertain. In addition to expressing their\nintention, the story plot must balance being consumable and enjoyable while\npreserving scientific integrity. In data stories, numerous methods have been\nidentified for constructing and presenting a plot. However, there is an\nopportunity to expand how we think and create the visual elements that present\nthe story. Stories are brought to life by characters; often they are what make\na story captivating, enjoyable, memorable, and facilitate following the plot\nuntil the end. Through the analysis of 160 existing data stories, we\nsystematically investigate and identify distinguishable features of characters\nin data stories, and we illustrate how they feed into the broader concept of\n\"character-oriented design\". We identify the roles and visual representations\ndata characters assume as well as the types of relationships these roles have\nwith one another. We identify characteristics of antagonists as well as define\nconflict in data stories. We find the need for an identifiable central\ncharacter that the audience latches on to in order to follow the narrative and\nidentify their visual representations. We then illustrate \"character-oriented\ndesign\" by showing how to develop data characters with common data story plots.\nWith this work, we present a framework for data characters derived from our\nanalysis; we then offer our extension to the data storytelling process using\ncharacter-oriented design. To access our supplemental materials please visit\nhttps://chaorientdesignds.github.io/\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:50:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Dasu","Keshav",""],["Kuo","Yun-Hsin",""],["Ma","Kwan-Liu",""]]}
{"id":"2308.07558","submitter":"Yuya Yoshikawa","authors":"Yuya Yoshikawa, Yutaro Shigeto, Masashi Shimbo, Akikazu Takeuchi","title":"Action Class Relation Detection and Classification Across Multiple Video\n  Datasets","comments":"Accepted to Pattern Recognition Letters. 12 pages, 4 figures","journal-ref":"Pattern Recognition Letters 173 (2023) 93-100","doi":"10.1016/j.patrec.2023.08.002","report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Meta Video Dataset (MetaVD) provides annotated relations between action\nclasses in major datasets for human action recognition in videos. Although\nthese annotated relations enable dataset augmentation, it is only applicable to\nthose covered by MetaVD. For an external dataset to enjoy the same benefit, the\nrelations between its action classes and those in MetaVD need to be determined.\nTo address this issue, we consider two new machine learning tasks: action class\nrelation detection and classification. We propose a unified model to predict\nrelations between action classes, using language and visual information\nassociated with classes. Experimental results show that (i) pre-trained recent\nneural network models for texts and videos contribute to high predictive\nperformance, (ii) the relation prediction based on action label texts is more\naccurate than based on videos, and (iii) a blending approach that combines\npredictions by both modalities can further improve the predictive performance\nin some cases.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:56:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yoshikawa","Yuya",""],["Shigeto","Yutaro",""],["Shimbo","Masashi",""],["Takeuchi","Akikazu",""]]}
{"id":"2308.07559","submitter":"Yoshiaki Sofue","authors":"Yoshiaki Sofue","title":"Giant molecular cloud G18.1-0.3+51 associated with HII regions and\n  supernova remnant in the 3-kpc expanding ring","comments":"To appear in MNRAS, 14 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Analyzing the high-resolution CO-line survey of the Galactic plane with the\nNobeyama 45-m telescope (FUGIN), we show that the star-forming complex\nG18.15-0.30+51 (G18) at radial velocity of 51 \\kms is {a tight triple\nassociation of a giant molecular cloud (GMC), HII regions, and a supernova\nremnant (SNR).} The kinematical distance of G18 is determined to be $d=3.9\\pm\n0.2$ kpc for near solution for circular rotation, $12\\pm 0.2$ kpc for far\nsolution, or $d=6.1\\pm 0.1$, if it is in the 3-kpc expanding ring. The HI-line\nabsorption of radio continuum from the HII regions constrains the distance to\n$5.6 \\lesssim d_{\\rm SNR}\\le 7.6$ kpc. The $\\Sigma-D$ (radio\nbrightness-diameter) relation yields the distance to the SNR of $d_{\\rm\nSNR}=10.1^{+11.5}_{-4.7}$ kpc, allowing for a minimum distance of 5.4 kpc. From\nthese we uniquely determined the distance of G18 to be $6.07\\pm 0.13$ kpc in\nthe 3-kpc expanding ring with the SNR being physically associated. The\nmolecular mass of the GMC is estimated to be $M_{\\rm mol}\\sim 3\\times 10^5\nM_\\odot$. The ratio of Virial to luminous molecular masses is greater than\nunity in the central region and decreases outward to $\\lesssim 0.2$ at the\ncloud edge, indicating that the central region is dynamic, while the entire\ncloud is stable. We discuss the origin of the G18 triple system and propose a\nsustainable GMC model with continuous star formation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:00:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sofue","Yoshiaki",""]]}
{"id":"2308.07560","submitter":"Eli Tziperman","authors":"Peter Sherman and Peter Huybers and Eli Tziperman","title":"On the attribution of weather events to climate change using a fit to\n  extreme value distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increases in extreme weather events are a potentially important consequence\nof anthropogenic climate change (ACC), yet, are difficult to attribute to ACC\nbecause the record length is often similar to, or shorter than, extreme-event\nreturn periods. This study is motivated by the ``World Weather Attribution\nProject'' (WWAP) and their approach of fitting extreme value distribution\nfunctions to local observations. The approach calculates the dependence of\ndistribution parameters on the global mean surface temperature (GMST) and uses\nthis dependence to attribute extreme events to ACC. Applying the WWAP method to\na large ensemble of climate simulations run without anthropogenic forcing, we\nstill find a strong dependence of distribution parameters on GMST. This\ndependence results from internal climate variability, such as ENSO, affecting\nboth extreme events and GMST. Therefore, dependence on GMST does not\nnecessarily imply an effect of ACC on extremes.\n  We next re-examine three WWAP attribution cases. We consider whether an\nextreme value, normal, or log-normal distribution better represents the data;\nif a GMST-dependence of distribution parameters is justified using a likelihood\nratio test; and if a meaningful attribution can be made given errors in GMST\ndependence. The effects of natural variability on both GMST and extremes make\nit impossible to attribute the 2020 Siberian Heatwave and Australia's\n2020--2021 bushfires to ACC. The small number of data points for the 2019--2021\ndrought in Madagascar precludes a meaningful attribution analysis. Overall,\nnatural variability and the uncertain relationship between GMST and extremes\nmake attribution using the WWAP approach challenging.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:05:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sherman","Peter",""],["Huybers","Peter",""],["Tziperman","Eli",""]]}
{"id":"2308.07561","submitter":"Hyoung-Taek Lee","authors":"Hyoung-Taek Lee, Jeonghoon Kim, Joon Sue Lee, Mina Yoon, Hyeong-Ryeol\n  Park","title":"Inverse Design of Terahertz Nanoresonators through Physics-Informed\n  Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The rapid development of 6G communications using terahertz (THz)\nelectromagnetic waves has created a demand for highly sensitive THz\nnanoresonators capable of detecting these waves. Among the potential\ncandidates, THz nanogap loop arrays show promising characteristics but require\nsignificant computational resources for accurate simulation. This requirement\narises because their unit cells are 10 times smaller than millimeter\nwavelengths, with nanogap regions that are 1,000,000 times smaller. To address\nthis challenge, we propose a rapid inverse design method for terahertz\nnanoresonators using physics-informed machine learning, specifically employing\ndouble deep Q-learning combined with an analytical model of the THz nanogap\nloop array. Through approximately 200,000 iterations in about 39 hours on a\nmiddle-level personal computer (CPU: 3.40 GHz, 6 cores, 12 threads, RAM: 16 GB,\nGPU: NVIDIA GeForce GTX 1050), our approach successfully identifies the optimal\nstructure, resulting in an experimental electric field enhancement of 32,000 at\n0.2 THz, 300% stronger than previous achievements. By leveraging our analytical\nmodel-based approach, we significantly reduce the computational resources\nrequired, providing a viable alternative to the impractical numerical\nsimulation-based inverse design that was previously impractical.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:08:11 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 10:21:36 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 06:23:25 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lee","Hyoung-Taek",""],["Kim","Jeonghoon",""],["Lee","Joon Sue",""],["Yoon","Mina",""],["Park","Hyeong-Ryeol",""]]}
{"id":"2308.07562","submitter":"Michael Ma","authors":"Jason Lu, Michael Ma, Huaze Xu, Zixi Xu","title":"Semi-Supervised Learning with Multiple Imputations on Non-Random Missing\n  Labels","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Semi-Supervised Learning (SSL) is implemented when algorithms are trained on\nboth labeled and unlabeled data. This is a very common application of ML as it\nis unrealistic to obtain a fully labeled dataset. Researchers have tackled\nthree main issues: missing at random (MAR), missing completely at random\n(MCAR), and missing not at random (MNAR). The MNAR problem is the most\nchallenging of the three as one cannot safely assume that all class\ndistributions are equal. Existing methods, including Class-Aware Imputation\n(CAI) and Class-Aware Propensity (CAP), mostly overlook the non-randomness in\nthe unlabeled data. This paper proposes two new methods of combining multiple\nimputation models to achieve higher accuracy and less bias. 1) We use multiple\nimputation models, create confidence intervals, and apply a threshold to ignore\npseudo-labels with low confidence. 2) Our new method, SSL with De-biased\nImputations (SSL-DI), aims to reduce bias by filtering out inaccurate data and\nfinding a subset that is accurate and reliable. This subset of the larger\ndataset could be imputed into another SSL model, which will be less biased. The\nproposed models have been shown to be effective in both MCAR and MNAR\nsituations, and experimental results show that our methodology outperforms\nexisting methods in terms of classification accuracy and reducing bias.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:09:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lu","Jason",""],["Ma","Michael",""],["Xu","Huaze",""],["Xu","Zixi",""]]}
{"id":"2308.07563","submitter":"Sean Carney","authors":"Sean P. Carney and Milica Dussinger and Bjorn Engquist","title":"On the nature of the boundary resonance error in numerical\n  homogenization and its reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerical homogenization of multiscale equations typically requires taking an\naverage of the solution to a microscale problem. Both the boundary conditions\nand domain size of the microscale problem play an important role in the\naccuracy of the homogenization procedure. In particular, imposing naive\nboundary conditions leads to a $\\mathcal{O}(\\epsilon/\\eta)$ error in the\ncomputation, where $\\epsilon$ is the characteristic size of the microscopic\nfluctuations in the heterogeneous media, and $\\eta$ is the size of the\nmicroscopic domain. This so-called boundary, or ``cell resonance\" error can\ndominate discretization error and pollute the entire homogenization scheme.\nThere exist several techniques in the literature to reduce the error. Most\nstrategies involve modifying the form of the microscale cell problem. Below we\npresent an alternative procedure based on the observation that the resonance\nerror itself is an oscillatory function of domain size $\\eta$. After rigorously\ncharacterizing the oscillatory behavior for one dimensional and quasi-one\ndimensional microscale domains, we present a novel strategy to reduce the\nresonance error. Rather than modifying the form of the cell problem, the\noriginal problem is solved for a sequence of domain sizes, and the results are\naveraged against kernels satisfying certain moment conditions and regularity\nproperties. Numerical examples in one and two dimensions illustrate the utility\nof the approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:12:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Carney","Sean P.",""],["Dussinger","Milica",""],["Engquist","Bjorn",""]]}
{"id":"2308.07564","submitter":"Weijie Ren","authors":"Weijie Ren, Wenjia Xie, Ye Zhang, Hang Yu, Zhengyu Tian","title":"MSAT: Matrix stability analysis tool for shock-capturing schemes","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.comp-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The simulation of supersonic or hypersonic flows often suffers from numerical\nshock instabilities if the flow field contains strong shocks, limiting the\nfurther application of shock-capturing schemes. In this paper, we develop the\nunified matrix stability analysis method for schemes with three-point stencils\nand present MSAT, an open-source tool to quantitatively analyze the shock\ninstability problem. Based on the finite-volume approach on the structured\ngrid, MSAT can be employed to investigate the mechanism of the shock\ninstability problem, evaluate the robustness of numerical schemes, and then\nhelp to develop robust schemes. Also, MSAT has the ability to analyze the\npractical simulation of supersonic or hypersonic flows, evaluate whether it\nwill suffer from shock instabilities, and then assist in selecting appropriate\nnumerical schemes accordingly. As a result, MSAT is a helpful tool that can\ninvestigate the shock instability problem and help to cure it.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:20:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ren","Weijie",""],["Xie","Wenjia",""],["Zhang","Ye",""],["Yu","Hang",""],["Tian","Zhengyu",""]]}
{"id":"2308.07565","submitter":"Pankaj Saini","authors":"Pankaj Saini","title":"Resolving the eccentricity of stellar mass binary black holes with next\n  generation gravitational wave detectors","comments":"9 pages, 2 figures, 3 tables, 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":"  Next generation gravitational wave (GW) detectors are expected to detect\n$10^4 \\mbox{-} 10^5$ binary black holes (BBHs) per year. Understanding the\nformation pathways of these binaries is an open question. Orbital eccentricity\ncan be used to distinguish between the formation channels of compact binaries\nas different formation channels are expected to yield distinct eccentricity\ndistributions. Due to the rapid decay of eccentricity caused by the emission of\nGWs, measuring smaller values of eccentricity poses a challenge for current GW\ndetectors due to their limited sensitivity. In this study, we explore the\npotential of next generation GW detectors such as Voyager, Cosmic Explorer\n(CE), and Einstein Telescope (ET) to resolve the eccentricity of BBH systems.\nConsidering a GWTC-3 like population of BBHs and assuming some fiducial\neccentricity distributions as well as an astrophysically motivated eccentricity\ndistribution (Zevin et $al.$ (2021)), we calculate the fraction of binaries\nthat can be confidently distinguished as eccentric. We find that for Zevin\neccentricity distribution, Voyager, CE, and ET can confidently measure the\nnon-zero eccentricity for $\\sim 3\\%$, $9\\%$, and $13\\%$ of the detected BBHs,\nrespectively. In addition to the fraction of resolvable eccentric binaries, our\nfindings indicate that Voyager, CE, and ET require minimum eccentricities\n$\\gtrsim 0.02$, $5\\times 10^{-3}$, and $10^{-3}$ at a GW frequency of $10$ Hz,\nrespectively, to identify a BBH system as eccentric. The better low-frequency\nsensitivity of ET significantly enhances its capacity to accurately measure\neccentricity.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:21:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Saini","Pankaj",""]]}
{"id":"2308.07566","submitter":"Supriya Pan","authors":"Supriya Pan, Srubabati Goswami, Kaustav Chakraborty","title":"Sensitivity to CP Discovery in the Presence of Lorentz Invariance\n  Violating Potential at T2HK/T2HKK","comments":"10 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Investigation of conservation/violation of CP symmetry in the leptonic sector\nis very essential in understanding the evolution of the universe. Lorentz\ninvariance and CPT are fundamental symmetries of nature. The violation of\nLorentz invariance can also lead to CPT violations. The standard three flavour\nneutrino oscillation framework presents a scenario to observe the signature of\nLorentz invariance and CP violations. This work focuses on the effect of\nLorentz invariance violating (LIV) parameters on the sensitivity to CP\nviolation. We investigate the sensitivity in two proposed configurations of the\nupcoming T2HK experiment: (i) one detector each placed at 295 km and 1100 km,\nand (ii) two identical detectors at 295 km. This study probes the effect of CPT\nviolating parameters $a_{e\\mu},a_{e\\tau},a_{\\mu\\tau}$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:23:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pan","Supriya",""],["Goswami","Srubabati",""],["Chakraborty","Kaustav",""]]}
{"id":"2308.07567","submitter":"Mitsuhiro Nishida","authors":"Norihiro Iizuka, Mitsuhiro Nishida","title":"Krylov complexity in the IP matrix model II","comments":"35 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We continue the analysis of the Krylov complexity in the IP matrix model. In\na previous paper, for a fundamental operator, it was shown that at zero\ntemperature, the Krylov complexity oscillates and does not grow, but in the\ninfinite temperature limit, the Krylov complexity grows exponentially in time\nas $\\sim \\exp\\left( {\\mathcal{O}\\left( {\\sqrt{t}}\\right)} \\right)$. We study\nhow the Krylov complexity changes from a zero-temperature oscillation to an\ninfinite-temperature exponential growth. At low temperatures, the spectral\ndensity is approximated as collections of infinite Wigner semicircles. We\nshowed that this infinite collection of branch cuts yields linear growth to the\nLanczos coefficients and gives exponential growth of the Krylov complexity.\nThus the IP model for any nonzero temperature shows exponential growth for the\nKrylov complexity even though the Green function decays by a power law in time.\nWe also study the Lanczos coefficients and the Krylov complexity in the IOP\nmatrix model taking into account the $1/N^2$ corrections. There, the Lanczos\ncoefficients are constants and the Krylov complexity does not grow\nexponentially as expected.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:25:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Iizuka","Norihiro",""],["Nishida","Mitsuhiro",""]]}
{"id":"2308.07568","submitter":"Xingliang Tian","authors":"Shengbing Deng and Xingliang Tian","title":"Symmetry breaking of extremals for the high order\n  Caffarelli-Kohn-Nirenberg type inequalities","comments":"arXiv admin note: text overlap with arXiv:2308.06014","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Based on the work of Lin \\cite{Li86}, a new second-order\nCaffarelli-Kohn-Nirenberg type inequality will be established, namely\n  \\begin{equation*}\n  \\int_{\\mathbb{R}^N}|x|^{-\\beta}|\\mathrm{div} (|x|^{\\alpha}\\nabla u)|^2\n\\mathrm{d}x\n  \\geq \\mathcal{S}\\left(\\int_{\\mathbb{R}^N}|x|^{\\beta}|u|^{p^*_{\\alpha,\\beta}}\n\\mathrm{d}x\\right)^{\\frac{2}{p^*_{\\alpha,\\beta}}}, \\quad \\mbox{for all}\\quad\nu\\in C^\\infty_0(\\mathbb{R}^N),\n  \\end{equation*}\n  for some constant $\\mathcal{S}>0$, where\n  \\begin{align*}\n  N\\geq 5,\\quad \\alpha>2-N,\\quad \\alpha-2<\\beta\\leq \\frac{N}{N-2}\\alpha,\\quad\np^*_{\\alpha,\\beta}=\\frac{2(N+\\beta)}{N-4+2\\alpha-\\beta}.\n  \\end{align*}\n  We obtain a symmetry breaking conclusion: when $\\alpha>0$ and\n$\\beta_{\\mathrm{FS}}(\\alpha)<\\beta< \\frac{N}{N-2}\\alpha$ where\n$\\beta_{\\mathrm{FS}}(\\alpha):=\n  -N+\\sqrt{N^2+\\alpha^2+2(N-2)\\alpha}$, then the extremal function for the best\nconstant $\\mathcal{S}$, if it exists, is nonradial. This extends the works of\nFelli and Schneider \\cite{FS03}, Ao, DelaTorre and Gonz\\'{a}lez \\cite{ADG22} to\nsecond-order case.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:39:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deng","Shengbing",""],["Tian","Xingliang",""]]}
{"id":"2308.07569","submitter":"Devin Matthews","authors":"Avdhoot Datar, Devin A. Matthews","title":"Robust Tensor Hypercontraction of the Particle-Particle Ladder Term in\n  Equation-of-Motion Coupled Cluster Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One method of representing a high-rank tensor as a (hyper-)product of\nlower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et\nal. This strategy has been found to be useful for reducing the polynomial\nscaling of coupled-cluster methods by representation of a four dimensional\ntensor of electron-repulsion integrals in terms of five two-dimensional\nmatrices. Pierce et al. have already shown that the application of a robust\nform of THC to the particle-particle ladder term (PPL) reduces the cost of this\nterm in couple-cluster singles and doubles (CCSD) from $\\mathcal{O} (N^6)$ to\n$\\mathcal{O} (N^5)$ with negligible errors in energy with respect to the\ndensity-fitted variant. In this work we have implemented the least-squares\nvariant of THC (LS-THC) which does not require a non-linear tensor\nfactorization, including the robust form (R-LS-THC), for the calculation of the\nexcitation and electron attachment energies using equation-of-motion coupled\ncluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked\nthe effect of the R-LS-THC-PPL approximation on excitation energies using the\ncomprehensive QUEST database and the accuracy of electron attachment energies\nusing the NAB22 database. We find that errors on the order of 1 meV are\nachievable with a reduction in total calculation time of approximately\n$5\\times$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:41:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Datar","Avdhoot",""],["Matthews","Devin A.",""]]}
{"id":"2308.07570","submitter":"Fred Holt","authors":"Fred B. Holt","title":"On the counts of p-rough numbers","comments":"Preprint v2, 12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The p-rough numbers are those numbers all of whose prime factors are greater\nthan p. These are exactly those numbers left after Eratosthenes sieve has been\nadvanced from 2 through the prime p. Here we show that for fixed p there is a\nline of symmetry for the function Phi(x,p), and we introduce the function Delta\nPhi(x,p) which is the difference between Phi(x,p) and the line of symmetry.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:48:17 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 15:55:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Holt","Fred B.",""]]}
{"id":"2308.07571","submitter":"Anbang Yao","authors":"Dongqi Cai, Yangyuxuan Kang, Anbang Yao, Yurong Chen","title":"Ske2Grid: Skeleton-to-Grid Representation Learning for Action\n  Recognition","comments":"The paper of Ske2Grid is published at ICML 2023. Code and models are\n  available at https://github.com/OSVAI/Ske2Grid","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 Ske2Grid, a new representation learning framework for\nimproved skeleton-based action recognition. In Ske2Grid, we define a regular\nconvolution operation upon a novel grid representation of human skeleton, which\nis a compact image-like grid patch constructed and learned through three novel\ndesigns. Specifically, we propose a graph-node index transform (GIT) to\nconstruct a regular grid patch through assigning the nodes in the skeleton\ngraph one by one to the desired grid cells. To ensure that GIT is a bijection\nand enrich the expressiveness of the grid representation, an up-sampling\ntransform (UPT) is learned to interpolate the skeleton graph nodes for filling\nthe grid patch to the full. To resolve the problem when the one-step UPT is\naggressive and further exploit the representation capability of the grid patch\nwith increasing spatial size, a progressive learning strategy (PLS) is proposed\nwhich decouples the UPT into multiple steps and aligns them to multiple paired\nGITs through a compact cascaded design learned progressively. We construct\nnetworks upon prevailing graph convolution networks and conduct experiments on\nsix mainstream skeleton-based action recognition datasets. Experiments show\nthat our Ske2Grid significantly outperforms existing GCN-based solutions under\ndifferent benchmark settings, without bells and whistles. Code and models are\navailable at https://github.com/OSVAI/Ske2Grid\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:49:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cai","Dongqi",""],["Kang","Yangyuxuan",""],["Yao","Anbang",""],["Chen","Yurong",""]]}
{"id":"2308.07572","submitter":"Jianfu Zhang","authors":"Jian-Fu Zhang (Xiangtan), Siyao Xu (Princeton), Alex Lazarian\n  (Madison), Grzegorz Kowal (S\\~ao Paulo)","title":"Particle acceleration in self-driven turbulent reconnection","comments":"13 pages, 5 Figures. Accepted for publication in Journal of High\n  Energy Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph astro-ph.HE astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The theoretical prediction that magnetic reconnection spontaneously drives\nturbulence has been supported by magnetohydrodynamic (MHD) and kinetic\nsimulations. While reconnection with externally driven turbulence is accepted\nas an effective mechanism for particle acceleration, the acceleration during\nthe reconnection with self-driven turbulence is studied for the first time in\nthis work. By using high-resolution 3D MHD simulations of reconnection with\nself-generated turbulence, we inject test particles into the reconnection layer\nto study their acceleration process. We find that the energy gain of the\nparticles takes place when they bounce back and forth between converging\nturbulent magnetic fields. The particles can be efficiently accelerated in\nself-driven turbulent reconnection with the energy increase by about 3 orders\nof magnitude in the range of the box size. The acceleration proceeds when the\nparticle gyroradii become larger than the thickness of the reconnection layer.\nWe find that the acceleration in the direction perpendicular to the local\nmagnetic field dominates over that in the parallel direction. The energy\nspectrum of accelerated particles is time-dependent with a slope that evolves\ntoward -2.5. Our findings can have important implications for particle\nacceleration in high-energy astrophysical environments.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:58:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Jian-Fu","","Xiangtan"],["Xu","Siyao","","Princeton"],["Lazarian","Alex","","Madison"],["Kowal","Grzegorz","","S\u00e3o Paulo"]]}
{"id":"2308.07573","submitter":"Tomohiro Kikuchi Dr.","authors":"Tomohiro Kikuchi, Shouhei Hanaoka, Takahiro Nakao, Tomomi Takenaga,\n  Yukihiro Nomura, Harushi Mori, Takeharu Yoshikawa","title":"Synthetic data generation method for hybrid image-tabular data using two\n  generative adversarial networks","comments":"14 pages","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":"  The generation of synthetic medical records using generative adversarial\nnetworks (GANs) has become increasingly important for addressing privacy\nconcerns and promoting data sharing in the medical field. In this paper, we\npropose a novel method for generating synthetic hybrid medical records\nconsisting of chest X-ray images (CXRs) and structured tabular data (including\nanthropometric data and laboratory tests) using an auto-encoding GAN\n({\\alpha}GAN) and a conditional tabular GAN (CTGAN). Our approach involves\ntraining a {\\alpha}GAN model on a large public database (pDB) to reduce the\ndimensionality of CXRs. We then applied the trained encoder of the GAN model to\nthe images in original database (oDB) to obtain the latent vectors. These\nlatent vectors were combined with tabular data in oDB, and these joint data\nwere used to train the CTGAN model. We successfully generated diverse synthetic\nrecords of hybrid CXR and tabular data, maintaining correspondence between\nthem. We evaluated this synthetic database (sDB) through visual assessment,\ndistribution of interrecord distances, and classification tasks. Our evaluation\nresults showed that the sDB captured the features of the oDB while maintaining\nthe correspondence between the images and tabular data. Although our approach\nrelies on the availability of a large-scale pDB containing a substantial number\nof images with the same modality and imaging region as those in the oDB, this\nmethod has the potential for the public release of synthetic datasets without\ncompromising the secondary use of data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:04:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kikuchi","Tomohiro",""],["Hanaoka","Shouhei",""],["Nakao","Takahiro",""],["Takenaga","Tomomi",""],["Nomura","Yukihiro",""],["Mori","Harushi",""],["Yoshikawa","Takeharu",""]]}
{"id":"2308.07574","submitter":"Elena Litvinova","authors":"Elena Litvinova","title":"On the dynamical kernels of fermionic equations of motion in\n  strongly-correlated media","comments":"Article: 20 pages, 10 figures. Contribution to the EPJ A Topical\n  Collection devoted to the legacy of Peter Schuck","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th cond-mat.other nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-point fermionic propagators in strongly-correlated media are considered\nwith an emphasis on the dynamical interaction kernels of their equations of\nmotion (EOM). With the many-body Hamiltonian confined by a two-body\ninteraction, the EOMs for the two-point fermionic propagators acquire the Dyson\nform and, before taking any approximation, the interaction kernels decompose\ninto the static and dynamical (time-dependent) contributions. The latter\ntranslate to the energy-dependent and the former map to the energy-independent\nterms in the energy domain. We dwell particularly on the energy-dependent\nterms, which generate long-range correlations while making feedback on their\nshort-range static counterparts. The origin, forms, and various approximations\nfor the dynamical kernels of one-fermion and two-fermion propagators, most\nrelevant in the intermediate-coupling regime, are discussed. Applications to\nthe electromagnetic dipole response of $^{68,70}$Ni and low-energy quadrupole\nresponse of $^{114,116,124}$Sn are presented.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:05:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Litvinova","Elena",""]]}
{"id":"2308.07575","submitter":"Daechul Ahn","authors":"Daechul Ahn, Daneul Kim, Gwangmo Song, Seung Hwan Kim, Honglak Lee,\n  Dongyeop Kang, Jonghyun Choi","title":"Story Visualization by Online Text Augmentation with Context Memory","comments":"ICCV 2023, Project page: https://dcahn12.github.io/projects/CMOTA/","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":"  Story visualization (SV) is a challenging text-to-image generation task for\nthe difficulty of not only rendering visual details from the text descriptions\nbut also encoding a long-term context across multiple sentences. While prior\nefforts mostly focus on generating a semantically relevant image for each\nsentence, encoding a context spread across the given paragraph to generate\ncontextually convincing images (e.g., with a correct character or with a proper\nbackground of the scene) remains a challenge. To this end, we propose a novel\nmemory architecture for the Bi-directional Transformer framework with an online\ntext augmentation that generates multiple pseudo-descriptions as supplementary\nsupervision during training for better generalization to the language variation\nat inference. In extensive experiments on the two popular SV benchmarks, i.e.,\nthe Pororo-SV and Flintstones-SV, the proposed method significantly outperforms\nthe state of the arts in various metrics including FID, character F1, frame\naccuracy, BLEU-2/3, and R-precision with similar or less computational\ncomplexity.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:08:12 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 07:30:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ahn","Daechul",""],["Kim","Daneul",""],["Song","Gwangmo",""],["Kim","Seung Hwan",""],["Lee","Honglak",""],["Kang","Dongyeop",""],["Choi","Jonghyun",""]]}
{"id":"2308.07576","submitter":"Johannes Pfau","authors":"Johannes Pfau, Magy Seif El-Nasr","title":"On Video Game Balancing: Joining Player- and Data-Driven Analytics","comments":"25 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Balancing is, especially among players, a highly debated topic of video\ngames. Whether a game is sufficiently balanced greatly influences its\nreception, player satisfaction, churn rates and success. Yet, conceptions about\nthe definition of balance diverge across industry, academia and players, and\ndifferent understandings of designing balance can lead to worse player\nexperiences than actual imbalances. This work accumulates concepts of balancing\nvideo games from industry and academia and introduces a player-driven approach\nto optimize player experience and satisfaction. Using survey data from 680\nparticipants and empirically recorded data of over 4 million in-game fights of\nGuild Wars 2, we aggregate player opinions and requirements, contrast them to\nthe status quo and approach a democratized quantitative technique to\napproximate closer configurations of balance. We contribute a strategy of\nrefining balancing notions, a methodology of tailoring balance to the actual\nplayer base and point to an exemplary artifact that realizes this process.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:08:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pfau","Johannes",""],["El-Nasr","Magy Seif",""]]}
{"id":"2308.07577","submitter":"Qingyin Ma","authors":"Christophe Gouel, Qingyin Ma, John Stachurski","title":"Interest Rate Dynamics and Commodity Prices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH cs.NA math.NA math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Monetary conditions are frequently cited as a significant factor influencing\nfluctuations in commodity prices. However, the precise channels of transmission\nare less well identified. In this paper, we develop a unified theory to study\nthe impact of interest rates on commodity prices and the underlying mechanisms.\nTo that end, we extend the competitive storage model to accommodate\nstochastically evolving interest rates, and establish general conditions under\nwhich (i) a unique rational expectations equilibrium exists and can be\nefficiently computed, and (ii) interest rates are negatively correlated with\ncommodity prices. As an application, we quantify the impact of interest rates\non commodity prices through the speculative channel, namely, the role of\nspeculators in the physical market whose incentive to hold inventories is\ninfluenced by interest rate movements. Our findings demonstrate that real\ninterest rates have nontrivial and persistent negative effect on commodity\nprices, and the magnitude of the impact varies substantially under different\nmarket supply and interest rate regimes.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:10:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gouel","Christophe",""],["Ma","Qingyin",""],["Stachurski","John",""]]}
{"id":"2308.07578","submitter":"Kaiyuan Hu","authors":"Kaiyuan Hu, Haowen Yang, Yili Jin, Junhua Liu, Yongting Chen, Miao\n  Zhang, Fangxin Wang","title":"Understanding User Behavior in Volumetric Video Watching: Dataset,\n  Analysis and Prediction","comments":"Accepted by ACM MM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Volumetric video emerges as a new attractive video paradigm in recent years\nsince it provides an immersive and interactive 3D viewing experience with six\ndegree-of-freedom (DoF). Unlike traditional 2D or panoramic videos, volumetric\nvideos require dense point clouds, voxels, meshes, or huge neural models to\ndepict volumetric scenes, which results in a prohibitively high bandwidth\nburden for video delivery. Users' behavior analysis, especially the viewport\nand gaze analysis, then plays a significant role in prioritizing the content\nstreaming within users' viewport and degrading the remaining content to\nmaximize user QoE with limited bandwidth. Although understanding user behavior\nis crucial, to the best of our best knowledge, there are no available 3D\nvolumetric video viewing datasets containing fine-grained user interactivity\nfeatures, not to mention further analysis and behavior prediction. In this\npaper, we for the first time release a volumetric video viewing behavior\ndataset, with a large scale, multiple dimensions, and diverse conditions. We\nconduct an in-depth analysis to understand user behaviors when viewing\nvolumetric videos. Interesting findings on user viewport, gaze, and motion\npreference related to different videos and users are revealed. We finally\ndesign a transformer-based viewport prediction model that fuses the features of\nboth gaze and motion, which is able to achieve high accuracy at various\nconditions. Our prediction model is expected to further benefit volumetric\nvideo streaming optimization. Our dataset, along with the corresponding\nvisualization tools is accessible at\nhttps://cuhksz-inml.github.io/user-behavior-in-vv-watching/\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:33:48 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 14:12:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Kaiyuan",""],["Yang","Haowen",""],["Jin","Yili",""],["Liu","Junhua",""],["Chen","Yongting",""],["Zhang","Miao",""],["Wang","Fangxin",""]]}
{"id":"2308.07579","submitter":"Elena Fuchs","authors":"Jillian Eddy, Elena Fuchs, Matthew Litman, Daniel Martin, Nico Tripeny","title":"Connectivity of Markoff mod-p graphs and maximal divisors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Markoff mod-$p$ graphs are conjectured to be connected for all primes $p$. In\nthis paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm\nthe conjecture for all $p > 3.448\\cdot10^{392}$. We also provide a method that\nquickly verifies connectivity for many primes below this bound. In our study of\nMarkoff mod-$p$ graphs we introduce the notion of \\emph{maximal divisors} of a\nnumber. We prove sharp asymptotic and explicit upper bounds on the number of\nmaximal divisors, which ultimately improves the Markoff graph $p$-bound by\nroughly 140 orders of magnitude as compared with an approach using all\ndivisors.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:34:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Eddy","Jillian",""],["Fuchs","Elena",""],["Litman","Matthew",""],["Martin","Daniel",""],["Tripeny","Nico",""]]}
{"id":"2308.07580","submitter":"Bo Lin","authors":"Bo Lin, Shoshanna Saxe, Timothy C. Y. Chan","title":"AutoLTS: Automating Cycling Stress Assessment via Contrastive Learning\n  and Spatial Post-processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cycling stress assessment, which quantifies cyclists' perceived stress\nimposed by the built environment and motor traffics, increasingly informs\ncycling infrastructure planning and cycling route recommendation. However,\ncurrently calculating cycling stress is slow and data-intensive, which hinders\nits broader application. In this paper, We propose a deep learning framework to\nsupport accurate, fast, and large-scale cycling stress assessments for urban\nroad networks based on street-view images. Our framework features i) a\ncontrastive learning approach that leverages the ordinal relationship among\ncycling stress labels, and ii) a post-processing technique that enforces\nspatial smoothness into our predictions. On a dataset of 39,153 road segments\ncollected in Toronto, Canada, our results demonstrate the effectiveness of our\ndeep learning framework and the value of using image data for cycling stress\nassessment in the absence of high-quality road geometry and motor traffic data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:51:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lin","Bo",""],["Saxe","Shoshanna",""],["Chan","Timothy C. Y.",""]]}
{"id":"2308.07581","submitter":"Ang Li","authors":"Fei Hua, Meng Wang, Gushu Li, Bo Peng, Chenxu Liu, Muqing Zheng,\n  Samuel Stein, Yufei Ding, Eddy Z. Zhang, Travis S. Humble, Ang Li","title":"QASMTrans: A QASM based Quantum Transpiler Framework for NISQ Devices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The success of a quantum algorithm hinges on the ability to orchestrate a\nsuccessful application induction. Detrimental overheads in mapping general\nquantum circuits to physically implementable routines can be the deciding\nfactor between a successful and erroneous circuit induction. In QASMTrans, we\nfocus on the problem of rapid circuit transpilation. Transpilation plays a\ncrucial role in converting high-level, machine-agnostic circuits into\nmachine-specific circuits constrained by physical topology and supported gate\nsets. The efficiency of transpilation continues to be a substantial bottleneck,\nespecially when dealing with larger circuits requiring high degrees of\ninter-qubit interaction. QASMTrans is a high-performance C++ quantum transpiler\nframework that demonstrates up to 369X speedups compared to the commonly used\nQiskit transpiler. We observe speedups on large dense circuits such as\nuccsd_n24 and qft_n320 which require O(10^6) gates. QASMTrans successfully\ntranspiles the aforementioned circuits in 69s and 31s, whilst Qiskit exceeded\nan hour of transpilation time. With QASMTrans providing transpiled circuits in\na fraction of the time of prior transpilers, potential design space\nexploration, and heuristic-based transpiler design becomes substantially more\ntractable. QASMTrans is released at http://github.com/pnnl/qasmtrans.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:51:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hua","Fei",""],["Wang","Meng",""],["Li","Gushu",""],["Peng","Bo",""],["Liu","Chenxu",""],["Zheng","Muqing",""],["Stein","Samuel",""],["Ding","Yufei",""],["Zhang","Eddy Z.",""],["Humble","Travis S.",""],["Li","Ang",""]]}
{"id":"2308.07582","submitter":"Feng Chu","authors":"F. Chu, S. J. Langendorf, T. Byvank, A. L. LaJoie, D. A. Endrizzi, J.\n  Olson, and K. J. McCollam","title":"Characterization of fast magnetosonic waves driven by interaction\n  between magnetic fields and compact toroids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetosonic waves are low-frequency, linearly polarized magnetohydrodynamic\n(MHD) waves that can be excited in any electrically conducting fluid permeated\nby a magnetic field. They are commonly found in space, responsible for many\nwell-known features, such as heating of the solar corona and acceleration of\nenergetic electrons in Earth's inner magnetosphere. In this work, we present\nobservations of magnetosonic waves driven by injecting compact toroid (CT)\nplasmas into a static Helmholtz magnetic field at the Big Red Ball (BRB)\nFacility at Wisconsin Plasma Physics Laboratory (WiPPL). We first identify the\nwave modes by comparing the experimental results with the MHD theory, and then\nstudy how factors such as the background magnetic field affect the wave\nproperties. Since this experiment is part of an ongoing effort of forming a\ntarget plasma with tangled magnetic fields as a novel fusion fuel for\nmagneto-inertial fusion (MIF, aka magnetized target fusion), we also discuss a\nfuture possible path of forming the target plasma based on our current results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:00:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chu","F.",""],["Langendorf","S. J.",""],["Byvank","T.",""],["LaJoie","A. L.",""],["Endrizzi","D. A.",""],["Olson","J.",""],["McCollam","K. J.",""]]}
{"id":"2308.07583","submitter":"Peng Gao","authors":"Ruixue Zhu, Sizheng Zheng, Xiaomei Li, Tao Wang, Congbing Tan,\n  Tiancheng Yu, Zhetong Liu, Xinqiang Wang, Jiangyu Li, Jie Wang and Peng Gao","title":"Atomic-Scale Tracking Phase Transition Dynamics of\n  Berezinskii-Kosterlitz-Thouless Polar Vortex-Antivortex","comments":"19 pages and 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":"  Particle-like topologies, such as vortex-antivortex (V-AV) pairs, have\ngarnered significant attention in the field of condensed matter. However, the\ndetailed phase transition dynamics of V-AV pairs, as exemplified by\nself-annihilation, motion, and dissociation, have yet to be verified in real\nspace due to the lack of suitable experimental techniques. Here, we employ\npolar V-AV pairs as a model system and track their transition pathways at\natomic resolution with the aid of in situ (scanning) transmission electron\nmicroscopy and phase field simulations. We demonstrate the absence of a\nBerezinskii-Kosterlitz-Thouless phase transition between the room-temperature\nquasi-long-range ordered ground phase and the high-temperature disordered\nphase. Instead, we observe polarization suppression in bound V-AV pairs as the\ntemperature increases. Furthermore, electric fields can promote the vortex and\nantivortex to approach each other and annihilate near the interface. The\nelucidated intermediate dynamic behaviors of polar V-AV pairs under thermal-\nand electrical-fields lay the foundation for their potential applications in\nelectronic devices. Moreover, the dynamic behaviors revealed at atomic scale\nprovide us new insights into understanding topological phase of matter and\ntheir topological phase transitions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:01:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhu","Ruixue",""],["Zheng","Sizheng",""],["Li","Xiaomei",""],["Wang","Tao",""],["Tan","Congbing",""],["Yu","Tiancheng",""],["Liu","Zhetong",""],["Wang","Xinqiang",""],["Li","Jiangyu",""],["Wang","Jie",""],["Gao","Peng",""]]}
{"id":"2308.07584","submitter":"Xingyong Zhang","authors":"Ping Yang, Xingyong Zhang","title":"Existence of solutions for a poly-Laplacian system involving\n  concave-convex nonlinearity on locally finite graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the existence of two nontrivial solutions for a poly-Laplacian\nsystem involving concave-convex nonlinearity and parameters with Dirichlet\nboundary value condition on the locally finite graph. By using the mountain\npass theorem and Ekeland's variational principle, we obtain that system has at\nleast one non-semi-trivial solution of positive energy and one non-semi-trivial\nsolution of negative energy, respectively. We also obtain an estimate about\nsemi-trivial solutions. Moreover, by using a result in [10] which is based on\nthe fibering maps and the method of Nehari manifold, we obtain the existence of\nground state solution to the single equation corresponding to poly-Laplacian\nsystem. Especially, we present the concrete range of parameters in all of\nresults.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:15:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Ping",""],["Zhang","Xingyong",""]]}
{"id":"2308.07585","submitter":"Serhii Favorov","authors":"Sergii Favorov","title":"Generalized Fourier quasicrystals and almost periodic sets","comments":"10 pages, 18 references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Let $\\mu$ be a positive measure on the real line with locally finite support\n$\\Lambda$ and integer masses such that its Fourier transform in the sense of\ndistributions is a purely point measure. An explicit form is found for an\nentire almost periodic function with a set of zeros $\\Lambda$, taking\nmultiplicities into account. A necessary and sufficient condition for the\nexponential growth of this function is also found.\n  Our constructions are based on the properties of almost periodic sets on the\nline. In particular, in the article we find a simple representation of such\nsets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:16:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Favorov","Sergii",""]]}
{"id":"2308.07586","submitter":"Zachary Sexton","authors":"Zachary A. Sexton, Andrew R. Hudson, Jessica E. Herrmann, Dan J.\n  Shiwarski, Jonathan Pham, Jason M. Szafron, Sean M. Wu, Mark Skylar-Scott,\n  Adam W. Feinberg, Alison Marsden","title":"Rapid model-guided design of organ-scale synthetic vasculature for\n  biomanufacturing","comments":"58 pages (19 main and 39 supplement pages), 4 main figures, 9\n  supplement figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Our ability to produce human-scale bio-manufactured organs is critically\nlimited by the need for vascularization and perfusion. For tissues of variable\nsize and shape, including arbitrarily complex geometries, designing and\nprinting vasculature capable of adequate perfusion has posed a major hurdle.\nHere, we introduce a model-driven design pipeline combining accelerated\noptimization methods for fast synthetic vascular tree generation and\ncomputational hemodynamics models. We demonstrate rapid generation, simulation,\nand 3D printing of synthetic vasculature in complex geometries, from small\ntissue constructs to organ scale networks. We introduce key algorithmic\nadvances that all together accelerate synthetic vascular generation by more\nthan 230-fold compared to standard methods and enable their use in arbitrarily\ncomplex shapes through localized implicit functions. Furthermore, we provide\ntechniques for joining vascular trees into watertight networks suitable for\nhemodynamic CFD and 3D fabrication. We demonstrate that organ-scale vascular\nnetwork models can be generated in silico within minutes and can be used to\nperfuse engineered and anatomic models including a bioreactor, annulus,\nbi-ventricular heart, and gyrus. We further show that this flexible pipeline\ncan be applied to two common modes of bioprinting with free-form reversible\nembedding of suspended hydrogels and writing into soft matter. Our synthetic\nvascular tree generation pipeline enables rapid, scalable vascular model\ngeneration and fluid analysis for bio-manufactured tissues necessary for future\nscale up and production.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:16:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sexton","Zachary A.",""],["Hudson","Andrew R.",""],["Herrmann","Jessica E.",""],["Shiwarski","Dan J.",""],["Pham","Jonathan",""],["Szafron","Jason M.",""],["Wu","Sean M.",""],["Skylar-Scott","Mark",""],["Feinberg","Adam W.",""],["Marsden","Alison",""]]}
{"id":"2308.07587","submitter":"Bhupesh Kumar","authors":"Bhupesh Kumar, Sebastian Schulz, and Patrick Sebbah","title":"Broadband, Single wavelength, Continuous Spectral Control in a\n  Polymer-Based Solid-State Random Laser","comments":"7 pages, 4 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a study on partially pumped, single wavelength\nrandom lasing with tunability controlled by temperature in a solid-state random\nlaser based on DCM\n(4-dicyanomethylene-2-methyl-6-(p-dimethylaminostyryl)-4H-pyran) doped PMMA\n(polymethyl methacrylate) dye. By carefully shaping the spatial profile of the\npump, we achieve low-threshold, single-mode random lasing with excellent\nrejection of side lobes. Notably, we observe that varying the temperature\ninduces changes in the refractive index of the PMMA-DCM layer, resulting in a\nblue-shift of the lasing wavelength. Moreover, we demonstrate continuous\ntunability of the lasing wavelength over an impressive bandwidth of 8 nm.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:19:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kumar","Bhupesh",""],["Schulz","Sebastian",""],["Sebbah","Patrick",""]]}
{"id":"2308.07588","submitter":"Nikita Zhivotovskiy","authors":"Dirk van der Hoeven, Nikita Zhivotovskiy, Nicol\\`o Cesa-Bianchi","title":"High-Probability Risk Bounds via Sequential Predictors","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IT math.IT math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Online learning methods yield sequential regret bounds under minimal\nassumptions and provide in-expectation risk bounds for statistical learning.\nHowever, despite the apparent advantage of online guarantees over their\nstatistical counterparts, recent findings indicate that in many important\ncases, regret bounds may not guarantee tight high-probability risk bounds in\nthe statistical setting. In this work we show that online to batch conversions\napplied to general online learning algorithms can bypass this limitation. Via a\ngeneral second-order correction to the loss function defining the regret, we\nobtain nearly optimal high-probability risk bounds for several classical\nstatistical estimation problems, such as discrete distribution estimation,\nlinear regression, logistic regression, and conditional density estimation. Our\nanalysis relies on the fact that many online learning algorithms are improper,\nas they are not restricted to use predictors from a given reference class. The\nimproper nature of our estimators enables significant improvements in the\ndependencies on various problem parameters. Finally, we discuss some\ncomputational advantages of our sequential algorithms over their existing batch\ncounterparts.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:19:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["van der Hoeven","Dirk",""],["Zhivotovskiy","Nikita",""],["Cesa-Bianchi","Nicol\u00f2",""]]}
{"id":"2308.07589","submitter":"Haripada Sau","authors":"Joseph A. Ball and Haripada Sau","title":"Dilation and Model Theory for Pairs of Commuting Contractions","comments":"150 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This manuscript is an effort to extend the Sz.-Nagy--Foias dilation and model\ntheory for a single contraction to the case of commuting pair of contractions.\nFundamental to the Sz.-Nagy--Foias model theory is the functional model for the\nminimal isometric dilation. The first step in our approach for the pair case is\nto obtain further information, beyond that in the original paper of Ando,\nconcerning the structure of the plethora of minimal commuting isometric lifts.\nWe exhibit an explicit simple example of two minimal isometric lifts of a\ncommuting contractive pair that are not unitarily equivalent -- see Chapter 5.\nWe provide two constructive new proofs of Ando's Dilation Theorem, each of\nwhich leads to a new functional-model representation for such a lift -- see\nTheorem 4.3.8 and Remark 4.5.7. The construction leads to the identification of\na set of additional free parameters which serves to classify the distinct\nunitary-equivalence classes of minimal Ando lifts. However this lack of\nuniqueness limits the utility of such minimal Ando lifts for the construction\nof a functional model for a commuting contractive pair. We identify an\nintermediate type of lift, called pseudo-commuting contractive lift, which\npaves the way for a functional model. In the model form, the Sz.-Nagy--Foias\ncharacteristic function is augmented by what is called the fundamental operator\npair, together with a canonical pair of commuting unitary operators, so that\nthe augmented collection, called the characteristic triple, is a complete\nunitary invariant for a commuting contractive pair. There is also a notion of\nadmissible triple as the substitute for a purely contractive analytic function\nin the Sz.-Nagy--Foias theory, from which one can construct a functional model\ncommuting contractive pair having its characteristic triple coinciding with the\noriginal admissible triple in an appropriate sense.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:20:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ball","Joseph A.",""],["Sau","Haripada",""]]}
{"id":"2308.07590","submitter":"Tianhao Xu","authors":"Zizhang Wu, Chenxin Yuan, Hongyang Wei, Fan Song, Tianhao Xu","title":"ADD: An Automatic Desensitization Fisheye Dataset for Autonomous Driving","comments":null,"journal-ref":"Engineering Applications of Artificial Intelligence 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous driving systems require many images for analyzing the surrounding\nenvironment. However, there is fewer data protection for private information\namong these captured images, such as pedestrian faces or vehicle license\nplates, which has become a significant issue. In this paper, in response to the\ncall for data security laws and regulations and based on the advantages of\nlarge Field of View(FoV) of the fisheye camera, we build the first Autopilot\nDesensitization Dataset, called ADD, and formulate the first\ndeep-learning-based image desensitization framework, to promote the study of\nimage desensitization in autonomous driving scenarios. The compiled dataset\nconsists of 650K images, including different face and vehicle license plate\ninformation captured by the surround-view fisheye camera. It covers various\nautonomous driving scenarios, including diverse facial characteristics and\nlicense plate colors. Then, we propose an efficient multitask desensitization\nnetwork called DesCenterNet as a benchmark on the ADD dataset, which can\nperform face and vehicle license plate detection and desensitization tasks.\nBased on ADD, we further provide an evaluation criterion for desensitization\nperformance, and extensive comparison experiments have verified the\neffectiveness and superiority of our method on image desensitization.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:21:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wu","Zizhang",""],["Yuan","Chenxin",""],["Wei","Hongyang",""],["Song","Fan",""],["Xu","Tianhao",""]]}
{"id":"2308.07591","submitter":"Ali Devran Kara","authors":"Ali Devran Kara and Serdar Yuksel","title":"Q-Learning for Continuous State and Action MDPs under Average Cost\n  Criteria","comments":"3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For infinite-horizon average-cost criterion problems, we present several\napproximation and reinforcement learning results for Markov Decision Processes\nwith standard Borel spaces. Toward this end, (i) we first provide a\ndiscretization based approximation method for fully observed Markov Decision\nProcesses (MDPs) with continuous spaces under average cost criteria, and we\nprovide error bounds for the approximations when the dynamics are only weakly\ncontinuous under certain ergodicity assumptions. In particular, we relax the\ntotal variation condition given in prior work to weak continuity as well as\nWasserstein continuity conditions. (ii) We provide synchronous and asynchronous\nQ-learning algorithms for continuous spaces via quantization, and establish\ntheir convergence. (iii) We show that the convergence is to the optimal Q\nvalues of the finite approximate models constructed via quantization. Our\nQ-learning convergence results and their convergence to near optimality are new\nfor continuous spaces, and the proof method is new even for finite spaces, to\nour knowledge.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:24:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kara","Ali Devran",""],["Yuksel","Serdar",""]]}
{"id":"2308.07592","submitter":"Tianhao Xu","authors":"Zizhang Wu, Yuanzhu Gan, Tianhao Xu, Fan Wang","title":"Graph-Segmenter: Graph Transformer with Boundary-aware Attention for\n  Semantic Segmentation","comments":null,"journal-ref":"Front. Comput. Sci. 2023","doi":"10.1007/s11704-023-2563-5","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The transformer-based semantic segmentation approaches, which divide the\nimage into different regions by sliding windows and model the relation inside\neach window, have achieved outstanding success. However, since the relation\nmodeling between windows was not the primary emphasis of previous work, it was\nnot fully utilized. To address this issue, we propose a Graph-Segmenter,\nincluding a Graph Transformer and a Boundary-aware Attention module, which is\nan effective network for simultaneously modeling the more profound relation\nbetween windows in a global view and various pixels inside each window as a\nlocal one, and for substantial low-cost boundary adjustment. Specifically, we\ntreat every window and pixel inside the window as nodes to construct graphs for\nboth views and devise the Graph Transformer. The introduced boundary-aware\nattention module optimizes the edge information of the target objects by\nmodeling the relationship between the pixel on the object's edge. Extensive\nexperiments on three widely used semantic segmentation datasets (Cityscapes,\nADE-20k and PASCAL Context) demonstrate that our proposed network, a Graph\nTransformer with Boundary-aware Attention, can achieve state-of-the-art\nsegmentation performance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:30:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wu","Zizhang",""],["Gan","Yuanzhu",""],["Xu","Tianhao",""],["Wang","Fan",""]]}
{"id":"2308.07593","submitter":"JeongHun Yeo","authors":"Jeong Hun Yeo, Minsu Kim, Jeongsoo Choi, Dae Hoe Kim, and Yong Man Ro","title":"AKVSR: Audio Knowledge Empowered Visual Speech Recognition by\n  Compressing Audio Knowledge of a Pretrained Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM eess.AS eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual Speech Recognition (VSR) is the task of predicting spoken words from\nsilent lip movements. VSR is regarded as a challenging task because of the\ninsufficient information on lip movements. In this paper, we propose an Audio\nKnowledge empowered Visual Speech Recognition framework (AKVSR) to complement\nthe insufficient speech information of visual modality by using audio modality.\nDifferent from the previous methods, the proposed AKVSR 1) utilizes rich audio\nknowledge encoded by a large-scale pretrained audio model, 2) saves the\nlinguistic information of audio knowledge in compact audio memory by discarding\nthe non-linguistic information from the audio through quantization, and 3)\nincludes Audio Bridging Module which can find the best-matched audio features\nfrom the compact audio memory, which makes our training possible without audio\ninputs, once after the compact audio memory is composed. We validate the\neffectiveness of the proposed method through extensive experiments, and achieve\nnew state-of-the-art performances on the widely-used datasets, LRS2 and LRS3.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:38:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yeo","Jeong Hun",""],["Kim","Minsu",""],["Choi","Jeongsoo",""],["Kim","Dae Hoe",""],["Ro","Yong Man",""]]}
{"id":"2308.07594","submitter":"Akhil S","authors":"Satyadev Nandakumar, Akhil S, Prateek Vishnoi","title":"Effective Continued Fraction Dimension versus Effective Hausdorff\n  Dimension of Reals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish that constructive continued fraction dimension originally\ndefined using $s$-gales is robust, but surprisingly, that the effective\ncontinued fraction dimension and effective (base-$b$) Hausdorff dimension of\nthe same real can be unequal in general.\n  We initially provide an equivalent characterization of continued fraction\ndimension using Kolmogorov complexity. In the process, we construct an optimal\nlower semi-computable $s$-gale for continued fractions. We also prove new\nbounds on the Lebesgue measure of continued fraction cylinders, which may be of\nindependent interest.\n  We apply these bounds to reveal an unexpected behavior of continued fraction\ndimension. It is known that feasible dimension is invariant with respect to\nbase conversion. We also know that Martin-L\\\"of randomness and computable\nrandomness are invariant not only with respect to base conversion, but also\nwith respect to the continued fraction representation. In contrast, for any $0\n< \\varepsilon < 0.5$, we prove the existence of a real whose effective\nHausdorff dimension is less than $\\varepsilon$, but whose effective continued\nfraction dimension is greater than or equal to $0.5$. This phenomenon is\nrelated to the ``non-faithfulness'' of certain families of covers, investigated\nby Peres and Torbin and by Albeverio, Ivanenko, Lebid and Torbin.\n  We also establish that for any real, the constructive Hausdorff dimension is\nat most its effective continued fraction dimension.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:40:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nandakumar","Satyadev",""],["S","Akhil",""],["Vishnoi","Prateek",""]]}
{"id":"2308.07595","submitter":"Ming Cheng","authors":"Ming Cheng, Weiqing Wang, Xiaoyi Qin, Yuke Lin, Ning Jiang, Guoqing\n  Zhao, Ming Li","title":"The DKU-MSXF Diarization System for the VoxCeleb Speaker Recognition\n  Challenge 2023","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper describes the DKU-MSXF submission to track 4 of the VoxCeleb\nSpeaker Recognition Challenge 2023 (VoxSRC-23). Our system pipeline contains\nvoice activity detection, clustering-based diarization, overlapped speech\ndetection, and target-speaker voice activity detection, where each procedure\nhas a fused output from 3 sub-models. Finally, we fuse different\nclustering-based and TSVAD-based diarization systems using DOVER-Lap and\nachieve the 4.30% diarization error rate (DER), which ranks first place on\ntrack 4 of the challenge leaderboard.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:50:07 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 01:54:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cheng","Ming",""],["Wang","Weiqing",""],["Qin","Xiaoyi",""],["Lin","Yuke",""],["Jiang","Ning",""],["Zhao","Guoqing",""],["Li","Ming",""]]}
{"id":"2308.07596","submitter":"Jiefeng Liu","authors":"Lamei Yuan and Jiefeng Liu","title":"Twisting theory, relative Rota-Baxter type operators and\n  $L_\\infty$-algebras on Lie conformal algebras","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Based on Nijenhuis-Richardson bracket and bidegree on the cohomology complex\nfor a Lie conformal algebra, we develop a twisting theory of Lie conformal\nalgebras. By using derived bracket constructions, we construct\n$L_\\infty$-algebras from (quasi-)twilled Lie conformal algebras. And we show\nthat the result of the twisting by a $\\mathbb{C}[\\partial]$-module homomorphism\non a (quasi-)twilled Lie conformal algebra is also a (quasi-)twilled Lie\nconformal algebra if and only if the $\\mathbb{C}[\\partial]$-module homomorphism\nis a Maurer-Cartan element of the $L_\\infty$-algebra. In particular, we show\nthat relative Rota-Baxter type operators on Lie conformal algebras are\nMaurer-Cartan elements. Besides, we propose a new algebraic structure, called\nNS-Lie conformal algebras, that is closely related to twisted relative\nRota-Baxter operators and Nijenhuis operators on Lie conformal algebras. As an\napplication of twisting theory, we give the cohomology of twisted relative\nRota-Baxter operators and study their deformations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:54:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yuan","Lamei",""],["Liu","Jiefeng",""]]}
{"id":"2308.07597","submitter":"Neil Chada","authors":"Neil K. Chada, Petteri Piiroinen, Lassi Roininen","title":"A Statistical Framework and Analysis for Perfect Radar Pulse Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.AP stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Perfect radar pulse compression coding is a potential emerging field which\naims at providing rigorous analysis and fundamental limit radar experiments. It\nis based on finding non-trivial pulse codes, which we can make statistically\nequivalent, to the radar experiments carried out with elementary pulses of some\nshape. A common engineering-based radar experiment design, regarding\npulse-compression, often omits the rigorous theory and mathematical\nlimitations. In this work our aim is to develop a mathematical theory which\ncoincides with understanding the radar experiment in terms of the theory of\ncomparison of statistical experiments. We review and generalize some properties\nof the It\\^{o} measure. We estimate the unknown i.e. the structure function in\nthe context of Bayesian statistical inverse problems. We study the posterior\nfor generalized $d$-dimensional inverse problems, where we consider both\nreal-valued and complex-valued inputs for posteriori analysis. Finally this is\nthen extended to the infinite dimensional setting, where our analysis suggests\nthe underlying posterior is non-Gaussian.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:56:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chada","Neil K.",""],["Piiroinen","Petteri",""],["Roininen","Lassi",""]]}
{"id":"2308.07598","submitter":"Alessandro Sestini","authors":"William Ahlberg, Alessandro Sestini, Konrad Tollmar, Linus Gissl\\'en","title":"Generating Personas for Games with Multimodal Adversarial Imitation\n  Learning","comments":"Published in CoG 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reinforcement learning has been widely successful in producing agents capable\nof playing games at a human level. However, this requires complex reward\nengineering, and the agent's resulting policy is often unpredictable. Going\nbeyond reinforcement learning is necessary to model a wide range of human\nplaystyles, which can be difficult to represent with a reward function. This\npaper presents a novel imitation learning approach to generate multiple persona\npolicies for playtesting. Multimodal Generative Adversarial Imitation Learning\n(MultiGAIL) uses an auxiliary input parameter to learn distinct personas using\na single-agent model. MultiGAIL is based on generative adversarial imitation\nlearning and uses multiple discriminators as reward models, inferring the\nenvironment reward by comparing the agent and distinct expert policies. The\nreward from each discriminator is weighted according to the auxiliary input.\nOur experimental analysis demonstrates the effectiveness of our technique in\ntwo environments with continuous and discrete action spaces.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 06:58:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ahlberg","William",""],["Sestini","Alessandro",""],["Tollmar","Konrad",""],["Gissl\u00e9n","Linus",""]]}
{"id":"2308.07599","submitter":"Kaito Ito","authors":"Kaito Ito, Kenji Kashima","title":"Entropic Model Predictive Optimal Transport for Underactuated Linear\n  Systems","comments":"Published in IEEE Control Systems Letters","journal-ref":null,"doi":"10.1109/LCSYS.2023.3288474","report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This letter investigates dynamical optimal transport of underactuated linear\nsystems over an infinite time horizon. In our previous work, we proposed to\nintegrate model predictive control and the celebrated Sinkhorn algorithm to\nperform efficient dynamical transport of agents. However, the proposed method\nrequires the invertibility of input matrices, which severely limits its\napplicability. To resolve this issue, we extend the method to (possibly\nunderactuated) controllable linear systems. In addition, we ensure the\nconvergence properties of the method for general controllable linear systems.\nThe effectiveness of the proposed method is demonstrated by a numerical\nexample.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:03:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ito","Kaito",""],["Kashima","Kenji",""]]}
{"id":"2308.07600","submitter":"Badari Narayana Rao Dr","authors":"Badari Narayana Rao (1), Shintaro Yasui (2), Hiroko Yokota (3 and 4)\n  ((1) Center for Frontier Science, Chiba University, (2) Institute of\n  Innovative Research, Tokyo Institute of Technology, (3) Department of\n  Physics, Chiba University, (4) Department of Materials Science and\n  Engineering, Tokyo Institute of Technology)","title":"Impact of Oxygen Pressure on Ferroelectric Stability of La-doped Hafnia\n  Grown by PLD","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thin films of HfO2 doped with 4% La were fabricated on LSMO/STO (100)\nsubstrates using pulsed laser deposition. The stability of the ferroelectric\northorhombic phase in the hafnia films was investigated with respect to varying\noxygen pressure during deposition. X-ray diffraction and X-ray photoelectron\nspectroscopy measurements were carried out to analyze the structure and\ncomposition of the films and correlated with their ferroelectric properties.\nSurprisingly, the ferroelectricity of the hafnia films showed a dependence on\noxygen pressure during deposition of LSMO bottom electrode as well. The reason\nfor this dependence is discussed in terms of the active role of non-lattice\noxygen in the ferroelectric switching of hafnia.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:06:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Rao","Badari Narayana","","3 and 4"],["Yasui","Shintaro","","3 and 4"],["Yokota","Hiroko","","3 and 4"]]}
{"id":"2308.07601","submitter":"Long Trieu","authors":"Hai Long Trieu, Song Kiet Bui, Tan Minh Tran, Van Khanh Tran, Hai An\n  Nguyen","title":"VBD-MT Chinese-Vietnamese Translation Systems for VLSP 2022","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 our systems participated in the VLSP 2022 machine translation\nshared task. In the shared task this year, we participated in both translation\ntasks, i.e., Chinese-Vietnamese and Vietnamese-Chinese translations. We build\nour systems based on the neural-based Transformer model with the powerful\nmultilingual denoising pre-trained model mBART. The systems are enhanced by a\nsampling method for backtranslation, which leverage large scale available\nmonolingual data. Additionally, several other methods are applied to improve\nthe translation quality including ensembling and postprocessing. We achieve\n38.9 BLEU on ChineseVietnamese and 38.0 BLEU on VietnameseChinese on the public\ntest sets, which outperform several strong baselines.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:10:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Trieu","Hai Long",""],["Bui","Song Kiet",""],["Tran","Tan Minh",""],["Tran","Van Khanh",""],["Nguyen","Hai An",""]]}
{"id":"2308.07602","submitter":"Shikun Zhang","authors":"Shikun Zhang, Guofeng Zhang","title":"Attraction Domain Analysis for Steady States of Markovian Open Quantum\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article concerns the attraction domain analysis for steady states in\nMarkovian open quantum systems. The central question is proposed as: given a\nsteady state, which part of the state space of density operators does it\nattract and which part does it not attract? We answer this question by\npresenting necessary and sufficient conditions that determine, for any steady\nstate and initial state, whether the latter belongs to the attraction domain of\nthe former. Moreover, we show that steady states without uniqueness in the set\nof density operators have attraction domains with measure zero under some\ntranslation invariant and locally finite measures. Finally, an example\nregarding an open Heisenberg XXZ spin chain is presented.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:10:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Shikun",""],["Zhang","Guofeng",""]]}
{"id":"2308.07603","submitter":"Luca Bruno","authors":"L. Bruno, A. Botteon, T. Shimwell, V. Cuciti, F. de Gasperin, G.\n  Brunetti, D. Dallacasa, F. Gastaldello, M. Rossetti, R. J. van Weeren, T.\n  Venturi, S. A. Russo, G. Taffoni, R. Cassano, N. Biava, G. Lusetti, A.\n  Bonafede, S. Ghizzardi, S. De Grandi","title":"A three-component giant radio halo: the puzzling case of the galaxy\n  cluster Abell 2142","comments":"24 pages (including Appendix), 15 Figures (plus 4 Figures in\n  Appendix), Accepted for publication by A&A","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":"  Turbulence introduced into the intra-cluster medium (ICM) through cluster\nmerger events transfers energy to non-thermal components, and can trigger the\nformation of diffuse synchrotron radio sources. Typical diffuse sources in the\nforms of giant radio halos and mini-halos are found in merging and relaxed cool\ncore galaxy clusters, respectively. On the other hand, recent observations have\nrevealed an increasing complexity of the non-thermal phenomenology. Abell 2142\n(A2142) is a mildly disturbed cluster that exhibits uncommon thermal and\nnon-thermal properties. It is known to host a hybrid halo consisting of two\ncomponents (H1 and H2), namely a mini-halo-like and an enigmatic elongated\nradio halo-like structure. We aim to investigate the properties, origin, and\nconnections of each component. We present deep LOFAR observations of A2142 in\nthe frequency ranges $30-78$ MHz and $120-168$ MHz. With complementary\nmulti-frequency radio and X-ray data, we analyse the radio spectral properties\nof the halo and assess the connection between the non-thermal and thermal\ncomponents of the ICM. We detected a third radio component (H3), which extends\nover the cluster volume on scales $\\sim 2$ Mpc, embeds H1 and H2, and has a\nmorphology that roughly follows the thermal ICM distribution. The radio\nspectral index is moderately steep in H1 ($\\alpha=1.09\\pm 0.02$) and H2\n($\\alpha=1.15\\pm 0.02$), but is steeper ($\\alpha=1.57\\pm 0.20$) in H3. The\nanalysis of the thermal and non-thermal properties allowed us to discuss\npossible formation scenarios for each radio component. Turbulence from sloshing\nmotions of low-entropy gas on different scales may be responsible for the\norigin of H1 and H2. We classified H3 as a giant ultra-steep spectrum radio\nhalo, which could trace the residual activity from an old energetic merger\nand/or inefficient turbulent re-acceleration induced by ongoing minor mergers.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:11:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bruno","L.",""],["Botteon","A.",""],["Shimwell","T.",""],["Cuciti","V.",""],["de Gasperin","F.",""],["Brunetti","G.",""],["Dallacasa","D.",""],["Gastaldello","F.",""],["Rossetti","M.",""],["van Weeren","R. J.",""],["Venturi","T.",""],["Russo","S. A.",""],["Taffoni","G.",""],["Cassano","R.",""],["Biava","N.",""],["Lusetti","G.",""],["Bonafede","A.",""],["Ghizzardi","S.",""],["De Grandi","S.",""]]}
{"id":"2308.07604","submitter":"Katia Matcheva","authors":"Roy T. Forestano, Konstantin T. Matchev, Katia Matcheva, Eyup B. Unlu","title":"Searching for Novel Chemistry in Exoplanetary Atmospheres using Machine\n  Learning for Anomaly Detection","comments":"Submitted to AAS Journals, 30 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM cs.LG physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The next generation of telescopes will yield a substantial increase in the\navailability of high-resolution spectroscopic data for thousands of exoplanets.\nThe sheer volume of data and number of planets to be analyzed greatly motivate\nthe development of new, fast and efficient methods for flagging interesting\nplanets for reobservation and detailed analysis. We advocate the application of\nmachine learning (ML) techniques for anomaly (novelty) detection to exoplanet\ntransit spectra, with the goal of identifying planets with unusual chemical\ncomposition and even searching for unknown biosignatures. We successfully\ndemonstrate the feasibility of two popular anomaly detection methods (Local\nOutlier Factor and One Class Support Vector Machine) on a large public database\nof synthetic spectra. We consider several test cases, each with different\nlevels of instrumental noise. In each case, we use ROC curves to quantify and\ncompare the performance of the two ML techniques.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:19:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Forestano","Roy T.",""],["Matchev","Konstantin T.",""],["Matcheva","Katia",""],["Unlu","Eyup B.",""]]}
{"id":"2308.07605","submitter":"Zhengwentai Sun","authors":"Zhengwentai Sun, Yanghong Zhou, Honghong He, P. Y. Mok","title":"SGDiff: A Style Guided Diffusion Model for Fashion Synthesis","comments":"Accepted by ACM MM'23","journal-ref":null,"doi":"10.1145/3581783.3613806","report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper reports on the development of \\textbf{a novel style guided\ndiffusion model (SGDiff)} which overcomes certain weaknesses inherent in\nexisting models for image synthesis. The proposed SGDiff combines image\nmodality with a pretrained text-to-image diffusion model to facilitate creative\nfashion image synthesis. It addresses the limitations of text-to-image\ndiffusion models by incorporating supplementary style guidance, substantially\nreducing training costs, and overcoming the difficulties of controlling\nsynthesized styles with text-only inputs. This paper also introduces a new\ndataset -- SG-Fashion, specifically designed for fashion image synthesis\napplications, offering high-resolution images and an extensive range of garment\ncategories. By means of comprehensive ablation study, we examine the\napplication of classifier-free guidance to a variety of conditions and validate\nthe effectiveness of the proposed model for generating fashion images of the\ndesired categories, product attributes, and styles. The contributions of this\npaper include a novel classifier-free guidance method for multi-modal feature\nfusion, a comprehensive dataset for fashion image synthesis application, a\nthorough investigation on conditioned text-to-image synthesis, and valuable\ninsights for future research in the text-to-image synthesis domain. The code\nand dataset are available at: \\url{https://github.com/taited/SGDiff}.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:20:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sun","Zhengwentai",""],["Zhou","Yanghong",""],["He","Honghong",""],["Mok","P. Y.",""]]}
{"id":"2308.07606","submitter":"He Weiyi","authors":"Weng Chenran, He Weiyi, Zhao Wenjing","title":"Counterfactual time series analysis for the air pollution during the\n  outbreak of COVID-19 in Wuhan","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Environmental issues are becoming one of the main topics of concern for\nsociety, and the quality of air is closely linked to people's lives. Previous\nstudies have examined the effects of abrupt interventions on changes in air\npollution. For example, researchers used an interrupted time series design to\nquantify the impact of the 1990 Dublin coal ban; and a regression discontinuity\nto determine the arbitrary spatial impact of the Huaihe River policy in China.\nAn important feature of each of these studies is that they investigated abrupt\nand localized changes over relatively short time spans (the Dublin coal ban)\nand spatial scales (the Huaihe policy). Due to the abrupt nature of these\ninterventions, defining a hypothetical experiment in these studies is\nstraightforward. In response to the novel coronavirus outbreak, China\nimplemented 'the largest quarantine in human history' in Wuhan on January 23,\n2020. Similar measures were implemented in other Chinese cities. Since then,\nthe movement of people and associated production and consumption activities\nhave been significantly reduced. This provides us with an unprecedented\nopportunity to estimate the changes in air pollution brought about by this\nsudden \"silent\" move. We speculate that the initiative will lead to a\nsignificant reduction in regional air pollution. Thus, we performed\ncounterfactual time series analysis on Wuhan air quality data from 2017-2022\nbased on three models, SARIMA, LSTM and XGBOOST, and compared the excellence of\ndifferent models. Finally, we conclude that 'silent' measures will\nsignificantly reduce air pollution. Using this conclusion to further\ninvestigate the extent of air pollution reduction will help the country to\nbetter designate environmental policies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:20:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chenran","Weng",""],["Weiyi","He",""],["Wenjing","Zhao",""]]}
{"id":"2308.07607","submitter":"Meichen Song","authors":"Jiaqiao Hu, Meichen Song, Michael C. Fu","title":"Quantile Optimization via Multiple Timescale Local Search for Black-box\n  Functions","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":"  We consider quantile optimization of black-box functions that are estimated\nwith noise. We propose two new iterative three-timescale local search\nalgorithms. The first algorithm uses an appropriately modified\nfinite-difference-based gradient estimator that requires $2d$ + 1 samples of\nthe black-box function per iteration of the algorithm, where $d$ is the number\nof decision variables (dimension of the input vector). For higher-dimensional\nproblems, this algorithm may not be practical if the black-box function\nestimates are expensive. The second algorithm employs a\nsimultaneous-perturbation-based gradient estimator that uses only three samples\nfor each iteration regardless of problem dimension. Under appropriate\nconditions, we show the almost sure convergence of both algorithms. In\naddition, for the class of strongly convex functions, we further establish\ntheir (finite-time) convergence rate through a novel fixed-point argument.\nSimulation experiments indicate that the algorithms work well on a variety of\ntest problems and compare well with recently proposed alternative methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:34:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hu","Jiaqiao",""],["Song","Meichen",""],["Fu","Michael C.",""]]}
{"id":"2308.07608","submitter":"Liying Kang","authors":"Zhenyu Ni, Jing Wang, Liying Kang","title":"Extremal problems for disjoint graphs","comments":"23 pages. arXiv admin note: text overlap with arXiv:2306.16747","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a simple graph $F$, let $\\mathrm{EX}(n, F)$ and $\\mathrm{EX_{sp}}(n,F)$\nbe the set of graphs with the maximum number of edges and the set of graphs\nwith the maximum spectral radius in an $n$-vertex graph without any copy of the\ngraph $F$, respectively. Let $F$ be a graph with\n$\\mathrm{ex}(n,F)=e(T_{n,r})+O(1)$. In this paper, we show that\n$\\mathrm{EX_{sp}}(n,kF)\\subseteq \\mathrm{EX}(n,kF)$ for sufficiently large $n$.\nThis generalizes a result of Wang, Kang and Xue [J. Comb. Theory, Ser. B,\n159(2023) 20-41]. We also determine the extremal graphs of $kF$ in term of the\nextremal graphs of $F$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:34:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ni","Zhenyu",""],["Wang","Jing",""],["Kang","Liying",""]]}
{"id":"2308.07609","submitter":"Miloslav Znojil","authors":"Miloslav Znojil","title":"Three alternative model-building strategies using quasi-Hermitian\n  time-dependent observables","comments":"18 pp","journal-ref":"Symmetry 15 (2023) 1596 (13pp)","doi":"10.3390/sym15081596","report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A $(K+1)-$plet of non-Hermitian and time-dependent operators (say,\n$\\Lambda_j(t)$, $j=0,1,\\ldots,K$) can be interpreted as the set of observables\ncharacterizing a unitary quantum system. What is required is the existence of a\nself-adjoint and, in general, time-dependent operator (say, $\\Theta(t)$ called\ninner product metric) making the operators quasi-Hermitian,\n$\\Lambda_j^\\dagger(t)\\Theta(t)=\\Theta(t)\\Lambda_j(t)$. The theory (called\nnon-Hermitian interaction-picture, NIP) requires a separate description of the\nevolution of the states $\\psi(t)$ (realized, via Schr\\\"{o}dinger-type equation,\nby a generator, say, $G(t)$) and of the observables themselves (a different\ngenerator (say, $\\Sigma(t)(t)$) occurs in the related non-Hermitian\nHeisenberg-type equation). Every $\\Lambda_j(t)$ (and, in particular,\nHamiltonian $H(t)=\\Lambda_0(t)$) appears isospectral to its hypothetical\nisospectral and self-adjoint (but, by assumption, prohibitively\nuser-unfriendly) avatar $\\lambda_j(t)=\\Omega(t)\\Lambda_j(t)\\Omega^{-1}(t)$ with\n$\\Omega^\\dagger(t)\\Omega(t)=\\Theta(t)$. In our paper the key role played by\nidentity $H(t)=G(t)+\\Sigma(t)$ is shown to imply that there exist just three\nalternative meaningful implementations of the NIP approach, viz., ``number\none'' (a ``dynamical'' strategy based on the knowledge of $H(t)$), ``number\ntwo'' (a ``kinematical'' one, based on the Coriolis force $\\Sigma(t)$) and\n``number three'' (in the literature, such a construction based on $G(t)$ is\nmost popular but, paradoxically, it is also most complicated).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:35:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Znojil","Miloslav",""]]}
{"id":"2308.07610","submitter":"Yilun Liu","authors":"Yilun Liu, Shimin Tao, Weibin Meng, Jingyu Wang, Wenbing Ma, Yanqing\n  Zhao, Yuhang Chen, Hao Yang, Yanfei Jiang, Xun Chen","title":"LogPrompt: Prompt Engineering Towards Zero-Shot and Interpretable Log\n  Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automated log analysis is crucial in modern software-intensive systems for\nensuring reliability and resilience throughout software maintenance and\nengineering life cycles. Existing methods perform tasks such as log parsing and\nlog anomaly detection by providing a single prediction value without\ninterpretation. However, given the increasing volume of system events, the\nlimited interpretability of analysis results hinders analysts' trust and their\nability to take appropriate actions. Moreover, these methods require\nsubstantial in-domain training data, and their performance declines sharply (by\nup to 62.5%) in online scenarios involving unseen logs from new domains, a\ncommon occurrence due to rapid software updates. In this paper, we propose\nLogPrompt, a novel zero-shot and interpretable log analysis approach. LogPrompt\nemploys large language models (LLMs) to perform zero-shot log analysis tasks\nvia a suite of advanced prompt strategies tailored for log tasks, which\nenhances LLMs' performance by up to 107.5% compared with simple prompts.\nExperiments on nine publicly available evaluation datasets across two tasks\ndemonstrate that LogPrompt, despite using no training data, outperforms\nexisting approaches trained on thousands of logs by up to around 50%. We also\nconduct a human evaluation of LogPrompt's interpretability, with six\npractitioners possessing over 10 years of experience, who highly rated the\ngenerated content in terms of usefulness and readability (averagely 4.42/5).\nLogPrompt also exhibits remarkable compatibility with open-source and\nsmaller-scale LLMs, making it flexible for practical deployment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:40:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Yilun",""],["Tao","Shimin",""],["Meng","Weibin",""],["Wang","Jingyu",""],["Ma","Wenbing",""],["Zhao","Yanqing",""],["Chen","Yuhang",""],["Yang","Hao",""],["Jiang","Yanfei",""],["Chen","Xun",""]]}
{"id":"2308.07611","submitter":"Po-Jui Lu","authors":"Po-Jui Lu, Benjamin Odry, Muhamed Barakovic, Matthias Weigel, Robin\n  Sandk\\\"uhler, Reza Rahmanzadeh, Xinjie Chen, Mario Ocampo-Pineda, Jens Kuhle,\n  Ludwig Kappos, Philippe Cattin, Cristina Granziera","title":"GAMER-MRIL identifies Disability-Related Brain Changes in Multiple\n  Sclerosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objective: Identifying disability-related brain changes is important for\nmultiple sclerosis (MS) patients. Currently, there is no clear understanding\nabout which pathological features drive disability in single MS patients. In\nthis work, we propose a novel comprehensive approach, GAMER-MRIL, leveraging\nwhole-brain quantitative MRI (qMRI), convolutional neural network (CNN), and an\ninterpretability method from classifying MS patients with severe disability to\ninvestigating relevant pathological brain changes. Methods:\nOne-hundred-sixty-six MS patients underwent 3T MRI acquisitions. qMRI\ninformative of microstructural brain properties was reconstructed, including\nquantitative T1 (qT1), myelin water fraction (MWF), and neurite density index\n(NDI). To fully utilize the qMRI, GAMER-MRIL extended a gated-attention-based\nCNN (GAMER-MRI), which was developed to select patch-based qMRI important for a\ngiven task/question, to the whole-brain image. To find out disability-related\nbrain regions, GAMER-MRIL modified a structure-aware interpretability method,\nLayer-wise Relevance Propagation (LRP), to incorporate qMRI. Results: The test\nperformance was AUC=0.885. qT1 was the most sensitive measure related to\ndisability, followed by NDI. The proposed LRP approach obtained more\nspecifically relevant regions than other interpretability methods, including\nthe saliency map, the integrated gradients, and the original LRP. The relevant\nregions included the corticospinal tract, where average qT1 and NDI\nsignificantly correlated with patients' disability scores ($\\rho$=-0.37 and\n0.44). Conclusion: These results demonstrated that GAMER-MRIL can classify\npatients with severe disability using qMRI and subsequently identify brain\nregions potentially important to the integrity of the mobile function.\nSignificance: GAMER-MRIL holds promise for developing biomarkers and increasing\nclinicians' trust in NN.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:43:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lu","Po-Jui",""],["Odry","Benjamin",""],["Barakovic","Muhamed",""],["Weigel","Matthias",""],["Sandk\u00fchler","Robin",""],["Rahmanzadeh","Reza",""],["Chen","Xinjie",""],["Ocampo-Pineda","Mario",""],["Kuhle","Jens",""],["Kappos","Ludwig",""],["Cattin","Philippe",""],["Granziera","Cristina",""]]}
{"id":"2308.07612","submitter":"Ryota Iijima","authors":"Hitoshi Kiya, Ryota Iijima, Teru Nagamori","title":"Block-Wise Encryption for Reliable Vision Transformer models","comments":"7 figures, 3 tables. arXiv admin note: substantial text overlap with\n  arXiv:2207.05366","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article presents block-wise image encryption for the vision transformer\nand its applications. Perceptual image encryption for deep learning enables us\nnot only to protect the visual information of plain images but to also embed\nunique features controlled with a key into images and models. However, when\nusing conventional perceptual encryption methods, the performance of models is\ndegraded due to the influence of encryption. In this paper, we focus on\nblock-wise encryption for the vision transformer, and we introduce three\napplications: privacy-preserving image classification, access control, and the\ncombined use of federated learning and encrypted images. Our scheme can have\nthe same performance as models without any encryption, and it does not require\nany network modification. It also allows us to easily update the secret key. In\nexperiments, the effectiveness of the scheme is demonstrated in terms of\nperformance degradation and access control on the CIFAR10 and CIFAR-100\ndatasets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:45:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kiya","Hitoshi",""],["Iijima","Ryota",""],["Nagamori","Teru",""]]}
{"id":"2308.07613","submitter":"Yao Wang","authors":"Yao Wang","title":"On the lower bound of the Heisenberg uncertainty product in the\n  Boltzmann states","comments":null,"journal-ref":"EPL,143 (2023) 20001","doi":"10.1209/0295-5075/ace64f","report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The uncertainty principle lies at the heart of quantum mechanics, as it\ndescribes the fundamental trade-off between the precision of position and\nmomentum measurements. In this work, we study the quantum particle in the\nBoltzmann states and derive a refined lower bound on the product of {\\Delta}x\nand {\\Delta}p. Our new bound is expressed in terms of the ratio between\n{\\Delta}x and the thermal de Broglie wavelength, and provides a valuable tool\nfor characterizing thermodynamic precision. We apply our results to the\nBrownian oscillator system, where we compare our new bound with the well-known\nHeisenberg uncertainty principle. Our analysis shows that our new bound offers\na more precise measure of the thermodynamic limits of precision.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:50:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Yao",""]]}
{"id":"2308.07614","submitter":"Bingpu Zhou","authors":"Sen Ding, Dazhe Zhao, Yongyao Chen, Ziyi Dai, Qian Zhao, Yibo Gao,\n  Junwen Zhong, Jianyi Luo, Bingpu Zhou","title":"Single channel based interference-free and self-powered human-machine\n  interactive interface using eigenfrequency-dominant mechanism","comments":"35 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent development of wearable devices is revolutionizing the way of\nhuman-machine interaction (HMI). Nowadays, an interactive interface that\ncarries more embedded information is desired to fulfil the increasing demand in\nera of Internet of Things. However, present approach normally relies on sensor\narrays for memory expansion, which inevitably brings the concern of wiring\ncomplexity, signal differentiation, power consumption, and miniaturization.\nHerein, a one-channel based self-powered HMI interface, which uses the\neigenfrequency of magnetized micropillar (MMP) as identification mechanism, is\nreported. When manually vibrated, the inherent recovery of the MMP caused a\ndamped oscillation that generates current signals because of Faraday's Law of\ninduction. The time-to-frequency conversion explores the MMP-related\neigenfrequency, which provides a specific solution to allocate diverse commands\nin an interference-free behavior even with one electric channel. A cylindrical\ncantilever model was built to regulate the MMP eigenfrequencies via precisely\ndesigning the dimensional parameters and material properties. We show that\nusing one device and two electrodes, high-capacity HMI interface can be\nrealized when the MMPs with different eigenfrequencies have been integrated.\nThis study provides the reference value to design the future HMI system\nespecially for situations that require a more intuitive and intelligent\ncommunication experience with high-memory demand.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:51:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ding","Sen",""],["Zhao","Dazhe",""],["Chen","Yongyao",""],["Dai","Ziyi",""],["Zhao","Qian",""],["Gao","Yibo",""],["Zhong","Junwen",""],["Luo","Jianyi",""],["Zhou","Bingpu",""]]}
{"id":"2308.07615","submitter":"Mihai Cristian P\\^irvu","authors":"Alina Marcu, Mihai Pirvu, Dragos Costea, Emanuela Haller, Emil\n  Slusanschi, Ahmed Nabil Belbachir, Rahul Sukthankar, Marius Leordeanu","title":"Self-supervised Hypergraphs for Learning Multiple World Interpretations","comments":"Accepted in ICCV 2023 Workshops","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method for learning multiple scene representations given a small\nlabeled set, by exploiting the relationships between such representations in\nthe form of a multi-task hypergraph. We also show how we can use the hypergraph\nto improve a powerful pretrained VisTransformer model without any additional\nlabeled data. In our hypergraph, each node is an interpretation layer (e.g.,\ndepth or segmentation) of the scene. Within each hyperedge, one or several\ninput nodes predict the layer at the output node. Thus, each node could be an\ninput node in some hyperedges and an output node in others. In this way,\nmultiple paths can reach the same node, to form ensembles from which we obtain\nrobust pseudolabels, which allow self-supervised learning in the hypergraph. We\ntest different ensemble models and different types of hyperedges and show\nsuperior performance to other multi-task graph models in the field. We also\nintroduce Dronescapes, a large video dataset captured with UAVs in different\ncomplex real-world scenes, with multiple representations, suitable for\nmulti-task learning.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:51:53 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:48:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Marcu","Alina",""],["Pirvu","Mihai",""],["Costea","Dragos",""],["Haller","Emanuela",""],["Slusanschi","Emil",""],["Belbachir","Ahmed Nabil",""],["Sukthankar","Rahul",""],["Leordeanu","Marius",""]]}
{"id":"2308.07616","submitter":"Jia-Rui Lin","authors":"Can Jiang, Xiong Liang, Yu-Cheng Zhou, Yong Tian, Shengli Xu, Jia-Rui\n  Lin, Zhiliang Ma, Shiji Yang, Hao Zhou","title":"A Multilayer Perceptron-based Fast Sunlight Assessment for the\n  Conceptual Design of Residential Neighborhoods under Chinese Policy","comments":null,"journal-ref":"Building and Environment, 2023","doi":"10.1016/j.buildenv.2023.110739","report-no":null,"categories":"cs.LG cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In Chinese building codes, it is required that residential buildings receive\na minimum number of hours of natural, direct sunlight on a specified winter\nday, which represents the worst sunlight condition in a year. This requirement\nis a prerequisite for obtaining a building permit during the conceptual design\nof a residential project. Thus, officially sanctioned software is usually used\nto assess the sunlight performance of buildings. These software programs\npredict sunlight hours based on repeated shading calculations, which is\ntime-consuming. This paper proposed a multilayer perceptron-based method, a\none-stage prediction approach, which outputs a shading time interval caused by\nthe inputted cuboid-form building. The sunlight hours of a site can be obtained\nby calculating the union of the sunlight time intervals (complement of shading\ntime interval) of all the buildings. Three numerical experiments, i.e.,\nhorizontal level and slope analysis, and simulation-based optimization are\ncarried out; the results show that the method reduces the computation time to\n1/84~1/50 with 96.5%~98% accuracies. A residential neighborhood layout planning\nplug-in for Rhino 7/Grasshopper is also developed based on the proposed model.\nThis paper indicates that deep learning techniques can be adopted to accelerate\nsunlight hour simulations at the conceptual design phase.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:53:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Can",""],["Liang","Xiong",""],["Zhou","Yu-Cheng",""],["Tian","Yong",""],["Xu","Shengli",""],["Lin","Jia-Rui",""],["Ma","Zhiliang",""],["Yang","Shiji",""],["Zhou","Hao",""]]}
{"id":"2308.07617","submitter":"Mohaddese Shams Nejati","authors":"M. Shams Nejati, M.H. Vahidinia","title":"Jackiw-Teitelboim Gravity Generates Horndeski via Disformal\n  Transformations","comments":"13 pages, 1 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 show that the most general two-dimensional dilaton gravity theory with\nsecond-order field equations, which includes Horndeski and Kinetic Gravity\nBraiding families, may be obtained from the Jackiw-Teitelboim (JT) gravity\nthrough a general disformal transformation, up to boundary terms. We also show\nthat this most general family of theories is closed under generic disformal\ntransformations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:53:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nejati","M. Shams",""],["Vahidinia","M. H.",""]]}
{"id":"2308.07618","submitter":"Guangyuan Liu","authors":"Guangyuan Liu, Hongyang Du, Dusit Niyato, Jiawen Kang, Zehui Xiong,\n  and Boon Hee Soong","title":"Vision-based Semantic Communications for Metaverse Services: A Contest\n  Theoretic Approach","comments":"6 pages,7figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.AI cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The popularity of Metaverse as an entertainment, social, and work platform\nhas led to a great need for seamless avatar integration in the virtual world.\nIn Metaverse, avatars must be updated and rendered to reflect users' behaviour.\nAchieving real-time synchronization between the virtual bilocation and the user\nis complex, placing high demands on the Metaverse Service Provider (MSP)'s\nrendering resource allocation scheme. To tackle this issue, we propose a\nsemantic communication framework that leverages contest theory to model the\ninteractions between users and MSPs and determine optimal resource allocation\nfor each user. To reduce the consumption of network resources in wireless\ntransmission, we use the semantic communication technique to reduce the amount\nof data to be transmitted. Under our simulation settings, the encoded semantic\ndata only contains 51 bytes of skeleton coordinates instead of the image size\nof 8.243 megabytes. Moreover, we implement Deep Q-Network to optimize reward\nsettings for maximum performance and efficient resource allocation. With the\noptimal reward setting, users are incentivized to select their respective\nsuitable uploading frequency, reducing down-sampling loss due to rendering\nresource constraints by 66.076\\% compared with the traditional average\ndistribution method. The framework provides a novel solution to resource\nallocation for avatar association in VR environments, ensuring a smooth and\nimmersive experience for all users.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:56:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Guangyuan",""],["Du","Hongyang",""],["Niyato","Dusit",""],["Kang","Jiawen",""],["Xiong","Zehui",""],["Soong","Boon Hee",""]]}
{"id":"2308.07619","submitter":"Nikita Belousov","authors":"N. Belousov, S. Derkachov, S. Kharchev, S. Khoroshkin","title":"Baxter operators in Ruijsenaars hyperbolic system IV. Coupling constant\n  reflection symmetry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.MP math.QA math.RT nlin.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and study a new family of commuting Baxter operators in the\nRuijsenaars hyperbolic system, different from that considered by us earlier.\nUsing a degeneration of Rains integral identity we verify the commutativity\nbetween the two families of Baxter operators and explore this fact for the\nproof of the coupling constant symmetry of the wave function. We also establish\na connection between new Baxter operators and Noumi-Sano difference operators.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:05:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Belousov","N.",""],["Derkachov","S.",""],["Kharchev","S.",""],["Khoroshkin","S.",""]]}
{"id":"2308.07620","submitter":"Ting-Jung Kuo","authors":"Ting-Jung Kuo","title":"Sharp results for spherical metric on flat tori with conical angle\n  6$\\pi$ at two symmetric points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A conjecture about the existence or nonexistence of solutions to the\ncurvature equation (1.1) defined on a rectangle torus $E_{\\tau},$ $\\tau\\in\ni\\mathbb{R}_{>0}$ with four conical singularties at its symmetric points is\nproposed in [3]. See Conjecture 1. For the purposes to understand this problem,\nin this paper, we study the following equation: \\begin{equation} \\Delta\nu+e^{u}=8\\pi(\\delta_{0}+\\delta_{\\frac{\\omega_{k}}{2}})\\in E_{\\tau},\n\\tau\\in\\mathbb{H}\\, (0.1) \\end{equation} where $\\frac{\\omega_{k}}{2}$ is one of\nthe half periods of $E_{\\tau}$. Among others, we prove that the existence of\n\\textit{non-even family of solutions} (see the definition in Section 1) is\nequivalent to the existence of solutions for the equation with single conical\nsingularity: \\[\\Delta u+e^{u}=8\\pi\\delta_{0}\\in\nE_{\\tau}\\,\\tau\\in\\mathbb{H}\\text{.}\\] Consequently, equation (0.1) with\n$\\tau\\in i\\mathbb{R}_{>0}$ does not have any non-even family of solutions for\nall $k=1,2,3$. As an application, we completely understand the solution\nstructure of the equation (0.1) for rectangle torus and give a confirmative\nanswer for this conjecture in this three cases. See Corollary 1.4.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:06:05 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 06:23:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kuo","Ting-Jung",""]]}
{"id":"2308.07621","submitter":"Shuaishuai Xue","authors":"Yingnan Sun and Shuaishuai Xue","title":"Quasi-Periodic solutions of Two Dimensional Completely Resonant\n  Reversible Schr\\\"odinger d Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce an abstract KAM (Kolmogorov-Arnold-Moser) theorem for infinite\ndimensional reversible Schr\\\"odinger systems. Using this KAM theorem together\nwith partial Birkhoff normal form method, we find the existence of\nquasi-periodic solutions for a class of completely resonant reversible coupled\nnonlinear Schr\\\"odinger d systems on two dimensional torus.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:10:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sun","Yingnan",""],["Xue","Shuaishuai",""]]}
{"id":"2308.07622","submitter":"Jialing Zou","authors":"Jialing Zou, Jiahao Mei, Guangze Ye, Tianyu Huai, Qiwei Shen, Daoguo\n  Dong","title":"EMID: An Emotional Aligned Dataset in Audio-Visual Modality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we propose Emotionally paired Music and Image Dataset (EMID),\na novel dataset designed for the emotional matching of music and images, to\nfacilitate auditory-visual cross-modal tasks such as generation and retrieval.\nUnlike existing approaches that primarily focus on semantic correlations or\nroughly divided emotional relations, EMID emphasizes the significance of\nemotional consistency between music and images using an advanced 13-dimension\nemotional model. By incorporating emotional alignment into the dataset, it aims\nto establish pairs that closely align with human perceptual understanding,\nthereby raising the performance of auditory-visual cross-modal tasks. We also\ndesign a supplemental module named EMI-Adapter to optimize existing cross-modal\nalignment methods. To validate the effectiveness of the EMID, we conduct a\npsychological experiment, which has demonstrated that considering the emotional\nrelationship between the two modalities effectively improves the accuracy of\nmatching in abstract perspective. This research lays the foundation for future\ncross-modal research in domains such as psychotherapy and contributes to\nadvancing the understanding and utilization of emotions in cross-modal\nalignment. The EMID dataset is available at https://github.com/ecnu-aigc/EMID.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:13:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zou","Jialing",""],["Mei","Jiahao",""],["Ye","Guangze",""],["Huai","Tianyu",""],["Shen","Qiwei",""],["Dong","Daoguo",""]]}
{"id":"2308.07623","submitter":"Daniel van Huyssteen Ph.D.","authors":"Daniel van Huyssteen and Felipe Lopez Rivarola and Guillermo Etse and\n  Paul Steinmann","title":"On mesh coarsening procedures for the virtual element method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the context of adaptive remeshing, the virtual element method provides\nsignificant advantages over the finite element method. The attractive features\nof the virtual element method, such as the permission of arbitrary element\ngeometries, and the seamless permission of 'hanging' nodes, have inspired many\nworks concerning error estimation and adaptivity. However, these works have\nprimarily focused on adaptive refinement techniques with little attention paid\nto adaptive coarsening (i.e. de-refinement) techniques that are required for\nthe development of fully adaptive remeshing procedures. In this work novel\nindicators are proposed for the identification of patches/clusters of elements\nto be coarsened, along with a novel procedure to perform the coarsening. The\nindicators are computed over prospective patches of elements rather than on\nindividual elements to identify the most suitable combinations of elements to\ncoarsen. The coarsening procedure is robust and suitable for meshes of\nstructured and unstructured/Voronoi elements. Numerical results demonstrate the\nhigh degree of efficacy of the proposed coarsening procedures and sensible mesh\nevolution during the coarsening process. It is demonstrated that critical mesh\ngeometries, such as non-convex corners and holes, are preserved during\ncoarsening, and that meshes remain fine in regions of interest to engineers,\nsuch as near singularities.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:18:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["van Huyssteen","Daniel",""],["Rivarola","Felipe Lopez",""],["Etse","Guillermo",""],["Steinmann","Paul",""]]}
{"id":"2308.07624","submitter":"Yuyao Zhang","authors":"Qi Wu, Yuyao Zhang, Marawan Elbatel","title":"Self-Prompting Large Vision Models for Few-Shot Medical Image\n  Segmentation","comments":"8.5 pages + 2 pages of supplementary materials + 2 pages of\n  references, 3 figures, submitted to 5th MICCAI Workshop on Domain Adaptation\n  and Representation Transfer (DART)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in large foundation models have shown promising potential\nin the medical industry due to their flexible prompting capability. One such\nmodel, the Segment Anything Model (SAM), a prompt-driven segmentation model,\nhas shown remarkable performance improvements, surpassing state-of-the-art\napproaches in medical image segmentation. However, existing methods primarily\nrely on tuning strategies that require extensive data or prior prompts tailored\nto the specific task, making it particularly challenging when only a limited\nnumber of data samples are available. In this paper, we propose a novel\nperspective on self-prompting in medical vision applications. Specifically, we\nharness the embedding space of SAM to prompt itself through a simple yet\neffective linear pixel-wise classifier. By preserving the encoding capabilities\nof the large model, the contextual information from its decoder, and leveraging\nits interactive promptability, we achieve competitive results on multiple\ndatasets (i.e. improvement of more than 15% compared to fine-tuning the mask\ndecoder using a few images).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:20:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wu","Qi",""],["Zhang","Yuyao",""],["Elbatel","Marawan",""]]}
{"id":"2308.07625","submitter":"Zhuoer Xu","authors":"Zhuoer Xu, Zhangxuan Gu, Jianping Zhang, Shiwen Cui, Changhua Meng,\n  Weiqiang Wang","title":"Backpropagation Path Search On Adversarial Transferability","comments":"Accepted by ICCV2023","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":"  Deep neural networks are vulnerable to adversarial examples, dictating the\nimperativeness to test the model's robustness before deployment. Transfer-based\nattackers craft adversarial examples against surrogate models and transfer them\nto victim models deployed in the black-box situation. To enhance the\nadversarial transferability, structure-based attackers adjust the\nbackpropagation path to avoid the attack from overfitting the surrogate model.\nHowever, existing structure-based attackers fail to explore the convolution\nmodule in CNNs and modify the backpropagation graph heuristically, leading to\nlimited effectiveness. In this paper, we propose backPropagation pAth Search\n(PAS), solving the aforementioned two problems. We first propose SkipConv to\nadjust the backpropagation path of convolution by structural\nreparameterization. To overcome the drawback of heuristically designed\nbackpropagation paths, we further construct a DAG-based search space, utilize\none-step approximation for path evaluation and employ Bayesian Optimization to\nsearch for the optimal path. We conduct comprehensive experiments in a wide\nrange of transfer settings, showing that PAS improves the attack success rate\nby a huge margin for both normally trained and defense models.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:21:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xu","Zhuoer",""],["Gu","Zhangxuan",""],["Zhang","Jianping",""],["Cui","Shiwen",""],["Meng","Changhua",""],["Wang","Weiqiang",""]]}
{"id":"2308.07626","submitter":"Tanya Araujo","authors":"Tanya Ara\\'ujo and Paulo Barbosa","title":"Reconstructing cryptocurrency processes via Markov chains","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growing attention on cryptocurrencies has led to increasing research on\ndigital stock markets. Approaches and tools usually applied to characterize\nstandard stocks have been applied to the digital ones. Among these tools is the\nidentification of processes of market fluctuations. Being interesting\nstochastic processes, the usual statistical methods are appropriate tools for\ntheir reconstruction. There, besides chance, the description of a behavioural\ncomponent shall be present whenever a deterministic pattern is ever found.\nMarkov approaches are at the leading edge of this endeavour. In this paper,\nMarkov chains of orders one to eight are considered as a way to forecast the\ndynamics of three major cryptocurrencies. It is accomplished using an empirical\nbasis of intra-day returns. Besides forecasting, we investigate the existence\nof eventual long-memory components in each of those stochastic processes.\nResults show that predictions obtained from using the empirical probabilities\nare better than random choices.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:21:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ara\u00fajo","Tanya",""],["Barbosa","Paulo",""]]}
{"id":"2308.07627","submitter":"Chenwei Wang","authors":"Chenwei Wang, Jifang Pei, Yulin Huang, Jianyu Yang","title":"A deep deformable residual learning network for SAR images segmentation","comments":null,"journal-ref":null,"doi":"10.1109/RadarConf2147009.2021.9455217","report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reliable automatic target segmentation in Synthetic Aperture Radar (SAR)\nimagery has played an important role in the SAR fields. Different from the\ntraditional methods, Spectral Residual (SR) and CFAR detector, with the recent\nadavance in machine learning theory, there has emerged a novel method for SAR\ntarget segmentation, based on the deep learning networks. In this paper, we\nproposed a deep deformable residual learning network for target segmentation\nthat attempts to preserve the precise contour of the target. For this, the\ndeformable convolutional layers and residual learning block are applied, which\ncould extract and preserve the geometric information of the targets as much as\npossible. Based on the Moving and Stationary Target Acquisition and Recognition\n(MSTAR) data set, experimental results have shown the superiority of the\nproposed network for the precise targets segmentation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:24:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Chenwei",""],["Pei","Jifang",""],["Huang","Yulin",""],["Yang","Jianyu",""]]}
{"id":"2308.07628","submitter":"Michael Unterkalmsteiner","authors":"Eriks Klotins, Michael Unterkalmsteiner, Tony Gorschek","title":"Software Engineering Knowledge Areas in Startup Companies: A Mapping\n  Study","comments":"Proceedings 6th International Conference on Software Business (ICSOB\n  2015), Braga, Portugal, 245-257","journal-ref":null,"doi":"10.1007/978-3-319-18612-2_3","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Background - Startup companies are becoming important suppliers of innovative\nand software intensive products. The failure rate among startups is high due to\nlack of resources, immaturity, multiple influences and dynamic technologies.\nHowever, software product engineering is the core activity in startups,\ntherefore inadequacies in applied engineering practices might be a significant\ncontributing factor for high failure rates. Aim - This study identifies and\ncategorizes software engineering knowledge areas utilized in startups to map\nout the state-of-art, identifying gaps for further research. Method - We\nperform a systematic literature mapping study, applying snowball sampling to\nidentify relevant primary studies. Results - We have identified 54 practices\nfrom 14 studies. Although 11 of 15 main knowledge areas from SWEBOK are\ncovered, a large part of categories is not. Conclusions - Existing research\ndoes not provide reliable support for software engineering in any phase of a\nstartup life cycle. Transfer of results to other startups is difficult due to\nlow rigor in current studies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:26:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Klotins","Eriks",""],["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""]]}
{"id":"2308.07629","submitter":"Xiaoyang Liu","authors":"Chong Liu, Xiaoyang Liu, Ruobing Xie, Lixin Zhang, Feng Xia, Leyu Lin","title":"Learning from All Sides: Diversified Positive Augmentation via\n  Self-distillation in Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Personalized recommendation relies on user historical behaviors to provide\nuser-interested items, and thus seriously struggles with the data sparsity\nissue. A powerful positive item augmentation is beneficial to address the\nsparsity issue, while few works could jointly consider both the accuracy and\ndiversity of these augmented training labels. In this work, we propose a novel\nmodel-agnostic Diversified self-distillation guided positive augmentation\n(DivSPA) for accurate and diverse positive item augmentations. Specifically,\nDivSPA first conducts three types of retrieval strategies to collect\nhigh-quality and diverse positive item candidates according to users' overall\ninterests, short-term intentions, and similar users. Next, a self-distillation\nmodule is conducted to double-check and rerank these candidates as the final\npositive augmentations. Extensive offline and online evaluations verify the\neffectiveness of our proposed DivSPA on both accuracy and diversity. DivSPA is\nsimple and effective, which could be conveniently adapted to other base models\nand systems. Currently, DivSPA has been deployed on multiple widely-used\nreal-world recommender systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:27:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Chong",""],["Liu","Xiaoyang",""],["Xie","Ruobing",""],["Zhang","Lixin",""],["Xia","Feng",""],["Lin","Leyu",""]]}
{"id":"2308.07630","submitter":"Per Eklund","authors":"A. Zubayer, N. Ghafoor, K. A. Th\\'orarinsd\\'ottir, S. Stendahl, A.\n  Glavic, J. Stahn, G. Nagy, G. Greczynski, M. Schwartzkopf, A. Le Febvrier, P.\n  Eklund, J. Birch, F. Magnus, F. Eriksson","title":"Reflective, polarizing, and magnetically soft amorphous Fe/Si multilayer\n  neutron optics with isotope-enriched 11B4C inducing atomically flat\n  interfaces","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 utilization of polarized neutrons is of great importance in scientific\ndisciplines spanning materials science, physics, biology, and chemistry.\nPolarization analysis offers insights into otherwise unattainable sample\ninformation such as magnetic domains and structures, protein crystallography,\ncomposition, orientation, ion-diffusion mechanisms, and relative location of\nmolecules in multicomponent biological systems. State-of-the-art multilayer\npolarizing neutron optics have limitations, particularly low specular\nreflectivity and polarization at higher scattering vectors/angles, and the\nrequirement of high external magnetic fields to saturate the polarizer\nmagnetization. Here, we show that by incorporating 11B4C into Fe/Si\nmultilayers, amorphization and smooth interfaces can be achieved, yielding\nhigher neutron reflectivity, less diffuse scattering and higher polarization.\nMagnetic coercivity is eliminated, and magnetic saturation can be reached at\nlow external fields (>2 mT). This approach offers prospects for significant\nimprovement in polarizing neutron optics, enabling; nonintrusive positioning of\nthe polarizer, enhanced flux, increased data accuracy, and further\npolarizing/analyzing methods at neutron scattering facilities.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:27:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zubayer","A.",""],["Ghafoor","N.",""],["Th\u00f3rarinsd\u00f3ttir","K. A.",""],["Stendahl","S.",""],["Glavic","A.",""],["Stahn","J.",""],["Nagy","G.",""],["Greczynski","G.",""],["Schwartzkopf","M.",""],["Febvrier","A. Le",""],["Eklund","P.",""],["Birch","J.",""],["Magnus","F.",""],["Eriksson","F.",""]]}
{"id":"2308.07631","submitter":"Ege \\\"Ozg\\\"un","authors":"Ege \\\"Ozg\\\"un","title":"N-channel parity-time symmetry","comments":"5 pages, 3 figures. Submitted to Turkish Journal of Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculated the eigenvalues for a general N-channel coupled system with\nparity-time symmetry due to equal loss/gain. We found that the eigenspectrum\ndisplays a mixing of parity-time symmetric and broken phases, with N-2 of the\neigenvalues being parity-time broken whereas the remaining two being either\nparity-time symmetric or broken depending on the loss/gain and coupling\nparameters. Our results also show that mixing of parity-time symmetric and\nparity-time broken phases can only be obtained for at least four-channels if\nother degrees of freedom like polarization is not taken into account.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:28:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["\u00d6zg\u00fcn","Ege",""]]}
{"id":"2308.07632","submitter":"Olivier Ramar\\'e","authors":"Olivier Ramar\\'e","title":"A Moebius sum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We provide numerical bounds for $\\Sigma(X)=\\sum_{\\substack{d_1,d_2\\le\nX}}\\frac{\\mu(d_1)\\mu(d_2)}{[d_1,d_2]}$. We show in particular that $0\\le\n\\Sigma(X)\\le 17/25$ for every $X\\ge2$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:30:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ramar\u00e9","Olivier",""]]}
{"id":"2308.07633","submitter":"Xunyu Zhu","authors":"Xunyu Zhu, Jian Li, Yong Liu, Can Ma, Weiping Wang","title":"A Survey on Model Compression for Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have revolutionized natural language processing\ntasks with remarkable success. However, their formidable size and computational\ndemands present significant challenges for practical deployment, especially in\nresource-constrained environments. As these challenges become increasingly\npertinent, the field of model compression has emerged as a pivotal research\narea to alleviate these limitations. This paper presents a comprehensive survey\nthat navigates the landscape of model compression techniques tailored\nspecifically for LLMs. Addressing the imperative need for efficient deployment,\nwe delve into various methodologies, encompassing quantization, pruning,\nknowledge distillation, and more. Within each of these techniques, we highlight\nrecent advancements and innovative approaches that contribute to the evolving\nlandscape of LLM research. Furthermore, we explore benchmarking strategies and\nevaluation metrics that are essential for assessing the effectiveness of\ncompressed LLMs. By providing insights into the latest developments and\npractical implications, this survey serves as an invaluable resource for both\nresearchers and practitioners. As LLMs continue to evolve, this survey aims to\nfacilitate enhanced efficiency and real-world applicability, establishing a\nfoundation for future advancements in the field.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:31:05 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 18:16:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhu","Xunyu",""],["Li","Jian",""],["Liu","Yong",""],["Ma","Can",""],["Wang","Weiping",""]]}
{"id":"2308.07634","submitter":"Junpei Harada","authors":"Junpei Harada","title":"Dark energy in conformal Killing gravity","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Friedmann equation, enriched by an additional term that effectively takes\non the role of specific dark energy, is demonstrated to serve as an exact\nsolution within the recently proposed gravitational theory named \"conformal\nKilling gravity\". This theory does not explicitly incorporate dark energy. This\nfinding suggests that there's no necessity to postulate the existence of dark\nenergy as an independent physical entity. The dark energy effectively arising\nfrom this theory is characterized by a specific equation of state parameter,\ndenoted as $\\omega$, which is uniquely determined to be $-5/3$, classifying it\nas phantom energy. If this effective dark energy is present in a moderate\namount, typically around 5\\% of the total energy density at the present time,\nand under the assumption of density parameters for matter and the cosmological\nconstant, $\\Omega_{\\rm m}\\sim 0.25$ and $\\Omega_\\Lambda \\sim 0.7$,\nrespectively, the expansion of the universe at low redshifts ($z < 1.5$) can\nexceed expectations, while the expansion at $z > 1.5$ remains unchanged. This\nholds the potential to address the Hubble tension problem.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:31:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Harada","Junpei",""]]}
{"id":"2308.07635","submitter":"Xiaoming Shi","authors":"Xiaoming Shi, Jie Xu, Jinru Ding, Jiali Pang, Sichen Liu, Shuqing Luo,\n  Xingwei Peng, Lu Lu, Haihong Yang, Mingtao Hu, Tong Ruan, Shaoting Zhang","title":"LLM-Mini-CEX: Automatic Evaluation of Large Language Model for\n  Diagnostic Conversation","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":"  There is an increasing interest in developing LLMs for medical diagnosis to\nimprove diagnosis efficiency. Despite their alluring technological potential,\nthere is no unified and comprehensive evaluation criterion, leading to the\ninability to evaluate the quality and potential risks of medical LLMs, further\nhindering the application of LLMs in medical treatment scenarios. Besides,\ncurrent evaluations heavily rely on labor-intensive interactions with LLMs to\nobtain diagnostic dialogues and human evaluation on the quality of diagnosis\ndialogue. To tackle the lack of unified and comprehensive evaluation criterion,\nwe first initially establish an evaluation criterion, termed LLM-specific\nMini-CEX to assess the diagnostic capabilities of LLMs effectively, based on\noriginal Mini-CEX. To address the labor-intensive interaction problem, we\ndevelop a patient simulator to engage in automatic conversations with LLMs, and\nutilize ChatGPT for evaluating diagnosis dialogues automatically. Experimental\nresults show that the LLM-specific Mini-CEX is adequate and necessary to\nevaluate medical diagnosis dialogue. Besides, ChatGPT can replace manual\nevaluation on the metrics of humanistic qualities and provides reproducible and\nautomated comparisons between different LLMs.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:32:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shi","Xiaoming",""],["Xu","Jie",""],["Ding","Jinru",""],["Pang","Jiali",""],["Liu","Sichen",""],["Luo","Shuqing",""],["Peng","Xingwei",""],["Lu","Lu",""],["Yang","Haihong",""],["Hu","Mingtao",""],["Ruan","Tong",""],["Zhang","Shaoting",""]]}
{"id":"2308.07636","submitter":"Lei-Hong Zhang","authors":"Linyi Yang, Lei-Hong Zhang and Ya-Nan Zhang","title":"The $L_q$-weighted dual programming of the linear Chebyshev\n  approximation and an interior-point method","comments":"29 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given samples of a real or complex-valued function on a set of distinct\nnodes, the traditional linear Chebyshev approximation is to compute the best\nminimax approximation on a prescribed linear functional space. Lawson's\niteration is a classical and well-known method for that task. However, Lawson's\niteration converges linearly and in many cases, the convergence is very slow.\nIn this paper, by the duality theory of linear programming, we first provide an\nelementary and self-contained proof for the well-known Alternation Theorem in\nthe real case. Also, relying upon the Lagrange duality, we further establish an\n$L_q$-weighted dual programming for the linear Chebyshev approximation. In this\nframework, we revisit the convergence of Lawson's iteration, and moreover,\npropose a Newton type iteration, the interior-point method, to solve the\n$L_2$-weighted dual programming. Numerical experiments are reported to\ndemonstrate its fast convergence and its capability in finding the reference\npoints that characterize the unique minimax approximation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:33:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yang","Linyi",""],["Zhang","Lei-Hong",""],["Zhang","Ya-Nan",""]]}
{"id":"2308.07637","submitter":"Rub\\'en Izquierdo-L\\'opez","authors":"Manuel de Le\\'on, Rub\\'en Izquierdo-L\\'opez","title":"A review on coisotropic reduction in Symplectic, Cosymplectic, Contact\n  and Co-contact Hamiltonian systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study the coisotropic reduction in different types of\ndynamics according to the geometry of the corresponding phase space. The\nrelevance of the coisotropic reduction is motivated by the fact that these\ndynamics can always be interpreted as Lagrangian or Legendrian submanifolds.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:33:53 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 05:38:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["de Le\u00f3n","Manuel",""],["Izquierdo-L\u00f3pez","Rub\u00e9n",""]]}
{"id":"2308.07638","submitter":"Jinyang Liu","authors":"Jinyang Liu, Zhihan Jiang, Jiazhen Gu, Junjie Huang, Zhuangbin Chen,\n  Cong Feng, Zengyin Yang, Yongqiang Yang and Michael R. Lyu","title":"Prism: Revealing Hidden Functional Clusters from Massive Instances in\n  Cloud Systems","comments":"The paper was accepted by the 38th IEEE/ACM International Conference\n  on Automated Software Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ensuring the reliability of cloud systems is critical for both cloud vendors\nand customers. Cloud systems often rely on virtualization techniques to create\ninstances of hardware resources, such as virtual machines. However,\nvirtualization hinders the observability of cloud systems, making it\nchallenging to diagnose platform-level issues. To improve system observability,\nwe propose to infer functional clusters of instances, i.e., groups of instances\nhaving similar functionalities. We first conduct a pilot study on a large-scale\ncloud system, i.e., Huawei Cloud, demonstrating that instances having similar\nfunctionalities share similar communication and resource usage patterns.\nMotivated by these findings, we formulate the identification of functional\nclusters as a clustering problem and propose a non-intrusive solution called\nPrism. Prism adopts a coarse-to-fine clustering strategy. It first partitions\ninstances into coarse-grained chunks based on communication patterns. Within\neach chunk, Prism further groups instances with similar resource usage patterns\nto produce fine-grained functional clusters. Such a design reduces noises in\nthe data and allows Prism to process massive instances efficiently. We evaluate\nPrism on two datasets collected from the real-world production environment of\nHuawei Cloud. Our experiments show that Prism achieves a v-measure of ~0.95,\nsurpassing existing state-of-the-art solutions. Additionally, we illustrate the\nintegration of Prism within monitoring systems for enhanced cloud reliability\nthrough two real-world use cases.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:34:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Jinyang",""],["Jiang","Zhihan",""],["Gu","Jiazhen",""],["Huang","Junjie",""],["Chen","Zhuangbin",""],["Feng","Cong",""],["Yang","Zengyin",""],["Yang","Yongqiang",""],["Lyu","Michael R.",""]]}
{"id":"2308.07639","submitter":"Jean-Fran\\c{c}ois Rupprecht","authors":"Shao-Zhen Lin, Jacques Prost, Jean-Francois Rupprecht","title":"Curvature-induced clustering of cell adhesion proteins","comments":"13 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":"  Cell adhesion proteins typically form stable clusters that anchor the cell\nmembrane to its environment. Several works have suggested that cell membrane\nprotein clusters can emerge from a local feedback between the membrane\ncurvature and the density of proteins. Here, we investigate the effect of such\ncurvature-sensing mechanism in the context of cell adhesion proteins. We show\nhow clustering emerges in an intermediate range of adhesion and\ncurvature-sensing strengths. We identify key differences with the tilt-induced\ngradient sensing mechanism we previously proposed (Lin et al.,\narXiv:2307.03670, 2023).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:36:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lin","Shao-Zhen",""],["Prost","Jacques",""],["Rupprecht","Jean-Francois",""]]}
{"id":"2308.07640","submitter":"Michael Unterkalmsteiner","authors":"Michael Unterkalmsteiner, Tony Gorschek, Robert Feldt, Eriks Klotins","title":"Assessing requirements engineering and software test alignment -- Five\n  case studies","comments":null,"journal-ref":"J. Syst. Softw. 109: 62-77 (2015)","doi":"10.1145/2815021.2815036","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The development of large, software-intensive systems is a complex undertaking\nthat we generally tackle by a divide and conquer strategy. Companies thereby\nface the challenge of coordinating individual aspects of software development,\nin particular between requirements engineering (RE) and software testing (ST).\nA lack of REST alignment can not only lead to wasted effort but also to\ndefective software. However, before a company can improve the mechanisms of\ncoordination they need to be understood first. With REST-bench we aim at\nproviding an assessment tool that illustrates the coordination in software\ndevelopment projects and identify concrete improvement opportunities. We have\ndeveloped REST-bench on the sound fundamentals of a taxonomy on REST alignment\nmethods and validated the method in five case studies. Following the principles\nof technical action research, we collaborated with five companies, applying\nREST-bench and iteratively improving the method based on the lessons we\nlearned. We applied REST-bench both in Agile and plan-driven environments, in\nprojects lasting from weeks to years, and staffed as large as 1000 employees.\nThe improvement opportunities we identified and the feedback we received\nindicate that the assessment was effective and efficient. Furthermore,\nparticipants confirmed that their understanding on the coordination between RE\nand ST improved.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:43:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""],["Feldt","Robert",""],["Klotins","Eriks",""]]}
{"id":"2308.07641","submitter":"Boyu Chen","authors":"Boyu Chen, Hanxuan Chen, Jiao He, Fengyu Sun, Shangling Jui","title":"Ternary Singular Value Decomposition as a Better Parameterized Form in\n  Linear Mapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a simple yet novel parameterized form of linear mapping to\nachieves remarkable network compression performance: a pseudo SVD called\nTernary SVD (TSVD).\n  Unlike vanilla SVD, TSVD limits the $U$ and $V$ matrices in SVD to ternary\nmatrices form in $\\{\\pm 1, 0\\}$. This means that instead of using the expensive\nmultiplication instructions, TSVD only requires addition instructions when\ncomputing $U(\\cdot)$ and $V(\\cdot)$.\n  We provide direct and training transition algorithms for TSVD like Post\nTraining Quantization and Quantization Aware Training respectively.\nAdditionally, we analyze the convergence of the direct transition algorithms in\ntheory.\n  In experiments, we demonstrate that TSVD can achieve state-of-the-art network\ncompression performance in various types of networks and tasks, including\ncurrent baseline models such as ConvNext, Swim, BERT, and large language model\nlike OPT.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:46:17 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Boyu",""],["Chen","Hanxuan",""],["He","Jiao",""],["Sun","Fengyu",""],["Jui","Shangling",""]]}
{"id":"2308.07642","submitter":"Johann Cigler","authors":"Johann Cigler","title":"Some experimental observations about Hankel determinants of convolution\n  powers of Catalan numbers","comments":"12 pages, a new paragraph has been added","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computer experiments suggest some conjectures about Hankel determinants of\nconvolution powers of Catalan numbers. Unfortunately, for most of them I have\nno proofs. I would like to present them anyway hoping that someone finds them\ninteresting and can prove them.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:47:08 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 12:05:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cigler","Johann",""]]}
{"id":"2308.07643","submitter":"Martin Pohl","authors":"M. Pohl (for the VERITAS collaboration, the H.E.S.S. collaboration),\n  and K. Mori","title":"Multiwavelength Observations of the Blazar PKS~0735+178 in Spatial and\n  Temporal Coincidence with an Astrophysical Neutrino Candidate IceCube-211208A","comments":"Proceedings paper presented at the 38th International Cosmic Ray\n  Conference (ICRC2023), held 26 July - 3 August, 2023, in Nagoya, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on multiwavelength target-of-opportunity observations of the blazar\nPKS 0735+178, located 2.2 degrees away from the best-fit position of the\nIceCube neutrino event 211208A. The source was in a high-flux state in the\noptical, ultraviolet, X-ray, and GeV gamma-ray bands around the time of the\nneutrino event, exhibiting daily variability in the soft X-ray flux. The X-ray\ndata from Swift-XRT and NuSTAR characterize the transition between the\nlow-energy and high-energy components of the broadband spectral energy\ndistribution, and the gamma-ray data from Fermi-LAT, VERITAS, and H.E.S.S.\nrequire a spectral cut-off near 100 GeV. Both measurements provide strong\nconstraints on leptonic and hadronic models. We analytically explore a\nsynchrotron self-Compton model, an external Compton model, and a lepto-hadronic\nmodel. Models that are entirely based on internal photon fields face serious\ndifficulties in matching the observed spectral energy distribution (SED). The\nexistence of an external photon field in the source would instead explain the\nobserved gamma-ray spectral cut-off in both leptonic and lepto-hadronic models,\nand it would allow a proton jet power that marginally agrees with the Eddington\nlimit in the lepto-hadronic model. A numerical lepto-hadronic model with\nexternal target photons reproduces the observed SED and is reasonably\nconsistent with the neutrino event despite requiring a high jet power.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:47:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pohl","M.","","for the VERITAS collaboration, the H.E.S.S. collaboration"],["Mori","K.",""]]}
{"id":"2308.07644","submitter":"Joerg Evers","authors":"Lukas Wolff and J\\\"org Evers","title":"A characterization and detection method for x-ray excitation of\n  M\\\"ossbauer nuclei beyond the low-excitation regime","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Up to now, experiments involving M\\\"ossbauer nuclei have been restricted to\nthe low-excitation regime. The reason for this is the narrow spectral line\nwidth of the nuclei. This defining feature enables M\\\"ossbauer spectroscopy\nwith remarkable resolution and convenient control and measurements in the time\ndomain, but at the same time implies that only a tiny part of the photons\ndelivered by accelerator-based x-ray sources with orders-of-magnitude larger\npulse bandwidth are resonant with the nuclei. X-ray free-electron lasers\npromise a substantial enhancement of the number of nuclear-resonant photons per\npulse, such that excitations beyond the low-excitation (LER) regime come within\nreach. This raises the question, how the onset of non-linear excitations could\nbe experimentally verified. Here, we develop and explore a method to detect an\nexcitation of nuclear ensembles beyond the LER for ensembles of nuclei embedded\nin x-ray waveguides. It relies on the comparison of the x-rays coherently and\nincoherently scattered off of the nuclei. As a key result, we show that the\nratio of the two observables is constant within the LER, essentially\nindependent of the details of the nuclear system and the characteristics of the\nexciting x-rays. Conversely, deviations from this equivalence serve as a direct\nindication of excitations beyond the LER. Building upon this observation, we\ndevelop a variety of experimental signatures both, for near-instantaneous\nimpulsive and for temporally-extended non-impulsive x-ray excitation.\nCorrelating coherently and incoherently scattered intensities further allows\none to compare theoretical models of nonlinear excitations more rigorously to\ncorresponding experiments.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:47:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wolff","Lukas",""],["Evers","J\u00f6rg",""]]}
{"id":"2308.07645","submitter":"Charles O'Neill","authors":"Charles O'Neill, Yuan-Sen Ting, Ioana Ciuca, Jack Miller, Thang Bui","title":"Steering Language Generation: Harnessing Contrastive Expert Guidance and\n  Negative Prompting for Coherent and Diverse Synthetic Data Generation","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) hold immense potential to generate synthetic\ndata of high quality and utility, which has numerous applications from\ndownstream model training to practical data utilisation. However, contemporary\nmodels, despite their impressive capacities, consistently struggle to produce\nboth coherent and diverse data. To address the coherency issue, we introduce\ncontrastive expert guidance, where the difference between the logit\ndistributions of fine-tuned and base language models is emphasised to ensure\ndomain adherence. In order to ensure diversity, we utilise existing real and\nsynthetic examples as negative prompts to the model. We deem this dual-pronged\napproach to logit reshaping as STEER: Semantic Text Enhancement via Embedding\nRepositioning. STEER operates at inference-time and systematically guides the\nLLMs to strike a balance between adherence to the data distribution (ensuring\nsemantic fidelity) and deviation from prior synthetic examples or existing real\ndatasets (ensuring diversity and authenticity). This delicate balancing act is\nachieved by dynamically moving towards or away from chosen representations in\nthe latent space. STEER demonstrates improved performance over previous\nsynthetic data generation techniques, exhibiting better balance between data\ndiversity and coherency across three distinct tasks: hypothesis generation,\ntoxic and non-toxic comment generation, and commonsense reasoning task\ngeneration. We demonstrate how STEER allows for fine-tuned control over the\ndiversity-coherency trade-off via its hyperparameters, highlighting its\nversatility.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:49:14 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 06:08:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["O'Neill","Charles",""],["Ting","Yuan-Sen",""],["Ciuca","Ioana",""],["Miller","Jack",""],["Bui","Thang",""]]}
{"id":"2308.07646","submitter":"Emre Arslan","authors":"Emre Arslan, Fatih Kilinc, Ertugrul Basar, Huseyin Arslan","title":"Network-Independent and User-Controlled RIS: An Experimental Perspective","comments":"Conference, 6 pages, 5 figures, 1 algorithm","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The march towards 6G is accelerating and future wireless network\narchitectures require enhanced performance along with significant coverage\nespecially, to combat impairments on account of the wireless channel.\nReconfigurable intelligent surface (RIS) technology is a promising solution,\nthat has recently been considered as a research topic in standards, to help\nmanipulate the channel in favor of users needs. Generally, in experimental RIS\nsystems, the RIS is either connected to the transmitter (Tx) or receiver (Rx)\nthrough a physical backhaul link and it is controlled by the network and\nrequires significant computation at the RIS for codebook (CB) designs. In this\npaper, we propose a practical user-controlled RIS system that is isolated from\nthe network to enhance communication performance and provide coverage to the\nuser based on its location and preference. Furthermore, a low-complexity\nalgorithm is proposed to aid in CB selection for the user, which is performed\nthrough the wireless cloud to enable a passive and energy efficient RIS.\nExtensive experimental test-bed measurements demonstrate the enhanced\nperformance of the proposed system while both results match and validate each\nother.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:53:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Arslan","Emre",""],["Kilinc","Fatih",""],["Basar","Ertugrul",""],["Arslan","Huseyin",""]]}
{"id":"2308.07647","submitter":"Igor Kuzmenko","authors":"Igor Kuzmenko, Miros{\\l}aw Brewczyk, Grzegorz {\\L}ach, Marek\n  Trippenbach, Y. B. Band","title":"Atoms in a spin-dependent optical lattice potential as a topological\n  insulator with broken time-reversal symmetry","comments":"5 pages, 4 eps figures and Supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate fermionic $^{6}$Li $F= 1/2$ atoms in a 2D spin-dependent\noptical lattice potential (SDOLP) generated by intersecting laser beams with a\nsuperposition of polarizations. The effective interaction of a Li atom with the\nelectromagnetic field contains a scalar and vector (called as fictitious\nmagnetic field, ${\\bf B}_\\mathrm{fic}$) contribution. We calculate the band\nstructure of Li atoms in the SDOLP as a function of the laser intensity and an\nexternal magnetic field ${\\bf B}_{\\mathrm{ext}} = B_{\\mathrm{ext}} {\\hat {\\bf\nz}}$. We also calculate the Chern numbers of the SDOLP and show that depending\non $B_{\\mathrm{ext}}$, the system is an ordinary insulator, an Abeliean\ntopological insulator (TI), or a non-Abelian TI. Introducing a blue-detuned\nlaser potential, $V_{\\mathrm{BD}}(y) = V_{\\mathrm{BD},0}(y) \\Theta (|y| -\nL_y/2)$, results in edges for the SDOL. We calculate the resulting edge states\n(some of which are topological) and study their density, current density,\nspin-current density and correlate the edge states with the Chern numbers.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:54:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kuzmenko","Igor",""],["Brewczyk","Miros\u0142aw",""],["\u0141ach","Grzegorz",""],["Trippenbach","Marek",""],["Band","Y. B.",""]]}
{"id":"2308.07648","submitter":"Chaorui Deng","authors":"Chaorui Deng, Qi Chen, Pengda Qin, Da Chen, Qi Wu","title":"Prompt Switch: Efficient CLIP Adaptation for Text-Video Retrieval","comments":"to be appeared in ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In text-video retrieval, recent works have benefited from the powerful\nlearning capabilities of pre-trained text-image foundation models (e.g., CLIP)\nby adapting them to the video domain. A critical problem for them is how to\neffectively capture the rich semantics inside the video using the image encoder\nof CLIP. To tackle this, state-of-the-art methods adopt complex cross-modal\nmodeling techniques to fuse the text information into video frame\nrepresentations, which, however, incurs severe efficiency issues in large-scale\nretrieval systems as the video representations must be recomputed online for\nevery text query. In this paper, we discard this problematic cross-modal fusion\nprocess and aim to learn semantically-enhanced representations purely from the\nvideo, so that the video representations can be computed offline and reused for\ndifferent texts. Concretely, we first introduce a spatial-temporal \"Prompt\nCube\" into the CLIP image encoder and iteratively switch it within the encoder\nlayers to efficiently incorporate the global video semantics into frame\nrepresentations. We then propose to apply an auxiliary video captioning\nobjective to train the frame representations, which facilitates the learning of\ndetailed video semantics by providing fine-grained guidance in the semantic\nspace. With a naive temporal fusion strategy (i.e., mean-pooling) on the\nenhanced frame representations, we obtain state-of-the-art performances on\nthree benchmark datasets, i.e., MSR-VTT, MSVD, and LSMDC.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:54:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deng","Chaorui",""],["Chen","Qi",""],["Qin","Pengda",""],["Chen","Da",""],["Wu","Qi",""]]}
{"id":"2308.07649","submitter":"Nick Birbilis","authors":"R. Tan, Z. Li, S. Zhao, N. Birbilis","title":"A primitive machine learning tool for the mechanical property prediction\n  of multiple principal element alloys","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multi-principal element alloys (MPEAs) are produced by combining metallic\nelements in what is a diverse range of proportions. MPEAs reported to date have\nrevealed promising performance due to their exceptional mechanical properties.\nTraining a machine learning (ML) model on known performance data is a\nreasonable method to rationalise the complexity of composition dependent\nmechanical properties of MPEAs. This study utilises data from a specifically\ncurated dataset, that contains information regarding six mechanical properties\nof MPEAs. A parser tool was introduced to convert chemical composition of\nalloys into the input format of the ML models, and a number of ML models were\napplied. Finally, Gradio was used to visualise the ML model predictions and to\ncreate a user-interactive interface. The ML model presented is an initial\nprimitive model (as it does not factor in aspects such as MPEA production and\nprocessing route), however serves as a an initial user tool, whilst also\nproviding a workflow for other researchers.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:54:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tan","R.",""],["Li","Z.",""],["Zhao","S.",""],["Birbilis","N.",""]]}
{"id":"2308.07650","submitter":"Ke Xu","authors":"Ke Xu and Lei Han and Ye Tian and Shangshang Yang and Xingyi Zhang","title":"EQ-Net: Elastic Quantization Neural Networks","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":"  Current model quantization methods have shown their promising capability in\nreducing storage space and computation complexity. However, due to the\ndiversity of quantization forms supported by different hardware, one limitation\nof existing solutions is that usually require repeated optimization for\ndifferent scenarios. How to construct a model with flexible quantization forms\nhas been less studied. In this paper, we explore a one-shot network\nquantization regime, named Elastic Quantization Neural Networks (EQ-Net), which\naims to train a robust weight-sharing quantization supernet. First of all, we\npropose an elastic quantization space (including elastic bit-width,\ngranularity, and symmetry) to adapt to various mainstream quantitative forms.\nSecondly, we propose the Weight Distribution Regularization Loss (WDR-Loss) and\nGroup Progressive Guidance Loss (GPG-Loss) to bridge the inconsistency of the\ndistribution for weights and output logits in the elastic quantization space\ngap. Lastly, we incorporate genetic algorithms and the proposed Conditional\nQuantization-Aware Accuracy Predictor (CQAP) as an estimator to quickly search\nmixed-precision quantized neural networks in supernet. Extensive experiments\ndemonstrate that our EQ-Net is close to or even better than its static\ncounterparts as well as state-of-the-art robust bit-width methods. Code can be\navailable at\n\\href{https://github.com/xuke225/EQ-Net.git}{https://github.com/xuke225/EQ-Net}.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:57:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xu","Ke",""],["Han","Lei",""],["Tian","Ye",""],["Yang","Shangshang",""],["Zhang","Xingyi",""]]}
{"id":"2308.07651","submitter":"Tao Zhou","authors":"Junkang Huang, Z. D. Wang, Tao Zhou","title":"Impurity and vortex States in the bilayer high-temperature\n  superconductor $\\mathrm{La}_3\\mathrm{Ni}_2\\mathrm{O}_7$","comments":"8 pages. 8 figures. including the Supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform a theoretical examination of the local electronic structure in the\nrecently discovered bilayer high-temperature superconductor\n${\\mathrm{La}_3\\mathrm{Ni}_2\\mathrm{O}_7}$. Our method begins with a bilayer\ntwo-orbital tight-binding model, incorporating various pairing interaction\nchannels. We determine superconducting order parameters by self-consistently\nsolving the real-space Bogoliubov-de Gennes (BdG) equations, revealing a robust\nand stable extended s-wave pairing symmetry. We investigate the single impurity\neffect using both self-consistent BdG equations and non-self-consistent\nT-matrix methods, uncovering low-energy in-gap states that can be explained\nwith the T-matrix approach. Additionally, we analyze magnetic vortex states\nusing a self-consistent BdG technique, which shows a peak-hump structure in the\nlocal density of states at the vortex center. Our results provide identifiable\nfeatures that can be used to determine the pairing symmetry of the\nsuperconducting ${\\mathrm{La}_3\\mathrm{Ni}_2\\mathrm{O}_7}$ material.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:58:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Huang","Junkang",""],["Wang","Z. D.",""],["Zhou","Tao",""]]}
{"id":"2308.07652","submitter":"Francesco Ballerin","authors":"Francesco Ballerin and Erlend Grong","title":"Geometry of the Visual Cortex with Applications to Image Inpainting and\n  Enhancement","comments":"Associated python package available at\n  https://github.com/ballerin/v1diffusion","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Equipping the rototranslation group $SE(2)$ with a sub-Riemannian structure\ninspired by the visual cortex V1, we propose algorithms for image inpainting\nand enhancement based on hypoelliptic diffusion. We innovate on previous\nimplementations of the methods by Citti, Sarti and Boscain et al., by proposing\nan alternative that prevents fading and capable of producing sharper results in\na procedure that we call WaxOn-WaxOff. We also exploit the sub-Riemannian\nstructure to define a completely new unsharp using $SE(2)$, analogous of the\nclassical unsharp filter for 2D image processing, with applications to image\nenhancement. We demonstrate our method on blood vessels enhancement in retinal\nscans.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:00:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ballerin","Francesco",""],["Grong","Erlend",""]]}
{"id":"2308.07653","submitter":"Noga Alon","authors":"Noga Alon","title":"Connectivity Graph-Codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices\n$V$ is the graph on $V$ whose set of edges are all edges that belong to exactly\none of the two graphs $G_1,G_2$. For a fixed graph $H$ call a collection ${\\cal\nG}$ of spanning subgraphs of $H$ a connectivity code for $H$ if the symmetric\ndifference of any two distinct subgraphs in ${\\cal G}$ is a connected spanning\nsubgraph of $H$. It is easy to see that the maximum possible cardinality of\nsuch a collection is at most $2^{k'(H)} \\leq 2^{\\delta(H)}$, where $k'(H)$ is\nthe edge-connectivity of $H$ and $\\delta(H)$ is its minimum degree. We show\nthat equality holds for any $d$-regular (mild) expander, and observe that\nequality does not hold in several natural examples including powers of long\ncycles and products of a small clique with a long cycle.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:02:45 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 17:58:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alon","Noga",""]]}
{"id":"2308.07654","submitter":"Jianyi Cheng","authors":"Jianyi Cheng, Samuel Coward, Lorenzo Chelini, Rafael Barbalho, Theo\n  Drane","title":"SEER: Super-Optimization Explorer for HLS using E-graph Rewriting with\n  MLIR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.AR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-level synthesis (HLS) is a process that automatically translates a\nsoftware program in a high-level language into a low-level hardware\ndescription. However, the hardware designs produced by HLS tools still suffer\nfrom a significant performance gap compared to manual implementations. This is\nbecause the input HLS programs must still be written using hardware design\nprinciples.\n  Existing techniques either leave the program source unchanged or perform a\nfixed sequence of source transformation passes, potentially missing\nopportunities to find the optimal design. We propose a super-optimization\napproach for HLS that automatically rewrites an arbitrary software program into\nefficient HLS code that can be used to generate an optimized hardware design.\nWe developed a toolflow named SEER, based on the e-graph data structure, to\nefficiently explore equivalent implementations of a program at scale. SEER\nprovides an extensible framework, orchestrating existing software compiler\npasses and hardware synthesis optimizers.\n  Our work is the first attempt to exploit e-graph rewriting for large software\ncompiler frameworks, such as MLIR. Across a set of open-source benchmarks, we\nshow that SEER achieves up to 38x the performance within 1.4x the area of the\noriginal program. Via an Intel-provided case study, SEER demonstrates the\npotential to outperform manually optimized designs produced by hardware\nexperts.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:05:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cheng","Jianyi",""],["Coward","Samuel",""],["Chelini","Lorenzo",""],["Barbalho","Rafael",""],["Drane","Theo",""]]}
{"id":"2308.07655","submitter":"Yaroslav Golubev","authors":"Aleksandra Eliseeva, Yaroslav Sokolov, Egor Bogomolov, Yaroslav\n  Golubev, Danny Dig, Timofey Bryksin","title":"From Commit Message Generation to History-Aware Commit Message\n  Completion","comments":"Accepted to ASE'23. 13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Commit messages are crucial to software development, allowing developers to\ntrack changes and collaborate effectively. Despite their utility, most commit\nmessages lack important information since writing high-quality commit messages\nis tedious and time-consuming. The active research on commit message generation\n(CMG) has not yet led to wide adoption in practice. We argue that if we could\nshift the focus from commit message generation to commit message completion and\nuse previous commit history as additional context, we could significantly\nimprove the quality and the personal nature of the resulting commit messages.\n  In this paper, we propose and evaluate both of these novel ideas. Since the\nexisting datasets lack historical data, we collect and share a novel dataset\ncalled CommitChronicle, containing 10.7M commits across 20 programming\nlanguages. We use this dataset to evaluate the completion setting and the\nusefulness of the historical context for state-of-the-art CMG models and\nGPT-3.5-turbo. Our results show that in some contexts, commit message\ncompletion shows better results than generation, and that while in general\nGPT-3.5-turbo performs worse, it shows potential for long and detailed\nmessages. As for the history, the results show that historical information\nimproves the performance of CMG models in the generation task, and the\nperformance of GPT-3.5-turbo in both generation and completion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:10:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Eliseeva","Aleksandra",""],["Sokolov","Yaroslav",""],["Bogomolov","Egor",""],["Golubev","Yaroslav",""],["Dig","Danny",""],["Bryksin","Timofey",""]]}
{"id":"2308.07656","submitter":"Maximilian Meier","authors":"Maximilian Meier and Brian Clark (for the IceCube Collaboration)","title":"Search for Extremely High Energy Neutrinos with 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-1149","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extremely high energy (EHE) neutrinos (with energies above $10^7$ GeV) are\nproduced in interactions of the highest energy cosmic rays. A primary\ncontribution to the EHE neutrino flux is expected from so-called cosmogenic\nneutrinos produced when ultra high energy cosmic rays interact with ambient\nphoton backgrounds. Observations of these EHE neutrinos with IceCube can probe\nthe nature of cosmic rays beyond the energies for resonant photo-pion\nproduction (GZK cutoff). We present a new event selection of extremely high\nenergy neutrinos by more effectively identifying and rejecting high\nmultiplicity muon bundles with respect to previous analyses. Furthermore, we\nshow the expected improvements of the quasi-differential upper limits on the\nEHE neutrino flux using 12 years of IceCube data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:12:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Meier","Maximilian","","for the IceCube Collaboration"],["Clark","Brian","","for the IceCube Collaboration"]]}
{"id":"2308.07657","submitter":"Thomas Sch\\\"apers","authors":"Erik Zimmermann and Justus Teller and Michael Schleenvoigt and Gerrit\n  Behner and Peter Sch\\\"uffelgen and Hans L\\\"uth and Detlev Gr\\\"utzmacher and\n  Thomas Sch\\\"apers","title":"Current-induced magnetization switching in a magnetic topological\n  insulator heterostructure","comments":"6 pages, 3 figures (5 pages and 5 figures in supplementary\n  information)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the current-induced switching of the internal magnetization\ndirection in a magnetic topological insulator/topological insulator\nheterostructure in the quantum anomalous Hall regime. The switching process is\nbased on the bias current dependence of the coercive field, which is attributed\nto the effect of the spin-orbit torque provided by the unpolarized bias\ncurrent. Increasing the bias current leads to a decrease in the magnetic order\nin the sample. When the applied current is subsequently reduced, the magnetic\nmoments align with an externally applied magnetic field, resulting in\nrepolarization in the opposite direction. This includes a reversal of the spin\npolarisation and hence a reversal of the chiral edge mode. Possible\napplications in spintronic devices are discussed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:12:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zimmermann","Erik",""],["Teller","Justus",""],["Schleenvoigt","Michael",""],["Behner","Gerrit",""],["Sch\u00fcffelgen","Peter",""],["L\u00fcth","Hans",""],["Gr\u00fctzmacher","Detlev",""],["Sch\u00e4pers","Thomas",""]]}
{"id":"2308.07658","submitter":"Ulf-G. Mei{\\ss}ner","authors":"Feng-Kun Guo, Yuki Kamiya, Maxim Mai, Ulf-G. Mei{\\ss}ner","title":"New insights into the nature of the $\\Lambda(1380)$ and $\\Lambda(1405)$\n  resonances away from the SU(3) limit","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Starting from the SU(3) limit, we consider the nature of the dynamically\ngenerated resonances $\\Lambda(1380)$, $\\Lambda(1405)$ and $\\Lambda(1680)$ as\nthe pion and kaon masses are tuned to their physical values. We show that the\naccidental symmetry of the two octets due to the leading order\nWeinberg-Tomozawa term is broken by the next-to-leading order terms. Most\ninterestingly, we observe an interchange of the two trajectories of the\n$\\Lambda(1380)$ and the $\\Lambda(1405)$ away from the SU(3) limit at\nnext-to-leading order. This remarkable phenomenon can be investigated using\nlattice QCD calculations that start from the SU(3) limit.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:13:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Guo","Feng-Kun",""],["Kamiya","Yuki",""],["Mai","Maxim",""],["Mei\u00dfner","Ulf-G.",""]]}
{"id":"2308.07659","submitter":"Tim Neidig","authors":"Tim Neidig, Jan Rais, Marcus Bleicher, Hendrik van Hees, and Carsten\n  Greiner","title":"Open Quantum Systems with Kadanoff-Baym Equations","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the temporal evolution of quantum mechanical fermionic particles\nexhibiting one bound state within a one-dimensional attractive square-well\npotential in a heat bath of bosonic particles. For this open quantum system we\nformulate the non-equilibrium Kadanoff-Baym equations for the system particles\nby taking the interactions to be elastic 2-2 scatterings with the heat-bath\nparticles. The corresponding spatially imhomogeneous integro-differential\nequations for the one-particle Greens's function are solved numerically. We\ndemonstrate how the system particles equilibrate and thermalize with the heat\nbath and how the off-diagonal elements of the density matrix, expressed in the\none-particle energy eigenbasis, decohere, so that only the diagonal entries,\ni.e. the occupation numbers, survive. In addition, the time evolution of the\n(retarded) Green's function also determines the spectral properties of the\nvarious one-particle quantum states.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:19:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Neidig","Tim",""],["Rais","Jan",""],["Bleicher","Marcus",""],["van Hees","Hendrik",""],["Greiner","Carsten",""]]}
{"id":"2308.07660","submitter":"Zhyrair Gevorkian","authors":"V.Gareyan and Zh.Gevorkian","title":"The Impact of Surface Roughness on Light Absorption","comments":"10pages,6figures. arXiv admin note: substantial text overlap with\n  arXiv:2208.06796","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":"  We report on a comprehensive study carried out to reveal the impact of\nsurface roughness on the incident light absorption. In practice, we have used\nanalytical approach of solving Maxwell equations by modifying boundary\nconditions that take into account the surface roughness in metallic or\ndielectric films. Our approach reveals interference linked terms that modify\nthe absorption dependence on the surface roughness characteristics, light\nwavelength,polarization and incidence angle. We have discussed the limits of\nour approach that hold valid from optics to microwave region. Polarization and\nangular dependences of roughness induced absorption are revealed. Existence of\nan incident angle and a wavelength for which the absorptance of rough surface\nbecomes equal to the absorptance of flat surface is predicted. Relaying on this\nphenomena a method of determination of roughness correlation length is\nsuggested.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:24:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gareyan","V.",""],["Gevorkian","Zh.",""]]}
{"id":"2308.07661","submitter":"Zhe Chen Ph.D.","authors":"Zhe Chen","title":"Attention Is Not All You Need Anymore","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the popular Transformer architecture has achieved great\nsuccess in many application areas, including natural language processing and\ncomputer vision. Many existing works aim to reduce the computational and memory\ncomplexity of the self-attention mechanism in the Transformer by trading off\nperformance. However, performance is key for the continuing success of the\nTransformer. In this paper, a drop-in replacement for the self-attention\nmechanism in the Transformer, called the Extractor, is proposed. Experimental\nresults show that replacing the self-attention mechanism with the Extractor\nimproves the performance of the Transformer. Furthermore, the proposed\nExtractor has the potential to run faster than the self-attention since it has\na much shorter critical path of computation. Additionally, the sequence\nprediction problem in the context of text generation is formulated using\nvariable-length discrete-time Markov chains, and the Transformer is reviewed\nbased on our understanding.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:24:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Zhe",""]]}
{"id":"2308.07662","submitter":"Edouard Yvinec","authors":"Edouard Yvinec, Arnaud Dapogny and Kevin Bailly","title":"Gradient-Based Post-Training Quantization: Challenging the Status Quo","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":"  Quantization has become a crucial step for the efficient deployment of deep\nneural networks, where floating point operations are converted to simpler fixed\npoint operations. In its most naive form, it simply consists in a combination\nof scaling and rounding transformations, leading to either a limited\ncompression rate or a significant accuracy drop. Recently, Gradient-based\npost-training quantization (GPTQ) methods appears to be constitute a suitable\ntrade-off between such simple methods and more powerful, yet expensive\nQuantization-Aware Training (QAT) approaches, particularly when attempting to\nquantize LLMs, where scalability of the quantization process is of paramount\nimportance. GPTQ essentially consists in learning the rounding operation using\na small calibration set. In this work, we challenge common choices in GPTQ\nmethods. In particular, we show that the process is, to a certain extent,\nrobust to a number of variables (weight selection, feature augmentation, choice\nof calibration set). More importantly, we derive a number of best practices for\ndesigning more efficient and scalable GPTQ methods, regarding the problem\nformulation (loss, degrees of freedom, use of non-uniform quantization schemes)\nor optimization process (choice of variable and optimizer). Lastly, we propose\na novel importance-based mixed-precision technique. Those guidelines lead to\nsignificant performance improvements on all the tested state-of-the-art GPTQ\nmethods and networks (e.g. +6.819 points on ViT for 4-bit quantization), paving\nthe way for the design of scalable, yet effective quantization methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:25:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yvinec","Edouard",""],["Dapogny","Arnaud",""],["Bailly","Kevin",""]]}
{"id":"2308.07663","submitter":"Robert Polzin","authors":"Robert Polzin, Ilja Klebanov, Nikolas N\\\"usken and P\\'eter Koltai","title":"Nonnegative matrix factorization for coherent set identification by\n  direct low rank maximum likelihood estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.DS math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze connections between two low rank modeling approaches from the last\ndecade for treating dynamical data. The first one is the coherence problem (or\ncoherent set approach), where groups of states are sought that evolve under the\naction of a stochastic matrix in a way maximally distinguishable from other\ngroups. The second one is a low rank factorization approach for stochastic\nmatrices, called Direct Bayesian Model Reduction (DBMR), which estimates the\nlow rank factors directly from observed data. We show that DBMR results in a\nlow rank model that is a projection of the full model, and exploit this insight\nto infer bounds on a quantitative measure of coherence within the reduced\nmodel. Both approaches can be formulated as optimization problems, and we also\nprove a bound between their respective objectives. On a broader scope, this\nwork relates the two classical loss functions of nonnegative matrix\nfactorization, namely the Frobenius norm and the generalized Kullback--Leibler\ndivergence, and suggests new links between likelihood-based and\nprojection-based estimation of probabilistic models.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:26:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Polzin","Robert",""],["Klebanov","Ilja",""],["N\u00fcsken","Nikolas",""],["Koltai","P\u00e9ter",""]]}
{"id":"2308.07664","submitter":"Cristian Andrey Galvis Florez Mr.","authors":"Cristian A. Galvis-Florez, Daniel Reitzner, Simo S\\\"arkk\\\"a","title":"Single Qubit State Estimation on NISQ Devices with Limited Resources and\n  SIC-POVMs","comments":"Conference paper for the IEEE International Conference on Quantum\n  Computing and Engineering (QCE) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current quantum computers have the potential to overcome classical\ncomputational methods, however, the capability of the algorithms that can be\nexecuted on noisy intermediate-scale quantum devices is limited due to hardware\nimperfections. Estimating the state of a qubit is often needed in different\nquantum protocols, due to the lack of direct measurements. In this paper, we\nconsider the problem of estimating the quantum state of a qubit in a quantum\nprocessing unit without conducting direct measurements of it. We consider a\nparameterized measurement model to estimate the quantum state, represented as a\nquantum circuit, which is optimized using the quantum tomographic transfer\nfunction. We implement and test the circuit using the quantum computer of the\nTechnical Research Centre of Finland as well as an IBM quantum computer. We\ndemonstrate that the set of positive operator-valued measurements used for the\nestimation is symmetric and informationally complete. Moreover, the resources\nneeded for qubit estimation are reduced when direct measurements are allowed,\nkeeping the symmetric property of the measurements.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:27:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Galvis-Florez","Cristian A.",""],["Reitzner","Daniel",""],["S\u00e4rkk\u00e4","Simo",""]]}
{"id":"2308.07665","submitter":"XiMing Xing","authors":"Ximing Xing, Chuang Wang, Haitao Zhou, Zhihao Hu, Chongxuan Li, Dong\n  Xu, Qian Yu","title":"Inversion-by-Inversion: Exemplar-based Sketch-to-Photo Synthesis via\n  Stochastic Differential Equations without Training","comments":"15 pages, preprint version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exemplar-based sketch-to-photo synthesis allows users to generate\nphoto-realistic images based on sketches. Recently, diffusion-based methods\nhave achieved impressive performance on image generation tasks, enabling\nhighly-flexible control through text-driven generation or energy functions.\nHowever, generating photo-realistic images with color and texture from sketch\nimages remains challenging for diffusion models. Sketches typically consist of\nonly a few strokes, with most regions left blank, making it difficult for\ndiffusion-based methods to produce photo-realistic images. In this work, we\npropose a two-stage method named ``Inversion-by-Inversion\" for exemplar-based\nsketch-to-photo synthesis. This approach includes shape-enhancing inversion and\nfull-control inversion. During the shape-enhancing inversion process, an\nuncolored photo is generated with the guidance of a shape-energy function. This\nstep is essential to ensure control over the shape of the generated photo. In\nthe full-control inversion process, we propose an appearance-energy function to\ncontrol the color and texture of the final generated photo.Importantly, our\nInversion-by-Inversion pipeline is training-free and can accept different types\nof exemplars for color and texture control. We conducted extensive experiments\nto evaluate our proposed method, and the results demonstrate its effectiveness.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:27:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xing","Ximing",""],["Wang","Chuang",""],["Zhou","Haitao",""],["Hu","Zhihao",""],["Li","Chongxuan",""],["Xu","Dong",""],["Yu","Qian",""]]}
{"id":"2308.07666","submitter":"Qian Chen","authors":"Qian Chen, Zhuan Ning, Yu Tian, Xiaoning Wu, Cheng-Yong Zhang, Hongbao\n  Zhang","title":"Time evolution of Einstein-Maxwell-scalar black holes after a thermal\n  quench","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We employ the holographic quench technique to drive Einstein-Maxwell-scalar\n(EMs) black holes out of equilibrium and study the real-time dynamics therein.\nFrom the fully nonlinear dynamical simulations, a dynamically unstable\nReissner-Nordstr$\\ddot{\\text{o}}$m anti-de Sitter (RN-AdS) black hole can be\nscalarized spontaneously after an arbitrarily small quench. On the other hand,\na dynamically stable scalarized black hole can be descalarized after a quench\nof sufficient strength. Interestingly, on the way to descalarization, the\nscalarized black hole behaves like a holographic superfluid, undergoing a\ndynamical transition from oscillatory to non-oscillatory decay. Such behaviors\nare related to the spectrums of quasi-normal modes of scalarized black holes,\nwhere the dominant mode migrates toward the imaginary axis with increasing\nquench strength. In addition, due to the $\\mathbb Z_{2}$-symmetry preserved by\nthe model, the ground state is degenerate. We find that there exists a\nthreshold for the quench strength that induces a dynamical transition of the\ngravitational system from one degenerate ground state to the other. Near the\nthreshold, the gravitational system is attracted to an excited state, that is,\na RN-AdS black hole with dynamical instability.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:29:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Qian",""],["Ning","Zhuan",""],["Tian","Yu",""],["Wu","Xiaoning",""],["Zhang","Cheng-Yong",""],["Zhang","Hongbao",""]]}
{"id":"2308.07667","submitter":"Jin Sun","authors":"Jin Sun","title":"Ramsey-type results on parameters related to domination","comments":"12 pages, 1 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a philosophy to discover Ramsey-type theorem: given a graph\nparameter $\\mu$, characterize the family $\\HH$ of graphs which satisfies that\nevery $\\HH$-free graph $G$ has bounded parameter $\\mu$. The classical Ramsey's\ntheorem deals the parameter $\\mu$ as the number of vertices. It also has a\ncorresponding connected version. This Ramsey-type problem on domination number\nhas been solved by Furuya. We will use this result to handle more parameters\nrelated to domination.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:33:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sun","Jin",""]]}
{"id":"2308.07668","submitter":"Piotr Koszmider","authors":"Piotr Koszmider","title":"On Ramsey-type properties of the distance in nonseparable spheres","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.FA math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given an uncountable subset $\\mathcal Y$ of a nonseparable Banach space, is\nthere an uncountable $\\mathcal Z\\subseteq \\mathcal Y$ such that the distances\nbetween any two distinct points of $\\mathcal Z$ are more or less the same? If\nan uncountable subset $\\mathcal Y$ of a nonseparable Banach space does not\nadmit an uncountable $\\mathcal Z\\subseteq \\mathcal Y$, where any two points are\ndistant by more than $r>0$, is it because $\\mathcal Y$ is the countable union\nof sets of diameters not bigger than $r$?\n  We investigate connections between the set-theoretic phenomena involved and\nthe geometric properties of uncountable subsets of nonseparable Banach spaces\nof densities up to $2^\\omega$ related to uncountable $(1+)$-separated sets,\nequilateral sets or Auerbach systems.\n  The results include geometric dichotomies for a wide range of classes of\nBanach spaces, some in ZFC, some under the assumption of OCA+MA and some under\na hypothesis on the descriptive complexity of the space as well as\nconstructions (in ZFC or under CH) of Banach spaces where the geometry of the\nunit sphere displays anti-Ramsey properties. This complements classical\ntheorems for separable spheres and the recent results of H\\'ajek, Kania, Russo\nfor densities above $2^\\omega$ as well as offers a synthesis of possible\nphenomena and categorization of examples for uncountable densities up to\n$2^\\omega$ obtained previousy by the author and Guzm\\'an, Hru\\v{s}\\'ak,\nRyduchowski and Wark.\n  It remains open if the dichotomies may consistently hold for all Banach\nspaces of the first uncountable density or if the strong anti-Ramsey properties\nof the distance on the unit sphere of a Banach space can be obtained in ZFC.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:35:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Koszmider","Piotr",""]]}
{"id":"2308.07669","submitter":"Yannic Rath","authors":"Yannic Rath","title":"Bayesian Modelling Approaches for Quantum States -- The Ultimate\n  Gaussian Process States Handbook","comments":"PhD Thesis, King's College London, 202 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Capturing the correlation emerging between constituents of many-body systems\naccurately is one of the key challenges for the appropriate description of\nvarious systems whose properties are underpinned by quantum mechanical\nfundamentals. This thesis discusses novel tools and techniques for the\n(classical) modelling of quantum many-body wavefunctions with the ultimate goal\nto introduce a universal framework for finding accurate representations from\nwhich system properties can be extracted efficiently. It is outlined how\nsynergies with standard machine learning approaches can be exploited to enable\nan automated inference of the most relevant intrinsic characteristics through\nrigorous Bayesian regression techniques. Based on the probabilistic framework\nforming the foundation of the introduced ansatz, coined the Gaussian Process\nState, different compression techniques are explored to extract numerically\nfeasible representations of relevant target states within stochastic schemes.\nBy following intuitively motivated design principles, the resulting model\ncarries a high degree of interpretability and offers an easily applicable tool\nfor the numerical study of quantum systems, including ones which are\nnotoriously difficult to simulate due to a strong intrinsic correlation. The\npractical applicability of the Gaussian Process States framework is\ndemonstrated within several benchmark applications, in particular, ground state\napproximations for prototypical quantum lattice models, Fermi-Hubbard models\nand $J_1-J_2$ models, as well as simple ab-initio quantum chemical systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:37:58 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 09:18:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rath","Yannic",""]]}
{"id":"2308.07670","submitter":"Segev Shlomov","authors":"Segev Shlomov, Jonathan Muehlstein, Nitzan Guetta, Lior Limonad","title":"Ongoing Tracking of Engagement in Motor Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Teaching motor skills such as playing music, handwriting, and driving, can\ngreatly benefit from recently developed technologies such as wearable gloves\nfor haptic feedback or robotic sensorimotor exoskeletons for the mediation of\neffective human-human and robot-human physical interactions. At the heart of\nsuch teacher-learner interactions still stands the critical role of the ongoing\nfeedback a teacher can get about the student's engagement state during the\nlearning and practice sessions. Particularly for motor learning, such feedback\nis an essential functionality in a system that is developed to guide a teacher\non how to control the intensity of the physical interaction, and to best adapt\nit to the gradually evolving performance of the learner. In this paper, our\nfocus is on the development of a near real-time machine-learning model that can\nacquire its input from a set of readily available, noninvasive,\nprivacy-preserving, body-worn sensors, for the benefit of tracking the\nengagement of the learner in the motor task. We used the specific case of\nviolin playing as a target domain in which data were empirically acquired, the\nlatent construct of engagement in motor learning was carefully developed for\ndata labeling, and a machine-learning model was rigorously trained and\nvalidated.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:38:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shlomov","Segev",""],["Muehlstein","Jonathan",""],["Guetta","Nitzan",""],["Limonad","Lior",""]]}
{"id":"2308.07671","submitter":"Fabian Wolf","authors":"Fabian Wolf","title":"A scheme for quantum-logic based transfer of accuracy in polarizability\n  measurement for trapped ions using a moving optical lattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical atomic clocks based on trapped ions suffer from systematic frequency\nshifts of the clock transition due to interaction with blackbody radiation from\nthe environment. These shifts can be compensated if the blackbody radiation\nspectrum and the differential dynamic polarizability is known to a sufficient\nprecision. Here, we present a new measurement scheme, based on quantum logic\nthat allows a direct transfer of precision for polarizability measurements from\none species to the other. This measurement circumvents the necessity of\ncalibrating laser power below the percent level, which is the limitation for\nstate-of-the-art polarizability measurements in trapped ions. Furthermore, the\npresented technique allows to reference the polarizability transfer to\nhydrogen-like ions for which the polarizability can be calculated with high\nprecision.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:38:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wolf","Fabian",""]]}
{"id":"2308.07672","submitter":"Shreyans Jain","authors":"Shreyans Jain, Tobias S\\\"agesser, Pavel Hrmo, Celeste Torkzaban,\n  Martin Stadler, Robin Oswald, Chris Axline, Amado Bautista-Salvador,\n  Christian Ospelkaus, Daniel Kienzler, and Jonathan Home","title":"Unit cell of a Penning micro-trap quantum processor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Trapped ions in radio-frequency traps are among the leading approaches for\nrealizing quantum computers, due to high-fidelity quantum gates and long\ncoherence times. However, the use of radio-frequencies presents a number of\nchallenges to scaling, including requiring compatibility of chips with high\nvoltages, managing power dissipation and restricting transport and placement of\nions. By replacing the radio-frequency field with a 3 T magnetic field, we here\nrealize a micro-fabricated Penning ion trap which removes these restrictions.\nWe demonstrate full quantum control of an ion in this setting, as well as the\nability to transport the ion arbitrarily in the trapping plane above the chip.\nThis unique feature of the Penning micro-trap approach opens up a modification\nof the Quantum CCD architecture with improved connectivity and flexibility,\nfacilitating the realization of large-scale trapped-ion quantum computing,\nquantum simulation and quantum sensing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:40:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jain","Shreyans",""],["S\u00e4gesser","Tobias",""],["Hrmo","Pavel",""],["Torkzaban","Celeste",""],["Stadler","Martin",""],["Oswald","Robin",""],["Axline","Chris",""],["Bautista-Salvador","Amado",""],["Ospelkaus","Christian",""],["Kienzler","Daniel",""],["Home","Jonathan",""]]}
{"id":"2308.07673","submitter":"Yutong Zhang","authors":"Yutong Zhang, Yao Li, Yin Li, Zhichang Guo","title":"A Review of Adversarial Attacks in Computer Vision","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV stat.CO stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks have been widely used in various downstream tasks,\nespecially those safety-critical scenario such as autonomous driving, but deep\nnetworks are often threatened by adversarial samples. Such adversarial attacks\ncan be invisible to human eyes, but can lead to DNN misclassification, and\noften exhibits transferability between deep learning and machine learning\nmodels and real-world achievability. Adversarial attacks can be divided into\nwhite-box attacks, for which the attacker knows the parameters and gradient of\nthe model, and black-box attacks, for the latter, the attacker can only obtain\nthe input and output of the model. In terms of the attacker's purpose, it can\nbe divided into targeted attacks and non-targeted attacks, which means that the\nattacker wants the model to misclassify the original sample into the specified\nclass, which is more practical, while the non-targeted attack just needs to\nmake the model misclassify the sample. The black box setting is a scenario we\nwill encounter in practice.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:43:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Yutong",""],["Li","Yao",""],["Li","Yin",""],["Guo","Zhichang",""]]}
{"id":"2308.07674","submitter":"Anirban Das","authors":"Anirban Das, Bent Weber, Shantanu Mukherjee","title":"Role of interface hybridization on induced superconductivity in\n  1T$^\\prime$-WTe$_2$ and 2H-NbSe$_2$ heterostructures","comments":null,"journal-ref":null,"doi":"10.1103/PhysRevB.108.075410","report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Heterostructures between two-dimensional quantum spin Hall insulators (QSHI)\nand superconducting materials can allow for the presence of Majorana Fermions\nat their conducting edge states. Although a strong interface hybridization\nhelps induce a reasonable superconducting gap on the topological material, the\nhybridization can modify the material's electronic structure. In this work, we\nutilize a realistic low-energy model with tunable interlayer hybridization to\nstudy the edge state physics in a heterostructure between monolayer quantum\nspin Hall insulator 1T$^\\prime$-WTe$_2$ and s-wave superconductor 2H-NbSe$_2$.\nWe find that even in the presence of strong inter-layer hybridization that\nrenders the surface to become conducting, the edge state shows a significantly\nenhanced local density of states and induced superconductivity compared to the\nsurface. We provide an alternate heterostructure geometry that can utilize the\nstrong inter-layer hybridization and realize a spatial interface between a\nregime with a clean QSHI gap and a topological conducting edge state.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:47:00 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Das","Anirban",""],["Weber","Bent",""],["Mukherjee","Shantanu",""]]}
{"id":"2308.07675","submitter":"Shengwen Gan","authors":"Shengwen Gan","title":"Exceptional set estimate through Brascamp-Lieb inequality","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Fix integers $1\\le k<n$, and numbers $a,s$ satisfying $0<s<\\min\\{k,a\\}$. The\nproblem of exceptional set estimate is to determine \\[T(a,s):=\\sup_{A\\subset\n\\mathbb{R}^n\\ \\text{dim}A=a}\\text{dim}(\\{ V\\in G(k,n): \\text{dim}(\\pi_V(A))<s\n\\}). \\] In this paper, we prove a new upper bound for $T(a,s)$ by using\nBrascamp-Lieb inequality. As one of the corollary, we obtain the estimate\n\\[T(a,\\frac{k}{n}a)\\le k(n-k)-\\min\\{k,n-k\\}, \\] which improves a previous\nresult $T(a,\\frac{k}{n}a)\\le k(n-k)-1$ of He.\n  By constructing examples, we can determine the explicit value of $T(a,s)$ for\ncertain $(a,s)$:\n  When $k\\le \\frac{n}{2}$, $\\beta\\in(0,1]$ and\n$\\gamma\\in(\\beta,\\frac{k}{n}(1+\\beta)]$, we have\n\\[T(1+\\beta,\\gamma)=k(n-k)-k.\\]\n  When $k\\ge \\frac{n}{2}$, $\\beta\\in(0,1]$ and $\\gamma\\in (\\beta,\n(1-\\frac{k}{n})+\\frac{k}{n}\\beta]$, we have\n\\[T(n-1+\\beta,k-1+\\gamma)=k(n-k)-(n-k).\\]\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:48:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gan","Shengwen",""]]}
{"id":"2308.07676","submitter":"Cheryl Lee","authors":"Cheryl Lee, Tianyi Yang, Zhuangbin Chen, Yuxin Su, Michael R. Lyu","title":"Maat: Performance Metric Anomaly Anticipation for Cloud Services with\n  Conditional Diffusion","comments":"This paper has been accepted by the Research track of the 38th\n  IEEE/ACM International Conference on Automated Software Engineering (ASE\n  2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensuring the reliability and user satisfaction of cloud services necessitates\nprompt anomaly detection followed by diagnosis.\n  Existing techniques for anomaly detection focus solely on real-time\ndetection, meaning that anomaly alerts are issued as soon as anomalies occur.\n  However, anomalies can propagate and escalate into failures, making\nfaster-than-real-time anomaly detection highly desirable for expediting\ndownstream analysis and intervention.\n  This paper proposes Maat, the first work to address anomaly anticipation of\nperformance metrics in cloud services.\n  Maat adopts a novel two-stage paradigm for anomaly anticipation, consisting\nof metric forecasting and anomaly detection on forecasts.\n  The metric forecasting stage employs a conditional denoising diffusion model\nto enable multi-step forecasting in an auto-regressive manner.\n  The detection stage extracts anomaly-indicating features based on domain\nknowledge and applies isolation forest with incremental learning to detect\nupcoming anomalies.\n  Thus, our method can uncover anomalies that better conform to human\nexpertise.\n  Evaluation on three publicly available datasets demonstrates that Maat can\nanticipate anomalies faster than real-time comparatively or more effectively\ncompared with state-of-the-art real-time anomaly detectors.\n  We also present cases highlighting Maat's success in forecasting abnormal\nmetrics and discovering anomalies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:50:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lee","Cheryl",""],["Yang","Tianyi",""],["Chen","Zhuangbin",""],["Su","Yuxin",""],["Lyu","Michael R.",""]]}
{"id":"2308.07677","submitter":"Meysam Korivand","authors":"M. Korivand, N. Soltankhah, and K. Khashyarmanesh","title":"Uniquely Distinguishing Colorable Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A graph is called uniquely distinguishing colorable if there is only one\npartition of vertices of the graph that forms distinguishing coloring with the\nsmallest possible colors. In this paper, we study the unique colorability of\nthe distinguishing coloring of a graph and its applications in computing the\ndistinguishing chromatic number of disconnected graphs. We introduce two\nfamilies of uniquely distinguishing colorable graphs, namely type 1 and type 2,\nand show that every disconnected uniquely distinguishing colorable graph is the\nunion of two isomorphic graphs of type 2. We obtain some results on bipartite\nuniquely distinguishing colorable graphs and show that any uniquely\ndistinguishing $n$-colorable tree with $ n \\geq 3$ is a star graph. For a\nconnected graph $G$, we prove that $\\chi_D(G\\cup G)=\\chi_D(G)+1$ if and only if\n$G$ is uniquely distinguishing colorable of type 1. Also, a characterization of\nall graphs $G$ of order $n$ with the property that $\\chi_{D}(G\\cup G) =\n\\chi_{D}(G) = k$, where $k=n-2, n-1, n$, is given in this paper. Moreover, we\ndetermine all graphs $G$ of order $n$ with the property that $\\chi_{D}(G\\cup G)\n= \\chi_{D}(G)+1 = \\ell$, where $\\ell=n-1, n, n+1$. Finally, we investigate the\nfamily of connected graphs $G$ with $\\chi_{D}(G\\cup G) = \\chi_{D}(G)+1 = 3$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:54:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Korivand","M.",""],["Soltankhah","N.",""],["Khashyarmanesh","K.",""]]}
{"id":"2308.07678","submitter":"Ze-Chun Hu","authors":"Ze-Chun Hu, Peng Lu, Qian-Qian Zhou, Xing-Wang Zhou","title":"The extreme values of the probability functions for some infinitely\n  divisible distributions motivated by Chv\\'{a}tal's theorem","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$.\nChv\\'{a}tal's theorem says that for any fixed $n\\geq 2$, as $m$ ranges over\n$\\{0,\\ldots,n\\}$, the probability $q_m:=P(B(n,m/n)\\leq m)$ is the smallest when\n$m$ is closest to $\\frac{2n}{3}$. Motivated by this theorem, in this note we\nconsider the minimum value of the probability $P(X\\leq \\kappa E[X])$, where\n$\\kappa$ is a positive real number, and $X$ is a random variable whose\ndistribution belongs to some infinitely divisible distributions including the\ninverse Gaussian, log-normal, Gumbel and logistic distributions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:10:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hu","Ze-Chun",""],["Lu","Peng",""],["Zhou","Qian-Qian",""],["Zhou","Xing-Wang",""]]}
{"id":"2308.07679","submitter":"Dongxiao Yu","authors":"Herbert Koch, Dongxiao Yu","title":"Asymptotic stability of the sine-Gordon kinks under perturbations in\n  weighted Sobolev norms","comments":"54 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the asymptotic stability of the sine-Gordon kinks under small\nperturbations in weighted Sobolev norms. Our main tool is the B\\\"acklund\ntransform which reduces the study of the asymptotic stability of the kinks to\nthe study of the asymptotic decay of solutions near zero. Our results consist\nof two parts. First, we present a different proof of the local asymptotic\nstability result in arXiv:2009.04260. In its proof, we apply a result obtained\nby the inverse scattering method on the local decay of the solutions with\nsufficiently small and localized initial data. Moreover, we prove an\n$L^\\infty$-type asymptotic stability result which is similar to that in\narXiv:2106.09605; the main difference is that we remove the assumptions on the\nspatial symmetry of the perturbations. In its proof, we apply a result obtained\nby the method of testing by wave packets on the pointwise decay of the\nsolutions with small and localized data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:12:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Koch","Herbert",""],["Yu","Dongxiao",""]]}
{"id":"2308.07680","submitter":"Shuonan Wu","authors":"Jindong Wang, Shuonan Wu","title":"Exponentially-fitted finite elements for $H({\\rm curl})$ and $H({\\rm\n  div})$ convection-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":"  This paper presents a novel approach to the construction of the lowest order\n$H(\\mathrm{curl})$ and $H(\\mathrm{div})$ exponentially-fitted finite element\nspaces ${\\mathcal{S}_{1^-}^{k}}~(k=1,2)$ on 3D simplicial mesh for\ncorresponding convection-diffusion problems. It is noteworthy that this method\nnot only facilitates the construction of the functions themselves but also\nprovides corresponding discrete fluxes simultaneously. Utilizing this approach,\nwe successfully establish a discrete convection-diffusion complex and employ a\nspecialized weighted interpolation to establish a bridge between the continuous\ncomplex and the discrete complex, resulting in a coherent framework.\nFurthermore, we demonstrate the commutativity of the framework when the\nconvection field is locally constant, along with the exactness of the discrete\nconvection-diffusion complex. Consequently, these types of spaces can be\ndirectly employed to devise the corresponding discrete scheme through a\nPetrov-Galerkin method.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:16:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Jindong",""],["Wu","Shuonan",""]]}
{"id":"2308.07681","submitter":"Bo Yu","authors":"Bo Yu, Ruijiang Jing","title":"SCTBEM: A scaled coordinate transformation boundary element method with\n  99-line MATLAB code","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 introduces the Scaled Coordinate Transformation Boundary Element\nMethod (SCTBEM), a novel boundary-type method for solving 3D potential\nproblems. To address the challenges of applying the Boundary Element Method\n(BEM) to complex problems, it is common practice to use the fundamental\nsolution corresponding to the partial governing equation operator to establish\nthe integral equation. However, this approach introduces domain integral, which\nmay jeopardize the dimensionality reduction advantages of BEM. To preserve the\nbenefits of dimensionality reduction, this paper proposes a novel domain\nintegral transformation method known as the Scaled Coordinate Transformation\n(SCT). The SCT is purely a mathematical operation that does not rely on\nparticular solution of operators, which requires only discretization on the\nstructure's surface while remaining analytical in the radial direction. An even\nbetter novelty is that the lower-order singularity can be eliminated by\ncoordinate translation technique. To facilitate the wider adoption of BEM, the\nauthors present 99-line MATLAB code. Numerical results confirm that the SCTBEM\nexhibits high numerical accuracy even when dealing with complex model.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:16:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yu","Bo",""],["Jing","Ruijiang",""]]}
{"id":"2308.07682","submitter":"K. Wyczesany","authors":"A. Kausamo, L. De Pascale, K. Wyczesany","title":"60 years of cyclic monotonicity: a survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The primary purpose of this note is to provide an instructional summary of\nthe state of the art regarding cyclic monotonicity and related notions. We will\nalso present how these notions are tied to optimality in the optimal transport\n(or Monge-Kantorovich) problem.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:19:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kausamo","A.",""],["De Pascale","L.",""],["Wyczesany","K.",""]]}
{"id":"2308.07683","submitter":"Doosung Park","authors":"Doosung Park","title":"On the log motivic stable homotopy groups","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compare the log motivic stable homotopy category and the usual motivic\nstable homotopy category over a perfect field admitting resolution of\nsingularities. As a consequence, we show that the log motivic stable homotopy\ngroups are isomorphic to the usual motivic stable homotopy groups.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:20:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Park","Doosung",""]]}
{"id":"2308.07684","submitter":"Ajani De Vas Gunasekara","authors":"Ajani De Vas Gunasekara and Alice Devillers","title":"Transitive path decompositions of Cartesian products of complete graphs","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.GR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  An $H$-decomposition of a graph $\\Gamma$ is a partition of its edge set into\nsubgraphs isomorphic to $H$. A transitive decomposition is a special kind of\n$H$-decomposition that is highly symmetrical in the sense that the subgraphs\n(copies of $H$) are preserved and transitively permuted by a group of\nautomorphisms of $\\Gamma$. This paper concerns transitive $H$-decompositions of\nthe graph $K_n \\Box K_n$ where $H$ is a path. When $n$ is an odd prime, we\npresent a construction for a transitive path decomposition where the paths in\nthe decomposition are arbitrary large.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:29:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gunasekara","Ajani De Vas",""],["Devillers","Alice",""]]}
{"id":"2308.07685","submitter":"Birgit Fuhrmeister","authors":"B. Fuhrmeister, S. Czesla, J.H.M.M. Schmitt, P.C. Schneider, J. A.\n  Caballero, S. V. Jeffers, E. Nagel, D. Montes, M. C. G\\'alves Ortiz, A.\n  Reinerns, I. Ribas, A. Quirrenbach, P.J. Amado, Th. Henning, N. Lodieu, P.\n  Mart\\'in-Fern\\'andez, J. C. Morales, P. Sch\\\"ofer, W. Seifert, M. Zechmeister","title":"The CARMENES search for exoplanets around M dwarfs. Behaviour of the\n  Paschen lines during flares and quiescence","comments":"21 pages, 22 figures, 7 tables, accepted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The hydrogen Paschen lines are known activity indicators, but studies of them\nin M~dwarfs during quiescence are as rare as their reports in flare studies.\nThis situation is mostly caused by a lack of observations, owing to their\nlocation in the near-infrared regime, which is covered by few high-resolution\nspectrographs. We study the Pa$\\beta$ line, using a sample of 360 M~dwarfs\nobserved by the CARMENES spectrograph. Descending the spectral sequence of\ninactive M~stars in quiescence, we find the Pa$\\beta$ line to get shallower\nuntil about spectral type M3.5 V, after which a slight re-deepening is\nobserved. Looking at the whole sample, for stars with H$\\alpha$ in absorption,\nwe find a loose anti-correlation between the (median) pseudo-equivalent widths\n(pEWs) of H$\\alpha$ and Pa$\\beta$ for stars of similar effective temperature.\nLooking instead at time series of individual stars, we often find correlation\nbetween pEW(H$\\alpha$) and pEW(Pa$\\beta$) for stars with H$\\alpha$ in emission\nand an anti-correlation for stars with H$\\alpha$ in absorption. Regarding\nflaring activity, we report the automatic detection of 35 Paschen line flares\nin 20 stars. Additionally we found visually six faint Paschen line flares in\nthese stars plus 16 faint Paschen line flares in another 12 stars. In strong\nflares, Paschen lines can be observed up to Pa 14. Moreover, we find that\nPaschen line emission is almost always coupled to symmetric H$\\alpha$ line\nbroadening, which we ascribe to Stark broadening, indicating high pressure in\nthe chromosphere. Finally we report a few Pa$\\beta$ line asymmetries for flares\nthat also exhibit strong H$\\alpha$ line asymmetries.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:31:05 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fuhrmeister","B.",""],["Czesla","S.",""],["Schmitt","J. H. M. M.",""],["Schneider","P. C.",""],["Caballero","J. A.",""],["Jeffers","S. V.",""],["Nagel","E.",""],["Montes","D.",""],["Ortiz","M. C. G\u00e1lves",""],["Reinerns","A.",""],["Ribas","I.",""],["Quirrenbach","A.",""],["Amado","P. J.",""],["Henning","Th.",""],["Lodieu","N.",""],["Mart\u00edn-Fern\u00e1ndez","P.",""],["Morales","J. C.",""],["Sch\u00f6fer","P.",""],["Seifert","W.",""],["Zechmeister","M.",""]]}
{"id":"2308.07686","submitter":"Hong Li","authors":"Hong Li, Xingyu Li, Pengbo Hu, Yinuo Lei, Chunxiao Li, Yi Zhou","title":"Boosting Multi-modal Model Performance with Adaptive Gradient Modulation","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":"  While the field of multi-modal learning keeps growing fast, the deficiency of\nthe standard joint training paradigm has become clear through recent studies.\nThey attribute the sub-optimal performance of the jointly trained model to the\nmodality competition phenomenon. Existing works attempt to improve the jointly\ntrained model by modulating the training process. Despite their effectiveness,\nthose methods can only apply to late fusion models. More importantly, the\nmechanism of the modality competition remains unexplored. In this paper, we\nfirst propose an adaptive gradient modulation method that can boost the\nperformance of multi-modal models with various fusion strategies. Extensive\nexperiments show that our method surpasses all existing modulation methods.\nFurthermore, to have a quantitative understanding of the modality competition\nand the mechanism behind the effectiveness of our modulation method, we\nintroduce a novel metric to measure the competition strength. This metric is\nbuilt on the mono-modal concept, a function that is designed to represent the\ncompetition-less state of a modality. Through systematic investigation, our\nresults confirm the intuition that the modulation encourages the model to rely\non the more informative modality. In addition, we find that the jointly trained\nmodel typically has a preferred modality on which the competition is weaker\nthan other modalities. However, this preferred modality need not dominate\nothers. Our code will be available at\nhttps://github.com/lihong2303/AGM_ICCV2023.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:37:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Hong",""],["Li","Xingyu",""],["Hu","Pengbo",""],["Lei","Yinuo",""],["Li","Chunxiao",""],["Zhou","Yi",""]]}
{"id":"2308.07687","submitter":"Ruiyuan Gao","authors":"Ruiyuan Gao, Chenchen Zhao, Lanqing Hong, Qiang Xu","title":"DiffGuard: Semantic Mismatch-Guided Out-of-Distribution Detection using\n  Pre-trained Diffusion Models","comments":"Accepted by ICCV2023, with supplementary materials","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":"  Given a classifier, the inherent property of semantic Out-of-Distribution\n(OOD) samples is that their contents differ from all legal classes in terms of\nsemantics, namely semantic mismatch. There is a recent work that directly\napplies it to OOD detection, which employs a conditional Generative Adversarial\nNetwork (cGAN) to enlarge semantic mismatch in the image space. While achieving\nremarkable OOD detection performance on small datasets, it is not applicable to\nImageNet-scale datasets due to the difficulty in training cGANs with both input\nimages and labels as conditions. As diffusion models are much easier to train\nand amenable to various conditions compared to cGANs, in this work, we propose\nto directly use pre-trained diffusion models for semantic mismatch-guided OOD\ndetection, named DiffGuard. Specifically, given an OOD input image and the\npredicted label from the classifier, we try to enlarge the semantic difference\nbetween the reconstructed OOD image under these conditions and the original\ninput image. We also present several test-time techniques to further strengthen\nsuch differences. Experimental results show that DiffGuard is effective on both\nCifar-10 and hard cases of the large-scale ImageNet, and it can be easily\ncombined with existing OOD detection techniques to achieve state-of-the-art OOD\ndetection results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:37:04 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 05:24:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gao","Ruiyuan",""],["Zhao","Chenchen",""],["Hong","Lanqing",""],["Xu","Qiang",""]]}
{"id":"2308.07688","submitter":"Soroosh Tayebi Arasteh","authors":"Soroosh Tayebi Arasteh, Leo Misera, Jakob Nikolas Kather, Daniel\n  Truhn, Sven Nebelung","title":"Enhancing Network Initialization for Medical AI Models Using\n  Large-Scale, Unlabeled Natural Images","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":"  Pre-training datasets, like ImageNet, have become the gold standard in\nmedical image analysis. However, the emergence of self-supervised learning\n(SSL), which leverages unlabeled data to learn robust features, presents an\nopportunity to bypass the intensive labeling process. In this study, we\nexplored if SSL for pre-training on non-medical images can be applied to chest\nradiographs and how it compares to supervised pre-training on non-medical\nimages and on medical images. We utilized a vision transformer and initialized\nits weights based on (i) SSL pre-training on natural images (DINOv2), (ii) SL\npre-training on natural images (ImageNet dataset), and (iii) SL pre-training on\nchest radiographs from the MIMIC-CXR database. We tested our approach on over\n800,000 chest radiographs from six large global datasets, diagnosing more than\n20 different imaging findings. Our SSL pre-training on curated images not only\noutperformed ImageNet-based pre-training (P<0.001 for all datasets) but, in\ncertain cases, also exceeded SL on the MIMIC-CXR dataset. Our findings suggest\nthat selecting the right pre-training strategy, especially with SSL, can be\npivotal for improving artificial intelligence (AI)'s diagnostic accuracy in\nmedical imaging. By demonstrating the promise of SSL in chest radiograph\nanalysis, we underline a transformative shift towards more efficient and\naccurate AI models in medical imaging.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:37:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Arasteh","Soroosh Tayebi",""],["Misera","Leo",""],["Kather","Jakob Nikolas",""],["Truhn","Daniel",""],["Nebelung","Sven",""]]}
{"id":"2308.07689","submitter":"Jingyu Gao","authors":"Jingyu Gao and Xiurui Geng","title":"high-order proximal point algorithm for the monotone variational\n  inequality problem and its application","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The proximal point algorithm (PPA) has been developed to solve the monotone\nvariational inequality problem. It provides a theoretical foundation for some\nmethods, such as the augmented Lagrangian method (ALM) and the alternating\ndirection method of multipliers (ADMM). This paper generalizes the PPA to the\n$p$th-order ($p\\geq 1$) and proves its convergence rate $O\n\\left(1/k^{p/2}\\right)$ . Additionally, the $p$th-order ALM is proposed based\non the $p$th-order PPA. Some numerical experiments are presented to demonstrate\nthe performance of the $p$th-order ALM.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:38:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gao","Jingyu",""],["Geng","Xiurui",""]]}
{"id":"2308.07690","submitter":"Arthur Vesperini","authors":"Arthur Vesperini and Roberto Franzosi","title":"Entanglement, quantum correlators and connectivity in graph states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present a comprehensive exploration of the entanglement and\ngraph connectivity properties of graph states. We quantify the entanglement in\npseudo graph states using the entanglement distance, a recently introduced\nmeasure of entanglement. Additionally, we propose a novel approach to probe the\nunderlying graph connectivity of genuine graph states, using quantum\ncorrelators of Pauli matrices. Our findings also reveal interesting\nimplications for measurement processes, demonstrating the equivalence of\ncertain projective measurements. Finally, we emphasize the simplicity of data\nanalysis within this framework. This work contributes to a deeper understanding\nof the entanglement and connectivity properties of graph states, offering\nvaluable insights for quantum information processing and quantum computing\napplications. In this work, we do not resort to the celebrated stabilizer\nformalism, which is the framework typically preferred for the study of this\ntype of state; on the contrary, our approach is solely based on the concepts of\nexpectation values, quantum correlations and projective measurement, which have\nthe advantage of being very intuitive and fundamental tools of quantum theory.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:42:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vesperini","Arthur",""],["Franzosi","Roberto",""]]}
{"id":"2308.07691","submitter":"Zhengli Wang","authors":"Zhengli Wang (1), Jiguang Lu (2 3), Jinchen Jiang (2), Shunshun Cao\n  (4), Kejia Lee (4 and 5), Enwei Liang (1), Lunhua Shang (6) Renxin Xu (7 4\n  and 5), and Weiwei Zhu (2) ( (1) Guangxi Key Laboratory for Relativistic\n  Astrophysics, School of Physical Science and Technology, Guangxi University,\n  Nanning 530004, China, (2) National Astronomical Observatories, Chinese\n  Academy of Sciences, Beijing 100012, China, (3) Guizhou Radio Astronomical\n  Observatory, Guiyang 550025, China, (4) Department of Astronomy, School of\n  Physics, Peking University, Beijing 100871, China, (5) Kavli Institute for\n  Astronomy and Astrophysics, Peking University, Beijing 100871, China, (6)\n  Guizhou Normal University, Guiyang 550025, China, (7) State Key Laboratory of\n  Nuclear Physics and Technology, Peking University, Beijing 100871, China)","title":"Radio pulsar B0950$+$08: Radiation in Magnetosphere and Sparks above\n  Surface","comments":"13 pages, 9 figures, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nearby radio pulsar B0950$+$08 with full duty cycle is targeted by the\nFive-hundred-meter Aperture Spherical radio Telescope (FAST, 110 minutes\nallocated), via adopting polarization calibration on two ways of baseline\ndetermination, in order to understand its magnetospheric radiation geometry as\nwell as the polar cap sparking. % The radiation of the main pulse could not be\ninformative of magnetic field line planes due to its low linear polarization\n($<10 \\%$) and the position angle jumps, and the polarization position angle in\nthe pulse longitudes whose linear fractions are larger than $ \\sim 30 \\%$ is\nthus fitted in the classical rotating vector model (RVM). % The best RVM fit\nindicates that the inclination angle, $\\alpha$, and the impact angle, $\\beta$,\nof this pulsar are $100.5^{\\circ}$ and $-33.2^{\\circ}$, respectively,\nsuggesting that the radio emission comes from two poles. % Polar cap sparking\nin the vacuum gap model, either the annular gap or the core gap, is therefore\ninvestigated in this RVM geometry, resulting in a high-altitude magnetospheric\nemission at heights from $\\sim 0.25R_{\\rm LC}$ to $\\sim 0.56R_{\\rm LC}$, with\n$R_{\\rm LC}$ the light cylinder radius. % It is evident that both sparking\npoints of the main and inter pulses are located mainly away from the magnetic\npole, that is meaningful in the physics of pulsar surface and is even relevant\nto pulsar's inner structure.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:42:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zhengli","","4 and 5"],["Lu","Jiguang","","4 and 5"],["Jiang","Jinchen","","4 and 5"],["Cao","Shunshun","","4 and 5"],["Lee","Kejia","","4 and 5"],["Liang","Enwei","","7 4\n  and 5"],["Shang","Lunhua","","7 4\n  and 5"],["Xu","Renxin","","7 4\n  and 5"],["Zhu","Weiwei",""]]}
{"id":"2308.07692","submitter":"Norman Khan","authors":"Norman Khan, Matthew. J. Middleton","title":"Long-Term X-Ray/UV Variability in ULXs","comments":"14 pages, 13 Figures","journal-ref":"Monthly Notices of the Royal Astronomical Society, Volume 524,\n  Issue 3, pp.4302-4314, September 2023","doi":"10.1093/mnras/stad2071","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The focus of NASA's Swift telescope has been transients and\ntarget-of-opportunity observing, resulting in many observations of\nultraluminous X-ray sources (ULXs) over the last ~20 years. For the vast\nmajority of these observations, simultaneous data has been obtained using both\nthe X-ray telescope (XRT) and the ultraviolet and optical telescope (UVOT),\nproviding a unique opportunity to study coupled variability between these\nbands. Using a sample of ~40 ULXs with numerous repeat observations, we extract\nstacked images to characterise the spatial extent of the UV-Optical emission\nand extract long-term light curves to search for first-order linear\ncorrelations between the UV and X-ray emission. We find that a small subset may\nshow weakly correlated joint variability, while other sources appear to display\nnon-linear relationships between the bands. We discuss these observations in\nthe context of several theoretical models: precession, irradiation of the outer\naccretion disc and irradiation of the companion star. We conclude that more\ncomplicated analysis or higher quality data may be required to accurately\nconstrain the nature of the joint X-ray and UV/optical emission in these\nsources.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:44:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Khan","Norman",""],["Middleton","Matthew. J.",""]]}
{"id":"2308.07693","submitter":"Simon Haine","authors":"Liam Fuderer and Joseph J Hope and Simon A Haine","title":"A hybrid method of generating spin-squeezed states for quantum-enhanced\n  atom interferometry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce a new spin-squeezing technique that is a hybrid of two well\nestablished spin-squeezing techniques, quantum nondemolition measurement (QND)\nand one-axis twisting (OAT). This hybrid method aims to improve spin-squeezing\nover what is currently achievable using QND and OAT. In practical situations,\nthe strength of both the QND and OAT interactions is limited. We found that in\nthese situations, the hybrid scheme performed considerably better than either\nOAT or QND used in isolation. As QND and OAT have both been realised\nexperimentally, this technique could be implemented in current atom\ninterferometry setups with only minor modifications to the experiment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:46:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fuderer","Liam",""],["Hope","Joseph J",""],["Haine","Simon A",""]]}
{"id":"2308.07694","submitter":"Henry Strauss","authors":"H. R.Strauss","title":"Models of Tokamak Disruptions","comments":"arXiv admin note: text overlap with arXiv:2304.07994","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Disruptions are a serious issue in tokamaks. In a disruption, the thermal\nenergy is lost by means of an instability which could be a resistive wall\ntearing mode (RWTM). During precursors to a disruption, the plasma edge region\ncools, causing the current to contract. Model sequences of contracted current\nequilibria are given, and their stability is calculated. A linear stability\nstudy shows that there is a maximum value of edge $q_a \\approx 3$ for RWTMs to\noccur. This also implies a minimum rational surface radius normalized to plasma\nradius from RWTMs to be unstable. Nonlinear simulations are performed using a\nsimilar model sequence derived from an equilibrium reconstruction. There is a\nstriking difference in the results, depending on whether the wall is ideal or\nresistive. With an ideal wall, the perturbations saturate at moderate\namplitude, causing a minor disruption without a thermal quench. With a\nresistive wall, there is a major disruption with a thermal quench, if the edge\n$q_a \\le 3.$ There is a sharp transition in nonlinear behavior at $q_a = 3.$\nThis is consistent with the linear model and with experiments. If disruptions\nare caused by RWTMs, then devices with highly conducting walls, such as the\nInternational Tokamak Experimental Reactor (ITER) will experience much milder,\ntolerable, disruptions than presently predicted.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:51:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Strauss","H. R.",""]]}
{"id":"2308.07695","submitter":"Hiren Kakkad","authors":"Hiren Kakkad","title":"Scattering Amplitudes in the Yang-Mills sector of Quantum Chromodynamics","comments":"Thesis, 236 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive a new Minkowski space action for the pure gluonic sector of QCD\nthat implements new interaction vertices local in the light-cone time with at\nleast four legs and fixed helicities - the lowest vertex is the four-point MHV\n(Maximally Helicity Violating), higher point vertices include $\\mathrm{N}^k\n\\mathrm{MHV}$, where 1 $\\leqslant$ k $\\leqslant $ n-4 and n is the number of\nexternal legs. The abscense of triple point interaction vertices makes it\nefficient in calculating higher multiplicity pure gluonic scattering\namplitudes. This formulation is obtained via a canonical transformation of the\nlight-cone Yang-Mills action, with the field transformations based on Wilson\nline functionals. At the quantum level, the action can only provide\ncut-constructible parts of amplitudes in 4D. In order to remedy that, we\nconstructed the one-loop effective action starting with the Yang-Mills theory,\nwhich explicitly provides the missing contributions. This work provides a new\nfield-theory action-based method to efficiently calculate higher multiplicity\npure gluonic scattering amplitudes up to one loop.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:52:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kakkad","Hiren",""]]}
{"id":"2308.07696","submitter":"Tatyana Turova","authors":"Vasilii Goriachkin and Tatyana Turova","title":"Scaling of Components in Critical Geometric Random Graphs on 2-dim Torus","comments":"65 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider random graphs on the set of $N^2$ vertices placed on the discrete\n$2$-dimensional torus. The edges between pairs of vertices are independent, and\ntheir probabilities decay with the distance $\\rho$ between these vertices as\n$(N\\rho)^{-1}$. This is an example of an inhomogeneous random graph which is\nnot of rank 1. The reported previously results on the sub- and super-critical\ncases of this model exhibit great similarity to the classical\nErd\\H{o}s-R\\'{e}nyi graphs.\n  Here we study the critical phase. A diffusion approximation for the size of\nthe largest connected component rescaled with $(N^2)^{-2/3}$ is derived. This\ncompletes the proof that in all regimes the model is within the same class as\nErd\\H{o}s-R\\'{e}nyi graph with respect to scaling of the largest component.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:54:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Goriachkin","Vasilii",""],["Turova","Tatyana",""]]}
{"id":"2308.07697","submitter":"Na\\\"imo Davier","authors":"Na\\\"imo Davier, Revaz Ramazashvili","title":"Electron states, bound to a texture in a N\\'eel antiferromagnet","comments":"20 pages, 15 figures, 3 appendices, 36 references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study electron states, bound to topological textures such as skyrmions and\ndomain walls in a N\\'eel antiferromagnet. In certain limits, we find the\ndependence of bound states on the geometry of the texture, and estimate the\nbound-state contribution to its energy. This contribution proves significant\ncompared with the purely magnetic energy, and substantially affects the\nequilibrium geometry of the texture. The bound-state contribution also induces\na large shift of the transition line between the modulated and the uniform\nphase, extending the latter.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:57:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Davier","Na\u00efmo",""],["Ramazashvili","Revaz",""]]}
{"id":"2308.07698","submitter":"Krystian Gajdzica","authors":"Krystian Gajdzica, Bernhard Heim and Markus Neuhauser","title":"Polynomization of the Bessenrodt-Ono type inequalities for A-partition\n  functions","comments":"18 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For an arbitrary set or multiset $A$ of positive integers, we associate the\n$A$-partition function $p_A(n)$ (that is the number of partitions of $n$ whose\nparts belong to $A$). We also consider the analogue of the $k$-colored\npartition function, namely, $p_{A,-k}(n)$. Further, we define a family of\npolynomials $f_{A,n}(x)$ which satisfy the equality $f_{A,n}(k)=p_{A,-k}(n)$\nfor all $n\\in\\mathbb{Z}_{\\geq0}$ and $k\\in\\mathbb{N}$. This paper concerns the\npolynomization of the Bessenrodt--Ono type inequality for $f_{A,n}(x)$:\n\\begin{align*}\n  f_{A,a}(x)f_{A,b}(x)>f_{A,a+b}(x), \\end{align*} where $a$ and $b$ are\narbitrary positive integers; and delivers some efficient criteria for its\nsolutions. Moreover, we also investigate a few basic properties related to both\nfunctions $f_{A,n}(x)$ and $f_{A,n}'(x)$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 10:59:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gajdzica","Krystian",""],["Heim","Bernhard",""],["Neuhauser","Markus",""]]}
{"id":"2308.07699","submitter":"Leonie Woodland","authors":"Leonie Woodland, David Macdougal, Ivelisse Cabrera, Jordan D.\n  Thompson, D. Prabhakaran, Robert I. Bewley, Radu Coldea","title":"Tuning the confinement potential between spinons in the Ising chain\n  CoNb2O6 using longitudinal fields and quantitative determination of the\n  microscopic Hamiltonian","comments":"20 pages, 13 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 Ising chain realizes the fundamental paradigm of spin fractionalization,\nwhere locally flipping a spin creates two domain walls (spinons) that can\nseparate apart at no energy cost. In a quasi-one-dimensional system, the\nmean-field effects of the weak three-dimensional couplings confine the spinons\ninto a Zeeman ladder of two-spinon bound states. Here, we experimentally tune\nthe confinement potential between spinons in the quasi-one-dimensional Ising\nferromagnet CoNb2O6 by means of an applied magnetic field with a large\ncomponent along the Ising direction. Using high-resolution single crystal\ninelastic neutron scattering, we directly observe how the spectrum evolves from\nthe limit of very weak confinement at low field (with many closely-spaced bound\nstates with energies scaling as the field strength to the power 2/3) to very\nstrong confinement at high field (where it consists of a magnon and a\ndispersive two-magnon bound state, with a linear field dependence). At\nintermediate fields, we explore how the higher-order bound states disappear\nfrom the spectrum as they move to higher energies and overlap with the\ntwo-particle continuum. By performing a global fit to the observed spectrum in\nzero field and high field applied along two orthogonal directions, combined\nwith a quantitative parameterization of the interchain couplings, we propose a\nrefined single chain and interchain Hamiltonian that quantitatively reproduces\nall observed dispersions and their field dependence.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:00:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Woodland","Leonie",""],["Macdougal","David",""],["Cabrera","Ivelisse",""],["Thompson","Jordan D.",""],["Prabhakaran","D.",""],["Bewley","Robert I.",""],["Coldea","Radu",""]]}
{"id":"2308.07700","submitter":"Serhii Nazarovets","authors":"Serhii Nazarovets, Olesya Mryglod","title":"Ukrainian Arts and Humanities research in Scopus: A Bibliometric\n  Analysis","comments":"Library Hi Tech (2023)","journal-ref":null,"doi":"10.1108/LHT-05-2023-0180","report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article presents the results of a quantitative analysis of Ukrainian\nArts and Humanities (A&H) research from 2012 to 2021, as observed in Scopus.\nThe overall publication activity and the relative share of A&H publications in\nrelation to Ukraine's total research output, comparing them with other\ncountries. The study analyzes the diversity and total number of sources, as\nwell as the geographic distribution of authors and citing authors, to provide\ninsights into the internationalization level of Ukrainian A&H research.\nAdditionally, the topical spectrum and language usage are considered to\ncomplete the overall picture. According to our results, the publication\npatterns for Ukrainian A&H research exhibit dynamics comparable to those of\nother countries, with a gradual increase in the total number of papers and\nsources. However, the citedness is lower than expected, and the share of\npublications in top-quartile sources is lower for 2020-2021 period compared to\nthe previous years. The impact of internationally collaborative papers,\nespecially those in English, is higher. Nevertheless, over half of all works\nremain uncited, probably due to the limited readership of the journals selected\nfor publication.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:05:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nazarovets","Serhii",""],["Mryglod","Olesya",""]]}
{"id":"2308.07701","submitter":"Anuradha Jagannathan","authors":"Anuradha Jagannathan and Michel Duneau","title":"Properties of the Ammann-Beenker tiling and its square approximants","comments":"Review submitted to Isr.J.Chem special volume for Proceedings of\n  ICQ15","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our understanding of physical properties of quasicrystals owes a great deal\nto studies of tight-binding models constructed on quasiperiodic tilings. Among\nthe large number of possible quasiperiodic structures, two dimensional tilings\nare of particular importance -- in their own right but also for providing clues\nto properties of three dimensional systems. In this review we have provided a\nusers manual for those wishing to construct and study physical properties of\none of the best-known 2D tilings, the 8-fold Ammann-Beenker quasicrystal. We\ndescribe the methodology in some detail. We also provide a compendium of the\nprincipal geometric properties of the infinite quasicrystal and its periodic\napproximants some of which have not previously been published.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:05:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jagannathan","Anuradha",""],["Duneau","Michel",""]]}
{"id":"2308.07702","submitter":"Aobo Kong","authors":"Aobo Kong, Shiwan Zhao, Hao Chen, Qicheng Li, Yong Qin, Ruiqi Sun, Xin\n  Zhou","title":"Better Zero-Shot Reasoning with Role-Play Prompting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern large language models (LLMs), such as ChatGPT, exhibit a remarkable\ncapacity for role-playing, enabling them to embody not only human characters\nbut also non-human entities like a Linux terminal. This versatility allows them\nto simulate complex human-like interactions and behaviors within various\ncontexts, as well as to emulate specific objects or systems. While these\ncapabilities have enhanced user engagement and introduced novel modes of\ninteraction, the influence of role-playing on LLMs' reasoning abilities remains\nunderexplored. In this study, we introduce a strategically designed role-play\nprompting methodology and assess its performance under the zero-shot setting\nacross twelve diverse reasoning benchmarks, encompassing arithmetic,\ncommonsense reasoning, symbolic reasoning, and more. Leveraging models such as\nChatGPT and Llama 2, our empirical results illustrate that role-play prompting\nconsistently surpasses the standard zero-shot approach across most datasets.\nNotably, accuracy on AQuA rises from 53.5% to 63.8%, and on Last Letter from\n23.8% to 84.2%. Beyond enhancing contextual understanding, we posit that\nrole-play prompting serves as an implicit Chain-of-Thought (CoT) trigger,\nthereby improving the quality of reasoning. By comparing our approach with the\nZero-Shot-CoT technique, which prompts the model to \"think step by step\", we\nfurther demonstrate that role-play prompting can generate a more effective CoT.\nThis highlights its potential to augment the reasoning capabilities of LLMs.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:08:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kong","Aobo",""],["Zhao","Shiwan",""],["Chen","Hao",""],["Li","Qicheng",""],["Qin","Yong",""],["Sun","Ruiqi",""],["Zhou","Xin",""]]}
{"id":"2308.07703","submitter":"Benjamin Bach","authors":"Benjamin Bach, Mandy Keck, Fateme Rajabiyazdi, Tatiana Losev, Isabel\n  Meirelles, Jason Dykes, Robert S. Laramee, Mashael AlKadi, Christina Stoiber,\n  Samuel Huron, Charles Perin, Luiz Morais, Wolfgang Aigner, Doris Kosminsky,\n  Magdalena Boucher, S{\\o}ren Knudsen, Areti Manataki, Jan Aerts, Uta Hinrichs,\n  Jonathan C. Roberts, Sheelagh Carpendale","title":"Challenges and Opportunities in Data Visualization Education: A Call to\n  Action","comments":"Accepted for publication at VIS 2023 Conference, Melbourne, VIC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is a call to action for research and discussion on data\nvisualization education. As visualization evolves and spreads through our\nprofessional and personal lives, we need to understand how to support and\nempower a broad and diverse community of learners in visualization. Data\nVisualization is a diverse and dynamic discipline that combines knowledge from\ndifferent fields, is tailored to suit diverse audiences and contexts, and\nfrequently incorporates tacit knowledge. This complex nature leads to a series\nof interrelated challenges for data visualization education. Driven by a lack\nof consolidated knowledge, overview, and orientation for visualization\neducation, the 21 authors of this paper-educators and researchers in data\nvisualization-identify and describe 19 challenges informed by our collective\npractical experience. We organize these challenges around seven themes People,\nGoals & Assessment, Environment, Motivation, Methods, Materials, and Change.\nAcross these themes, we formulate 43 research questions to address these\nchallenges. As part of our call to action, we then conclude with 5\ncross-cutting opportunities and respective action items: embrace\nDIVERSITY+INCLUSION, build COMMUNITIES, conduct RESEARCH, act AGILE, and relish\nRESPONSIBILITY. We aim to inspire researchers, educators and learners to drive\nvisualization education forward and discuss why, how, who and where we educate,\nas we learn to use visualization to address challenges across many scales and\nmany domains in a rapidly changing world: viseducationchallenges.github.io.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:21:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bach","Benjamin",""],["Keck","Mandy",""],["Rajabiyazdi","Fateme",""],["Losev","Tatiana",""],["Meirelles","Isabel",""],["Dykes","Jason",""],["Laramee","Robert S.",""],["AlKadi","Mashael",""],["Stoiber","Christina",""],["Huron","Samuel",""],["Perin","Charles",""],["Morais","Luiz",""],["Aigner","Wolfgang",""],["Kosminsky","Doris",""],["Boucher","Magdalena",""],["Knudsen","S\u00f8ren",""],["Manataki","Areti",""],["Aerts","Jan",""],["Hinrichs","Uta",""],["Roberts","Jonathan C.",""],["Carpendale","Sheelagh",""]]}
{"id":"2308.07704","submitter":"Zhenyang Wang","authors":"Jing-Juan Qi, Zhen-Yang Wang, Zhu-Feng Zhang, and Xin-Heng Guo","title":"The properties of the $S$-wave $D_s\\bar{D}_s$ bound state","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this work, we investigate possible bound states of the $D_s\\bar{D}_s$\nsystem in the Bethe-Salpeter formalism in the ladder and instantaneous\napproximations. By numerically solving the Bethe-Salpeter equation with a\nkernel that includes the contributions from $\\phi$ and $J/\\psi$ exchanges, we\nconfirm the existence of a bound state in the $D_s\\bar{D}_s$ system. We further\ninvestigate the partial decay widths of the $D_s\\bar{D}_s$ bound state into\n$D\\bar{D}$, $\\eta_c\\eta$, and $J/\\psi\\omega$, finding that these partial widths\nare sensitive to the parameter $\\alpha$ in our model. Notably, we observe that\nthe dominant decay channel for the $D_s\\bar{D}_s$ bound state is that into\n$D\\bar{D}$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:26:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Qi","Jing-Juan",""],["Wang","Zhen-Yang",""],["Zhang","Zhu-Feng",""],["Guo","Xin-Heng",""]]}
{"id":"2308.07705","submitter":"Shahid Shah","authors":"Faheem Hussayn and Shahid M Shah","title":"Parametric entropy based Cluster Centriod Initialization for k-means\n  clustering of various Image datasets","comments":"6 Pages, 2 tables, one algorithm. Accepted for publication in IEEE\n  International Conference on Signal Processing and Computer Vision (SPCV-2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.LG math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most employed yet simple algorithm for cluster analysis is the\nk-means algorithm. k-means has successfully witnessed its use in artificial\nintelligence, market segmentation, fraud detection, data mining, psychology,\netc., only to name a few. The k-means algorithm, however, does not always yield\nthe best quality results. Its performance heavily depends upon the number of\nclusters supplied and the proper initialization of the cluster centroids or\nseeds. In this paper, we conduct an analysis of the performance of k-means on\nimage data by employing parametric entropies in an entropy based centroid\ninitialization method and propose the best fitting entropy measures for general\nimage datasets. We use several entropies like Taneja entropy, Kapur entropy,\nAczel Daroczy entropy, Sharma Mittal entropy. We observe that for different\ndatasets, different entropies provide better results than the conventional\nmethods. We have applied our proposed algorithm on these datasets: Satellite,\nToys, Fruits, Cars, Brain MRI, Covid X-Ray.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:28:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hussayn","Faheem",""],["Shah","Shahid M",""]]}
{"id":"2308.07706","submitter":"Safal Thapaliya","authors":"Kanchan Poudel, Manish Dhakal, Prasiddha Bhandari, Rabin Adhikari,\n  Safal Thapaliya, Bishesh Khanal","title":"Exploring Transfer Learning in Medical Image Segmentation using\n  Vision-Language Models","comments":"25 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Medical Image Segmentation is crucial in various clinical applications within\nthe medical domain. While state-of-the-art segmentation models have proven\neffective, integrating textual guidance to enhance visual features for this\ntask remains an area with limited progress. Existing segmentation models that\nutilize textual guidance are primarily trained on open-domain images, raising\nconcerns about their direct applicability in the medical domain without manual\nintervention or fine-tuning.\n  To address these challenges, we propose using multimodal vision-language\nmodels for capturing semantic information from image descriptions and images,\nenabling the segmentation of diverse medical images. This study comprehensively\nevaluates existing vision language models across multiple datasets to assess\ntheir transferability from the open domain to the medical field. Furthermore,\nwe introduce variations of image descriptions for previously unseen images in\nthe dataset, revealing notable variations in model performance based on the\ngenerated prompts.\n  Our findings highlight the distribution shift between the open-domain images\nand the medical domain and show that the segmentation models trained on\nopen-domain images are not directly transferrable to the medical field. But\ntheir performance can be increased by finetuning them in the medical datasets.\nWe report the zero-shot and finetuned segmentation performance of 4 Vision\nLanguage Models (VLMs) on 11 medical datasets using 9 types of prompts derived\nfrom 14 attributes.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:28:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Poudel","Kanchan",""],["Dhakal","Manish",""],["Bhandari","Prasiddha",""],["Adhikari","Rabin",""],["Thapaliya","Safal",""],["Khanal","Bishesh",""]]}
{"id":"2308.07707","submitter":"Stefan Schoepf","authors":"Jack Foster, Stefan Schoepf, Alexandra Brintrup","title":"Fast Machine Unlearning Without Retraining Through Selective Synaptic\n  Dampening","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine unlearning, the ability for a machine learning model to forget, is\nbecoming increasingly important to comply with data privacy regulations, as\nwell as to remove harmful, manipulated, or outdated information. The key\nchallenge lies in forgetting specific information while protecting model\nperformance on the remaining data. While current state-of-the-art methods\nperform well, they typically require some level of retraining over the retained\ndata, in order to protect or restore model performance. This adds computational\noverhead and mandates that the training data remain available and accessible,\nwhich may not be feasible. In contrast, other methods employ a retrain-free\nparadigm, however, these approaches are prohibitively computationally expensive\nand do not perform on par with their retrain-based counterparts. We present\nSelective Synaptic Dampening (SSD), a novel two-step, post hoc, retrain-free\napproach to machine unlearning which is fast, performant, and does not require\nlong-term storage of the training data. First, SSD uses the Fisher information\nmatrix of the training and forgetting data to select parameters that are\ndisproportionately important to the forget set. Second, SSD induces forgetting\nby dampening these parameters proportional to their relative importance to the\nforget set with respect to the wider training data. We evaluate our method\nagainst several existing unlearning methods in a range of experiments using\nResNet18 and Vision Transformer. Results show that the performance of SSD is\ncompetitive with retrain-based post hoc methods, demonstrating the viability of\nretrain-free post hoc unlearning approaches.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:30:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Foster","Jack",""],["Schoepf","Stefan",""],["Brintrup","Alexandra",""]]}
{"id":"2308.07708","submitter":"Tonghui Peng","authors":"Tonghui Peng, Wei Gao, Ya Wu, Yulong Ma, Shiwu Zhang, Yinan Hu","title":"A Real-time Non-contact Localization Method for Faulty Electric Energy\n  Storage Components using Highly Sensitive Magnetometers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the wide application of electric energy storage component arrays, such\nas battery arrays, capacitor arrays, inductor arrays, their potential safety\nrisks have gradually drawn the public attention. However, existing technologies\ncannot meet the needs of non-contact and real-time diagnosis for faulty\ncomponents inside these massive arrays. To solve this problem, this paper\nproposes a new method based on the beamforming spatial filtering algorithm to\nprecisely locate the faulty components within the arrays in real-time. The\nmethod uses highly sensitive magnetometers to collect the magnetic signals from\nenergy storage component arrays, without damaging or even contacting any\ncomponent. The experimental results demonstrate the potential of the proposed\nmethod in securing energy storage component arrays. Within an imaging area of\n80 mm $\\times$ 80 mm, the one faulty component out of nine total components can\nbe localized with an accuracy of 0.72 mm for capacitor arrays and 1.60 mm for\nbattery arrays.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:31:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Peng","Tonghui",""],["Gao","Wei",""],["Wu","Ya",""],["Ma","Yulong",""],["Zhang","Shiwu",""],["Hu","Yinan",""]]}
{"id":"2308.07709","submitter":"Victor Branco Valera Baca","authors":"Victor B. Valera, Mauricio Bustamante, Olga Mena","title":"Joint measurement of the ultra-high-energy neutrino spectrum and cross\n  section","comments":"20 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Soon, a new generation of neutrino telescopes, presently under planning, will\ntarget the discovery of ultra-high-energy (UHE) neutrinos of cosmic origin,\nwith energies higher than 100 PeV, that promise unique insight into\nastrophysics and particle physics. Yet, predictions of the UHE neutrino flux\nand interaction cross section -- whose measurement is co-dependent -- are laden\nwith significant uncertainty that, if unaddressed, could misrepresent the\ncapabilities to measure one or the other. To address this, we advocate for the\njoint measurement of the UHE neutrino spectrum and neutrino-nucleon cross\nsection, including of their energy dependence, without assuming prior knowledge\nof either. We illustrate our methods by adopting empirical parametrizations of\nthe neutrino spectrum, in forecasts geared to the planned radio array of the\nIceCube-Gen2 neutrino telescope. We warn against using simple parametrizations\n-- a simple power law or one augmented with an exponential cut-off -- that\nmight fail to capture features of the spectrum that are commonplace in the\npredictions. We argue instead for the use of flexible parametrizations -- a\npiecewise power law or an interpolating polynomial -- that ensure accuracy. We\nreport loose design targets for the detector energy and angular resolution that\nare compatible with those under present consideration.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:32:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Valera","Victor B.",""],["Bustamante","Mauricio",""],["Mena","Olga",""]]}
{"id":"2308.07710","submitter":"Dominik Brennecken","authors":"Dominik Brennecken","title":"Dunkl convolution and elliptic regularity for Dunkl operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss in which cases the Dunkl convolution of distributions, possibly\nboth with non-compact support, can be defined and study its analytic\nproperties. We prove results on the (singular-)support of Dunkl convolutions.\nBased on this, we are able to prove a theorem on elliptic regularity for a\ncertain class of Dunkl operators, called elliptic Dunkl operators. Finally, for\nthe root systems of type A we consider the Dunkl-type Riesz distributions,\nprove that their Dunkl convolution exists and compute their convolution.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:43:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Brennecken","Dominik",""]]}
{"id":"2308.07711","submitter":"Wen Zan","authors":"Wen Zan, Yaopeng Han, Xiaotian Jiang, Yao Xiao, Yang Yang, Dayao Chen,\n  Sheng Chen","title":"SPM: Structured Pretraining and Matching Architectures for Relevance\n  Modeling in Meituan Search","comments":"Accepted by CIKM '23","journal-ref":null,"doi":"10.1145/3583780.3615500","report-no":null,"categories":"cs.IR cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In e-commerce search, relevance between query and documents is an essential\nrequirement for satisfying user experience. Different from traditional\ne-commerce platforms that offer products, users search on life service\nplatforms such as Meituan mainly for product providers, which usually have\nabundant structured information, e.g. name, address, category, thousands of\nproducts. Modeling search relevance with these rich structured contents is\nchallenging due to the following issues: (1) there is language distribution\ndiscrepancy among different fields of structured document, making it difficult\nto directly adopt off-the-shelf pretrained language model based methods like\nBERT. (2) different fields usually have different importance and their length\nvary greatly, making it difficult to extract document information helpful for\nrelevance matching.\n  To tackle these issues, in this paper we propose a novel two-stage\npretraining and matching architecture for relevance matching with rich\nstructured documents. At pretraining stage, we propose an effective pretraining\nmethod that employs both query and multiple fields of document as inputs,\nincluding an effective information compression method for lengthy fields. At\nrelevance matching stage, a novel matching method is proposed by leveraging\ndomain knowledge in search query to generate more effective document\nrepresentations for relevance scoring. Extensive offline experiments and online\nA/B tests on millions of users verify that the proposed architectures\neffectively improve the performance of relevance modeling. The model has\nalready been deployed online, serving the search traffic of Meituan for over a\nyear.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:45:34 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 05:58:16 GMT"},{"version":"v3","created":"Sun, 27 Aug 2023 11:21:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zan","Wen",""],["Han","Yaopeng",""],["Jiang","Xiaotian",""],["Xiao","Yao",""],["Yang","Yang",""],["Chen","Dayao",""],["Chen","Sheng",""]]}
{"id":"2308.07712","submitter":"Wies{\\l}awa Nizio{\\l}","authors":"Pierre Colmez, Sally Gilles, Wies{\\l}awa Nizio{\\l}","title":"Arithmetic duality for $p$-adic pro-\\'etale cohomology of analytic\n  curves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a Poincar\\'e duality for arithmetic $p$-adic pro-\\'etale cohomology\nof smooth dagger curves over finite extensions of ${\\mathbf Q}_p$. We deduce\nit, via the Hochschild-Serre spectral sequence, from geometric comparison\ntheorems combined with Tate and Serre dualities. The compatibility of all the\nproducts involved is checked via reduction to the ghost circle, for which we\nalso prove a Poincar\\'e duality (showing that it behaves like a proper smooth\nanalytic variety of dimension $1/2$). Along the way we study functional\nanalytic properties of arithmetic $p$-adic pro-\\'etale cohomology and prove\nthat the usual cohomology is nuclear Fr\\'echet and the compactly supported one\n-- of compact type.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:45:47 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:37:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Colmez","Pierre",""],["Gilles","Sally",""],["Nizio\u0142","Wies\u0142awa",""]]}
{"id":"2308.07713","submitter":"Jia Li","authors":"Jia Li, Jiao Li, Li Huang, Feng Gao, Chao Peng","title":"Chemical reaction mechanism of pre-curing process of two-component\n  adhesive based on deformation behavior for automobile hood","comments":"16 pages,8 figures,3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shearing test is carried out on the joint which bonded under different pre\ncuring processes with two component adhesives of acrylic and epoxy resin\nrespectively. The pre curing strength is obtained, which used to analyze the\nrelationship between the pre curing strength and time. The hoods with different\npre curing strength are baking with high temperature. The deformation of\ndifferent areas of the hood is measured with gauges, and the deformation\ncharacteristics of the hood after baking are acquired with comparative\nanalysis. Combining the components of two component adhesives and DSC test, the\npre curing mechanism of different adhesive systems are studied. Therefore, the\nkey factors and regular pattern of the deformation for the hood are obtained.\nThe results indicate that, finally deformation of the hood after high\ntemperature baking varies with the pre curing time. The key of the pre curing\ntime of acrylic adhesives lies in the chain initiation stage of the free\nradical polymerization reaction. Due to the influence of the chemical\nproperties of methyl acrylate and its initiator, the pre curing reaction\ninduced by free radical polymerization is very fast. The shear strength of this\njoint can reach to 3.67 MPa with a pre curing time of 1 h, which quickly\nachieving the pre cure strength required for deformation control. For epoxy\nadhesives, the rate determining step in pre curing process is the\nesterification reaction. Due to the influence of the structure of carboxylic\nacid, the esterification process is relatively long. Shear strength of this\njoint can only reach 0.87 MPa after pre curing for 4 h without external\nheating.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:46:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Jia",""],["Li","Jiao",""],["Huang","Li",""],["Gao","Feng",""],["Peng","Chao",""]]}
{"id":"2308.07714","submitter":"Greg van Anders","authors":"Hazhir Aliahmadi, Maeve Beckett, Sam Connolly, Dongmei Chen, Greg van\n  Anders","title":"Flashpoints Signal Hidden Inherent Instabilities in Land-Use Planning","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cond-mat.stat-mech physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Land-use decision-making processes have a long history of producing globally\npervasive systemic equity and sustainability concerns. Quantitative,\noptimization-based planning approaches, e.g. Multi-Objective Land Allocation\n(MOLA), seemingly open the possibility to improve objectivity and transparency\nby explicitly evaluating planning priorities by the type, amount, and location\nof land uses. Here, we show that optimization-based planning approaches with\ngeneric planning criteria generate a series of unstable \"flashpoints\" whereby\ntiny changes in planning priorities produce large-scale changes in the amount\nof land use by type. We give quantitative arguments that the flashpoints we\nuncover in MOLA models are examples of a more general family of instabilities\nthat occur whenever planning accounts for factors that coordinate use on- and\nbetween-sites, regardless of whether these planning factors are formulated\nexplicitly or implicitly. We show that instabilities lead to regions of\nambiguity in land-use type that we term \"gray areas\". By directly mapping gray\nareas between flashpoints, we show that quantitative methods retain utility by\nreducing combinatorially large spaces of possible land-use patterns to a small,\ncharacteristic set that can engage stakeholders to arrive at more efficient and\njust outcomes.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:47:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Aliahmadi","Hazhir",""],["Beckett","Maeve",""],["Connolly","Sam",""],["Chen","Dongmei",""],["van Anders","Greg",""]]}
{"id":"2308.07715","submitter":"Bardia Panahbehagh Ph.D.","authors":"Bardia Panahbehagh","title":"A Geometric Approach to Finite Population Sampling","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":"  A new, geometric and easy to understand approach to finite population\nsampling is presented. In this approach, first-order inclusion probabilities\n(FIPs) are represented by bars in a two-dimensional coordinate system, and\ntheir different arrangements lead to different designs. Only based on the\ngeometric approach, designs can be fully implemented, without the need for\nmathematical algorithms. An special arrangement of the bars, is equivalent to\nMadow 1949 systematic method, which easily, with rearranging the bars, while\nkeeping the FIPs unchanged, results in different second-order inclusion\nprobabilities (SIPs) equivalent to other famous finite population sampling\ndesigns, such as Poisson sampling, maximum entropy sampling, etc. Geometric\nvisualization of sampling designs leads to increased creativity of researchers\nto provide new efficient designs. This approach opens a new gate to finite\npopulation sampling that can deal with problems such as optimal designs,\nimplementation of maximum entropy sampling, etc.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:47:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Panahbehagh","Bardia",""]]}
{"id":"2308.07716","submitter":"Muktai Aote","authors":"Muktai Aote, A.V.Deshpandea","title":"Enhancement in Li-ion Conductivity through Co-doping of Ge and Ta in\n  Garnet Li$_7$La$_3$Zr$_2$O$_{12}$ Solid Electrolyte","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For being used as an electrolyte in All Solid State Batteries (ASSB), a solid\nelectrolyte must possess ionic conductivity comparable to that of conventional\nliquid electrolytes. To achieve this conductivity range, the series\nLi$_{6.8-y}$Ge$_{0.05}$La$_3$Zr$_{2-y}$Ta$_y$O$_{12}$ ($y = 0, 0.15, 0.25,\n0.35, 0.45$) has been synthesized using solid-state reaction method and studied\nusing various characterization techniques. The highly conducting cubic phase is\nconfirmed from XRD analysis. Structural information was collected using SEM and\ndensity measurements. The prepared ceramic sample containing 0.25 Ta, sintered\nat 1050$^\\circ$C for 7.30 hrs shows the maximum ionic conductivity of 6.61 x\n10$^{-4}$ S/cm at 25$^\\circ$C. The air stability of the same ceramic has also\nbeen evaluated after exposure for 5 months. The minimum activation energy\nassociated with the maximum conductivity of 0.25 Ta is 0.25 eV. The DC\nconductivity measurements were done to confirm the ionic nature of conductivity\nfor all ceramic samples. The stable result of ionic conductivity makes the 0.25\nTa containing ceramic sample a promising candidate for solid electrolytes for\nASSB applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:47:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Aote","Muktai",""],["Deshpandea","A. V.",""]]}
{"id":"2308.07717","submitter":"Ching-Hsun Tseng","authors":"Ching-Hsun Tseng, Shao-Ju Chien, Po-Shen Wang, Shin-Jye Lee, Wei-Huan\n  Hu, Bin Pu, and Xiao-jun Zeng","title":"Real-time Automatic M-mode Echocardiography Measurement with Panel\n  Attention from Local-to-Global Pixels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motion mode (M-mode) recording is an essential part of echocardiography to\nmeasure cardiac dimension and function. However, the current diagnosis cannot\nbuild an automatic scheme, as there are three fundamental obstructs: Firstly,\nthere is no open dataset available to build the automation for ensuring\nconstant results and bridging M-mode echocardiography with real-time instance\nsegmentation (RIS); Secondly, the examination is involving the time-consuming\nmanual labelling upon M-mode echocardiograms; Thirdly, as objects in\nechocardiograms occupy a significant portion of pixels, the limited receptive\nfield in existing backbones (e.g., ResNet) composed from multiple convolution\nlayers are inefficient to cover the period of a valve movement. Existing\nnon-local attentions (NL) compromise being unable real-time with a high\ncomputation overhead or losing information from a simplified version of the\nnon-local block. Therefore, we proposed RAMEM, a real-time automatic M-mode\nechocardiography measurement scheme, contributes three aspects to answer the\nproblems: 1) provide MEIS, a dataset of M-mode echocardiograms for instance\nsegmentation, to enable consistent results and support the development of an\nautomatic scheme; 2) propose panel attention, local-to-global efficient\nattention by pixel-unshuffling, embedding with updated UPANets V2 in a RIS\nscheme toward big object detection with global receptive field; 3) develop and\nimplement AMEM, an efficient algorithm of automatic M-mode echocardiography\nmeasurement enabling fast and accurate automatic labelling among diagnosis. The\nexperimental results show that RAMEM surpasses existing RIS backbones (with\nnon-local attention) in PASCAL 2012 SBD and human performances in real-time\nMEIS tested. The code of MEIS and dataset are available at\nhttps://github.com/hanktseng131415go/RAME.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:50:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tseng","Ching-Hsun",""],["Chien","Shao-Ju",""],["Wang","Po-Shen",""],["Lee","Shin-Jye",""],["Hu","Wei-Huan",""],["Pu","Bin",""],["Zeng","Xiao-jun",""]]}
{"id":"2308.07718","submitter":"Victor H. Gonz\\'alez","authors":"Victor H. Gonz\\'alez and Artem Litvinenko and Roman Khymyn and Johan\n  {\\AA}kerman","title":"Global biasing using a Hardware-based artificial Zeeman term in Spinwave\n  Ising Machines","comments":"Index Terms: combinatorial optimization problems, Ising machines,\n  spinwaves, unconventional computing, physical computing, spinwaves","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A spinwave Ising machine (SWIM) is a newly proposed type of time-multiplexed\nhardware solver for combinatorial optimization that employs feedback coupling\nand phase sensitive amplification to map an Ising Hamiltonian into\nphase-binarized propagating spin-wave RF pulses in an Yttrium-Iron-Garnet (YIG)\nfilm. In this work, we increase the mathematical complexity of the SWIM by\nadding a global Zeeman term to a 4-spin MAX-CUT Hamiltonian using a continuous\nexternal electrical signal with the same frequency as the spin pulses and phase\nlocked with with one of the two possible states. We are able to induce\nferromagnetic ordering in both directions of the spin states despite\nantiferromagnetic pairwise coupling. Embedding a planar antiferromagnetic spin\nsystem in a magnetic field has been proven to increase the complexity of the\ngraph associated to its Hamiltonian and thus this straightforward\nimplementation helps explore higher degrees of complexity in this evolving\nsolver.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:51:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gonz\u00e1lez","Victor H.",""],["Litvinenko","Artem",""],["Khymyn","Roman",""],["\u00c5kerman","Johan",""]]}
{"id":"2308.07719","submitter":"Varun Narasimhachar","authors":"Varun Narasimhachar","title":"The coherent measurement cost of coherence distillation","comments":"24+5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum coherence is an indispensable resource for quantum technological\napplications. It is known to be distillable from a noisy form using operations\nthat cannot create coherence. However, distillation exacts a hidden coherent\nmeasurement cost, whose extent has not previously been estimated. Here we show\nthat this cost (quantified by an equivalent number of Hadamard measurements) is\nrelated to what we call the irretrievable coherence: the difference between the\ncoherence of formation and the distillable coherence. We conjecture (and make\npartial progress towards proving) that when distilling from many copies of a\ngiven noisy coherent state, the coherent measurement cost scales extensively in\nthe number of copies, at an asymptotic rate exactly equalling the input's\nirretrievable coherence. This cost applies to any application whereof coherence\ndistillation is an incidental outcome (e.g. incoherent randomness extraction),\nbut the implications are more dramatic if pure coherence is the only desired\noutcome: the measurement cost may often be higher than the distilled yield, in\nwhich case coherence should rather be prepared afresh than distilled from a\nnoisy input.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:52:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Narasimhachar","Varun",""]]}
{"id":"2308.07720","submitter":"Ma{\\l}gorzata Cury{\\l}o Ms.","authors":"Ma{\\l}gorzata Cury{\\l}o, Tomasz Bulik","title":"Massive black hole binaries as sources of low-frequency gravitational\n  waves and X-shape radio galaxies","comments":"11 pages, 8 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the study of multi-messenger signatures of massive black hole\n(MBH) binaries residing in the centres of galaxy merger remnants. In\nparticular, we first focus on the gravitational wave background (GWB) produced\nby an ensemble of MBH binary inspirals in the frequency range probed by the\nPulsar Timing Array (PTA) experiments. The improved estimates of the\ncharacteristic strain were obtained with the inclusion of environmental effects\non the MBH binary orbital decay within the galaxy merger remnants, added in\npost-processing to the semi-analytic model of galaxy formation and evolution\nSHARK. Secondly, we explore two, intriguing in terms of the MBH binary\nevolution studies, hypotheses aiming to explain the origins of X-shape radio\ngalaxies - a peculiar type of objects with double lobe structures, constituting\napproximately 6 - 10% of known radio loud galaxies. The two considered\nscenarios involve either an abrupt change in the jet direction after a MBH\nmerger (a spin-flip) or an unresolved close binary, where each of the two\ncomponents produces a jet. We find that the estimated GWB amplitude at the\nreference frequency $f_0=1 \\,{\\rm yr}^{-1}$ is in the range of $A_{\\rm{\nyr^{-1}}} = 1.29\\cdot10^{-15} - 1.46\\cdot10^{-15}$, which is 50% lower than the\nstrain of the signal detected by the PTA experiments. We also show that the\nspin-flip scenario considered in gas-poor mergers reproduces the observed\nproperties of X-shape radio galaxies well in terms of flip angle, redshift and\nluminosity distributions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:52:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cury\u0142o","Ma\u0142gorzata",""],["Bulik","Tomasz",""]]}
{"id":"2308.07721","submitter":"Nader Bshouty","authors":"Nader H. Bshouty","title":"Improved Lower Bound for Estimating the Number of Defective Items","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X$ be a set of items of size $n$ that contains some defective items,\ndenoted by $I$, where $I \\subseteq X$. In group testing, a {\\it test} refers to\na subset of items $Q \\subset X$. The outcome of a test is $1$ if $Q$ contains\nat least one defective item, i.e., $Q\\cap I \\neq \\emptyset$, and $0$ otherwise.\n  We give a novel approach to obtaining lower bounds in non-adaptive randomized\ngroup testing. The technique produced lower bounds that are within a factor of\n$1/{\\log\\log\\stackrel{k}{\\cdots}\\log n}$ of the existing upper bounds for any\nconstant~$k$. Employing this new method, we can prove the following result.\n  For any fixed constants $k$, any non-adaptive randomized algorithm that, for\nany set of defective items $I$, with probability at least $2/3$, returns an\nestimate of the number of defective items $|I|$ to within a constant factor\nrequires at least $$\\Omega\\left(\\frac{\\log n}{\\log\\log\\stackrel{k}{\\cdots}\\log\nn}\\right)$$ tests.\n  Our result almost matches the upper bound of $O(\\log n)$ and solves the open\nproblem posed by Damaschke and Sheikh Muhammad [COCOA 2010 and Discrete Math.,\nAlg. and Appl., 2010]. Additionally, it improves upon the lower bound of\n$\\Omega(\\log n/\\log\\log n)$ previously established by Bshouty [ISAAC 2019].\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:54:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bshouty","Nader H.",""]]}
{"id":"2308.07722","submitter":"Marcel Schweitzer","authors":"Andreas Frommer, Michele Rinelli, Marcel Schweitzer","title":"Analysis of stochastic probing methods for estimating the trace of\n  functions of sparse symmetric matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of estimating the trace of a matrix function $f(A)$.\nIn certain situations, in particular if $f(A)$ cannot be well approximated by a\nlow-rank matrix, combining probing methods based on graph colorings with\nstochastic trace estimation techniques can yield accurate approximations at\nmoderate cost. So far, such methods have not been thoroughly analyzed, though,\nbut were rather used as efficient heuristics by practitioners. In this\nmanuscript, we perform a detailed analysis of stochastic probing methods and,\nin particular, expose conditions under which the expected approximation error\nin the stochastic probing method scales more favorably with the dimension of\nthe matrix than the error in non-stochastic probing. Extending results from [E.\nAune, D. P. Simpson, J. Eidsvik, Parameter estimation in high dimensional\nGaussian distributions, Stat. Comput., 24, pp. 247--263, 2014], we also\ncharacterize situations in which using just one stochastic vector is always --\nnot only in expectation -- better than the deterministic probing method.\nSeveral numerical experiments illustrate our theory and compare with existing\nmethods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:54:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Frommer","Andreas",""],["Rinelli","Michele",""],["Schweitzer","Marcel",""]]}
{"id":"2308.07723","submitter":"Ruican Xia","authors":"Ruican Xia, Hailong Pei","title":"Extended Preintegration for Relative State Estimation of Leader-Follower\n  Platform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Relative state estimation using exteroceptive sensors suffers from\nlimitations of the field of view (FOV) and false detection, that the\nproprioceptive sensor (IMU) data are usually engaged to compensate. Recently\nego-motion constraint obtained by Inertial measurement unit (IMU)\npreintegration has been extensively used in simultaneous localization and\nmapping (SLAM) to alleviate the computation burden. This paper introduces an\nextended preintegration incorporating the IMU preintegration of two platforms\nto formulate the motion constraint of relative state. One merit of this\nanalytic constraint is that it can be seamlessly integrated into the unified\ngraph optimization framework to implement the relative state estimation in a\nhigh-performance real-time tracking thread, another point is a full smoother\ndesign with this precise constraint to optimize the 3D coordinate and refine\nthe state for the refinement thread. We compare extensively in simulations the\nproposed algorithms with two existing approaches to confirm our outperformance.\nIn the real virtual reality (VR) application design with the proposed\nestimator, we properly realize the visual tracking of the six degrees of\nfreedom (6DoF) controller suitable for almost all scenarios, including the\nchallenging environment with missing features, light mutation, dynamic scenes,\netc. The demo video is at https://www.youtube.com/watch?v=0idb9Ls2iAM. For the\nbenefit of the community, we make the source code public.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 11:55:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xia","Ruican",""],["Pei","Hailong",""]]}
{"id":"2308.07724","submitter":"Suliman Hamud","authors":"Suliman Hamud and Abraham Berman","title":"New constructions of non-regular cospectral graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider two types of joins of graphs $G_{1}$ and $G_{2}$, $G_{1}\\veebar\nG_{2}$ - the Neighbors Splitting Join and $G_{1}\\underset{=}{\\lor}G_{2}$ - the\nNon Neighbors Splitting Join, and compute the adjacency characteristic\npolynomial, the Laplacian characteristic polynomial and the signless Laplacian\ncharacteristic polynomial of these joins. When $G_{1}$ and $G_{2}$ are regular,\nwe compute the adjacency spectrum, the Laplacian spectrum, the signless\nLaplacian spectrum of $G_{1}\\underset{=}{\\lor}G_{2}$ and the normalized\nLaplacian spectrum of $G_{1}\\veebar G_{2}$ and $G_{1}\\underset{=}{\\lor}G_{2}$.\nWe use these results to construct non regular, non isomorphic graphs that are\ncospectral with respect to the four matrices: adjacency, Laplacian , signless\nLaplacian and normalized Laplacian.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:00:07 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hamud","Suliman",""],["Berman","Abraham",""]]}
{"id":"2308.07725","submitter":"Earnest Akofor","authors":"Earnest Akofor","title":"On quasiconvexity of precompact-subset spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be a metric space and $BCl(X)$ the collection of its bounded closed\nsubsets as a metric space with respect to Hausdorff distance (and call $BCl(X)$\nthe bounded-subset space of $X$). The question of whether or not one can\ncharacterize (the existence of) a rectifiable path in some subspace\n$\\mathcal{J}$ of $BCl(X)$ entirely in terms of rectifiable paths in $X$ does\nnot seem to have been given serious consideration. In this paper, we make some\nprogress with the case where $\\mathcal{J}$ consists of precompact subsets of\n$X$ (with such a $\\mathcal{J}$ called a precompact-subset space of $X$).\nSpecifically, in certain precompact-subset spaces $\\mathcal{J}$ of $X$, we give\na criterion to determine (the existence of) a rectifiable path in $\\mathcal{J}$\nusing rectifiable paths in $X$. We then show that certain path connectivity\nproperties, especially quasiconvexity, inherited from $X$ by such\nprecompact-subset spaces of $X$ can be determined in an automatic way using our\ncriterion. Meanwhile, we also give a concise review of our earlier work on\nquasiconvexity of finite-subset spaces of $X$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:00:49 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 05:02:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Akofor","Earnest",""]]}
{"id":"2308.07726","submitter":"Mohammed Dahiru Buhari Dr","authors":"Mohammed Dahiru Buhari, Tri Bagus Susilo, Irfan Khan, and Bashir\n  Olaniyi Sadiq","title":"Statistical LOS/NLOS Classification for UWB Channels","comments":null,"journal-ref":"KJSET: Vol. 02 Issue 1, (April 2023), 32-38, ISSN: 1958-0641","doi":"10.59568/KJSET-2023-2-1-05","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Ultrawideband (UWB) technology has attracted a lot of attention for indoor\nand outdoor positioning systems due to its high accuracy and robustness in\nnon-line-of-sight (NLOS) environments. However, UWB signals are affected by\nmultipath propagation which causes errors in localization. To overcome this\nproblem, researchers have proposed various techniques for NLOS identification\nand mitigation. One of the approaches is statistical LOS/NLOS classification,\nwhich uses statistical parameters of the received signal to distinguish between\nLOS and NLOS channels. In this paper, we formulated several techniques which\ncan be used for effectively classifying a Line of Sight (LOS) channel from a\nNon-Line of Sight (NLOS) channel. Various parameters obtained from Channel\nImpulse Response (CIR) like Skewness, Kurtosis, Root Mean Squared Delay Spread\n(RDS), Mean Excess Delay (MED), Energy, Energy Ratio, and Mean of Covariance\nMatrix are used for channel classification. In addition to this, the Joint\nProbability Density Functions (PDFs) of various parameters are used to improve\nthe accuracy of UWB LOS/NLOS channel classification. Two different\ncriteria-Likelihood Ratio and Hypothesis Tests are used for the identification\nof the channel.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:06:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Buhari","Mohammed Dahiru",""],["Susilo","Tri Bagus",""],["Khan","Irfan",""],["Sadiq","Bashir Olaniyi",""]]}
{"id":"2308.07727","submitter":"Oskari Kerppo","authors":"Teiko Heinosaari, Oskari Kerppo, Leevi Lepp\\\"aj\\\"arvi and Martin\n  Pl\\'avala","title":"Simple Information Processing Tasks with Unbounded Quantum Advantage","comments":"replacement: added references","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Communication scenarios between two parties can be implemented by first\nencoding messages into some states of a physical system which acts as the\nphysical medium of the communication and then decoding the messages by\nmeasuring the state of the system. We show that already in the simplest\npossible scenarios it is possible to detect a definite, unbounded advantage of\nquantum systems over classical systems. We do this by constructing a family of\noperationally meaningful communication tasks each of which on one hand can be\nimplemented by using just a single qubit but which on the other hand require\nunboundedly larger classical system for classical implementation. Furthemore,\nwe show that even though with the additional resource of shared randomness the\nproposed communication tasks can be implemented by both quantum and classical\nsystems of the same size, the number of coordinated actions needed for the\nclassical implementation also grows unboundedly. In particular, no finite\nstorage can be used to store all the coordinated actions needed to implement\nall the possible quantum communication tasks with classical systems. As a\nconsequence, shared randomness cannot be viewed as a free resource.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:07:31 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 11:31:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Heinosaari","Teiko",""],["Kerppo","Oskari",""],["Lepp\u00e4j\u00e4rvi","Leevi",""],["Pl\u00e1vala","Martin",""]]}
{"id":"2308.07728","submitter":"Seokhyeon Ha","authors":"Seokhyeon Ha, Sunbeom Jung, Jungwoo Lee","title":"Domain-Aware Fine-Tuning: Enhancing Neural Network Adaptability","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":"  Fine-tuning pre-trained neural network models has become a widely adopted\napproach across various domains. However, it can lead to the distortion of\npre-trained feature extractors that already possess strong generalization\ncapabilities. Mitigating feature distortion during adaptation to new target\ndomains is crucial. Recent studies have shown promising results in handling\nfeature distortion by aligning the head layer on in-distribution datasets\nbefore performing fine-tuning. Nonetheless, a significant limitation arises\nfrom the treatment of batch normalization layers during fine-tuning, leading to\nsuboptimal performance. In this paper, we propose Domain-Aware Fine-Tuning\n(DAFT), a novel approach that incorporates batch normalization conversion and\nthe integration of linear probing and fine-tuning. Our batch normalization\nconversion method effectively mitigates feature distortion by reducing\nmodifications to the neural network during fine-tuning. Additionally, we\nintroduce the integration of linear probing and fine-tuning to optimize the\nhead layer with gradual adaptation of the feature extractor. By leveraging\nbatch normalization layers and integrating linear probing and fine-tuning, our\nDAFT significantly mitigates feature distortion and achieves improved model\nperformance on both in-distribution and out-of-distribution datasets. Extensive\nexperiments demonstrate that our method outperforms other baseline methods,\ndemonstrating its effectiveness in not only improving performance but also\nmitigating feature distortion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:08:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ha","Seokhyeon",""],["Jung","Sunbeom",""],["Lee","Jungwoo",""]]}
{"id":"2308.07729","submitter":"Jamel Benameur","authors":"Jamel Benameur","title":"Decay rates for mild solutions of QGE with critical fractional\n  dissipation in $L^2(\\mathbb{R}^2)$","comments":"No comments","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In \\cite{MRSC1} the authors proved some asymptotic results for the global\nsolution of critical Quasi-geostrophic equation with a condition on the decay\nof $\\widehat{\\theta_0}$ near at zero. In this paper, we prove that this\ncondition is not necessary. Fourier analysis and standard techniques are used.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:08:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Benameur","Jamel",""]]}
{"id":"2308.07730","submitter":"Mohammed Dahiru Buhari Dr","authors":"Aceronga Kwocan, Mohammed Dahiru Buhari, Kelechi Ukagwu, and Jonathan\n  Serugunda","title":"On-site Energy Utilization Evaluation of Telecommunication Base Station:\n  A Case Study of Western Uganda","comments":null,"journal-ref":"KJSET: Vol. 02 Issue 1, (April 2023) 01-09, ISSN: 1958-0641","doi":"10.59568/KJSET-2023-2-1-01","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Due to the widespread installation of Base Stations, the power consumption of\ncellular communication is increasing rapidly (BSs). Power consumption rises as\ntraffic does, however, this scenario varies from geolocation to geolocation\nbecause sites in rural and urban areas have variable traffic loads. Therefore,\nin order to address various power consumption issues, it is necessary to\nanalyze these sites and offer valid data that network operators can employ.\nThis study took into account the impact of traffic load on energy consumption\nboth in rural and urban locations in western Uganda because prior models did\nnot adequately account for the impact of traffic load on both rural and urban\nsites. Regression models are used to examine these effects of traffic load on\npower consumption. Based on measurements taken for twenty-eight days in a row\nin six urban and rural areas, linear models have been presented. The findings\nshowed that both rural and urban BTS were well-fitted by the suggested linear\nmodels. Depending on the layouts of the sites, it was found that energy\nconsumption varied along with traffic, with the number of transceivers present\nhaving an impact on both the traffic load and energy consumption.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:10:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kwocan","Aceronga",""],["Buhari","Mohammed Dahiru",""],["Ukagwu","Kelechi",""],["Serugunda","Jonathan",""]]}
{"id":"2308.07731","submitter":"Zheang Huai","authors":"Zheang Huai, Xinpeng Ding, Yi Li, and Xiaomeng Li","title":"Context-Aware Pseudo-Label Refinement for Source-Free Domain Adaptive\n  Fundus Image Segmentation","comments":"Accepted by MICCAI 2023, 11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the domain adaptation problem, source data may be unavailable to the\ntarget client side due to privacy or intellectual property issues. Source-free\nunsupervised domain adaptation (SF-UDA) aims at adapting a model trained on the\nsource side to align the target distribution with only the source model and\nunlabeled target data. The source model usually produces noisy and\ncontext-inconsistent pseudo-labels on the target domain, i.e., neighbouring\nregions that have a similar visual appearance are annotated with different\npseudo-labels. This observation motivates us to refine pseudo-labels with\ncontext relations. Another observation is that features of the same class tend\nto form a cluster despite the domain gap, which implies context relations can\nbe readily calculated from feature distances. To this end, we propose a\ncontext-aware pseudo-label refinement method for SF-UDA. Specifically, a\ncontext-similarity learning module is developed to learn context relations.\nNext, pseudo-label revision is designed utilizing the learned context\nrelations. Further, we propose calibrating the revised pseudo-labels to\ncompensate for wrong revision caused by inaccurate context relations.\nAdditionally, we adopt a pixel-level and class-level denoising scheme to select\nreliable pseudo-labels for domain adaptation. Experiments on cross-domain\nfundus images indicate that our approach yields the state-of-the-art results.\nCode is available at https://github.com/xmed-lab/CPR.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:11:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Huai","Zheang",""],["Ding","Xinpeng",""],["Li","Yi",""],["Li","Xiaomeng",""]]}
{"id":"2308.07732","submitter":"Haiyang Wang","authors":"Haiyang Wang, Hao Tang, Shaoshuai Shi, Aoxue Li, Zhenguo Li, Bernt\n  Schiele, Liwei Wang","title":"UniTR: A Unified and Efficient Multi-Modal Transformer for\n  Bird's-Eye-View Representation","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":"  Jointly processing information from multiple sensors is crucial to achieving\naccurate and robust perception for reliable autonomous driving systems.\nHowever, current 3D perception research follows a modality-specific paradigm,\nleading to additional computation overheads and inefficient collaboration\nbetween different sensor data. In this paper, we present an efficient\nmulti-modal backbone for outdoor 3D perception named UniTR, which processes a\nvariety of modalities with unified modeling and shared parameters. Unlike\nprevious works, UniTR introduces a modality-agnostic transformer encoder to\nhandle these view-discrepant sensor data for parallel modal-wise representation\nlearning and automatic cross-modal interaction without additional fusion steps.\nMore importantly, to make full use of these complementary sensor types, we\npresent a novel multi-modal integration strategy by both considering\nsemantic-abundant 2D perspective and geometry-aware 3D sparse neighborhood\nrelations. UniTR is also a fundamentally task-agnostic backbone that naturally\nsupports different 3D perception tasks. It sets a new state-of-the-art\nperformance on the nuScenes benchmark, achieving +1.1 NDS higher for 3D object\ndetection and +12.0 higher mIoU for BEV map segmentation with lower inference\nlatency. Code will be available at https://github.com/Haiyang-W/UniTR .\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:13:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Haiyang",""],["Tang","Hao",""],["Shi","Shaoshuai",""],["Li","Aoxue",""],["Li","Zhenguo",""],["Schiele","Bernt",""],["Wang","Liwei",""]]}
{"id":"2308.07733","submitter":"Yue Lv","authors":"Yue Lv, Jinxi Xiang, Jun Zhang, Wenming Yang, Xiao Han, Wei Yang","title":"Dynamic Low-Rank Instance Adaptation for Universal Neural Image\n  Compression","comments":"Accepted by ACM MM 2023, 13 pages, 12 figures","journal-ref":null,"doi":"10.1145/3581783.3612187","report-no":null,"categories":"eess.IV cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The latest advancements in neural image compression show great potential in\nsurpassing the rate-distortion performance of conventional standard codecs.\nNevertheless, there exists an indelible domain gap between the datasets\nutilized for training (i.e., natural images) and those utilized for inference\n(e.g., artistic images). Our proposal involves a low-rank adaptation approach\naimed at addressing the rate-distortion drop observed in out-of-domain\ndatasets. Specifically, we perform low-rank matrix decomposition to update\ncertain adaptation parameters of the client's decoder. These updated\nparameters, along with image latents, are encoded into a bitstream and\ntransmitted to the decoder in practical scenarios. Due to the low-rank\nconstraint imposed on the adaptation parameters, the resulting bit rate\noverhead is small. Furthermore, the bit rate allocation of low-rank adaptation\nis \\emph{non-trivial}, considering the diverse inputs require varying\nadaptation bitstreams. We thus introduce a dynamic gating network on top of the\nlow-rank adaptation method, in order to decide which decoder layer should\nemploy adaptation. The dynamic adaptation network is optimized end-to-end using\nrate-distortion loss. Our proposed method exhibits universality across diverse\nimage datasets. Extensive results demonstrate that this paradigm significantly\nmitigates the domain gap, surpassing non-adaptive methods with an average\nBD-rate improvement of approximately $19\\%$ across out-of-domain images.\nFurthermore, it outperforms the most advanced instance adaptive methods by\nroughly $5\\%$ BD-rate. Ablation studies confirm our method's ability to\nuniversally enhance various image compression architectures.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:17:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lv","Yue",""],["Xiang","Jinxi",""],["Zhang","Jun",""],["Yang","Wenming",""],["Han","Xiao",""],["Yang","Wei",""]]}
{"id":"2308.07734","submitter":"Qingna Li","authors":"Yixin Wang and Qingna Li","title":"A Fast Smoothing Newton Method for Bilevel Hyperparameter Optimization\n  for SVC with Logistic Loss","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Support vector classification (SVC) with logistic loss has excellent\ntheoretical properties in classification problems where the label values are\nnot continuous. In this paper, we reformulate the hyperparameter selection for\nSVC with logistic loss as a bilevel optimization problem in which the\nupper-level problem and the lower-level problem are both based on logistic\nloss. The resulting bilevel optimization model is converted to a single-level\nnonlinear programming (NLP) problem based on the KKT conditions of the\nlower-level problem. Such NLP contains a set of nonlinear equality constraints\nand a simple lower bound constraint. The second-order sufficient condition is\ncharacterized, which guarantees that the strict local optimizers are obtained.\nTo solve such NLP, we apply the smoothing Newton method proposed in\n\\cite{Liang} to solve the KKT conditions, which contain one pair of\ncomplementarity constraints. We show that the smoothing Newton method has a\nsuperlinear convergence rate. Extensive numerical results verify the efficiency\nof the proposed approach and strict local minimizers can be achieved both\nnumerically and theoretically. In particular, compared with other methods, our\nalgorithm can achieve competitive results while consuming less time than other\nmethods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:23:06 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 06:53:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yixin",""],["Li","Qingna",""]]}
{"id":"2308.07735","submitter":"Kay Yunqi Song","authors":"Kay Song, Guanze He, Abdallah Reza, Tamas Ung\\'ar, Phani Karamched,\n  David Yang, Ivan Tolkachev, Kenichiro Mizohata, David E J Armstrong, Felix\n  Hofmann","title":"Microstructural and material property changes in severely deformed\n  Eurofer-97","comments":"59 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Severe plastic deformation changes the microstructure and properties of\nsteels, which may be favourable for their use in structural components of\nnuclear reactors. In this study, high-pressure torsion (HPT) was used to refine\nthe grain structure of Eurofer-97, a ferritic/ martensitic steel. Electron\nmicroscopy and X-ray diffraction were used to characterise the microstructural\nchanges. Following HPT, the average grain size reduced by a factor of $\\sim$\n30, with a marked increase in high-angle grain boundaries. Dislocation density\nalso increased by more than one order of magnitude. The thermal stability of\nthe deformed material was investigated via in-situ annealing during synchrotron\nX-ray diffraction. This revealed substantial recovery between 450 K - 800 K.\nIrradiation with 20 MeV Fe-ions to $\\sim$ 0.1 dpa caused a 20% reduction in\ndislocation density compared to the as-deformed material. However, HPT\ndeformation prior to irradiation did not have a significant effect in\nmitigating the irradiation-induced reductions in thermal diffusivity and\nsurface acoustic wave velocity of the material. These results provide a\nmulti-faceted understanding of the changes in ferritic/martensitic steels due\nto severe plastic deformation, and how these changes can be used to alter\nmaterial properties.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:28:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Song","Kay",""],["He","Guanze",""],["Reza","Abdallah",""],["Ung\u00e1r","Tamas",""],["Karamched","Phani",""],["Yang","David",""],["Tolkachev","Ivan",""],["Mizohata","Kenichiro",""],["Armstrong","David E J",""],["Hofmann","Felix",""]]}
{"id":"2308.07736","submitter":"Alexander Johansson","authors":"Alexander Johansson and Johan Markdahl","title":"Swarm Bug Algorithms for Path Generation in Unknown Environments","comments":"Accepted for IEEE Conference on Decision and Control, Dec. 13-15,\n  2023, Singapore","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider the problem of a swarm traveling between two\npoints as fast as possible in an unknown environment cluttered with obstacles.\nPotential applications include search-and-rescue operations where damaged\nenvironments are typical. We present swarm generalizations, called SwarmCom,\nSwarmBug1, and SwarmBug2, of the classical path generation algorithms Com,\nBug1, and Bug2. These algorithms were developed for unknown environments and\nrequire low computational power and memory storage, thereby freeing up\nresources for other tasks. We show the upper bound of the worst-case travel\ntime for the first agent in the swarm to reach the target point for SwarmBug1.\nFor SwarmBug2, we show that the algorithm underperforms in terms of worst-case\ntravel time compared to SwarmBug1. For SwarmCom, we show that there exists a\ntrivial scene for which the algorithm will not halt, and it thus has no\nperformance guarantees. Moreover, by comparing the upper bound of the travel\ntime for SwarmBug1 with a universal lower bound for any path generation\nalgorithm, it is shown that in the limit when the number of agents in the swarm\napproaches infinity, no other algorithm has strictly better worst-case\nperformance than SwarmBug1 and the universal lower bound is tight.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:30:15 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 09:34:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Johansson","Alexander",""],["Markdahl","Johan",""]]}
{"id":"2308.07737","submitter":"Chaorui Deng","authors":"Chaorui Deng, Da Chen, Qi Wu","title":"Identity-Consistent Aggregation for Video Object Detection","comments":"to be appeared at ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In Video Object Detection (VID), a common practice is to leverage the rich\ntemporal contexts from the video to enhance the object representations in each\nframe. Existing methods treat the temporal contexts obtained from different\nobjects indiscriminately and ignore their different identities. While\nintuitively, aggregating local views of the same object in different frames may\nfacilitate a better understanding of the object. Thus, in this paper, we aim to\nenable the model to focus on the identity-consistent temporal contexts of each\nobject to obtain more comprehensive object representations and handle the rapid\nobject appearance variations such as occlusion, motion blur, etc. However,\nrealizing this goal on top of existing VID models faces low-efficiency problems\ndue to their redundant region proposals and nonparallel frame-wise prediction\nmanner. To aid this, we propose ClipVID, a VID model equipped with\nIdentity-Consistent Aggregation (ICA) layers specifically designed for mining\nfine-grained and identity-consistent temporal contexts. It effectively reduces\nthe redundancies through the set prediction strategy, making the ICA layers\nvery efficient and further allowing us to design an architecture that makes\nparallel clip-wise predictions for the whole video clip. Extensive experimental\nresults demonstrate the superiority of our method: a state-of-the-art (SOTA)\nperformance (84.7% mAP) on the ImageNet VID dataset while running at a speed\nabout 7x faster (39.3 fps) than previous SOTAs.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:30:22 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deng","Chaorui",""],["Chen","Da",""],["Wu","Qi",""]]}
{"id":"2308.07738","submitter":"Debraj Chakraborty","authors":"Debraj Chakraborty, Damien Busatto-Gaston, Jean-Fran\\c{c}ois Raskin\n  and Guillermo A. P\\'erez","title":"Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search\n  using Data Aggregation with Formal Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study how to efficiently combine formal methods, Monte Carlo Tree Search\n(MCTS), and deep learning in order to produce high-quality receding horizon\npolicies in large Markov Decision processes (MDPs). In particular, we use\nmodel-checking techniques to guide the MCTS algorithm in order to generate\noffline samples of high-quality decisions on a representative set of states of\nthe MDP. Those samples can then be used to train a neural network that imitates\nthe policy used to generate them. This neural network can either be used as a\nguide on a lower-latency MCTS online search, or alternatively be used as a\nfull-fledged policy when minimal latency is required. We use statistical model\nchecking to detect when additional samples are needed and to focus those\nadditional samples on configurations where the learnt neural network policy\ndiffers from the (computationally-expensive) offline policy. We illustrate the\nuse of our method on MDPs that model the Frozen Lake and Pac-Man environments\n-- two popular benchmarks to evaluate reinforcement-learning algorithms.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:33:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chakraborty","Debraj",""],["Busatto-Gaston","Damien",""],["Raskin","Jean-Fran\u00e7ois",""],["P\u00e9rez","Guillermo A.",""]]}
{"id":"2308.07739","submitter":"Huali Zhang","authors":"Huali Zhang","title":"Local well-posedness for incompressible neo-Hookean Elastic equations in\n  almost critical Sobolev spaces","comments":"21pages.Welcome all comments","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inspired by a pineeor work of Andersson-Kapitanski \\cite{AK}, we prove the\nlocal well-posedness of Cauchy problem of incompressible neo-Hookean equations\nif the initial deformation and velocity belong to\n$H^{\\frac{n+2}{2}+}(\\mathbb{R}^n) \\times H^{\\frac{n}{2}+}(\\mathbb{R}^n)$\n($n=2,3$), where $\\frac{n+2}{2}$ and $\\frac{n}{2}$ is respectively a\nscaling-invariant exponent for deformation and velocity in Sobolev spaces. Our\nnew observation relies on two folds: a reduction to a second-order\nwave-elliptic system of deformation and velocity; a \"wave-map type\" null form\nintrinsic in this coupled system. In particular the wave nature with \"wave-map\ntype\" null form allows us to prove a bilinear estimate of Klainerman-Machedon\ntype for nonlinear terms. So we can lower $\\frac12$-order regularity in 3D and\n$\\frac34$-order regularity in 2D for well-posedness compared with \\cite{AK}.\nMoreover, as an application, we also prove a new local well-posedness result\nfor the ideal incompressible magnetohydrodynamic (MHD) system in the presence\nof a strong magnetic field.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:39:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Huali",""]]}
{"id":"2308.07740","submitter":"Mamoru Okamoto","authors":"Pierre de Roubin, Mamoru Okamoto","title":"Norm inflation for the viscous nonlinear wave equation","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we study the ill-posedness of the viscous nonlinear wave\nequation for any polynomial nonlinearity in negative Sobolev spaces. In\nparticular, we prove a norm inflation result above the scaling critical\nregularity in some cases. We also show failure of $C^k$-continuity, for $k$ the\npower of the nonlinearity, up to some regularity threshold.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:40:43 GMT"}],"update_date":"2023-08-16","authors_parsed":[["de Roubin","Pierre",""],["Okamoto","Mamoru",""]]}
{"id":"2308.07741","submitter":"Nico G\\\"urtler","authors":"Nico G\\\"urtler, Felix Widmaier, Cansu Sancaktar, Sebastian Blaes,\n  Pavel Kolev, Stefan Bauer, Manuel W\\\"uthrich, Markus Wulfmeier, Martin\n  Riedmiller, Arthur Allshire, Qiang Wang, Robert McCarthy, Hangyeol Kim,\n  Jongchan Baek Pohang, Wookyong Kwon, Shanliang Qian, Yasunori Toshimitsu,\n  Mike Yan Michelis, Amirhossein Kazemipour, Arman Raayatsanati, Hehui Zheng,\n  Barnabasa Gavin Cangan, Bernhard Sch\\\"olkopf, Georg Martius","title":"Real Robot Challenge 2022: Learning Dexterous Manipulation from Offline\n  Data in the Real World","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Experimentation on real robots is demanding in terms of time and costs. For\nthis reason, a large part of the reinforcement learning (RL) community uses\nsimulators to develop and benchmark algorithms. However, insights gained in\nsimulation do not necessarily translate to real robots, in particular for tasks\ninvolving complex interactions with the environment. The Real Robot Challenge\n2022 therefore served as a bridge between the RL and robotics communities by\nallowing participants to experiment remotely with a real robot - as easily as\nin simulation.\n  In the last years, offline reinforcement learning has matured into a\npromising paradigm for learning from pre-collected datasets, alleviating the\nreliance on expensive online interactions. We therefore asked the participants\nto learn two dexterous manipulation tasks involving pushing, grasping, and\nin-hand orientation from provided real-robot datasets. An extensive software\ndocumentation and an initial stage based on a simulation of the real set-up\nmade the competition particularly accessible. By giving each team plenty of\naccess budget to evaluate their offline-learned policies on a cluster of seven\nidentical real TriFinger platforms, we organized an exciting competition for\nmachine learners and roboticists alike.\n  In this work we state the rules of the competition, present the methods used\nby the winning teams and compare their results with a benchmark of\nstate-of-the-art offline RL algorithms on the challenge datasets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:40:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["G\u00fcrtler","Nico",""],["Widmaier","Felix",""],["Sancaktar","Cansu",""],["Blaes","Sebastian",""],["Kolev","Pavel",""],["Bauer","Stefan",""],["W\u00fcthrich","Manuel",""],["Wulfmeier","Markus",""],["Riedmiller","Martin",""],["Allshire","Arthur",""],["Wang","Qiang",""],["McCarthy","Robert",""],["Kim","Hangyeol",""],["Pohang","Jongchan Baek",""],["Kwon","Wookyong",""],["Qian","Shanliang",""],["Toshimitsu","Yasunori",""],["Michelis","Mike Yan",""],["Kazemipour","Amirhossein",""],["Raayatsanati","Arman",""],["Zheng","Hehui",""],["Cangan","Barnabasa Gavin",""],["Sch\u00f6lkopf","Bernhard",""],["Martius","Georg",""]]}
{"id":"2308.07742","submitter":"Caroline Geiersbach","authors":"Caroline Geiersbach, Tim Suchan, and Kathrin Welker","title":"Optimization of piecewise smooth shapes under uncertainty using the\n  example of Navier-Stokes flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate a complex system involving multiple shapes to be optimized in\na domain, taking into account geometric constraints on the shapes and\nuncertainty appearing in the physics. We connect the differential geometry of\nproduct shape manifolds with multi-shape calculus, which provides a novel\nframework for the handling of piecewise smooth shapes. This multi-shape\ncalculus is applied to a shape optimization problem where shapes serve as\nobstacles in a system governed by steady state incompressible Navier-Stokes\nflow. Numerical experiments use our recently developed stochastic augmented\nLagrangian method and we investigate the choice of algorithmic parameters using\nthe example of this application.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:46:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Geiersbach","Caroline",""],["Suchan","Tim",""],["Welker","Kathrin",""]]}
{"id":"2308.07743","submitter":"Wenyuan Xue","authors":"Wenyuan Xue, Dapeng Chen, Baosheng Yu, Yifei Chen, Sai Zhou, Wei Peng","title":"ChartDETR: A Multi-shape Detection Network for Visual Chart Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual chart recognition systems are gaining increasing attention due to the\ngrowing demand for automatically identifying table headers and values from\nchart images. Current methods rely on keypoint detection to estimate data\nelement shapes in charts but suffer from grouping errors in post-processing. To\naddress this issue, we propose ChartDETR, a transformer-based multi-shape\ndetector that localizes keypoints at the corners of regular shapes to\nreconstruct multiple data elements in a single chart image. Our method predicts\nall data element shapes at once by introducing query groups in set prediction,\neliminating the need for further postprocessing. This property allows ChartDETR\nto serve as a unified framework capable of representing various chart types\nwithout altering the network architecture, effectively detecting data elements\nof diverse shapes. We evaluated ChartDETR on three datasets, achieving\ncompetitive results across all chart types without any additional enhancements.\nFor example, ChartDETR achieved an F1 score of 0.98 on Adobe Synthetic,\nsignificantly outperforming the previous best model with a 0.71 F1 score.\nAdditionally, we obtained a new state-of-the-art result of 0.97 on\nExcelChart400k. The code will be made publicly available.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:50:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xue","Wenyuan",""],["Chen","Dapeng",""],["Yu","Baosheng",""],["Chen","Yifei",""],["Zhou","Sai",""],["Peng","Wei",""]]}
{"id":"2308.07744","submitter":"Giovanni Scala","authors":"Paulo J. Cavalcanti, Giovanni Scala, Antonio Mandarino, and Cosmo Lupo","title":"Information theoretical perspective on the method of Entanglement\n  Witnesses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We frame entanglement detection as a problem of random variable inference to\nintroduce a quantitative method to measure and understand whether entanglement\nwitnesses lead to an efficient procedure for that task. Hence we quantify how\nmany bits of information a family of entanglement witnesses can infer about the\nentanglement of a given quantum state sample. The bits are computed in terms of\nthe mutual information and we unveil there exists hidden information not\n\\emph{efficiently} processed. We show that there is more information in the\nexpected value of the entanglement witnesses, i.e. $\\mathbb{E}[W]=\\langle W\n\\rangle_\\rho$ than in the sign of $\\mathbb{E}[W]$. This suggests that an\nentanglement witness can provide more information about the entanglement if for\nour decision boundary we compute a different functional of its expectation\nvalue, rather than $\\mathrm{sign}\\left(\\mathbb{E}\\right [ W ])$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:52:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cavalcanti","Paulo J.",""],["Scala","Giovanni",""],["Mandarino","Antonio",""],["Lupo","Cosmo",""]]}
{"id":"2308.07745","submitter":"Lu Yang","authors":"Yaobin Ou, Lu Yang","title":"Low Mach number limit for non-isentropic magnetohydrodynamic equations\n  with ill-prepared data and zero magnetic diffusivity in bounded domains","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 article, we verify the low Mach number limit of strong solutions to\nthe non-isentropic compressible magnetohydrodynamic equations with zero\nmagnetic diffusivity and ill-prepared initial data in three-dimensional bounded\ndomains, when the density and the temperature vary around constant states.\nInvoking a new weighted energy functional, we establish the uniform estimates\nwith respect to the Mach number, especially for the spatial derivatives of high\norder. Due to the vorticity-slip boundary condition of the velocity, we\ndecompose the uniform estimates into the part for the fast variables and the\nother one for the slow variables. In particular, the weighted estimates of\nhighest-order spatial derivatives of the fast variables are crucial for the\nuniform bounds. Finally, the low Mach number limit is justified by the strong\nconvergence of the density and the temperature, the divergence-free component\nof the velocity, and the weak convergence of other variables. The methods in\nthis paper can be applied to singular limits of general hydrodynamic equations\nof hyperbolic-parabolic type, including the full Navier-Stokes equations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:53:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ou","Yaobin",""],["Yang","Lu",""]]}
{"id":"2308.07746","submitter":"Amit Ganz","authors":"Amit Ganz, Pranav Nuti, Roy Schwartz","title":"A Tight Competitive Ratio for Online Submodular Welfare Maximization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we consider the online Submodular Welfare (SW) problem. In this\nproblem we are given $n$ bidders each equipped with a general (not necessarily\nmonotone) submodular utility and $m$ items that arrive online. The goal is to\nassign each item, once it arrives, to a bidder or discard it, while maximizing\nthe sum of utilities. When an adversary determines the items' arrival order we\npresent a simple randomized algorithm that achieves a tight competitive ratio\nof $\\nicefrac{1}{4}$. The algorithm is a specialization of an algorithm due to\n[Harshaw-Kazemi-Feldman-Karbasi MOR`22], who presented the previously best\nknown competitive ratio of $3-2\\sqrt{2}\\approx 0.171573 $ to the problem. When\nthe items' arrival order is uniformly random, we present a competitive ratio of\n$\\approx 0.27493$, improving the previously known $\\nicefrac{1}{4}$ guarantee.\nOur approach for the latter result is based on a better analysis of the\n(offline) Residual Random Greedy (RRG) algorithm of\n[Buchbinder-Feldman-Naor-Schwartz SODA`14], which we believe might be of\nindependent interest.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:53:21 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ganz","Amit",""],["Nuti","Pranav",""],["Schwartz","Roy",""]]}
{"id":"2308.07747","submitter":"Edgar Ortega Roano","authors":"Edgar Ortega-Roano, Mathieu Souzy, Thomas Weinhart, Devaraj van der\n  Meer, Alvaro Marin","title":"Clogging of non-cohesive suspensions through constrictions using an\n  efficient unresolved CFD-DEM solver","comments":"arXiv admin note: text overlap with arXiv:2205.04354","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  When objects are forced to flow through constrictions their transport can be\nfrustrated temporarily or permanently due to the formation of arches in the\nregion of the bottleneck. While such systems have been intensively studied in\nthe case of solid particles in a gas phase being forced by gravitational\nforces, the case of solid particles suspended in a liquid phase, forced by the\nliquid itself, has received much less attention. In this case, the influence of\nthe liquid flow on the transport efficiency is not well understood yet, leading\nto several apparently trivial, but yet unanswered questions, e.g., would an\nincrease of the liquid flow improve the transport of particles or worsen it?\nAlthough some experimental data is already available, it lacks enough detail to\ngive a complete answer to such a question. Numerical models would be needed to\nscrutinize the system deeper. In this paper, we study this system making use of\nan advanced discrete particle solver (MercuryDPM) and an approximated numerical\nmodel for the liquid drag and compare the results with experimental data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:56:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ortega-Roano","Edgar",""],["Souzy","Mathieu",""],["Weinhart","Thomas",""],["van der Meer","Devaraj",""],["Marin","Alvaro",""]]}
{"id":"2308.07748","submitter":"Marius Lippke","authors":"Marius Lippke, Maurice Quach, Sascha Braun, Daniel K\\\"ohler, Michael\n  Ulrich, Bastian Bischoff and Wei Yap Tan","title":"Exploiting Sparsity in Automotive Radar Object Detection Networks","comments":null,"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":"  Having precise perception of the environment is crucial for ensuring the\nsecure and reliable functioning of autonomous driving systems. Radar object\ndetection networks are one fundamental part of such systems. CNN-based object\ndetectors showed good performance in this context, but they require large\ncompute resources. This paper investigates sparse convolutional object\ndetection networks, which combine powerful grid-based detection with low\ncompute resources. We investigate radar specific challenges and propose sparse\nkernel point pillars (SKPP) and dual voxel point convolutions (DVPC) as\nremedies for the grid rendering and sparse backbone architectures. We evaluate\nour SKPP-DPVCN architecture on nuScenes, which outperforms the baseline by\n5.89% and the previous state of the art by 4.19% in Car AP4.0. Moreover,\nSKPP-DPVCN reduces the average scale error (ASE) by 21.41% over the baseline.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:58:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lippke","Marius",""],["Quach","Maurice",""],["Braun","Sascha",""],["K\u00f6hler","Daniel",""],["Ulrich","Michael",""],["Bischoff","Bastian",""],["Tan","Wei Yap",""]]}
{"id":"2308.07749","submitter":"Bosheng Qin","authors":"Bosheng Qin, Wentao Ye, Qifan Yu, Siliang Tang, Yueting Zhuang","title":"Dancing Avatar: Pose and Text-Guided Human Motion Videos Synthesis with\n  Image Diffusion Model","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rising demand for creating lifelike avatars in the digital realm has led\nto an increased need for generating high-quality human videos guided by textual\ndescriptions and poses. We propose Dancing Avatar, designed to fabricate human\nmotion videos driven by poses and textual cues. Our approach employs a\npretrained T2I diffusion model to generate each video frame in an\nautoregressive fashion. The crux of innovation lies in our adept utilization of\nthe T2I diffusion model for producing video frames successively while\npreserving contextual relevance. We surmount the hurdles posed by maintaining\nhuman character and clothing consistency across varying poses, along with\nupholding the background's continuity amidst diverse human movements. To ensure\nconsistent human appearances across the entire video, we devise an intra-frame\nalignment module. This module assimilates text-guided synthesized human\ncharacter knowledge into the pretrained T2I diffusion model, synergizing\ninsights from ChatGPT. For preserving background continuity, we put forth a\nbackground alignment pipeline, amalgamating insights from segment anything and\nimage inpainting techniques. Furthermore, we propose an inter-frame alignment\nmodule that draws inspiration from an auto-regressive pipeline to augment\ntemporal consistency between adjacent frames, where the preceding frame guides\nthe synthesis process of the current frame. Comparisons with state-of-the-art\nmethods demonstrate that Dancing Avatar exhibits the capacity to generate human\nvideos with markedly superior quality, both in terms of human and background\nfidelity, as well as temporal coherence compared to existing state-of-the-art\napproaches.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:00:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Qin","Bosheng",""],["Ye","Wentao",""],["Yu","Qifan",""],["Tang","Siliang",""],["Zhuang","Yueting",""]]}
{"id":"2308.07750","submitter":"Adam Sky","authors":"Adam Sky, Michael Neunteufel, Peter Lewintan, Andreas Zilian, Patrizio\n  Neff","title":"Novel $H(\\mathrm{sym} \\mathrm{Curl})$-conforming finite elements for the\n  relaxed micromorphic sequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work we construct novel $H(\\mathrm{sym} \\mathrm{Curl})$-conforming\nfinite elements for the recently introduced relaxed micromorphic sequence,\nwhich can be considered as the completion of the $\\mathrm{div}\n\\mathrm{Div}$-sequence with respect to the $H(\\mathrm{sym}\n\\mathrm{Curl})$-space. The elements respect $H(\\mathrm{Curl})$-regularity and\ntheir lowest order versions converge optimally for $[H(\\mathrm{sym}\n\\mathrm{Curl}) \\setminus H(\\mathrm{Curl})]$-fields. This work introduces a\ndetailed construction, proofs of linear independence and conformity of the\nbasis, and numerical examples. Further, we demonstrate an application to the\ncomputation of metamaterials with the relaxed micromorphic model.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:06:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sky","Adam",""],["Neunteufel","Michael",""],["Lewintan","Peter",""],["Zilian","Andreas",""],["Neff","Patrizio",""]]}
{"id":"2308.07751","submitter":"Maximilian Sch\\\"afer","authors":"Maximilian Sch\\\"afer, Kun Zhao and Anton Kummert","title":"CASPNet++: Joint Multi-Agent Motion Prediction","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prediction of road users' future motion is a critical task in supporting\nadvanced driver-assistance systems (ADAS). It plays an even more crucial role\nfor autonomous driving (AD) in enabling the planning and execution of safe\ndriving maneuvers. Based on our previous work, Context-Aware Scene Prediction\nNetwork (CASPNet), an improved system, CASPNet++, is proposed. In this work, we\nfocus on further enhancing the interaction modeling and scene understanding to\nsupport the joint prediction of all road users in a scene using spatiotemporal\ngrids to model future occupancy. Moreover, an instance-based output head is\nintroduced to provide multi-modal trajectories for agents of interest. In\nextensive quantitative and qualitative analysis, we demonstrate the scalability\nof CASPNet++ in utilizing and fusing diverse environmental input sources such\nas HD maps, Radar detection, and Lidar segmentation. Tested on the\nurban-focused prediction dataset nuScenes, CASPNet++ reaches state-of-the-art\nperformance. The model has been deployed in a testing vehicle, running in\nreal-time with moderate computational resources.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:09:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sch\u00e4fer","Maximilian",""],["Zhao","Kun",""],["Kummert","Anton",""]]}
{"id":"2308.07752","submitter":"Yi Liu","authors":"Yi Liu, Hongrui Xuan, Bohan Li, Meng Wang, Tong Chen, Hongzhi Yin","title":"Self-Supervised Dynamic Hypergraph Recommendation based on\n  Hyper-Relational Knowledge Graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge graphs (KGs) are commonly used as side information to enhance\ncollaborative signals and improve recommendation quality. In the context of\nknowledge-aware recommendation (KGR), graph neural networks (GNNs) have emerged\nas promising solutions for modeling factual and semantic information in KGs.\nHowever, the long-tail distribution of entities leads to sparsity in\nsupervision signals, which weakens the quality of item representation when\nutilizing KG enhancement. Additionally, the binary relation representation of\nKGs simplifies hyper-relational facts, making it challenging to model complex\nreal-world information. Furthermore, the over-smoothing phenomenon results in\nindistinguishable representations and information loss. To address these\nchallenges, we propose the SDK (Self-Supervised Dynamic Hypergraph\nRecommendation based on Hyper-Relational Knowledge Graph) framework. This\nframework establishes a cross-view hypergraph self-supervised learning\nmechanism for KG enhancement. Specifically, we model hyper-relational facts in\nKGs to capture interdependencies between entities under complete semantic\nconditions. With the refined representation, a hypergraph is dynamically\nconstructed to preserve features in the deep vector space, thereby alleviating\nthe over-smoothing problem. Furthermore, we mine external supervision signals\nfrom both the global perspective of the hypergraph and the local perspective of\ncollaborative filtering (CF) to guide the model prediction process. Extensive\nexperiments conducted on different datasets demonstrate the superiority of the\nSDK framework over state-of-the-art models. The results showcase its ability to\nalleviate the effects of over-smoothing and supervision signal sparsity.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:12:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Yi",""],["Xuan","Hongrui",""],["Li","Bohan",""],["Wang","Meng",""],["Chen","Tong",""],["Yin","Hongzhi",""]]}
{"id":"2308.07753","submitter":"Andre Erpenbeck","authors":"A. Erpenbeck, E. Gull, G. Cohen","title":"Shaping electronic flows with strongly correlated physics","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":"  Nonequilibrium quantum transport is of central importance in nanotechnology.\nIts description requires the understanding of strong electronic correlations,\nwhich couple atomic-scale phenomena to the nanoscale. So far, research in\ncorrelated transport focused predominantly on few-channel transport, precluding\nthe investigation of cross-scale effects. Recent theoretical advances enable\nthe solution of models that capture the interplay between quantum correlations\nand confinement beyond a few channels. This problem is the focus of this study.\nWe consider an atomic impurity embedded in a metallic nanosheet spanning two\nleads, showing that transport is significantly altered by tuning only the phase\nof a single, local hopping parameter. Furthermore -- depending on this phase --\ncorrelations reshape the electronic flow throughout the sheet, either funneling\nit through the impurity or scattering it away from a much larger region. This\ndemonstrates the potential for quantum correlations to bridge length scales in\nthe design of nanoelectronic devices and sensors.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:13:28 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Erpenbeck","A.",""],["Gull","E.",""],["Cohen","G.",""]]}
{"id":"2308.07754","submitter":"Chia-Wei Liu","authors":"Chia-Wei Liu","title":"Nonleptonic two-body weak decays of charmed baryons","comments":"37 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We systematically analyze the two-body nonleptonic weak decays of charmed\nbaryons, employing the pole approximation in tandem with the $SU(3)_F$\nsymmetry. Leveraging the K\\\"orner-Patti-Woo theorem, we demonstrate a\nsignificant reduction in the number of free parameters. Within the general pole\nscenario, we successfully explain most of the experimental data of ${\\bf B}_c^A\n\\to {\\bf B}_nP$, though some inconsistencies are detected and recommended for\nreexamination in future research. Assuming the dominance of low-lying\nintermediate baryons, we are able to make novel predictions for decay channels\nsuch as $\\Omega_c^0 \\to {\\bf B}_n P$ and ${\\bf B}_{cc}\\to {\\bf B}_c^{A,S} P$.\nHere, ${\\bf B}_n$, ${\\bf B}_{c}^A$, ${\\bf B}_c^S$ and ${\\bf B}_{cc}$ are the\nlow-lying octet, antitriplet charmed, sextet charmed and doubly charmed\nbaryons, respectively, and $P$ is the pseudoscalar meson. Our findings also\nreveal that the fitted effective Wilson coefficient ${\\cal C}_+=0.469$ is\nnotably smaller than the na\\\"ive expectation, and the low-lying pole scenario\nfails to account for ${\\cal B}(\\Lambda_c^+ \\to n \\pi^+ , \\Xi^0 K^+)$ , despite\nconsistencies with the soft meson limit. We further recommend the decay channel\n$\\Xi_{cc}^+ \\to \\Xi_c^0 \\pi^+ \\to \\Xi^- \\pi^+\\pi^+\\pi^+\\pi^-$ for exploring\nevidence of $\\Xi_{cc}^+$, estimating the branching fraction at $(1.1\\pm\n0.6)\\times 10^{-3}$. The predictions for nonleptonic weak decay channels are\ncompiled in the appendices, providing valuable references for future\nexperimental validation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:14:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Chia-Wei",""]]}
{"id":"2308.07755","submitter":"Wen Teng","authors":"Wen Teng, Hui Zhang","title":"Deformations and extensions of modified $\\lambda$-differential $3$-Lie\n  Algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we introduce the representation of modified\n$\\lambda$-differential $3$-Lie algebras and define the cohomology of modified\n$\\lambda$-differential $3$-Lie algebras with coefficients in a representation.\nAs applications of the proposed cohomology theory, we study linear\ndeformations, abelian extensions and $T^*$-extensions of modified\n$\\lambda$-differential $3$-Lie algebras.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:34:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Teng","Wen",""],["Zhang","Hui",""]]}
{"id":"2308.07756","submitter":"Golla Ramesh","authors":"G. Ramesh, M. Veena Sangeetha, and Shanola S. Sequeira","title":"Representation of Compact Operators between Banach spaces","comments":"16 Pages, submitted to a journal. Comments/suggestions are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this article, we give a representation for compact operators acting\nbetween reflexive Banach spaces, which generalizes the representation given by\nEdmunds et al. for compact operators between reflexive Banach spaces with\nstrictly convex duals. Further, we give a representation for operators on\nBanach spaces that are comparable to compact normal operators on Hilbert spaces\nand illustrate our result with an example.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:18:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ramesh","G.",""],["Sangeetha","M. Veena",""],["Sequeira","Shanola S.",""]]}
{"id":"2308.07757","submitter":"Lucas Deutschmann","authors":"Lucas Deutschmann, Johannes Mueller, Mohammad Rahmani Fadiheh, Dominik\n  Stoffel, Wolfgang Kunz","title":"A Scalable Formal Verification Methodology for Data-Oblivious Hardware","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The importance of preventing microarchitectural timing side channels in\nsecurity-critical applications has surged in recent years. Constant-time\nprogramming has emerged as a best-practice technique for preventing the leakage\nof secret information through timing. It is based on the assumption that the\ntiming of certain basic machine instructions is independent of their respective\ninput data. However, whether or not an instruction satisfies this\ndata-independent timing criterion varies between individual processor\nmicroarchitectures. In this paper, we propose a novel methodology to formally\nverify data-oblivious behavior in hardware using standard property checking\ntechniques. The proposed methodology is based on an inductive property that\nenables scalability even to complex out-of-order cores. We show that proving\nthis inductive property is sufficient to exhaustively verify data-obliviousness\nat the microarchitectural level. In addition, the paper discusses several\ntechniques that can be used to make the verification process easier and faster.\nWe demonstrate the feasibility of the proposed methodology through case studies\non several open-source designs. One case study uncovered a data-dependent\ntiming violation in the extensively verified and highly secure IBEX RISC-V\ncore. In addition to several hardware accelerators and in-order processors, our\nexperiments also include RISC-V BOOM, a complex out-of-order processor,\nhighlighting the scalability of the approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:19:17 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deutschmann","Lucas",""],["Mueller","Johannes",""],["Fadiheh","Mohammad Rahmani",""],["Stoffel","Dominik",""],["Kunz","Wolfgang",""]]}
{"id":"2308.07758","submitter":"Weisen Jiang","authors":"Weisen Jiang and Han Shi and Longhui Yu and Zhengying Liu and Yu Zhang\n  and Zhenguo Li and James T. Kwok","title":"Forward-Backward Reasoning in Large Language Models for Verification","comments":"Preprint","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":"  Chain-of-Though (CoT) prompting has shown promising performance in various\nreasoning tasks. Recently, Self-Consistency \\citep{wang2023selfconsistency}\nproposes to sample a diverse set of reasoning chains which may lead to\ndifferent answers while the answer that receives the most votes is selected. In\nthis paper, we propose a novel method to use backward reasoning in verifying\ncandidate answers. We mask a token in the question by ${\\bf x}$ and ask the LLM\nto predict the masked token when a candidate answer is provided by \\textit{a\nsimple template}, i.e., \"\\textit{\\textbf{If we know the answer of the above\nquestion is \\{a candidate answer\\}, what is the value of unknown variable ${\\bf\nx}$?}}\" Intuitively, the LLM is expected to predict the masked token\nsuccessfully if the provided candidate answer is correct. We further propose\nFOBAR to combine forward and backward reasoning for estimating the probability\nof candidate answers. We conduct extensive experiments on six data sets and\nthree LLMs. Experimental results demonstrate that FOBAR achieves\nstate-of-the-art performance on various reasoning benchmarks.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:19:59 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 05:55:44 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 09:35:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jiang","Weisen",""],["Shi","Han",""],["Yu","Longhui",""],["Liu","Zhengying",""],["Zhang","Yu",""],["Li","Zhenguo",""],["Kwok","James T.",""]]}
{"id":"2308.07759","submitter":"Cara-Lena Nies","authors":"Cara-Lena Nies, Thomas P. Sheerin and Stefan Schulz","title":"Electronic and optical properties of boron containing GaN alloys: The\n  role boron atom clustering","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":"  Boron (B) containing III-nitride materials, such as wurtzite (B,Ga)N alloys,\nhave recently attracted significant interest to tailor the electronic and\noptical properties of optoelectronic devices operating in the visible and\nultraviolet spectral range. However, the growth of high quality samples is\nchallenging and B atom clustering is often observed in (B,Ga)N alloys. To date,\nfundamental understanding of the impact of such clustering on electronic and\noptical properties of these alloys is sparse. In this work we employ density\nfunctional theory (DFT) in the framework of the meta generalized gradient\napproximation (modified Becke Johnson (mBJ) functional) to provide insight into\nthis question. We use mBJ DFT calculations, benchmarked against\nstate-of-the-art hybrid functional DFT, on (B,Ga)N alloys in the experimentally\nrelevant B content range of up to 7.4%. Our results reveal that B atom\nclustering can lead to a strong reduction in the bandgap of such an alloy, in\ncontrast to alloy configurations where B atoms are not forming clusters, thus\nnot sharing nitrogen (N) atoms. We find that the reduction in bandgap is linked\nmainly to carrier localization effects in the valence band, which stem from\nlocal strain and polarization field effects. However, our study also reveals\nthat the alloy microstructure of a B atom cluster plays an important role: B\natom chains along the wurtzite c-axis impact the electronic structure far less\nstrongly when compared to a chain formed within the c-plane. This effect is\nagain linked to local polarization field effects and the orbital character of\nthe involved valence states in wurtzite BN and GaN. Overall, our calculations\nshow that controlling the alloy microstructure of (B,Ga)N alloys is of central\nimportance when it comes to utilizing these systems in future optoelectronic\ndevices with improved efficiencies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:24:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nies","Cara-Lena",""],["Sheerin","Thomas P.",""],["Schulz","Stefan",""]]}
{"id":"2308.07760","submitter":"Bowei He","authors":"Bowei He, Xu He, Renrui Zhang, Yingxue Zhang, Ruiming Tang, Chen Ma","title":"Dynamic Embedding Size Search with Minimum Regret for Streaming\n  Recommender System","comments":"Accepted for publication on CIKM2023","journal-ref":null,"doi":"10.1145/3583780.3615135","report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the continuous increase of users and items, conventional recommender\nsystems trained on static datasets can hardly adapt to changing environments.\nThe high-throughput data requires the model to be updated in a timely manner\nfor capturing the user interest dynamics, which leads to the emergence of\nstreaming recommender systems. Due to the prevalence of deep learning-based\nrecommender systems, the embedding layer is widely adopted to represent the\ncharacteristics of users, items, and other features in low-dimensional vectors.\nHowever, it has been proved that setting an identical and static embedding size\nis sub-optimal in terms of recommendation performance and memory cost,\nespecially for streaming recommendations. To tackle this problem, we first\nrethink the streaming model update process and model the dynamic embedding size\nsearch as a bandit problem. Then, we analyze and quantify the factors that\ninfluence the optimal embedding sizes from the statistics perspective. Based on\nthis, we propose the \\textbf{D}ynamic \\textbf{E}mbedding \\textbf{S}ize\n\\textbf{S}earch (\\textbf{DESS}) method to minimize the embedding size selection\nregret on both user and item sides in a non-stationary manner. Theoretically,\nwe obtain a sublinear regret upper bound superior to previous methods.\nEmpirical results across two recommendation tasks on four public datasets also\ndemonstrate that our approach can achieve better streaming recommendation\nperformance with lower memory cost and higher time efficiency.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:27:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["He","Bowei",""],["He","Xu",""],["Zhang","Renrui",""],["Zhang","Yingxue",""],["Tang","Ruiming",""],["Ma","Chen",""]]}
{"id":"2308.07761","submitter":"Honggu Kang","authors":"Honggu Kang, Seohyeon Cha, Jinwoo Shin, Jongmyeong Lee, Joonhyuk Kang","title":"NeFL: Nested Federated Learning for Heterogeneous Clients","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Federated learning (FL) is a promising approach in distributed learning\nkeeping privacy. However, during the training pipeline of FL, slow or incapable\nclients (i.e., stragglers) slow down the total training time and degrade\nperformance. System heterogeneity, including heterogeneous computing and\nnetwork bandwidth, has been addressed to mitigate the impact of stragglers.\nPrevious studies split models to tackle the issue, but with less\ndegree-of-freedom in terms of model architecture. We propose nested federated\nlearning (NeFL), a generalized framework that efficiently divides a model into\nsubmodels using both depthwise and widthwise scaling. NeFL is implemented by\ninterpreting models as solving ordinary differential equations (ODEs) with\nadaptive step sizes. To address the inconsistency that arises when training\nmultiple submodels with different architecture, we decouple a few parameters.\nNeFL enables resource-constrained clients to effectively join the FL pipeline\nand the model to be trained with a larger amount of data. Through a series of\nexperiments, we demonstrate that NeFL leads to significant gains, especially\nfor the worst-case submodel (e.g., 8.33 improvement on CIFAR-10). Furthermore,\nwe demonstrate NeFL aligns with recent studies in FL.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:29:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kang","Honggu",""],["Cha","Seohyeon",""],["Shin","Jinwoo",""],["Lee","Jongmyeong",""],["Kang","Joonhyuk",""]]}
{"id":"2308.07762","submitter":"Jayanthi Vajiram Mrs","authors":"Jayanthi Vajiram, Aishwarya Senthil, Utkarsh Maurya","title":"Evaluating the anticipated outcomes of MRI seizure image from\n  open-source tool- Prototype approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Epileptic Seizure is an abnormal neuronal exertion in the brain, affecting\nnearly 70 million of the world's population (Ngugi et al., 2010). So many\nopen-source neuroimaging tools are used for metabolism checkups and analysis\npurposes. The scope of open-source tools like MATLAB, Slicer 3D, Brain\nSuite21a, SPM, and MedCalc are explained in this paper. MATLAB was used by 60%\nof the researchers for their image processing and 10% of them use their\nproprietary software. More than 30% of the researchers use other open-source\nsoftware tools with their processing techniques for the study of magnetic\nresonance seizure images\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 10:27:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Vajiram","Jayanthi",""],["Senthil","Aishwarya",""],["Maurya","Utkarsh",""]]}
{"id":"2308.07763","submitter":"Purushottam Parthasarathy","authors":"Purushottam Parthasarathy, Avinash Bhardwaj, Manjesh K. Hanawal","title":"Online Universal Dirichlet Factor Portfolios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.CE q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the online portfolio allocation problem and propose universal\nportfolios that use factor weighing to produce portfolios that out-perform\nuniform dirichlet allocation schemes. We show a few analytical results on the\nlower bounds of portfolio growth when the returns are known to follow a factor\nmodel. We also show analytically that factor weighted dirichlet sampled\nportfolios dominate the wealth generated by uniformly sampled dirichlet\nportfolios. We corroborate our analytical results with empirical studies on\nequity markets that are known to be driven by factors.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:29:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Parthasarathy","Purushottam",""],["Bhardwaj","Avinash",""],["Hanawal","Manjesh K.",""]]}
{"id":"2308.07764","submitter":"Xuhan Guo","authors":"Yujia Zhang, Xuhan Guo, Tom Albrow-Owen, Zhenyu Zhao, Yaotian Zhao,\n  Tawfique Hasan, Zongyin Yang and Yikai Su","title":"Miniaturized Computational Photonic Molecule Spectrometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Miniaturized spectrometry system is playing an essential role for materials\nanalysis in the development of in-situ or portable sensing platforms across\nresearch and industry. However, there unavoidably exists trade-offs between the\nresolution and operation bandwidth as the device scale down. Here, we report an\nextreme miniaturized computational photonic molecule (PM) spectrometer\nutilizing the diverse spectral characteristics and mode-hybridization effect of\nsplit eigenfrequencies and super-modes, which effectively eliminates the\ninherent periodicity and expands operation bandwidth with ultra-high spectral\nresolution. These results of dynamic control of the frequency, amplitude, and\nphase of photons in the photonic multi-atomic systems, pave the way to the\ndevelopment of benchtop sensing platforms for applications previously\nunfeasible due to resolution-bandwidth-footprint limitations, such as in gas\nsensing or nanoscale biomedical sensing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:33:06 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Yujia",""],["Guo","Xuhan",""],["Albrow-Owen","Tom",""],["Zhao","Zhenyu",""],["Zhao","Yaotian",""],["Hasan","Tawfique",""],["Yang","Zongyin",""],["Su","Yikai",""]]}
{"id":"2308.07765","submitter":"Julia Lindberg","authors":"Julia Lindberg, Leonid Monin, Kemal Rose","title":"The algebraic degree of sparse polynomial optimization","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study a broad class of polynomial optimization problems\nwhose constraints and objective functions exhibit sparsity patterns. We give\ntwo characterizations of the number of critical points to these problems, one\nas a mixed volume and one as an intersection product on a toric variety. As a\ncorollary, we obtain a convex geometric interpretation of polar degrees, a\nclassical invariant of algebraic varieties as well as Euclidean distance\ndegrees. Furthermore, we prove BKK generality of Lagrange systems in many\ninstances. Motivated by our result expressing the algebraic degree of sparse\npolynomial optimisation problems via Porteus' formula, in the appendix we\nanswer a related question concerning the degree of sparse determinantal\nvarieties.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:33:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lindberg","Julia",""],["Monin","Leonid",""],["Rose","Kemal",""]]}
{"id":"2308.07766","submitter":"Xiaomin Lin","authors":"Akshaj Gaur, Cheng Liu, Xiaomin Lin, Nare Karapetyan, Yiannis\n  Aloimonos","title":"Whale Detection Enhancement through Synthetic Satellite Images","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":"  With a number of marine populations in rapid decline, collecting and\nanalyzing data about marine populations has become increasingly important to\ndevelop effective conservation policies for a wide range of marine animals,\nincluding whales. Modern computer vision algorithms allow us to detect whales\nin images in a wide range of domains, further speeding up and enhancing the\nmonitoring process. However, these algorithms heavily rely on large training\ndatasets, which are challenging and time-consuming to collect particularly in\nmarine or aquatic environments. Recent advances in AI however have made it\npossible to synthetically create datasets for training machine learning\nalgorithms, thus enabling new solutions that were not possible before. In this\nwork, we present a solution - SeaDroneSim2 benchmark suite, which addresses\nthis challenge by generating aerial, and satellite synthetic image datasets to\nimprove the detection of whales and reduce the effort required for training\ndata collection. We show that we can achieve a 15% performance boost on whale\ndetection compared to using the real data alone for training, by augmenting a\n10% real data. We open source both the code of the simulation platform\nSeaDroneSim2 and the dataset generated through it.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:35:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gaur","Akshaj",""],["Liu","Cheng",""],["Lin","Xiaomin",""],["Karapetyan","Nare",""],["Aloimonos","Yiannis",""]]}
{"id":"2308.07767","submitter":"Bhan Lam","authors":"Bhan Lam, Zhen-Ting Ong, Kenneth Ooi, Wen-Hui Ong, Trevor Wong, Karn\n  N. Watcharasupat, Woon-Seng Gan","title":"Preliminary investigation of the short-term in situ performance of an\n  automatic masker selection system","comments":"paper submitted to the 52nd International Congress and Exposition on\n  Noise Control Engineering held in Chiba, Greater Tokyo, Japan, on 20-23\n  August 2023 (Inter-Noise 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Soundscape augmentation or \"masking\" introduces wanted sounds into the\nacoustic environment to improve acoustic comfort. Usually, the masker selection\nand playback strategies are either arbitrary or based on simple rules (e.g. -3\ndBA), which may lead to sub-optimal increment or even reduction in acoustic\ncomfort for dynamic acoustic environments. To reduce ambiguity in the selection\nof maskers, an automatic masker selection system (AMSS) was recently developed.\nThe AMSS uses a deep-learning model trained on a large-scale dataset of\nsubjective responses to maximize the derived ISO pleasantness (ISO 12913-2).\nHence, this study investigates the short-term in situ performance of the AMSS\nimplemented in a gazebo in an urban park. Firstly, the predicted ISO\npleasantness from the AMSS is evaluated in comparison to the in situ subjective\nevaluation scores. Secondly, the effect of various masker selection schemes on\nthe perceived affective quality and appropriateness would be evaluated. In\ntotal, each participant evaluated 6 conditions: (1) ambient environment with no\nmaskers; (2) AMSS; (3) bird and (4) water masker from prior art; (5) random\nselection from same pool of maskers used to train the AMSS; and (6) selection\nof best-performing maskers based on the analysis of the dataset used to train\nthe AMSS.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:37:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lam","Bhan",""],["Ong","Zhen-Ting",""],["Ooi","Kenneth",""],["Ong","Wen-Hui",""],["Wong","Trevor",""],["Watcharasupat","Karn N.",""],["Gan","Woon-Seng",""]]}
{"id":"2308.07768","submitter":"Yoav Sagi","authors":"Jonathan Nemirovsky, Rafi Weill, Ilan Meltzer, and Yoav Sagi","title":"Atomic interferometer based on optical tweezers","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.quant-gas physics.atom-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atomic interferometers measure forces and acceleration with exceptional\nprecision. The conventional approach to atomic interferometry is to launch an\natomic cloud into a ballistic trajectory and perform the wave-packet splitting\nin momentum space by Raman transitions. This places severe constraints on the\npossible atomic trajectory, positioning accuracy and probing duration. Here, we\npropose and analyze a novel atomic interferometer that uses micro-optical traps\n(optical tweezers) to manipulate and control the motion of atoms. The new\ninterferometer allows long probing time, sub micrometer positioning accuracy,\nand utmost flexibility in shaping of the atomic trajectory. The cornerstone of\nthe tweezer interferometer are the coherent atomic splitting and combining\nschemes. We present two adiabatic schemes with two or three tweezers that are\nrobust to experimental imperfections and work simultaneously with many\nvibrational states. The latter property allows for multi-atom interferometry in\na single run. We also highlight the advantage of using fermionic atoms to\nobtain single-atom occupation of vibrational states and to eliminate mean-field\nshifts. We examine the impact of tweezer intensity noise and demonstrate that,\nwhen constrained by shot noise, the interferometer can achieve a relative\naccuracy better than $10^{-12}$ in measuring Earth's gravitational\nacceleration. The sub-micrometer resolution and extended measurement duration\noffer promising opportunities for exploring fundamental physical laws in new\nregimes. We discuss two applications well-suited for the unique capabilities of\nthe tweezer interferometer: the measurement of gravitational forces and the\nstudy of Casimir-Polder forces between atoms and surfaces. Crucially, our\nproposed tweezer interferometer is within the reach of current technological\ncapabilities.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:42:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nemirovsky","Jonathan",""],["Weill","Rafi",""],["Meltzer","Ilan",""],["Sagi","Yoav",""]]}
{"id":"2308.07769","submitter":"Fabio Miranda","authors":"Gustavo Moreira, Maryam Hosseini, Md Nafiul Alam Nipu, Marcos Lage,\n  Nivan Ferreira, Fabio Miranda","title":"The Urban Toolkit: A Grammar-based Framework for Urban Visual Analytics","comments":"Accepted at IEEE VIS 2023. UTK is available at http://urbantk.org","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While cities around the world are looking for smart ways to use new advances\nin data collection, management, and analysis to address their problems, the\ncomplex nature of urban issues and the overwhelming amount of available data\nhave posed significant challenges in translating these efforts into actionable\ninsights. In the past few years, urban visual analytics tools have\nsignificantly helped tackle these challenges. When analyzing a feature of\ninterest, an urban expert must transform, integrate, and visualize different\nthematic (e.g., sunlight access, demographic) and physical (e.g., buildings,\nstreet networks) data layers, oftentimes across multiple spatial and temporal\nscales. However, integrating and analyzing these layers require expertise in\ndifferent fields, increasing development time and effort. This makes the entire\nvisual data exploration and system implementation difficult for programmers and\nalso sets a high entry barrier for urban experts outside of computer science.\nWith this in mind, in this paper, we present the Urban Toolkit (UTK), a\nflexible and extensible visualization framework that enables the easy authoring\nof web-based visualizations through a new high-level grammar specifically built\nwith common urban use cases in mind. In order to facilitate the integration and\nvisualization of different urban data, we also propose the concept of knots to\nmerge thematic and physical urban layers. We evaluate our approach through use\ncases and a series of interviews with experts and practitioners from different\ndomains, including urban accessibility, urban planning, architecture, and\nclimate science. UTK is available at urbantk.org.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:43:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Moreira","Gustavo",""],["Hosseini","Maryam",""],["Nipu","Md Nafiul Alam",""],["Lage","Marcos",""],["Ferreira","Nivan",""],["Miranda","Fabio",""]]}
{"id":"2308.07770","submitter":"Kaishen Yuan","authors":"Xin Liu, Kaishen Yuan, Xuesong Niu, Jingang Shi, Zitong Yu, Huanjing\n  Yue, Jingyu Yang","title":"Multi-scale Promoted Self-adjusting Correlation Learning for Facial\n  Action Unit Detection","comments":"13pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Facial Action Unit (AU) detection is a crucial task in affective computing\nand social robotics as it helps to identify emotions expressed through facial\nexpressions. Anatomically, there are innumerable correlations between AUs,\nwhich contain rich information and are vital for AU detection. Previous methods\nused fixed AU correlations based on expert experience or statistical rules on\nspecific benchmarks, but it is challenging to comprehensively reflect complex\ncorrelations between AUs via hand-crafted settings. There are alternative\nmethods that employ a fully connected graph to learn these dependencies\nexhaustively. However, these approaches can result in a computational explosion\nand high dependency with a large dataset. To address these challenges, this\npaper proposes a novel self-adjusting AU-correlation learning (SACL) method\nwith less computation for AU detection. This method adaptively learns and\nupdates AU correlation graphs by efficiently leveraging the characteristics of\ndifferent levels of AU motion and emotion representation information extracted\nin different stages of the network. Moreover, this paper explores the role of\nmulti-scale learning in correlation information extraction, and design a simple\nyet effective multi-scale feature learning (MSFL) method to promote better\nperformance in AU detection. By integrating AU correlation information with\nmulti-scale features, the proposed method obtains a more robust feature\nrepresentation for the final AU detection. Extensive experiments show that the\nproposed method outperforms the state-of-the-art methods on widely used AU\ndetection benchmark datasets, with only 28.7\\% and 12.0\\% of the parameters and\nFLOPs of the best method, respectively. The code for this method is available\nat \\url{https://github.com/linuxsino/Self-adjusting-AU}.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:43:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Xin",""],["Yuan","Kaishen",""],["Niu","Xuesong",""],["Shi","Jingang",""],["Yu","Zitong",""],["Yue","Huanjing",""],["Yang","Jingyu",""]]}
{"id":"2308.07771","submitter":"Wei Qian","authors":"Wei Qian, Dan Guo, Kun Li, Xilan Tian, Meng Wang","title":"Dual-path TokenLearner for Remote Photoplethysmography-based\n  Physiological Measurement with Facial Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Remote photoplethysmography (rPPG) based physiological measurement is an\nemerging yet crucial vision task, whose challenge lies in exploring accurate\nrPPG prediction from facial videos accompanied by noises of illumination\nvariations, facial occlusions, head movements, \\etc, in a non-contact manner.\nExisting mainstream CNN-based models make efforts to detect physiological\nsignals by capturing subtle color changes in facial regions of interest (ROI)\ncaused by heartbeats. However, such models are constrained by the limited local\nspatial or temporal receptive fields in the neural units. Unlike them, a native\nTransformer-based framework called Dual-path TokenLearner (Dual-TL) is proposed\nin this paper, which utilizes the concept of learnable tokens to integrate both\nspatial and temporal informative contexts from the global perspective of the\nvideo. Specifically, the proposed Dual-TL uses a Spatial TokenLearner (S-TL) to\nexplore associations in different facial ROIs, which promises the rPPG\nprediction far away from noisy ROI disturbances. Complementarily, a Temporal\nTokenLearner (T-TL) is designed to infer the quasi-periodic pattern of\nheartbeats, which eliminates temporal disturbances such as head movements. The\ntwo TokenLearners, S-TL and T-TL, are executed in a dual-path mode. This\nenables the model to reduce noise disturbances for final rPPG signal\nprediction. Extensive experiments on four physiological measurement benchmark\ndatasets are conducted. The Dual-TL achieves state-of-the-art performances in\nboth intra- and cross-dataset testings, demonstrating its immense potential as\na basic backbone for rPPG measurement. The source code is available at\n\\href{https://github.com/VUT-HFUT/Dual-TL}{https://github.com/VUT-HFUT/Dual-TL}\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:45:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Qian","Wei",""],["Guo","Dan",""],["Li","Kun",""],["Tian","Xilan",""],["Wang","Meng",""]]}
{"id":"2308.07772","submitter":"Tianchao Li","authors":"Tianchao Li and Yulong Pei","title":"MOLE: MOdular Learning FramEwork via Mutual Information Maximization","comments":"accepted by icml llw","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper is to introduce an asynchronous and local learning framework for\nneural networks, named Modular Learning Framework (MOLE). This framework\nmodularizes neural networks by layers, defines the training objective via\nmutual information for each module, and sequentially trains each module by\nmutual information maximization. MOLE makes the training become local\noptimization with gradient-isolated across modules, and this scheme is more\nbiologically plausible than BP. We run experiments on vector-, grid- and\ngraph-type data. In particular, this framework is capable of solving both\ngraph- and node-level tasks for graph-type data. Therefore, MOLE has been\nexperimentally proven to be universally applicable to different types of data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:48:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Tianchao",""],["Pei","Yulong",""]]}
{"id":"2308.07773","submitter":"Wayne Lawton Dr","authors":"Alex E. Kossovsky and Wayne M. Lawton","title":"A Mathematical Analysis of Benford's Law and its Generalization","comments":"15 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.PR math.ST physics.data-an stat.AP stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explain Kossovsky's generalization of Benford's law which is a formula\nthat approximates the distribution of leftmost digits in finite sequences of\nnatural data and apply it to six sequences of data including populations of US\ncities and towns and times between earthquakes. We model the natural logarithms\nof these two data sequences as samples of random variables having normal and\nreflected Gumbel densities respectively. We show that compliance with the\ngeneral law depends on how nearly constant the periodized density functions are\nand that the models are generally more compliant than the natural data. This\nsurprising result suggests that the generalized law might be used to improve\ndensity estimation which is the basis of statistical pattern recognition,\nmachine learning and data science.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 07:45:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kossovsky","Alex E.",""],["Lawton","Wayne M.",""]]}
{"id":"2308.07774","submitter":"A. Ben Hamza","authors":"Mahsa Mesgaran and A. Ben Hamza","title":"A Graph Encoder-Decoder Network for Unsupervised Anomaly Detection","comments":null,"journal-ref":"Neural Computing and Applications, 2023","doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A key component of many graph neural networks (GNNs) is the pooling\noperation, which seeks to reduce the size of a graph while preserving important\nstructural information. However, most existing graph pooling strategies rely on\nan assignment matrix obtained by employing a GNN layer, which is characterized\nby trainable parameters, often leading to significant computational complexity\nand a lack of interpretability in the pooling process. In this paper, we\npropose an unsupervised graph encoder-decoder model to detect abnormal nodes\nfrom graphs by learning an anomaly scoring function to rank nodes based on\ntheir degree of abnormality. In the encoding stage, we design a novel pooling\nmechanism, named LCPool, which leverages locality-constrained linear coding for\nfeature encoding to find a cluster assignment matrix by solving a least-squares\noptimization problem with a locality regularization term. By enforcing locality\nconstraints during the coding process, LCPool is designed to be free from\nlearnable parameters, capable of efficiently handling large graphs, and can\neffectively generate a coarser graph representation while retaining the most\nsignificant structural characteristics of the graph. In the decoding stage, we\npropose an unpooling operation, called LCUnpool, to reconstruct both the\nstructure and nodal features of the original graph. We conduct empirical\nevaluations of our method on six benchmark datasets using several evaluation\nmetrics, and the results demonstrate its superiority over state-of-the-art\nanomaly detection approaches.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:49:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Mesgaran","Mahsa",""],["Hamza","A. Ben",""]]}
{"id":"2308.07775","submitter":"Kai Yuan Dr.","authors":"Kai Yuan, Noor Sajid, Karl Friston, Zhibin Li","title":"Hierarchical generative modelling for autonomous robots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Humans can produce complex whole-body motions when interacting with their\nsurroundings, by planning, executing and combining individual limb movements.\nWe investigated this fundamental aspect of motor control in the setting of\nautonomous robotic operations. We approach this problem by hierarchical\ngenerative modelling equipped with multi-level planning-for autonomous task\ncompletion-that mimics the deep temporal architecture of human motor control.\nHere, temporal depth refers to the nested time scales at which successive\nlevels of a forward or generative model unfold, for example, delivering an\nobject requires a global plan to contextualise the fast coordination of\nmultiple local movements of limbs. This separation of temporal scales also\nmotivates robotics and control. Specifically, to achieve versatile sensorimotor\ncontrol, it is advantageous to hierarchically structure the planning and\nlow-level motor control of individual limbs. We use numerical and physical\nsimulation to conduct experiments and to establish the efficacy of this\nformulation. Using a hierarchical generative model, we show how a humanoid\nrobot can autonomously complete a complex task that necessitates a holistic use\nof locomotion, manipulation, and grasping. Specifically, we demonstrate the\nability of a humanoid robot that can retrieve and transport a box, open and\nwalk through a door to reach the destination, approach and kick a football,\nwhile showing robust performance in presence of body damage and ground\nirregularities. Our findings demonstrated the effectiveness of using\nhuman-inspired motor control algorithms, and our method provides a viable\nhierarchical architecture for the autonomous completion of challenging\ngoal-directed tasks.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:51:03 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yuan","Kai",""],["Sajid","Noor",""],["Friston","Karl",""],["Li","Zhibin",""]]}
{"id":"2308.07776","submitter":"Woutijn Baars","authors":"Giulio Dacome, Renko Siebols, Woutijn J. Baars","title":"Inner-scaled Helmholtz resonators with grazing turbulent boundary layer\n  flow","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":"  Response details are presented of small-scale Helmholtz resonators excited by\ngrazing turbulent boundary layer flow. A particular focus lies on scaling of\nthe resonance, in relation to the spatio-temporal characteristics of the\nnear-wall velocity and wall-pressure fluctuations. Resonators are tuned to\ndifferent portions of the inner-spectral peak of the boundary-layer\nwall-pressure spectrum, at a spatial scale of $\\lambda_x^+ \\approx 250$ (or\ntemporal scale of $T^+ \\approx 25$). Following this approach, small-scale\nresonators can be designed with neck-orifice diameters of minimum intrusiveness\nto the grazing flow. Here we inspect the TBL response by analysing velocity\ndata obtained with hot-wire anemometry and particle image velocimetry\nmeasurements. This strategy follows the earlier work by Panton and Miller (J.\nAcoust. Soc. Am. 526, 800, 1975) in which only the change in resonance\nfrequency, due to the grazing flow turbulence, was examined. Single resonators\nare examined in a boundary layer flow at $Re_\\tau \\approx 2\\,280$. Two\nneck-orifice diameters of $d^+ \\approx 68$ and 102 are considered, and for each\nvalue of $d^+$ three different resonance frequencies are studied (targeting the\nspatial scale of $\\lambda_x^+ \\approx 250$, as well as sub- and\nsuper-wavelengths). Passive resonance only affects the streamwise velocity\nfluctuations in the region $y^+ \\lesssim 25$, while the vertical velocity\nfluctuations are seen in a layer up to $y^+ \\approx 100$. A narrow-band\nincrease in streamwise turbulence kinetic energy at the resonance scale\nco-exists with a more than 20% attenuation of lower-frequency (larger scale)\nenergy. Current findings inspire further developments of passive surfaces that\nutilize the concept of changing the local wall-impedance for boundary-layer\nflow control, using miniature resonators as a meta-unit.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:53:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Dacome","Giulio",""],["Siebols","Renko",""],["Baars","Woutijn J.",""]]}
{"id":"2308.07777","submitter":"Zuchao Li","authors":"Qiwei Li, Zuchao Li, Xiantao Cai, Bo Du and Hai Zhao","title":"Enhancing Visually-Rich Document Understanding via Layout Structure\n  Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, the use of multi-modal pre-trained Transformers has led to\nsignificant advancements in visually-rich document understanding. However,\nexisting models have mainly focused on features such as text and vision while\nneglecting the importance of layout relationship between text nodes. In this\npaper, we propose GraphLayoutLM, a novel document understanding model that\nleverages the modeling of layout structure graph to inject document layout\nknowledge into the model. GraphLayoutLM utilizes a graph reordering algorithm\nto adjust the text sequence based on the graph structure. Additionally, our\nmodel uses a layout-aware multi-head self-attention layer to learn document\nlayout knowledge. The proposed model enables the understanding of the spatial\narrangement of text elements, improving document comprehension. We evaluate our\nmodel on various benchmarks, including FUNSD, XFUND and CORD, and achieve\nstate-of-the-art results among these datasets. Our experimental results\ndemonstrate that our proposed method provides a significant improvement over\nexisting approaches and showcases the importance of incorporating layout\ninformation into document understanding models. We also conduct an ablation\nstudy to investigate the contribution of each component of our model. The\nresults show that both the graph reordering algorithm and the layout-aware\nmulti-head self-attention layer play a crucial role in achieving the best\nperformance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:53:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Qiwei",""],["Li","Zuchao",""],["Cai","Xiantao",""],["Du","Bo",""],["Zhao","Hai",""]]}
{"id":"2308.07778","submitter":"Wenjie Kang","authors":"Wenjie Kang, Bo Li, Janne M. Papma, Lize C. Jiskoot, Peter Paul De\n  Deyn, Geert Jan Biessels, Jurgen A.H. R. Claassen, Huub A.M. Middelkoop,\n  Wiesje M. van der Flier, Inez H.G.B. Ramakers, Stefan Klein, Esther E. Bron","title":"An Interpretable Machine Learning Model with Deep Learning-based Imaging\n  Biomarkers for Diagnosis of Alzheimer's Disease","comments":"11 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":"  Machine learning methods have shown large potential for the automatic early\ndiagnosis of Alzheimer's Disease (AD). However, some machine learning methods\nbased on imaging data have poor interpretability because it is usually unclear\nhow they make their decisions. Explainable Boosting Machines (EBMs) are\ninterpretable machine learning models based on the statistical framework of\ngeneralized additive modeling, but have so far only been used for tabular data.\nTherefore, we propose a framework that combines the strength of EBM with\nhigh-dimensional imaging data using deep learning-based feature extraction. The\nproposed framework is interpretable because it provides the importance of each\nfeature. We validated the proposed framework on the Alzheimer's Disease\nNeuroimaging Initiative (ADNI) dataset, achieving accuracy of 0.883 and\narea-under-the-curve (AUC) of 0.970 on AD and control classification.\nFurthermore, we validated the proposed framework on an external testing set,\nachieving accuracy of 0.778 and AUC of 0.887 on AD and subjective cognitive\ndecline (SCD) classification. The proposed framework significantly outperformed\nan EBM model using volume biomarkers instead of deep learning-based features,\nas well as an end-to-end convolutional neural network (CNN) with optimized\narchitecture.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:54:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kang","Wenjie",""],["Li","Bo",""],["Papma","Janne M.",""],["Jiskoot","Lize C.",""],["De Deyn","Peter Paul",""],["Biessels","Geert Jan",""],["Claassen","Jurgen A. H. R.",""],["Middelkoop","Huub A. M.",""],["van der Flier","Wiesje M.",""],["Ramakers","Inez H. G. B.",""],["Klein","Stefan",""],["Bron","Esther E.",""]]}
{"id":"2308.07779","submitter":"Chaoran Cui","authors":"Chaoran Cui, Hebo Ma, Chen Zhang, Chunyun Zhang, Yumo Yao, Meng Chen,\n  Yuling Ma","title":"Do We Fully Understand Students' Knowledge States? Identifying and\n  Mitigating Answer Bias in Knowledge Tracing","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge tracing (KT) aims to monitor students' evolving knowledge states\nthrough their learning interactions with concept-related questions, and can be\nindirectly evaluated by predicting how students will perform on future\nquestions. In this paper, we observe that there is a common phenomenon of\nanswer bias, i.e., a highly unbalanced distribution of correct and incorrect\nanswers for each question. Existing models tend to memorize the answer bias as\na shortcut for achieving high prediction performance in KT, thereby failing to\nfully understand students' knowledge states. To address this issue, we approach\nthe KT task from a causality perspective. A causal graph of KT is first\nestablished, from which we identify that the impact of answer bias lies in the\ndirect causal effect of questions on students' responses. A novel\nCOunterfactual REasoning (CORE) framework for KT is further proposed, which\nseparately captures the total causal effect and direct causal effect during\ntraining, and mitigates answer bias by subtracting the latter from the former\nin testing. The CORE framework is applicable to various existing KT models, and\nwe implement it based on the prevailing DKT, DKVMN, and AKT models,\nrespectively. Extensive experiments on three benchmark datasets demonstrate the\neffectiveness of CORE in making the debiased inference for KT.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:56:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cui","Chaoran",""],["Ma","Hebo",""],["Zhang","Chen",""],["Zhang","Chunyun",""],["Yao","Yumo",""],["Chen","Meng",""],["Ma","Yuling",""]]}
{"id":"2308.07780","submitter":"Janus Eriksen","authors":"Frederik {\\O}. Kjeldal and Janus J. Eriksen","title":"Properties of Local Electronic Structures","comments":"20+6 pages, 7 figures. SI as an ancillary file","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The simulation of intrinsic contributions to molecular properties holds the\npotential to allow for chemistry to be directly inferred from changes to\nelectronic structures at the atomic level. In the present study, we demonstrate\nhow such local properties can be readily derived from suitable molecular\norbitals to yield effective fingerprints of various types of atoms in organic\nmolecules. In contrast, corresponding inferences from schemes that instead make\nuse of individual atomic orbitals for this purpose are generally found to fail\nin expressing much uniqueness in atomic environments. By further studying the\nextent to which entire chemical reactions may be decomposed into meaningful and\ncontinuously evolving atomic contributions, schemes based on molecular rather\nthan atomic orbitals are once again found to be the more consistent, even\nallowing for intricate differences between seemingly uniform nucleophilic\nsubstitutions to be probed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:58:14 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kjeldal","Frederik \u00d8.",""],["Eriksen","Janus J.",""]]}
{"id":"2308.07781","submitter":"Hongming Chen","authors":"Zhentao Fan, Hongming Chen, Yufeng Li","title":"Learning Image Deraining Transformer Network with Dynamic Dual\n  Self-Attention","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":"  Recently, Transformer-based architecture has been introduced into single\nimage deraining task due to its advantage in modeling non-local information.\nHowever, existing approaches tend to integrate global features based on a dense\nself-attention strategy since it tend to uses all similarities of the tokens\nbetween the queries and keys. In fact, this strategy leads to ignoring the most\nrelevant information and inducing blurry effect by the irrelevant\nrepresentations during the feature aggregation. To this end, this paper\nproposes an effective image deraining Transformer with dynamic dual\nself-attention (DDSA), which combines both dense and sparse attention\nstrategies to better facilitate clear image reconstruction. Specifically, we\nonly select the most useful similarity values based on top-k approximate\ncalculation to achieve sparse attention. In addition, we also develop a novel\nspatial-enhanced feed-forward network (SEFN) to further obtain a more accurate\nrepresentation for achieving high-quality derained results. Extensive\nexperiments on benchmark datasets demonstrate the effectiveness of our proposed\nmethod.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 13:59:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Fan","Zhentao",""],["Chen","Hongming",""],["Li","Yufeng",""]]}
{"id":"2308.07782","submitter":"Yuta Taniguchi","authors":"Kokoro Tanaka, Yuta Taniguchi","title":"$2$-knots with the same knot group but different knot quandles","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a first example of 2-knots with the same knot group but different\nknot quandles by analyzing the knot quandles of twist spins. As a byproduct of\nthe analysis, we also give a classification of all twist spins with finite knot\nquandles.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:03:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tanaka","Kokoro",""],["Taniguchi","Yuta",""]]}
{"id":"2308.07783","submitter":"Mohammad Baradaran","authors":"Mohammad Baradaran, Robert Bergevin","title":"Future Video Prediction from a Single Frame for Video Anomaly Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video anomaly detection (VAD) is an important but challenging task in\ncomputer vision. The main challenge rises due to the rarity of training samples\nto model all anomaly cases. Hence, semi-supervised anomaly detection methods\nhave gotten more attention, since they focus on modeling normals and they\ndetect anomalies by measuring the deviations from normal patterns. Despite\nimpressive advances of these methods in modeling normal motion and appearance,\nlong-term motion modeling has not been effectively explored so far. Inspired by\nthe abilities of the future frame prediction proxy-task, we introduce the task\nof future video prediction from a single frame, as a novel proxy-task for video\nanomaly detection. This proxy-task alleviates the challenges of previous\nmethods in learning longer motion patterns. Moreover, we replace the initial\nand future raw frames with their corresponding semantic segmentation map, which\nnot only makes the method aware of object class but also makes the prediction\ntask less complex for the model. Extensive experiments on the benchmark\ndatasets (ShanghaiTech, UCSD-Ped1, and UCSD-Ped2) show the effectiveness of the\nmethod and the superiority of its performance compared to SOTA prediction-based\nVAD methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:04:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Baradaran","Mohammad",""],["Bergevin","Robert",""]]}
{"id":"2308.07784","submitter":"Alexander Magner Grygory","authors":"A.G.Magner, A.I.Sanzhur, S.N.Fedotkin, A.I.Levon, U.V.Grygoriev,\n  S.Shlomo","title":"Paring correlations within the micro-macroscopic approach for the level\n  density","comments":"8 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Level density $\\rho(E,N,Z)$ is calculated for the two-component close- and\nopen-shell nuclei with a given energy $E$, and neutron $N$ and proton $Z$\nnumbers, taking into account pairing effects within the microscopic-macroscopic\napproach (MMA). These analytical calculations have been carried out by using\nthe semiclassical statistical mean-field approximations beyond the saddle-point\nmethod of the Fermi gas model in a low excitation-energies range. The level\ndensity $\\rho$, obtained as function of the system entropy $S$, depends\nessentially on the condensation energy $E_{\\rm cond}$ through the excitation\nenergy $U$ in super-fluid nuclei. The simplest super-fluid approach, based on\nthe BCS theory, accounts for a smooth temperature dependence of the pairing gap\n$\\Delta$ due to particle number fluctuations. Taking into account the pairing\neffects in magic or semi-magic nuclei, excited below neutron resonances, one\nfinds a notable pairing phase transition.Pairing correlations sometimes improve\nsignificantly the comparison with experimental data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:05:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Magner","A. G.",""],["Sanzhur","A. I.",""],["Fedotkin","S. N.",""],["Levon","A. I.",""],["Grygoriev","U. V.",""],["Shlomo","S.",""]]}
{"id":"2308.07785","submitter":"David M. Fisher","authors":"Nic Brody, David Fisher, Mahan Mj, Wouter van Limbeek","title":"Greenberg-Shalom's Commensurator Hypothesis and Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss many surprising implications of a positive answer to a question\nraised in some cases by Greenberg in the $`70$s and more generally by Shalom in\nthe early $2000$s. We refer to this positive answer as the Greenberg-Shalom\nhypothesis. This hypothesis then says that any infinite discrete subgroup of a\nsemisimple Lie group with dense commensurator is a lattice in a product of some\nfactors. For some applications it is natural to extend the hypothesis to cover\nsemisimple algebraic groups over other fields as well.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:06:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Brody","Nic",""],["Fisher","David",""],["Mj","Mahan",""],["van Limbeek","Wouter",""]]}
{"id":"2308.07786","submitter":"Huo-Jun Ruan","authors":"Lai Jiang and Huo-Jun Ruan","title":"Box dimension of generalized affine fractal interpolation functions (II)","comments":"20 pages, 1 figure. arXiv admin note: text overlap with\n  arXiv:2208.04126","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.DS math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $f$ be a generalized affine fractal interpolation function with vertical\nscaling functions. In this paper, we first estimate $\\mathrm{dim}_B \\Gamma f$,\nthe box dimension of the graph of $f$, by the sum function of vertical scaling\nfunctions. Then we estimate $\\mathrm{dim}_B \\Gamma f$ by the limits of spectral\nradii of vertical scaling matrices under certain conditions. As an application,\nwe study the box dimension of the graph of a generalized Weierstrass-type\nfunction.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:07:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jiang","Lai",""],["Ruan","Huo-Jun",""]]}
{"id":"2308.07787","submitter":"Yong Man Ro","authors":"Jeongsoo Choi, Joanna Hong, Yong Man Ro","title":"DiffV2S: Diffusion-based Video-to-Speech Synthesis with Vision-guided\n  Speaker Embedding","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CV cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent research has demonstrated impressive results in video-to-speech\nsynthesis which involves reconstructing speech solely from visual input.\nHowever, previous works have struggled to accurately synthesize speech due to a\nlack of sufficient guidance for the model to infer the correct content with the\nappropriate sound. To resolve the issue, they have adopted an extra speaker\nembedding as a speaking style guidance from a reference auditory information.\nNevertheless, it is not always possible to obtain the audio information from\nthe corresponding video input, especially during the inference time. In this\npaper, we present a novel vision-guided speaker embedding extractor using a\nself-supervised pre-trained model and prompt tuning technique. In doing so, the\nrich speaker embedding information can be produced solely from input visual\ninformation, and the extra audio information is not necessary during the\ninference time. Using the extracted vision-guided speaker embedding\nrepresentations, we further develop a diffusion-based video-to-speech synthesis\nmodel, so called DiffV2S, conditioned on those speaker embeddings and the\nvisual representation extracted from the input video. The proposed DiffV2S not\nonly maintains phoneme details contained in the input video frames, but also\ncreates a highly intelligible mel-spectrogram in which the speaker identities\nof the multiple speakers are all preserved. Our experimental results show that\nDiffV2S achieves the state-of-the-art performance compared to the previous\nvideo-to-speech synthesis technique.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:07:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Choi","Jeongsoo",""],["Hong","Joanna",""],["Ro","Yong Man",""]]}
{"id":"2308.07788","submitter":"Dongkeon Park","authors":"Dongkeon Park, Ji Won Kim, Kang Ryeol Kim, Do Hyun Lee, Hong Kook Kim","title":"GIST-AiTeR Speaker Diarization System for VoxCeleb Speaker Recognition\n  Challenge (VoxSRC) 2023","comments":"VoxSRC 2023 Track4","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report describes the submission system by the GIST-AiTeR team for the\nVoxCeleb Speaker Recognition Challenge 2023 (VoxSRC-23) Track 4. Our submission\nsystem focuses on implementing diverse speaker diarization (SD) techniques,\nincluding ResNet293 and MFA-Conformer with different combinations of segment\nand hop length. Then, those models are combined into an ensemble model. The\nResNet293 and MFA-Conformer models exhibited the diarization error rates (DERs)\nof 3.65% and 3.83% on VAL46, respectively. The submitted ensemble model\nprovided a DER of 3.50% on VAL46, and consequently, it achieved a DER of 4.88%\non the VoxSRC-23 test set.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:08:26 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 05:34:41 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 06:18:35 GMT"},{"version":"v4","created":"Fri, 25 Aug 2023 06:07:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Park","Dongkeon",""],["Kim","Ji Won",""],["Kim","Kang Ryeol",""],["Lee","Do Hyun",""],["Kim","Hong Kook",""]]}
{"id":"2308.07789","submitter":"Matteo Acclavio","authors":"Matteo Acclavio, Gianluca Curzi, Giulio Guerrieri","title":"Infinitary cut-elimination via finite approximations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate non-wellfounded proof systems based on parsimonious logic, a\nweaker variant of linear logic where the exponential modality ! is interpreted\nas a constructor for streams over finite data. Logical consistency is\nmaintained at a global level by adapting a standard progressing criterion. We\npresent an infinitary version of cut-elimination based on finite\napproximations, and we prove that, in presence of the progressing criterion, it\nreturns well-defined non-wellfounded proofs at its limit. Furthermore, we show\nthat cut-elimination preserves the progressive criterion and various regularity\nconditions internalizing degrees of proof-theoretical uniformity. Finally, we\nprovide a denotational semantics for our systems based on the relational model.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:10:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Acclavio","Matteo",""],["Curzi","Gianluca",""],["Guerrieri","Giulio",""]]}
{"id":"2308.07790","submitter":"Partha Das","authors":"Partha Das, Samit Kumar Hazra, Tarak Nath Dey","title":"Rapid-adiabatic-passage-based super-resolution microscopy in\n  semiconductor quantum dot system","comments":"14 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.optics quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We theoretically investigate rapid adiabatic passage(RAP)-based\nsuper-resolution imaging in a two-level quantum dot system interacting with two\nstructured beams. To understand the physical mechanism behind the formation of\nsuper-resolution for the experiment of Kaldewey {\\it et. al.,}[Nature Photonics\n10.1038/s41566-017-0079-y (2018)], we first use Liouville's density matrix\nwhere photon-mediated radiative and non-radiative decays are incorporated. A\nsuitably chosen spatiotemporal envelope of the structured beams enables the\nformation of a super-resolution image. We also find that the feature size of\nthe image depends on the intensity of the Laguerre Gaussian beam(LG). However,\nthe created image resolution undergoes distortion due to the existence of a\nlow-intensity circular ring. The unwanted circular ring arises from the\ndominance of the LG beam tail over the super-Gaussian(SG) beam tail, initiating\nthe residual population transfer from the ground state to the excited state.\nThis limitation can be overcome by using the Bessel-modulated truncated\nstructured LG and SG beams. We next study the dynamics of the semiconductor\nquantum dot system at finite temperatures wherein the phonon interaction\nbecomes imperative. We employ the polaron-transformed master equation to\nexplore the system at higher temperatures. Our numerical results confirm that\nthe sharpness of the image remains intact at low temperatures with weak phonon\ncoupling. Hence, the proposed scheme may open up applications in nano-scale\nimaging with quantum dots.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:14:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Das","Partha",""],["Hazra","Samit Kumar",""],["Dey","Tarak Nath",""]]}
{"id":"2308.07791","submitter":"Tobias Deu{\\ss}er","authors":"Tobias Deu{\\ss}er, Lars Hillebrand, Christian Bauckhage, Rafet Sifa","title":"Informed Named Entity Recognition Decoding for Generative Language\n  Models","comments":"12 pages, 2 figures, 4 tables","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":"  Ever-larger language models with ever-increasing capabilities are by now\nwell-established text processing tools. Alas, information extraction tasks such\nas named entity recognition are still largely unaffected by this progress as\nthey are primarily based on the previous generation of encoder-only transformer\nmodels. Here, we propose a simple yet effective approach, Informed Named Entity\nRecognition Decoding (iNERD), which treats named entity recognition as a\ngenerative process. It leverages the language understanding capabilities of\nrecent generative models in a future-proof manner and employs an informed\ndecoding scheme incorporating the restricted nature of information extraction\ninto open-ended text generation, improving performance and eliminating any risk\nof hallucinations. We coarse-tune our model on a merged named entity corpus to\nstrengthen its performance, evaluate five generative language models on eight\nnamed entity recognition datasets, and achieve remarkable results, especially\nin an environment with an unknown entity class set, demonstrating the\nadaptability of the approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:16:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Deu\u00dfer","Tobias",""],["Hillebrand","Lars",""],["Bauckhage","Christian",""],["Sifa","Rafet",""]]}
{"id":"2308.07792","submitter":"Manoj Settem","authors":"Manoj Settem and Cesare Roncaglia and Riccardo Ferrando and Alberto\n  Giacomello","title":"Structural transformations in Cu, Ag, and Au metal nanoclusters","comments":"The following article has been accepted by Journal of Chemical\n  Physics. After it is published, it will be found at\n  https://doi.org/10.1063/5.0159257. Accepted version of the manuscript (along\n  with supplementary material) consists of 32 pages, 11 figures","journal-ref":null,"doi":"10.1063/5.0159257","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Finite-temperature structures of Cu, Ag, and Au metal nanoclusters are\ncalculated in the entire temperature range from 0 K to melting using a\ncomputational methodology that we proposed recently [Settem \\emph{et al.},\nNanoscale, 2022, 14, 939]. In this method, Harmonic Superposition Approximation\n(HSA) and Parallel Tempering Molecular Dynamics (PTMD) are combined in a\ncomplementary manner. HSA is accurate at low temperatures and fails at higher\ntemperatures. PTMD, on the other hand, effectively samples the high temperature\nregion and melting. This method is used to study the size- and system-dependent\ncompetition between various structural motifs of Cu, Ag, and Au nanoclusters in\nthe size range 1 to 2 nm. Results show that there are mainly three types of\nstructural changes in metal nanoclusters depending on whether a solid-solid\ntransformation occurs. In the first type, global minimum is the dominant motif\nin the entire temperature range. In contrast, when a solid-solid transformation\noccurs, the global minimum transforms either completely to a different motif or\npartially resulting in a co-existence of multiple motifs. Finally, nanocluster\nstructures are analyzed to highlight the system-specific differences across the\nthree metals.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:17:23 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Settem","Manoj",""],["Roncaglia","Cesare",""],["Ferrando","Riccardo",""],["Giacomello","Alberto",""]]}
{"id":"2308.07793","submitter":"Jin Sima","authors":"Jin Sima and Netanel Raviv and Jehoshua Bruck","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for\n  Substitutions and Deletions","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":"  Encoding data as a set of unordered strings is receiving great attention as\nit captures one of the basic features of DNA storage systems. However, the\nchallenge of constructing optimal redundancy codes for this channel remained\nelusive. In this paper, we address this problem and present an order-wise\noptimal construction of codes that are capable of correcting multiple\nsubstitution, deletion, and insertion errors for this channel model. The key\ningredient in the code construction is a technique we call robust indexing:\nsimultaneously assigning indices to unordered strings (hence, creating order)\nand also embedding information in these indices.\n  The encoded indices are resilient to substitution, deletion, and insertion\nerrors, and therefore, so is the entire code.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:17:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Sima","Jin",""],["Raviv","Netanel",""],["Bruck","Jehoshua",""]]}
{"id":"2308.07794","submitter":"Daniela Boneva","authors":"Daniela Boneva, Georgi Latev, Svetlana Boeva, Krasimira Yankova,\n  Radoslav Zamanov","title":"Post-superhumps maximum on intranight time scales of the AM CVn star CR\n  Boo","comments":null,"journal-ref":"Bulgarian Astronomical Journal, 2023, v.39, pp. 87 - 93","doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present observations of the intranight brightness variability of CR Boo, a\nmember of the AM CVn stars group. The observational data are obtained with the\n2m telescope of the Rozhen National Astronomical Observatory and the 60 cm\ntelescope of the Belogradchik Observatory, Bulgaria, in BVR bands. We report\nthe appearance of superhumps, with an amplitude from 0.08 to 0.25 mag, when the\nmaximum brightness reaches the magnitude 14.08 in the V band, and 14.13 in the\nB band. A secondary maximum of each superhump is detected with the same\nperiodicity as the superhumps: Psh = 24.76 - 24.92 min. In our results, the\npost maxima are shifted in time from $\\approx 7.62$ min to $\\approx 16.35$ min\nin different nights, with an amplitude of $\\approx 0.06 - 0.09$ mag and an\namplitude difference of $\\approx 0.035$ mag towards the superhumps' maximum. We\nfind a correlation of the post maxima with the accretion processes at the outer\nside of the disc.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:18:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Boneva","Daniela",""],["Latev","Georgi",""],["Boeva","Svetlana",""],["Yankova","Krasimira",""],["Zamanov","Radoslav",""]]}
{"id":"2308.07795","submitter":"Haozhe Liu","authors":"Haozhe Liu, Mingchen Zhuge, Bing Li, Yuhui Wang, Francesco Faccio,\n  Bernard Ghanem, J\\\"urgen Schmidhuber","title":"Learning to Identify Critical States for Reinforcement Learning from\n  Videos","comments":"This paper was accepted to ICCV23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent work on deep reinforcement learning (DRL) has pointed out that\nalgorithmic information about good policies can be extracted from offline data\nwhich lack explicit information about executed actions. For example, videos of\nhumans or robots may convey a lot of implicit information about rewarding\naction sequences, but a DRL machine that wants to profit from watching such\nvideos must first learn by itself to identify and recognize relevant\nstates/actions/rewards. Without relying on ground-truth annotations, our new\nmethod called Deep State Identifier learns to predict returns from episodes\nencoded as videos. Then it uses a kind of mask-based sensitivity analysis to\nextract/identify important critical states. Extensive experiments showcase our\nmethod's potential for understanding and improving agent behavior. The source\ncode and the generated datasets are available at\nhttps://github.com/AI-Initiative-KAUST/VideoRLCS.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:21:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Haozhe",""],["Zhuge","Mingchen",""],["Li","Bing",""],["Wang","Yuhui",""],["Faccio","Francesco",""],["Ghanem","Bernard",""],["Schmidhuber","J\u00fcrgen",""]]}
{"id":"2308.07796","submitter":"Daniel S. Katz","authors":"Daniel S. Katz and Simon Hettrick","title":"Research Software Engineering in 2030","comments":"Invited paper for 2023 IEEE Conference on eScience","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This position paper for an invited talk on the \"Future of eScience\" discusses\nthe Research Software Engineering Movement and where it might be in 2030.\nBecause of the authors' experiences, it is aimed globally but with examples\nthat focus on the United States and United Kingdom.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:21:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Katz","Daniel S.",""],["Hettrick","Simon",""]]}
{"id":"2308.07797","submitter":"Ajith Anil Meera","authors":"Ajith Anil Meera and Pablo Lanillos","title":"Adaptive Noise Covariance Estimation under Colored Noise using Dynamic\n  Expectation Maximization","comments":"62nd IEEE Conference on Decision and Control","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.RO cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The accurate estimation of the noise covariance matrix (NCM) in a dynamic\nsystem is critical for state estimation and control, as it has a major\ninfluence in their optimality. Although a large number of NCM estimation\nmethods have been developed, most of them assume the noises to be white.\nHowever, in many real-world applications, the noises are colored (e.g., they\nexhibit temporal autocorrelations), resulting in suboptimal solutions. Here, we\nintroduce a novel brain-inspired algorithm that accurately and adaptively\nestimates the NCM for dynamic systems subjected to colored noise. Particularly,\nwe extend the Dynamic Expectation Maximization algorithm to perform both online\nnoise covariance and state estimation by optimizing the free energy objective.\nWe mathematically prove that our NCM estimator converges to the global optimum\nof this free energy objective. Using randomized numerical simulations, we show\nthat our estimator outperforms nine baseline methods with minimal noise\ncovariance estimation error under colored noise conditions. Notably, we show\nthat our method outperforms the best baseline (Variational Bayes) in joint\nnoise and state estimation for high colored noise. We foresee that the accuracy\nand the adaptive nature of our estimator make it suitable for online estimation\nin real-world applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:21:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Meera","Ajith Anil",""],["Lanillos","Pablo",""]]}
{"id":"2308.07798","submitter":"Kapil Goswami","authors":"Kapil Goswami, Rick Mukherjee, Herwig Ott, Peter Schmelcher","title":"Solving optimization problems with local light shift encoding on Rydberg\n  quantum annealers","comments":"18 pages, 6 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.quant-gas cs.CC physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide a non-unit disk framework to solve combinatorial optimization\nproblems such as Maximum Cut (Max-Cut) and Maximum Independent Set (MIS) on a\nRydberg quantum annealer. Our setup consists of a many-body interacting Rydberg\nsystem where locally controllable light shifts are applied to individual qubits\nin order to map the graph problem onto the Ising spin model. Exploiting the\nflexibility that optical tweezers offer in terms of spatial arrangement, our\nnumerical simulations implement the local-detuning protocol while globally\ndriving the Rydberg annealer to the desired many-body ground state, which is\nalso the solution to the optimization problem. Using optimal control methods,\nthese solutions are obtained for prototype graphs with varying sizes at time\nscales well within the system lifetime and with approximation ratios close to\none. The non-blockade approach facilitates the encoding of graph problems with\nspecific topologies that can be realized in two-dimensional Rydberg\nconfigurations and is applicable to both unweighted as well as weighted graphs.\nA comparative analysis with fast simulated annealing is provided which\nhighlights the advantages of our scheme in terms of system size, hardness of\nthe graph, and the number of iterations required to converge to the solution.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:24:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Goswami","Kapil",""],["Mukherjee","Rick",""],["Ott","Herwig",""],["Schmelcher","Peter",""]]}
{"id":"2308.07799","submitter":"Raphaela Heil","authors":"Raphaela Heil, Malin Nauwerck","title":"Handwritten Stenography Recognition and the LION Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Purpose: In this paper, we establish a baseline for handwritten stenography\nrecognition, using the novel LION dataset, and investigate the impact of\nincluding selected aspects of stenographic theory into the recognition process.\nWe make the LION dataset publicly available with the aim of encouraging future\nresearch in handwritten stenography recognition.\n  Methods: A state-of-the-art text recognition model is trained to establish a\nbaseline. Stenographic domain knowledge is integrated by applying four\ndifferent encoding methods that transform the target sequence into\nrepresentations, which approximate selected aspects of the writing system.\nResults are further improved by integrating a pre-training scheme, based on\nsynthetic data.\n  Results: The baseline model achieves an average test character error rate\n(CER) of 29.81% and a word error rate (WER) of 55.14%. Test error rates are\nreduced significantly by combining stenography-specific target sequence\nencodings with pre-training and fine-tuning, yielding CERs in the range of\n24.5% - 26% and WERs of 44.8% - 48.2%.\n  Conclusion: The obtained results demonstrate the challenging nature of\nstenography recognition. Integrating stenography-specific knowledge, in\nconjunction with pre-training and fine-tuning on synthetic data, yields\nconsiderable improvements. Together with our precursor study on the subject,\nthis is the first work to apply modern handwritten text recognition to\nstenography. The dataset and our code are publicly available via Zenodo.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:25:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Heil","Raphaela",""],["Nauwerck","Malin",""]]}
{"id":"2308.07800","submitter":"Yangmu Li","authors":"Chang Liu, Wenxin Cheng, Xiaoxiao Zhang, Juan Xu, Jiaxin Li, Qiuyan\n  Shi, Changhong Yuan, Li Xu, Honglin Zhou, Shilin Zhu, Jianping Sun, Wei Wu,\n  Jianlin Luo, Kui Jin, Yangmu Li","title":"Phases and magnetism at the microscale in compounds containing nominal\n  Pb10-xCux(PO4)6O","comments":"14 pages, 5 figures; Physical Review Materials","journal-ref":"Phys. Rev. Materials 7, 084804 (2023)","doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Achieving superconductivity at room temperature could lead to substantial\nadvancements in industry and technology. Recently, a compound known as Cu-doped\nlead-apatite, Pb10-xCux(PO4)6O (0.9 < x < 1.1), referred to as \"LK-99\", has\nbeen reported to exhibit unusual electrical and magnetic behaviors that appear\nto resemble a superconducting transition above room temperature. In this work\nwe collected multiphase samples containing the nominal Pb10-xCux(PO4)6O phase\n(no superconductivity observed in our measured samples), synthesized by three\nindependent groups, and studied their chemical, magnetic, and electrical\nproperties at the microscale to overcome difficulties in bulk measurements.\nThrough the utilization of optical, scanning electron, atomic force, and\nscanning diamond nitrogen-vacancy microscopy techniques, we are able to\nestablish a link between local magnetic properties and specific microscale\nchemical phases. Our findings indicate that while the Pb10-xCux(PO4)6O phase\nseems to have a mixed magnetism contribution, a significant fraction of the\ndiamagnetic response can be attributed to Cu-rich regions (e.g., Cu2S derived\nfrom a reagent used in the synthesis). Additionally, our electrical\nmeasurements reveal the phenomenon of current path switch and a change in\nresistance states of Cu2S. This provides a potential explanation for the\nelectrical behavior observed in compounds related to Pb10-xCux(PO4)6O.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:26:17 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 14:26:42 GMT"},{"version":"v3","created":"Thu, 17 Aug 2023 12:50:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Chang",""],["Cheng","Wenxin",""],["Zhang","Xiaoxiao",""],["Xu","Juan",""],["Li","Jiaxin",""],["Shi","Qiuyan",""],["Yuan","Changhong",""],["Xu","Li",""],["Zhou","Honglin",""],["Zhu","Shilin",""],["Sun","Jianping",""],["Wu","Wei",""],["Luo","Jianlin",""],["Jin","Kui",""],["Li","Yangmu",""]]}
{"id":"2308.07801","submitter":"Pavel Mnev","authors":"Ivan Contreras, Santosh Kandel, Pavel Mnev, Konstantin Wernli","title":"Combinatorial QFT on graphs: first quantization formalism","comments":"72 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.CO math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a combinatorial model of the quantum scalar field with polynomial\npotential on a graph. In the first quantization formalism, the value of a\nFeynman graph is given by a sum over maps from the Feynman graph to the\nspacetime graph (mapping edges to paths). This picture interacts naturally with\nAtiyah-Segal-like cutting-gluing of spacetime graphs. In particular, one has\ncombinatorial counterparts of the known gluing formulae for Green's functions\nand (zeta-regularized) determinants of Laplacians.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:27:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Contreras","Ivan",""],["Kandel","Santosh",""],["Mnev","Pavel",""],["Wernli","Konstantin",""]]}
{"id":"2308.07802","submitter":"Paul Kielty","authors":"Paul Kielty, Cian Ryan, Mehdi Sefidgar Dilmaghani, Waseem Shariff, Joe\n  Lemley, Peter Corcoran","title":"Neuromorphic Seatbelt State Detection for In-Cabin Monitoring with Event\n  Cameras","comments":"4 pages, 3 figures, IMVIP 2023","journal-ref":"Zenodo (2023)","doi":"10.5281/zenodo.8223905","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neuromorphic vision sensors, or event cameras, differ from conventional\ncameras in that they do not capture images at a specified rate. Instead, they\nasynchronously log local brightness changes at each pixel. As a result, event\ncameras only record changes in a given scene, and do so with very high temporal\nresolution, high dynamic range, and low power requirements. Recent research has\ndemonstrated how these characteristics make event cameras extremely practical\nsensors in driver monitoring systems (DMS), enabling the tracking of high-speed\neye motion and blinks. This research provides a proof of concept to expand\nevent-based DMS techniques to include seatbelt state detection. Using an event\nsimulator, a dataset of 108,691 synthetic neuromorphic frames of car occupants\nwas generated from a near-infrared (NIR) dataset, and split into training,\nvalidation, and test sets for a seatbelt state detection algorithm based on a\nrecurrent convolutional neural network (CNN). In addition, a smaller set of\nreal event data was collected and reserved for testing. In a binary\nclassification task, the fastened/unfastened frames were identified with an F1\nscore of 0.989 and 0.944 on the simulated and real test sets respectively. When\nthe problem extended to also classify the action of fastening/unfastening the\nseatbelt, respective F1 scores of 0.964 and 0.846 were achieved.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:27:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kielty","Paul",""],["Ryan","Cian",""],["Dilmaghani","Mehdi Sefidgar",""],["Shariff","Waseem",""],["Lemley","Joe",""],["Corcoran","Peter",""]]}
{"id":"2308.07803","submitter":"Geerten Koers","authors":"Geerten Koers, Botond Szab\\'o, Aad van der Vaart","title":"Misspecified Bernstein-Von Mises theorem for hierarchical models","comments":"29 pages, 4 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 derive a Bernstein von-Mises theorem in the context of misspecified,\nnon-i.i.d., hierarchical models parametrized by a finite-dimensional parameter\nof interest. We apply our results to hierarchical models containing non-linear\noperators, including the squared integral operator, and PDE-constrained inverse\nproblems. More specifically, we consider the elliptic, time-independent\nSchr\\\"odinger equation with parametric boundary condition and general parabolic\nPDEs with parametric potential and boundary constraints. Our theoretical\nresults are complemented with numerical analysis on synthetic data sets,\nconsidering both the square integral operator and the Schr\\\"odinger equation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:30:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Koers","Geerten",""],["Szab\u00f3","Botond",""],["van der Vaart","Aad",""]]}
{"id":"2308.07804","submitter":"Dominic Widdows","authors":"Willie Aboumrad, Dominic Widdows, Ananth Kaushik","title":"Quantum and Classical Combinatorial Optimizations Applied to\n  Lattice-Based Factorization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The availability of working quantum computers has led to several proposals\nand claims of quantum advantage. In 2023, this has included claims that quantum\ncomputers can successfully factor large integers, by optimizing the search for\nnearby integers whose prime factors are all small.\n  This paper demonstrates that the hope of factoring numbers of commercial\nsignificance using these methods is unfounded. Mathematically, this is because\nthe density of smooth numbers (numbers all of whose prime factors are small)\ndecays exponentially as n grows. Our experimental reproductions and analysis\nshow that lattice-based factoring does not scale successfully to larger\nnumbers, that the proposed quantum enhancements do not alter this conclusion,\nand that other simpler classical optimization heuristics perform much better\nfor lattice-based factoring.\n  However, many topics in this area have interesting applications and\nmathematical challenges, independently of factoring itself. We consider\nparticular cases of the CVP, and opportunities for applying quantum techniques\nto other parts of the factorization pipeline, including the solution of linear\nequations modulo 2. Though the goal of factoring 1000-bit numbers is still\nout-of-reach, the combinatoric landscape is promising, and warrants further\nresearch with more circumspect objectives.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:31:25 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Aboumrad","Willie",""],["Widdows","Dominic",""],["Kaushik","Ananth",""]]}
{"id":"2308.07805","submitter":"Judy Fox","authors":"Navya Annapareddy, Jade Preston, Judy Fox","title":"Fairness and Privacy in Federated Learning and Their Implications in\n  Healthcare","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Currently, many contexts exist where distributed learning is difficult or\notherwise constrained by security and communication limitations. One common\ndomain where this is a consideration is in Healthcare where data is often\ngoverned by data-use-ordinances like HIPAA. On the other hand, larger sample\nsizes and shared data models are necessary to allow models to better generalize\non account of the potential for more variability and balancing underrepresented\nclasses. Federated learning is a type of distributed learning model that allows\ndata to be trained in a decentralized manner. This, in turn, addresses data\nsecurity, privacy, and vulnerability considerations as data itself is not\nshared across a given learning network nodes. Three main challenges to\nfederated learning include node data is not independent and identically\ndistributed (iid), clients requiring high levels of communication overhead\nbetween peers, and there is the heterogeneity of different clients within a\nnetwork with respect to dataset bias and size. As the field has grown, the\nnotion of fairness in federated learning has also been introduced through novel\nimplementations. Fairness approaches differ from the standard form of federated\nlearning and also have distinct challenges and considerations for the\nhealthcare domain. This paper endeavors to outline the typical lifecycle of\nfair federated learning in research as well as provide an updated taxonomy to\naccount for the current state of fairness in implementations. Lastly, this\npaper provides added insight into the implications and challenges of\nimplementing and supporting fairness in federated learning in the healthcare\ndomain.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:32:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Annapareddy","Navya",""],["Preston","Jade",""],["Fox","Judy",""]]}
{"id":"2308.07806","submitter":"Yabo Niu","authors":"Yabo Niu, Yang Ni, Debdeep Pati, Bani K. Mallick","title":"Covariate-Assisted Bayesian Graph Learning for Heterogeneous Data","comments":"58 pages, 12 figures, accepted by Journal of the American Statistical\n  Association","journal-ref":null,"doi":"10.1080/01621459.2023.2233744","report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In a traditional Gaussian graphical model, data homogeneity is routinely\nassumed with no extra variables affecting the conditional independence. In\nmodern genomic datasets, there is an abundance of auxiliary information, which\noften gets under-utilized in determining the joint dependency structure. In\nthis article, we consider a Bayesian approach to model undirected graphs\nunderlying heterogeneous multivariate observations with additional assistance\nfrom covariates. Building on product partition models, we propose a novel\ncovariate-dependent Gaussian graphical model that allows graphs to vary with\ncovariates so that observations whose covariates are similar share a similar\nundirected graph. To efficiently embed Gaussian graphical models into our\nproposed framework, we explore both Gaussian likelihood and pseudo-likelihood\nfunctions. For Gaussian likelihood, a G-Wishart distribution is used as a\nnatural conjugate prior, and for the pseudo-likelihood, a product of\nGaussian-conditionals is used. Moreover, the proposed model has large prior\nsupport and is flexible to approximate any $\\nu$-H\\\"{o}lder conditional\nvariance-covariance matrices with $\\nu\\in(0,1]$. We further show that based on\nthe theory of fractional likelihood, the rate of posterior contraction is\nminimax optimal assuming the true density to be a Gaussian mixture with a known\nnumber of components. The efficacy of the approach is demonstrated via\nsimulation studies and an analysis of a protein network for a breast cancer\ndataset assisted by mRNA gene expression as covariates.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:33:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Niu","Yabo",""],["Ni","Yang",""],["Pati","Debdeep",""],["Mallick","Bani K.",""]]}
{"id":"2308.07807","submitter":"Ahmet Ercan Tekden","authors":"Ahmet Tekden, Marc Peter Deisenroth, Yasemin Bekiroglu","title":"Grasp Transfer based on Self-Aligning Implicit Representations of Local\n  Surfaces","comments":"Accepted by IEEE RAL. 8 pages, 6 figures, 3 tables","journal-ref":null,"doi":"10.1109/LRA.2023.3306272","report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objects we interact with and manipulate often share similar parts, such as\nhandles, that allow us to transfer our actions flexibly due to their shared\nfunctionality. This work addresses the problem of transferring a grasp\nexperience or a demonstration to a novel object that shares shape similarities\nwith objects the robot has previously encountered. Existing approaches for\nsolving this problem are typically restricted to a specific object category or\na parametric shape. Our approach, however, can transfer grasps associated with\nimplicit models of local surfaces shared across object categories.\nSpecifically, we employ a single expert grasp demonstration to learn an\nimplicit local surface representation model from a small dataset of object\nmeshes. At inference time, this model is used to transfer grasps to novel\nobjects by identifying the most geometrically similar surfaces to the one on\nwhich the expert grasp is demonstrated. Our model is trained entirely in\nsimulation and is evaluated on simulated and real-world objects that are not\nseen during training. Evaluations indicate that grasp transfer to unseen object\ncategories using this approach can be successfully performed both in simulation\nand real-world experiments. The simulation results also show that the proposed\napproach leads to better spatial precision and grasp accuracy compared to a\nbaseline approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:33:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tekden","Ahmet",""],["Deisenroth","Marc Peter",""],["Bekiroglu","Yasemin",""]]}
{"id":"2308.07808","submitter":"Hongyu Liu","authors":"Yan Jiang, Hongyu Liu, Tianhao Ni and Kai Zhang","title":"Inverse problems for nonlinear progressive waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose and study several inverse problems associated with the nonlinear\nprogressive waves that arise in infrasonic inversions. The nonlinear\nprogressive equation (NPE) is of a quasilinear form $\\partial_t^2 u=\\Delta f(x,\nu)$ with $f(x, u)=c_1(x) u+c_2(x) u^n$, $n\\geq 2$, and can be derived from the\nhyperbolic system of conservation laws associated with the Euler equations. We\nestablish unique identifiability results in determining $f(x, u)$ as well as\nthe associated initial data by the boundary measurement. Our analysis relies on\nhigh-order linearisation and construction of proper Gaussian beam solutions for\nthe underlying wave equations. In addition to its theoretical interest, we\nconnect our study to applications of practical importance in infrasound\nwaveform inversion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:33:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jiang","Yan",""],["Liu","Hongyu",""],["Ni","Tianhao",""],["Zhang","Kai",""]]}
{"id":"2308.07809","submitter":"Travis Gagie","authors":"Christina Boucher, Travis Gagie, Aaron Hong, Yansong Li and Norbert\n  Zeh","title":"Another virtue of wavelet forests?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A wavelet forest for a text $T [1..n]$ over an alphabet $\\sigma$ takes $n H_0\n(T) + o (n \\log \\sigma)$ bits of space and supports access and rank on $T$ in\n$O (\\log \\sigma)$ time. K\\\"arkk\\\"ainen and Puglisi (2011) implicitly introduced\nwavelet forests and showed that when $T$ is the Burrows-Wheeler Transform (BWT)\nof a string $S$, then a wavelet forest for $T$ occupies space bounded in terms\nof higher-order empirical entropies of $S$ even when the forest is implemented\nwith uncompressed bitvectors. In this paper we show experimentally that wavelet\nforests also have better access locality than wavelet trees and are thus\ninteresting even when higher-order compression is not effective on $S$, or when\n$T$ is not a BWT at all.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:33:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Boucher","Christina",""],["Gagie","Travis",""],["Hong","Aaron",""],["Li","Yansong",""],["Zeh","Norbert",""]]}
{"id":"2308.07810","submitter":"Michael Kewming","authors":"Michael J. Kewming, Anthony Kiely, Steve Campbell, Gabriel T. Landi","title":"First Passage Times for Continuous Quantum Measurement Currents","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The First Passage Time (FPT) is the time taken for a stochastic process to\nreach a desired threshold. It finds wide application in various fields and has\nrecently become particularly important in stochastic thermodynamics, due to its\nrelation to kinetic uncertainty relations (KURs). In this letter we address the\nFPT of the stochastic measurement current in the case of continuously measured\nquantum systems. Our approach is based on a charge-resolved master equation,\nwhich is related to the Full-Counting statistics of charge detection. In the\nquantum jump unravelling we show that this takes the form of a coupled system\nof master equations, while for quantum diffusion it becomes a type of quantum\nFokker-Planck equation. In both cases, we show that the FPT can be obtained by\nintroducing absorbing boundary conditions, making their computation extremely\nefficient. The versatility of our framework is demonstrated with two relevant\nexamples. First, we show how our method can be used to study the tightness of\nrecently proposed KURs for quantum jumps. Second, we study the homodyne\ndetection of a single two-level atom, and show how our approach can unveil\nvarious non-trivial features in the FPT distribution.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:39:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kewming","Michael J.",""],["Kiely","Anthony",""],["Campbell","Steve",""],["Landi","Gabriel T.",""]]}
{"id":"2308.07811","submitter":"Yujia Huang","authors":"Yujia Huang, Lin Chen, Xu Li, and Jiaen Liu","title":"Improved test-retest reliability of $\\textit{R}_2^*$ and susceptibility\n  quantification using multi-shot multi echo 3D EPI","comments":"18 pages, 8 figures and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study aimed to evaluate the potential of 3D echo-planar imaging (EPI)\nfor improving the reliability of $T_2^*$-weighted ($T_2^*w$) data and\nquantification of $\\textit{R}_2^*$ decay rate and susceptibility ($\\chi$)\ncompared to conventional gradient echo (GRE)-based acquisition. Eight healthy\nsubjects in a wide age range were recruited. Each subject received repeated\nscans for both GRE and EPI acquisitions with an isotropic 1 mm resolution at 3\nT. Maps of $\\textit{R}_2^*$ and $\\chi$ were quantified and compared using their\ninter-scan difference to evaluate the test-retest reliability. Inter-protocol\ndifferences of $\\textit{R}_2^*$ and $\\chi$ between GRE and EPI were also\nmeasured voxel by voxel and in selected ROIs to test the consistency between\nthe two acquisition methods. The quantifications of $\\textit{R}_2^*$ and $\\chi$\nusing EPI protocols showed increased test-retest reliability with higher EPI\nfactors up to 5 as performed in the experiment and were consistent with those\nbased on GRE. This result suggested multi-shot multi-echo 3D EPI can be a\nuseful alternative acquisition method for $T_2^*w$ MRI and quantification of\n$\\textit{R}_2^*$ and $\\chi$ with reduced scan time, improved test-retest\nreliability and similar accuracy compared to commonly used 3D GRE.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:40:58 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Huang","Yujia",""],["Chen","Lin",""],["Li","Xu",""],["Liu","Jiaen",""]]}
{"id":"2308.07812","submitter":"Qian Li","authors":"Qian Li, Defeng Sun, and Yancheng Yuan","title":"An efficient sieving based secant method for sparse optimization\n  problems with least-squares constraints","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 propose an efficient sieving based secant method to address\nthe computational challenges of solving sparse optimization problems with\nleast-squares constraints. A level-set method has been introduced in [X. Li,\nD.F. Sun, and K.-C. Toh, SIAM J. Optim., 28 (2018), pp. 1842--1866] that solves\nthese problems by using the bisection method to find a root of a univariate\nnonsmooth equation $\\varphi(\\lambda) = \\varrho$ for some $\\varrho > 0$, where\n$\\varphi(\\cdot)$ is the value function computed by a solution of the\ncorresponding regularized least-squares optimization problem. When the\nobjective function in the constrained problem is a polyhedral gauge function,\nwe prove that (i) for any positive integer $k$, $\\varphi(\\cdot)$ is piecewise\n$C^k$ in an open interval containing the solution $\\lambda^*$ to the equation\n$\\varphi(\\lambda) = \\varrho$; (ii) the Clarke Jacobian of $\\varphi(\\cdot)$ is\nalways positive. These results allow us to establish the essential ingredients\nof the fast convergence rates of the secant method. Moreover, an adaptive\nsieving technique is incorporated into the secant method to effectively reduce\nthe dimension of the level-set subproblems for computing the value of\n$\\varphi(\\cdot)$. The high efficiency of the proposed algorithm is demonstrated\nby extensive numerical results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:41:17 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Qian",""],["Sun","Defeng",""],["Yuan","Yancheng",""]]}
{"id":"2308.07813","submitter":"Andrey Ryabichev","authors":"Andrey Ryabichev","title":"Maximal degree of a map of surfaces","comments":"9 pages, 4 figures. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given closed possibly nonorientable surfaces $M,N$, we prove that if a map\n$f:M\\to N$ has degree $d>0$, then $\\chi(M)\\le d\\cdot\\chi(N)$. We give all\nnecessary comments on the definition and properties of geometric degree, which\ncan be defined for any map. Our proof is based on the Kneser-Edmonds\nfactorization theorem, simple natural proof of which is also presented.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:41:41 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ryabichev","Andrey",""]]}
{"id":"2308.07814","submitter":"Junichiro Kawamura","authors":"Junichiro Kawamura and Seodong Shin","title":"Current status on pair-produced muon-philic vectorlike leptons in\n  multilepton channels at the LHC","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"CTPU-PTC-23-38","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we obtain the current limits on the pair production of\nvectorlike leptons decaying to a Standard Model gauge boson and a lepton in the\nsecond generation using the Run-2 data at the LHC. Since there is no dedicated\nsearch, we recast the ATLAS analyses searching for the type-III seesaw heavy\nleptons in the multi-lepton channels. There is no limit for the $SU(2)_L$\nsinglet vectorlike lepton beyond about 100 GeV, while the limit is about 780\nGeV for the doublet one. Thus, dedicated searches for the vectorlike leptons\nare necessary, especially for the singlet one. We also study the general cases\nof the vectorlike lepton decays and future sensitivities the HL-LHC.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:45:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kawamura","Junichiro",""],["Shin","Seodong",""]]}
{"id":"2308.07815","submitter":"Zhou Yixuan","authors":"Yixuan Zhou, Yi Qu, Xing Xu, Hengtao Shen","title":"ImbSAM: A Closer Look at Sharpness-Aware Minimization in\n  Class-Imbalanced Recognition","comments":"Accepted by International Conference on Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Class imbalance is a common challenge in real-world recognition tasks, where\nthe majority of classes have few samples, also known as tail classes. We\naddress this challenge with the perspective of generalization and empirically\nfind that the promising Sharpness-Aware Minimization (SAM) fails to address\ngeneralization issues under the class-imbalanced setting. Through investigating\nthis specific type of task, we identify that its generalization bottleneck\nprimarily lies in the severe overfitting for tail classes with limited training\ndata. To overcome this bottleneck, we leverage class priors to restrict the\ngeneralization scope of the class-agnostic SAM and propose a class-aware\nsmoothness optimization algorithm named Imbalanced-SAM (ImbSAM). With the\nguidance of class priors, our ImbSAM specifically improves generalization\ntargeting tail classes. We also verify the efficacy of ImbSAM on two\nprototypical applications of class-imbalanced recognition: long-tailed\nclassification and semi-supervised anomaly detection, where our ImbSAM\ndemonstrates remarkable performance improvements for tail classes and anomaly.\nOur code implementation is available at\nhttps://github.com/cool-xuan/Imbalanced_SAM.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:46:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhou","Yixuan",""],["Qu","Yi",""],["Xu","Xing",""],["Shen","Hengtao",""]]}
{"id":"2308.07816","submitter":"Zhi Yuan Wu","authors":"Zhiyuan Wu, Sheng Sun, Yuwei Wang, Min Liu, Ke Xu, Wen Wang, Xuefeng\n  Jiang, Bo Gao, Jinda Lu","title":"FedCache: A Knowledge Cache-driven Federated Learning Architecture for\n  Personalized Edge Intelligence","comments":"15 pages, 7 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Edge Intelligence (EI) allows Artificial Intelligence (AI) applications to\nrun at the edge, where data analysis and decision-making can be performed in\nreal-time and close to data sources. To protect data privacy and unify data\nsilos among end devices in EI, Federated Learning (FL) is proposed for\ncollaborative training of shared AI models across devices without compromising\ndata privacy. However, the prevailing FL approaches cannot guarantee model\ngeneralization and adaptation on heterogeneous clients. Recently, Personalized\nFederated Learning (PFL) has drawn growing awareness in EI, as it enables a\nproductive balance between local-specific training requirements inherent in\ndevices and global-generalized optimization objectives for satisfactory\nperformance. However, most existing PFL methods are based on the Parameters\nInteraction-based Architecture (PIA) represented by FedAvg, which causes\nunaffordable communication burdens due to large-scale parameters transmission\nbetween devices and the edge server. In contrast, Logits Interaction-based\nArchitecture (LIA) allows to update model parameters with logits transfer and\ngains the advantages of communication lightweight and heterogeneous on-device\nmodel allowance compared to PIA. Nevertheless, previous LIA methods attempt to\nachieve satisfactory performance either relying on unrealistic public datasets\nor increasing communication overhead for additional information transmission\nother than logits. To tackle this dilemma, we propose a knowledge cache-driven\nPFL architecture, named FedCache, which reserves a knowledge cache on the\nserver for fetching personalized knowledge from the samples with similar hashes\nto each given on-device sample. During the training phase, ensemble\ndistillation is applied to on-device models for constructive optimization with\npersonalized knowledge transferred from the server-side knowledge cache.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:48:23 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:03:54 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wu","Zhiyuan",""],["Sun","Sheng",""],["Wang","Yuwei",""],["Liu","Min",""],["Xu","Ke",""],["Wang","Wen",""],["Jiang","Xuefeng",""],["Gao","Bo",""],["Lu","Jinda",""]]}
{"id":"2308.07817","submitter":"Wentao Weng","authors":"Daniel Freund, Thodoris Lykouris, Wentao Weng","title":"Quantifying the Cost of Learning in Queueing Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS cs.PF math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Queueing systems are widely applicable stochastic models with use cases in\ncommunication networks, healthcare, service systems, etc. Although their\noptimal control has been extensively studied, most existing approaches assume\nperfect knowledge of system parameters. Of course, this assumption rarely holds\nin practice where there is parameter uncertainty, thus motivating a recent line\nof work on bandit learning for queueing systems. This nascent stream of\nresearch focuses on the asymptotic performance of the proposed algorithms.\n  In this paper, we argue that an asymptotic metric, which focuses on\nlate-stage performance, is insufficient to capture the intrinsic statistical\ncomplexity of learning in queueing systems which typically occurs in the early\nstage. Instead, we propose the Cost of Learning in Queueing (CLQ), a new metric\nthat quantifies the maximum increase in time-averaged queue length caused by\nparameter uncertainty. We characterize the CLQ of a single-queue multi-server\nsystem, and then extend these results to multi-queue multi-server systems and\nnetworks of queues. In establishing our results, we propose a unified analysis\nframework for CLQ that bridges Lyapunov and bandit analysis, which could be of\nindependent interest.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:50:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Freund","Daniel",""],["Lykouris","Thodoris",""],["Weng","Wentao",""]]}
{"id":"2308.07818","submitter":"Willem Diepeveen","authors":"Willem Diepeveen, Carlos Esteve-Yag\\\"ue, Jan Lellmann, Ozan \\\"Oktem,\n  Carola-Bibiane Sch\\\"onlieb","title":"Riemannian geometry for efficient analysis of protein dynamics data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.NA math.DG math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  An increasingly common viewpoint is that protein dynamics data sets reside in\na non-linear subspace of low conformational energy. Ideal data analysis tools\nfor such data sets should therefore account for such non-linear geometry. The\nRiemannian geometry setting can be suitable for a variety of reasons. First, it\ncomes with a rich structure to account for a wide range of geometries that can\nbe modelled after an energy landscape. Second, many standard data analysis\ntools initially developed for data in Euclidean space can also be generalised\nto data on a Riemannian manifold. In the context of protein dynamics, a\nconceptual challenge comes from the lack of a suitable smooth manifold and the\nlack of guidelines for constructing a smooth Riemannian structure based on an\nenergy landscape. In addition, computational feasibility in computing geodesics\nand related mappings poses a major challenge. This work considers these\nchallenges. The first part of the paper develops a novel local approximation\ntechnique for computing geodesics and related mappings on Riemannian manifolds\nin a computationally feasible manner. The second part constructs a smooth\nmanifold of point clouds modulo rigid body group actions and a Riemannian\nstructure that is based on an energy landscape for protein conformations. The\nresulting Riemannian geometry is tested on several data analysis tasks relevant\nfor protein dynamics data. It performs exceptionally well on coarse-grained\nmolecular dynamics simulated data. In particular, the geodesics with given\nstart- and end-points approximately recover corresponding molecular dynamics\ntrajectories for proteins that undergo relatively ordered transitions with\nmedium sized deformations. The Riemannian protein geometry also gives\nphysically realistic summary statistics and retrieves the underlying dimension\neven for large-sized deformations within seconds on a laptop.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:52:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Diepeveen","Willem",""],["Esteve-Yag\u00fce","Carlos",""],["Lellmann","Jan",""],["\u00d6ktem","Ozan",""],["Sch\u00f6nlieb","Carola-Bibiane",""]]}
{"id":"2308.07819","submitter":"David B. Massey","authors":"David B. Massey","title":"Verdier dualizing and the variation map","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe how the canonical and variation maps between the shifted nearby\nand vanishing cycles interact with Verdier dualizing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:53:15 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Massey","David B.",""]]}
{"id":"2308.07820","submitter":"Yuriy Yerin","authors":"Yuriy Yerin, A. A. Varlamov, Roberto Felici, Aldo Di Carlo","title":"Dielectric properties and plasmon modes of gapped momentum systems of\n  different dimensionality","comments":"11 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The concept of the energy gap is a fundamental characteristic of the band\nstructure of a material and it determines its physical properties. Formally the\nenergy gap appears in the dispersion relation $E_k$, where the vector $k$ is\ndetermined on the whole momentum space. However, today the {\\it gapped momentum\nmaterials} are in the focus of research in which the so-called {\\it momentum or\n$k$-gap} can emerge, i.e. some lacunae of momentum space are excluded from the\ndomain of the function $E_k$. One of such examples present the non-Hermitian\nsystems. Within the random phase approximation we study the dielectric\nproperties of the momentum gapped materials in one, two and three dimensions\nfor both cases of zero and finite temperatures. We find the corresponding\nplasmon modes and determine the unusual behavior of the appropriate dispersion\nrelations for each dimensionality. Based on these findings we evaluate the\nabsorption coefficient of gapped momentum media and provide some numerical\nestimations of its value for the practical applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:53:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Yerin","Yuriy",""],["Varlamov","A. A.",""],["Felici","Roberto",""],["Di Carlo","Aldo",""]]}
{"id":"2308.07821","submitter":"Lin Chen","authors":"Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang","title":"A Nearly Quadratic-Time FPTAS for Knapsack","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate polynomial-time approximation schemes for the classic 0-1\nknapsack problem. The previous algorithm by Deng, Jin, and Mao (SODA'23) has\napproximation factor $1 + \\eps$ with running time $\\widetilde{O}(n +\n\\frac{1}{\\eps^{2.2}})$. There is a lower Bound of $(n +\n\\frac{1}{\\eps})^{2-o(1)}$ conditioned on the hypothesis that $(\\min, +)$ has no\ntruly subquadratic algorithm. We close the gap by proposing an approximation\nscheme that runs in $\\widetilde{O}(n + \\frac{1}{\\eps^2})$ time.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:54:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Lin",""],["Lian","Jiayi",""],["Mao","Yuchen",""],["Zhang","Guochuan",""]]}
{"id":"2308.07822","submitter":"Qinghe Gao","authors":"Qinghe Gao and Artur M. Schweidtmann","title":"Deep reinforcement learning for process design: Review and perspective","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":"  The transformation towards renewable energy and feedstock supply in the\nchemical industry requires new conceptual process design approaches. Recently,\nbreakthroughs in artificial intelligence offer opportunities to accelerate this\ntransition. Specifically, deep reinforcement learning, a subclass of machine\nlearning, has shown the potential to solve complex decision-making problems and\naid sustainable process design. We survey state-of-the-art research in\nreinforcement learning for process design through three major elements: (i)\ninformation representation, (ii) agent architecture, and (iii) environment and\nreward. Moreover, we discuss perspectives on underlying challenges and\npromising future works to unfold the full potential of reinforcement learning\nfor process design in chemical engineering.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:56:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gao","Qinghe",""],["Schweidtmann","Artur M.",""]]}
{"id":"2308.07823","submitter":"Dallas Trinkle","authors":"Grace M. Lu (1), Matthew Witman (2), Sapan Agarwal (2), Vitalie\n  Stavila (2), Dallas R. Trinkle (1) ((1) Department of Materials Science and\n  Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois\n  61801, USA, (2) Sandia National Laboratories, Livermore, California 94551,\n  USA)","title":"Explainable Machine Learning for Hydrogen Diffusion in Metals and Random\n  Binary Alloys","comments":"36 pages, 8 figures, supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hydrogen diffusion in metals and alloys plays an important role in the\ndiscovery of new materials for fuel cell and energy storage technology. While\nanalytic models use hand-selected features that have clear physical ties to\nhydrogen diffusion, they often lack accuracy when making quantitative\npredictions. Machine learning models are capable of making accurate\npredictions, but their inner workings are obscured, rendering it unclear which\nphysical features are truly important. To develop interpretable machine\nlearning models to predict the activation energies of hydrogen diffusion in\nmetals and random binary alloys, we create a database for physical and chemical\nproperties of the species and use it to fit six machine learning models. Our\nmodels achieve root-mean-squared-errors between 98-119 meV on the testing data\nand accurately predict that elemental Ru has a large activation energy, while\nelemental Cr and Fe have small activation energies.By analyzing the feature\nimportances of these fitted models, we identify relevant physical properties\nfor predicting hydrogen diffusivity. While metrics for measuring the individual\nfeature importances for machine learning models exist, correlations between the\nfeatures lead to disagreement between models and limit the conclusions that can\nbe drawn. Instead grouped feature importances, formed by combining the features\nvia their correlations, agree across the six models and reveal that the two\ngroups containing the packing factor and electronic specific heat are\nparticularly significant for predicting hydrogen diffusion in metals and random\nbinary alloys. This framework allows us to interpret machine learning models\nand enables rapid screening of new materials with the desired rates of hydrogen\ndiffusion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:58:48 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Lu","Grace M.",""],["Witman","Matthew",""],["Agarwal","Sapan",""],["Stavila","Vitalie",""],["Trinkle","Dallas R.",""]]}
{"id":"2308.07824","submitter":"Yue Xiang Mr.","authors":"Yue Xiang, Bo Jiang, Haifeng Dai","title":"Cerberus: A Deep Learning Hybrid Model for Lithium-Ion Battery Aging\n  Estimation and Prediction Based on Relaxation Voltage Curves","comments":"3 figures, 1 table, 9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The degradation process of lithium-ion batteries is intricately linked to\ntheir entire lifecycle as power sources and energy storage devices,\nencompassing aspects such as performance delivery and cycling utilization.\nConsequently, the accurate and expedient estimation or prediction of the aging\nstate of lithium-ion batteries has garnered extensive attention. Nonetheless,\nprevailing research predominantly concentrates on either aging estimation or\nprediction, neglecting the dynamic fusion of both facets. This paper proposes a\nhybrid model for capacity aging estimation and prediction based on deep\nlearning, wherein salient features highly pertinent to aging are extracted from\ncharge and discharge relaxation processes. By amalgamating historical capacity\ndecay data, the model dynamically furnishes estimations of the present capacity\nand forecasts of future capacity for lithium-ion batteries. Our approach is\nvalidated against a novel dataset involving charge and discharge cycles at\nvarying rates. Specifically, under a charging condition of 0.25C, a mean\nabsolute percentage error (MAPE) of 0.29% is achieved. This outcome underscores\nthe model's adeptness in harnessing relaxation processes commonly encountered\nin the real world and synergizing with historical capacity records within\nbattery management systems (BMS), thereby affording estimations and\nprognostications of capacity decline with heightened precision.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:07:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Xiang","Yue",""],["Jiang","Bo",""],["Dai","Haifeng",""]]}
{"id":"2308.07825","submitter":"Subhadip Pal","authors":"Vasudevarao Allu, Himadri Halder and Subhadip Pal","title":"Multidimensional Bohr radii for vector-valued holomorphic functions","comments":"We have revised the paper. The number of pages is now 14","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 answer certain open questions related to the\nexact values of multidimensional Bohr radii by using the concept of arithmetic\nBohr radius for vector-valued holomorphic functions defined in complete\nReinhardt domains in $\\mathbb{C}^n$. More precisely, we study the asymptotic\nestimates of the arithmetic Bohr radius for holomorphic functions in the unit\nball of $\\ell^n_q$ $(1\\leq q\\leq \\infty)$ spaces with values in arbitrary\ncomplex Banach spaces. Many of our results generalize the results obtained by\nDefant, Maestre, and Prengel [Q. J. Math. 59, (2008), pp. 189--205].\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:08:55 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 07:44:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Allu","Vasudevarao",""],["Halder","Himadri",""],["Pal","Subhadip",""]]}
{"id":"2308.07826","submitter":"The CMS Collaboration","authors":"CMS Collaboration","title":"Search for a third-generation leptoquark coupled to a $\\tau$ lepton and\n  a b quark through single, pair, and nonresonant production in proton-proton\n  collisions at $\\sqrt{s}$ = 13 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/EXO-19-016\n  (CMS Public Pages)","journal-ref":null,"doi":null,"report-no":"CMS-EXO-19-016, CERN-EP-2023-144","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A search is presented for a third-generation leptoquark (LQ) coupled\nexclusively to a $\\tau$ lepton and a b quark. The search is based on\nproton-proton collision data at a center-of-mass energy of 13 TeV recorded with\nthe CMS detector, corresponding to an integrated luminosity of 138 fb$^{-1}$.\nEvents with $\\tau$ leptons and a varying number of jets originating from b\nquarks are considered, targeting the single and pair production of LQs, as well\nas nonresonant $t$-channel LQ exchange. An excess is observed in the data with\nrespect to the background expectation in the combined analysis of all search\nregions. For a benchmark LQ mass of 2 TeV and an LQ-b-$\\tau$ coupling strength\nof 2.5, the excess reaches a local significance of up to 2.8 standard\ndeviations. Upper limits at the 95% confidence level are placed on the LQ\nproduction cross section in the LQ mass range 0.5-2.3 TeV, and up to 3 TeV for\n$t$-channel LQ exchange. Leptoquarks are excluded below masses of 1.22-1.88 TeV\nfor different LQ models and varying coupling strengths up to 2.5. The study of\nnonresonant $\\tau\\tau$ production through $t$-channel LQ exchange allows lower\nlimits on the LQ mass of up to 2.3 TeV to be obtained.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:10:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["CMS Collaboration","",""]]}
{"id":"2308.07827","submitter":"Yangzheng Wu","authors":"Yangzheng Wu and Michael Greenspan","title":"Learning Better Keypoints for Multi-Object 6DoF Pose Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate the impact of pre-defined keypoints for pose estimation, and\nfound that accuracy and efficiency can be improved by training a graph network\nto select a set of disperse keypoints with similarly distributed votes. These\nvotes, learned by a regression network to accumulate evidence for the keypoint\nlocations, can be regressed more accurately compared to previous heuristic\nkeypoint algorithms. The proposed KeyGNet, supervised by a combined loss\nmeasuring both Wassserstein distance and dispersion, learns the color and\ngeometry features of the target objects to estimate optimal keypoint locations.\nExperiments demonstrate the keypoints selected by KeyGNet improved the accuracy\nfor all evaluation metrics of all seven datasets tested, for three keypoint\nvoting methods. The challenging Occlusion LINEMOD dataset notably improved\nADD(S) by +16.4% on PVN3D, and all core BOP datasets showed an AR improvement\nfor all objects, of between +1% and +21.5%. There was also a notable increase\nin performance when transitioning from single object to multiple object\ntraining using KeyGNet keypoints, essentially eliminating the SISO-MIMO gap for\nOcclusion LINEMOD.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:11:13 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wu","Yangzheng",""],["Greenspan","Michael",""]]}
{"id":"2308.07828","submitter":"Mojtaba A. Farahani","authors":"Mojtaba A. Farahani","title":"A Genetic Algorithm Meta-Heuristic for a Generalized Quadratic\n  Assignment Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The generalized quadratic assignment problem (GQAP) is one of the hardest\nproblems to solve in the operations research area. The GQAP addressed in this\nwork is defined as the task of minimizing the assignment and transportation\ncosts of assigning a set of facilities to a set of locations. The facilities\nhave different space requirements, and the locations have different space\ncapacities. Multiple facilities can be assigned to each location if the space\ncapacity is not violated. In this work, three instances of GQAP in different\nsituations are presented. Then, a genetic algorithm is developed to solve the\nGQAP instances. Finally, the local neighborhood search with the steepest\ndescend strategy is constructed and applied to the final solution obtained by\nthe GA, and the final solution is compared with the best solution found by\nMPL/CPLEX software and reference papers. The results show that the developed GA\nheuristic is effective for solving the GQAP.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:13:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Farahani","Mojtaba A.",""]]}
{"id":"2308.07829","submitter":"Peter Topalov","authors":"Patrick G\\'erard, Peter Topalov","title":"On the low regularity phase space of the Benjamin-Ono 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 prove that the Benjamin-Ono equation is globally in time\n$C^0$-well-posed in the Hilbert space\n$H^{-1/2,\\sqrt{\\log}}(\\mathbb{T},\\mathbb{R})$ of periodic distributions in\n$H^{-1/2}(\\mathbb{T},\\mathbb{R})$ with $\\sqrt{\\log}$-weights. The space\n$H^{-1/2,\\sqrt{\\log}}(\\mathbb{T},\\mathbb{R})$ can thus be considered as a\nmaximal low regularity phase space for the Benjamin-Ono equation corresponding\nto the scale $H^s(\\mathbb{T},\\mathbb{R})$, $s>-1/2$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:14:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["G\u00e9rard","Patrick",""],["Topalov","Peter",""]]}
{"id":"2308.07830","submitter":"John Colias","authors":"John V. Colias (1), Stella Park (2) and Elizabeth Horn (1) ((1)\n  Decision Analyst, (2) AT&T)","title":"Optimizing B2B Product Offers with Machine Learning, Mixed Logit, and\n  Nonlinear Programming","comments":null,"journal-ref":"Journal of Marketing Analytics, 9 (3), 157-172 (2021)","doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In B2B markets, value-based pricing and selling has become an important\nalternative to discounting. This study outlines a modeling method that uses\ncustomer data (product offers made to each current or potential customer,\nfeatures, discounts, and customer purchase decisions) to estimate a mixed logit\nchoice model. The model is estimated via hierarchical Bayes and machine\nlearning, delivering customer-level parameter estimates. Customer-level\nestimates are input into a nonlinear programming next-offer maximization\nproblem to select optimal features and discount level for customer segments,\nwhere segments are based on loyalty and discount elasticity. The mixed logit\nmodel is integrated with economic theory (the random utility model), and it\npredicts both customer perceived value for and response to alternative future\nsales offers. The methodology can be implemented to support value-based pricing\nand selling efforts.\n  Contributions to the literature include: (a) the use of customer-level\nparameter estimates from a mixed logit model, delivered via a hierarchical\nBayes estimation procedure, to support value-based pricing decisions; (b)\nvalidation that mixed logit customer-level modeling can deliver strong\npredictive accuracy, not as high as random forest but comparing favorably; and\n(c) a nonlinear programming problem that uses customer-level mixed logit\nestimates to select optimal features and discounts.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:17:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Colias","John V.",""],["Park","Stella",""],["Horn","Elizabeth",""]]}
{"id":"2308.07831","submitter":"Yu Wang","authors":"Yu Wang, Sofya Alexeeva, Feng Wang, Ling Liu, Yong Wu, JianGuo Wang,\n  Gang Zhao, Svetlana A. Yakovleva, Andrey K. Belyaev","title":"Theoretical Study of Inelastic Processes in Collisions of Y and Y$^+$\n  with Hydrogen Atom","comments":"15 pages, 6 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Utilizing a simplified quantum model approach, the low-energy inelastic\ncollision processes between yttrium atoms (ions) and hydrogen atoms have been\nstudied. Rate coefficients corresponding to the mutual neutralization, ion-pair\nformation, excitation, and de-excitation processes for the above collision\nsystems have been provided in the temperature range of 1000-10000K. 3 ionic\nstates and 73 covalent states are considered in calculations for the collisions\nof yttrium atoms with hydrogen atoms, which include 6 molecular symmetries and\n4074 partial inelastic reaction processes. For the collisions of yttrium ions\nwith hydrogen atoms, 1 ionic state and 116 covalent states are included, which\nrelated to 3 molecular symmetries and 13572 partial inelastic collision\nprocesses. It is found that the rate coefficients for the mutual neutralization\nprocess have a maximum at T = 6000K, which is an order of magnitude higher than\nthose of other processes. Notably, the positions of optimal windows for the\ncollisions of yttrium atoms and ions with hydrogen atoms are found near\nelectronic binding energy -2eV (Y) and -4.4eV (Y$^+$), respectively. The\nscattering channels located in or near these optimal windows have\nintermediate-to-large rate coefficients (greater than $10^{-12}$\ncm$^3$s$^{-1}$). The reported data should be useful in the study of non-local\nthermodynamic equilibrium modeling.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:20:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Yu",""],["Alexeeva","Sofya",""],["Wang","Feng",""],["Liu","Ling",""],["Wu","Yong",""],["Wang","JianGuo",""],["Zhao","Gang",""],["Yakovleva","Svetlana A.",""],["Belyaev","Andrey K.",""]]}
{"id":"2308.07832","submitter":"Sayash Kapoor","authors":"Sayash Kapoor, Emily Cantrell, Kenny Peng, Thanh Hien Pham,\n  Christopher A. Bail, Odd Erik Gundersen, Jake M. Hofman, Jessica Hullman,\n  Michael A. Lones, Momin M. Malik, Priyanka Nanayakkara, Russell A. Poldrack,\n  Inioluwa Deborah Raji, Michael Roberts, Matthew J. Salganik, Marta\n  Serra-Garcia, Brandon M. Stewart, Gilles Vandewiele, Arvind Narayanan","title":"REFORMS: Reporting Standards for Machine Learning Based Science","comments":null,"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":"  Machine learning (ML) methods are proliferating in scientific research.\nHowever, the adoption of these methods has been accompanied by failures of\nvalidity, reproducibility, and generalizability. These failures can hinder\nscientific progress, lead to false consensus around invalid claims, and\nundermine the credibility of ML-based science. ML methods are often applied and\nfail in similar ways across disciplines. Motivated by this observation, our\ngoal is to provide clear reporting standards for ML-based science. Drawing from\nan extensive review of past literature, we present the REFORMS checklist\n($\\textbf{Re}$porting Standards $\\textbf{For}$ $\\textbf{M}$achine Learning\nBased $\\textbf{S}$cience). It consists of 32 questions and a paired set of\nguidelines. REFORMS was developed based on a consensus of 19 researchers across\ncomputer science, data science, mathematics, social sciences, and biomedical\nsciences. REFORMS can serve as a resource for researchers when designing and\nimplementing a study, for referees when reviewing papers, and for journals when\nenforcing standards for transparency and reproducibility.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:21:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Kapoor","Sayash",""],["Cantrell","Emily",""],["Peng","Kenny",""],["Pham","Thanh Hien",""],["Bail","Christopher A.",""],["Gundersen","Odd Erik",""],["Hofman","Jake M.",""],["Hullman","Jessica",""],["Lones","Michael A.",""],["Malik","Momin M.",""],["Nanayakkara","Priyanka",""],["Poldrack","Russell A.",""],["Raji","Inioluwa Deborah",""],["Roberts","Michael",""],["Salganik","Matthew J.",""],["Serra-Garcia","Marta",""],["Stewart","Brandon M.",""],["Vandewiele","Gilles",""],["Narayanan","Arvind",""]]}
{"id":"2308.07833","submitter":"Yujuan Luo","authors":"Yujuan Luo, Matthias Steinhausen, Driss Kaddar, Christian Hasse,\n  Federica Ferraro","title":"Assessment of flamelet manifolds for turbulent flame-wall interactions\n  in Large-Eddy Simulations","comments":null,"journal-ref":"Combustion and Flame (2023)","doi":"10.1016/j.combustflame.2023.112923","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A turbulent side-wall quenching (SWQ) flame in a fully developed channel flow\nis studied using Large-Eddy Simulation (LES) with a tabulated chemistry\napproach. Three different flamelet manifolds with increasing levels of\ncomplexity are applied: the Flamelet-Generated Manifold (FGM) considering\nvarying enthalpy levels, the Quenching Flamelet-Generated Manifold (QFM), and\nthe recently proposed Quenching Flamelet-Generated Manifold with Exhaust Gas\nRecirculation (QFM-EGR), with the purpose being to assess their capability to\npredict turbulent flame-wall interactions (FWIs), which are highly relevant to\nnumerical simulations of real devices such as gas turbines and internal\ncombustion engines.\n  The accuracy of the three manifolds is evaluated and compared a posteriori,\nusing the data from a previously published flame-resolved simulation with\ndetailed chemistry for reference. For LES with the FGM, the main\ncharacteristics such as the mean flow field, temperature, and major species can\nbe captured well, while notable deviations from the reference results are\nobserved for the near-wall region, especially for pollutant species such as\n\\ce{CO}. In accordance with the findings from laminar FWI, improvement is also\nobserved in the simulation with QFM under turbulent flow conditions. Although\nLES with the QFM-EGR shows a similar performance in the prediction of mean\nquantities as LES with QFM, it presents significantly better agreement with the\nreference data regarding instantaneous thermo-chemical states near the\nquenching point. This indicates the necessity to take into account the mixing\neffects in the flamelet manifold to correctly capture the flame-vortex\ninteraction near the flame tip in turbulent configurations. Based on the\nfindings from this study, suitable flamelet manifolds can be chosen depending\non the aspects of interest in practical applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:22:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Luo","Yujuan",""],["Steinhausen","Matthias",""],["Kaddar","Driss",""],["Hasse","Christian",""],["Ferraro","Federica",""]]}
{"id":"2308.07834","submitter":"Guanghui Zhu","authors":"Guanghui Zhu, Mengyu Chen, Chunfeng Yuan, and Yihua Huang","title":"Simple and Efficient Partial Graph Adversarial Attack: A New Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the study of graph neural networks becomes more intensive and\ncomprehensive, their robustness and security have received great research\ninterest. The existing global attack methods treat all nodes in the graph as\ntheir attack targets. Although existing methods have achieved excellent\nresults, there is still considerable space for improvement. The key problem is\nthat the current approaches rigidly follow the definition of global attacks.\nThey ignore an important issue, i.e., different nodes have different robustness\nand are not equally resilient to attacks. From a global attacker's view, we\nshould arrange the attack budget wisely, rather than wasting them on highly\nrobust nodes. To this end, we propose a totally new method named partial graph\nattack (PGA), which selects the vulnerable nodes as attack targets. First, to\nselect the vulnerable items, we propose a hierarchical target selection policy,\nwhich allows attackers to only focus on easy-to-attack nodes. Then, we propose\na cost-effective anchor-picking policy to pick the most promising anchors for\nadding or removing edges, and a more aggressive iterative greedy-based attack\nmethod to perform more efficient attacks. Extensive experimental results\ndemonstrate that PGA can achieve significant improvements in both attack effect\nand attack efficiency compared to other existing graph global attack methods.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:23:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhu","Guanghui",""],["Chen","Mengyu",""],["Yuan","Chunfeng",""],["Huang","Yihua",""]]}
{"id":"2308.07835","submitter":"Jonathan Spence","authors":"Abdul-Lateef Haji-Ali and Jonathan Spence","title":"Nested Multilevel Monte Carlo with Biased and Antithetic Sampling","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of estimating a nested structure of two expectations\ntaking the form $U_0 = E[\\max\\{U_1(Y), \\pi(Y)\\}]$, where $U_1(Y) = E[X\\ |\\ Y]$.\nTerms of this form arise in financial risk estimation and option pricing. When\n$U_1(Y)$ requires approximation, but exact samples of $X$ and $Y$ are\navailable, an antithetic multilevel Monte Carlo (MLMC) approach has been\nwell-studied in the literature. Under general conditions, the antithetic MLMC\nestimator obtains a root mean squared error $\\varepsilon$ with order\n$\\varepsilon^{-2}$ cost. If, additionally, $X$ and $Y$ require approximate\nsampling, careful balancing of the various aspects of approximation is required\nto avoid a significant computational burden. Under strong convergence criteria\non approximations to $X$ and $Y$, randomised multilevel Monte Carlo techniques\ncan be used to construct unbiased Monte Carlo estimates of $U_1$, which can be\npaired with an antithetic MLMC estimate of $U_0$ to recover order\n$\\varepsilon^{-2}$ computational cost. In this work, we instead consider biased\nmultilevel approximations of $U_1(Y)$, which require less strict assumptions on\nthe approximate samples of $X$. Extensions to the method consider an\napproximate and antithetic sampling of $Y$. Analysis shows the resulting\nestimator has order $\\varepsilon^{-2}$ asymptotic cost under the conditions\nrequired by randomised MLMC and order $\\varepsilon^{-2}|\\log\\varepsilon|^3$\ncost under more general assumptions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:25:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Haji-Ali","Abdul-Lateef",""],["Spence","Jonathan",""]]}
{"id":"2308.07836","submitter":"Jesus Javier Cobos-Martinez","authors":"J.J Cobos-Martinez and Kazuo Tsushima","title":"$\\eta$ and $\\eta'$ mesons in nuclear matter and nuclei","comments":"11 pages, 4 figures, 6 tables","journal-ref":null,"doi":null,"report-no":"LFTC-23-6/79","categories":"nucl-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present updated and extended results for the $\\eta$- and $\\eta'$-nucleus\nbound state energies, obtained by solving the Schr\\\"{o}dinger and Klein-Gordon\nequations with complex optical potentials, for a wide range of nuclei. The\n$\\eta$ and $\\eta'$ nuclear potentials are obtained in the local density\napproximation from the mass shift of these mesons in nuclear matter, which is\ncalculated within the quark-meson coupling model. Our results show that the\n$\\eta$ and $\\eta'$ mesons are expected to form mesic nuclei with all the nuclei\nconsidered. However, the signal for the formation of the $\\eta$- and\n$\\eta'$-mesic nuclei may be difficult to identify experimentally due to\npossible large widths.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:26:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cobos-Martinez","J. J",""],["Tsushima","Kazuo",""]]}
{"id":"2308.07837","submitter":"Yan Di","authors":"Yan Di, Chenyangguang Zhang, Pengyuan Wang, Guangyao Zhai, Ruida\n  Zhang, Fabian Manhardt, Benjamin Busam, Xiangyang Ji, and Federico Tombari","title":"CCD-3DR: Consistent Conditioning in Diffusion for Single-Image 3D\n  Reconstruction","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we present a novel shape reconstruction method leveraging\ndiffusion model to generate 3D sparse point cloud for the object captured in a\nsingle RGB image. Recent methods typically leverage global embedding or local\nprojection-based features as the condition to guide the diffusion model.\nHowever, such strategies fail to consistently align the denoised point cloud\nwith the given image, leading to unstable conditioning and inferior\nperformance. In this paper, we present CCD-3DR, which exploits a novel centered\ndiffusion probabilistic model for consistent local feature conditioning. We\nconstrain the noise and sampled point cloud from the diffusion model into a\nsubspace where the point cloud center remains unchanged during the forward\ndiffusion process and reverse process. The stable point cloud center further\nserves as an anchor to align each point with its corresponding local\nprojection-based features. Extensive experiments on synthetic benchmark\nShapeNet-R2N2 demonstrate that CCD-3DR outperforms all competitors by a large\nmargin, with over 40% improvement. We also provide results on real-world\ndataset Pix3D to thoroughly demonstrate the potential of CCD-3DR in real-world\napplications. Codes will be released soon\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:27:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Di","Yan",""],["Zhang","Chenyangguang",""],["Wang","Pengyuan",""],["Zhai","Guangyao",""],["Zhang","Ruida",""],["Manhardt","Fabian",""],["Busam","Benjamin",""],["Ji","Xiangyang",""],["Tombari","Federico",""]]}
{"id":"2308.07838","submitter":"Martin Friesen","authors":"Viktor Bezborodov, Luca Di Persio, Martin Friesen, Peter Kuchling","title":"Interacting particle systems with continuous spins","comments":null,"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 study a general class of interacting particle systems over a countable\nstate space $V$ where on each site $x \\in V$ the particle mass $\\eta(x) \\geq 0$\nfollows a stochastic differential equation. We construct the corresponding\nMarkovian dynamics in terms of strong solutions to an infinite coupled system\nof stochastic differential equations and prove a comparison principle with\nrespect to the initial configuration as well as the drift of the process. Using\nthis comparison principle, we provide sufficient conditions for the existence\nand uniqueness of an invariant measure in the subcritical regime and prove\nconvergence of the transition probabilities in the Wasserstein-1-distance.\nFinally, for sublinear drifts, we establish a linear growth theorem showing\nthat the spatial spread is at most linear in time. Our results cover a large\nclass of finite and infinite branching particle systems with interactions among\ndifferent sites.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:29:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bezborodov","Viktor",""],["Di Persio","Luca",""],["Friesen","Martin",""],["Kuchling","Peter",""]]}
{"id":"2308.07839","submitter":"Carolina Charalambous Dr.","authors":"Carolina Charalambous, Jean Teyssandier and Anne-Sophie Libert","title":"Tidal interactions shape period ratios in planetary systems with\n  three-body resonant chains","comments":"Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR nlin.CD","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  These last years several Systems with Tightly packed Inner Planets in the\nsuper-Earth mass regime have been discovered harboring chains of resonances. It\nis generally believed that planet pairs get trapped in MMR during the migration\nphase in the protoplanetary disk, while the tides raised by the host star\nprovide a source of dissipation on very long timescales. In this work, we aim\nto study the departure from exact commensurabilities observed among the STIPs\nwhich harbor 3-planet resonances and analyze how tides play an important role\nin shaping the resonance offsets for the STIPs. We analyzed the resonance\noffsets between adjacent pairs for five multi-planetary systems, namely\nKepler-80, Kepler-223, K2-138, TOI-178, and TRAPPIST-1, highlighting the\nexistence of different trends in the offsets. On the one hand, we derived\nanalytical estimates for the offsets, which confirm that the departure of the\nplanetary pairs from the nominal MMRs are due to the 3-planet resonant\ndynamics. On the other hand, we performed N-body simulations including both\norbital migration and tidal dissipation from the host star with simple\nprescriptions in order to test the effectiveness of this mechanism at shaping\nthe observed trend in the offsets, focusing our study on the preservation of\nthe resonant patterns in the different systems with the same general setup. We\nfound that the trends in the offsets of the five detected systems can be\nproduced by tidal damping effects, regardless of the considered value for the\ntidal factor. It is a robust mechanism that relaxes the system towards\nequilibrium while efficiently moving it along 3-planet resonances, which\ninduces the observed resonance offset for each planet pair. In addition, we\nshowed that for Kepler-80, K2-138, and TOI-178, the amplitudes of the resonant\noffsets can also be reproduced with appropriate tidal factor, for the estimated\nage of the systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:31:32 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Charalambous","Carolina",""],["Teyssandier","Jean",""],["Libert","Anne-Sophie",""]]}
{"id":"2308.07840","submitter":"Shengyang Li","authors":"Shengyang Li, Qin Hu, Zhilin Wang","title":"PoFEL: Energy-efficient Consensus for Blockchain-based Hierarchical\n  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":"  Facilitated by mobile edge computing, client-edge-cloud hierarchical\nfederated learning (HFL) enables communication-efficient model training in a\nwidespread area but also incurs additional security and privacy challenges from\nintermediate model aggregations and remains the single point of failure issue.\nTo tackle these challenges, we propose a blockchain-based HFL (BHFL) system\nthat operates a permissioned blockchain among edge servers for model\naggregation without the need for a centralized cloud server. The employment of\nblockchain, however, introduces additional overhead. To enable a compact and\nefficient workflow, we design a novel lightweight consensus algorithm, named\nProof of Federated Edge Learning (PoFEL), to recycle the energy consumed for\nlocal model training. Specifically, the leader node is selected by evaluating\nthe intermediate FEL models from all edge servers instead of other\nenergy-wasting but meaningless calculations. This design thus improves the\nsystem efficiency compared with traditional BHFL frameworks. To prevent model\nplagiarism and bribery voting during the consensus process, we propose\nHash-based Commitment and Digital Signature (HCDS) and Bayesian Truth\nSerum-based Voting (BTSV) schemes. Finally, we devise an incentive mechanism to\nmotivate continuous contributions from clients to the learning task.\nExperimental results demonstrate that our proposed BHFL system with the\ncorresponding consensus protocol and incentive mechanism achieves\neffectiveness, low computational cost, and fairness.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:34:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Shengyang",""],["Hu","Qin",""],["Wang","Zhilin",""]]}
{"id":"2308.07841","submitter":"Angxiu Ni","authors":"Angxiu Ni","title":"No-propagate algorithm for linear responses of random chaotic systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.ST physics.comp-ph stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop the no-propagate algorithm for sampling the linear response of\nrandom dynamical systems, which are non-uniform hyperbolic deterministic\nsystems perturbed by noise with smooth density. We first derive a Monte-Carlo\ntype formula and then the algorithm, which is different from the ensemble\n(stochastic gradient) algorithms, finite-element algorithms, and fast-response\nalgorithms; it does not involve the propagation of vectors or covectors, and\nonly the density of the noise is differentiated, so the formula is not cursed\nby gradient explosion, dimensionality, or non-hyperbolicity. We demonstrate our\nalgorithm on a tent map perturbed by noise and a chaotic neural network with 51\nlayers $\\times$ 9 neurons.\n  By itself, this algorithm approximates the linear response of non-hyperbolic\ndeterministic systems, with an additional error proportional to the noise. We\nalso discuss the potential of using this algorithm as a part of a bigger\nalgorithm with smaller error.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:37:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ni","Angxiu",""]]}
{"id":"2308.07842","submitter":"Maria Thurow","authors":"Maria Thurow, Ina Dormuth, Christina Sauer, Marc Ditzhaus and Markus\n  Pauly","title":"How to Simulate Realistic Survival Data? A Simulation Study to Compare\n  Realistic Simulation Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In statistics, it is important to have realistic data sets available for a\nparticular context to allow an appropriate and objective method comparison. For\nmany use cases, benchmark data sets for method comparison are already available\nonline. However, in most medical applications and especially for clinical\ntrials in oncology, there is a lack of adequate benchmark data sets, as patient\ndata can be sensitive and therefore cannot be published. A potential solution\nfor this are simulation studies. However, it is sometimes not clear, which\nsimulation models are suitable for generating realistic data. A challenge is\nthat potentially unrealistic assumptions have to be made about the\ndistributions. Our approach is to use reconstructed benchmark data sets %can be\nused as a basis for the simulations, which has the following advantages: the\nactual properties are known and more realistic data can be simulated. There are\nseveral possibilities to simulate realistic data from benchmark data sets. We\ninvestigate simulation models based upon kernel density estimation, fitted\ndistributions, case resampling and conditional bootstrapping. In order to make\nrecommendations on which models are best suited for a specific survival\nsetting, we conducted a comparative simulation study. Since it is not possible\nto provide recommendations for all possible survival settings in a single\npaper, we focus on providing realistic simulation models for two-armed phase\nIII lung cancer studies. To this end we reconstructed benchmark data sets from\nrecent studies. We used the runtime and different accuracy measures (effect\nsizes and p-values) as criteria for comparison.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:37:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Thurow","Maria",""],["Dormuth","Ina",""],["Sauer","Christina",""],["Ditzhaus","Marc",""],["Pauly","Markus",""]]}
{"id":"2308.07843","submitter":"Shuangning Li","authors":"Shuangning Li, Lluis Salvat Niell, Sung Won Choi, Inbal Nahum-Shani,\n  Guy Shani, Susan Murphy","title":"Dyadic Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.AP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mobile health aims to enhance health outcomes by delivering interventions to\nindividuals as they go about their daily life. The involvement of care partners\nand social support networks often proves crucial in helping individuals\nmanaging burdensome medical conditions. This presents opportunities in mobile\nhealth to design interventions that target the dyadic relationship -- the\nrelationship between a target person and their care partner -- with the aim of\nenhancing social support. In this paper, we develop dyadic RL, an online\nreinforcement learning algorithm designed to personalize intervention delivery\nbased on contextual factors and past responses of a target person and their\ncare partner. Here, multiple sets of interventions impact the dyad across\nmultiple time intervals. The developed dyadic RL is Bayesian and hierarchical.\nWe formally introduce the problem setup, develop dyadic RL and establish a\nregret bound. We demonstrate dyadic RL's empirical performance through\nsimulation studies on both toy scenarios and on a realistic test bed\nconstructed from data collected in a mobile health study.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:43:12 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 02:13:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Shuangning",""],["Niell","Lluis Salvat",""],["Choi","Sung Won",""],["Nahum-Shani","Inbal",""],["Shani","Guy",""],["Murphy","Susan",""]]}
{"id":"2308.07844","submitter":"Naomi Nickerson","authors":"Hector Bombin, Chris Dawson, Terry Farrelly, Yehua Liu, Naomi\n  Nickerson, Mihir Pant, Fernando Pastawski and Sam Roberts","title":"Fault-tolerant complexes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fault-tolerant complexes describe surface-code fault-tolerant protocols from\na single geometric object. We first introduce fusion complexes that define a\ngeneral family of fusion-based quantum computing (FBQC) fault-tolerant quantum\nprotocols based on surface codes. We show that any 3-dimensional cell complex\nwhere each edge has four incident faces gives a valid fusion complex. This\nconstruction enables an automated search for fault tolerance schemes, allowing\nus to identify 627 examples within a moderate search time. We implement this\nusing the open-source software tool Gavrog and present threshold results for a\nvariety of schemes, finding fusion networks with higher erasure and Pauli\nthresholds than those existing in the literature. We then define more general\nstructures we call fault-tolerant complexes that provide a homological\ndescription of fault tolerance from a large family of low-level error models,\nwhich include circuit-based computation, floquet-based computation, and FBQC\nwith multi-qubit measurements. This extends the applicability of homological\ndescriptions of fault tolerance, and enables the generation of many new schemes\nwhich have not been previously identified. We also define families of\nfault-tolerant complexes for color codes and 3d single-shot subsystem codes,\nwhich enables similar constructive methods, and we present several new examples\nof each.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:46:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bombin","Hector",""],["Dawson","Chris",""],["Farrelly","Terry",""],["Liu","Yehua",""],["Nickerson","Naomi",""],["Pant","Mihir",""],["Pastawski","Fernando",""],["Roberts","Sam",""]]}
{"id":"2308.07845","submitter":"Heidi Rzehak","authors":"Stefan Dittmaier, Jonas Rehberg, Heidi Rzehak","title":"Renormalization of a Standard Model Extension with a Dark Abelian Sector\n  and Predictions for the W-Boson Mass","comments":null,"journal-ref":null,"doi":null,"report-no":"FR-PHENO-2023-07","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The described Dark Abelian Sector Model (DASM) extends the Standard Model\n(SM) by a ``dark'' sector containing a spontaneously broken $U(1)_\\text{d}$\ngauge group. Keeping this dark sector quite generic we only add one additional\nHiggs boson, one Dirac fermion, and right-handed SM-like neutrinos to the SM.\nUsing the only two singlet operators of the SM with dimension less than 4 (the\n$U(1)_\\text{Y}$ field-strength tensor and the SM Higgs mass operator\n$|\\Phi|^2$) as well as the right-handed neutrino fields we open up three\nportals to the dark sector. Dark sectors, such as the one of the DASM, that\nintroduce an additional Higgs boson $\\text{H}$ as well as an additional\n$\\text{Z}'$ gauge boson can have a large influence on the predictions for\nelectroweak precision observables and even accommodate possible dark matter\ncandidates. We consider one of the two Higgs bosons to be the known\n$125\\,\\text{GeV}$ Higgs boson and parameterize the extension of the scalar\nsector by the mass of the second Higgs boson, the Higgs mixing angle, and a\nHiggs self-coupling. We do not assume any mass hierarchy in the gauge sector\nand use the mass of the additional $\\text{Z}'$ boson and a corresponding\ngauge-boson mixing angle to parameterize the extension of the gauge sector. The\nfermion sector is parameterized by the mass of the additional fermion and a\nfermion mixing angle. We describe an on-shell as well as an\n$\\overline{\\text{MS}}$ renormalization scheme for the DASM sectors and give\nexplicit results for the renormalization constants at the 1-loop level, and,\nthus, prepare the ground for full NLO predictions for collider observables in\nthe DASM. As a first example, we provide the DASM prediction for the W-boson\nmass derived from muon decay.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:47:50 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Dittmaier","Stefan",""],["Rehberg","Jonas",""],["Rzehak","Heidi",""]]}
{"id":"2308.07846","submitter":"Mohammad Ghaljehei","authors":"Mohammad Ghaljehei, Mojdeh Khorsand","title":"A Data-Driven Policy for Addressing Deployability Issue of FMM FRPs:\n  Resources Qualification and Deliverability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intensified netload uncertainty and variability led to the concept of a new\nmarket product, flexible ramping product (FRP). The main goal of FRP is to\nenhance the generation dispatch flexibility inside real-time (RT) markets to\nmitigate energy imbalances due to ramp capability shortage. Generally, the FRP\nrequirements are based on system-wide or proxy requirements, so the effect of\nFRP awards on the transmission line constraints is not considered. This can\nlead to FRP deployability issues in RT operation. This paper proposes a new FRP\ndesign based on a datadriven policy incorporating ramping response factor sets\nto address FRP deployability issue. First, a data-mining algorithm is performed\nto predict the ramp-qualified generators to create the data-driven policy.\nThen, the FRP awards are assigned to these units while considering effects of\npost-deployment of FRPs on the transmission line limits. Finally, the proposed\ndata-driven policy is tested against proxy policy through an out-of-sample\nvalidation phase that (i) mimics the RT operation of the CAISO, and (ii)\nrepresents the expensive ad-hoc actions needed for procuring additional ramping\ncapability to follow realized netload changes. The results show the\neffectiveness of the proposed data-driven policy from reliability and economic\npoints of view\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:48:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ghaljehei","Mohammad",""],["Khorsand","Mojdeh",""]]}
{"id":"2308.07847","submitter":"Yugeng Liu","authors":"Yugeng Liu, Tianshuo Cong, Zhengyu Zhao, Michael Backes, Yun Shen,\n  Yang Zhang","title":"Robustness Over Time: Understanding Adversarial Examples' Effectiveness\n  on Longitudinal Versions of Large Language Models","comments":null,"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 led to significant improvements in many\ntasks across various domains, such as code interpretation, response generation,\nand ambiguity handling. These LLMs, however, when upgrading, primarily\nprioritize enhancing user experience while neglecting security, privacy, and\nsafety implications. Consequently, unintended vulnerabilities or biases can be\nintroduced. Previous studies have predominantly focused on specific versions of\nthe models and disregard the potential emergence of new attack vectors\ntargeting the updated versions. Through the lens of adversarial examples within\nthe in-context learning framework, this longitudinal study addresses this gap\nby conducting a comprehensive assessment of the robustness of successive\nversions of LLMs, vis-\\`a-vis GPT-3.5. We conduct extensive experiments to\nanalyze and understand the impact of the robustness in two distinct learning\ncategories: zero-shot learning and few-shot learning. Our findings indicate\nthat, in comparison to earlier versions of LLMs, the updated versions do not\nexhibit the anticipated level of robustness against adversarial attacks. In\naddition, our study emphasizes the increased effectiveness of synergized\nadversarial queries in most zero-shot learning and few-shot learning cases. We\nhope that our study can lead to a more refined assessment of the robustness of\nLLMs over time and provide valuable insights of these models for both\ndevelopers and users.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:51:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liu","Yugeng",""],["Cong","Tianshuo",""],["Zhao","Zhengyu",""],["Backes","Michael",""],["Shen","Yun",""],["Zhang","Yang",""]]}
{"id":"2308.07848","submitter":"Amanda Young","authors":"Amanda Young","title":"Quantum Spin Systems","comments":"12 pg. 1 fig. Review paper. This is an invited contribution to the\n  2nd edition of the Encyclopedia of Mathematical Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work provides an overview of gapped quantum spin systems, including\nconcepts, techniques, properties, and results. The basic framework and objects\nof interest for quantum spin systems are introduced, and the main ideas behind\nmethods for proving spectral gaps for frustration-free models are outlined.\nAfter reviewing recent progress on several spectral gap conjectures, we discuss\nquasi-locality of the Heisenberg dynamics and its utility in proving properties\nof gapped quantum spin systems. Lieb-Robinson bounds have played a central role\nin establishing exponential decay of ground state correlations, an area law for\none-dimensional systems, a many-body adiabatic theorem, and spectral gap\nstability. They also aided in the development of the quasi-adiabatic\ncontinuation, which is a useful for investigating gapped ground state phases,\nboth of which are also discussed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:52:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Young","Amanda",""]]}
{"id":"2308.07849","submitter":"Sahel Ashhab","authors":"Sahel Ashhab, Ziqiao Ao, Fumiki Yoshihara, Kouichi Semba","title":"High-frequency suppression of inductive coupling between flux qubit and\n  transmission line resonator","comments":"24 pages (preprint), 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We perform theoretical calculations to investigate the naturally occurring\nhigh-frequency cutoff in a circuit comprising a flux qubit coupled inductively\nto a transmission line resonator (TLR). Our results agree with those of past\nstudies that considered somewhat similar circuit designs. In particular, a\ndecoupling occurs between the qubit and the high-frequency modes. As a result,\nthe coupling strength between the qubit and resonator modes increases with mode\nfrequency $\\omega$ as $\\sqrt{\\omega}$ at low frequencies and decreases as\n$1/\\sqrt{\\omega}$ at high frequencies. We derive expressions for the\nmultimode-resonator-induced Lamb shift in the qubit's characteristic frequency.\nBecause of the natural decoupling between the qubit and high-frequency modes,\nthe Lamb-shift-renormalized qubit frequency remains finite.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:53:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ashhab","Sahel",""],["Ao","Ziqiao",""],["Yoshihara","Fumiki",""],["Semba","Kouichi",""]]}
{"id":"2308.07850","submitter":"Ralf Metzler","authors":"Qing Wei, Wei Wang, Hongwei Zhou, Ralf Metzler, and Aleksei Chechkin","title":"Time-fractional Caputo derivative versus other integro-differential\n  operators in generalized Fokker-Planck and generalized Langevin equations","comments":"26 pages, 7 figures, RevTeX","journal-ref":null,"doi":"10.1103/PhysRevE.108.024125","report-no":null,"categories":"cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fractional diffusion and Fokker-Planck equations are widely used tools to\ndescribe anomalous diffusion in a large variety of complex systems. The\nequivalent formulations in terms of Caputo or Riemann-Liouville fractional\nderivatives can be derived as continuum limits of continuous time random walks\nand are associated with the Mittag-Leffler relaxation of Fourier modes,\ninterpolating between a short-time stretched exponential and a long-time\ninverse power-law scaling. More recently, a number of other\nintegro-differential operators have been proposed, including the\nCaputo-Fabrizio and Atangana-Baleanu forms. Moreover, the conformable\nderivative has been introduced. We here study the dynamics of the associated\ngeneralized Fokker-Planck equations from the perspective of the moments, the\ntime averaged mean squared displacements, and the autocovariance functions. We\nalso study generalized Langevin equations based on these generalized operators.\nThe differences between the Fokker-Planck and Langevin equations with different\nintegro-differential operators are discussed and compared with the dynamic\nbehavior of established models of scaled Brownian motion and fractional\nBrownian motion. We demonstrate that the integro-differential operators with\nexponential and Mittag-Leffler kernels are not suitable to be introduced to\nFokker-Planck and Langevin equations for the physically relevant diffusion\nscenarios discussed in our paper. The conformable and Caputo Langevin equations\nare unveiled to share similar properties with scaled and fractional Brownian\nmotion, respectively.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:54:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wei","Qing",""],["Wang","Wei",""],["Zhou","Hongwei",""],["Metzler","Ralf",""],["Chechkin","Aleksei",""]]}
{"id":"2308.07851","submitter":"Hau-Wen Huang","authors":"Hau-Wen Huang","title":"An imperceptible connection between the Clebsch--Gordan coefficients of\n  $U_q(\\mathfrak{sl}_2)$ and the Terwilliger algebras of Grassmann graphs","comments":"65 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.QA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Clebsch--Gordan coefficients of $U(\\mathfrak{sl}_2)$ are expressible in\nterms of Hahn polynomials. The phenomenon can be explained by an algebra\nhomomorphism from the universal Hahn algebra $\\mathcal H$ into\n$U(\\mathfrak{sl}_2)\\otimes U(\\mathfrak{sl}_2)$. Let $\\Omega$ denote a finite\nset and $2^\\Omega$ denote the power set of $\\Omega$. It is generally known that\n$\\mathbb C^{2^\\Omega}$ supports a $U(\\mathfrak{sl}_2)$-module. Fix an element\n$x_0\\in 2^\\Omega$. By the linear isomorphism $\\mathbb C^{2^\\Omega}\\to \\mathbb\nC^{2^{\\Omega\\setminus x_0}}\\otimes \\mathbb C^{2^{x_0}}$ given by $x\\mapsto\n(x\\setminus x_0)\\otimes (x\\cap x_0)$ for all $x\\in 2^\\Omega$, this induces a\n$U(\\mathfrak{sl}_2)\\otimes U(\\mathfrak{sl}_2)$-module structure on $\\mathbb\nC^{2^\\Omega}$. Pulling back via the algebra homomorphism $\\mathcal H\\to\nU(\\mathfrak{sl}_2)\\otimes U(\\mathfrak{sl}_2)$, the $U(\\mathfrak{sl}_2)\\otimes\nU(\\mathfrak{sl}_2)$-module $\\mathbb C^{2^\\Omega}$ forms an $\\mathcal H$-module.\nThe $\\mathcal H$-module $\\mathbb C^{2^\\Omega}$ enfolds the Terwilliger algebra\nof a Johnson graph. This result connects these two seemingly irrelevant topics:\nThe Clebsch--Gordan coefficients of $U(\\mathfrak{sl}_2)$ and the Terwilliger\nalgebras of Johnson graphs. Unfortunately some steps break down in the\n$q$-analog case. By making detours, the imperceptible connection between the\nClebsch--Gordan coefficients of $U_q(\\mathfrak{sl}_2)$ and the Terwilliger\nalgebras of Grassmann graphs is successfully disclosed in this paper.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:55:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Huang","Hau-Wen",""]]}
{"id":"2308.07852","submitter":"Liqi Han","authors":"L. Q. Han, J. Cai, Y. R. Shou, X. D. Liu, J. Q. Yu, and X. Q. Yan","title":"Towards the demonstration of photon-photon collision with compact lasers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report a proposal to observe the two-photon Breit-Wheeler process in\nplasma driven by compact lasers. A high charge electron bunch can be generated\nfrom laser plasma wakefield acceleration when a tightly focused laser pulse\ntransports in a sub-critical density plasma. The electron bunch scatters with\nthe laser pulse coming from the opposite direction and results the emitting of\nhigh brilliance X-ray pulses. In a three-dimensional particle-in-cell\nsimulation with a laser pulse of $\\sim$10 J, one could produce a X-ray pulse\nwith photon number higher than $3\\times10^{11}$ and brilliance above $1.6\\times\n10^{23}$ photons/s/mm$^2$/mrad$^2$/0.1$\\%$BW at 1 MeV. The X-ray pulses collide\nin the plasma and create more than $1.1\\times 10^5$ electron-positron pairs per\nshot. It is also found that the positrons can be accelerated transversely by a\ntransverse electric field generated in the plasma, which enables the safe\ndetection in the direction away from the laser pulses. This proposal which has\nsolved key challenges in laser driven photon-photon collision could demonstrate\nthe two-photon Breit-Wheeler process on a much more compact device in a single\nshot.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:57:36 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Han","L. Q.",""],["Cai","J.",""],["Shou","Y. R.",""],["Liu","X. D.",""],["Yu","J. Q.",""],["Yan","X. Q.",""]]}
{"id":"2308.07853","submitter":"Mingsheng Tian","authors":"Mingsheng Tian, Ivan Velkovsky, Tao Chen, Fengxiao Sun, Qiongyi He,\n  and Bryce Gadway","title":"Observation of Topological Weyl Type I-II Transition in Synthetic\n  Mechanical Lattices","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":"  Weyl points are three-dimensional linear points between bands that exhibit\nunique stability to perturbations and are accompanied by topologically\nnon-trivial surface states. However, the discovery and control of Weyl points\nin nature poses significant challenges. While recent advances have allowed for\nengineering Weyl points in photonic crystals and metamaterials, the topological\ntransition between Weyl semimetals with distinct types of Weyl points remains\nyet to be reported. Here, exploiting the flexible measurement-feedback control\nof synthetic mechanical systems, we experimentally simulate Weyl semimetals and\nobserve for the first time the transition between states with type-I and\ntype-II Weyl points. We directly observe the change in the band structures\naccompanying the transition and identify the Fermi arc surface states\nconnecting the Weyl points. Further, making use of the non-reciprocal feedback\ncontrol, we demonstrate that the introduction of non-Hermiticity significantly\nimpacts the topological transition point, as well as the edge localization of\nthe Fermi arc surface states. Our findings offer valuable insights into the\ndesign and realization of Weyl points in mechanical systems, providing a\npromising avenue for exploring novel topological phenomena in non-Hermitian\nphysics.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:00:44 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tian","Mingsheng",""],["Velkovsky","Ivan",""],["Chen","Tao",""],["Sun","Fengxiao",""],["He","Qiongyi",""],["Gadway","Bryce",""]]}
{"id":"2308.07854","submitter":"Simone Formentin","authors":"Valentina Breschi, Simone Formentin and Alberto Leva","title":"Model predictive control with dynamic move blocking","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Model Predictive Control (MPC) has proven to be a powerful tool for the\ncontrol of systems with constraints. Nonetheless, in many applications, a major\nchallenge arises, that is finding the optimal solution within a single sampling\ninstant to apply a receding-horizon policy. In such cases, many suboptimal\nsolutions have been proposed, among which the possibility of \"blocking\" some\nmoves a-priori. In this paper, we propose a dynamic approach to move blocking,\nto exploit the solution already available at the previous iteration, and we\nshow not only that such an approach preserves asymptotic stability, but also\nthat the decrease of performance with respect to the ideal solution can be\ntheoretically bounded.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:04:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Breschi","Valentina",""],["Formentin","Simone",""],["Leva","Alberto",""]]}
{"id":"2308.07855","submitter":"Abhijit  Kumar Saha","authors":"Arnab Paul, Sourov Roy and Abhijit Kumar Saha","title":"Cosmic inflation and $(g-2)_\\mu$ in minimal gauged $L_\\mu-L_\\tau$ model","comments":"21 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The minimal $U(1)_{L_\\mu-L_\\tau}$ gauge symmetry extended Standard Model (SM)\nis a well motivated framework that resolves the discrepancy between the\ntheoretical prediction and experimental observation of muon anomalous magnetic\nmoment. We envisage the possibility of identifying the beyond Standard Model\nHiggs of $U(1)_{L_\\mu-L_\\tau}$ sector, non-minimally coupled to gravity, as the\ninflaton in the early universe, while being consistent with the $(g-2)_\\mu$\ndata. Although the structure seems to be trivial, we observe that taking into\nconsideration of a complete cosmological history starting from inflation\nthrough the reheating phase to late-time epoch along with existing constraints\non $U(1)_{L_\\mu-L_\\tau}$ model parameters leave us a small window of allowed\nreheating temperature. This further results into restriction of $(n_s-r)$ plane\nwhich is far severe than the one in a generic non-minimal quartic inflationary\nset up.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:07:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Paul","Arnab",""],["Roy","Sourov",""],["Saha","Abhijit Kumar",""]]}
{"id":"2308.07856","submitter":"Cleto B. Miranda-Neto","authors":"Cleto B. Miranda-Neto, Thyago S. Souza","title":"Tensor products and solutions to two homological conjectures for Ulrich\n  modules","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the problem of when the tensor product of two finitely generated\nmodules over a Cohen-Macaulay local ring is Ulrich in the generalized sense of\nGoto et al., and in particular in the original sense from the 80's. As\napplications, besides freeness criteria for modules, characterizations of\ncomplete intersections, and an Ulrich-based approach to the long-standing\nBerger's conjecture, we show that two celebrated homological conjectures,\nnamely the Auslander-Reiten and the Huneke-Wiegand problems, are true for the\nclass of Ulrich modules.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:08:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Miranda-Neto","Cleto B.",""],["Souza","Thyago S.",""]]}
{"id":"2308.07857","submitter":"Fernando Benjamin Perez Maurera","authors":"Fernando B. P\\'erez Maurera, Maurizio Ferrari Dacrema, Pablo Castells,\n  Paolo Cremonesi","title":"Impression-Aware Recommender Systems","comments":"34 pages, 103 references, 6 tables, 2 figures, ACM UNDER REVIEW","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":"  Novel data sources bring new opportunities to improve the quality of\nrecommender systems. Impressions are a novel data source containing past\nrecommendations (shown items) and traditional interactions. Researchers may use\nimpressions to refine user preferences and overcome the current limitations in\nrecommender systems research. The relevance and interest of impressions have\nincreased over the years; hence, the need for a review of relevant work on this\ntype of recommenders. We present a systematic literature review on recommender\nsystems using impressions, focusing on three fundamental angles in research:\nrecommenders, datasets, and evaluation methodologies. We provide three\ncategorizations of papers describing recommenders using impressions, present\neach reviewed paper in detail, describe datasets with impressions, and analyze\nthe existing evaluation methodologies. Lastly, we present open questions and\nfuture directions of interest, highlighting aspects missing in the literature\nthat can be addressed in future works.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:16:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Maurera","Fernando B. P\u00e9rez",""],["Dacrema","Maurizio Ferrari",""],["Castells","Pablo",""],["Cremonesi","Paolo",""]]}
{"id":"2308.07858","submitter":"Alex Ganose","authors":"Ruiqi Wu and Alex M. Ganose","title":"Tilt-induced charge localisation in phosphide antiperovskite\n  photovoltaics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Antiperovskites are a rich family of compounds with applications in battery\ncathodes, superconductors, solid-state lighting, and catalysis. Recently, a\nnovel series of antimonide phosphide antiperovskites (A$_3$SbP, where A = Ca,\nSr, Ba) were proposed as candidate photovoltaic absorbers due to their ideal\nband gaps, small effective masses and strong optical absorption. In this work,\nwe explore this series of compounds in more detail using relativistic hybrid\ndensity functional theory. We reveal that the proposed cubic structures are\ndynamically unstable and instead identify a tilted orthorhombic Pnma phase as\nthe ground state. Tilting is shown to induce charge localisation that widens\nthe band gap and increases the effective masses. Despite this, we demonstrate\nthat the predicted maximum photovoltaic efficiencies remain high (24-31% for\n200 nm thin films) by bringing the band gaps into the ideal range for a solar\nabsorber. Finally, we assess the band alignment of the series and suggest hole\nand electron contact materials for efficient photovoltaic devices.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:18:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wu","Ruiqi",""],["Ganose","Alex M.",""]]}
{"id":"2308.07859","submitter":"Kaitao Xie","authors":"Haiyu Chen, Kaitao Xie","title":"Regularity of Unipotent Elements in Total Positivity","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a connected reductive group split over R. We show that every\nunipotent element in the totally nonnegative monoid of G is regular in some\nLevi subgroups, confirming a conjecture of Lusztig.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:24:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chen","Haiyu",""],["Xie","Kaitao",""]]}
{"id":"2308.07860","submitter":"Guy Farrelly","authors":"Guy Farrelly, Paul Quirk, Salil S. Kanhere, Seyit Camtepe, Damith C.\n  Ranasinghe","title":"SplITS: Split Input-to-State Mapping for Effective Firmware Fuzzing","comments":"Accepted ESORICS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ability to test firmware on embedded devices is critical to discovering\nvulnerabilities prior to their adversarial exploitation. State-of-the-art\nautomated testing methods rehost firmware in emulators and attempt to\nfacilitate inputs from a diversity of methods (interrupt driven, status\npolling) and a plethora of devices (such as modems and GPS units). Despite\nrecent progress to tackle peripheral input generation challenges in rehosting,\na firmware's expectation of multi-byte magic values supplied from peripheral\ninputs for string operations still pose a significant roadblock. We solve the\nimpediment posed by multi-byte magic strings in monolithic firmware. We propose\nfeedback mechanisms for input-to-state mapping and retaining seeds for targeted\nreplacement mutations with an efficient method to solve multi-byte comparisons.\nThe feedback allows an efficient search over a combinatorial solution-space. We\nevaluate our prototype implementation, SplITS, with a diverse set of 21\nreal-world monolithic firmware binaries used in prior works, and 3 new binaries\nfrom popular open source projects. SplITS automatically solves 497% more\nmulti-byte magic strings guarding further execution to uncover new code and\nbugs compared to state-of-the-art. In 11 of the 12 real-world firmware binaries\nwith string comparisons, including those extensively analyzed by prior works,\nSplITS outperformed, statistically significantly. We observed up to 161%\nincrease in blocks covered and discovered 6 new bugs that remained guarded by\nstring comparisons. Significantly, deep and difficult to reproduce bugs guarded\nby comparisons, identified in prior work, were found consistently. To\nfacilitate future research in the field, we release SplITS, the new firmware\ndata sets, and bug analysis at https://github.com/SplITS-Fuzzer\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:25:47 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Farrelly","Guy",""],["Quirk","Paul",""],["Kanhere","Salil S.",""],["Camtepe","Seyit",""],["Ranasinghe","Damith C.",""]]}
{"id":"2308.07861","submitter":"Gopal Bhatta","authors":"Gopal Bhatta, Staszek Zola, M. Drozdz, Daniel Reichart, Joshua\n  Haislip, Vladimir Kouprianov, Katsura Matsumoto, Eda Sonbas, D. Caton,\n  Urszula Pajdosz-\\'Smierciak, A. Simon, J. Provencal, Dariusz G\\'ora, Grzegorz\n  Stachowski","title":"Profound optical flares from the relativistic jets of active galactic\n  nuclei","comments":"8 pages, 2 figures, 38th International Cosmic Ray Conference\n  (ICRC2023) proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intense outbursts in blazars are among the most extreme phenomena seen in\nextragalactic objects. Studying these events can offer important information\nabout the energetic physical processes taking place within the innermost\nregions of blazars, which are beyond the resolution of current instruments.\nThis work presents some of the largest and most rapid flares detected in the\noptical band from the sources 3C 279, OJ 49, S4 0954+658, Ton 599, and PG\n1553+113, which are mostly TeV blazars. The source flux increased by nearly ten\ntimes within a few weeks, indicating the violent nature of these events. Such\nenergetic events might originate from magnetohydrodynamical instabilities near\nthe base of the jets, triggered by processes modulated by the magnetic field of\nthe accretion disc. We explain the emergence of flares owing to the injection\nof high-energy particles by the shock wave passing along the relativistic jets.\nAlternatively, the flares may have also arisen due to geometrical effects\nrelated to the jets. We discuss both source-intrinsic and source-extrinsic\nscenarios as possible explanations for the observed large amplitude flux\nchanges.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:27:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bhatta","Gopal",""],["Zola","Staszek",""],["Drozdz","M.",""],["Reichart","Daniel",""],["Haislip","Joshua",""],["Kouprianov","Vladimir",""],["Matsumoto","Katsura",""],["Sonbas","Eda",""],["Caton","D.",""],["Pajdosz-\u015amierciak","Urszula",""],["Simon","A.",""],["Provencal","J.",""],["G\u00f3ra","Dariusz",""],["Stachowski","Grzegorz",""]]}
{"id":"2308.07863","submitter":"Zhizhong Wang","authors":"Zhizhong Wang, Lei Zhao, Wei Xing","title":"StyleDiffusion: Controllable Disentangled Style Transfer via Diffusion\n  Models","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":"  Content and style (C-S) disentanglement is a fundamental problem and critical\nchallenge of style transfer. Existing approaches based on explicit definitions\n(e.g., Gram matrix) or implicit learning (e.g., GANs) are neither interpretable\nnor easy to control, resulting in entangled representations and less satisfying\nresults. In this paper, we propose a new C-S disentangled framework for style\ntransfer without using previous assumptions. The key insight is to explicitly\nextract the content information and implicitly learn the complementary style\ninformation, yielding interpretable and controllable C-S disentanglement and\nstyle transfer. A simple yet effective CLIP-based style disentanglement loss\ncoordinated with a style reconstruction prior is introduced to disentangle C-S\nin the CLIP image space. By further leveraging the powerful style removal and\ngenerative ability of diffusion models, our framework achieves superior results\nthan state of the art and flexible C-S disentanglement and trade-off control.\nOur work provides new insights into the C-S disentanglement in style transfer\nand demonstrates the potential of diffusion models for learning\nwell-disentangled C-S characteristics.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:30:49 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Zhizhong",""],["Zhao","Lei",""],["Xing","Wei",""]]}
{"id":"2308.07864","submitter":"Christian Tate","authors":"Christian D. Tate, Julie A. Rathbun, Alexander G. Hayes, John R.\n  Spencer, Madeline Pettine","title":"Discovery of seven volcanic outbursts on Io from an IRTF observation\n  campaign 2016 to 2022","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study analyzes near-infrared measurements of Io, Jupiter's moon,\nobserved over 170 nights from 2016 to early 2022 using the NASA Infrared\nTelescope Facility (IRTF). During this period, seven new volcanic outbursts,\nthe most energetic volcanic events on Io, were discovered and characterized,\nincreasing the total number of observed outburst events from 18 to 25. We also\npresent simplified criteria for the thermal detection of an outburst, requiring\nit to be both confined to a specific location of Io and above a threshold\nintensity in the Lp-band (3.8 micron).\n  Our measurements use 2 to 5 micron photometry in eclipse, Jupiter\noccultation, and reflected sunlight. In addition to extending the observational\ndataset of Io's dynamic activity, these data provide insights into the temporal\nand spatial distribution of outbursts on Io. Notably, all seven outbursts were\ndetected in Io's trailing hemisphere. These include Pillan Patera and a newly\ndiscovered repeating outburst location at Acala Fluctus. We add these events to\nthe rare category of recurring outbursts, before which Tvashtar was the only\nknown example. We observed that another outburst at UP 254W decreased in\nLp-band intensity by a factor of two in 4.5 hours. In August 2021, Io exhibited\nhigh volcanic activity when two powerful outbursts rapidly appeared,\npropagating East. Our findings underscore IRTF's ongoing contributions to the\nstudy of Io.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:32:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tate","Christian D.",""],["Rathbun","Julie A.",""],["Hayes","Alexander G.",""],["Spencer","John R.",""],["Pettine","Madeline",""]]}
{"id":"2308.07865","submitter":"Carys Harvey","authors":"Carys Harvey, Richie Yeung, Konstantinos Meichanetzidis","title":"Sequence Processing with Quantum Tensor Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce complex-valued tensor network models for sequence processing\nmotivated by correspondence to probabilistic graphical models, interpretability\nand resource compression. Inductive bias is introduced to our models via\nnetwork architecture, and is motivated by the correlation structure inherent in\nthe data, as well as any relevant compositional structure, resulting in\ntree-like connectivity. Our models are specifically constructed using\nparameterised quantum circuits, widely used in quantum machine learning,\neffectively using Hilbert space as a feature space. Furthermore, they are\nefficiently trainable due to their tree-like structure. We demonstrate\nexperimental results for the task of binary classification of sequences from\nreal-world datasets relevant to natural language and bioinformatics,\ncharacterised by long-range correlations and often equipped with syntactic\ninformation. Since our models have a valid operational interpretation as\nquantum processes, we also demonstrate their implementation on Quantinuum's\nH2-1 trapped-ion quantum processor, demonstrating the possibility of efficient\nsequence processing on near-term quantum devices. This work constitutes the\nfirst scalable implementation of near-term quantum language processing,\nproviding the tools for large-scale experimentation on the role of tensor\nstructure and syntactic priors. Finally, this work lays the groundwork for\ngenerative sequence modelling in a hybrid pipeline where the training may be\nconducted efficiently in simulation, while sampling from learned probability\ndistributions may be done with polynomial speed-up on quantum devices.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:33:39 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Harvey","Carys",""],["Yeung","Richie",""],["Meichanetzidis","Konstantinos",""]]}
{"id":"2308.07866","submitter":"Emil Prodan Dr.","authors":"Bram Mesland and Emil Prodan","title":"Classifying the Dynamics of Architected Materials by Groupoid Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA cond-mat.mtrl-sci math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider synthetic materials consisting of self-coupled identical\nresonators carrying classical internal degrees of freedom. The architecture of\nsuch material is specified by the positions and orientations of the resonators.\nOur goal is to calculate the smallest C*-algebra that covers the dynamical\nmatrices associated to a fixed architecture and adjustable internal structures.\nWe give the answer in terms of a groupoid C*-algebra that can be canonically\nassociated to a uniformly discrete subset of the group of isometries of the\nEuclidean space. Our result implies that the isomorphism classes of these\nC*-algebras split these architected materials into classes containing materials\nthat are identical from the dynamical point of view.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:34:34 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:58:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mesland","Bram",""],["Prodan","Emil",""]]}
{"id":"2308.07867","submitter":"Parikshit Pareek","authors":"Parikshit Pareek, Deepjyoti Deka, and Sidhant Misra","title":"Graph-Structured Kernel Design for Power Flow Learning using Gaussian\n  Processes","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a physics-inspired graph-structured kernel designed for\npower flow learning using Gaussian Process (GP). The kernel, named the\nvertex-degree kernel (VDK), relies on latent decomposition of voltage-injection\nrelationship based on the network graph or topology. Notably, VDK design avoids\nthe need to solve optimization problems for kernel search. To enhance\nefficiency, we also explore a graph-reduction approach to obtain a VDK\nrepresentation with lesser terms. Additionally, we propose a novel\nnetwork-swipe active learning scheme, which intelligently selects sequential\ntraining inputs to accelerate the learning of VDK. Leveraging the additive\nstructure of VDK, the active learning algorithm performs a block-descent type\nprocedure on GP's predictive variance, serving as a proxy for information gain.\nSimulations demonstrate that the proposed VDK-GP achieves more than two fold\nsample complexity reduction, compared to full GP on medium scale 500-Bus and\nlarge scale 1354-Bus power systems. The network-swipe algorithm outperforms\nmean performance of 500 random trials on test predictions by two fold for\nmedium-sized 500-Bus systems and best performance of 25 random trials for\nlarge-scale 1354-Bus systems by 10%. Moreover, we demonstrate that the proposed\nmethod's performance for uncertainty quantification applications with\ndistributionally shifted testing data sets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:34:37 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Pareek","Parikshit",""],["Deka","Deepjyoti",""],["Misra","Sidhant",""]]}
{"id":"2308.07868","submitter":"Qianyi Wu","authors":"Qianyi Wu, Kaisiyuan Wang, Kejie Li, Jianmin Zheng, Jianfei Cai","title":"ObjectSDF++: Improved Object-Compositional Neural Implicit Surfaces","comments":"ICCV 2023. Project Page: https://qianyiwu.github.io/objectsdf++ Code:\n  https://github.com/QianyiWu/objectsdf_plus","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, neural implicit surface reconstruction has emerged as a\npopular paradigm for multi-view 3D reconstruction. Unlike traditional\nmulti-view stereo approaches, the neural implicit surface-based methods\nleverage neural networks to represent 3D scenes as signed distance functions\n(SDFs). However, they tend to disregard the reconstruction of individual\nobjects within the scene, which limits their performance and practical\napplications. To address this issue, previous work ObjectSDF introduced a nice\nframework of object-composition neural implicit surfaces, which utilizes 2D\ninstance masks to supervise individual object SDFs. In this paper, we propose a\nnew framework called ObjectSDF++ to overcome the limitations of ObjectSDF.\nFirst, in contrast to ObjectSDF whose performance is primarily restricted by\nits converted semantic field, the core component of our model is an\nocclusion-aware object opacity rendering formulation that directly\nvolume-renders object opacity to be supervised with instance masks. Second, we\ndesign a novel regularization term for object distinction, which can\neffectively mitigate the issue that ObjectSDF may result in unexpected\nreconstruction in invisible regions due to the lack of constraint to prevent\ncollisions. Our extensive experiments demonstrate that our novel framework not\nonly produces superior object reconstruction results but also significantly\nimproves the quality of scene reconstruction. Code and more resources can be\nfound in \\url{https://qianyiwu.github.io/objectsdf++}\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:35:40 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 10:50:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Qianyi",""],["Wang","Kaisiyuan",""],["Li","Kejie",""],["Zheng","Jianmin",""],["Cai","Jianfei",""]]}
{"id":"2308.07869","submitter":"Ernest Y.-Z. Tan","authors":"Ernest Y.-Z. Tan","title":"Memory effects in device-dependent and device-independent cryptography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In device-independent cryptography, it is known that reuse of devices across\nmultiple protocol instances can introduce a vulnerability against memory\nattacks. This is an introductory note to highlight that even if we restrict\nourselves to device-dependent QKD and only consider a single protocol instance,\nmemory effects across rounds are enough to cause substantial difficulties in\napplying many existing non-IID proof techniques, such as de Finetti reductions\nand complementarity-based arguments (e.g. analysis of phase errors). We present\na quick discussion of these issues, including some tailored scenarios where\nprotocols admitting security proofs via those techniques become insecure when\nmemory effects are allowed, and we highlight connections to recently discussed\nattacks on DIQKD protocols that have public announcements based on the\nmeasurement outcomes. This discussion indicates the challenges that would need\nto be addressed in order to apply those techniques in the presence of memory\neffects (for either the device-dependent or device-independent case), even for\na single protocol instance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:36:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tan","Ernest Y. -Z.",""]]}
{"id":"2308.07870","submitter":"Tommaso Salvatori","authors":"Tommaso Salvatori, Ankur Mali, Christopher L. Buckley, Thomas\n  Lukasiewicz, Rajesh P. N. Rao, Karl Friston, Alexander Ororbia","title":"Brain-Inspired Computational Intelligence via Predictive Coding","comments":"37 Pages, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Artificial intelligence (AI) is rapidly becoming one of the key technologies\nof this century. The majority of results in AI thus far have been achieved\nusing deep neural networks trained with the error backpropagation learning\nalgorithm. However, the ubiquitous adoption of this approach has highlighted\nsome important limitations such as substantial computational cost, difficulty\nin quantifying uncertainty, lack of robustness, unreliability, and biological\nimplausibility. It is possible that addressing these limitations may require\nschemes that are inspired and guided by neuroscience theories. One such theory,\ncalled predictive coding (PC), has shown promising performance in machine\nintelligence tasks, exhibiting exciting properties that make it potentially\nvaluable for the machine learning community: PC can model information\nprocessing in different brain areas, can be used in cognitive control and\nrobotics, and has a solid mathematical grounding in variational inference,\noffering a powerful inversion scheme for a specific class of continuous-state\ngenerative models. With the hope of foregrounding research in this direction,\nwe survey the literature that has contributed to this perspective, highlighting\nthe many ways that PC might play a role in the future of machine learning and\ncomputational intelligence at large.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:37:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Salvatori","Tommaso",""],["Mali","Ankur",""],["Buckley","Christopher L.",""],["Lukasiewicz","Thomas",""],["Rao","Rajesh P. N.",""],["Friston","Karl",""],["Ororbia","Alexander",""]]}
{"id":"2308.07871","submitter":"Sven Buechel","authors":"Sven Buechel and Udo Hahn","title":"Emotion Embeddings $\\unicode{x2014}$ Learning Stable and Homogeneous\n  Abstractions from Heterogeneous Affective Datasets","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human emotion is expressed in many communication modalities and media formats\nand so their computational study is equally diversified into natural language\nprocessing, audio signal analysis, computer vision, etc. Similarly, the large\nvariety of representation formats used in previous research to describe\nemotions (polarity scales, basic emotion categories, dimensional approaches,\nappraisal theory, etc.) have led to an ever proliferating diversity of\ndatasets, predictive models, and software tools for emotion analysis. Because\nof these two distinct types of heterogeneity, at the expressional and\nrepresentational level, there is a dire need to unify previous work on\nincreasingly diverging data and label types. This article presents such a\nunifying computational model. We propose a training procedure that learns a\nshared latent representation for emotions, so-called emotion embeddings,\nindependent of different natural languages, communication modalities, media or\nrepresentation label formats, and even disparate model architectures.\nExperiments on a wide range of heterogeneous affective datasets indicate that\nthis approach yields the desired interoperability for the sake of reusability,\ninterpretability and flexibility, without penalizing prediction quality. Code\nand data are archived under https://doi.org/10.5281/zenodo.7405327 .\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:39:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Buechel","Sven",""],["Hahn","Udo",""]]}
{"id":"2308.07872","submitter":"Matteo Cerruti","authors":"M. Cerruti, C. Boisson, M. B\\\"ottcher, O. Chibueze, I. Davids, A.\n  Dmytriiev, G. Grolleron, F. Jankowsky, J.P. Lenain, A. Luashvili, M.\n  Zacharias (for the H.E.S.S. Collaboration)","title":"Target of Opportunity observations of flaring blazars with H.E.S.S.$\\ $","comments":"to appear in the proceedings of the ICRC 2023 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blazars are the most common class of TeV extragalactic emitters. In the\nframework of the AGN unified model, they are understood as AGNs with a\nrelativistic jet pointing close the line of sight. They are characterized by\nextreme variability, observed to be as fast as minutes. These flares are\nusually observed at multiple wavelengths and their study require fast reaction\nand coordination among multiwavelength observatories. An important part of\nblazars observations with the H.E.S.S. array of Cherenkov telescopes is thus in\nthe form of Target of Opportunity (ToO) observations. In this contribution the\nH.E.S.S. blazar ToO program is presented, with a focus on recent results.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:12:59 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Cerruti","M.","","for the H.E.S.S. Collaboration"],["Boisson","C.","","for the H.E.S.S. Collaboration"],["B\u00f6ttcher","M.","","for the H.E.S.S. Collaboration"],["Chibueze","O.","","for the H.E.S.S. Collaboration"],["Davids","I.","","for the H.E.S.S. Collaboration"],["Dmytriiev","A.","","for the H.E.S.S. Collaboration"],["Grolleron","G.","","for the H.E.S.S. Collaboration"],["Jankowsky","F.","","for the H.E.S.S. Collaboration"],["Lenain","J. P.","","for the H.E.S.S. Collaboration"],["Luashvili","A.","","for the H.E.S.S. Collaboration"],["Zacharias","M.","","for the H.E.S.S. Collaboration"]]}
{"id":"2308.07873","submitter":"Zailin Ma","authors":"Zailin Ma, Jiansheng Yang, Zhihua Zhang","title":"Near-Optimal Last-iterate Convergence of Policy Optimization in Zero-sum\n  Polymatrix Markov games","comments":"Proof of Lemma 3.4 is wrong, \\bar{L}_{h+1}^{t-k} should be replaced\n  by \\sqrt{\\bar{L}_{h+1}^{t-k}}. In this case the proof of the main theorem\n  should be substantially modified","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing approximate Nash equilibria in multi-player general-sum Markov\ngames is a computationally intractable task. However, multi-player Markov games\nwith certain cooperative or competitive structures might circumvent this\nintractability. In this paper, we focus on multi-player zero-sum polymatrix\nMarkov games, where players interact in a pairwise fashion while remain overall\ncompetitive. To the best of our knowledge, we propose the first policy\noptimization algorithm called Entropy-Regularized\nOptimistic-Multiplicative-Weights-Update (ER-OMWU) for finding approximate Nash\nequilibria in finite-horizon zero-sum polymatrix Markov games with full\ninformation feedback. We provide last-iterate convergence guarantees for\nfinding an $\\epsilon$-approximate Nash equilibrium within\n$\\tilde{O}(1/\\epsilon)$ iterations, which is near-optimal compared to the\noptimal $O(1/\\epsilon)$ iteration complexity in two-player zero-sum Markov\ngames, which is a degenerate case of zero-sum polymatrix games with only two\nplayers involved. Our algorithm combines the regularized and optimistic\nlearning dynamics with separated smooth value update within a single loop,\nwhere players update strategies in a symmetric and almost uncoupled manner. It\nprovides a natural dynamics for finding equilibria and is more probable to be\nadapted to a sample-efficient and fully decentralized implementation where only\npartial information feedback is available in the future.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:40:10 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 17:17:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ma","Zailin",""],["Yang","Jiansheng",""],["Zhang","Zhihua",""]]}
{"id":"2308.07874","submitter":"Raza Imam","authors":"Raza Imam, Ibrahim Almakky, Salma Alrashdi, Baketah Alrashdi, Mohammad\n  Yaqub","title":"SEDA: Self-Ensembling ViT with Defensive Distillation and Adversarial\n  Training for robust Chest X-rays Classification","comments":"Accepted at DART (Domain Adaptation and Representation Transfer)\n  Workshop, MICCAI, 2023. Code: https://github.com/Razaimam45/SEDA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Learning methods have recently seen increased adoption in medical\nimaging applications. However, elevated vulnerabilities have been explored in\nrecent Deep Learning solutions, which can hinder future adoption. Particularly,\nthe vulnerability of Vision Transformer (ViT) to adversarial, privacy, and\nconfidentiality attacks raise serious concerns about their reliability in\nmedical settings. This work aims to enhance the robustness of self-ensembling\nViTs for the tuberculosis chest x-ray classification task. We propose\nSelf-Ensembling ViT with defensive Distillation and Adversarial training\n(SEDA). SEDA utilizes efficient CNN blocks to learn spatial features with\nvarious levels of abstraction from feature representations extracted from\nintermediate ViT blocks, that are largely unaffected by adversarial\nperturbations. Furthermore, SEDA leverages adversarial training in combination\nwith defensive distillation for improved robustness against adversaries.\nTraining using adversarial examples leads to better model generalizability and\nimproves its ability to handle perturbations. Distillation using soft\nprobabilities introduces uncertainty and variation into the output\nprobabilities, making it more difficult for adversarial and privacy attacks.\nExtensive experiments performed with the proposed architecture and training\nparadigm on publicly available Tuberculosis x-ray dataset shows SOTA efficacy\nof SEDA compared to SEViT in terms of computational efficiency with 70x times\nlighter framework and enhanced robustness of +9%.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:40:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Imam","Raza",""],["Almakky","Ibrahim",""],["Alrashdi","Salma",""],["Alrashdi","Baketah",""],["Yaqub","Mohammad",""]]}
{"id":"2308.07875","submitter":"Antoine M\\'etras","authors":"Mikhail Karpukhin, Antoine M\\'etras, Iosif Polterovich","title":"Dirac Eigenvalue Optimisation and Harmonic Maps to Complex Projective\n  Spaces","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider a Dirac operator on an oriented compact surface endowed with a\nRiemannian metric and spin structure. Provided the area and the conformal class\nare fixed, how small can the $k$-th positive Dirac eigenvalue be? This problem\nmirrors the maximization problem for the eigenvalues of the Laplacian, which is\nrelated to the study of harmonic maps into spheres. We uncover the connection\nbetween the critical metrics for Dirac eigenvalues and harmonic maps into\ncomplex projective spaces. Using this approach we show that for many conformal\nclasses on a torus the first nonzero Dirac eigenvalue is minimised by the flat\nmetric. We also present a new geometric proof of B\\\"ar's theorem stating that\nthe first nonzero Dirac eigenvalue on the sphere is minimised by the standard\nround metric.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:41:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Karpukhin","Mikhail",""],["M\u00e9tras","Antoine",""],["Polterovich","Iosif",""]]}
{"id":"2308.07876","submitter":"Yibo Hu","authors":"Yibo Hu, Erick Skorupa Parolin, Latifur Khan, Patrick T. Brandt,\n  Javier Osorio, Vito J. D'Orazio","title":"Synthesizing Political Zero-Shot Relation Classification via Codebook\n  Knowledge, NLI, and ChatGPT","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent supervised models for event coding vastly outperform pattern-matching\nmethods. However, their reliance solely on new annotations disregards the vast\nknowledge within expert databases, hindering their applicability to\nfine-grained classification. To address these limitations, we explore zero-shot\napproaches for political event ontology relation classification, by leveraging\nknowledge from established annotation codebooks. Our study encompasses both\nChatGPT and a novel natural language inference (NLI) based approach named ZSP.\nZSP adopts a tree-query framework that deconstructs the task into context,\nmodality, and class disambiguation levels. This framework improves\ninterpretability, efficiency, and adaptability to schema changes. By conducting\nextensive experiments on our newly curated datasets, we pinpoint the\ninstability issues within ChatGPT and highlight the superior performance of\nZSP. ZSP achieves an impressive 40% improvement in F1 score for fine-grained\nRootcode classification. ZSP demonstrates competitive performance compared to\nsupervised BERT models, positioning it as a valuable tool for event record\nvalidation and ontology development. Our work underscores the potential of\nleveraging transfer learning and existing expertise to enhance the efficiency\nand scalability of research in the field.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:41:53 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hu","Yibo",""],["Parolin","Erick Skorupa",""],["Khan","Latifur",""],["Brandt","Patrick T.",""],["Osorio","Javier",""],["D'Orazio","Vito J.",""]]}
{"id":"2308.07877","submitter":"Heng Li","authors":"Heng Li, Richard Durbin","title":"Genome assembly in the telomere-to-telomere era","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  De novo assembly is the process of reconstructing the genome sequence of an\norganism from sequencing reads. Genome sequences are essential to biology, and\nassembly has been a central problem in bioinformatics for four decades. Until\nrecently, genomes were typically assembled into fragments of a few megabases at\nbest but technological advances in long-read sequencing now enable near\ncomplete chromosome-level assembly, also known as telomere-to-telomere\nassembly, for many organisms. Here we review recent progress on assembly\nalgorithms and protocols. We focus on how to derive near telomere-to-telomere\nassemblies and discuss potential future developments.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:50:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Heng",""],["Durbin","Richard",""]]}
{"id":"2308.07878","submitter":"Sven Behnke","authors":"Sven Behnke, Julie A. Adams and David Locke","title":"The $10 Million ANA Avatar XPRIZE Competition Advanced Immersive\n  Telepresence Systems","comments":"Extended version of article accepted for competitions column","journal-ref":"IEEE Robotics and Automation Magazine, 2023","doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $10M ANA Avatar XPRIZE aimed to create avatar systems that can transport\nhuman presence to remote locations in real time. The participants of this\nmulti-year competition developed robotic systems that allow operators to see,\nhear, and interact with a remote environment in a way that feels as if they are\ntruly there. On the other hand, people in the remote environment were given the\nimpression that the operator was present inside the avatar robot. At the\ncompetition finals, held in November 2022 in Long Beach, CA, USA, the avatar\nsystems were evaluated on their support for remotely interacting with humans,\nexploring new environments, and employing specialized skills. This article\ndescribes the competition stages with tasks and evaluation procedures, reports\nthe results, presents the winning teams' approaches, and discusses lessons\nlearned.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:57:09 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Behnke","Sven",""],["Adams","Julie A.",""],["Locke","David",""]]}
{"id":"2308.07879","submitter":"Deepankur Thureja","authors":"Deepankur Thureja","title":"Electrically tunable quantum confinement of neutral excitons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Confining particles to distances below their de Broglie wavelength\ndiscretizes their motional state. This fundamental effect is observed in many\nphysical systems, ranging from electrons confined in atoms or quantum dots to\nultracold atoms trapped in optical tweezers. In solid-state photonics, a\nlong-standing goal has been to achieve fully tunable quantum confinement of\noptically active electron-hole pairs known as excitons. To confine excitons,\nexisting approaches mainly rely on material modulation, which suffers from poor\ncontrol over the energy and position of trapping potentials. This has severely\nimpeded the engineering of large-scale quantum photonic systems. In this\ndoctoral thesis, we demonstrate electrically controlled quantum confinement of\nneutral excitons in two-dimensional semiconductors. By combining gate-defined\nin-plane electric fields with inherent interactions between excitons and free\ncharges in a lateral p-i-n junction, we achieve tunable exciton confinement\nlengths reaching values below 10 nm. Quantization of excitonic motion manifests\nin the measured optical response as a ladder of discrete voltage-dependent\nstates below the continuum. Moreover, we observe that our confining potentials\nlead to a strong modification of the relative wave function of excitons. We\nfurther highlight the versatility of our approach by extending our confinement\nscheme to create quantum-dot-like zero-dimensional structures with a fully\ntunable confinement length. Our technique provides an experimental route\ntowards achieving polariton blockade and creating scalable arrays of identical\nsingle-photon sources, which has wide-ranging implications for realizing\nstrongly correlated photonic phases and on-chip optical quantum information\nprocessors.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:57:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Thureja","Deepankur",""]]}
{"id":"2308.07880","submitter":"Vincenzo Nicosia","authors":"Silvia Rognone, Vincenzo Nicosia","title":"Clusters in randomly-coloured spatial networks","comments":"21 pages, 11 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":"  The behaviour and functioning of a variety of complex physical and biological\nsystems depend on the spatial organisation of their constituent units, and on\nthe presence and formation of clusters of functionally similar or related\nindividuals. Here we study the properties of clusters in spatially-embedded\nnetworks where nodes are coloured according to a given colouring process. This\ncharacterisation will allow us to use spatial networks with uniformly-coloured\nnodes as a null-model against which the importance, relevance, and significance\nof clusters of related units in a given real-world system can be assessed. We\nshow that even a uniform and uncorrelated random colouring process can generate\ncoloured clusters of substantial size and interesting shapes, which can be\ndistinguished by using some simple dynamical measures, like the average time\nneeded for a random walk to escape from the cluster. We provide a mean-field\napproach to study the properties of those clusters in large two-dimensional\nlattices, and we show that the analytical treatment agrees very well with the\nnumerical results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:00:27 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Rognone","Silvia",""],["Nicosia","Vincenzo",""]]}
{"id":"2308.07881","submitter":"Eduardo Monteiro Mendon\\c{c}a","authors":"Vyacheslav Futorny and Samuel A. Lopes and Eduardo M. Mendon\\c{c}a","title":"Representations of Smith algebras which are free over the Cartan\n  subalgebra","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the category of modules over the Smith algebra which\nare free of finite rank over the unital polynomial subalgebra generated by the\nCartan element $h$ and obtain families of such simple modules of arbitrary\nrank. In the case of rank one we obtain a full description of the isomorphism\nclasses, a simplicity criterion, and an algorithm to produce all composition\nseries. We show that all such modules have finite length and describe the\ncomposition factors and their multiplicity.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:01:04 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Futorny","Vyacheslav",""],["Lopes","Samuel A.",""],["Mendon\u00e7a","Eduardo M.",""]]}
{"id":"2308.07882","submitter":"Rosa Becerra Mrs","authors":"R. L. Becerra, A. Klotz, J. L. Atteia, D. Guetta, A. M. Watson, F. De\n  Colle, C. Angulo-Valdez, N. R. Butler, S. Dichiara, N. Fraija, K.\n  Garcia-Cifuentes, A. S. Kutyrev, W. H. Lee, M. Pereyra, E. Troja","title":"Understanding the Nature of the Optical Emission in Gamma-Ray Bursts:\n  Analysis from TAROT, COATLI, and RATIR Observations","comments":"Accepted for publication in MNRAS, 13 pages and 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We collected the optical light curve data of 227 gamma-ray bursts (GRBs)\nobserved with the TAROT, COATLI, and RATIR telescopes. These consist of 133\ndetections and 94 upper limits. We constructed average light curves in the\nobserver and rest frames in both X-rays (from {\\itshape Swift}/XRT) and in the\noptical. Our analysis focused on investigating the observational and intrinsic\nproperties of GRBs. Specifically, we examined observational properties, such as\nthe optical brightness function of the GRBs at $T=1000$ seconds after the\ntrigger, as well as the temporal slope of the afterglow. We also estimated the\nredshift distribution for the GRBs within our sample. Of the 227 GRBs analysed,\nwe found that 116 had a measured redshift. Based on these data, we calculated a\nlocal rate of $\\rho_0=0.2$ Gpc$^{-3}$ yr$^{-1}$ for these events with $z<1$. To\nexplore the intrinsic properties of GRBs, we examined the average X-ray and\noptical light curves in the rest frame. We use the {\\scshape afterglowpy}\nlibrary to generate synthetic curves to constrain the parameters typical of the\nbright GRB jet, such as energy (${\\langle} {E_{0}}{\\rangle}\\sim\n10^{53.6}$~erg), opening angle (${\\langle}\\theta_\\mathrm{core}{\\rangle}\\sim\n0.2$~rad), and density (${\\langle}n_\\mathrm{0}{\\rangle}\\sim10^{-2.1}$\ncm$^{-3}$). Furthermore, we analyse microphysical parameters, including the\nfraction of thermal energy in accelerated electrons\n(${\\langle}\\epsilon_e{\\rangle}\\sim 10^{-1.37}$) and in the magnetic field\n(${\\langle}\\epsilon_B{\\rangle}\\sim10^{-2.26}$), and the power-law index of the\npopulation of non-thermal electrons (${\\langle}p{\\rangle}\\sim 2.2$).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:12:23 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 16:25:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Becerra","R. L.",""],["Klotz","A.",""],["Atteia","J. L.",""],["Guetta","D.",""],["Watson","A. M.",""],["De Colle","F.",""],["Angulo-Valdez","C.",""],["Butler","N. R.",""],["Dichiara","S.",""],["Fraija","N.",""],["Garcia-Cifuentes","K.",""],["Kutyrev","A. S.",""],["Lee","W. H.",""],["Pereyra","M.",""],["Troja","E.",""]]}
{"id":"2308.07883","submitter":"Lekang Jiang","authors":"Lekang Jiang, Caiqi Zhang, Farimah Poursafaei, Shenyang Huang","title":"Towards Temporal Edge Regression: A Case Study on Agriculture Trade\n  Between Nations","comments":"12 pages, 4 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Graph Neural Networks (GNNs) have shown promising performance in\ntasks on dynamic graphs such as node classification, link prediction and graph\nregression. However, few work has studied the temporal edge regression task\nwhich has important real-world applications. In this paper, we explore the\napplication of GNNs to edge regression tasks in both static and dynamic\nsettings, focusing on predicting food and agriculture trade values between\nnations. We introduce three simple yet strong baselines and comprehensively\nevaluate one static and three dynamic GNN models using the UN Trade dataset.\nOur experimental results reveal that the baselines exhibit remarkably strong\nperformance across various settings, highlighting the inadequacy of existing\nGNNs. We also find that TGN outperforms other GNN models, suggesting TGN is a\nmore appropriate choice for edge regression tasks. Moreover, we note that the\nproportion of negative edges in the training samples significantly affects the\ntest performance. The companion source code can be found at:\nhttps://github.com/scylj1/GNN_Edge_Regression.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:13:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jiang","Lekang",""],["Zhang","Caiqi",""],["Poursafaei","Farimah",""],["Huang","Shenyang",""]]}
{"id":"2308.07884","submitter":"Helmut Prodinger","authors":"Helmut Prodinger","title":"Grand Motzkin paths and $\\{0,1,2\\}$-trees -- a simple bijection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A well-known bijection between Motzkin paths and ordered trees with outdegree\nalways $\\le2$, is lifted to Grand Motzkin paths (the nonnegativity is dropped)\nand an ordered list of an odd number of such $\\{0,1,2\\}$ trees. This offers an\nalternative to a recent paper by Rocha and Pereira Spreafico.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:22:19 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Prodinger","Helmut",""]]}
{"id":"2308.07885","submitter":"Denis Prokopenko","authors":"Denis Prokopenko, Kerstin Hammernik, Thomas Roberts, David F A Lloyd,\n  Daniel Rueckert, Joseph V Hajnal","title":"The Challenge of Fetal Cardiac MRI Reconstruction Using Deep Learning","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":"  Dynamic free-breathing fetal cardiac MRI is one of the most challenging\nmodalities, which requires high temporal and spatial resolution to depict rapid\nchanges in a small fetal heart. The ability of deep learning methods to recover\nundersampled data could help to optimise the kt-SENSE acquisition strategy and\nimprove non-gated kt-SENSE reconstruction quality. In this work, we explore\nsupervised deep learning networks for reconstruction of kt-SENSE style acquired\ndata using an extensive in vivo dataset. Having access to fully-sampled\nlow-resolution multi-coil fetal cardiac MRI, we study the performance of the\nnetworks to recover fully-sampled data from undersampled data. We consider\nmodel architectures together with training strategies taking into account their\napplication in the real clinical setup used to collect the dataset to enable\nnetworks to recover prospectively undersampled data. We explore a set of\nmodifications to form a baseline performance evaluation for dynamic fetal\ncardiac MRI on real data. We systematically evaluate the models on\ncoil-combined data to reveal the effect of the suggested changes to the\narchitecture in the context of fetal heart properties. We show that the\nbest-performers recover a detailed depiction of the maternal anatomy on a large\nscale, but the dynamic properties of the fetal heart are under-represented.\nTraining directly on multi-coil data improves the performance of the models,\nallows their prospective application to undersampled data and makes them\noutperform CTFNet introduced for adult cardiac cine MRI. However, these models\ndeliver similar qualitative performances recovering the maternal body very well\nbut underestimating the dynamic properties of fetal heart. This dynamic feature\nof fast change of fetal heart that is highly localised suggests both more\ntargeted training and evaluation methods might be needed for fetal heart\napplication.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:22:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Prokopenko","Denis",""],["Hammernik","Kerstin",""],["Roberts","Thomas",""],["Lloyd","David F A",""],["Rueckert","Daniel",""],["Hajnal","Joseph V",""]]}
{"id":"2308.07886","submitter":"Bhaskar Dhariyal","authors":"Bhaskar Dhariyal, Thach Le Nguyen, Georgiana Ifrim","title":"Back to Basics: A Sanity Check on Modern Time Series Classification\n  Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The state-of-the-art in time series classification has come a long way, from\nthe 1NN-DTW algorithm to the ROCKET family of classifiers. However, in the\ncurrent fast-paced development of new classifiers, taking a step back and\nperforming simple baseline checks is essential. These checks are often\noverlooked, as researchers are focused on establishing new state-of-the-art\nresults, developing scalable algorithms, and making models explainable.\nNevertheless, there are many datasets that look like time series at first\nglance, but classic algorithms such as tabular methods with no time ordering\nmay perform better on such problems. For example, for spectroscopy datasets,\ntabular methods tend to significantly outperform recent time series methods. In\nthis study, we compare the performance of tabular models using classic machine\nlearning approaches (e.g., Ridge, LDA, RandomForest) with the ROCKET family of\nclassifiers (e.g., Rocket, MiniRocket, MultiRocket). Tabular models are simple\nand very efficient, while the ROCKET family of classifiers are more complex and\nhave state-of-the-art accuracy and efficiency among recent time series\nclassifiers. We find that tabular models outperform the ROCKET family of\nclassifiers on approximately 19% of univariate and 28% of multivariate datasets\nin the UCR/UEA benchmark and achieve accuracy within 10 percentage points on\nabout 50% of datasets. Our results suggest that it is important to consider\nsimple tabular models as baselines when developing time series classifiers.\nThese models are very fast, can be as effective as more complex methods and may\nbe easier to understand and deploy.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:23:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Dhariyal","Bhaskar",""],["Nguyen","Thach Le",""],["Ifrim","Georgiana",""]]}
{"id":"2308.07887","submitter":"Werner Zellinger","authors":"Duc Hoan Nguyen and Werner Zellinger and Sergei V. Pereverzyev","title":"On regularized Radon-Nikodym differentiation","comments":"arXiv admin note: text overlap with arXiv:2307.11503","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.LG cs.NA math.NA stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the problem of estimating Radon-Nikodym derivatives. This problem\nappears in various applications, such as covariate shift adaptation,\nlikelihood-ratio testing, mutual information estimation, and conditional\nprobability estimation. To address the above problem, we employ the general\nregularization scheme in reproducing kernel Hilbert spaces. The convergence\nrate of the corresponding regularized algorithm is established by taking into\naccount both the smoothness of the derivative and the capacity of the space in\nwhich it is estimated. This is done in terms of general source conditions and\nthe regularized Christoffel functions. We also find that the reconstruction of\nRadon-Nikodym derivatives at any particular point can be done with high order\nof accuracy. Our theoretical results are illustrated by numerical simulations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:27:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nguyen","Duc Hoan",""],["Zellinger","Werner",""],["Pereverzyev","Sergei V.",""]]}
{"id":"2308.07888","submitter":"Yuxuan Deng","authors":"Zhong-Chang-Fei Li, Yu-Xuan Deng, Zi-Ting Sun, Jin-Xin Hu, K. T. Law","title":"Valley-polarized Josephson Junctions as gate-tunable $0$-$\\pi$ qubit\n  platforms","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":"  Recently, gate-defined Josephson junctions based on magic-angle twisted\nbilayer graphene (MATBG) have been fabricated. In such a junction, local\nelectrostatic gating can create two superconducting regions connected by an\ninteraction-driven valley-polarized state as the weak link. Due to the\nspontaneous time-reversal and inversion symmetry breaking of the\nvalley-polarized state, novel phenomena such as the Josephson diode effect have\nbeen observed without applying external fields. Importantly, when the so-called\nnonreciprocity efficiency (which measures the sign and strength of the\nJosephson effect) changes sign, the energy-phase relation of the junction is\napproximate $F(\\phi) \\approx \\cos(2\\phi)$ where $F$ is the free energy and\n$\\phi$ is the phase difference of the two superconductors. In this work, we\nshow that such a MATBG-based Josephson junction, when shunted by a capacitor,\ncan be used to realize the long-sought-after $0$-$\\pi$ qubits which are\nprotected from local perturbation-induced decoherence. Interestingly, by\nchanging the junction parameters, transmon-like qubits with large anharmonicity\ncan also be realized. In short, by utilizing the novel interaction-driven\nvalley-polarized state in MATBG, a single gate-defined Josephson junction can\nbe used to replace complicated superconducting circuits for realizing qubits\nthat are protected from local perturbations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:27:16 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Zhong-Chang-Fei",""],["Deng","Yu-Xuan",""],["Sun","Zi-Ting",""],["Hu","Jin-Xin",""],["Law","K. T.",""]]}
{"id":"2308.07889","submitter":"Long Jin","authors":"Long Jin, Zhen Yao, Mingyang Chen, Huajun Chen, Wen Zhang","title":"A Comprehensive Study on Knowledge Graph Embedding over Relational\n  Patterns Based on Rule Learning","comments":"This paper is accepted by ISWC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge Graph Embedding (KGE) has proven to be an effective approach to\nsolving the Knowledge Graph Completion (KGC) task. Relational patterns which\nrefer to relations with specific semantics exhibiting graph patterns are an\nimportant factor in the performance of KGE models. Though KGE models'\ncapabilities are analyzed over different relational patterns in theory and a\nrough connection between better relational patterns modeling and better\nperformance of KGC has been built, a comprehensive quantitative analysis on KGE\nmodels over relational patterns remains absent so it is uncertain how the\ntheoretical support of KGE to a relational pattern contributes to the\nperformance of triples associated to such a relational pattern. To address this\nchallenge, we evaluate the performance of 7 KGE models over 4 common relational\npatterns on 2 benchmarks, then conduct an analysis in theory, entity frequency,\nand part-to-whole three aspects and get some counterintuitive conclusions.\nFinally, we introduce a training-free method Score-based Patterns Adaptation\n(SPA) to enhance KGE models' performance over various relational patterns. This\napproach is simple yet effective and can be applied to KGE models without\nadditional training. Our experimental results demonstrate that our method\ngenerally enhances performance over specific relational patterns. Our source\ncode is available from GitHub at\nhttps://github.com/zjukg/Comprehensive-Study-over-Relational-Patterns.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:30:57 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Jin","Long",""],["Yao","Zhen",""],["Chen","Mingyang",""],["Chen","Huajun",""],["Zhang","Wen",""]]}
{"id":"2308.07890","submitter":"Yiqi Zhao","authors":"Yiqi Zhao, Ziyan An, Meiyi Ma, Taylor Johnson","title":"EduSAT: A Pedagogical Tool for Theory and Applications of Boolean\n  Satisfiability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.FL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are\nwidely used in automated verification, but there is a lack of interactive tools\ndesigned for educational purposes in this field. To address this gap, we\npresent EduSAT, a pedagogical tool specifically developed to support learning\nand understanding of SAT and SMT solving. EduSAT offers implementations of key\nalgorithms such as the Davis-Putnam-Logemann-Loveland (DPLL) algorithm and the\nReduced Order Binary Decision Diagram (ROBDD) for SAT solving. Additionally,\nEduSAT provides solver abstractions for five NP-complete problems beyond SAT\nand SMT. Users can benefit from EduSAT by experimenting, analyzing, and\nvalidating their understanding of SAT and SMT solving techniques. Our tool is\naccompanied by comprehensive documentation and tutorials, extensive testing,\nand practical features such as a natural language interface and SAT and SMT\nformula generators, which also serve as a valuable opportunity for learners to\ndeepen their understanding. Our evaluation of EduSAT demonstrates its high\naccuracy, achieving 100% correctness across all the implemented SAT and SMT\nsolvers. We release EduSAT as a python package in .whl file, and the source can\nbe identified at https://github.com/zhaoy37/SAT_Solver.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:31:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhao","Yiqi",""],["An","Ziyan",""],["Ma","Meiyi",""],["Johnson","Taylor",""]]}
{"id":"2308.07891","submitter":"Yan Tai","authors":"Yan Tai, Weichen Fan, Zhao Zhang, Feng Zhu, Rui Zhao, Ziwei Liu","title":"Link-Context Learning for Multimodal LLMs","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ability to learn from context with novel concepts, and deliver\nappropriate responses are essential in human conversations. Despite current\nMultimodal Large Language Models (MLLMs) and Large Language Models (LLMs) being\ntrained on mega-scale datasets, recognizing unseen images or understanding\nnovel concepts in a training-free manner remains a challenge. In-Context\nLearning (ICL) explores training-free few-shot learning, where models are\nencouraged to ``learn to learn\" from limited tasks and generalize to unseen\ntasks. In this work, we propose link-context learning (LCL), which emphasizes\n\"reasoning from cause and effect\" to augment the learning capabilities of\nMLLMs. LCL goes beyond traditional ICL by explicitly strengthening the causal\nrelationship between the support set and the query set. By providing\ndemonstrations with causal links, LCL guides the model to discern not only the\nanalogy but also the underlying causal associations between data points, which\nempowers MLLMs to recognize unseen images and understand novel concepts more\neffectively. To facilitate the evaluation of this novel approach, we introduce\nthe ISEKAI dataset, comprising exclusively of unseen generated image-label\npairs designed for link-context learning. Extensive experiments show that our\nLCL-MLLM exhibits strong link-context learning capabilities to novel concepts\nover vanilla MLLMs. Code and data will be released at\nhttps://github.com/isekai-portal/Link-Context-Learning.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:33:24 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Tai","Yan",""],["Fan","Weichen",""],["Zhang","Zhao",""],["Zhu","Feng",""],["Zhao","Rui",""],["Liu","Ziwei",""]]}
{"id":"2308.07892","submitter":"Cisco Gooding","authors":"Cisco Gooding, Allison Sachs, Robert B. Mann, and Silke Weinfurtner","title":"Vacuum entanglement probes for ultra-cold atom systems","comments":"12 pages and 3 figures, including the Supplemental Material /\n  Appendices","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":"  This study explores the transfer of nonclassical correlations from an\nultra-cold atom system to a pair of pulsed laser beams. Through nondestructive\nlocal probe measurements, we introduce an alternative to destructive techniques\nfor mapping BEC entanglement. Operating at ultralow temperatures, the setup\nemulates a relativistic vacuum field, using lasers as Unruh-DeWitt detectors\nfor phonons. The vacuum holds intrinsic entanglement, transferable to distant\nprobes briefly interacting with it - a phenomenon termed ``entanglement\nharvesting''. Our study accomplishes two primary objectives: first,\nestablishing a mathematical equivalence between a pair of pulsed laser probes\ninteracting with an effective relativistic field and the entanglement\nharvesting protocol; and second, to closely examine the potential and\npersisting obstacles for realising this protocol in an ultra-cold atom\nexperiment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:34:08 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gooding","Cisco",""],["Sachs","Allison",""],["Mann","Robert B.",""],["Weinfurtner","Silke",""]]}
{"id":"2308.07893","submitter":"Jiahao Wang","authors":"Jiahao Wang, Guo Chen, Yifei Huang, Limin Wang, Tong Lu","title":"Memory-and-Anticipation Transformer for Online Action Understanding","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":"  Most existing forecasting systems are memory-based methods, which attempt to\nmimic human forecasting ability by employing various memory mechanisms and have\nprogressed in temporal modeling for memory dependency. Nevertheless, an obvious\nweakness of this paradigm is that it can only model limited historical\ndependence and can not transcend the past. In this paper, we rethink the\ntemporal dependence of event evolution and propose a novel\nmemory-anticipation-based paradigm to model an entire temporal structure,\nincluding the past, present, and future. Based on this idea, we present\nMemory-and-Anticipation Transformer (MAT), a memory-anticipation-based\napproach, to address the online action detection and anticipation tasks. In\naddition, owing to the inherent superiority of MAT, it can process online\naction detection and anticipation tasks in a unified manner. The proposed MAT\nmodel is tested on four challenging benchmarks TVSeries, THUMOS'14, HDD, and\nEPIC-Kitchens-100, for online action detection and anticipation tasks, and it\nsignificantly outperforms all existing methods. Code is available at\nhttps://github.com/Echo0125/Memory-and-Anticipation-Transformer.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:34:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Jiahao",""],["Chen","Guo",""],["Huang","Yifei",""],["Wang","Limin",""],["Lu","Tong",""]]}
{"id":"2308.07894","submitter":"Sergey E Stepanov","authors":"S.E. Stepanov","title":"Relationship between sectional curvature and null spaces of\n  Lichnerowicz-type Laplacians and their smallest eigenvalues","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The first variant of this article contained a fatal error. Therefore, we\npublish second version our paper. In the present paper, we prove that the\ncurvature operator of the second kind of a Riemannian manifold is strictly\npositive if its sectional curvature is strictly positive and the Ricci\ncurvature suitably pinched. In addition, we prove several vanishing theorems\nfor null spaces of the Lichnerowicz, Sampson, and Hodge-de Rham Laplacians and\nfind estimates for their lowest eigenvalues on compact (without boundary)\nRiemannian manifolds with sectional pinched curvature.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:35:41 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 18:28:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Stepanov","S. E.",""]]}
{"id":"2308.07895","submitter":"Carla Floricel","authors":"Carla Floricel, Andrew Wentzel, Abdallah Mohamed, C.David Fuller,\n  Guadalupe Canahuate, and G. Elisabeta Marai","title":"Roses Have Thorns: Understanding the Downside of Oncological Care\n  Delivery Through Visual Analytics and Sequential Rule Mining","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Personalized head and neck cancer therapeutics have greatly improved survival\nrates for patients, but are often leading to understudied long-lasting symptoms\nwhich affect quality of life. Sequential rule mining (SRM) is a promising\nunsupervised machine learning method for predicting longitudinal patterns in\ntemporal data which, however, can output many repetitive patterns that are\ndifficult to interpret without the assistance of visual analytics. We present a\ndata-driven, human-machine analysis visual system developed in collaboration\nwith SRM model builders in cancer symptom research, which facilitates\nmechanistic knowledge discovery in large scale, multivariate cohort symptom\ndata. Our system supports multivariate predictive modeling of post-treatment\nsymptoms based on during-treatment symptoms. It supports this goal through an\nSRM, clustering, and aggregation back end, and a custom front end to help\ndevelop and tune the predictive models. The system also explains the resulting\npredictions in the context of therapeutic decisions typical in personalized\ncare delivery. We evaluate the resulting models and system with an\ninterdisciplinary group of modelers and head and neck oncology researchers. The\nresults demonstrate that our system effectively supports clinical and symptom\nresearch.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:36:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Floricel","Carla",""],["Wentzel","Andrew",""],["Mohamed","Abdallah",""],["Fuller","C. David",""],["Canahuate","Guadalupe",""],["Marai","G. Elisabeta",""]]}
{"id":"2308.07896","submitter":"Shigui Li","authors":"Shigui Li, Wei Chen, Delu Zeng","title":"SciRE-Solver: Efficient Sampling of Diffusion Probabilistic Models by\n  Score-integrand Solver with Recursive Derivative Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.DS stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion probabilistic models (DPMs) are a powerful class of generative\nmodels known for their ability to generate high-fidelity image samples. A major\nchallenge in the implementation of DPMs is the slow sampling process. In this\nwork, we bring a high-efficiency sampler for DPMs. Specifically, we propose a\nscore-based exact solution paradigm for the diffusion ODEs corresponding to the\nsampling process of DPMs, which introduces a new perspective on developing\nnumerical algorithms for solving diffusion ODEs. To achieve an efficient\nsampler, we propose a recursive derivative estimation (RDE) method to reduce\nthe estimation error. With our proposed solution paradigm and RDE method, we\npropose the score-integrand solver with the convergence order guarantee as\nefficient solver (SciRE-Solver) for solving diffusion ODEs. The SciRE-Solver\nattains state-of-the-art (SOTA) sampling performance with a limited number of\nscore function evaluations (NFE) on both discrete-time and continuous-time DPMs\nin comparison to existing training-free sampling algorithms. Such as, we\nachieve $3.48$ FID with $12$ NFE and $2.42$ FID with $20$ NFE for\ncontinuous-time DPMs on CIFAR10, respectively. Different from other samplers,\nSciRE-Solver has the promising potential to surpass the FIDs achieved in the\noriginal papers of some pre-trained models with a small NFEs. For example, we\nreach SOTA value of $2.40$ FID with $100$ NFE for continuous-time DPM and of\n$3.15$ FID with $84$ NFE for discrete-time DPM on CIFAR-10, as well as of\n$2.17$ ($2.02$) FID with $18$ ($50$) NFE for discrete-time DPM on CelebA\n64$\\times$64.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:37:44 GMT"},{"version":"v2","created":"Wed, 16 Aug 2023 08:00:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Shigui",""],["Chen","Wei",""],["Zeng","Delu",""]]}
{"id":"2308.07897","submitter":"Ming-Chiang Chang","authors":"Ming-Chiang Chang, Sebastian Ament, Maximilian Amsler, Duncan R.\n  Sutherland, Lan Zhou, John M. Gregoire, Carla P. Gomes, R. Bruce van Dover,\n  Michael O. Thompson","title":"Probabilistic Phase Labeling and Lattice Refinement for Autonomous\n  Material Research","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  X-ray diffraction (XRD) is an essential technique to determine a material's\ncrystal structure in high-throughput experimentation, and has recently been\nincorporated in artificially intelligent agents in autonomous scientific\ndiscovery processes. However, rapid, automated and reliable analysis method of\nXRD data matching the incoming data rate remains a major challenge. To address\nthese issues, we present CrystalShift, an efficient algorithm for probabilistic\nXRD phase labeling that employs symmetry-constrained pseudo-refinement\noptimization, best-first tree search, and Bayesian model comparison to estimate\nprobabilities for phase combinations without requiring phase space information\nor training. We demonstrate that CrystalShift provides robust probability\nestimates, outperforming existing methods on synthetic and experimental\ndatasets, and can be readily integrated into high-throughput experimental\nworkflows. In addition to efficient phase-mapping, CrystalShift offers\nquantitative insights into materials' structural parameters, which facilitate\nboth expert evaluation and AI-based modeling of the phase space, ultimately\naccelerating materials identification and discovery.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:38:38 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Chang","Ming-Chiang",""],["Ament","Sebastian",""],["Amsler","Maximilian",""],["Sutherland","Duncan R.",""],["Zhou","Lan",""],["Gregoire","John M.",""],["Gomes","Carla P.",""],["van Dover","R. Bruce",""],["Thompson","Michael O.",""]]}
{"id":"2308.07898","submitter":"Julio Silva-Rodr\\'iguez","authors":"Julio Silva-Rodriguez, Hadi Chakor, Riadh Kobbi, Jose Dolz and Ismail\n  Ben Ayed","title":"A Foundation LAnguage-Image model of the Retina (FLAIR): Encoding expert\n  knowledge in text supervision","comments":"The pre-trained model is available at:\n  https://github.com/jusiro/FLAIR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Foundation vision-language models are currently transforming computer vision,\nand are on the rise in medical imaging fueled by their very promising\ngeneralization capabilities. However, the initial attempts to transfer this new\nparadigm to medical imaging have shown less impressive performances than those\nobserved in other domains, due to the significant domain shift and the complex,\nexpert domain knowledge inherent to medical-imaging tasks. Motivated by the\nneed for domain-expert foundation models, we present FLAIR, a pre-trained\nvision-language model for universal retinal fundus image understanding. To this\nend, we compiled 37 open-access, mostly categorical fundus imaging datasets\nfrom various sources, with up to 97 different target conditions and 284,660\nimages. We integrate the expert's domain knowledge in the form of descriptive\ntextual prompts, during both pre-training and zero-shot inference, enhancing\nthe less-informative categorical supervision of the data. Such a textual\nexpert's knowledge, which we compiled from the relevant clinical literature and\ncommunity standards, describes the fine-grained features of the pathologies as\nwell as the hierarchies and dependencies between them. We report comprehensive\nevaluations, which illustrate the benefit of integrating expert knowledge and\nthe strong generalization capabilities of FLAIR under difficult scenarios with\ndomain shifts or unseen categories. When adapted with a lightweight linear\nprobe, FLAIR outperforms fully-trained, dataset-focused models, more so in the\nfew-shot regimes. Interestingly, FLAIR outperforms by a large margin more\ngeneralist, larger-scale image-language models, which emphasizes the potential\nof embedding experts' domain knowledge and the limitations of generalist models\nin medical imaging.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:39:52 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Silva-Rodriguez","Julio",""],["Chakor","Hadi",""],["Kobbi","Riadh",""],["Dolz","Jose",""],["Ayed","Ismail Ben",""]]}
{"id":"2308.07899","submitter":"Philip John Gorinski","authors":"Mojtaba Valizadeh, Philip John Gorinski, Ignacio Iacobacci, Martin\n  Berger","title":"The Regular Expression Inference Challenge","comments":"7 pages, 3 pages appendix, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose \\emph{regular expression inference (REI)} as a challenge for\ncode/language modelling, and the wider machine learning community. REI is a\nsupervised machine learning (ML) and program synthesis task, and poses the\nproblem of finding minimal regular expressions from examples: Given two finite\nsets of strings $P$ and $N$ and a cost function $\\text{cost}(\\cdot)$, the task\nis to generate an expression $r$ that accepts all strings in $P$ and rejects\nall strings in $N$, while no other such expression $r'$ exists with\n$\\text{cost}(r')<\\text{cost}(r)$.\n  REI has advantages as a challenge problem: (i) regular expressions are\nwell-known, widely used, and a natural idealisation of code; (ii) REI's\nasymptotic worst-case complexity is well understood; (iii) REI has a small\nnumber of easy to understand parameters (e.g.~$P$ or $N$ cardinality, string\nlengths of examples, or the cost function); this lets us easily finetune\nREI-hardness; (iv) REI is an unsolved problem for deep learning based ML.\n  Recently, an REI solver was implemented on GPUs, using program synthesis\ntechniques. This enabled, for the first time, fast generation of minimal\nexpressions for complex REI instances. Building on this advance, we generate\nand publish the first large-scale datasets for REI, and devise and evaluate\nseveral initial heuristic and machine learning baselines.\n  We invite the community to participate and explore ML methods that learn to\nsolve REI problems. We believe that progress in REI directly translates to\ncode/language modelling.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:40:10 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Valizadeh","Mojtaba",""],["Gorinski","Philip John",""],["Iacobacci","Ignacio",""],["Berger","Martin",""]]}
{"id":"2308.07900","submitter":"Yo Machida","authors":"Yuna Nakajima, Yuichi Akahama, Yo Machida","title":"Thermoelectric response across the semiconductor-semimetal transition in\n  black phosphorus","comments":"13 pages, 16 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":"  In spite of intensive studies on thermoelectricity in metals, little is known\nabout thermoelectric response in semiconductors at low temperature. An even\nmore fascinating and unanswered question is what happens to the Seebeck\ncoefficient when the semiconductor turns to a metal. By precisely tuning the\nground state of black phosphorus with pressure from the semiconducting to\nsemimetallic state, we track a systematic evolution of the Seebeck coefficient.\nThanks to a manifest correlation between the Seebeck coefficient and\nresistivity, the Seebeck response in each conduction regime, i.e., intrinsic,\nsaturation, extrinsic, and variable range hopping (VRH) regimes, is identified.\nIn the former two regimes, the Seebeck coefficient behaves in accordance with\nthe present theories, whereas in the later two regimes available theories do\nnot give a satisfactory account for its response. However, by eliminating the\nextrinsic sample dependence in the resistivity $\\rho$ and Seebeck coefficient\n$S$, the Peltier conductivity $\\alpha=S/\\rho$ allows to unveil the intrinsic\nthermoelectric response, revealing vanishing fate for $\\alpha$ in the VRH\nregime. The emerged ionized impurity scattering on entry to the semimetallic\nstate is easily surpassed by electron-electron scattering due to squeezing of\nscreening length accompanied by an increase of carrier density with pressure.\nIn the low temperature limit, a small number of carriers enhances a prefactor\nof $T$-linear Seebeck coefficient as large as what is observed in prototypical\nsemimetals. A crucial but largely ignored role of carrier scattering in\ndetermining the magnitude and sign of the Seebeck coefficient is indicated by\nthe observation that a sign reversal of the $T$-linear prefactor is concomitant\nwith a change in dominant scattering mechanism for carriers.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:40:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Nakajima","Yuna",""],["Akahama","Yuichi",""],["Machida","Yo",""]]}
{"id":"2308.07901","submitter":"Kanishka Perera","authors":"Kanishka Perera","title":"Abstract multiplicity theorems and applications to critical growth\n  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 prove some abstract multiplicity theorems that can be used to obtain\nmultiple nontrivial solutions of critical growth $p$-Laplacian and\n$(p,q)$-Laplacian type problems. We show that the problems considered here have\narbitrarily many solutions for all sufficiently large values of a certain\nparameter $\\lambda > 0$. In particular, the number of solutions goes to\ninfinity as $\\lambda \\to \\infty$. Moreover, we give an explicit lower bound on\n$\\lambda$ in order to have a given number of solutions. This lower bound is in\nterms of a sequence of eigenvalues constructed using the ${\\mathbb\nZ}_2$-cohomological index. This is a consequence of the fact that our abstract\nmultiplicity results make essential use of the piercing property of the\ncohomological index, which is not shared by the genus. Our result for the\n$p$-Laplacian is new even in the semilinear case $p = 2$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:40:20 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 00:11:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Perera","Kanishka",""]]}
{"id":"2308.07902","submitter":"Ziyu Zhuang","authors":"Ziyu Zhuang, Qiguang Chen, Longxuan Ma, Mingda Li, Yi Han, Yushan\n  Qian, Haopeng Bai, Zixian Feng, Weinan Zhang, Ting Liu","title":"Through the Lens of Core Competency: Survey on Evaluation of Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  From pre-trained language model (PLM) to large language model (LLM), the\nfield of natural language processing (NLP) has witnessed steep performance\ngains and wide practical uses. The evaluation of a research field guides its\ndirection of improvement. However, LLMs are extremely hard to thoroughly\nevaluate for two reasons. First of all, traditional NLP tasks become inadequate\ndue to the excellent performance of LLM. Secondly, existing evaluation tasks\nare difficult to keep up with the wide range of applications in real-world\nscenarios. To tackle these problems, existing works proposed various benchmarks\nto better evaluate LLMs. To clarify the numerous evaluation tasks in both\nacademia and industry, we investigate multiple papers concerning LLM\nevaluations. We summarize 4 core competencies of LLM, including reasoning,\nknowledge, reliability, and safety. For every competency, we introduce its\ndefinition, corresponding benchmarks, and metrics. Under this competency\narchitecture, similar tasks are combined to reflect corresponding ability,\nwhile new tasks can also be easily added into the system. Finally, we give our\nsuggestions on the future direction of LLM's evaluation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:40:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhuang","Ziyu",""],["Chen","Qiguang",""],["Ma","Longxuan",""],["Li","Mingda",""],["Han","Yi",""],["Qian","Yushan",""],["Bai","Haopeng",""],["Feng","Zixian",""],["Zhang","Weinan",""],["Liu","Ting",""]]}
{"id":"2308.07903","submitter":"Zhen Xu","authors":"Zhen Xu, Sida Peng, Chen Geng, Linzhan Mou, Zihan Yan, Jiaming Sun,\n  Hujun Bao, Xiaowei Zhou","title":"Relightable and Animatable Neural Avatar from Sparse-View Video","comments":"Project page: https://zju3dv.github.io/relightable_avatar","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper tackles the challenge of creating relightable and animatable\nneural avatars from sparse-view (or even monocular) videos of dynamic humans\nunder unknown illumination. Compared to studio environments, this setting is\nmore practical and accessible but poses an extremely challenging ill-posed\nproblem. Previous neural human reconstruction methods are able to reconstruct\nanimatable avatars from sparse views using deformed Signed Distance Fields\n(SDF) but cannot recover material parameters for relighting. While\ndifferentiable inverse rendering-based methods have succeeded in material\nrecovery of static objects, it is not straightforward to extend them to dynamic\nhumans as it is computationally intensive to compute pixel-surface intersection\nand light visibility on deformed SDFs for inverse rendering. To solve this\nchallenge, we propose a Hierarchical Distance Query (HDQ) algorithm to\napproximate the world space distances under arbitrary human poses.\nSpecifically, we estimate coarse distances based on a parametric human model\nand compute fine distances by exploiting the local deformation invariance of\nSDF. Based on the HDQ algorithm, we leverage sphere tracing to efficiently\nestimate the surface intersection and light visibility. This allows us to\ndevelop the first system to recover animatable and relightable neural avatars\nfrom sparse view (or monocular) inputs. Experiments demonstrate that our\napproach is able to produce superior results compared to state-of-the-art\nmethods. Our code will be released for reproducibility.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:42:39 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 08:26:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Zhen",""],["Peng","Sida",""],["Geng","Chen",""],["Mou","Linzhan",""],["Yan","Zihan",""],["Sun","Jiaming",""],["Bao","Hujun",""],["Zhou","Xiaowei",""]]}
{"id":"2308.07904","submitter":"Jonathan Smith","authors":"Jonathan M. Smith","title":"Automorphisms of quartic del Pezzo surfaces in characteristic zero","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For each field $k$ of characteristic zero, we classify which groups act by\nautomorphisms on a quartic del Pezzo surface over $k$. We also determine which\ngroups act on $k$-rational, stably $k$-rational, or $k$-unirational quartic del\nPezzo surfaces. For each group $G$ that is realized over $k$, we exhibit\nexplicit equations for a quartic del Pezzo surface $X$ in $\\mathbb{P}^4_k$ such\nthat $G$ acts by automorphisms on $X$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:43:54 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Smith","Jonathan M.",""]]}
{"id":"2308.07905","submitter":"Sahan Liyanaarachchi","authors":"Sahan Liyanaarachchi and Sennur Ulukus","title":"The Role of Early Sampling in Age of Information Minimization in the\n  Presence of ACK Delays","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI cs.SY eess.SP eess.SY math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the structure of the optimal sampling policy to minimize the average\nage of information when the channel state (i.e., busy or idle) is not\nimmediately perceived by the transmitter upon the delivery of a sample due to\nrandom delays in the feedback (ACK) channel. In this setting, we show that it\nis not always optimal to wait for ACKs before sampling, and thus, early\nsampling before the arrival of an ACK may be optimal. We show that, under\ncertain conditions on the distribution of the ACK delays, the optimal policy is\na mixture of two threshold policies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:45:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Liyanaarachchi","Sahan",""],["Ulukus","Sennur",""]]}
{"id":"2308.07906","submitter":"Abhishek Ghosh","authors":"Abhishek Ghosh, Chandan Kumar Vishwakarma, Prashant Bisht, Narinder\n  Kaur, Mujeeb Ahmad, Bodh Raj Mehta","title":"Modulating thermoelectric properties in oxygen-passivated Sb2Te3 thin\n  film through grain boundary engineering","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":"  The present study demonstrates the effectiveness of incorporating oxygen\natoms into the Sb2Te3 thin film, leading to an improved power factor and\nreduction in thermal conductivity. Based on the experimental evidence, it can\nbe inferred that oxygen-related impurities preferentially wet the grain\nboundary (GB) and introduce a double Schottky barrier at the GB interface,\npromoting energy-dependent carrier scattering, ultimately leading to a rise in\nthe Seebeck coefficient. Additionally, the introduction of chemisorbed oxygen\ncreates a high mobility state within the valence band of Sb2Te3, as\ncorroborated by theoretical calculations, resulting in a significantly\nincreased electrical mobility. These factors collectively contribute to\nimproved thermoelectric performance. A set of Scanning probe (SPM) techniques\nis used to experimentally confirm the alteration in charge transport resulting\nfrom the oxygen-passivated grain boundary. Additionally, Scanning Thermal\nMicroscopy (SThM) is employed to observe the spatial variations of thermal\nconductivity at the nanoscale regime. This study presents a comprehensive\nmicroscopic investigation of the impact of oxygen on the phonon and charge\ncarrier transport characteristics of Sb2Te3 thermoelectric materials and\nindicates that incorporating oxygen may represent a feasible approach to\nimprove the thermoelectric efficiency of these materials.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:48:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ghosh","Abhishek",""],["Vishwakarma","Chandan Kumar",""],["Bisht","Prashant",""],["Kaur","Narinder",""],["Ahmad","Mujeeb",""],["Mehta","Bodh Raj",""]]}
{"id":"2308.07907","submitter":"Ehsan Hatefi","authors":"Armin Hatefi, Ehsan Hatefi","title":"Sequential Monte Carlo with Cross-validated Neural Networks for\n  Complexity of Hyperbolic Black Hole Solutions in 4D","comments":"V1, 23 pages and 10 figures, Latex file","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc physics.comp-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the self-similar solutions of the\nEinstein-axion-dilaton configuration from type IIB string theory and the global\nSL(2,R) symmetry. We consider the Continuous Self Similarity (CSS), where the\nscale transformation is controlled by an SL(2, R) boost or hyperbolic\ntranslation. The solutions stay invariant under the combination of space-time\ndilation with internal SL(2,R) transformations. We develop a new formalism\nbased on Sequential Monte Carlo (SMC) and artificial neural networks (NNs) to\nestimate the self-similar solutions to the equations of motion in the\nhyperbolic class in four dimensions. Due to the complex and highly nonlinear\npatterns, researchers typically have to use various constraints and numerical\napproximation methods to estimate the equations of motion; thus, they have to\noverlook the measurement errors in parameter estimation. Through a Bayesian\nframework, we incorporate measurement errors into our models to find the\nsolutions to the hyperbolic equations of motion. It is well known that the\nhyperbolic class suffers from multiple solutions where the critical collapse\nfunctions have overlap domains for these solutions. To deal with this\ncomplexity, for the first time in literature on the axion-dilaton system, we\npropose the SMC approach to obtain the multi-modal posterior distributions.\nThrough a probabilistic perspective, we confirm the deterministic $\\alpha$ and\n$\\beta$ solutions available in the literature and determine all possible\nsolutions that may occur due to measurement errors. We finally proposed the\npenalized Leave-One-Out Cross-validation (LOOCV) to combine the Bayesian\nNN-based estimates optimally. The approach enables us to determine the optimum\nweights while dealing with the co-linearity issue in the NN-based estimates and\nbetter predict the critical functions corresponding to multiple solutions of\nthe equations of motion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:48:35 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Hatefi","Armin",""],["Hatefi","Ehsan",""]]}
{"id":"2308.07908","submitter":"Xinwei Li","authors":"Xinwei Li, Yijia Zhou, Hao Zhang","title":"Manipulating Atom-Cavity Interactions with Configurable Atomic Chains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate a ring cavity comprising two degenerate counter-propagating\nmodes coupled to a one-dimensional atomic chain, leading to bidirectional light\nscattering. The spatial configuration of the atomic chain, described by a\nstructure factor, plays a crucial role in manipulation of the atom-cavity\ninteractions and formation of the collective excitation modes. Remarkably, we\nobserve that a cavity dark mode is induced when the atomic spacing is an\ninteger multiple of half-wavelength. The nodes of this standing-wave dark mode\nalign precisely with the atomic positions, enabling intracavity field\nconversion without free space scattering. By adjusting the configuration of the\natomic chain, we realize optical mode conversion with almost no photon loss and\na broad tuning range, making it suitable for various practical applications in\nquantum technologies.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:50:40 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Li","Xinwei",""],["Zhou","Yijia",""],["Zhang","Hao",""]]}
{"id":"2308.07909","submitter":"Shao-Jiang Wang","authors":"Shao-Jiang Wang","title":"The doomsday of black hole evaporation","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By assuming simultaneously the unitarity of the Hawking evaporation and the\nuniversality of Bekenstein entropy bound as well as the validity of cosmic\ncensorship conjecture, we have found that the black hole evaporation rate could\nevolve from the usual inverse square law in black hole mass into a constant\nevaporation rate near the end of the Hawking evaporation before quantum gravity\ncould come into play, inferring a slightly longer lifetime for lighter black\nholes.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:51:42 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Wang","Shao-Jiang",""]]}
{"id":"2308.07910","submitter":"Alice Booth","authors":"Alice S. Booth, Charles J. Law, Milou Temmink, Margot Leemker and\n  Enrique Macias","title":"Tracing snowlines and C/O ratio in a planet-hosting disk: ALMA molecular\n  line observations towards the HD169142 disk","comments":"Accepted A&A 13th August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The composition of a forming planet is set by the material it accretes from\nits parent protoplanetary disk. Therefore, it is crucial to map the chemical\nmake-up of the gas in disks to understand the chemical environment of planet\nformation. This paper presents molecular line observations taken with the\nAtacama Large Millimeter/submillimeter Array of the planet-hosting disk around\nthe young star HD 169142. We detect N2H+, CH3OH, [CI], DCN, CS, C34S, 13CS,\nH2CS, H2CO, HC3N and c-C3H2 in this system for the first time. Combining these\ndata with the recent detection of SO and previously published DCO+ data, we\nestimate the location of H2O and CO snowlines and investigate radial variations\nin the gas phase C/O ratio. We find that the HD 169142 disk has a relatively\nlow N2H+ flux compared to the disks around Herbig stars HD 163296 and MWC 480\nindicating less CO freeze-out and place the CO snowline beyond the millimetre\ndisk at ~150 au. The detection of CH3OH from the inner disk is consistent with\nthe H2O snowline being located at the edge of the central dust cavity at ~20\nau. The radially varying CS/SO ratio across the proposed H2O snowline location\nis consistent with this interpretation. Additionally, the detection of CH3OH in\nsuch a warm disk adds to the growing evidence supporting the inheritance of\ncomplex ices in disks from the earlier, colder stages of star formation.\nFinally, we propose that the giant HD 169142 b located at 37 au is forming\nbetween the CO2 and H2O snowlines where the local elemental make of the gas is\nexpected to have C/O=1.0.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:51:51 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Booth","Alice S.",""],["Law","Charles J.",""],["Temmink","Milou",""],["Leemker","Margot",""],["Macias","Enrique",""]]}
{"id":"2308.07911","submitter":"Jos\\'e Luis Gonz\\'alez","authors":"Patricio Gallardo, Javier Gonz\\'alez-Anaya, Jos\\'e Luis Gonz\\'alez and\n  Evangelos Routis","title":"Higher-dimensional Losev-Manin spaces and their geometry","comments":"31 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The classical Losev-Manin space can be interpreted as a toric\ncompactification of the moduli space of $n$ points in the affine line modulo\ntranslation and scaling. Motivated by this, we study its higher-dimensional\ntoric counterparts, which compactify the moduli space of $n$ distinct labeled\npoints in affine space modulo translation and scaling. We show that these\nmoduli spaces are a fibration over a product of projective spaces -- with\nfibers isomorphic to the Losev-Manin space -- and that they are isomorphic to\nthe normalization of a Chow quotient. Moreover, we present a criterion to\ndecide whether the blow-up of a toric variety along the closure of a subtorus\nis a Mori dream space. As an application, we demonstrate that a related\ngeneralization of the moduli space of pointed rational curves proposed by Chen,\nGibney, and Krashen is not a Mori dream space when the number of points is at\nleast nine, regardless of the dimension.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:52:02 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Gallardo","Patricio",""],["Gonz\u00e1lez-Anaya","Javier",""],["Gonz\u00e1lez","Jos\u00e9 Luis",""],["Routis","Evangelos",""]]}
{"id":"2308.07912","submitter":"Nilanjandev Bhaumik","authors":"Nilanjandev Bhaumik, Rajeev Kumar Jain and Marek Lewicki","title":"Ultra-low mass PBHs in the early universe can explain the PTA signal","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pulsar Timing Array collaborations have recently announced the discovery of a\nstochastic gravitational wave background (SGWB) at nanoherz frequencies. We\nanalyse the GW signals from the domination of ultra-low mass primordial black\nholes (PBHs) in the early universe and show that they can explain this recent\ndiscovery. This scenario requires a relatively broad peak in the power spectrum\nof scalar perturbations from inflation with a spectral index in a narrow range\nof $1.45$ to $1.6$. The resulting PBH population would have mass around\n$10^{8}$g, and the initial abundance $\\beta_f$ lies between $10^{-10}$ and\n$10^{-9}$. We find that this explanation is preferred by the data over the\ngeneric model, assuming supermassive BHs as the source. These very light PBHs\nwould decay before Big Bang Nucleosynthesis (BBN); however, upcoming\nthird-generation terrestrial laser interferometers would be able to test the\nmodel by observing the GW spectrum produced during the formation of the PBHs.\nAlso, the scalar power spectra associated with our scenario will be within the\nreach of PIXIE probing CMB spectral distortions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:53:34 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bhaumik","Nilanjandev",""],["Jain","Rajeev Kumar",""],["Lewicki","Marek",""]]}
{"id":"2308.07913","submitter":"Sean Ridout","authors":"Sean A. Ridout, Indrajit Tah, Andrea J. Liu","title":"Building a \"trap model\" of glassy dynamics from a local structural\n  predictor of rearrangements","comments":"7 pages, 5 figures. Supplementary material: 3 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":"  Here we introduce a variation of the trap model of glasses based on softness,\na local structural variable identified by machine learning, in supercooled\nliquids. Softness is a particle-based quantity that reflects the local\nstructural environment of a particle and characterizes the energy barrier for\nthe particle to rearrange. As in the trap model, we treat each particle's\nsoftness, and hence energy barrier, as evolving independently. We show that\nsuch a model reproduces many qualitative features of softness, and therefore\nmakes qualitatively reasonable predictions of behaviors such as the dependence\nof fragility on density in a model supercooled liquid. We also show failures of\nthis simple model, indicating features of the dynamics of softness that may\nonly be explained by correlations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:54:30 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ridout","Sean A.",""],["Tah","Indrajit",""],["Liu","Andrea J.",""]]}
{"id":"2308.07914","submitter":"Adam Shaw","authors":"Adam L. Shaw, Zhuo Chen, Joonhee Choi, Daniel K. Mark, Pascal Scholl,\n  Ran Finkelstein, Andreas Elben, Soonwon Choi, Manuel Endres","title":"Benchmarking highly entangled states on a 60-atom analog quantum\n  simulator","comments":"ALS, ZC, and JC contributed equally","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum systems have entered a competitive regime where classical computers\nmust make approximations to represent highly entangled quantum states. However,\nin this beyond-classically-exact regime, fidelity comparisons between quantum\nand classical systems have so far been limited to digital quantum devices, and\nit remains unsolved how to estimate the actual entanglement content of\nexperiments. Here we perform fidelity benchmarking and mixed-state entanglement\nestimation with a 60-atom analog Rydberg quantum simulator, reaching a high\nentanglement entropy regime where exact classical simulation becomes\nimpractical. Our benchmarking protocol involves extrapolation from comparisons\nagainst many approximate classical algorithms with varying entanglement limits.\nWe then develop and demonstrate an estimator of the experimental mixed-state\nentanglement, finding our experiment is competitive with state-of-the-art\ndigital quantum devices performing random circuit evolution. Finally, we\ncompare the experimental fidelity against that achieved by various approximate\nclassical algorithms, and find that only one, which we introduce here, is able\nto keep pace with the experiment on the classical hardware we employ. Our\nresults enable a new paradigm for evaluating the performance of both analog and\ndigital quantum devices in the beyond-classically-exact regime, and highlight\nthe evolving divide between quantum and classical systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:54:31 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Shaw","Adam L.",""],["Chen","Zhuo",""],["Choi","Joonhee",""],["Mark","Daniel K.",""],["Scholl","Pascal",""],["Finkelstein","Ran",""],["Elben","Andreas",""],["Choi","Soonwon",""],["Endres","Manuel",""]]}
{"id":"2308.07915","submitter":"Dmitri Maslov","authors":"Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov,\n  Patrick Rall, and Theodore J. Yoder","title":"High-threshold and low-overhead fault-tolerant quantum memory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum error correction becomes a practical possibility only if the physical\nerror rate is below a threshold value that depends on a particular quantum\ncode, syndrome measurement circuit, and a decoding algorithm. Here we present\nan end-to-end quantum error correction protocol that implements fault-tolerant\nmemory based on a family of LDPC codes with a high encoding rate that achieves\nan error threshold of $0.8\\%$ for the standard circuit-based noise model. This\nis on par with the surface code which has remained an uncontested leader in\nterms of its high error threshold for nearly 20 years. The full syndrome\nmeasurement cycle for a length-$n$ code in our family requires $n$ ancillary\nqubits and a depth-7 circuit composed of nearest-neighbor CNOT gates. The\nrequired qubit connectivity is a degree-6 graph that consists of two\nedge-disjoint planar subgraphs. As a concrete example, we show that 12 logical\nqubits can be preserved for ten million syndrome cycles using 288 physical\nqubits in total, assuming the physical error rate of $0.1\\%$. We argue that\nachieving the same level of error suppression on 12 logical qubits with the\nsurface code would require more than 4000 physical qubits. Our findings bring\ndemonstrations of a low-overhead fault-tolerant quantum memory within the reach\nof near-term quantum processors.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:55:12 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Bravyi","Sergey",""],["Cross","Andrew W.",""],["Gambetta","Jay M.",""],["Maslov","Dmitri",""],["Rall","Patrick",""],["Yoder","Theodore J.",""]]}
{"id":"2308.07916","submitter":"Tobias Dornheim","authors":"Zhandos Moldabekov and Sebastian Schwalbe and Maximilian B\\\"ohme and\n  Jan Vorberger and Xuecheng Shao and Michele Pavanello and Frank Graziani and\n  Tobias Dornheim","title":"Bound state breaking and the importance of thermal exchange-correlation\n  effects in warm dense hydrogen","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hydrogen at extreme temperatures and pressures is ubiquitous throughout our\nuniverse and naturally occurs in a variety of astrophysical objects. In\naddition, it is of key relevance for cutting-edge technological applications,\nwith inertial confinement fusion research being a prime example. In the present\nwork, we present exact \\emph{ab initio} path integral Monte Carlo (PIMC)\nresults for the electronic density of warm dense hydrogen along a line of\nconstant degeneracy across a broad range of densities. Using the well-known\nconcept of reduced density gradients, we develop a new framework to identify\nthe breaking of bound states due to pressure ionization in bulk hydrogen.\nMoreover, we use our PIMC results as a reference to rigorously assess the\naccuracy of a variety of exchange--correlation (XC) functionals in density\nfunctional theory calculations for different density regions. Here a key\nfinding is the importance of thermal XC effects for the accurate description of\ndensity gradients in high-energy density systems. Our exact PIMC test set is\nfreely available online and can be used to guide the development of new\nmethodologies for the simulation of warm dense matter and beyond.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:55:29 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Moldabekov","Zhandos",""],["Schwalbe","Sebastian",""],["B\u00f6hme","Maximilian",""],["Vorberger","Jan",""],["Shao","Xuecheng",""],["Pavanello","Michele",""],["Graziani","Frank",""],["Dornheim","Tobias",""]]}
{"id":"2308.07917","submitter":"Rupert Frank","authors":"Rupert L. Frank, Jonas W. Peteranderl","title":"Degenerate Stability of the Caffarelli-Kohn-Nirenberg Inequality along\n  the Felli-Schneider Curve","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":"  We show that the Caffarelli-Kohn-Nirenberg (CKN) inequality holds with a\nremainder term that is quartic in the distance to the set of optimizers for the\nfull parameter range of the Felli-Schneider (FS) curve. The fourth power is\nbest possible. This is due to the presence of non-trivial zero modes of the\nHessian of the deficit functional along the FS-curve. Following an iterated\nBianchi-Egnell strategy, the heart of our proof is verifying a `secondary\nnon-degeneracy condition'. Our result completes the stability analysis for the\nCKN-inequality to leading order started by Wei and Wu. Moreover, it is the\nfirst instance of degenerate stability for non-constant optimizers and for a\nnon-compact domain.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:56:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Frank","Rupert L.",""],["Peteranderl","Jonas W.",""]]}
{"id":"2308.07918","submitter":"Chuhan Zhang","authors":"Chuhan Zhang, Ankush Gupta, Andrew Zisserman","title":"Helping Hands: An Object-Aware Ego-Centric Video Recognition Model","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce an object-aware decoder for improving the performance of\nspatio-temporal representations on ego-centric videos. The key idea is to\nenhance object-awareness during training by tasking the model to predict hand\npositions, object positions, and the semantic label of the objects using paired\ncaptions when available. At inference time the model only requires RGB frames\nas inputs, and is able to track and ground objects (although it has not been\ntrained explicitly for this). We demonstrate the performance of the\nobject-aware representations learnt by our model, by: (i) evaluating it for\nstrong transfer, i.e. through zero-shot testing, on a number of downstream\nvideo-text retrieval and classification benchmarks; and (ii) by using the\nrepresentations learned as input for long-term video understanding tasks (e.g.\nEpisodic Memory in Ego4D). In all cases the performance improves over the state\nof the art -- even compared to networks trained with far larger batch sizes. We\nalso show that by using noisy image-level detection as pseudo-labels in\ntraining, the model learns to provide better bounding boxes using video\nconsistency, as well as grounding the words in the associated text\ndescriptions. Overall, we show that the model can act as a drop-in replacement\nfor an ego-centric video model to improve performance through visual-text\ngrounding.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:58:11 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhang","Chuhan",""],["Gupta","Ankush",""],["Zisserman","Andrew",""]]}
{"id":"2308.07919","submitter":"Pierre-Fran\\c{c}ois Rodriguez","authors":"Hugo Duminil-Copin, Subhajit Goswami, Pierre-Fran\\c{c}ois Rodriguez,\n  Franco Severo and Augusto Teixeira","title":"Phase transition for the vacant set of random walk and random\n  interlacements","comments":"94 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the set of points visited by the random walk on the discrete\ntorus $(\\mathbb{Z}/N\\mathbb{Z})^d$, for $d \\geq 3$, at times of order $uN^d$,\nfor a parameter $u>0$ in the large-$N$ limit. We prove that the vacant set left\nby the walk undergoes a phase transition across a non-degenerate critical value\n$u_* = u_*(d)$, as follows. For all $u< u_*$, the vacant set contains a giant\nconnected component with high probability, which has a non-vanishing asymptotic\ndensity and satisfies a certain local uniqueness property. In stark contrast,\nfor all $u> u_*$ the vacant set scatters into tiny connected components. Our\nresults further imply that the threshold $u_*$ precisely equals the critical\nvalue, introduced by Sznitman in arXiv:0704.2560, which characterizes the\npercolation transition of the corresponding local limit, the vacant set of\nrandom interlacements on $\\mathbb{Z}^d$. Our findings also yield the analogous\ninfinite-volume result, i.e. the long purported equality of three critical\nparameters $\\bar u$, $u_*$ and $u_{**}$ naturally associated to the vacant set\nof random interlacements.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:58:20 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Duminil-Copin","Hugo",""],["Goswami","Subhajit",""],["Rodriguez","Pierre-Fran\u00e7ois",""],["Severo","Franco",""],["Teixeira","Augusto",""]]}
{"id":"2308.07920","submitter":"Pierre-Fran\\c{c}ois Rodriguez","authors":"Hugo Duminil-Copin, Subhajit Goswami, Pierre-Fran\\c{c}ois Rodriguez,\n  Franco Severo and Augusto Teixeira","title":"A characterization of strong percolation via disconnection","comments":"46 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a percolation model, the vacant set $\\mathcal{V}^u$ of random\ninterlacements on $\\mathbb{Z}^d$, $d \\geq 3$, in the regime of parameters $u>0$\nin which it is strongly percolative. By definition, such values of $u$ pinpoint\na robust subset of the super-critical phase, with strong quantitative controls\non large local clusters. In the present work, we give a new charaterization of\nthis regime in terms of a single property, monotone in $u$, involving a\ndisconnection estimate for $\\mathcal{V}^u$. A key aspect is to exhibit a gluing\nproperty for large local clusters from this information alone, and a major\nchallenge in this undertaking is the fact that the conditional law of\n$\\mathcal{V}^u$ exhibits degeneracies. As one of the main novelties of this\nwork, the gluing technique we develop to merge large clusters accounts for such\neffects. In particular, our methods do not rely on the widely assumed\nfinite-energy property, which the set $\\mathcal{V}^u$ does not possess. The\ncharaterization we derive plays a decisive role in the proof of a lasting\nconjecture regarding the coincidence of various critical parameters naturally\nassociated to $\\mathcal{V}^u$ in a companion article.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:58:26 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Duminil-Copin","Hugo",""],["Goswami","Subhajit",""],["Rodriguez","Pierre-Fran\u00e7ois",""],["Severo","Franco",""],["Teixeira","Augusto",""]]}
{"id":"2308.07921","submitter":"Aojun Zhou","authors":"Aojun Zhou, Ke Wang, Zimu Lu, Weikang Shi, Sichun Luo, Zipeng Qin,\n  Shaoqing Lu, Anya Jia, Linqi Song, Mingjie Zhan, Hongsheng Li","title":"Solving Challenging Math Word Problems Using GPT-4 Code Interpreter with\n  Code-based Self-Verification","comments":"Solving Challenging Math Word Problems Using GPT-4 Code Interpreter\n  with Code-based Self-Verification","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent progress in large language models (LLMs) like GPT-4 and PaLM-2 has\nbrought significant advancements in addressing math reasoning problems. In\nparticular, OpenAI's latest version of GPT-4, known as GPT-4 Code Interpreter,\nshows remarkable performance on challenging math datasets. In this paper, we\nexplore the effect of code on enhancing LLMs' reasoning capability by\nintroducing different constraints on the \\textit{Code Usage Frequency} of GPT-4\nCode Interpreter. We found that its success can be largely attributed to its\npowerful skills in generating and executing code, evaluating the output of code\nexecution, and rectifying its solution when receiving unreasonable outputs.\nBased on this insight, we propose a novel and effective prompting method,\nexplicit \\uline{c}ode-based \\uline{s}elf-\\uline{v}erification~(CSV), to further\nboost the mathematical reasoning potential of GPT-4 Code Interpreter. This\nmethod employs a zero-shot prompt on GPT-4 Code Interpreter to encourage it to\nuse code to self-verify its answers. In instances where the verification state\nregisters as ``False'', the model shall automatically amend its solution,\nanalogous to our approach of rectifying errors during a mathematics\nexamination. Furthermore, we recognize that the states of the verification\nresult indicate the confidence of a solution, which can improve the\neffectiveness of majority voting. With GPT-4 Code Interpreter and CSV, we\nachieve an impressive zero-shot accuracy on MATH dataset \\textbf{(53.9\\% $\\to$\n84.3\\%)}.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:58:45 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Zhou","Aojun",""],["Wang","Ke",""],["Lu","Zimu",""],["Shi","Weikang",""],["Luo","Sichun",""],["Qin","Zipeng",""],["Lu","Shaoqing",""],["Jia","Anya",""],["Song","Linqi",""],["Zhan","Mingjie",""],["Li","Hongsheng",""]]}
{"id":"2308.07922","submitter":"Jie Huang","authors":"Jie Huang, Wei Ping, Peng Xu, Mohammad Shoeybi, Kevin Chen-Chuan\n  Chang, Bryan Catanzaro","title":"RAVEN: In-Context Learning with Retrieval Augmented Encoder-Decoder\n  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":"  In this paper, we investigate the in-context learning ability of\nretrieval-augmented encoder-decoder language models. We first conduct a\ncomprehensive analysis of the state-of-the-art ATLAS model and identify its\nlimitations in in-context learning, primarily due to a mismatch between\npretraining and testing, as well as a restricted context length. To address\nthese issues, we propose RAVEN, a model that combines retrieval-augmented\nmasked language modeling and prefix language modeling. We further introduce\nFusion-in-Context Learning to enhance the few-shot performance by enabling the\nmodel to leverage more in-context examples without requiring additional\ntraining or model modifications. Through extensive experiments, we demonstrate\nthat RAVEN significantly outperforms ATLAS and achieves results comparable to\nthe most advanced language models in certain scenarios, despite having\nsubstantially fewer parameters. Our work underscores the potential of\nretrieval-augmented encoder-decoder language models for in-context learning and\nencourages further research in this direction.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:59:18 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Huang","Jie",""],["Ping","Wei",""],["Xu","Peng",""],["Shoeybi","Mohammad",""],["Chang","Kevin Chen-Chuan",""],["Catanzaro","Bryan",""]]}
{"id":"2308.07923","submitter":"Julian M\\\"uller","authors":"Julian M\\\"uller","title":"Enumerating Tarski fixed points on lattices of binary relations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.CC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of enumerating Tarski fixed points, focusing on the\nrelational lattices of equivalences, quasiorders and binary relations. We\npresent a polynomial space enumeration algorithm for Tarski fixed points on\nthese lattices and other lattices of polynomial height. It achieves polynomial\ndelay when enumerating fixed points of increasing isotone maps on all three\nlattices, as well as decreasing isotone maps on the lattice of binary\nrelations. In those cases in which the enumeration algorithm does not guarantee\npolynomial delay on the three relational lattices on the other hand, we prove\nexponential lower bounds for deciding the existence of three fixed points when\nthe isotone map is given as an oracle, and that it is NP-hard to find three or\nmore Tarski fixed points. More generally, we show that any deterministic or\nbounded-error randomized algorithm must perform a number of queries\nasymptotically at least as large as the lattice width to decide the existence\nof three fixed points when the isotone map is given as an oracle. Finally, we\ndemonstrate that our findings yield a polynomial delay and space algorithm for\nlisting bisimulations and instances of some related models of behavioral or\nrole equivalence.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:59:33 GMT"}],"update_date":"2023-08-16","authors_parsed":[["M\u00fcller","Julian",""]]}
{"id":"2308.07924","submitter":"Elizaveta Savchenko","authors":"Elizaveta Savchenko, Svetlana Bunimovich-Mendrazitsky","title":"Investigation Toward The Economic Feasibility of Personalized Medicine\n  For Healthcare Service Providers: The Case of Bladder Cancer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In today's complex healthcare landscape, the pursuit of delivering optimal\npatient care while navigating intricate economic dynamics poses a significant\nchallenge for healthcare service providers (HSPs). In this already complex\ndynamics, the emergence of clinically promising personalized medicine based\ntreatment aims to revolutionize medicine. While personalized medicine holds\ntremendous potential for enhancing therapeutic outcomes, its integration within\nresource-constrained HSPs presents formidable challenges. In this study, we\ninvestigate the economic feasibility of implementing personalized medicine. The\ncentral objective is to strike a balance between catering to individual patient\nneeds and making economically viable decisions. Unlike conventional binary\napproaches to personalized treatment, we propose a more nuanced perspective by\ntreating personalization as a spectrum. This approach allows for greater\nflexibility in decision-making and resource allocation. To this end, we propose\na mathematical framework to investigate our proposal, focusing on Bladder\nCancer (BC) as a case study. Our results show that while it is feasible to\nintroduce personalized medicine, a highly efficient but highly expensive one\nwould be short-lived relative to its less effective but cheaper alternative as\nthe latter can be provided to a larger cohort of patients, optimizing the HSP's\nobjective better.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:59:46 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Savchenko","Elizaveta",""],["Bunimovich-Mendrazitsky","Svetlana",""]]}
{"id":"2308.07925","submitter":"Bechir Hamdaoui","authors":"Benjamin Johnson and Bechir Hamdaoui","title":"Domain-Adaptive Device Fingerprints for Network Access Authentication\n  Through Multifractal Dimension Representation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  RF data-driven device fingerprinting through the use of deep learning has\nrecently surfaced as a potential solution for automated network access\nauthentication. Traditional approaches are commonly susceptible to the domain\nadaptation problem where a model trained on data from one domain performs badly\nwhen tested on data from a different domain. Some examples of a domain change\ninclude varying the device location or environment and varying the time or day\nof data collection. In this work, we propose using multifractal analysis and\nthe variance fractal dimension trajectory (VFDT) as a data representation input\nto the deep neural network to extract device fingerprints that are domain\ngeneralizable. We analyze the effectiveness of the proposed VFDT representation\nin detecting device-specific signatures from hardware-impaired IQ signals, and\nevaluate its robustness in real-world settings, using an experimental testbed\nof 30 WiFi-enabled Pycom devices under different locations and at different\nscales. Our results show that the VFDT representation improves the scalability,\nrobustness and generalizability of the deep learning models significantly\ncompared to when using raw IQ data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:59:55 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Johnson","Benjamin",""],["Hamdaoui","Bechir",""]]}
{"id":"2308.07926","submitter":"Hao Ouyang","authors":"Hao Ouyang, Qiuyu Wang, Yuxi Xiao, Qingyan Bai, Juntao Zhang, Kecheng\n  Zheng, Xiaowei Zhou, Qifeng Chen, Yujun Shen","title":"CoDeF: Content Deformation Fields for Temporally Consistent Video\n  Processing","comments":"Project Webpage: https://qiuyu96.github.io/CoDeF/, Code:\n  https://github.com/qiuyu96/CoDeF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the content deformation field CoDeF as a new type of video\nrepresentation, which consists of a canonical content field aggregating the\nstatic contents in the entire video and a temporal deformation field recording\nthe transformations from the canonical image (i.e., rendered from the canonical\ncontent field) to each individual frame along the time axis.Given a target\nvideo, these two fields are jointly optimized to reconstruct it through a\ncarefully tailored rendering pipeline.We advisedly introduce some\nregularizations into the optimization process, urging the canonical content\nfield to inherit semantics (e.g., the object shape) from the video.With such a\ndesign, CoDeF naturally supports lifting image algorithms for video processing,\nin the sense that one can apply an image algorithm to the canonical image and\neffortlessly propagate the outcomes to the entire video with the aid of the\ntemporal deformation field.We experimentally show that CoDeF is able to lift\nimage-to-image translation to video-to-video translation and lift keypoint\ndetection to keypoint tracking without any training.More importantly, thanks to\nour lifting strategy that deploys the algorithms on only one image, we achieve\nsuperior cross-frame consistency in processed videos compared to existing\nvideo-to-video translation approaches, and even manage to track non-rigid\nobjects like water and smog.Project page can be found at\nhttps://qiuyu96.github.io/CoDeF/.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:59:56 GMT"}],"update_date":"2023-08-16","authors_parsed":[["Ouyang","Hao",""],["Wang","Qiuyu",""],["Xiao","Yuxi",""],["Bai","Qingyan",""],["Zhang","Juntao",""],["Zheng","Kecheng",""],["Zhou","Xiaowei",""],["Chen","Qifeng",""],["Shen","Yujun",""]]}
{"id":"2308.07932","submitter":"Aman Abidi","authors":"Apurba Das, Aman Abidi, Ajinkya Shingane and Mekala Kiran","title":"Balanced Butterfly Counting in Bipartite-Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bipartite graphs offer a powerful framework for modeling complex\nrelationships between two distinct types of vertices, incorporating\nprobabilistic, temporal, and rating-based information. While the research\ncommunity has extensively explored various types of bipartite relationships,\nthere has been a notable gap in studying Signed Bipartite Graphs, which capture\nliking / disliking interactions in real-world networks such as\ncustomer-rating-product and senator-vote-bill. Balance butterflies,\nrepresenting 2 x 2 bicliques, provide crucial insights into antagonistic\ngroups, balance theory, and fraud detection by leveraging the signed\ninformation. However, such applications require counting balance butterflies\nwhich remains unexplored. In this paper, we propose a new problem: counting\nbalance butterflies in a signed bipartite graph. To address this problem, we\nadopt state-of-the-art algorithms for butterfly counting, establishing a smart\nbaseline that reduces the time complexity for solving our specific problem. We\nfurther introduce a novel bucket approach specifically designed to count\nbalanced butterflies efficiently. We propose a parallelized version of the\nbucketing approach to enhance performance. Extensive experimental studies on\nnine real-world datasets demonstrate that our proposed bucket-based algorithm\nis up to 120x faster over the baseline, and the parallel implementation of the\nbucket-based algorithm is up to 45x faster over the single core execution.\nMoreover, a real-world case study showcases the practical application and\nrelevance of counting balanced butterflies.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 04:57:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Das","Apurba",""],["Abidi","Aman",""],["Shingane","Ajinkya",""],["Kiran","Mekala",""]]}
{"id":"2308.07933","submitter":"Youxiang Zhu","authors":"Youxiang Zhu, Nana Lin, Xiaohui Liang, John A. Batsis, Robert M. Roth,\n  Brian MacWhinney","title":"Evaluating Picture Description Speech for Dementia Detection using\n  Image-text Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using picture description speech for dementia detection has been studied for\n30 years. Despite the long history, previous models focus on identifying the\ndifferences in speech patterns between healthy subjects and patients with\ndementia but do not utilize the picture information directly. In this paper, we\npropose the first dementia detection models that take both the picture and the\ndescription texts as inputs and incorporate knowledge from large pre-trained\nimage-text alignment models. We observe the difference between dementia and\nhealthy samples in terms of the text's relevance to the picture and the focused\narea of the picture. We thus consider such a difference could be used to\nenhance dementia detection accuracy. Specifically, we use the text's relevance\nto the picture to rank and filter the sentences of the samples. We also\nidentified focused areas of the picture as topics and categorized the sentences\naccording to the focused areas. We propose three advanced models that\npre-processed the samples based on their relevance to the picture, sub-image,\nand focused areas. The evaluation results show that our advanced models, with\nknowledge of the picture and large image-text alignment models, achieve\nstate-of-the-art performance with the best detection accuracy at 83.44%, which\nis higher than the text-only baseline model at 79.91%. Lastly, we visualize the\nsample and picture results to explain the advantages of our models.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 08:42:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhu","Youxiang",""],["Lin","Nana",""],["Liang","Xiaohui",""],["Batsis","John A.",""],["Roth","Robert M.",""],["MacWhinney","Brian",""]]}
{"id":"2308.07934","submitter":"Yiming Li","authors":"Jianshuo Dong, Han Qiu, Yiming Li, Tianwei Zhang, Yuanjie Li, Zeqi\n  Lai, Chao Zhang, Shu-Tao Xia","title":"One-bit Flip is All You Need: When Bit-flip Attack Meets Model Training","comments":"This work is accepted by the ICCV 2023. 14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks (DNNs) are widely deployed on real-world devices.\nConcerns regarding their security have gained great attention from researchers.\nRecently, a new weight modification attack called bit flip attack (BFA) was\nproposed, which exploits memory fault inject techniques such as row hammer to\nattack quantized models in the deployment stage. With only a few bit flips, the\ntarget model can be rendered useless as a random guesser or even be implanted\nwith malicious functionalities. In this work, we seek to further reduce the\nnumber of bit flips. We propose a training-assisted bit flip attack, in which\nthe adversary is involved in the training stage to build a high-risk model to\nrelease. This high-risk model, obtained coupled with a corresponding malicious\nmodel, behaves normally and can escape various detection methods. The results\non benchmark datasets show that an adversary can easily convert this high-risk\nbut normal model to a malicious one on victim's side by \\textbf{flipping only\none critical bit} on average in the deployment stage. Moreover, our attack\nstill poses a significant threat even when defenses are employed. The codes for\nreproducing main experiments are available at\n\\url{https://github.com/jianshuod/TBA}.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 09:34:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dong","Jianshuo",""],["Qiu","Han",""],["Li","Yiming",""],["Zhang","Tianwei",""],["Li","Yuanjie",""],["Lai","Zeqi",""],["Zhang","Chao",""],["Xia","Shu-Tao",""]]}
{"id":"2308.07935","submitter":"Georgios Fatouros","authors":"Georgios Fatouros, John Soldatos, Kalliopi Kouroumali, Georgios\n  Makridis, Dimosthenis Kyriazis","title":"Transforming Sentiment Analysis in the Financial Domain with ChatGPT","comments":"10 pages, 8 figures, Preprint submitted to Machine Learning with\n  Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CE cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Financial sentiment analysis plays a crucial role in decoding market trends\nand guiding strategic trading decisions. Despite the deployment of advanced\ndeep learning techniques and language models to refine sentiment analysis in\nfinance, this study breaks new ground by investigating the potential of large\nlanguage models, particularly ChatGPT 3.5, in financial sentiment analysis,\nwith a strong emphasis on the foreign exchange market (forex). Employing a\nzero-shot prompting approach, we examine multiple ChatGPT prompts on a\nmeticulously curated dataset of forex-related news headlines, measuring\nperformance using metrics such as precision, recall, f1-score, and Mean\nAbsolute Error (MAE) of the sentiment class. Additionally, we probe the\ncorrelation between predicted sentiment and market returns as an additional\nevaluation approach. ChatGPT, compared to FinBERT, a well-established sentiment\nanalysis model for financial texts, exhibited approximately 35\\% enhanced\nperformance in sentiment classification and a 36\\% higher correlation with\nmarket returns. By underlining the significance of prompt engineering,\nparticularly in zero-shot contexts, this study spotlights ChatGPT's potential\nto substantially boost sentiment analysis in financial applications. By sharing\nthe utilized dataset, our intention is to stimulate further research and\nadvancements in the field of financial services.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 09:20:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fatouros","Georgios",""],["Soldatos","John",""],["Kouroumali","Kalliopi",""],["Makridis","Georgios",""],["Kyriazis","Dimosthenis",""]]}
{"id":"2308.07936","submitter":"Fei Gao","authors":"Baochi Fu, Fei Gao, Yuxin Liu, Huichao Song","title":"The spin alignment of vector mesons with light front quarks","comments":"7 pages, 2 figures","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":"  The global spin alignment of the vector meson has been observed in\nrelativistic heavy ion collisions, but is still on hot debates in the\ntheoretical community. Here we propose to apply the light front framework to\nexplain this phenomenon since the light front form explicitly describes the\nhadron spin including both the quark spin and the orbital angular momentum.\nAfter applying the light front spinor, we find that the spin alignment in the\npolarization of vector mesons with $\\rho_{00}>1/3$ can be naturally manifested\nand in particular, the obtained spin alignment for $\\phi$ meson is in good\nagreement with the experimental data. This implies that to explain the spin\nalignment it is important to properly include the contribution from the gluon\ninteractions that are presented in terms of the orbital angular momentum of the\nhadron bound state.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 02:45:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fu","Baochi",""],["Gao","Fei",""],["Liu","Yuxin",""],["Song","Huichao",""]]}
{"id":"2308.07937","submitter":"Boxi Yu","authors":"Boxi Yu, Yiyan Hu, Qiuyang Mang, Wenhan Hu, Pinjia He","title":"Automated Testing and Improvement of Named Entity Recognition Systems","comments":"Accepted by ESEC/FSE'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Named entity recognition (NER) systems have seen rapid progress in recent\nyears due to the development of deep neural networks. These systems are widely\nused in various natural language processing applications, such as information\nextraction, question answering, and sentiment analysis. However, the complexity\nand intractability of deep neural networks can make NER systems unreliable in\ncertain circumstances, resulting in incorrect predictions. For example, NER\nsystems may misidentify female names as chemicals or fail to recognize the\nnames of minority groups, leading to user dissatisfaction. To tackle this\nproblem, we introduce TIN, a novel, widely applicable approach for\nautomatically testing and repairing various NER systems. The key idea for\nautomated testing is that the NER predictions of the same named entities under\nsimilar contexts should be identical. The core idea for automated repairing is\nthat similar named entities should have the same NER prediction under the same\ncontext. We use TIN to test two SOTA NER models and two commercial NER APIs,\ni.e., Azure NER and AWS NER. We manually verify 784 of the suspicious issues\nreported by TIN and find that 702 are erroneous issues, leading to high\nprecision (85.0%-93.4%) across four categories of NER errors: omission,\nover-labeling, incorrect category, and range error. For automated repairing,\nTIN achieves a high error reduction rate (26.8%-50.6%) over the four systems\nunder test, which successfully repairs 1,056 out of the 1,877 reported NER\nerrors.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:17:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yu","Boxi",""],["Hu","Yiyan",""],["Mang","Qiuyang",""],["Hu","Wenhan",""],["He","Pinjia",""]]}
{"id":"2308.07938","submitter":"EPTCS","authors":"Ole L\\\"ubke (TUHH), Konrad Fuger (TUHH), Fin Hendrik Bahnsen\n  (UK-Essen), Katrin Billerbeck (TUHH), Sibylle Schupp (TUHH)","title":"Computer Aided Design and Grading for an Electronic Functional\n  Programming Exam","comments":"In Proceedings TFPIE 2023, arXiv:2308.06110","journal-ref":"EPTCS 382, 2023, pp. 22-44","doi":"10.4204/EPTCS.382.2","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Electronic exams (e-exams) have the potential to substantially reduce the\neffort required for conducting an exam through automation. Yet, care must be\ntaken to sacrifice neither task complexity nor constructive alignment nor\ngrading fairness in favor of automation. To advance automation in the design\nand fair grading of (functional programming) e-exams, we introduce the\nfollowing: A novel algorithm to check Proof Puzzles based on finding correct\nsequences of proof lines that improves fairness compared to an existing, edit\ndistance based algorithm; an open-source static analysis tool to check source\ncode for task relevant features by traversing the abstract syntax tree; a\nhigher-level language and open-source tool to specify regular expressions that\nmakes creating complex regular expressions less error-prone. Our findings are\nembedded in a complete experience report on transforming a paper exam to an\ne-exam. We evaluated the resulting e-exam by analyzing the degree of automation\nin the grading process, asking students for their opinion, and critically\nreviewing our own experiences. Almost all tasks can be graded automatically at\nleast in part (correct solutions can almost always be detected as such), the\nstudents agree that an e-exam is a fitting examination format for the course\nbut are split on how well they can express their thoughts compared to a paper\nexam, and examiners enjoy a more time-efficient grading process while the point\ndistribution in the exam results was almost exactly the same compared to a\npaper exam.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:08:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["L\u00fcbke","Ole","","TUHH"],["Fuger","Konrad","","TUHH"],["Bahnsen","Fin Hendrik","","UK-Essen"],["Billerbeck","Katrin","","TUHH"],["Schupp","Sibylle","","TUHH"]]}
{"id":"2308.07939","submitter":"Marcin Pietron","authors":"Marcin Pietro\\'n, Dominik \\.Zurek, Kamil Faber, Roberto Corizzo","title":"Ada-QPacknet -- adaptive pruning with bit width reduction as an\n  efficient continual learning method without forgetting","comments":"Paper accepted at ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Continual Learning (CL) is a process in which there is still huge gap between\nhuman and deep learning model efficiency. Recently, many CL algorithms were\ndesigned. Most of them have many problems with learning in dynamic and complex\nenvironments. In this work new architecture based approach Ada-QPacknet is\ndescribed. It incorporates the pruning for extracting the sub-network for each\ntask. The crucial aspect in architecture based CL methods is theirs capacity.\nIn presented method the size of the model is reduced by efficient linear and\nnonlinear quantisation approach. The method reduces the bit-width of the\nweights format. The presented results shows that hybrid 8 and 4-bit\nquantisation achieves similar accuracy as floating-point sub-network on a\nwell-know CL scenarios. To our knowledge it is the first CL strategy which\nincorporates both compression techniques pruning and quantisation for\ngenerating task sub-networks. The presented algorithm was tested on well-known\nepisode combinations and compared with most popular algorithms. Results show\nthat proposed approach outperforms most of the CL strategies in task and class\nincremental scenarios.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 12:17:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pietro\u0144","Marcin",""],["\u017burek","Dominik",""],["Faber","Kamil",""],["Corizzo","Roberto",""]]}
{"id":"2308.07940","submitter":"Takayuki Mizuno","authors":"Taizo Horikomi, Shouji Fujimoto, Atushi Ishikawa, Takayuki Mizuno","title":"Generating Individual Trajectories Using GPT-2 Trained from Scratch on\n  Encoded Spatiotemporal 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":"  Following Mizuno, Fujimoto, and Ishikawa's research (Front. Phys. 2022), we\ntranspose geographical coordinates expressed in latitude and longitude into\ndistinctive location tokens that embody positions across varied spatial scales.\nWe encapsulate an individual daily trajectory as a sequence of tokens by adding\nunique time interval tokens to the location tokens. Using the architecture of\nan autoregressive language model, GPT-2, this sequence of tokens is trained\nfrom scratch, allowing us to construct a deep learning model that sequentially\ngenerates an individual daily trajectory. Environmental factors such as\nmeteorological conditions and individual attributes such as gender and age are\nsymbolized by unique special tokens, and by training these tokens and\ntrajectories on the GPT-2 architecture, we can generate trajectories that are\ninfluenced by both environmental factors and individual attributes.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 15:40:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Horikomi","Taizo",""],["Fujimoto","Shouji",""],["Ishikawa","Atushi",""],["Mizuno","Takayuki",""]]}
{"id":"2308.07941","submitter":"Jiahong Shen","authors":"Jiahong Shen, Dale Gaines II, Shima Shahabfar, Zhi Li, Dohun Kang,\n  Sean Griesemer, Adolfo Salgado-Casanova, Tzu-chen Liu, Chang-Ti Chou, Yi Xia\n  and Chris Wolverton","title":"Phase Stability of Lead Phosphate Apatite\n  Pb$_{10-x}$Cu$_{x}$(PO$_{4}$)$_{6}$O,\n  Pb$_{10-x}$Cu$_{x}$(PO$_{4}$)$_{6}$(OH)$_{2}$, and\n  Pb$_{8}$Cu$_{2}$(PO$_{4}$)$_{6}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, Cu-substituted lead apatite LK-99 was reported to have\nroom-temperature ambient-pressure superconductivity. Here we utilize density\nfunctional theory (DFT) total energy and harmonic phonon calculations to\ninvestigate the thermodynamic and dynamic stability of two lead phosphate\napatites in their pure and Cu-substituted structures. Though\nPb$_{10}$(PO$_4$)$_6$O and Pb$_{10}$(PO$_4$)$_6$(OH)$_2$ are found to be\nthermodynamically stable (i.e., on the T=0K ground state convex hull), their\nCu-substituted counterparts are above the convex hull. Harmonic phonon\ncalculations reveal dynamic instabilities in all four of these structures.\nOxygen vacancy formation energies demonstrate that the addition of Cu dopant\nsubstituting for Pb increases the likelihood of the formation of oxygen\nvacancies on the anion site. We propose a new possible phase in this system,\nPb$_8$Cu$_2$(PO$_4$)$_6$, where two monovalent Cu atoms are substituted for two\nPb(1) atoms and the anion oxygen is removed. We also propose several reaction\npathways for Pb$_9$Cu(PO$_4$)$_6$O and Pb$_8$Cu$_2$(PO$_4$)$_6$, and found that\nboth of these two structures are likely to be synthesized under a 1:1 ratio of\nreactants Pb$_2$SO$_5$ and Cu$_3$P. Our work provides a thorough foundation for\nthe thermodynamic and dynamic stabilities of LK-99 related compounds and we\npropose several possible novel synthesis reaction pathways and a new predicted\nstructure for future studies.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 17:39:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shen","Jiahong",""],["Gaines","Dale","II"],["Shahabfar","Shima",""],["Li","Zhi",""],["Kang","Dohun",""],["Griesemer","Sean",""],["Salgado-Casanova","Adolfo",""],["Liu","Tzu-chen",""],["Chou","Chang-Ti",""],["Xia","Yi",""],["Wolverton","Chris",""]]}
{"id":"2308.07942","submitter":"Akash Anil","authors":"Akash Anil, V\\'ictor Guti\\'errez-Basulto, Yazm\\'in\n  Iba\\~n\\'ez-Garc\\'ia, Steven Schockaert","title":"Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The task of inductive knowledge graph completion requires models to learn\ninference patterns from a training graph, which can then be used to make\npredictions on a disjoint test graph. Rule-based methods seem like a natural\nfit for this task, but in practice they significantly underperform\nstate-of-the-art methods based on Graph Neural Networks (GNNs), such as NBFNet.\nWe hypothesise that the underperformance of rule-based methods is due to two\nfactors: (i) implausible entities are not ranked at all and (ii) only the most\ninformative path is taken into account when determining the confidence in a\ngiven link prediction answer. To analyse the impact of these factors, we study\na number of variants of a rule-based approach, which are specifically aimed at\naddressing the aforementioned issues. We find that the resulting models can\nachieve a performance which is close to that of NBFNet. Crucially, the\nconsidered variants only use a small fraction of the evidence that NBFNet\nrelies on, which means that they largely keep the interpretability advantage of\nrule-based methods. Moreover, we show that a further variant, which does look\nat the full KG, consistently outperforms NBFNet.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 21:01:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Anil","Akash",""],["Guti\u00e9rrez-Basulto","V\u00edctor",""],["Iba\u00f1\u00e9z-Garc\u00eda","Yazm\u00edn",""],["Schockaert","Steven",""]]}
{"id":"2308.07943","submitter":"Vitaliy Rusov","authors":"Vitaliy D. Rusov, Igor V. Sharph, Vladimir P. Smolyar","title":"Experimental evidence of dark matter axions identical to solar axions\n  and the absence of the \"fifth\" carrier force for the Higgs field","comments":"28 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The complete \"experimental\" proof of the existence of axion luminosity and\ntrapped ADMs in the interior of the Sun is the reason for the formation of hot\ndark matter axions (see modified Turner model (1987) with a critical density\nfraction of $\\Omega_{axionHDM}^{thermal} \\sim 0.32$ at a mass of $\\sim6~eV$)\nbetween inflation and Big Bang nucleosynthesis, which are further transformed\ninto mixed dark matter between Big Bang nucleosynthesis and the cosmological\nmicrowave background (CMB) in the form of $\\left[ \\Omega_{axionHDM}^{thermal}\n\\right]_{\\sim 0.32} = \\Omega_{ADM} + \\Omega_{baryon}$ and $\\left[\n\\Omega_{axionHDM}^{thermal} \\right]_{axiogenesis} =\n\\Omega_{axoinWDM}^{coherent} + \\Omega_{baryon}$, where the first term 5 GeV ADM\nis the result of the decay of the partially composite dark matter of the Higgs\nboson, in which there is a remarkable absence of the \"fifth\" carrier force for\nthe Higgs field in the Universe, and the second term\n$\\Omega_{axoinWDM}^{coherent} \\sim 4.5 \\cdot 10^{-5}$ is associated with the\nmass of $\\sim 3.2 \\cdot 10^{-2} ~eV$ of coherent axions of warm dark matter,\nwhich are identical to solar axions with the same mass (Rusov et al. 2021).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:55:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rusov","Vitaliy D.",""],["Sharph","Igor V.",""],["Smolyar","Vladimir P.",""]]}
{"id":"2308.07944","submitter":"Kristian Kuznetsov","authors":"Petr Sokerin, Kristian Kuznetsov, Elizaveta Makhneva, Alexey Zaytsev","title":"Portfolio Selection via Topological Data Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Portfolio management is an essential part of investment decision-making.\nHowever, traditional methods often fail to deliver reasonable performance. This\nproblem stems from the inability of these methods to account for the unique\ncharacteristics of multivariate time series data from stock markets. We present\na two-stage method for constructing an investment portfolio of common stocks.\nThe method involves the generation of time series representations followed by\ntheir subsequent clustering. Our approach utilizes features based on\nTopological Data Analysis (TDA) for the generation of representations, allowing\nus to elucidate the topological structure within the data. Experimental results\nshow that our proposed system outperforms other methods. This superior\nperformance is consistent over different time frames, suggesting the viability\nof TDA as a powerful tool for portfolio selection.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:36:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sokerin","Petr",""],["Kuznetsov","Kristian",""],["Makhneva","Elizaveta",""],["Zaytsev","Alexey",""]]}
{"id":"2308.07945","submitter":"Yuan Gao","authors":"Yuan Gao, Yuxia Guo, Yichen Hu","title":"Double-tower Solutions for Higher Order Prescribed Curvature Problem","comments":"34 pages, 0 figures. arXiv admin note: substantial text overlap with\n  arXiv:2205.14482 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the following higher order prescribed curvature problem on $\n{\\mathbb{S}}^N : $ \\begin{equation*} D^m \\tilde u=\\widetilde{K}(y) \\tilde\nu^{m^{*}-1} \\quad \\mbox{on} \\ {\\mathbb {S}}^N, \\qquad \\tilde u >0 \\quad\n\\mbox{in} \\ {\\mathbb {S}}^N. \\end{equation*} where $\\widetilde{K}(y)>0$ is a\nradial function, $m^{*}=\\frac{2N}{N-2m}$ and $D^m$ is $2m$ order differential\noperator given by \\begin{equation*}\nD^m=\\prod_{i=1}^m\\left(-\\Delta_g+\\frac{1}{4}(N-2i)(N+2i-2)\\right),\n\\end{equation*} where $g=g_{{\\mathbb{S}}^N}$is the Riemannian metric. We prove\nthe existence of infinitely many double-tower type solutions, which are\ninvariant under some non-trivial sub-groups of $O(3),$ and their energy can be\nmade arbitrarily large.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 07:16:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gao","Yuan",""],["Guo","Yuxia",""],["Hu","Yichen",""]]}
{"id":"2308.07946","submitter":"Juntong Fan","authors":"Juntong Fan, Tieyong Zeng, Dayang Wang","title":"DSFNet: Convolutional Encoder-Decoder Architecture Combined Dual-GCN and\n  Stand-alone Self-attention by Fast Normalized Fusion for Polyps Segmentation","comments":"10 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":"  In the past few decades, deep learning technology has been widely used in\nmedical image segmentation and has made significant breakthroughs in the fields\nof liver and liver tumor segmentation, brain and brain tumor segmentation,\nvideo disc segmentation, heart image segmentation, and so on. However, the\nsegmentation of polyps is still a challenging task since the surface of the\npolyps is flat and the color is very similar to that of surrounding tissues.\nThus, It leads to the problems of the unclear boundary between polyps and\nsurrounding mucosa, local overexposure, and bright spot reflection. To counter\nthis problem, this paper presents a novel U-shaped network, namely DSFNet,\nwhich effectively combines the advantages of Dual-GCN and self-attention\nmechanisms. First, we introduce a feature enhancement block module based on\nDual-GCN module as an attention mechanism to enhance the feature extraction of\nlocal spatial and structural information with fine granularity. Second, the\nstand-alone self-attention module is designed to enhance the integration\nability of the decoding stage model to global information. Finally, the Fast\nNormalized Fusion method with trainable weights is used to efficiently fuse the\ncorresponding three feature graphs in encoding, bottleneck, and decoding\nblocks, thus promoting information transmission and reducing the semantic gap\nbetween encoder and decoder. Our model is tested on two public datasets\nincluding Endoscene and Kvasir-SEG and compared with other state-of-the-art\nmodels. Experimental results show that the proposed model surpasses other\ncompetitors in many indicators, such as Dice, MAE, and IoU. In the meantime,\nablation studies are also conducted to verify the efficacy and effectiveness of\neach module. Qualitative and quantitative analysis indicates that the proposed\nmodel has great clinical significance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:07:14 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fan","Juntong",""],["Zeng","Tieyong",""],["Wang","Dayang",""]]}
{"id":"2308.07947","submitter":"Sarah Bohndiek","authors":"Michaela Taylor-Williams, Ran Tao, Travis W Sawyer, Dale J Waterhouse,\n  Jonghee Yoon and Sarah E Bohndiek","title":"Targeted Multispectral Filter Array Design for Endoscopic Cancer\n  Detection in the Gastrointestinal Tract","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph eess.IV physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Colour differences between healthy and diseased tissue in the\ngastrointestinal tract are detected visually by clinicians during white light\nendoscopy (WLE); however, the earliest signs of disease are often just a\nslightly different shade of pink compared to healthy tissue. Here, we propose\nto target alternative colours for imaging to improve contrast using custom\nmultispectral filter arrays (MSFAs) that could be deployed in an endoscopic\nchip-on-tip configuration. Using an open-source toolbox, Opti-MSFA, we examined\nthe optimal design of MSFAs for early cancer detection in the gastrointestinal\ntract. The toolbox was first extended to use additional classification models\n(k-Nearest Neighbour, Support Vector Machine, and Spectral Angle Mapper). Using\ninput spectral data from published clinical trials examining the oesophagus and\ncolon, we optimised the design of MSFAs with 3 to 9 different bands. We\nexamined the variation of the spectral and spatial classification accuracy as a\nfunction of number of bands. The MSFA designs have high classification\naccuracies, suggesting that future implementation in endoscopy hardware could\npotentially enable improved early detection of disease in the gastrointestinal\ntract during routine screening and surveillance. Optimal MSFA configurations\ncan achieve similar classification accuracies as the full spectral data in an\nimplementation that could be realised in far simpler hardware. The reduced\nnumber of spectral bands could enable future deployment of multispectral\nimaging in an endoscopic chip-on-tip configuration.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:54:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Taylor-Williams","Michaela",""],["Tao","Ran",""],["Sawyer","Travis W",""],["Waterhouse","Dale J",""],["Yoon","Jonghee",""],["Bohndiek","Sarah E",""]]}
{"id":"2308.07948","submitter":"Haojie Huang","authors":"Haojie Huang, Dian Wang, Arsh Tangri, Robin Walters, Robert Platt","title":"Leveraging Symmetries in Pick and Place","comments":"arXiv admin note: substantial text overlap with arXiv:2202.09400","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Robotic pick and place tasks are symmetric under translations and rotations\nof both the object to be picked and the desired place pose. For example, if the\npick object is rotated or translated, then the optimal pick action should also\nrotate or translate. The same is true for the place pose; if the desired place\npose changes, then the place action should also transform accordingly. A\nrecently proposed pick and place framework known as Transporter Net captures\nsome of these symmetries, but not all. This paper analytically studies the\nsymmetries present in planar robotic pick and place and proposes a method of\nincorporating equivariant neural models into Transporter Net in a way that\ncaptures all symmetries. The new model, which we call Equivariant Transporter\nNet, is equivariant to both pick and place symmetries and can immediately\ngeneralize pick and place knowledge to different pick and place poses. We\nevaluate the new model empirically and show that it is much more sample\nefficient than the non-symmetric version, resulting in a system that can\nimitate demonstrated pick and place behavior using very few human\ndemonstrations on a variety of imitation learning tasks.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:16:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Haojie",""],["Wang","Dian",""],["Tangri","Arsh",""],["Walters","Robin",""],["Platt","Robert",""]]}
{"id":"2308.07949","submitter":"Jaekwon Lee","authors":"Jaekwon Lee, Enrico Vigan\\`o, Oscar Cornejo, Fabrizio Pastore, Lionel\n  Briand","title":"Fuzzing for CPS Mutation Testing","comments":"This article is the camera-ready version for ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mutation testing can help reduce the risks of releasing faulty software. For\nsuch reason, it is a desired practice for the development of embedded software\nrunning in safety-critical cyber-physical systems (CPS). Unfortunately,\nstate-of-the-art test data generation techniques for mutation testing of C and\nC++ software, two typical languages for CPS software, rely on symbolic\nexecution, whose limitations often prevent its application (e.g., it cannot\ntest black-box components).\n  We propose a mutation testing approach that leverages fuzz testing, which has\nproved effective with C and C++ software. Fuzz testing automatically generates\ndiverse test inputs that exercise program branches in a varied number of ways\nand, therefore, exercise statements in different program states, thus\nmaximizing the likelihood of killing mutants, our objective.\n  We performed an empirical assessment of our approach with software components\nused in satellite systems currently in orbit. Our empirical evaluation shows\nthat mutation testing based on fuzz testing kills a significantly higher\nproportion of live mutants than symbolic execution (i.e., up to an additional\n47 percentage points). Further, when symbolic execution cannot be applied, fuzz\ntesting provides significant benefits (i.e., up to 41% mutants killed). Our\nstudy is the first one comparing fuzz testing and symbolic execution for\nmutation testing; our results provide guidance towards the development of fuzz\ntesting tools dedicated to mutation testing.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:35:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lee","Jaekwon",""],["Vigan\u00f2","Enrico",""],["Cornejo","Oscar",""],["Pastore","Fabrizio",""],["Briand","Lionel",""]]}
{"id":"2308.07950","submitter":"David Blaschke","authors":"D. Blaschke, M. Cierniak, O. Ivanytskyi, G. R\\\"opke","title":"Thermodynamics of quark matter with multiquark clusters in an effective\n  Beth-Uhlenbeck type approach","comments":"20 pages, 11 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe multiquark clusters in quark matter within a Beth-Uhlenbeck\napproach in a background gluon field coupled to the underlying chiral quark\ndynamics using the Polyakov gauge which establishes the center symmetry of\ncolor SU(3) that suppresses colored states as an aspect of confinement. Quark\nconfinement is modeled by a large quark mass in vacuum motivated by a confining\ndensity functional approach. A multiquark cluster containing $n$ quarks and\nantiquarks is described as a binary composite of smaller subclusters $n_1$ and\n$n_2$ ($n_1+n_2=n$). It has a spectrum consisting of a bound state and a\nscattering state continuum. For the corresponding cluster-cluster phase shifts\nwe discuss simple ans\\\"atze that capture the Mott dissociation of clusters as a\nfunction of temperature and chemical potential. We go beyond the simple\n\"step-up-step-down\" model that ignores continuum correlations and introduce an\nimproved model that includes them in a generic form. In order to explain the\nmodel, we restrict ourselves here to the cases where the cluster size is $1 \\le\nn \\le 6$. A striking result is the suppression of the abundance of colored\nmultiquark clusters at low temperatures by the coupling to the Polyakov loop\nand their importance for a quantitative description of lattice QCD\nthermodynamics at non-vanishing baryochemical potentials. An important\ningredient are Polyakov-loop generalized distribution functions of $n$-quark\nclusters which are derived here for the first time. Within our approach we\ncalculate thermodynamic properties such as baryon density and entropy. We\ndemonstrate that the limits of a hadron resonance gas at low temperatures and\n$\\mathcal{O}(g^2)$ perturbative QCD at high temperatures are correctly\nreproduced. A comparison with lattice calculations shows that our model is able\nto give a unified, systematic approach to describe properties of the\nquark-gluon-hadron system.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:50:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Blaschke","D.",""],["Cierniak","M.",""],["Ivanytskyi","O.",""],["R\u00f6pke","G.",""]]}
{"id":"2308.07951","submitter":"Yu-Dai Tsai","authors":"Xucheng Gan, Yu-Dai Tsai","title":"Cosmic Millicharge Background and Reheating Probes","comments":"10 pages plus references, 5 figures","journal-ref":null,"doi":null,"report-no":"UCI-HEP-TR-2023-05; FERMILAB-PUB-23-428-T-V","categories":"hep-ph astro-ph.CO gr-qc hep-ex hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We demonstrate that the searches for dark sector particles can provide probes\nof reheating scenarios, focusing on the cosmic millicharge background produced\nin the early universe. We discuss two types of millicharge particles (mCPs):\neither with, or without, an accompanying dark photon. These two types of mCPs\nhave distinct theoretical motivations and cosmological signatures. We discuss\nconstraints from the overproduction and mCP-baryon interactions of the mCP\nwithout an accompanying dark photon, with different reheating temperatures. We\nalso consider the $\\Delta N_{\\rm eff}$ constraints on the mCPs from kinetic\nmixing, varying the reheating temperature. The regions of interest in which the\naccelerator and other experiments can probe the reheating scenarios are\nidentified in this paper for both scenarios. These probes can potentially allow\nus to set an upper bound on the reheating temperature down to $\\sim 10$ MeV,\nmuch lower than the previously considered upper bound from inflationary\ncosmology at around $\\sim 10^{16}$ GeV. In addition, we find parameter regions\nin which the two mCP scenarios may be differentiated by cosmological\nconsiderations. Finally, we discuss the implications of dedicated mCP searches\nand future CMB-S4 observations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gan","Xucheng",""],["Tsai","Yu-Dai",""]]}
{"id":"2308.07952","submitter":"Chih-Hung Wu","authors":"Xi Dong, Grant N. Remmen, Diandian Wang, Wayne W. Weng, and Chih-Hung\n  Wu","title":"Holographic entanglement from the UV to the IR","comments":"29 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In AdS/CFT, observables on the boundary are invariant under renormalization\ngroup (RG) flow in the bulk. In this paper, we study holographic entanglement\nentropy under bulk RG flow and find that it is indeed invariant. We focus on\ntree-level RG flow, where massive fields in a UV theory are integrated out to\ngive the IR theory. We explicitly show that in several simple examples,\nholographic entanglement entropy calculated in the UV theory agrees with that\ncalculated in the IR theory. Moreover, we give an argument for this agreement\nto hold for general tree-level RG flow. Along the way, we generalize the\nreplica method of calculating holographic entanglement entropy to bulk theories\nthat include matter fields with nonzero spin.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dong","Xi",""],["Remmen","Grant N.",""],["Wang","Diandian",""],["Weng","Wayne W.",""],["Wu","Chih-Hung",""]]}
{"id":"2308.07953","submitter":"Andreas Crivellin","authors":"Sumit Banik, Guglielmo Coloretti, Andreas Crivellin, Bruce Mellado","title":"Uncovering New Higgses in the LHC Analyses of Differential $t\\bar t$\n  Cross Sections","comments":"8 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":"PSI-PR-23-30, ZU-TH 46/23, ICPP-72","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Statistically significant tensions between the Standard Model (SM)\npredictions and the measured lepton distributions in differential top\ncross-sections emerged in LHC Run~1 data and became even more pronounced in\nRun~2 analyses. Due to the level of sophistication of the SM predictions and\nthe performance of the ATLAS and CMS detectors, this is very remarkable.\nTherefore, one should seriously consider the possibility that these\nmeasurements are contaminated by beyond-the-SM contributions. In this article,\nwe use differential lepton distributions from the latest ATLAS $t\\bar t$\nanalysis to study a new physics benchmark model motivated by existing\nindications for new Higgses: a new scalar $H$ is produced via gluon fusion and\ndecays to $S^\\prime$ ($95\\,$GeV) and $S$ ($152\\,$GeV), which subsequently decay\nto $b\\bar b$ and $WW$, respectively. In this setup, the total $\\chi^2$ is\nreduced, compared to the SM, resulting in $\\Delta\\chi^2=34$ to\n$\\Delta\\chi^2=158$, depending on the SM simulation used. Notably, allowing\n$m_S$ to vary, the combination of the distributions points towards\n$m_S\\!\\approx\\!150\\,$GeV which is consistent with the existing $\\gamma \\gamma$\nand $WW$ signals, rendering a mismodelling of the SM unlikely. Averaging the\nresults of the different SM predictions, a non-vanishing cross-section for\n$pp\\to H\\to SS^\\prime\\to b\\bar b WW$ of $\\approx\\!13$pb is preferred. If\n$S^\\prime$ is SM-like, this cross-section, at the same time explains the\n$95\\,$GeV $\\gamma\\gamma$ excess, while the dominance of $S\\to WW$ suggests that\n$S$ is the neutral component of the $SU(2)_L$ triplet with hypercharge~0.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Banik","Sumit",""],["Coloretti","Guglielmo",""],["Crivellin","Andreas",""],["Mellado","Bruce",""]]}
{"id":"2308.07954","submitter":"Hyun Park","authors":"Hyun Park, Parth Patel, Roland Haas, E. A. Huerta","title":"APACE: AlphaFold2 and advanced computing as a service for accelerated\n  discovery in biophysics","comments":"7 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.AI cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prediction of protein 3D structure from amino acid sequence is a\ncomputational grand challenge in biophysics, and plays a key role in robust\nprotein structure prediction algorithms, from drug discovery to genome\ninterpretation. The advent of AI models, such as AlphaFold, is revolutionizing\napplications that depend on robust protein structure prediction algorithms. To\nmaximize the impact, and ease the usability, of these novel AI tools we\nintroduce APACE, AlphaFold2 and advanced computing as a service, a novel\ncomputational framework that effectively handles this AI model and its TB-size\ndatabase to conduct accelerated protein structure prediction analyses in modern\nsupercomputing environments. We deployed APACE in the Delta supercomputer, and\nquantified its performance for accurate protein structure predictions using\nfour exemplar proteins: 6AWO, 6OAN, 7MEZ, and 6D6U. Using up to 200 ensembles,\ndistributed across 50 nodes in Delta, equivalent to 200 A100 NVIDIA GPUs, we\nfound that APACE is up to two orders of magnitude faster than off-the-shelf\nAlphaFold2 implementations, reducing time-to-solution from weeks to minutes.\nThis computational approach may be readily linked with robotics laboratories to\nautomate and accelerate scientific discovery.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Park","Hyun",""],["Patel","Parth",""],["Haas","Roland",""],["Huerta","E. A.",""]]}
{"id":"2308.07955","submitter":"Haidar Esseili","authors":"Haidar Esseili and Graham D. Kribs","title":"Cosmological Implications of Gauged $U(1)_{B-L}$ on $\\Delta N_{\\rm eff}$\n  in the CMB and BBN","comments":"48 pages, 9 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 calculate the effects of a light, very weakly-coupled boson $X$ arising\nfrom a spontaneously broken $U(1)_{B-L}$ symmetry on $\\Delta N_{\\rm eff}$ as\nmeasured by the CMB and $Y_p$ from BBN. Our focus is the mass range $1 \\; {\\rm\neV} \\lesssim m_X \\lesssim 100 \\; {\\rm MeV}$; masses lighter than about an ${\\rm\neV}$ have strong constraints from fifth-force law constraints, while masses\nheavier than about $100$~MeV are constrained by other probes. We do not assume\n$X$ began in thermal equilibrium with the SM; instead, we allow $X$ to\nfreeze-in from its very weak interactions with the SM. We find $U(1)_{B-L}$ is\nmore strongly constrained by $\\Delta N_{\\rm eff}$ than previously considered.\nThe bounds arise from the energy density in electrons and neutrinos slowly\nsiphoned off into $X$ bosons, which become nonrelativistic, redshift as matter,\nand then decay, dumping their slightly larger energy density back into the SM\nbath causing $\\Delta N_{\\rm eff} > 0$. While some of the parameter space has\ncomplementary constraints from stellar cooling, supernova emission, and\nterrestrial experiments, we find future CMB observatories can access regions of\nmass and coupling space not probed by any other method. In gauging\n$U(1)_{B-L}$, we assume the $[U(1)_{B-L}]^3$ anomaly is canceled by\nright-handed neutrinos, and so our $\\Delta N_{\\rm eff}$ calculations have been\ncarried out in two scenarios: neutrinos have Dirac masses, or, right-handed\nneutrinos acquire Majorana masses. In the latter scenario, we comment on the\nadditional implications of thermalized right-handed neutrinos decaying during\nBBN. We also briefly consider the possibility that $X$ decays into dark sector\nstates. If these states behave as radiation, we find weaker constraints,\nwhereas if they are massive, there are stronger constraints, though now from\n$\\Delta N_{\\rm eff} < 0$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Esseili","Haidar",""],["Kribs","Graham D.",""]]}
{"id":"2308.07956","submitter":"Fuchuan Wei","authors":"Fuchuan Wei, Zhenhuan Liu, Guoding Liu, Zizhao Han, Xiongfeng Ma,\n  Dong-Ling Deng, Zhengwei Liu","title":"Realizing Non-Physical Actions through Hermitian-Preserving Map\n  Exponentiation","comments":"34 pages, 10 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum mechanics features a variety of distinct properties such as coherence\nand entanglement, which could be explored to showcase potential advantages over\nclassical counterparts in information processing. In general, legitimate\nquantum operations must adhere to principles of quantum mechanics, particularly\nthe requirements of complete positivity and trace preservation. Nonetheless,\nnon-physical maps, especially Hermitian-preserving maps, play a crucial role in\nquantum information science. To date, there exists no effective method for\nimplementing these non-physical maps with quantum devices. In this work, we\nintroduce the Hermitian-preserving map exponentiation algorithm, which can\neffectively realize the action of an arbitrary Hermitian-preserving map by\nencoding its output into a quantum process. We analyze the performances of this\nalgorithm, including its sample complexity and robustness, and prove its\noptimality in certain cases. When combined with algorithms such as the Hadamard\ntest and quantum phase estimation, it allows for the extraction of information\nand generation of states from outputs of Hermitian-preserving maps, enabling\nvarious applications. Utilizing positive but not completely positive maps, this\nalgorithm provides exponential advantages in entanglement detection and\nquantification compared to protocols based on single-copy operations. In\naddition, it facilitates the recovery of noiseless quantum states from multiple\ncopies of noisy states by implementing the inverse map of the corresponding\nnoise channel, offering an intriguing approach to handling quantum errors. Our\nfindings present a pathway for systematically and efficiently implementing\nnon-physical actions with quantum devices, thereby boosting the exploration of\npotential quantum advantages across a wide range of information processing\ntasks.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wei","Fuchuan",""],["Liu","Zhenhuan",""],["Liu","Guoding",""],["Han","Zizhao",""],["Ma","Xiongfeng",""],["Deng","Dong-Ling",""],["Liu","Zhengwei",""]]}
{"id":"2308.07957","submitter":"Nadia Ott","authors":"Ron Donagi and Nadia Ott","title":"Supermoduli Space with Ramond punctures is not projected","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The supermoduli space $\\frak{M}_{g,0,2r}$ is not projected for all $g \\ge 5r\n+1 \\ge 6$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Donagi","Ron",""],["Ott","Nadia",""]]}
{"id":"2308.07958","submitter":"Tong-Zhi Yang","authors":"Thomas Gehrmann, Andreas von Manteuffel, Vasily Sotnikov, Tong-Zhi\n  Yang","title":"Complete $N_f^2$ contributions to four-loop pure-singlet splitting\n  functions","comments":"25 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"MSUHEP-23-024, ZU-TH 43/23","categories":"hep-ph hep-th nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The scale evolution of parton distributions is determined by universal\nsplitting functions. As a milestone towards the computation of these functions\nto four-loop order in QCD, we compute all contributions to the pure-singlet\nquark-quark splitting functions that involve two closed fermion loops. The\nsplitting functions are extracted from the pole terms of off-shell operator\nmatrix elements, and the workflow for their calculation is outlined. We\nreproduce known results for the non-singlet four-loop splitting functions and\nvalidate our new pure-singlet results against fixed Mellin moments.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gehrmann","Thomas",""],["von Manteuffel","Andreas",""],["Sotnikov","Vasily",""],["Yang","Tong-Zhi",""]]}
{"id":"2308.07959","submitter":"Prasun Dhang","authors":"Prasun Dhang, Abhijit Bendre, Kandaswamy Subramanian","title":"Shedding light on the MRI driven dynamo in a stratified shearing box","comments":"16 pages, 13 figures, submitted to MNRAS, Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the magneto-rotational instability (MRI) driven dynamo in a\ngeometrically thin disc ($H/R\\ll 1$) using stratified zero net flux (ZNF)\nshearing box simulations. We find that mean fields and EMFs oscillate with a\nprimary frequency $f_{\\rm dyn} = 0.017$ ($\\approx 9$ orbital period), but also\nhave higher harmonics at $3f_{\\rm dyn}$. Correspondingly, the current helicity,\nhas two frequencies $2f_{\\rm dyn}$ and $4f_{\\rm dyn}$ respectively, which\nappear to be the beat frequencies of mean fields and EMFs as expected from the\nmagnetic helicity density evolution equation. Further, we adopt a novel\ninversion algorithm called the `Iterative Removal Of Sources' (IROS), to\nextract the turbulent dynamo coefficients in the mean-field closure using the\nmean magnetic fields and EMFs obtained from the shearing box simulation. We\nshow that an $\\alpha-$effect ($\\alpha_{yy}$) is predominantly responsible for\nthe creation of the poloidal field from the toroidal field, while shear\ngenerates back a toroidal field from the poloidal field; indicating that an\n$\\alpha-\\Omega$-type dynamo is operative in MRI-driven accretion discs. We also\nfind that both strong outflow ($\\bar{v}_z$) and turbulent pumping ($\\gamma_z$ )\ntransport mean fields away from the mid-plane. Instead of turbulent\ndiffusivity, they are the principal sink terms in the mean magnetic energy\nevolution equation. We find encouraging evidence that a generative helicity\nflux is responsible for the effective $\\alpha$-effect. Finally, we point out\npotential limitations of horizontal ($x-y$) averaging in defining the `mean' on\nthe extraction of dynamo coefficients and their physical interpretations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dhang","Prasun",""],["Bendre","Abhijit",""],["Subramanian","Kandaswamy",""]]}
{"id":"2308.07960","submitter":"Julia C. Santos","authors":"Julia C. Santos, Harold Linnartz, Ko-Ju Chuang","title":"Interaction of H$_2$S with H atoms on grain surfaces under molecular\n  cloud conditions","comments":"11 pages, 9 Figures, 3 Tables. Accepted for publication in Astronomy\n  and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogen sulfide (H$_2$S) is thought to be efficiently formed on grain\nsurfaces through the successive hydrogenation of S atoms. Its non-detection so\nfar in astronomical observations of icy dust mantles thus indicates that\neffective destruction pathways must play a significant role in its interstellar\nabundance. While chemical desorption has been shown to remove H$_2$S very\nefficiently from the ice, in line with H$_2$S gas-phase detections, possible\nsolid-state chemistry triggered by the related HS radical have been largely\ndisregarded so far -- despite it being an essential intermediate in the H$_2$S\n+ H reaction scheme. We aim to thoroughly investigate the fate of H$_2$S upon\nH-atom impact under molecular cloud conditions, providing a comprehensive\nanalysis combined with detailed quantification of both the chemical desorption\nand ice chemistry that ensues. Experiments are performed in an ultrahigh vacuum\nchamber at temperatures between 10--16 K. The changes in the solid phase during\nH-atom bombardment are monitored in situ by means of reflection absorption\ninfrared spectroscopy (RAIRS), and desorbed species are measured with a\nquadrupole mass spectrometer (QMS). We confirm the formation of H$_2$S$_2$ via\nreactions involving H$_2$S + H, and quantify its formation cross section under\nthe employed experimental conditions. Additionally, we directly assess the\nchemical desorption of H$_2$S by measuring the gas-phase desorption signals\nwith the QMS, providing unambiguous desorption cross sections. Chemical\ndesorption of H$_2$S$_2$ was not observed. The relative decrease of H$_2$S ices\nby chemical desorption changes from ~85% to ~74% between temperatures of 10 and\n16 K, while the decrease as the result of H$_2$S$_2$ formation is enhanced from\n~5% to ~26%, suggesting an increasingly relevant sulfur chemistry induced by HS\nradicals at warmer environments. The astronomical implications are further\ndiscussed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Santos","Julia C.",""],["Linnartz","Harold",""],["Chuang","Ko-Ju",""]]}
{"id":"2308.07961","submitter":"Oladunjoye Awoga","authors":"Oladunjoye A. Awoga and Ioannis Ioannidis and Archana Mishra and\n  Martin Leijnse and Mircea Trif and Thore Posske","title":"Controlling Majorana hybridization in magnetic chain-superconductor\n  systems","comments":"10 pages, 4 figures + supplementary (6 pages)","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":"  We propose controlling the hybridization between Majorana zero modes at the\nends of magnetic adatom chains on superconductors by an additional magnetic\nadatom deposited close by. By tuning the additional adatom's magnetization,\nposition, and coupling to the superconductor, we can couple and decouple the\nMajorana modes as well as control the ground state parity. The scheme is\nindependent of microscopic details in ferromagnetic and helical magnetic chains\non superconductors with and without spin-orbit coupling, which we show by\nstudying their full microscopic models and their common low-energy description.\nOur results show that scanning tunneling microscopy and electron spin resonance\ntechniques are promising tools for controlling the Majorana hybridization in\nmagnetic adatoms-superconductor setups, providing a basis for Majorana parity\nmeasurements, fusion, and braiding techniques.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:01:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Awoga","Oladunjoye A.",""],["Ioannidis","Ioannis",""],["Mishra","Archana",""],["Leijnse","Martin",""],["Trif","Mircea",""],["Posske","Thore",""]]}
{"id":"2308.07962","submitter":"Alice Desmons Ms","authors":"Alice Desmons, Sarah Brough, Francois Lanusse","title":"Detecting Galaxy Tidal Features Using Self-Supervised Representation\n  Learning","comments":"11 pages, submitted to MNRAS. arXiv admin note: text overlap with\n  arXiv:2307.04967","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low surface brightness substructures around galaxies, known as tidal\nfeatures, are a valuable tool in the detection of past or ongoing galaxy\nmergers, and their properties can answer questions about the progenitor\ngalaxies involved in the interactions. The assembly of current tidal feature\nsamples is primarily achieved using visual classification, making it difficult\nto construct large samples and draw accurate and statistically robust\nconclusions about the galaxy evolution process. With upcoming large optical\nimaging surveys such as the Vera C. Rubin Observatory Legacy Survey of Space\nand Time (LSST), predicted to observe billions of galaxies, it is imperative\nthat we refine our methods of detecting and classifying samples of merging\ngalaxies. This paper presents promising results from a self-supervised machine\nlearning model, trained on data from the Ultradeep layer of the Hyper\nSuprime-Cam Subaru Strategic Program optical imaging survey, designed to\nautomate the detection of tidal features. We find that self-supervised models\nare capable of detecting tidal features, and that our model outperforms\nprevious automated tidal feature detection methods, including a fully\nsupervised model. An earlier method achieved 76% completeness for 22%\ncontamination, while our model achieves considerably higher (96%) completeness\nfor the same level of contamination. We emphasise a number of advantages of\nself-supervised models over fully supervised models including maintaining\nexcellent performance when using only 50 labelled examples for training, and\nthe ability to perform similarity searches using a single example of a galaxy\nwith tidal features.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:01:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Desmons","Alice",""],["Brough","Sarah",""],["Lanusse","Francois",""]]}
{"id":"2308.07963","submitter":"Nishita Jadoo","authors":"Nishita Jadoo, J. David Brown, Charles R. Evans","title":"Extended body dynamics in general relativity: hyperelastic models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a numerical framework for modeling extended hyperelastic bodies\nbased on a Lagrangian formulation of general relativistic elasticity theory. We\nuse finite element methods to discretize the body, then use the semi--discrete\naction to derive ordinary differential equations of motion for the discrete\nnodes. The nodes are evolved in time using fourth--order Runge--Kutta. We\nvalidate our code against the normal modes of oscillation of a hyperelastic\nsphere, which are known analytically in the limit of small (linear), slow\n(Newtonian) oscillations. The algorithm displays second order convergence. This\nnumerical framework can be used to obtain the orbital motion and internal\ndynamics of a hyperelastic body of any shape, for any spacetime metric, and for\nvarying hyperelastic energy models.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:01:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jadoo","Nishita",""],["Brown","J. David",""],["Evans","Charles R.",""]]}
{"id":"2308.07964","submitter":"Guglielmo Mazzola","authors":"Guglielmo Mazzola","title":"Quantum computing for chemistry and physics applications from a Monte\n  Carlo perspective","comments":"18 pages, 3 figures. Added new references, fixed some typos","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This Perspective focuses on the several overlaps between quantum algorithms\nand Monte Carlo methods in the domains of physics and chemistry. We will\nanalyze the challenges and possibilities of integrating established quantum\nMonte Carlo solutions in quantum algorithms. These include refined energy\nestimators, parameter optimization, real and imaginary-time dynamics, and\nvariational circuits. Conversely, we will review new ideas in utilizing quantum\nhardware to accelerate the sampling in statistical classical models, with\napplications in physics, chemistry, optimization, and machine learning. This\nreview aims to be accessible to both communities and intends to foster further\nalgorithmic developments at the intersection of quantum computing and Monte\nCarlo methods. Most of the works discussed in this Perspective have emerged\nwithin the last two years, indicating a rapidly growing interest in this\npromising area of research.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:01:28 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 08:21:26 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 11:53:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mazzola","Guglielmo",""]]}
{"id":"2308.07965","submitter":"Mehmet Akif Keskiner","authors":"M. A. Keskiner, O. Erten, M. \\\"O. Oktel","title":"A Kitaev-type spin liquid on a quasicrystal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop an exactly solvable model with Kitaev-type interactions and study\nits phase diagram on the dual lattice of the quasicrystalline Ammann-Beenker\nlattice. Our construction is based on the $\\Gamma$-matrix generalization of the\nKitaev model and utilizes the cut-and-project correspondence between the\nfour-dimensional simple cubic lattice and the Ammann-Beenker lattice to\ndesignate four types of bonds. We obtain a rich phase diagram with gapped\n(chiral and abelian) and gapless spin liquid phases via Monte Carlo simulations\nand variational analysis. We show that the ground state can be further tuned by\nthe inclusion of an onsite term that selects 21 different vison configurations\nwhile maintaining the integrability of the model. Our results highlight the\nrich physics at the intersection of quasicrystals and quantum magnetism.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:01:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Keskiner","M. A.",""],["Erten","O.",""],["Oktel","M. \u00d6.",""]]}
{"id":"2308.07966","submitter":"Jacob Ginesin","authors":"Jacob Ginesin, Jelena Mirkovic","title":"Understanding DNS Query Composition at B-Root","comments":"20 pages with 18 figures and 1 table. Published and presented at the\n  2022 IEEE/ACM International Conference on Big Data Computing, Applications\n  and Technologies (BDCAT)","journal-ref":null,"doi":"10.1109/BDCAT56447.2022.00044","report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Domain Name System (DNS) is part of critical internet infrastructure, as\nDNS is invoked whenever a remote server is accessed (an URL is visited, an API\nrequest is made, etc.) by any application. DNS queries are served in\nhierarchical manner, with most queries served locally from cached data, and a\nsmall fraction propagating to the top of the hierarchy - DNS root name servers.\nOur research aims to provide a comprehensive, longitudinal characterization of\nDNS queries received at B-Root over ten years. We sampled and analyzed a\n28-billion-query large dataset from the ten annual Day in the Life of the\nInternet (DITL) experiments from 2013 through 2022. We sought to identify and\nquantify unexpected DNS queries, establish longitudinal trends, and compare our\nfindings with published results of others. We found that unexpected query\ntraffic increased from 39.57% in 2013 to 67.91% in 2022, with 36.55% of queries\nbeing priming queries. We also observed growth and decline of\nChromium-initiated, random DNS queries. Finally, we analyzed the largest DNS\nquery senders and established that most of their traffic consists of unexpected\nqueries.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:02:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ginesin","Jacob",""],["Mirkovic","Jelena",""]]}
{"id":"2308.07967","submitter":"Messaoud Bengherabi Mr.","authors":"Messaoud Bengherabi, Douaa Laib, Fella Souhila Lasnami, Ryma Boussaha","title":"Boosting Cross-Quality Face Verification using Blind Face Restoration","comments":"paper accepted at BIOSIG 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, various Blind Face Restoration (BFR) techniques were\ndeveloped. These techniques transform low quality faces suffering from multiple\ndegradations to more realistic and natural face images with high perceptual\nquality. However, it is crucial for the task of face verification to not only\nenhance the perceptual quality of the low quality images but also to improve\nthe biometric-utility face quality metrics. Furthermore, preserving the\nvaluable identity information is of great importance. In this paper, we\ninvestigate the impact of applying three state-of-the-art blind face\nrestoration techniques namely, GFP-GAN, GPEN and SGPN on the performance of\nface verification system under very challenging environment characterized by\nvery low quality images. Extensive experimental results on the recently\nproposed cross-quality LFW database using three state-of-the-art deep face\nrecognition models demonstrate the effectiveness of GFP-GAN in boosting\nsignificantly the face verification accuracy.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:05:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bengherabi","Messaoud",""],["Laib","Douaa",""],["Lasnami","Fella Souhila",""],["Boussaha","Ryma",""]]}
{"id":"2308.07968","submitter":"Cheng Li","authors":"Cheng Li, Mingyang Zhang, Qiaozhu Mei, Yaqing Wang, Spurthi Amba\n  Hombaiah, Yi Liang, Michael Bendersky","title":"Teach LLMs to Personalize -- An Approach inspired by Writing Education","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Personalized text generation is an emerging research area that has attracted\nmuch attention in recent years. Most studies in this direction focus on a\nparticular domain by designing bespoke features or models. In this work, we\npropose a general approach for personalized text generation using large\nlanguage models (LLMs). Inspired by the practice of writing education, we\ndevelop a multistage and multitask framework to teach LLMs for personalized\ngeneration. In writing instruction, the task of writing from sources is often\ndecomposed into multiple steps that involve finding, evaluating, summarizing,\nsynthesizing, and integrating information. Analogously, our approach to\npersonalized text generation consists of multiple stages: retrieval, ranking,\nsummarization, synthesis, and generation. In addition, we introduce a multitask\nsetting that helps the model improve its generation ability further, which is\ninspired by the observation in education that a student's reading proficiency\nand writing ability are often correlated. We evaluate our approach on three\npublic datasets, each of which covers a different and representative domain.\nOur results show significant improvements over a variety of baselines.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:06:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Cheng",""],["Zhang","Mingyang",""],["Mei","Qiaozhu",""],["Wang","Yaqing",""],["Hombaiah","Spurthi Amba",""],["Liang","Yi",""],["Bendersky","Michael",""]]}
{"id":"2308.07969","submitter":"Jabir Chathanathil","authors":"Aneesh Ramaswamy, Jabir Chathanathil, Dimitra Kanta, Emmanuel Klinger,\n  Aram Papoyan, Svetlana Shmavonyan, Aleksandr Khanbekyan, Arne Wickenbrock,\n  Dmitry Budker, Svetlana A. Malinovskaya","title":"Mirrorless lasing: a theoretical perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mirrorless lasing has been a topic of particular interest for about a decade\ndue to promising new horizons for quantum science and applications. In this\nwork, we review first-principles theory that describes this phenomenon, and\ndiscuss degenerate mirrorless lasing in a vapor of Rb atoms, the mechanisms of\namplification of light generated in the medium with population inversion\nbetween magnetic sublevels within the $D_2$ line, and challenges associated\nwith experimental realization.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:09:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ramaswamy","Aneesh",""],["Chathanathil","Jabir",""],["Kanta","Dimitra",""],["Klinger","Emmanuel",""],["Papoyan","Aram",""],["Shmavonyan","Svetlana",""],["Khanbekyan","Aleksandr",""],["Wickenbrock","Arne",""],["Budker","Dmitry",""],["Malinovskaya","Svetlana A.",""]]}
{"id":"2308.07970","submitter":"Hanieh Rafiee","authors":"Hanieh Rafiee, Mojtaba Mahdavi, AhmadReza NaghshNilchi","title":"Introducing a New Evaluation Criteria for EMD-Base Steganography Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.MM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Steganography is a technique to hide the presence of secret communication.\nWhen one of the communication elements is under the influence of the enemy, it\ncan be used. The main measure to evaluate steganography methods in a certain\ncapacity is security. Therefore, in a certain capacity, reducing the amount of\nchanges in the cover media, creates a higher embedding efficiency and thus more\nsecurity of an steganography method. Mostly, security and capacity are in\nconflict with each other, the increase of one lead to the decrease of the\nother. The presence of a single criterion that represents security and capacity\nat the same time be useful in comparing steganography methods. EMD and the\nrelevant methods are a group of steganography techniques, which optimize the\namount of changes resulting from embedding (security). The present paper is\naimed to provide an evaluation criterion for this group of steganography\nmethods. In this study, after a general review and comparison of EMD-based\nsteganography techniques, we present a method to compare them exactly, from the\nperspective of embedding efficiency. First, a formula is presented to determine\nthe value of embedding efficiency, which indicates the effect of one or more\nchanges on one or more pixels. The results demonstrate that the proposed\nembedding efficiency formula shows the performance of the methods better when\nseveral changes are made on a pixel compared to the existing criteria. In the\nsecond step, we have obtained an upper bound, which determines the best\nefficiency for each certain capacity. Finally, based on the introduced bound,\nanother evaluation criterion for a better comparison of the methods is\npresented.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:17:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rafiee","Hanieh",""],["Mahdavi","Mojtaba",""],["NaghshNilchi","AhmadReza",""]]}
{"id":"2308.07971","submitter":"Gideon Maillette de Buy Wenniger","authors":"Gideon Maillette de Buy Wenniger, Thomas van Dongen, Lambert Schomaker","title":"MultiSChuBERT: Effective Multimodal Fusion for Scholarly Document\n  Quality Prediction","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":"  Automatic assessment of the quality of scholarly documents is a difficult\ntask with high potential impact. Multimodality, in particular the addition of\nvisual information next to text, has been shown to improve the performance on\nscholarly document quality prediction (SDQP) tasks. We propose the multimodal\npredictive model MultiSChuBERT. It combines a textual model based on chunking\nfull paper text and aggregating computed BERT chunk-encodings (SChuBERT), with\na visual model based on Inception V3.Our work contributes to the current\nstate-of-the-art in SDQP in three ways. First, we show that the method of\ncombining visual and textual embeddings can substantially influence the\nresults. Second, we demonstrate that gradual-unfreezing of the weights of the\nvisual sub-model, reduces its tendency to ovefit the data, improving results.\nThird, we show the retained benefit of multimodality when replacing standard\nBERT$_{\\textrm{BASE}}$ embeddings with more recent state-of-the-art text\nembedding models.\n  Using BERT$_{\\textrm{BASE}}$ embeddings, on the (log) number of citations\nprediction task with the ACL-BiblioMetry dataset, our MultiSChuBERT\n(text+visual) model obtains an $R^{2}$ score of 0.454 compared to 0.432 for the\nSChuBERT (text only) model. Similar improvements are obtained on the PeerRead\naccept/reject prediction task. In our experiments using SciBERT, scincl,\nSPECTER and SPECTER2.0 embeddings, we show that each of these tailored\nembeddings adds further improvements over the standard BERT$_{\\textrm{BASE}}$\nembeddings, with the SPECTER2.0 embeddings performing best.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:18:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wenniger","Gideon Maillette de Buy",""],["van Dongen","Thomas",""],["Schomaker","Lambert",""]]}
{"id":"2308.07972","submitter":"Yuan Huang","authors":"Yuan Huang, Cheng-Tien Tsao, Kairui Gu, and Hee-Hyol Lee","title":"PKE-RRT: Efficient Multi-Goal Path Finding Algorithm Driven by\n  Multi-Task Learning Model","comments":"9 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-goal path finding (MGPF) aims to find a closed and collision-free path\nto visit a sequence of goals orderly. As a physical travelling salesman\nproblem, an undirected complete graph with accurate weights is crucial for\ndetermining the visiting order. Lack of prior knowledge of local paths between\nvertices poses challenges in meeting the optimality and efficiency requirements\nof algorithms. In this study, a multi-task learning model designated Prior\nKnowledge Extraction (PKE), is designed to estimate the local path length\nbetween pairwise vertices as the weights of the graph. Simultaneously, a\npromising region and a guideline are predicted as heuristics for the\npath-finding process. Utilizing the outputs of the PKE model, a variant of\nRapidly-exploring Random Tree (RRT) is proposed known as PKE-RRT. It\neffectively tackles the MGPF problem by a local planner incorporating a\nprioritized visiting order, which is obtained from the complete graph.\nFurthermore, the predicted region and guideline facilitate efficient\nexploration of the tree structure, enabling the algorithm to rapidly provide a\nsub-optimal solution. Extensive numerical experiments demonstrate the\noutstanding performance of the PKE-RRT for the MGPF problem with a different\nnumber of goals, in terms of calculation time, path cost, sample number, and\nsuccess rate.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:21:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Yuan",""],["Tsao","Cheng-Tien",""],["Gu","Kairui",""],["Lee","Hee-Hyol",""]]}
{"id":"2308.07973","submitter":"Sandeep Singamsetty","authors":"Sandeep Singamsetty, Nishtha Madaan, Sameep Mehta, Varad Bhatnagar,\n  Pushpak Bhattacharyya","title":"\"Beware of deception\": Detecting Half-Truth and Debunking it through\n  Controlled Claim Editing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prevalence of half-truths, which are statements containing some truth but\nthat are ultimately deceptive, has risen with the increasing use of the\ninternet. To help combat this problem, we have created a comprehensive pipeline\nconsisting of a half-truth detection model and a claim editing model. Our\napproach utilizes the T5 model for controlled claim editing; \"controlled\" here\nmeans precise adjustments to select parts of a claim. Our methodology achieves\nan average BLEU score of 0.88 (on a scale of 0-1) and a disinfo-debunk score of\n85% on edited claims. Significantly, our T5-based approach outperforms other\nLanguage Models such as GPT2, RoBERTa, PEGASUS, and Tailor, with average\nimprovements of 82%, 57%, 42%, and 23% in disinfo-debunk scores, respectively.\nBy extending the LIAR PLUS dataset, we achieve an F1 score of 82% for the\nhalf-truth detection model, setting a new benchmark in the field. While\nprevious attempts have been made at half-truth detection, our approach is, to\nthe best of our knowledge, the first to attempt to debunk half-truths.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:21:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Singamsetty","Sandeep",""],["Madaan","Nishtha",""],["Mehta","Sameep",""],["Bhatnagar","Varad",""],["Bhattacharyya","Pushpak",""]]}
{"id":"2308.07974","submitter":"Yuan Huang","authors":"Yuan Huang, Cheng-Tien Tsao, Tianyu Shen, and Hee-Hyol Lee","title":"Neural-Network-Driven Method for Optimal Path Planning via High-Accuracy\n  Region Prediction","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sampling-based path planning algorithms suffer from heavy reliance on uniform\nsampling, which accounts for unreliable and time-consuming performance,\nespecially in complex environments. Recently, neural-network-driven methods\npredict regions as sampling domains to realize a non-uniform sampling and\nreduce calculation time. However, the accuracy of region prediction hinders\nfurther improvement. We propose a sampling-based algorithm, abbreviated to\nRegion Prediction Neural Network RRT* (RPNN-RRT*), to rapidly obtain the\noptimal path based on a high-accuracy region prediction. First, we implement a\nregion prediction neural network (RPNN), to predict accurate regions for the\nRPNN-RRT*. A full-layer channel-wise attention module is employed to enhance\nthe feature fusion in the concatenation between the encoder and decoder.\nMoreover, a three-level hierarchy loss is designed to learn the pixel-wise,\nmap-wise, and patch-wise features. A dataset, named Complex Environment Motion\nPlanning, is established to test the performance in complex environments.\nAblation studies and test results show that a high accuracy of 89.13% is\nachieved by the RPNN for region prediction, compared with other region\nprediction models. In addition, the RPNN-RRT* performs in different complex\nscenarios, demonstrating significant and reliable superiority in terms of the\ncalculation time, sampling efficiency, and success rate for optimal path\nplanning.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:23:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Yuan",""],["Tsao","Cheng-Tien",""],["Shen","Tianyu",""],["Lee","Hee-Hyol",""]]}
{"id":"2308.07975","submitter":"Alexander O. Korotkevich","authors":"Alexander O. Korotkevich (University of New Mexico, USA, and L.D.\n  Landau Institute for Theoretical Physics RAS, Moscow region, Russia)","title":"Optimizing the size of array for modern discrete Fourier transform\n  libraries","comments":"12 pages, 1 table, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of optimization of the array size for modern discrete Fourier\ntransform libraries is considered and reformulated as an integer linear\nprogramming problem. Acceleration of finding an optimal solution using standard\nfreely available library with respect to brute force approach is demonstrated.\nAd hoc recursive algorithm of finding the optimal solution is proposed,\ncomplexity scaling of the algorithm is estimated analytically. The problem can\nbe used in a linear programming class as an example of purely integer\nprogramming problem (continuous linear programming solution has no sense),\nsimple enough to be solved using even interpreting programming languages like\nPython or Matlab.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:25:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Korotkevich","Alexander O.","","University of New Mexico, USA, and L.D.\n  Landau Institute for Theoretical Physics RAS, Moscow region, Russia"]]}
{"id":"2308.07976","submitter":"Farshad Samadifam","authors":"Farshad Samadifam, Ehsan Ghafourian","title":"Mathematical modeling of the treatment response of resection plus\n  combined chemotherapy and different types of radiation therapy in a\n  glioblastoma patient","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.OT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Background: Gliomas are the most common brain tumors, which vary from low to\nhigh-grade. Despite the improvements in imaging techniques in the last decade,\nall parts of the tumor are not visible in these images, due to having a\nthreshold of detection often lower than most of the tumor. Method: We simulated\na brain domain to model heterogeneous growth plus gross total resection\nfollowing concurrent chemo- and radiation therapy and adjuvant chemotherapy\nusing temozolomide for a patient, diagnosed with glioblastoma, for different\nradiobiological alpha parameter as high, medium, and low sensitivity. The\nextent of difference in the result of treatment, area of the tumor, and\nsurvival time relating to those sensitivity parameters were shown. Moreover,\nbased on the threshold of detection of MRI (T1Gd), the area of the tumor\nvisible to this imaging technique was simulated. Furthermore, the extent of\ndifference in the result of treatment for both conventional and\nhyperfractionated radiotherapy was investigated. Conclusion: The survival time\nof patient was increased by 2 months and more than 3 months at the lowest and\nhighest sensitivity of radiation therapy, respectively.The result showed\nhyperfractionated radiotherapy was more effective than conventional\nradiotherapy in reducing the concentration of cancerous cells,as\nhyperfractionated method allows administration of higher total dose.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:26:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Samadifam","Farshad",""],["Ghafourian","Ehsan",""]]}
{"id":"2308.07977","submitter":"Brian Moser","authors":"Brian B. Moser, Stanislav Frolov, Federico Raue, Sebastian Palacio and\n  Andreas Dengel","title":"YODA: You Only Diffuse Areas. An Area-Masked Diffusion Approach For\n  Image Super-Resolution","comments":"Brian B. Moser and Stanislav Frolov contributed equally","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work introduces \"You Only Diffuse Areas\" (YODA), a novel method for\npartial diffusion in Single-Image Super-Resolution (SISR). The core idea is to\nutilize diffusion selectively on spatial regions based on attention maps\nderived from the low-resolution image and the current time step in the\ndiffusion process. This time-dependent targeting enables a more effective\nconversion to high-resolution outputs by focusing on areas that benefit the\nmost from the iterative refinement process, i.e., detail-rich objects. We\nempirically validate YODA by extending leading diffusion-based SISR methods SR3\nand SRDiff. Our experiments demonstrate new state-of-the-art performance gains\nin face and general SR across PSNR, SSIM, and LPIPS metrics. A notable finding\nis YODA's stabilization effect on training by reducing color shifts, especially\nwhen induced by small batch sizes, potentially contributing to\nresource-constrained scenarios. The proposed spatial and temporal adaptive\ndiffusion mechanism opens promising research directions, including developing\nenhanced attention map extraction techniques and optimizing inference latency\nbased on sparser diffusion.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:27:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Moser","Brian B.",""],["Frolov","Stanislav",""],["Raue","Federico",""],["Palacio","Sebastian",""],["Dengel","Andreas",""]]}
{"id":"2308.07978","submitter":"Rahul Agrawal","authors":"Kiran Jadhav, Rahul Agrawal, and Abhilash J. Chandy","title":"Evaluation of eddy viscosity-based models in decaying rotating\n  stratified turbulence","comments":"12 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The results of large eddy simulation (LES) using three sub-grid scale models,\nnamely: constant coefficient Smagorinsky, dynamic Smagorinsky, and a dynamic\nClark model, for rotating stratified turbulence in the absence of forcing using\nlarge-scale isotropic initial condition, are reported here. The LES results are\ncompared to in-house direct numerical simulation (DNS) for establishing\ngrid-independence requirements. Three cases with varying ratios of\nBrunt-Vaisala frequency to the inertial wave frequency, N / f, have been chosen\nto evaluate the performance of LES models. The Reynolds number and N / f are\nchosen as (a) Case 1: Re = 3704, N / f = 5, (b) Case 2: Re = 6667, N / f = 40,\nand, (c) Case 3: Re = 6667, N / f = 138. This framework is used to illustrate\nthe relative magnitudes of the stratification and rotation which is observed in\ngeophysical flows. Various quantities including turbulent kinetic energy (tke),\nturbulent potential energy (tpe), total dissipation, potential and total energy\nspectra, and their fluxes, are analyzed to understand the predictive capability\nof the various LES models. Results show that all the SGS model predictions are\nvery similar, with the classical Smagorinsky model displaying the highest\ndeviation compared to DNS. The effect of an increase in the value of N / f is\nalso seen in the results of LES with an increase in the oscillations observed\nin the evolution of tke and tpe and a reduction in dissipation. The spectral\nanalysis shows that the dynamic Clark and Smagorinsky models predict the\nlarge-scale physics (\\kappa < 10), while the small scales (10 < \\kappa < 64)\nenergy is under-predicted.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:27:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jadhav","Kiran",""],["Agrawal","Rahul",""],["Chandy","Abhilash J.",""]]}
{"id":"2308.07979","submitter":"Rama K Malladi","authors":"Rama K. Malladi","title":"Emerging Frontiers: Exploring the Impact of Generative AI Platforms on\n  University Quantitative Finance Examinations","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 study evaluated three Artificial Intelligence (AI) large language model\n(LLM) enabled platforms - ChatGPT, BARD, and Bing AI - to answer an\nundergraduate finance exam with 20 quantitative questions across various\ndifficulty levels. ChatGPT scored 30 percent, outperforming Bing AI, which\nscored 20 percent, while Bard lagged behind with a score of 15 percent. These\nmodels faced common challenges, such as inaccurate computations and formula\nselection. While they are currently insufficient for helping students pass the\nfinance exam, they serve as valuable tools for dedicated learners. Future\nadvancements are expected to overcome these limitations, allowing for improved\nformula selection and accurate computations and potentially enabling students\nto score 90 percent or higher.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:27:39 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 04:42:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Malladi","Rama K.",""]]}
{"id":"2308.07980","submitter":"Zichao Meng","authors":"Zichao Meng, Ye Guo, and Hongbin Sun","title":"An Adaptive Approach for Probabilistic Wind Power Forecasting Based on\n  Meta-Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies an adaptive approach for probabilistic wind power\nforecasting (WPF) including offline and online learning procedures. In the\noffline learning stage, a base forecast model is trained via inner and outer\nloop updates of meta-learning, which endows the base forecast model with\nexcellent adaptability to different forecast tasks, i.e., probabilistic WPF\nwith different lead times or locations. In the online learning stage, the base\nforecast model is applied to online forecasting combined with incremental\nlearning techniques. On this basis, the online forecast takes full advantage of\nrecent information and the adaptability of the base forecast model. Two\napplications are developed based on our proposed approach concerning\nforecasting with different lead times (temporal adaptation) and forecasting for\nnewly established wind farms (spatial adaptation), respectively. Numerical\ntests were conducted on real-world wind power data sets. Simulation results\nvalidate the advantages in adaptivity of the proposed methods compared with\nexisting alternatives.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:28:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Meng","Zichao",""],["Guo","Ye",""],["Sun","Hongbin",""]]}
{"id":"2308.07981","submitter":"Steven Silverberg","authors":"Steven M. Silverberg, Hans Moritz Guenther, Pragati Pradhan, David A.\n  Principe, P.C. Schneider, Scott J. Wolk","title":"Stable Coronal X-Ray Emission Over Twenty Years of XZ Tau","comments":"Accepted for publication in the Astronomical Journal. 19 pages, 11\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  XZ Tau AB is a frequently observed binary YSO in the Taurus Molecular Cloud;\nXZ Tau B has been classified as an EXOr object. We present new\nChandra/HETG-ACIS-S observations of XZ Tau AB, complemented with variability\nmonitoring of the system with XMM-Newton, to constrain the variability of this\nsystem and identify high-resolution line diagnostics to better understand the\nunderlying mechanisms that produce the X-rays. We observe two flares with\nXMM-Newton, but find that outside of these flares the coronal X-ray spectrum of\nXZ Tau AB is consistent over twenty years of observations. We compare the\nensemble of XZ Tau X-ray observations over time with the scatter across stars\nobserved in point-in-time observations of the Orion Nebula Cluster and find\nthat both overlap in terms of plasma properties, i.e., some of the scatter\nobserved in the X-ray properties of stellar ensembles stems from intrinsic\nsource variability.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:29:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Silverberg","Steven M.",""],["Guenther","Hans Moritz",""],["Pradhan","Pragati",""],["Principe","David A.",""],["Schneider","P. C.",""],["Wolk","Scott J.",""]]}
{"id":"2308.07982","submitter":"Subhayan Maity","authors":"Subhayan Maity and Sujayita Bakra","title":"The canonical quantization of the cosmic fluid in the pre-inflationary\n  era: a new kind of Emergent Universe","comments":"arXiv admin note: substantial text overlap with arXiv:2304.03914","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The early phase of cosmic evolution is still a great topic of interest to the\ncosmologist community. Especially the mechanism behind the origin of the\nUniverse is yet to be resolved. Most people believe in the Big Bang models\n(singular origin of the Universe), but fewer of the cosmologists support in\nfavor of the non-singular origin of the Universe in their works. These models\nare based on the standard general theory of relativity. In this work, we have\naimed to investigate the nature of the early cosmic evolution from the\ncanonical quantization of the cosmic fluid and importantly to find a probable\nanswer of what the true origin of the Universe is.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:31:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Maity","Subhayan",""],["Bakra","Sujayita",""]]}
{"id":"2308.07983","submitter":"Yazid Janati El Idrissi","authors":"Gabriel Cardoso, Yazid Janati El Idrissi, Sylvain Le Corff, Eric\n  Moulines","title":"Monte Carlo guided Diffusion for Bayesian linear inverse problems","comments":"preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ill-posed linear inverse problems that combine knowledge of the forward\nmeasurement model with prior models arise frequently in various applications,\nfrom computational photography to medical imaging. Recent research has focused\non solving these problems with score-based generative models (SGMs) that\nproduce perceptually plausible images, especially in inpainting problems. In\nthis study, we exploit the particular structure of the prior defined in the SGM\nto formulate recovery in a Bayesian framework as a Feynman--Kac model adapted\nfrom the forward diffusion model used to construct score-based diffusion. To\nsolve this Feynman--Kac problem, we propose the use of Sequential Monte Carlo\nmethods. The proposed algorithm, MCGdiff, is shown to be theoretically grounded\nand we provide numerical simulations showing that it outperforms competing\nbaselines when dealing with ill-posed inverse problems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:32:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cardoso","Gabriel",""],["Idrissi","Yazid Janati El",""],["Corff","Sylvain Le",""],["Moulines","Eric",""]]}
{"id":"2308.07984","submitter":"Henry Conklin","authors":"Nicholas Edwards, Hannah Rohde, and Henry Conklin","title":"Anaphoric Structure Emerges Between Neural Networks","comments":"Published as a conference paper at the Annual Meeting of the\n  Cognitive Science Society 2023: 6 Pages, 3 Figures, code available at\n  https://github.com/hcoxec/emerge","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pragmatics is core to natural language, enabling speakers to communicate\nefficiently with structures like ellipsis and anaphora that can shorten\nutterances without loss of meaning. These structures require a listener to\ninterpret an ambiguous form - like a pronoun - and infer the speaker's intended\nmeaning - who that pronoun refers to. Despite potential to introduce ambiguity,\nanaphora is ubiquitous across human language. In an effort to better understand\nthe origins of anaphoric structure in natural language, we look to see if\nanalogous structures can emerge between artificial neural networks trained to\nsolve a communicative task. We show that: first, despite the potential for\nincreased ambiguity, languages with anaphoric structures are learnable by\nneural models. Second, anaphoric structures emerge between models 'naturally'\nwithout need for additional constraints. Finally, introducing an explicit\nefficiency pressure on the speaker increases the prevalence of these\nstructures. We conclude that certain pragmatic structures straightforwardly\nemerge between neural networks, without explicit efficiency pressures, but that\nthe competing needs of speakers and listeners conditions the degree and nature\nof their emergence.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:34:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Edwards","Nicholas",""],["Rohde","Hannah",""],["Conklin","Henry",""]]}
{"id":"2308.07985","submitter":"Henning Kirchberg","authors":"Henning Kirchberg and Abraham Nitzan","title":"Energy Conversion and Entropy Production in Biased Random Walk Processes\n  -- from Discrete Modeling to the Continuous Limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider discrete and continuous representations of a thermodynamic\nprocess in which a random walker (e.g. a molecular motor on a molecular track)\nuses a periodically pumped energy (work) to pass $N$ sites and move\nenergetically downhill while dissipating heat. Interestingly, we find that,\nstarting from a discrete model, the limit in which the motion becomes\ncontinuous in space and time ($N\\to \\infty$) is not unique and depends on what\nphysical observables are assumed to be unchanged in the process. In particular,\none may (as usually done) choose to keep the speed and diffusion coefficient\nfixed during this limiting process, in which case the entropy production is\naffected. In addition, we study also processes in which the entropy production\nis kept constant as $N\\to \\infty$ at the cost of modified speed or diffusion\ncoefficient. Furthermore, we also combine this dynamics with work against an\nopposing force, which makes it possible to study the effect of discretization\nof the process on the thermodynamic efficiency of transferring power input to\npower output. Interestingly, we find that the efficiency is increased in the\nlimit of $N\\to\\infty$. Finally, we investigate the same process when\ntransitions between sites can only happen at finite time intervals and study\nthe impact of this time discretization on the thermodynamic variables as the\ncontinuous limit is approached.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:39:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kirchberg","Henning",""],["Nitzan","Abraham",""]]}
{"id":"2308.07986","submitter":"Supriyo Bandyopadhyay","authors":"Rahnuma Rahman and Supriyo Bandyopadhyay","title":"A Spin Field Effect Transistor Based on a Strained Two Dimensional Layer\n  of a Weyl Semimetal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spin field effect transistors (SpinFET) are an iconic class of spintronic\ndevices that exploit gate tuned spin-orbit interaction in semiconductor\nchannels interposed between ferromagnetic source and drain contacts to elicit\ntransistor functionality. Recently, a new type of SpinFET based on gate tuned\nstrain in quantum materials (e.g. topological insulators) has been proposed and\nmay have interesting analog applications, such as in frequency multiplication,\nby virtue of its unusual oscillatory transfer characteristic. Here, we propose\nand analyze yet another type of SpinFET in this class, which may have a\ndifferent application. It is based on a Weyl semimetal. Because the operating\nprinciple is non-classical, the channel conductance shows oscillatory\ndependence on the channel length at zero gate voltage. Furthermore, the\ntransconductance can switch sign if the channel length is varied. This latter\nfeature can be exploited to implement a complementary device like CMOS by\nconnecting two such SpinFETs of slightly different channel lengths in series.\nThese unusual properties may have niche applications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:40:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rahman","Rahnuma",""],["Bandyopadhyay","Supriyo",""]]}
{"id":"2308.07987","submitter":"Jamie Haddock","authors":"Jamie Haddock, Anna Ma, Elizaveta Rebrova","title":"On Subsampled Quantile Randomized Kaczmarz","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":"  When solving noisy linear systems Ax = b + c, the theoretical and empirical\nperformance of stochastic iterative methods, such as the Randomized Kaczmarz\nalgorithm, depends on the noise level. However, if there are a small number of\nhighly corrupt measurements, one can instead use quantile-based methods to\nguarantee convergence to the solution x of the system, despite the presence of\nnoise. Such methods require the computation of the entire residual vector,\nwhich may not be desirable or even feasible in some cases. In this work, we\nanalyze the sub-sampled quantile Randomized Kaczmarz (sQRK) algorithm for\nsolving large-scale linear systems which utilize a sub-sampled residual to\napproximate the quantile threshold. We prove that this method converges to the\nunique solution to the linear system and provide numerical experiments that\nsupport our theoretical findings. We additionally remark on the extremely small\nsample size case and demonstrate the importance of interplay between the choice\nof quantile and subset size.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:44:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Haddock","Jamie",""],["Ma","Anna",""],["Rebrova","Elizaveta",""]]}
{"id":"2308.07988","submitter":"Liam Richards Maldonado","authors":"Liam Richards Maldonado","title":"ReaderQuizzer: Augmenting Research Papers with Just-In-Time Learning\n  Questions to Facilitate Deeper Understanding","comments":"I'd like to acknowledge my two thesis advisors: Azza Abouzied and\n  Nancy W. Gleason","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Academic reading is a key component of higher education, and serves as a\nbasis for critical thinking, knowledge acquisition and effective communication.\nResearch shows many students struggle with comprehension and analysis tasks\nwith academic texts, despite the central importance of academic reading to\nsuccess in higher education. Undergraduates and researchers need to internalize\ndense literature to scaffold their own work upon it. This reading task is\ntime-consuming and difficult to do. Oftentimes, students struggle to actively\nand critically engage and as a result attain merely a cursory understanding of\na paper's contents, or worse, incorrectly interpret the text. How, then, can we\nprovide a means to more easily digest a text whilst also facilitating\nmeaningful, critical engagement and understanding? This paper locates itself\nwithin the broader field of Human-Computer Interaction (HCI) to implement an\naugmented reading interface that leverages the power of ChatGPT to\nintelligently generate and co-locate comprehension and analysis questions in an\nacademic paper, thereby making the paper more digestible with the end goal of\nfacilitating deeper understanding, and developing critical reading skills.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:44:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Maldonado","Liam Richards",""]]}
{"id":"2308.07989","submitter":"Haroldo Ribeiro","authors":"Haroldo V. Ribeiro, Angel A. Tateishi, Ervin K. Lenzi, Richard L.\n  Magin, Matjaz Perc","title":"Interplay between particle trapping and heterogeneity in anomalous\n  diffusion","comments":"13 two-column pages, 6 figures; accepted for publication in\n  Communications Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Heterogeneous media diffusion is often described using position-dependent\ndiffusion coefficients and estimated indirectly through mean squared\ndisplacement in experiments. This approach may overlook other mechanisms and\ntheir interaction with position-dependent diffusion, potentially leading to\nerroneous conclusions. Here, we introduce a hybrid diffusion model that merges\na position-dependent diffusion coefficient with the trapping mechanism of the\ncomb model. We derive exact solutions for position distributions and mean\nsquared displacements, validated through simulations of Langevin equations. Our\nmodel shows that the trapping mechanism attenuates the impact of media\nheterogeneity. Superdiffusion occurs when the position-dependent coefficient\nincreases superlinearly, while subdiffusion occurs for sublinear and inverse\npower-law relations. This nontrivial interplay between heterogeneity and\nstate-independent mechanisms also leads to anomalous yet Brownian and\nnon-Brownian yet Gaussian regimes. These findings emphasize the need for\ncautious interpretations of experiments and highlight the limitations of\nrelying solely on mean squared displacements or position distributions for\ndiffusion characterization.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:46:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ribeiro","Haroldo V.",""],["Tateishi","Angel A.",""],["Lenzi","Ervin K.",""],["Magin","Richard L.",""],["Perc","Matjaz",""]]}
{"id":"2308.07990","submitter":"Leyang Xue","authors":"Peng Zhang, Xianyu Xu, Leyang Xue","title":"Community detection based on structural balance in signed networks","comments":"16 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In signed networks, some existing community detection methods treat negative\nconnections as intercommunity links and positive ones as intracommunity links.\nHowever, it is important to recognize that negative links on real-world\nnetworks also play a key role in maintaining community stability. In this work,\nour aim is to identify communities that are not only densely connected but also\nharmonious or balanced in terms of the nature of their relationships. Such\ncommunities are more likely to be stable over time and less prone to conflicts.\nConsequently, we propose a motif-based method to identify communities by\nquantifying the importance of links in the local structural balance. The\nresults in synthetic and real-world networks show that the proposed method has\na higher performance in identifying the community. In addition, it demonstrates\nstrong robustness, i.e., remains insensitive to the balance of the network, and\naccurately classifies communities in real-world networks.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:46:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Peng",""],["Xu","Xianyu",""],["Xue","Leyang",""]]}
{"id":"2308.07991","submitter":"Jintao Wang","authors":"Jintao Wang, Chengwang Ji, Jiajia Guo, Shaodan Ma","title":"Demo: Reconfigurable Distributed Antennas and Reflecting Surface\n  (RDARS)-aided Integrated Sensing and Communication System","comments":"2 pages, 3 figures. Accepted by IEEE/CIC International Conference on\n  Communications in China, Dalian, China, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Integrated sensing and communication (ISAC) system has been envisioned as a\npromising technology to be applied in future applications requiring both\ncommunication and high-accuracy sensing. Different from most research focusing\non theoretical analysis and optimization in the area of ISAC, we implement a\nreconfigurable distributed antennas and reflecting surfaces (RDARS)-aided ISAC\nsystem prototype to achieve the dual-functionalities with the communication\nsignal. A RDARS, composed of programmable elements capable of switching between\nreflection mode and connected mode, is introduced to assist in uplink signal\ntransmission and sensing. The developed RDARS-aided ISAC prototype achieves\nreliable user localization without compromising the communication rate,\nshowcasing its potential for future 6G systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:47:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Jintao",""],["Ji","Chengwang",""],["Guo","Jiajia",""],["Ma","Shaodan",""]]}
{"id":"2308.07992","submitter":"Anton Orlichenko","authors":"Anton Orlichenko and Kuan-Jui Su and Qing Tian and Hui Shen and\n  Hong-Wen Deng and Yu-Ping Wang","title":"Somatomotor-Visual Resting State Functional Connectivity Increases After\n  Two Years in the UK Biobank Longitudinal Cohort","comments":"11 pages, 12 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Purpose: Functional magnetic resonance imaging (fMRI) and functional\nconnectivity (FC) have been used to follow aging in both children and older\nadults. Robust changes have been observed in children, where high connectivity\namong all brain regions changes to a more modular structure with maturation. In\nthis work, we examine changes in FC in older adults after two years of aging in\nthe UK Biobank longitudinal cohort. Approach: We process data using the\nPower264 atlas, then test whether FC changes in the 2,722-subject longitudinal\ncohort are statistically significant using a Bonferroni-corrected t-test. We\nalso compare the ability of Power264 and UKB-provided, ICA-based FC to\ndetermine which of a longitudinal scan pair is older. Results: We find a 6.8\\%\naverage increase in SMT-VIS connectivity from younger to older scan (from\n$\\rho=0.39$ to $\\rho=0.42$) that occurs in male, female, older subject ($>65$\nyears old), and younger subject ($<55$ years old) groups. Among all\ninter-network connections, this average SMT-VIS connectivity is the best\npredictor of relative scan age, accurately predicting which scan is older 57\\%\nof the time. Using the full FC and a training set of 2,000 subjects, one is\nable to predict which scan is older 82.5\\% of the time using either the full\nPower264 FC or the UKB-provided ICA-based FC. Conclusions: We conclude that\nSMT-VIS connectivity increases in the longitudinal cohort, while resting state\nFC increases generally with age in the cross-sectional cohort. However, we\nconsider the possibility of a change in resting state scanner task between UKB\nlongitudinal data acquisitions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:47:59 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 12:44:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Orlichenko","Anton",""],["Su","Kuan-Jui",""],["Tian","Qing",""],["Shen","Hui",""],["Deng","Hong-Wen",""],["Wang","Yu-Ping",""]]}
{"id":"2308.07993","submitter":"Oleksandr Rossolov","authors":"Oleksandr Rossolov, Anastasiia Botsman, Serhii Lyfenko, Yusak O.\n  Susilo","title":"Does courier gender matter? Exploring mode choice behaviour for\n  E-groceries crowd-shipping in developing economies","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":"  This paper examines the mode choice behaviour of people who may act as\noccasional couriers to provide crowd-shipping (CS) deliveries. Given its recent\nincrease in popularity, online grocery services have become the main market for\ncrowd-shipping deliveries' provider. The study included a behavioural survey,\nPTV Visum simulations and discrete choice behaviour modelling based on random\nutility maximization theory. Mode choice behaviour was examined by considering\nthe gender heterogeneity of the occasional couriers in a multimodal urban\ntransport network. The behavioural dataset was collected in the city of\nKharkiv, Ukraine, at the beginning of 2021. The results indicated that women\nwere willing to provide CS service with 8% less remuneration than men. Women\nwere also more likely to make 10% longer detours by car and metro than men,\nwhile male couriers were willing to implement 25% longer detours when\ntravelling by bike or walking. Considering the integration of CS detours into\nthe couriers' routine trip chains, women couriers were more likely to attach\nthe CS trip to the work-shopping trip chain whilst men would use the home-home\nevening time trip chain. The estimated marginal probability effect indicated a\nhigher detour time sensitivity with respect to expected profit and the relative\ndetour costs of the couriers.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:54:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rossolov","Oleksandr",""],["Botsman","Anastasiia",""],["Lyfenko","Serhii",""],["Susilo","Yusak O.",""]]}
{"id":"2308.07994","submitter":"Brad Hansen","authors":"Brad M. S. Hansen and Kevin Hayakawa","title":"Bound circumplanetary orbits under the influence of radiation pressure:\n  Application to dust in directly imaged exoplanet systems","comments":"21 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the population of simply periodic orbits in the Hill problem with\nradiation pressure included, in order to understand the distribution of\ngravitationally bound dust in orbit around a planet. We study a wide range of\nradiation pressure strengths, which requires the inclusion of additional terms\nbeyond those discussed in previous analyses of this problem. In particular, our\nsolutions reveal two distinct populations of stable wide, retrograde, orbits,\nas opposed to the single family that exists in the purely gravitational\nproblem.\n  We use the result of these calculations to study the observational shape of\ndust populations bound to extrasolar planets, that might be observable in\nscattered or reradiated light. In particular, we find that such dusty clouds\nshould be elongated along the star--planet axis, and that the elongation of the\nbound population increases with $\\beta$, a measure of the strength of the\nradiation pressure.\n  As an application of this model, we consider the properties of the Fomalhaut\nsystem. The unusual orbital properties of the object Fomalhaut~b can be\nexplained if the observed light was scattered by dust that was released from an\nobject in a quasi-satellite orbit about a planet located in, or near, the\nobserved debris ring. Within the context of the model of Hayakawa \\& Hansen\n(2023), we find that the dust cloud around such a planet is still approximately\nan order of magnitude fainter than the limits set by current JWST data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:59:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hansen","Brad M. S.",""],["Hayakawa","Kevin",""]]}
{"id":"2308.07995","submitter":"Prasanta Char","authors":"Apurba Kheto, Prasanta Char","title":"Radial Oscillations of Neutron Stars with Antikaon Condensate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we study the neutron stars with antikaon condensates and\ntheir radial oscillations. We incorporate the antikaons $(K^-,\\bar{K}^0)$\nwithin a relativistic mean field theory with density dependent couplings. A\ntransition to the kaon condensed phase is treated as a second order phase\ntransition for different possible antikaon optical potentials. Then, we solve\nthe structure equations of stars and calculate the fundamental and higher order\nfrequencies of their radial pulsations. We study the eigenfunctions of\ndifferent radial modes for a $2M_\\odot$ star with equations of state having\ndifferent potential depths of antikaons. We also study the large frequency\nseparations for the $2M_\\odot$ star. We find distinct features of the\nappearances of antikaons on the eigenfunctions. The shape of the eigenfunctions\ncorresponding to the radial perturbations is affected due to the appearance of\nthe antikaons, but for the pressure perturbation, the shape remains unchanged.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:59:20 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kheto","Apurba",""],["Char","Prasanta",""]]}
{"id":"2308.07996","submitter":"Henryk Gzyl","authors":"Henryk Gzyl","title":"Quantum systems in Markovian environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we develop a mathematical framework to model a quantum system\nwhose Hamiltonian may depend on the state of changing environment, that evolves\naccording to a Markovian process. When the environment changes its state, the\nquantum system may suffer a shock that produces an instantaneous transition\namong its states. The model that we propose can be readily adapted to more\ngeneral settings.\\\\ To avoid collateral analytical issues, we consider the case\nof quantum systems with finite dimensional state space, in which case the\nobservables are described by Hermitian matrices. We show how to average over\nthe environment to predict the expected values of observables.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:00:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gzyl","Henryk",""]]}
{"id":"2308.07997","submitter":"Mingkui Tan","authors":"Peihao Chen, Xinyu Sun, Hongyan Zhi, Runhao Zeng, Thomas H. Li, Gaowen\n  Liu, Mingkui Tan, Chuang Gan","title":"$A^2$Nav: Action-Aware Zero-Shot Robot Navigation by Exploiting\n  Vision-and-Language Ability of Foundation Models","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":"  We study the task of zero-shot vision-and-language navigation (ZS-VLN), a\npractical yet challenging problem in which an agent learns to navigate\nfollowing a path described by language instructions without requiring any\npath-instruction annotation data. Normally, the instructions have complex\ngrammatical structures and often contain various action descriptions (e.g.,\n\"proceed beyond\", \"depart from\"). How to correctly understand and execute these\naction demands is a critical problem, and the absence of annotated data makes\nit even more challenging. Note that a well-educated human being can easily\nunderstand path instructions without the need for any special training. In this\npaper, we propose an action-aware zero-shot VLN method ($A^2$Nav) by exploiting\nthe vision-and-language ability of foundation models. Specifically, the\nproposed method consists of an instruction parser and an action-aware\nnavigation policy. The instruction parser utilizes the advanced reasoning\nability of large language models (e.g., GPT-3) to decompose complex navigation\ninstructions into a sequence of action-specific object navigation sub-tasks.\nEach sub-task requires the agent to localize the object and navigate to a\nspecific goal position according to the associated action demand. To accomplish\nthese sub-tasks, an action-aware navigation policy is learned from freely\ncollected action-specific datasets that reveal distinct characteristics of each\naction demand. We use the learned navigation policy for executing sub-tasks\nsequentially to follow the navigation instruction. Extensive experiments show\n$A^2$Nav achieves promising ZS-VLN performance and even surpasses the\nsupervised learning methods on R2R-Habitat and RxR-Habitat datasets.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:01:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Peihao",""],["Sun","Xinyu",""],["Zhi","Hongyan",""],["Zeng","Runhao",""],["Li","Thomas H.",""],["Liu","Gaowen",""],["Tan","Mingkui",""],["Gan","Chuang",""]]}
{"id":"2308.07998","submitter":"Shinho Kim","authors":"Joel Siegel, Shinho Kim, Margaret Fortman, Phillip Hon, Luke\n  Sweatlock, Min Seok Jang and Victor Watson Brar","title":"Electrostatic Steering of Thermal Emission with Active Metasurface\n  Control of Delocalized Modes","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We theoretically describe and experimentally demonstrate a\ngraphene-integrated metasurface structure that enables electrically-tunable\ndirectional control of thermal emission. This device consists of a dielectric\nslab that acts as a Fabry-Perot (F-P) resonator supporting long-range\ndelocalized modes bounded on one side by an electrostatically tunable\nmetal-graphene metasurface. By varying the Fermi level of the graphene, the\naccumulated phase of the F-P mode is shifted, which changes the direction of\nabsorption and emission at a fixed frequency. We directly measure the\nfrequency- and angle-dependent emissivity of the thermal emission from a\nfabricated device heated to 250$^{\\circ}$. Our results show that electrostatic\ncontrol allows the thermal emission at 6.61 $\\mu$m to be continuously steered\nover 16$^{\\circ}$, with a peak emissivity maintained above 0.9. We analyze the\ndynamic behavior of the thermal emission steerer theoretically using a Fano\ninterference model, and use the model to design optimized thermal steerer\nstructures.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:16:20 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 11:13:02 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Siegel","Joel",""],["Kim","Shinho",""],["Fortman","Margaret",""],["Hon","Phillip",""],["Sweatlock","Luke",""],["Jang","Min Seok",""],["Brar","Victor Watson",""]]}
{"id":"2308.07999","submitter":"Igor Sfiligoi","authors":"David Schultz, Igor Sfiligoi, Benedikt Riedel, Fabio Andrijauskas,\n  Derek Weitzel, and Frank W\\\"urthwein","title":"IceCube experience using XRootD-based Origins with GPU workflows in PNRP","comments":"7 pages, 3 figures, 1 table, To be published in Proceedings of CHEP23","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph astro-ph.IM cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The IceCube Neutrino Observatory is a cubic kilometer neutrino telescope\nlocated at the geographic South Pole. Understanding detector systematic effects\nis a continuous process. This requires the Monte Carlo simulation to be updated\nperiodically to quantify potential changes and improvements in science results\nwith more detailed modeling of the systematic effects. IceCube's largest\nsystematic effect comes from the optical properties of the ice the detector is\nembedded in. Over the last few years there have been considerable improvements\nin the understanding of the ice, which require a significant processing\ncampaign to update the simulation. IceCube normally stores the results in a\ncentral storage system at the University of Wisconsin-Madison, but it ran out\nof disk space in 2022. The Prototype National Research Platform (PNRP) project\nthus offered to provide both GPU compute and storage capacity to IceCube in\nsupport of this activity. The storage access was provided via XRootD-based OSDF\nOrigins, a first for IceCube computing. We report on the overall experience\nusing PNRP resources, with both successes and pain points.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:20:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Schultz","David",""],["Sfiligoi","Igor",""],["Riedel","Benedikt",""],["Andrijauskas","Fabio",""],["Weitzel","Derek",""],["W\u00fcrthwein","Frank",""]]}
{"id":"2308.08000","submitter":"S Brendle","authors":"S. Brendle and Y. Wang","title":"On Gromov's rigidity theorem for polytopes with acute angles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In his Four Lectures, Gromov conjectured a scalar curvature extremality\nproperty of convex polytopes. Moreover, Gromov outlined a proof of the\nconjecture in the special case when the dihedral angles are acute. Gromov's\nargument relies on Dirac operator techniques together with a smoothing\nconstruction. In this paper, we give the details of the smoothing construction,\nthereby providing a detailed proof of Gromov's theorem. The proof of the\nrigidity statement also uses a deep estimate due to Fefferman and Phong.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:24:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Brendle","S.",""],["Wang","Y.",""]]}
{"id":"2308.08001","submitter":"James Lattimer","authors":"James M. Lattimer","title":"Constraints on the Nuclear Symmetry Energy from Experiments, Theory and\n  Observations","comments":"Compact Stars in the QCD Phase Diagram (CSQCD) IX, Banff, Canada,\n  2022. arXiv admin note: substantial text overlap with arXiv:2301.03666","journal-ref":"Journal of Physics: Conference Series, Volume 2536, Issue 1,\n  id.012009, 10 pp. (2023)","doi":"10.1088/1742-6596/2536/1/012009","report-no":null,"categories":"nucl-th astro-ph.HE nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nuclear mass measurements and neutron matter theory tightly constrain the\nnuclear symmetry energy parameters $J$, $L$, $K_{sym}$ and $Q_{sym}$.\nCorroboration of these constraints on $J$ and $L$ can be found from\nmeasurements of the neutron skin thicknesses and dipole polarizabilities of\nneutron-rich nuclei. The experimental constraints on these parameters are\ncompared with those obtained from consideration of astrophysical measurements\nof the neutron star radius, which we show is highly correlated with $L$.\nAttention is aimed at the recent PREX and CREX neutron skin measurements from\nJefferson Lab, NICER neutron star radius measurements, and a new interpretation\nof the GW170817 tidal deformability measurement. We find joint satisfaction of\nPREX and CREX gives $J=32.2\\pm1.7$ MeV and $L=52.9\\pm13.2$ MeV, in excellent\nagreement with neutron matter predictions of $J=32.0\\pm1.1$ MeV and\n$L=51.9\\pm7.9$ MeV.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:27:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lattimer","James M.",""]]}
{"id":"2308.08002","submitter":"Tal Kadosh","authors":"Tal Kadosh, Niranjan Hasabnis, Timothy Mattson, Yuval Pinter and Gal\n  Oren","title":"Quantifying OpenMP: Statistical Insights into Usage and Adoption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In high-performance computing (HPC), the demand for efficient parallel\nprogramming models has grown dramatically since the end of Dennard Scaling and\nthe subsequent move to multi-core CPUs. OpenMP stands out as a popular choice\ndue to its simplicity and portability, offering a directive-driven approach for\nshared-memory parallel programming. Despite its wide adoption, however, there\nis a lack of comprehensive data on the actual usage of OpenMP constructs,\nhindering unbiased insights into its popularity and evolution. This paper\npresents a statistical analysis of OpenMP usage and adoption trends based on a\nnovel and extensive database, HPCORPUS, compiled from GitHub repositories\ncontaining C, C++, and Fortran code. The results reveal that OpenMP is the\ndominant parallel programming model, accounting for 45% of all analyzed\nparallel APIs. Furthermore, it has demonstrated steady and continuous growth in\npopularity over the past decade. Analyzing specific OpenMP constructs, the\nstudy provides in-depth insights into their usage patterns and preferences\nacross the three languages. Notably, we found that while OpenMP has a strong\n\"common core\" of constructs in common usage (while the rest of the API is less\nused), there are new adoption trends as well, such as simd and target\ndirectives for accelerated computing and task for irregular parallelism.\nOverall, this study sheds light on OpenMP's significance in HPC applications\nand provides valuable data for researchers and practitioners. It showcases\nOpenMP's versatility, evolving adoption, and relevance in contemporary parallel\nprogramming, underlining its continued role in HPC applications and beyond.\nThese statistical insights are essential for making informed decisions about\nparallelization strategies and provide a foundation for further advancements in\nparallel programming models and techniques.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:34:23 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 14:36:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kadosh","Tal",""],["Hasabnis","Niranjan",""],["Mattson","Timothy",""],["Pinter","Yuval",""],["Oren","Gal",""]]}
{"id":"2308.08003","submitter":"Juan Trelles Trabucco","authors":"Juan Trelles and Andrew Wentzel and William Berrios and G. Elisabeta\n  Marai","title":"BI-LAVA: Biocuration with Hierarchical Image Labeling through Active\n  Learning and Visual Analysis","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the biomedical domain, taxonomies organize the acquisition modalities of\nscientific images in hierarchical structures. Such taxonomies leverage large\nsets of correct image labels and provide essential information about the\nimportance of a scientific publication, which could then be used in biocuration\ntasks. However, the hierarchical nature of the labels, the overhead of\nprocessing images, the absence or incompleteness of labeled data, and the\nexpertise required to label this type of data impede the creation of useful\ndatasets for biocuration. From a multi-year collaboration with biocurators and\ntext-mining researchers, we derive an iterative visual analytics and active\nlearning strategy to address these challenges. We implement this strategy in a\nsystem called BI-LAVA Biocuration with Hierarchical Image Labeling through\nActive Learning and Visual Analysis. BI-LAVA leverages a small set of image\nlabels, a hierarchical set of image classifiers, and active learning to help\nmodel builders deal with incomplete ground-truth labels, target a hierarchical\ntaxonomy of image modalities, and classify a large pool of unlabeled images.\nBI-LAVA's front end uses custom encodings to represent data distributions,\ntaxonomies, image projections, and neighborhoods of image thumbnails, which\nhelp model builders explore an unfamiliar image dataset and taxonomy and\ncorrect and generate labels. An evaluation with machine learning practitioners\nshows that our mixed human-machine approach successfully supports domain\nexperts in understanding the characteristics of classes within the taxonomy, as\nwell as validating and improving data quality in labeled and unlabeled\ncollections.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:36:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Trelles","Juan",""],["Wentzel","Andrew",""],["Berrios","William",""],["Marai","G. Elisabeta",""]]}
{"id":"2308.08004","submitter":"Rochelle Tractenberg","authors":"Rochelle E. Tractenberg, Donna LaLonde, Suzanne Thornton","title":"The Mastery Rubric for Statistics and Data Science: promoting coherence\n  and consistency in data science education and training","comments":"40 pages; 2 Tables; 4 Figures. Presented at the Symposium on Data\n  Science & Statistics (SDSS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.OT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Consensus based publications of both competencies and undergraduate\ncurriculum guidance documents targeting data science instruction for higher\neducation have recently been published. Recommendations for curriculum features\nfrom diverse sources may not result in consistent training across programs. A\nMastery Rubric was developed that prioritizes the promotion and documentation\nof formal growth as well as the development of independence needed for the 13\nrequisite knowledge, skills, and abilities for professional practice in\nstatistics and data science, SDS. The Mastery Rubric, MR, driven curriculum can\nemphasize computation, statistics, or a third discipline in which the other\nwould be deployed or, all three can be featured. The MR SDS supports each of\nthese program structures while promoting consistency with international,\nconsensus based, curricular recommendations for statistics and data science,\nand allows 'statistics', 'data science', and 'statistics and data science'\ncurricula to consistently educate students with a focus on increasing learners\nindependence. The Mastery Rubric construct integrates findings from the\nlearning sciences, cognitive and educational psychology, to support teachers\nand students through the learning enterprise. The MR SDS will support higher\neducation as well as the interests of business, government, and academic work\nforce development, bringing a consistent framework to address challenges that\nexist for a domain that is claimed to be both an independent discipline and\npart of other disciplines, including computer science, engineering, and\nstatistics. The MR-SDS can be used for development or revision of an evaluable\ncurriculum that will reliably support the preparation of early e.g.,\nundergraduate degree programs, middle e.g., upskilling and training programs,\nand late e.g., doctoral level training practitioners.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:36:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tractenberg","Rochelle E.",""],["LaLonde","Donna",""],["Thornton","Suzanne",""]]}
{"id":"2308.08005","submitter":"Wa Nkongolo Mike Nkongolo","authors":"Mike Nkongolo","title":"Navigating the complex nexus: cybersecurity in political landscapes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cybersecurity in politics has emerged as a critical and intricate realm\nintersecting technology, governance, and international relations. In this\ninterconnected digital context, political entities confront unparalleled\nchallenges in securing sensitive data, upholding democratic procedures, and\ncountering cyber threats. This study delves into the multifaceted landscape of\npolitical cybersecurity, examining the evolving landscape of cyberattacks,\ntheir impact on political stability, and strategies for bolstering digital\nresilience. The intricate interplay between state-sponsored hacking,\ndisinformation campaigns, and eroding public trust underscores the imperative\nfor robust cybersecurity measures to safeguard political system integrity.\nThrough an extensive exploration of real-world case studies, policy frameworks,\nand collaborative initiatives, this research illuminates the intricate network\nof technological vulnerabilities, geopolitical dynamics, and ethical concerns\nthat shape the dynamic evolution of cybersecurity in politics. Amidst evolving\ndigital landscapes, the imperative for agile and preemptive cybersecurity\nstrategies is paramount for upholding the stability and credibility of\npolitical institutions.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:37:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nkongolo","Mike",""]]}
{"id":"2308.08006","submitter":"Ivo S. Vinkl\\'arek","authors":"Ivo S. Vinkl\\'arek, Hubertus Bromberger, Nidin Vadassery, Wuwei Jin,\n  Jochen K\\\"upper and Sebastian Trippel","title":"Reaction pathways of water dimer following single ionization","comments":"7 pages, 4 figures, (SI: 4 pages, 6 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atm-clus physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Water dimer $\\mathrm{(H_2O)_2}$ - a vital component of the earth's atmosphere\n- is an important prototypical hydrogen-bonded system. It provides direct\ninsight into fundamental chemical and biochemical processes, e.g., proton\ntransfer and ionic supramolecular dynamics occurring in astro- and atmospheric\nchemistry. Exploiting a purified molecular beam of water dimer and multi-mass\nion imaging, we report the simultaneous detection of all generated ion products\nof $\\mathrm{(H_2O)_2^+}$-fragmentation following single ionization. Detailed\ninformation about ion yields and reaction energetics of 13 ion-radical\npathways, 6 of which are new, of $\\mathrm{(H_2O)_2^+}$ are presented, including\nstrong $\\mathrm{{}^{18}O}$-isotope effects.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:40:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vinkl\u00e1rek","Ivo S.",""],["Bromberger","Hubertus",""],["Vadassery","Nidin",""],["Jin","Wuwei",""],["K\u00fcpper","Jochen",""],["Trippel","Sebastian",""]]}
{"id":"2308.08007","submitter":"Mohamed Karim Hamdani Dr","authors":"Mostafa Allaoui and Mohamed Karim Hamdani and Lamine Mbarki","title":"A degenerate Kirchhoff-type problem involving variable $s(\\cdot)$-order\n  fractional $p(\\cdot)$-Laplacian with weights","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This paper deals with a class of nonlocal variable $s(.)$-order fractional\n$p(.)$-Kirchhoff type equations: \\begin{eqnarray*} \\left\\{\n  \\begin{array}{ll}\n  \\mathcal{K}\\left(\\int_{\\mathbb{R}^{2N}}\\frac{1}{p(x,y)}\\frac{|\\varphi(x)-\\varphi(y)|^{p(x,y)}}{|x-y|^{N+s(x,y){p(x,y)}}}\n\\,dx\\,dy\\right)(-\\Delta)^{s(\\cdot)}_{p(\\cdot)}\\varphi(x) =f(x,\\varphi)\n  \\quad \\mbox{in }\\Omega,\n  \\\\ \\varphi=0 \\quad \\mbox{on }\\mathbb{R}^N\\backslash\\Omega. \\end{array}\n\\right. \\end{eqnarray*} Under some suitable conditions on the functions $p,s,\n\\mathcal{K}$ and $f$, the existence and multiplicity of nontrivial solutions\nfor the above problem are obtained. Our results cover the degenerate case in\nthe $p(\\cdot)$ fractional setting.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:45:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Allaoui","Mostafa",""],["Hamdani","Mohamed Karim",""],["Mbarki","Lamine",""]]}
{"id":"2308.08008","submitter":"Leandro Da Rold","authors":"Ernesto Arganda, Leandro Da Rold, Aurelio Juste, Anibal D. Medina,\n  Rosa M. Sand\\'a Seoane","title":"Probing new physics with charge asymmetries in 2 same-sign leptons plus\n  jets final states at the LHC","comments":"23 pages, 17 figures","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-107","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the impact of new physics models in the charge asymmetry defined for\nLHC final states consisting of two same-sign leptons (2SS$l$, with $l= e, \\mu$)\nplus jets ($N_\\text{jets}\\geq2$), with a center-of-mass energy of $\\sqrt{s}=13$\nTeV, where the main SM contribution is $t\\bar{t}W$ production. Concretely, we\nconsider three different new physics sources for the charge asymmetries: a\nheavy neutral scalar/pseudoscalar arising from the general two Higgs doublet\nmodel, an effective theory with dimension-6 four-quark operators, and a\nsimplified $R$-parity-violating supersymmetric model with electroweakino\nproduction (higgsino-like or wino-like). We propose measuring the charge\nasymmetries differentially with respect to several kinematic observables, and\ninclusively/exclusively with the number of $b$-tagged jets in the final state\n($N_b\\geq\\{1, 2, 3\\}$). Results are compared with the SM prediction using the\n$\\chi^2$ criteria, expressing sensitivity in terms of the normal Gaussian\nsignificance. We show that some of the proposed new physics scenarios can be\nprobed at the LHC even for the already recorded integrated luminosity of 139\nfb$^{-1}$. Finally, we also estimate the prospects for the potential LHC\nsensitivity to the considered new physics models in its high-luminosity phase.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:46:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Arganda","Ernesto",""],["Da Rold","Leandro",""],["Juste","Aurelio",""],["Medina","Anibal D.",""],["Seoane","Rosa M. Sand\u00e1",""]]}
{"id":"2308.08009","submitter":"Marco Di Renzo","authors":"Juan Carlos Ruiz-Sicilia, Marco Di Renzo, Marco Donald Migliore,\n  Merouane Debbah, and H. Vincent Poor","title":"On the Degrees of Freedom and Eigenfunctions of Line-of-Sight\n  Holographic MIMO Communications","comments":"Submitted for journal publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a line-of-sight communication link between two holographic\nsurfaces (HoloSs). We provide a closed-form expression for the number of\neffective degrees of freedom (eDoF), i.e., the number of orthogonal\ncommunication modes that can be established between the HoloSs. The framework\ncan be applied to general network deployments beyond the widely studied\nparaxial setting. This is obtained by utilizing a quartic approximation for the\nwavefront of the electromagnetic waves, and by proving that the number of eDoF\ncorresponds to an instance of Landau's eigenvalue problem applied to a\nbandlimited kernel determined by the quartic approximation of the wavefront.\nThe proposed approach overcomes the limitations of the widely utilized\nparabolic approximation for the wavefront, which provides inaccurate estimates\nin non-paraxial deployments. We specialize the framework to typical network\ndeployments, and provide analytical expressions for the optimal, according to\nKolmogorov's $N$-width criterion, basis functions (communication waveforms) for\noptimal data encoding and decoding. With the aid of numerical analysis, we\nvalidate the accuracy of the closed-form expressions for the number of eDoF and\nwaveforms.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:47:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ruiz-Sicilia","Juan Carlos",""],["Di Renzo","Marco",""],["Migliore","Marco Donald",""],["Debbah","Merouane",""],["Poor","H. Vincent",""]]}
{"id":"2308.08010","submitter":"Sayantan Auddy","authors":"Sayantan Auddy, Ramit Dey, Neal J. Turner, Shantanu Basu","title":"GRINN: A Physics-Informed Neural Network for solving hydrodynamic\n  systems in the presence of self-gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG astro-ph.GA astro-ph.IM astro-ph.SR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modeling self-gravitating gas flows is essential to answering many\nfundamental questions in astrophysics. This spans many topics including\nplanet-forming disks, star-forming clouds, galaxy formation, and the\ndevelopment of large-scale structures in the Universe. However, the nonlinear\ninteraction between gravity and fluid dynamics offers a formidable challenge to\nsolving the resulting time-dependent partial differential equations (PDEs) in\nthree dimensions (3D). By leveraging the universal approximation capabilities\nof a neural network within a mesh-free framework, physics informed neural\nnetworks (PINNs) offer a new way of addressing this challenge. We introduce the\ngravity-informed neural network (GRINN), a PINN-based code, to simulate 3D\nself-gravitating hydrodynamic systems. Here, we specifically study\ngravitational instability and wave propagation in an isothermal gas. Our\nresults match a linear analytic solution to within 1\\% in the linear regime and\na conventional grid code solution to within 5\\% as the disturbance grows into\nthe nonlinear regime. We find that the computation time of the GRINN does not\nscale with the number of dimensions. This is in contrast to the scaling of the\ngrid-based code for the hydrodynamic and self-gravity calculations as the\nnumber of dimensions is increased. Our results show that the GRINN computation\ntime is longer than the grid code in one- and two- dimensional calculations but\nis an order of magnitude lesser than the grid code in 3D with similar accuracy.\nPhysics-informed neural networks like GRINN thus show promise for advancing our\nability to model 3D astrophysical flows.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:50:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Auddy","Sayantan",""],["Dey","Ramit",""],["Turner","Neal J.",""],["Basu","Shantanu",""]]}
{"id":"2308.08011","submitter":"Chaeyeon Chung","authors":"Chaeyeon Chung, Yeojeong Park, Seunghwan Choi, Munkhsoyol Ganbat,\n  Jaegul Choo","title":"Shortcut-V2V: Compression Framework for Video-to-Video Translation based\n  on Temporal Redundancy Reduction","comments":"to be updated","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video-to-video translation aims to generate video frames of a target domain\nfrom an input video. Despite its usefulness, the existing networks require\nenormous computations, necessitating their model compression for wide use.\nWhile there exist compression methods that improve computational efficiency in\nvarious image/video tasks, a generally-applicable compression method for\nvideo-to-video translation has not been studied much. In response, we present\nShortcut-V2V, a general-purpose compression framework for video-to-video\ntranslation. Shourcut-V2V avoids full inference for every neighboring video\nframe by approximating the intermediate features of a current frame from those\nof the previous frame. Moreover, in our framework, a newly-proposed block\ncalled AdaBD adaptively blends and deforms features of neighboring frames,\nwhich makes more accurate predictions of the intermediate features possible. We\nconduct quantitative and qualitative evaluations using well-known\nvideo-to-video translation models on various tasks to demonstrate the general\napplicability of our framework. The results show that Shourcut-V2V achieves\ncomparable performance compared to the original video-to-video translation\nmodel while saving 3.2-5.7x computational cost and 7.8-44x memory at test time.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:50:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chung","Chaeyeon",""],["Park","Yeojeong",""],["Choi","Seunghwan",""],["Ganbat","Munkhsoyol",""],["Choo","Jaegul",""]]}
{"id":"2308.08012","submitter":"Zong-Fu Luo","authors":"Wenjun Jiang, Tianlong Fan, Changhao Li, Chuanfu Zhang, Tao Zhang,\n  Zong-fu Luo","title":"Comprehensive Analysis of Network Robustness Evaluation Based on\n  Convolutional Neural Networks with Spatial Pyramid Pooling","comments":"25 pages, 8 figures, 7 tables, journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.NI cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Connectivity robustness, a crucial aspect for understanding, optimizing, and\nrepairing complex networks, has traditionally been evaluated through\ntime-consuming and often impractical simulations. Fortunately, machine learning\nprovides a new avenue for addressing this challenge. However, several key\nissues remain unresolved, including the performance in more general edge\nremoval scenarios, capturing robustness through attack curves instead of\ndirectly training for robustness, scalability of predictive tasks, and\ntransferability of predictive capabilities. In this paper, we address these\nchallenges by designing a convolutional neural networks (CNN) model with\nspatial pyramid pooling networks (SPP-net), adapting existing evaluation\nmetrics, redesigning the attack modes, introducing appropriate filtering rules,\nand incorporating the value of robustness as training data. The results\ndemonstrate the thoroughness of the proposed CNN framework in addressing the\nchallenges of high computational time across various network types, failure\ncomponent types and failure scenarios. However, the performance of the proposed\nCNN model varies: for evaluation tasks that are consistent with the trained\nnetwork type, the proposed CNN model consistently achieves accurate evaluations\nof both attack curves and robustness values across all removal scenarios. When\nthe predicted network type differs from the trained network, the CNN model\nstill demonstrates favorable performance in the scenario of random node\nfailure, showcasing its scalability and performance transferability.\nNevertheless, the performance falls short of expectations in other removal\nscenarios. This observed scenario-sensitivity in the evaluation of network\nfeatures has been overlooked in previous studies and necessitates further\nattention and optimization. Lastly, we discuss important unresolved questions\nand further investigation.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 09:54:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiang","Wenjun",""],["Fan","Tianlong",""],["Li","Changhao",""],["Zhang","Chuanfu",""],["Zhang","Tao",""],["Luo","Zong-fu",""]]}
{"id":"2308.08013","submitter":"Ronnie Pavlov","authors":"Ronnie Pavlov","title":"Minimal zero entropy subshifts can be unrestricted along any sparse set","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a streamlined proof of a result essentially present in previous\nwork of the author, namely that for every set $S = \\{s_1, s_2, \\ldots\\} \\subset\n\\mathbb{N}$ of zero Banach density and finite set $A$, there exists a minimal\nzero-entropy subshift $(X, \\sigma)$ so that for every sequence $u \\in\nA^\\mathbb{Z}$, there is $x_u \\in X$ with $x_u(s_n) = u(n)$ for all $n \\in\n\\mathbb{N}$. Informally, minimal deterministic sequences can achieve completely\narbitrary behavior upon restriction to a set of zero Banach density.\n  As a corollary, this provides counterexamples to the Polynomial Sarnak\nConjecture which are significantly more general than some recently provided in\nword of Kanigowski, Lema\\'{n}czyk, and Radziwi\\l\\l and of Lian and Shi, and\nshows that no similar result can hold under only the assumptions of minimality\nand zero entropy.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:04:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pavlov","Ronnie",""]]}
{"id":"2308.08015","submitter":"Thierry Lahaye","authors":"Jamie A. Boyd and Thierry Lahaye","title":"A basic introduction to ultrastable optical cavities for laser\n  stabilization","comments":"10 pages, 8 figures, tutorial article to appear in Am. J . Phys","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.quant-gas physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a simple introduction to the properties and use of ultrastable\noptical cavities, which are increasingly common in atomic and molecular physics\nlaboratories for stabilizing the frequency of lasers to linewidths at the kHz\nlevel or below. Although the physics of Fabry-Perot interferometers is part of\nstandard optics curricula, the specificities of ultrastable optical cavities,\nsuch as their high finesse, fixed length, and the need to operate under vacuum,\ncan make their use appear relatively challenging to newcomers. Our aim in this\nwork is to bridge the gap between generic knowledge about Fabry-Perot\nresonators and the specialized literature about ultrastable cavities. The\nintended audience includes students setting up an ultrastable cavity in a\nresearch laboratory for the first time and instructors designing advanced\nlaboratory courses on optics and laser stabilization techniques.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:07:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Boyd","Jamie A.",""],["Lahaye","Thierry",""]]}
{"id":"2308.08016","submitter":"Chandan Kumar Sheemar","authors":"Chandan Kumar Sheemar, Jorge Querol, Sourabh Solanki, Sumit Kumar, and\n  Symeon Chatzinotas","title":"Robust Beamforming for IRS Aided MIMO Full Duplex Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, a novel robust beamforming for an intelligent reflecting\nsurface (IRS) assisted FD system is presented. Since perfect channel state\ninformation (CSI) is often challenging to acquire in practice, we consider the\ncase of imperfect CSI and adopt a statistically robust beamforming approach to\nmaximize the ergodic weighted sum rate (WSR). We also analyze the achievable\nWSR of an IRS-assisted FD with imperfect CSI, for which the lower and the upper\nbounds are derived. The ergodic WSR maximization problem is tackled based on\nthe expected Weighted Minimum Mean Squared Error (WMMSE), which is guaranteed\nto converge to a local optimum. The effectiveness of the proposed design is\ninvestigated with extensive simulation results. It is shown that our robust\ndesign achieves significant performance gain compared to the naive beamforming\napproaches and considerably outperforms the robust Half-Duplex (HD) system.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:10:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sheemar","Chandan Kumar",""],["Querol","Jorge",""],["Solanki","Sourabh",""],["Kumar","Sumit",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.08017","submitter":"Yue Yu","authors":"Yue Yu, Jacob Levy, Negar Mehr, David Fridovich-Keil, and Ufuk Topcu","title":"Active Inverse Learning in Stackelberg Trajectory Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Game-theoretic inverse learning is the problem of inferring the players'\nobjectives from their actions. We formulate an inverse learning problem in a\nStackelberg game between a leader and a follower, where each player's action is\nthe trajectory of a dynamical system. We propose an active inverse learning\nmethod for the leader to infer which hypothesis among a finite set of\ncandidates describes the follower's objective function. Instead of using\npassively observed trajectories like existing methods, the proposed method\nactively maximizes the differences in the follower's trajectories under\ndifferent hypotheses to accelerate the leader's inference. We demonstrate the\nproposed method in a receding-horizon repeated trajectory game. Compared with\nuniformly random inputs, the leader inputs provided by the proposed method\naccelerate the convergence of the probability of different hypotheses\nconditioned on the follower's trajectory by orders of magnitude.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:17:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yu","Yue",""],["Levy","Jacob",""],["Mehr","Negar",""],["Fridovich-Keil","David",""],["Topcu","Ufuk",""]]}
{"id":"2308.08018","submitter":"Marius Plach","authors":"Marius Plach, Federico Vismarra, Elisa Appi, V\\'enus Poulain, Jasper\n  Peschel, Peter Smorenburg, David P. O'Dwyer, Stephen Edward, Yin Tao, Roc\\'io\n  Borrego-Varillas, Mauro Nisoli, Cord L. Arnold, Anne L'Huillier, Per\n  Eng-Johnsson","title":"Spatial aberrations in high-order harmonic generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the spatial characteristics of high-order harmonic radiation\ngenerated in argon, and observe cross-like patterns in the far field. An\nanalytical model describing harmonics from an astigmatic driving beam reveals\nthat these patterns result from the order and generation position dependent\ndivergence of harmonics. Even small amounts of driving field astigmatism may\nresult in cross-like patterns, coming from the superposition of individual\nharmonics with spatial profiles elongated in different directions. By\ncorrecting the aberrations using a deformable mirror, we show that fine-tuning\nthe driving wavefront is essential for optimal spatial quality of the\nharmonics.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:23:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Plach","Marius",""],["Vismarra","Federico",""],["Appi","Elisa",""],["Poulain","V\u00e9nus",""],["Peschel","Jasper",""],["Smorenburg","Peter",""],["O'Dwyer","David P.",""],["Edward","Stephen",""],["Tao","Yin",""],["Borrego-Varillas","Roc\u00edo",""],["Nisoli","Mauro",""],["Arnold","Cord L.",""],["L'Huillier","Anne",""],["Eng-Johnsson","Per",""]]}
{"id":"2308.08019","submitter":"Zhongmin Qian","authors":"Zhongmin Qian and Zihao Shen","title":"On vorticity and expansion-rate of fluid flows, conditional law duality\n  and their representations","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By using a formulation of motion equations for a viscous (compressible) fluid\nflow in terms of the vorticity and the rate of expansion as the main fluid\ndynamical variables, an approximation model is established for compressible\nflows with slowly varied (over the space) fluid density. The probabilistic\ntools and the main ingredient such as the duality of conditional laws and the\nforward type Feynman-Kac formula are established for elliptic operators of\nsecond order, in order to formulate the corresponding random vortex method for\na class of viscous compressible fluid flows, based on their approximation\nmotion equations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:24:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Qian","Zhongmin",""],["Shen","Zihao",""]]}
{"id":"2308.08020","submitter":"Laura G\\\"udemann Ms","authors":"Laura M. G\\\"udemann and Beverley M. Shields and John M. Dennis and\n  Jack Bowden (on behalf of the MASTERMIND consortium)","title":"Just what the doctor ordered: An evaluation of provider preference-based\n  Instrumental Variable methods in observational studies, with application for\n  comparative effectiveness of type 2 diabetes therapy","comments":"44 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Instrumental Variables provide a way of addressing bias due to unmeasured\nconfounding when estimating treatment effects using observational data. As\ninstrument prescription preference of individual healthcare providers has been\nproposed. Because prescription preference is hard to measure and often\nunobserved, a surrogate measure constructed from available data is often\nrequired for the analysis. Different construction methods for this surrogate\nmeasure are possible, such as simple rule-based methods which make use of the\nobserved treatment patterns, or more complex model-based methods that employ\nformal statistical models to explain the treatment behaviour whilst considering\nmeasured confounders. The choice of construction method relies on aspects like\ndata availability within provider, missing data in measured confounders, and\npossible changes in prescription preference over time. In this paper we conduct\na comprehensive simulation study to evaluate different construction methods for\nsurrogates of prescription preference under different data conditions,\nincluding: different provider sizes, missing covariate data, and change in\npreference. We also propose a novel model-based construction method to address\nbetween provider differences and change in prescription preference. All\npresented construction methods are exemplified in a case study of the relative\nglucose lowering effect of two type 2 diabetes treatments in observational\ndata. Our study shows that preference-based Instrumental Variable methods can\nbe a useful tool for causal inference from observational health data. The\nchoice of construction method should be driven by the data condition at hand.\nOur proposed method is capable of estimating the causal treatment effect\nwithout bias in case of sufficient prescription data per provider, changing\nprescription preference over time and non-ignorable missingness in measured\nconfounders.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:25:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["G\u00fcdemann","Laura M.","","on behalf of the MASTERMIND consortium"],["Shields","Beverley M.","","on behalf of the MASTERMIND consortium"],["Dennis","John M.","","on behalf of the MASTERMIND consortium"],["Bowden","Jack","","on behalf of the MASTERMIND consortium"]]}
{"id":"2308.08021","submitter":"Dalibor Chevizovich N","authors":"V. Matic, Z. Ivic, Z. Przulj, D. Chevizovich","title":"On the influence of the \"donor\"/\"acceptor\" presence on the excitation\n  states in molecular chains: non-adiabatic polaron approach","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":"  In the paper, we considered a molecular structure that consists of a\nmolecular chain and an additional molecule (\"donor\"/\"acceptor\") that can inject\n(or remove) single excitation (vibron, electron, e.t.c.) onto the molecular\nchain. We assumed that the excitation forms a self-trapped state due to the\ninteraction with mechanical oscillations of chain structure elements. We\nanalyzed the energy spectra of the excitation and showed that its state (when\nit migrates to the molecular chain) has the properties of the non-adiabatic\npolaron state. The conditions under which the excitation can migrate from one\nsubsystem to another were considered. It was shown that the presence of a\n\"donor\" molecule cannot significantly change the properties of the excitation\nlocated on the molecular chain. At the same time, the molecular chain can\naffect the position of the energy level of the excitation localized on the\n\"donor\" subsystem. Indirectly, this can influence the process of excitation\nmigration from one subsystem to another one. The influence of basic energy\nparameters of the system and the environment temperature on this process are\ndiscussed. The entire system was assumed to be in thermal equilibrium with the\nenvironment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:25:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Matic","V.",""],["Ivic","Z.",""],["Przulj","Z.",""],["Chevizovich","D.",""]]}
{"id":"2308.08022","submitter":"Soheil Azarpendar PhD","authors":"Soheil Azarpendar","title":"Negative definite spin filling and branched double covers","comments":"22 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 investigate the negative definite spin fillings of branched double covers\nof alternating knots. We derive some obstructions for the existence of such\nfillings and find a characterization of special alternating knots based on\nthem.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:30:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Azarpendar","Soheil",""]]}
{"id":"2308.08023","submitter":"Hashim A. Hashim","authors":"Hashim A. Hashim, Abdelrahman E. E. Eltoukhy, Kyriakos G. Vamvoudakis,\n  and Mohammed I. Abouheaf","title":"Nonlinear Deterministic Observer for Inertial Navigation using\n  Ultra-wideband and IMU Sensor Fusion","comments":"2023 IEEE/RSJ International Conference on Intelligent Robots and\n  Systems (IROS)","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":"  Navigation in Global Positioning Systems (GPS)-denied environments requires\nrobust estimators reliant on fusion of inertial sensors able to estimate\nrigid-body's orientation, position, and linear velocity. Ultra-wideband (UWB)\nand Inertial Measurement Unit (IMU) represent low-cost measurement technology\nthat can be utilized for successful Inertial Navigation. This paper presents a\nnonlinear deterministic navigation observer in a continuous form that directly\nemploys UWB and IMU measurements. The estimator is developed on the extended\nSpecial Euclidean Group $\\mathbb{SE}_{2}\\left(3\\right)$ and ensures exponential\nconvergence of the closed loop error signals starting from almost any initial\ncondition. The discrete version of the proposed observer is tested using a\npublicly available real-world dataset of a drone flight. Keywords:\nUltra-wideband, Inertial measurement unit, Sensor Fusion, Positioning system,\nGPS-denied navigation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:30:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hashim","Hashim A.",""],["Eltoukhy","Abdelrahman E. E.",""],["Vamvoudakis","Kyriakos G.",""],["Abouheaf","Mohammed I.",""]]}
{"id":"2308.08024","submitter":"Guillermo Navarro Del Toro","authors":"Guillermo Jose Navarro del Toro","title":"Aplicacion de software matematico en carreras de ingenieria","comments":"22 paginas, in Spanish language","journal-ref":null,"doi":"10.23913/ride.v11i22.954","report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With the aim of finding ways that can lead to solving the problem of learning\nthe exact sciences and involving the university student in a participatory and\nactive way during the semester period with the help of new technologies, the\nfollowing methodology was developed: a) applications (apps) for smartphones\nthat allow calculations were sought; b) selected the apps, the characteristics\nfor the software were identified; c) groups were selected in which the new\nmethod could be tested; d) a bank of problems was developed for the\nparticipants to solve, and e) a survey was applied to the students at the end\nof the courses. As a result of this search, it was found that there are\nsoftware packages that can be used for physics subjects and that, in addition,\nmeet the requirement of being free (at least in their basic version). After\nhaving applied the new method in three groups, in two different semester\nperiods and in different courses, it is gratifying to see that the students\nwere interested in really learning the exact sciences, and even in managing\ntheir self-study. The participants were able to develop a higher number of\nproblems than is usually solved with the conventional method.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:30:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["del Toro","Guillermo Jose Navarro",""]]}
{"id":"2308.08025","submitter":"Junyu Liu","authors":"Junyu Liu, Hansheng Jiang, Zuo-Jun Max Shen","title":"Potential Energy Advantage of Quantum Economy","comments":"23 pages, many figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI cs.ET cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Energy cost is increasingly crucial in the modern computing industry with the\nwide deployment of large-scale machine learning models and language models. For\nthe firms that provide computing services, low energy consumption is important\nboth from the perspective of their own market growth and the government's\nregulations. In this paper, we study the energy benefits of quantum computing\nvis-a-vis classical computing. Deviating from the conventional notion of\nquantum advantage based solely on computational complexity, we redefine\nadvantage in an energy efficiency context. Through a Cournot competition model\nconstrained by energy usage, we demonstrate quantum computing firms can\noutperform classical counterparts in both profitability and energy efficiency\nat Nash equilibrium. Therefore quantum computing may represent a more\nsustainable pathway for the computing industry. Moreover, we discover that the\nenergy benefits of quantum computing economies are contingent on large-scale\ncomputation. Based on real physical parameters, we further illustrate the scale\nof operation necessary for realizing this energy efficiency advantage.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:30:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Junyu",""],["Jiang","Hansheng",""],["Shen","Zuo-Jun Max",""]]}
{"id":"2308.08026","submitter":"Jasper van de Kreeke","authors":"Jasper van de Kreeke","title":"$ A_\\infty $-Deformations and their Derived Categories","comments":"41 pages, 3 figures plus further graphics. The material was moved\n  from arXiv:2305.09112","journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.AG math.CT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Handling curved $ A_\\infty $-deformations is challenging and defining their\nderived categories seems impossible. In this paper, we show how to welcome the\ncurvature and build derived categories despite the apparent difficulties. We\nexplicitly describe their $ A_\\infty $-structure by a deformed Kadeishvili\ntheorem.\n  This paper starts with a review of $ A_\\infty $-deformations for\nnon-specialists. We explain why $ A_\\infty $-deformations require curvature and\nwhy curvature supposedly causes problems. We prove that infinitesimally curved\n$ A_\\infty $-deformations are in fact non-problematic and provide the correct\ndefinitions for their twisted completion and minimal model.\n  The classical Kadeishvili theorem collapses for curved deformations. We show\nhow to adapt it by iteratively optimizing the curvature and changing the\nhomological splitting infinitesimally. The final $ A_\\infty $-structure on the\nminimal model is constructed in terms of trees.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:32:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["van de Kreeke","Jasper",""]]}
{"id":"2308.08027","submitter":"Bolaji Yusuf","authors":"Bolaji Yusuf, Jan Cernocky, Murat Saraclar","title":"End-to-End Open Vocabulary Keyword Search With Multilingual Neural\n  Representations","comments":"Accepted by IEEE/ACM Transactions on Audio, Speech and Language\n  Processing (TASLP), 2023","journal-ref":"in IEEE/ACM Transactions on Audio, Speech, and Language\n  Processing, vol. 31, pp. 3070-3080, 2023","doi":"10.1109/TASLP.2023.3301239","report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional keyword search systems operate on automatic speech recognition\n(ASR) outputs, which causes them to have a complex indexing and search\npipeline. This has led to interest in ASR-free approaches to simplify the\nsearch procedure. We recently proposed a neural ASR-free keyword search model\nwhich achieves competitive performance while maintaining an efficient and\nsimplified pipeline, where queries and documents are encoded with a pair of\nrecurrent neural network encoders and the encodings are combined with a\ndot-product. In this article, we extend this work with multilingual pretraining\nand detailed analysis of the model. Our experiments show that the proposed\nmultilingual training significantly improves the model performance and that\ndespite not matching a strong ASR-based conventional keyword search system for\nshort queries and queries comprising in-vocabulary words, the proposed model\noutperforms the ASR-based system for long queries and queries that do not\nappear in the training data.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:33:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yusuf","Bolaji",""],["Cernocky","Jan",""],["Saraclar","Murat",""]]}
{"id":"2308.08028","submitter":"Geoffrey Messier","authors":"Geoffrey G. Messier","title":"A Graph Analysis of the Impact of COVID-19 on Emergency Housing Shelter\n  Access Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates how COVID-19 disrupted emergency housing shelter\naccess patterns in Calgary, Canada and what aspects of these changes persist to\nthe present day. This analysis will utilize aggregated shelter access data for\nover 40,000 individuals from seven major urban shelters dating from 2018 to the\npresent. A graph theoretic approach will be used to examine the journeys of\nindividuals between shelters before, during and after the COVID-19 lockdown\nperiod. This approach treats shelters as nodes in a graph and a person's\ntransition between shelter as an arrow or edge between nodes. This perspective\nis used to create both timeline and network diagrams that visualize shelter use\nand the flow of people between shelters. Statistical results are also presented\nthat illustrate the differences between the cohorts of people who only used\nshelter pre/post-lockdown, people who stayed in shelter during lockdown and\npeople who used shelter for the first time during lockdown. The results\ndemonstrate not only how a complex system of care responded to the pandemic but\nalso the characteristics of the people most likely to continue to rely on that\nsystem during an emergency.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:34:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Messier","Geoffrey G.",""]]}
{"id":"2308.08029","submitter":"Ryan Smith","authors":"Rowan Hodson, Bruce Bassett, Charel van Hoof, Benjamin Rosman, Mark\n  Solms, Jonathan P. Shock, Ryan Smith","title":"Planning to Learn: A Novel Algorithm for Active Learning during\n  Model-Based Planning","comments":"31 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Active Inference is a recent framework for modeling planning under\nuncertainty. Empirical and theoretical work have now begun to evaluate the\nstrengths and weaknesses of this approach and how it might be improved. A\nrecent extension - the sophisticated inference (SI) algorithm - improves\nperformance on multi-step planning problems through recursive decision tree\nsearch. However, little work to date has been done to compare SI to other\nestablished planning algorithms. SI was also developed with a focus on\ninference as opposed to learning. The present paper has two aims. First, we\ncompare performance of SI to Bayesian reinforcement learning (RL) schemes\ndesigned to solve similar problems. Second, we present an extension of SI -\nsophisticated learning (SL) - that more fully incorporates active learning\nduring planning. SL maintains beliefs about how model parameters would change\nunder the future observations expected under each policy. This allows a form of\ncounterfactual retrospective inference in which the agent considers what could\nbe learned from current or past observations given different future\nobservations. To accomplish these aims, we make use of a novel, biologically\ninspired environment designed to highlight the problem structure for which SL\noffers a unique solution. Here, an agent must continually search for available\n(but changing) resources in the presence of competing affordances for\ninformation gain. Our simulations show that SL outperforms all other algorithms\nin this context - most notably, Bayes-adaptive RL and upper confidence bound\nalgorithms, which aim to solve multi-step planning problems using similar\nprinciples (i.e., directed exploration and counterfactual reasoning). These\nresults provide added support for the utility of Active Inference in solving\nthis class of biologically-relevant problems and offer added tools for testing\nhypotheses about human cognition.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:39:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hodson","Rowan",""],["Bassett","Bruce",""],["van Hoof","Charel",""],["Rosman","Benjamin",""],["Solms","Mark",""],["Shock","Jonathan P.",""],["Smith","Ryan",""]]}
{"id":"2308.08030","submitter":"Tian-Yi Zhou","authors":"Tian-Yi Zhou, Xiaoming Huo","title":"Classification of Data Generated by Gaussian Mixture Models Using Deep\n  ReLU Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the binary classification of unbounded data from ${\\mathbb\nR}^d$ generated under Gaussian Mixture Models (GMMs) using deep ReLU neural\nnetworks. We obtain $\\unicode{x2013}$ for the first time $\\unicode{x2013}$\nnon-asymptotic upper bounds and convergence rates of the excess risk (excess\nmisclassification error) for the classification without restrictions on model\nparameters. The convergence rates we derive do not depend on dimension $d$,\ndemonstrating that deep ReLU networks can overcome the curse of dimensionality\nin classification. While the majority of existing generalization analysis of\nclassification algorithms relies on a bounded domain, we consider an unbounded\ndomain by leveraging the analyticity and fast decay of Gaussian distributions.\nTo facilitate our analysis, we give a novel approximation error bound for\ngeneral analytic functions using ReLU networks, which may be of independent\ninterest. Gaussian distributions can be adopted nicely to model data arising in\napplications, e.g., speeches, images, and texts; our results provide a\ntheoretical verification of the observed efficiency of deep neural networks in\npractical classification problems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:40:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhou","Tian-Yi",""],["Huo","Xiaoming",""]]}
{"id":"2308.08031","submitter":"Dhagash Mehta","authors":"Dimitrios Vamvourellis, M\\'at\\'e Toth, Snigdha Bhagat, Dhruv Desai,\n  Dhagash Mehta, Stefano Pasquali","title":"Company Similarity using Large Language Models","comments":"8 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST q-fin.CP stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Identifying companies with similar profiles is a core task in finance with a\nwide range of applications in portfolio construction, asset pricing and risk\nattribution. When a rigorous definition of similarity is lacking, financial\nanalysts usually resort to 'traditional' industry classifications such as\nGlobal Industry Classification System (GICS) which assign a unique category to\neach company at different levels of granularity. Due to their discrete nature,\nthough, GICS classifications do not allow for ranking companies in terms of\nsimilarity. In this paper, we explore the ability of pre-trained and finetuned\nlarge language models (LLMs) to learn company embeddings based on the business\ndescriptions reported in SEC filings. We show that we can reproduce GICS\nclassifications using the embeddings as features. We also benchmark these\nembeddings on various machine learning and financial metrics and conclude that\nthe companies that are similar according to the embeddings are also similar in\nterms of financial performance metrics including return correlation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:45:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vamvourellis","Dimitrios",""],["Toth","M\u00e1t\u00e9",""],["Bhagat","Snigdha",""],["Desai","Dhruv",""],["Mehta","Dhagash",""],["Pasquali","Stefano",""]]}
{"id":"2308.08032","submitter":"Jesse Roberts","authors":"Jesse Roberts, Kyle Moore, Drew Wilenzick, Doug Fisher","title":"Using Artificial Populations to Study Psychological Phenomena in Neural\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent proliferation of research into transformer based natural language\nprocessing has led to a number of studies which attempt to detect the presence\nof human-like cognitive behavior in the models. We contend that, as is true of\nhuman psychology, the investigation of cognitive behavior in language models\nmust be conducted in an appropriate population of an appropriate size for the\nresults to be meaningful. We leverage work in uncertainty estimation in a novel\napproach to efficiently construct experimental populations. The resultant tool,\nPopulationLM, has been made open source. We provide theoretical grounding in\nthe uncertainty estimation literature and motivation from current cognitive\nwork regarding language models. We discuss the methodological lessons from\nother scientific communities and attempt to demonstrate their application to\ntwo artificial population studies. Through population based experimentation we\nfind that language models exhibit behavior consistent with typicality effects\namong categories highly represented in training. However, we find that language\nmodels don't tend to exhibit structural priming effects. Generally, our results\nshow that single models tend to over estimate the presence of cognitive\nbehaviors in neural models.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:47:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Roberts","Jesse",""],["Moore","Kyle",""],["Wilenzick","Drew",""],["Fisher","Doug",""]]}
{"id":"2308.08033","submitter":"Jiho Shin","authors":"Sepehr Hashtroudi, Jiho Shin, Hadi Hemmati, Song Wang","title":"Automated Test Case Generation Using Code Models and Domain Adaptation","comments":"10 pages + reference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  State-of-the-art automated test generation techniques, such as search-based\ntesting, are usually ignorant about what a developer would create as a test\ncase. Therefore, they typically create tests that are not human-readable and\nmay not necessarily detect all types of complex bugs developer-written tests\nwould do. In this study, we leverage Transformer-based code models to generate\nunit tests that can complement search-based test generation. Specifically, we\nuse CodeT5, i.e., a state-of-the-art large code model, and fine-tune it on the\ntest generation downstream task. For our analysis, we use the Methods2test\ndataset for fine-tuning CodeT5 and Defects4j for project-level domain\nadaptation and evaluation. The main contribution of this study is proposing a\nfully automated testing framework that leverages developer-written tests and\navailable code models to generate compilable, human-readable unit tests.\nResults show that our approach can generate new test cases that cover lines\nthat were not covered by developer-written tests. Using domain adaptation, we\ncan also increase line coverage of the model-generated unit tests by 49.9% and\n54% in terms of mean and median (compared to the model without domain\nadaptation). We can also use our framework as a complementary solution\nalongside common search-based methods to increase the overall coverage with\nmean and median of 25.3% and 6.3%. It can also increase the mutation score of\nsearch-based methods by killing extra mutants (up to 64 new mutants were killed\nper project in our experiments).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:48:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hashtroudi","Sepehr",""],["Shin","Jiho",""],["Hemmati","Hadi",""],["Wang","Song",""]]}
{"id":"2308.08034","submitter":"Burt Totaro","authors":"Louis Esser, Burt Totaro","title":"Log canonical pairs with conjecturally minimal volume","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct log canonical pairs $(X,B)$ with $B$ a nonzero reduced divisor\nand $K_X+B$ ample that have the smallest known volume. We conjecture that our\nexamples have the smallest volume in each dimension. The conjecture is true in\ndimension 2, by Liu and Shokurov. The examples are weighted projective\nhypersurfaces that are not quasi-smooth.\n  We also develop an example for a related extremal problem. Esser constructed\na klt Calabi-Yau variety which conjecturally has the smallest mld in each\ndimension (for example, mld $1/13$ in dimension 2 and $1/311$ in dimension 3).\nHowever, the example was only worked out completely in dimensions at most 18.\nWe now prove the desired properties of Esser's example in all dimensions (in\nparticular, determining its mld).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:50:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Esser","Louis",""],["Totaro","Burt",""]]}
{"id":"2308.08035","submitter":"Art Owen","authors":"Art B. Owen and Zexin Pan","title":"Gain coefficients for scrambled Halton points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Randomized quasi-Monte Carlo, via certain scramblings of digital nets,\nproduces unbiased estimates of\n$\\int_{[0,1]^d}f(\\boldsymbol{x})\\,\\mathrm{d}\\boldsymbol{x}$ with a variance\nthat is $o(1/n)$ for any $f\\in L^2[0,1]^d$. It also satisfies some\nnon-asymptotic bounds where the variance is no larger than some $\\Gamma<\\infty$\ntimes the ordinary Monte Carlo variance. For scrambled Sobol' points, this\nquantity $\\Gamma$ grows exponentially in $d$. For scrambled Faure points,\n$\\Gamma \\leqslant \\exp(1)\\doteq 2.718$ in any dimension, but those points are\nawkward to use for large $d$. This paper shows that certain scramblings of\nHalton sequences have gains below an explicit bound that is $O(\\log d)$ but not\n$O( (\\log d)^{1-\\epsilon})$ for any $\\epsilon>0$ as $d\\to\\infty$. For\n$6\\leqslant d\\leqslant 10^6$, the upper bound on the gain coefficient is never\nlarger than $3/2+\\log(d/2)$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:50:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Owen","Art B.",""],["Pan","Zexin",""]]}
{"id":"2308.08036","submitter":"Andrew Voitiv","authors":"Mark T. Lusk and Andrew A. Voitiv and Mark E. Siemens","title":"Quantized Optical Vortex-array Eigenstates in a Rotating Frame","comments":null,"journal-ref":"Phys. Rev. A 108, 023509 (2023)","doi":"10.1103/PhysRevA.108.023509","report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linear combinations of Bessel beams can be used to effectively trap light\nwithin cylindrical domains. Such hard traps can be used to produce states that\nexhibit stationary arrays of optical vortices from the perspective of a\nsteadily rotating frame. These patterned singularities can be engineered to\nhave singularities of the same or mixed charges and the requisite rotation\nrates are quantized even though the setting is purely linear. A hydrodynamic\ninterpretation is that the vortices are at rest within a compressible,\ntwo-dimensional fluid of light.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:53:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lusk","Mark T.",""],["Voitiv","Andrew A.",""],["Siemens","Mark E.",""]]}
{"id":"2308.08037","submitter":"Christian Lange","authors":"Christian Lange, Emma Daggett, Valentin Walther, Libai Huang, and\n  Jonathan D. Hood","title":"Superradiant and subradiant states in lifetime-limited organic molecules\n  through laser-induced tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An array of radiatively coupled emitters is an exciting new platform for\ngenerating, storing, and manipulating quantum light. However, the simultaneous\npositioning and tuning of multiple lifetime-limited emitters into resonance\nremains a significant challenge. Here we report the creation of superradiant\nand subradiant entangled states in pairs of lifetime-limited and sub-wavelength\nspaced organic molecules by permanently shifting them into resonance with\nlaser-induced tuning. The molecules are embedded as defects in an organic\nnanocrystal. The pump light redistributes charges in the nanocrystal and\ndramatically increases the likelihood of resonant molecules. The frequency\nspectra, lifetimes, and second-order correlation agree with a simple quantum\nmodel. This scalable tuning approach with organic molecules provides a pathway\nfor observing collective quantum phenomena in sub-wavelength arrays of quantum\nemitters.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:55:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lange","Christian",""],["Daggett","Emma",""],["Walther","Valentin",""],["Huang","Libai",""],["Hood","Jonathan D.",""]]}
{"id":"2308.08038","submitter":"Zhen Yuan","authors":"Zhen Yuan, Esther Puyol-Anton, Haran Jogeesvaran, Baba Inusa and\n  Andrew P. King","title":"Deep Learning Framework for Spleen Volume Estimation from 2D\n  Cross-sectional Views","comments":"22 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":"  Abnormal spleen enlargement (splenomegaly) is regarded as a clinical\nindicator for a range of conditions, including liver disease, cancer and blood\ndiseases. While spleen length measured from ultrasound images is a commonly\nused surrogate for spleen size, spleen volume remains the gold standard metric\nfor assessing splenomegaly and the severity of related clinical conditions.\nComputed tomography is the main imaging modality for measuring spleen volume,\nbut it is less accessible in areas where there is a high prevalence of\nsplenomegaly (e.g., the Global South). Our objective was to enable automated\nspleen volume measurement from 2D cross-sectional segmentations, which can be\nobtained from ultrasound imaging. In this study, we describe a variational\nautoencoder-based framework to measure spleen volume from single- or dual-view\n2D spleen segmentations. We propose and evaluate three volume estimation\nmethods within this framework. We also demonstrate how 95% confidence intervals\nof volume estimates can be produced to make our method more clinically useful.\nOur best model achieved mean relative volume accuracies of 86.62% and 92.58%\nfor single- and dual-view segmentations, respectively, surpassing the\nperformance of the clinical standard approach of linear regression using manual\nmeasurements and a comparative deep learning-based 2D-3D reconstruction-based\napproach. The proposed spleen volume estimation framework can be integrated\ninto standard clinical workflows which currently use 2D ultrasound images to\nmeasure spleen length. To the best of our knowledge, this is the first work to\nachieve direct 3D spleen volume estimation from 2D spleen segmentations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:58:42 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 16:21:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yuan","Zhen",""],["Puyol-Anton","Esther",""],["Jogeesvaran","Haran",""],["Inusa","Baba",""],["King","Andrew P.",""]]}
{"id":"2308.08039","submitter":"Sourabh Apte","authors":"Shashank K. Karra, Sourabh V. Apte, Xiaoliang He, and Timothy Scheibe","title":"Pore-resolved investigation of turbulent open channel flow over a\n  randomly packed permeable sediment bed","comments":"34 pages, 15 figures, 9 tables. arXiv admin note: text overlap with\n  arXiv:2204.13875","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pore-resolved direct numerical simulations (DNS) are performed to investigate\nthe interactions between streamflow turbulence and groundwater flow through a\nrandomly packed porous sediment bed for three permeability Reynolds numbers,\n$Re_K$, of 2.56, 5.17, and 8.94, representative of natural stream or river\nsystems. Time-space averaging is used to quantify the Reynolds stress,\nform-induced stress, mean flow and shear penetration depths, and mixing length\nat the sediment-water interface (SWI). The mean flow and shear penetration\ndepths increase with $Re_K$ and are found to be nonlinear functions of\nnon-dimensional permeability. The peaks and significant values of the Reynolds\nstresses, form-induced stresses, and pressure variations are shown to occur in\nthe top layer of the bed, which is also confirmed by conducting simulations of\njust the top layer as roughness elements over an impermeable wall. The\nprobability distribution functions (PDFs) of normalized local bed stress are\nfound to collapse for all Reynolds numbers and their root mean-squared\nfluctuations are assumed to follow logarithmic correlations. The fluctuations\nin local bed stress and resultant drag and lift forces on sediment grains are\nmainly a result of the top layer, their PDFs are symmetric with heavy tails,\nand can be well represented by a non-Gaussian model fit. The bed stress\nstatistics and the pressure data at the SWI can potentially be used in\nproviding better boundary conditions in modeling of incipient motion and\nreach-scale transport in the hyporheic zone.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 20:59:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Karra","Shashank K.",""],["Apte","Sourabh V.",""],["He","Xiaoliang",""],["Scheibe","Timothy",""]]}
{"id":"2308.08040","submitter":"Alvaro Liendo","authors":"Roberto D\\'iaz and Alvaro Liendo and Andriy Regeta","title":"On the characterization of affine toric varieties by their automorphism\n  group","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we show that a normal affine toric variety X different from the\nalgebraic torus is uniquely determined by its automorphism group in the\ncategory of affine irreducible, not necessarily normal, algebraic varieties if\nand only if X is isomorphic to the product of the affine line and another\nvariety. In the case where X is the algebraic torus T, we reach the same\nconclusion if we restrict the category to only include irreducible varieties of\ndimension at most the dimension of T. There are examples of varieties of\ndimension one higher than T having the same automorphism group of T. Hence,\nthis last result is optimal.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:04:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["D\u00edaz","Roberto",""],["Liendo","Alvaro",""],["Regeta","Andriy",""]]}
{"id":"2308.08041","submitter":"Christopher Shriver","authors":"Christopher Shriver","title":"Typical sofic entropy and local limits for free group shift systems","comments":"39 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that for any invariant measure $\\mu$ on a free group shift system,\nthere are two numbers $h^\\flat \\leq h^\\sharp$ which in some sense are the\ntypical upper and lower sofic entropy values. We also give a condition under\nwhich $h^\\flat = h^\\sharp = \\mathrm{f}(\\mu)$, where $\\mathrm{f}$ is the\nannealed entropy (also called the f invariant). This can be used to compute\ntypical local limits of finitary Gibbs states over sequences of random regular\ngraphs. As examples, we work out typical local limits of the Ising and Potts\nmodels.\n  We also show that, for Markov chains, the Kesten--Stigum second-eigenvalue\nreconstruction criterion actually implies there are no good models over a\ntypical sofic approximation (i.e. $h^\\sharp = -\\infty$). In particular, we have\nan exact value for the typical entropy $h^\\flat = h^\\sharp$ of the\nfree-boundary Ising state: it is equal to the annealed entropy $\\mathrm{f}$ for\ninteraction strengths up to the reconstruction threshold, after which it drops\nabruptly to $-\\infty$.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:06:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shriver","Christopher",""]]}
{"id":"2308.08042","submitter":"Yuri Lima","authors":"Vaughn Climenhaga, Mark Demers, Yuri Lima, Hongkun Zhang","title":"Lyapunov exponents and nonadapted measures for dispersing billiards","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For hyperbolic systems with singularities, such as dispersing billiards,\nPesin theory as developed by Katok and Strelcyn applies to measures that are\n\"adapted\" in the sense that they do not give too much weight to neighborhoods\nof the singularity set. The zero-entropy measures supported on grazing periodic\norbits are nonadapted, but it has been an open question whether there are\nnonadapted measures with positive entropy. We construct such measures for any\ndispersing billiard with a periodic orbit having a single grazing collision; we\nthen use our construction to show that the thermodynamic formalism for such\nbilliards has a phase transition even when one restricts attention to adapted\nor to positive entropy measures.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:13:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Climenhaga","Vaughn",""],["Demers","Mark",""],["Lima","Yuri",""],["Zhang","Hongkun",""]]}
{"id":"2308.08043","submitter":"Lang Cao","authors":"Lang Cao","title":"DiagGPT: An LLM-based Chatbot with Automatic Topic Management for\n  Task-Oriented Dialogue","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs), such as ChatGPT, are becoming increasingly\nsophisticated, demonstrating capabilities that closely resemble those of\nhumans. These AI models are playing an essential role in assisting humans with\na wide array of tasks in daily life. A significant application of AI is its use\nas a chat agent, responding to human inquiries across various domains. Current\nLLMs have shown proficiency in answering general questions. However, basic\nquestion-answering dialogue often falls short in complex diagnostic scenarios,\nsuch as legal or medical consultations. These scenarios typically necessitate\nTask-Oriented Dialogue (TOD), wherein an AI chat agent needs to proactively\npose questions and guide users towards specific task completion. Previous\nfine-tuning models have underperformed in TOD, and current LLMs do not\ninherently possess this capability. In this paper, we introduce DiagGPT\n(Dialogue in Diagnosis GPT), an innovative method that extends LLMs to TOD\nscenarios. Our experiments reveal that DiagGPT exhibits outstanding performance\nin conducting TOD with users, demonstrating its potential for practical\napplications.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:14:09 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 05:22:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cao","Lang",""]]}
{"id":"2308.08044","submitter":"Juan Paez-Farrell","authors":"Juan Paez-Farrell","title":"On the unimportance of commitment for monetary policy","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a New Keynesian model where the trade-off between stabilising the\naggregate inflation rate and the output gap arises from sectoral asymmetries,\nthe gains from commitment are either zero or negligible. Thus, to the extent\nthat economic fluctuations are caused by sectoral shocks, policies designed to\novercome the stabilisation bias are aiming to correct an unimportant problem.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:17:12 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 16:30:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Paez-Farrell","Juan",""]]}
{"id":"2308.08045","submitter":"Bryce Ferguson","authors":"Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R.\n  Marden","title":"Collaborative Coalitions in Multi-Agent Systems: Quantifying the Strong\n  Price of Anarchy for Resource Allocation Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The emergence of new communication technologies allows us to expand our\nunderstanding of distributed control and consider collaborative decision-making\nparadigms. With collaborative algorithms, certain local decision-making\nentities (or agents) are enabled to communicate and collaborate on their\nactions with one another to attain better system behavior. By limiting the\namount of communication, these algorithms exist somewhere between centralized\nand fully distributed approaches. To understand the possible benefits of this\ninter-agent collaboration, we model a multi-agent system as a common-interest\ngame in which groups of agents can collaborate on their actions to jointly\nincrease the system welfare. We specifically consider $k$-strong Nash\nequilibria as the emergent behavior of these systems and address how well these\nstates approximate the system optimal, formalized by the $k$-strong price of\nanarchy ratio. Our main contributions are in generating tight bounds on the\n$k$-strong price of anarchy in finite resource allocation games as the solution\nto a tractable linear program. By varying $k$ --the maximum size of a\ncollaborative coalition--we observe exactly how much performance is gained from\ninter-agent collaboration. To investigate further opportunities for\nimprovement, we generate upper bounds on the maximum attainable $k$-strong\nprice of anarchy when the agents' utility function can be designed.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:18:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ferguson","Bryce L.",""],["Paccagnan","Dario",""],["Pradelski","Bary S. R.",""],["Marden","Jason R.",""]]}
{"id":"2308.08046","submitter":"Mengfan Xu","authors":"Mengfan Xu, Diego Klabjan","title":"Regret Lower Bounds in Multi-agent Multi-armed Bandit","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-armed Bandit motivates methods with provable upper bounds on regret and\nalso the counterpart lower bounds have been extensively studied in this\ncontext. Recently, Multi-agent Multi-armed Bandit has gained significant\ntraction in various domains, where individual clients face bandit problems in a\ndistributed manner and the objective is the overall system performance,\ntypically measured by regret. While efficient algorithms with regret upper\nbounds have emerged, limited attention has been given to the corresponding\nregret lower bounds, except for a recent lower bound for adversarial settings,\nwhich, however, has a gap with let known upper bounds. To this end, we herein\nprovide the first comprehensive study on regret lower bounds across different\nsettings and establish their tightness. Specifically, when the graphs exhibit\ngood connectivity properties and the rewards are stochastically distributed, we\ndemonstrate a lower bound of order $O(\\log T)$ for instance-dependent bounds\nand $\\sqrt{T}$ for mean-gap independent bounds which are tight. Assuming\nadversarial rewards, we establish a lower bound $O(T^{\\frac{2}{3}})$ for\nconnected graphs, thereby bridging the gap between the lower and upper bound in\nthe prior work. We also show a linear regret lower bound when the graph is\ndisconnected. While previous works have explored these settings with upper\nbounds, we provide a thorough study on tight lower bounds.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:20:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Mengfan",""],["Klabjan","Diego",""]]}
{"id":"2308.08047","submitter":"Idan Orzech","authors":"Idan Orzech, Martin Rinard","title":"Correlated vs. Uncorrelated Randomness in Adversarial Congestion Team\n  Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider team zero-sum network congestion games with $n$ senders playing\nagainst $k$ interceptors over a graph $G$. The senders aim to minimize their\ncollective cost of sending messages over paths in $G$, which is an aggregation\nof edge costs, while the interceptors aim to maximize the collective cost by\nincreasing some of these edge costs. To evade the interceptors, the senders\nwill usually use randomized strategies. We consider two cases, the correlated\ncase when senders have access to a shared source of randomness, and the\nuncorrelated case, when each sender has access to only its own source of\nrandomness. We study the additional cost that uncorrelated senders have to\nbear, specifically by comparing the costs incurred by senders in cost-minimal\nNash Equilibria when senders can and cannot share randomness.\n  We prove that for an intuitive strict subset of cost functions, the ratio\nbetween correlated and uncorrelated costs at equilibrium is\n$O(\\min(m_c(G),n))$, where $m_c(G)$ is the mincut size of $G$. This bound is\nmuch milder compared to the most general case, where an upper bound of\n$\\Omega((m_c(G))^{n-1})$ on the ratio is known. We show that the senders can\napproximate their optimal play by playing simple strategies which select paths\nuniformly at random from subsets of disjoint paths. We then focus on two\nnatural cost functions. For the first, we prove that one of the simple\nstrategies above is an optimal strategy for senders over graphs with disjoint\npaths. In complete contrast, for the second cost function we prove that none of\nthese simple strategies is optimal for the senders over these graphs, unless\nthe game instance admits a trivial optimal senders strategy.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:20:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Orzech","Idan",""],["Rinard","Martin",""]]}
{"id":"2308.08048","submitter":"Alireza Qaiumzadeh","authors":"Jostein N. Kl{\\o}getvedt and Alireza Qaiumzadeh","title":"Tunable topological magnon-polaron states and anomalous Hall phenomena\n  in two-dimensional ferromagnetic insulators","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study magnon-polaron hybrid states, mediated by Dzyaloshinskii-Moriya and\nmagnetoelastic interactions, in a two-dimensional ferromagnetic insulator. The\nmagnetic system consists of both in-plane and flexural acoustic and optical\nphonon bands, as well as acoustic and optical magnon bands. Through\nmanipulation of the ground-state magnetization direction using a magnetic\nfield, we demonstrate the tunability of Chern numbers and (spin) Berry\ncurvatures of magnon-polaron hybrid bands. This adjustment subsequently\nmodifies two anomalous Hall responses of the system, namely, thermal Hall and\nspin Nernset signals. Notably, we find that by changing the magnetic field\ndirection in particular directions, it is possible to completely suppress the\nthermal Hall signal while maintaining a finite spin Nernst signal. Our finding\nreveals the intricate interplay between topological and quantum geometrical\nphenomena and magnetic ordering, offering compelling avenues for on-demand\ncontrol over emergent quantum states in condensed matter systems.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:21:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kl\u00f8getvedt","Jostein N.",""],["Qaiumzadeh","Alireza",""]]}
{"id":"2308.08049","submitter":"Patricio Gallardo","authors":"Patricio Gallardo, Jesus Martinez-Garcia, Han-Bom Moon and David\n  Swinarski","title":"Computation of GIT quotients of semisimple groups","comments":"32 pages, 3 figures. 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG cs.MS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe three algorithms to determine the stable, semistable, and\ntorus-polystable loci of the GIT quotient of a projective variety by a\nreductive group. The algorithms are efficient when the group is semisimple. By\nusing an implementation of our algorithms for simple groups, we provide several\napplications to the moduli theory of algebraic varieties, including the\nK-moduli of algebraic varieties, the moduli of algebraic curves and the Mukai\nmodels of the moduli space of curves for low genus. We also discuss a number of\npotential improvements and some natural open problems arising from this work.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:29:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gallardo","Patricio",""],["Martinez-Garcia","Jesus",""],["Moon","Han-Bom",""],["Swinarski","David",""]]}
{"id":"2308.08050","submitter":"Gabriel Bottrill","authors":"Gabriel Bottrill, Mudit Pandey, Olivia Di Matteo","title":"Exploring the Potential of Qutrits for Quantum Optimization of Graph\n  Coloring","comments":"Accepted in IEEE QCE23 (New Ideas and Emergent Results)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent hardware demonstrations and advances in circuit compilation have made\nquantum computing with higher-dimensional systems (qudits) on near-term devices\nan attractive possibility. Some problems have more natural or optimal encodings\nusing qudits over qubits. We explore this potential by formulating graph\n3-coloring, a well-known and difficult problem with practical applications,\nusing qutrits, and solve it using the quantum approximate optimization\nalgorithm (QAOA). Qutrit-based cost and mixer Hamiltonians are constructed\nalong with appropriate quantum circuits using qutrit gates. We run noiseless\nsimulations using PennyLane to compare the formulation against qubit-based\nQAOA, and analyze the solution quality and resources required. Preliminary\nresults show that the qutrit encoding finds more accurate solutions with a\ncomparable set of hyperparameters, uses half as many qudits, and has a notably\nsmaller circuit depth per layer than an efficient qubit encoding. This work\nsuggests that qutrits may be useful in solving some problems on near-term\ndevices, however further work is required to assess their potential in a noisy\nenvironment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:31:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bottrill","Gabriel",""],["Pandey","Mudit",""],["Di Matteo","Olivia",""]]}
{"id":"2308.08051","submitter":"Elena Gal","authors":"Elena Gal, Shaun Singh, Aldo Pacchiano, Ben Walker, Terry Lyons, Jakob\n  Foerster","title":"Unbiased Decisions Reduce Regret: Adversarial Domain Adaptation for the\n  Bank Loan Problem","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 many real world settings binary classification decisions are made based on\nlimited data in near real-time, e.g. when assessing a loan application. We\nfocus on a class of these problems that share a common feature: the true label\nis only observed when a data point is assigned a positive label by the\nprincipal, e.g. we only find out whether an applicant defaults if we accepted\ntheir loan application. As a consequence, the false rejections become\nself-reinforcing and cause the labelled training set, that is being\ncontinuously updated by the model decisions, to accumulate bias. Prior work\nmitigates this effect by injecting optimism into the model, however this comes\nat the cost of increased false acceptance rate. We introduce adversarial\noptimism (AdOpt) to directly address bias in the training set using adversarial\ndomain adaptation. The goal of AdOpt is to learn an unbiased but informative\nrepresentation of past data, by reducing the distributional shift between the\nset of accepted data points and all data points seen thus far. AdOpt\nsignificantly exceeds state-of-the-art performance on a set of challenging\nbenchmark problems. Our experiments also provide initial evidence that the\nintroduction of adversarial domain adaptation improves fairness in this\nsetting.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:35:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gal","Elena",""],["Singh","Shaun",""],["Pacchiano","Aldo",""],["Walker","Ben",""],["Lyons","Terry",""],["Foerster","Jakob",""]]}
{"id":"2308.08052","submitter":"Samson Ying Lok Chan","authors":"Mohamed M. Anber, Samson Y.L. Chan","title":"2-index chiral gauge theories","comments":"40 pages + appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We undertake a systematic study of the $4$-dimensional $SU(N)$ $2$-index\nchiral gauge theories and investigate their faithful global symmetries and\ndynamics. These are a finite set of theories with fermions in the $2$-index\nsymmetric and anti-symmetric representations, with no fundamentals, and they do\nnot admit a large-$N$ limit. We employ a combination of perturbative and\nnonperturbative methods, enabling us to constrain their infrared (IR) phases.\nSpecifically, we leverage the 't Hooft anomalies associated with continuous and\ndiscrete groups to eliminate a few scenarios. In some cases, the anomalies rule\nout the possibility of fermion composites. In other cases, the interplay\nbetween the continuous and discrete anomalies leads to multiple higher-order\ncondensates, which inevitably form to match the anomalies. Further, we pinpoint\nthe most probable symmetry-breaking patterns by searching for condensates that\nmatch the full set of anomalies resulting in the smallest number of IR degrees\nof freedom. Higher-loop $\\beta$-function analysis suggests that a few theories\nmay flow to a conformal fixed point.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:36:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Anber","Mohamed M.",""],["Chan","Samson Y. L.",""]]}
{"id":"2308.08053","submitter":"Ahmad Ayaz Amin","authors":"Ahmad Ayaz Amin","title":"Natural Evolution Strategies as a Black Box Estimator for Stochastic\n  Variational Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Stochastic variational inference and its derivatives in the form of\nvariational autoencoders enjoy the ability to perform Bayesian inference on\nlarge datasets in an efficient manner. However, performing inference with a VAE\nrequires a certain design choice (i.e. reparameterization trick) to allow\nunbiased and low variance gradient estimation, restricting the types of models\nthat can be created. To overcome this challenge, an alternative estimator based\non natural evolution strategies is proposed. This estimator does not make\nassumptions about the kind of distributions used, allowing for the creation of\nmodels that would otherwise not have been possible under the VAE framework.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:43:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Amin","Ahmad Ayaz",""]]}
{"id":"2308.08054","submitter":"Spencer Kraisler","authors":"Spencer Kraisler, Shahriar Talebi, Mehran Mesbahi","title":"Consensus on Lie groups for the Riemannian Center of Mass","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we develop a consensus algorithm for distributed computation\nof the Riemannian center of mass (RCM) on Lie Groups. The algorithm is built\nupon a distributed optimization reformulation that allows developing an\nintrinsic, distributed (without relying on a consensus subroutine), and a\ncomputationally efficient protocol for the RCM computation. The novel idea for\ndeveloping this fast distributed algorithm is to utilize a Riemannian version\nof distributed gradient flow combined with a gradient tracking technique. We\nfirst guarantee that, under certain conditions, the limit point of our\nalgorithm is the RCM point of interest. We then provide a proof of global\nconvergence in the Euclidean setting, that can be viewed as a \"geometric\"\ndynamic consensus that converges to the average from arbitrary initial points.\nFinally, we proceed to showcase the superior convergence properties of the\nproposed approach as compared with other classes of consensus\noptimization-based algorithms for the RCM computation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:49:32 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kraisler","Spencer",""],["Talebi","Shahriar",""],["Mesbahi","Mehran",""]]}
{"id":"2308.08055","submitter":"Tomasz Steifer","authors":"Alexander Kozachinskiy, Tomasz Steifer","title":"Simple online learning with consistency oracle","comments":"submitted to conference","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 consider online learning in the model where a learning algorithm can\naccess the class only via the consistency oracle -- an oracle, that, at any\nmoment, can give a function from the class that agrees with all examples seen\nso far. This model was recently considered by Assos et al. (COLT'23). It is\nmotivated by the fact that standard methods of online learning rely on\ncomputing the Littlestone dimension of subclasses, a problem that is\ncomputationally intractable. Assos et al. gave an online learning algorithm in\nthis model that makes at most $C^d$ mistakes on classes of Littlestone\ndimension $d$, for some absolute unspecified constant $C > 0$. We give a novel\nalgorithm that makes at most $O(256^d)$ mistakes. Our proof is significantly\nsimpler and uses only very basic properties of the Littlestone dimension. We\nalso observe that there exists no algorithm in this model that makes at most\n$2^{d+1}-2$ mistakes. We also observe that our algorithm (as well as the\nalgorithm of Assos et al.) solves an open problem by Hasrati and Ben-David\n(ALT'23). Namely, it demonstrates that every class of finite Littlestone\ndimension with recursively enumerable representation admits a computable online\nlearner (that may be undefined on unrealizable samples).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:50:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kozachinskiy","Alexander",""],["Steifer","Tomasz",""]]}
{"id":"2308.08056","submitter":"Leonardo Guidoni","authors":"Leonardo Ratini, Chiara Capecci, Leonardo Guidoni","title":"Natural orbitals and sparsity of quantum mutual information","comments":"11 pages + supplementary meterial","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Natural orbitals, defined in electronic structure and quantum chemistry as\nthe (molecular) orbitals diagonalizing the one-particle reduced density matrix\nof the ground state, have been conjectured for decades to be the perfect\nreference orbitals to describe electron correlation. In the present work we\napplied the Wavefunction-Adapted Hamiltonian Through Orbital Rotation (WAHTOR)\nmethod to study correlated empirical ans\\\"atze for quantum computing. In all\nrepresentative molecules considered, we show that the converged orbitals are\ncoinciding with natural orbitals. Interestingly, the resulting quantum mutual\ninformation matrix built on such orbitals is also maximally sparse, providing a\nclear picture that such orbital choice is indeed able to provide the optimal\nbasis to describe electron correlation. The correlation is therefore encoded in\na smaller number of qubit pairs contributing to the quantum mutual information\nmatrix.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:51:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ratini","Leonardo",""],["Capecci","Chiara",""],["Guidoni","Leonardo",""]]}
{"id":"2308.08057","submitter":"Zeyu Ding","authors":"Zeyu Ding, John Durrell, Daniel Kifer, Prottay Protivash, Guanhong\n  Wang, Yuxin Wang, Yingtai Xiao, Danfeng Zhang","title":"A Floating-Point Secure Implementation of the Report Noisy Max with Gap\n  Mechanism","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Noisy Max mechanism and its variations are fundamental private selection\nalgorithms that are used to select items from a set of candidates (such as the\nmost common diseases in a population), while controlling the privacy leakage in\nthe underlying data. A recently proposed extension, Noisy Top-k with Gap,\nprovides numerical information about how much better the selected items are\ncompared to the non-selected items (e.g., how much more common are the selected\ndiseases). This extra information comes at no privacy cost but crucially relies\non infinite precision for the privacy guarantees. In this paper, we provide a\nfinite-precision secure implementation of this algorithm that takes advantage\nof integer arithmetic.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:59:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ding","Zeyu",""],["Durrell","John",""],["Kifer","Daniel",""],["Protivash","Prottay",""],["Wang","Guanhong",""],["Wang","Yuxin",""],["Xiao","Yingtai",""],["Zhang","Danfeng",""]]}
{"id":"2308.08058","submitter":"Nathaniel Hanson","authors":"Nathaniel Hanson, Benjamin Pyatski, Samuel Hibbard, Charles DiMarzio,\n  Ta\\c{s}k{\\i}n Pad{\\i}r","title":"Hyper-Drive: Visible-Short Wave Infrared Hyperspectral Imaging Datasets\n  for Robots in Unstructured Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperspectral sensors have enjoyed widespread use in the realm of remote\nsensing; however, they must be adapted to a format in which they can be\noperated onboard mobile robots. In this work, we introduce a first-of-its-kind\nsystem architecture with snapshot hyperspectral cameras and point spectrometers\nto efficiently generate composite datacubes from a robotic base. Our system\ncollects and registers datacubes spanning the visible to shortwave infrared\n(660-1700 nm) spectrum while simultaneously capturing the ambient solar\nspectrum reflected off a white reference tile. We collect and disseminate a\nlarge dataset of more than 500 labeled datacubes from on-road and off-road\nterrain compliant with the ATLAS ontology to further the integration and\ndemonstration of hyperspectral imaging (HSI) as beneficial in terrain class\nseparability. Our analysis of this data demonstrates that HSI is a significant\nopportunity to increase understanding of scene composition from a robot-centric\ncontext. All code and data are open source online:\nhttps://river-lab.github.io/hyper_drive_data\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:01:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hanson","Nathaniel",""],["Pyatski","Benjamin",""],["Hibbard","Samuel",""],["DiMarzio","Charles",""],["Pad\u0131r","Ta\u015fk\u0131n",""]]}
{"id":"2308.08059","submitter":"Oderico-Benjamin Buran","authors":"Zhirayr Avetisyan, Oderico-Benjamin Buran, Andrew Paul, Lisa Reed","title":"Topological Properties of Almost Abelian Groups","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An almost Abelian Lie group is a non-Abelian Lie group with a codimension 1\nAbelian subgroup. We show that all discrete subgroups of complex simply\nconnected almost Abelian groups are finitely generated. The topology of\nconnected almost Abelian Lie groups is studied by expressing each connected\nalmost Abelian Lie group as a quotient of its universal covering group by a\ndiscrete normal subgroup. We then prove that no complex connected almost\nAbelian group is compact, and give conditions for the compactness of connected\nsubgroups of such groups. Towards studying the homotopy type of complex\nconnected almost Abelian groups, we investigate the maximal compact subgroups\nof such groups.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:04:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Avetisyan","Zhirayr",""],["Buran","Oderico-Benjamin",""],["Paul","Andrew",""],["Reed","Lisa",""]]}
{"id":"2308.08060","submitter":"Neriman Tokcan","authors":"Daniel Chafamo, Vignesh Shanmugam, Neriman Tokcan","title":"Robust Bayesian Tensor Factorization with Zero-Inflated Poisson Model\n  and Consensus Aggregation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.AG q-bio.GN stat.AP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Tensor factorizations (TF) are powerful tools for the efficient\nrepresentation and analysis of multidimensional data. However, classic TF\nmethods based on maximum likelihood estimation underperform when applied to\nzero-inflated count data, such as single-cell RNA sequencing (scRNA-seq) data.\nAdditionally, the stochasticity inherent in TFs results in factors that vary\nacross repeated runs, making interpretation and reproducibility of the results\nchallenging. In this paper, we introduce Zero Inflated Poisson Tensor\nFactorization (ZIPTF), a novel approach for the factorization of\nhigh-dimensional count data with excess zeros. To address the challenge of\nstochasticity, we introduce Consensus Zero Inflated Poisson Tensor\nFactorization (C-ZIPTF), which combines ZIPTF with a consensus-based\nmeta-analysis. We evaluate our proposed ZIPTF and C-ZIPTF on synthetic\nzero-inflated count data and synthetic and real scRNA-seq data. ZIPTF\nconsistently outperforms baseline matrix and tensor factorization methods in\nterms of reconstruction accuracy for zero-inflated data. When the probability\nof excess zeros is high, ZIPTF achieves up to $2.4\\times$ better accuracy.\nAdditionally, C-ZIPTF significantly improves the consistency and accuracy of\nthe factorization. When tested on both synthetic and real scRNA-seq data, ZIPTF\nand C-ZIPTF consistently recover known and biologically meaningful gene\nexpression programs.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:25:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chafamo","Daniel",""],["Shanmugam","Vignesh",""],["Tokcan","Neriman",""]]}
{"id":"2308.08061","submitter":"Abi Aryan","authors":"Abi Aryan, Aakash Kumar Nain, Andrew McMahon, Lucas Augusto Meyer,\n  Harpreet Singh Sahota","title":"The Costly Dilemma: Generalization, Evaluation and Cost-Optimal\n  Deployment of Large Language Models","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When deploying machine learning models in production for any\nproduct/application, there are three properties that are commonly desired.\nFirst, the models should be generalizable, in that we can extend it to further\nuse cases as our knowledge of the domain area develops. Second they should be\nevaluable, so that there are clear metrics for performance and the calculation\nof those metrics in production settings are feasible. Finally, the deployment\nshould be cost-optimal as far as possible. In this paper we propose that these\nthree objectives (i.e. generalization, evaluation and cost-optimality) can\noften be relatively orthogonal and that for large language models, despite\ntheir performance over conventional NLP models, enterprises need to carefully\nassess all the three factors before making substantial investments in this\ntechnology. We propose a framework for generalization, evaluation and\ncost-modeling specifically tailored to large language models, offering insights\ninto the intricacies of development, deployment and management for these large\nlanguage models.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:26:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Aryan","Abi",""],["Nain","Aakash Kumar",""],["McMahon","Andrew",""],["Meyer","Lucas Augusto",""],["Sahota","Harpreet Singh",""]]}
{"id":"2308.08062","submitter":"Flavia Luane Rommel","authors":"F. L. Rommel (1, 2, 3), F. Braga-Ribas (3, 1, 2), J. L. Ortiz (4), B.\n  Sicardy (5), P. Santos-Sanz (4), J. Desmars (6, 7), J. I. B. Camargo (1, 2),\n  R. Vieira-Martins (1, 2), M. Assafin (8, 2), B. E. Morgado (8, 2, 1), R. C.\n  Boufleur (1, 2), G. Benedetti-Rossi (9, 5, 2), A. R. Gomes-J\\'unior (10, 9,\n  2), E. Fern\\'andez-Valenzuela (11), B. J. Holler (12), D. Souami (5, 13, 14),\n  R. Duffard (4), G. Margoti (3, 2), M. Vara-Lubiano (4), J. Lecacheux (5), J.\n  L. Plouvier (15), N. Morales (4), A. Maury (16), J. Fabrega (17), P. Ceravolo\n  (18), E. Jehin (19), D. Albanese (20), H. Mariey (21), S. Cikota (22, 23), D.\n  Ru\\v{z}djak (24), A. Cikota (25), R. Szak\\'ats (26, 27), D. Baba Aissa (28),\n  Z. Gringahcene (28), V. Kashuba (29), N. Koshkin (29), V. Zhukov (30), S.\n  Fi\\c{s}ek (31, 32), O. \\c{C}ak{\\i}r (33, 34), S. \\\"Ozer (35, 36), C. Schnabel\n  (37, 38), M. Schnabel (38), F. Signoret (39), L. Morrone (40, 41), T.\n  Santana-Ros (42, 43), C. L. Pereira (1, 2, 3), M. Emilio (44, 1, 3), A. Y.\n  Burdanov (45), J. de Wit (45), K. Barkaoui (46, 45, 47), M. Gillon (46), G.\n  Leto (48), A. Frasca (48), G. Catanzaro (48), R. Zanmar Sanchez (48), U.\n  Tagliaferri (49), M. Di Sora (49), G. Isopi (49), Y. Krugly (50, 51), I.\n  Slyusarev (50), V. Chiorny (50), H. Miku\\v{z} (52, 53), P. Bacci (54), M.\n  Maestripieri (54), M. D. Grazia (54), I. de la Cueva (55), M. Yuste-Moreno\n  (55), F. Ciabattari (56), O. M. Kozhukhov (57), M. Serra-Ricart (47, 58), M.\n  R. Alarcon (47, 58), J. Licandro (47, 58), G. Masi (59), R. Bacci (60), J. M.\n  Bosch (61), R. Behem (62), J.-P. Prost (62), S. Renner (7, 63), M. Conjat\n  (21), M. Bachini (64), G. Succi (64), L. Stoian (65), A. Juravle (65), D.\n  Carosati (66), B. Gowe (67), J. Carrillo (68), A. P. Zheleznyak (50), N.\n  Montigiani (69), C. R. Foster (70), M. Mannucci (69), N. Ruocco (71), F.\n  Cuevas (72), P. Di Marcantonio (73), I. Coretti (73), G. Iafrate (73), V.\n  Baldini (73), M. Collins (74), A. P\\'al (26), B. Cs\\'ak (26), E.\n  Fern\\'andez-Garcia (4), A. J. Castro-Tirado (4), L. Hudin (75), J. M. Madiedo\n  (4), R. M. Anghel (76), J. F. Calvo-Fern\\'andez (77), A. Valvasori (78, 79),\n  E. Guido (80), R. M. Gherase (81), S. Kamoun (82, 83), R. Fafet (62), M.\n  S\\'anchez-Gonz\\'alez (84, 85), L. Curelaru (86), C. D. V\\^intdevar\\u{a}(87),\n  C. A. Danescu (88), J.-F. Gout (89), C. J. Schmitz (90), A. Sota (4), I.\n  Belskaya (5, 50), M. Rodr\\'iguez-Marco (91), Y. Kilic (92, 93), E. Frappa\n  (94), A. Klotz (95), M. Lavayssi\\`ere (96), J. Marques Oliveira (5), M.\n  Popescu (88), L. A. Mammana (97, 98), E. Fern\\'andez-Laj\\'us (98, 99), M.\n  Schmidt (100), U. Hopp (100), R. Kom\\v{z}\\'ik (101), T. Pribulla (101), D.\n  Tomko (101), M. Hus\\'arik (101), O. Erece (93, 92), S. Eryilmaz (93), L.\n  Buzzi (102), B. G\\\"ahrken (103), D. Nardiello (104, 105), K. Hornoch (106),\n  E. Sonbas (107, 108), H. Er (109), V. Burwitz (110), P. Waldemar Sybilski\n  (111), W. Bykowski (111), T. G. M\\\"uller (110), W. Ogloza (112), R.\n  Gon\\c{c}alves (113), J. F. Ferreira (114), M. Ferreira (115), M. Bento (115),\n  S. Meister (116, 117), M. N. Bagiran (118), M. Teke\\c{s}(119, 120), A.\n  Marciniak (51), Z. Moravec (121), P. Delin\\v{c}\\'ak (122), G. Gianni (123),\n  G. B. Casalnuovo (124), M. Boutet (125), J. Sanchez (126), B. Klemt (37,\n  127), N. Wuensche (37), W. Burzynski (128, 129, 37), M. Borkowski (130), M.\n  Serrau (131), G. Dangl (37), O. Kl\\\"os (37), C. Weber (37), M. Urban\\'ik\n  (132), L. Rousselot (131), J. Kub\\'anek (37, 133, 134), P. Andr\\'e (135), C.\n  Colazo (136, 137, 138), J. Spagnotto (139), A. A. Sickafoose (140), R. Hueso\n  (141), A. S\\'anchez-Lavega (141), R. S. Fisher (142), A. W. Rengstorf (143),\n  C. Perell\\'o (38, 37), M. Dascalu (144), M. Altan (145), K. Gazeas (146), T.\n  de Santana (5, 9, 147), R. Sfair (9, 147), O. C. Winter (9), S. Kalkan (148),\n  O. Canales-Moreno (38), J. M. Trigo-Rodr\\'iguez (149), V. Tsamis (150), K.\n  Tigani (150), N. Sioulas (151), G. Lekkas (152), D. N. Bertesteanu (81), V.\n  Dumitrescu (153), A. J. Wilberger (154), J. W. Barnes (155), S. K.\n  Fieber-Beyer (156), R. L. Swaney (157), C. Fuentes (158, 159, 160), R. A.\n  Mendez (158), B. D. Dumitru (161), R. L. Flynn (162), D. A. Wake (163)","title":"A large topographic feature on the surface of the trans-Neptunian object\n  (307261) 2002 MS$_4$ measured from stellar occultations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work aims at constraining the size, shape, and geometric albedo of the\ndwarf planet candidate 2002 MS4 through the analysis of nine stellar\noccultation events. Using multichord detection, we also studied the object's\ntopography by analyzing the obtained limb and the residuals between observed\nchords and the best-fitted ellipse. We predicted and organized the\nobservational campaigns of nine stellar occultations by 2002 MS4 between 2019\nand 2022, resulting in two single-chord events, four double-chord detections,\nand three events with three to up to sixty-one positive chords. Using 13\nselected chords from the 8 August 2020 event, we determined the global\nelliptical limb of 2002 MS4. The best-fitted ellipse, combined with the\nobject's rotational information from the literature, constrains the object's\nsize, shape, and albedo. Additionally, we developed a new method to\ncharacterize topography features on the object's limb. The global limb has a\nsemi-major axis of 412 $\\pm$ 10 km, a semi-minor axis of 385 $\\pm$ 17 km, and\nthe position angle of the minor axis is 121 $^\\circ$ $\\pm$ 16$^\\circ$. From\nthis instantaneous limb, we obtained 2002 MS4's geometric albedo and the\nprojected area-equivalent diameter. Significant deviations from the fitted\nellipse in the northernmost limb are detected from multiple sites highlighting\nthree distinct topographic features: one 11 km depth depression followed by a\n25$^{+4}_{-5}$ km height elevation next to a crater-like depression with an\nextension of 322 $\\pm$ 39 km and 45.1 $\\pm$ 1.5 km deep. Our results present an\nobject that is $\\approx$138 km smaller in diameter than derived from thermal\ndata, possibly indicating the presence of a so-far unknown satellite. However,\nwithin the error bars, the geometric albedo in the V-band agrees with the\nresults published in the literature, even with the radiometric-derived albedo.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:29:57 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 17:25:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rommel","F. L.",""],["Braga-Ribas","F.",""],["Ortiz","J. L.",""],["Sicardy","B.",""],["Santos-Sanz","P.",""],["Desmars","J.",""],["Camargo","J. I. B.",""],["Vieira-Martins","R.",""],["Assafin","M.",""],["Morgado","B. E.",""],["Boufleur","R. C.",""],["Benedetti-Rossi","G.",""],["Gomes-J\u00fanior","A. R.",""],["Fern\u00e1ndez-Valenzuela","E.",""],["Holler","B. J.",""],["Souami","D.",""],["Duffard","R.",""],["Margoti","G.",""],["Vara-Lubiano","M.",""],["Lecacheux","J.",""],["Plouvier","J. L.",""],["Morales","N.",""],["Maury","A.",""],["Fabrega","J.",""],["Ceravolo","P.",""],["Jehin","E.",""],["Albanese","D.",""],["Mariey","H.",""],["Cikota","S.",""],["Ru\u017edjak","D.",""],["Cikota","A.",""],["Szak\u00e1ts","R.",""],["Aissa","D. Baba",""],["Gringahcene","Z.",""],["Kashuba","V.",""],["Koshkin","N.",""],["Zhukov","V.",""],["Fi\u015fek","S.",""],["\u00c7ak\u0131r","O.",""],["\u00d6zer","S.",""],["Schnabel","C.",""],["Schnabel","M.",""],["Signoret","F.",""],["Morrone","L.",""],["Santana-Ros","T.",""],["Pereira","C. L.",""],["Emilio","M.",""],["Burdanov","A. Y.",""],["de Wit","J.",""],["Barkaoui","K.",""],["Gillon","M.",""],["Leto","G.",""],["Frasca","A.",""],["Catanzaro","G.",""],["Sanchez","R. Zanmar",""],["Tagliaferri","U.",""],["Di Sora","M.",""],["Isopi","G.",""],["Krugly","Y.",""],["Slyusarev","I.",""],["Chiorny","V.",""],["Miku\u017e","H.",""],["Bacci","P.",""],["Maestripieri","M.",""],["Grazia","M. D.",""],["de la Cueva","I.",""],["Yuste-Moreno","M.",""],["Ciabattari","F.",""],["Kozhukhov","O. M.",""],["Serra-Ricart","M.",""],["Alarcon","M. R.",""],["Licandro","J.",""],["Masi","G.",""],["Bacci","R.",""],["Bosch","J. M.",""],["Behem","R.",""],["Prost","J. -P.",""],["Renner","S.",""],["Conjat","M.",""],["Bachini","M.",""],["Succi","G.",""],["Stoian","L.",""],["Juravle","A.",""],["Carosati","D.",""],["Gowe","B.",""],["Carrillo","J.",""],["Zheleznyak","A. P.",""],["Montigiani","N.",""],["Foster","C. R.",""],["Mannucci","M.",""],["Ruocco","N.",""],["Cuevas","F.",""],["Di Marcantonio","P.",""],["Coretti","I.",""],["Iafrate","G.",""],["Baldini","V.",""],["Collins","M.",""],["P\u00e1l","A.",""],["Cs\u00e1k","B.",""],["Fern\u00e1ndez-Garcia","E.",""],["Castro-Tirado","A. J.",""],["Hudin","L.",""],["Madiedo","J. M.",""],["Anghel","R. M.",""],["Calvo-Fern\u00e1ndez","J. F.",""],["Valvasori","A.",""],["Guido","E.",""],["Gherase","R. M.",""],["Kamoun","S.",""],["Fafet","R.",""],["S\u00e1nchez-Gonz\u00e1lez","M.",""],["Curelaru","L.",""],["V\u00eentdevar\u0103","C. D.",""],["Danescu","C. A.",""],["Gout","J. -F.",""],["Schmitz","C. J.",""],["Sota","A.",""],["Belskaya","I.",""],["Rodr\u00edguez-Marco","M.",""],["Kilic","Y.",""],["Frappa","E.",""],["Klotz","A.",""],["Lavayssi\u00e8re","M.",""],["Oliveira","J. Marques",""],["Popescu","M.",""],["Mammana","L. A.",""],["Fern\u00e1ndez-Laj\u00fas","E.",""],["Schmidt","M.",""],["Hopp","U.",""],["Kom\u017e\u00edk","R.",""],["Pribulla","T.",""],["Tomko","D.",""],["Hus\u00e1rik","M.",""],["Erece","O.",""],["Eryilmaz","S.",""],["Buzzi","L.",""],["G\u00e4hrken","B.",""],["Nardiello","D.",""],["Hornoch","K.",""],["Sonbas","E.",""],["Er","H.",""],["Burwitz","V.",""],["Sybilski","P. Waldemar",""],["Bykowski","W.",""],["M\u00fcller","T. G.",""],["Ogloza","W.",""],["Gon\u00e7alves","R.",""],["Ferreira","J. F.",""],["Ferreira","M.",""],["Bento","M.",""],["Meister","S.",""],["Bagiran","M. N.",""],["Teke\u015f","M.",""],["Marciniak","A.",""],["Moravec","Z.",""],["Delin\u010d\u00e1k","P.",""],["Gianni","G.",""],["Casalnuovo","G. B.",""],["Boutet","M.",""],["Sanchez","J.",""],["Klemt","B.",""],["Wuensche","N.",""],["Burzynski","W.",""],["Borkowski","M.",""],["Serrau","M.",""],["Dangl","G.",""],["Kl\u00f6s","O.",""],["Weber","C.",""],["Urban\u00edk","M.",""],["Rousselot","L.",""],["Kub\u00e1nek","J.",""],["Andr\u00e9","P.",""],["Colazo","C.",""],["Spagnotto","J.",""],["Sickafoose","A. A.",""],["Hueso","R.",""],["S\u00e1nchez-Lavega","A.",""],["Fisher","R. S.",""],["Rengstorf","A. W.",""],["Perell\u00f3","C.",""],["Dascalu","M.",""],["Altan","M.",""],["Gazeas","K.",""],["de Santana","T.",""],["Sfair","R.",""],["Winter","O. C.",""],["Kalkan","S.",""],["Canales-Moreno","O.",""],["Trigo-Rodr\u00edguez","J. M.",""],["Tsamis","V.",""],["Tigani","K.",""],["Sioulas","N.",""],["Lekkas","G.",""],["Bertesteanu","D. N.",""],["Dumitrescu","V.",""],["Wilberger","A. J.",""],["Barnes","J. W.",""],["Fieber-Beyer","S. K.",""],["Swaney","R. L.",""],["Fuentes","C.",""],["Mendez","R. A.",""],["Dumitru","B. D.",""],["Flynn","R. L.",""],["Wake","D. A.",""]]}
{"id":"2308.08063","submitter":"H\\'el\\`ene Esnault","authors":"H\\'el\\`ene Esnault","title":"Rational points over C1 fields","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a small note on Manin's 1966 article on rational surfaces over\nperfect fields, the conjecture he formulates there, and later developments.\nThis text is by no means exhaustive and reflects the author's understanding and\ninterest. References for background and general studies are provided.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:36:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Esnault","H\u00e9l\u00e8ne",""]]}
{"id":"2308.08064","submitter":"Fedor Manin","authors":"Fedor Manin and Elia Portnoy","title":"On Freedman's link packings","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a\nmaximal number of links into a bounded region subject to geometric constraints,\nand produced upper bounds on the packing number in some cases, while commenting\nthat these bounds seemed far too large. We show that the smallest of these\n\"extravagantly large\" bounds is in fact sharp by constructing, for any link, a\npacking of exponentially many copies as a function of the available volume. We\nalso produce improved and generalized upper bounds.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:45:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Manin","Fedor",""],["Portnoy","Elia",""]]}
{"id":"2308.08065","submitter":"Morgan Weiler","authors":"Nicki Magill, Ana Rita Pires, Morgan Weiler","title":"A classification of infinite staircases for Hirzebruch surfaces","comments":"56 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ellipsoid embedding function of a symplectic manifold gives the smallest\namount by which the symplectic form must be scaled in order for a standard\nellipsoid of the given eccentricity to embed symplectically into the manifold.\nIt was first computed for the standard four-ball (or equivalently, the complex\nprojective plane) by McDuff and Schlenk, and found to contain the unexpected\nstructure of an \"infinite staircase,\" that is, an infinite sequence of\nnonsmooth points arranged in a piecewise linear stair-step pattern. Later work\nof Usher and Cristofaro-Gardiner--Holm--Mandini--Pires suggested that while\nfour-dimensional symplectic toric manifolds with infinite staircases are\nplentiful, they are highly non-generic. This paper concludes the systematic\nstudy of one-point blowups of the complex projective plane, building on\nprevious work of Bertozzi-Holm-Maw-McDuff-Mwakyoma-Pires-Weiler, Magill-McDuff,\nMagill-McDuff-Weiler, and Magill on these Hirzebruch surfaces.\n  We prove a conjecture of Cristofaro-Gardiner--Holm--Mandini--Pires for this\nfamily: that if the blowup is of rational weight and the embedding function has\nan infinite staircase then that weight must be $1/3$. We show also that the\nfunction for this manifold does not have a descending staircase. Furthermore,\nwe give a sufficient and necessary condition for the existence of an infinite\nstaircase in this family which boils down to solving a quadratic equation and\ncomputing the function at one specific value. Many of our intermediate results\nalso apply to the case of the polydisk (or equivalently, the symplectic product\nof two spheres).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:46:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Magill","Nicki",""],["Pires","Ana Rita",""],["Weiler","Morgan",""]]}
{"id":"2308.08066","submitter":"Guillermo Angeris","authors":"Guillermo Angeris, Tarun Chitra, Theo Diamandis, Alex Evans, Kshitij\n  Kulkarni","title":"The Geometry of Constant Function Market Makers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC q-fin.MF q-fin.TR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Constant function market makers (CFMMs) are the most popular type of\ndecentralized trading venue for cryptocurrency tokens. In this paper, we give a\nvery general geometric framework (or 'axioms') which encompass and generalize\nmany of the known results for CFMMs in the literature, without requiring strong\nconditions such as differentiability or homogeneity. One particular consequence\nof this framework is that every CFMM has a (unique) canonical trading function\nthat is nondecreasing, concave, and homogeneous, showing that many results\nknown only for homogeneous trading functions are actually fully general. We\nalso show that CFMMs satisfy a number of intuitive and geometric composition\nrules, and give a new proof, via conic duality, of the equivalence of the\nportfolio value function and the trading function. Many results are extended to\nthe general setting where the CFMM is not assumed to be path-independent, but\nonly one trade is allowed. Finally, we show that all 'path-independent' CFMMs\nhave a simple geometric description that does not depend on any notion of a\n'trading history'.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:49:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Angeris","Guillermo",""],["Chitra","Tarun",""],["Diamandis","Theo",""],["Evans","Alex",""],["Kulkarni","Kshitij",""]]}
{"id":"2308.08067","submitter":"Diego Portillo-S\\'anchez","authors":"Gerardo Hern\\'andez-Tom\\'e, Gabriel L\\'opez Castro and Diego\n  Portillo-S\\'anchez","title":"$\\tau^- \\to \\pi^- \\eta \\nu_\\tau$ decay induced by QED one-loop effects","comments":"22 pages, 1 figure, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $\\tau^- \\to \\pi^-\\eta\\nu_{\\tau}$ decay is forbidden in the Standard Model\nin the limit of exact $G$-parity, it becomes a rare decay due to isospin\nsymmetry breaking and it is very sensitive to the effects of effective scalar\ninteractions. Since the parameters driving isospin breaking,\n$(m_d-m_u)/(m_s-\\bar{m})$ and $\\alpha$, are of the same order, one may expect\ntheir $G$-parity breaking effects in this decay can be of similar magnitudes.\nIn this work, we evaluate the effects of isospin-breaking amplitudes originated\nfrom a virtual photon at one-loop in a resonance dominance model to describe\nphoton-hadron interactions. We find that these effects can shift the leading SM\npredictions based on the $u-d$ quark mass difference by roughly $12\\%$, and\nshould be taken into consideration in a precision comparison of theory and\nexperiment in order to draw meaningful conclusions on New Physics. The effects\nin the rate of the analogous $\\tau^- \\to \\pi^-\\eta'\\nu_{\\tau}$ decay can be\nlarger ($\\sim$ $78\\%$), under the approximations assumed in this model.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:56:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hern\u00e1ndez-Tom\u00e9","Gerardo",""],["Castro","Gabriel L\u00f3pez",""],["Portillo-S\u00e1nchez","Diego",""]]}
{"id":"2308.08068","submitter":"Maria Rosaria Formica","authors":"Maria Rosaria Formica, Eugeny Ostrovsky, Leonid Sirota","title":"Norm estimates in Grand Lebesgue Spaces for some operators, including\n  magic square matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the classical Lebesgue-Riesz norm estimations for integral\noperators acting between different classical Lebesgue-Riesz spaces into the\nGrand Lebesgue Spaces, in the general case. As an example we consider matrix\noperators acting between finite dimensional Lebesgue-Riesz spaces, especially\ngenerated by means of positive magic squares.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:19:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Formica","Maria Rosaria",""],["Ostrovsky","Eugeny",""],["Sirota","Leonid",""]]}
{"id":"2308.08069","submitter":"Akhilesh Raj","authors":"Akhilesh Raj, Swann Perarnau, Aniruddha Gokhale","title":"A Reinforcement Learning Approach for Performance-aware Reduction in\n  Power Consumption of Data Center Compute Nodes","comments":"This manuscript consists of a total of 10 pages with 8 figures and 3\n  tables and is awaiting its publication at IC2E-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AR cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As Exascale computing becomes a reality, the energy needs of compute nodes in\ncloud data centers will continue to grow. A common approach to reducing this\nenergy demand is to limit the power consumption of hardware components when\nworkloads are experiencing bottlenecks elsewhere in the system. However,\ndesigning a resource controller capable of detecting and limiting power\nconsumption on-the-fly is a complex issue and can also adversely impact\napplication performance. In this paper, we explore the use of Reinforcement\nLearning (RL) to design a power capping policy on cloud compute nodes using\nobservations on current power consumption and instantaneous application\nperformance (heartbeats). By leveraging the Argo Node Resource Management (NRM)\nsoftware stack in conjunction with the Intel Running Average Power Limit (RAPL)\nhardware control mechanism, we design an agent to control the maximum supplied\npower to processors without compromising on application performance. Employing\na Proximal Policy Optimization (PPO) agent to learn an optimal policy on a\nmathematical model of the compute nodes, we demonstrate and evaluate using the\nSTREAM benchmark how a trained agent running on actual hardware can take\nactions by balancing power consumption and application performance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:25:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Raj","Akhilesh",""],["Perarnau","Swann",""],["Gokhale","Aniruddha",""]]}
{"id":"2308.08070","submitter":"Seonho Kim","authors":"Seonho Kim and Kiryung Lee","title":"Max-affine regression via first-order methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.IT cs.LG math.IT math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider regression of a max-affine model that produces a piecewise linear\nmodel by combining affine models via the max function. The max-affine model\nubiquitously arises in applications in signal processing and statistics\nincluding multiclass classification, auction problems, and convex regression.\nIt also generalizes phase retrieval and learning rectifier linear unit\nactivation functions. We present a non-asymptotic convergence analysis of\ngradient descent (GD) and mini-batch stochastic gradient descent (SGD) for\nmax-affine regression when the model is observed at random locations following\nthe sub-Gaussianity and an anti-concentration with additive sub-Gaussian noise.\nUnder these assumptions, a suitably initialized GD and SGD converge linearly to\na neighborhood of the ground truth specified by the corresponding error bound.\nWe provide numerical results that corroborate the theoretical finding.\nImportantly, SGD not only converges faster in run time with fewer observations\nthan alternating minimization and GD in the noiseless scenario but also\noutperforms them in low-sample scenarios with noise.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:46:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kim","Seonho",""],["Lee","Kiryung",""]]}
{"id":"2308.08071","submitter":"Zhongyu Wang","authors":"Xiaolin Zheng, Zhongyu Wang, Chaochao Chen, Feng Zhu and Jiashu Qian","title":"Freshness or Accuracy, Why Not Both? Addressing Delayed Feedback via\n  Dynamic Graph Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The delayed feedback problem is one of the most pressing challenges in\npredicting the conversion rate since users' conversions are always delayed in\nonline commercial systems. Although new data are beneficial for continuous\ntraining, without complete feedback information, i.e., conversion labels,\ntraining algorithms may suffer from overwhelming fake negatives. Existing\nmethods tend to use multitask learning or design data pipelines to solve the\ndelayed feedback problem. However, these methods have a trade-off between data\nfreshness and label accuracy. In this paper, we propose Delayed Feedback\nModeling by Dynamic Graph Neural Network (DGDFEM). It includes three stages,\ni.e., preparing a data pipeline, building a dynamic graph, and training a CVR\nprediction model. In the model training, we propose a novel graph convolutional\nmethod named HLGCN, which leverages both high-pass and low-pass filters to deal\nwith conversion and non-conversion relationships. The proposed method achieves\nboth data freshness and label accuracy. We conduct extensive experiments on\nthree industry datasets, which validate the consistent superiority of our\nmethod.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:49:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zheng","Xiaolin",""],["Wang","Zhongyu",""],["Chen","Chaochao",""],["Zhu","Feng",""],["Qian","Jiashu",""]]}
{"id":"2308.08072","submitter":"Zhongyu Wang","authors":"Xiaolin Zheng, Zhongyu Wang, Chaochao Chen, Jiashu Qian and Yao Yang","title":"Decentralized Graph Neural Network for Privacy-Preserving Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building a graph neural network (GNN)-based recommender system without\nviolating user privacy proves challenging. Existing methods can be divided into\nfederated GNNs and decentralized GNNs. But both methods have undesirable\neffects, i.e., low communication efficiency and privacy leakage. This paper\nproposes DGREC, a novel decentralized GNN for privacy-preserving\nrecommendations, where users can choose to publicize their interactions. It\nincludes three stages, i.e., graph construction, local gradient calculation,\nand global gradient passing. The first stage builds a local inner-item\nhypergraph for each user and a global inter-user graph. The second stage models\nuser preference and calculates gradients on each local device. The third stage\ndesigns a local differential privacy mechanism named secure gradient-sharing,\nwhich proves strong privacy-preserving of users' private data. We conduct\nextensive experiments on three public datasets to validate the consistent\nsuperiority of our framework.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:56:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zheng","Xiaolin",""],["Wang","Zhongyu",""],["Chen","Chaochao",""],["Qian","Jiashu",""],["Yang","Yao",""]]}
{"id":"2308.08073","submitter":"Xiaodan Zhou","authors":"Qing Liu, Xiaodan Zhou","title":"Hamilton-Jacobi equations in metric spaces","comments":"arXiv admin note: text overlap with arXiv:2005.13405","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  These are lecture notes for our minicourse at OIST Summer Graduate School\n\"Analysis and Partial Differential Equations\" on June 12-17, 2023. We give an\noverview and collect a few important results concerning the well-posedness of\nHamilton-Jacobi equations in metric spaces, especially several recently\nproposed notions of metric viscosity solutions to the eikonal equation. Basic\nknowledge about metric spaces and a review of viscosity solution theory in the\nEuclidean spaces are also presented.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:58:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Qing",""],["Zhou","Xiaodan",""]]}
{"id":"2308.08074","submitter":"Shashank Verma","authors":"Shashank Verma, Sneha Sanjeevini, E. Dogan Sumer, and Dennis S.\n  Bernstein","title":"Real-Time Numerical Differentiation of Sampled Data Using Adaptive Input\n  and State Estimation","comments":"This paper is under review at the International Journal of Control","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time numerical differentiation plays a crucial role in many digital\ncontrol algorithms, such as PID control, which requires numerical\ndifferentiation to implement derivative action. This paper addresses the\nproblem of numerical differentiation for real-time implementation with minimal\nprior information about the signal and noise using adaptive input and state\nestimation. Adaptive input estimation with adaptive state estimation (AIE/ASE)\nis based on retrospective cost input estimation, while adaptive state\nestimation is based on an adaptive Kalman filter in which the input-estimation\nerror covariance and the measurement-noise covariance are updated online. The\naccuracy of AIE/ASE is compared numerically to several conventional numerical\ndifferentiation methods. Finally, AIE/ASE is applied to simulated vehicle\nposition data generated from CarSim.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:01:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Verma","Shashank",""],["Sanjeevini","Sneha",""],["Sumer","E. Dogan",""],["Bernstein","Dennis S.",""]]}
{"id":"2308.08075","submitter":"Ivan Christov","authors":"Pranay P. Nagrani, Amy M. Marconnet, Ivan C. Christov","title":"Hydrodynamics of bubble flow through a porous medium with applications\n  to packed bed reactors","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gas-liquid flows through packed bed reactors (PBRs) are challenging to\npredict due to the tortuous flow paths that fluid interfaces must traverse.\nExperiments at the International Space Station showed that bubble and pulse\nflows are predominately observed under microgravity conditions, while trickle\nand spray flows observed under terrestrial conditions, are not present in\nmicrogravity. Toward understanding the physics behind the latter experiments,\nwe simulate bubble flow through a PBR for different\npacking-particle-diameter-based Weber numbers and under different gravity\nconditions. We demonstrate different pore-scale mechanisms such as capillary\nentrapment, buoyancy entrapment, and inertia-induced bubble displacement. Then,\nwe perform a quantitative analysis by introducing a new dynamic length scale,\ndependent upon the evolving gas-liquid interfacial area, to understand the\ndynamic trade-offs between the inertia, capillary, and buoyancy forces on a\nbubble passing through a PBR. This analysis leads us to define new\ndimensionless Weber-like numbers that delineate bubble entrapment from bubble\ndisplacement.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:04:14 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nagrani","Pranay P.",""],["Marconnet","Amy M.",""],["Christov","Ivan C.",""]]}
{"id":"2308.08076","submitter":"Albert Artiles Calix","authors":"Albert Artiles","title":"The Minimal Denominator Function and Geometric Generalizations","comments":"16 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a geometric interpretation for a normalized version of the minimal\ndenominator function, $$q_{\\min}(x,\\delta)=\\min\\left\\{q\\in \\mathbb{N}: \\text{\nthere exists } p\\in\\mathbb{Z} \\text{ such that } \\frac{p}{q}\\in\n(x-\\delta,x+\\delta)\\right\\},$$ introduced by Chen and Haynes. We use this\ninterpretation to compute the limiting distribution of a suitably normalized\nversion of $q_{\\min}(x,\\delta)$ as a function of $x$, and give generalizations\nof the idea of minimal denominators to higher-dimensional unimodular lattices,\nlinear forms, and translation surfaces. The key idea is to turn this circle of\nproblems into equidistribution problems for translates of unipotent orbits of a\nLie group action on an appropriate moduli space.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:05:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Artiles","Albert",""]]}
{"id":"2308.08077","submitter":"M'hammed Oudrane","authors":"M'hammed Oudrane","title":"Sobolev sheaves on the plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we show that for any integer $k \\in \\mathbb{N}$ there exists a\nSobolev sheaf (in the sense of Lebeau) on any definable site of $\\mathbb{R}^2$\nthat agrees with Sobolev spaces on cuspidal domains. We also provide a complete\ncomputation of the cohomology of these sheaves using the notion of 'Good\ndirection' introduced by Valette. This paper serves as an introduction to a\nmore general work on the sheafification of Sobolev spaces in higher dimensions\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:09:05 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 22:54:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Oudrane","M'hammed",""]]}
{"id":"2308.08078","submitter":"David Ambrose","authors":"David M. Ambrose and Milton C. Lopes Filho and Helena J. Nussenzveig\n  Lopes","title":"Existence and analyticity of solutions of the Kuramoto-Sivashinsky\n  equation with singular data","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove existence of solutions to the Kuramoto-Sivashinsky equation with\nlow-regularity data, in function spaces based on the Wiener algebra and in\npseudomeasure spaces. In any spatial dimension, we allow the data to have its\nantiderivative in the Wiener algebra. In one spatial dimension, we also allow\ndata which is in a pseudomeasure space of negative order. In two spatial\ndimensions, we also allow data which is in a pseudomeasure space one derivative\nmore regular than in the one-dimensional case. In the course of carrying out\nthe existence arguments, we show a parabolic gain of regularity of the\nsolutions as compared to the data. Subsequently, we show that the solutions are\nin fact analytic at any positive time in the interval of existence.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:12:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ambrose","David M.",""],["Filho","Milton C. Lopes",""],["Lopes","Helena J. Nussenzveig",""]]}
{"id":"2308.08079","submitter":"Ademide O. Mabadeje","authors":"Ademide O. Mabadeje and Michael J. Pyrcz","title":"Rigid Transformations for Stabilized Lower Dimensional Space to Support\n  Subsurface Uncertainty Quantification and Interpretation","comments":"30 pages, 17 figures, Submitted to Computational Geosciences Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Subsurface datasets inherently possess big data characteristics such as vast\nvolume, diverse features, and high sampling speeds, further compounded by the\ncurse of dimensionality from various physical, engineering, and geological\ninputs. Among the existing dimensionality reduction (DR) methods, nonlinear\ndimensionality reduction (NDR) methods, especially Metric-multidimensional\nscaling (MDS), are preferred for subsurface datasets due to their inherent\ncomplexity. While MDS retains intrinsic data structure and quantifies\nuncertainty, its limitations include unstabilized unique solutions invariant to\nEuclidean transformations and an absence of out-of-sample points (OOSP)\nextension. To enhance subsurface inferential and machine learning workflows,\ndatasets must be transformed into stable, reduced-dimension representations\nthat accommodate OOSP.\n  Our solution employs rigid transformations for a stabilized Euclidean\ninvariant representation for LDS. By computing an MDS input dissimilarity\nmatrix, and applying rigid transformations on multiple realizations, we ensure\ntransformation invariance and integrate OOSP. This process leverages a convex\nhull algorithm and incorporates loss function and normalized stress for\ndistortion quantification. We validate our approach with synthetic data,\nvarying distance metrics, and real-world wells from the Duvernay Formation.\nResults confirm our method's efficacy in achieving consistent LDS\nrepresentations. Furthermore, our proposed \"stress ratio\" (SR) metric provides\ninsight into uncertainty, beneficial for model adjustments and inferential\nanalysis. Consequently, our workflow promises enhanced repeatability and\ncomparability in NDR for subsurface energy resource engineering and associated\nbig data workflows.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:19:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mabadeje","Ademide O.",""],["Pyrcz","Michael J.",""]]}
{"id":"2308.08080","submitter":"Pat Lank","authors":"Pat Lank","title":"Descent conditions for generation in derived categories","comments":"Comments welcome; v1","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work establishes a criterion that determines when strong generation\nwithin the bounded derived category of a Noetherian scheme is preserved under\nthe derived pushforward of a proper morphism. Consequently, this criterion\nproduces upper bounds on Rouquier dimension of the bounded derived category,\nand applications concerning affine varieties are studied. Finally, it is\ndemonstrated that the bounded derived category of a Noetherian scheme of finite\ntype over a perfect field admits a strong generator, yielding new examples that\nmay not necessarily be separated.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:21:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lank","Pat",""]]}
{"id":"2308.08081","submitter":"Jianjun Jin","authors":"Jianjun Jin","title":"Area theorem and univalence criterion","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note we investigate the Prawitz's area theorem and establish a new\nunivalence criterion for the locally univalent analytic functions in the unit\ndisk, which generalizes some related results of Aharonov [Duke Math. J.,\n36(1969), 599-604].\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:37:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jin","Jianjun",""]]}
{"id":"2308.08082","submitter":"Tian-Yu Ye","authors":"Tian-Yu Ye, Xiao Tan","title":"A novel hybrid protocol for semiquantum key distribution and semiquantum\n  secret sharing","comments":"16 pages,1 figure, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, a novel hybrid protocol for semiquantum key distribution\n(SQKD) and semiquantum secret sharing (SQSS) was constructed by using GHZ-like\nstates. This protocol is capable of establishing two different private keys\nbetween one quantum party and two semiquantum parties respectively, and making\ntwo semiquantum parties share another private key of the quantum party in the\nmeanwhile. The usages of delay lines, Pauli operations, Hadamard gates and\nquantum entanglement swapping are not required. Moreover, the semiquantum\nparties are not necessary to be equipped with any quantum memory. We validate\nin detail that this protocol resists various attacks from Eve, including the\nTrojan horse attacks, the entangle-measure attack, the double controlled-not\n(CNOT) attacks, the measure-resend attack and the intercept-resend attack. To\nour best knowledge, this protocol is the only protocol which possesses the\nfunctions of both SQKD and SQSS simultaneously until now.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:37:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ye","Tian-Yu",""],["Tan","Xiao",""]]}
{"id":"2308.08083","submitter":"Alexander Polishchuk","authors":"Alexander Polishchuk, Dmitry Vaintrob","title":"A bound on the Hodge filtration of the de Rham cohomology of\n  supervarieties","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the relation between the Hodge filtration of the de Rham cohomology\nof a proper smooth supervariety $X$ and the usual Hodge filtration of the\ncorresponding reduced variety $X_0$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 00:45:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Polishchuk","Alexander",""],["Vaintrob","Dmitry",""]]}
{"id":"2308.08084","submitter":"Yangwei Shi","authors":"Fangyuan Jiang, Yangwei Shi, Tanka R. Rana, Daniel Morales, Isaac\n  Gould, Declan P. McCarthy, Joel Smith, Grey Christoforo, Hannah Contreras,\n  Stephen Barlow, Aditya D. Mohite, Henry Snaith, Seth R. Marder, J. Devin\n  MacKenzie, Michael D. McGehee, David S. Ginger","title":"Architecture Optimization Dramatically Improves Reverse Bias Stability\n  in Perovskite Solar Cells: A Role of Polymer Hole Transport Layers","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 report that device architecture engineering has a substantial impact on\nthe reverse bias instability that has been reported as a critical issue in\ncommercializing perovskite solar cells. We demonstrate breakdown voltages\nexceeding -15 V in typical pin structured perovskite solar cells via two steps:\ni) using polymer hole transporting materials; ii) using a more\nelectrochemically stable gold electrode. While device degradation can be\nexacerbated by higher reverse bias and prolonged exposure, our as-fabricated\nperovskite solar cells completely recover their performance even after\nstressing at -7 V for 9 hours both in the dark and under partial illumination.\nFollowing these observations, we systematically discuss and compare the reverse\nbias driven degradation pathways in perovskite solar cells with different\ndevice architectures. Our model highlights the role of electrochemical reaction\nrates and species in dictating the reverse bias stability of perovskite solar\ncells.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:17:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiang","Fangyuan",""],["Shi","Yangwei",""],["Rana","Tanka R.",""],["Morales","Daniel",""],["Gould","Isaac",""],["McCarthy","Declan P.",""],["Smith","Joel",""],["Christoforo","Grey",""],["Contreras","Hannah",""],["Barlow","Stephen",""],["Mohite","Aditya D.",""],["Snaith","Henry",""],["Marder","Seth R.",""],["MacKenzie","J. Devin",""],["McGehee","Michael D.",""],["Ginger","David S.",""]]}
{"id":"2308.08085","submitter":"Khodr Jaber","authors":"Khodr Jaber, Ebenezer Essel, Pierre Sullivan","title":"GPU-Native Adaptive Mesh Refinement with Application to Lattice\n  Boltzmann Simulations","comments":"30 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Lattice Boltzmann Method (LBM) has garnered significant interest in\nGeneral-Purpose Graphics Processing Unit (GPGPU) programming for computational\nfluid dynamics due to its straightforward GPU parallelization and could benefit\ngreatly from Adaptive Mesh Refinement (AMR). AMR can assist in efficiently\nresolving flows with regions of interest requiring a high degree of resolution.\nAn AMR scheme that could manage a computational mesh entirely on the GPU\nwithout intermediate data transfers to/from the host device would provide a\nsubstantial speedup to GPU-accelerated solvers, however, implementations\ncommonly employ CPU/hybrid frameworks instead, due to lack of a recursive data\nstructure. A block-based GPU-native algorithm will be presented for AMR in the\ncontext of GPGPU programming and implemented in an open-source C++ code. The\nmeshing code is equipped with a Lattice Boltzmann solver for assessing\nperformance. Different AMR approaches and consequences in implementation are\nconsidered before careful selection of data structures enabling efficient\nrefinement and coarsening compatible with single instruction multiple data\narchitecture is detailed. Inter-level communication is achieved by tricubic\ninterpolation and standard spatial averaging. Although the present open-source\nimplementation is tailored for LBM simulations, the outlined grid refinement\nprocedure is compatible with solvers for cell-centered block-structured grids.\n  Link to repository: https://github.com/KhodrJ/AGAL\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:22:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jaber","Khodr",""],["Essel","Ebenezer",""],["Sullivan","Pierre",""]]}
{"id":"2308.08086","submitter":"Shaoru Chen","authors":"Shaoru Chen, Kong Yao Chee, Nikolai Matni, M. Ani Hsieh, George J.\n  Pappas","title":"Safety Filter Design for Neural Network Systems via Convex Optimization","comments":"This paper has been accepted to the 2023 62nd IEEE Conference on\n  Decision and Control (CDC)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the increase in data availability, it has been widely demonstrated that\nneural networks (NN) can capture complex system dynamics precisely in a\ndata-driven manner. However, the architectural complexity and nonlinearity of\nthe NNs make it challenging to synthesize a provably safe controller. In this\nwork, we propose a novel safety filter that relies on convex optimization to\nensure safety for a NN system, subject to additive disturbances that are\ncapable of capturing modeling errors. Our approach leverages tools from NN\nverification to over-approximate NN dynamics with a set of linear bounds,\nfollowed by an application of robust linear MPC to search for controllers that\ncan guarantee robust constraint satisfaction. We demonstrate the efficacy of\nthe proposed framework numerically on a nonlinear pendulum system.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:30:13 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 15:40:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Shaoru",""],["Chee","Kong Yao",""],["Matni","Nikolai",""],["Hsieh","M. Ani",""],["Pappas","George J.",""]]}
{"id":"2308.08087","submitter":"Yoshiko Ogata","authors":"Yoshiko Ogata","title":"Boundary states of a bulk gapped ground state in $2$-d quantum spin\n  systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.stat-mech math.MP math.OA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a natural mathematical definition of boundary states of a bulk\ngapped ground state, in the operator algebraic framework of $2$-d quantum spin\nsystems. With approximate Haag duality at the boundary, we derive a\n$C^*$-tensor category $\\tilde{\\mathcal{M}}$ out of such boundary state. Under a\nnon-triviality condition of the braiding in the bulk, we show that the Drinfeld\ncenter (with an asymptotic constraint) of $\\tilde{\\mathcal{M}}$ is equivalent\nto the bulk braided $C^*$-tensor category derived in [14].\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:30:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ogata","Yoshiko",""]]}
{"id":"2308.08088","submitter":"Rui Cao","authors":"Rui Cao, Ming Shan Hee, Adriel Kuek, Wen-Haw Chong, Roy Ka-Wei Lee,\n  Jing Jiang","title":"Pro-Cap: Leveraging a Frozen Vision-Language Model for Hateful Meme\n  Detection","comments":"Camera-ready for 23, ACM MM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hateful meme detection is a challenging multimodal task that requires\ncomprehension of both vision and language, as well as cross-modal interactions.\nRecent studies have tried to fine-tune pre-trained vision-language models\n(PVLMs) for this task. However, with increasing model sizes, it becomes\nimportant to leverage powerful PVLMs more efficiently, rather than simply\nfine-tuning them. Recently, researchers have attempted to convert meme images\ninto textual captions and prompt language models for predictions. This approach\nhas shown good performance but suffers from non-informative image captions.\nConsidering the two factors mentioned above, we propose a probing-based\ncaptioning approach to leverage PVLMs in a zero-shot visual question answering\n(VQA) manner. Specifically, we prompt a frozen PVLM by asking hateful\ncontent-related questions and use the answers as image captions (which we call\nPro-Cap), so that the captions contain information critical for hateful content\ndetection. The good performance of models with Pro-Cap on three benchmarks\nvalidates the effectiveness and generalization of the proposed method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:38:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cao","Rui",""],["Hee","Ming Shan",""],["Kuek","Adriel",""],["Chong","Wen-Haw",""],["Lee","Roy Ka-Wei",""],["Jiang","Jing",""]]}
{"id":"2308.08089","submitter":"Shengming Yin","authors":"Shengming Yin, Chenfei Wu, Jian Liang, Jie Shi, Houqiang Li, Gong\n  Ming, Nan Duan","title":"DragNUWA: Fine-grained Control in Video Generation by Integrating Text,\n  Image, and Trajectory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Controllable video generation has gained significant attention in recent\nyears. However, two main limitations persist: Firstly, most existing works\nfocus on either text, image, or trajectory-based control, leading to an\ninability to achieve fine-grained control in videos. Secondly, trajectory\ncontrol research is still in its early stages, with most experiments being\nconducted on simple datasets like Human3.6M. This constraint limits the models'\ncapability to process open-domain images and effectively handle complex curved\ntrajectories. In this paper, we propose DragNUWA, an open-domain\ndiffusion-based video generation model. To tackle the issue of insufficient\ncontrol granularity in existing works, we simultaneously introduce text, image,\nand trajectory information to provide fine-grained control over video content\nfrom semantic, spatial, and temporal perspectives. To resolve the problem of\nlimited open-domain trajectory control in current research, We propose\ntrajectory modeling with three aspects: a Trajectory Sampler (TS) to enable\nopen-domain control of arbitrary trajectories, a Multiscale Fusion (MF) to\ncontrol trajectories in different granularities, and an Adaptive Training (AT)\nstrategy to generate consistent videos following trajectories. Our experiments\nvalidate the effectiveness of DragNUWA, demonstrating its superior performance\nin fine-grained control in video generation. The homepage link is\n\\url{https://www.microsoft.com/en-us/research/project/dragnuwa/}\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:43:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yin","Shengming",""],["Wu","Chenfei",""],["Liang","Jian",""],["Shi","Jie",""],["Li","Houqiang",""],["Ming","Gong",""],["Duan","Nan",""]]}
{"id":"2308.08090","submitter":"Dongfang Li","authors":"Xinshuo Hu, Dongfang Li, Zihao Zheng, Zhenyu Liu, Baotian Hu, Min\n  Zhang","title":"Separate the Wheat from the Chaff: Model Deficiency Unlearning via\n  Parameter-Efficient Module Operation","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 been widely used in various applications\nbut are known to suffer from issues related to untruthfulness and toxicity.\nWhile parameter-efficient modules (PEMs) have demonstrated their effectiveness\nin equipping models with new skills, leveraging PEMs for deficiency unlearning\nremains underexplored. In this work, we propose a PEMs operation approach,\nnamely Extraction-before-Subtraction (Ext-Sub), to enhance the truthfulness and\ndetoxification of LLMs through the integration of ``expert'' PEM and\n``anti-expert'' PEM. Remarkably, even anti-expert PEM possess valuable\ncapabilities due to their proficiency in generating fabricated content, which\nnecessitates language modeling and logical narrative competence. Rather than\nmerely negating the parameters, our approach involves extracting and\neliminating solely the deficiency capability within anti-expert PEM while\npreserving the general capabilities. To evaluate the effectiveness of our\napproach in terms of truthfulness and detoxification, we conduct extensive\nexperiments on LLMs, encompassing additional abilities such as language\nmodeling and mathematical reasoning. Our empirical results demonstrate that our\napproach effectively improves truthfulness and detoxification, while largely\npreserving the fundamental abilities of LLMs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:46:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Xinshuo",""],["Li","Dongfang",""],["Zheng","Zihao",""],["Liu","Zhenyu",""],["Hu","Baotian",""],["Zhang","Min",""]]}
{"id":"2308.08091","submitter":"Zhifeng Zhu","authors":"Zhengde Xu, Xue Zhang, Yixiao Qiao, Gengchiau Liang, Shuyuan Shi and\n  Zhifeng Zhu","title":"Deterministic Spin-Orbit Torque Switching of Mn3Sn with the Interplay\n  between Spin Polarization and Kagome Plane","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":"  Previous studies have demonstrated spin-orbit torque (SOT) switching of Mn3Sn\nwhere the spin polarization lies in the kagome plane (configuration I).\nHowever, the critical current density ($ J_{crit}$) is unrealistically large ($\nJ_{crit}$=$ 10^{14}$ A/$ m^2$) and independent on the external field ($\nH_{ext}$). The stabilized magnetic state also depends on the initial state.\nThese features conflict with the ferromagnet (FM) switching scheme as claimed\nin those studies, and thus call for other explanations. Alternatively, the\nsystem with the spin polarization perpendicular to the kagome plane\n(configuration II) is more like the FM based system since the spin polarization\nis orthogonal to all magnetic moments. In this work, we show SOT switching of\nMn3Sn in configuration II. Similar to the FM, Jcrit and Hext are in the order\nof $ 10^{10}$ A/$ m^2$ and hundreds of Oersted, respectively. The switching\nresult is also independent of the initial state. Interestingly, the unique spin\nstructure of Mn3Sn also leads to distinct features from FM systems. We\ndemonstrate that Jcrit increases linearly with Hext, and extrapolation gives\nultralow $ J_{crit}$ for the field-free switching system. In addition, the\nswitching polarity is opposite to the FM. We also provide the switching phase\ndiagram as a guideline for experimental demonstration. Our work provides\ncomprehensive understanding for the switching mechanism in both configurations.\nThe switching protocol proposed in this work is more advantageous in realistic\nspintronic applications. We also clearly reveal the fundamental difference\nbetween FM and noncollinear antiferromagnetic switching.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:51:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Zhengde",""],["Zhang","Xue",""],["Qiao","Yixiao",""],["Liang","Gengchiau",""],["Shi","Shuyuan",""],["Zhu","Zhifeng",""]]}
{"id":"2308.08092","submitter":"Yan Xu","authors":"Y. Xu, C. Liu, Z. Li, H. Tian, Sarah A. Bird, H. J. Newberg, S. Shao,\n  and L. C. Deng","title":"Exploring asymmetric substructures of the outer disk based on the\n  conjugate angle of the radial action","comments":"53pages, 35 figures, 4 Tables, ApJ accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the conjugate angle of radial action ($\\theta_R$), the best\nrepresentation of the orbital phase, to explore the \"mid-plane, north branch,\nsouth branch\" and \"Monoceros area\" disk structures that were previously\nrevealed in the LAMOST K giants (Xu et al. 2020). The former three\nsubstructures, identified by their 3D kinematical distributions, have been\nshown to be projections of the phase space spiral (resulting from\nnonequilibrium phase mixing). In this work, we find that all of these\nsubstructures associated with the phase spiral show high aggregation in\nconjugate angle phase space, indicating that the clumping in conjugate angle\nspace is a feature of ongoing, incomplete phase mixing. We do not find the\n$Z-V_Z$ phase spiral located in the \"Monoceros area\", but we do find a very\nhighly concentrated substructure in the quadrant of conjugate angle space with\nthe orbital phase from the apocenter to the guiding radius. The existence of\nthe clump in conjugate angle space provides a complementary way to connect the\n\"Monoceros area\" with the direct response to a perturbation from a significant\ngravitationally interactive event. Using test particle simulations, we show\nthat these features are analogous to disturbances caused by the impact of the\nlast passage of the Sagittarius dwarf spheroidal galaxy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:00:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Y.",""],["Liu","C.",""],["Li","Z.",""],["Tian","H.",""],["Bird","Sarah A.",""],["Newberg","H. J.",""],["Shao","S.",""],["Deng","L. C.",""]]}
{"id":"2308.08093","submitter":"Juan Guillermo Garrido","authors":"Juan Guillermo Garrido and Emilio Vilches","title":"Catching-up Algorithm with Approximate Projections for Moreau's Sweeping\n  Processes","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we develop an enhanced version of the catching-up algorithm\nfor sweeping processes through an appropriate concept of approximate\nprojections. We establish some properties of this notion of approximate\nprojection. Then, under suitable assumptions, we show the convergence of the\nenhanced catching-up algorithm for prox-regular, subsmooth, and merely closed\nsets. Finally, we discuss efficient numerical methods for obtaining approximate\nprojections. Our results recover classical existence results in the literature\nand provide new insight into the numerical simulation of sweeping processes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:01:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Garrido","Juan Guillermo",""],["Vilches","Emilio",""]]}
{"id":"2308.08094","submitter":"Matthew Chan","authors":"Mingyang Xie, Matthew Chan, Christopher Metzler","title":"Snapshot High Dynamic Range Imaging with a Polarization Camera","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High dynamic range (HDR) images are important for a range of tasks, from\nnavigation to consumer photography. Accordingly, a host of specialized HDR\nsensors have been developed, the most successful of which are based on\ncapturing variable per-pixel exposures. In essence, these methods capture an\nentire exposure bracket sequence at once in a single shot. This paper presents\na straightforward but highly effective approach for turning an off-the-shelf\npolarization camera into a high-performance HDR camera. By placing a linear\npolarizer in front of the polarization camera, we are able to simultaneously\ncapture four images with varied exposures, which are determined by the\norientation of the polarizer. We develop an outlier-robust and self-calibrating\nalgorithm to reconstruct an HDR image (at a single polarity) from these\nmeasurements. Finally, we demonstrate the efficacy of our approach with\nextensive real-world experiments.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:04:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xie","Mingyang",""],["Chan","Matthew",""],["Metzler","Christopher",""]]}
{"id":"2308.08095","submitter":"Peng Cheng","authors":"Peng Cheng","title":"Circumventing the black hole hair-loss problem","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide a possible way of avoiding the hair-loss problem by studying gauge\nfluctuations on classical Schwarzschild black hole background. The hair-loss\nproblem arises due to the small fidelity of reconstructing the interior\noperator at the end stage of the evaporation, which is general in most schemes\ntrying to decouple the early and late radiation to avoid firewall. To\ncircumvent the problem, we put the black hole in a cavity as a toy model, and\nstudy the entropy behavior of the system with different temperatures. By\nanalyzing gauge fluctuations with nontrivial boundary conditions, we find that\nthe entropy of the black hole system increases at the end stage, rather than\ndirectly dropping to zero. Besides the end stage, the entropy is the same as\nPage's original argument. The hair-loss problem can be avoided by the proposed\nmodel and we can gain important insights into the end stage of the evaporation\nand quantum effects of gravity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:05:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cheng","Peng",""]]}
{"id":"2308.08096","submitter":"Michal Kepkowski","authors":"Michal Kepkowski, Maciej Machulak, Ian Wood, Dali Kaafar","title":"Challenges with Passwordless FIDO2 in an Enterprise Setting: A Usability\n  Study","comments":"to be published in the IEEE Secure Development Conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Fast Identity Online 2 (FIDO2), a modern authentication protocol, is gaining\npopularity as a default strong authentication mechanism. It has been recognized\nas a leading candidate to overcome limitations (e.g., phishing resistance) of\nexisting authentication solutions. However, the task of deprecating weak\nmethods such as password-based authentication is not trivial and requires a\ncomprehensive approach. While security, privacy, and end-user usability of\nFIDO2 have been addressed in both academic and industry literature, the\ndifficulties associated with its integration with production environments, such\nas solution completeness or edge-case support, have received little attention.\nIn particular, complex environments such as enterprise identity management pose\nunique challenges for any authentication system. In this paper, we identify\nchallenging enterprise identity lifecycle use cases (e.g., remote workforce and\nlegacy systems) by conducting a usability study, in which over 100\ncybersecurity professionals shared their perception of challenges to FIDO2\nintegration from their hands-on field experience. Our analysis of the user\nstudy results revealed serious gaps such as account recovery (selected by over\n60% of our respondents), and identify priority development areas for the FIDO2\ncommunity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:08:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kepkowski","Michal",""],["Machulak","Maciej",""],["Wood","Ian",""],["Kaafar","Dali",""]]}
{"id":"2308.08097","submitter":"Sukwon Yun","authors":"Junghurn Kim, Sukwon Yun, Chanyoung Park","title":"S-Mixup: Structural Mixup for Graph Neural Networks","comments":"CIKM 2023 (Short Paper)","journal-ref":null,"doi":"10.1145/3583780.3615280","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing studies for applying the mixup technique on graphs mainly focus on\ngraph classification tasks, while the research in node classification is still\nunder-explored. In this paper, we propose a novel mixup augmentation for node\nclassification called Structural Mixup (S-Mixup). The core idea is to take into\naccount the structural information while mixing nodes. Specifically, S-Mixup\nobtains pseudo-labels for unlabeled nodes in a graph along with their\nprediction confidence via a Graph Neural Network (GNN) classifier. These serve\nas the criteria for the composition of the mixup pool for both inter and\nintra-class mixups. Furthermore, we utilize the edge gradient obtained from the\nGNN training and propose a gradient-based edge selection strategy for selecting\nedges to be attached to the nodes generated by the mixup. Through extensive\nexperiments on real-world benchmark datasets, we demonstrate the effectiveness\nof S-Mixup evaluated on the node classification task. We observe that S-Mixup\nenhances the robustness and generalization performance of GNNs, especially in\nheterophilous situations. The source code of S-Mixup can be found at\n\\url{https://github.com/SukwonYun/S-Mixup}\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:08:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kim","Junghurn",""],["Yun","Sukwon",""],["Park","Chanyoung",""]]}
{"id":"2308.08098","submitter":"Gang Seob Jung Dr","authors":"Gang Seob Jung, Yoshihide Yoshimoto, Kwang Jin Oh, Shinji Tsuneyuki","title":"Extended Ensemble Molecular Dynamics for Thermodynamics of Phases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The first-order phase transitions and related thermodynamics properties are\nprimary concerns of materials sciences and engineering. In traditional\natomistic simulations, the phase transitions and the estimation of their\nthermodynamic properties are challenging tasks because the trajectories get\ntrapped in local minima close to the initial states. In this study, we\ninvestigate various extended ensemble molecular dynamics (MD) methods based on\nthe multicanonical ensemble method using the Wang-Landau (WL) approach. We\nperformed multibaric-multithermal (MBMT) method to fluid phase, gas-liquid\ntransition, and liquid-solid transition of the Lennard-Jones (LJ) system. The\nderived thermodynamic properties of the fluid phase and the gas-liquid\ntransition from the MBMT agree well with the previously reported equation of\nstates (EOSs). However, the MBMT cannot correctly predict the liquid-solid\ntransition. The multiorder-multithermal (MOMT) ensemble shows significantly\nenhanced sampling between liquid and solid states with an accurate estimation\nof transition temperatures. We further investigated the dynamics of each system\nbased on their free energy shapes, providing fundamental insights for their\nsampling behaviors. This study guides the prediction of broader crystalline\nmaterials, e.g., alloys, for their phases and thermodynamic properties from\natomistic modeling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:10:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jung","Gang Seob",""],["Yoshimoto","Yoshihide",""],["Oh","Kwang Jin",""],["Tsuneyuki","Shinji",""]]}
{"id":"2308.08099","submitter":"Xiaojun Bi","authors":"Xiao-Jun Bi","title":"Slow diffusion around pulsar $\\gamma$-ray halos and its impact on cosmic\n  rays propagation","comments":"10 pages, 8 figures. Proceedings of the 38th International Cosmic Ray\n  Conference (ICRC2023) in Nagoya, Japan","journal-ref":null,"doi":null,"report-no":"PoS(ICRC2023)834","categories":"astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The diffusion coefficients around the pulsar $\\gamma$-ray halos are highly\nsuppressed compared with the value in the interstellar medium. It is suggested\nin the literature that the $\\gamma$-ray halos can be explained by a\nballistic-diffusive (BD) propagation without slow diffusion. However our\ncalculation shows that the BD propagation can not account for the $\\gamma$-ray\nhalo profile well. Furthermore the transfer efficiency of the pulsar spin down\nenergy to the high energy electrons and positrons is even larger than 1 in the\nBD scenario. Therefore slow diffusion is necessary to account for the pulsar\n$\\gamma$-ray halos. Taking the slow diffusion into account the contribution of\npositron flux originated from nearby pulsars to the AMS-02 data is reexamined.\nWe may also expect a slow diffusion disk of the Milky Way as many such slow\ndiffusion regions exist. The positron contribution to the AMS-02 data from dark\nmatter annihilation in the new propagation model is also reexamined. We find\nthat the dark matter scenario satisfies all the $\\gamma$-ray limits in the new\npropagation model.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:11:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bi","Xiao-Jun",""]]}
{"id":"2308.08100","submitter":"Yiwen Chen","authors":"Feng Shu and Yiwen Chen","title":"A New Heterogeneous Hybrid MIMO Receive Structure of Rapidly Eliminating\n  DOA Ambiguity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Massive multiple input multiple output(MIMO)-based fully-digital receive\nantenna arrays eventuate a huge amount of circuit costs and complexity to\ndirection of arrival(DOA) estimation, which is hard to satisfy the needs of\nhigh precision and low cost in future green wireless communication. To address\nthis challenge, a novel heterogeneous hybrid MIMO receiver is proposed in this\npaper and a high performance DOA estimator called heterogeneous cross-minimum\ndistance (HCMD) is developed based on the structure. The antenna arrays are\nfirst divided into multiple groups, and each group adopts a different hybrid\nstructure. The virtual antenna arrays of these groups are then used for DOA\nestimation to generate multiple candidate angle sets, where each set contains a\nunique true solution and multiple pseudo-solutions. Finally, the cross-distance\nminimization method is applied to the multiple candidate angle sets to select\nthe corresponding true solution for each group, and the final DOA estimation is\ngiven by combining the multiple true solutions. Simulation results show that as\nthe number of antennas tends to large-scale, the proposed method can rapidly\nfind the true solution for each group and achieve excellent estimation\nperformance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:15:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shu","Feng",""],["Chen","Yiwen",""]]}
{"id":"2308.08101","submitter":"Yue-Yang Liu","authors":"Yue-Yang Liu, Haoran Lu, Zirui Wang, Hui-Xiong Deng, Lang Zeng,\n  Zhongming Wei, Jun-Wei Luo, Runsheng Wang","title":"The interface states in gate-all-around transistors (GAAFETs)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The atomic-level structural detail and the quantum effects are becoming\ncrucial to device performance as the emerging advanced transistors,\nrepresentatively GAAFETs, are scaling down towards sub-3nm nodes. However, a\nmultiscale simulation framework based on atomistic models and ab initio quantum\nsimulation is still absent. Here, we propose such a simulation framework by\nfulfilling three challenging tasks, i.e., building atomistic all-around\ninterfaces between semiconductor and amorphous gate-oxide, conducting\nlarge-scale first-principles calculations on the interface models containing up\nto 2796 atoms, and finally bridging the state-of-the-art atomic level\ncalculation to commercial TCAD. With this framework, two unnoticed origins of\ninterface states are demonstrated, and their tunability by changing channel\nsize, orientation and geometry is confirmed. The quantitative study of\ninterface states and their effects on device performance explains why the\nnanosheet channel is preferred in industry. We believe such a bottom-up\nframework is necessary and promising for the accurate simulation of emerging\nadvanced transistors.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:20:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Yue-Yang",""],["Lu","Haoran",""],["Wang","Zirui",""],["Deng","Hui-Xiong",""],["Zeng","Lang",""],["Wei","Zhongming",""],["Luo","Jun-Wei",""],["Wang","Runsheng",""]]}
{"id":"2308.08102","submitter":"John Chen","authors":"John Chen, Uri Wilensky","title":"ChatLogo: A Large Language Model-Driven Hybrid Natural-Programming\n  Language Interface for Agent-based Modeling and Programming","comments":"Constructionism 2023 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Building on Papert (1980)'s idea of children talking to computers, we propose\nChatLogo, a hybrid natural-programming language interface for agent-based\nmodeling and programming. We build upon previous efforts to scaffold ABM & P\nlearning and recent development in leveraging large language models (LLMs) to\nsupport the learning of computational programming. ChatLogo aims to support\nconversations with computers in a mix of natural and programming languages,\nprovide a more user-friendly interface for novice learners, and keep the\ntechnical system from over-reliance on any single LLM. We introduced the main\nelements of our design: an intelligent command center, and a conversational\ninterface to support creative expression. We discussed the presentation format\nand future work. Responding to the challenges of supporting open-ended\nconstructionist learning of ABM & P and leveraging LLMs for educational\npurposes, we contribute to the field by proposing the first constructionist\nLLM-driven interface to support computational and complex systems thinking.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:21:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","John",""],["Wilensky","Uri",""]]}
{"id":"2308.08103","submitter":"Yujie Wu","authors":"Yujie Wu","title":"Free Boundary Stable Minimal Hypersurfaces in Positively Curved\n  4-Manifolds","comments":"21 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the combination of nonnegative 2-intermediate Ricci Curvature\nand strict positivity of scalar curvature forces rigidity of two-sided free\nboundary stable minimal hypersurface in a 4-manifold with bounded geometry and\nweakly convex boundary. This extends the method of Chodosh-Li-Stryker to free\nboundary minimal hypersurfaces in ambient manifolds with boundary.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:22:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wu","Yujie",""]]}
{"id":"2308.08104","submitter":"Fei Chen","authors":"Fei Chen, Hoa Van Nguyen, David A. Taggart, Katrina Falkner, S. Hamid\n  Rezatofighi, Damith C. Ranasinghe","title":"ConservationBots: Autonomous Aerial Robot for Fast Robust Wildlife\n  Tracking in Complex Terrains","comments":"33 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Today, the most widespread, widely applicable technology for gathering data\nrelies on experienced scientists armed with handheld radio telemetry equipment\nto locate low-power radio transmitters attached to wildlife from the ground.\nAlthough aerial robots can transform labor-intensive conservation tasks, the\nrealization of autonomous systems for tackling task complexities under\nreal-world conditions remains a challenge. We developed ConservationBots-small\naerial robots for tracking multiple, dynamic, radio-tagged wildlife. The aerial\nrobot achieves robust localization performance and fast task completion times\n-- significant for energy-limited aerial systems while avoiding close\nencounters with potential, counter-productive disturbances to wildlife. Our\napproach overcomes the technical and practical problems posed by combining a\nlightweight sensor with new concepts: i) planning to determine both trajectory\nand measurement actions guided by an information-theoretic objective, which\nallows the robot to strategically select near-instantaneous range-only\nmeasurements to achieve faster localization, and time-consuming sensor rotation\nactions to acquire bearing measurements and achieve robust tracking\nperformance; ii) a bearing detector more robust to noise and iii) a tracking\nalgorithm formulation robust to missed and false detections experienced in\nreal-world conditions. We conducted extensive studies: simulations built upon\ncomplex signal propagation over high-resolution elevation data on diverse\ngeographical terrains; field testing; studies with wombats (Lasiorhinus\nlatifrons; nocturnal, vulnerable species dwelling in underground warrens) and\ntracking comparisons with a highly experienced biologist to validate the\neffectiveness of our aerial robot and demonstrate the significant advantages\nover the manual method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:24:26 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 02:44:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Fei",""],["Van Nguyen","Hoa",""],["Taggart","David A.",""],["Falkner","Katrina",""],["Rezatofighi","S. Hamid",""],["Ranasinghe","Damith C.",""]]}
{"id":"2308.08105","submitter":"Kexue Zhang","authors":"Kexue Zhang","title":"Event-Triggered Stabilization of Linear Time-Delay Systems via\n  Halanay-Type Inequality","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":"  This paper studies the event-triggered control problem for time-delay\nsystems. A novel event-triggering scheme is proposed to exponentially stabilize\na class of linear time-delay systems. By employing a new Halanay-type\ninequality and the Lyapunov function method, sufficient conditions on the\ndesign of control gain and selection of parameters in the proposed\nevent-triggering scheme are derived to both ensure the exponential stability of\nthe closed-loop system and exclude Zeno behavior. Two examples are given to\ndemonstrate the effectiveness of the theoretical result.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:31:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Kexue",""]]}
{"id":"2308.08106","submitter":"Anh-Khoa Vo","authors":"Vo Anh Khoa and Pham Minh Quan and Ja'Niyah Allen and Kbenesh W.\n  Blayneh","title":"Efficient relaxation scheme for the SIR and related compartmental models","comments":"17 pages, 21 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we introduce a novel numerical approach for approximating the\nSIR model in epidemiology. Our method enhances the existing linearization\nprocedure by incorporating a suitable relaxation term to tackle the\ntranscendental equation of nonlinear type. Developed within the continuous\nframework, our relaxation method is explicit and easy to implement, relying on\na sequence of linear differential equations. This approach yields accurate\napproximations in both discrete and analytical forms. Through rigorous\nanalysis, we prove that, with an appropriate choice of the relaxation\nparameter, our numerical scheme is non-negativity-preserving and globally\nstrongly convergent towards the true solution. These theoretical findings have\nnot received sufficient attention in various existing SIR solvers. We also\nextend the applicability of our relaxation method to handle some variations of\nthe traditional SIR model. Finally, we present numerical examples using\nsimulated data to demonstrate the effectiveness of our proposed method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:37:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Khoa","Vo Anh",""],["Quan","Pham Minh",""],["Allen","Ja'Niyah",""],["Blayneh","Kbenesh W.",""]]}
{"id":"2308.08107","submitter":"Stephen Adler","authors":"Stephen L. Adler","title":"Hidden Sector Dark Matter Arising from Breaking of $i \\leftrightarrow\n  -i$ Symmetry into Higgs Phases with Nonzero and Zero Higgs Vacuum Expectation","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO astro-ph.GA gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a scenario, motivated by but not exclusive to trace dynamics, in\nwhich emergent quantum theory takes the form of two sectors coupled\ngravitationally (or very weakly at some high unification scale), one sector\nwith complex unit $i$ and the other sector with complex unit $-i$. I postulate\nthat as a result of symmetries of the pre-quantum theory, in the absence of\ncoupling the two sectors both have Higgs potentials that lie precisely at the\nboundary between phases with nonzero and zero Higgs vaccum expectation. Turning\non the coupling between the two sectors can break the degeneracy, pushing the\nHiggs potential in one sector into the domain of nonzero Higgs expectation\n(giving the visible sector), and pushing the Higgs potential in the other\nsector into the domain of zero Higgs expectation (giving the dark sector). The\nleast massive baryon in the dark sector will then be a candidate\nself-interacting dark matter particle.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:40:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Adler","Stephen L.",""]]}
{"id":"2308.08108","submitter":"Xian-Li Yin","authors":"Xian-Li Yin, Jie-Qiao Liao","title":"Generation of two-giant-atom entanglement in waveguide-QED systems","comments":"13 pages, 8 figures. arXiv admin note: substantial text overlap with\n  arXiv:2303.14746","journal-ref":"Phys. Rev. A 108, 023728 (2023)","doi":"10.1103/PhysRevA.108.023728","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the generation of quantum entanglement between two giant atoms\ncoupled to a one-dimensional waveguide. Since each giant atom interacts with\nthe waveguide at two separate coupling points, there exist three different\ncoupling configurations in the two-atom waveguide system: separated, braided,\nand nested couplings. Within the Wigner-Weisskopf framework for single coupling\npoints, the quantum master equations governing the evolution of the two giant\natoms are obtained. For each coupling configuration, the entanglement dynamics\nof the two giant atoms is studied, including the cases of two different atomic\ninitial states: single- and double-excitation states. It is shown that the\ngenerated entanglement depends on the coupling configuration, phase shift, and\natomic initial state. For the single-excitation initial state, there exists\nsteady-state entanglement for these three couplings due to the appearance of\nthe dark state. For the double-excitation initial state, an entanglement sudden\nbirth is observed via adjusting the phase shift. In particular, the maximal\nentanglement for the nested coupling is about one order of magnitude larger\nthan those of separate and braided couplings. In addition, the influence of the\natomic frequency detuning on the entanglement generation is studied. This work\ncan be utilized for the generation and control of atomic entanglement in\nquantum networks based on giant-atom waveguide-QED systems, which have wide\npotential applications in quantum information processing.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:43:50 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:39:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yin","Xian-Li",""],["Liao","Jie-Qiao",""]]}
{"id":"2308.08109","submitter":"Han-Jin Noh","authors":"Bin Chang, Jinwon Jeong, Han-Jin Noh, and Seongsu Lee","title":"Structural Investigation of BaIrO$_3$ by Neutron Diffraction","comments":"To appear in Journal of the Korean Physical Society","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 a temperature-dependent neutron diffraction (ND) study on\npolycrystalline monoclinic BaIrO$_3$ which is famous for charge density wave\n(CDW) and weak ferromagnetic phase transitions at T$_C$$\\sim$180 K\nsimultaneously. A Rietveld analysis on the ND patterns reveals that even though\nthere is no symmetry breaking in crystal structure, a noticeable change in the\nfour kinds of IrO$_{6}$ octahedra is isolated as the temperature approaches to\nT$_C$. Based on the structure analysis results, we calculated the $d$-orbital\nenergy level splittings by crystal electric field for each type of the IrO$_6$\noctahedra. By taking into account the strong spin-orbit coupling in Ir 5$d$\norbitals and the lattice distortions obtained from the ND analysis, we propose\nan electronic configuration model to understand the phase transition of the\nsystem, where an effective $J_{\\rm eff, 1/2}$ Mott insulating phase and a\ncharge gap phase induced by bonding states between the $J_{\\rm eff,1/2}$ states\ncompete each other.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:47:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chang","Bin",""],["Jeong","Jinwon",""],["Noh","Han-Jin",""],["Lee","Seongsu",""]]}
{"id":"2308.08110","submitter":"Shan Wang","authors":"Shan Wang, Yanhao Zhang, Akhil Perincherry, Ankit Vora and Hongdong Li","title":"View Consistent Purification for Accurate Cross-View Localization","comments":"Accepted for ICCV 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 proposes a fine-grained self-localization method for outdoor\nrobotics that utilizes a flexible number of onboard cameras and readily\naccessible satellite images. The proposed method addresses limitations in\nexisting cross-view localization methods that struggle to handle noise sources\nsuch as moving objects and seasonal variations. It is the first sparse\nvisual-only method that enhances perception in dynamic environments by\ndetecting view-consistent key points and their corresponding deep features from\nground and satellite views, while removing off-the-ground objects and\nestablishing homography transformation between the two views. Moreover, the\nproposed method incorporates a spatial embedding approach that leverages camera\nintrinsic and extrinsic information to reduce the ambiguity of purely visual\nmatching, leading to improved feature matching and overall pose estimation\naccuracy. The method exhibits strong generalization and is robust to\nenvironmental changes, requiring only geo-poses as ground truth. Extensive\nexperiments on the KITTI and Ford Multi-AV Seasonal datasets demonstrate that\nour proposed method outperforms existing state-of-the-art methods, achieving\nmedian spatial accuracy errors below $0.5$ meters along the lateral and\nlongitudinal directions, and a median orientation accuracy error below 2\ndegrees.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:51:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Shan",""],["Zhang","Yanhao",""],["Perincherry","Akhil",""],["Vora","Ankit",""],["Li","Hongdong",""]]}
{"id":"2308.08111","submitter":"Zichang He","authors":"Yifan Pan, Zichang He, Nanlin Guo, Zheng Zhang","title":"Distributionally Robust Circuit Design Optimization under Variation\n  Shifts","comments":"accepted by ICCAD 2023, 8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the significant process variations, designers have to optimize the\nstatistical performance distribution of nano-scale IC design in most cases.\nThis problem has been investigated for decades under the formulation of\nstochastic optimization, which minimizes the expected value of a performance\nmetric while assuming that the distribution of process variation is exactly\ngiven. This paper rethinks the variation-aware circuit design optimization from\na new perspective. First, we discuss the variation shift problem, which means\nthat the actual density function of process variations almost always differs\nfrom the given model and is often unknown. Consequently, we propose to\nformulate the variation-aware circuit design optimization as a distributionally\nrobust optimization problem, which does not require the exact distribution of\nprocess variations. By selecting an appropriate uncertainty set for the\nprobability density function of process variations, we solve the shift-aware\ncircuit optimization problem using distributionally robust Bayesian\noptimization. This method is validated with both a photonic IC and an\nelectronics IC. Our optimized circuits show excellent robustness against\nvariation shifts: the optimized circuit has excellent performance under many\npossible distributions of process variations that differ from the given\nstatistical model. This work has the potential to enable a new research\ndirection and inspire subsequent research at different levels of the EDA flow\nunder the setting of variation shift.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:52:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pan","Yifan",""],["He","Zichang",""],["Guo","Nanlin",""],["Zhang","Zheng",""]]}
{"id":"2308.08112","submitter":"Vasileios Magoulianitis","authors":"Vasileios Magoulianitis, Catherine A. Alexander and C.-C. Jay Kuo","title":"A Comprehensive Overview of Computational Nuclei Segmentation Methods in\n  Digital Pathology","comments":"47 pages, 27 figures, 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the cancer diagnosis pipeline, digital pathology plays an instrumental\nrole in the identification, staging, and grading of malignant areas on biopsy\ntissue specimens. High resolution histology images are subject to high variance\nin appearance, sourcing either from the acquisition devices or the H\\&E\nstaining process. Nuclei segmentation is an important task, as it detects the\nnuclei cells over background tissue and gives rise to the topology, size, and\ncount of nuclei which are determinant factors for cancer detection. Yet, it is\na fairly time consuming task for pathologists, with reportedly high\nsubjectivity. Computer Aided Diagnosis (CAD) tools empowered by modern\nArtificial Intelligence (AI) models enable the automation of nuclei\nsegmentation. This can reduce the subjectivity in analysis and reading time.\nThis paper provides an extensive review, beginning from earlier works use\ntraditional image processing techniques and reaching up to modern approaches\nfollowing the Deep Learning (DL) paradigm. Our review also focuses on the weak\nsupervision aspect of the problem, motivated by the fact that annotated data is\nscarce. At the end, the advantages of different models and types of supervision\nare thoroughly discussed. Furthermore, we try to extrapolate and envision how\nfuture research lines will potentially be, so as to minimize the need for\nlabeled data while maintaining high performance. Future methods should\nemphasize efficient and explainable models with a transparent underlying\nprocess so that physicians can trust their output.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:55:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Magoulianitis","Vasileios",""],["Alexander","Catherine A.",""],["Kuo","C. -C. Jay",""]]}
{"id":"2308.08113","submitter":"Xin-Qi Li","authors":"Lupei Qin, Jialin Li, Yazhi Niu, Xin-Qi Li","title":"Enhanced super-Heisenberg scaling precision by nonlinear coupling and\n  postselection","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":"  In quantum precision metrology, the famous result of Heisenberg limit scaling\nas $1/N$ (with $N$ the number of probes) can be surpassed by considering\nnonlinear coupling measurement. In this work, we consider the most\npractice-relevant quadratic nonlinear coupling and show that the metrological\nprecision can be enhanced from the $1/N^{\\frac{3}{2}}$ super-Heisenberg scaling\nto $1/N^2$, by simply employing a pre- and post-selection (PPS) technique, but\nnot using any expensive quantum resources such as quantum entangled state of\nprobes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:57:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Qin","Lupei",""],["Li","Jialin",""],["Niu","Yazhi",""],["Li","Xin-Qi",""]]}
{"id":"2308.08114","submitter":"Zidong Cao","authors":"Zidong Cao, Hao Ai, Yan-Pei Cao, Ying Shan, Xiaohu Qie, Lin Wang","title":"OmniZoomer: Learning to Move and Zoom in on Sphere at High-Resolution","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Omnidirectional images (ODIs) have become increasingly popular, as their\nlarge field-of-view (FoV) can offer viewers the chance to freely choose the\nview directions in immersive environments such as virtual reality. The M\\\"obius\ntransformation is typically employed to further provide the opportunity for\nmovement and zoom on ODIs, but applying it to the image level often results in\nblurry effect and aliasing problem. In this paper, we propose a novel deep\nlearning-based approach, called \\textbf{OmniZoomer}, to incorporate the\nM\\\"obius transformation into the network for movement and zoom on ODIs. By\nlearning various transformed feature maps under different conditions, the\nnetwork is enhanced to handle the increasing edge curvatures, which alleviates\nthe blurry effect. Moreover, to address the aliasing problem, we propose two\nkey components. Firstly, to compensate for the lack of pixels for describing\ncurves, we enhance the feature maps in the high-resolution (HR) space and\ncalculate the transformed index map with a spatial index generation module.\nSecondly, considering that ODIs are inherently represented in the spherical\nspace, we propose a spherical resampling module that combines the index map and\nHR feature maps to transform the feature maps for better spherical correlation.\nThe transformed feature maps are decoded to output a zoomed ODI. Experiments\nshow that our method can produce HR and high-quality ODIs with the flexibility\nto move and zoom in to the object of interest. Project page is available at\nhttp://vlislab22.github.io/OmniZoomer/.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:58:43 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 02:12:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Zidong",""],["Ai","Hao",""],["Cao","Yan-Pei",""],["Shan","Ying",""],["Qie","Xiaohu",""],["Wang","Lin",""]]}
{"id":"2308.08115","submitter":"Guo-Feng Zhang Dr","authors":"Gen Li, Hao Zhu, and Guo-Feng Zhang","title":"Solving and Completing the Rabi-Stark Model in the Ultrastrong Coupling\n  Regime","comments":"11 pages, 7 figures","journal-ref":"Physical Review A 108, 023720 (2023)","doi":"10.1103/PhysRevA.108.023720","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this work,we employ a unitary transformation with a suitable parameter to\nconvert the quantum Rabi-Stark model into a Jaynes-Cummings-like model.\nSubsequently, we derive the analytical energy spectra in the ultrastrong\ncoupling regime. The energy spectra exhibit a phenomenon known as spectral\ncollapse, indicating the instability of the model due to the unboundedness of\nits energy from below at higher coupling parameters. To stabilize the\nRabi-Stark model, we introduce a nonlinear photon-photon interaction term. We\nthen compare the modified model with the original model in the classical\noscillator (CO) limit. Interestingly, we observe a regular \"staircase\" pattern\nin the mean photon number of the ground state. This pattern exhibits a fixed\nslope and equal step width, which we determine analytically. Moreover, we\nanalytically determine the phase boundary, which slightly differs from that in\nthe original Rabi-Stark model. These findings offer insights into the\ninvestigation of those superradiant phase transitions that are unbounded from\nbelow due to the phenomenon of spectral collapse.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:01:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Gen",""],["Zhu","Hao",""],["Zhang","Guo-Feng",""]]}
{"id":"2308.08116","submitter":"Shi Feng","authors":"Shi Feng, Adhip Agarwala, Nandini Trivedi","title":"Dimensional reduction of Kitaev spin liquid at quantum criticality","comments":"12 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 investigate the fate of the Kitaev spin liquid (KSL) under the influence\nof an external magnetic field $h$ in the [001] direction and upon tuning bond\nanisotropy of the Kitaev coupling $K_z$ keeping $K_x = K_y = K$. Guided by\ndensity matrix renormalization group, exact diagonalization, and with insights\nfrom parton mean field theory, we uncover a field-induced gapless-to-gapless\nLifshitz transition from the nodal KSL to an intermediate gapless phase. The\nintermediate phase sandwiched between $h_{c1}$ and $h_{c2}$, which persists for\na wide range of anisotropy $K_z/K > 0$, is composed of weakly coupled\none-dimensional quantum critical chains, and asymptotically approaches the\none-dimensional quantum Ising criticality characterized by the (1+1)D conformal\nfield theory with a central charge $c=\\frac{1}{2}$ as the field approaches the\nphase transition at $h_{c2}$. Beyond $h_{c2}$ the system enters a partially\npolarized phase describable as effectively decoupled bosonic chains in which\nspin waves propagate along the one-dimensional zigzag direction. Our findings\nprovide a comprehensive phase diagram and offer insights into the unusual\nphysics of dimensional reduction generated by a uniform magnetic field in an\notherwise two-dimensional quantum spin liquid.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:05:14 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Feng","Shi",""],["Agarwala","Adhip",""],["Trivedi","Nandini",""]]}
{"id":"2308.08117","submitter":"Xinyi Yuan","authors":"Junyi Xie and Xinyi Yuan","title":"The Geometric Bombieri-Lang Conjecture for Ramified Covers of Abelian\n  Varieties","comments":"The original paper arXiv:2305.14789v1 is split into two papers:\n  arXiv:2305.14789v2 and the current paper","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we prove the geometric Bombieri-Lang conjecture for projective\nvarieties which have finite morphisms to abelian varieties of trivial traces\nover function fields of characteristic 0. The proof is based on the idea of\nconstructing entire curves in the pre-sequel \"Partial heights, entire curves,\nand the geometric Bombieri-Lang conjecture.\" A new ingredient is an explicit\ndescription of the entire curves in terms of Lie algebras of abelian varieties.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:10:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xie","Junyi",""],["Yuan","Xinyi",""]]}
{"id":"2308.08118","submitter":"Hiromu Tanaka","authors":"Hiromu Tanaka","title":"Elliptic sigularities and threefold flops in positive characteristic","comments":"50 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X$ be a smooth threefold over an algebraically closed field of positive\ncharacteristic. We prove that an arbitrary flop of $X$ is smooth. To this end,\nwe study Gorenstein curves of genus one and two-dimensional elliptic\nsingularities defined over imperfect fields.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:17:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tanaka","Hiromu",""]]}
{"id":"2308.08119","submitter":"Hiromu Tanaka","authors":"Hiromu Tanaka","title":"Discriminant divisors for conic bundles","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study some foundational properties on discriminant divisors for\ngenerically smooth conic bundles. In particular, we extend the formula\n$\\Delta_f \\equiv -f_*K_{X/T}^2$ to arbitrary characteristics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:20:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tanaka","Hiromu",""]]}
{"id":"2308.08120","submitter":"Haiyuan Zhao","authors":"Haiyuan Zhao, Lei Zhang, Jun Xu, Guohao Cai, Zhenhua Dong, Ji-Rong Wen","title":"Uncovering User Interest from Biased and Noised Watch Time in Video\n  Recommendation","comments":"Accepted by Recsys'23","journal-ref":null,"doi":"10.1145/3604915.3608797","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the video recommendation, watch time is commonly adopted as an indicator\nof user interest. However, watch time is not only influenced by the matching of\nusers' interests but also by other factors, such as duration bias and noisy\nwatching. Duration bias refers to the tendency for users to spend more time on\nvideos with longer durations, regardless of their actual interest level. Noisy\nwatching, on the other hand, describes users taking time to determine whether\nthey like a video or not, which can result in users spending time watching\nvideos they do not like. Consequently, the existence of duration bias and noisy\nwatching make watch time an inadequate label for indicating user interest.\nFurthermore, current methods primarily address duration bias and ignore the\nimpact of noisy watching, which may limit their effectiveness in uncovering\nuser interest from watch time. In this study, we first analyze the generation\nmechanism of users' watch time from a unified causal viewpoint. Specifically,\nwe considered the watch time as a mixture of the user's actual interest level,\nthe duration-biased watch time, and the noisy watch time. To mitigate both the\nduration bias and noisy watching, we propose Debiased and Denoised watch time\nCorrection (D$^2$Co), which can be divided into two steps: First, we employ a\nduration-wise Gaussian Mixture Model plus frequency-weighted moving average for\nestimating the bias and noise terms; then we utilize a sensitivity-controlled\ncorrection function to separate the user interest from the watch time, which is\nrobust to the estimation error of bias and noise terms. The experiments on two\npublic video recommendation datasets and online A/B testing indicate the\neffectiveness of the proposed method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:21:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhao","Haiyuan",""],["Zhang","Lei",""],["Xu","Jun",""],["Cai","Guohao",""],["Dong","Zhenhua",""],["Wen","Ji-Rong",""]]}
{"id":"2308.08121","submitter":"Hiromu Tanaka","authors":"Hiromu Tanaka","title":"Fano threefolds in positive characteristic I","comments":"59 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over an algebraically closed field of positive characteristic, we classify\nsmooth Fano threefolds of Picard number one whose anti-canonical linear systems\nare not very ample. Furthermore, we also prove that an anti-canonically\nembedded Fano threefold of genus at least five is an intersection of quadrics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:22:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tanaka","Hiromu",""]]}
{"id":"2308.08122","submitter":"Hiromu Tanaka","authors":"Hiromu Tanaka","title":"Fano threefolds in positive characteristic II","comments":"84 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X$ be a smooth Fano threefold over an algebraically closed field of\npositive characteristic. Assume that both the index and the Picard number are\nequal to one. We prove that $3 \\leq g \\leq 12$ for the genus $g$ of $X$.\nMoreover, we show that there exists no smooth curve on $X$ along which the\nblowup is Fano.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:26:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tanaka","Hiromu",""]]}
{"id":"2308.08123","submitter":"De-Cheng Zou","authors":"Sheng-Yuan Li, Ming Zhang, De-Cheng Zou and Meng-Yun Lai","title":"Analytical approximations to charged black hole solutions in\n  Einstein-Maxwell-Weyl gravity","comments":"17 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2308.03506","journal-ref":"Universe 2023, 9(8), 371","doi":"10.3390/universe9080371","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Homotopy Analysis Method (HAM) is a useful method to derive analytical\napproximate solutions of black holes in modified gravity theories. In this\npaper, we study the Einstein-Weyl gravity coupled with Maxwell field, and\nobtain analytical approximation solutions for charged black holes by using the\nHAM. It is found that the analytical approximate solutions are sufficiently\naccurate in the entire spacetime outside the black hole's event horizon, and\nalso consistent with numerical ones for charged black holes in the\nEinstein-Maxwell-Weyl gravity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:28:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Sheng-Yuan",""],["Zhang","Ming",""],["Zou","De-Cheng",""],["Lai","Meng-Yun",""]]}
{"id":"2308.08124","submitter":"Hiromu Tanaka","authors":"Masaya Asai, Hiromu Tanaka","title":"Fano threefolds in positive characteristic III","comments":"80 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify primitive Fano threefolds in positive characteristic whose Picard\nnumbers are at least two.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:30:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Asai","Masaya",""],["Tanaka","Hiromu",""]]}
{"id":"2308.08125","submitter":"Running Zhao","authors":"Running Zhao, Jiangtao Yu, Hang Zhao and Edith C.H. Ngai","title":"Radio2Text: Streaming Speech Recognition Using mmWave Radio Signals","comments":"Accepted by Proceedings of the ACM on Interactive, Mobile, Wearable\n  and Ubiquitous Technologies (ACM IMWUT/UbiComp 2023)","journal-ref":null,"doi":"10.1145/3610873","report-no":null,"categories":"cs.SD cs.CL cs.HC eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Millimeter wave (mmWave) based speech recognition provides more possibility\nfor audio-related applications, such as conference speech transcription and\neavesdropping. However, considering the practicality in real scenarios, latency\nand recognizable vocabulary size are two critical factors that cannot be\noverlooked. In this paper, we propose Radio2Text, the first mmWave-based system\nfor streaming automatic speech recognition (ASR) with a vocabulary size\nexceeding 13,000 words. Radio2Text is based on a tailored streaming Transformer\nthat is capable of effectively learning representations of speech-related\nfeatures, paving the way for streaming ASR with a large vocabulary. To\nalleviate the deficiency of streaming networks unable to access entire future\ninputs, we propose the Guidance Initialization that facilitates the transfer of\nfeature knowledge related to the global context from the non-streaming\nTransformer to the tailored streaming Transformer through weight inheritance.\nFurther, we propose a cross-modal structure based on knowledge distillation\n(KD), named cross-modal KD, to mitigate the negative effect of low quality\nmmWave signals on recognition performance. In the cross-modal KD, the audio\nstreaming Transformer provides feature and response guidance that inherit\nfruitful and accurate speech information to supervise the training of the\ntailored radio streaming Transformer. The experimental results show that our\nRadio2Text can achieve a character error rate of 5.7% and a word error rate of\n9.4% for the recognition of a vocabulary consisting of over 13,000 words.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:31:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhao","Running",""],["Yu","Jiangtao",""],["Zhao","Hang",""],["Ngai","Edith C. H.",""]]}
{"id":"2308.08126","submitter":"Jun-Xia Chen","authors":"Jun-Xia Chen and De-Fu Hou and Hai-Cang Ren","title":"Drag force and heavy quark potential in a rotating background","comments":"28 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We explored the gravity dual of the rotating quark-gluon plasma by\ntransforming the boundary coordinates of the Schwarzschild-$AdS_5$ metric. The\nEuler-Lagrange equation of the Nambu-Goto action and its solution become more\ncomplex than those without rotation. For small angular velocity, we obtained an\nanalytical form of the drag force acting on a quark moving in the direction of\nthe rotation axis and found it stronger than that without rotation. We also\ncalculated the heavy quark potential under the same approximation. For the\nquarkonium symmetric with respect to the rotation axis, the depth of the\npotential is reduced by the rotation. For the quarkonium oriented in parallel\nto the rotation axis, the bind force is weakened and the force range becomes\nlonger. We also compared our holographic formulation with others in the\nliterature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:32:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Jun-Xia",""],["Hou","De-Fu",""],["Ren","Hai-Cang",""]]}
{"id":"2308.08127","submitter":"Hiromu Tanaka","authors":"Hiromu Tanaka","title":"Fano threefolds in positive characteristic IV","comments":"123 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on classification results obtained in the former parts, we classify\nFano threefolds of positive characteristic.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:34:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tanaka","Hiromu",""]]}
{"id":"2308.08128","submitter":"Seong-Joon Park","authors":"Seong-Joon Park, Hee-Youl Kwak, Sang-Hyo Kim, Sunghwan Kim, Yongjune\n  Kim, Jong-Seon No","title":"How to Mask in Error Correction Code Transformer: Systematic and Double\n  Masking","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In communication and storage systems, error correction codes (ECCs) are\npivotal in ensuring data reliability. As deep learning's applicability has\nbroadened across diverse domains, there is a growing research focus on neural\nnetwork-based decoders that outperform traditional decoding algorithms. Among\nthese neural decoders, Error Correction Code Transformer (ECCT) has achieved\nthe state-of-the-art performance, outperforming other methods by large margins.\nTo further enhance the performance of ECCT, we propose two novel methods.\nFirst, leveraging the systematic encoding technique of ECCs, we introduce a new\nmasking matrix for ECCT, aiming to improve the performance and reduce the\ncomputational complexity. Second, we propose a novel transformer architecture\nof ECCT called a double-masked ECCT. This architecture employs two different\nmask matrices in a parallel manner to learn more diverse features of the\nrelationship between codeword bits in the masked self-attention blocks.\nExtensive simulation results show that the proposed double-masked ECCT\noutperforms the conventional ECCT, achieving the state-of-the-art decoding\nperformance with significant margins.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:35:52 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 04:53:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Park","Seong-Joon",""],["Kwak","Hee-Youl",""],["Kim","Sang-Hyo",""],["Kim","Sunghwan",""],["Kim","Yongjune",""],["No","Jong-Seon",""]]}
{"id":"2308.08129","submitter":"Shun Takashige","authors":"Shun Takashige, Masatoshi Hanai, Toyotaro Suzumura, Limin Wang and\n  Kenjiro Taura","title":"Is Self-Supervised Pretraining Good for Extrapolation in Molecular\n  Property Prediction?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The prediction of material properties plays a crucial role in the development\nand discovery of materials in diverse applications, such as batteries,\nsemiconductors, catalysts, and pharmaceuticals. Recently, there has been a\ngrowing interest in employing data-driven approaches by using machine learning\ntechnologies, in combination with conventional theoretical calculations. In\nmaterial science, the prediction of unobserved values, commonly referred to as\nextrapolation, is particularly critical for property prediction as it enables\nresearchers to gain insight into materials beyond the limits of available data.\nHowever, even with the recent advancements in powerful machine learning models,\naccurate extrapolation is still widely recognized as a significantly\nchallenging problem. On the other hand, self-supervised pretraining is a\nmachine learning technique where a model is first trained on unlabeled data\nusing relatively simple pretext tasks before being trained on labeled data for\ntarget tasks. As self-supervised pretraining can effectively utilize material\ndata without observed property values, it has the potential to improve the\nmodel's extrapolation ability. In this paper, we clarify how such\nself-supervised pretraining can enhance extrapolation performance.We propose an\nexperimental framework for the demonstration and empirically reveal that while\nmodels were unable to accurately extrapolate absolute property values,\nself-supervised pretraining enables them to learn relative tendencies of\nunobserved property values and improve extrapolation performance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:38:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Takashige","Shun",""],["Hanai","Masatoshi",""],["Suzumura","Toyotaro",""],["Wang","Limin",""],["Taura","Kenjiro",""]]}
{"id":"2308.08130","submitter":"Yiwen Lin","authors":"Yiwen Lin and Shi Jin","title":"Error estimates of a bi-fidelity method for a multi-phase\n  Navier-Stokes-Vlasov-Fokker-Planck system with random inputs","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":"  Uniform error estimates of a bi-fidelity method for a kinetic-fluid coupled\nmodel with random initial inputs in the fine particle regime are proved in this\npaper. Such a model is a system coupling the incompressible Navier-Stokes\nequations to the Vlasov-Fokker-Planck equations for a mixture of the flows with\ndistinct particle sizes. The main analytic tool is the hypocoercivity analysis\nfor the multi-phase Navier-Stokes-Vlasov-Fokker-Planck system with\nuncertainties, considering solutions in a perturbative setting near the global\nequilibrium. This allows us to obtain the error estimates in both kinetic and\nhydrodynamic regimes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:43:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lin","Yiwen",""],["Jin","Shi",""]]}
{"id":"2308.08131","submitter":"Junyang Chen","authors":"Junyang Chen and Hanjiang Lai","title":"Ranking-aware Uncertainty for Text-guided Image Retrieval","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":"  Text-guided image retrieval is to incorporate conditional text to better\ncapture users' intent. Traditionally, the existing methods focus on minimizing\nthe embedding distances between the source inputs and the targeted image, using\nthe provided triplets $\\langle$source image, source text, target\nimage$\\rangle$. However, such triplet optimization may limit the learned\nretrieval model to capture more detailed ranking information, e.g., the\ntriplets are one-to-one correspondences and they fail to account for\nmany-to-many correspondences arising from semantic diversity in feedback\nlanguages and images. To capture more ranking information, we propose a novel\nranking-aware uncertainty approach to model many-to-many correspondences by\nonly using the provided triplets. We introduce uncertainty learning to learn\nthe stochastic ranking list of features. Specifically, our approach mainly\ncomprises three components: (1) In-sample uncertainty, which aims to capture\nsemantic diversity using a Gaussian distribution derived from both combined and\ntarget features; (2) Cross-sample uncertainty, which further mines the ranking\ninformation from other samples' distributions; and (3) Distribution\nregularization, which aligns the distributional representations of source\ninputs and targeted image. Compared to the existing state-of-the-art methods,\nour proposed method achieves significant results on two public datasets for\ncomposed image retrieval.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:48:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Junyang",""],["Lai","Hanjiang",""]]}
{"id":"2308.08132","submitter":"Phanish Suryanarayana","authors":"Phanish Suryanarayana, Arpit Bhardwaj, Xin Jing, John E. Pask","title":"Accuracy of Kohn-Sham density functional theory for warm- and hot-dense\n  matter equation of state","comments":"6 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the accuracy of Kohn-Sham density functional theory (DFT) for warm-\nand hot-dense matter (WDM and HDM). Specifically, considering a wide range of\nsystems, we perform accurate ab initio molecular dynamics simulations with\ntemperature-independent local/semilocal density functionals to determine the\nequations of state at compression ratios of 3x--7x and temperatures near 1 MK.\nWe find very good agreement with path integral Monte Carlo (PIMC) benchmarks,\nwhile having significantly smaller error bars and smoother data, demonstrating\nthe fidelity of DFT for the study of WDM and HDM.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:48:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Suryanarayana","Phanish",""],["Bhardwaj","Arpit",""],["Jing","Xin",""],["Pask","John E.",""]]}
{"id":"2308.08133","submitter":"Masaru Ikehata","authors":"Masaru Ikehata","title":"Integrating the probe and singular sources methods","comments":"38 pages, corrected several typos on pages 7, 11, 32; revised Remark\n  1.2 and Remark 3.1","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":"  The probe and singular sources methods are well-known two classical direct\nreconstruction methods in inverse obstacle problems governed by partial\ndifferential equations. The common part of both methods is the notion of the\nindicator functions which are defined outside an unknown obstacle and blow up\non the surface of the obstacle. However, their appearance is completely\ndifferent. In this paper, by considering an inverse obstacle problem governed\nby the Laplace equation in a bounded domain as a prototype case, an integrated\nversion of the probe and singular sources methods which fills the gap between\ntheir indicator functions is introduced. The main result is decomposed into\nthree parts. First, the singular sources method combined with the probe method\nand notion of the Carleman function is formulated. Second, the indicator\nfunctions of both methods can be obtained as a result of decomposing a third\nindicator function into two ways. The third indicator function blows up on both\nthe outer and obstacle surfaces. Third, the probe and singular sources methods\nare reformulated and it is shown that the indicator functions on which both\nreformulated methods based, completely coincide with each other. As a\nbyproduct, it turns out that the reformulated singular sources method has also\nthe Side B of the probe method, which is a characterization of the unknown\nobstacle by means of the blowing up property of an indicator sequence.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:48:21 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 14:25:45 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 03:23:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ikehata","Masaru",""]]}
{"id":"2308.08134","submitter":"Xiong Huang","authors":"Xiong Huang, Dongxue Chen, Zhen Lian, Qiran Wu, Mina Rashetnia, Mark\n  Blei, Takashi Taniguchi, Kenji Watanabe, Sefaattin Tongay, Su-Fei Shi,\n  Yong-Tao Cui","title":"Measurements of Correlated Insulator Gaps in a Transition Metal\n  Dichalcogenide Moir\\'e Superlattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Moir\\'e superlattices of transitional metal dichalcogenides exhibit strong\nelectron-electron interaction that has led to experimental observations of Mott\ninsulators and generalized Wigner crystals. In this letter, we report direct\nmeasurements of the thermodynamic gaps of these correlated insulating states in\na dual-gate WS2/WSe2 moir\\'e bilayer. We employ the microwave impedance\nmicroscopy to probe the electronic features in both the graphene top gate and\nthe moir\\'e bilayer, from which we extract the doping dependence of the\nchemical potential of the moir\\'e bilayer and the energy gaps for various\ncorrelated insulating states utilizing the Landau quantization of graphene.\nThese gaps are relatively insensitive to the application of an external\nelectric field to the WS2/WSe2 moir\\'e bilayer.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:48:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Xiong",""],["Chen","Dongxue",""],["Lian","Zhen",""],["Wu","Qiran",""],["Rashetnia","Mina",""],["Blei","Mark",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Tongay","Sefaattin",""],["Shi","Su-Fei",""],["Cui","Yong-Tao",""]]}
{"id":"2308.08135","submitter":"Xianfeng Jiao","authors":"Xianfeng Jiao, Zizhong Li, Chang Xu, Yang Liu, Weiqing Liu and Jiang\n  Bian","title":"Microstructure-Empowered Stock Factor Extraction and Utilization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-frequency quantitative investment is a crucial aspect of stock\ninvestment. Notably, order flow data plays a critical role as it provides the\nmost detailed level of information among high-frequency trading data, including\ncomprehensive data from the order book and transaction records at the tick\nlevel. The order flow data is extremely valuable for market analysis as it\nequips traders with essential insights for making informed decisions. However,\nextracting and effectively utilizing order flow data present challenges due to\nthe large volume of data involved and the limitations of traditional factor\nmining techniques, which are primarily designed for coarser-level stock data.\nTo address these challenges, we propose a novel framework that aims to\neffectively extract essential factors from order flow data for diverse\ndownstream tasks across different granularities and scenarios. Our method\nconsists of a Context Encoder and an Factor Extractor. The Context Encoder\nlearns an embedding for the current order flow data segment's context by\nconsidering both the expected and actual market state. In addition, the Factor\nExtractor uses unsupervised learning methods to select such important signals\nthat are most distinct from the majority within the given context. The\nextracted factors are then utilized for downstream tasks. In empirical studies,\nour proposed framework efficiently handles an entire year of stock order flow\ndata across diverse scenarios, offering a broader range of applications\ncompared to existing tick-level approaches that are limited to only a few days\nof stock data. We demonstrate that our method extracts superior factors from\norder flow data, enabling significant improvement for stock trend prediction\nand order execution tasks at the second and minute level.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:56:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiao","Xianfeng",""],["Li","Zizhong",""],["Xu","Chang",""],["Liu","Yang",""],["Liu","Weiqing",""],["Bian","Jiang",""]]}
{"id":"2308.08136","submitter":"Driba Tolla Dr.","authors":"Yoonbai Kim, O-Kab Kwon, D. D. Tolla","title":"Spontaneous Supersymmetry Breaking in Inhomogeneous Supersymmetric Field\n  Theories and BPS Vacua","comments":"25 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study spontaneous supersymmetry breaking in inhomogeneous extensions of\n${\\cal N}=1$ supersymmetric field theory models in 4-dimensions. The ${\\cal\nN}=1$ Abelian Higgs model with the inhomogeneous mass parameter and the FI\ncoefficient that are dependent on spatial coordinates, as well as the\nO'Raifeartaigh model with all its parameters being dependent on spatial\ncoordinates, are studied in detail. In the presence of inhomogeneous\nparameters, half supersymmetry can be preserved by adding appropriate\ninhomogeneous deformations to the original Lagrangians. The inhomogeneous\ndeformations either break the R-symmetry or produce a model that lacks\nspontaneously broken R-symmetry. We argue that those can not be spontaneous\nsupersymmetry breaking models, according to the Nelson-Seiberg argument. We\ncomment on this issue in the context of a generic ${\\cal N}=1$ supersymmetric\nmodel as well.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:59:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kim","Yoonbai",""],["Kwon","O-Kab",""],["Tolla","D. D.",""]]}
{"id":"2308.08137","submitter":"Weiran Gou","authors":"Weiran Gou, Ziyao Yi, Yan Xiang, Shaoqing Li, Zibin Liu, Dehui Kong\n  and Ke Xu","title":"SYENet: A Simple Yet Effective Network for Multiple Low-Level Vision\n  Tasks with Real-time Performance on Mobile Device","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rapid development of AI hardware accelerators, applying deep\nlearning-based algorithms to solve various low-level vision tasks on mobile\ndevices has gradually become possible. However, two main problems still need to\nbe solved: task-specific algorithms make it difficult to integrate them into a\nsingle neural network architecture, and large amounts of parameters make it\ndifficult to achieve real-time inference. To tackle these problems, we propose\na novel network, SYENet, with only $~$6K parameters, to handle multiple\nlow-level vision tasks on mobile devices in a real-time manner. The SYENet\nconsists of two asymmetrical branches with simple building blocks. To\neffectively connect the results by asymmetrical branches, a Quadratic\nConnection Unit(QCU) is proposed. Furthermore, to improve performance, a new\nOutlier-Aware Loss is proposed to process the image. The proposed method proves\nits superior performance with the best PSNR as compared with other networks in\nreal-time applications such as Image Signal Processing(ISP), Low-Light\nEnhancement(LLE), and Super-Resolution(SR) with 2K60FPS throughput on Qualcomm\n8 Gen 1 mobile SoC(System-on-Chip). Particularly, for ISP task, SYENet got the\nhighest score in MAI 2022 Learned Smartphone ISP challenge.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:03:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gou","Weiran",""],["Yi","Ziyao",""],["Xiang","Yan",""],["Li","Shaoqing",""],["Liu","Zibin",""],["Kong","Dehui",""],["Xu","Ke",""]]}
{"id":"2308.08138","submitter":"Zishun Liu","authors":"Zishun Liu and Yongxin Chen","title":"Online Control for Linear Dynamics: A Data-Driven Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper considers an online control problem over a linear time-invariant\nsystem with unknown dynamics, bounded disturbance, and adversarial cost. We\npropose a data-driven strategy to reduce the regret of the controller. Unlike\nmodel-based methods, our algorithm does not identify the system model, instead,\nit leverages a single noise-free trajectory to calculate the accumulation of\ndisturbance and makes decisions using the accumulated disturbance action\ncontroller we design, whose parameters are updated by online gradient descent.\nWe prove that the regret of our algorithm is $\\mathcal{O}(\\sqrt{T})$ under mild\nassumptions, suggesting that its performance is on par with model-based\nmethods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:05:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Zishun",""],["Chen","Yongxin",""]]}
{"id":"2308.08139","submitter":"Zeya Mi","authors":"Zeya Mi and Yongluo Cao","title":"Physical measures for partially hyperbolic diffeomorphisms with mixed\n  hyperbolicity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the partially hyperbolic diffeomorphims whose center direction\nadmits the u-definite property in the sense that all the central Lyapunov\nexponents of each ergodic Gibbs u-state are either all positive or all\nnegative. We prove that for this kind of partially hyperbolic diffeomorphisms,\nthere are finitely many physical measures, whose basins cover a full Lebesgue\nmeasure subset of the ambient space.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:08:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mi","Zeya",""],["Cao","Yongluo",""]]}
{"id":"2308.08140","submitter":"Ziyu Li","authors":"Ziyu Li, Jingming Guo, Tongtong Cao, Liu Bingbing, Wankou Yang","title":"GPA-3D: Geometry-aware Prototype Alignment for Unsupervised Domain\n  Adaptive 3D Object Detection from Point Clouds","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":"  LiDAR-based 3D detection has made great progress in recent years. However,\nthe performance of 3D detectors is considerably limited when deployed in unseen\nenvironments, owing to the severe domain gap problem. Existing domain adaptive\n3D detection methods do not adequately consider the problem of the\ndistributional discrepancy in feature space, thereby hindering generalization\nof detectors across domains. In this work, we propose a novel unsupervised\ndomain adaptive \\textbf{3D} detection framework, namely \\textbf{G}eometry-aware\n\\textbf{P}rototype \\textbf{A}lignment (\\textbf{GPA-3D}), which explicitly\nleverages the intrinsic geometric relationship from point cloud objects to\nreduce the feature discrepancy, thus facilitating cross-domain transferring.\nSpecifically, GPA-3D assigns a series of tailored and learnable prototypes to\npoint cloud objects with distinct geometric structures. Each prototype aligns\nBEV (bird's-eye-view) features derived from corresponding point cloud objects\non source and target domains, reducing the distributional discrepancy and\nachieving better adaptation. The evaluation results obtained on various\nbenchmarks, including Waymo, nuScenes and KITTI, demonstrate the superiority of\nour GPA-3D over the state-of-the-art approaches for different adaptation\nscenarios. The MindSpore version code will be publicly available at\n\\url{https://github.com/Liz66666/GPA3D}.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:15:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Ziyu",""],["Guo","Jingming",""],["Cao","Tongtong",""],["Bingbing","Liu",""],["Yang","Wankou",""]]}
{"id":"2308.08141","submitter":"Pawan Kumar Kulriya","authors":"Ankita Rawat, Nitesh K. Chourasia, Saurabh K. Saini, Gaurav Rajput,\n  Aditya Yadav, Ritesh Kumar Chourasia, Govind Gupta and P. K. Kulriya","title":"Investigation of charge carrier dynamics in Ti3C2Tx MXene for ultrafast\n  photonics applications","comments":"21 pages , 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid advancement of nanomaterials has paved the way for various\ntechnological breakthroughs, and MXenes, in particular, have gained substantial\nattention due to their unique properties such as high conductivity,\nbroad-spectrum absorption strength, and tunable band gap. This article presents\nthe impact of the process parameters on the structural and optical properties\nof Ti3C2Tx MXene for application in ultrafast dynamics. XRD along with Raman\nspectroscopy studies, confirmed the synthesis of a single phase from their MAX\nphase Ti3AlC2. The complete etching of Al and increase in the interplanar\ndistance is also observed on centrifugation at very high speed. The ultrafast\ntransient absorption spectroscopy used to understand the effect of centrifuge\nspeed on the charge carrier dynamics and ultrafast spectrum of MXene displayed\nthat the carrier lifetime is critically influenced by rotation per minute (rpm)\ne.g. faster decay lifetime at 10k rpm than 7k rpm. The electronic relaxation\nprobed using the time-resolved photoluminescence (TRPL) technique exhibits an\naverage decay time of 5.13 ns and 5.35 ns at the 7k and 10k rpm, respectively,\nwhich confirms that the optical properties of the MXene are strongly affected\nby the centrifuge speed. The synthesized MXene at 10k rpm typically suggests\nthat radiative processes due to longer decay lifetime and experiences fewer\nnonradiative losses, resulting in enhanced luminescence properties.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:16:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rawat","Ankita",""],["Chourasia","Nitesh K.",""],["Saini","Saurabh K.",""],["Rajput","Gaurav",""],["Yadav","Aditya",""],["Chourasia","Ritesh Kumar",""],["Gupta","Govind",""],["Kulriya","P. K.",""]]}
{"id":"2308.08142","submitter":"Minghao She","authors":"Minghao She, Wendong Mao, Huihong Shi and Zhongfeng Wang","title":"S2R: Exploring a Double-Win Transformer-Based Framework for Ideal and\n  Blind Super-Resolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nowadays, deep learning based methods have demonstrated impressive\nperformance on ideal super-resolution (SR) datasets, but most of these methods\nincur dramatically performance drops when directly applied in real-world SR\nreconstruction tasks with unpredictable blur kernels. To tackle this issue,\nblind SR methods are proposed to improve the visual results on random blur\nkernels, which causes unsatisfactory reconstruction effects on ideal\nlow-resolution images similarly. In this paper, we propose a double-win\nframework for ideal and blind SR task, named S2R, including a light-weight\ntransformer-based SR model (S2R transformer) and a novel coarse-to-fine\ntraining strategy, which can achieve excellent visual results on both ideal and\nrandom fuzzy conditions. On algorithm level, S2R transformer smartly combines\nsome efficient and light-weight blocks to enhance the representation ability of\nextracted features with relatively low number of parameters. For training\nstrategy, a coarse-level learning process is firstly performed to improve the\ngeneralization of the network with the help of a large-scale external dataset,\nand then, a fast fine-tune process is developed to transfer the pre-trained\nmodel to real-world SR tasks by mining the internal features of the image.\nExperimental results show that the proposed S2R outperforms other single-image\nSR models in ideal SR condition with only 578K parameters. Meanwhile, it can\nachieve better visual results than regular blind SR models in blind fuzzy\nconditions with only 10 gradient updates, which improve convergence speed by\n300 times, significantly accelerating the transfer-learning process in\nreal-world situations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:27:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["She","Minghao",""],["Mao","Wendong",""],["Shi","Huihong",""],["Wang","Zhongfeng",""]]}
{"id":"2308.08143","submitter":"Kai Li","authors":"Kai Li, Runxuan Yang, Xiaolin Hu","title":"SCANet: A Self- and Cross-Attention Network for Audio-Visual Speech\n  Separation","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CV cs.MM eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integration of different modalities, such as audio and visual\ninformation, plays a crucial role in human perception of the surrounding\nenvironment. Recent research has made significant progress in designing fusion\nmodules for audio-visual speech separation. However, they predominantly focus\non multi-modal fusion architectures situated either at the top or bottom\npositions, rather than comprehensively considering multi-modal fusion at\nvarious hierarchical positions within the network. In this paper, we propose a\nnovel model called self- and cross-attention network (SCANet), which leverages\nthe attention mechanism for efficient audio-visual feature fusion. SCANet\nconsists of two types of attention blocks: self-attention (SA) and\ncross-attention (CA) blocks, where the CA blocks are distributed at the top\n(TCA), middle (MCA) and bottom (BCA) of SCANet. These blocks maintain the\nability to learn modality-specific features and enable the extraction of\ndifferent semantics from audio-visual features. Comprehensive experiments on\nthree standard audio-visual separation benchmarks (LRS2, LRS3, and VoxCeleb2)\ndemonstrate the effectiveness of SCANet, outperforming existing\nstate-of-the-art (SOTA) methods while maintaining comparable inference time.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:31:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Kai",""],["Yang","Runxuan",""],["Hu","Xiaolin",""]]}
{"id":"2308.08144","submitter":"Dongsun Kim","authors":"Arooba Shahoor and Askar Yeltayuly Khamit and Jooyong Yi and Dongsun\n  Kim","title":"LeakPair: Proactive Repairing of Memory Leaks in Single Page Web\n  Applications","comments":"13 pages, 3 figures, Accepted for ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Modern web applications often resort to application development frameworks\nsuch as React, Vue.js, and Angular. While the frameworks facilitate the\ndevelopment of web applications with several useful components, they are\ninevitably vulnerable to unmanaged memory consumption since the frameworks\noften produce Single Page Applications (SPAs). Web applications can be alive\nfor hours and days with behavior loops, in such cases, even a single memory\nleak in a SPA app can cause performance degradation on the client side.\nHowever, recent debugging techniques for web applications still focus on memory\nleak detection, which requires manual tasks and produces imprecise results.\n  We propose LeakPair, a technique to repair memory leaks in single page\napplications. Given the insight that memory leaks are mostly non-functional\nbugs and fixing them might not change the behavior of an application, the\ntechnique is designed to proactively generate patches to fix memory leaks,\nwithout leak detection, which is often heavy and tedious. To generate effective\npatches, LeakPair follows the idea of pattern-based program repair since the\nautomated repair strategy shows successful results in many recent studies. We\nevaluate the technique on more than 20 open-source projects without using\nexplicit leak detection. The patches generated by our technique are also\nsubmitted to the projects as pull requests. The results show that LeakPair can\ngenerate effective patches to reduce memory consumption that are acceptable to\ndevelopers. In addition, we execute the test suites given by the projects after\napplying the patches, and it turns out that the patches do not cause any\nfunctionality breakage; this might imply that LeakPair can generate\nnon-intrusive patches for memory leaks.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:36:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shahoor","Arooba",""],["Khamit","Askar Yeltayuly",""],["Yi","Jooyong",""],["Kim","Dongsun",""]]}
{"id":"2308.08145","submitter":"Sumanta Sarkhel","authors":"L. Ram, D. Rout, R. Rathi, P. Withers, S. Sarkhel","title":"Martian M2 peak behaviour in the dayside near-terminator ionosphere\n  during ICMEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interplanetary coronal mass ejections (ICMEs) can pose significant\nimpacts on the Martian ionosphere, resulting in plasma depletion, variability,\nand escape to space. However, the connections between the ICMEs and the\nassociated responses of the dayside near-terminator Martian ionospheric M2 peak\nare not well understood. The present study primarily investigates the behaviour\nof the ionospheric peak density (Nm) and height (hm) during the passage of\nICMEs using observations from the Radio Occultation Science Experiment (ROSE)\naboard MAVEN spacecraft. We have selected 8 such ICMEs (during 2017-2022) at\nMars from the existing catalogs and studied the ROSE electron density profiles\nduring quiet and disturbed time (ICMEs) for identical solar zenith angle range.\nWe observed the elevation of the M2 peak (hm ~4-16 km) during disturbed time\n(ICMEs) with a decrease in Nm (0.41-2.8 * 10^10 m-3) in comparison to the quiet\ntime. The present study, for the first time, addressed the influence of ICMEs\non the M2 peak parameters (Nm and hm). We have proposed that the development of\nlarge vertical pressure gradient and electron temperature enhancement are\nplausible causes for ionospheric variability. Therefore, the present study\nprovides new insights to understand the peak plasma behaviour in the dayside\nnear-terminator ionosphere during ICMEs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:44:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ram","L.",""],["Rout","D.",""],["Rathi","R.",""],["Withers","P.",""],["Sarkhel","S.",""]]}
{"id":"2308.08146","submitter":"Amritanshu Prasad","authors":"Amrutha P, Amritanshu Prasad, Velmurugan S","title":"On the Existence of Elementwise Invariant Vectors in Representations of\n  Symmetric Groups","comments":"16 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine when a permutation with cycle type $\\mu$ admits a non-zero\ninvariant vector in the irreducible representation $V_\\lambda$ of the symmetric\ngroup. We find that a majority of pairs $(\\lambda,\\mu)$ have this property,\nwith only a few simple exceptions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:50:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["P","Amrutha",""],["Prasad","Amritanshu",""],["S","Velmurugan",""]]}
{"id":"2308.08147","submitter":"Man Luo","authors":"Srija Macherla, Man Luo, Mihir Parmar, Chitta Baral","title":"MDDial: A Multi-turn Differential Diagnosis Dialogue Dataset with\n  Reliability Evaluation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dialogue systems for Automatic Differential Diagnosis (ADD) have a wide range\nof real-life applications. These dialogue systems are promising for providing\neasy access and reducing medical costs. Building end-to-end ADD dialogue\nsystems requires dialogue training datasets. However, to the best of our\nknowledge, there is no publicly available ADD dialogue dataset in English\n(although non-English datasets exist). Driven by this, we introduce MDDial, the\nfirst differential diagnosis dialogue dataset in English which can aid to build\nand evaluate end-to-end ADD dialogue systems. Additionally, earlier studies\npresent the accuracy of diagnosis and symptoms either individually or as a\ncombined weighted score. This method overlooks the connection between the\nsymptoms and the diagnosis. We introduce a unified score for the ADD system\nthat takes into account the interplay between symptoms and diagnosis. This\nscore also indicates the system's reliability. To the end, we train two\nmoderate-size of language models on MDDial. Our experiments suggest that while\nthese language models can perform well on many natural language understanding\ntasks, including dialogue tasks in the general domain, they struggle to relate\nrelevant symptoms and disease and thus have poor performance on MDDial. MDDial\nwill be released publicly to aid the study of ADD dialogue research.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 04:56:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Macherla","Srija",""],["Luo","Man",""],["Parmar","Mihir",""],["Baral","Chitta",""]]}
{"id":"2308.08148","submitter":"Anpeng Wu","authors":"Anpeng Wu, Haoxuan Li, Kun Kuang, Keli Zhang, Fei Wu","title":"Hierarchical Topological Ordering with Conditional Independence Test for\n  Limited Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning directed acyclic graphs (DAGs) to identify causal relations\nunderlying observational data is crucial but also poses significant challenges.\nRecently, topology-based methods have emerged as a two-step approach to\ndiscovering DAGs by first learning the topological ordering of variables and\nthen eliminating redundant edges, while ensuring that the graph remains\nacyclic. However, one limitation is that these methods would generate numerous\nspurious edges that require subsequent pruning. To overcome this limitation, in\nthis paper, we propose an improvement to topology-based methods by introducing\nlimited time series data, consisting of only two cross-sectional records that\nneed not be adjacent in time and are subject to flexible timing. By\nincorporating conditional instrumental variables as exogenous interventions, we\naim to identify descendant nodes for each variable. Following this line, we\npropose a hierarchical topological ordering algorithm with conditional\nindependence test (HT-CIT), which enables the efficient learning of sparse DAGs\nwith a smaller search space compared to other popular approaches. The HT-CIT\nalgorithm greatly reduces the number of edges that need to be pruned. Empirical\nresults from synthetic and real-world datasets demonstrate the superiority of\nthe proposed HT-CIT algorithm.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:01:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wu","Anpeng",""],["Li","Haoxuan",""],["Kuang","Kun",""],["Zhang","Keli",""],["Wu","Fei",""]]}
{"id":"2308.08149","submitter":"Gang Li","authors":"Cong Hu, Xuefeng Zhang, Yunlong Su, and Gang Li","title":"Correlated flat bands in the paramagnetic phase of triangular\n  antiferromagnets Na$_2$BaX(PO$_4$)$_2$ (X = Mn, Co, Ni)","comments":"11 pages and 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Flat band systems in condensed matter physics are intriguing because they can\nexhibit exotic phases and unconventional properties. In this work, we studied\nthree correlated magnetic systems, Na$_2$BaX(PO$_4$)$_2$ (X = Mn, Co, Ni), and\nrevealed their unusual electronic structure and magnetic properties. Despite\ntheir different effective angular momentum, our first-principles calculations\nshowed a similar electronic structure among them. However, their different\nvalence configurations led to different responses to electronic correlations in\nthe high-temperature paramagnetic phase. Using the dynamical mean-field method,\nwe found that all systems can be understood as a multi-band Hubbard model with\nHund'ss coupling. Our calculations of spin susceptibility and the {\\it\nab-initio} estimation of magnetic exchange coupling indicated strong\nintra-plane antiferromagnetic coupling and weak inter-plane coupling in all\nsystems. The ground states of these systems are largely degenerate. It is\nlikely that none of these magnetic states would dominate over the others,\nleading to the possibility of quantum spin liquid states in these systems. Our\nwork unifies the understanding of these three structurally similar systems and\nopens new avenues for exploring correlated flat bands with distinct electronic\nand magnetic responses.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:04:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Cong",""],["Zhang","Xuefeng",""],["Su","Yunlong",""],["Li","Gang",""]]}
{"id":"2308.08150","submitter":"Sadhana Singh","authors":"Sadhana Singh, Jeewan C. Pandey, Vishal Joshi","title":"Polarimetric Approach Towards Membership Probability of Open Star\n  Cluster NGC 2345","comments":"6 pages, 2 figures, 2 tables. Accepted for publication in the\n  Bulletin of Li\\`ege Royal Society of Sciences as proceeding of the 3rd\n  Belgo-Indian Network for Astronomy and Astrophysics (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":"  Using the linear polarimetric observations, we present a method to derive the\nmembership probability of stars in cluster NGC 2345. The polarimetric\nobservations of cluster NGC 2345 are performed using the instrument ARIES\nIMaging POLarimeter (AIMPOL) mounted as a backend of the 104-cm telescope of\nARIES. Members of the cluster should exhibit comparable polarization since they\nare located nearly at the same distance. This concept is used to extract the\nmembership probability of known member stars of cluster NGC 2345. The\nmembership probability estimated using the polarimetric data for cluster NGC\n2345 agrees with the membership probability derived from the proper motion\nmethod in the previous studies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:31:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Singh","Sadhana",""],["Pandey","Jeewan C.",""],["Joshi","Vishal",""]]}
{"id":"2308.08151","submitter":"Rajashekhar Vachiravelu Saminathan","authors":"Rajashekhar V S, Debasish Ghose and Arockia Selvakumar Arockia Doss","title":"Optimal Kinematic Design of a Robotic Lizard using Four-Bar and Five-Bar\n  Mechanisms","comments":"21 pages, 10 figures, Submitted for iNaCoMM 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Designing a mechanism to mimic the motion of a common house gecko is the\nobjective of this work. The body of the robot is designed using four five-bar\nmechanisms (2-RRRRR and 2-RRPRR) and the leg is designed using four four-bar\nmechanisms. The 2-RRRRR five-bar mechanisms form the head and tail of the\nrobotic lizard. The 2-RRPRR five-bar mechanisms form the left and right sides\nof the body in the robotic lizard. The four five-bar mechanisms are actuated by\nonly four rotary actuators. Of these, two actuators control the head movements\nand the other two control the tail movements. The RRPRR five-bar mechanism is\ncontrolled by one actuator from the head five-bar mechanism and the other by\nthe tail five-bar mechanism. A tension spring connects each active link to a\nlink in the four bar mechanism. When the robot is actuated, the head, tail and\nthe body moves, and simultaneously each leg moves accordingly. This kind of\nactuation where the motion transfer occurs from body of the robot to the leg is\nthe novelty in our design. The dimensional synthesis of the robotic lizard is\ndone and presented. Then the forward and inverse kinematics of the mechanism,\nand configuration space singularities identification for the robot are\npresented. The gait exhibited by the gecko is studied and then simulated. A\ncomputer aided design of the robotic lizard is created and a prototype is made\nby 3D printing the parts. The prototype is controlled using Arduino UNO as a\nmicro-controller. The experimental results are finally presented based on the\ngait analysis that was done earlier. The forward walking, and turning motion\nare done and snapshots are presented.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:41:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["S","Rajashekhar V",""],["Ghose","Debasish",""],["Doss","Arockia Selvakumar Arockia",""]]}
{"id":"2308.08152","submitter":"Chen Wang","authors":"Shan Huang, Chen Wang, Yuan Yuan, Jinglong Zhao, Jingjing Zhang","title":"Estimating Effects of Long-Term Treatments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Estimating the effects of long-term treatments in A/B testing presents a\nsignificant challenge. Such treatments -- including updates to product\nfunctions, user interface designs, and recommendation algorithms -- are\nintended to remain in the system for a long period after their launches. On the\nother hand, given the constraints of conducting long-term experiments,\npractitioners often rely on short-term experimental results to make product\nlaunch decisions. It remains an open question how to accurately estimate the\neffects of long-term treatments using short-term experimental data. To address\nthis question, we introduce a longitudinal surrogate framework. We show that,\nunder standard assumptions, the effects of long-term treatments can be\ndecomposed into a series of functions, which depend on the user attributes, the\nshort-term intermediate metrics, and the treatment assignments. We describe the\nidentification assumptions, the estimation strategies, and the inference\ntechnique under this framework. Empirically, we show that our approach\noutperforms existing solutions by leveraging two real-world experiments, each\ninvolving millions of users on WeChat, one of the world's largest social\nnetworking platforms.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:42:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huang","Shan",""],["Wang","Chen",""],["Yuan","Yuan",""],["Zhao","Jinglong",""],["Zhang","Jingjing",""]]}
{"id":"2308.08153","submitter":"Daniela Noemi Rim","authors":"Daniela N. Rim, Kimera Richard, Heeyoul Choi","title":"Fast Training of NMT Model with Data Sorting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Transformer model has revolutionized Natural Language Processing tasks\nsuch as Neural Machine Translation, and many efforts have been made to study\nthe Transformer architecture, which increased its efficiency and accuracy. One\npotential area for improvement is to address the computation of empty tokens\nthat the Transformer computes only to discard them later, leading to an\nunnecessary computational burden. To tackle this, we propose an algorithm that\nsorts translation sentence pairs based on their length before batching,\nminimizing the waste of computing power. Since the amount of sorting could\nviolate the independent and identically distributed (i.i.d) data assumption, we\nsort the data partially. In experiments, we apply the proposed method to\nEnglish-Korean and English-Luganda language pairs for machine translation and\nshow that there are gains in computational time while maintaining the\nperformance. Our method is independent of architectures, so that it can be\neasily integrated into any training process with flexible data lengths.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:48:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rim","Daniela N.",""],["Richard","Kimera",""],["Choi","Heeyoul",""]]}
{"id":"2308.08154","submitter":"Tongda Xu","authors":"Tongda Xu, Qian Zhang, Yanghao Li, Dailan He, Zhe Wang, Yuanyuan Wang,\n  Hongwei Qin, Yan Wang, Jingjing Liu, Ya-Qin Zhang","title":"Conditional Perceptual Quality Preserving Image Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose conditional perceptual quality, an extension of the perceptual\nquality defined in \\citet{blau2018perception}, by conditioning it on user\ndefined information. Specifically, we extend the original perceptual quality\n$d(p_{X},p_{\\hat{X}})$ to the conditional perceptual quality\n$d(p_{X|Y},p_{\\hat{X}|Y})$, where $X$ is the original image, $\\hat{X}$ is the\nreconstructed, $Y$ is side information defined by user and $d(.,.)$ is\ndivergence. We show that conditional perceptual quality has similar theoretical\nproperties as rate-distortion-perception trade-off \\citep{blau2019rethinking}.\nBased on these theoretical results, we propose an optimal framework for\nconditional perceptual quality preserving compression. Experimental results\nshow that our codec successfully maintains high perceptual quality and semantic\nquality at all bitrate. Besides, by providing a lowerbound of common randomness\nrequired, we settle the previous arguments on whether randomness should be\nincorporated into generator for (conditional) perceptual quality compression.\nThe source code is provided in supplementary material.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:57:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Tongda",""],["Zhang","Qian",""],["Li","Yanghao",""],["He","Dailan",""],["Wang","Zhe",""],["Wang","Yuanyuan",""],["Qin","Hongwei",""],["Wang","Yan",""],["Liu","Jingjing",""],["Zhang","Ya-Qin",""]]}
{"id":"2308.08155","submitter":"Qingyun Wu","authors":"Qingyun Wu, Gagan Bansal, Jieyu Zhang, Yiran Wu, Shaokun Zhang, Erkang\n  Zhu, Beibin Li, Li Jiang, Xiaoyun Zhang, and Chi Wang","title":"AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation\n  Framework","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This technical report presents AutoGen, a new framework that enables\ndevelopment of LLM applications using multiple agents that can converse with\neach other to solve tasks. AutoGen agents are customizable, conversable, and\nseamlessly allow human participation. They can operate in various modes that\nemploy combinations of LLMs, human inputs, and tools. AutoGen's design offers\nmultiple advantages: a) it gracefully navigates the strong but imperfect\ngeneration and reasoning abilities of these LLMs; b) it leverages human\nunderstanding and intelligence, while providing valuable automation through\nconversations between agents; c) it simplifies and unifies the implementation\nof complex LLM workflows as automated agent chats. We provide many diverse\nexamples of how developers can easily use AutoGen to effectively solve tasks or\nbuild applications, ranging from coding, mathematics, operations research,\nentertainment, online decision-making, question answering, etc.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:57:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wu","Qingyun",""],["Bansal","Gagan",""],["Zhang","Jieyu",""],["Wu","Yiran",""],["Zhang","Shaokun",""],["Zhu","Erkang",""],["Li","Beibin",""],["Jiang","Li",""],["Zhang","Xiaoyun",""],["Wang","Chi",""]]}
{"id":"2308.08156","submitter":"Tiberiu Sosea","authors":"Tiberiu Sosea, Junyi Jessy Li, Cornelia Caragea","title":"Sarcasm Detection in a Disaster Context","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During natural disasters, people often use social media platforms such as\nTwitter to ask for help, to provide information about the disaster situation,\nor to express contempt about the unfolding event or public policies and\nguidelines. This contempt is in some cases expressed as sarcasm or irony.\nUnderstanding this form of speech in a disaster-centric context is essential to\nimproving natural language understanding of disaster-related tweets. In this\npaper, we introduce HurricaneSARC, a dataset of 15,000 tweets annotated for\nintended sarcasm, and provide a comprehensive investigation of sarcasm\ndetection using pre-trained language models. Our best model is able to obtain\nas much as 0.70 F1 on our dataset. We also demonstrate that the performance on\nHurricaneSARC can be improved by leveraging intermediate task transfer\nlearning. We release our data and code at\nhttps://github.com/tsosea2/HurricaneSarc.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:58:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sosea","Tiberiu",""],["Li","Junyi Jessy",""],["Caragea","Cornelia",""]]}
{"id":"2308.08157","submitter":"JooYeol Yun","authors":"Minho Park, Jooyeol Yun, Seunghwan Choi, Jaegul Choo","title":"Learning to Generate Semantic Layouts for Higher Text-Image\n  Correspondence in Text-to-Image Synthesis","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":"  Existing text-to-image generation approaches have set high standards for\nphotorealism and text-image correspondence, largely benefiting from web-scale\ntext-image datasets, which can include up to 5~billion pairs. However,\ntext-to-image generation models trained on domain-specific datasets, such as\nurban scenes, medical images, and faces, still suffer from low text-image\ncorrespondence due to the lack of text-image pairs. Additionally, collecting\nbillions of text-image pairs for a specific domain can be time-consuming and\ncostly. Thus, ensuring high text-image correspondence without relying on\nweb-scale text-image datasets remains a challenging task. In this paper, we\npresent a novel approach for enhancing text-image correspondence by leveraging\navailable semantic layouts. Specifically, we propose a Gaussian-categorical\ndiffusion process that simultaneously generates both images and corresponding\nlayout pairs. Our experiments reveal that we can guide text-to-image generation\nmodels to be aware of the semantics of different image regions, by training the\nmodel to generate semantic labels for each pixel. We demonstrate that our\napproach achieves higher text-image correspondence compared to existing\ntext-to-image generation approaches in the Multi-Modal CelebA-HQ and the\nCityscapes dataset, where text-image pairs are scarce. Codes are available in\nthis https://pmh9960.github.io/research/GCDP\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:59:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Park","Minho",""],["Yun","Jooyeol",""],["Choi","Seunghwan",""],["Choo","Jaegul",""]]}
{"id":"2308.08158","submitter":"Jialei Chen","authors":"Jialei Chen, Yuanbo Xu, Pengyang Wang, Yongjian Yang","title":"Deep Generative Imputation Model for Missing Not At Random Data","comments":null,"journal-ref":null,"doi":"10.1145/3583780.3614835","report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data analysis usually suffers from the Missing Not At Random (MNAR) problem,\nwhere the cause of the value missing is not fully observed. Compared to the\nnaive Missing Completely At Random (MCAR) problem, it is more in line with the\nrealistic scenario whereas more complex and challenging. Existing statistical\nmethods model the MNAR mechanism by different decomposition of the joint\ndistribution of the complete data and the missing mask. But we empirically find\nthat directly incorporating these statistical methods into deep generative\nmodels is sub-optimal. Specifically, it would neglect the confidence of the\nreconstructed mask during the MNAR imputation process, which leads to\ninsufficient information extraction and less-guaranteed imputation quality. In\nthis paper, we revisit the MNAR problem from a novel perspective that the\ncomplete data and missing mask are two modalities of incomplete data on an\nequal footing. Along with this line, we put forward a generative-model-specific\njoint probability decomposition method, conjunction model, to represent the\ndistributions of two modalities in parallel and extract sufficient information\nfrom both complete data and missing mask. Taking a step further, we exploit a\ndeep generative imputation model, namely GNR, to process the real-world missing\nmechanism in the latent space and concurrently impute the incomplete data and\nreconstruct the missing mask. The experimental results show that our GNR\nsurpasses state-of-the-art MNAR baselines with significant margins (averagely\nimproved from 9.9% to 18.8% in RMSE) and always gives a better mask\nreconstruction accuracy which makes the imputation more principle.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:01:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Jialei",""],["Xu","Yuanbo",""],["Wang","Pengyang",""],["Yang","Yongjian",""]]}
{"id":"2308.08159","submitter":"Zhiguo Ding","authors":"Zhiguo Ding","title":"Resolution of Near-Field Beamforming and Its Impact on NOMA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The resolution of near-field beamforming is an important metric to measure\nhow effectively users with different locations can be located. This letter\nidentifies the condition under which the resolution of near-field beamforming\nis not perfect. This imperfect resolution means that one user's near-field beam\ncan be still useful to other users, which motivates the application of\nnon-orthogonal multiple access (NOMA). Both the analytical and simulation\nresults are developed to demonstrate that those near-field beams preconfigured\nfor legacy users can indeed be used to effectively serve additional NOMA users,\nwhich improves the overall connectivity and system throughput.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:03:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ding","Zhiguo",""]]}
{"id":"2308.08160","submitter":"Brijesh Vora","authors":"Brijesh Vora, Kartik Patwari, Syed Mahbub Hafiz, Zubair Shafiq,\n  Chen-Nee Chuah","title":"Benchmarking Adversarial Robustness of Compressed Deep Learning Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The increasing size of Deep Neural Networks (DNNs) poses a pressing need for\nmodel compression, particularly when employed on resource constrained devices.\nConcurrently, the susceptibility of DNNs to adversarial attacks presents\nanother significant hurdle. Despite substantial research on both model\ncompression and adversarial robustness, their joint examination remains\nunderexplored. Our study bridges this gap, seeking to understand the effect of\nadversarial inputs crafted for base models on their pruned versions. To examine\nthis relationship, we have developed a comprehensive benchmark across diverse\nadversarial attacks and popular DNN models. We uniquely focus on models not\npreviously exposed to adversarial training and apply pruning schemes optimized\nfor accuracy and performance. Our findings reveal that while the benefits of\npruning enhanced generalizability, compression, and faster inference times are\npreserved, adversarial robustness remains comparable to the base model. This\nsuggests that model compression while offering its unique advantages, does not\nundermine adversarial robustness.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:06:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vora","Brijesh",""],["Patwari","Kartik",""],["Hafiz","Syed Mahbub",""],["Shafiq","Zubair",""],["Chuah","Chen-Nee",""]]}
{"id":"2308.08161","submitter":"Junhua Feng","authors":"M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, R. Aliberti, A.\n  Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I. Balossino, Y. Ban, V.\n  Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. Bertani, D. Bettoni, F.\n  Bianchi, E. Bianco, J. Bloms, A. Bortone, I. Boyko, R. A. Briere, A.\n  Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin,\n  J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C. Chen, Chao\n  Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen, X. R.\n  Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S. Cheng, S. K.\n  Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H. L. Dai, J.\n  P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I.\n  Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding,\n  J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, S. X. Du, Z. H. Duan, P. Egorov, Y.\n  L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y. Fang, R. Farinelli, L. Fava, F.\n  Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, K Fischer, M. Fritsch, C.\n  Fritzsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Y. N. Gao, Yang Gao, S.\n  Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A Gilman,\n  K. Goetzen, L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu,\n  Y. T. Gu, C. Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, M. J. Guo, R. P. Guo,\n  Y. P. Guo, A. Guskov, X. T. H., T. T. Han, W. Y. Han, X. Q. Hao, F. A.\n  Harris, K. K. He, K. L. He, F. H. H. Heinsius, C. H. Heinz, Y. K. Heng, C.\n  Herold, T. Holtmann, P. C. Hong, G. Y. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu,\n  J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, X. T. Huang,\n  Y. P. Huang, T. Hussain, N H\\\"usken, W. Imoehl, M. Irshad, J. Jackson, S.\n  Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L. Ji, Y. Y.\n  Ji, X. Q. Jia, Z. K. Jia, P. C. Jiang, S. S. Jiang, T. J. Jiang, X. S. Jiang,\n  Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, T. Johansson, X.\n  K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang, R. Kappert,\n  M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R. Kliemt, L. Koch, O. B.\n  Kolcu, B. Kopf, M. K. Kuessner, A. Kupsc, W. K\\\"uhn, J. J. Lane, J. S. Lange,\n  P. Larin, A. Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei, H. Leithoff, M.\n  Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, Cheng Li, D. M. Li, F. Li, G. Li,\n  H. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J. S. Li, J. W. Li, K.\n  L. Li, Ke Li, L. J Li, L. K. Li, Lei Li, M. H. Li, P. R. Li, Q. X. Li, S. X.\n  Li, T. Li, W. D. Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J.\n  Li, Z. X. Li, C. Liang, H. Liang, H. Liang, H. Liang, Y. F. Liang, Y. T.\n  Liang, G. R. Liao, L. Z. Liao, J. Libby, A. Limphirat, D. X. Lin, T. Lin, B.\n  J. Liu, B. X. Liu, C. Liu, C. X. Liu, D. Liu, F. H. Liu, Fang Liu, Feng Liu,\n  G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui Liu, J. B. Liu,\n  J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C. Liu, Lu Liu,\n  M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W. M. Liu, X.\n  Liu, Y. Liu, Y. Liu, Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu, H.\n  J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, M. X. Luo,\n  T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma, J. L. Ma, L. L.\n  Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma, Y. M. Ma, F. E.\n  Maas, M. Maggiora, S. Malde, A. Mangoni, Y. J. Mao, Z. P. Mao, S. Marcello,\n  Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E.\n  Mitchell, X. H. Mo, N. Yu. Muchnoi, Y. Nefedov, F. Nerling, I. B. Nikolaev,\n  Z. Ning, S. Nisar, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y.\n  Pan, A. Pathak, P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, K. Peters,\n  J. L. Ping, R. G. Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H. Qi, H.\n  R. Qi, M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q.\n  Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K.\n  J. Ren, A. Rivetti, V. Rodin, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N.\n  Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan,\n  W. Shan, X. Y. Shan, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F.\n  Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q.\n  Q. Shi, R. S. Shi, X. Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y.\n  X. Song, S. Sosio, S. Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H.\n  Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y.\n  Sun, Y. J. Sun, Y. Z. Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J.\n  Tang, Y. A. Tang, L. Y Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H.\n  Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, S. J. Wang, B. Wang, B. L.\n  Wang, Bo Wang, C. W. Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, J. P.\n  Wang, K. Wang, L. L. Wang, M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T.\n  J. Wang, W. Wang, W. Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L.\n  Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang,\n  Yaqian Wang, Yi Wang, Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D.\n  H. Wei, F. Weidner, S. P. Wen, C. W. Wenzel, U. 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":"Study of ee to eta phi at center-of-mass energies from 3.773 to 4.600\n  GeV","comments":"11 pages, 5(8) figures","journal-ref":null,"doi":null,"report-no":"about 4000","categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a study of the process ee to phi eta using data samples collected\nwith the BESIII detector corresponding to an integrated luminosity of 15.03\nfb$^{-1}$ at 23 center-of-mass energies from 3.773 to 4.600 GeV. The Born cross\nsections are measured at each energy and a coherent fit to cross-section\nlineshape is performed using a Breit-Wigner parametrization to search for\ncharmonium-like vector states. No significant signals of the $Y(4230)$ and\n$Y(4360)$ resonances are observed.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:08:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["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.08162","submitter":"Dawid Rymarczyk","authors":"Miko{\\l}aj Sacha, Bartosz Jura, Dawid Rymarczyk, {\\L}ukasz Struski,\n  Jacek Tabor, Bartosz Zieli\\'nski","title":"Interpretability Benchmark for Evaluating Spatial Misalignment of\n  Prototypical Parts Explanations","comments":"Under review. Code will be release upon acceptance","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prototypical parts-based networks are becoming increasingly popular due to\ntheir faithful self-explanations. However, their similarity maps are calculated\nin the penultimate network layer. Therefore, the receptive field of the\nprototype activation region often depends on parts of the image outside this\nregion, which can lead to misleading interpretations. We name this undesired\nbehavior a spatial explanation misalignment and introduce an interpretability\nbenchmark with a set of dedicated metrics for quantifying this phenomenon. In\naddition, we propose a method for misalignment compensation and apply it to\nexisting state-of-the-art models. We show the expressiveness of our benchmark\nand the effectiveness of the proposed compensation methodology through\nextensive empirical studies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:09:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sacha","Miko\u0142aj",""],["Jura","Bartosz",""],["Rymarczyk","Dawid",""],["Struski","\u0141ukasz",""],["Tabor","Jacek",""],["Zieli\u0144ski","Bartosz",""]]}
{"id":"2308.08163","submitter":"Kazuhisa Fujita Dr.","authors":"Kazuhisa Fujita","title":"Characteristics of networks generated by kernel growing neural gas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research aims to develop kernel GNG, a kernelized version of the growing\nneural gas (GNG) algorithm, and to investigate the features of the networks\ngenerated by the kernel GNG. The GNG is an unsupervised artificial neural\nnetwork that can transform a dataset into an undirected graph, thereby\nextracting the features of the dataset as a graph. The GNG is widely used in\nvector quantization, clustering, and 3D graphics. Kernel methods are often used\nto map a dataset to feature space, with support vector machines being the most\nprominent application. This paper introduces the kernel GNG approach and\nexplores the characteristics of the networks generated by kernel GNG. Five\nkernels, including Gaussian, Laplacian, Cauchy, inverse multiquadric, and log\nkernels, are used in this study. The results of this study show that the\naverage degree and the average clustering coefficient decrease as the kernel\nparameter increases for Gaussian, Laplacian, Cauchy, and IMQ kernels. If we\navoid more edges and a higher clustering coefficient (or more triangles), the\nkernel GNG with a larger value of the parameter will be more appropriate.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:11:27 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 14:43:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fujita","Kazuhisa",""]]}
{"id":"2308.08164","submitter":"Huqiang Cheng","authors":"Huqiang Cheng, Xiaofeng Liao, Huaqing Li and You Zhao","title":"Privacy-Preserving Push-Pull Method for Decentralized Optimization via\n  State Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Distributed optimization is manifesting great potential in multiple fields,\ne.g., machine learning, control, and resource allocation. Existing\ndecentralized optimization algorithms require sharing explicit state\ninformation among the agents, which raises the risk of private information\nleakage. To ensure privacy security, combining information security mechanisms,\nsuch as differential privacy and homomorphic encryption, with traditional\ndecentralized optimization algorithms is a commonly used means. However, this\nwould either sacrifice optimization accuracy or incur heavy computational\nburden. To overcome these shortcomings, we develop a novel privacy-preserving\ndecentralized optimization algorithm, called PPSD, that combines gradient\ntracking with a state decomposition mechanism. Specifically, each agent\ndecomposes its state associated with the gradient into two substates. One\nsubstate is used for interaction with neighboring agents, and the other\nsubstate containing private information acts only on the first substate and\nthus is entirely agnostic to other agents. For the strongly convex and smooth\nobjective functions, PPSD attains a $R$-linear convergence rate. Moreover, the\nalgorithm can preserve the agents' private information from being leaked to\nhonest-but-curious neighbors. Simulations further confirm the results.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:15:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cheng","Huqiang",""],["Liao","Xiaofeng",""],["Li","Huaqing",""],["Zhao","You",""]]}
{"id":"2308.08165","submitter":"Xiaoyun Li","authors":"Xinmeng Huang, Ping Li, Xiaoyun Li","title":"Stochastic Controlled Averaging for Federated Learning with\n  Communication Compression","comments":"45 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DC cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Communication compression, a technique aiming to reduce the information\nvolume to be transmitted over the air, has gained great interests in Federated\nLearning (FL) for the potential of alleviating its communication overhead.\nHowever, communication compression brings forth new challenges in FL due to the\ninterplay of compression-incurred information distortion and inherent\ncharacteristics of FL such as partial participation and data heterogeneity.\nDespite the recent development, the performance of compressed FL approaches has\nnot been fully exploited. The existing approaches either cannot accommodate\narbitrary data heterogeneity or partial participation, or require stringent\nconditions on compression.\n  In this paper, we revisit the seminal stochastic controlled averaging method\nby proposing an equivalent but more efficient/simplified formulation with\nhalved uplink communication costs. Building upon this implementation, we\npropose two compressed FL algorithms, SCALLION and SCAFCOM, to support unbiased\nand biased compression, respectively. Both the proposed methods outperform the\nexisting compressed FL methods in terms of communication and computation\ncomplexities. Moreover, SCALLION and SCAFCOM accommodates arbitrary data\nheterogeneity and do not make any additional assumptions on compression errors.\nExperiments show that SCALLION and SCAFCOM can match the performance of\ncorresponding full-precision FL approaches with substantially reduced uplink\ncommunication, and outperform recent compressed FL methods under the same\ncommunication budget.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:35:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Xinmeng",""],["Li","Ping",""],["Li","Xiaoyun",""]]}
{"id":"2308.08166","submitter":"T. Karthick","authors":"Arnab Char, T. Karthick","title":"On graphs with no induced $P_5$ or $K_5-e$","comments":"This paper is dedicated to the memory of Professor Frederic Maffray\n  on his death anniversary","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we are interested in some problems related to chromatic number\nand clique number for the class of $(P_5,K_5-e)$-free graphs, and prove the\nfollowing. $(a)$ If $G$ is a connected ($P_5,K_5-e$)-free graph with\n$\\omega(G)\\geq 7$, then either $G$ is the complement of a bipartite graph or\n$G$ has a clique cut-set. Moreover, there is a connected ($P_5,K_5-e$)-free\nimperfect graph $H$ with $\\omega(H)=6$ and has no clique cut-set. This\nstrengthens a result of Malyshev and Lobanova [Disc. Appl. Math. 219 (2017)\n158--166]. $(b)$ If $G$ is a ($P_5,K_5-e$)-free graph with $\\omega(G)\\geq 4$,\nthen $\\chi(G)\\leq \\max\\{7, \\omega(G)\\}$. Moreover, the bound is tight when\n$\\omega(G)\\notin \\{4,5,6\\}$. This result together with known results partially\nanswers a question of Ju and Huang [arXiv:2303.18003 [math.CO] 2023], and also\nimproves a result of Xu [Manuscript 2022].\n  While the \"Chromatic Number Problem\" is known to be $NP$-hard for the class\nof $P_5$-free graphs, our results together with some known results imply that\nthe \"Chromatic Number Problem\" can be solved in polynomial time for the class\nof ($P_5,K_5-e$)-free graphs which may be independent interest.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:38:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Char","Arnab",""],["Karthick","T.",""]]}
{"id":"2308.08167","submitter":"Ragesh Jaiswal","authors":"Ragesh Jaiswal","title":"A Quantum Approximation Scheme for k-Means","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a quantum approximation scheme (i.e., $(1 +\n\\varepsilon)$-approximation for every $\\varepsilon > 0$) for the classical\n$k$-means clustering problem in the QRAM model with a running time that has\nonly polylogarithmic dependence on the number of data points. More\nspecifically, given a dataset $V$ with $N$ points in $\\mathbb{R}^d$ stored in\nQRAM data structure, our quantum algorithm runs in time $\\tilde{O} \\left(\n2^{\\tilde{O}(\\frac{k}{\\varepsilon})} \\eta^2 d\\right)$ and with high probability\noutputs a set $C$ of $k$ centers such that $cost(V, C) \\leq (1+\\varepsilon)\n\\cdot cost(V, C_{OPT})$. Here $C_{OPT}$ denotes the optimal $k$-centers,\n$cost(.)$ denotes the standard $k$-means cost function (i.e., the sum of the\nsquared distance of points to the closest center), and $\\eta$ is the aspect\nratio (i.e., the ratio of maximum distance to minimum distance). This is the\nfirst quantum algorithm with a polylogarithmic running time that gives a\nprovable approximation guarantee of $(1+\\varepsilon)$ for the $k$-means\nproblem. Also, unlike previous works on unsupervised learning, our quantum\nalgorithm does not require quantum linear algebra subroutines and has a running\ntime independent of parameters (e.g., condition number) that appear in such\nprocedures.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:46:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jaiswal","Ragesh",""]]}
{"id":"2308.08168","submitter":"Nils Wilken","authors":"Nils Wilken, Christoph Knieke, Eric Nyakam, Andreas Rausch, Christian\n  Schindler, Christian Bartelt and Nikolaus Ziebura","title":"Emergent Software Service Platform and its Application in a Smart\n  Mobility Setting","comments":"This paper was presented on The Fifteenth International Conference on\n  Adaptive and Self-Adaptive Systems and Applications (ADAPTIVE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development dynamics of digital innovations for industry, business, and\nsociety are producing complex system conglomerates that can no longer be\ndesigned centrally and hierarchically in classic development processes.\nInstead, systems are evolving in DevOps processes in which heterogeneous actors\nact together on an open platform. Influencing and controlling such dynamically\nand autonomously changing system landscapes is currently a major challenge and\na fundamental interest of service users and providers, as well as operators of\nthe platform infrastructures. In this paper, we propose an architecture for\nsuch an emergent software service platform. A software platform that implements\nthis architecture with the underlying engineering methodology is demonstrated\nby a smart parking lot scenario.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:51:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wilken","Nils",""],["Knieke","Christoph",""],["Nyakam","Eric",""],["Rausch","Andreas",""],["Schindler","Christian",""],["Bartelt","Christian",""],["Ziebura","Nikolaus",""]]}
{"id":"2308.08169","submitter":"Jianguo Zhang","authors":"Jianguo Zhang and Stephen Roller and Kun Qian and Zhiwei Liu and Rui\n  Meng and Shelby Heinecke and Huan Wang and Silvio Savarese and Caiming Xiong","title":"Enhancing Performance on Seen and Unseen Dialogue Scenarios using\n  Retrieval-Augmented End-to-End Task-Oriented System","comments":"Accepted by SIGDIAL 2023 as a long paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  End-to-end task-oriented dialogue (TOD) systems have achieved promising\nperformance by leveraging sophisticated natural language understanding and\nnatural language generation capabilities of pre-trained models. This work\nenables the TOD systems with more flexibility through a simple cache. The cache\nprovides the flexibility to dynamically update the TOD systems and handle both\nexisting and unseen dialogue scenarios. Towards this end, we first fine-tune a\nretrieval module to effectively retrieve the most relevant information entries\nfrom the cache. We then train end-to-end TOD models that can refer to and\nground on both dialogue history and retrieved information during TOD\ngeneration. The cache is straightforward to construct, and the backbone models\nof TOD systems are compatible with existing pre-trained generative models.\nExtensive experiments demonstrate the superior performance of our framework,\nwith a notable improvement in non-empty joint goal accuracy by 6.7% compared to\nstrong baselines.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:52:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Jianguo",""],["Roller","Stephen",""],["Qian","Kun",""],["Liu","Zhiwei",""],["Meng","Rui",""],["Heinecke","Shelby",""],["Wang","Huan",""],["Savarese","Silvio",""],["Xiong","Caiming",""]]}
{"id":"2308.08170","submitter":"Dibakar Das","authors":"Dibakar Das, Shiva Kumar Malapaka, Jyotsna Bapat, Debabrata Das","title":"Network Centralities in Quantum Entanglement Distribution due to User\n  Preferences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum networks are of great interest of late which apply quantum mechanics\nto transfer information securely. One of the key properties which are exploited\nis entanglement to transfer information from one network node to another.\nApplications like quantum teleportation rely on the entanglement between the\nconcerned nodes. Thus, efficient entanglement distribution among network nodes\nis of utmost importance. Several entanglement distribution methods have been\nproposed in the literature which primarily rely on attributes, such as,\nfidelities, link layer network topologies, proactive distribution, etc. This\npaper studies the centralities of the network when the link layer topology of\nentanglements (referred to as entangled graph) is driven by usage patterns of\npeer-to-peer connections between remote nodes (referred to as connection graph)\nwith different characteristics. Three different distributions (uniform,\ngaussian, and power law) are considered for the connection graph where the two\nnodes are selected from the same distribution. For the entangled graph, both\nreactive and proactive entanglements are employed to form a random graph.\nResults show that the edge centralities (measured as usage frequencies of\nindividual edges during entanglement distribution) of the entangled graph\nfollow power law distributions whereas the growth in entanglements with\nconnections and node centralities (degrees of nodes) are monomolecularly\ndistributed for most of the scenarios. These findings will help in quantum\nresource management, e.g., quantum technology with high reliability and lower\ndecoherence time may be allocated to edges with high centralities.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:00:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Das","Dibakar",""],["Malapaka","Shiva Kumar",""],["Bapat","Jyotsna",""],["Das","Debabrata",""]]}
{"id":"2308.08171","submitter":"Tianhao Liu","authors":"Tianhao Liu, Shanwen Pu, Dongdong Ge, Yinyu Ye","title":"Learning to Pivot as a Smart Expert","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear programming has been practically solved mainly by simplex and interior\npoint methods. Compared with the weakly polynomial complexity obtained by the\ninterior point methods, the existence of strongly polynomial bounds for the\nlength of the pivot path generated by the simplex methods remains a mystery. In\nthis paper, we propose two novel pivot experts that leverage both global and\nlocal information of the linear programming instances for the primal simplex\nmethod and show their excellent performance numerically. The experts can be\nregarded as a benchmark to evaluate the performance of classical pivot rules,\nalthough they are hard to directly implement. To tackle this challenge, we\nemploy a graph convolutional neural network model, trained via imitation\nlearning, to mimic the behavior of the pivot expert. Our pivot rule, learned\nempirically, displays a significant advantage over conventional methods in\nvarious linear programming problems, as demonstrated through a series of\nrigorous experiments.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:00:51 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 15:26:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Liu","Tianhao",""],["Pu","Shanwen",""],["Ge","Dongdong",""],["Ye","Yinyu",""]]}
{"id":"2308.08172","submitter":"Zhiyu Ma","authors":"Zhiyu Ma, Chen Li, Tianming Du, Le Zhang, Dechao Tang, Deguo Ma,\n  Shanchuan Huang, Yan Liu, Yihao Sun, Zhihao Chen, Jin Yuan, Qianqing Nie,\n  Marcin Grzegorzek, Hongzan Sun","title":"AATCT-IDS: A Benchmark Abdominal Adipose Tissue CT Image Dataset for\n  Image Denoising, Semantic Segmentation, and Radiomics Evaluation","comments":"17 pages, 7 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":"  Methods: In this study, a benchmark \\emph{Abdominal Adipose Tissue CT Image\nDataset} (AATTCT-IDS) containing 300 subjects is prepared and published.\nAATTCT-IDS publics 13,732 raw CT slices, and the researchers individually\nannotate the subcutaneous and visceral adipose tissue regions of 3,213 of those\nslices that have the same slice distance to validate denoising methods, train\nsemantic segmentation models, and study radiomics. For different tasks, this\npaper compares and analyzes the performance of various methods on AATTCT-IDS by\ncombining the visualization results and evaluation data. Thus, verify the\nresearch potential of this data set in the above three types of tasks.\n  Results: In the comparative study of image denoising, algorithms using a\nsmoothing strategy suppress mixed noise at the expense of image details and\nobtain better evaluation data. Methods such as BM3D preserve the original image\nstructure better, although the evaluation data are slightly lower. The results\nshow significant differences among them. In the comparative study of semantic\nsegmentation of abdominal adipose tissue, the segmentation results of adipose\ntissue by each model show different structural characteristics. Among them,\nBiSeNet obtains segmentation results only slightly inferior to U-Net with the\nshortest training time and effectively separates small and isolated adipose\ntissue. In addition, the radiomics study based on AATTCT-IDS reveals three\nadipose distributions in the subject population.\n  Conclusion: AATTCT-IDS contains the ground truth of adipose tissue regions in\nabdominal CT slices. This open-source dataset can attract researchers to\nexplore the multi-dimensional characteristics of abdominal adipose tissue and\nthus help physicians and patients in clinical practice. AATCT-IDS is freely\npublished for non-commercial purpose at:\n\\url{https://figshare.com/articles/dataset/AATTCT-IDS/23807256}.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:02:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ma","Zhiyu",""],["Li","Chen",""],["Du","Tianming",""],["Zhang","Le",""],["Tang","Dechao",""],["Ma","Deguo",""],["Huang","Shanchuan",""],["Liu","Yan",""],["Sun","Yihao",""],["Chen","Zhihao",""],["Yuan","Jin",""],["Nie","Qianqing",""],["Grzegorzek","Marcin",""],["Sun","Hongzan",""]]}
{"id":"2308.08173","submitter":"Francesco Campi","authors":"Francesco Campi, Lukas Gosch, Tom Wollschl\\\"ager, Yan Scholten,\n  Stephan G\\\"unnemann","title":"Expressivity of Graph Neural Networks Through the Lens of Adversarial\n  Robustness","comments":"Published in ${2}^{nd}$ AdvML Frontiers workshop at ${40}^{th}$\n  International Conference on Machine Learning","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform the first adversarial robustness study into Graph Neural Networks\n(GNNs) that are provably more powerful than traditional Message Passing Neural\nNetworks (MPNNs). In particular, we use adversarial robustness as a tool to\nuncover a significant gap between their theoretically possible and empirically\nachieved expressive power. To do so, we focus on the ability of GNNs to count\nspecific subgraph patterns, which is an established measure of expressivity,\nand extend the concept of adversarial robustness to this task. Based on this,\nwe develop efficient adversarial attacks for subgraph counting and show that\nmore powerful GNNs fail to generalize even to small perturbations to the\ngraph's structure. Expanding on this, we show that such architectures also fail\nto count substructures on out-of-distribution graphs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:05:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Campi","Francesco",""],["Gosch","Lukas",""],["Wollschl\u00e4ger","Tom",""],["Scholten","Yan",""],["G\u00fcnnemann","Stephan",""]]}
{"id":"2308.08174","submitter":"Zhihui Zhang","authors":"Shuwen Lu, Zhihui Zhang, Cong Guo, Jingwen Leng, Yangjie Zhou, Minyi\n  Guo","title":"Accelerating Generic Graph Neural Networks via Architecture, Compiler,\n  Partition Method Co-Design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph neural networks (GNNs) have shown significant accuracy improvements in\na variety of graph learning domains, sparking considerable research interest.\nTo translate these accuracy improvements into practical applications, it is\nessential to develop high-performance and efficient hardware acceleration for\nGNN models. However, designing GNN accelerators faces two fundamental\nchallenges: the high bandwidth requirement of GNN models and the diversity of\nGNN models. Previous works have addressed the first challenge by using more\nexpensive memory interfaces to achieve higher bandwidth. For the second\nchallenge, existing works either support specific GNN models or have generic\ndesigns with poor hardware utilization.\n  In this work, we tackle both challenges simultaneously. First, we identify a\nnew type of partition-level operator fusion, which we utilize to internally\nreduce the high bandwidth requirement of GNNs. Next, we introduce\npartition-level multi-threading to schedule the concurrent processing of graph\npartitions, utilizing different hardware resources. To further reduce the extra\non-chip memory required by multi-threading, we propose fine-grained graph\npartitioning to generate denser graph partitions. Importantly, these three\nmethods make no assumptions about the targeted GNN models, addressing the\nchallenge of model variety. We implement these methods in a framework called\nSwitchBlade, consisting of a compiler, a graph partitioner, and a hardware\naccelerator. Our evaluation demonstrates that SwitchBlade achieves an average\nspeedup of $1.85\\times$ and energy savings of $19.03\\times$ compared to the\nNVIDIA V100 GPU. Additionally, SwitchBlade delivers performance comparable to\nstate-of-the-art specialized accelerators.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:05:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lu","Shuwen",""],["Zhang","Zhihui",""],["Guo","Cong",""],["Leng","Jingwen",""],["Zhou","Yangjie",""],["Guo","Minyi",""]]}
{"id":"2308.08175","submitter":"Shuichi Iwakiri","authors":"Shuichi Iwakiri, Jakob Miller, Florian Lang, Jakob Prettenthaler,\n  Takashi Taniguchi, Kenji Watanabe, Sung Sik Lee, Pascal Becker, Detlef\n  G\\\"unther, Thomas Ihn, Klaus Ensslin","title":"High mobility transport in isotopically-enriched $^{12}$C and $^{13}$C\n  exfoliated graphene","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graphene quantum dots are promising candidates for qubits due to weak\nspin-orbit and hyperfine interactions. The hyperfine interaction, controllable\nvia isotopic purification, could be the key to further improving the coherence.\nHere, we use isotopically enriched graphite crystals of both $^{12}$C and\n$^{13}$C grown by high-pressure-high-temperature method to exfoliate graphene\nlayers. We fabricated Hall bar devices and performed quantum transport\nmeasurements, revealing mobilities exceeding $10^{5}$$\\textrm{cm}^{2}/Vs$ and a\nlong mean free path of microns, which are as high as natural graphene.\nShubnikov-de Haas oscillations, quantum Hall effect up to the filling factor of\none, and Brown-Zak oscillations due to the alignment of hBN and graphene are\nobserved thanks to the high mobility. These results constitute a material\nplatform for physics and engineering of isotopically-enriched graphene qubits.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:11:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Iwakiri","Shuichi",""],["Miller","Jakob",""],["Lang","Florian",""],["Prettenthaler","Jakob",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Lee","Sung Sik",""],["Becker","Pascal",""],["G\u00fcnther","Detlef",""],["Ihn","Thomas",""],["Ensslin","Klaus",""]]}
{"id":"2308.08176","submitter":"Qi Lv","authors":"Siqi Song, Qi Lv, Lei Geng, Ziqiang Cao, and Guohong Fu","title":"RSpell: Retrieval-augmented Framework for Domain Adaptive Chinese\n  Spelling Check","comments":null,"journal-ref":"NLPCC 2023","doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chinese Spelling Check (CSC) refers to the detection and correction of\nspelling errors in Chinese texts. In practical application scenarios, it is\nimportant to make CSC models have the ability to correct errors across\ndifferent domains. In this paper, we propose a retrieval-augmented spelling\ncheck framework called RSpell, which searches corresponding domain terms and\nincorporates them into CSC models. Specifically, we employ pinyin fuzzy\nmatching to search for terms, which are combined with the input and fed into\nthe CSC model. Then, we introduce an adaptive process control mechanism to\ndynamically adjust the impact of external knowledge on the model. Additionally,\nwe develop an iterative strategy for the RSpell framework to enhance reasoning\ncapabilities. We conducted experiments on CSC datasets in three domains: law,\nmedicine, and official document writing. The results demonstrate that RSpell\nachieves state-of-the-art performance in both zero-shot and fine-tuning\nscenarios, demonstrating the effectiveness of the retrieval-augmented CSC\nframework. Our code is available at https://github.com/47777777/Rspell.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:12:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Song","Siqi",""],["Lv","Qi",""],["Geng","Lei",""],["Cao","Ziqiang",""],["Fu","Guohong",""]]}
{"id":"2308.08177","submitter":"Haotian Shi","authors":"Tianyi Chen, Haotian Shi, Steven T. Parker, Glenn Vorhes, David A\n  Noyce, Bin Ran","title":"Developing a Conceptual Tribal Crash Safety Dashboard: Data-Driven\n  Strategies for Identifying High-Risk Areas and Enhancing Tribal Safety\n  Programs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tribal lands in the United States have consistently exhibited higher crash\nrates and injury severities compared to other regions. To address this issue,\neffective data-driven safety analysis methods are essential for resource\nallocation and tribal safety program development. This study outlines the\nminimum data requirements and presents a generic tribal crash dashboard\nprototype to enable feasible and reproducible tribal crash analysis. The\ndashboard offers statistical performance measurement techniques, tracks tribal\nsafety trends using various indicators, and updates in with incoming data,\nmaking it adaptable for any state. Specifically, the dashboard's capabilities\nare showcased using Wisconsin tribal crash data, locating high-risk tribal land\nareas while analyzing and comparing statewide crashes and tribal crashes based\non severity. The results reveal that tribal land roads, particularly rural\nones, are more dangerous than those in other Wisconsin areas. The dashboard\nalso examines crash types to uncover the causes and insights behind Wisconsin\ntribal crashes. Demonstrating this dashboard concept reveals its potential to\nfacilitate a more intuitive understanding of tribal crashes from a statistical\nstandpoint, thereby enabling more effective applications of available data\nsources and the development of targeted safety countermeasures.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:14:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Tianyi",""],["Shi","Haotian",""],["Parker","Steven T.",""],["Vorhes","Glenn",""],["Noyce","David A",""],["Ran","Bin",""]]}
{"id":"2308.08178","submitter":"Hirotaka Kiyohara","authors":"Hirotaka Kiyohara","title":"Minimal null scrolls in the three-dimensional Heisenberg group","comments":"28 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the three-dimensional Heisenberg group equipped with a certain left\ninvariant Lorentzian metric, timelike minimal surfaces which have the\nAbresch-Rosenberg differentials with vanishing multiplication of the\ncoefficient function and its para-complex conjugate are characterized as the\nsurfaces defined by the multiplication of null curves and affine null lines.\nMoreover, the constructions of these surfaces with prescribed curvatures of\nnull curves or prescribed null lines are given.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:14:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kiyohara","Hirotaka",""]]}
{"id":"2308.08179","submitter":"Haotian Shi","authors":"Qinghui Nie, Jishun Ou, Haiyang Zhang, Jiawei Lu, Shen Li, Haotian Shi","title":"A Robust Integrated Multi-Strategy Bus Control System via Deep\n  Reinforcement Learning","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":"  An efficient urban bus control system has the potential to significantly\nreduce travel delays and streamline the allocation of transportation resources,\nthereby offering enhanced and user-friendly transit services to passengers.\nHowever, bus operation efficiency can be impacted by bus bunching. This problem\nis notably exacerbated when the bus system operates along a signalized corridor\nwith unpredictable travel demand. To mitigate this challenge, we introduce a\nmulti-strategy fusion approach for the longitudinal control of connected and\nautomated buses. The approach is driven by a physics-informed deep\nreinforcement learning (DRL) algorithm and takes into account a variety of\ntraffic conditions along urban signalized corridors. Taking advantage of\nconnected and autonomous vehicle (CAV) technology, the proposed approach can\nleverage real-time information regarding bus operating conditions and road\ntraffic environment. By integrating the aforementioned information into the\nDRL-based bus control framework, our designed physics-informed DRL state fusion\napproach and reward function efficiently embed prior physics and leverage the\nmerits of equilibrium and consensus concepts from control theory. This\nintegration enables the framework to learn and adapt multiple control\nstrategies to effectively manage complex traffic conditions and fluctuating\npassenger demands. Three control variables, i.e., dwell time at stops, speed\nbetween stations, and signal priority, are formulated to minimize travel\nduration and ensure bus stability with the aim of avoiding bus bunching. We\npresent simulation results to validate the effectiveness of the proposed\napproach, underlining its superior performance when subjected to sensitivity\nanalysis, specifically considering factors such as traffic volume, desired\nspeed, and traffic signal conditions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:16:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nie","Qinghui",""],["Ou","Jishun",""],["Zhang","Haiyang",""],["Lu","Jiawei",""],["Li","Shen",""],["Shi","Haotian",""]]}
{"id":"2308.08180","submitter":"Bhabani Prasad Mandal Prof.","authors":"Mohammad Umar, Vibhav Narayan Singh, Mohammad Hasan, Bhabani Prasad\n  Mandal","title":"Quantum tunneling from a new type of Unified Cantor Potential","comments":"23 Pages, 11 captioned figs","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new type of potential system that combines the families of\ngeneral Cantor (fractal system) and general Smith-Volterra-Cantor (non-fractal\nsystem) potentials. We call this system as Unified Cantor Potential (UCP)\nsystem. The UCP system of total span $L$ is characterized by scaling parameter\n$\\rho >1$, stage $G$ and two real numbers $\\alpha$ and $\\beta$. For $\\alpha=1$,\n$\\beta=0$, the UCP system represents general Cantor potential while for\n$\\alpha=0$, $\\beta=1$, this system represent general Smith-Volterra-Cantor\n(SVC) potential. We provide close-form expression of transmission probability\nfrom UCP system for arbitrary $\\alpha$ and $\\beta$ by using $q$-Pochhammer\nsymbol. Several new features of scattering are reported for this system. The\ntransmission probability $T_{G}(k)$ shows a scaling behavior with $k$ which is\nderived analytically for this potential. The proposed system also opens up the\npossibility for further generalization of new potential systems that encompass\na large class of fractal and non-fractal systems. The analytical formulation of\ntunneling from this system would help to study the transmission feature at\nbreaking threshold when a system transit from fractal to non-fractal domain.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:20:20 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Umar","Mohammad",""],["Singh","Vibhav Narayan",""],["Hasan","Mohammad",""],["Mandal","Bhabani Prasad",""]]}
{"id":"2308.08181","submitter":"Jie Li","authors":"Mengjie Du and Xiang Fang and Jie Li","title":"ChinaTelecom System Description to VoxCeleb Speaker Recognition\n  Challenge 2023","comments":"System description of VoxSRC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This technical report describes ChinaTelecom system for Track 1 (closed) of\nthe VoxCeleb2023 Speaker Recognition Challenge (VoxSRC 2023). Our system\nconsists of several ResNet variants trained only on VoxCeleb2, which were fused\nfor better performance later. Score calibration was also applied for each\nvariant and the fused system. The final submission achieved minDCF of 0.1066\nand EER of 1.980%.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:21:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Du","Mengjie",""],["Fang","Xiang",""],["Li","Jie",""]]}
{"id":"2308.08182","submitter":"Wenzhang Zhou","authors":"Wenzhang Zhou, Heng Fan, Tiejian Luo, Libo Zhang","title":"Unsupervised Domain Adaptive Detection with Network Stability Analysis","comments":null,"journal-ref":"ICCV,2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain adaptive detection aims to improve the generality of a detector,\nlearned from the labeled source domain, on the unlabeled target domain. In this\nwork, drawing inspiration from the concept of stability from the control theory\nthat a robust system requires to remain consistent both externally and\ninternally regardless of disturbances, we propose a novel framework that\nachieves unsupervised domain adaptive detection through stability analysis. In\nspecific, we treat discrepancies between images and regions from different\ndomains as disturbances, and introduce a novel simple but effective Network\nStability Analysis (NSA) framework that considers various disturbances for\ndomain adaptation. Particularly, we explore three types of perturbations\nincluding heavy and light image-level disturbances and instancelevel\ndisturbance. For each type, NSA performs external consistency analysis on the\noutputs from raw and perturbed images and/or internal consistency analysis on\ntheir features, using teacher-student models. By integrating NSA into Faster\nR-CNN, we immediately achieve state-of-the-art results. In particular, we set a\nnew record of 52.7% mAP on Cityscapes-to-FoggyCityscapes, showing the potential\nof NSA for domain adaptive detection. It is worth noticing, our NSA is designed\nfor general purpose, and thus applicable to one-stage detection model (e.g.,\nFCOS) besides the adopted one, as shown by experiments.\nhttps://github.com/tiankongzhang/NSA.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:21:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhou","Wenzhang",""],["Fan","Heng",""],["Luo","Tiejian",""],["Zhang","Libo",""]]}
{"id":"2308.08183","submitter":"Kei Noba","authors":"Kei Noba, Jos\\'e Luis P\\'erez and Kazutoshi Yamazaki","title":"Refraction strategies in stochastic control: optimality for a general\n  L\\'evy process model","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit an absolutely-continuous version of the stochastic control problem\ndriven by a L\\'evy process. A strategy must be absolutely continuous with\nrespect to the Lebesgue measure and the running cost function is assumed to be\nconvex. We show the optimality of a refraction strategy, which adjusts the\ndrift of the state process at a constant rate whenever it surpasses a certain\nthreshold. The optimality holds for a general L\\'evy process, generalizing the\nspectrally negative case presented in Hern\\'andez-Hern\\'andez et al.(2016).\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:29:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Noba","Kei",""],["P\u00e9rez","Jos\u00e9 Luis",""],["Yamazaki","Kazutoshi",""]]}
{"id":"2308.08184","submitter":"Tsviatko Rangelov","authors":"Tsviatko V. Rangelov, Petia S. Dineva, George D. Manolis","title":"A dynamic Green's function for the homogeneous viscoelastic and\n  isotropic half-space","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A dynamic 3D Green's function for the homogeneous, isotropic and viscoelastic\n(of the Zener type) half-space is derived in a closed form. The results\nobtained here can be used as either stand-alone solutions for simple problems\nor in conjunction with a boundary integral equation formulations to account for\ncomplex boundary conditions. In the later case, mesh-reducing boundary element\nformulations can be constructed as an alternative method for numerical\nimplementation purposes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:31:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rangelov","Tsviatko V.",""],["Dineva","Petia S.",""],["Manolis","George D.",""]]}
{"id":"2308.08185","submitter":"Fuwang Dong","authors":"Fuwang Dong, Fan Liu, Yuanhao Cui, Shihang Lu, Yunxin Li","title":"Sensing as a Service in 6G Perceptive Mobile Networks: Architecture,\n  Advances, and the Road Ahead","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sensing-as-a-service is anticipated to be the core feature of 6G perceptive\nmobile networks (PMN), where high-precision real-time sensing will become an\ninherent capability rather than being an auxiliary function as before. With the\nproliferation of wireless connected devices, resource allocation in terms of\nthe users' specific quality-of-service (QoS) requirements plays a pivotal role\nto enhance the interference management ability and resource utilization\nefficiency. In this article, we comprehensively introduce the concept of\nsensing service in PMN, including the types of tasks, the\ndistinctions/advantages compared to conventional networks, and the definitions\nof sensing QoS. Subsequently, we provide a unified RA framework in\nsensing-centric PMN and elaborate on the unique challenges. Furthermore, we\npresent a typical case study named \"communication-assisted sensing\" and\nevaluate the performance trade-off between sensing and communication procedure.\nFinally, we shed light on several open problems and opportunities deserving\nfurther investigation in the future.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:36:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dong","Fuwang",""],["Liu","Fan",""],["Cui","Yuanhao",""],["Lu","Shihang",""],["Li","Yunxin",""]]}
{"id":"2308.08186","submitter":"Hidetaka Manabe","authors":"Hidetaka Manabe, Yasunari Suzuki, Andrew S. Darmawan","title":"Efficient Simulation of Leakage Errors in Quantum Error Correcting Codes\n  Using Tensor Network Methods","comments":"14 pages, 12 figures","journal-ref":null,"doi":null,"report-no":"YITP-23-102","categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Leakage errors, in which a qubit is excited to a level outside the qubit\nsubspace, represent a significant obstacle in the development of robust quantum\ncomputers. We present a computationally efficient simulation methodology for\nstudying leakage errors in quantum error correcting codes (QECCs) using tensor\nnetwork methods, specifically Matrix Product States (MPS). Our approach enables\nthe simulation of various leakage processes, including thermal noise and\ncoherent errors, without approximations (such as the Pauli twirling\napproximation) that can lead to errors in the estimation of the logical error\nrate. We apply our method to two QECCs: the one-dimensional (1D) repetition\ncode and a thin $3\\times d$ surface code. By leveraging the small amount of\nentanglement generated during the error correction process, we are able to\nstudy large systems, up to a few hundred qudits, over many code cycles. We\nconsider a realistic noise model of leakage relevant to superconducting qubits\nto evaluate code performance and a variety of leakage removal strategies. Our\nnumerical results suggest that appropriate leakage removal is crucial,\nespecially when the code distance is large.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:36:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Manabe","Hidetaka",""],["Suzuki","Yasunari",""],["Darmawan","Andrew S.",""]]}
{"id":"2308.08187","submitter":"Patrick Altmeyer","authors":"Patrick Altmeyer, Giovan Angela, Aleksander Buszydlik, Karol Dobiczek,\n  Arie van Deursen, Cynthia C. S. Liem","title":"Endogenous Macrodynamics in Algorithmic Recourse","comments":"12 pages, 11 figures. Originally published at the 2023 IEEE\n  Conference on Secure and Trustworthy Machine Learning (SaTML). IEEE holds the\n  copyright","journal-ref":"in 2023 IEEE Conference on Secure and Trustworthy Machine Learning\n  (SaTML), Raleigh, NC, USA, 2023 pp. 418-431","doi":"10.1109/SaTML54575.2023.00036","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing work on Counterfactual Explanations (CE) and Algorithmic Recourse\n(AR) has largely focused on single individuals in a static environment: given\nsome estimated model, the goal is to find valid counterfactuals for an\nindividual instance that fulfill various desiderata. The ability of such\ncounterfactuals to handle dynamics like data and model drift remains a largely\nunexplored research challenge. There has also been surprisingly little work on\nthe related question of how the actual implementation of recourse by one\nindividual may affect other individuals. Through this work, we aim to close\nthat gap. We first show that many of the existing methodologies can be\ncollectively described by a generalized framework. We then argue that the\nexisting framework does not account for a hidden external cost of recourse,\nthat only reveals itself when studying the endogenous dynamics of recourse at\nthe group level. Through simulation experiments involving various state-of\nthe-art counterfactual generators and several benchmark datasets, we generate\nlarge numbers of counterfactuals and study the resulting domain and model\nshifts. We find that the induced shifts are substantial enough to likely impede\nthe applicability of Algorithmic Recourse in some situations. Fortunately, we\nfind various strategies to mitigate these concerns. Our simulation framework\nfor studying recourse dynamics is fast and opensourced.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:36:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Altmeyer","Patrick",""],["Angela","Giovan",""],["Buszydlik","Aleksander",""],["Dobiczek","Karol",""],["van Deursen","Arie",""],["Liem","Cynthia C. S.",""]]}
{"id":"2308.08188","submitter":"Wendi Chen","authors":"Wendi Chen, D.Y. Pang, Hairui Guo, Ye Tao, Weili Sun and Yangjun Ying","title":"Elastic scattering and total reaction cross sections of $^{6}$Li studied\n  with a microscopic continuum discretized coupled channels model","comments":"10 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a systematic study of $^{6}$Li elastic scattering and total\nreaction cross sections at incident energies around the Coulomb barrier within\nthe continuum discretized coupled-channels (CDCC) framework, where $^{6}$Li is\ntreated in an $\\alpha$+$d$ two-body model. Collisions with $^{27}$Al,\n$^{64}$Zn, $^{138}$Ba and $^{208}$Pa are analyzed. The microscopic optical\npotentials (MOP) based on Skyrme nucleon-nucleon interaction for $\\alpha$ and\n$d$ are adopted in CDCC calculations and satisfactory agreement with the\nexperimental data is obtained without any adjustment on MOPs. For comparison,\nthe $\\alpha$ and $d$ global phenomenological optical potentials (GOP) are also\nused in CDCC analysis and a reduction no less than 50$\\%$ on the surface\nimaginary part of deuteron GOP is required for describing the data. In all\ncases, the $^6$Li breakup effect is significant and provides repulsive\ncorrection to the folding model potential. The reduction on the GOP of deuteron\nreveals a strong suppression of the reaction probability of deuteron as a\ncomponent of $^{6}$Li as compared with that of a free deuteron. A further\ninvestigation is made by taking the $d$ breakup process into account\nequivalently within the dynamic polarization potential approach and it shows\nthat $d$ behaves like a tightly bound nucleus in $^{6}$Li induced reactions. We\nalso compare the CDCC results with those calculated with a $^6$Li GOP and it\nshows that CDCC calculations provide a better reproduction for the elastic\nscattering angular distributions in the sub-barrier energy region and the total\nreaction cross sections at energies around the Coulomb barrier.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:38:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Wendi",""],["Pang","D. Y.",""],["Guo","Hairui",""],["Tao","Ye",""],["Sun","Weili",""],["Ying","Yangjun",""]]}
{"id":"2308.08189","submitter":"Royi Jacobovic","authors":"Royi Jacobovic and Nikki Levering","title":"Minimizing the externalities variance in a LCFS-PR $M/G/1$ queue under\n  various constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider a LCFS-PR $M/G/1$ queue and assume that at time $t = 0$, there are\n$n+2$ customers $c_1,c_2,...,c_{n+1},c$ who arrived in that order such that $t\n= 0$ is the arrival time of $c$. Then, the externalities which are generated by\n$c$ is the total waiting time that would be saved by $c_1,c_2,...,c_{n+1}$ if\n$c$ reduced his service requirement to zero. Motivated by some applications,\nthis work is about the minimization of the externalities variance under various\nconstraints.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:39:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jacobovic","Royi",""],["Levering","Nikki",""]]}
{"id":"2308.08190","submitter":"Mohamed Harmanani","authors":"Mohamed Harmanani","title":"Modelling the Spread of COVID-19 in Indoor Spaces using Automated\n  Probabilistic Planning","comments":"7 pages. Presented at ICAPS 2023 Scheduling and Planning Applications\n  woRKshop (SPARK 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The coronavirus disease 2019 (COVID-19) pandemic has been ongoing for around\n3 years, and has infected over 750 million people and caused over 6 million\ndeaths worldwide at the time of writing. Throughout the pandemic, several\nstrategies for controlling the spread of the disease have been debated by\nhealthcare professionals, government authorities, and international bodies. To\nanticipate the potential impact of the disease, and to simulate the\neffectiveness of different mitigation strategies, a robust model of disease\nspread is needed. In this work, we explore a novel approach based on\nprobabilistic planning and dynamic graph analysis to model the spread of\nCOVID-19 in indoor spaces. We endow the planner with means to control the\nspread of the disease through non-pharmaceutical interventions (NPIs) such as\nmandating masks and vaccines, and we compare the impact of crowds and capacity\nlimits on the spread of COVID-19 in these settings. We demonstrate that the use\nof probabilistic planning is effective in predicting the amount of infections\nthat are likely to occur in shared spaces, and that automated planners have the\npotential to design competent interventions to limit the spread of the disease.\nOur code is fully open-source and is available at:\nhttps://github.com/mharmanani/prob-planning-covid19 .\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:41:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Harmanani","Mohamed",""]]}
{"id":"2308.08191","submitter":"Zi-Yue Wang","authors":"Sirui Ning, Diandian Wang, Zi-Yue Wang","title":"Pole skipping in holographic theories with gauge and fermionic fields","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el gr-qc nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using covariant expansions, recent work showed that pole skipping happens in\ngeneral holographic theories with bosonic fields at frequencies\n$\\mathrm{i}(l_b-s) 2\\pi T$, where $l_b$ is the highest integer spin in the\ntheory and $s$ takes all positive integer values. We revisit this formalism in\ntheories with gauge symmetry and upgrade the pole-skipping condition so that it\nworks without having to remove the gauge redundancy. We also extend the\nformalism by incorporating fermions with general spins and interactions and\nshow that their presence generally leads to a separate tower of pole-skipping\npoints at frequencies $\\mathrm{i}(l_f-s)2\\pi T$, $l_f$ being the highest\nhalf-integer spin in the theory and $s$ again taking all positive integer\nvalues. We also demonstrate the practical value of this formalism using a\nselection of examples with spins $0,\\frac{1}{2},1,\\frac{3}{2},2$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:44:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ning","Sirui",""],["Wang","Diandian",""],["Wang","Zi-Yue",""]]}
{"id":"2308.08192","submitter":"Ratko Grbi\\'c","authors":"Ratko Grbi\\'c, Brando Koch","title":"Automatic Vision-Based Parking Slot Detection and Occupancy\n  Classification","comments":"39 pages, 8 figures, 9 tables","journal-ref":"Expert Systems with Applications, Volume 225, 1 September 2023,\n  120147","doi":"10.1016/j.eswa.2023.120147","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Parking guidance information (PGI) systems are used to provide information to\ndrivers about the nearest parking lots and the number of vacant parking slots.\nRecently, vision-based solutions started to appear as a cost-effective\nalternative to standard PGI systems based on hardware sensors mounted on each\nparking slot. Vision-based systems provide information about parking occupancy\nbased on images taken by a camera that is recording a parking lot. However,\nsuch systems are challenging to develop due to various possible viewpoints,\nweather conditions, and object occlusions. Most notably, they require manual\nlabeling of parking slot locations in the input image which is sensitive to\ncamera angle change, replacement, or maintenance. In this paper, the algorithm\nthat performs Automatic Parking Slot Detection and Occupancy Classification\n(APSD-OC) solely on input images is proposed. Automatic parking slot detection\nis based on vehicle detections in a series of parking lot images upon which\nclustering is applied in bird's eye view to detect parking slots. Once the\nparking slots positions are determined in the input image, each detected\nparking slot is classified as occupied or vacant using a specifically trained\nResNet34 deep classifier. The proposed approach is extensively evaluated on\nwell-known publicly available datasets (PKLot and CNRPark+EXT), showing high\nefficiency in parking slot detection and robustness to the presence of illegal\nparking or passing vehicles. Trained classifier achieves high accuracy in\nparking slot occupancy classification.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:44:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Grbi\u0107","Ratko",""],["Koch","Brando",""]]}
{"id":"2308.08193","submitter":"Ashot Gevorgyan","authors":"A.H. Gevorgyan","title":"Exceptional points and lines and Dirac points and lines in magnetoactive\n  cholesteric liquid crystals","comments":"14 pages, 9 figures. arXiv admin note: text overlap with\n  arXiv:2305.09233","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigated the properties of cholesteric liquid crystals (CLCs) being in\nexternal static magnetic field directed along the helix axis. We have shown\nthat in the case of the wavelength dependence of magneto-optic activity\nparameter, and in the presence of absorption new features appear in the optics\nof CLCs. We have shown that in this case new photonic band gaps (PBGs) appear.\nThis new PBG is sensitive to the polarization of the incident light. But if the\nchirality sign of the polarization of the incident diffracting light for the\nbasic PBG (which exist also at the absence of external magnetic field) is\ndetermined only by the chirality sign of the CLC helix, then for the second one\nit is determined by the external magnetic field direction (i.e., on whether the\ndirections of the external magnetic field and the incident light are parallel,\nor they are antiparallel). We have shown that in this case besides Dirac points\nthere appear also Dirac lines as well as exceptional points and exceptional\nlines. And moreover, at some of these points and lines there appear the lines\nor wide bands of magnetically induced transparency, on others a wide coherent\nperfect absorption band appears that is insensitive to incident light\npolarization. And finally on some points the same reflection, transmission and\nabsorption takes place for any polarization of incident light. This system can\nbe applied as tunable narrow-band or broad-band filters and mirrors, a highly\ntunable broad/narrow-band coherent perfect absorber, transmitter, ideal optical\ndiode, and other devices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:45:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gevorgyan","A. H.",""]]}
{"id":"2308.08194","submitter":"Denis Goldobin","authors":"Denis S. Goldobin and Evelina V. Permyakova and Lyudmila S. Klimenko","title":"Macroscopic behavior of populations of quadratic integrate-and-fire\n  neurons subject to non-Gaussian white noise","comments":"16 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech nlin.AO q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study microscopic dynamics of populations of quadratic integrate-and-fire\nneurons subject to non-Gaussian noises; we argue that these noises must be\nalpha-stable whenever they are delta-correlated (white). For the case of\nadditive-in-voltage noise, we derive the governing equation of the dynamics of\nthe characteristic function of the membrane voltage distribution and construct\na linear-in-noise perturbation theory. Specifically for the recurrent network\nwith global synaptic coupling, we theoretically calculate the observables:\npopulation-mean membrane voltage and firing rate. The theoretical results are\nunderpinned by the results of numerical simulation for homogeneous and\nheterogeneous populations. The possibility of the generalization of the\npseudocumulant approach to the case of a fractional $\\alpha$ is examined for\nboth irrational and fractional rational $\\alpha$. This examination seemingly\nsuggests the pseudocumulant approach or its modifications to be employable only\nfor the integer values of $\\alpha=1$ (Cauchy noise) and 2 (Gaussian noise)\nwithin the physically meaningful range (0;2]. Remarkably, the analysis for\nfractional $\\alpha$ indirectly revealed that, for the Gaussian noise, the\nminimal asymptotically rigorous model reduction must involve three\npseudocumulants and the two-pseudocumulant model reduction is an artificial\napproximation. This explains a surprising gain of accuracy for the\nthree-pseudocumulant models as compared to the the two-pseudocumulant ones\nreported in the literature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:48:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Goldobin","Denis S.",""],["Permyakova","Evelina V.",""],["Klimenko","Lyudmila S.",""]]}
{"id":"2308.08195","submitter":"Yue Chen","authors":"Yue Chen, Changhong Zhao","title":"A Joint Electricity and Carbon Pricing Method","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The joint electricity and carbon pricing (JECP) problem is crucial for the\nlow-carbon energy system transition. It is also challenging due to requirements\nsuch as providing incentives that can motivate market participants to follow\nthe dispatch schedule and minimizing the impact on affected parties compared to\nwhen they were in the traditional electricity market. This letter proposes a\nnovel JECP method based on partial carbon tax and primal-dual optimality\nconditions. Several nice properties of the proposed method are proven. Tests on\ndifferent systems show its advantages over the two existing pricing methods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:49:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Yue",""],["Zhao","Changhong",""]]}
{"id":"2308.08196","submitter":"Dongni Chen","authors":"Dongni Chen, Zhengyang Peng, Jiahui Li, Stefano Chesi, and Yingdan\n  Wang","title":"Discrete time crystal in an open optomechanical system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spontaneous breaking of time translation symmetry in periodically driven\nFloquet systems can lead to a discrete time crystal. Here we study the\noccurrence of such dynamical phase in a driven-dissipative optomechanical\nsystem with two membranes in the middle. We find that, under certian\nconditions, the system can be mapped to an open Dicke model and realizes a\nsuperradianttype phase transition. Furthermore, applying a suitable\nperiodically modulated drive, the system dynamics exhibits a robust subharmonic\noscillation persistent in the thermodynamic limit.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:51:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Dongni",""],["Peng","Zhengyang",""],["Li","Jiahui",""],["Chesi","Stefano",""],["Wang","Yingdan",""]]}
{"id":"2308.08197","submitter":"Jianyu Wen","authors":"Jianyu Wen, Chenhao Wu, Tong Zhang, Yixuan Yu, Piotr Swierczynski","title":"Self-Reference Deep Adaptive Curve Estimation for Low-Light Image\n  Enhancement","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":"  In this paper, we propose a 2-stage low-light image enhancement method called\nSelf-Reference Deep Adaptive Curve Estimation (Self-DACE). In the first stage,\nwe present an intuitive, lightweight, fast, and unsupervised luminance\nenhancement algorithm. The algorithm is based on a novel low-light enhancement\ncurve that can be used to locally boost image brightness. We also propose a new\nloss function with a simplified physical model designed to preserve natural\nimages' color, structure, and fidelity. We use a vanilla CNN to map each pixel\nthrough deep Adaptive Adjustment Curves (AAC) while preserving the local image\nstructure. Secondly, we introduce the corresponding denoising scheme to remove\nthe latent noise in the darkness. We approximately model the noise in the dark\nand deploy a Denoising-Net to estimate and remove the noise after the first\nstage. Exhaustive qualitative and quantitative analysis shows that our method\noutperforms existing state-of-the-art algorithms on multiple real-world\ndatasets.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:57:35 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 03:31:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wen","Jianyu",""],["Wu","Chenhao",""],["Zhang","Tong",""],["Yu","Yixuan",""],["Swierczynski","Piotr",""]]}
{"id":"2308.08198","submitter":"Tianyu Fu","authors":"Tianyu Fu, Chiyue Wei, Yu Wang, Rex Ying","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","comments":"8 pages main text, 10 pages appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Subgraph counting is the problem of counting the occurrences of a given query\ngraph in a large target graph. Large-scale subgraph counting is useful in\nvarious domains, such as motif counting for social network analysis and loop\ncounting for money laundering detection on transaction networks. Recently, to\naddress the exponential runtime complexity of scalable subgraph counting,\nneural methods are proposed. However, existing neural counting approaches fall\nshort in three aspects. Firstly, the counts of the same query can vary from\nzero to millions on different target graphs, posing a much larger challenge\nthan most graph regression tasks. Secondly, current scalable graph neural\nnetworks have limited expressive power and fail to efficiently distinguish\ngraphs in count prediction. Furthermore, existing neural approaches cannot\npredict the occurrence position of queries in the target graph.\n  Here we design DeSCo, a scalable neural deep subgraph counting pipeline,\nwhich aims to accurately predict the query count and occurrence position on any\ntarget graph after one-time training. Firstly, DeSCo uses a novel canonical\npartition and divides the large target graph into small neighborhood graphs.\nThe technique greatly reduces the count variation while guaranteeing no missing\nor double-counting. Secondly, neighborhood counting uses an expressive\nsubgraph-based heterogeneous graph neural network to accurately perform\ncounting in each neighborhood. Finally, gossip propagation propagates\nneighborhood counts with learnable gates to harness the inductive biases of\nmotif counts. DeSCo is evaluated on eight real-world datasets from various\ndomains. It outperforms state-of-the-art neural methods with 137x improvement\nin the mean squared error of count prediction, while maintaining the polynomial\nruntime complexity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:58:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fu","Tianyu",""],["Wei","Chiyue",""],["Wang","Yu",""],["Ying","Rex",""]]}
{"id":"2308.08199","submitter":"Lance Dixon","authors":"Lance J. Dixon and Yu-Ting Liu","title":"An Eight Loop Amplitude via Antipodal Duality","comments":"50 pages, 3 figures, 6 tables, 8 loops","journal-ref":null,"doi":null,"report-no":"SLAC-PUB-17693","categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the six-particle maximally-helicity-violating (MHV) amplitude in\nplanar ${\\cal N}=4$ super-Yang-Mills theory at eight loops, using antipodal\nduality and the recently computed eight-loop three-point form factor for the\nchiral stress energy tensor multiplet. Antipodal duality maps the form factor\nsymbol to the amplitude symbol on a two-dimensional parity-preserving surface\nin the three-dimensional amplitude kinematics. There are remarkably few\nambiguities in lifting from two to three dimensions, nor in promoting the\nsymbol to a function. The amplitude passes many tests, including\nnear-collinear, multi-Regge, factorization, self-crossing and origin limits.\nThese checks also constitute a validation of antipodal duality at eight loops.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:58:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dixon","Lance J.",""],["Liu","Yu-Ting",""]]}
{"id":"2308.08200","submitter":"Tobias John","authors":"Tobias John and Patrick Koopmann","title":"Towards Ontology-Mediated Planning with OWL DL Ontologies (Extended\n  Version)","comments":"Extended version of a paper accepted at 36th International Workshop\n  on Description Logics (DL 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While classical planning languages make the closed-domain and closed-world\nassumption, there have been various approaches to extend those with DL\nreasoning, which is then interpreted under the usual open-world semantics.\nCurrent approaches for planning with DL ontologies integrate the DL directly\ninto the planning language, and practical approaches have been developed based\non first-order rewritings or rewritings into datalog. We present here a new\napproach in which the planning specification and ontology are kept separate,\nand are linked together using an interface. This allows planning experts to\nwork in a familiar formalism, while existing ontologies can be easily\nintegrated and extended by ontology experts. Our approach for planning with\nthose ontology-mediated planning problems is optimized for cases with\ncomparatively small domains, and supports the whole OWL DL fragment. The idea\nis to rewrite the ontology-mediated planning problem into a classical planning\nproblem to be processed by existing planning tools. Different to other\napproaches, our rewriting is data-dependent. A first experimental evaluation of\nour approach shows the potential and limitations of this approach.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:05:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["John","Tobias",""],["Koopmann","Patrick",""]]}
{"id":"2308.08201","submitter":"Mengfan Zheng","authors":"Mengfan Zheng","title":"Hybrid Polar Encoding with Applications in Non-Coherent Channels","comments":"12 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":"  In coding theory, an error-correcting code can be encoded either\nsystematically or non-systematically. In a systematic encode, the input data is\nembedded in the encoded output. Conversely, in a non-systematic code, the\noutput does not contain the input symbols. In this paper, we propose a hybrid\nencoding scheme for polar codes, in which some data bits are systematically\nencoded while the rest are non-systematically encoded. Based on the proposed\nscheme, we design a joint channel estimation and data decoding scheme. We use\nthe systematic bits in the hybrid encoding scheme as pilots for channel\nestimation. To mitigate the code rate loss caused by the pilots and to provide\nadditional error detecting capability, we propose a dynamic pilot design by\nbuilding connections between the systematic bits and non-systematic bits.\nSimulation results show that the performance of the proposed scheme approaches\nthat of the traditional non-systematic polar coding scheme with perfect channel\nstate information (CSI) with the increase of SNR.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:06:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zheng","Mengfan",""]]}
{"id":"2308.08202","submitter":"Yuanhang Liu","authors":"Yuanhang Liu, Donghui Yang, Jie Zhong","title":"Norm and time optimal control problems of stochastic heat equations","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 investigates the norm and time optimal control problems for\nstochastic heat equations. We begin by presenting a characterization of the\nnorm optimal control, followed by a discussion of its properties. We then\nexplore the equivalence between the norm optimal control and time optimal\ncontrol, and subsequently establish the bang-bang property of the time optimal\ncontrol. These problems, to the best of our knowledge, are among the first to\ndiscuss in the stochastic case.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:06:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Yuanhang",""],["Yang","Donghui",""],["Zhong","Jie",""]]}
{"id":"2308.08203","submitter":"Miltiadis Allamanis","authors":"Miltiadis Allamanis, Earl T. Barr","title":"Epicure: Distilling Sequence Model Predictions into Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most machine learning models predict a probability distribution over concrete\noutputs and struggle to accurately predict names over high entropy sequence\ndistributions. Here, we explore finding abstract, high-precision patterns\nintrinsic to these predictions in order to make abstract predictions that\nusefully capture rare sequences. In this short paper, we present Epicure, a\nmethod that distils the predictions of a sequence model, such as the output of\nbeam search, into simple patterns. Epicure maps a model's predictions into a\nlattice that represents increasingly more general patterns that subsume the\nconcrete model predictions.\n  On the tasks of predicting a descriptive name of a function given the source\ncode of its body and detecting anomalous names given a function, we show that\nEpicure yields accurate naming patterns that match the ground truth more often\ncompared to just the highest probability model prediction. For a false alarm\nrate of 10%, Epicure predicts patterns that match 61% more ground-truth names\ncompared to the best model prediction, making Epicure well-suited for scenarios\nthat require high precision.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:08:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Allamanis","Miltiadis",""],["Barr","Earl T.",""]]}
{"id":"2308.08204","submitter":"Jiabang He","authors":"Jiabang He, Liu Jia, Lei Wang, Xiyao Li, Xing Xu","title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with\n  Structure-Augmented Pre-trained 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":"  Knowledge Graph Completion (KGC) aims to conduct reasoning on the facts\nwithin knowledge graphs and automatically infer missing links. Existing methods\ncan mainly be categorized into structure-based or description-based. On the one\nhand, structure-based methods effectively represent relational facts in\nknowledge graphs using entity embeddings. However, they struggle with\nsemantically rich real-world entities due to limited structural information and\nfail to generalize to unseen entities. On the other hand, description-based\nmethods leverage pre-trained language models (PLMs) to understand textual\ninformation. They exhibit strong robustness towards unseen entities. However,\nthey have difficulty with larger negative sampling and often lag behind\nstructure-based methods. To address these issues, in this paper, we propose\nMomentum Contrast for knowledge graph completion with Structure-Augmented\npre-trained language models (MoCoSA), which allows the PLM to perceive the\nstructural information by the adaptable structure encoder. To improve learning\nefficiency, we proposed momentum hard negative and intra-relation negative\nsampling. Experimental results demonstrate that our approach achieves\nstate-of-the-art performance in terms of mean reciprocal rank (MRR), with\nimprovements of 2.5% on WN18RR and 21% on OpenBG500.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:09:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["He","Jiabang",""],["Jia","Liu",""],["Wang","Lei",""],["Li","Xiyao",""],["Xu","Xing",""]]}
{"id":"2308.08205","submitter":"Muhammad Fitrah Alfian Rangga Sakti","authors":"M. Zhahir Djogama, Muhammad F. A. R. Sakti, Freddy P. Zen, and Mirza\n  Satriawan","title":"Near-extremal Kerr-like ECO in the Kerr/CFT Correspondence in Higher\n  Spin Perturbations","comments":"13 pages, 5 figures, for submission to journal","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The Kerr/CFT correspondence has been established to explore the quantum\ntheory of gravity in the near-horizon geometry of a extreme Kerr black holes.\nThe quantum gravitational corrections on the near-horizon region may manifest\nin form of a partially reflective membrane that replace the horizon. In such\nmodification, the black holes now can be seen as a horizenless exotic compact\nobject (ECO). In this paper, we consider the properties of Kerr-like ECOs in\nnear-extremal condition using Kerr/CFT correspondence. We study the quasinormal\nmodes and absorption cross-section in that background and compare these by\nusing CFT dual computation. The corresponding dual CFT one needs to incorporate\nfinite size/finite $N$ effects in the dual CFT terminology. We also extend the\ndual CFT analysis for higher spin perturbations such as photon and graviton. We\nfind consistency between properties of the ECOs from gravity sides and from CFT\nsides. The quasinormal mode spectrum is in line with non-extreme case, where\nthe differences are in the length of the circle, on which the dual CFT lives,\nand phase shift of the incoming perturbation. The absorption cross-section has\noscillatory feature that start to disappear near extremal limit. The particle\nspin determines the phase shift and conformal weight. We also obtain that the\necho time-delay depends on the position of the membrane and extremality of the\nECOs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:10:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Djogama","M. Zhahir",""],["Sakti","Muhammad F. A. R.",""],["Zen","Freddy P.",""],["Satriawan","Mirza",""]]}
{"id":"2308.08206","submitter":"Nadav Schneider","authors":"Nadav Schneider, Muriel Tzdaka, Galit Sturm, Guy Lazovski, Galit Bar,\n  Gilad Oren, Raz Gvishi, Gal Oren","title":"Explainable Multi-View Deep Networks Methodology for Experimental\n  Physics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physical experiments often involve multiple imaging representations, such as\nX-ray scans and microscopic images. Deep learning models have been widely used\nfor supervised analysis in these experiments. Combining different image\nrepresentations is frequently required to analyze and make a decision properly.\nConsequently, multi-view data has emerged - datasets where each sample is\ndescribed by views from different angles, sources, or modalities. These\nproblems are addressed with the concept of multi-view learning. Understanding\nthe decision-making process of deep learning models is essential for reliable\nand credible analysis. Hence, many explainability methods have been devised\nrecently. Nonetheless, there is a lack of proper explainability in multi-view\nmodels, which are challenging to explain due to their architectures. In this\npaper, we suggest different multi-view architectures for the vision domain,\neach suited to another problem, and we also present a methodology for\nexplaining these models. To demonstrate the effectiveness of our methodology,\nwe focus on the domain of High Energy Density Physics (HEDP) experiments, where\nmultiple imaging representations are used to assess the quality of foam\nsamples. We apply our methodology to classify the foam samples quality using\nthe suggested multi-view architectures. Through experimental results, we\nshowcase the improvement of accurate architecture choice on both accuracy - 78%\nto 84% and AUC - 83% to 93% and present a trade-off between performance and\nexplainability. Specifically, we demonstrate that our approach enables the\nexplanation of individual one-view models, providing insights into the\ndecision-making process of each view. This understanding enhances the\ninterpretability of the overall multi-view model. The sources of this work are\navailable at:\nhttps://github.com/Scientific-Computing-Lab-NRCN/Multi-View-Explainability.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:13:38 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 04:58:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schneider","Nadav",""],["Tzdaka","Muriel",""],["Sturm","Galit",""],["Lazovski","Guy",""],["Bar","Galit",""],["Oren","Gilad",""],["Gvishi","Raz",""],["Oren","Gal",""]]}
{"id":"2308.08207","submitter":"Mahmoud Zeer","authors":"Mahmoud Zeer, Dongwook Go, Peter Schmitz, Tom G. Saunderson, Hao Wang,\n  Jamal Ghabboun, Stefan Bl\\\"ugel, Wulf Wulfhekel, and Yuriy Mokrousov","title":"Promoting $p$-based Hall effects by $p$-$d$-$f$ hybridization in\n  Gd-based dichalcogenides","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conduct a first-principles study of Hall effects in rare-earth\ndichalcogenides, focusing on monolayers of the H-phase EuX$_2$ and GdX$_2$,\nwhere X = S, Se, and Te. Our predictions reveal that all EuX$_2$ and GdX$_2$\nsystems exhibit high magnetic moments and wide bandgaps. We observe that while\nin case of EuX$_2$ the $p$ and $f$ states hybridize directly below the Fermi\nenergy, the absence of $f$ and $d$ states of Gd at the Fermi energy results in\n$p$-like spin-polarized electronic structure of GdX$_2$, which mediates\n$p$-based magnetotransport. Notably, these systems display significant\nanomalous, spin, and orbital Hall conductivities. We find that in GdX$_2$ the\nstrength of correlations controls the relative position of $p$, $d$ and\n$f$-states and their hybridization which has a crucial impact on $p$-state\npolarization and the anomalous Hall effect, but not the spin and orbital Hall\neffect. Moreover, we find that the application of strain can significantly\nmodify the electronic structure of the monolayers, resulting in quantized\ncharge, spin and orbital transport in GdTe$_2$ via a strain-mediated orbital\ninversion mechanism taking place at the Fermi energy. Our findings suggest that\nrare-earth dichalcogenides hold promise as a platform for topological\nspintronics and orbitronics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:17:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zeer","Mahmoud",""],["Go","Dongwook",""],["Schmitz","Peter",""],["Saunderson","Tom G.",""],["Wang","Hao",""],["Ghabboun","Jamal",""],["Bl\u00fcgel","Stefan",""],["Wulfhekel","Wulf",""],["Mokrousov","Yuriy",""]]}
{"id":"2308.08208","submitter":"Sisi Miao","authors":"Sisi Miao, Alexander Schnerring, Haizheng Li, and Laurent Schmalen","title":"Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with\n  Overcomplete Check Matrices","comments":"arXiv admin note: text overlap with arXiv:2212.10245","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":"  Quantum low-density parity-check (QLDPC) codes are promising candidates for\nerror correction in quantum computers. One of the major challenges in\nimplementing QLDPC codes in quantum computers is the lack of a universal\ndecoder. In this work, we first propose to decode QLDPC codes with a belief\npropagation (BP) decoder operating on overcomplete check matrices. Then, we\nextend the neural BP (NBP) decoder, which was originally studied for suboptimal\nbinary BP decoding of QLPDC codes, to quaternary BP decoders. Numerical\nsimulation results demonstrate that both approaches as well as their\ncombination yield a low-latency, high-performance decoder for several short to\nmoderate length QLDPC codes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:24:06 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Miao","Sisi",""],["Schnerring","Alexander",""],["Li","Haizheng",""],["Schmalen","Laurent",""]]}
{"id":"2308.08209","submitter":"Sania Asif","authors":"Sania Asif, Lamei Yuan, Yao Wang","title":"Cohomology of Twisted Rota-Baxter operators on Associative~Conformal\n  Algebra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we examine the concept of twisted Rota-Baxter (TRB) operators\non associative conformal algebras. Our strategy begins by constructing an\n$L_\\infty$-algebra using Maurer-Cartan elements derived from $H$-twisted\nRota-Baxter ($H$-TRB) operators on associative conformal algebras. This\nstructure leads us to explore the cohomology of the conformal $H$-TRB operator,\nwhich is characterized as the Hochschild cohomology of a specific associative\nconformal algebra with coefficients in a conformal bimodule. Furthermore, we\nstudy the linear and formal deformations of conformal $H$-TRB operators to\nexplore the application of cohomology.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:24:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Asif","Sania",""],["Yuan","Lamei",""],["Wang","Yao",""]]}
{"id":"2308.08210","submitter":"Tom Hendriks","authors":"Tom Hendriks, Anna Vilanova, Maxime Chamberland","title":"Neural Spherical Harmonics for structurally coherent continuous\n  representation of diffusion MRI signal","comments":"12 pages, 6 figures, accepted for cdMRI workshop at MICCAI 2023\n  Updated to fix typo in author name (Villanova -> Vilanova)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel way to model diffusion magnetic resonance imaging (dMRI)\ndatasets, that benefits from the structural coherence of the human brain while\nonly using data from a single subject. Current methods model the dMRI signal in\nindividual voxels, disregarding the intervoxel coherence that is present. We\nuse a neural network to parameterize a spherical harmonics series (NeSH) to\nrepresent the dMRI signal of a single subject from the Human Connectome Project\ndataset, continuous in both the angular and spatial domain. The reconstructed\ndMRI signal using this method shows a more structurally coherent representation\nof the data. Noise in gradient images is removed and the fiber orientation\ndistribution functions show a smooth change in direction along a fiber tract.\nWe showcase how the reconstruction can be used to calculate mean diffusivity,\nfractional anisotropy, and total apparent fiber density. These results can be\nachieved with a single model architecture, tuning only one hyperparameter. In\nthis paper we also demonstrate how upsampling in both the angular and spatial\ndomain yields reconstructions that are on par or better than existing methods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:28:01 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 09:15:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hendriks","Tom",""],["Vilanova","Anna",""],["Chamberland","Maxime",""]]}
{"id":"2308.08211","submitter":"Zhenzhen Qin","authors":"Puxuan Li, Xuan Wang, Haoyu Wang, Qikun Tian, Jinyuan Xu, Linfeng Yu,\n  Guangzhao Qin, Zhenzhen Qin","title":"Biaxial strain modulated electronic structures of layered\n  two-dimensional MoSiGeN4 Rashba systems","comments":"21 pages, 7 figures, supplementary information","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 two-dimensional (2D) MA2Z4 family has received extensive attention in\nmanipulating its electronic structure and achieving intriguing physical\nproperties. However, engineering the electronic properties remains a challenge.\nHerein, based on first-principles calculations, we systematically investigate\nthe effect of biaxial strains on the electronic structures of 2D Rashba\nMoSiGeN4 (MSGN), and further explore how the interlayer interactions affect the\nRashba spin splitting in such strained layered MSGNs. After applying biaxial\nstrains, the band gap decreases monotonically with increasing tensile strains\nbut increases when the compressive strains are applied. An\nindirect-direct-indirect band gap transition is induced by applying a moderate\ncompressive strain (< 5%) in the MSGNs. Due to the symmetry breaking and\nmoderate spin-orbit coupling (SOC), the monolayer MSGN possess an isolated\nRashba spin splitting (R) near the Fermi level, which could be effectively\nregulated to the Lifshitz transition (L) by biaxial strain. For instance, a\nL-R-L transformation of Fermi surface is presented in monolayer and a more\ncomplex and changeable L-R-L-R evolution is observed in bilayer and trilayer\nMSGNs as the biaxial strain vary from -8% to 12%, which actually depend on the\nappearance, variation, and vanish of the Mexican hat band in the absence of SOC\nunder different strains. The contribution of Mo-dz2 orbital hybridized with\nN-pz orbital in the highest valence band plays a dominant role on the band\nevolution under biaxial strains, where the R-L evolution corresponds to the\ndecreased Mo-dz2 orbital contribution. Our study highlights the biaxial strain\ncontrollable Rashba spin splitting, in particular the introduction and even the\nevolution of Lifshitz transition near Fermi surface, which makes the strained\nMSGNs as promising candidates for future applications in spintronic devices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:28:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Puxuan",""],["Wang","Xuan",""],["Wang","Haoyu",""],["Tian","Qikun",""],["Xu","Jinyuan",""],["Yu","Linfeng",""],["Qin","Guangzhao",""],["Qin","Zhenzhen",""]]}
{"id":"2308.08212","submitter":"Yuanpu Xiong","authors":"Yuanpu Xiong","title":"Minimal $L^2$ and $L^p$ Ohsawa-Takegoshi extensions","comments":"4 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We find a precise relationship between the minimal extensions in $L^2$ and\n$L^p$ Ohsawa-Takegoshi extension theorems. This relationship also gives another\nproof to the $L^p$ version of the Ohsawa-Takegoshi extension theorem, which is\ndifferent from the original proof due to Berndtsson-P\\u{a}un.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:30:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xiong","Yuanpu",""]]}
{"id":"2308.08213","submitter":"Junao Shen","authors":"Junao Shen, Long Chen, Kun Kuang, Fei Wu, Tian Feng, Wei Zhang","title":"MEDOE: A Multi-Expert Decoder and Output Ensemble Framework for\n  Long-tailed Semantic Segmentation","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Long-tailed distribution of semantic categories, which has been often ignored\nin conventional methods, causes unsatisfactory performance in semantic\nsegmentation on tail categories. In this paper, we focus on the problem of\nlong-tailed semantic segmentation. Although some long-tailed recognition\nmethods (e.g., re-sampling/re-weighting) have been proposed in other problems,\nthey can probably compromise crucial contextual information and are thus hardly\nadaptable to the problem of long-tailed semantic segmentation. To address this\nissue, we propose MEDOE, a novel framework for long-tailed semantic\nsegmentation via contextual information ensemble-and-grouping. The proposed\ntwo-sage framework comprises a multi-expert decoder (MED) and a multi-expert\noutput ensemble (MOE). Specifically, the MED includes several \"experts\". Based\non the pixel frequency distribution, each expert takes the dataset masked\naccording to the specific categories as input and generates contextual\ninformation self-adaptively for classification; The MOE adopts learnable\ndecision weights for the ensemble of the experts' outputs. As a model-agnostic\nframework, our MEDOE can be flexibly and efficiently coupled with various\npopular deep neural networks (e.g., DeepLabv3+, OCRNet, and PSPNet) to improve\ntheir performance in long-tailed semantic segmentation. Experimental results\nshow that the proposed framework outperforms the current methods on both\nCityscapes and ADE20K datasets by up to 1.78% in mIoU and 5.89% in mAcc.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:30:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shen","Junao",""],["Chen","Long",""],["Kuang","Kun",""],["Wu","Fei",""],["Feng","Tian",""],["Zhang","Wei",""]]}
{"id":"2308.08214","submitter":"Aluna Rizzoli","authors":"Aluna Rizzoli","title":"Generic stabilizers for simple algebraic groups acting on orthogonal and\n  symplectic Grassmannians","comments":"48 pages, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider faithful actions of simple algebraic groups on self-dual\nirreducible modules, and on the associated varieties of totally singular\nsubspaces, under the assumption that the dimension of the group is at least as\nlarge as the dimension of the variety. We prove that in all but a finite list\nof cases, there is a dense open subset where the stabilizer of any point is\nconjugate to a fixed subgroup, called the generic stabilizer. We use these\nresults to determine whether there exists a dense orbit. This in turn lets us\ncomplete the answer to the problem of determining all pairs of maximal\nconnected subgroups of a classical group with a dense double coset.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:33:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rizzoli","Aluna",""]]}
{"id":"2308.08215","submitter":"Anja Seegebrecht","authors":"Anja Seegebrecht and Tanja Schilling","title":"Work, Heat and Internal Energy in Open Quantum Systems: A Comparison of\n  Four Approaches from the Autonomous System Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compare definitions of the internal energy of an open quantum system and\nstrategies to split the internal energy into work and heat contributions as\ngiven by four different approaches from autonomous system framework. Our\ndiscussion focuses on methods that allow for arbitrary environments (not just\nheat baths) and driving by a quantum mechanical system. As a simple application\nwe consider an atom as the system of interest and an oscillator field mode as\nthe environment. Three different types of coupling are analyzed. We discuss\nambiguities in the definitions and highlight differences that appear if one\naims at constructing environments that act as pure heat or work reservoirs.\nFurther, we identify different sources of work (e.g. coherence, correlations,\nor frequency offset), depending on the underlying framework. Finally, we give\narguments to favour the approach based on minimal dissipation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:41:20 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Seegebrecht","Anja",""],["Schilling","Tanja",""]]}
{"id":"2308.08216","submitter":"Shahariar Sarkar","authors":"S.Sarkar and Y. Iwata","title":"Effect of Spin-Dependent Short-Range Correlations on Nuclear Matrix\n  Elements for Neutrinoless Double Beta Decay of $^{48}$Ca","comments":"13 pages, 5 figures, submitted in the journal Universe, MDPI","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The neutrinoless double beta decay is a pivotal weak nuclear process that\nholds the potential to unveil the Majorana nature of neutrinos and predict\ntheir absolute masses. In this study, we delve into examining the impact of\nspin-dependent short-range correlations (SRC) on the nuclear matrix elements\n(NMEs) for the light neutrino-exchange mechanism in neutrinoless double beta\n($0\\nu\\beta\\beta$) decay of $^{48}$Ca, employing an extensive interacting\nnuclear shell model. All computations are performed employing the effective\nshell model Hamiltonian GXPF1A, encompassing the entire $fp$ model space\nthrough the closure approximation. Our investigation examines the NMEs'\ndependencies on factors such as the number of intermediate states, coupled\nspin-parity attributes of neutrons and protons, neutrino momentum,\ninter-nucleon separation, and closure energy. This scrutiny is performed with\nrespect to both the conventional Jastrow-type approach of SRC, employing\nvarious parameterizations, and the spin-dependent SRC paradigm. Our findings\nilluminate a discernible distinction in NMEs induced by spin-dependent SRC,\ndiffering by approximately 10-20\\% from those computed through the conventional\nJastrow-type SRC, incorporating distinct parameterizations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:42:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sarkar","S.",""],["Iwata","Y.",""]]}
{"id":"2308.08217","submitter":"Chang Chen","authors":"Chang Chen, Zhiyu Qian, Bo Zhang","title":"Matching with multiple criteria and its application to health\n  disparities research","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Matching is a popular nonparametric covariate adjustment strategy in\nempirical health services research. Matching helps construct two groups\ncomparable in many baseline covariates but different in some key aspects under\ninvestigation. In health disparities research, it is desirable to understand\nthe contributions of various modifiable factors, like income and insurance\ntype, to the observed disparity in access to health services between different\ngroups. To single out the contributions from the factors of interest, we\npropose a statistical matching methodology that constructs nested matched\ncomparison groups from, for instance, White men, that resemble the target\ngroup, for instance, black men, in some selected covariates while remaining\nidentical to the white men population before matching in the remaining\ncovariates. Using the proposed method, we investigated the disparity gaps\nbetween white men and black men in the US in prostate-specific antigen (PSA)\nscreening based on the 2020 Behavioral Risk Factor Surveillance System (BFRSS)\ndatabase. We found a widening PSA screening rate as the white matched\ncomparison group increasingly resembles the black men group and quantified the\ncontribution of modifiable factors like socioeconomic status. Finally, we\nprovide code that replicates the case study and a tutorial that enables users\nto design customized matched comparison groups satisfying multiple criteria.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:44:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Chang",""],["Qian","Zhiyu",""],["Zhang","Bo",""]]}
{"id":"2308.08218","submitter":"Manjot Singh","authors":"Manjot Singh, Adalbert Fono and Gitta Kutyniok","title":"Expressivity of Spiking Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article studies the expressive power of spiking neural networks where\ninformation is encoded in the firing time of neurons. The implementation of\nspiking neural networks on neuromorphic hardware presents a promising choice\nfor future energy-efficient AI applications. However, there exist very few\nresults that compare the computational power of spiking neurons to arbitrary\nthreshold circuits and sigmoidal neurons. Additionally, it has also been shown\nthat a network of spiking neurons is capable of approximating any continuous\nfunction. By using the Spike Response Model as a mathematical model of a\nspiking neuron and assuming a linear response function, we prove that the\nmapping generated by a network of spiking neurons is continuous piecewise\nlinear. We also show that a spiking neural network can emulate the output of\nany multi-layer (ReLU) neural network. Furthermore, we show that the maximum\nnumber of linear regions generated by a spiking neuron scales exponentially\nwith respect to the input dimension, a characteristic that distinguishes it\nsignificantly from an artificial (ReLU) neuron. Our results further extend the\nunderstanding of the approximation properties of spiking neural networks and\nopen up new avenues where spiking neural networks can be deployed instead of\nartificial neural networks without any performance loss.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:45:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Singh","Manjot",""],["Fono","Adalbert",""],["Kutyniok","Gitta",""]]}
{"id":"2308.08219","submitter":"Zijian Hong","authors":"Lizhe Hu, Yongjun Wu, Yuhui Huang, He Tian, Zijian Hong","title":"Dynamic motion of polar skyrmions in oxide heterostructures","comments":"17 pages, 4 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":"  Polar skyrmions have been widely investigated in oxide heterostructure\nrecently, due to their exotic properties and intriguing physical insights.\nMeanwhile, so far, the external field-driven motion of the polar skyrmion, akin\nto the magnetic counterpart, has yet to be discovered. Here, using phase-field\nsimulations, we demonstrate the dynamic motion of the polar skyrmions with\nintegrated external thermal, electrical, and mechanical stimuli. The external\nheating reduces the spontaneous polarization hence the skyrmion motion barrier,\nwhile the skyrmions shrink under the electric field, which could weaken the\nlattice pinning and interactions between the skyrmions. The mechanical force\ntransforms the skyrmions into c-domain in the vicinity of the indenter center\nunder the electric field, providing the space and driving force needed for the\nskyrmions to move. This study confirmed that the skyrmions are quasi-particles\nthat can move collectively, while also providing concrete guidance for the\nfurther design of polar skyrmion-based electronic devices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:46:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Lizhe",""],["Wu","Yongjun",""],["Huang","Yuhui",""],["Tian","He",""],["Hong","Zijian",""]]}
{"id":"2308.08220","submitter":"Zhen Liu","authors":"Yinglong Wang, Zhen Liu, Jianzhuang Liu, Songcen Xu, Shuaicheng Liu","title":"Low-Light Image Enhancement with Illumination-Aware Gamma Correction and\n  Complete Image Modelling Network","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel network structure with illumination-aware gamma\ncorrection and complete image modelling to solve the low-light image\nenhancement problem. Low-light environments usually lead to less informative\nlarge-scale dark areas, directly learning deep representations from low-light\nimages is insensitive to recovering normal illumination. We propose to\nintegrate the effectiveness of gamma correction with the strong modelling\ncapacities of deep networks, which enables the correction factor gamma to be\nlearned in a coarse to elaborate manner via adaptively perceiving the deviated\nillumination. Because exponential operation introduces high computational\ncomplexity, we propose to use Taylor Series to approximate gamma correction,\naccelerating the training and inference speed. Dark areas usually occupy large\nscales in low-light images, common local modelling structures, e.g., CNN,\nSwinIR, are thus insufficient to recover accurate illumination across whole\nlow-light images. We propose a novel Transformer block to completely simulate\nthe dependencies of all pixels across images via a local-to-global hierarchical\nattention mechanism, so that dark areas could be inferred by borrowing the\ninformation from far informative regions in a highly effective manner.\nExtensive experiments on several benchmark datasets demonstrate that our\napproach outperforms state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:46:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Yinglong",""],["Liu","Zhen",""],["Liu","Jianzhuang",""],["Xu","Songcen",""],["Liu","Shuaicheng",""]]}
{"id":"2308.08221","submitter":"Markus Schlarb","authors":"Markus Schlarb","title":"Rolling Reductive Homogeneous Spaces","comments":"57 pages. This text can be seen as a continuation of arXiv:2308.07089\n  of which some parts are recalled","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rollings of reductive homogeneous spaces are investigated. More precisely,\nfor a reductive homogeneous space $G / H$ with reductive decomposition\n$\\mathfrak{g} = \\mathfrak{h} \\oplus \\mathfrak{m}$, we consider rollings of\n$\\mathfrak{m}$ over $G / H$ without slip and without twist, where $G / H$ is\nequipped with an invariant covariant derivative. To this end, an intrinsic\npoint of view is taken, meaning that a rolling is a curve in the configuration\nspace $Q$ which is tangent to a certain distribution. By considering a\n$H$-principal fiber bundle $\\overline{\\pi} \\colon \\overline{Q} \\to Q$ over the\nconfiguration space equipped with a suitable principal connection, rollings of\n$\\mathfrak{m}$ over $G / H$ can be expressed in terms of horizontally lifted\ncurves on $\\overline{Q}$. The total space of $\\overline{\\pi} \\colon\n\\overline{Q} \\to Q$ is a product of Lie groups. In particular, for a given\ncontrol curve, this point of view allows for characterizing rollings of\n$\\mathfrak{m}$ over $G / H$ as solutions of an explicit, time-variant ordinary\ndifferential equation (ODE) on $\\overline{Q}$, the so-called kinematic\nequation. An explicit solution for the associated initial value problem is\nobtained for rollings with respect to the canonical invariant covariant\nderivative of first and second kind if the development curve in $G / H$ is the\nprojection of a one-parameter subgroup in $G$. Lie groups and Stiefel manifolds\nare discussed as examples.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:47:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Schlarb","Markus",""]]}
{"id":"2308.08222","submitter":"Zhanglu Yan","authors":"Zhanglu Yan, Shida Wang, Kaiwen Tang, Weng-Fai Wong","title":"HyperSNN: A new efficient and robust deep learning model for resource\n  constrained control applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In light of the increasing adoption of edge computing in areas such as\nintelligent furniture, robotics, and smart homes, this paper introduces\nHyperSNN, an innovative method for control tasks that uses spiking neural\nnetworks (SNNs) in combination with hyperdimensional computing. HyperSNN\nsubstitutes expensive 32-bit floating point multiplications with 8-bit integer\nadditions, resulting in reduced energy consumption while enhancing robustness\nand potentially improving accuracy. Our model was tested on AI Gym benchmarks,\nincluding Cartpole, Acrobot, MountainCar, and Lunar Lander. HyperSNN achieves\ncontrol accuracies that are on par with conventional machine learning methods\nbut with only 1.36% to 9.96% of the energy expenditure. Furthermore, our\nexperiments showed increased robustness when using HyperSNN. We believe that\nHyperSNN is especially suitable for interactive, mobile, and wearable devices,\npromoting energy-efficient and robust system design. Furthermore, it paves the\nway for the practical implementation of complex algorithms like model\npredictive control (MPC) in real-world industrial scenarios.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:48:04 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 04:20:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yan","Zhanglu",""],["Wang","Shida",""],["Tang","Kaiwen",""],["Wong","Weng-Fai",""]]}
{"id":"2308.08223","submitter":"Mingwei Ma","authors":"Mingwei Ma, Binbin Ruan, Menghu Zhou, Yadong Gu, Qingxin Dong,\n  Qingsong Yang, Qiaoyu Wang, Lewei Chen, Yunqing Shi, Junkun Yi, Genfu Chen,\n  Zhian Ren","title":"Growth of millimeter-sized high-quality CuFeSe$_2$ single crystals by\n  the molten salt method and study of their semiconducting behavior","comments":null,"journal-ref":"Journal of Crystal Growth (2023)","doi":"10.1016/j.jcrysgro.2023.127398","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  An eutectic AlCl$_3$/KCl molten salt method in a horizontal configuration was\nemployed to grow millimeter-sized and composition homogeneous CuFeSe$_2$ single\ncrystals due to the continuous growth process in a temperature gradient induced\nsolution convection. The typical as-grown CuFeSe$_2$ single crystals in cubic\nforms are nearly 1.6$\\times$1.2$\\times$1.0 mm3 in size. The chemical\ncomposition and homogeneity of the crystals was examined by both inductively\ncoupled plasma atomic emission spectroscopy and energy dispersive spectrometer\nwith Cu:Fe:Se = 0.96:1.00:1.99 consistent with the stoichiometric composition\nof CuFeSe$_2$. The magnetic measurements suggest a ferrimagnetic or weak\nferromagnetic transition below T$_C$ = 146 K and the resistivity reveals a\nsemiconducting behavior and an abrupt increase below T$_C$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:48:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ma","Mingwei",""],["Ruan","Binbin",""],["Zhou","Menghu",""],["Gu","Yadong",""],["Dong","Qingxin",""],["Yang","Qingsong",""],["Wang","Qiaoyu",""],["Chen","Lewei",""],["Shi","Yunqing",""],["Yi","Junkun",""],["Chen","Genfu",""],["Ren","Zhian",""]]}
{"id":"2308.08224","submitter":"Sandra Gilhuber","authors":"Sandra Gilhuber, Rasmus Hvingelby, Mang Ling Ada Fok, Thomas Seidl","title":"How To Overcome Confirmation Bias in Semi-Supervised Image\n  Classification By Active Learning","comments":"Accepted @ ECML PKDD 2023. This is the author's version of the work.\n  The definitive Version of Record will be published in the Proceedings of ECML\n  PKDD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Do we need active learning? The rise of strong deep semi-supervised methods\nraises doubt about the usability of active learning in limited labeled data\nsettings. This is caused by results showing that combining semi-supervised\nlearning (SSL) methods with a random selection for labeling can outperform\nexisting active learning (AL) techniques. However, these results are obtained\nfrom experiments on well-established benchmark datasets that can overestimate\nthe external validity. However, the literature lacks sufficient research on the\nperformance of active semi-supervised learning methods in realistic data\nscenarios, leaving a notable gap in our understanding. Therefore we present\nthree data challenges common in real-world applications: between-class\nimbalance, within-class imbalance, and between-class similarity. These\nchallenges can hurt SSL performance due to confirmation bias. We conduct\nexperiments with SSL and AL on simulated data challenges and find that random\nsampling does not mitigate confirmation bias and, in some cases, leads to worse\nperformance than supervised learning. In contrast, we demonstrate that AL can\novercome confirmation bias in SSL in these realistic settings. Our results\nprovide insights into the potential of combining active and semi-supervised\nlearning in the presence of common real-world challenges, which is a promising\ndirection for robust methods when learning with limited labeled data in\nreal-world applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:52:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gilhuber","Sandra",""],["Hvingelby","Rasmus",""],["Fok","Mang Ling Ada",""],["Seidl","Thomas",""]]}
{"id":"2308.08225","submitter":"Junxin Che","authors":"Junxin Che and Ruquan You and Wenbin Chen and Haiwang Li","title":"Investigation on the Compressibility Characteristics of Low Mach Number\n  Laminar Flow in Rotating Channel","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 high-speed rotating channels, significant compressive effects are\nobserved, resulting in distinct flow characteristics compared to incompressible\nflows. In this study, we employed a finite volume method based on the simple\nalgorithm to solve for low-speed compressible laminar flow within rotating\nchannels using an orthogonal uniform grid. The governing equations include the\nfull Navier-Stokes equations and the energy equation. Contrary to stationary\nchannel, the alterations in flow within rotating channel are primarily\ninfluenced by the compressive effects of centrifugal force and the\ncompressibility of fluid within the flow's normal section. The first effect\ninvolves a reduction in the velocity due to centrifugal force, leading to an\nincreasing influence of the Coriolis force compared to inertial forces along\nthe flow direction. This trend in axial changes aligns closely with the\nincrease in rotation speed. The second effect arises from the increase in Mach\nnumber and the Coriolis compression, resulting in slight density differences\nwithin the cross-section. Strong centrifugal forces generate significant\ncentrifugal additional force (buoyancy force). Consequently, under the same\nlocal rotation number, the velocity profiles of the mainstream experience\nconsiderable changes. Additionally, higher Mach number significantly impact\nwall shear stress, with the leading side being notably affected. For instance,\nat a cross-sectional Ro = 0.6 and Ma = 0.035, the dimensionless shear stress on\nthe leading side decreased by 13%. Furthermore, while an increase in Mach\nnumber has minimal impact on the cross-sectional secondary flow structure,\nchanges in mainstream velocity profiles influence secondary flow intensity,\nresulting in an enhanced velocity peak and a shift towards the trailing side.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:52:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Che","Junxin",""],["You","Ruquan",""],["Chen","Wenbin",""],["Li","Haiwang",""]]}
{"id":"2308.08226","submitter":"Rohit Batra","authors":"Jan Michael Y. Carrillo, Vijith P, Tarak K. Patra, Zhan Chen, Thomas\n  P. Russell, Subramanian KRS Sankaranarayanan, Bobby G. Sumpter, Rohit Batra","title":"Accelerated Design of Block Copolymers: An Unbiased Exploration Strategy\n  via Fusion of Molecular Dynamics Simulations and Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Star block copolymers (s-BCPs) have potential applications as novel\nsurfactants or amphiphiles for emulsification, compatbilization, chemical\ntransformations and separations. s-BCPs are star-shaped macromolecules\ncomprised of linear chains of different chemical blocks (e.g., solvophilic and\nsolvophobic blocks) that are covalently joined at one junction point. Various\nparameters of these macromolecules can be tuned to obtain desired surface\nproperties, including the number of arms, composition of the arms, and the\ndegree-of-polymerization of the blocks (or the length of the arm). This makes\nidentification of the optimal s-BCP design highly non-trivial as the total\nnumber of plausible s-BCPs architectures is experimentally or computationally\nintractable. In this work, we use molecular dynamics (MD) simulations coupled\nwith reinforcement learning based Monte Carlo tree search (MCTS) to identify\ns-BCPs designs that minimize the interfacial tension between polar and\nnon-polar solvents. We first validate the MCTS approach for design of small-\nand medium-sized s-BCPs, and then use it to efficiently identify sequences of\ncopolymer blocks for large-sized s-BCPs. The structural origins of interfacial\ntension in these systems are also identified using the configurations obtained\nfrom MD simulations. Chemical insights on the arrangement of copolymer blocks\nthat promote lower interfacial tension were mined using machine learning (ML)\ntechniques. Overall, this work provides an efficient approach to solve design\nproblems via fusion of simulations and ML and provide important groundwork for\nfuture experimental investigation of s-BCPs sequences for various applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:58:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Carrillo","Jan Michael Y.",""],["P","Vijith",""],["Patra","Tarak K.",""],["Chen","Zhan",""],["Russell","Thomas P.",""],["Sankaranarayanan","Subramanian KRS",""],["Sumpter","Bobby G.",""],["Batra","Rohit",""]]}
{"id":"2308.08227","submitter":"Man Yao","authors":"Man Yao, Jiakui Hu, Guangshe Zhao, Yaoyuan Wang, Ziyang Zhang, Bo Xu,\n  Guoqi Li","title":"Inherent Redundancy in Spiking Neural Networks","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spiking Neural Networks (SNNs) are well known as a promising energy-efficient\nalternative to conventional artificial neural networks. Subject to the\npreconceived impression that SNNs are sparse firing, the analysis and\noptimization of inherent redundancy in SNNs have been largely overlooked, thus\nthe potential advantages of spike-based neuromorphic computing in accuracy and\nenergy efficiency are interfered. In this work, we pose and focus on three key\nquestions regarding the inherent redundancy in SNNs. We argue that the\nredundancy is induced by the spatio-temporal invariance of SNNs, which enhances\nthe efficiency of parameter utilization but also invites lots of noise spikes.\nFurther, we analyze the effect of spatio-temporal invariance on the\nspatio-temporal dynamics and spike firing of SNNs. Then, motivated by these\nanalyses, we propose an Advance Spatial Attention (ASA) module to harness SNNs'\nredundancy, which can adaptively optimize their membrane potential distribution\nby a pair of individual spatial attention sub-modules. In this way, noise spike\nfeatures are accurately regulated. Experimental results demonstrate that the\nproposed method can significantly drop the spike firing with better performance\nthan state-of-the-art SNN baselines. Our code is available in\n\\url{https://github.com/BICLab/ASA-SNN}.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:58:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yao","Man",""],["Hu","Jiakui",""],["Zhao","Guangshe",""],["Wang","Yaoyuan",""],["Zhang","Ziyang",""],["Xu","Bo",""],["Li","Guoqi",""]]}
{"id":"2308.08228","submitter":"Satoshi Kuriki","authors":"Satoshi Kuriki","title":"Expected Euler characteristic method for the largest eigenvalue:\n  (Skew-)orthogonal polynomial approach","comments":"30 pages, 3 figures, 3 tables","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":"  The expected Euler characteristic (EEC) method is an integral-geometric\nmethod used to approximate the tail probability of the maximum of a random\nfield on a manifold. Noting that the largest eigenvalue of a real-symmetric or\nHermitian matrix is the maximum of the quadratic form of a unit vector, we\nprovide EEC approximation formulas for the tail probability of the largest\neigenvalue of orthogonally invariant random matrices of a large class. For this\npurpose, we propose a version of a skew-orthogonal polynomial by adding a side\ncondition such that it is uniquely defined, and describe the EEC formulas in\nterms of the (skew-)orthogonal polynomials. In addition, for the classical\nrandom matrices (Gaussian, Wishart, and multivariate beta matrices), we analyze\nthe limiting behavior of the EEC approximation as the matrix size goes to\ninfinity under the so-called edge-asymptotic normalization. It is shown that\nthe limit of the EEC formula approximates well the Tracy-Widom distributions in\nthe upper tail area, as does the EEC formula when the matrix size is finite.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:00:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kuriki","Satoshi",""]]}
{"id":"2308.08229","submitter":"Wenshuo Li","authors":"Lei Guo, Wenshuo Li, Yukai Zhu, Xiang Yu, Zidong Wang","title":"Composite Disturbance Filtering: A Novel State Estimation Scheme for\n  Systems With Multi-Source, Heterogeneous, and Isomeric Disturbances","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":"  State estimation has long been a fundamental problem in signal processing and\ncontrol areas. The main challenge is to design filters with ability to reject\nor attenuate various disturbances. With the arrival of big data era, the\ndisturbances of complicated systems are physically multi-source, mathematically\nheterogenous, affecting the system dynamics via isomeric (additive,\nmultiplicative and recessive) channels, and deeply coupled with each other. In\ntraditional filtering schemes, the multi-source heterogenous disturbances are\nusually simplified as a lumped one so that the \"single\" disturbance can be\neither rejected or attenuated. Since the pioneering work in 2012, a novel state\nestimation methodology called {\\it composite disturbance filtering} (CDF) has\nbeen proposed, which deals with the multi-source, heterogenous, and isomeric\ndisturbances based on their specific characteristics. With the CDF, enhanced\nanti-disturbance capability can be achieved via refined quantification,\neffective separation, and simultaneous rejection and attenuation of the\ndisturbances. In this paper, an overview of the CDF scheme is provided, which\nincludes the basic principle, general design procedure, application scenarios\n(e.g. alignment, localization and navigation), and future research directions.\nIn summary, it is expected that the CDF offers an effective tool for state\nestimation, especially in the presence of multi-source heterogeneous\ndisturbances.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:03:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guo","Lei",""],["Li","Wenshuo",""],["Zhu","Yukai",""],["Yu","Xiang",""],["Wang","Zidong",""]]}
{"id":"2308.08230","submitter":"Xue Xinghua","authors":"Xinghua Xue, Cheng Liu, Bo Liu, Haitong Huang, Ying Wang, Tao Luo, Lei\n  Zhang, Huawei Li, Xiaowei Li","title":"Exploring Winograd Convolution for Cost-effective Neural Network Fault\n  Tolerance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Winograd is generally utilized to optimize convolution performance and\ncomputational efficiency because of the reduced multiplication operations, but\nthe reliability issues brought by winograd are usually overlooked. In this\nwork, we observe the great potential of winograd convolution in improving\nneural network (NN) fault tolerance. Based on the observation, we evaluate\nwinograd convolution fault tolerance comprehensively from different\ngranularities ranging from models, layers, and operation types for the first\ntime. Then, we explore the use of inherent fault tolerance of winograd\nconvolution for cost-effective NN protection against soft errors. Specifically,\nwe mainly investigate how winograd convolution can be effectively incorporated\nwith classical fault-tolerant design approaches including triple modular\nredundancy (TMR), fault-aware retraining, and constrained activation functions.\nAccording to our experiments, winograd convolution can reduce the\nfault-tolerant design overhead by 55.77\\% on average without any accuracy loss\ncompared to standard convolution, and further reduce the computing overhead by\n17.24\\% when the inherent fault tolerance of winograd convolution is\nconsidered. When it is applied on fault-tolerant neural networks enhanced with\nfault-aware retraining and constrained activation functions, the resulting\nmodel accuracy generally shows significant improvement in presence of various\nfaults.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:03:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xue","Xinghua",""],["Liu","Cheng",""],["Liu","Bo",""],["Huang","Haitong",""],["Wang","Ying",""],["Luo","Tao",""],["Zhang","Lei",""],["Li","Huawei",""],["Li","Xiaowei",""]]}
{"id":"2308.08231","submitter":"Chenyangguang Zhang","authors":"Chenyangguang Zhang, Yan Di, Ruida Zhang, Guangyao Zhai, Fabian\n  Manhardt, Federico Tombari and Xiangyang Ji","title":"DDF-HO: Hand-Held Object Reconstruction via Conditional Directed\n  Distance Field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconstructing hand-held objects from a single RGB image is an important and\nchallenging problem. Existing works utilizing Signed Distance Fields (SDF)\nreveal limitations in comprehensively capturing the complex hand-object\ninteractions, since SDF is only reliable within the proximity of the target,\nand hence, infeasible to simultaneously encode local hand and object cues. To\naddress this issue, we propose DDF-HO, a novel approach leveraging Directed\nDistance Field (DDF) as the shape representation. Unlike SDF, DDF maps a ray in\n3D space, consisting of an origin and a direction, to corresponding DDF values,\nincluding a binary visibility signal determining whether the ray intersects the\nobjects and a distance value measuring the distance from origin to target in\nthe given direction. We randomly sample multiple rays and collect local to\nglobal geometric features for them by introducing a novel 2D ray-based feature\naggregation scheme and a 3D intersection-aware hand pose embedding, combining\n2D-3D features to model hand-object interactions. Extensive experiments on\nsynthetic and real-world datasets demonstrate that DDF-HO consistently\noutperforms all baseline methods by a large margin, especially under Chamfer\nDistance, with about 80% leap forward. Codes and trained models will be\nreleased soon.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:06:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Chenyangguang",""],["Di","Yan",""],["Zhang","Ruida",""],["Zhai","Guangyao",""],["Manhardt","Fabian",""],["Tombari","Federico",""],["Ji","Xiangyang",""]]}
{"id":"2308.08232","submitter":"Andrew Butler","authors":"Andrew Butler","title":"SCQPTH: an efficient differentiable splitting method for convex\n  quadratic programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present SCQPTH: a differentiable first-order splitting method for convex\nquadratic programs. The SCQPTH framework is based on the alternating direction\nmethod of multipliers (ADMM) and the software implementation is motivated by\nthe state-of-the art solver OSQP: an operating splitting solver for convex\nquadratic programs (QPs). The SCQPTH software is made available as an\nopen-source python package and contains many similar features including\nefficient reuse of matrix factorizations, infeasibility detection, automatic\nscaling and parameter selection. The forward pass algorithm performs operator\nsplitting in the dimension of the original problem space and is therefore\nsuitable for large scale QPs with $100-1000$ decision variables and thousands\nof constraints. Backpropagation is performed by implicit differentiation of the\nADMM fixed-point mapping. Experiments demonstrate that for large scale QPs,\nSCQPTH can provide a $1\\times - 10\\times$ improvement in computational\nefficiency in comparison to existing differentiable QP solvers.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:06:54 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Butler","Andrew",""]]}
{"id":"2308.08233","submitter":"Philipp F\\\"urst","authors":"Philipp F\\\"urst (for the IceCube Collaboration)","title":"Galactic and Extragalactic Analysis of the Astrophysical Muon Neutrino\n  Flux with 12.3 years of IceCube Track Data","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":"Proceedings of Science 444 (2023) 1046","doi":"10.22323/1.444.1046","report-no":"PoS-ICRC2023-1046","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Ice Cube Neutrino Observatory has been measuring an isotropic\nastrophysical neutrino flux in multiple detection channels for almost a decade.\nGalactic diffuse emission, which arises from the interactions between cosmic\nrays and the interstellar medium, is an expected signal in IceCube. The\nsuperposition of an extragalactic flux and a galactic flux results in\ndirectional structure and variations in the spectrum. In this work, we use 12.3\nyears of high-purity muon-neutrino induced muon track data to perform a\ndedicated search for this galactic emission, combined with a spectral\nmeasurement of the isotropic astrophysical neutrino flux. To distinguish a\ngalactic component from the dominant atmospheric and isotropic astrophysical\ncomponents, the precise directional information available for muon tracks is\nfully utilized in a three-dimensional forward folding likelihood fit. We test a\nstate-of-the-art model prediction of galactic diffuse emission based on recent\ncosmic ray data (CRINGE). We fit this prediction as a template scaled by a\nfactor $\\Psi_{\\mathrm{CRINGE}}$, and find $2.9\\pm 1.1 \\times\n\\Psi_{\\mathrm{CRINGE}}$ with a significance of $2.7\\sigma$ in an energy range\nbetween 400 GeV and 60 TeV in the Northern Sky.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:10:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["F\u00fcrst","Philipp","","for the IceCube Collaboration"]]}
{"id":"2308.08234","submitter":"Lovre Torbarina","authors":"Lovre Torbarina, Tin Ferkovic, Lukasz Roguski, Velimir Mihelcic, Bruno\n  Sarlija, Zeljko Kraljevic","title":"Challenges and Opportunities of Using Transformer-Based Multi-Task\n  Learning in NLP Through ML Lifecycle: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The increasing adoption of natural language processing (NLP) models across\nindustries has led to practitioners' need for machine learning systems to\nhandle these models efficiently, from training to serving them in production.\nHowever, training, deploying, and updating multiple models can be complex,\ncostly, and time-consuming, mainly when using transformer-based pre-trained\nlanguage models. Multi-Task Learning (MTL) has emerged as a promising approach\nto improve efficiency and performance through joint training, rather than\ntraining separate models. Motivated by this, we first provide an overview of\ntransformer-based MTL approaches in NLP. Then, we discuss the challenges and\nopportunities of using MTL approaches throughout typical ML lifecycle phases,\nspecifically focusing on the challenges related to data engineering, model\ndevelopment, deployment, and monitoring phases. This survey focuses on\ntransformer-based MTL architectures and, to the best of our knowledge, is novel\nin that it systematically analyses how transformer-based MTL in NLP fits into\nML lifecycle phases. Furthermore, we motivate research on the connection\nbetween MTL and continual learning (CL), as this area remains unexplored. We\nbelieve it would be practical to have a model that can handle both MTL and CL,\nas this would make it easier to periodically re-train the model, update it due\nto distribution shifts, and add new capabilities to meet real-world\nrequirements.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:11:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Torbarina","Lovre",""],["Ferkovic","Tin",""],["Roguski","Lukasz",""],["Mihelcic","Velimir",""],["Sarlija","Bruno",""],["Kraljevic","Zeljko",""]]}
{"id":"2308.08235","submitter":"Bingxu Zhang","authors":"Bingxu Zhang, Changjun Fan, Shixuan Liu, Kuihua Huang, Xiang Zhao,\n  Jincai Huang, Zhong Liu","title":"The Expressive Power of Graph Neural Networks: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph neural networks (GNNs) are effective machine learning models for many\ngraph-related applications. Despite their empirical success, many research\nefforts focus on the theoretical limitations of GNNs, i.e., the GNNs expressive\npower. Early works in this domain mainly focus on studying the graph\nisomorphism recognition ability of GNNs, and recent works try to leverage the\nproperties such as subgraph counting and connectivity learning to characterize\nthe expressive power of GNNs, which are more practical and closer to\nreal-world. However, no survey papers and open-source repositories\ncomprehensively summarize and discuss models in this important direction. To\nfill the gap, we conduct a first survey for models for enhancing expressive\npower under different forms of definition. Concretely, the models are reviewed\nbased on three categories, i.e., Graph feature enhancement, Graph topology\nenhancement, and GNNs architecture enhancement.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:12:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Bingxu",""],["Fan","Changjun",""],["Liu","Shixuan",""],["Huang","Kuihua",""],["Zhao","Xiang",""],["Huang","Jincai",""],["Liu","Zhong",""]]}
{"id":"2308.08236","submitter":"Jianji  Dong","authors":"Shiji Zhang, Haojun Zhou, Bo Wu, Xueyi Jiang, Dingshan Gao, Jing Xu,\n  Jianji Dong, Xinliang Zhang","title":"Redundancy-free integrated optical convolver for optical neural networks\n  based on arrayed waveguide grating","comments":"The data are not sufficiently detailed and need to be supplemented\n  with some detailed data","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optical neural networks (ONNs) have gained significant attention due to their\npotential for high-speed and energy-efficient computation in artificial\nintelligence. The implementation of optical convolutions plays a vital role in\nONNs, as they are fundamental operations within neural network architectures.\nHowever, state-of-the-art convolution architectures often suffer from redundant\ninputs, leading to substantial resource waste. Here, we propose an integrated\noptical convolution architecture that leverages the inherent routing principles\nof arrayed waveguide grating (AWG) to execute the sliding of convolution kernel\nand summation of results. M*N multiply-accumulate (MAC) operations are\nfacilitated by M+N units within a single clock cycle, thus eliminating the\nredundancy. In the experiment, we achieved 5-bit precision and 91.9% accuracy\nin the handwritten digit recognition task confirming the reliability of our\napproach. Its redundancy-free architecture, low power consumption, high compute\ndensity (8.53 teraOP mm^-2 s^-1) and scalability make it a valuable\ncontribution to the field of optical neural networks, thereby paving the way\nfor future advancements in high-performance computing and artificial\nintelligence applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:13:13 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:56:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Shiji",""],["Zhou","Haojun",""],["Wu","Bo",""],["Jiang","Xueyi",""],["Gao","Dingshan",""],["Xu","Jing",""],["Dong","Jianji",""],["Zhang","Xinliang",""]]}
{"id":"2308.08237","submitter":"Rakesh Jana Dr.","authors":"Ali Azimi, Rakesh Jana, Mukesh Kumar Nagar, Sivaramakrishnan\n  Sivasubramanian","title":"The maximum four point condition matrix of a tree","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":"  $\\newcommand{\\Max}{\\mathrm{Max4PC}}$ The Four point condition (4PC\nhenceforth) is a well known condition characterising distances in trees $T$.\nLet $w,x,y,z$ be four vertices in $T$ and let $d_{x,y}$ denote the distance\nbetween vertices $x,y$ in $T$. The 4PC condition says that among the three\nterms $d_{w,x} + d_{y,z}$, $d_{w,y} + d_{x,z}$ and $d_{w,z} + d_{x,y}$ the\nmaximum value equals the second maximum value.\n  We define an $\\binom{n}{2} \\times \\binom{n}{2}$ sized matrix $\\Max_T$ from a\ntree $T$ where the rows and columns are indexed by size-2 subsets. The entry of\n$\\Max_T$ corresponding to the row indexed by $\\{w,x\\}$ and column $\\{y,z\\}$ is\nthe maximum value among the three terms $d_{w,x} + d_{y,z}$, $d_{w,y} +\nd_{x,z}$ and $d_{w,z} + d_{x,y}$. In this work, we determine basic properties\nof this matrix like rank, give an algorithm that outputs a family of bases, and\nfind the determinant of $\\Max_T$ when restricted to our basis. We further\ndetermine the inertia and the Smith Normal Form (SNF) of $\\Max_T$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:14:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Azimi","Ali",""],["Jana","Rakesh",""],["Nagar","Mukesh Kumar",""],["Sivasubramanian","Sivaramakrishnan",""]]}
{"id":"2308.08238","submitter":"Adam B. Cahaya","authors":"Muzakkiy P. M. Akhir, Edi Suprayoga, Adam B. Cahaya","title":"Stabilization and helicity control of hybrid magnetic skyrmion","comments":"9 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":"  The hybrid skyrmion, a type of magnetic skyrmion with intermediate helicity\nbetween Bloch and N\\'eel skyrmion, has gained more attraction. It is tolerant\ntoward the skyrmion Hall effect and a potential candidate for quantum bits. We\ninvestigated the stabilization and helicity control of the hybrid skyrmion in a\ntwo-dimensional magnetic system using an analytical model and micromagnetic\nsimulation. We look at the interplaying factors of the bulk ($D_b$) and\ninterfacial ($D_i$) Dzyaloshinskii-Moriya (DM) interactions along with the\ndipolar interaction. We show that the hybrid skyrmion can stabilize through the\ninterplay between interfacial DM and either bulk DM or dipolar interaction. We\ncan also control the helicity of the hybrid skyrmion by tuning the ratio of\n$D_i/D_b$ when there is no dipolar interaction, or simply by adjusting the\n$D_i$ when the $D_b$ is absent. Our results suggest that hybrid skyrmions can\nexist within $0 < |D_i| < 0.4$ mJ/m$^2$ for Co-based magnetic systems.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:14:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Akhir","Muzakkiy P. M.",""],["Suprayoga","Edi",""],["Cahaya","Adam B.",""]]}
{"id":"2308.08239","submitter":"Junru Lu","authors":"Junru Lu, Siyu An, Mingbao Lin, Gabriele Pergola, Yulan He, Di Yin,\n  Xing Sun, Yunsheng Wu","title":"MemoChat: Tuning LLMs to Use Memos for Consistent Long-Range Open-Domain\n  Conversation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose MemoChat, a pipeline for refining instructions that enables large\nlanguage models (LLMs) to effectively employ self-composed memos for\nmaintaining consistent long-range open-domain conversations. We demonstrate a\nlong-range open-domain conversation through iterative\n\"memorization-retrieval-response\" cycles. This requires us to carefully design\ntailored tuning instructions for each distinct stage. The instructions are\nreconstructed from a collection of public datasets to teach the LLMs to\nmemorize and retrieve past dialogues with structured memos, leading to enhanced\nconsistency when participating in future conversations. We invite experts to\nmanually annotate a test set designed to evaluate the consistency of long-range\nconversations questions. Experiments on three testing scenarios involving both\nopen-source and API-accessible chatbots at scale verify the efficacy of\nMemoChat, which outperforms strong baselines. Our codes, data and models are\navailable here: https://github.com/LuJunru/MemoChat.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:15:18 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 03:37:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lu","Junru",""],["An","Siyu",""],["Lin","Mingbao",""],["Pergola","Gabriele",""],["He","Yulan",""],["Yin","Di",""],["Sun","Xing",""],["Wu","Yunsheng",""]]}
{"id":"2308.08240","submitter":"T Kavaskar","authors":"T. Kavaskar","title":"Boundes for Boxicity of some classes of graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $box(G)$ be the boxicity of a graph $G$, $G[H_1,H_2,\\ldots, H_n]$ be the\n$G$-generalized join graph of $n$-pairwise disjoint graphs $H_1,H_2,\\ldots,\nH_n$, $G^d_k$ be a circular clique graph (where $k\\geq 2d$) and $\\Gamma(R)$ be\nthe zero-divisor graph of a commutative ring $R$. In this paper, we prove that\n$\\chi(G^d_k)\\geq box(G^d_k)$, for all $k$ and $d$ with $k\\geq 2d$. This\ngeneralizes the results proved in \\cite{Aki}. Also we obtain that\n$box(G[H_1,H_2,\\ldots,H_n])\\leq \\mathop\\sum\\limits_{i=1}^nbox(H_i)$. As a\nconsequence of this result, we obtain a bound for boxicity of zero-divisor\ngraph of a finite commutative ring with unity. In particular, if $R$ is a\nfinite commutative non-zero reduced ring with unity, then $\\chi(\\Gamma(R))\\leq\nbox(\\Gamma(R))\\leq 2^{\\chi(\\Gamma(R))}-2$. where $\\chi(\\Gamma(R))$ is the\nchromatic number of $\\Gamma(R)$. Moreover, we show that if $N=\n\\prod\\limits_{i=1}^{a}p_i^{2n_i} \\prod\\limits_{j=1}^{b}q_j^{2m_j+1}$ is a\ncomposite number, where $p_i$'s and $q_j$'s are distinct prime numbers, then\n$box(\\Gamma(\\mathbb{Z}_N))\\leq\n\\big(\\mathop\\prod\\limits_{i=1}^{a}(2n_i+1)\\mathop\\prod\\limits_{j=1}^{b}(2m_j+2)\\big)-\\big(\\mathop\\prod\\limits_{i=1}^{a}(n_i+1)\\mathop\\prod\\limits_{j=1}^{b}(m_j+1)\\big)-1$,\nwhere $\\mathbb{Z}_N$ is the ring of integers modulo $N$. Further, we prove\nthat, $box(\\Gamma(\\mathbb{Z}_N))=1$ if and only if either $N=p^n$ for some\nprime number $p$ and some positive integer $n\\geq 2$ or $N=2p$ for some odd\nprime number $p$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:15:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kavaskar","T.",""]]}
{"id":"2308.08241","submitter":"Chenxi Sun","authors":"Chenxi Sun and Yaliang Li and Hongyan Li and Shenda Hong","title":"TEST: Text Prototype Aligned Embedding to Activate LLM's Ability for\n  Time Series","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work summarizes two strategies for completing time-series (TS) tasks\nusing today's language model (LLM): LLM-for-TS, design and train a fundamental\nlarge model for TS data; TS-for-LLM, enable the pre-trained LLM to handle TS\ndata. Considering the insufficient data accumulation, limited resources, and\nsemantic context requirements, this work focuses on TS-for-LLM methods, where\nwe aim to activate LLM's ability for TS data by designing a TS embedding method\nsuitable for LLM. The proposed method is named TEST. It first tokenizes TS,\nbuilds an encoder to embed them by instance-wise, feature-wise, and\ntext-prototype-aligned contrast, and then creates prompts to make LLM more open\nto embeddings, and finally implements TS tasks. Experiments are carried out on\nTS classification and forecasting tasks using 8 LLMs with different structures\nand sizes. Although its results cannot significantly outperform the current\nSOTA models customized for TS tasks, by treating LLM as the pattern machine, it\ncan endow LLM's ability to process TS data without compromising the language\nability. This paper is intended to serve as a foundational work that will\ninspire further research.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:16:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sun","Chenxi",""],["Li","Yaliang",""],["Li","Hongyan",""],["Hong","Shenda",""]]}
{"id":"2308.08242","submitter":"Ali Zoljodi","authors":"Ali Zoljodi, Sadegh Abadijou, Mina Alibeigi, Masoud Daneshtalab","title":"Contrastive Learning for Lane Detection via Cross-Similarity","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Detecting road lanes is challenging due to intricate markings vulnerable to\nunfavorable conditions. Lane markings have strong shape priors, but their\nvisibility is easily compromised. Factors like lighting, weather, vehicles,\npedestrians, and aging colors challenge the detection. A large amount of data\nis required to train a lane detection approach that can withstand natural\nvariations caused by low visibility. This is because there are numerous lane\nshapes and natural variations that exist. Our solution, Contrastive Learning\nfor Lane Detection via cross-similarity (CLLD), is a self-supervised learning\nmethod that tackles this challenge by enhancing lane detection models\nresilience to real-world conditions that cause lane low visibility. CLLD is a\nnovel multitask contrastive learning that trains lane detection approaches to\ndetect lane markings even in low visible situations by integrating local\nfeature contrastive learning (CL) with our new proposed operation\ncross-similarity. Local feature CL focuses on extracting features for small\nimage parts, which is necessary to localize lane segments, while\ncross-similarity captures global features to detect obscured lane segments\nusing their surrounding. We enhance cross-similarity by randomly masking parts\nof input images for augmentation. Evaluated on benchmark datasets, CLLD\noutperforms state-of-the-art contrastive learning, especially in\nvisibility-impairing conditions like shadows. Compared to supervised learning,\nCLLD excels in scenarios like shadows and crowded scenes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:16:05 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 11:13:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zoljodi","Ali",""],["Abadijou","Sadegh",""],["Alibeigi","Mina",""],["Daneshtalab","Masoud",""]]}
{"id":"2308.08243","submitter":"Jorge Peixinho","authors":"Anna Dmochowska, Jorge Peixinho, Cyrille Sollogoub, Guillaume\n  Miquelard-Garnier","title":"Extensional Viscosity of Immiscible Polymers Multinanolayer Films:\n  Signature of the Interphase","comments":"6 figures","journal-ref":null,"doi":"10.1021/acs.macromol.3c00288","report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The measurement of interfacial mechanical or rheological properties in\npolymer blends is a challenging task, as well as providing a quantitative link\nbetween these properties and the interfacial nanostructure. Here, we perform a\nsystematic study of the extensional rheology of multilayer films of an\nimmsicible polymer pair, polystyrene and poly(methyl methacrylate). We take\nadvantage of multinanolayer coextrusion to increase the number of interfaces up\nto thousands, consequently magnifying the interfacial response of the films.\nThe transient elongational response is compared to an addivity rule model based\non the summation of the contribution of each polymer as well as the interfacial\none. At low strain rates, the model reproduces the transient extensional\nviscosity up to strain-thinning, while at larger ones, the extra stress exceeds\nthe prediction based on constant interfacial tension. This extra-contribution\nis attributed to an interphase modulus on the order of 1-10 MPa, which\nincreases with strain rate following a power-law with an exponent 1/3.\nExtensional rheology of multinanolayer films is then an efficient combination\nto go beyond interfacial tension and measure quantitatively the interfacial\nrheology of immiscible polymer blends.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:20:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dmochowska","Anna",""],["Peixinho","Jorge",""],["Sollogoub","Cyrille",""],["Miquelard-Garnier","Guillaume",""]]}
{"id":"2308.08244","submitter":"Xueyan Niu","authors":"Xueyan Niu, Xu Wang, Deniz G\\\"und\\\"uz, Bo Bai, Weichao Chen, Guohua\n  Zhou","title":"A Hybrid Wireless Image Transmission Scheme with Diffusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose a hybrid joint source-channel coding (JSCC) scheme, in which the\nconventional digital communication scheme is complemented with a generative\nrefinement component to improve the perceptual quality of the reconstruction.\nThe input image is decomposed into two components: the first is a coarse\ncompressed version, and is transmitted following the conventional separation\nbased approach. An additional component is obtained through the diffusion\nprocess by adding independent Gaussian noise to the input image, and is\ntransmitted using DeepJSCC. The decoder combines the two signals to produce a\nhigh quality reconstruction of the source. Experimental results show that the\nhybrid design provides bandwidth savings and enables graceful performance\nimprovement as the channel quality improves.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:20:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Niu","Xueyan",""],["Wang","Xu",""],["G\u00fcnd\u00fcz","Deniz",""],["Bai","Bo",""],["Chen","Weichao",""],["Zhou","Guohua",""]]}
{"id":"2308.08245","submitter":"Shao-Hen Chiew Mr","authors":"Shao-Hen Chiew, Kilian Poirier, Rajesh Mishra, Ulrike Bornheimer, Ewan\n  Munro, Si Han Foon, Christopher Wanru Chen, Wei Sheng Lim, Chee Wei Nga","title":"Multi-Objective Optimization and Network Routing with Near-Term Quantum\n  Computers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-objective optimization is a ubiquitous problem that arises naturally in\nmany scientific and industrial areas. Network routing optimization with\nmulti-objective performance demands falls into this problem class, and finding\ngood quality solutions at large scales is generally challenging. In this work,\nwe develop a scheme with which near-term quantum computers can be applied to\nsolve multi-objective combinatorial optimization problems. We study the\napplication of this scheme to the network routing problem in detail, by first\nmapping it to the multi-objective shortest path problem. Focusing on an\nimplementation based on the quantum approximate optimization algorithm (QAOA)\n-- the go-to approach for tackling optimization problems on near-term quantum\ncomputers -- we examine the Pareto plot that results from the scheme, and\nqualitatively analyze its ability to produce Pareto-optimal solutions. We\nfurther provide theoretical and numerical scaling analyses of the resource\nrequirements and performance of QAOA, and identify key challenges associated\nwith this approach. Finally, through Amazon Braket we execute small-scale\nimplementations of our scheme on the IonQ Harmony 11-qubit quantum computer.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:22:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chiew","Shao-Hen",""],["Poirier","Kilian",""],["Mishra","Rajesh",""],["Bornheimer","Ulrike",""],["Munro","Ewan",""],["Foon","Si Han",""],["Chen","Christopher Wanru",""],["Lim","Wei Sheng",""],["Nga","Chee Wei",""]]}
{"id":"2308.08246","submitter":"Lexian Yang Prof.","authors":"R. Z. Xu, X. Du, J. S. Zhou, X. Gu, Q. Q. Zhang, Y. D. Li, W. X. Zhao,\n  F. W. Zheng, M. Arita, K. Shimada, T. K. Kim, C. Cacho, Y. F. Guo, Z. K. Liu,\n  Y. L. Chen, L. X. Yang","title":"Orbital-selective charge-density wave in TaTe$_4$","comments":"to appear in npj Quantum Materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  TaTe$_4$, a metallic charge-density wave (CDW) material discovered decades\nago, has attracted renewed attention due to its rich interesting properties\nsuch as pressure-induced superconductivity and candidate non-trivial\ntopological phase. Here, using high-resolution angle-resolved photoemission\nspectroscopy and ab-initio calculation, we systematically investigate the\nelectronic structure of TaTe$_4$. At 26 K, we observe a CDW gap as large as 290\nmeV, which persists up to 500 K. The CDW-modulated band structure shows a\ncomplex reconstruction that closely correlates with the lattice distortion.\nInside the CDW gap, there exist highly dispersive energy bands contributing to\nthe remnant Fermi surface and metallic behavior in the CDW state.\nInterestingly, our ab-initio calculation reveals that the large CDW gap mainly\nopens in the electronic states with out-of-plane orbital components, while the\nin-gap metallic states originate from in-plane orbitals, suggesting an orbital\ntexture that couples with the CDW order. Our results shed light on the\ninterplay between electron, lattice, and orbital in quasi-one-dimensional CDW\nmaterials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:25:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","R. Z.",""],["Du","X.",""],["Zhou","J. S.",""],["Gu","X.",""],["Zhang","Q. Q.",""],["Li","Y. D.",""],["Zhao","W. X.",""],["Zheng","F. W.",""],["Arita","M.",""],["Shimada","K.",""],["Kim","T. K.",""],["Cacho","C.",""],["Guo","Y. F.",""],["Liu","Z. K.",""],["Chen","Y. L.",""],["Yang","L. X.",""]]}
{"id":"2308.08247","submitter":"Jingzhao Zhang","authors":"Pengkun Yang, Jingzhao Zhang","title":"Two Phases of Scaling Laws for Nearest Neighbor Classifiers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A scaling law refers to the observation that the test performance of a model\nimproves as the number of training data increases. A fast scaling law implies\nthat one can solve machine learning problems by simply boosting the data and\nthe model sizes. Yet, in many cases, the benefit of adding more data can be\nnegligible. In this work, we study the rate of scaling laws of nearest neighbor\nclassifiers. We show that a scaling law can have two phases: in the first\nphase, the generalization error depends polynomially on the data dimension and\ndecreases fast; whereas in the second phase, the error depends exponentially on\nthe data dimension and decreases slowly. Our analysis highlights the complexity\nof the data distribution in determining the generalization error. When the data\ndistributes benignly, our result suggests that nearest neighbor classifier can\nachieve a generalization error that depends polynomially, instead of\nexponentially, on the data dimension.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:28:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yang","Pengkun",""],["Zhang","Jingzhao",""]]}
{"id":"2308.08248","submitter":"Sebastiano Peotta","authors":"Sebastiano Peotta, Kukka-Emilia Huhtinen, P\\\"aivi T\\\"orm\\\"a","title":"Quantum geometry in superfluidity and superconductivity","comments":"32 pages, 1 figure, Lecture notes for the Proceedings of the\n  International School of Physics \"Enrico Fermi\" Course 211 \"Quantum Mixtures\n  with Ultra-Cold Atoms\" (Varenna, Italy, 2022)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.supr-con quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the theoretical description of the role of quantum geometry in\nsuperfluidity and superconductivity of multiband systems, with focus on flat\nbands where quantum geometry is wholly responsible for supercurrents. This\nreview differs from previous ones in that it is based on the most recent\nunderstanding of the theory: the dependence of the self-consistent order\nparameter on the supercurrent is properly taken into account, and the\nsuperfluid weight in a flat band becomes proportional to the minimal quantum\nmetric. We provide a recap of basic quantum geometric quantities and the\nconcept of superfluid density. The geometric contribution of superconductivity\nis introduced via considering the two-body problem. The superfluid weight of a\nmultiband system is derived within mean-field theory, leading to a topological\nbound of flat band superconductivity. The physical interpretation of the flat\nband supercurrent in terms of Wannier function overlaps is discussed.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:31:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Peotta","Sebastiano",""],["Huhtinen","Kukka-Emilia",""],["T\u00f6rm\u00e4","P\u00e4ivi",""]]}
{"id":"2308.08249","submitter":"Joe Kamimoto","authors":"Joe Kamimoto","title":"The asymptotic behavior of the Bergman kernel on pseudoconvex model\n  domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the asymptotic behavior of the Bergman kernel\nat the boundary for some pseudoconvex model domains. This behavior can be\ndescribed by the geometrical information of the Newton polyhedron of the\ndefining function of the respective domains. We deal with not only the finite\ntype cases but also some infinite type cases.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:33:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kamimoto","Joe",""]]}
{"id":"2308.08250","submitter":"Rima Stonkut\\.e","authors":"Eimantas Krisciunas, Karolis Daugevicius, Rima Stonkute, and Vladas\n  Vansevicius (Center for Physical Sciences and Technology, Vilnius, Lithuania)","title":"Deriving physical parameters of unresolved star clusters. VII. Adaptive\n  aperture photometry of the M31 PHAT star clusters","comments":"8 pages, 8 figures, accepted in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work is the seventh study in a series dedicated to investigating\ndegeneracies of simultaneous age, mass, extinction, and metallicity\ndeterminations of partially resolved or unresolved star clusters with Hubble\nSpace Telescope broadband aperture photometry. In the sixth work (hereafter,\nPaper I), it was demonstrated that the adaptive aperture photometry, performed\nto avoid the majority of the projected foreground and background stars falling\nwithin the apertures, gives more consistent colour indices for star clusters.\nIn this study, we aim to supplement the homogeneous multi-colour aperture\nphotometry results published in Paper~I and provide a complete M31 Panchromatic\nHubble Andromeda Treasury (PHAT) survey star cluster photometry catalogue for\nfurther analysis. Following Paper I, we used a two-aperture approach for\nphotometry. The first aperture is the standard one used to measure total\ncluster fluxes. The second (smaller) aperture is introduced to avoid the bright\nforeground and background stars projecting onto the clusters. We selected the\nradii of smaller apertures to be larger than the half-light radii of the\nclusters. We present the second part of the star cluster aperture photometry\ncatalogues for a sample of 1477 star clusters from the M31 PHAT survey not\ncovered in Paper I. Compared to the M31 PHAT star cluster aperture photometry\ncatalogue published by Johnson et al., adjustments were made to the cluster\ncentre coordinates, aperture sizes, and sky background levels.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:34:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Krisciunas","Eimantas","","Center for Physical Sciences and Technology, Vilnius, Lithuania"],["Daugevicius","Karolis","","Center for Physical Sciences and Technology, Vilnius, Lithuania"],["Stonkute","Rima","","Center for Physical Sciences and Technology, Vilnius, Lithuania"],["Vansevicius","Vladas","","Center for Physical Sciences and Technology, Vilnius, Lithuania"]]}
{"id":"2308.08251","submitter":"Pierluigi Colli","authors":"Pierluigi Colli, Gianni Gilardi, Gabriela Marinoschi","title":"Global solution and optimal control of an epidemic propagation with a\n  heterogeneous diffusion","comments":"Keywords: existence and uniqueness of solutions, optimal control in\n  coefficients, partial differential equations, reaction-diffusion system,\n  epidemic models, COVID- 19","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we explore the solvability and the optimal control problem for\na compartmental model based on reaction-diffusion partial differential\nequations describing a transmissible disease. The nonlinear model takes into\naccount the disease spreading due to the human social diffusion, under a\ndynamic heterogeneity in infection risk. The analysis of the resulting system\nprovides the existence proof for a global solution and determines the\nconditions of optimality to reduce the concentration of the infected population\nin certain spatial areas.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:34:59 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 15:28:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Colli","Pierluigi",""],["Gilardi","Gianni",""],["Marinoschi","Gabriela",""]]}
{"id":"2308.08252","submitter":"Joshua Hirschbrunn","authors":"Joshua Hirschbrunn and Yevgeny Kazakov","title":"Description Logics Go Second-Order -- Extending EL with Universally\n  Quantified Concepts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of Description Logics have been historically mostly focused on\nfeatures that can be translated to decidable fragments of first-order logic. In\nthis paper, we leave this restriction behind and look for useful and decidable\nextensions outside first-order logic. We introduce universally quantified\nconcepts, which take the form of variables that can be replaced with arbitrary\nconcepts, and define two semantics of this extension. A schema semantics allows\nreplacements of concept variables only by concepts from a particular language,\ngiving us axiom schemata similar to modal logics. A second-order semantics\nallows replacement of concept variables with arbitrary subsets of the domain,\nwhich is similar to quantified predicates in second-order logic.\n  To study the proposed semantics, we focus on the extension of the description\nlogic $\\mathcal{EL}$. We show that for a useful fragment of the extension, the\nconclusions entailed by the different semantics coincide, allowing us to use\nclassical $\\mathcal{EL}$ reasoning algorithms even for the second-order\nsemantics. For a slightly smaller, but still useful, fragment, we were also\nable to show polynomial decidability of the extension. This fragment, in\nparticular, can express a generalized form of role chain axioms, positive self\nrestrictions, and some forms of (local) role-value-maps from KL-ONE, without\nrequiring any additional constructors.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:37:38 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 13:32:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hirschbrunn","Joshua",""],["Kazakov","Yevgeny",""]]}
{"id":"2308.08253","submitter":"Nur Lan","authors":"Nur Lan, Emmanuel Chemla, Roni Katzir","title":"Benchmarking Neural Network Generalization for Grammar Induction","comments":"10 pages, 4 figures, 2 tables. Conference: Learning with Small Data\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How well do neural networks generalize? Even for grammar induction tasks,\nwhere the target generalization is fully known, previous works have left the\nquestion open, testing very limited ranges beyond the training set and using\ndifferent success criteria. We provide a measure of neural network\ngeneralization based on fully specified formal languages. Given a model and a\nformal grammar, the method assigns a generalization score representing how well\na model generalizes to unseen samples in inverse relation to the amount of data\nit was trained on. The benchmark includes languages such as $a^nb^n$,\n$a^nb^nc^n$, $a^nb^mc^{n+m}$, and Dyck-1 and 2. We evaluate selected\narchitectures using the benchmark and find that networks trained with a Minimum\nDescription Length objective (MDL) generalize better and using less data than\nnetworks trained using standard loss functions. The benchmark is available at\nhttps://github.com/taucompling/bliss.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:45:06 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:40:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lan","Nur",""],["Chemla","Emmanuel",""],["Katzir","Roni",""]]}
{"id":"2308.08254","submitter":"Karen Meagher","authors":"Jozefien D'haeseleer and Karen Meagher and Venkata Raghu Tej Pantangi","title":"Cameron-Liebler sets in permutation groups","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider a group $G$ acting on a set $\\Omega$, the vector $v_{a,b}$ is a\nvector with the entries indexed by the elements of $G$, and the $g$-entry is 1\nif $g$ maps $a$ to $b$, and zero otherwise. A $(G,\\Omega)$-Cameron-Liebler set\nis a subset of $G$, whose indicator function is a linear combination of\nelements in $\\{v_{a, b}\\ :\\ a, b \\in \\Omega\\}$. We investigate Cameron-Liebler\nsets in permutation groups, with a focus on constructions of Cameron-Liebler\nsets for 2-transitive groups.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:47:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["D'haeseleer","Jozefien",""],["Meagher","Karen",""],["Pantangi","Venkata Raghu Tej",""]]}
{"id":"2308.08255","submitter":"Andrew Mummery","authors":"Andrew Mummery, Sjoert van Velzen, Edward Nathan, Adam Ingram, Erica\n  Hammerstein, Ludovic Fraser-Taliente, Steven Balbus","title":"Fundamental scaling relationships revealed in the optical light curves\n  of tidal disruption events","comments":"24 pages + appendices, 20 figures. Submitted to MNRAS, comments\n  welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present fundamental scaling relationships between properties of the\noptical/UV light curves of tidal disruption events (TDEs) and the mass of the\nblack hole that disrupted the star. We have uncovered these relations from the\nlate-time emission of TDEs. Using a sample of 63 optically-selected TDEs, the\nlatest catalog to date, we observed flattening of the early-time emission into\na near-constant late-time plateau for at least two-thirds of our sources.\nCompared to other properties of the TDE lightcurves (e.g., peak luminosity or\ndecay rate) the plateau luminosity shows the tightest correlation with the\ntotal mass of host galaxy ($p$-value of $2 \\times 10^{-6}$, with a residual\nscatter of 0.3 dex). Physically this plateau stems from the presence of an\naccretion flow. We demonstrate theoretically and numerically that the amplitude\nof this plateau emission is strongly correlated with black hole mass. By\nsimulating a large population of TDEs, we determine a plateau luminosity-black\nhole mass scaling relationship well described by $ \\log_{10}\n\\left(M_{\\bullet}/M_{\\odot} \\right) = 1.50 \\log_{10} \\left( L_{\\rm\nplat}/10^{43} {\\rm erg \\, s^{-1}} \\right) + 9.0 $. The observed plateau\nluminosities of TDEs and black hole masses in our large sample are in excellent\nagreement with this simulation. Using the black hole mass predicted from the\nobserved TDE plateau luminosity, we reproduce the well-known scaling relations\nbetween black hole mass and galaxy velocity dispersion. The large black hole\nmasses of 10 of the TDEs in our sample allow us to provide constraints on their\nblack hole spins, favouring rapidly rotating black holes. We add 49 (34) black\nhole masses to the galaxy mass (velocity dispersion) scaling relationships,\nupdating and extending these correlations into the low black hole mass regime.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:47:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mummery","Andrew",""],["van Velzen","Sjoert",""],["Nathan","Edward",""],["Ingram","Adam",""],["Hammerstein","Erica",""],["Fraser-Taliente","Ludovic",""],["Balbus","Steven",""]]}
{"id":"2308.08256","submitter":"Philipp M\\\"uller","authors":"Philipp M\\\"uller, Michal Balazia, Tobias Baur, Michael Dietz,\n  Alexander Heimerl, Dominik Schiller, Mohammed Guermal, Dominike Thomas,\n  Fran\\c{c}ois Br\\'emond, Jan Alexandersson, Elisabeth Andr\\'e, Andreas Bulling","title":"MultiMediate'23: Engagement Estimation and Bodily Behaviour Recognition\n  in Social Interactions","comments":"ACM MultiMedia'23","journal-ref":null,"doi":"10.1145/3581783.3613851","report-no":null,"categories":"cs.CV cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic analysis of human behaviour is a fundamental prerequisite for the\ncreation of machines that can effectively interact with- and support humans in\nsocial interactions. In MultiMediate'23, we address two key human social\nbehaviour analysis tasks for the first time in a controlled challenge:\nengagement estimation and bodily behaviour recognition in social interactions.\nThis paper describes the MultiMediate'23 challenge and presents novel sets of\nannotations for both tasks. For engagement estimation we collected novel\nannotations on the NOvice eXpert Interaction (NOXI) database. For bodily\nbehaviour recognition, we annotated test recordings of the MPIIGroupInteraction\ncorpus with the BBSI annotation scheme. In addition, we present baseline\nresults for both challenge tasks.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:47:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["M\u00fcller","Philipp",""],["Balazia","Michal",""],["Baur","Tobias",""],["Dietz","Michael",""],["Heimerl","Alexander",""],["Schiller","Dominik",""],["Guermal","Mohammed",""],["Thomas","Dominike",""],["Br\u00e9mond","Fran\u00e7ois",""],["Alexandersson","Jan",""],["Andr\u00e9","Elisabeth",""],["Bulling","Andreas",""]]}
{"id":"2308.08257","submitter":"Di-Lun Yang","authors":"Naoki Yamamoto, Di-Lun Yang","title":"Chiral kinetic theory with self-energy corrections and neutrino spin\n  Hall effect","comments":"21 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We systematically derive the chiral kinetic theory for chiral fermions with\ncollisions, including the self-energy corrections, from quantum field theories.\nWe find that the Wigner functions and chiral kinetic equations receive both the\nclassical and quantum corrections from the self-energies and their spacetime\ngradients. We also apply this formalism to study non-equilibrium neutrino\ntransport due to the interaction with thermalized electrons, as realized in\ncore-collapse supernovae. We derive neutrino currents along magnetic fields and\nneutrino spin Hall effect induced by temperature and chemical potential\ngradients of electrons at first order in the Fermi constant $G_{\\rm F}$ for\nanisotropic neutrino distributions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:47:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yamamoto","Naoki",""],["Yang","Di-Lun",""]]}
{"id":"2308.08258","submitter":"Edith Tretschk","authors":"Edith Tretschk, Vladislav Golyanik, Michael Zollhoefer, Aljaz Bozic,\n  Christoph Lassner, Christian Theobalt","title":"SceNeRFlow: Time-Consistent Reconstruction of General Dynamic Scenes","comments":"Project page: https://vcai.mpi-inf.mpg.de/projects/scenerflow/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing methods for the 4D reconstruction of general, non-rigidly deforming\nobjects focus on novel-view synthesis and neglect correspondences. However,\ntime consistency enables advanced downstream tasks like 3D editing, motion\nanalysis, or virtual-asset creation. We propose SceNeRFlow to reconstruct a\ngeneral, non-rigid scene in a time-consistent manner. Our dynamic-NeRF method\ntakes multi-view RGB videos and background images from static cameras with\nknown camera parameters as input. It then reconstructs the deformations of an\nestimated canonical model of the geometry and appearance in an online fashion.\nSince this canonical model is time-invariant, we obtain correspondences even\nfor long-term, long-range motions. We employ neural scene representations to\nparametrize the components of our method. Like prior dynamic-NeRF methods, we\nuse a backwards deformation model. We find non-trivial adaptations of this\nmodel necessary to handle larger motions: We decompose the deformations into a\nstrongly regularized coarse component and a weakly regularized fine component,\nwhere the coarse component also extends the deformation field into the space\nsurrounding the object, which enables tracking over time. We show\nexperimentally that, unlike prior work that only handles small motion, our\nmethod enables the reconstruction of studio-scale motions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:50:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tretschk","Edith",""],["Golyanik","Vladislav",""],["Zollhoefer","Michael",""],["Bozic","Aljaz",""],["Lassner","Christoph",""],["Theobalt","Christian",""]]}
{"id":"2308.08259","submitter":"Qinghua Shen","authors":"Qinghua Shen and Weijieying Ren and Wei Qin","title":"Graph Relation Aware Continual Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Continual graph learning (CGL) studies the problem of learning from an\ninfinite stream of graph data, consolidating historical knowledge, and\ngeneralizing it to the future task. At once, only current graph data are\navailable. Although some recent attempts have been made to handle this task, we\nstill face two potential challenges: 1) most of existing works only manipulate\non the intermediate graph embedding and ignore intrinsic properties of graphs.\nIt is non-trivial to differentiate the transferred information across graphs.\n2) recent attempts take a parameter-sharing policy to transfer knowledge across\ntime steps or progressively expand new architecture given shifted graph\ndistribution. Learning a single model could loss discriminative information for\neach graph task while the model expansion scheme suffers from high model\ncomplexity. In this paper, we point out that latent relations behind graph\nedges can be attributed as an invariant factor for the evolving graphs and the\nstatistical information of latent relations evolves. Motivated by this, we\ndesign a relation-aware adaptive model, dubbed as RAM-CG, that consists of a\nrelation-discovery modular to explore latent relations behind edges and a\ntask-awareness masking classifier to accounts for the shifted. Extensive\nexperiments show that RAM-CG provides significant 2.2%, 6.9% and 6.6% accuracy\nimprovements over the state-of-the-art results on CitationNet, OGBN-arxiv and\nTWITCH dataset, respective.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:53:20 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shen","Qinghua",""],["Ren","Weijieying",""],["Qin","Wei",""]]}
{"id":"2308.08260","submitter":"Veronika Baumann","authors":"Veronika Baumann","title":"Classical information and collapse in Wigner's friend setups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The famous Wigner's friend experiment considers an observer -- the friend --\nand a superobserver -- Wigner -- who treats the friend as a quantum system and\nher interaction with other quantum systems as unitary dynamics. This is at odds\nwith the friend describing this interaction via collapse dynamics, if she\ninteracts with the quantum system in a way that she would consider a\nmeasurement. These different descriptions constitute the Wigner's friend\nparadox. Extended Wigner's friend experiments combine the original thought\nexperiment with non-locality setups. This allows for deriving local\nfriendliness inequalities, similar to Bell's theorem, which can be violated for\ncertain extended Wigner's friend scenarios. A Wigner's friend paradox and the\nviolation of local friendliness inequalities require that no classical record\nexists, which reveals the result the friend observed during her measurement.\nOtherwise Wigner agrees with his friend's description and no local friendliness\ninequality can be violated. In this article, I introduce classical\ncommunication between Wigner and his friend and discuss its effects on the\nsimple as well as extended Wigner's friend experiments. By controlling the\nproperties of a (quasi) classical communication channel between Wigner and the\nfriend one can regulate how much outcome information about the friend's\nmeasurement is revealed. This gives a smooth transition between the paradoxical\ndescription and the possibility of violating local friendliness inequalities,\non the one hand, and the effectively collapsed case, on the other hand.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:54:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Baumann","Veronika",""]]}
{"id":"2308.08261","submitter":"Ergys \\c{C}okaj","authors":"Martin Arnold, Elena Celledoni, Ergys \\c{C}okaj, Brynjulf Owren and\n  Denise Tumiotto","title":"B-stability of numerical integrators on Riemannian 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 propose a generalization of nonlinear stability of numerical one-step\nintegrators to Riemannian manifolds in the spirit of Butcher's notion of\nB-stability. Taking inspiration from Simpson-Porco and Bullo, we introduce\nnon-expansive systems on such manifolds and define B-stability of integrators.\nIn this first exposition, we provide concrete results for a geodesic version of\nthe Implicit Euler (GIE) scheme. We prove that the GIE method is B-stable on\nRiemannian manifolds with non-positive sectional curvature. We show through\nnumerical examples that the GIE method is expansive when applied to a certain\nnon-expansive vector field on the 2-sphere, and that the GIE method does not\nnecessarily possess a unique solution for large enough step sizes. Finally, we\nderive a new improved global error estimate for general Lie group integrators.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:55:07 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Arnold","Martin",""],["Celledoni","Elena",""],["\u00c7okaj","Ergys",""],["Owren","Brynjulf",""],["Tumiotto","Denise",""]]}
{"id":"2308.08262","submitter":"Sandip Guin","authors":"Sandip Guin, Miral Verma, Soumya Bandyopadhyay, Yu-Chieh Lo, Rajdip\n  Mukherjee","title":"Solute Segregation in a Moving Grain Boundary: A Novel Phase-Field\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel phase-field approach for investigating solute segregation\nin a moving grain boundary. In our model, the correct choice of various\nparameters can control the solute-grain boundary interaction potential,\nresulting in various segregation profiles that agree with Cahn solute drag\ntheory. Furthermore, we explore how different segregation profiles evolve at\nvarying GB velocities owing to the inequality of the atomic flux of solute\nbetween the front and back faces of the moving grain boundary. We highlight\nvelocity variations among segregation profiles in low and high-velocity\nregimes. This model reveals how grain boundary segregation affects grain\ngrowth, providing insights for future alloy design\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:01:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guin","Sandip",""],["Verma","Miral",""],["Bandyopadhyay","Soumya",""],["Lo","Yu-Chieh",""],["Mukherjee","Rajdip",""]]}
{"id":"2308.08263","submitter":"Jiajun Tong","authors":"Jiajun Tong, Zhixiao Wang and Xiaobin Rui","title":"Boosting Commit Classification with Contrastive Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Commit Classification (CC) is an important task in software maintenance,\nwhich helps software developers classify code changes into different types\naccording to their nature and purpose. It allows developers to understand\nbetter how their development efforts are progressing, identify areas where they\nneed improvement, and make informed decisions about when and how to release new\nsoftware versions. However, existing models need lots of manually labeled data\nfor fine-tuning processes, and ignore sentence-level semantic information,\nwhich is often essential for discovering the difference between diverse\ncommits. Therefore, it is still challenging to solve CC in fewshot scenario.\n  To solve the above problems, we propose a contrastive learning-based commit\nclassification framework. Firstly, we generate $K$ sentences and pseudo-labels\naccording to the labels of the dataset, which aims to enhance the dataset.\nSecondly, we randomly group the augmented data $N$ times to compare their\nsimilarity with the positive $T_p^{|C|}$ and negative $T_n^{|C|}$ samples. We\nutilize individual pretrained sentence transformers (ST)s to efficiently obtain\nthe sentence-level embeddings from different features respectively. Finally, we\nadopt the cosine similarity function to limit the distribution of vectors,\nsimilar vectors are more adjacent. The light fine-tuned model is then applied\nto the label prediction of incoming commits.\n  Extensive experiments on two open available datasets demonstrate that our\nframework can solve the CC problem simply but effectively in fewshot scenarios,\nwhile achieving state-of-the-art(SOTA) performance and improving the\nadaptability of the model without requiring a large number of training samples\nfor fine-tuning. The code, data, and trained models are available at\nhttps://github.com/AppleMax1992/CommitFit.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:02:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tong","Jiajun",""],["Wang","Zhixiao",""],["Rui","Xiaobin",""]]}
{"id":"2308.08264","submitter":"Domenico Giuliano","authors":"Andrea Nava, Carmine Antonio Perroni, Reinhold Egger, Luca Lepori, and\n  Domenico Giuliano","title":"Lindblad master equation approach to the dissipative quench dynamics of\n  planar superconductors","comments":"14 pages, 7 .eps 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 employ the Lindblad Master Equation method to study the nonequilibrium\ndynamics following a parametric quench in the Hamiltonian of an open,\ntwo-dimensional superconducting system coupled to an external bath. Within our\napproach we show how, in the open system, the dissipation works as an effective\nstabilization mechanism in the time evolution of the system after the quench.\nEventually, we evidence how the mismatch between the phases corresponding to\nthe initial and to the final state of the system determines a dynamical phase\ntransition between the two distinct phases. Our method allows for fully\ncharacterizing the dynamical phase transition in an open system in several\ncases of physical relevance, by means of a combined study of the time dependent\nsuperconducting gap and of the fidelity between density matrices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:02:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nava","Andrea",""],["Perroni","Carmine Antonio",""],["Egger","Reinhold",""],["Lepori","Luca",""],["Giuliano","Domenico",""]]}
{"id":"2308.08265","submitter":"Domenico Giuliano","authors":"Andrea Nava, Carmine Antonio Perroni, Reinhold Egger, Luca Lepori, and\n  Domenico Giuliano","title":"Dissipation driven dynamical topological phase transitions in\n  two-dimensional superconductors","comments":"9 pages, 6 .eps figures. Includes Supplemental Material as a part of\n  the Main File","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":"  By quenching the interaction strength, we induce and study a topological\ndynamical phase transition between superconducting phases of a planar fermionic\nmodel. Using the Lindblad Master Equation approach to account for the\ninteractions of Bogoliubov quasiparticles among themselves and with the\nfluctuations of the superconducting order parameter, we derive the\ncorresponding relaxation dynamics of the order parameter. To fully characterize\nthe phase transition, we also compute the fidelity and the spin-Hall\nconductance of the system. Our approach provides us crucial informations for\nexperimental implementations, such as the dependence of the critical time on\nthe system-bath coupling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:03:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nava","Andrea",""],["Perroni","Carmine Antonio",""],["Egger","Reinhold",""],["Lepori","Luca",""],["Giuliano","Domenico",""]]}
{"id":"2308.08266","submitter":"Arieh Iserles","authors":"Jing Gao and Arieh Iserles","title":"A recurrence relation for generalised connection coefficients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We formulate and prove a general recurrence relation that applies to\nintegrals involving orthogonal polynomials and similar functions. A special\ncase are connection coefficients between two sets of orthonormal polynomials,\nanother example is integrals of products of Legendre functions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:05:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gao","Jing",""],["Iserles","Arieh",""]]}
{"id":"2308.08267","submitter":"Konstantinos Ntontin","authors":"Konstantinos Ntontin, Alexandros-Apostolos A. Boulogeorgos, Sergi\n  Abadal, Agapi Mesodiakaki, Symeon Chatzinotas, Bj\\\"orn Ottersten","title":"Perpetual Reconfigurable Intelligent Surfaces Through In-Band Energy\n  Harvesting: Architectures, Protocols, and Challenges","comments":"7 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconfigurable intelligent surfaces (RISs) are considered to be a key enabler\nof highly energy-efficient 6G and beyond networks. This property arises from\nthe absence of power amplifiers in the structure, in contrast to active nodes,\nsuch as small cells and relays. However, still an amount of power is required\nfor their operation. To improve their energy efficiency further, we propose the\nnotion of perpetual RISs, which secure the power needed to supply their\nfunctionalities through wireless energy harvesting of the impinging transmitted\nelectromagnetic signals. Towards this, we initially explain the rationale\nbehind such RIS capability and proceed with the presentation of the main RIS\ncontroller architecture that can realize this vision under an in-band energy\nharvesting consideration. Furthermore, we present a typical energy-harvesting\narchitecture followed by two harvesting protocols. Subsequently, we study the\nperformance of the two protocols under a typical communications scenario.\nFinally, we elaborate on the main research challenges governing the realization\nof large-scale networks with perpetual RISs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:07:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ntontin","Konstantinos",""],["Boulogeorgos","Alexandros-Apostolos A.",""],["Abadal","Sergi",""],["Mesodiakaki","Agapi",""],["Chatzinotas","Symeon",""],["Ottersten","Bj\u00f6rn",""]]}
{"id":"2308.08268","submitter":"Xingcheng Xu","authors":"Xingcheng Xu, Zihao Pan, Haipeng Zhang, Yanqing Yang","title":"It Ain't That Bad: Understanding the Mysterious Performance Drop in OOD\n  Generalization for Generative Transformer Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative Transformer-based models have achieved remarkable proficiency on\nsolving diverse problems. However, their generalization ability is not fully\nunderstood and not always satisfying. Researchers take basic mathematical tasks\nlike n-digit addition or multiplication as important perspectives for\ninvestigating their generalization behaviors. Curiously, it is observed that\nwhen training on n-digit operations (e.g., additions) in which both input\noperands are n-digit in length, models generalize successfully on unseen\nn-digit inputs (in-distribution (ID) generalization), but fail miserably and\nmysteriously on longer, unseen cases (out-of-distribution (OOD)\ngeneralization). Studies try to bridge this gap with workarounds such as\nmodifying position embedding, fine-tuning, and priming with more extensive or\ninstructive data. However, without addressing the essential mechanism, there is\nhardly any guarantee regarding the robustness of these solutions. We bring this\nunexplained performance drop into attention and ask whether it is purely from\nrandom errors. Here we turn to the mechanistic line of research which has\nnotable successes in model interpretability. We discover that the strong ID\ngeneralization stems from structured representations, while behind the\nunsatisfying OOD performance, the models still exhibit clear learned algebraic\nstructures. Specifically, these models map unseen OOD inputs to outputs with\nequivalence relations in the ID domain. These highlight the potential of the\nmodels to carry useful information for improved generalization.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:09:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Xingcheng",""],["Pan","Zihao",""],["Zhang","Haipeng",""],["Yang","Yanqing",""]]}
{"id":"2308.08269","submitter":"Han Zhou","authors":"Han Zhou, Dong Ni, Ao Chang, Xinrui Zhou, Rusi Chen, Yanlin Chen, Lian\n  Liu, Jiamin Liang, Yuhao Huang, Tong Han, Zhe Liu, Deng-Ping Fan, Xin Yang","title":"OnUVS: Online Feature Decoupling Framework for High-Fidelity Ultrasound\n  Video Synthesis","comments":"14 pages, 13 figures and 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrasound (US) imaging is indispensable in clinical practice. To diagnose\ncertain diseases, sonographers must observe corresponding dynamic anatomic\nstructures to gather comprehensive information. However, the limited\navailability of specific US video cases causes teaching difficulties in\nidentifying corresponding diseases, which potentially impacts the detection\nrate of such cases. The synthesis of US videos may represent a promising\nsolution to this issue. Nevertheless, it is challenging to accurately animate\nthe intricate motion of dynamic anatomic structures while preserving image\nfidelity. To address this, we present a novel online feature-decoupling\nframework called OnUVS for high-fidelity US video synthesis. Our highlights can\nbe summarized by four aspects. First, we introduced anatomic information into\nkeypoint learning through a weakly-supervised training strategy, resulting in\nimproved preservation of anatomical integrity and motion while minimizing the\nlabeling burden. Second, to better preserve the integrity and textural\ninformation of US images, we implemented a dual-decoder that decouples the\ncontent and textural features in the generator. Third, we adopted a\nmultiple-feature discriminator to extract a comprehensive range of visual cues,\nthereby enhancing the sharpness and fine details of the generated videos.\nFourth, we constrained the motion trajectories of keypoints during online\nlearning to enhance the fluidity of generated videos. Our validation and user\nstudies on in-house echocardiographic and pelvic floor US videos showed that\nOnUVS synthesizes US videos with high fidelity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:16:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhou","Han",""],["Ni","Dong",""],["Chang","Ao",""],["Zhou","Xinrui",""],["Chen","Rusi",""],["Chen","Yanlin",""],["Liu","Lian",""],["Liang","Jiamin",""],["Huang","Yuhao",""],["Han","Tong",""],["Liu","Zhe",""],["Fan","Deng-Ping",""],["Yang","Xin",""]]}
{"id":"2308.08270","submitter":"Pratik Agrawal","authors":"Pratik Agrawal, Philipp Wiesner, Odej Kao","title":"Towards Benchmarking Power-Performance Characteristics of Federated\n  Learning Clients","comments":"Machine Learning and Networking Workshop, NetSys 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a decentralized machine learning approach where\nlocal models are trained on distributed clients, allowing privacy-preserving\ncollaboration by sharing model updates instead of raw data. However, the added\ncommunication overhead and increased training time caused by heterogenous data\ndistributions results in higher energy consumption and carbon emissions for\nachieving similar model performance than traditional machine learning. At the\nsame time, efficient usage of available energy is an important requirement for\nbattery constrained devices. Because of this, many different approaches on\nenergy-efficient and carbon-efficient FL scheduling and client selection have\nbeen published in recent years. However, most of this research oversimplifies\npower performance characteristics of clients by assuming that they always\nrequire the same amount of energy per processed sample throughout training.\nThis overlooks real-world effects arising from operating devices under\ndifferent power modes or the side effects of running other workloads in\nparallel. In this work, we take a first look on the impact of such factors and\ndiscuss how better power-performance estimates can improve energy-efficient and\ncarbon-efficient FL scheduling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:17:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Agrawal","Pratik",""],["Wiesner","Philipp",""],["Kao","Odej",""]]}
{"id":"2308.08271","submitter":"Yianni Karabatis","authors":"Yianni Karabatis, Xiaomin Lin, Nitin J. Sanket, Michail G. Lagoudakis,\n  Yiannis Aloimonos","title":"Detecting Olives with Synthetic or Real Data? Olive the Above","comments":null,"journal-ref":"In Proceedings of 2023 IEEE/RSJ International Conference on\n  Intelligent Robots and Systems (IROS)","doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern robotics has enabled the advancement in yield estimation for precision\nagriculture. However, when applied to the olive industry, the high variation of\nolive colors and their similarity to the background leaf canopy presents a\nchallenge. Labeling several thousands of very dense olive grove images for\nsegmentation is a labor-intensive task. This paper presents a novel approach to\ndetecting olives without the need to manually label data. In this work, we\npresent the world's first olive detection dataset comprised of synthetic and\nreal olive tree images. This is accomplished by generating an auto-labeled\nphotorealistic 3D model of an olive tree. Its geometry is then simplified for\nlightweight rendering purposes. In addition, experiments are conducted with a\nmix of synthetically generated and real images, yielding an improvement of up\nto 66% compared to when only using a small sample of real data. When access to\nreal, human-labeled data is limited, a combination of mostly synthetic data and\na small amount of real data can enhance olive detection.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:19:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Karabatis","Yianni",""],["Lin","Xiaomin",""],["Sanket","Nitin J.",""],["Lagoudakis","Michail G.",""],["Aloimonos","Yiannis",""]]}
{"id":"2308.08272","submitter":"Max B\\\"usken","authors":"Max B\\\"usken, Tom\\'a\\v{s} Fodran, Tim Huege","title":"Uncertainty study for the Galactic calibration of radio antenna arrays\n  in astroparticle physics","comments":"Proceedings of the 38th International Cosmic Ray Conference (ICRC) in\n  Nagoya, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, arrays of radio antennas operating in the MHz regime have\nshown great potential as detectors in astroparticle physics. In particular,\nthey fulfill an important role in the indirect detection of ultra-high energy\ncosmic rays. For a proper determination of the energy scale of the primary\nparticles, accurate absolute calibration of radio detectors is crucial.\nGalactic calibration - i.e., using the Galaxy-dominated radio sky as a\nreference source - will potentially be the standard method for this task.\nHowever, uncertainties in the strength of the Galactic radio emission lead to\nuncertainties in the absolute calibration of the radio detectors and, thus, in\nthe energy scale of the cosmic-ray measurements. To quantify these\nuncertainties, we present a study comparing seven sky models in the\nradio-frequency range of 30 to 408 MHz. By conversion to the locally visible\nsky, we estimate the uncertainties for the cases of the radio antenna arrays of\nGRAND, IceCube, LOFAR, OVRO-LWA, the Pierre Auger Observatory, RNO-G and\nSKA-low. Finally, we discuss the applicability of the Galactic calibration, for\nexample, regarding the influence of the quiet Sun.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:19:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["B\u00fcsken","Max",""],["Fodran","Tom\u00e1\u0161",""],["Huege","Tim",""]]}
{"id":"2308.08273","submitter":"Qinfeng Li","authors":"Qinfeng Li, Ruofei yao","title":"On location of maximum of gradient of torsion function","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It has been a widely belief that for a planar convex domain with two\ncoordinate axes of symmetry, the location of maximal norm of gradient of\ntorsion function is either linked to contact points of largest inscribed circle\nor connected to points on boundary of minimal curvature. However, we show that\nthis is not quite true in general. Actually, we derive the precise formula for\nthe location of maximal norm of gradient of torsion function on nearly ball\ndomains in $\\mathbb{R}^n$, which displays nonlocal nature and thus does not\ninherently establish a connection to the aforementioned two types of points.\nConsequently, explicit counterexamples can be straightforwardly constructed to\nillustrate this deviation from conventional understanding. We also prove that\nfor a rectangular domain, the maximum of the norm of gradient of torsion\nfunction exactly occurs at the centers of the faces of largest $(n-1)$-volume.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:25:41 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 11:44:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Qinfeng",""],["yao","Ruofei",""]]}
{"id":"2308.08274","submitter":"Toyomu Matsuda","authors":"Purba Das, Rafa{\\l} {\\L}ochowski, Toyomu Matsuda and Nicolas Perkowski","title":"Level crossings of fractional Brownian motion","comments":"37 pages, 6 figures. Simulation python code for Figure 3 can be found\n  in the source","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since the classical work of L\\'evy, it is known that the local time of\nBrownian motion can be characterized through the limit of level crossings.\nWhile subsequent extensions of this characterization have primarily focused on\nMarkovian or martingale settings, this work presents a highly anticipated\nextension to fractional Brownian motion -- a prominent non-Markovian and\nnon-martingale process. Our result is viewed as a fractional analogue of Chacon\net al. (1981). Consequently, it provides a global path-by-path construction of\nfractional Brownian local time. Due to the absence of conventional\nprobabilistic tools in the fractional setting, our approach utilizes completely\ndifferent argument with a flavor of the subadditive ergodic theorem, combined\nwith the shifted stochastic sewing lemma recently obtained in Matsuda and\nPerkowski (22, arXiv:2206.01686). Furthermore, we prove an almost-sure\nconvergence of the (1/H)-th variation of fractional Brownian motion with the\nHurst parameter H, along random partitions defined by level crossings, called\nLebesgue partitions. This result raises an interesting conjecture on the limit,\nwhich seems to capture non-Markovian nature of fractional Brownian motion.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:30:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Das","Purba",""],["\u0141ochowski","Rafa\u0142",""],["Matsuda","Toyomu",""],["Perkowski","Nicolas",""]]}
{"id":"2308.08275","submitter":"Bolang Lin","authors":"Bolang Lin, Sreeraj Nair, Siqi Xu, Zhi Hu, Chandan Mondal, Xingbo\n  Zhao, James P.Vary","title":"Generalized parton distributions of gluon in proton: a light-front\n  quantization approach","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We solve for the gluon generalized parton distributions (GPDs) inside the\nproton, focusing specifically on leading twist chiral-even GPDs. We obtain and\nemploy the light-front wavefunctions (LFWFs) of the proton from a light-front\nquantized Hamiltonian with Quantum Chromodynamics input using basis light-front\nquantization (BLFQ). Our investigation incorporates the valence Fock sector\nwith three constituent quarks and an additional Fock sector, encompassing three\nquarks and a dynamical gluon. We examine the GPDs within impact parameter space\nand evaluate the $x$-dependence of the transverse square radius. We find that\nthe transverse size of the gluon at lower-$x$ is larger than that of the quark,\nwhile it exhibits opposite behavior at large-$x$. Using the proton spin sum\nrule, we also determine the relative contributions of quarks and the gluon to\nthe total angular momentum of the proton.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:31:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lin","Bolang",""],["Nair","Sreeraj",""],["Xu","Siqi",""],["Hu","Zhi",""],["Mondal","Chandan",""],["Zhao","Xingbo",""],["Vary","James P.",""]]}
{"id":"2308.08276","submitter":"Sander van Cranenburgh","authors":"Sander van Cranenburgh and Francisco Garrido-Valenzuela","title":"Computer vision-enriched discrete choice models, with an application to\n  residential location choice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV econ.EM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Visual imagery is indispensable to many multi-attribute decision situations.\nExamples of such decision situations in travel behaviour research include\nresidential location choices, vehicle choices, tourist destination choices, and\nvarious safety-related choices. However, current discrete choice models cannot\nhandle image data and thus cannot incorporate information embedded in images\ninto their representations of choice behaviour. This gap between discrete\nchoice models' capabilities and the real-world behaviour it seeks to model\nleads to incomplete and, possibly, misleading outcomes. To solve this gap, this\nstudy proposes \"Computer Vision-enriched Discrete Choice Models\" (CV-DCMs).\nCV-DCMs can handle choice tasks involving numeric attributes and images by\nintegrating computer vision and traditional discrete choice models. Moreover,\nbecause CV-DCMs are grounded in random utility maximisation principles, they\nmaintain the solid behavioural foundation of traditional discrete choice\nmodels. We demonstrate the proposed CV-DCM by applying it to data obtained\nthrough a novel stated choice experiment involving residential location\nchoices. In this experiment, respondents faced choice tasks with trade-offs\nbetween commute time, monthly housing cost and street-level conditions,\npresented using images. As such, this research contributes to the growing body\nof literature in the travel behaviour field that seeks to integrate discrete\nchoice modelling and machine learning.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:33:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["van Cranenburgh","Sander",""],["Garrido-Valenzuela","Francisco",""]]}
{"id":"2308.08277","submitter":"Philippa Browning","authors":"Philippa Browning, Mykola Gordovskyy and Alan Hood","title":"Helicity-conserving relaxation in unstable and merging magnetic flux\n  ropes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Twisted magnetic flux ropes are reservoirs of free magnetic energy. In a\nhighly-conducting plasma such as the solar corona, energy release through\nmultiple magnetic reconnections can be modelled as a helicity-conserving\nrelaxation to a minimum energy state. One possible trigger for this relaxation\nis the ideal kink instability in a twisted flux rope. We show that this\nprovides a good description for confined solar flares, and develop from\nidealised cylindrical models to realistic models of coronal loops. Using 3D\nmagnetohydrodynamic simulations combined with test-particle simulations of\nnon-thermal electrons and ions, we predict multiple observational signatures of\nsuch flares. We then show how interactions and mergers of flux ropes can\nrelease free magnetic energy, using relaxation theory to complement simulations\nof merging-compression formation in spherical tokamaks and heating avalanches\nin the solar corona.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:34:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Browning","Philippa",""],["Gordovskyy","Mykola",""],["Hood","Alan",""]]}
{"id":"2308.08278","submitter":"Boris Malomed","authors":"Shatrughna Kumar, Pengfei Li, Liangwei Zeng, Jingsong He, and Boris A.\n  Malomed","title":"A solvable model for symmetry-breaking phase transitions","comments":"to be published in Scientific Reports","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS cond-mat.quant-gas physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Analytically solvable models are benchmarks in studies of phase transitions\nand pattern-forming bifurcations. Such models are known for phase transitions\nof the second kind in uniform media, but not for localized states (solitons),\nas integrable equations which produce solitons do not admit intrinsic\ntransitions in them. We introduce a solvable model for symmetry-breaking phase\ntransitions of both the first and second kinds (alias sub- and supercritical\nbifurcations) for solitons pinned to a combined linear-nonlinear double-well\npotential, represented by a symmetric pair of delta-functions. Both\nself-focusing and defocusing signs of the nonlinearity are considered. In the\nformer case, exact solutions are produced for symmetric and asymmetric\nsolitons. The solutions explicitly demonstrate a switch between the\nsymmetry-breaking transitions of the first and second kinds (i.e., sub- and\nsupercritical bifurcations, respectively). In the self-defocusing model, the\nsolution demonstrates the transition of the second kind which breaks\nantisymmetry of the first excited state.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:39:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kumar","Shatrughna",""],["Li","Pengfei",""],["Zeng","Liangwei",""],["He","Jingsong",""],["Malomed","Boris A.",""]]}
{"id":"2308.08279","submitter":"Pyae Sone Aung","authors":"Pyae Sone Aung, Loc X. Nguyen, Yan Kyaw Tun, Zhu Han, Choong Seon Hong","title":"Deep Reinforcement Learning based Joint Spectrum Allocation and\n  Configuration Design for STAR-RIS-Assisted V2X Communications","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vehicle-to-Everything (V2X) communications play a crucial role in ensuring\nsafe and efficient modern transportation systems. However, challenges arise in\nscenarios with buildings, leading to signal obstruction and coverage\nlimitations. To alleviate these challenges, reconfigurable intelligent surface\n(RIS) is regarded as an effective solution for communication performance by\ntuning passive signal reflection. RIS has acquired prominence in 6G networks\ndue to its improved spectral efficiency, simple deployment, and\ncost-effectiveness. Nevertheless, conventional RIS solutions have coverage\nlimitations. Therefore, researchers have started focusing on the promising\nconcept of simultaneously transmitting and reflecting RIS (STAR-RIS), which\nprovides 360\\degree coverage while utilizing the advantages of RIS technology.\nIn this paper, a STAR-RIS-assisted V2X communication system is investigated. An\noptimization problem is formulated to maximize the achievable data rate for\nvehicle-to-infrastructure (V2I) users while satisfying the latency and\nreliability requirements of vehicle-to-vehicle (V2V) pairs by jointly\noptimizing the spectrum allocation, amplitudes, and phase shifts of STAR-RIS\nelements, digital beamforming vectors for V2I links, and transmit power for V2V\npairs. Since it is challenging to solve in polynomial time, we decompose our\nproblem into two sub-problems. For the first sub-problem, we model the control\nvariables as a Markov Decision Process (MDP) and propose a combined double deep\nQ-network (DDQN) with an attention mechanism so that the model can potentially\nfocus on relevant inputs. For the latter, a standard optimization-based\napproach is implemented to provide a real-time solution, reducing computational\ncosts. Extensive numerical analysis is developed to demonstrate the superiority\nof our proposed algorithm compared to benchmark schemes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:40:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Aung","Pyae Sone",""],["Nguyen","Loc X.",""],["Tun","Yan Kyaw",""],["Han","Zhu",""],["Hong","Choong Seon",""]]}
{"id":"2308.08280","submitter":"Timoth\\'ee Crin-Barat","authors":"Timoth\\'ee Crin-Barat, Ling-Yun Shou and Enrique Zuazua","title":"Large time asymptotics for partially dissipative hyperbolic systems\n  without Fourier analysis: application to the nonlinearly damped p-system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A new framework to obtain time-decay estimates for partially dissipative\nhyperbolic systems set on the real line is developed. Under the classical\nShizuta-Kawashima (SK) stability condition, equivalent to the Kalman rank\ncondition in control theory, the solutions of these systems decay exponentially\nin time for high frequencies and polynomially for low ones. This allows to\nderive a sharp description of the space-time decay of solutions for large time.\nHowever, such analysis relies heavily on the use of the Fourier transform that\nwe avoid here, developing the \"physical space version\" of the hyperbolic\nhypocoercivity approach introduced by Beauchard and Zuazua, to prove new\nasymptotic results in the linear and nonlinear settings. The new physical space\nversion of the hyperbolic hypocoercivity approach allows to recover the natural\nheat-like time-decay of solutions under sharp rank conditions, without\nemploying Fourier analysis or $L^1$ assumptions on the initial data. Taking\nadvantage of this Fourier-free framework, we establish new enhanced time-decay\nestimates for initial data belonging to weighted Sobolev spaces. These results\nare then applied to the nonlinear compressible Euler equations with linear\ndamping. We also prove the logarithmic stability of the nonlinearly damped\n$p$-system.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:41:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Crin-Barat","Timoth\u00e9e",""],["Shou","Ling-Yun",""],["Zuazua","Enrique",""]]}
{"id":"2308.08281","submitter":"Bahram Mashhoon","authors":"Javad Tabatabaei, Abdolali Banihashemi, Shant Baghram, and Bahram\n  Mashhoon","title":"Anisotropic Cosmology in the Local Limit of Nonlocal Gravity","comments":"25 pages; v2: minor improvements, invited contribution to appear in\n  Universe","journal-ref":"Universe 9, 377 (2023)","doi":"10.3390/universe9090377","report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within the framework of the local limit of nonlocal gravity (NLG), we\ninvestigate a class of Bianchi type I spatially homogeneous but anisotropic\ncosmological models. The modified field equations are presented in this case\nand some special solutions are discussed in detail. This modified gravity\ntheory contains a susceptibility function S(x) such that general relativity\n(GR) is recovered for S = 0. In the modified anisotropic cosmological models,\nwe explore the contribution of S(t) and its temporal derivative to the local\nanisotropic cosmic acceleration. The implications of our results for\nobservational cosmology are briefly discussed.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:42:08 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:41:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tabatabaei","Javad",""],["Banihashemi","Abdolali",""],["Baghram","Shant",""],["Mashhoon","Bahram",""]]}
{"id":"2308.08282","submitter":"Diogo Capelo","authors":"Diogo Capelo and Il\\'idio Lopes","title":"Neutrinos and Asteroseismology of Stars over the Helium Flash","comments":"13 pages, 15 figures, 8 tables","journal-ref":"The Astrophysical Journal, Volume 953, Number 2, 165 (2023)","doi":"10.3847/1538-4357/ace446","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The helium flash, occurring in stars of 0.6-2.0 M$_\\odot$ at the end of the\nred giant branch, is not observable via optical means due to the energy of the\nprocess being used to lift the core out of degeneracy. Neutrinos, which are\nlinked to the ignition of reactions triggered during the flash and serve as the\nonly cooling process in the inert core, can help characterize changes in\ninternal structure. In this work, we create 18 stellar models across three mass\nand six metallicity values, chosen in the context of the stellar abundance\nproblem, to compare the evolutionary path up to and probe the helium flash by\nconducting a detailed study of neutrino emission throughout this crucial phase\nof stellar evolution. We demonstrate how thermal neutrino emissions could have\nan imprint on global asteroseismic parameters and use them as an additional\ntool to infer the impact of compositional changes. We find that a precision of\n0.3 $\\mu$Hz in the determination of $\\Delta \\nu$ is enough to distinguish\nbetween between the two most prominent solar composition models and confirm\nthat asteroseismic observation can be enough to classify a star as undergoing\nthe process of helium subflashes. We also predict nuclear neutrino emission\nfluxes and their evolution for all relevant sources.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:45:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Capelo","Diogo",""],["Lopes","Il\u00eddio",""]]}
{"id":"2308.08283","submitter":"Hantao Zhang","authors":"Hantao Zhang, Weidong Guo, Chenyang Qiu, Shouhong Wan, Bingbing Zou,\n  Wanqin Wang, Peiquan Jin","title":"CARE: A Large Scale CT Image Dataset and Clinical Applicable Benchmark\n  Model for Rectal Cancer Segmentation","comments":"8 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":"  Rectal cancer segmentation of CT image plays a crucial role in timely\nclinical diagnosis, radiotherapy treatment, and follow-up. Although current\nsegmentation methods have shown promise in delineating cancerous tissues, they\nstill encounter challenges in achieving high segmentation precision. These\nobstacles arise from the intricate anatomical structures of the rectum and the\ndifficulties in performing differential diagnosis of rectal cancer.\nAdditionally, a major obstacle is the lack of a large-scale, finely annotated\nCT image dataset for rectal cancer segmentation. To address these issues, this\nwork introduces a novel large scale rectal cancer CT image dataset CARE with\npixel-level annotations for both normal and cancerous rectum, which serves as a\nvaluable resource for algorithm research and clinical application development.\nMoreover, we propose a novel medical cancer lesion segmentation benchmark model\nnamed U-SAM. The model is specifically designed to tackle the challenges posed\nby the intricate anatomical structures of abdominal organs by incorporating\nprompt information. U-SAM contains three key components: promptable information\n(e.g., points) to aid in target area localization, a convolution module for\ncapturing low-level lesion details, and skip-connections to preserve and\nrecover spatial information during the encoding-decoding process. To evaluate\nthe effectiveness of U-SAM, we systematically compare its performance with\nseveral popular segmentation methods on the CARE dataset. The generalization of\nthe model is further verified on the WORD dataset. Extensive experiments\ndemonstrate that the proposed U-SAM outperforms state-of-the-art methods on\nthese two datasets. These experiments can serve as the baseline for future\nresearch and clinical application development.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:51:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Hantao",""],["Guo","Weidong",""],["Qiu","Chenyang",""],["Wan","Shouhong",""],["Zou","Bingbing",""],["Wang","Wanqin",""],["Jin","Peiquan",""]]}
{"id":"2308.08284","submitter":"Khandakar Md Asif Elahi","authors":"Khandakar Md Asif Elahi, Somnath Bharadwaj, Srijita Pal, Abhik Ghosh,\n  Sk. Saiyad Ali, Samir Choudhuri, Arnab Chakraborty, Abhirup Datta, Nirupam\n  Roy, Madhurima Choudhury and Prasun Dutta","title":"Towards $21$-cm intensity mapping at $z=2.28$ with uGMRT using the\n  tapered gridded estimator III: Foreground removal","comments":"Accepted for publication in MNRAS. 16 pages (including Appendix), 8\n  figures (plus 8 in Appendix), 5 Tables","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":"  Neutral hydrogen (\\ion{H}{i}) $21$-cm intensity mapping (IM) is a promising\nprobe of the large-scale structures in the Universe. However, a few orders of\nmagnitude brighter foregrounds obscure the IM signal. Here we use the Tapered\nGridded Estimator (TGE) to estimate the multi-frequency angular power spectrum\n(MAPS) $C_{\\ell}(\\Delta\\nu)$ from a $24.4\\,\\rm{MHz}$ bandwidth uGMRT Band $3$\ndata at $432.8\\,\\rm{MHz}$. In $C_{\\ell}(\\Delta\\nu)$ foregrounds remain\ncorrelated across the entire $\\Delta\\nu$ range, whereas the $21$-cm signal is\nlocalized within $\\Delta\\nu\\le[\\Delta \\nu]$ (typically $0.5-1\\,\\rm{MHz}$).\nAssuming the range $\\Delta\\nu>[\\Delta \\nu]$ to have minimal $21$-cm signal, we\nuse $C_{\\ell}(\\Delta\\nu)$ in this range to model the foregrounds. This\nforeground model is extrapolated to $\\Delta\\nu\\leq[\\Delta \\nu]$, and subtracted\nfrom the measured $C_{\\ell}(\\Delta\\nu)$. The residual\n$[C_{\\ell}(\\Delta\\nu)]_{\\rm res}$ in the range $\\Delta\\nu\\le[\\Delta\\nu]$ is\nused to constrain the $21$-cm signal, compensating for the signal loss from\nforeground subtraction. $[C_{\\ell}(\\Delta\\nu)]_{\\rm{res}}$ is found to be\nnoise-dominated without any trace of foregrounds. Using\n$[C_{\\ell}(\\Delta\\nu)]_{\\rm res}$ we constrain the $21$-cm brightness\ntemperature fluctuations $\\Delta^2(k)$, and obtain the $2\\sigma$ upper limit\n$\\Delta_{\\rm UL}^2(k)\\leq(18.07)^2\\,\\rm{mK^2}$ at $k=0.247\\,\\rm{Mpc}^{-1}$. We\nfurther obtain the $2\\sigma$ upper limit $\n[\\Omega_{\\ion{H}{i}}b_{\\ion{H}{i}}]_{\\rm UL}\\leq0.022$ where\n$\\Omega_{\\ion{H}{i}}$ and $b_{\\ion{H}{i}}$ are the comoving \\ion{H}{i} density\nand bias parameters respectively. Although the upper limit is nearly $10$ times\nlarger than the expected $21$-cm signal, it is $3$ times tighter over previous\nworks using foreground avoidance on the same data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:10:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Elahi","Khandakar Md Asif",""],["Bharadwaj","Somnath",""],["Pal","Srijita",""],["Ghosh","Abhik",""],["Ali","Sk. Saiyad",""],["Choudhuri","Samir",""],["Chakraborty","Arnab",""],["Datta","Abhirup",""],["Roy","Nirupam",""],["Choudhury","Madhurima",""],["Dutta","Prasun",""]]}
{"id":"2308.08285","submitter":"Guangyuan Ma","authors":"Guangyuan Ma, Xing Wu, Peng Wang, Zijia Lin, Songlin Hu","title":"Pre-training with Large Language Model-based Document Expansion for\n  Dense Passage Retrieval","comments":"10 pages, 3 tables, 4 figures, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we systematically study the potential of pre-training with\nLarge Language Model(LLM)-based document expansion for dense passage retrieval.\nConcretely, we leverage the capabilities of LLMs for document expansion, i.e.\nquery generation, and effectively transfer expanded knowledge to retrievers\nusing pre-training strategies tailored for passage retrieval. These strategies\ninclude contrastive learning and bottlenecked query generation. Furthermore, we\nincorporate a curriculum learning strategy to reduce the reliance on LLM\ninferences. Experimental results demonstrate that pre-training with LLM-based\ndocument expansion significantly boosts the retrieval performance on\nlarge-scale web-search tasks. Our work shows strong zero-shot and out-of-domain\nretrieval abilities, making it more widely applicable for retrieval when\ninitializing with no human-labeled data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:10:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ma","Guangyuan",""],["Wu","Xing",""],["Wang","Peng",""],["Lin","Zijia",""],["Hu","Songlin",""]]}
{"id":"2308.08286","submitter":"Anton Kulagin Dr","authors":"A. E. Kulagin, A. V. Shapovalov","title":"Semiclassical approach to the nonlocal nonlinear Schr\\\"{o}dinger\n  equation with a non-Hermitian term","comments":"29 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nonlinear Sch\\\"{o}dinger equation (NLSE) with a non-Hermitian term is the\nmodel for various phenomena in nonlinear open quantum systems. We deal with the\nCauchy problem for the nonlocal generalization of multidimensional NLSE with a\nnon-Hermitian term. Using the ideas of the Maslov method, we propose the method\nof constructing asymptotic solutions to this equation within the framework of\nsemiclassically concentrated states. The semiclassical nonlinear evolution\noperator and symmetry operators for the leading term of asymptotics are\nderived. Our approach is based on the solutions of the auxiliary dynamical\nsystem that effectively linearize the problem under certain algebraic\nconditions. The formalism proposed is illustrated with the specific example of\nthe NLSE with a non-Hermitian term that is the model of an atom laser. The\nanalytical asymptotic solution to the Cauchy problem is obtained explicitly for\nthis example.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:19:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kulagin","A. E.",""],["Shapovalov","A. V.",""]]}
{"id":"2308.08287","submitter":"Johanna Johansen Ms","authors":"Johanna Johansen","title":"Expert opinions on making GDPR usable","comments":"33 pages, with appendix and 1 figure","journal-ref":"Human Factors in Privacy Research. pp. 137-152, Ch. 7, Springer\n  Book, 2023","doi":"10.1007/978-3-031-28643-8_7","report-no":null,"categories":"cs.CY cs.CR cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present the results of a study done in order to validate concepts and\nmethods that have been introduced in (Johansen and Fischer-Hubner, 2020.\n\"Making GDPR Usable: A Model to Support Usability Evaluations of Privacy.\" in\nIFIP AICT 576, 275-291). We use as respondents in our interviews experts\nworking across fields of relevance to these concepts, including law and data\nprotection/privacy, certifications and standardization, and usability (as\nstudied in the field of Human-Computer Interaction). We study the experts'\nopinions about four new concepts, namely: (i) a definition of Usable Privacy,\n(ii) 30 Usable Privacy Goals identified as excerpts from the GDPR (European\nGeneral Data Protection Regulation), (iii) a set of 25 corresponding Usable\nPrivacy Criteria together with their multiple measurable sub-criteria, and (iv)\nthe Usable Privacy Cube model, which puts all these together with the EuroPriSe\ncertification criteria, with the purpose of making explicit several aspects of\ncertification processes such as orderings of criteria, interactions between\nthese, different stakeholder perspectives, and context of use/processing.\n  The expert opinions are varied, example-rich, and forward-looking, which\ngives a impressive list of open problems where the above four concepts can work\nas a foundation for further developments. We employed a critical qualitative\nresearch, using theory triangulation to analyze the data representing three\ngroups of experts, categorized as 'certifications', 'law', and 'usability',\ncoming both from industry and academia. The results of our analysis show\nagreement among the experts about the need for evaluations and measuring of\nusability of privacy in order to allow for exercising data subjects' rights and\nto evaluate the degree to which data controllers comply with the data\nprotection principles.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:20:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Johansen","Johanna",""]]}
{"id":"2308.08288","submitter":"Yiran Zhong","authors":"Dawei Hao, Yuxin Mao, Bowen He, Xiaodong Han, Yuchao Dai, Yiran Zhong","title":"Improving Audio-Visual Segmentation with Bidirectional Generation","comments":"Dawei Hao and Yuxin Mao contribute equality to this paper. Yiran\n  Zhong is the corresponding author. The code will be released at\n  https://github.com/OpenNLPLab/AVS-bidirectional","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of audio-visual segmentation (AVS) is to precisely differentiate\naudible objects within videos down to the pixel level. Traditional approaches\noften tackle this challenge by combining information from various modalities,\nwhere the contribution of each modality is implicitly or explicitly modeled.\nNevertheless, the interconnections between different modalities tend to be\noverlooked in audio-visual modeling. In this paper, inspired by the human\nability to mentally simulate the sound of an object and its visual appearance,\nwe introduce a bidirectional generation framework. This framework establishes\nrobust correlations between an object's visual characteristics and its\nassociated sound, thereby enhancing the performance of AVS. To achieve this, we\nemploy a visual-to-audio projection component that reconstructs audio features\nfrom object segmentation masks and minimizes reconstruction errors. Moreover,\nrecognizing that many sounds are linked to object movements, we introduce an\nimplicit volumetric motion estimation module to handle temporal dynamics that\nmay be challenging to capture using conventional optical flow methods. To\nshowcase the effectiveness of our approach, we conduct comprehensive\nexperiments and analyses on the widely recognized AVSBench benchmark. As a\nresult, we establish a new state-of-the-art performance level in the AVS\nbenchmark, particularly excelling in the challenging MS3 subset which involves\nsegmenting multiple sound sources. To facilitate reproducibility, we plan to\nrelease both the source code and the pre-trained model.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:20:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hao","Dawei",""],["Mao","Yuxin",""],["He","Bowen",""],["Han","Xiaodong",""],["Dai","Yuchao",""],["Zhong","Yiran",""]]}
{"id":"2308.08289","submitter":"Dror Liran","authors":"Dror Liran, Jiaqi Hu, Nathanial Lydick, Hui Deng, Loren Pfeiffer, and\n  Ronen Rapaport","title":"Electrically controlled dipolariton circuits","comments":"18 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electrically controlled photonic circuits hold promise for information\ntechnologies with greatly improved energy efficiency and quantum information\nprocessing capabilities. However, weak nonlinearity and electrical response of\ntypical photonic materials have been two critical challenges. Therefore hybrid\nelectronic-photonic systems, such as semiconductor exciton-polaritons, have\nbeen intensely investigated for their potential to allow higher nonlinearity\nand electrical control, with limited success so far. Here we demonstrate an\nelectrically-gated waveguide architecture for dipolar-polaritons that allows\nenhanced and electrically-controllable polariton nonlinearities, enabling an\nelectrically-tuned reflecting switch and transistor of the dipolar-polaritons.\nThe polariton transistor displays blockade and anti-blockade by compressing a\ndilute dipolar-polariton pulse. We project that a quantum blockade at the\nsingle polariton level is feasible in such a device.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:21:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liran","Dror",""],["Hu","Jiaqi",""],["Lydick","Nathanial",""],["Deng","Hui",""],["Pfeiffer","Loren",""],["Rapaport","Ronen",""]]}
{"id":"2308.08290","submitter":"Li Shen","authors":"Qinglun Li, Li Shen, Guanghao Li, Quanjun Yin, Dacheng Tao","title":"DFedADMM: Dual Constraints Controlled Model Inconsistency for\n  Decentralized Federated Learning","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To address the communication burden issues associated with federated learning\n(FL), decentralized federated learning (DFL) discards the central server and\nestablishes a decentralized communication network, where each client\ncommunicates only with neighboring clients. However, existing DFL methods still\nsuffer from two major challenges: local inconsistency and local heterogeneous\noverfitting, which have not been fundamentally addressed by existing DFL\nmethods. To tackle these issues, we propose novel DFL algorithms, DFedADMM and\nits enhanced version DFedADMM-SAM, to enhance the performance of DFL. The\nDFedADMM algorithm employs primal-dual optimization (ADMM) by utilizing dual\nvariables to control the model inconsistency raised from the decentralized\nheterogeneous data distributions. The DFedADMM-SAM algorithm further improves\non DFedADMM by employing a Sharpness-Aware Minimization (SAM) optimizer, which\nuses gradient perturbations to generate locally flat models and searches for\nmodels with uniformly low loss values to mitigate local heterogeneous\noverfitting. Theoretically, we derive convergence rates of $\\small\n\\mathcal{O}\\Big(\\frac{1}{\\sqrt{KT}}+\\frac{1}{KT(1-\\psi)^2}\\Big)$ and $\\small\n\\mathcal{O}\\Big(\\frac{1}{\\sqrt{KT}}+\\frac{1}{KT(1-\\psi)^2}+\n\\frac{1}{T^{3/2}K^{1/2}}\\Big)$ in the non-convex setting for DFedADMM and\nDFedADMM-SAM, respectively, where $1 - \\psi$ represents the spectral gap of the\ngossip matrix. Empirically, extensive experiments on MNIST, CIFAR10 and\nCIFAR100 datesets demonstrate that our algorithms exhibit superior performance\nin terms of both generalization and convergence speed compared to existing\nstate-of-the-art (SOTA) optimizers in DFL.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:22:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Qinglun",""],["Shen","Li",""],["Li","Guanghao",""],["Yin","Quanjun",""],["Tao","Dacheng",""]]}
{"id":"2308.08291","submitter":"Cem Tekin","authors":"Artun Saday, Ya\\c{s}ar Cahit Y{\\i}ld{\\i}r{\\i}m, Cem Tekin","title":"Robust Bayesian Satisficing","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":"  Distributional shifts pose a significant challenge to achieving robustness in\ncontemporary machine learning. To overcome this challenge, robust satisficing\n(RS) seeks a robust solution to an unspecified distributional shift while\nachieving a utility above a desired threshold. This paper focuses on the\nproblem of RS in contextual Bayesian optimization when there is a discrepancy\nbetween the true and reference distributions of the context. We propose a novel\nrobust Bayesian satisficing algorithm called RoBOS for noisy black-box\noptimization. Our algorithm guarantees sublinear lenient regret under certain\nassumptions on the amount of distribution shift. In addition, we define a\nweaker notion of regret called robust satisficing regret, in which our\nalgorithm achieves a sublinear upper bound independent of the amount of\ndistribution shift. To demonstrate the effectiveness of our method, we apply it\nto various learning problems and compare it to other approaches, such as\ndistributionally robust optimization.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:31:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Saday","Artun",""],["Y\u0131ld\u0131r\u0131m","Ya\u015far Cahit",""],["Tekin","Cem",""]]}
{"id":"2308.08292","submitter":"Tobias Lorey","authors":"Stefan Huber, Tobias Lorey, Michael Felderer","title":"Techniques for Improving the Energy Efficiency of Mobile Apps: A\n  Taxonomy and 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":"  Building energy efficient software is an increasingly important task for\nmobile developers. However, a cumulative body of knowledge of techniques that\nsupport this goal does not exist. We conduct a systematic literature review to\ngather information on existing techniques that allow developers to increase\nenergy efficiency in mobile apps. Based on a synthesis of the 91 included\nprimary studies, we propose a taxonomy of techniques for improving the energy\nefficiency in mobile apps. The taxonomy includes seven main categories of\ntechniques and serves as a collection of available methods for developers and\nas a reference guide for software testers when performing energy efficiency\ntesting by the means of benchmark tests.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:37:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Huber","Stefan",""],["Lorey","Tobias",""],["Felderer","Michael",""]]}
{"id":"2308.08293","submitter":"Obrad Kasum","authors":"Obrad Kasum, Boban Veli\\v{c}kovi\\'c","title":"Marginalia to a Theorem of Asper\\'o and Schindler","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We describe a general method for adding a model of an infinitary\npropositional formula by stationary set preserving forcing. As a consequence we\nobtain a somewhat different proof of the Asper\\'o-Schindler theorem stating\nthat $\\mathsf{MM}^{++}$ implies Woodin's axiom $(*)$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:41:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kasum","Obrad",""],["Veli\u010dkovi\u0107","Boban",""]]}
{"id":"2308.08294","submitter":"Anton Okhotnikov","authors":"Nikita Torgashov, Rostislav Makarov, Ivan Yakovlev, Pavel Malov,\n  Andrei Balykin, Anton Okhotnikov","title":"The ID R&D VoxCeleb Speaker Recognition Challenge 2023 System\n  Description","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report describes ID R&D team submissions for Track 2 (open) to the\nVoxCeleb Speaker Recognition Challenge 2023 (VoxSRC-23). Our solution is based\non the fusion of deep ResNets and self-supervised learning (SSL) based models\ntrained on a mixture of a VoxCeleb2 dataset and a large version of a VoxTube\ndataset. The final submission to the Track 2 achieved the first place on the\nVoxSRC-23 public leaderboard with a minDCF(0.05) of 0.0762 and EER of 1.30%.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:42:02 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 09:08:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Torgashov","Nikita",""],["Makarov","Rostislav",""],["Yakovlev","Ivan",""],["Malov","Pavel",""],["Balykin","Andrei",""],["Okhotnikov","Anton",""]]}
{"id":"2308.08295","submitter":"Zecheng Tang","authors":"Zecheng Tang, Keyan Zhou, Pinzheng Wang, Yuyang Ding, Juntao Li,\n  Minzhang","title":"Detoxify Language Model Step-by-Step","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detoxification for LLMs is challenging since it requires models to avoid\ngenerating harmful content while maintaining the generation capability. To\nensure the safety of generations, previous detoxification methods detoxify the\nmodels by changing the data distributions or constraining the generations from\ndifferent aspects in a single-step manner. However, these approaches will\ndramatically affect the generation quality of LLMs, e.g., discourse coherence\nand semantic consistency, since language models tend to generate along the\ntoxic prompt while detoxification methods work in the opposite direction. To\nhandle such a conflict, we decompose the detoxification process into different\nsub-steps, where the detoxification is concentrated in the input stage and the\nsubsequent continual generation is based on the non-toxic prompt. Besides, we\nalso calibrate the strong reasoning ability of LLMs by designing a Detox-Chain\nto connect the above sub-steps in an orderly manner, which allows LLMs to\ndetoxify the text step-by-step. Automatic and human evaluation on two\nbenchmarks reveals that by training with Detox-Chain, six LLMs scaling from 1B\nto 33B can obtain significant detoxification and generation improvement. Our\ncode and data are available at https://github.com/CODINNLG/Detox-CoT. Warning:\nexamples in the paper may contain uncensored offensive content.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:50:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tang","Zecheng",""],["Zhou","Keyan",""],["Wang","Pinzheng",""],["Ding","Yuyang",""],["Li","Juntao",""],["Minzhang","",""]]}
{"id":"2308.08296","submitter":"Yuan Xu","authors":"Sai Li and Zhongchu Ni and Libo Zhang and Yanyan Cai and Jiasheng Mai\n  and Shengcheng Wen and Pan Zheng and Xiaowei Deng and Song Liu and Yuan Xu\n  and Dapeng Yu","title":"Autonomous stabilization of Fock states in an oscillator against\n  multi-photon losses","comments":"Main text: 6 pages, 4 figures; Supplementary material: 6 pages, 4\n  figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fock states with a well-defined number of photons in an oscillator have shown\na wide range of applications in quantum information science. Nonetheless, their\nusefulness has been marred by single and multiple photon losses due to\nunavoidable environment-induced dissipation. Though several dissipation\nengineering methods have been developed to counteract the leading single-photon\nloss error, averting multiple photon losses remains elusive. Here, we\nexperimentally demonstrate a dissipation engineering method that autonomously\nstabilizes multi-photon Fock states against losses of multiple photons using a\ncascaded selective photon-addition operation in a superconducting quantum\ncircuit. Through measuring the photon-number populations and Wigner tomography\nof the oscillator states, we observe a prolonged preservation of quantum\ncoherence properties for the stabilized Fock states $\\vert N\\rangle$ with\n$N=1,2,3$ for a duration of about $10$~ms, far surpassing their intrinsic\nlifetimes of less than $50~\\mu$s. Furthermore, the dissipation engineering\nmethod demonstrated here also facilitates the implementation of a non-unitary\noperation for resetting a binomially-encoded logical qubit. These results\nhighlight the potential application in error-correctable quantum information\nprocessing against multi-photon-loss errors.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:58:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Sai",""],["Ni","Zhongchu",""],["Zhang","Libo",""],["Cai","Yanyan",""],["Mai","Jiasheng",""],["Wen","Shengcheng",""],["Zheng","Pan",""],["Deng","Xiaowei",""],["Liu","Song",""],["Xu","Yuan",""],["Yu","Dapeng",""]]}
{"id":"2308.08297","submitter":"Jan Philip Sindel","authors":"J.P. Sindel, Ch. Helling, D. Gobrecht, K.L. Chubb, and L. Decin","title":"Infrared spectra of TiO2 clusters for hot Jupiter atmospheres","comments":"8 pages, 8 figures, 1 table, 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":"  Context. Clouds seem unavoidable in cool and dense environments, and hence,\nare necessary to explain observations of exoplanet atmospheres, most recently\nof WASP 96b with JWST. Understanding the formation of cloud condensation nuclei\nin non-terrestrial environments is therefore crucial to develop accurate models\nto interpret present and future observations. Aims. The goal of the paper is to\nsupport observations with infrared spectra for (TiO2)N clusters in order to\nstudy cloud formation in exoplanet atmospheres. Methods. Vibrational\nfrequencies are derived from quantum-chemical calculations for 123\n(TiO2)-clusters and their isomers, and line-broadening mechanisms are\nevaluated. Cluster spectra are calculated for several atmospheric levels for\ntwo example exoplanet atmospheres (WASP 121b-like and WASP 96b-like) to\nidentify possible spectral fingerprints for cloud formation. Results.\nRotational motion of and transitions in the clusters cause significant line\nbroadening, so that individual vibrational lines are broadened beyond the\nspectral resolution of the medium resolution mode of the JWST mid-infrared\ninstrument MIRI at R = 3000. However, each individual cluster isomer exhibits a\n\"fingerprint\" IR spectrum. In particular, larger (TiO2)-clusters have\ndistinctly different spectra from smaller clusters. Morning and evening\nterminator for the same planet can exhibit different total absorbances due to\ndifferent cluster sizes being more abundant. Conclusions. The largest\n(TiO2)-clusters are not necessarily the most abundant (TiO2)-clusters in the\nhigh-altitude regions of ultra-hot Jupiters, and the different cluster isomers\nwill contribute to the local absorbance. Planets with a considerable day-night\nasymmetry will be most suitable to search for (TiO2)-cluster isomers in order\nto improve cloud formation modelling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:59:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sindel","J. P.",""],["Helling","Ch.",""],["Gobrecht","D.",""],["Chubb","K. L.",""],["Decin","L.",""]]}
{"id":"2308.08298","submitter":"Wei-Min Liu","authors":"Wei-Min Liu, Long Jiang, Wen-Cong Chen, Xiang-Dong Li","title":"White Dwarf Mass Growth in Cataclysmic Variables: Roles of Dwarf Novae","comments":"9 pages, 6 figures, 4 tables. Published in MNRAS","journal-ref":"MNRAS 523, 907 (2023)","doi":"10.1093/mnras/stad1423","report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The disc instability mechanism (DIM) is widely accepted to account for the\ntransient behaviour of dwarf novae (DNe), which experience short outbursts\nseparated by long quiescence. The duty cycle (the ratio between the outburst\nduration and the recurrence time) determines the amount of accreted mass by the\nwhite dwarf (WDs) during outbursts, thus playing an important role in the\nlong-term binary evolution. Employing the code of Modules for Experiments in\nStellar Astrophysics, we systemically investigate the influence of the duty\ncycles on the evolution of DNe and the mass growth of accreting carbon-oxygen\n(CO) WDs. Our calculations show that, while the DIM can considerably influence\nthe accretion process, efficient WD-mass growth requires a particular range of\nthe duty cycle. For WDs with the initial masses of 0.6, 0.7 and 1.1 $M_\\odot$,\nthese duty cycles are 0.006$\\,\\leq$$d$$\\,\\leq$0.007, $d$\\,=\\,0.005 and\n$d$\\,=\\,0.003, and the accumulated mass of the WDs can reach 0.1, 0.13 and 0.21\n$M_\\odot$, respectively. In all of our simulations, no CO WDs can grow their\nmasses to the explosion mass of Type Ia supernovae of about $1.38~M_\\odot$.\nBecause of a much short timescale of the outburst state, the final donor-star\nmasses and orbital periods are insensitive to the duty cycles. Therefore, we\npropose that the DIM in DNe could alleviate the WD mass problem to some extent.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:59:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Wei-Min",""],["Jiang","Long",""],["Chen","Wen-Cong",""],["Li","Xiang-Dong",""]]}
{"id":"2308.08299","submitter":"Dina Traykova","authors":"Josu C. Aurrekoetxea, Jamie Bamber, Sam E. Brady, Katy Clough, Thomas\n  Helfer, James Marsden, Dina Traykova, Zipeng Wang","title":"GRDzhadzha: A code for evolving relativistic matter on analytic metric\n  backgrounds","comments":"Submitted for review in the Journal of Open Source Software; Comments\n  welcome; The code can be found at https://github.com/GRChombo/GRDzhadzha.git","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  GRDzhadzha is an open-source code for relativistic simulations of matter\nfields on curved spacetimes that admit an analytic description (e.g. stationary\nblack holes). It is based on the publicly available 3+1D numerical relativity\ncode GRChombo. Such a description is valid where the density of the matter is\nsmall compared to the curvature scale of the spacetime, which is the case for\nmany physical scenarios - for example, dark matter environments. The approach\noffers significant savings on memory and speed compared to running full\nnumerical relativity simulations, since the metric variables and their\nderivatives are calculated analytically, and therefore are not evolved or\nstored on the grid. This brief paper introduces the code and gives details of\nsome applications for which it has already been used.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:59:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Aurrekoetxea","Josu C.",""],["Bamber","Jamie",""],["Brady","Sam E.",""],["Clough","Katy",""],["Helfer","Thomas",""],["Marsden","James",""],["Traykova","Dina",""],["Wang","Zipeng",""]]}
{"id":"2308.08300","submitter":"Wei Shen","authors":"Wei Shen, Daohan Wang, Jin Min Yang","title":"Hierarchical High-Point Energy Flow Network for Jet Tagging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Jet substructure observable basis is a systematic and powerful tool for\nanalyzing the internal energy distribution of constituent particles within a\njet. In this work, we propose a novel method to insert neural networks into jet\nsubstructure basis as a simple yet efficient interpretable IRC-safe deep\nlearning framework to discover discriminative jet observables. The Energy Flow\nPolynomial (EFP) could be computed with a certain summation order, resulting in\na reorganized form which exhibits hierarchical IRC-safety. Thus inserting\nnon-linear functions after the separate summation could significantly extend\nthe scope of IRC-safe jet substructure observables, where neural networks can\ncome into play as an important role. Based on the structure of the simplest\nclass of EFPs which corresponds to path graphs, we propose the Hierarchical\nEnergy Flow Networks and the Local Hierarchical Energy Flow Networks. These two\narchitectures exhibit remarkable discrimination performance on the top tagging\ndataset and quark-gluon dataset compared to other benchmark algorithms even\nonly utilizing the kinematic information of constituent particles.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:59:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shen","Wei",""],["Wang","Daohan",""],["Yang","Jin Min",""]]}
{"id":"2308.08301","submitter":"Aur\\`ele Goetz","authors":"Aur\\`ele Goetz, Pablo Jeken Rico, Yves Chau, Jacques S\\'edat,\n  Aur\\'elien Larcher, Elie Hachem","title":"Proposal for Numerical Benchmarking of Fluid-Structure Interaction in\n  Cerebral Aneurysms","comments":"23 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.bio-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational fluid dynamics is intensively used to deepen the understanding\nof aneurysm growth and rupture in the attempt to support physicians during\ntherapy planning. Numerous studies have assumed fully-rigid vessel walls in\ntheir simulations, whose sole hemodynamics may fail to provide a satisfactory\ncriterion for rupture risk assessment. Moreover, direct in-vivo observations of\nintracranial aneurysm pulsation have been recently reported, encouraging the\ndevelopment of fluid-structure interaction for their modelling and for new\nassessments. In this work, we describe a new fluid-structure interaction\nbenchmark setting for the careful evaluation of different aneurysm shapes. The\nstudied configurations consist of three real aneurysm domes positioned on a\ntoroidal channel. All geometric features, meshing characteristics, flow\nquantities, comparisons with a rigid-wall model and corresponding plots are\nprovided. Reported results emphasize the alteration of flow patterns and\nhemodynamic descriptors when moving from the rigid-wall model to the complete\nfluid-structure interaction framework, thereby underlining the importance of\nthe coupling between hemodynamics and the surrounding vessel tissue.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:02:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Goetz","Aur\u00e8le",""],["Rico","Pablo Jeken",""],["Chau","Yves",""],["S\u00e9dat","Jacques",""],["Larcher","Aur\u00e9lien",""],["Hachem","Elie",""]]}
{"id":"2308.08302","submitter":"Ribhu Chopra","authors":"Ashish Pratap Singh, Ribhu Chopra","title":"PSA Based Power Control for Cell-Free Massive MIMO under LoS/NLoS\n  Channels","comments":"10 pages, 10 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":"  A primary design goal of the cell-free~(CF) massive MIMO architecture is to\nprovide uniformly good coverage to all the user equipments~(UEs) connected to\nthe network. However, it has been found that this requirement may not be\nsatisfied in case the channels between the access points~(APs) and the UEs are\nmixed LoS/NLoS. In this paper, we try to address this issue via the use of\nappropriate power control in both the uplink and downlink of a CF massive MIMO\nsystem under mixed LoS/NLoS channels. We find that simplistic power control\ntechniques, such as channel inversion-based power control perform sub-optimally\nas compared to max-min power control. As a consequence, we propose a particle\nswarm algorithm~(PSA) based power control algorithm to optimize the performance\nof the system under study. We then use numerical simulations to evaluate the\nperformance of the proposed PSA-based solution and show that it results in a\nsignificant improvement in the fairness of the underlying system while\nincurring a lower computational complexity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:05:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Singh","Ashish Pratap",""],["Chopra","Ribhu",""]]}
{"id":"2308.08303","submitter":"Sanket Thakur","authors":"Sanket Thakur, Cigdem Beyan, Pietro Morerio, Vittorio Murino, Alessio\n  Del Bue","title":"Leveraging Next-Active Objects for Context-Aware Anticipation in\n  Egocentric Videos","comments":"Accepted in WACV'24","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Objects are crucial for understanding human-object interactions. By\nidentifying the relevant objects, one can also predict potential future\ninteractions or actions that may occur with these objects. In this paper, we\nstudy the problem of Short-Term Object interaction anticipation (STA) and\npropose NAOGAT (Next-Active-Object Guided Anticipation Transformer), a\nmulti-modal end-to-end transformer network, that attends to objects in observed\nframes in order to anticipate the next-active-object (NAO) and, eventually, to\nguide the model to predict context-aware future actions. The task is\nchallenging since it requires anticipating future action along with the object\nwith which the action occurs and the time after which the interaction will\nbegin, a.k.a. the time to contact (TTC). Compared to existing video modeling\narchitectures for action anticipation, NAOGAT captures the relationship between\nobjects and the global scene context in order to predict detections for the\nnext active object and anticipate relevant future actions given these\ndetections, leveraging the objects' dynamics to improve accuracy. One of the\nkey strengths of our approach, in fact, is its ability to exploit the motion\ndynamics of objects within a given clip, which is often ignored by other\nmodels, and separately decoding the object-centric and motion-centric\ninformation. Through our experiments, we show that our model outperforms\nexisting methods on two separate datasets, Ego4D and EpicKitchens-100 (\"Unseen\nSet\"), as measured by several additional metrics, such as time to contact, and\nnext-active-object localization. The code will be available upon acceptance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:07:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Thakur","Sanket",""],["Beyan","Cigdem",""],["Morerio","Pietro",""],["Murino","Vittorio",""],["Del Bue","Alessio",""]]}
{"id":"2308.08304","submitter":"Matheus Ara\\'ujo Marques","authors":"D. Bazeia, M.A. Marques and R. Menezes","title":"Geometrically constrained kinklike configurations engendering long\n  range, double exponential, half-compact and compact behavior","comments":"15 pages, 4 figures; to appear in EPJ Plus","journal-ref":"Eur. Phys. J. Plus 138 (2023) 735","doi":"10.1140/epjp/s13360-023-04385-4","report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe a procedure that contributes to modify the asymptotic behavior of\nkinks in a model described by two real scalar fields. The investigation takes\nadvantage of a first order formalism based on energy minimization to unveil how\nto modify the asymptotic profile of kinklike configurations. In particular, we\nshow that the exponential tails of standard kinklike configurations can be\nsmoothly modified to engender long range, double exponential, half-compact or\ncompact behavior.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:08:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bazeia","D.",""],["Marques","M. A.",""],["Menezes","R.",""]]}
{"id":"2308.08305","submitter":"Marcelo Hartmann","authors":"Marcelo Hartmann, Bernardo Williams, Hanlin Yu, Mark Girolami,\n  Alessandro Barp and Arto Klami","title":"Warped geometric information on the optimisation of Euclidean functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider the fundamental task of optimizing a real-valued function defined\nin a potentially high-dimensional Euclidean space, such as the loss function in\nmany machine-learning tasks or the logarithm of the probability distribution in\nstatistical inference. We use the warped Riemannian geometry notions to\nredefine the optimisation problem of a function on Euclidean space to a\nRiemannian manifold with a warped metric, and then find the function's optimum\nalong this manifold. The warped metric chosen for the search domain induces a\ncomputational friendly metric-tensor for which optimal search directions\nassociate with geodesic curves on the manifold becomes easier to compute.\nPerforming optimization along geodesics is known to be generally infeasible,\nyet we show that in this specific manifold we can analytically derive Taylor\napproximations up to third-order. In general these approximations to the\ngeodesic curve will not lie on the manifold, however we construct suitable\nretraction maps to pull them back onto the manifold. Therefore, we can\nefficiently optimize along the approximate geodesic curves. We cover the\nrelated theory, describe a practical optimization algorithm and empirically\nevaluate it on a collection of challenging optimisation benchmarks. Our\nproposed algorithm, using third-order approximation of geodesics, outperforms\nstandard Euclidean gradient-based counterparts in term of number of iterations\nuntil convergence and an alternative method for Hessian-based optimisation\nroutines.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:08:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hartmann","Marcelo",""],["Williams","Bernardo",""],["Yu","Hanlin",""],["Girolami","Mark",""],["Barp","Alessandro",""],["Klami","Arto",""]]}
{"id":"2308.08306","submitter":"Franziska Braun","authors":"Franziska Braun, Sebastian P. Bayerl, Paula A. P\\'erez-Toro, Florian\n  H\\\"onig, Hartmut Lehfeld, Thomas Hillemacher, Elmar N\\\"oth, Tobias Bocklet,\n  Korbinian Riedhammer","title":"Classifying Dementia in the Presence of Depression: A Cross-Corpus Study","comments":"Accepted at INTERSPEECH 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automated dementia screening enables early detection and intervention,\nreducing costs to healthcare systems and increasing quality of life for those\naffected. Depression has shared symptoms with dementia, adding complexity to\ndiagnoses. The research focus so far has been on binary classification of\ndementia (DEM) and healthy controls (HC) using speech from picture description\ntests from a single dataset. In this work, we apply established baseline\nsystems to discriminate cognitive impairment in speech from the semantic Verbal\nFluency Test and the Boston Naming Test using text, audio and emotion\nembeddings in a 3-class classification problem (HC vs. MCI vs. DEM). We perform\ncross-corpus and mixed-corpus experiments on two independently recorded German\ndatasets to investigate generalization to larger populations and different\nrecording conditions. In a detailed error analysis, we look at depression as a\nsecondary diagnosis to understand what our classifiers actually learn.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:09:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Braun","Franziska",""],["Bayerl","Sebastian P.",""],["P\u00e9rez-Toro","Paula A.",""],["H\u00f6nig","Florian",""],["Lehfeld","Hartmut",""],["Hillemacher","Thomas",""],["N\u00f6th","Elmar",""],["Bocklet","Tobias",""],["Riedhammer","Korbinian",""]]}
{"id":"2308.08307","submitter":"Toon Van de Maele","authors":"Toon Van de Maele, Bart Dhoedt, Tim Verbelen, Giovanni Pezzulo","title":"Integrating cognitive map learning and active inference for planning in\n  ambiguous environments","comments":"Accepted at IWAI 2023 (International Workshop on Active Inference)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Living organisms need to acquire both cognitive maps for learning the\nstructure of the world and planning mechanisms able to deal with the challenges\nof navigating ambiguous environments. Although significant progress has been\nmade in each of these areas independently, the best way to integrate them is an\nopen research question. In this paper, we propose the integration of a\nstatistical model of cognitive map formation within an active inference agent\nthat supports planning under uncertainty. Specifically, we examine the\nclone-structured cognitive graph (CSCG) model of cognitive map formation and\ncompare a naive clone graph agent with an active inference-driven clone graph\nagent, in three spatial navigation scenarios. Our findings demonstrate that\nwhile both agents are effective in simple scenarios, the active inference agent\nis more effective when planning in challenging scenarios, in which sensory\nobservations provide ambiguous information about location.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:10:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Van de Maele","Toon",""],["Dhoedt","Bart",""],["Verbelen","Tim",""],["Pezzulo","Giovanni",""]]}
{"id":"2308.08308","submitter":"Jean-Baptiste Fouvry","authors":"Ouassim Feliachi and Jean-Baptiste Fouvry","title":"Dynamical large deviations for long-range interacting inhomogeneous\n  systems without collective effects","comments":"13 pages, 0 figures, submitted to APS","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the long-term evolution of an inhomogeneous long-range\ninteracting $N$-body system. Placing ourselves in the dynamically hot limit,\ni.e. neglecting collective effects, we derive a large deviation principle for\nthe system's empirical angle-averaged distribution function. This result\nextends the classical ensemble-averaged kinetic theory given by the so-called\ninhomogeneous Landau equation, as it specifies the probability of typical and\nlarge dynamical fluctuations. We detail the main properties of the associated\nlarge deviation Hamiltonian, in particular how it complies with the system's\nconservation laws and possesses a gradient structure.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:10:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Feliachi","Ouassim",""],["Fouvry","Jean-Baptiste",""]]}
{"id":"2308.08309","submitter":"Marc Goerigk","authors":"Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers,\n  Arthur Miehlich","title":"A Framework for Data-Driven Explainability in Mathematical Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advancements in mathematical programming have made it possible to efficiently\ntackle large-scale real-world problems that were deemed intractable just a few\ndecades ago. However, provably optimal solutions may not be accepted due to the\nperception of optimization software as a black box. Although well understood by\nscientists, this lacks easy accessibility for practitioners. Hence, we advocate\nfor introducing the explainability of a solution as another evaluation\ncriterion, next to its objective value, which enables us to find trade-off\nsolutions between these two criteria. Explainability is attained by comparing\nagainst (not necessarily optimal) solutions that were implemented in similar\nsituations in the past. Thus, solutions are preferred that exhibit similar\nfeatures. Although we prove that already in simple cases the explainable model\nis NP-hard, we characterize relevant polynomially solvable cases such as the\nexplainable shortest-path problem. Our numerical experiments on both artificial\nas well as real-world road networks show the resulting Pareto front. It turns\nout that the cost of enforcing explainability can be very small.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:12:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Aigner","Kevin-Martin",""],["Goerigk","Marc",""],["Hartisch","Michael",""],["Liers","Frauke",""],["Miehlich","Arthur",""]]}
{"id":"2308.08310","submitter":"Lucas Lange","authors":"Lucas Lange and Tobias Schreieder and Victor Christen and Erhard Rahm","title":"Privacy at Risk: Exploiting Similarities in Health Data for Identity\n  Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Smartwatches enable the efficient collection of health data that can be used\nfor research and comprehensive analysis to improve the health of individuals.\nIn addition to the analysis capabilities, ensuring privacy when handling health\ndata is a critical concern as the collection and analysis of such data become\npervasive. Since health data contains sensitive information, it should be\nhandled with responsibility and is therefore often treated anonymously.\nHowever, also the data itself can be exploited to reveal information and break\nanonymity. We propose a novel similarity-based re-identification attack on\ntime-series health data and thereby unveil a significant vulnerability. Despite\nprivacy measures that remove identifying information, our attack demonstrates\nthat a brief amount of various sensor data from a target individual is adequate\nto possibly identify them within a database of other samples, solely based on\nsensor-level similarities. In our example scenario, where data owners leverage\nhealth data from smartwatches, findings show that we are able to correctly link\nthe target data in two out of three cases. User privacy is thus already\ninherently threatened by the data itself and even when removing personal\ninformation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:14:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lange","Lucas",""],["Schreieder","Tobias",""],["Christen","Victor",""],["Rahm","Erhard",""]]}
{"id":"2308.08311","submitter":"Davide Sclosa","authors":"Davide Sclosa","title":"Graph Gradient Diffusion","comments":"22 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CO math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze graph dynamical systems with odd analytic coupling. The set of\nequilibria is union of manifolds, which can intersect and have different\ndimension. The geometry of this set depends on the coupling function, as well\nas several properties of the underlying graph, such as homology, coverings,\nconnectivity and symmetry. Equilibrium stability can change among the manifolds\nof equilibria and within a single manifold of equilibria. The gradient\nstructure and topological bifurcation theory can be leveraged to establish\nLyapunov, asymptotic, and linear stability.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:15:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sclosa","Davide",""]]}
{"id":"2308.08312","submitter":"Bernhard M\\\"uller","authors":"B. M\\\"uller (Monash University)","title":"Fallback onto Kicked Neutron Stars and its Effect on Spin-Kick Alignment","comments":"9 pages, 4 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fallback in core-collapse supernova explosions is potentially of significant\nimportance for the birth spins of neutron stars and black holes. It has\nrecently been pointed out that the angular momentum imparted onto a compact\nremnant by fallback material is subtly intertwined with its kick because\nfallback onto a moving neutron star or black hole will preferentially come for\na conical region around its direction of travel. We show that contrary to\nearlier expectations such one-sided fallback accretion onto a neutron star will\ntend to produce spin-kick misalignment. Since the baroclinic driving term in\nthe vorticity equation is perpendicular to the nearly radial pressure gradient,\nconvective eddies in the progenitor as well as Rayleigh-Taylor plumes growing\nduring the explosion primarily carry angular momentum perpendicular to the\nradial direction. Fallback material from the accretion volume of a moving\nneutron star therefore carries substantial angular momentum perpendicular to\nthe kick velocity. We estimate the seed angular momentum fluctuations from\nconvective motions in core-collapse supernova progenitors and argue that\naccreted fallback material will almost invariably be accreted with the maximum\npermissible specific angular momentum for reaching the Alfv\\'en radius. This\nimposes a limit of $\\mathord{\\sim}10^{-2}M_\\odot$ of fallback accretion for\nfast-spinning young neutron stars with periods of\n$\\mathord{\\sim}20\\,\\mathrm{ms}$ and less for longer birth spin periods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:15:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["M\u00fcller","B.","","Monash University"]]}
{"id":"2308.08313","submitter":"Dechao Tang","authors":"Dechao Tang, Xuanyi Li, Tianming Du, Deguo Ma, Zhiyu Ma, Hongzan Sun,\n  Marcin Grzegorzek, Huiyan Jiang, Chen Li","title":"ECPC-IDS:A benchmark endometrail cancer PET/CT image dataset for\n  evaluation of semantic segmentation and detection of hypermetabolic regions","comments":"14 pages,6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Endometrial cancer is one of the most common tumors in the female\nreproductive system and is the third most common gynecological malignancy that\ncauses death after ovarian and cervical cancer. Early diagnosis can\nsignificantly improve the 5-year survival rate of patients. With the\ndevelopment of artificial intelligence, computer-assisted diagnosis plays an\nincreasingly important role in improving the accuracy and objectivity of\ndiagnosis, as well as reducing the workload of doctors. However, the absence of\npublicly available endometrial cancer image datasets restricts the application\nof computer-assisted diagnostic techniques.In this paper, a publicly available\nEndometrial Cancer PET/CT Image Dataset for Evaluation of Semantic Segmentation\nand Detection of Hypermetabolic Regions (ECPC-IDS) are published. Specifically,\nthe segmentation section includes PET and CT images, with a total of 7159\nimages in multiple formats. In order to prove the effectiveness of segmentation\nmethods on ECPC-IDS, five classical deep learning semantic segmentation methods\nare selected to test the image segmentation task. The object detection section\nalso includes PET and CT images, with a total of 3579 images and XML files with\nannotation information. Six deep learning methods are selected for experiments\non the detection task.This study conduct extensive experiments using deep\nlearning-based semantic segmentation and object detection methods to\ndemonstrate the differences between various methods on ECPC-IDS. As far as we\nknow, this is the first publicly available dataset of endometrial cancer with a\nlarge number of multiple images, including a large amount of information\nrequired for image and target detection. ECPC-IDS can aid researchers in\nexploring new algorithms to enhance computer-assisted technology, benefiting\nboth clinical doctors and patients greatly.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:18:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tang","Dechao",""],["Li","Xuanyi",""],["Du","Tianming",""],["Ma","Deguo",""],["Ma","Zhiyu",""],["Sun","Hongzan",""],["Grzegorzek","Marcin",""],["Jiang","Huiyan",""],["Li","Chen",""]]}
{"id":"2308.08314","submitter":"Gonzalo Mart\\'inez Lema","authors":"G. Mart\\'inez-Lema, A. Roy, A. Breskin and L. Arazi","title":"Electron transfer efficiency in liquid xenon across THGEM holes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det astro-ph.IM hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dual-phase liquid-xenon time projection chambers (LXe TPCs) deploying a few\ntonnes of liquid are presently leading the search for WIMP dark matter. Scaling\nthese detectors to 10-fold larger fiducial masses, while improving their\nsensitivity to low-mass WIMPs presents difficult challenges in detector design.\nSeveral groups are considering a departure from current schemes, towards either\nsingle-phase liquid-only TPCs, or dual-phase detectors where the\nelectroluminescence region consists of patterned electrodes. Here, we discuss\nthe possible use of Thick Gaseous Electron Multipliers (THGEMs) coated with a\nVUV photocathode and immersed in LXe as a building block in such designs. We\nfocus on the transfer efficiencies of ionization electrons and photoelectrons\nemitted from the photocathode through the electrode holes, and show\nexperimentally that efficiencies approaching 100 % can be achieved with\nrealistic voltage settings. The observed voltage dependence of the transfer\nefficiencies is consistent with electron transport simulations once diffusion\nand charging-up effects are included.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:20:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mart\u00ednez-Lema","G.",""],["Roy","A.",""],["Breskin","A.",""],["Arazi","L.",""]]}
{"id":"2308.08315","submitter":"Annibal Figueiredo","authors":"Iram Gleriaa, Sergio Da Silvab, Leon Brenig, Tarc{\\i}sio M. Rocha\n  Filho, Annibal Figueiredo","title":"Modified Verhulst-Solow model for long-term population and economic\n  growths","comments":"28 pages, 9 figures, Preprint Article","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":"  In this study, we analyze the relationship between human population growth\nand economic dynamics. To do so, we present a modified version of the Verhulst\nmodel and the Solow model, which together simulate population dynamics and the\nrole of economic variables in capital accumulation. The model incorporates\nsupport and foraging functions, which participate in the dynamic relationship\nbetween population growth and the creation and destruction of carrying\ncapacity. The validity of the model is demonstrated using empirical data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:21:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gleriaa","Iram",""],["Da Silvab","Sergio",""],["Brenig","Leon",""],["Filho","Tarc\u0131sio M. Rocha",""],["Figueiredo","Annibal",""]]}
{"id":"2308.08316","submitter":"Binhui Liu","authors":"Binhui Liu, Xin Liu, Anbo Dai, Zhiyong Zeng, Zhen Cui, Jian Yang","title":"Dual-Stream Diffusion Net for Text-to-Video Generation","comments":"8pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the emerging diffusion models, recently, text-to-video generation has\naroused increasing attention. But an important bottleneck therein is that\ngenerative videos often tend to carry some flickers and artifacts. In this\nwork, we propose a dual-stream diffusion net (DSDN) to improve the consistency\nof content variations in generating videos. In particular, the designed two\ndiffusion streams, video content and motion branches, could not only run\nseparately in their private spaces for producing personalized video variations\nas well as content, but also be well-aligned between the content and motion\ndomains through leveraging our designed cross-transformer interaction module,\nwhich would benefit the smoothness of generated videos. Besides, we also\nintroduce motion decomposer and combiner to faciliate the operation on video\nmotion. Qualitative and quantitative experiments demonstrate that our method\ncould produce amazing continuous videos with fewer flickers.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:22:29 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 01:31:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Binhui",""],["Liu","Xin",""],["Dai","Anbo",""],["Zeng","Zhiyong",""],["Cui","Zhen",""],["Yang","Jian",""]]}
{"id":"2308.08317","submitter":"Hristo Sariev","authors":"Hristo Sariev, Mladen Savov","title":"Sufficientness postulates for measure-valued P\\'{o}lya urn sequences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a recent paper, the authors studied the distribution properties of a class\nof exchangeable processes, called measure-valued P\\'{o}lya urn sequences, which\narise as the observation process in a generalized urn sampling scheme. Here we\nprovide three results in the form of \"sufficientness\" postulates that\ncharacterize their predictive distributions. In particular, we show that\nexchangeable measure-valued P\\'{o}lya urn sequences are the unique exchangeable\nmodels for which the predictive distributions are a mixture of the marginal\ndistribution and an average of some probability kernels evaluated at past\nobservation. When the latter coincides with the empirical measure, we recover a\nwell-known result for the exchangeable model with a Dirichlet process prior.\nThe other two sufficientness postulates consider the case when the state space\nis finite.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:23:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sariev","Hristo",""],["Savov","Mladen",""]]}
{"id":"2308.08318","submitter":"Marek Stryjczyk","authors":"A. Jaries, M. Stryjczyk, A. Kankainen, T. Eronen, Z. Ge, M. Hukkanen,\n  I.D. Moore, M. Mougeot, A. Raggio, W. Rattanasakuldilok, J. Ruotsalainen","title":"Penning-trap mass measurement of $^{173}$Hf","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the precise mass measurement of the $^{173}$Hf isotope performed\nat the Ion Guide Isotope Separator On-Line facility using the JYFLTRAP double\nPenning trap mass spectrometer. The new mass-excess value, ${\\mathrm{ME} =\n-55390.8(30)}$~keV, is in agreement with the literature while being nine times\nmore precise. The newly determined $^{173}$Hf electron-capture $Q$ value,\n$Q_{EC} = 1490.2(34)$~keV, allows us to firmly reject the population of an\nexcited state at 1578 keV in $^{173}$Lu and 11 transitions tentatively assigned\nto the decay of $^{173}$Hf. Our refined mass value of $^{173}$Hf reduces\nmass-related uncertainties in the reaction rate of\n$^{174}$Hf$(\\gamma,n)^{173}$Hf. Thus, the rate for the main photodisintegration\ndestruction channel of the $p$ nuclide $^{174}$Hf in the relevant temperature\nregion for the $\\gamma$ process is better constrained.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:24:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jaries","A.",""],["Stryjczyk","M.",""],["Kankainen","A.",""],["Eronen","T.",""],["Ge","Z.",""],["Hukkanen","M.",""],["Moore","I. D.",""],["Mougeot","M.",""],["Raggio","A.",""],["Rattanasakuldilok","W.",""],["Ruotsalainen","J.",""]]}
{"id":"2308.08319","submitter":"Parthapratim Mahapatra","authors":"Parthapratim Mahapatra, Marc Favata, K. G. Arun","title":"Testing general relativity via direct measurement of black hole kicks","comments":"7 pages, 3 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":"  Asymmetric emission of gravitational waves during a compact binary\ncoalescence results in the loss of linear momentum and a corresponding `kick'\nor recoil on the binary's center of mass. This leads to a direction-dependent\nDoppler shift of the ringdown gravitational waveform. We quantify the\nmeasurability of the kick imparted to the remnant black hole in a binary black\nhole merger. Future ground- and space-based gravitational wave detectors will\nmeasure this effect to within $\\sim 2\\%$ to $\\sim 30\\%$ for a subset of their\nexpected observed sources. Certain binary configurations in the LISA band may\nallow a sub-percent-level measurement of this effect. This direct measurement\nof black hole kicks can also facilitate a novel test of general relativity\nbased on linear momentum balance. We formulate this kick consistency test via\nmeasurement of a null variable that quantifies the difference between the\ninferred kick (using numerical relativity) and that observed via the\nDoppler-shifted ringdown signal. This null variable can be constrained (at 90%\nconfidence) to $\\sim 10\\%$ to $30\\%$ with Cosmic Explorer and to $\\sim 3\\%$ to\n$12\\%$ with LISA.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:25:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mahapatra","Parthapratim",""],["Favata","Marc",""],["Arun","K. G.",""]]}
{"id":"2308.08320","submitter":"Maciej Molas Dr.","authors":"M. Zinkiewicz, M. Grzeszczyk, T. Kazimierczuk, M. Bartos, K.\n  Nogajewski, W. Pacuski, K. Watanabe, T. Taniguchi, A. Wysmo{\\l}ek, P.\n  Kossacki, M. Potemski, A. Babi\\'nski, M. R. Molas","title":"Raman scattering excitation in monolayers of semiconducting transition\n  metal dichalcogenides","comments":"9 pages, 6 figures, ESI","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":"  Raman scattering excitation (RSE) is an experimental technique in which the\nspectrum is made up by sweeping the excitation energy when the detection energy\nis fixed. We study the low-temperature ($T$=5~K) RSE spectra measured on four\nhigh quality monolayers (ML) of semiconducting transition metal dichalcogenides\n(S-TMDs), $i.e.$ MoS$_2$, MoSe$_2$, WS$_2$, and WSe$_2$, encapsulated in\nhexagonal BN. The outgoing resonant conditions of Raman scattering reveal an\nextraordinary intensity enhancement of the phonon modes, which results in\nextremely rich RSE spectra. The obtained spectra are composed not only of\nRaman-active peaks, $i.e.$ in-plane E$'$ and out-of-plane A$'_1$, but the\nappearance of 1$^{st}$, 2$^{nd}$, and higher-order phonon modes is recognised.\nThe intensity profiles of the A$'_1$ modes in the investigated MLs resemble the\nemissions due to neutral excitons measured in the corresponding PL spectra for\nthe outgoing type of resonant Raman scattering conditions. Furthermore, for the\nWSe$_2$ ML, the A$'_1$ mode was observed when the incoming light was in\nresonance with the neutral exciton line. The strength of the exciton-phonon\ncoupling (EPC) in S-TMD MLs strongly depends on the type of their ground\nexcitonic state, $i.e.$ bright or dark, resulting in different shapes of the\nRSE spectra. Our results demonstrate that RSE spectroscopy is a powerful\ntechnique for studying EPC in S-TMD MLs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:28:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zinkiewicz","M.",""],["Grzeszczyk","M.",""],["Kazimierczuk","T.",""],["Bartos","M.",""],["Nogajewski","K.",""],["Pacuski","W.",""],["Watanabe","K.",""],["Taniguchi","T.",""],["Wysmo\u0142ek","A.",""],["Kossacki","P.",""],["Potemski","M.",""],["Babi\u0144ski","A.",""],["Molas","M. R.",""]]}
{"id":"2308.08321","submitter":"Yuewei Yang","authors":"Yuewei Yang, Hai Li, Yiran Chen","title":"Stable and Causal Inference for Discriminative Self-supervised Deep\n  Visual Representations","comments":"ICCV 2023 accepted paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, discriminative self-supervised methods have made significant\nstrides in advancing various visual tasks. The central idea of learning a data\nencoder that is robust to data distortions/augmentations is straightforward yet\nhighly effective. Although many studies have demonstrated the empirical success\nof various learning methods, the resulting learned representations can exhibit\ninstability and hinder downstream performance. In this study, we analyze\ndiscriminative self-supervised methods from a causal perspective to explain\nthese unstable behaviors and propose solutions to overcome them. Our approach\ndraws inspiration from prior works that empirically demonstrate the ability of\ndiscriminative self-supervised methods to demix ground truth causal sources to\nsome extent. Unlike previous work on causality-empowered representation\nlearning, we do not apply our solutions during the training process but rather\nduring the inference process to improve time efficiency. Through experiments on\nboth controlled image datasets and realistic image datasets, we show that our\nproposed solutions, which involve tempering a linear transformation with\ncontrolled synthetic data, are effective in addressing these issues.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:30:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yang","Yuewei",""],["Li","Hai",""],["Chen","Yiran",""]]}
{"id":"2308.08322","submitter":"Thomas Gross","authors":"Thomas Gro{\\ss}","title":"Towards Valid and Reliable Privacy Concern Scales: The Example of\n  IUIPC-8","comments":"19 pages. Funded by the ERC Starting Grant CASCAde (GA no 716980).\n  arXiv admin note: substantial text overlap with arXiv:2011.11749","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Valid and reliable measurement instruments are crucial for human factors in\nprivacy research. We expect them to measure what they purport to measure,\nyielding validity, and to measure this consistently, offering us reliability.\nWhile there is a range of privacy concern instruments available in the field\nand their investigation continues unabated, we shall focus on a brief form of\nthe scale Internet Users? Information Privacy Concerns (IUIPC-8) as an example.\nWe not only present IUIPC-8 itself, but also consider methods for the\nevaluation of valid and reliable measurement instruments. In this, confirmatory\nfactor analysis (CFA) serves us as a valuable tool. Our inquiry takes into\naccount the ordinal and non-normal data yielded by the IUIPC questionnaire,\ncompares multiple models to confirm the three-dimensionality of the scale,\nexamines global and local fit and, finally, estimates construct validity and\ninternal consistency reliability metrics. We offer a comparison between\nIUIPC-10 and IUIPC-8 drawing on two independent samples. In conclusion, we\nhighlight properties of the scale and considerations for its use in practice.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:33:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gro\u00df","Thomas",""]]}
{"id":"2308.08323","submitter":"Maxence Men\\'etrey","authors":"Maxence Men\\'etrey, Luk\\'a\\v{s} Zezulka, Pascal Fandr\\'e, Fabian\n  Schmid, Ralph Spolenak","title":"Nanodroplet Flight Control in Electrohydrodynamic Redox 3D Printing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Electrohydrodynamic 3D printing is an additive manufacturing technique with\nenormous potential in plasmonics, microelectronics, and sensing applications,\nthanks to its broad materials palette, high voxel deposition rate, and\ncompatibility with various substrates. However, the electric field used to\ndeposit material is concentrated at the depositing structure resulting in the\nfocusing of the charged droplets and geometry-dependent landing positions,\nwhich complicates the fabrication of complex 3D shapes. The low level of\nconcordance between design and printout seriously impedes the development of\nelectrohydrodynamic 3D printing and rationalizes the simplicity of the designs\nreported so far. In this work, we break the electric field centrosymmetry to\nstudy the resulting deviation in the flight trajectory of the droplets.\nComparison of experimental outcomes with predictions of an FEM model provides\nnew insights into the droplet characteristics and unveils how the product of\ndroplet size and charge uniquely governs its kinematics. From these insights,\nwe develop reliable predictions of the jet trajectory and allow the computation\nof optimized printing paths counterbalancing the electric field distortion,\nthereby enabling the fabrication of geometries with unprecedented complexity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:37:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Men\u00e9trey","Maxence",""],["Zezulka","Luk\u00e1\u0161",""],["Fandr\u00e9","Pascal",""],["Schmid","Fabian",""],["Spolenak","Ralph",""]]}
{"id":"2308.08324","submitter":"Cheng Zhang","authors":"Cheng Zhang, Leming Chen, Lujia Zhang, Yongming Huang, Wei Zhang","title":"Incremental Collaborative Beam Alignment for Millimeter Wave Cell-Free\n  MIMO Systems","comments":"15 pages, 15 figures, to appear in the IEEE Transactions on\n  Communications, 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":"  Millimeter wave (mmWave) cell-free MIMO achieves an extremely high rate while\nits beam alignment (BA) suffers from excessive overhead due to a large number\nof transceivers. Recently, user location and probing measurements are utilized\nfor BA based on machine learning (ML) models, e.g., deep neural network (DNN).\nHowever, most of these ML models are centralized with high communication and\ncomputational overhead and give no specific consideration to practical issues,\ne.g., limited training data and real-time model updates. In this paper, we\nstudy the {probing} beam-based BA for mmWave cell-free MIMO downlink with the\nhelp of broad learning (BL). For channels without and with uplink-downlink\nreciprocity, we propose the user-side and base station (BS)-side BL-aided\nincremental collaborative BA approaches. Via transforming the centralized BL\ninto a distributed learning with data and feature splitting respectively, the\nuser-side and BS-side schemes realize implicit sharing of multiple user data\nand multiple BS features. Simulations confirm that the user-side scheme is\napplicable to fast time-varying and/or non-stationary channels, while the\nBS-side scheme is suitable for systems with low-bandwidth fronthaul links and a\ncentral unit with limited computing power. The advantages of proposed schemes\nare also demonstrated compared to traditional and DNN-aided BA schemes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:38:17 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhang","Cheng",""],["Chen","Leming",""],["Zhang","Lujia",""],["Huang","Yongming",""],["Zhang","Wei",""]]}
{"id":"2308.08325","submitter":"Tingyu Qu","authors":"Tingyu Qu, Tinne Tuytelaars, Marie-Francine Moens","title":"Visually-Aware Context Modeling for News Image Captioning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of News Image Captioning is to generate an image caption according\nto the content of both a news article and an image. To leverage the visual\ninformation effectively, it is important to exploit the connection between the\ncontext in the articles/captions and the images. Psychological studies indicate\nthat human faces in images draw higher attention priorities. On top of that,\nhumans often play a central role in news stories, as also proven by the\nface-name co-occurrence pattern we discover in existing News Image Captioning\ndatasets. Therefore, we design a face-naming module for faces in images and\nnames in captions/articles to learn a better name embedding. Apart from names,\nwhich can be directly linked to an image area (faces), news image captions\nmostly contain context information that can only be found in the article.\nHumans typically address this by searching for relevant information from the\narticle based on the image. To emulate this thought process, we design a\nretrieval strategy using CLIP to retrieve sentences that are semantically close\nto the image. We conduct extensive experiments to demonstrate the efficacy of\nour framework. Without using additional paired data, we establish the new\nstate-of-the-art performance on two News Image Captioning datasets, exceeding\nthe previous state-of-the-art by 5 CIDEr points. We will release code upon\nacceptance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:39:39 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Qu","Tingyu",""],["Tuytelaars","Tinne",""],["Moens","Marie-Francine",""]]}
{"id":"2308.08326","submitter":"Andreas Stra{\\ss}hofer","authors":"Andreas Stra{\\ss}hofer, Diego Lentner, Gianluigi Liva, Alexandre\n  Graell i Amat","title":"Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on\n  Generalized Mutual Information","comments":"5 pages, 2 figures, to be presented at ISTC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Chase-Pyndiah decoding is widely used for decoding product codes. However,\nthis method is suboptimal and requires scaling the soft information exchanged\nduring the iterative processing. In this paper, we propose a framework for\nobtaining the scaling coefficients based on maximizing the generalized mutual\ninformation. Our approach yields gains up to 0.11 dB for product codes with\ntwo-error correcting extended BCH component codes over the binary-input\nadditive white Gaussian noise channel compared to the original Chase-Pyndiah\ndecoder with heuristically obtained coefficients. We also introduce an\nextrinsic version of the Chase-Pyndiah decoder and associate product codes with\na turbo-like code ensemble to derive a Monte Carlo-based density evolution\nanalysis. The resulting iterative decoding thresholds accurately predict the\nonset of the waterfall region.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:39:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Stra\u00dfhofer","Andreas",""],["Lentner","Diego",""],["Liva","Gianluigi",""],["Amat","Alexandre Graell i",""]]}
{"id":"2308.08327","submitter":"Lianyu Hu","authors":"Lianyu Hu, Liqing Gao, Zekang Liu, Chi-Man Pun, Wei Feng","title":"AdaBrowse: Adaptive Video Browser for Efficient Continuous Sign Language\n  Recognition","comments":"ACMMM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Raw videos have been proven to own considerable feature redundancy where in\nmany cases only a portion of frames can already meet the requirements for\naccurate recognition. In this paper, we are interested in whether such\nredundancy can be effectively leveraged to facilitate efficient inference in\ncontinuous sign language recognition (CSLR). We propose a novel adaptive model\n(AdaBrowse) to dynamically select a most informative subsequence from input\nvideo sequences by modelling this problem as a sequential decision task. In\nspecific, we first utilize a lightweight network to quickly scan input videos\nto extract coarse features. Then these features are fed into a policy network\nto intelligently select a subsequence to process. The corresponding subsequence\nis finally inferred by a normal CSLR model for sentence prediction. As only a\nportion of frames are processed in this procedure, the total computations can\nbe considerably saved. Besides temporal redundancy, we are also interested in\nwhether the inherent spatial redundancy can be seamlessly integrated together\nto achieve further efficiency, i.e., dynamically selecting a lowest input\nresolution for each sample, whose model is referred to as AdaBrowse+. Extensive\nexperimental results on four large-scale CSLR datasets, i.e., PHOENIX14,\nPHOENIX14-T, CSL-Daily and CSL, demonstrate the effectiveness of AdaBrowse and\nAdaBrowse+ by achieving comparable accuracy with state-of-the-art methods with\n1.44$\\times$ throughput and 2.12$\\times$ fewer FLOPs. Comparisons with other\ncommonly-used 2D CNNs and adaptive efficient methods verify the effectiveness\nof AdaBrowse. Code is available at\n\\url{https://github.com/hulianyuyy/AdaBrowse}.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:40:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Lianyu",""],["Gao","Liqing",""],["Liu","Zekang",""],["Pun","Chi-Man",""],["Feng","Wei",""]]}
{"id":"2308.08328","submitter":"Zi-Yang Yuan","authors":"Ziyang Yuan and Haoxing Yang and Ningyi Leng and Hongxia Wang","title":"Phase Retrieval with Background Information: Decreased References and\n  Efficient Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fourier phase retrieval(PR) is a severely ill-posed inverse problem that\narises in various applications. To guarantee a unique solution and relieve the\ndependence on the initialization, background information can be exploited as a\nstructural priors. However, the requirement for the background information may\nbe challenging when moving to the high-resolution imaging. At the same time,\nthe previously proposed projected gradient descent(PGD) method also demands\nmuch background information.\n  In this paper, we present an improved theoretical result about the demand for\nthe background information, along with two Douglas Rachford(DR) based methods.\nAnalytically, we demonstrate that the background required to ensure a unique\nsolution can be decreased by nearly $1/2$ for the 2-D signals compared to the\n1-D signals. By generalizing the results into $d$-dimension, we show that the\nlength of the background information more than $(2^{\\frac{d+1}{d}}-1)$ folds of\nthe signal is sufficient to ensure the uniqueness. At the same time, we also\nanalyze the stability and robustness of the model when measurements and\nbackground information are corrupted by the noise. Furthermore, two methods\ncalled Background Douglas-Rachford (BDR) and Convex Background Douglas-Rachford\n(CBDR) are proposed. BDR which is a kind of non-convex method is proven to have\nthe local R-linear convergence rate under mild assumptions. Instead, CBDR\nmethod uses the techniques of convexification and can be proven to own a global\nconvergence guarantee as long as the background information is sufficient. To\nsupport this, a new property called F-RIP is established. We test the\nperformance of the proposed methods through simulations as well as real\nexperimental measurements, and demonstrate that they achieve a higher recovery\nrate with less background information compared to the PGD method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:42:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yuan","Ziyang",""],["Yang","Haoxing",""],["Leng","Ningyi",""],["Wang","Hongxia",""]]}
{"id":"2308.08329","submitter":"Gloria Clausen","authors":"Gloria Clausen, Simon Scheidegger, Josef A. Agner, Hansj\\\"urg Schmutz\n  and Fr\\'ed\\'eric Merkt","title":"Imaging-assisted single-photon Doppler-free laser spectroscopy and the\n  ionization energy of metastable triplet helium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Skimmed supersonic beams provide intense, cold, collision-free samples of\natoms and molecules are one of the most widely used tools in atomic and\nmolecular laser spectroscopy. High-resolution optical spectra are typically\nrecorded in a perpendicular arrangement of laser and supersonic beams to\nminimize Doppler broadening. Typical Doppler widths are nevertheless limited to\ntens of MHz by the residual transverse-velocity distribution in the\ngas-expansion cones. We present an imaging method to overcome this limitation\nwhich exploits the correlation between the positions of the atoms and molecules\nin the supersonic expansion and their transverse velocities - and thus their\nDoppler shifts. With the example of spectra of\n$(1\\mathrm{s})(n\\mathrm{p})\\,^3\\mathrm{P}_{0-2}\\leftarrow\n(1\\mathrm{s})(2\\mathrm{s})\\,^3\\mathrm{S}_1$ transitions to high Rydberg states\nof metastable triplet He, we demonstrate the suppression of the residual\nDoppler broadening and a reduction of the full linewidths at half maximum to\nonly about 1 MHz in the UV. Using a retro-reflection arrangement for the laser\nbeam and a cross-correlation method, we determine Doppler-free spectra without\nany signal loss from the selection, by imaging, of atoms within ultranarrow\ntransverse-velocity classes. As an illustration, we determine the ionization\nenergy of triplet metastable He and confirm the significant discrepancy between\nrecent experimental (Clausen et al., Phys. Rev. Lett. 127 093001 (2021)) and\nhigh-level theoretical (Patk\\'os et al., Phys. Rev. A 103 042809 (2021)) values\nof this quantity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:44:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Clausen","Gloria",""],["Scheidegger","Simon",""],["Agner","Josef A.",""],["Schmutz","Hansj\u00fcrg",""],["Merkt","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.08330","submitter":"Saeid K. Dehkordi","authors":"Fernando Pedraza, Saeid K. Dehkordi, Jan C. Hauffen, Shuangyang Li,\n  Peter Jung, Giuseppe Caire","title":"Extended Target Parameter Estimation and Tracking with an HDA Setup for\n  ISAC Applications","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We investigate radar parameter estimation and beam tracking with a hybrid\ndigital-analog (HDA) architecture in a multi-block measurement framework using\nan extended target model. In the considered setup, the backscattered data\nsignal is utilized to predict the user position in the next time slots.\nSpecifically, a simplified maximum likelihood framework is adopted for\nparameter estimation, based on which a simple tracking scheme is also\ndeveloped. Furthermore, the proposed framework supports adaptive transmitter\nbeamwidth selection, whose effects on the communication performance are also\nstudied. Finally, we verify the effectiveness of the proposed framework via\nnumerical simulations over complex motion patterns that emulate a realistic\nintegrated sensing and communication (ISAC) scenario.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:45:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pedraza","Fernando",""],["Dehkordi","Saeid K.",""],["Hauffen","Jan C.",""],["Li","Shuangyang",""],["Jung","Peter",""],["Caire","Giuseppe",""]]}
{"id":"2308.08331","submitter":"Xinwei Jin","authors":"Xin-Wei Jin, Zhan-Ying Yang, Zhimin Liao, Guangyin Jing, Wen-Li Yang","title":"Discovery and regulation of chiral magnetic solitons: Exact solution\n  from Landau-Lifshitz-Gilbert equation","comments":"main text:5 pages, 4 figures, supplementary materials:5 pages, 2\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Landau-Lifshitz-Gilbert (LLG) equation has emerged as a fundamental and\nindispensable framework within the realm of magnetism. However, solving the LLG\nequation, encompassing full nonlinearity amidst intricate complexities,\npresents formidable challenges. In this context, we develop a precise mapping\nthrough geometric representation, establishing a direct linkage between the LLG\nequation and an integrable generalized nonlinear Schr\\\"odinger equation. This\nnovel mapping provides accessibility towards acquiring a great number of exact\nspatiotemporal solutions. Notably, exact chiral magnetic solitons, critical for\nstability and controllability in propagation with and without damping effects\nare discovered. Our formulation provides exact solutions for the long-standing\nfully nonlinear problem, facilitating practical control through spin current\ninjection in magnetic memory applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:46:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jin","Xin-Wei",""],["Yang","Zhan-Ying",""],["Liao","Zhimin",""],["Jing","Guangyin",""],["Yang","Wen-Li",""]]}
{"id":"2308.08332","submitter":"Annibal Figueiredo","authors":"Annibal Figueiredo, Tarc{\\i}sio Marciano da Rocha Filho","title":"Mathematical Properties of Strategies to Control Epidemic Outbreaks in\n  the Context of SEIR Models with Multiple Infectious Stages","comments":"39 Pages, 10 Figures, 3 Tables, Preprint Article","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work we analyze mathematically the consequences and effectiveness of\nstrategies to control an epidemic in the framework of classical SEIR models\nwith multiple parallel infectious stages. We define the mathematical concept of\na control strategy, showing that it implies turning classic epidemiological\nmodels into systems of non-autonomous differential equations. The analysis of\nthese non-autonomous systems is based on the two main results obtained in this\nwork: the first establishes a condition that implies a dynamic without epidemic\noutbreaks; the second establishes a maximum value for the susceptible\npopulation associated to the fixed points that are attractors, moreover, we\nproof that any trajectory converges to some of these attractors. An important\nconsequence of this last result is the existence of an insurmountable limit on\nthe number of infected individuals after the end of a given control strategy.\nThis restriction can only be mitigated by changing the maximum value of\nsusceptible population associated to the system attractors, which could only be\ndone with permanent control action, that is, without returning to normality.\nAnother interesting result of our work is to show how the moment to start and\nthe way how the control strategy ends strongly impacts the asymptotic value for\nthe total number of infected individuals. We illustrate our analysis and\nresults in a SEIR model (with two or three parallel stages) applied to describe\nthe COVID-19 epidemic.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:46:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Figueiredo","Annibal",""],["Filho","Tarc\u0131sio Marciano da Rocha",""]]}
{"id":"2308.08333","submitter":"Jiawei Yao","authors":"Jiawei Yao, Tong Wu, Xiaofeng Zhang","title":"Improving Depth Gradient Continuity in Transformers: A Comparative Study\n  on Monocular Depth Estimation with CNN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Monocular depth estimation is an ongoing challenge in computer vision. Recent\nprogress with Transformer models has demonstrated notable advantages over\nconventional CNNs in this area. However, there's still a gap in understanding\nhow these models prioritize different regions in 2D images and how these\nregions affect depth estimation performance. To explore the differences between\nTransformers and CNNs, we employ a sparse pixel approach to contrastively\nanalyze the distinctions between the two. Our findings suggest that while\nTransformers excel in handling global context and intricate textures, they lag\nbehind CNNs in preserving depth gradient continuity. To further enhance the\nperformance of Transformer models in monocular depth estimation, we propose the\nDepth Gradient Refinement (DGR) module that refines depth estimation through\nhigh-order differentiation, feature fusion, and recalibration. Additionally, we\nleverage optimal transport theory, treating depth maps as spatial probability\ndistributions, and employ the optimal transport distance as a loss function to\noptimize our model. Experimental results demonstrate that models integrated\nwith the plug-and-play Depth Gradient Refinement (DGR) module and the proposed\nloss function enhance performance without increasing complexity and\ncomputational costs. This research not only offers fresh insights into the\ndistinctions between Transformers and CNNs in depth estimation but also paves\nthe way for novel depth estimation methodologies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:46:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yao","Jiawei",""],["Wu","Tong",""],["Zhang","Xiaofeng",""]]}
{"id":"2308.08334","submitter":"C\\'eline Hocquette","authors":"C\\'eline Hocquette, Sebastijan Duman\\v{c}i\\'c, Andrew Cropper","title":"Learning Logic Programs by Discovering Higher-Order Abstractions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.PL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Discovering novel abstractions is important for human-level AI. We introduce\nan approach to discover higher-order abstractions, such as map, filter, and\nfold. We focus on inductive logic programming, which induces logic programs\nfrom examples and background knowledge. We introduce the higher-order\nrefactoring problem, where the goal is to compress a logic program by\nintroducing higher-order abstractions. We implement our approach in STEVIE,\nwhich formulates the higher-order refactoring problem as a constraint\noptimisation problem. Our experimental results on multiple domains, including\nprogram synthesis and visual reasoning, show that, compared to no refactoring,\nSTEVIE can improve predictive accuracies by 27% and reduce learning times by\n47%. We also show that STEVIE can discover abstractions that transfer to\ndifferent domains\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:50:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hocquette","C\u00e9line",""],["Duman\u010di\u0107","Sebastijan",""],["Cropper","Andrew",""]]}
{"id":"2308.08335","submitter":"Patrick Koelewijn","authors":"Patrick J. W. Koelewijn, Siep Weiland, Roland T\\'oth","title":"Equilibrium-Independent Control of Continuous-Time Nonlinear Systems via\n  the LPV Framework -- Extended Version","comments":"Non-extended version submitted to IEEE Transactions on Automatic\n  Control","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 the analysis and control of continuous-time\nnonlinear systems to ensure universal shifted stability and performance, i.e.,\nstability and performance w.r.t. each forced equilibrium point of the system.\nThis \"equilibrium-free\" concept is especially beneficial for control problems\nthat require the tracking of setpoints and rejection of persistent\ndisturbances, such as input loads. In this paper, we show how the velocity\nform, i.e., the time-differentiated dynamics of the system, plays a crucial\nrole in characterizing these properties and how the analysis of it can be\nsolved by the application of Linear Parameter-Varying (LPV) methods in a\ncomputationally efficient manner. Furthermore, by leveraging the properties of\nthe velocity form and the LPV framework, a novel controller synthesis method is\npresented which ensures closed-loop universal shifted stability and\nperformance. The proposed controller design is verified in a simulation study\nand also experimentally on a real system. Additionally, we compare the proposed\nmethod to a standard LPV control design, demonstrating the improved stability\nand performance guarantees of the new approach.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:50:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Koelewijn","Patrick J. W.",""],["Weiland","Siep",""],["T\u00f3th","Roland",""]]}
{"id":"2308.08336","submitter":"Juan Jiang","authors":"Zhisheng Zhao, Tongrui Li, Peng Li, Xueliang Wu, Jianghao Yao, Ziyuan\n  Chen, Shengtao Cui, Zhe Sun, Yichen Yang, Zhicheng Jiang, Zhengtai Liu, Alex\n  Louat, Timur Kim, Cephise Cacho, Aifeng Wang, Yilin Wang, Dawei Shen, Juan\n  Jiang, Donglai Feng","title":"Photoemission Evidence of a Novel Charge Order in Kagome Metal FeGe","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A charge order has been discovered to emerge deep into the antiferromagnetic\nphase of the kagome metal FeGe. To study its origin, the evolution of the\nlow-lying electronic structure across the charge order phase transition is\ninvestigated with angle-resolved photoemission spectroscopy. We do not find\nsignatures of nesting between Fermi surface sections or van-Hove singularities\nin zero-frequency joint density of states, and there are no obvious energy gaps\nat the Fermi level, which exclude the nesting mechanism for the charge order\nformation in FeGe. However, two obvious changes in the band structure have been\ndetected, i.e., one electron-like band around the K point and another one\naround the A point move upward in energy position when the charge order forms.\nThese features can be well reproduced by our density-functional theory\ncalculations, where the charge order is primarily driven by magnetic energy\nsaving via large dimerizations of a quarter of Ge1-sites (in the kagome plane)\nalong the c-axis. Our results provide strong support for this novel charge\norder formation mechanism in FeGe, in contrast to the conventional nesting\nmechanism.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:51:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhao","Zhisheng",""],["Li","Tongrui",""],["Li","Peng",""],["Wu","Xueliang",""],["Yao","Jianghao",""],["Chen","Ziyuan",""],["Cui","Shengtao",""],["Sun","Zhe",""],["Yang","Yichen",""],["Jiang","Zhicheng",""],["Liu","Zhengtai",""],["Louat","Alex",""],["Kim","Timur",""],["Cacho","Cephise",""],["Wang","Aifeng",""],["Wang","Yilin",""],["Shen","Dawei",""],["Jiang","Juan",""],["Feng","Donglai",""]]}
{"id":"2308.08337","submitter":"Kristof Schmieden","authors":"Tim Schneemann, Kristof Schmieden, Matthias Schott","title":"First results of the SUPAX Experiment: Probing Dark Photons","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We show the first results of a new cavity based haloscope searching for dark\nphotons with masses around $34~\\mu\\text{eV}$. Dark photons are hypothetical\nvector particles and a compelling dark matter candidate. Having the same\nquantum numbers as photons a kinematic mixing between both is expected, leading\nto conversions from dark photons to standard model photons, where the photon\nfrequency depends on the dark photon mass. For wavelengths in the microwave\nregime resonators are typically used to enhance the signal. A new experiment is\nsetup at the University of Mainz. In this paper we present the initial results\nfrom the new setup searching for dark photons utilising a 8.3 GHz copper cavity\nat LHe temperatures. Limits on the kinetic mixing parameter $\\chi < (6.20 \\pm\n3.15^\\text{(exp.)} \\pm 9.65^\\text{(SG)}) \\cdot 10^{-14}$ at 95\\% CL are set at\na single frequency as proof of concept. Finally the next steps of the\nexperiment and expected sensitivity are detailed.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:52:42 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Schneemann","Tim",""],["Schmieden","Kristof",""],["Schott","Matthias",""]]}
{"id":"2308.08338","submitter":"Gabdolla Akishev","authors":"Gabdolla Akishev","title":"On the exactness of the conditions of embedding theorems for spaces of\n  functions with mixed logarithmic smoothness","comments":"arXiv admin note: text overlap with arXiv:2308.06737","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The article considers the Lorentz space $L_{p,\\tau}(\\mathbb{T}^{m})$, $2\\pi$\nof periodic functions of many variables and $S_{p,\\tau,\\theta}^{0,\n\\overline{b}}\\mathbf{B}$, $S_{p, \\tau, \\theta}^{0, \\overline{b}}B$ -- spaces of\nfunctions with mixed logarithmic smoothness. The article establishes necessary\nand sufficient conditions for embedding the spaces $S_{p, \\tau, \\theta}^{0,\n\\overline{b}}\\mathbf{B}$ and $S_{p, \\tau, \\theta}^{ 0, \\overline{b}}B$ into\neach other.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:57:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Akishev","Gabdolla",""]]}
{"id":"2308.08339","submitter":"Alnur Alimanov","authors":"Alnur Alimanov, Md Baharul Islam","title":"Denoising Diffusion Probabilistic Model for Retinal Image Generation and\n  Segmentation","comments":"International Conference on Computational Photography 2023 (ICCP\n  2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Experts use retinal images and vessel trees to detect and diagnose various\neye, blood circulation, and brain-related diseases. However, manual\nsegmentation of retinal images is a time-consuming process that requires high\nexpertise and is difficult due to privacy issues. Many methods have been\nproposed to segment images, but the need for large retinal image datasets\nlimits the performance of these methods. Several methods synthesize deep\nlearning models based on Generative Adversarial Networks (GAN) to generate\nlimited sample varieties. This paper proposes a novel Denoising Diffusion\nProbabilistic Model (DDPM) that outperformed GANs in image synthesis. We\ndeveloped a Retinal Trees (ReTree) dataset consisting of retinal images,\ncorresponding vessel trees, and a segmentation network based on DDPM trained\nwith images from the ReTree dataset. In the first stage, we develop a two-stage\nDDPM that generates vessel trees from random numbers belonging to a standard\nnormal distribution. Later, the model is guided to generate fundus images from\ngiven vessel trees and random distribution. The proposed dataset has been\nevaluated quantitatively and qualitatively. Quantitative evaluation metrics\ninclude Frechet Inception Distance (FID) score, Jaccard similarity coefficient,\nCohen's kappa, Matthew's Correlation Coefficient (MCC), precision, recall,\nF1-score, and accuracy. We trained the vessel segmentation model with synthetic\ndata to validate our dataset's efficiency and tested it on authentic data. Our\ndeveloped dataset and source code is available at\nhttps://github.com/AAleka/retree.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:01:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Alimanov","Alnur",""],["Islam","Md Baharul",""]]}
{"id":"2308.08340","submitter":"Federica Maria Surace","authors":"Gianluca Lagnese, Federica Maria Surace, Sid Morampudi, Frank Wilczek","title":"Detecting a long lived false vacuum with quantum quenches","comments":"7+7 pages, 3+1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Distinguishing whether a system supports alternate low-energy (locally\nstable) states -- stable (true vacuum) versus metastable (false vacuum) -- by\ndirect observation can be difficult when the lifetime of the state is very long\nbut otherwise unknown. Here we demonstrate, in a tractable model system, that\nthere are physical phenomena on much shorter time scales that can diagnose the\ndifference. Specifically, we study the spectral density following a quench in\nthe tilted quantum Ising model, and show that the evolution of the spectral\ndensity is a powerful diagnostic. Small transition bubbles are more common than\nlarge ones, and we see characteristic differences in the size dependence of\nbubble lifetimes even well below the critical size for false vacuum decay. We\nexpect this sort of behavior to be generic in systems of this kind. We identify\na scaling limit that connects the discrete, simulatable model to continuum\nquantum field theory.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:02:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lagnese","Gianluca",""],["Surace","Federica Maria",""],["Morampudi","Sid",""],["Wilczek","Frank",""]]}
{"id":"2308.08341","submitter":"Nikolay Karpushkin","authors":"N. Karpushkin, D. Finogeev, F. Guber, D. Lyapin, A. Makhnev, S.\n  Morozov, D. Serebryakov","title":"Analytical description of the time-over-threshold method based on the\n  time properties of plastic scintillators equipped with silicon\n  photomultipliers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A new high-granular compact time-of-flight neutron detector for the\nidentification and energy measurement of neutrons produced in nucleus-nucleus\ninteractions at the BM@N experiment, Dubna, Russia, at energies up to 4 AGeV is\nunder development. The detector consists of approximately 2000 fast plastic\nscintillators, each with dimensions of 40$\\times$40$\\times$25 mm$^3$, equiped\nwith SiPM (Silicon Photomultiplier) with an active area of 6$\\times$6 mm$^2$.\nThe signal readout from these scintillators will employ a single-threshold\nmultichannel Time-to-Digital Converter (TDC) to measure their response time and\namplitude using the time-over-threshold (ToT) method. This article focuses on\nthe analytical description of the signals from the plastic scintillator\ndetectors equipped with silicon photomultipliers. This description is crucial\nfor establishing the ToT-amplitude relationship and implementing slewing\ncorrection techniques to improve the time resolution of the detector. The\nmethodology presented in this paper demonstrates that a time resolution at the\n70 ps level can be achieved for the fast plastic scintillator coupled with\nsilicon photomultiplier with epitaxial quenching resistors.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:03:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Karpushkin","N.",""],["Finogeev","D.",""],["Guber","F.",""],["Lyapin","D.",""],["Makhnev","A.",""],["Morozov","S.",""],["Serebryakov","D.",""]]}
{"id":"2308.08342","submitter":"Harold Erbin","authors":"Corinne de Lacroix, Harold Erbin, Vincent Lahoche","title":"Gravitational action for a massive Majorana fermion in 2d quantum\n  gravity","comments":"40 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the gravitational action of a free massive Majorana fermion\ncoupled to two-dimensional gravity on compact Riemann surfaces of arbitrary\ngenus. The structure is similar to the case of the massive scalar. The\nsmall-mass expansion of the gravitational yields the Liouville action at zeroth\norder, and we can identify the Mabuchi action at first order. While the massive\nMajorana action is a conformal deformation of the massless Majorana CFT, we\nfind an action different from the one given by the David-Distler-Kawai (DDK)\nansatz.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:07:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["de Lacroix","Corinne",""],["Erbin","Harold",""],["Lahoche","Vincent",""]]}
{"id":"2308.08343","submitter":"Jordan Awan","authors":"Jordan Awan and Aishwarya Ramasethu","title":"Optimizing Noise for $f$-Differential Privacy via Anti-Concentration and\n  Stochastic Dominance","comments":"17 pages before appendix, 25 pages total, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR math.PR math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we establish anti-concentration inequalities for additive\nnoise mechanisms which achieve $f$-differential privacy ($f$-DP), a notion of\nprivacy phrased in terms of a tradeoff function (a.k.a. ROC curve) $f$ which\nlimits the ability of an adversary to determine which individuals were in the\ndatabase. We show that canonical noise distributions (CNDs), proposed by Awan\nand Vadhan (2023), match the anti-concentration bounds at half-integer values,\nindicating that their tail behavior is near-optimal. We also show that all CNDs\nare sub-exponential, regardless of the $f$-DP guarantee. In the case of\nlog-concave CNDs, we show that they are the stochastically smallest noise\ncompared to any other noise distributions with the same privacy guarantee. In\nterms of integer-valued noise, we propose a new notion of discrete CND and\nprove that a discrete CND always exists, can be constructed by rounding a\ncontinuous CND, and that the discrete CND is unique when designed for a\nstatistic with sensitivity 1. We further show that the discrete CND at\nsensitivity 1 is stochastically smallest compared to other integer-valued\nnoises. Our theoretical results shed light on the different types of privacy\nguarantees possible in the $f$-DP framework and can be incorporated in more\ncomplex mechanisms to optimize performance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:09:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Awan","Jordan",""],["Ramasethu","Aishwarya",""]]}
{"id":"2308.08344","submitter":"Bin Lu","authors":"Bin Lu, Xiaoying Gan, Ze Zhao, Shiyu Liang, Luoyi Fu, Xinbing Wang,\n  Chenghu Zhou","title":"Graph Out-of-Distribution Generalization with Controllable Data\n  Augmentation","comments":"Under review","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 Neural Network (GNN) has demonstrated extraordinary performance in\nclassifying graph properties. However, due to the selection bias of training\nand testing data (e.g., training on small graphs and testing on large graphs,\nor training on dense graphs and testing on sparse graphs), distribution\ndeviation is widespread. More importantly, we often observe \\emph{hybrid\nstructure distribution shift} of both scale and density, despite of one-sided\nbiased data partition. The spurious correlations over hybrid distribution\ndeviation degrade the performance of previous GNN methods and show large\ninstability among different datasets. To alleviate this problem, we propose\n\\texttt{OOD-GMixup} to jointly manipulate the training distribution with\n\\emph{controllable data augmentation} in metric space. Specifically, we first\nextract the graph rationales to eliminate the spurious correlations due to\nirrelevant information. Secondly, we generate virtual samples with perturbation\non graph rationale representation domain to obtain potential OOD training\nsamples. Finally, we propose OOD calibration to measure the distribution\ndeviation of virtual samples by leveraging Extreme Value Theory, and further\nactively control the training distribution by emphasizing the impact of virtual\nOOD samples. Extensive studies on several real-world datasets on graph\nclassification demonstrate the superiority of our proposed method over\nstate-of-the-art baselines.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:10:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lu","Bin",""],["Gan","Xiaoying",""],["Zhao","Ze",""],["Liang","Shiyu",""],["Fu","Luoyi",""],["Wang","Xinbing",""],["Zhou","Chenghu",""]]}
{"id":"2308.08345","submitter":"Ruiqiang Xiao","authors":"Ruiqiang Xiao, Zhuoyue Wan","title":"GAEI-UNet: Global Attention and Elastic Interaction U-Net for Vessel\n  Image Segmentation","comments":"arXiv admin note: text overlap with arXiv:2004.03696 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vessel image segmentation plays a pivotal role in medical diagnostics, aiding\nin the early detection and treatment of vascular diseases. While segmentation\nbased on deep learning has shown promising results, effectively segmenting\nsmall structures and maintaining connectivity between them remains challenging.\nTo address these limitations, we propose GAEI-UNet, a novel model that combines\nglobal attention and elastic interaction-based techniques. GAEI-UNet leverages\nglobal spatial and channel context information to enhance high-level semantic\nunderstanding within the U-Net architecture, enabling precise segmentation of\nsmall vessels. Additionally, we adopt an elastic interaction-based loss\nfunction to improve connectivity among these fine structures. By capturing the\nforces generated by misalignment between target and predicted shapes, our model\neffectively learns to preserve the correct topology of vessel networks.\nEvaluation on retinal vessel dataset -- DRIVE demonstrates the superior\nperformance of GAEI-UNet in terms of SE and connectivity of small structures,\nwithout significantly increasing computational complexity. This research aims\nto advance the field of vessel image segmentation, providing more accurate and\nreliable diagnostic tools for the medical community. The implementation code is\navailable on Code.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:10:32 GMT"},{"version":"v2","created":"Sun, 20 Aug 2023 03:42:37 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 01:10:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xiao","Ruiqiang",""],["Wan","Zhuoyue",""]]}
{"id":"2308.08346","submitter":"Merle Munko","authors":"Merle Munko, Marc Ditzhaus, Dennis Dobler and Jon Genuneit","title":"RMST-based multiple contrast tests in general factorial designs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Several methods in survival analysis are based on the proportional hazards\nassumption. However, this assumption is very restrictive and often not\njustifiable in practice. Therefore, effect estimands that do not rely on the\nproportional hazards assumption are highly desirable in practical applications.\nOne popular example for this is the restricted mean survival time (RMST). It is\ndefined as the area under the survival curve up to a prespecified time point\nand, thus, summarizes the survival curve into a meaningful estimand. For\ntwo-sample comparisons based on the RMST, previous research found the inflation\nof the type I error of the asymptotic test for small samples and, therefore, a\ntwo-sample permutation test has already been developed. The first goal of the\npresent paper is to further extend the permutation test for general factorial\ndesigns and general contrast hypotheses by considering a Wald-type test\nstatistic and its asymptotic behavior. Additionally, a groupwise bootstrap\napproach is considered. Moreover, when a global test detects a significant\ndifference by comparing the RMSTs of more than two groups, it is of interest\nwhich specific RMST differences cause the result. However, global tests do not\nprovide this information. Therefore, multiple tests for the RMST are developed\nin a second step to infer several null hypotheses simultaneously. Hereby, the\nasymptotically exact dependence structure between the local test statistics is\nincorporated to gain more power. Finally, the small sample performance of the\nproposed global and multiple testing procedures is analyzed in simulations and\nillustrated in a real data example.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:11:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Munko","Merle",""],["Ditzhaus","Marc",""],["Dobler","Dennis",""],["Genuneit","Jon",""]]}
{"id":"2308.08347","submitter":"Daniel Hillerstr\\\"om","authors":"Luna Phipps-Costin, Andreas Rossberg, Arjun Guha, Daan Leijen, Daniel\n  Hillerstr\\\"om, KC Sivaramakrishnan, Matija Pretnar, Sam Lindley","title":"Continuing WebAssembly with Effect Handlers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  WebAssembly (Wasm) is a low-level portable code format offering near native\nperformance. It is intended as a compilation target for a wide variety of\nsource languages. However, Wasm provides no direct support for non-local\ncontrol flow features such as async/await, generators/iterators, lightweight\nthreads, first-class continuations, etc. This means that compilers for source\nlanguages with such features must ceremoniously transform whole source programs\nin order to target Wasm. We present WasmFX, an extension to Wasm which provides\na universal target for non-local control features via effect handlers, enabling\ncompilers to translate such features directly into Wasm. Our extension is\nminimal and only adds three main instructions for creating, suspending, and\nresuming continuations. Moreover, our primitive instructions are type-safe\nproviding typed continuations which are well-aligned with the design principles\nof Wasm whose stacks are typed. We present a formal specification of WasmFX and\nshow that the extension is sound. We have implemented WasmFX as an extension to\nthe Wasm reference interpreter and also built a prototype WasmFX extension for\nWasmtime, a production-grade Wasm engine, piggybacking on Wasmtime's existing\nfibers API. The preliminary performance results for our prototype are\nencouraging, and we outline future plans to realise a native implementation\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:15:33 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 13:45:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Phipps-Costin","Luna",""],["Rossberg","Andreas",""],["Guha","Arjun",""],["Leijen","Daan",""],["Hillerstr\u00f6m","Daniel",""],["Sivaramakrishnan","KC",""],["Pretnar","Matija",""],["Lindley","Sam",""]]}
{"id":"2308.08348","submitter":"Dmitry Yudin","authors":"Egor E. Nuzhin, Dmitry Yudin","title":"Quantum-enhanced policy iteration on the example of a mountain car","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advances in the experimental demonstration of quantum processors have\nprovoked a surge of interest to the idea of practical implementation of quantum\ncomputing over last years. It is expected that the use of quantum algorithms\nwill significantly speed up the solution to certain problems in numerical\noptimization and machine learning. In this paper, we propose a quantum-enhanced\npolicy iteration (QEPI) algorithm as widely used in the domain of reinforcement\nlearning and validate it with the focus on the mountain car problem. In\npractice, we elaborate on the soft version of the value iteration algorithm,\nwhich is beneficial for policy interpretation, and discuss the stochastic\ndiscretization technique in the context of continuous state reinforcement\nlearning problems for the purposes of QEPI. The complexity of the algorithm is\nanalyzed for dense and (typical) sparse cases. Numerical results on the example\nof a mountain car with the use of a quantum emulator verify the developed\nprocedures and benchmark the QEPI performance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:16:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nuzhin","Egor E.",""],["Yudin","Dmitry",""]]}
{"id":"2308.08349","submitter":"Liulin Liu","authors":"Liulin Liu, Xiaoling Zhang and Lili Zhao","title":"Kropina metrics with isotropic scalar 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 this paper, we study Kropina metrics with isotropic scalar curvature.\nFirst, we obtain the expressions of Ricci curvature tensor and scalar\ncurvature. Then, we characterize the Kropina metrics with isotropic scalar\ncurvature on by tensor analysis.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:17:06 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Liulin",""],["Zhang","Xiaoling",""],["Zhao","Lili",""]]}
{"id":"2308.08350","submitter":"Hagos Gebrehiwet Gebregergs","authors":"Hagos Gebrehiwet Gebregergs and Jacob Gelius Leiv","title":"Compensation of Absorption Effects in Seismic Data","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 frequency content of seismic data is changing with propagation depth due\nto intrinsic absorption. This implies that the higher frequencies are highly\nattenuated, thus leading to a loss in resolution of the seismic image. In\naddition, absorption anomalies, for example, caused by gas sands, will further\ndim the seismic reconstruction. It is possible to correct for such absorption\neffects by employing so called inverse Q filtering (IQF). This is a filtering\ntechnique that tries to restore the loss of the higher frequencies due to\npropagation. Newer developments within IQF can be regarded as a migration type\nof algorithm, and such classes of techniques are studied in this paper. As\nseismic waves travel through the earth, the visco-elasticity of the earth's\nmedium will cause energy dissipation and waveform distortion. This phenomenon\nis referred to as seismic absorption. In explaining the propagation of seismic\nwave in a given medium we explore the relationship between the pressure and\ndisplacement stresses. Therefore, by introducing an absorption function into\nthe stress and strain relationship we derived a non-linear wave equation. We,\nthen, employed a layered earth model to solve the non-linear wave equation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:19:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gebregergs","Hagos Gebrehiwet",""],["Leiv","Jacob Gelius",""]]}
{"id":"2308.08351","submitter":"Natasha Lavis Miss","authors":"Natasha Lavis, Michael Sarkis, Geoff Beck, Kenda Knowles","title":"A radio-frequency WIMP search with the MeerKAT Galaxy Cluster Legacy\n  Survey","comments":"20 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Radio-frequency, indirect dark matter searches have recently been gaining\nprevalence, due to the high sensitivity and resolution capabilities of the new\ngeneration of radio interferometers. MeerKAT is currently one of the most\nsensitive instruments of its kind, making it ideal for indirect dark matter\nsearches. By making use of publicly available data from the MeerKAT Galaxy\nCluster Legacy Survey we are able to use both the observed diffuse synchrotron\nemission and non-detections to constrain the WIMP dark matter parameter space.\nIn addition to a subset of generic WIMP annihilation channels, we probe the\ndark matter candidate within the 2HDM+S particle physics model, which was\ndeveloped as an explanation for anomalies observed in the Large Hadron Collider\ndata from runs 1 and 2. By undertaking a statistical analysis of the radio flux\ndensities within galaxy clusters we are able to exclude the thermal relic value\nfor WIMP masses $< \\, \\sim 800 $ GeV for annihilation into bottom quarks. This\nis competitive with the best constraints in the current literature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:20:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lavis","Natasha",""],["Sarkis","Michael",""],["Beck","Geoff",""],["Knowles","Kenda",""]]}
{"id":"2308.08352","submitter":"Zeev Rudnick","authors":"Ze\\'ev Rudnick","title":"Zeros of modular forms and Faber polynomials","comments":"12 pages, one figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the zeros of cusp forms of large weight for the modular group, which\nhave a very large order of vanishing at infinity, so that they have a fixed\nnumber D of finite zeros in the fundamental domain. We show that for large\nweight the zeros of these forms cluster near D vertical lines, with the zeros\nof a weight k form lying at height approximately log(k). This is in contrast to\npreviously known cases, such as Eisenstein series, where the zeros lie on the\ncircular part of the boundary of the fundamental domain, or the case of\ncuspidal Hecke eigenforms where the zeros are uniformly distributed in the\nfundamental domain.\n  Our method uses the Faber polynomials. We show that for our class of cusp\nforms, the associated Faber polynomials, suitably renormalized, converge to the\ntruncated exponential polynomial of degree D.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:23:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Rudnick","Ze\u00e9v",""]]}
{"id":"2308.08353","submitter":"Harsh Patil","authors":"Harsh Patil","title":"Finiteness properties and Relatively Hyperbolic Groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that properties $F_n$ and $FP_n$ hold for a relatively hyperbolic\ngroup if and only if they hold for all the peripheral subgroups. As an\napplication we show that there are at least countably many distinct\nquasi-isometry classes of one-ended groups that are type $F_n$ but not\n$F_{n+1}$ and similarly of type $FP_n$ and not $FP_{n+1}$ for all positive\nintegers $n$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:23:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Patil","Harsh",""]]}
{"id":"2308.08354","submitter":"Davide Buffelli","authors":"Davide Buffelli, Ashish Gupta, Agnieszka Strzalka, Vassilis Plachouras","title":"Is Meta-Learning the Right Approach for the Cold-Start Problem in\n  Recommender Systems?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems have become fundamental building blocks of modern online\nproducts and services, and have a substantial impact on user experience. In the\npast few years, deep learning methods have attracted a lot of research, and are\nnow heavily used in modern real-world recommender systems. Nevertheless,\ndealing with recommendations in the cold-start setting, e.g., when a user has\ndone limited interactions in the system, is a problem that remains far from\nsolved. Meta-learning techniques, and in particular optimization-based\nmeta-learning, have recently become the most popular approaches in the academic\nresearch literature for tackling the cold-start problem in deep learning models\nfor recommender systems. However, current meta-learning approaches are not\npractical for real-world recommender systems, which have billions of users and\nitems, and strict latency requirements. In this paper we show that it is\npossible to obtaining similar, or higher, performance on commonly used\nbenchmarks for the cold-start problem without using meta-learning techniques.\nIn more detail, we show that, when tuned correctly, standard and widely adopted\ndeep learning models perform just as well as newer meta-learning models. We\nfurther show that an extremely simple modular approach using common\nrepresentation learning techniques, can perform comparably to meta-learning\ntechniques specifically designed for the cold-start setting while being much\nmore easily deployable in real-world applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:24:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Buffelli","Davide",""],["Gupta","Ashish",""],["Strzalka","Agnieszka",""],["Plachouras","Vassilis",""]]}
{"id":"2308.08355","submitter":"Nicolas Ubrig","authors":"Fengrui Yao, Volodymyr Multian, Zhe Wang, Nicolas Ubrig, J\\'er\\'emie\n  Teyssier, Fan Wu, Enrico Giannini, Marco Gibertini, Ignacio\n  Guti\\'errez-Lezama and Alberto F. Morpurgo","title":"Multiple antiferromagnetic phases and magnetic anisotropy in exfoliated\n  CrBr$_3$ multilayers","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":"  In twisted two-dimensional (2D) magnets, the stacking dependence of the\nmagnetic exchange interaction can lead to regions of ferromagnetic and\nantiferromagnetic interlayer order, separated by non-collinear, skyrmion-like\nspin textures. Recent experimental searches for these textures have focused on\nCrI$_3$, known to exhibit either ferromagnetic or antiferromagnetic interlayer\norder, depending on layer stacking. However, the very strong uniaxial\nanisotropy of CrI$_3$ disfavors smooth non-collinear phases in twisted\nbilayers. Here, we report the experimental observation of three distinct\nmagnetic phases -- one ferromagnetic and two antiferromagnetic -- in exfoliated\nCrBr$_3$ multilayers, and reveal that the uniaxial anisotropy is significantly\nsmaller than in CrI$_3$. These results are obtained by magnetoconductance\nmeasurements on CrBr$_3$ tunnel barriers and Raman spectroscopy, in conjunction\nwith density functional theory calculations, which enable us to identify the\nstackings responsible for the different interlayer magnetic couplings. The\ndetection of all locally stable magnetic states predicted to exist in CrBr$_3$\nand the excellent agreement found between theory and experiments, provide\ncomplete information on the stacking-dependent interlayer exchange energy and\nestablish twisted bilayer CrBr$_3$ as an ideal system to deterministically\ncreate non-collinear magnetic phases.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:27:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yao","Fengrui",""],["Multian","Volodymyr",""],["Wang","Zhe",""],["Ubrig","Nicolas",""],["Teyssier","J\u00e9r\u00e9mie",""],["Wu","Fan",""],["Giannini","Enrico",""],["Gibertini","Marco",""],["Guti\u00e9rrez-Lezama","Ignacio",""],["Morpurgo","Alberto F.",""]]}
{"id":"2308.08356","submitter":"Luca Deri","authors":"Luca Deri and Francesco Fusco","title":"Evaluating IP Blacklists Effectiveness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IP blacklists are widely used to increase network security by preventing\ncommunications with peers that have been marked as malicious. There are several\ncommercial offerings as well as several free-of-charge blacklists maintained by\nvolunteers on the web. Despite their wide adoption, the effectiveness of the\ndifferent IP blacklists in real-world scenarios is still not clear. In this\npaper, we conduct a large-scale network monitoring study which provides\ninsightful findings regarding the effectiveness of blacklists. The results\ncollected over several hundred thousand IP hosts belonging to three distinct\nlarge production networks highlight that blacklists are often tuned for\nprecision, with the result that many malicious activities, such as scanning,\nare completely undetected. The proposed instrumentation approach to detect IP\nscanning and suspicious activities is implemented with home-grown and\nopen-source software. Our tools enable the creation of blacklists without the\nsecurity risks posed by the deployment of honeypots.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:29:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Deri","Luca",""],["Fusco","Francesco",""]]}
{"id":"2308.08357","submitter":"Dieter Ries","authors":"Julian Auler, Dieter Ries, Bernd Ulmann, Evan Adamek, Martin Engler,\n  Martin Fertl, Konrad Franz, Werner Heil, Simon Kaufmann, Niklas Pfeifer, Kim\n  Ro{\\ss}, Alexandra Tsvetkov, Noah Yazdandoost","title":"A neutron trigger detector for pulsed neutron sources","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A variety of experiments investigating properties of neutrons can be\nperformed at pulsed source facilities like the research reactor TRIGA Mainz. A\ntypical problem faced by these experiments is the non-availibility of a\nreliable facility-provided trigger signal in coincidence with the neutron\nproduction. Here we present the design and implementation of a neutron pulse\ndetector that provides a coincident trigger signal for experimental timing with\na relative precision of 4.5 ms.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:29:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Auler","Julian",""],["Ries","Dieter",""],["Ulmann","Bernd",""],["Adamek","Evan",""],["Engler","Martin",""],["Fertl","Martin",""],["Franz","Konrad",""],["Heil","Werner",""],["Kaufmann","Simon",""],["Pfeifer","Niklas",""],["Ro\u00df","Kim",""],["Tsvetkov","Alexandra",""],["Yazdandoost","Noah",""]]}
{"id":"2308.08358","submitter":"Yichuan Deng","authors":"Yichuan Deng, Zhao Song, Shenghao Xie","title":"Convergence of Two-Layer Regression with Nonlinear Units","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large language models (LLMs), such as ChatGPT and GPT4, have shown\noutstanding performance in many human life task. Attention computation plays an\nimportant role in training LLMs. Softmax unit and ReLU unit are the key\nstructure in attention computation. Inspired by them, we put forward a softmax\nReLU regression problem. Generally speaking, our goal is to find an optimal\nsolution to the regression problem involving the ReLU unit. In this work, we\ncalculate a close form representation for the Hessian of the loss function.\nUnder certain assumptions, we prove the Lipschitz continuous and the PSDness of\nthe Hessian. Then, we introduce an greedy algorithm based on approximate Newton\nmethod, which converges in the sense of the distance to optimal solution. Last,\nWe relax the Lipschitz condition and prove the convergence in the sense of loss\nvalue.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:30:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Deng","Yichuan",""],["Song","Zhao",""],["Xie","Shenghao",""]]}
{"id":"2308.08359","submitter":"Yufei Guo","authors":"Yufei Guo, Yuhan Zhang, Yuanpei Chen, Weihang Peng, Xiaode Liu, Liwen\n  Zhang, Xuhui Huang, Zhe Ma","title":"Membrane Potential Batch Normalization for Spiking Neural Networks","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As one of the energy-efficient alternatives of conventional neural networks\n(CNNs), spiking neural networks (SNNs) have gained more and more interest\nrecently. To train the deep models, some effective batch normalization (BN)\ntechniques are proposed in SNNs. All these BNs are suggested to be used after\nthe convolution layer as usually doing in CNNs. However, the spiking neuron is\nmuch more complex with the spatio-temporal dynamics. The regulated data flow\nafter the BN layer will be disturbed again by the membrane potential updating\noperation before the firing function, i.e., the nonlinear activation.\nTherefore, we advocate adding another BN layer before the firing function to\nnormalize the membrane potential again, called MPBN. To eliminate the induced\ntime cost of MPBN, we also propose a training-inference-decoupled\nre-parameterization technique to fold the trained MPBN into the firing\nthreshold. With the re-parameterization technique, the MPBN will not introduce\nany extra time burden in the inference. Furthermore, the MPBN can also adopt\nthe element-wised form, while these BNs after the convolution layer can only\nuse the channel-wised form. Experimental results show that the proposed MPBN\nperforms well on both popular non-spiking static and neuromorphic datasets. Our\ncode is open-sourced at \\href{https://github.com/yfguo91/MPBN}{MPBN}.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:32:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guo","Yufei",""],["Zhang","Yuhan",""],["Chen","Yuanpei",""],["Peng","Weihang",""],["Liu","Xiaode",""],["Zhang","Liwen",""],["Huang","Xuhui",""],["Ma","Zhe",""]]}
{"id":"2308.08360","submitter":"Qi Hu","authors":"Qi Hu, Yangqiu Song","title":"Independent Distribution Regularization for Private Graph Embedding","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3614933","report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning graph embeddings is a crucial task in graph mining tasks. An\neffective graph embedding model can learn low-dimensional representations from\ngraph-structured data for data publishing benefiting various downstream\napplications such as node classification, link prediction, etc. However, recent\nstudies have revealed that graph embeddings are susceptible to attribute\ninference attacks, which allow attackers to infer private node attributes from\nthe learned graph embeddings. To address these concerns, privacy-preserving\ngraph embedding methods have emerged, aiming to simultaneously consider primary\nlearning and privacy protection through adversarial learning. However, most\nexisting methods assume that representation models have access to all sensitive\nattributes in advance during the training stage, which is not always the case\ndue to diverse privacy preferences. Furthermore, the commonly used adversarial\nlearning technique in privacy-preserving representation learning suffers from\nunstable training issues. In this paper, we propose a novel approach called\nPrivate Variational Graph AutoEncoders (PVGAE) with the aid of independent\ndistribution penalty as a regularization term. Specifically, we split the\noriginal variational graph autoencoder (VGAE) to learn sensitive and\nnon-sensitive latent representations using two sets of encoders. Additionally,\nwe introduce a novel regularization to enforce the independence of the\nencoders. We prove the theoretical effectiveness of regularization from the\nperspective of mutual information. Experimental results on three real-world\ndatasets demonstrate that PVGAE outperforms other baselines in private\nembedding learning regarding utility performance and privacy protection.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:32:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hu","Qi",""],["Song","Yangqiu",""]]}
{"id":"2308.08361","submitter":"Anbang Yao","authors":"Chao Li, Anbang Yao","title":"KernelWarehouse: Towards Parameter-Efficient Dynamic Convolution","comments":"This research work was completed and submitted in early May 2023.\n  Code and pre-trained models are available at\n  https://github.com/OSVAI/KernelWarehouse","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic convolution learns a linear mixture of $n$ static kernels weighted\nwith their sample-dependent attentions, demonstrating superior performance\ncompared to normal convolution. However, existing designs are\nparameter-inefficient: they increase the number of convolutional parameters by\n$n$ times. This and the optimization difficulty lead to no research progress in\ndynamic convolution that can allow us to use a significant large value of $n$\n(e.g., $n>100$ instead of typical setting $n<10$) to push forward the\nperformance boundary. In this paper, we propose $KernelWarehouse$, a more\ngeneral form of dynamic convolution, which can strike a favorable trade-off\nbetween parameter efficiency and representation power. Its key idea is to\nredefine the basic concepts of \"$kernels$\" and \"$assembling$ $kernels$\" in\ndynamic convolution from the perspective of reducing kernel dimension and\nincreasing kernel number significantly. In principle, KernelWarehouse enhances\nconvolutional parameter dependencies within the same layer and across\nsuccessive layers via tactful kernel partition and warehouse sharing, yielding\na high degree of freedom to fit a desired parameter budget. We validate our\nmethod on ImageNet and MS-COCO datasets with different ConvNet architectures,\nand show that it attains state-of-the-art results. For instance, the\nResNet18|ResNet50|MobileNetV2|ConvNeXt-Tiny model trained with KernelWarehouse\non ImageNet reaches 76.05%|81.05%|75.52%|82.51% top-1 accuracy. Thanks to its\nflexible design, KernelWarehouse can even reduce the model size of a ConvNet\nwhile improving the accuracy, e.g., our ResNet18 model with 36.45%|65.10%\nparameter reduction to the baseline shows 2.89%|2.29% absolute improvement to\ntop-1 accuracy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:35:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Chao",""],["Yao","Anbang",""]]}
{"id":"2308.08362","submitter":"Lee Braine","authors":"Lee Braine, Shreepad Shukla and Piyush Agrawal","title":"Functional Consistency across Retail Central Bank Digital Currency and\n  Commercial Bank Money","comments":"24 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Central banks are actively exploring central bank digital currencies (CBDCs)\nby conducting research, proofs of concept and pilots. However, adoption of a\nretail CBDC can risk fragmenting both payments markets and retail deposits if\nthe retail CBDC and commercial bank money do not have common operational\ncharacteristics. In this paper, we focus on a potential UK retail CBDC, the\n'digital pound', and the Bank of England's 'platform model'. We first explore\nhow the concept of functional consistency could mitigate the risk of\nfragmentation. We next identify the common operational characteristics that are\nrequired to achieve functional consistency across all forms of regulated retail\ndigital money. We identify four design options based on the provision of these\ncommon operational characteristics by the central bank, payment interface\nproviders (PIPs), technical service providers (TSPs) or a financial market\ninfrastructure (FMI). We next identify architecturally-significant use cases\nand select key capabilities that support these use cases and the common\noperational characteristics. We evaluate the suitability of the design options\nto provide these key capabilities and draw insights. We conclude that no single\ndesign option could provide functional consistency across digital pounds and\ncommercial bank money and, instead, a complete solution would need to combine\nthe suitable design option(s) for each key capability and include common\necosystem services provided by an FMI and TSPs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:38:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Braine","Lee",""],["Shukla","Shreepad",""],["Agrawal","Piyush",""]]}
{"id":"2308.08363","submitter":"Aviv Slobodkin","authors":"Aviv Slobodkin, Niv Nachum, Shmuel Amar, Ori Shapira, Ido Dagan","title":"SummHelper: Collaborative Human-Computer Summarization","comments":"Demo paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current approaches for text summarization are predominantly automatic, with\nrather limited space for human intervention and control over the process. In\nthis paper, we introduce SummHelper, a 2-phase summarization assistant designed\nto foster human-machine collaboration. The initial phase involves content\nselection, where the system recommends potential content, allowing users to\naccept, modify, or introduce additional selections. The subsequent phase,\ncontent consolidation, involves SummHelper generating a coherent summary from\nthese selections, which users can then refine using visual mappings between the\nsummary and the source text. Small-scale user studies reveal the effectiveness\nof our application, with participants being especially appreciative of the\nbalance between automated guidance and opportunities for personal input.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:39:06 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Slobodkin","Aviv",""],["Nachum","Niv",""],["Amar","Shmuel",""],["Shapira","Ori",""],["Dagan","Ido",""]]}
{"id":"2308.08364","submitter":"Alexander McLain","authors":"Siyu Zheng, Alexander C. McLain, Joshua Habiger, Christopher Rorden\n  and Julius Fridriksson","title":"False Discovery Rate Control for Lesion-Symptom Mapping with\n  Heterogeneous data via Weighted P-values","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lesion-symptom mapping studies provide insight into what areas of the brain\nare involved in different aspects of cognition. This is commonly done via\nbehavioral testing in patients with a naturally occurring brain injury or\nlesions (e.g., strokes or brain tumors). This results in high-dimensional\nobservational data where lesion status (present/absent) is non-uniformly\ndistributed with some voxels having lesions in very few (or no) subjects. In\nthis situation, mass univariate hypothesis tests have severe power\nheterogeneity where many tests are known a priori to have little to no power.\nRecent advancements in multiple testing methodologies allow researchers to\nweigh hypotheses according to side-information (e.g., information on power\nheterogeneity). In this paper, we propose the use of p-value weighting for\nvoxel-based lesion-symptom mapping (VLSM) studies. The weights are created\nusing the distribution of lesion status and spatial information to estimate\ndifferent non-null prior probabilities for each hypothesis test through some\ncommon approaches. We provide a monotone minimum weight criterion which\nrequires minimum a priori power information. Our methods are demonstrated on\ndependent simulated data and an aphasia study investigating which regions of\nthe brain are associated with the severity of language impairment among stroke\nsurvivors. The results demonstrate that the proposed methods have robust error\ncontrol and can increase power. Further, we showcase how weights can be used to\nidentify regions that are inconclusive due to lack of power.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:39:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zheng","Siyu",""],["McLain","Alexander C.",""],["Habiger","Joshua",""],["Rorden","Christopher",""],["Fridriksson","Julius",""]]}
{"id":"2308.08365","submitter":"Florian Jug","authors":"Nuno Pimp\\~ao Martins, Yannis Kalaidzidis, Marino Zerial, Florian Jug","title":"DeepContrast: Deep Tissue Contrast Enhancement using Synthetic Data\n  Degradations and OOD Model Predictions","comments":"8 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV q-bio.TO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Microscopy images are crucial for life science research, allowing detailed\ninspection and characterization of cellular and tissue-level structures and\nfunctions. However, microscopy data are unavoidably affected by image\ndegradations, such as noise, blur, or others. Many such degradations also\ncontribute to a loss of image contrast, which becomes especially pronounced in\ndeeper regions of thick samples. Today, best performing methods to increase the\nquality of images are based on Deep Learning approaches, which typically\nrequire ground truth (GT) data during training. Our inability to counteract\nblurring and contrast loss when imaging deep into samples prevents the\nacquisition of such clean GT data. The fact that the forward process of\nblurring and contrast loss deep into tissue can be modeled, allowed us to\npropose a new method that can circumvent the problem of unobtainable GT data.\nTo this end, we first synthetically degraded the quality of microscopy images\neven further by using an approximate forward model for deep tissue image\ndegradations. Then we trained a neural network that learned the inverse of this\ndegradation function from our generated pairs of raw and degraded images. We\ndemonstrated that networks trained in this way can be used out-of-distribution\n(OOD) to improve the quality of less severely degraded images, e.g. the raw\ndata imaged in a microscope. Since the absolute level of degradation in such\nmicroscopy images can be stronger than the additional degradation introduced by\nour forward model, we also explored the effect of iterative predictions. Here,\nwe observed that in each iteration the measured image contrast kept improving\nwhile detailed structures in the images got increasingly removed. Therefore,\ndependent on the desired downstream analysis, a balance between contrast\nimprovement and retention of image details has to be found.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:40:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Martins","Nuno Pimp\u00e3o",""],["Kalaidzidis","Yannis",""],["Zerial","Marino",""],["Jug","Florian",""]]}
{"id":"2308.08366","submitter":"Jialin Guo","authors":"Jialin Guo, Zhenyu Wu, Zhiqiang Zhan, Yang Ji","title":"Dual-Branch Temperature Scaling Calibration for Long-Tailed Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The calibration for deep neural networks is currently receiving widespread\nattention and research. Miscalibration usually leads to overconfidence of the\nmodel. While, under the condition of long-tailed distribution of data, the\nproblem of miscalibration is more prominent due to the different confidence\nlevels of samples in minority and majority categories, and it will result in\nmore serious overconfidence. To address this problem, some current research\nhave designed diverse temperature coefficients for different categories based\non temperature scaling (TS) method. However, in the case of rare samples in\nminority classes, the temperature coefficient is not generalizable, and there\nis a large difference between the temperature coefficients of the training set\nand the validation set. To solve this challenge, this paper proposes a\ndual-branch temperature scaling calibration model (Dual-TS), which considers\nthe diversities in temperature parameters of different categories and the\nnon-generalizability of temperature parameters for rare samples in minority\nclasses simultaneously. Moreover, we noticed that the traditional calibration\nevaluation metric, Excepted Calibration Error (ECE), gives a higher weight to\nlow-confidence samples in the minority classes, which leads to inaccurate\nevaluation of model calibration. Therefore, we also propose Equal Sample Bin\nExcepted Calibration Error (Esbin-ECE) as a new calibration evaluation metric.\nThrough experiments, we demonstrate that our model yields state-of-the-art in\nboth traditional ECE and Esbin-ECE metrics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:40:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guo","Jialin",""],["Wu","Zhenyu",""],["Zhan","Zhiqiang",""],["Ji","Yang",""]]}
{"id":"2308.08367","submitter":"Ran Jiang","authors":"Ran Jiang, Sanfeng Zhang, Linfeng Liu, Yanbing Peng","title":"Diff-CAPTCHA: An Image-based CAPTCHA with Security Enhanced by Denoising\n  Diffusion Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To enhance the security of text CAPTCHAs, various methods have been employed,\nsuch as adding the interference lines on the text, randomly distorting the\ncharacters, and overlapping multiple characters. These methods partly increase\nthe difficulty of automated segmentation and recognition attacks. However,\nfacing the rapid development of the end-to-end breaking algorithms, their\nsecurity has been greatly weakened. The diffusion model is a novel image\ngeneration model that can generate the text images with deep fusion of\ncharacters and background images. In this paper, an image-click CAPTCHA scheme\ncalled Diff-CAPTCHA is proposed based on denoising diffusion models. The\nbackground image and characters of the CAPTCHA are treated as a whole to guide\nthe generation process of a diffusion model, thus weakening the character\nfeatures available for machine learning, enhancing the diversity of character\nfeatures in the CAPTCHA, and increasing the difficulty of breaking algorithms.\nTo evaluate the security of Diff-CAPTCHA, this paper develops several attack\nmethods, including end-to-end attacks based on Faster R-CNN and two-stage\nattacks, and Diff-CAPTCHA is compared with three baseline schemes, including\ncommercial CAPTCHA scheme and security-enhanced CAPTCHA scheme based on style\ntransfer. The experimental results show that diffusion models can effectively\nenhance CAPTCHA security while maintaining good usability in human testing.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:41:29 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiang","Ran",""],["Zhang","Sanfeng",""],["Liu","Linfeng",""],["Peng","Yanbing",""]]}
{"id":"2308.08368","submitter":"Constantin Beli","authors":"Constantin-Nicolae Beli","title":"Two results on cohomology of groups adapted to cochains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a group $G$ and a $G$-module $M$, we denote by $(C(G,M),d)$ the\ncorresponding cochain complex obtained from the standard resolution. An element\nof the cohomology $H(G,M)$ will be written as the class $[a]$ of some cocycle\n$a\\in C(G,M)$.\n  The first result involves the triviality of the action of $G$ on $H(G,M)$,\ni.e. $s[a]=[a]$ $\\forall [a]\\in H^n(G,M)$, $s\\in G$. Adapted to cochains, we\nprove that $sa-a=(h_sd+dh_s)(a)$ $\\forall a\\in C^n(G,M)$, for some explicit map\n$h_s:C(G,M)\\to C(G,M)[-1]$.\n  The second result regards the commutativity of the cup product, i.e. $[a]\\cup\n[b]=(-1)^{pq}t_*([b]\\cup [a])$ $\\forall [a]\\in H^p(G,N)$, $[b]\\in H^q(G,M)$.\n(Here $t:N\\otimes M\\to M\\otimes N$ is the natural bijection.) Adapted to\ncochains, we prove that $(-1)^{pq}t_*(b\\cup a)-a\\cup b=(hd+dh)(a\\otimes b)$\n$\\forall a\\in C^p(G,M)$, $b\\in C^q(G,N)$, for some explicit map\n$h:C(G,M)\\otimes C(G,N)\\to C(G,M\\otimes N)[-1]$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:41:48 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Beli","Constantin-Nicolae",""]]}
{"id":"2308.08369","submitter":"Pavel Safronov","authors":"Florian Naef and Pavel Safronov","title":"Torsion volume forms","comments":"58 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AT math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce volume forms on mapping stacks in derived algebraic geometry\nusing a parametrized version of the Reidemeister-Turaev torsion. In the case of\nderived loop stacks we describe this volume form in terms of the Todd class. In\nthe case of mapping stacks from surfaces, we compare it to the symplectic\nvolume form. As an application of these ideas, we construct canonical\norientation data for cohomological DT invariants of closed oriented\n3-manifolds.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:43:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Naef","Florian",""],["Safronov","Pavel",""]]}
{"id":"2308.08370","submitter":"Danyang Tu","authors":"Danyang Tu, Wei Sun, Guangtao Zhai, Wei Shen","title":"Agglomerative Transformer for Human-Object Interaction Detection","comments":"Accepted by ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose an agglomerative Transformer (AGER) that enables Transformer-based\nhuman-object interaction (HOI) detectors to flexibly exploit extra\ninstance-level cues in a single-stage and end-to-end manner for the first time.\nAGER acquires instance tokens by dynamically clustering patch tokens and\naligning cluster centers to instances with textual guidance, thus enjoying two\nbenefits: 1) Integrality: each instance token is encouraged to contain all\ndiscriminative feature regions of an instance, which demonstrates a significant\nimprovement in the extraction of different instance-level cues and subsequently\nleads to a new state-of-the-art performance of HOI detection with 36.75 mAP on\nHICO-Det. 2) Efficiency: the dynamical clustering mechanism allows AGER to\ngenerate instance tokens jointly with the feature learning of the Transformer\nencoder, eliminating the need of an additional object detector or instance\ndecoder in prior methods, thus allowing the extraction of desirable extra cues\nfor HOI detection in a single-stage and end-to-end pipeline. Concretely, AGER\nreduces GFLOPs by 8.5% and improves FPS by 36%, even compared to a vanilla\nDETR-like pipeline without extra cue extraction.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:48:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tu","Danyang",""],["Sun","Wei",""],["Zhai","Guangtao",""],["Shen","Wei",""]]}
{"id":"2308.08371","submitter":"Richard Nordsieck","authors":"Richard Nordsieck, Andr\\'e Schweizer, Michael Heider, J\\\"org H\\\"ahner","title":"PDPK: A Framework to Synthesise Process Data and Corresponding\n  Procedural Knowledge for Manufacturing","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":"  Procedural knowledge describes how to accomplish tasks and mitigate problems.\nSuch knowledge is commonly held by domain experts, e.g. operators in\nmanufacturing who adjust parameters to achieve quality targets. To the best of\nour knowledge, no real-world datasets containing process data and corresponding\nprocedural knowledge are publicly available, possibly due to corporate\napprehensions regarding the loss of knowledge advances. Therefore, we provide a\nframework to generate synthetic datasets that can be adapted to different\ndomains. The design choices are inspired by two real-world datasets of\nprocedural knowledge we have access to. Apart from containing representations\nof procedural knowledge in Resource Description Framework (RDF)-compliant\nknowledge graphs, the framework simulates parametrisation processes and\nprovides consistent process data. We compare established embedding methods on\nthe resulting knowledge graphs, detailing which out-of-the-box methods have the\npotential to represent procedural knowledge. This provides a baseline which can\nbe used to increase the comparability of future work. Furthermore, we validate\nthe overall characteristics of a synthesised dataset by comparing the results\nto those achievable on a real-world dataset. The framework and evaluation code,\nas well as the dataset used in the evaluation, are available open source.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:50:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nordsieck","Richard",""],["Schweizer","Andr\u00e9",""],["Heider","Michael",""],["H\u00e4hner","J\u00f6rg",""]]}
{"id":"2308.08372","submitter":"Johannes Flommersfeld","authors":"Johannes Flommersfeld, Stefan St\\\"oberl, Omar Shah, Joachim O.\n  R\\\"adler, and Chase P. Broedersz","title":"Geometry-sensitive protrusion growth directs confined cell migration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph q-bio.CB q-bio.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The migratory dynamics of cells can be influenced by the complex\nmicro-environment through which they move. It remains unclear how the motility\nmachinery of confined cells responds and adapts to their micro-environment.\nHere, we propose a biophysical mechanism for a geometry-dependent coupling\nbetween the front of the cell and the nucleus that leads to directed migration.\nWe apply our model to geometry-guided cell migration to obtain insights into\nthe origin of directed migration on asymmetric adhesive micro-patterns and the\npolarization enhancement of cells observed under strong confinement.\nRemarkably, for cells that can choose between channels of different size, our\nmodel predicts an intricate dependence for cellular decision making as a\nfunction of the two channel widths, which we confirm experimentally.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:52:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Flommersfeld","Johannes",""],["St\u00f6berl","Stefan",""],["Shah","Omar",""],["R\u00e4dler","Joachim O.",""],["Broedersz","Chase P.",""]]}
{"id":"2308.08373","submitter":"Liren Shan","authors":"Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury\n  Makarychev, Liren Shan","title":"Approximation Algorithms for Norm Multiway Cut","comments":"25 pages, ESA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider variants of the classic Multiway Cut problem. Multiway Cut asks\nto partition a graph $G$ into $k$ parts so as to separate $k$ given terminals.\nRecently, Chandrasekaran and Wang (ESA 2021) introduced $\\ell_p$-norm Multiway,\na generalization of the problem, in which the goal is to minimize the $\\ell_p$\nnorm of the edge boundaries of $k$ parts. We provide an $O(\\log^{1/2}\nn\\log^{1/2+1/p} k)$ approximation algorithm for this problem, improving upon\nthe approximation guarantee of $O(\\log^{3/2} n \\log^{1/2} k)$ due to\nChandrasekaran and Wang.\n  We also introduce and study Norm Multiway Cut, a further generalization of\nMultiway Cut. We assume that we are given access to an oracle, which answers\ncertain queries about the norm. We present an $O(\\log^{1/2} n \\log^{7/2} k)$\napproximation algorithm with a weaker oracle and an $O(\\log^{1/2} n \\log^{5/2}\nk)$ approximation algorithm with a stronger oracle. Additionally, we show that\nwithout any oracle access, there is no $n^{1/4-\\varepsilon}$ approximation\nalgorithm for every $\\varepsilon > 0$ assuming the Hypergraph Dense-vs-Random\nConjecture.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:55:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Carlson","Charlie",""],["Jafarov","Jafar",""],["Makarychev","Konstantin",""],["Makarychev","Yury",""],["Shan","Liren",""]]}
{"id":"2308.08374","submitter":"Stefan Siemer","authors":"Pamela Fleischmann and Sungmin Kim and Tore Ko{\\ss} and Florin Manea\n  and Dirk Nowotka and Stefan Siemer and Max Wiedenh\\\"oft","title":"Matching Patterns with Variables Under Simon's Congruence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and investigate a series of matching problems for patterns with\nvariables under Simon's congruence. Our results provide a thorough picture of\nthese problems' computational complexity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:56:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fleischmann","Pamela",""],["Kim","Sungmin",""],["Ko\u00df","Tore",""],["Manea","Florin",""],["Nowotka","Dirk",""],["Siemer","Stefan",""],["Wiedenh\u00f6ft","Max",""]]}
{"id":"2308.08375","submitter":"Tong Yang","authors":"Tong Yang and Yu-Long Zhou","title":"A new understanding of grazing limit","comments":"56 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The grazing limit of the Boltzmann equation to Landau equation is well-known\nand has been justified by using cutoff near the grazing angle with some\nsuitable scaling. In this paper, we will provide a new understanding by simply\napplying a natural scaling on the Boltzmann operator without angular cutoff.\nThe proof is based on a new well-posedness theory on the Boltzmann equation\nwithout angular cutoff in the regime with optimal ranges of parameters so that\nthe grazing limit can be justified directly for any $\\gamma>-5$ that includes\nthe Coulomb potential corresponding to $\\gamma=-3$. With this new\nunderstanding, the scaled Boltzmann operator in fact can be decomposed into two\ncomponents. The first one converges to the Landau operator when the singular\nparameter $s$ of interaction angle tends to $1^{-}$ and the second one vanishes\nin this limit.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:58:45 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 02:08:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yang","Tong",""],["Zhou","Yu-Long",""]]}
{"id":"2308.08376","submitter":"Enrique Dehaerne","authors":"Thibault Lechien, Enrique Dehaerne, Bappaditya Dey, Victor Blanco,\n  Sandip Halder, Stefan De Gendt, Wannes Meert","title":"Automated Semiconductor Defect Inspection in Scanning Electron\n  Microscope Images: a Systematic Review","comments":"16 pages, 12 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A growing need exists for efficient and accurate methods for detecting\ndefects in semiconductor materials and devices. These defects can have a\ndetrimental impact on the efficiency of the manufacturing process, because they\ncause critical failures and wafer-yield limitations. As nodes and patterns get\nsmaller, even high-resolution imaging techniques such as Scanning Electron\nMicroscopy (SEM) produce noisy images due to operating close to sensitivity\nlevels and due to varying physical properties of different underlayers or\nresist materials. This inherent noise is one of the main challenges for defect\ninspection. One promising approach is the use of machine learning algorithms,\nwhich can be trained to accurately classify and locate defects in semiconductor\nsamples. Recently, convolutional neural networks have proved to be particularly\nuseful in this regard. This systematic review provides a comprehensive overview\nof the state of automated semiconductor defect inspection on SEM images,\nincluding the most recent innovations and developments. 38 publications were\nselected on this topic, indexed in IEEE Xplore and SPIE databases. For each of\nthese, the application, methodology, dataset, results, limitations and future\nwork were summarized. A comprehensive overview and analysis of their methods is\nprovided. Finally, promising avenues for future work in the field of SEM-based\ndefect inspection are suggested.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:59:43 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 11:03:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lechien","Thibault",""],["Dehaerne","Enrique",""],["Dey","Bappaditya",""],["Blanco","Victor",""],["Halder","Sandip",""],["De Gendt","Stefan",""],["Meert","Wannes",""]]}
{"id":"2308.08377","submitter":"Jori Schmidt","authors":"Jori F. Schmidt, Lukas M. Eng, Samuel D. Seddon","title":"Towards 3D Magnetic Force Microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic force microscopy (MFM) is long established as a powerful tool for\nprobing the local manifestation of magnetic nanostructures across a range of\ntemperatures and applied stimuli. A major drawback of the technique, however,\nis that the detection of stray fields emanating from a samples surface rely on\na uniaxial vertical cantilever oscillation, and thus are only sensitive to\nvertically oriented stray field components. The last two decades have shown an\never-increasing literature fascination for exotic topological windings where\nparticular attention to in-plane magnetic moment rotation is highly valuable\nwhen identifying and understanding such systems. Here we present a new method\nof detecting in-plane magnetic stray field components, by utilizing a home made\nsplit-electrode excitation piezo that allows the simultaneous excitation of a\ncantilever at its fundamental flexural and torsional modes. This allows for the\njoint acquisition of traditional vertical mode (V-MFM) images and a lateral MFM\n(L-MFM) where the tip-cantilever system is only sensitive to stray fields\nacting perpendicular to the torsional axis of the cantilever.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:01:06 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 12:29:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schmidt","Jori F.",""],["Eng","Lukas M.",""],["Seddon","Samuel D.",""]]}
{"id":"2308.08378","submitter":"Jingrui Hou","authors":"Jingrui Hou and Georgina Cosma and Axel Finke","title":"Advancing continual lifelong learning in neural information retrieval:\n  definition, dataset, framework, and empirical evaluation","comments":"Submitted to Information Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Continual learning refers to the capability of a machine learning model to\nlearn and adapt to new information, without compromising its performance on\npreviously learned tasks. Although several studies have investigated continual\nlearning methods for information retrieval tasks, a well-defined task\nformulation is still lacking, and it is unclear how typical learning strategies\nperform in this context. To address this challenge, a systematic task\nformulation of continual neural information retrieval is presented, along with\na multiple-topic dataset that simulates continuous information retrieval. A\ncomprehensive continual neural information retrieval framework consisting of\ntypical retrieval models and continual learning strategies is then proposed.\nEmpirical evaluations illustrate that the proposed framework can successfully\nprevent catastrophic forgetting in neural information retrieval and enhance\nperformance on previously learned tasks. The results indicate that\nembedding-based retrieval models experience a decline in their continual\nlearning performance as the topic shift distance and dataset volume of new\ntasks increase. In contrast, pretraining-based models do not show any such\ncorrelation. Adopting suitable learning strategies can mitigate the effects of\ntopic shift and data augmentation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:01:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hou","Jingrui",""],["Cosma","Georgina",""],["Finke","Axel",""]]}
{"id":"2308.08379","submitter":"Thomas Strypsteen","authors":"Thomas Strypsteen and Alexander Bertrand","title":"A distributed neural network architecture for dynamic sensor selection\n  with application to bandwidth-constrained body-sensor networks","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":"  We propose a dynamic sensor selection approach for deep neural networks\n(DNNs), which is able to derive an optimal sensor subset selection for each\nspecific input sample instead of a fixed selection for the entire dataset. This\ndynamic selection is jointly learned with the task model in an end-to-end way,\nusing the Gumbel-Softmax trick to allow the discrete decisions to be learned\nthrough standard backpropagation. We then show how we can use this dynamic\nselection to increase the lifetime of a wireless sensor network (WSN) by\nimposing constraints on how often each node is allowed to transmit. We further\nimprove performance by including a dynamic spatial filter that makes the\ntask-DNN more robust against the fact that it now needs to be able to handle a\nmultitude of possible node subsets. Finally, we explain how the selection of\nthe optimal channels can be distributed across the different nodes in a WSN. We\nvalidate this method on a use case in the context of body-sensor networks,\nwhere we use real electroencephalography (EEG) sensor data to emulate an EEG\nsensor network. We analyze the resulting trade-offs between transmission load\nand task accuracy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:04:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Strypsteen","Thomas",""],["Bertrand","Alexander",""]]}
{"id":"2308.08380","submitter":"Mariia Gladkova","authors":"Jiaxin Pan, Changyao Zhou, Mariia Gladkova, Qadeer Khan and Daniel\n  Cremers","title":"Robust Autonomous Vehicle Pursuit without Expert Steering Labels","comments":"9 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we present a learning method for lateral and longitudinal\nmotion control of an ego-vehicle for vehicle pursuit. The car being controlled\ndoes not have a pre-defined route, rather it reactively adapts to follow a\ntarget vehicle while maintaining a safety distance. To train our model, we do\nnot rely on steering labels recorded from an expert driver but effectively\nleverage a classical controller as an offline label generation tool. In\naddition, we account for the errors in the predicted control values, which can\nlead to a loss of tracking and catastrophic crashes of the controlled vehicle.\nTo this end, we propose an effective data augmentation approach, which allows\nto train a network capable of handling different views of the target vehicle.\nDuring the pursuit, the target vehicle is firstly localized using a\nConvolutional Neural Network. The network takes a single RGB image along with\ncars' velocities and estimates the target vehicle's pose with respect to the\nego-vehicle. This information is then fed to a Multi-Layer Perceptron, which\nregresses the control commands for the ego-vehicle, namely throttle and\nsteering angle. We extensively validate our approach using the CARLA simulator\non a wide range of terrains. Our method demonstrates real-time performance and\nrobustness to different scenarios including unseen trajectories and high route\ncompletion. The project page containing code and multimedia can be publicly\naccessed here: https://changyaozhou.github.io/Autonomous-Vehicle-Pursuit/.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:09:39 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pan","Jiaxin",""],["Zhou","Changyao",""],["Gladkova","Mariia",""],["Khan","Qadeer",""],["Cremers","Daniel",""]]}
{"id":"2308.08381","submitter":"Patricia Wollstadt","authors":"Lydia Fischer and Patricia Wollstadt","title":"Precision and Recall Reject Curves for Classification","comments":"11 pages, 3 figures. Updated figure labels","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For some classification scenarios, it is desirable to use only those\nclassification instances that a trained model associates with a high certainty.\nTo obtain such high-certainty instances, previous work has proposed\naccuracy-reject curves. Reject curves allow to evaluate and compare the\nperformance of different certainty measures over a range of thresholds for\naccepting or rejecting classifications. However, the accuracy may not be the\nmost suited evaluation metric for all applications, and instead precision or\nrecall may be preferable. This is the case, for example, for data with\nimbalanced class distributions. We therefore propose reject curves that\nevaluate precision and recall, the recall-reject curve and the precision-reject\ncurve. Using prototype-based classifiers from learning vector quantization, we\nfirst validate the proposed curves on artificial benchmark data against the\naccuracy reject curve as a baseline. We then show on imbalanced benchmarks and\nmedical, real-world data that for these scenarios, the proposed precision- and\nrecall-curves yield more accurate insights into classifier performance than\naccuracy reject curves.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:09:48 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 13:31:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fischer","Lydia",""],["Wollstadt","Patricia",""]]}
{"id":"2308.08382","submitter":"Xiaojuan Chen","authors":"Xiaojuan Chen, Kang Xu, Tingxiao Qin, Yubin Wang, Yuzhong Chen, Haiyun\n  Liu, and Qihua Xiong","title":"Bulk photovoltaic effect in two-dimensional ferroelectric semiconductor\n  $\\alpha$-In$_2$Se$_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Bulk photovoltaic effect, which arises from crystal symmetry-driven charge\ncarrier separation, is an intriguing physical phenomenon that has attracted\nextensive interest in photovoltaic application due to its junction-free\nphotovoltaic and potential to surpass Shockley-Queisser limit. Whereas\nconventional ferroelectric materials mostly suffer from extremely low\nphotocurrent density and weak photovoltaic response at visible light\nwavelengths. Emerging two-dimensional ferroelectric semiconductors with coupled\nvisible light absorption and spontaneous polarization characteristics are a\npromising alternative for making functional photoferroelectrics. Herein, we\nreport the experimental demonstration of the bulk photovoltaic effect behavior\nbased on the 2D ferroelectric semiconductor {$\\alpha$-InSe caused by an\nout-of-plane polarization induced depolarization field. The {$\\alpha$-InSe\ndevice exhibits enhanced bulk photovoltaic response in the visible light\nspectrum owing to its narrow bandgap. It was demonstrated that the generated\nphotovoltaic current density was nearly two orders of magnitude greater than\nconventional bulk ferroelectric materials. These findings highlight the\npotential of 2D ferroelectric semiconductor materials for bulk photovoltaic\napplications in a broad spectral region.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:16:57 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:41:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Xiaojuan",""],["Xu","Kang",""],["Qin","Tingxiao",""],["Wang","Yubin",""],["Chen","Yuzhong",""],["Liu","Haiyun",""],["Xiong","Qihua",""]]}
{"id":"2308.08383","submitter":"Dilip Asthagiri","authors":"Dilipkumar N. Asthagiri and Thomas L. Beck","title":"Equilibration between Translational and Rotational Modes in Molecular\n  Dynamics Simulations of Rigid Water Requires a Smaller Integration Time-Step\n  Than Often Used","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In simulations of aqueous systems it is common to freeze the bond vibration\nand angle bending modes in water to allow for a longer time-step $\\delta t$ for\nintegrating the equations of motion. Thus $\\delta t = 2$ fs is often used in\nsimulating rigid models of water. We simulate the SPC/E model of water using\n$\\delta t$ from 0.5 fs to 3.0 fs. We find that for all but $\\delta = 0.5$ fs,\nequipartition between translational and rotational modes is violated: the\nrotational modes are at a lower temperature than the translation modes. The\nautocorrelation of the velocities corresponding to the respective modes shows\nthat the rotational relaxation occurs at a time-scale comparable to vibrational\nperiods, invalidating the original assumption for freezing vibrations. $\\delta\nt$ also influences thermodynamic properties: the mean system potential energies\nare not converged until $\\delta t = 0.5$ fs, and the excess entropy of\nhydration of a soft, repulsive cavity is also sensitive to $\\delta t$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:17:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Asthagiri","Dilipkumar N.",""],["Beck","Thomas L.",""]]}
{"id":"2308.08384","submitter":"Parna Roy Ms","authors":"Sourav Pal, Parna Roy and Abhik Basu","title":"Availability, storage capacity, and diffusion: Stationary states of an\n  asymmetric exclusion process connected to two reservoirs","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore how the interplay of finite availability, carrying capacity of\nparticles at different parts of a spatially extended system and particle\ndiffusion between them control the steady state currents and density profiles\nin a one-dimensional current-carrying channel connecting the different parts of\nthe system. To study this, we construct a minimal model consisting of two\nparticle reservoirs of finite carrying capacities connected by a totally\nasymmetric simple exclusion process (TASEP). In addition to particle transport\nvia TASEP between the reservoirs, the latter can also directly exchange\nparticles, modeling particle diffusion between them that can maintain a steady\ncurrent in the system. We investigate the steady state density profiles and the\nassociated particle currents in the TASEP lane. The resulting phases and the\nphase diagrams are quite different from an open TASEP, and are characterised by\nthe model parameters defining particle exchanges between the TASEP and the\nreservoirs, direct particle exchanges between the reservoirs, and the filling\nfraction of the particles that determines the total resources available. These\nparameters can be tuned to make the density on the TASEP lane globally uniform\nor piecewise continuous, and can make the two reservoirs preferentially\npopulated or depopulated.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:17:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pal","Sourav",""],["Roy","Parna",""],["Basu","Abhik",""]]}
{"id":"2308.08385","submitter":"Rodrigo Hern\\'andez","authors":"V. Bravo, R. Hern\\'andez, O. Venegas","title":"A Characterization of concave mappings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on Concave mappings, a class of univalent functions that\nexhibit a unique property: they map the unit disk onto a domain whose\ncomplement is convex. The main objective of this work is to characterize these\nmappings in terms of the real part of the expression $1 +zf''(z)/f'(z)$,\nconsidering scenarios where the omitted convex domain is either bounded or\nunbounded. In the case of a bounded convex domain, we investigate the pivotal\nrole played by the Schwarzian derivative and the order of the functions in\nunderstanding the behavior and properties of these mappings.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:18:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bravo","V.",""],["Hern\u00e1ndez","R.",""],["Venegas","O.",""]]}
{"id":"2308.08386","submitter":"Prudhvi N. Bhattiprolu","authors":"Prudhvi N. Bhattiprolu, Stephen P. Martin, Aaron Pierce","title":"Isosinglet vectorlike leptons at $e^+e^-$ colliders","comments":"34 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study weak isosinglet vectorlike leptons that decay through a small mixing\nwith the tau lepton, for which the discovery and exclusion reaches of the Large\nHadron Collider and future proposed hadron colliders are limited. We show how\nan $e^+ e^-$ collider may act as a discovery machine for these $\\tau^{\\prime}$\nparticles, demonstrate that the $\\tau^{\\prime}$ mass peak can be reconstructed\nin a variety of distinct signal regions, and explain how the $\\tau^{\\prime}$\nbranching ratios may be measured.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:18:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bhattiprolu","Prudhvi N.",""],["Martin","Stephen P.",""],["Pierce","Aaron",""]]}
{"id":"2308.08387","submitter":"Kevin Kloos","authors":"Kevin Kloos, Julian D. Karch, Quinten A. Meertens, Mark de Rooij","title":"Continuous Sweep: an improved, binary quantifier","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantification is a supervised machine learning task, focused on estimating\nthe class prevalence of a dataset rather than labeling its individual\nobservations. We introduce Continuous Sweep, a new parametric binary quantifier\ninspired by the well-performing Median Sweep. Median Sweep is currently one of\nthe best binary quantifiers, but we have changed this quantifier on three\npoints, namely 1) using parametric class distributions instead of empirical\ndistributions, 2) optimizing decision boundaries instead of applying discrete\ndecision rules, and 3) calculating the mean instead of the median. We derive\nanalytic expressions for the bias and variance of Continuous Sweep under\ngeneral model assumptions. This is one of the first theoretical contributions\nin the field of quantification learning. Moreover, these derivations enable us\nto find the optimal decision boundaries. Finally, our simulation study shows\nthat Continuous Sweep outperforms Median Sweep in a wide range of situations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:18:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kloos","Kevin",""],["Karch","Julian D.",""],["Meertens","Quinten A.",""],["de Rooij","Mark",""]]}
{"id":"2308.08388","submitter":"Andras I. Stipsicz","authors":"Andras I. Stipsicz and Zoltan Szabo","title":"Exotic definite four-manifolds with non-trivial fundamental group","comments":"13 pages, 3 figures, minor changes, references added","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inspired by a recent result of Levine-Lidman-Piccirillo, we construct\ninfinitely many exotic smooth structures on some closed four-manifolds with\ndefinite intersection form and fundamental group isomorphic to $\\Z /2\\Z$.\nSimilar constructions provide exotic smooth structures on further\nfour-manifolds with fundamental group $Z/2\\Z$, including examples with even\n$b_2^+$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:18:57 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 20:19:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Stipsicz","Andras I.",""],["Szabo","Zoltan",""]]}
{"id":"2308.08389","submitter":"Annibal Figueiredo","authors":"E. L. S. Silva, L.H. Miranda-Filho, A. Figueiredo","title":"On the probability distributions of the force and potential energy for a\n  system with an infinite number of random point sources","comments":"25 pages, 5 tables, Preprint Article","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.PR physics.data-an","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we study the probability distribution for the force and\npotential energy of a test particle interacting with $N$ point random sources\nin the limit $N\\rightarrow\\infty$. The interaction is given by a central\npotential $V(R)=k/R^{\\delta-1}$ in a $ d$-dimensional euclidean space, where\n$R$ is the random relative distance between the source and the test particle,\n$\\delta$ is the force exponent, and $k$ is the coupling parameter. In order to\nassure a well-defined limit for the probability distribution of the force and\npotential energy, we { must} renormalize the coupling parameter and/or the\nsystem size as a function of the number $N$ of sources.\n  We show the existence of three non-singular limits, depending on the exponent\n$\\delta$ and the spatial dimension $d$. (i) For $\\delta<d$ the force and\npotential energy { converge} to their respective mean values. This limit is\ncalled Mean Field Limit. (ii) For $\\delta>d+1$ the potential energy converges\nto a random variable and the force to a random vector. This limit is called\nThermodynamic Limit. (iii) For $d<\\delta<d+1$ the potential energy converges to\nits mean and the force to a random vector. This limit is called Mixed Limit\n  Also, we show the existence of two singular limits: (iv) for $\\delta=d$ the\npotential energy converges to its mean and the force to zero, and (v) for\n$\\delta=d+1$ the energy converges to a finite value and the force to a random\nvector.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:19:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Silva","E. L. S.",""],["Miranda-Filho","L. H.",""],["Figueiredo","A.",""]]}
{"id":"2308.08390","submitter":"Hongyi Jiang","authors":"Hongyi Jiang, Zhenting Sun","title":"Testing Partial Instrument Monotonicity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When multi-dimensional instruments are used to identify and estimate causal\neffects, the monotonicity condition may not hold due to heterogeneity in the\npopulation. Under a partial monotonicity condition, which only requires the\nmonotonicity to hold for each instrument separately holding all the other\ninstruments fixed, the 2SLS estimand can still be a positively weighted average\nof LATEs. In this paper, we provide a simple nonparametric test for partial\ninstrument monotonicity. We demonstrate the good finite sample properties of\nthe test through Monte Carlo simulations. We then apply the test to monetary\nincentives and distance from results centers as instruments for the knowledge\nof HIV status.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:22:51 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 22:12:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jiang","Hongyi",""],["Sun","Zhenting",""]]}
{"id":"2308.08391","submitter":"Romana Boiger","authors":"Arnau Alb\\`a, Andreas Adelmann, Lucas M\\\"unster, Dimitri Rochman,\n  Romana Boiger","title":"Fast Uncertainty Quantification of Spent Nuclear Fuel with Neural\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":"  The accurate calculation and uncertainty quantification of the\ncharacteristics of spent nuclear fuel (SNF) play a crucial role in ensuring the\nsafety, efficiency, and sustainability of nuclear energy production, waste\nmanagement, and nuclear safeguards. State of the art physics-based models,\nwhile reliable, are computationally intensive and time-consuming. This paper\npresents a surrogate modeling approach using neural networks (NN) to predict a\nnumber of SNF characteristics with reduced computational costs compared to\nphysics-based models. An NN is trained using data generated from CASMO5 lattice\ncalculations. The trained NN accurately predicts decay heat and nuclide\nconcentrations of SNF, as a function of key input parameters, such as\nenrichment, burnup, cooling time between cycles, mean boron concentration and\nfuel temperature. The model is validated against physics-based decay heat\nsimulations and measurements of different uranium oxide fuel assemblies from\ntwo different pressurized water reactors. In addition, the NN is used to\nperform sensitivity analysis and uncertainty quantification. The results are in\nvery good alignment to CASMO5, while the computational costs (taking into\naccount the costs of generating training samples) are reduced by a factor of 10\nor more. Our findings demonstrate the feasibility of using NNs as surrogate\nmodels for fast characterization of SNF, providing a promising avenue for\nimproving computational efficiency in assessing nuclear fuel behavior and\nassociated risks.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:23:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Alb\u00e0","Arnau",""],["Adelmann","Andreas",""],["M\u00fcnster","Lucas",""],["Rochman","Dimitri",""],["Boiger","Romana",""]]}
{"id":"2308.08392","submitter":"Rafael I. Nepomechie","authors":"David Raveh and Rafael I. Nepomechie","title":"$q$-analog qudit Dicke states","comments":"18 pages + supplementary material","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dicke states are completely symmetric states of multiple qubits (2-level\nsystems), and qudit Dicke states are their $d$-level generalization. We define\nhere $q$-deformed qudit Dicke states using the quantum algebra $su_q(d)$. We\nshow that these states can be compactly expressed as a weighted sum over\npermutations with $q$-factors involving the so-called inversion number, an\nimportant permutation statistic in Combinatorics. We use this result to compute\nthe bipartite entanglement entropy of these states. We also discuss the\npreparation of these states on a quantum computer, and show that introducing a\n$q$-dependence does not change the circuit gate count.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:23:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Raveh","David",""],["Nepomechie","Rafael I.",""]]}
{"id":"2308.08393","submitter":"Maolin Gao","authors":"Maolin Gao, Paul Roetzer, Marvin Eisenberger, Zorah L\\\"ahner, Michael\n  Moeller, Daniel Cremers, Florian Bernard","title":"SIGMA: Scale-Invariant Global Sparse Shape Matching","comments":"14 pages","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 mixed-integer programming (MIP) formulation for generating\nprecise sparse correspondences for highly non-rigid shapes. To this end, we\nintroduce a projected Laplace-Beltrami operator (PLBO) which combines intrinsic\nand extrinsic geometric information to measure the deformation quality induced\nby predicted correspondences. We integrate the PLBO, together with an\norientation-aware regulariser, into a novel MIP formulation that can be solved\nto global optimality for many practical problems. In contrast to previous\nmethods, our approach is provably invariant to rigid transformations and global\nscaling, initialisation-free, has optimality guarantees, and scales to high\nresolution meshes with (empirically observed) linear time. We show\nstate-of-the-art results for sparse non-rigid matching on several challenging\n3D datasets, including data with inconsistent meshing, as well as applications\nin mesh-to-point-cloud matching.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:25:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gao","Maolin",""],["Roetzer","Paul",""],["Eisenberger","Marvin",""],["L\u00e4hner","Zorah",""],["Moeller","Michael",""],["Cremers","Daniel",""],["Bernard","Florian",""]]}
{"id":"2308.08394","submitter":"Matteo Bonforte","authors":"Matteo Bonforte and Alessio Figalli","title":"The Cauchy-Dirichlet Problem for the Fast Diffusion Equation on Bounded\n  Domains","comments":"61 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Fast Diffusion Equation (FDE) $u_t= \\Delta u^m$, with $m\\in (0,1)$, is an\nimportant model for singular nonlinear (density dependent) diffusive phenomena.\nHere, we focus on the Cauchy-Dirichlet problem posed on smooth bounded\nEuclidean domains. In addition to its physical relevance, there are many\naspects that make this equation particularly interesting from the pure\nmathematical perspective. For instance: mass is lost and solutions may\nextinguish in finite time, merely integrable data can produce unbounded\nsolutions, classical forms of Harnack inequalities (and other regularity\nestimates) fail to be true, etc.\n  In this paper, we first provide a survey (enriched with an extensive\nbibliography) focussing on the more recent results about existence, uniqueness,\nboundedness and positivity (i.e., Harnack inequalities, both local and global),\nand higher regularity estimates (also up to the boundary and possibly up to the\nextinction time). We then prove new global (in space and time) Harnack\nestimates in the subcritical regime. In the last section, we devote a special\nattention to the asymptotic behaviour, from the first pioneering results to the\nlatest sharp results, and we present some new asymptotic results in the\nsubcritical case.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:28:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bonforte","Matteo",""],["Figalli","Alessio",""]]}
{"id":"2308.08395","submitter":"Igor Vinograd","authors":"Igor Vinograd, Sofia Michaela Souliou, Amir-Abbas Haghighirad, Tom\n  Lacmann, Mehdi Frachet, Michael Merz, Nour Maraytta, Gaston Garbarino, Yiran\n  Liu, Suguru Nakata, Kousuke Ishida, Hilary M. L. Noad, Matteo Minola,\n  Bernhard Keimer, Clifford W. Hicks and Matthieu Le Tacon","title":"Strain-Tuning of 2D and 3D Charge-Density Waves in High-Temperature\n  Superconducting YBa$_{2}$Cu$_{3}$O$_{\\rm{y}}$","comments":"I. Vinograd and S. M. Souliou contributed equally to this work","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Uniaxial pressure experiments in underdoped YBa$_{2}$Cu$_{3}$O$_{\\rm{y}}$\nprovide an efficient approach to the control of the competition between\ncharge-density waves (CDWs) and superconductivity. It can enhance the\ncorrelation volume of ubiquitous short-range CDW correlations and above a\ncritical value, even induce a long-range CDW order otherwise only accessible\nthrough the suppression of superconductivity by large magnetic fields. Here we\nuse x-ray diffraction with access to large areas of reciprocal space to study\nthe evolution of long- and short-range CDWs with in-plane strains and as a\nfunction of doping. This further allows us to precisely monitor in-situ the\nstructural changes induced by uniaxial pressurization of the crystals for a\nprecise strain estimation in measurements up to $-0.85 \\%$ compression.\nInterestingly, we uncover direct evidence for a competition between long- and\nshort-range CDWs and show that the long-range CDW modulation remains\nincommensurate at all investigated strains and temperatures, showing neither\nsigns of discommensurations nor a pair-density wave component at\n$\\lambda_{\\rm{PDW}} = 2\\lambda_{\\rm{CDW}}$ below $T_c$. We discuss the impact\nof structural disorder and the relationship of our findings to previous reports\non nematicity in high-temperature superconducting cuprates. More generally, our\nresults underscore the potential of strain tuning as a powerful tool for\nprobing and manipulating competing orders in quantum materials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:28:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vinograd","Igor",""],["Souliou","Sofia Michaela",""],["Haghighirad","Amir-Abbas",""],["Lacmann","Tom",""],["Frachet","Mehdi",""],["Merz","Michael",""],["Maraytta","Nour",""],["Garbarino","Gaston",""],["Liu","Yiran",""],["Nakata","Suguru",""],["Ishida","Kousuke",""],["Noad","Hilary M. L.",""],["Minola","Matteo",""],["Keimer","Bernhard",""],["Hicks","Clifford W.",""],["Tacon","Matthieu Le",""]]}
{"id":"2308.08396","submitter":"Denis Kutn\\'ar","authors":"Denis Kutn\\'ar, Ivan R Vogelius, Katrin Elisabet H{\\aa}kansson, Jens\n  Petersen, Jeppe Friborg, Lena Specht, Mogens Bernsdorf, Anita Gothelf, Claus\n  Kristensen, Abraham George Smith","title":"Prediction of post-radiotherapy recurrence volumes in head and neck\n  squamous cell carcinoma using 3D U-Net segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Locoregional recurrences (LRR) are still a frequent site of treatment failure\nfor head and neck squamous cell carcinoma (HNSCC) patients.\n  Identification of high risk subvolumes based on pretreatment imaging is key\nto biologically targeted radiation therapy. We investigated the extent to which\na Convolutional neural network (CNN) is able to predict LRR volumes based on\npre-treatment 18F-fluorodeoxyglucose positron emission tomography\n(FDG-PET)/computed tomography (CT) scans in HNSCC patients and thus the\npotential to identify biological high risk volumes using CNNs.\n  For 37 patients who had undergone primary radiotherapy for oropharyngeal\nsquamous cell carcinoma, five oncologists contoured the relapse volumes on\nrecurrence CT scans. Datasets of pre-treatment FDG-PET/CT, gross tumour volume\n(GTV) and contoured relapse for each of the patients were randomly divided into\ntraining (n=23), validation (n=7) and test (n=7) datasets. We compared a CNN\ntrained from scratch, a pre-trained CNN, a SUVmax threshold approach, and using\nthe GTV directly.\n  The SUVmax threshold method included 5 out of the 7 relapse origin points\nwithin a volume of median 4.6 cubic centimetres (cc). Both the GTV contour and\nbest CNN segmentations included the relapse origin 6 out of 7 times with median\nvolumes of 28 and 18 cc respectively.\n  The CNN included the same or greater number of relapse volume POs, with\nsignificantly smaller relapse volumes. Our novel findings indicate that CNNs\nmay predict LRR, yet further work on dataset development is required to attain\nclinically useful prediction accuracy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:28:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kutn\u00e1r","Denis",""],["Vogelius","Ivan R",""],["H\u00e5kansson","Katrin Elisabet",""],["Petersen","Jens",""],["Friborg","Jeppe",""],["Specht","Lena",""],["Bernsdorf","Mogens",""],["Gothelf","Anita",""],["Kristensen","Claus",""],["Smith","Abraham George",""]]}
{"id":"2308.08397","submitter":"Alan Lew","authors":"Alan Lew","title":"Asymptotic behavior of Laplacian eigenvalues of subspace inclusion\n  graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\text{Fl}_{n,q}$ be the simplicial complex whose vertices are the\nnon-trivial subspaces of $\\mathbb{F}_q^n$ and whose simplices correspond to\nfamilies of subspaces forming a flag. Let $\\Delta^{+}_k(\\text{Fl}_{n,q})$ be\nthe $k$-dimensional weighted upper Laplacian on $ \\text{Fl}_{n,q}$. The\nspectrum of $\\Delta^{+}_k(\\text{Fl}_{n,q})$ was first studied by Garland, who\nobtained a lower bound on its non-zero eigenvalues. Here, we focus on the $k=0$\ncase. We determine the asymptotic behavior of the eigenvalues of\n$\\Delta_{0}^{+}(\\text{Fl}_{n,q})$ as $q$ tends to infinity. In particular, we\nshow that for large enough $q$, $\\Delta_{0}^{+}(\\text{Fl}_{n,q})$ has exactly\n$\\left\\lfloor n^2/4\\right\\rfloor+2$ distinct eigenvalues, and that every\neigenvalue $\\lambda\\neq 0,n-1$ of $\\Delta_{0}^{+}(\\text{Fl}_{n,q})$ tends to\n$n-2$ as $q$ goes to infinity. This solves the $0$-dimensional case of a\nconjecture of Papikian.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:29:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lew","Alan",""]]}
{"id":"2308.08398","submitter":"Xinye Li","authors":"Xinye Li and Christof Melcher","title":"Well-posedness and stability for a class of fourth-order nonlinear\n  parabolic equations","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 examine well-posedness for a class of fourth-order nonlinear\nparabolic equation $\\partial_t u + (-\\Delta)^2 u = \\nabla \\cdot F(\\nabla u)$,\nwhere $F$ satisfies a cubic growth conditions. We establish existence and\nuniqueness of the solution for small initial data in local BMO spaces. In the\ncubic case $F(\\xi) = \\pm \\lvert \\xi \\rvert^2 \\xi$ we also examine the large\ntime behaivour and stability of global solutions for arbitrary and small\ninitial data in VMO, respectively.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:36:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Li","Xinye",""],["Melcher","Christof",""]]}
{"id":"2308.08399","submitter":"Pablo Mart\\'in-Luna","authors":"P. Mart\\'in-Luna, A. Bonatto, C. Bontoiu, G. Xia, J. Resta-L\\'opez","title":"Excitation of wakefields in carbon nanotubes: a hydrodynamic model\n  approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interactions of charged particles with carbon nanotubes may excite\nelectromagnetic modes in the electron gas produced in the cylindrical graphene\nshell constituting the nanotube wall. This wake effect has recently been\nproposed as a potential novel method of short-wavelength high-gradient particle\nacceleration. In this work, the excitation of these wakefields is studied by\nmeans of the linearized hydrodynamic model. In this model, the electronic\nexcitations on the nanotube surface are described treating the electron gas as\na 2D plasma with additional contributions to the fluid momentum equation from\nspecific solid-state properties of the gas. General expressions are derived for\nthe excited longitudinal and transverse wakefields. Numerical results are\nobtained for a charged particle moving within a carbon nanotube, paraxially to\nits axis, showing how the wakefield is affected by parameters such as the\nparticle velocity and its radial position, the nanotube radius, and a friction\nfactor, which can be used as a phenomenological parameter to describe effects\nfrom the ionic lattice. Assuming a particle driver propagating on axis at a\ngiven velocity, optimal parameters were obtained to maximize the longitudinal\nwakefield amplitude.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:39:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mart\u00edn-Luna","P.",""],["Bonatto","A.",""],["Bontoiu","C.",""],["Xia","G.",""],["Resta-L\u00f3pez","J.",""]]}
{"id":"2308.08400","submitter":"Giuliano Basso","authors":"Giuliano Basso","title":"On a problem of Mazur and Sternbach","comments":"revised version; we now only deal with local isometries, the general\n  case remains open","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate Problem 155 form the \"Scottish Book\" due to S. Mazur and L.\nSternbach. In modern terminology they asked if every bijective, locally\nisometric map between two real Banach spaces is always a global isometry.\nRecently, an affirmative answer when the source space is separable was obtained\nby M. Mori, using techniques related to the Mazur-Ulam theorem and its\ngeneralizations. The main purpose of this short note is to offer a different\napproach to Problem 155 motivated by recent advances in metric geometry. We\nshow that it has an affirmative answer under the additional assumption that the\nmap considered is a local isometry.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:40:26 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:24:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Basso","Giuliano",""]]}
{"id":"2308.08401","submitter":"Aaron Johnson","authors":"James Kyle, Justin K. Yim, Kendall Hart, Sarah Bergbreiter, and Aaron\n  M. Johnson","title":"The Simplest Walking Robot: A bipedal robot with one actuator and two\n  rigid bodies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the design and experimental results of the first 1-DOF,\nhip-actuated bipedal robot. While passive dynamic walking is simple by nature,\nmany existing bipeds inspired by this form of walking are complex in control,\nmechanical design, or both. Our design using only two rigid bodies connected by\na single motor aims to enable exploration of walking at smaller sizes where\nmore complex designs cannot be constructed. The walker, \"Mugatu\", is\nself-contained and autonomous, open-loop stable over a range of input\nparameters, able to stop and start from standing, and able to control its\nheading left and right. We analyze the mechanical design and distill down a set\nof design rules that enable these behaviors. Experimental evaluations measure\nspeed, energy consumption, and steering.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:41:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kyle","James",""],["Yim","Justin K.",""],["Hart","Kendall",""],["Bergbreiter","Sarah",""],["Johnson","Aaron M.",""]]}
{"id":"2308.08402","submitter":"Christopher Ness","authors":"Bhanu Prasad Bhowmik and Christopher Ness","title":"Scaling description of frictionless dense suspensions under\n  inhomogeneous flow","comments":"5 pages; 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predicting the rheology of dense suspensions under inhomogeneous flow is\ncrucial in many industrial and geophysical applications, yet the conventional\n`$\\mu(J)$' framework is limited to homogeneous conditions in which the shear\nrate and solids fraction are spatially invariant. To address this shortcoming,\nwe use particle-based simulations of frictionless dense suspensions to derive\nnew constitutive laws that unify the rheological response under both\nhomogeneous and inhomogeneous conditions. By defining a new dimensionless\nnumber associated with particle velocity fluctuations and combining it with the\nviscous number, the macroscopic friction and the solids fraction, we obtain\nscaling relations that collapse data from homogeneous and inhomogeneous\nsimulations. The relations allow prediction of the steady state velocity,\nstress and volume fraction fields using only knowledge of the applied driving\nforce.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:42:53 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bhowmik","Bhanu Prasad",""],["Ness","Christopher",""]]}
{"id":"2308.08404","submitter":"Pietro Sabelli","authors":"Maria Emilia Maietti and Pietro Sabelli","title":"A topological counterpart of well-founded trees in dependent type theory","comments":"To be published in the post-proceedings of the 39th Conference on\n  Mathematical Foundations of Programming Semantics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within dependent type theory, we provide a topological counterpart of\nwell-founded trees (for short, W-types) by using a proof-relevant version of\nthe notion of inductively generated suplattices introduced in the context of\nformal topology under the name of inductively generated basic covers. In more\ndetail, we show, firstly, that in Homotopy Type Theory, W-types and proof\nrelevant inductively generated basic covers are propositionally mutually\nencodable. Secondly, we prove they are definitionally mutually encodable in the\nAgda implementation of intensional Martin-Loef's type theory. Finally, we\nreframe the equivalence in the Minimalist Foundation framework by introducing\nwell-founded predicates as the logical counterpart for predicates of dependent\nW-types. All the results have been checked in the Agda proof-assistant.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:48:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Maietti","Maria Emilia",""],["Sabelli","Pietro",""]]}
{"id":"2308.08405","submitter":"Myeonghyeon Kim","authors":"Myeonghyeon Kim, Junhwan Kwon, Tenzin Rabga, Yong-il Shin","title":"Vortex detection in atomic Bose-Einstein condensates using neural\n  networks trained on synthetic images","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum vortices in atomic Bose-Einstein condensates (BECs) are topological\ndefects characterized by quantized circulation of particles around them. In\nexperimental studies, vortices are commonly detected by time-of-flight imaging,\nwhere their density-depleted cores are enlarged. In this work, we describe a\nmachine learning-based method for detecting vortices in experimental BEC\nimages, particularly focusing on turbulent condensates containing irregularly\ndistributed vortices. Our approach employs a convolutional neural network (CNN)\ntrained solely on synthetic simulated images, eliminating the need for manual\nlabeling of the vortex positions as ground truth. We find that the CNN achieves\naccurate vortex detection in real experimental images, thereby facilitating\nanalysis of large experimental datasets without being constrained by specific\nexperimental conditions. This novel approach represents a significant\nadvancement in studying quantum vortex dynamics and streamlines the analysis\nprocess in the investigation of turbulent BECs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:49:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kim","Myeonghyeon",""],["Kwon","Junhwan",""],["Rabga","Tenzin",""],["Shin","Yong-il",""]]}
{"id":"2308.08406","submitter":"Puskal Khadka","authors":"Puskal Khadka and Prabhav Lamichhane","title":"Content-based Recommendation Engine for Video Streaming Platform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommendation engine suggest content, product or services to the user by\nusing machine learning algorithm. This paper proposed a content-based\nrecommendation engine for providing video suggestion to the user based on their\nprevious interests and choices. We will use TF-IDF text vectorization method to\ndetermine the relevance of words in a document. Then we will find out the\nsimilarity between each content by calculating cosine similarity between them.\nFinally, engine will recommend videos to the users based on the obtained\nsimilarity score value. In addition, we will measure the engine's performance\nby computing precision, recall, and F1 core of the proposed system.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:50:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Khadka","Puskal",""],["Lamichhane","Prabhav",""]]}
{"id":"2308.08407","submitter":"Munib Mesinovic","authors":"Munib Mesinovic, Peter Watkinson, Tingting Zhu","title":"Explainable AI for clinical risk prediction: a survey of concepts,\n  methods, and modalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advancements in AI applications to healthcare have shown incredible\npromise in surpassing human performance in diagnosis and disease prognosis.\nWith the increasing complexity of AI models, however, concerns regarding their\nopacity, potential biases, and the need for interpretability. To ensure trust\nand reliability in AI systems, especially in clinical risk prediction models,\nexplainability becomes crucial. Explainability is usually referred to as an AI\nsystem's ability to provide a robust interpretation of its decision-making\nlogic or the decisions themselves to human stakeholders. In clinical risk\nprediction, other aspects of explainability like fairness, bias, trust, and\ntransparency also represent important concepts beyond just interpretability. In\nthis review, we address the relationship between these concepts as they are\noften used together or interchangeably. This review also discusses recent\nprogress in developing explainable models for clinical risk prediction,\nhighlighting the importance of quantitative and clinical evaluation and\nvalidation across multiple common modalities in clinical practice. It\nemphasizes the need for external validation and the combination of diverse\ninterpretability methods to enhance trust and fairness. Adopting rigorous\ntesting, such as using synthetic datasets with known generative factors, can\nfurther improve the reliability of explainability methods. Open access and\ncode-sharing resources are essential for transparency and reproducibility,\nenabling the growth and trustworthiness of explainable research. While\nchallenges exist, an end-to-end approach to explainability in clinical risk\nprediction, incorporating stakeholders from clinicians to developers, is\nessential for success.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:51:51 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Mesinovic","Munib",""],["Watkinson","Peter",""],["Zhu","Tingting",""]]}
{"id":"2308.08408","submitter":"Chuwen Ma","authors":"Shi Jin and Nana Liu and Chuwen Ma","title":"Quantum simulation of Maxwell's equations via Schr\\\"odingersation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present quantum algorithms for electromagnetic fields governed by\nMaxwell's equations. The algorithms are based on the Schr\\\"odingersation\napproach, which transforms any linear PDEs and ODEs with non-unitary dynamics\ninto a system evolving under unitary dynamics, via a warped phase\ntransformation that maps the equation into one higher dimension. In this paper,\nour quantum algorithms are based on either a direct approximation of Maxwell's\nequations combined with Yee's algorithm, or a matrix representation in terms of\nRiemann-Silberstein vectors combined with a spectral approach and an upwind\nscheme. We implement these algorithms with physical boundary conditions,\nincluding perfect conductor and impedance boundaries. We also solve Maxwell's\nequations for a linear inhomogeneous medium, specifically the interface\nproblem. Several numerical experiments are performed to demonstrate the\nvalidity of this approach. In addition, instead of qubits, the quantum\nalgorithms can also be formulated in the continuous variable quantum framework,\nwhich allows the quantum simulation of Maxwell's equations in analog quantum\nsimulation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:52:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jin","Shi",""],["Liu","Nana",""],["Ma","Chuwen",""]]}
{"id":"2308.08409","submitter":"Serena Vinciguerra","authors":"Serena Vinciguerra, Tuomo Salmi, Anna L. Watts, Devarshi Choudhury,\n  Yves Kini, Thomas E. Riley","title":"X-PSI Parameter Recovery for Temperature Map Configurations Inspired by\n  PSR J0030+0451","comments":"27 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last few years, the NICER collaboration has provided mass and radius\ninferences, via pulse profile modeling, for two pulsars: PSR J0030+0451 and PSR\nJ0740+6620. Given the importance of these results for constraining the equation\nof state of dense nuclear matter, it is crucial to validate them and test their\nrobustness. We therefore explore the reliability of these results and their\nsensitivity to analysis settings and random processes, including noise,\nfocusing on the specific case of PSR J0030+0451. We use X-PSI, one of the two\nmain analysis pipelines currently employed by the NICER collaboration for mass\nand radius inferences. With synthetic data that mimic the PSR J0030+0451 NICER\ndata set, we evaluate the recovery performances of X-PSI under conditions never\ntested before, including complex modeling of the thermally emitting neutron\nstar surface. For the test cases explored, our results suggest that X-PSI is\ncapable of recovering the true mass and radius within reasonable credible\nintervals. This work also reveals the main vulnerabilities of the analysis: a\nsignificant dependence on noise and the presence of multi-modal structure in\nthe posterior surface. Noise particularly impacts our sensitivity to the\nanalysis settings and widths of the posterior distributions. The multi-modal\nstructure in the posterior suggests that biases could be present if the\nanalysis is unable to exhaustively explore the parameter space. Convergence\ntesting, to ensure an adequate coverage of the parameter space and a suitable\nrepresentation of the posterior distribution, is one possible solution to these\nchallenges.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:55:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vinciguerra","Serena",""],["Salmi","Tuomo",""],["Watts","Anna L.",""],["Choudhury","Devarshi",""],["Kini","Yves",""],["Riley","Thomas E.",""]]}
{"id":"2308.08410","submitter":"Thomas Grandits","authors":"Thomas Grandits, Jan Verh\\\"ulsdonk, Gundolf Haase, Alexander Effland,\n  Simone Pezzuto","title":"Digital twinning of cardiac electrophysiology models from the surface\n  ECG: a geodesic backpropagation approach","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The eikonal equation has become an indispensable tool for modeling cardiac\nelectrical activation accurately and efficiently. In principle, by matching\nclinically recorded and eikonal-based electrocardiograms (ECGs), it is possible\nto build patient-specific models of cardiac electrophysiology in a purely\nnon-invasive manner. Nonetheless, the fitting procedure remains a challenging\ntask. The present study introduces a novel method, Geodesic-BP, to solve the\ninverse eikonal problem. Geodesic-BP is well-suited for GPU-accelerated machine\nlearning frameworks, allowing us to optimize the parameters of the eikonal\nequation to reproduce a given ECG. We show that Geodesic-BP can reconstruct a\nsimulated cardiac activation with high accuracy in a synthetic test case, even\nin the presence of modeling inaccuracies. Furthermore, we apply our algorithm\nto a publicly available dataset of a rabbit model, with very positive results.\nGiven the future shift towards personalized medicine, Geodesic-BP has the\npotential to help in future functionalizations of cardiac models meeting\nclinical time constraints while maintaining the physiological accuracy of\nstate-of-the-art cardiac models.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:57:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Grandits","Thomas",""],["Verh\u00fclsdonk","Jan",""],["Haase","Gundolf",""],["Effland","Alexander",""],["Pezzuto","Simone",""]]}
{"id":"2308.08411","submitter":"Yu Deng","authors":"Yu Deng, Andrea R. Nahmod and Haitian Yue","title":"The probabilistic scaling paradigm","comments":"Expository paper, 14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note we further discuss the probabilistic scaling introduced by the\nauthors in [21, 22]. In particular we do a case study comparing the stochastic\nheat equation, the nonlinear wave equation and the nonlinear Schrodinger\nequation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:57:59 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Deng","Yu",""],["Nahmod","Andrea R.",""],["Yue","Haitian",""]]}
{"id":"2308.08412","submitter":"Arkady Pikovsky","authors":"Arkady Pikovsky","title":"Deterministic active particles in the overactive limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider two models of deterministic active particles in an external\npotential. In the limit where the speed of a particle is fixed, both models\ncoincide and can be formulated as a Hamiltonian system, but only if the\npotential is time-independent. If the particles are identical, their\ninteraction via a potential force leads to conservative dynamics with a\nconserved phase volume. In contrast, the phase volume is shown to shrink for\nnon-identical particles.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:58:01 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pikovsky","Arkady",""]]}
{"id":"2308.08413","submitter":"Hoda Eldardiry","authors":"Jiaying Gong, Wei-Te Chen, Hoda Eldardiry","title":"Knowledge-Enhanced Multi-Label Few-Shot Product Attribute-Value\n  Extraction","comments":"6 pages, 2 figures, published in CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3615142","report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing attribute-value extraction (AVE) models require large quantities of\nlabeled data for training. However, new products with new attribute-value pairs\nenter the market every day in real-world e-Commerce. Thus, we formulate AVE in\nmulti-label few-shot learning (FSL), aiming to extract unseen attribute value\npairs based on a small number of training examples. We propose a\nKnowledge-Enhanced Attentive Framework (KEAF) based on prototypical networks,\nleveraging the generated label description and category information to learn\nmore discriminative prototypes. Besides, KEAF integrates with hybrid attention\nto reduce noise and capture more informative semantics for each class by\ncalculating the label-relevant and query-related weights. To achieve\nmulti-label inference, KEAF further learns a dynamic threshold by integrating\nthe semantic information from both the support set and the query set. Extensive\nexperiments with ablation studies conducted on two datasets demonstrate that\nKEAF outperforms other SOTA models for information extraction in FSL. The code\ncan be found at: https://github.com/gjiaying/KEAF\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:58:12 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gong","Jiaying",""],["Chen","Wei-Te",""],["Eldardiry","Hoda",""]]}
{"id":"2308.08414","submitter":"Xiao Liu","authors":"Guangyi Chen, Xiao Liu, Guangrun Wang, Kun Zhang, Philip H.S.Torr,\n  Xiao-Ping Zhang, Yansong Tang","title":"Tem-adapter: Adapting Image-Text Pretraining for Video Question Answer","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video-language pre-trained models have shown remarkable success in guiding\nvideo question-answering (VideoQA) tasks. However, due to the length of video\nsequences, training large-scale video-based models incurs considerably higher\ncosts than training image-based ones. This motivates us to leverage the\nknowledge from image-based pretraining, despite the obvious gaps between image\nand video domains. To bridge these gaps, in this paper, we propose Tem-Adapter,\nwhich enables the learning of temporal dynamics and complex semantics by a\nvisual Temporal Aligner and a textual Semantic Aligner. Unlike conventional\npretrained knowledge adaptation methods that only concentrate on the downstream\ntask objective, the Temporal Aligner introduces an extra language-guided\nautoregressive task aimed at facilitating the learning of temporal\ndependencies, with the objective of predicting future states based on\nhistorical clues and language guidance that describes event progression.\nBesides, to reduce the semantic gap and adapt the textual representation for\nbetter event description, we introduce a Semantic Aligner that first designs a\ntemplate to fuse question and answer pairs as event descriptions and then\nlearns a Transformer decoder with the whole video sequence as guidance for\nrefinement. We evaluate Tem-Adapter and different pre-train transferring\nmethods on two VideoQA benchmarks, and the significant performance improvement\ndemonstrates the effectiveness of our method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:00:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Guangyi",""],["Liu","Xiao",""],["Wang","Guangrun",""],["Zhang","Kun",""],["Torr","Philip H. S.",""],["Zhang","Xiao-Ping",""],["Tang","Yansong",""]]}
{"id":"2308.08415","submitter":"Beyhan Pulice","authors":"Beyhan Puli\\c{c}e, Reggie C. Pantig, Ali \\\"Ovg\\\"un, Durmu\\c{s} Demir","title":"Constraints on charged Symmergent black hole from shadow and lensing","comments":"20 pages, 8 figures. Accepted for publication in Classical and\n  Quantum Gravity, \"Special Issue: Focus on Quantum Gravity Phenomenology in\n  the Multi-Messenger Era: Challenges and Perspectives\"","journal-ref":null,"doi":"10.1088/1361-6382/acf08c","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we report on exact charged black hole solutions in symmergent\ngravity with Maxwell field. Symmergent gravity induces the gravitational\nconstant $G$, quadratic curvature coefficient $c_{\\rm O}$, and the vacuum\nenergy $V_{\\rm O}$ from the flat spacetime matter loops. In the limit in which\nall fields are degenerate in mass, the vacuum energy $V_{\\rm O}$ can be\nexpressed in terms of $G$ and $c_{\\rm O}$. We parametrize deviation from this\nlimit by a parameter ${\\hat \\alpha}$ such that the black hole spacetime is dS\nfor ${\\hat \\alpha} < 1$ and AdS for ${\\hat \\alpha} > 1$. In our analysis, we\nstudy horizon formation, shadow cast and gravitational lensing as functions of\nthe black hole charge, and find that there is an upper bound on the charge. At\nrelatively low values of charge, applicable to astronomical black holes, we\ndetermine constraints on $c_{\\rm O}$ and ${\\hat \\alpha}$ using the EHT data\nfrom Sgr. A* and M87*. We apply these constraints to reveal how the shadow\nradius behaves as the observer distance $r_O$ varies. It is revealed that black\nhole charge directly influences the shadow silhouette, but the symmergent\nparameters have a tenuous effect. We also explored the weak field regime by\nusing the Gauss-Bonnet theorem to study the weak deflection angle caused by the\nM87* black hole. We have found that impact parameters comparable to the actual\ndistance $D = 16.8$ Mpc show the potential detectability of such an angle\nthrough advanced astronomical telescopes. Overall, our results provide new\ninsights into the behavior of charged black holes in the context of symmergent\ngravity and offer a new way to test these theories against observational data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:01:04 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Puli\u00e7e","Beyhan",""],["Pantig","Reggie C.",""],["\u00d6vg\u00fcn","Ali",""],["Demir","Durmu\u015f",""]]}
{"id":"2308.08416","submitter":"Amar Fakhredine","authors":"Amar Fakhredine, Raghottam M. Sattigeri, Giuseppe Cuono, Carmine\n  Autieri","title":"Interplay between altermagnetism and nonsymmorphic symmetries generating\n  large anomalous Hall conductivity by semi-Dirac points induced anticrossings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the interplay between altermagnetic spin-splitting and\nnonsymmorphic symmetries using the space group no. 62 as a testbed. Studying\ndifferent magnetic orders by means of first-principles calculations, we find\nthat the altermagnetism (AM) is present in the C-type magnetic configuration\nwhile it is absent for the G-type and A-type configurations due to different\nmagnetic space group types. The nonsymmorphic symmetries constrain the system\nto a four-fold degeneracy at the border of the Brillouin zone with semi-Dirac\ndispersion. In the case of large hybridization as for transition metal\npnictides, the interplay between AM and nonsymmorphic symmetries generates an\nintricate network of several crossings and anticrossings that we describe in\nterms of semi-Dirac points and glide symmetries. When we add the spin-orbit\ncoupling (SOC), we find a Neel-vector dependent spin-orbit splitting at the\ntime-reversal invariant momenta points since the magnetic space groups depend\non the Neel vector. The magnetic space group type-I produces antiferromagnetic\nhourglass electrons that disappear in the type-III. When the Neel vector is\nalong x, we observe a glide-protected crossing that could generate a nodal-line\nin the altermagnetic phase. The SOC splits the remaining band crossings and\nband anticrossings producing a large anomalous Hall effect in all directions\nexcluding the Neel-vector direction\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:02:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Fakhredine","Amar",""],["Sattigeri","Raghottam M.",""],["Cuono","Giuseppe",""],["Autieri","Carmine",""]]}
{"id":"2308.08417","submitter":"Phuong Nguyen","authors":"Phuong Nguyen, Pratik Nayak, Hartwig Anzt","title":"Porting Batched Iterative Solvers onto Intel GPUs with SYCL","comments":"9 pages, 8 figures, submitted to the P3HPC Workshop at SC23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Batched linear solvers play a vital role in computational sciences,\nespecially in the fields of plasma physics and combustion simulations. With the\nimminent deployment of the Aurora Supercomputer and other upcoming systems\nequipped with Intel GPUs, there is a compelling demand to expand the\ncapabilities of these solvers for Intel GPU architectures. In this paper, we\npresent our efforts in porting and optimizing the batched iterative solvers on\nIntel GPUs using the SYCL programming model. The SYCL-based implementation\nexhibits impressive performance and scalability on the Intel GPU Max 1550s\n(Ponte Vecchio GPUs). The solvers outperform our previous CUDA implementation\non NVIDIA H100 GPUs by an average of 2.4x for the PeleLM application inputs.\nThe batched solvers are ready for production use in real-world scientific\napplications through the Ginkgo library.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:05:13 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 15:49:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nguyen","Phuong",""],["Nayak","Pratik",""],["Anzt","Hartwig",""]]}
{"id":"2308.08418","submitter":"Ivan Amelio","authors":"Ivan Amelio, Nathan Goldman","title":"Lasing, quantum geometry and coherence in non-Hermitian flat bands","comments":"Added Ref. 17,18,22","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that lasing in flat band lattices can be stabilized by means of the\ngeometrical properties of the Bloch states, in settings where the\nsingle-particle dispersion is flat in both its real and imaginary parts. We\nillustrate a general projection method and compute the collective excitations,\nwhich are shown to display a diffusive behavior ruled by quantum geometry\nthrough a peculiar coefficient involving gain, losses and interactions. Then,\nwe analytically show that the phase dynamics display a surprising cancellation\nof the Kardar-Parisi-Zhang nonlinearity at the leading order. Because of the\nrelevance of Kardar-Parisi-Zhang universality in one-dimensional geometries, we\nfocus our study on the diamond chain and provide confirmation of these results\nthrough full numerical simulations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:06:28 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 09:24:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Amelio","Ivan",""],["Goldman","Nathan",""]]}
{"id":"2308.08419","submitter":"Doron Cohen","authors":"Ben Avnit, Doron Cohen","title":"Quantum walk in stochastic environment","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a quantized version of the Sinai-Derrida model for \"random walk\nin random environment\". The model is defined in terms of a Lindblad master\nequation. For a ring geometry (a chain with periodic boundary condition) it\nfeatures a delocalization-transition as the bias in increased beyond a critical\nvalue, indicating that the relaxation becomes under-damped. Counter\nintuitively, the effective disorder is enhanced due to coherent hopping. We\nanalyze in detail this enhancement and its dependence on the model parameters.\nThe non-monotonic dependence of the Lindbladian spectrum on the rate of the\ncoherent transitions is highlighted.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:06:39 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Avnit","Ben",""],["Cohen","Doron",""]]}
{"id":"2308.08420","submitter":"Carlos Ra\\'ul Arg\\\"uelles","authors":"Carlos R. Arg\\\"uelles and Santiago Collazo","title":"Galaxy Rotation Curve Fitting Using Machine Learning Tools","comments":"10 pages, 5 figures, 1 Table. Published in Universe","journal-ref":null,"doi":"10.3390/universe9080372","report-no":null,"categories":"astro-ph.GA gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Galaxy rotation curve (RC) fitting is an important technique which allows the\nplacement of constraints on different kinds of dark matter (DM) halo models. In\nthe case of non-phenomenological DM profiles with no analytic expressions, the\nart of finding RC best-fits including the full baryonic $+$ DM free parameters\ncan be difficult and time-consuming. In the present work, we use a gradient\ndescent method used in the backpropagation process of training a neural\nnetwork, to fit the so-called Grand Rotation Curve of the Milky Way (MW)\nranging from $\\sim$1 pc all the way to $\\sim$$10^5$ pc. We model the mass\ndistribution of our Galaxy including a bulge (inner $+$ main), a disk, and a\nfermionic dark matter (DM) halo known as the Ruffini-Arg\\\"uelles-Rueda (RAR)\nmodel. This is a semi-analytical model built from first-principle physics such\nas (quantum) statistical mechanics and thermodynamics, whose more general\ndensity profile has a dense core -- diluted halo morphology with no analytic\nexpression. As shown recently and further verified here, the dark and compact\nfermion-core can work as an alternative to the central black hole in SgrA* when\nincluding data at milliparsec scales from the S-cluster stars. Thus, we show\nthe ability of this state-of-the-art machine learning tool in providing the\nbest-fit parameters to the overall MW RC in the $10^{-2}$--$10^5$ pc range, in\na few hours of CPU time.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:08:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Arg\u00fcelles","Carlos R.",""],["Collazo","Santiago",""]]}
{"id":"2308.08421","submitter":"Satyam Anand","authors":"Satyam Anand, Xiaolei Ma, Shuo Guo, Stefano Martiniani, Xiang Cheng","title":"Bacteria Through Obstacles: Unifying Fluxes, Entropy Production, and\n  Extractable Work in Living Active Matter","comments":"19 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Thermodynamic equilibrium is a unique state characterized by time-reversal\nsymmetry, which enforces zero fluxes and prohibits work extraction from a\nsingle thermal bath. By virtue of being microscopically out of equilibrium,\nactive matter challenges these defining characteristics of thermodynamic\nequilibrium. Although time irreversibility, fluxes, and extractable work have\nbeen observed separately in various non-equilibrium systems, a comprehensive\nunderstanding of these quantities and their interrelationship in the context of\nliving matter remains elusive. Here, by combining experiments, simulations, and\ntheory, we study the correlation between these three quantities in a single\nsystem consisting of swimming Escherichia coli navigating through funnel-shaped\nobstacles. We show that the interplay between geometric constraints and\nbacterial swimming breaks time-reversal symmetry, leading to the emergence of\nlocal mass fluxes. Using an harmonically trapped colloid coupled weakly to\nbacterial motion, we demonstrate that the amount of extractable work depends on\nthe deviation from equilibrium as quantified by fluxes and entropy production.\nWe propose a minimal mechanical model and a generalized mass transfer relation\nfor bacterial rectification that quantitatively explains experimental\nobservations. Our study provides a microscopic understanding of bacterial\nrectification and uncovers the intrinsic relation between time irreversibility,\nfluxes, and extractable work in living systems far from equilibrium.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:08:39 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Anand","Satyam",""],["Ma","Xiaolei",""],["Guo","Shuo",""],["Martiniani","Stefano",""],["Cheng","Xiang",""]]}
{"id":"2308.08422","submitter":"Anton Kozyriev","authors":"Vladimir Norkin, Alois Pichler, Anton Kozyriev","title":"Constrained Global Optimization by Smoothing","comments":"17 pages, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a novel technique called \"successive stochastic\nsmoothing\" that optimizes nonsmooth and discontinuous functions while\nconsidering various constraints. Our methodology enables local and global\noptimization, making it a powerful tool for many applications. First, a\nconstrained problem is reduced to an unconstrained one by the exact nonsmooth\npenalty function method, which does not assume the existence of the objective\nfunction outside the feasible area and does not require the selection of the\npenalty coefficient. This reduction is exact in the case of minimization of a\nlower semicontinuous function under convex constraints. Then the resulting\nobjective function is sequentially smoothed by the kernel method starting from\nrelatively strong smoothing and with a gradually vanishing degree of smoothing.\nThe finite difference stochastic gradient descent with trajectory averaging\nminimizes each smoothed function locally. Finite differences over stochastic\ndirections sampled from the kernel estimate the stochastic gradients of the\nsmoothed functions. We investigate the convergence rate of such stochastic\nfinite-difference method on convex optimization problems. The \"successive\nsmoothing\" algorithm uses the results of previous optimization runs to select\nthe starting point for optimizing a consecutive, less smoothed function.\nSmoothing provides the \"successive smoothing\" method with some global\nproperties. We illustrate the performance of the \"successive stochastic\nsmoothing\" method on test-constrained optimization problems from the\nliterature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:11:06 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Norkin","Vladimir",""],["Pichler","Alois",""],["Kozyriev","Anton",""]]}
{"id":"2308.08423","submitter":"Maximilian Siebel","authors":"Sergio Brenner Miguel and Jan Johannes and Maximilian Siebel","title":"Multiplicative deconvolution under unknown error distribution","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 consider a multiplicative deconvolution problem, in which the density $f$\nor the survival function $S^X$ of a strictly positive random variable $X$ is\nestimated nonparametrically based on an i.i.d. sample from a noisy observation\n$Y = X\\cdot U$ of $X$. The multiplicative measurement error $U$ is supposed to\nbe independent of $X$. The objective of this work is to construct a fully\ndata-driven estimation procedure when the error density $f^U$ is unknown. We\nassume that in addition to the i.i.d. sample from $Y$, we have at our disposal\nan additional i.i.d. sample drawn independently from the error distribution.\nThe proposed estimation procedure combines the estimation of the Mellin\ntransformation of the density $f$ and a regularisation of the inverse of the\nMellin transform by a spectral cut-off. The derived risk bounds and oracle-type\ninequalities cover both - the estimation of the density $f$ as well as the\nsurvival function $S^X$. The main issue addressed in this work is the\ndata-driven choice of the cut-off parameter using a model selection approach.\nWe discuss conditions under which the fully data-driven estimator can attain\nthe oracle-risk up to a constant without any previous knowledge of the error\ndistribution. We compute convergences rates under classical smoothness\nassumptions. We illustrate the estimation strategy by a simulation study with\ndifferent choices of distributions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:11:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Miguel","Sergio Brenner",""],["Johannes","Jan",""],["Siebel","Maximilian",""]]}
{"id":"2308.08424","submitter":"Kieran Stuart","authors":"Kieran A. Stuart, Scott G. Gregory","title":"X-ray emission from pre-main sequence stars with multipolar magnetic\n  fields","comments":"13 pages with 13 figures, plus 1 page with 1 figure in the appendix,\n  accepted for publication in MNRAS 2023 August 04","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The large-scale magnetic fields of several pre-main sequence (PMS) stars have\nbeen observed to be simple and axisymmetric, dominated by tilted dipole and\noctupole components. The magnetic fields of other PMS stars are highly\nmultipolar and dominantly non-axisymmetric. Observations suggest that the\nmagnetic field complexity increases as PMS stars evolve from Hayashi to Henyey\ntracks in the Hertzsprung--Russell diagram. Independent observations have\nrevealed that X-ray luminosity decreases with age during PMS evolution, with\nHenyey track PMS stars having lower fractional X-ray luminosities\n($L_\\textrm{X}/L_*$) compared to Hayashi track stars. We investigate how\nchanges in the large-scale magnetic field topology of PMS stars influences\ncoronal X-ray emission. We construct coronal models assuming pure axisymmetric\nmultipole magnetic fields, and magnetic fields consisting of a dipole plus an\noctupole component only. We determine the closed coronal emitting volume, over\nwhich X-ray emitting plasma is confined, using a pressure balance argument.\nFrom the coronal volumes we determine X-ray luminosities. We find that\n$L_\\textrm{X}$ decreases as the degree $\\ell$ of the multipole field increases.\nFor dipole plus octupole magnetic fields we find that $L_\\textrm{X}$ tends to\ndecrease as the octupole component becomes more dominant. By fixing the stellar\nparameters at values appropriate for a solar mass PMS star, varying the\nmagnetic field topology results in two orders of magnitude variation in\n$L_\\textrm{X}$. Our results support the idea that the decrease in\n$L_\\textrm{X}$ as PMS stars age can be driven by an increase in the complexity\nof the large-scale magnetic field.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:13:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Stuart","Kieran A.",""],["Gregory","Scott G.",""]]}
{"id":"2308.08425","submitter":"Yerbol Palzhanov","authors":"Yifei Wang, Yerbol Palzhanov, Dang Thien Dang, Annalisa Quaini, Maxim\n  Olshanskii, Sheereen Majd","title":"On fusogenicity of positively charged phased-separated lipid vesicles:\n  experiments and computational simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cs.NA math.NA physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the fusogenicity of cationic liposomes in relation to\ntheir surface distribution of cationic lipids and utilizes membrane phase\nseparation to control this surface distribution. It is found that concentrating\nthe cationic lipids into small surface patches on liposomes, through\nphase-separation, can enhance liposome's fusogenicity. Further concentrating\nthese lipids into smaller patches on the surface of liposomes led to an\nincreased level of fusogenicity. These experimental findings are supported by\nnumerical simulations using a mathematical model for phase-separated charged\nliposomes. Findings of this study may be used for design and development of\nhighly fusogenic liposomes with minimal level of toxicity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:16:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Yifei",""],["Palzhanov","Yerbol",""],["Dang","Dang Thien",""],["Quaini","Annalisa",""],["Olshanskii","Maxim",""],["Majd","Sheereen",""]]}
{"id":"2308.08426","submitter":"Alex Oshin","authors":"Alex Oshin, Evangelos A. Theodorou","title":"Differentiable Robust Model Predictive Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deterministic model predictive control (MPC), while powerful, is often\ninsufficient for effectively controlling autonomous systems in the real-world.\nFactors such as environmental noise and model error can cause deviations from\nthe expected nominal performance. Robust MPC algorithms aim to bridge this gap\nbetween deterministic and uncertain control. However, these methods are often\nexcessively difficult to tune for robustness due to the nonlinear and\nnon-intuitive effects that controller parameters have on performance. To\naddress this challenge, a unifying perspective on differentiable optimization\nfor control is presented, which enables derivation of a general, differentiable\ntube-based MPC algorithm. The proposed approach facilitates the automatic and\nreal-time tuning of robust controllers in the presence of large uncertainties\nand disturbances.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:17:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Oshin","Alex",""],["Theodorou","Evangelos A.",""]]}
{"id":"2308.08427","submitter":"Ziteng Cheng","authors":"Ziteng Cheng and Anthony Coache and Sebastian Jaimungal","title":"Eliciting Risk Aversion with Inverse Reinforcement Learning via\n  Interactive Questioning","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":"  This paper proposes a novel framework for identifying an agent's risk\naversion using interactive questioning. Our study is conducted in two\nscenarios: a one-period case and an infinite horizon case. In the one-period\ncase, we assume that the agent's risk aversion is characterized by a cost\nfunction of the state and a distortion risk measure. In the infinite horizon\ncase, we model risk aversion with an additional component, a discount factor.\nAssuming the access to a finite set of candidates containing the agent's true\nrisk aversion, we show that asking the agent to demonstrate her optimal\npolicies in various environment, which may depend on their previous answers, is\nan effective means of identifying the agent's risk aversion. Specifically, we\nprove that the agent's risk aversion can be identified as the number of\nquestions tends to infinity, and the questions are randomly designed. We also\ndevelop an algorithm for designing optimal questions and provide empirical\nevidence that our method learns risk aversion significantly faster than\nrandomly designed questions in simulations. Our framework has important\napplications in robo-advising and provides a new approach for identifying an\nagent's risk preferences.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:17:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cheng","Ziteng",""],["Coache","Anthony",""],["Jaimungal","Sebastian",""]]}
{"id":"2308.08428","submitter":"Kaicheng Yang","authors":"Kaicheng Yang, Jiankang Deng, Xiang An, Jiawei Li, Ziyong Feng, Jia\n  Guo, Jing Yang, Tongliang Liu","title":"ALIP: Adaptive Language-Image Pre-training with Synthetic Caption","comments":"15pages, 10figures, ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Contrastive Language-Image Pre-training (CLIP) has significantly boosted the\nperformance of various vision-language tasks by scaling up the dataset with\nimage-text pairs collected from the web. However, the presence of intrinsic\nnoise and unmatched image-text pairs in web data can potentially affect the\nperformance of representation learning. To address this issue, we first utilize\nthe OFA model to generate synthetic captions that focus on the image content.\nThe generated captions contain complementary information that is beneficial for\npre-training. Then, we propose an Adaptive Language-Image Pre-training (ALIP),\na bi-path model that integrates supervision from both raw text and synthetic\ncaption. As the core components of ALIP, the Language Consistency Gate (LCG)\nand Description Consistency Gate (DCG) dynamically adjust the weights of\nsamples and image-text/caption pairs during the training process. Meanwhile,\nthe adaptive contrastive loss can effectively reduce the impact of noise data\nand enhances the efficiency of pre-training data. We validate ALIP with\nexperiments on different scales of models and pre-training datasets.\nExperiments results show that ALIP achieves state-of-the-art performance on\nmultiple downstream tasks including zero-shot image-text retrieval and linear\nprobe. To facilitate future research, the code and pre-trained models are\nreleased at https://github.com/deepglint/ALIP.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:19:52 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 04:04:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Kaicheng",""],["Deng","Jiankang",""],["An","Xiang",""],["Li","Jiawei",""],["Feng","Ziyong",""],["Guo","Jia",""],["Yang","Jing",""],["Liu","Tongliang",""]]}
{"id":"2308.08429","submitter":"Damon Beveridge","authors":"Damon Beveridge, Linqing Wen, Andreas Wicenec","title":"Detection of Binary Black Hole Mergers from the Signal-to-Noise Ratio\n  Time Series Using Deep Learning","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gravitational wave detection has opened up new avenues for exploring and\nunderstanding some of the fundamental principles of the universe. The optimal\nmethod for detecting modelled gravitational-wave events involves template-based\nmatched filtering and doing a multi-detector search in the resulting\nsignal-to-noise ratio time series. In recent years, advancements in machine\nlearning and deep learning have led to a flurry of research into using these\ntechniques to replace matched filtering searches and for efficient and robust\nparameter estimation. This paper presents a novel approach that utilizes deep\nlearning techniques to detect gravitational waves from the signal-to-noise\nratio time series produced from matched filtering. We do this to investigate if\nan efficient deep-learning model could replace the computationally expensive\npost-processing in current search pipelines. We present a feasibility study\nwhere we look to detect gravitational waves from binary black hole mergers in\nsimulated stationary Gaussian noise from the LIGO detector in Hanford,\nWashington. We show that our model can match the performance of a\nsingle-detector matched filtering search and that the ranking statistic from\nthe output of our model was robust over unseen noise, exhibiting promising\nresults for practical online implementation in the future. We discuss the\npossible implications of this work and its future applications to\ngravitational-wave detection.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:20:22 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 07:03:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beveridge","Damon",""],["Wen","Linqing",""],["Wicenec","Andreas",""]]}
{"id":"2308.08430","submitter":"Ross Hyman","authors":"Ross Hyman, Deb Otis, Seamus Allen, and Greg Dennis","title":"A Majority Rule Philosophy for Instant Runoff Voting","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the concept of ordered majority rule, a property of Instant Runoff\nVoting, and compare it to the familiar concept of pairwise majority rule of\nCondorcet methods. Ordered majority rule establishes a social order among the\ncandidates such that that relative order between any two candidates is\ndetermined by voters who do not prefer another major candidate. It ensures the\nelection of a candidate from the majority party or coalition while preventing\nan antagonistic opposition party or coalition from influencing which candidate\nthat may be. We show how IRV is the only voting method to satisfy ordered\nmajority rule, for a self-consistently determined distinction between major and\nminor candidates, and that ordered majority rule is incompatible with the\nproperties of Condorcet compliance, independence of irrelevant alternatives,\nand monotonicity. Finally, we present some arguments as to why ordered majority\nrule may be preferable to pairwise majority rule, using the 2022 Alaska special\ncongressional election as a case study.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:20:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hyman","Ross",""],["Otis","Deb",""],["Allen","Seamus",""],["Dennis","Greg",""]]}
{"id":"2308.08431","submitter":"Aishwarya Venkataramanan","authors":"Aishwarya Venkataramanan and Martin Laviale and C\\'edric Pradalier","title":"Integrating Visual and Semantic Similarity Using Hierarchies for Image\n  Retrieval","comments":"Accepted in ICVS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Most of the research in content-based image retrieval (CBIR) focus on\ndeveloping robust feature representations that can effectively retrieve\ninstances from a database of images that are visually similar to a query.\nHowever, the retrieved images sometimes contain results that are not\nsemantically related to the query. To address this, we propose a method for\nCBIR that captures both visual and semantic similarity using a visual\nhierarchy. The hierarchy is constructed by merging classes with overlapping\nfeatures in the latent space of a deep neural network trained for\nclassification, assuming that overlapping classes share high visual and\nsemantic similarities. Finally, the constructed hierarchy is integrated into\nthe distance calculation metric for similarity search. Experiments on standard\ndatasets: CUB-200-2011 and CIFAR100, and a real-life use case using diatom\nmicroscopy images show that our method achieves superior performance compared\nto the existing methods on image retrieval.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:23:14 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Venkataramanan","Aishwarya",""],["Laviale","Martin",""],["Pradalier","C\u00e9dric",""]]}
{"id":"2308.08432","submitter":"Alexander G. Tumanov","authors":"Benjamin Basso, Alexander G. Tumanov","title":"Wilson Loop Duality and OPE for Super Form Factors of Half-BPS Operators","comments":"54 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a dual Wilson loop description for the MHV super form factors of\nhalf-BPS operators in planar $\\mathcal{N}=4$ super-Yang-Mills theory. In this\ndescription, the local operators are represented by on-shell states, made out\nof zero-momentum particles, that are absorbed by a null periodic super Wilson\nloop. We present evidence for this duality at weak coupling, by performing an\nexplicit calculation of the Wilson loop matrix elements through one loop. At\ntree level, the interactions localize at the cusps of the loop, revealing a\nsimple connection between the super form factors and the $m=2$ tree\namplituhedron. At loop level, we show that the Wilson loop calculation\nreproduces the known results for the super form factors. Inspired by this\nduality, we extend the OPE program developed for the form factors of the\nLagrangian to the super form factors of the higher-charge operators. We\nintroduce non-perturbative axioms and conjectures for the main building blocks\nthat govern the exchange of the lightest flux-tube excitations. These blocks\nappear as simple refinements of the form factor transitions introduced in\nearlier OPE studies. They are expressed at any value of the 't Hooft coupling\nin terms of the tilted Beisert-Eden-Staudacher kernel. We carry out checks of\nour conjectures up to two loops at weak coupling for three- and four-point form\nfactors of half-BPS operators of various lengths, finding perfect agreement\nwith perturbative data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:25:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Basso","Benjamin",""],["Tumanov","Alexander G.",""]]}
{"id":"2308.08433","submitter":"Shalanika Dayarathna Dr","authors":"Shalanika Dayarathna, Rajitha Senanayake, Jamie Evans","title":"Performance Analysis of Relay Selection Schemes in Multi-Hop\n  Decode-and-Forward 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":"  This paper analyses the data rate achieved by various relay selection schemes\nin a single-user multi-hop relay network with decode-and-forward (DF) relaying.\nWhile the single-user relay selection problem is well studied in the\nliterature, research on achievable rate maximization is limited to dual-hop\nnetworks and multi-hop networks with a single relay per hop. We fill this\nimportant gap by focusing on achievable rate maximization in multi-hop,\nmulti-relay networks. First, we consider optimal relay selection and obtain two\napproximations to the achievable rate. Next, we consider three existing\nsub-optimal relay selection strategies namely hop-by-hop, ad-hoc and\nblock-by-block relay selection and obtain exact expressions for the achievable\nrate under each of these strategies. We also extend the sliding window based\nrelay selection to the DF relay network and derive an approximation to the\nachievable rate. Further, we investigate the impact of window size in sliding\nwindow based relay selection and show that a window size of three is sufficient\nto achieve most of the possible performance gains. Finally, we extend this\nanalysis to a noise limited multi-user network where the number of available\nrelay nodes is large compared to the number of users and derive approximations\nto the achievable sum-rate.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:25:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dayarathna","Shalanika",""],["Senanayake","Rajitha",""],["Evans","Jamie",""]]}
{"id":"2308.08434","submitter":"Keqin Bao","authors":"Keqin Bao, Jizhi Zhang, Wenjie Wang, Yang Zhang, Zhengyi Yang,\n  Yancheng Luo, Fuli Feng, Xiangnaan He, Qi Tian","title":"A Bi-Step Grounding Paradigm for Large Language Models in Recommendation\n  Systems","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the focus on Large Language Models (LLMs) in the field of recommendation\nintensifies, the optimization of LLMs for recommendation purposes (referred to\nas LLM4Rec) assumes a crucial role in augmenting their effectiveness in\nproviding recommendations. However, existing approaches for LLM4Rec often\nassess performance using restricted sets of candidates, which may not\naccurately reflect the models' overall ranking capabilities. In this paper, our\nobjective is to investigate the comprehensive ranking capacity of LLMs and\npropose a two-step grounding framework known as BIGRec (Bi-step Grounding\nParadigm for Recommendation). It initially grounds LLMs to the recommendation\nspace by fine-tuning them to generate meaningful tokens for items and\nsubsequently identifies appropriate actual items that correspond to the\ngenerated tokens. By conducting extensive experiments on two datasets, we\nsubstantiate the superior performance, capacity for handling few-shot\nscenarios, and versatility across multiple domains exhibited by BIGRec.\nFurthermore, we observe that the marginal benefits derived from increasing the\nquantity of training samples are modest for BIGRec, implying that LLMs possess\nthe limited capability to assimilate statistical information, such as\npopularity and collaborative filtering, due to their robust semantic priors.\nThese findings also underline the efficacy of integrating diverse statistical\ninformation into the LLM4Rec framework, thereby pointing towards a potential\navenue for future research. Our code and data are available at\nhttps://github.com/SAI990323/Grounding4Rec.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:28:22 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bao","Keqin",""],["Zhang","Jizhi",""],["Wang","Wenjie",""],["Zhang","Yang",""],["Yang","Zhengyi",""],["Luo","Yancheng",""],["Feng","Fuli",""],["He","Xiangnaan",""],["Tian","Qi",""]]}
{"id":"2308.08435","submitter":"Bashu Khanal","authors":"B. D. Khanal and P. Dhakal","title":"Evaluation of flux expulsion and flux trapping sensitivity of srf\n  cavities fabricated from cold work Nb sheet with successive heat treatment","comments":"21st International Conference on Radio-Frequency Superconductivity\n  (SRF 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The main source of RF losses leading to lower quality factor of\nsuperconducting radio-frequency cavities is due to the residual magnetic flux\ntrapped during cool-down. The loss due to flux trapping is more pronounced for\ncavities subjected to impurities doping. The flux trapping and its sensitivity\nto rf losses are related to several intrinsic and extrinsic phenomena. To\nelucidate the effect of re-crystallization by high temperature heat treatment\non the flux trapping sensitivity, we have fabricated two 1.3 GHz single cell\ncavities from cold-worked Nb sheets and compared with cavities made from\nstandard fine-grain Nb. Flux expulsion ratio and flux trapping sensitivity were\nmeasured after successive high temperature heat treatments. The cavity made\nfrom cold worked Nb showed better flux expulsion after 800 C/3h heat treatments\nand similar behavior when heat treated with additional 900 C/3h and 1000 C/3h.\nIn this contribution, we present the summary of flux expulsion, trapping\nsensitivity, and RF results.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:34:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Khanal","B. D.",""],["Dhakal","P.",""]]}
{"id":"2308.08436","submitter":"Besm Osman","authors":"Besm Osman, Mestiez Pereira, Huub van de Wetering and Maxime\n  Chamberland","title":"Voxlines: Streamline Transparency through Voxelization and\n  View-Dependent Line Orders","comments":"12 pages. 4 figures. Accepted at Computational Diffusion MRI Workshop\n  (CDMRI) at Medical Image Computing and Computer Assisted Intervention\n  (MICCAI) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As tractography datasets continue to grow in size, there is a need for\nimproved visualization methods that can capture structural patterns occurring\nin large tractography datasets. Transparency is an increasingly important\naspect of finding these patterns in large datasets but is inaccessible to\ntractography due to performance limitations. In this paper, we propose a\nrendering method that achieves performant rendering of transparent streamlines,\nallowing for exploration of deeper brain structures interactively. The method\nachieves this through a novel approximate order-independent transparency method\nthat utilizes voxelization and caching view-dependent line orders per voxel. We\ncompare our transparency method with existing tractography visualization\nsoftware in terms of performance and the ability to capture deeper structures\nin the dataset.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:35:45 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Osman","Besm",""],["Pereira","Mestiez",""],["van de Wetering","Huub",""],["Chamberland","Maxime",""]]}
{"id":"2308.08437","submitter":"Javad Omidi","authors":"Javad Omidi","title":"Sensitivity Analysis and Parametric Optimization of Micro-Plasma\n  Actuators: A Mini Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.data-an","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Dielectric Barrier Discharge (DBD) micro-plasma actuator stands out as a\nhighly promising tool for active fluid flow control. Researchers specializing\nin flow control have taken a keen interest in this actuator due to its\neconomical manufacturing, low energy consumption, compact size, lightweight\nnature, straightforward implementation, and absence of movable components or\npneumatic/hydraulic systems. Given its extensive application, achieving the\nbest design for plasma actuators necessitates a more profound grasp of how\ndiverse physical factors (like electrode thickness, electrode length,\ndielectric thickness, and dielectric materials) and operational variables (such\nas applied voltage, frequency, and waveform) impact its performance. Within\nthis article, we delve into a comprehensive assessment of both numerical and\nexperimental investigations focused on optimizing actuator parameters. These\nstudies can be categorized into two main groups. The initial group involves\nfundamental test cases conducted on flat plates, while the subsequent group\npertains to modeling controlled flow in real-world scenarios, including curved\nsurfaces.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:42:22 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 02:41:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Omidi","Javad",""]]}
{"id":"2308.08438","submitter":"Mohammad Soleymanpour","authors":"Mohammad Soleymanpour, Michael T. Johnson, Rahim Soleymanpour, Jeffrey\n  Berry","title":"Accurate synthesis of Dysarthric Speech for ASR data augmentation","comments":"arXiv admin note: text overlap with arXiv:2201.11571","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Dysarthria is a motor speech disorder often characterized by reduced speech\nintelligibility through slow, uncoordinated control of speech production\nmuscles. Automatic Speech recognition (ASR) systems can help dysarthric talkers\ncommunicate more effectively. However, robust dysarthria-specific ASR requires\na significant amount of training speech, which is not readily available for\ndysarthric talkers. This paper presents a new dysarthric speech synthesis\nmethod for the purpose of ASR training data augmentation. Differences in\nprosodic and acoustic characteristics of dysarthric spontaneous speech at\nvarying severity levels are important components for dysarthric speech\nmodeling, synthesis, and augmentation. For dysarthric speech synthesis, a\nmodified neural multi-talker TTS is implemented by adding a dysarthria severity\nlevel coefficient and a pause insertion model to synthesize dysarthric speech\nfor varying severity levels. To evaluate the effectiveness for synthesis of\ntraining data for ASR, dysarthria-specific speech recognition was used. Results\nshow that a DNN-HMM model trained on additional synthetic dysarthric speech\nachieves WER improvement of 12.2% compared to the baseline, and that the\naddition of the severity level and pause insertion controls decrease WER by\n6.5%, showing the effectiveness of adding these parameters. Overall results on\nthe TORGO database demonstrate that using dysarthric synthetic speech to\nincrease the amount of dysarthric-patterned speech for training has significant\nimpact on the dysarthric ASR systems. In addition, we have conducted a\nsubjective evaluation to evaluate the dysarthric-ness and similarity of\nsynthesized speech. Our subjective evaluation shows that the perceived\ndysartrhic-ness of synthesized speech is similar to that of true dysarthric\nspeech, especially for higher levels of dysarthria\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:42:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Soleymanpour","Mohammad",""],["Johnson","Michael T.",""],["Soleymanpour","Rahim",""],["Berry","Jeffrey",""]]}
{"id":"2308.08439","submitter":"Nebojsa Djuric","authors":"Biljana Vojvodi\\'c, Neboj\\v{s}a Djuri\\'c and Vladimir Vladi\\v{c}i\\'c","title":"On recovering Dirac operators with two delays","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the inverse spectral problems of recovering Dirac-type\nfunctional-differential operator with two constant delays $a_1$ and $a_2$ not\nless than one-third of the interval. It has been proved that the operator can\nbe recovered uniquely from four spectra under the condition\n$2a_1+\\frac{a_2}{2}\\geq \\pi$, while it is not possible otherwise.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:46:18 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vojvodi\u0107","Biljana",""],["Djuri\u0107","Neboj\u0161a",""],["Vladi\u010di\u0107","Vladimir",""]]}
{"id":"2308.08440","submitter":"Gabriel Conant","authors":"Gabriel Conant, Ehud Hrushovski, Anand Pillay","title":"Compactifications of pseudofinite and pseudo-amenable groups","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We first give simplified and corrected accounts of some results in\n\\cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use\na classical theorem of Turing \\cite{Turing} to give a simplified proof that any\ndefinable compactification of a pseudofinite group has an abelian connected\ncomponent. We then discuss the relationship between Turing's work, the\nJordan-Schur Theorem, and a (relatively) more recent result of Kazhdan\n\\cite{Kazh} on approximate homomorphisms, and we use this to widen our scope\nfrom finite groups to amenable groups. In particular, we develop a suitable\ncontinuous logic framework for dealing with definable homomorphisms from\npseudo-amenable groups to compact Lie groups. Together with the stabilizer\ntheorems of \\cite{HruAG,MOS}, we obtain a uniform (but non-quantitative)\nanalogue of Bogolyubov's Lemma for sets of positive measure in discrete\namenable groups. We conclude with brief remarks on the case of amenable\ntopological groups.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:49:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Conant","Gabriel",""],["Hrushovski","Ehud",""],["Pillay","Anand",""]]}
{"id":"2308.08441","submitter":"Vincent Corlay","authors":"Viet-Hoa Nguyen, Vincent Corlay, Nicolas Gresset, and Cristina\n  Ciochina","title":"Probabilistic Ray-Tracing Aided Positioning at mmWave frequencies","comments":"Accepted at the conference Indoor Positioning and Indoor Navigation\n  (IPIN) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the following positioning problem where several base stations\n(BS) try to locate a user equipment (UE): The UE sends a positioning signal to\nseveral BS. Each BS performs Angle of Arrival (AoA) measurements on the\nreceived signal. These AoA measurements as well as a 3D model of the\nenvironment are then used to locate the UE. We propose a method to exploit not\nonly the geometrical characteristics of the environment by a ray-tracing\nsimulation, but also the statistical characteristics of the measurements to\nenhance the positioning accuracy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:49:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nguyen","Viet-Hoa",""],["Corlay","Vincent",""],["Gresset","Nicolas",""],["Ciochina","Cristina",""]]}
{"id":"2308.08442","submitter":"Eunseop Yoon","authors":"Eunseop Yoon, Hee Suk Yoon, Dhananjaya Gowda, SooHwan Eom, Daehyeok\n  Kim, John Harvill, Heting Gao, Mark Hasegawa-Johnson, Chanwoo Kim, Chang D.\n  Yoo","title":"Mitigating the Exposure Bias in Sentence-Level Grapheme-to-Phoneme (G2P)\n  Transduction","comments":"INTERSPEECH 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-to-Text Transfer Transformer (T5) has recently been considered for the\nGrapheme-to-Phoneme (G2P) transduction. As a follow-up, a tokenizer-free\nbyte-level model based on T5 referred to as ByT5, recently gave promising\nresults on word-level G2P conversion by representing each input character with\nits corresponding UTF-8 encoding. Although it is generally understood that\nsentence-level or paragraph-level G2P can improve usability in real-world\napplications as it is better suited to perform on heteronyms and linking sounds\nbetween words, we find that using ByT5 for these scenarios is nontrivial. Since\nByT5 operates on the character level, it requires longer decoding steps, which\ndeteriorates the performance due to the exposure bias commonly observed in\nauto-regressive generation models. This paper shows that the performance of\nsentence-level and paragraph-level G2P can be improved by mitigating such\nexposure bias using our proposed loss-based sampling method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:49:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yoon","Eunseop",""],["Yoon","Hee Suk",""],["Gowda","Dhananjaya",""],["Eom","SooHwan",""],["Kim","Daehyeok",""],["Harvill","John",""],["Gao","Heting",""],["Hasegawa-Johnson","Mark",""],["Kim","Chanwoo",""],["Yoo","Chang D.",""]]}
{"id":"2308.08443","submitter":"Xuechao Zou","authors":"Ben Chen, Xuechao Zou, Kai Li, Yu Zhang, Junliang Xing, Pin Tao","title":"High-Fidelity Lake Extraction via Two-Stage Prompt Enhancement:\n  Establishing a Novel Baseline and Benchmark","comments":"8 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 extraction of lakes from remote sensing images is a complex challenge due\nto the varied lake shapes and data noise. Current methods rely on multispectral\nimage datasets, making it challenging to learn lake features accurately from\npixel arrangements. This, in turn, affects model learning and the creation of\naccurate segmentation masks. This paper introduces a unified prompt-based\ndataset construction approach that provides approximate lake locations using\npoint, box, and mask prompts. We also propose a two-stage prompt enhancement\nframework, LEPrompter, which involves prompt-based and prompt-free stages\nduring training. The prompt-based stage employs a prompt encoder to extract\nprior information, integrating prompt tokens and image embeddings through self-\nand cross-attention in the prompt decoder. Prompts are deactivated once the\nmodel is trained to ensure independence during inference, enabling automated\nlake extraction. Evaluations on Surface Water and Qinghai-Tibet Plateau Lake\ndatasets show consistent performance improvements compared to the previous\nstate-of-the-art method. LEPrompter achieves mIoU scores of 91.48% and 97.43%\non the respective datasets without introducing additional parameters or GFLOPs.\nSupplementary materials provide the source code, pre-trained models, and\ndetailed user studies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:51:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Ben",""],["Zou","Xuechao",""],["Li","Kai",""],["Zhang","Yu",""],["Xing","Junliang",""],["Tao","Pin",""]]}
{"id":"2308.08444","submitter":"Sergey Pavlik","authors":"S.I. Pavlik","title":"Collapse and revivals for the binomial field distribution","comments":"5 pages, 1 figures. arXiv admin note: substantial text overlap with\n  arXiv:2307.07838","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The exact representation of the atomic inversion in the Jaynes-Cummings model\nas an integral over the Hankel contour is used. For a field in a binomial\nstate, the integral is evaluated using the saddle point method. Simple\napproximate analytical expressions for collapse and revivals are obtained.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:52:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pavlik","S. I.",""]]}
{"id":"2308.08445","submitter":"Andrea Marini","authors":"Matteo Venturi, Raju Adhikary, Ambaresh Sahoo, Carino Ferrante,\n  Isabella Daidone, Francesco Di Stasio, Andrea Toma, Francesco Tani, Hatice\n  Altug, Antonio Mecozzi, Massimiliano Aschi and Andrea Marini","title":"Plasmon-enhanced circular dichroism spectroscopy of chiral drug\n  solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the potential of surface plasmon polaritons at noble metal\ninterfaces for surface-enhanced chiroptical sensing of dilute chiral drug\nsolutions with nano-litre volume. The high quality factor of surface plasmon\nresonances in both Otto and Kretschmann configurations enables the enhancement\nof circular dichroism thanks to the large near-field intensity of such\nplasmonic excitations. Furthermore, the subwavelength confinement of surface\nplasmon polaritons is key to attain chiroptical sensitivity to small amounts of\ndrug volumes placed around $\\simeq$ 100 nm by the metal surface. Our\ncalculations focus on reparixin, a pharmaceutical molecule currently used in\nclinical studies for patients with community-acquired pneumonia, including\nCOVID-19 and acute respiratory distress syndrome. Considering realistic dilute\nsolutions of reparixin dissolved in water with concentration $\\leq$ 5 mg/ml and\nnl volume, we find a circular-dichroism differential absorption enhancement\nfactor of the order $\\simeq$ 20 and chirality-induced polarization distortion\nupon surface plasmon polariton excitation. Our results are relevant for the\ndevelopment of innovative chiroptical sensors capable of measuring the\nenantiomeric imbalance of chiral drug solutions with nl volume.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:59:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Venturi","Matteo",""],["Adhikary","Raju",""],["Sahoo","Ambaresh",""],["Ferrante","Carino",""],["Daidone","Isabella",""],["Di Stasio","Francesco",""],["Toma","Andrea",""],["Tani","Francesco",""],["Altug","Hatice",""],["Mecozzi","Antonio",""],["Aschi","Massimiliano",""],["Marini","Andrea",""]]}
{"id":"2308.08446","submitter":"Rongrong Jing","authors":"Guyu Jiang, Xiaoyun Li, Rongrong Jing, Ruoqi Zhao, Xingliang Ni,\n  Guodong Cao, Ning Hu","title":"CSPM: A Contrastive Spatiotemporal Preference Model for CTR Prediction\n  in On-Demand Food Delivery Services","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Click-through rate (CTR) prediction is a crucial task in the context of an\nonline on-demand food delivery (OFD) platform for precisely estimating the\nprobability of a user clicking on food items. Unlike universal e-commerce\nplatforms such as Taobao and Amazon, user behaviors and interests on the OFD\nplatform are more location and time-sensitive due to limited delivery ranges\nand regional commodity supplies. However, existing CTR prediction algorithms in\nOFD scenarios concentrate on capturing interest from historical behavior\nsequences, which fails to effectively model the complex spatiotemporal\ninformation within features, leading to poor performance. To address this\nchallenge, this paper introduces the Contrastive Sres under different search\nstates using three modules: contrastive spatiotemporal representation learning\n(CSRL), spatiotemporal preference extractor (StPE), and spatiotemporal\ninformation filter (StIF). CSRL utilizes a contrastive learning framework to\ngenerate a spatiotemporal activation representation (SAR) for the search\naction. StPE employs SAR to activate users' diverse preferences related to\nlocation and time from the historical behavior sequence field, using a\nmulti-head attention mechanism. StIF incorporates SAR into a gating network to\nautomatically capture important features with latent spatiotemporal effects.\nExtensive experiments conducted on two large-scale industrial datasets\ndemonstrate the state-of-the-art performance of CSPM. Notably, CSPM has been\nsuccessfully deployed in Alibaba's online OFD platform Ele.me, resulting in a\nsignificant 0.88% lift in CTR, which has substantial business implications.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 19:53:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiang","Guyu",""],["Li","Xiaoyun",""],["Jing","Rongrong",""],["Zhao","Ruoqi",""],["Ni","Xingliang",""],["Cao","Guodong",""],["Hu","Ning",""]]}
{"id":"2308.08447","submitter":"Serban Lepadatu Dr","authors":"Serban Lepadatu","title":"Accelerating micromagnetic and atomistic simulations using multiple GPUs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown micromagnetic and atomistic spin dynamics simulations can use\nmultiple GPUs in order to reduce computation time, but also to allow for a\nlarger simulation size than is possible on a single GPU. Whilst interactions\nwhich depend on neighbouring spins, such as exchange interactions, may be\nimplemented efficiently by transferring data between GPUs using halo regions,\nor alternatively using direct memory accesses, implementing the long-range\ndemagnetizing interaction is the main difficulty in achieving good performance\nscaling, where the data transfer rate between GPUs is a significant bottleneck.\nA multi-GPU convolution algorithm is developed here, which relies on single-GPU\nFFTs executed in parallel. It is shown that even for micromagnetic simulations\nwhere the demagnetizing interaction computation time dominates, good\nperformance scaling may be achieved, with speedup factors up to 1.8, 2.5, and\n3.1, for 2, 3, and 4 GPUs respectively. The code developed here can be used for\nany number of GPUs in parallel, with performance scaling strongly dependent on\ninter-GPU data transfer rate and connection topology. This is further improved\nin micromagnetic simulations which include a spin transport solver, obtaining\nspeedup factors up to 1.96, 2.8, and 3.7, for 2, 3, and 4 GPUs respectively.\nThe best case scenario is obtained for atomistic spin dynamics simulations,\nwhere the demagnetizing interaction is implemented with spin-averaged cells.\nUsing a single workstation with 4 GPUs, it is shown atomistic spin dynamics\nsimulations with up to 1 billion spins, and atomistic Monte Carlo simulations\nwith up to 2 billion spins are possible, with a near-ideal performance scaling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:59:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lepadatu","Serban",""]]}
{"id":"2308.08448","submitter":"Santanu Ganguly","authors":"Santanu Ganguly","title":"Implementing Quantum Generative Adversarial Network (qGAN) and QCBM in\n  Finance","comments":"AI Summit, London","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI cs.ET cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum machine learning (QML) is a cross-disciplinary subject made up of two\nof the most exciting research areas: quantum computing and classical machine\nlearning (ML), with ML and artificial intelligence (AI) being projected as the\nfirst fields that will be impacted by the rise of quantum machines. Quantum\ncomputers are being used today in drug discovery, material & molecular\nmodelling and finance. In this work, we discuss some upcoming active new\nresearch areas in application of quantum machine learning (QML) in finance. We\ndiscuss certain QML models that has become areas of active interest in the\nfinancial world for various applications. We use real world financial dataset\nand compare models such as qGAN (quantum generative adversarial networks) and\nQCBM (quantum circuit Born machine) among others, using simulated environments.\nFor the qGAN, we define quantum circuits for discriminators and generators and\nshow promises of future quantum advantage via QML in finance.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:21:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ganguly","Santanu",""]]}
{"id":"2308.08449","submitter":"Zhu Daobin","authors":"Daobin Zhu, Xiangdong Su and Hongbin Zhang","title":"Improving CTC-AED model with integrated-CTC and auxiliary loss\n  regularization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Connectionist temporal classification (CTC) and attention-based encoder\ndecoder (AED) joint training has been widely applied in automatic speech\nrecognition (ASR). Unlike most hybrid models that separately calculate the CTC\nand AED losses, our proposed integrated-CTC utilizes the attention mechanism of\nAED to guide the output of CTC. In this paper, we employ two fusion methods,\nnamely direct addition of logits (DAL) and preserving the maximum probability\n(PMP). We achieve dimensional consistency by adaptively affine transforming the\nattention results to match the dimensions of CTC. To accelerate model\nconvergence and improve accuracy, we introduce auxiliary loss regularization\nfor accelerated convergence. Experimental results demonstrate that the DAL\nmethod performs better in attention rescoring, while the PMP method excels in\nCTC prefix beam search and greedy search.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:31:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhu","Daobin",""],["Su","Xiangdong",""],["Zhang","Hongbin",""]]}
{"id":"2308.08451","submitter":"Shenghui Cheng","authors":"Xiangyu Li, Yuqing Fan, Shenghui Cheng","title":"AIGC In China: Current Developments And Future Outlook","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 increasing attention given to AI Generated Content (AIGC) has brought a\nprofound impact on various aspects of daily life, industrial manufacturing, and\nthe academic sector. Recognizing the global trends and competitiveness in AIGC\ndevelopment, this study aims to analyze China's current status in the field.\nThe investigation begins with an overview of the foundational technologies and\ncurrent applications of AIGC. Subsequently, the study delves into the market\nstatus, policy landscape, and development trajectory of AIGC in China,\nutilizing keyword searches to identify relevant scholarly papers. Furthermore,\nthe paper provides a comprehensive examination of AIGC products and their\ncorresponding ecosystem, emphasizing the ecological construction of AIGC.\nFinally, this paper discusses the challenges and risks faced by the AIGC\nindustry while presenting a forward-looking perspective on the industry's\nfuture based on competitive insights in AIGC.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:55:38 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:23:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Xiangyu",""],["Fan","Yuqing",""],["Cheng","Shenghui",""]]}
{"id":"2308.08452","submitter":"Gabriel Montoya-Vega","authors":"Gabriel Montoya-Vega","title":"A Glimpse of the Khovanov Homology of T(2,n) Via Long Exact Sequence","comments":"10 pages, 8 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Khovanov homology is a powerful link invariant: a categorification of the\nJones polynomial that enjoys a rich and beautiful algebraic structure. This\nhomology theory has been extensively studied and it has become an ubiquitous\ntopic in contemporary knot theory research. In the same spirit, the Kauffman\nskein relation, which allows to define the Kauffman bracket polynomial up to\nnormalization of the unknot, can be categorified by means of a long exact\nsequence. In an expository style, in this article we present how to build\nKhovanov homology from the Kauffman bracket polynomial and construct its long\nexact sequence. Furthermore, we present a deviceful and practical way in which\nthis long exact sequence can be used for the computation of the Khovanov\nhomology of torus links of the type $T(2,n)$.\n  This article serves as a partial translation of a Spanish paper to be\npublished on occasion of the Encuentro Internacional de Matem\\'aticas\n(International Meeting of Mathematics) to be celebrated at the Universidad del\nAtl\\'antico in Barranquilla, Colombia in November 2023. This paper offers a\nfirst look into the world of Khovanov homology by constructing it from the\nKauffman bracket polynomial, as it was first done by Oleg Viro. Moreover, it\ngives the reader references for further studies from leading experts such as D.\nBar-Natan, M. Khovanov, S. Mukherjee, J. Przytycki, and A. Shumakovitch, among\nothers. In particular, one of the main objectives in publishing this article\n(and this partial translation) is to popularize research in knot theory, more\nspecifically on Khovanov homology in Colombia, and Latin-America in general,\nacting as a language bridge given that most of the literature is in English.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:01:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Montoya-Vega","Gabriel",""]]}
{"id":"2308.08453","submitter":"Eyal Weiss","authors":"Eyal Weiss, Ariel Felner, Gal A. Kaminka","title":"Tightest Admissible Shortest Path","comments":"arXiv admin note: text overlap with arXiv:2208.11489","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.AI cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The shortest path problem in graphs is fundamental to AI. Nearly all variants\nof the problem and relevant algorithms that solve them ignore edge-weight\ncomputation time and its common relation to weight uncertainty. This implies\nthat taking these factors into consideration can potentially lead to a\nperformance boost in relevant applications. Recently, a generalized framework\nfor weighted directed graphs was suggested, where edge-weight can be computed\n(estimated) multiple times, at increasing accuracy and run-time expense. We\nbuild on this framework to introduce the problem of finding the tightest\nadmissible shortest path (TASP); a path with the tightest suboptimality bound\non the optimal cost. This is a generalization of the shortest path problem to\nbounded uncertainty, where edge-weight uncertainty can be traded for\ncomputational cost. We present a complete algorithm for solving TASP, with\nguarantees on solution quality. Empirical evaluation supports the effectiveness\nof this approach.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:39:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Weiss","Eyal",""],["Felner","Ariel",""],["Kaminka","Gal A.",""]]}
{"id":"2308.08454","submitter":"Tianxing Ma","authors":"Ran Liu, Ting Guo, Jiajun Lu, Junfeng Ren, and Tianxing Ma","title":"Different phase leads to different transport behavior in\n  Pb$_9$Cu(PO$_4$)$_6$O compounds","comments":"6 pages and 4 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 recent claimed room-temperature superconductivity in Cu-doped lead\napatite at ambient pressure are under highly debate. To identify its physical\norigin, we studied the crystal structures, energy band structures, lattice\ndynamics and magnetic properties of the parent Pb$_{10}$(PO$_4$)$_6$O compound,\nin which two different phases of the LK-99 compound are analyzed in detail. Our\nresults show that the Pb$_{10}$(PO$_4$)$_6$O compound is an indirect band gap\nsemiconductor, where Cu doping at the 4$f$ site of Pb leads to a semiconducting\nto half-metallic transition. Two half-filled flat bands spanning the Fermi\nenergy levels are present in the 4$f$-phase of LK-99, which are mainly formed\nby hybridization of the $d_{x^2-y^2}$ and $d_{zy}$ orbitals of Cu with the 2$p$\norbitals of O. In addition, 6$h$-phase of LK-99 always has spin polarity at the\nbottom of the conduction band and at the top of the valence band, making the\nmaterial a bipolar magnetic semiconductor. Our results are basically consistent\nwith the recent experimental transport properties of LK-99 posted on\narXiv:2308.05778.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:46:26 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Ran",""],["Guo","Ting",""],["Lu","Jiajun",""],["Ren","Junfeng",""],["Ma","Tianxing",""]]}
{"id":"2308.08455","submitter":"Ricky Xiaofeng Chen","authors":"Ricky X. F. Chen","title":"Towards studying the structure of triple Hurwitz numbers","comments":"An extended abstract, comments are very much welcome. The full\n  version with more results and details will be uploaded later","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Going beyond the studies of single and double Hurwitz numbers, we report some\nprogress towards studying Hurwitz numbers which correspond to ramified\ncoverings of the Riemann sphere involving three nonsimple branch points. We\nfirst prove a recursion which implies a fundamental identity of Frobenius\nenumerating factorizations of a permutation in group algebra theory. We next\napply the recursion to study Hurwitz numbers involving three nonsimple branch\npoints (besides simple ones), two of them having complete ramification profiles\nwhile the remaining one having a prescribed number of preimages. The recursion\nallows us to obtain recurrences as well as explicit formulas for these numbers.\nThe case where one of the nonsimple branch points with complete profile has a\nunique preimage (one-part quasi-triple Hurwitz numbers) is particularly studied\nin detail. We prove a dimension-reduction formula from which any one-part\nquasi-triple Hurwitz number can be reduced to quasi-triple Hurwitz numbers\nwhere two branch points respectively have a unique preimage. We also obtain the\npolynomiality of one-part quasi-triple Hurwitz numbers analogous to that\nimplied by the remarkable ELSV formula, suggesting a potential connection to\nHodge integrals or intersection theory. Coefficients of the polynomials are\ncompletely and explicitly determined which may facilitate searching these\nintegral counterparts (i.e., ELSV-type formulas) in the future.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:41:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Ricky X. F.",""]]}
{"id":"2308.08456","submitter":"Jorge Baeza-Ballesteros","authors":"Jorge Baeza-Ballesteros, Edmund J. Copeland, Daniel G. Figueroa,\n  Joanes Lizarraga","title":"Gravitational Wave Emission from a Cosmic String Loop, I: Global Case","comments":"12 pages including Supplemental Material; 9 figures, 3 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":"  We study the simultaneous decay of global string loops into scalar particles\n(massless and massive modes) and gravitational waves (GWs). Using field theory\nsimulations in flat space-time of %isolated loops with initial length $\\sim\n80-1700$ times their core width, we determine the power emitted by a loop into\nscalar particles, $P_{\\varphi}$, and GWs, $P_{\\rm GW}$, and characterize the\nloop-decay timescale as a function of its initial length, energy and angular\nmomentum. We quantify infrared and ultraviolet lattice dependencies of our\nresults. For all type of loops and initial conditions considered, GW emission\nis always suppressed compared to particles as $P_{\\rm GW}/P_{\\varphi} \\approx\n\\mathcal{O}(10)(v/m_\\text{p})^2\\ll 1$, where $v$ is the vacuum expectation\nvalue associated with string formation. Our results suggest that the GW\nbackground from a global string network, such as in dark matter axion\nscenarios, will be highly suppressed.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:03:38 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Baeza-Ballesteros","Jorge",""],["Copeland","Edmund J.",""],["Figueroa","Daniel G.",""],["Lizarraga","Joanes",""]]}
{"id":"2308.08457","submitter":"Muhammad Sabeel Khan","authors":"Muhammad Sabeel Khan, Isma Hameed","title":"A New Magneto-Micropolar Boundary Layer Model for Liquid Flows -- Effect\n  of Micromagnetorotation (MMR)","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.NA math-ph math.MP math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a micropolar continuum model based on the theory of\nmagnetohydrodynamics. In particular, the effect of micromagnetorotation (MMR)\nis taken into account in the derivation of an initial-boundary value problem\n(i-bvp) within magneto-micorpolar flows. MMR is a phenomenon that is related to\nthe micromotions of the magnetic liquid particles in the presence of externally\napplied magnetic field. In all previous investigations magnetization was\nsupposed to be parallel to applied magnetic field therefore its effect in the\nlateral direction is neglected. This assumption is not correct in\nmagnetic-micropolar flows. Since, magnetic-micropolar flows are anisotropic in\nnature. Here, we present a model accounting for this MMR effect. The\nconstitutive equation for the MMR is described and the governing system of flow\ndynamics is described in the form of PDEs. Boundary layer flow assumptions are\nused to derive an initial-boundary value problem in ODEs. As a consequence, two\nnewly defined parameters arises that are related to the MMR. The effects of\nthese parameters on the flow characteristics are investigated. The developed\ni-bvp is solved through the shooting method using MATLAB routines. Effects of\nMMR are analyzed on the miro-rotational and hydrodynamic velocities profiles.\nSome interesting features of the flow are observed. Results are presented\nthrough graphs and discussed in detail. It is worth mentioning that the model\npresented is first of its kind in the literature and has a great potential in\ninvestigating boundary layer flows within micropolar continuum with other\nphysical aspects of the flow pertinent to engineering and biomedical\napplications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:03:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Khan","Muhammad Sabeel",""],["Hameed","Isma",""]]}
{"id":"2308.08458","submitter":"Michael Swift","authors":"Michael W. Swift and John L. Lyons","title":"Comment on \"Origin of correlated isolated flat bands in\n  copper-substituted lead phosphate apatite\"","comments":"2 pages, 1 figure","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":"  In this comment on \"Origin of correlated isolated flat bands in\ncopper-substituted lead phosphate apatite\" (arXiv:2307.16892\n[cond-mat.supr-con]), we discuss the flat half-occupied two-band manifold that\nappears in $\\mathrm{Pb}_9\\mathrm{Cu}(\\mathrm{PO}_4)_6(\\mathrm{OH})_2$ when\nusing a semilocal DFT functional. We argue that the flat band is an artifact of\nthe functional's overestimation of the energy of the oxygen p states in the\nvalence band. When using the HSE hybrid functional, the energy of the oxygen p\nstates is reduced, and the copper-derived manifold splits into one fully\noccupied and one empty band. While these results do not rule out the\npossibility of superconductivity in doped LK-99, they do predict that\nstoichiometric $\\mathrm{Pb}_9\\mathrm{Cu}(\\mathrm{PO}_4)_6(\\mathrm{OH})_2$ is an\ninsulator, not a superconductor. Furthermore, we have shown that future\nfirst-principles studies of these materials should employ hybrid functionals or\nother advanced methods to ensure that the oxygen-derived valence-band energies\nare correctly described.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:36:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Swift","Michael W.",""],["Lyons","John L.",""]]}
{"id":"2308.08459","submitter":"Jianyang Zhai","authors":"Jianyang Zhai, Xiawu Zheng, Chang-Dong Wang, Hui Li, and Yonghong Tian","title":"Knowledge Prompt-tuning for Sequential 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":"  Pre-trained language models (PLMs) have demonstrated strong performance in\nsequential recommendation (SR), which are utilized to extract general\nknowledge. However, existing methods still lack domain knowledge and struggle\nto capture users' fine-grained preferences. Meanwhile, many traditional SR\nmethods improve this issue by integrating side information while suffering from\ninformation loss. To summarize, we believe that a good recommendation system\nshould utilize both general and domain knowledge simultaneously. Therefore, we\nintroduce an external knowledge base and propose Knowledge Prompt-tuning for\nSequential Recommendation (\\textbf{KP4SR}). Specifically, we construct a set of\nrelationship templates and transform a structured knowledge graph (KG) into\nknowledge prompts to solve the problem of the semantic gap. However, knowledge\nprompts disrupt the original data structure and introduce a significant amount\nof noise. We further construct a knowledge tree and propose a knowledge tree\nmask, which restores the data structure in a mask matrix form, thus mitigating\nthe noise problem. We evaluate KP4SR on three real-world datasets, and\nexperimental results show that our approach outperforms state-of-the-art\nmethods on multiple evaluation metrics. Specifically, compared with PLM-based\nmethods, our method improves NDCG@5 and HR@5 by \\textcolor{red}{40.65\\%} and\n\\textcolor{red}{36.42\\%} on the books dataset, \\textcolor{red}{11.17\\%} and\n\\textcolor{red}{11.47\\%} on the music dataset, and \\textcolor{red}{22.17\\%} and\n\\textcolor{red}{19.14\\%} on the movies dataset, respectively. Our code is\npublicly available at the link:\n\\href{https://github.com/zhaijianyang/KP4SR}{\\textcolor{blue}{https://github.com/zhaijianyang/KP4SR}.}\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:31:33 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhai","Jianyang",""],["Zheng","Xiawu",""],["Wang","Chang-Dong",""],["Li","Hui",""],["Tian","Yonghong",""]]}
{"id":"2308.08460","submitter":"Jiayi Liu","authors":"Jiayi Liu, Jennifer Neville","title":"Stationary Algorithmic Balancing For Dynamic Email Re-Ranking Problem","comments":"Published in KDD'23","journal-ref":null,"doi":"10.1145/3580305.3599909","report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Email platforms need to generate personalized rankings of emails that satisfy\nuser preferences, which may vary over time. We approach this as a\nrecommendation problem based on three criteria: closeness (how relevant the\nsender and topic are to the user), timeliness (how recent the email is), and\nconciseness (how brief the email is). We propose MOSR (Multi-Objective\nStationary Recommender), a novel online algorithm that uses an adaptive control\nmodel to dynamically balance these criteria and adapt to preference changes. We\nevaluate MOSR on the Enron Email Dataset, a large collection of real emails,\nand compare it with other baselines. The results show that MOSR achieves better\nperformance, especially under non-stationary preferences, where users value\ndifferent criteria more or less over time. We also test MOSR's robustness on a\nsmaller down-sampled dataset that exhibits high variance in email\ncharacteristics, and show that it maintains stable rankings across different\nsamples. Our work offers novel insights into how to design email re-ranking\nsystems that account for multiple objectives impacting user satisfaction.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 23:08:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Jiayi",""],["Neville","Jennifer",""]]}
{"id":"2308.08461","submitter":"ZiJie Song","authors":"ZiJie Song, JiaWei Chen, Sheng Zhou, QiHao Shi, Yan Feng, Chun Chen\n  and Can Wang","title":"CDR: Conservative Doubly Robust Learning for Debiased Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recommendation systems (RS), user behavior data is observational rather\nthan experimental, resulting in widespread bias in the data. Consequently,\ntackling bias has emerged as a major challenge in the field of recommendation\nsystems. Recently, Doubly Robust Learning (DR) has gained significant attention\ndue to its remarkable performance and robust properties. However, our\nexperimental findings indicate that existing DR methods are severely impacted\nby the presence of so-called Poisonous Imputation, where the imputation\nsignificantly deviates from the truth and becomes counterproductive.\n  To address this issue, this work proposes Conservative Doubly Robust strategy\n(CDR) which filters imputations by scrutinizing their mean and variance.\nTheoretical analyses show that CDR offers reduced variance and improved tail\nbounds.In addition, our experimental investigations illustrate that CDR\nsignificantly enhances performance and can indeed reduce the frequency of\npoisonous imputation.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:10:56 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 05:30:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Song","ZiJie",""],["Chen","JiaWei",""],["Zhou","Sheng",""],["Shi","QiHao",""],["Feng","Yan",""],["Chen","Chun",""],["Wang","Can",""]]}
{"id":"2308.08462","submitter":"Oskar Pro\\'sniak","authors":"Wojciech De Roeck, Fran\\c{c}ois Huveneers, Branko Meeus, Oskar A.\n  Pro\\'sniak","title":"Rigorous and simple results on very slow thermalization, or\n  quasi-localization, of the disordered quantum chain","comments":"To be published in Physica A: Statistical Mechanics and its\n  Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.dis-nn cond-mat.stat-mech math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper originates from lectures delivered at the summer school\n\"Fundamental Problems in Statistical Physics XV\" in Bruneck, Italy, in 2021. We\ngive a brief and limited introduction into ergodicity-breaking induced by\ndisorder. As the title suggests, we include a simple yet rigorous and original\nresult: For a strongly disordered quantum chain, we exhibit a full set of\nquasi-local quantities whose dynamics is negligible up to times of order\n$\\exp\\{ c (\\log W)^{2-\\epsilon}\\}$, with $\\epsilon < 1$, $c$ a numerical\nconstant, and $W$ the disorder strength. Such a result, that is often referred\nto as \"quasi-localization\", can in principle be obtained in other systems as\nwell, but for a disordered quantum chain, its proof is relatively short and\ntransparent.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:04:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["De Roeck","Wojciech",""],["Huveneers","Fran\u00e7ois",""],["Meeus","Branko",""],["Pro\u015bniak","Oskar A.",""]]}
{"id":"2308.08463","submitter":"Zilong Li","authors":"Zilong Li, Chenglong Ma, Jie Chen, Junping Zhang, Hongming Shan","title":"Learning to Distill Global Representation for Sparse-View CT","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sparse-view computed tomography (CT) -- using a small number of projections\nfor tomographic reconstruction -- enables much lower radiation dose to patients\nand accelerated data acquisition. The reconstructed images, however, suffer\nfrom strong artifacts, greatly limiting their diagnostic value. Current trends\nfor sparse-view CT turn to the raw data for better information recovery. The\nresultant dual-domain methods, nonetheless, suffer from secondary artifacts,\nespecially in ultra-sparse view scenarios, and their generalization to other\nscanners/protocols is greatly limited. A crucial question arises: have the\nimage post-processing methods reached the limit? Our answer is not yet. In this\npaper, we stick to image post-processing methods due to great flexibility and\npropose global representation (GloRe) distillation framework for sparse-view\nCT, termed GloReDi. First, we propose to learn GloRe with Fourier convolution,\nso each element in GloRe has an image-wide receptive field. Second, unlike\nmethods that only use the full-view images for supervision, we propose to\ndistill GloRe from intermediate-view reconstructed images that are readily\navailable but not explored in previous literature. The success of GloRe\ndistillation is attributed to two key components: representation directional\ndistillation to align the GloRe directions, and band-pass-specific contrastive\ndistillation to gain clinically important details. Extensive experiments\ndemonstrate the superiority of the proposed GloReDi over the state-of-the-art\nmethods, including dual-domain ones. The source code is available at\nhttps://github.com/longzilicart/GloReDi.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:08:22 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 07:30:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Zilong",""],["Ma","Chenglong",""],["Chen","Jie",""],["Zhang","Junping",""],["Shan","Hongming",""]]}
{"id":"2308.08464","submitter":"Dibyakrupa Sahoo","authors":"C. S. Kim, M. V. N. Murthy and Dibyakrupa Sahoo","title":"Comments on \"On the Dirac-Majorana neutrinos distinction in four-body\n  decays\" (arXiv:2305.14140 [hep-ph])","comments":"3 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In arXiv:2305.14140 [hep-ph] the authors analyze the radiative leptonic decay\n$\\ell^- \\to \\nu_\\ell \\, \\overline{\\nu}_{\\ell'} \\, \\ell^{\\prime -} \\, \\gamma$ to\ndistinguish between Dirac and Majorana nature of neutrinos. They utilize the\nback-to-back kinematics for this purpose, a special kinematic configuration\nwhich we first proposed in our paper arXiv:2106.11785 [hep-ph]. However, their\nanalysis suffers from two fundamental issues: (1) anti-symmetrization of their\namplitude and (2) their study of the special back-to-back configuration. This\nmakes their conclusion and comments invalid and untenable.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:08:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kim","C. S.",""],["Murthy","M. V. N.",""],["Sahoo","Dibyakrupa",""]]}
{"id":"2308.08465","submitter":"Xinyu Bai Mr","authors":"Xinyu Bai, Wenjia Bai","title":"Hierarchical Uncertainty Estimation for Medical Image Segmentation\n  Networks","comments":"8 pages, 3 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":"  Learning a medical image segmentation model is an inherently ambiguous task,\nas uncertainties exist in both images (noise) and manual annotations (human\nerrors and bias) used for model training. To build a trustworthy image\nsegmentation model, it is important to not just evaluate its performance but\nalso estimate the uncertainty of the model prediction. Most state-of-the-art\nimage segmentation networks adopt a hierarchical encoder architecture,\nextracting image features at multiple resolution levels from fine to coarse. In\nthis work, we leverage this hierarchical image representation and propose a\nsimple yet effective method for estimating uncertainties at multiple levels.\nThe multi-level uncertainties are modelled via the skip-connection module and\nthen sampled to generate an uncertainty map for the predicted image\nsegmentation. We demonstrate that a deep learning segmentation network such as\nU-net, when implemented with such hierarchical uncertainty estimation module,\ncan achieve a high segmentation performance, while at the same time provide\nmeaningful uncertainty maps that can be used for out-of-distribution detection.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:09:23 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bai","Xinyu",""],["Bai","Wenjia",""]]}
{"id":"2308.08466","submitter":"Stephen Ferguson","authors":"Nicholas D. Edwards, Enzo de Jong, Stephen T. Ferguson","title":"Graphing methods for Kendall's {\\tau}","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ranked data is commonly used in research across many fields of study\nincluding medicine, biology, psychology, and economics. One common statistic\nused for analyzing ranked data is Kendall's {\\tau} coefficient, a\nnon-parametric measure of rank correlation which describes the strength of the\nassociation between two monotonic continuous or ordinal variables. While the\nmathematics involved in calculating Kendall's {\\tau} is well-established, there\nare relatively few graphing methods available to visualize the results. Here,\nwe describe a visualization method for Kendall's {\\tau} which uses a series of\nrigid Euclidean transformations along a Cartesian plane to map rank pairs into\ndiscrete quadrants. The resulting graph provides a visualization of rank\ncorrelation which helps display the proportion of concordant and discordant\npairs. Moreover, this method highlights other key features of the data which\nare not represented by Kendall's {\\tau} alone but may nevertheless be\nmeaningful, such as the relationship between discrete pairs of observations. We\ndemonstrate the effectiveness of our approach through several examples and\ncompare our results to other visualization methods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:13:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Edwards","Nicholas D.",""],["de Jong","Enzo",""],["Ferguson","Stephen T.",""]]}
{"id":"2308.08467","submitter":"Manuel Radons","authors":"Lars Simon and Manuel Radons","title":"On Neural Quantum Support Vector Machines","comments":"13 pages, 0 figures. arXiv admin note: substantial text overlap with\n  arXiv:2308.07204","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In \\cite{simon2023algorithms} we introduced four algorithms for the training\nof neural support vector machines (NSVMs) and demonstrated their feasibility.\nIn this note we introduce neural quantum support vector machines, that is,\nNSVMs with a quantum kernel, and extend our results to this setting.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:15:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Simon","Lars",""],["Radons","Manuel",""]]}
{"id":"2308.08468","submitter":"Sifan Wang","authors":"Sifan Wang, Shyam Sankaran, Hanwen Wang, Paris Perdikaris","title":"An Expert's Guide to Training Physics-informed Neural Networks","comments":"36 pages, 25 figures, 13 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Physics-informed neural networks (PINNs) have been popularized as a deep\nlearning framework that can seamlessly synthesize observational data and\npartial differential equation (PDE) constraints. Their practical effectiveness\nhowever can be hampered by training pathologies, but also oftentimes by poor\nchoices made by users who lack deep learning expertise. In this paper we\npresent a series of best practices that can significantly improve the training\nefficiency and overall accuracy of PINNs. We also put forth a series of\nchallenging benchmark problems that highlight some of the most prominent\ndifficulties in training PINNs, and present comprehensive and fully\nreproducible ablation studies that demonstrate how different architecture\nchoices and training strategies affect the test accuracy of the resulting\nmodels. We show that the methods and guiding principles put forth in this study\nlead to state-of-the-art results and provide strong baselines that future\nstudies should use for comparison purposes. To this end, we also release a\nhighly optimized library in JAX that can be used to reproduce all results\nreported in this paper, enable future research studies, as well as facilitate\neasy adaptation to new use-case scenarios.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:19:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wang","Sifan",""],["Sankaran","Shyam",""],["Wang","Hanwen",""],["Perdikaris","Paris",""]]}
{"id":"2308.08469","submitter":"Ching Chang","authors":"Ching Chang, Wen-Chih Peng, Tien-Fu Chen","title":"LLM4TS: Two-Stage Fine-Tuning for Time-Series Forecasting with\n  Pre-Trained LLMs","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 work, we leverage pre-trained Large Language Models (LLMs) to enhance\ntime-series forecasting. Mirroring the growing interest in unifying models for\nNatural Language Processing and Computer Vision, we envision creating an\nanalogous model for long-term time-series forecasting. Due to limited\nlarge-scale time-series data for building robust foundation models, our\napproach LLM4TS focuses on leveraging the strengths of pre-trained LLMs. By\ncombining time-series patching with temporal encoding, we have enhanced the\ncapability of LLMs to handle time-series data effectively. Inspired by the\nsupervised fine-tuning in chatbot domains, we prioritize a two-stage\nfine-tuning process: first conducting supervised fine-tuning to orient the LLM\ntowards time-series data, followed by task-specific downstream fine-tuning.\nFurthermore, to unlock the flexibility of pre-trained LLMs without extensive\nparameter adjustments, we adopt several Parameter-Efficient Fine-Tuning (PEFT)\ntechniques. Drawing on these innovations, LLM4TS has yielded state-of-the-art\nresults in long-term forecasting. Our model has also shown exceptional\ncapabilities as both a robust representation learner and an effective few-shot\nlearner, thanks to the knowledge transferred from the pre-trained LLM.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:19:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chang","Ching",""],["Peng","Wen-Chih",""],["Chen","Tien-Fu",""]]}
{"id":"2308.08470","submitter":"Iva Vilovic","authors":"Iva Vilovi\\'c, Dirk Schulze-Makuch and Ren\\'e Heller","title":"Variations in climate habitability parameters and their effect on\n  Earth's biosphere during the Phanerozoic Eon","comments":null,"journal-ref":"Sci Rep 13, 12663 (2023)","doi":"10.1038/s41598-023-39716-z","report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Essential insights on the characterization and quality of a detectable\nbiosphere are gained by analyzing the effects of its environmental parameters.\nWe compiled environmental and biological properties of the Phanerozoic Eon from\nvarious published data sets and conducted a correlation analysis to assess\nvariations in parameters relevant to the habitability of Earth's biosphere. We\nshowed that environmental parameters such as oxygen, global average surface\ntemperatures, runoff rates and carbon dioxide are interrelated and play a key\nrole in the changes of biomass and biodiversity. We showed that there were\nseveral periods with a highly thriving biosphere, with one even surpassing\npresent day biodiversity and biomass. Those periods were characterized by\nincreased oxygen levels and global runoff rates, as well as moderate global\naverage surface temperatures, as long as no large or rapid positive and/or\nnegative temperature excursions occurred. High oxygen contents are diagnostic\nof biomass production by continental plant life. We find that exceptionally\nhigh oxygen levels can at least in one instance compensate for decreased\nrelative humidities, providing an even more habitable environment compared to\ntoday. Beyond Earth, these results will help us to understand how environmental\nparameters affect biospheres on extrasolar planets and guide us in our search\nfor extraterrestrial life.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:20:10 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Vilovi\u0107","Iva",""],["Schulze-Makuch","Dirk",""],["Heller","Ren\u00e9",""]]}
{"id":"2308.08471","submitter":"Emily Jensen","authors":"Emily Jensen, Neelay Junnarkar, Murat Arcak, Xiaofan Wu, Suat Gumussoy","title":"Certifying Stability and Performance of Uncertain Differential-Algebraic\n  Systems: A Dissipativity Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper presents a novel framework for characterizing dissipativity of\nuncertain dynamical systems subject to algebraic constraints. The main results\nprovide sufficient conditions for dissipativity when uncertainties are\ncharacterized by integral quadratic constraints. For polynomial or linear\ndynamics, these conditions can be efficiently verified through sum-of-squares\nor semidefinite programming. The practical impact of this work is illustrated\nthrough a case study that examines performance of the IEEE 39-bus power network\nwith uncertainties used to model a set of potential line failures.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:20:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jensen","Emily",""],["Junnarkar","Neelay",""],["Arcak","Murat",""],["Wu","Xiaofan",""],["Gumussoy","Suat",""]]}
{"id":"2308.08472","submitter":"Muhammad Muzammel","authors":"Alice Othmani and Muhammad Muzammel","title":"An Ambient Intelligence-based Approach For Longitudinal Monitoring of\n  Verbal and Vocal Depression Symptoms","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic speech recognition (ASR) technology can aid in the detection,\nmonitoring, and assessment of depressive symptoms in individuals. ASR systems\nhave been used as a tool to analyze speech patterns and characteristics that\nare indicative of depression. Depression affects not only a person's mood but\nalso their speech patterns. Individuals with depression may exhibit changes in\nspeech, such as slower speech rate, longer pauses, reduced pitch variability,\nand decreased overall speech fluency. Despite the growing use of machine\nlearning in diagnosing depression, there is a lack of studies addressing the\nissue of relapse. Furthermore, previous research on relapse prediction has\nprimarily focused on clinical variables and has not taken into account other\nfactors such as verbal and non-verbal cues. Another major challenge in\ndepression relapse research is the scarcity of publicly available datasets. To\novercome these issues, we propose a one-shot learning framework for detecting\ndepression relapse from speech. We define depression relapse as the similarity\nbetween the speech audio and textual encoding of a subject and that of a\ndepressed individual. To detect depression relapse based on this definition, we\nemploy a Siamese neural network that models the similarity between of two\ninstances. Our proposed approach shows promising results and represents a new\nadvancement in the field of automatic depression relapse detection and mental\ndisorders monitoring.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:21:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Othmani","Alice",""],["Muzammel","Muhammad",""]]}
{"id":"2308.08473","submitter":"Le Chen","authors":"Le Chen, Wenhao Wu, Stephen F. Siegel, Pei-Hung Lin, Chunhua Liao","title":"DataRaceBench V1.4.1 and DataRaceBench-ML V0.1: Benchmark Suites for\n  Data Race Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data races pose a significant threat in multi-threaded parallel applications\ndue to their negative impact on program correctness. DataRaceBench, an\nopen-source benchmark suite, is specifically crafted to assess these data race\ndetection tools in a systematic and measurable manner. Machine learning\ntechniques have recently demonstrated considerable potential in\nhigh-performance computing (HPC) program analysis and optimization. However,\nthese techniques require specialized data formats for training and refinement.\nThis paper presents the latest update to DataRaceBench, incorporating new data\nrace contributions from Wu et al. \\cite{wu2023model}, and introduces a derived\ndataset named DataRaceBench-ML (DRB-ML) \\cite{drbml}. DRB-ML aligns with the\nemerging trend of machine learning and large language models. Originating from\nDataRaceBench, this dataset includes detailed labels that denote the presence\nof a data race and provides comprehensive details of associated variables, such\nas variable names, line numbers, and the operation (read/write). Unique to\nDRB-ML, we have also integrated a series of tailored prompt-response pairs\nspecifically designed for LLM fine-tuning.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:23:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Le",""],["Wu","Wenhao",""],["Siegel","Stephen F.",""],["Lin","Pei-Hung",""],["Liao","Chunhua",""]]}
{"id":"2308.08474","submitter":"Erasmo Ferreira","authors":"Erasmo Ferreira and Anderson Kendi Kohara","title":"Energy dependence of proton-proton elastic scattering at large momentum\n  transfer","comments":"6 pages, 5 figures and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The measurements of proton-proton elastic scattering for large momentum\ntransfer at energies in the range $\\approx$ 20 to 60 GeV show a simple\nbehaviour of form $d \\sigma/dt \\approx {\\rm const}~|t|^{-8}$, apparently with\nno energy dependence. In the present work detailed analysis of the data shows a\ndecrease of the magnitude of the tail with the energy, still with preservation\nof the power $|t|^{-8}$. The analysis allows the definition of a band for the\nenergy dependence with the form of a power of the strong coupling\n$\\alpha_S^{1.57}$. The rate of decrease describes very well the data at the\ndistant energy $\\sqrt{s}$ = 13 TeV, with reduction of the cross section by a\nfactor 5.71. This result gives prediction for new experiments at high energies,\nand opens important question for theoretical investigation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:24:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ferreira","Erasmo",""],["Kohara","Anderson Kendi",""]]}
{"id":"2308.08475","submitter":"Frank Elavsky","authors":"Frank Elavsky, Lucas Nadolskis, Dominik Moritz","title":"Data Navigator: An accessibility-centered data navigation toolkit","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":"  Making data visualizations accessible for people with disabilities remains a\nsignificant challenge in current practitioner efforts. Existing visualizations\noften lack an underlying navigable structure, fail to engage necessary input\nmodalities, and rely heavily on visual-only rendering practices. These\nlimitations exclude people with disabilities, especially users of assistive\ntechnologies. To address these challenges, we present Data Navigator: a system\nbuilt on a dynamic graph structure, enabling developers to construct navigable\nlists, trees, graphs, and flows as well as spatial, diagrammatic, and\ngeographic relations. Data Navigator supports a wide range of input modalities:\nscreen reader, keyboard, speech, gesture detection, and even fabricated\nassistive devices. We present 3 case examples with Data Navigator,\ndemonstrating we can provide accessible navigation structures on top of raster\nimages, integrate with existing toolkits at scale, and rapidly develop novel\nprototypes. Data Navigator is a step towards making accessible data\nvisualizations easier to design and implement.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:28:36 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Elavsky","Frank",""],["Nadolskis","Lucas",""],["Moritz","Dominik",""]]}
{"id":"2308.08476","submitter":"Lei Zhao","authors":"Lei Zhao, Bo Li, Xingxing Wei","title":"Classification Committee for Active Deep Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In object detection, the cost of labeling is much high because it needs not\nonly to confirm the categories of multiple objects in an image but also to\naccurately determine the bounding boxes of each object. Thus, integrating\nactive learning into object detection will raise pretty positive significance.\nIn this paper, we propose a classification committee for active deep object\ndetection method by introducing a discrepancy mechanism of multiple classifiers\nfor samples' selection when training object detectors. The model contains a\nmain detector and a classification committee. The main detector denotes the\ntarget object detector trained from a labeled pool composed of the selected\ninformative images. The role of the classification committee is to select the\nmost informative images according to their uncertainty values from the view of\nclassification, which is expected to focus more on the discrepancy and\nrepresentative of instances. Specifically, they compute the uncertainty for a\nspecified instance within the image by measuring its discrepancy output by the\ncommittee pre-trained via the proposed Maximum Classifiers Discrepancy Group\nLoss (MCDGL). The most informative images are finally determined by selecting\nthe ones with many high-uncertainty instances. Besides, to mitigate the impact\nof interference instances, we design a Focus on Positive Instances Loss (FPIL)\nto make the committee the ability to automatically focus on the representative\ninstances as well as precisely encode their discrepancies for the same\ninstance. Experiments are conducted on Pascal VOC and COCO datasets versus some\npopular object detectors. And results show that our method outperforms the\nstate-of-the-art active learning methods, which verifies the effectiveness of\nthe proposed method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:31:36 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 07:52:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhao","Lei",""],["Li","Bo",""],["Wei","Xingxing",""]]}
{"id":"2308.08477","submitter":"Lei Wu","authors":"Yuanlin Gong, Xin Liu, Lei Wu, Qiaoli Yang, Bin Zhu","title":"Detecting Ultra-light Dark Matter with Stimulated Annihilation","comments":"6pages, 2 figures, discussions and references added","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultra-light Dark Matter (ULDM) is one of the most promising DM candidates. We\nfind that the annihilation rate of the ULDM in the presence of background\nphoton radiation can be greatly enhanced due to the Bose enhancement. We\npropose to utilize such stimulated annihilation to probe the ULDM. By emitting\na beam of radio into space, we can have a distinctive reflected electromagnetic\nwave with an angular frequency equal to the ULDM mass. We show that\nlow-frequency radio telescopes, such as LOFAR, UTR-2 and ngLOBO, can offer a\nnew avenue for detecting this signal, especially for the local DM halo model\nnear the Earth. With a power of 50 MW emitter, the expected limits could be\nseveral orders of magnitude stronger than that from Big Bang nucleosynthesis\n(BBN) in the ULDM mass $m_\\phi$ range, $2.07 \\times 10^{-8}\\mathrm{~eV} \\sim\n4.5 \\times 10^{-8}\\mathrm{~eV}$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:36:28 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 13:55:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gong","Yuanlin",""],["Liu","Xin",""],["Wu","Lei",""],["Yang","Qiaoli",""],["Zhu","Bin",""]]}
{"id":"2308.08478","submitter":"Yuhao Wang","authors":"Alexander Shapiro, Enlu Zhou, Yifan Lin, Yuhao Wang","title":"Episodic Bayesian Optimal Control with Unknown Randomness Distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic optimal control with unknown randomness distributions has been\nstudied for a long time, encompassing robust control, distributionally robust\ncontrol, and adaptive control. We propose a new episodic Bayesian approach that\nincorporates Bayesian learning with optimal control. In each episode, the\napproach learns the randomness distribution with a Bayesian posterior and\nsubsequently solves the corresponding Bayesian average estimate of the true\nproblem. The resulting policy is exercised during the episode, while additional\ndata/observations of the randomness are collected to update the Bayesian\nposterior for the next episode. We show that the resulting episodic value\nfunctions and policies converge almost surely to their optimal counterparts of\nthe true problem if the parametrized model of the randomness distribution is\ncorrectly specified. We further show that the asymptotic convergence rate of\nthe episodic value functions is of the order $O(N^{-1/2})$. We develop an\nefficient computational method based on stochastic dual dynamic programming for\na class of problems that have convex value functions. Our numerical results on\na classical inventory control problem verify the theoretical convergence\nresults and demonstrate the effectiveness of the proposed computational method.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:36:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shapiro","Alexander",""],["Zhou","Enlu",""],["Lin","Yifan",""],["Wang","Yuhao",""]]}
{"id":"2308.08479","submitter":"Johan Edstedt","authors":"Johan Edstedt, Georg B\\\"okman, M{\\aa}rten Wadenb\\\"ack, Michael\n  Felsberg","title":"DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local\n  Feature Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Keypoint detection is a pivotal step in 3D reconstruction, whereby sets of\n(up to) K points are detected in each view of a scene. Crucially, the detected\npoints need to be consistent between views, i.e., correspond to the same 3D\npoint in the scene. One of the main challenges with keypoint detection is the\nformulation of the learning objective. Previous learning-based methods\ntypically jointly learn descriptors with keypoints, and treat the keypoint\ndetection as a binary classification task on mutual nearest neighbours.\nHowever, basing keypoint detection on descriptor nearest neighbours is a proxy\ntask, which is not guaranteed to produce 3D-consistent keypoints. Furthermore,\nthis ties the keypoints to a specific descriptor, complicating downstream\nusage. In this work, we instead learn keypoints directly from 3D consistency.\nTo this end, we train the detector to detect tracks from large-scale SfM. As\nthese points are often overly sparse, we derive a semi-supervised two-view\ndetection objective to expand this set to a desired number of detections. To\ntrain a descriptor, we maximize the mutual nearest neighbour objective over the\nkeypoints with a separate network. Results show that our approach, DeDoDe,\nachieves significant gains on multiple geometry benchmarks. Code is provided at\nhttps://github.com/Parskatt/DeDoDe .\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:37:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Edstedt","Johan",""],["B\u00f6kman","Georg",""],["Wadenb\u00e4ck","M\u00e5rten",""],["Felsberg","Michael",""]]}
{"id":"2308.08480","submitter":"Clara Macabiau","authors":"Clara Macabiau, Thanh-Dung Le, Kevin Albert, Philippe Jouvet, Rita\n  Noumeir","title":"Label Propagation Techniques for Artifact Detection in Imbalanced\n  Classes using Photoplethysmogram Signals","comments":"Under preparation to submit to IEEE for possible publications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Photoplethysmogram (PPG) signals are widely used in healthcare for monitoring\nvital signs, but they are susceptible to motion artifacts that can lead to\ninaccurate interpretations. In this study, the use of label propagation\ntechniques to propagate labels among PPG samples is explored, particularly in\nimbalanced class scenarios where clean PPG samples are significantly\noutnumbered by artifact-contaminated samples. With a precision of 91%, a recall\nof 90% and an F1 score of 90% for the class without artifacts, the results\ndemonstrate its effectiveness in labeling a medical dataset, even when clean\nsamples are rare. For the classification of artifacts our study compares\nsupervised classifiers such as conventional classifiers and neural networks\n(MLP, Transformers, FCN) with the semi-supervised label propagation algorithm.\nWith a precision of 89%, a recall of 95% and an F1 score of 92%, the KNN\nsupervised model gives good results, but the semi-supervised algorithm performs\nbetter in detecting artifacts. The findings suggest that the semi-supervised\nalgorithm label propagation hold promise for artifact detection in PPG signals,\nwhich can enhance the reliability of PPG-based health monitoring systems in\nreal-world applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:38:03 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Macabiau","Clara",""],["Le","Thanh-Dung",""],["Albert","Kevin",""],["Jouvet","Philippe",""],["Noumeir","Rita",""]]}
{"id":"2308.08481","submitter":"Matteo Iacopini","authors":"Federico Bassetti and Roberto Casarin and Matteo Iacopini","title":"A Spatiotemporal Gamma Shot Noise Cox Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A new discrete-time shot noise Cox process for spatiotemporal data is\nproposed. The random intensity is driven by a dependent sequence of latent\ngamma random measures. Some properties of the latent process are derived, such\nas an autoregressive representation and the Laplace functional. Moreover, these\nresults are used to derive the moment, predictive, and pair correlation\nmeasures of the proposed shot noise Cox process. The model is flexible but\nstill tractable and allows for capturing persistence, global trends, and latent\nspatial and temporal factors. A Bayesian inference approach is adopted, and an\nefficient Markov Chain Monte Carlo procedure based on conditional Sequential\nMonte Carlo is proposed. An application to georeferenced wildfire data\nillustrates the properties of the model and inference.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:39:27 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Bassetti","Federico",""],["Casarin","Roberto",""],["Iacopini","Matteo",""]]}
{"id":"2308.08482","submitter":"Yi Zhang","authors":"Yi Zhang, Jitao Sang, Junyang Wang, Dongmei Jiang, Yaowei Wang","title":"Benign Shortcut for Debiasing: Fair Visual Recognition via Intervention\n  with Shortcut Features","comments":"arXiv admin note: text overlap with arXiv:2211.01253","journal-ref":null,"doi":"10.1145/3581783.3612317","report-no":null,"categories":"cs.LG cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning models often learn to make predictions that rely on\nsensitive social attributes like gender and race, which poses significant\nfairness risks, especially in societal applications, such as hiring, banking,\nand criminal justice. Existing work tackles this issue by minimizing the\nemployed information about social attributes in models for debiasing. However,\nthe high correlation between target task and these social attributes makes\nlearning on the target task incompatible with debiasing. Given that model bias\narises due to the learning of bias features (\\emph{i.e}., gender) that help\ntarget task optimization, we explore the following research question: \\emph{Can\nwe leverage shortcut features to replace the role of bias feature in target\ntask optimization for debiasing?} To this end, we propose \\emph{Shortcut\nDebiasing}, to first transfer the target task's learning of bias attributes\nfrom bias features to shortcut features, and then employ causal intervention to\neliminate shortcut features during inference. The key idea of \\emph{Shortcut\nDebiasing} is to design controllable shortcut features to on one hand replace\nbias features in contributing to the target task during the training stage, and\non the other hand be easily removed by intervention during the inference stage.\nThis guarantees the learning of the target task does not hinder the elimination\nof bias features. We apply \\emph{Shortcut Debiasing} to several benchmark\ndatasets, and achieve significant improvements over the state-of-the-art\ndebiasing methods in both accuracy and fairness.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 00:40:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Yi",""],["Sang","Jitao",""],["Wang","Junyang",""],["Jiang","Dongmei",""],["Wang","Yaowei",""]]}
{"id":"2308.08483","submitter":"Xiang Li","authors":"Shuwei Chen, Xiang Li, Jian Dong, Jin Zhang, Yongkang Wang and\n  Xingxing Wang","title":"TBIN: Modeling Long Textual Behavior Data for CTR Prediction","comments":null,"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":"  Click-through rate (CTR) prediction plays a pivotal role in the success of\nrecommendations. Inspired by the recent thriving of language models (LMs), a\nsurge of works improve prediction by organizing user behavior data in a\n\\textbf{textual} format and using LMs to understand user interest at a semantic\nlevel. While promising, these works have to truncate the textual data to reduce\nthe quadratic computational overhead of self-attention in LMs. However, it has\nbeen studied that long user behavior data can significantly benefit CTR\nprediction. In addition, these works typically condense user diverse interests\ninto a single feature vector, which hinders the expressive capability of the\nmodel. In this paper, we propose a \\textbf{T}extual \\textbf{B}ehavior-based\n\\textbf{I}nterest Chunking \\textbf{N}etwork (TBIN), which tackles the above\nlimitations by combining an efficient locality-sensitive hashing algorithm and\na shifted chunk-based self-attention. The resulting user diverse interests are\ndynamically activated, producing user interest representation towards the\ntarget item. Finally, the results of both offline and online experiments on\nreal-world food recommendation platform demonstrate the effectiveness of TBIN.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:48:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Shuwei",""],["Li","Xiang",""],["Dong","Jian",""],["Zhang","Jin",""],["Wang","Yongkang",""],["Wang","Xingxing",""]]}
{"id":"2308.08484","submitter":"Florian Wetzels","authors":"Florian Wetzels, Markus Anders, Christoph Garth","title":"Taming Horizontal Instability in Merge Trees: On the Computation of a\n  Comprehensive Deformation-based Edit Distance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comparative analysis of scalar fields in scientific visualization often\ninvolves distance functions on topological abstractions. This paper focuses on\nthe merge tree abstraction (representing the nesting of sub- or superlevel\nsets) and proposes the application of the unconstrained deformation-based edit\ndistance. Previous approaches on merge trees often suffer from instability:\nsmall perturbations in the data can lead to large distances of the\nabstractions. While some existing methods can handle so-called vertical\ninstability, the unconstrained deformation-based edit distance addresses both\nvertical and horizontal instabilities, also called saddle swaps. We establish\nthe computational complexity as NP-complete, and provide an integer linear\nprogram formulation for computation. Experimental results on the TOSCA shape\nmatching ensemble provide evidence for the stability of the proposed distance.\nWe thereby showcase the potential of handling saddle swaps for comparison of\nscalar fields through merge trees.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:40:16 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Wetzels","Florian",""],["Anders","Markus",""],["Garth","Christoph",""]]}
{"id":"2308.08485","submitter":"Yoginder Kumar Negi Dr","authors":"V. Viswarupa, Yoginder Kumar Negi and N. Balakrishnan","title":"Electro-acoustic Scattering from a Pulsating Sphere","comments":"8 Pages","journal-ref":"IEEE Journal Multiscale and Multiphysics Computational Techniques\n  2023","doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we show the RCS enhancement due to the acoustic disturbances\naround a pulsating sphere. The acoustic variation is modeled with the\ndielectric inhomogeneities around the sphere caused by the pressure\nfluctuations due to the acoustic source. RCS is computed for the modeled\ndielectric pulsating sphere, a cube, and a cone on a cylinder across a\nfrequency band using Finite Difference Time Domain (FDTD) method. The RCS of\nthe pulsating sphere and other objects considered are dominated by the\nbackground scattering from the pulsating object. In this work, we show that the\ndielectric variation due to the acoustic source can be detected even if there\nis no scattering from the object. The scattering from the dielectric variation\nleads to the detection of Bragg scattering along with a significant increase in\nRCS.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:41:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Viswarupa","V.",""],["Negi","Yoginder Kumar",""],["Balakrishnan","N.",""]]}
{"id":"2308.08486","submitter":"Vera Uzunova A.","authors":"Vera Uzunova, Lukas K\\\"orber, Agapi Kavvadia, Gwendolyn Quasebarth,\n  Helmut Schultheiss, Attila K\\'akay and Boris Ivanov","title":"Nontrivial Aharonov-Bohm effect and alternating dispersion of magnons in\n  cone-state ferromagnetic rings","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Soft magnetic dots in the form of thin rings have unique topological\nproperties. They can be in a vortex state with no vortex core. Here, we study\nthe magnon modes of such systems both analytically and numerically. In an\nexternal magnetic field, magnetic rings are characterized by easy-cone\nmagnetization and shows a giant splitting of doublets for modes with the\nopposite value of the azimuthal mode quantum number. The effect of the\nsplitting can be refereed as a magnon analog of the topology-induced\nAharonov-Bohm effect. For this we develop an analytical theory to describe the\nnon-monotonic dependence of the mode frequencies on the azimuthal mode number,\ninfluenced by the balance between the local exchange and non-local dipole\ninteractions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:41:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Uzunova","Vera",""],["K\u00f6rber","Lukas",""],["Kavvadia","Agapi",""],["Quasebarth","Gwendolyn",""],["Schultheiss","Helmut",""],["K\u00e1kay","Attila",""],["Ivanov","Boris",""]]}
{"id":"2308.08487","submitter":"Junwei Pan","authors":"Haolin Zhou, Junwei Pan, Xinyi Zhou, Xihua Chen, Jie Jiang, Xiaofeng\n  Gao, Guihai Chen","title":"Temporal Interest Network for Click-Through Rate Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The history of user behaviors constitutes one of the most significant\ncharacteristics in predicting the click-through rate (CTR), owing to their\nstrong semantic and temporal correlation with the target item. While the\nliterature has individually examined each of these correlations, research has\nyet to analyze them in combination, that is, the quadruple correlation of\n(behavior semantics, target semantics, behavior temporal, and target temporal).\nThe effect of this correlation on performance and the extent to which existing\nmethods learn it remain unknown. To address this gap, we empirically measure\nthe quadruple correlation and observe intuitive yet robust quadruple patterns.\nWe measure the learned correlation of several representative user behavior\nmethods, but to our surprise, none of them learn such a pattern, especially the\ntemporal one.\n  In this paper, we propose the Temporal Interest Network (TIN) to capture the\nquadruple semantic and temporal correlation between behaviors and the target.\nWe achieve this by incorporating target-aware temporal encoding, in addition to\nsemantic embedding, to represent behaviors and the target. Furthermore, we\ndeploy target-aware attention, along with target-aware representation, to\nexplicitly conduct the 4-way interaction. We performed comprehensive\nevaluations on the Amazon and Alibaba datasets. Our proposed TIN outperforms\nthe best-performing baselines by 0.43\\% and 0.29\\% on two datasets,\nrespectively. Comprehensive analysis and visualization show that TIN is indeed\ncapable of learning the quadruple correlation effectively, while all existing\nmethods fail to do so. We provide our implementation of TIN in Tensorflow.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:48:44 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhou","Haolin",""],["Pan","Junwei",""],["Zhou","Xinyi",""],["Chen","Xihua",""],["Jiang","Jie",""],["Gao","Xiaofeng",""],["Chen","Guihai",""]]}
{"id":"2308.08488","submitter":"Yusheng Dai","authors":"Yusheng Dai, Hang Chen, Jun Du, Xiaofei Ding, Ning Ding, Feijun Jiang,\n  Chin-Hui Lee","title":"Improving Audio-Visual Speech Recognition by Lip-Subword Correlation\n  Based Visual Pre-training and Cross-Modal Fusion Encoder","comments":"6 pages, 2 figures, published in ICME2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent research, slight performance improvement is observed from automatic\nspeech recognition systems to audio-visual speech recognition systems in the\nend-to-end framework with low-quality videos. Unmatching convergence rates and\nspecialized input representations between audio and visual modalities are\nconsidered to cause the problem. In this paper, we propose two novel techniques\nto improve audio-visual speech recognition (AVSR) under a pre-training and\nfine-tuning training framework. First, we explore the correlation between lip\nshapes and syllable-level subword units in Mandarin to establish good\nframe-level syllable boundaries from lip shapes. This enables accurate\nalignment of video and audio streams during visual model pre-training and\ncross-modal fusion. Next, we propose an audio-guided cross-modal fusion encoder\n(CMFE) neural network to utilize main training parameters for multiple\ncross-modal attention layers to make full use of modality complementarity.\nExperiments on the MISP2021-AVSR data set show the effectiveness of the two\nproposed techniques. Together, using only a relatively small amount of training\ndata, the final system achieves better performances than state-of-the-art\nsystems with more complex front-ends and back-ends.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:19:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Dai","Yusheng",""],["Chen","Hang",""],["Du","Jun",""],["Ding","Xiaofei",""],["Ding","Ning",""],["Jiang","Feijun",""],["Lee","Chin-Hui",""]]}
{"id":"2308.08490","submitter":"Mario Damiano","authors":"Mario Damiano, Renyu Hu, Bertrand Mennesson","title":"Reflected spectroscopy of small exoplanets III: probing the UV band to\n  measure biosignature gasses","comments":"13 pages, 8 figures, 3 tables, accepted for publication in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Direct-imaging observations of terrestrial exoplanets will enable their\natmospheric characterization and habitability assessment. Considering the\nEarth, the key atmospheric signatures for the biosphere is O$_2$ and the\nphotochemical product O$_3$. However, this O$_2$-O$_3$ biosignature is not\ndetectable in the visible wavelengths for most of the time after the emergence\nof oxygenic photosynthesis life (i.e., the Proterozoic Earth). Here we\ndemonstrate spectroscopic observations in the ultraviolet wavelengths for\ndetecting and characterizing O$_2$ and O$_3$ in Proterozoic Earth-like planets,\nusing ExoReL$^\\Re$. For an O$_2$ mixing ratio 2 to 3 orders of magnitude less\nthan the present-day Earth, and an O$_3$ mixing ratio of $10^{-7}-10^{-6}$, we\nfind that O$_3$ can be detected and its mixing ratio can be measured precisely\n(within $~1$ order of magnitude) in the ultraviolet ($0.25-0.4\\ \\mu$m) in\naddition to visible-wavelength spectroscopy. With modest spectral resolution\n($R=7$) and S/N ($\\sim10$) in the ultraviolet, the O$_3$ detection is robust\nagainst other potential gases absorbing in the ultraviolet (e.g., H$_2$S and\nSO$_2$), as well as the short-wavelength cutoff between 0.2 and 0.25 $\\mu$m.\nWhile the O$_3$ detection does not rely on the near-infrared spectra, extending\nthe wavelength coverage to the near-infrared ($1-1.8\\ \\mu$m) would provide\nessential information to interpret the O$_3$ biosignature, including the mixing\nratio of H$_2$O, the cloud pressure, as well as the determination of the\ndominant gas of the atmosphere. The ultraviolet and near-infrared capabilities\nshould thus be evaluated as critical components for future missions aiming at\nimaging and characterizing terrestrial exoplanets, such as the Habitable Worlds\nObservatory.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:45:49 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Damiano","Mario",""],["Hu","Renyu",""],["Mennesson","Bertrand",""]]}
{"id":"2308.08491","submitter":"Gonzalo Manzano Paule","authors":"Mar Ferri-Cort\\'es, Jose A. Almanza-Marrero, Rosa L\\'opez, Roberta\n  Zambrini and Gonzalo Manzano","title":"Entropy production and fluctuation theorems for monitored quantum\n  systems under imperfect detection","comments":"5 + 10 pages, 2 figures. The two first authors contributed equally to\n  this work","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 thermodynamic behavior of Markovian open quantum systems can be described\nat the level of fluctuations by using continuous monitoring approaches.\nHowever, practical applications require assessing imperfect detection schemes,\nwhere the definition of main thermodynamic quantities becomes subtle and\nuniversal fluctuation relations are unknown. Here we fill this gap by deriving\na universal fluctuation relation that links entropy production in ideal and in\ninefficient monitoring setups. This provides a suitable estimator of\ndissipation using imperfect detection records that lower bounds the underlying\nentropy production at the level of single trajectories. We illustrate our\nfindings with a driven-dissipative two-level system following quantum jump\ntrajectories.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:47:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ferri-Cort\u00e9s","Mar",""],["Almanza-Marrero","Jose A.",""],["L\u00f3pez","Rosa",""],["Zambrini","Roberta",""],["Manzano","Gonzalo",""]]}
{"id":"2308.08492","submitter":"Jose Alfredo Collazos Rozo","authors":"J. Alfredo Collazos","title":"Galactic Archaeology: Tracing the Milky Way's Formation and Evolution\n  through Stellar Populations","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Galactic archaeology represents a multidisciplinary approach aimed at\nunraveling the intricate history of the Milky Way galaxy through the study of\nits stellar populations. This abstract delves into the significance of galactic\narchaeology as a vital tool for understanding the formation and evolution of\nthe Milky Way. By examining the distribution, kinematics, chemical\ncompositions, and ages of stars within the galaxy, researchers gain insights\ninto the dynamic processes that have shaped its structure over billions of\nyears.\n  Stellar populations serve as invaluable relics of past epochs, preserving\nclues about the conditions prevalent during their formation. The utilization of\nspectroscopic and photometric data has enabled the classification and analysis\nof stars, allowing astronomers to discern distinct populations and unveil their\norigin stories. Through these studies, the emergence of the Milky Way's various\ncomponents, such as the thin and thick disk, halo, and bulge, becomes\ndiscernible.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:48:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Collazos","J. Alfredo",""]]}
{"id":"2308.08493","submitter":"Shahriar Golchin","authors":"Shahriar Golchin, Mihai Surdeanu","title":"Time Travel in LLMs: Tracing Data Contamination in Large Language Models","comments":"v1 preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data contamination, i.e., the presence of test data from downstream tasks in\nthe training data of large language models (LLMs), is a potential major issue\nin understanding LLMs' effectiveness on other tasks. We propose a\nstraightforward yet effective method for identifying data contamination within\nLLMs. At its core, our approach starts by identifying potential contamination\nin individual instances that are drawn from a small random sample; using this\ninformation, our approach then assesses if an entire dataset partition is\ncontaminated. To estimate contamination of individual instances, we employ\n\"guided instruction:\" a prompt consisting of the dataset name, partition type,\nand the initial segment of a reference instance, asking the LLM to complete it.\nAn instance is flagged as contaminated if the LLM's output either exactly or\nclosely matches the latter segment of the reference. To understand if an entire\npartition is contaminated, we propose two ideas. The first idea marks a dataset\npartition as contaminated if the average overlap score with the reference\ninstances (as measured by ROUGE or BLEURT) is statistically significantly\nbetter with the guided instruction vs. a general instruction that does not\ninclude the dataset and partition name. The second idea marks a dataset as\ncontaminated if a classifier based on GPT-4 with in-context learning prompting\nmarks multiple instances as contaminated. Our best method achieves an accuracy\nbetween 92% and 100% in detecting if an LLM is contaminated with seven\ndatasets, containing train and test/validation partitions, when contrasted with\nmanual evaluation by human expert. Further, our findings indicate that GPT-4 is\ncontaminated with AG News, WNLI, and XSum datasets.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:48:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Golchin","Shahriar",""],["Surdeanu","Mihai",""]]}
{"id":"2308.08494","submitter":"Sharon Jiang","authors":"Sharon Jiang, Shannon Shen, Monica Agrawal, Barbara Lam, Nicholas\n  Kurtzman, Steven Horng, David Karger, David Sontag","title":"Conceptualizing Machine Learning for Dynamic Information Retrieval of\n  Electronic Health Record Notes","comments":"To be published in Proceedings of Machine Learning Research Volume\n  219; accepted to the Machine Learning for Healthcare 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The large amount of time clinicians spend sifting through patient notes and\ndocumenting in electronic health records (EHRs) is a leading cause of clinician\nburnout. By proactively and dynamically retrieving relevant notes during the\ndocumentation process, we can reduce the effort required to find relevant\npatient history. In this work, we conceptualize the use of EHR audit logs for\nmachine learning as a source of supervision of note relevance in a specific\nclinical context, at a particular point in time. Our evaluation focuses on the\ndynamic retrieval in the emergency department, a high acuity setting with\nunique patterns of information retrieval and note writing. We show that our\nmethods can achieve an AUC of 0.963 for predicting which notes will be read in\nan individual note writing session. We additionally conduct a user study with\nseveral clinicians and find that our framework can help clinicians retrieve\nrelevant information more efficiently. Demonstrating that our framework and\nmethods can perform well in this demanding setting is a promising proof of\nconcept that they will translate to other clinical settings and data modalities\n(e.g., labs, medications, imaging).\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 21:04:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Jiang","Sharon",""],["Shen","Shannon",""],["Agrawal","Monica",""],["Lam","Barbara",""],["Kurtzman","Nicholas",""],["Horng","Steven",""],["Karger","David",""],["Sontag","David",""]]}
{"id":"2308.08495","submitter":"Ciaran Eising","authors":"Ciar\\'an Hogan, Ganesh Sistu, Ciar\\'an Eising","title":"Self-Supervised Online Camera Calibration for Automated Driving and\n  Parking Applications","comments":null,"journal-ref":"Proceedings of the Irish Machine Vision and Image Processing\n  Conference 2023","doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Camera-based perception systems play a central role in modern autonomous\nvehicles. These camera based perception algorithms require an accurate\ncalibration to map the real world distances to image pixels. In practice,\ncalibration is a laborious procedure requiring specialised data collection and\ncareful tuning. This process must be repeated whenever the parameters of the\ncamera change, which can be a frequent occurrence in autonomous vehicles. Hence\nthere is a need to calibrate at regular intervals to ensure the camera is\naccurate. Proposed is a deep learning framework to learn intrinsic and\nextrinsic calibration of the camera in real time. The framework is\nself-supervised and doesn't require any labelling or supervision to learn the\ncalibration parameters. The framework learns calibration without the need for\nany physical targets or to drive the car on special planar surfaces.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:49:50 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Hogan","Ciar\u00e1n",""],["Sistu","Ganesh",""],["Eising","Ciar\u00e1n",""]]}
{"id":"2308.08496","submitter":"Siamak Farshidi","authors":"Siamak Farshidi, Kiyan Rezaee, Sara Mazaheri, Amir Hossein Rahimi, Ali\n  Dadashzadeh, Morteza Ziabakhsh, Sadegh Eskandari, and Slinger Jansen","title":"Understanding User Intent Modeling for Conversational Recommender\n  Systems: A Systematic Literature Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Context: User intent modeling is a crucial process in Natural Language\nProcessing that aims to identify the underlying purpose behind a user's\nrequest, enabling personalized responses. With a vast array of approaches\nintroduced in the literature (over 13,000 papers in the last decade),\nunderstanding the related concepts and commonly used models in AI-based systems\nis essential. Method: We conducted a systematic literature review to gather\ndata on models typically employed in designing conversational recommender\nsystems. From the collected data, we developed a decision model to assist\nresearchers in selecting the most suitable models for their systems.\nAdditionally, we performed two case studies to evaluate the effectiveness of\nour proposed decision model. Results: Our study analyzed 59 distinct models and\nidentified 74 commonly used features. We provided insights into potential model\ncombinations, trends in model selection, quality concerns, evaluation measures,\nand frequently used datasets for training and evaluating these models.\nContribution: Our study contributes practical insights and a comprehensive\nunderstanding of user intent modeling, empowering the development of more\neffective and personalized conversational recommender systems. With the\nConversational Recommender System, researchers can perform a more systematic\nand efficient assessment of fitting intent modeling frameworks.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 22:50:21 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Farshidi","Siamak",""],["Rezaee","Kiyan",""],["Mazaheri","Sara",""],["Rahimi","Amir Hossein",""],["Dadashzadeh","Ali",""],["Ziabakhsh","Morteza",""],["Eskandari","Sadegh",""],["Jansen","Slinger",""]]}
{"id":"2308.08497","submitter":"Chenglei Shen","authors":"Chenglei Shen, Xiao Zhang, Wei Wei, Jun Xu","title":"HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User\n  Preferences in Streaming 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":"  In real-world streaming recommender systems, user preferences often\ndynamically change over time (e.g., a user may have different preferences\nduring weekdays and weekends). Existing bandit-based streaming recommendation\nmodels only consider time as a timestamp, without explicitly modeling the\nrelationship between time variables and time-varying user preferences. This\nleads to recommendation models that cannot quickly adapt to dynamic scenarios.\nTo address this issue, we propose a contextual bandit approach using\nhypernetwork, called HyperBandit, which takes time features as input and\ndynamically adjusts the recommendation model for time-varying user preferences.\nSpecifically, HyperBandit maintains a neural network capable of generating the\nparameters for estimating time-varying rewards, taking into account the\ncorrelation between time features and user preferences. Using the estimated\ntime-varying rewards, a bandit policy is employed to make online\nrecommendations by learning the latent item contexts. To meet the real-time\nrequirements in streaming recommendation scenarios, we have verified the\nexistence of a low-rank structure in the parameter matrix and utilize low-rank\nfactorization for efficient training. Theoretically, we demonstrate a sublinear\nregret upper bound against the best policy. Extensive experiments on real-world\ndatasets show that the proposed HyperBandit consistently outperforms the\nstate-of-the-art baselines in terms of accumulated rewards.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:04:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Shen","Chenglei",""],["Zhang","Xiao",""],["Wei","Wei",""],["Xu","Jun",""]]}
{"id":"2308.08498","submitter":"Bodo Lampe","authors":"Bodo Lampe","title":"Analytic and Parameter-Free Formula for the Neutrino Mixing Matrix","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A parameter-free analytic expression for the PMNS matrix is derived which\nfits numerically all the measured matrix components to within 1 or 2 standard\ndeviations. Results are proven within the microscopic model and also lead to a\nprediction of the leptonic Jarlskog invariant $J_{PMNS}=-0.0106$. An outlook is\ngiven to the treatment of the CKM matrix.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 08:58:09 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Lampe","Bodo",""]]}
{"id":"2308.08499","submitter":"Sahraoui Dhelim Dr","authors":"Amar Khelloufi, Huansheng Ning, Abdelkarim Ben Sada, Abdenacer Naouri\n  and Sahraoui Dhelim","title":"Context-Aware Service Recommendation System for the Social Internet of\n  Things","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.NI cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Social Internet of Things (SIoT) enables interconnected smart devices to\nshare data and services, opening up opportunities for personalized service\nrecommendations. However, existing research often overlooks crucial aspects\nthat can enhance the accuracy and relevance of recommendations in the SIoT\ncontext. Specifically, existing techniques tend to consider the extraction of\nsocial relationships between devices and neglect the contextual presentation of\nservice reviews. This study aims to address these gaps by exploring the\ncontextual representation of each device-service pair. Firstly, we propose a\nlatent features combination technique that can capture latent feature\ninteractions, by aggregating the device-device relationships within the SIoT.\nThen, we leverage Factorization Machines to model higher-order feature\ninteractions specific to each SIoT device-service pair to accomplish accurate\nrating prediction. Finally, we propose a service recommendation framework for\nSIoT based on review aggregation and feature learning processes. The\nexperimental evaluation demonstrates the framework's effectiveness in improving\nservice recommendation accuracy and relevance.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:40:13 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Khelloufi","Amar",""],["Ning","Huansheng",""],["Sada","Abdelkarim Ben",""],["Naouri","Abdenacer",""],["Dhelim","Sahraoui",""]]}
{"id":"2308.08500","submitter":"Kabir Nagrecha","authors":"Kabir Nagrecha, Lingyi Liu, Pablo Delgado, Prasanna Padmanabhan","title":"InTune: Reinforcement Learning-based Data Pipeline Optimization for Deep\n  Recommendation Models","comments":"Accepted at RecSys 2023. 11 pages, 2 pages of references. 8 figures\n  with 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.DC cs.LG cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning-based recommender models (DLRMs) have become an essential\ncomponent of many modern recommender systems. Several companies are now\nbuilding large compute clusters reserved only for DLRM training, driving new\ninterest in cost- and time- saving optimizations. The systems challenges faced\nin this setting are unique; while typical deep learning training jobs are\ndominated by model execution, the most important factor in DLRM training\nperformance is often online data ingestion.\n  In this paper, we explore the unique characteristics of this data ingestion\nproblem and provide insights into DLRM training pipeline bottlenecks and\nchallenges. We study real-world DLRM data processing pipelines taken from our\ncompute cluster at Netflix to observe the performance impacts of online\ningestion and to identify shortfalls in existing pipeline optimizers. We find\nthat current tooling either yields sub-optimal performance, frequent crashes,\nor else requires impractical cluster re-organization to adopt. Our studies lead\nus to design and build a new solution for data pipeline optimization, InTune.\n  InTune employs a reinforcement learning (RL) agent to learn how to distribute\nthe CPU resources of a trainer machine across a DLRM data pipeline to more\neffectively parallelize data loading and improve throughput. Our experiments\nshow that InTune can build an optimized data pipeline configuration within only\na few minutes, and can easily be integrated into existing training workflows.\nBy exploiting the responsiveness and adaptability of RL, InTune achieves higher\nonline data ingestion rates than existing optimizers, thus reducing idle times\nin model execution and increasing efficiency. We apply InTune to our real-world\ncluster, and find that it increases data ingestion throughput by as much as\n2.29X versus state-of-the-art data pipeline optimizers while also improving\nboth CPU & GPU utilization.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:28:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nagrecha","Kabir",""],["Liu","Lingyi",""],["Delgado","Pablo",""],["Padmanabhan","Prasanna",""]]}
{"id":"2308.08502","submitter":"Sukhpal Singh Gill","authors":"Karan Gadgil, Sukhpal Singh Gill, Ahmed M. Abdelmoniem","title":"A Meta-learning based Stacked Regression Approach for Customer Lifetime\n  Value Prediction","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Companies across the globe are keen on targeting potential high-value\ncustomers in an attempt to expand revenue and this could be achieved only by\nunderstanding the customers more. Customer Lifetime Value (CLV) is the total\nmonetary value of transactions/purchases made by a customer with the business\nover an intended period of time and is used as means to estimate future\ncustomer interactions. CLV finds application in a number of distinct business\ndomains such as Banking, Insurance, Online-entertainment, Gaming, and\nE-Commerce. The existing distribution-based and basic (recency, frequency &\nmonetary) based models face a limitation in terms of handling a wide variety of\ninput features. Moreover, the more advanced Deep learning approaches could be\nsuperfluous and add an undesirable element of complexity in certain application\nareas. We, therefore, propose a system which is able to qualify both as\neffective, and comprehensive yet simple and interpretable. With that in mind,\nwe develop a meta-learning-based stacked regression model which combines the\npredictions from bagging and boosting models that each is found to perform well\nindividually. Empirical tests have been carried out on an openly available\nOnline Retail dataset to evaluate various models and show the efficacy of the\nproposed approach.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 14:22:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gadgil","Karan",""],["Gill","Sukhpal Singh",""],["Abdelmoniem","Ahmed M.",""]]}
{"id":"2308.08503","submitter":"Jiayu Zhao","authors":"Jiayu Zhao","title":"Principle of Terahertz Time-Domain Spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, the detection of terahertz (THz) pulse via different schemes of\nTHz time-domain spectroscopy (THz-TDS), including electro-optic sampling (EOS)\nand photoconductive sampling (PCS), has been reviewed by insisting on its\nprinciples and characteristics. Furthermore, four developments of THz-TDS, i.e.\nTHz air-breakdown/biased coherent detection (THz-ABCD), THz-radiation-enhanced\nemission of fluorescence (THz-REEF), single-shot THz-TDS, and THz asynchronous\noptical sampling (THz-ASOPS) have also been introduced.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 03:10:35 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhao","Jiayu",""]]}
{"id":"2308.08504","submitter":"Julian Burghoff","authors":"Julian Burghoff, Matthias Rottmann, Jill von Conta, Sebastian\n  Schoenen, Andreas Witte, Hanno Gottschalk","title":"ResBuilder: Automated Learning of Depth with Residual Structures","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 this work, we develop a neural architecture search algorithm, termed\nResbuilder, that develops ResNet architectures from scratch that achieve high\naccuracy at moderate computational cost. It can also be used to modify existing\narchitectures and has the capability to remove and insert ResNet blocks, in\nthis way searching for suitable architectures in the space of ResNet\narchitectures. In our experiments on different image classification datasets,\nResbuilder achieves close to state-of-the-art performance while saving\ncomputational cost compared to off-the-shelf ResNets. Noteworthy, we once tune\nthe parameters on CIFAR10 which yields a suitable default choice for all other\ndatasets. We demonstrate that this property generalizes even to industrial\napplications by applying our method with default parameters on a proprietary\nfraud detection dataset.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 16:58:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Burghoff","Julian",""],["Rottmann","Matthias",""],["von Conta","Jill",""],["Schoenen","Sebastian",""],["Witte","Andreas",""],["Gottschalk","Hanno",""]]}
{"id":"2308.08505","submitter":"Tianshuo Cong","authors":"Tianshuo Cong and Xinlei He and Yun Shen and Yang Zhang","title":"Test-Time Poisoning Attacks Against Test-Time Adaptation Models","comments":"To Appear in the 45th IEEE Symposium on Security and Privacy, May\n  20-23, 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deploying machine learning (ML) models in the wild is challenging as it\nsuffers from distribution shifts, where the model trained on an original domain\ncannot generalize well to unforeseen diverse transfer domains. To address this\nchallenge, several test-time adaptation (TTA) methods have been proposed to\nimprove the generalization ability of the target pre-trained models under test\ndata to cope with the shifted distribution. The success of TTA can be credited\nto the continuous fine-tuning of the target model according to the\ndistributional hint from the test samples during test time. Despite being\npowerful, it also opens a new attack surface, i.e., test-time poisoning\nattacks, which are substantially different from previous poisoning attacks that\noccur during the training time of ML models (i.e., adversaries cannot intervene\nin the training process). In this paper, we perform the first test-time\npoisoning attack against four mainstream TTA methods, including TTT, DUA, TENT,\nand RPL. Concretely, we generate poisoned samples based on the surrogate models\nand feed them to the target TTA models. Experimental results show that the TTA\nmethods are generally vulnerable to test-time poisoning attacks. For instance,\nthe adversary can feed as few as 10 poisoned samples to degrade the performance\nof the target model from 76.20% to 41.83%. Our results demonstrate that TTA\nalgorithms lacking a rigorous security assessment are unsuitable for deployment\nin real-life scenarios. As such, we advocate for the integration of defenses\nagainst test-time poisoning attacks into the design of TTA methods.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:00:32 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Cong","Tianshuo",""],["He","Xinlei",""],["Shen","Yun",""],["Zhang","Yang",""]]}
{"id":"2308.08506","submitter":"Christoph G\\\"unther","authors":"Charlotte Benning, J\\\"urgen Borowka, Christoph G\\\"unther, Oliver\n  Gries, Simon Zierke (for the IceCube-Gen2 Collaboration)","title":"Performance Studies of the Acoustic Module for the IceCube Upgrade","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-241","categories":"astro-ph.HE astro-ph.IM physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Upgrade will augment the existing IceCube Neutrino Observatory by\ndeploying 700 additional optical sensor modules and calibration devices within\nits center at a depth of 1.5 to 2.5 km in the Antarctic ice. One goal of the\nUpgrade is to improve the positioning calibration of the optical sensors to\nincrease the angular resolution for neutrino directional reconstruction. An\nacoustic calibration system will be deployed to explore the capability of\nachieving this using trilateration of propagation times of acoustic signals.\nTen Acoustic Modules (AM) capable of sending and receiving acoustic signals\nwith frequencies from 5 to 30 kHz will be installed within the detector volume.\nAdditionally, compact acoustic sensors inside 15 optical sensor modules will\ncomplement the acoustic calibration system. With this system, we aim for an\naccuracy of a few tens of cm to localize the Acoustic Modules and sensors. Due\nto the longer attenuation length of sound compared to light within the ice,\nacoustic position calibration is especially interesting for the upcoming\nIceCube-Gen2 detector, which will have a string spacing of around 240 m. In\nthis contribution we present an overview of the technical design of the\nAcoustic Module as well as results of performance tests with a first complete\nprototype.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:00:55 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Benning","Charlotte","","for the IceCube-Gen2 Collaboration"],["Borowka","J\u00fcrgen","","for the IceCube-Gen2 Collaboration"],["G\u00fcnther","Christoph","","for the IceCube-Gen2 Collaboration"],["Gries","Oliver","","for the IceCube-Gen2 Collaboration"],["Zierke","Simon","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.08507","submitter":"Shengyu Tang Student","authors":"Shengyu Tang","title":"Existence of Solutions to $L_p$-Gaussian Minkowski problem","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 discuss the $L_p$-Gaussian Minkowski problem with small\nvolume condition in $R^n$, which implies that there are at least two symmetric\nsolutions for the $L_p$-Gaussian Minkowski problem without volume limit when\n$1\\leq p<n$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:01:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Tang","Shengyu",""]]}
{"id":"2308.08508","submitter":"Andre Kornell","authors":"John Harding, Andre Kornell","title":"Completely hereditarily atomic OMLs","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An irreducible complete atomic OML of infinite height cannot both be\nalgebraic and have the covering property. However, Kalmbach's construction\nprovides an example of such an OML that is algebraic and has the 2-covering\nproperty, and Keller's construction provides an example of such an OML that has\nthe covering property and is completely hereditarily atomic. Completely\nhereditarily atomic OMLs generalize algebraic OMLs suitably to quantum\npredicate logic.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:06:24 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Harding","John",""],["Kornell","Andre",""]]}
{"id":"2308.08509","submitter":"Mingrui Yang","authors":"Mingrui Yang, Livia B. P\\'artay, Robert B. Wexler","title":"Surface Phase Diagrams from Nested Sampling","comments":"41 pages, 11 figures; figures in Sec. S5 are not included due to size\n  restrictions","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.stat-mech physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atomic-scale modeling of surface phase equilibria often focuses on\ntemperatures near zero Kelvin due to the difficulty in computing the free\nenergy of surfaces at finite temperatures. The Bayesian-inference-based nested\nsampling (NS) algorithm allows modeling surface phase equilibria at arbitrary\ntemperatures by directly and efficiently calculating the partition function,\nwhose relationship with free energy is well known. In this work, we extend NS\nto calculate surface phase diagrams, including all relevant translational,\nrotational, and vibrational contributions to the free energy. We apply NS to\nthe surfaces of the Lennard-Jones solid, recording energies through the\niterative compression of surface phase space rather than a specific cooling\nschedule. We construct the partition function from these recorded energies to\ncalculate ensemble averages of thermodynamic properties, such as the\nconstant-volume heat capacity and temperature-dependent order parameters that\ncharacterize the surface structure. Key results include determining the nature\nof phase transitions on flat and stepped surfaces, which typically feature an\nenthalpy-driven condensation at higher temperatures and an entropy-driven\nreordering process at lower temperatures, and the presence of critical points\non the phase diagrams of most of the flatter facets. Overall, we demonstrate\nthe ability and potential of NS for surface modeling and, ultimately, materials\ndiscovery.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:06:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yang","Mingrui",""],["P\u00e1rtay","Livia B.",""],["Wexler","Robert B.",""]]}
{"id":"2308.08510","submitter":"Chaoyang Song","authors":"Ning Guo, Xudong Han, Xiaobo Liu, Shuqiao Zhong, Zhiyuan Zhou, Jian\n  Lin, Jiansheng Dai, Fang Wan, Chaoyang Song","title":"Autoencoding a Soft Touch to Learn Grasping from On-land to Underwater","comments":"17 pages, 5 figures, 1 table, submitted to Advanced Intelligent\n  Systems for review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robots play a critical role as the physical agent of human operators in\nexploring the ocean. However, it remains challenging to grasp objects reliably\nwhile fully submerging under a highly pressurized aquatic environment with\nlittle visible light, mainly due to the fluidic interference on the tactile\nmechanics between the finger and object surfaces. This study investigates the\ntransferability of grasping knowledge from on-land to underwater via a\nvision-based soft robotic finger that learns 6D forces and torques (FT) using a\nSupervised Variational Autoencoder (SVAE). A high-framerate camera captures the\nwhole-body deformations while a soft robotic finger interacts with physical\nobjects on-land and underwater. Results show that the trained SVAE model\nlearned a series of latent representations of the soft mechanics transferrable\nfrom land to water, presenting a superior adaptation to the changing\nenvironments against commercial FT sensors. Soft, delicate, and reactive\ngrasping enabled by tactile intelligence enhances the gripper's underwater\ninteraction with improved reliability and robustness at a much-reduced cost,\npaving the path for learning-based intelligent grasping to support fundamental\nscientific discoveries in environmental and ocean research.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:07:37 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Guo","Ning",""],["Han","Xudong",""],["Liu","Xiaobo",""],["Zhong","Shuqiao",""],["Zhou","Zhiyuan",""],["Lin","Jian",""],["Dai","Jiansheng",""],["Wan","Fang",""],["Song","Chaoyang",""]]}
{"id":"2308.08511","submitter":"Zirong Li","authors":"Zirong Li, Yanyang Wang, Jianjia Zhang and Weiwen Wu, Hengyong Yu","title":"Two-and-a-half Order Score-based Model for Solving 3D Ill-posed Inverse\n  Problems","comments":"10 pages, 13 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":"  Computed Tomography (CT) and Magnetic Resonance Imaging (MRI) are crucial\ntechnologies in the field of medical imaging. Score-based models have proven to\nbe effective in addressing different inverse problems encountered in CT and\nMRI, such as sparse-view CT and fast MRI reconstruction. However, these models\nface challenges in achieving accurate three dimensional (3D) volumetric\nreconstruction. The existing score-based models primarily focus on\nreconstructing two dimensional (2D) data distribution, leading to\ninconsistencies between adjacent slices in the reconstructed 3D volumetric\nimages. To overcome this limitation, we propose a novel two-and-a-half order\nscore-based model (TOSM). During the training phase, our TOSM learns data\ndistributions in 2D space, which reduces the complexity of training compared to\ndirectly working on 3D volumes. However, in the reconstruction phase, the TOSM\nupdates the data distribution in 3D space, utilizing complementary scores along\nthree directions (sagittal, coronal, and transaxial) to achieve a more precise\nreconstruction. The development of TOSM is built on robust theoretical\nprinciples, ensuring its reliability and efficacy. Through extensive\nexperimentation on large-scale sparse-view CT and fast MRI datasets, our method\ndemonstrates remarkable advancements and attains state-of-the-art results in\nsolving 3D ill-posed inverse problems. Notably, the proposed TOSM effectively\naddresses the inter-slice inconsistency issue, resulting in high-quality 3D\nvolumetric reconstruction.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:07:40 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 05:09:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Zirong",""],["Wang","Yanyang",""],["Zhang","Jianjia",""],["Wu","Weiwen",""],["Yu","Hengyong",""]]}
{"id":"2308.08512","submitter":"Ziyi Wang","authors":"LHCb collaboration: R. Aaij, A.S.W. Abdelmotteleb, C. Abellan Beteta,\n  F. Abudin\\'en, T. Ackernley, B. Adeva, M. Adinolfi, P. Adlarson, H.\n  Afsharnia, C. Agapopoulou, C.A. Aidala, Z. Ajaltouni, S. Akar, K. Akiba, P.\n  Albicocco, J. Albrecht, F. Alessio, M. Alexander, A. Alfonso Albero, Z.\n  Aliouche, P. Alvarez Cartelle, R. Amalric, S. Amato, J.L. Amey, Y. Amhis, L.\n  An, L. Anderlini, M. Andersson, A. Andreianov, P. Andreola, M. Andreotti, D.\n  Andreou, D. Ao, F. Archilli, A. Artamonov, M. Artuso, E. Aslanides, M.\n  Atzeni, B. Audurier, 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. 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, 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, A.\n  Lobo Salvia, A. Loi, J. Lomba Castro, T. Long, I. Longstaff, J.H. Lopes, A.\n  Lopez Huertas, S. L\\'opez Soli\\~no, G.H. Lovell, Y. Lu, C. Lucarelli, D.\n  Lucchesi, S. Luchuk, M. Lucio Martinez, V. Lukashenko, Y. Luo, A. Lupato, E.\n  Luppi, K. Lynch, X.-R. Lyu, R. Ma, S. Maccolini, F. Machefert, F. Maciuc, I.\n  Mackay, V. Macko, L.R. Madhan Mohan, M. M. Madurai, A. Maevskiy, D.\n  Maisuzenko, M.W. Majewski, J.J. Malczewski, S. Malde, B. Malecki, 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. Milovanovic, 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, 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, D. Murray, R. Murta, P.\n  Naik, T. Nakada, R. Nandakumar, T. Nanut, I. Nasteva, M. Needham, N. Neri, S.\n  Neubert, N. Neufeld, P. Neustroev, R. Newcombe, J. Nicolini, D. Nicotra, E.M.\n  Niel, S. Nieswand, 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, A.\n  Pastore, M. Patel, J. Patoc, C. Patrignani, C.J. Pawley, A. Pellegrino, M.\n  Pepe Altarelli, S. Perazzini, D. Pereima, A. Pereiro Castro, P. Perret, A.\n  Perro, K. Petridis, A. Petrolini, S. Petrucci, H. Pham, A. Philippov, L.\n  Pica, M. Piccini, B. Pietrzyk, G. Pietrzyk, D. Pinci, F. Pisani, M.\n  Pizzichemi, V. Placinta, M. Plo Casasus, F. Polci, M. Poli Lener, A.\n  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, R. Rajagopalan, M. Rama, M. Ram\\'irez Garc\\'ia, M. Ramos Pernas,\n  M.S. Rangel, F. Ratnikov, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich,\n  F. Reiss, Z. Ren, P.K. Resmi, R. Ribatti, G. R. Ricart, 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, D.L. Rolf, A. Rollings, P. Roloff, V. Romanovskiy, M. Romero\n  Lamas, A. Romero Vidal, F. Ronchetti, M. Rotondo, M.S. Rudolph, T. Ruf, R.A.\n  Ruiz Fernandez, J. Ruiz Vidal, A. Ryzhikov, J. Ryzka, J.J. Saborido Silva, N.\n  Sagidova, N. Sahoo, B. Saitta, M. Salomoni, C. Sanchez Gras, I. Sanderswood,\n  R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E.\n  Santovetti, D. Saranin, G. Sarpis, M. Sarpis, A. Sarti, C. Satriano, A.\n  Satta, M. Saur, D. Savrina, H. Sazak, L.G. Scantlebury Smead, A. Scarabotto,\n  S. Schael, S. Scherl, A. M. Schertz, M. Schiller, H. Schindler, M.\n  Schmelling, B. Schmidt, S. Schmitt, O. Schneider, A. Schopper, M. Schubiger,\n  N. Schulte, S. Schulte, M.H. Schune, R. Schwemmer, G. Schwering, B. Sciascia,\n  A. Sciuccati, S. Sellam, A. Semennikov, M. Senghi Soares, A. Sergi, N. Serra,\n  L. Sestini, A. Seuthe, Y. Shang, D.M. Shangase, M. Shapkin, I. Shchemerov, L.\n  Shchutska, T. Shears, L. Shekhtman, Z. Shen, S. Sheng, V. Shevchenko, B. Shi,\n  E.B. Shields, Y. Shimizu, E. Shmanin, R. Shorkin, J.D. Shupperd, B.G. Siddi,\n  R. Silva Coutinho, G. Simi, S. Simone, M. Singla, N. Skidmore, R. Skuza, T.\n  Skwarnicki, M.W. Slater, J.C. Smallwood, J.G. Smeaton, E. Smith, K. Smith, M.\n  Smith, A. Snoch, L. Soares Lavra, M.D. Sokoloff, F.J.P. Soler, A. Solomin, A.\n  Solovev, I. Solovyev, R. Song, Y. Song, Y. Song, Y. S. Song, F.L. Souza De\n  Almeida, B. Souza De Paula, E. Spadaro Norella, E. Spedicato, J.G. Speer, E.\n  Spiridenkov, P. Spradlin, V. Sriskaran, F. Stagni, M. Stahl, S. Stahl, S.\n  Stanislaus, E.N. Stein, O. Steinkamp, O. Stenyakin, H. Stevens, D.\n  Strekalina, Y. Su, F. Suljik, J. Sun, L. Sun, Y. Sun, P.N. Swallow, K.\n  Swientek, F. Swystun, A. Szabelski, T. Szumlak, M. Szymanski, Y. Tan, S.\n  Taneja, M.D. Tat, A. Terentev, F. Teubert, E. Thomas, D.J.D. Thompson, H.\n  Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, L. Tomassetti, G. Tonani, X.\n  Tong, D. Torres Machado, L. Toscano, D.Y. Tou, C. Trippl, G. Tuci, N. Tuning,\n  A. Ukleja, D.J. Unverzagt, E. Ursov, A. Usachov, A. Ustyuzhanin, U. Uwer, V.\n  Vagnoni, A. Valassi, G. Valenti, N. Valls Canudas, M. Van Dijk, H. Van Hecke,\n  E. van Herwijnen, C.B. Van Hulse, R. Van Laak, M. van Veghel, R. Vazquez\n  Gomez, P. Vazquez Regueiro, C. V\\'azquez Sierra, S. Vecchi, J.J. Velthuis, M.\n  Veltri, A. Venkateswaran, M. Vesterinen, D. Vieira, M. Vieites Diaz, X.\n  Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, F.C. Volle, D.\n  vom Bruch, V. Vorobyev, N. Voropaev, K. Vos, C. Vrahas, J. Walsh, E.J.\n  Walton, G. Wan, C. Wang, G. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M.\n  Wang, N. W. Wang, R. Wang, X. Wang, Y. Wang, 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":"Observation of Cabibbo-suppressed two-body hadronic decays and precision\n  mass measurement of the $\\Omega_{c}^{0}$ baryon","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-011.html (LHCb\n  public pages)","journal-ref":null,"doi":null,"report-no":"LHCb-PAPER-2023-011, CERN-EP-2023-155","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first observation of the singly Cabibbo-suppressed\n$\\Omega_{c}^{0}\\to\\Omega^{-}K^{+}$ and $\\Omega_{c}^{0}\\to\\Xi^{-}\\pi^{+}$ decays\nis reported, using proton-proton collision data at a centre-of-mass energy of\n$13\\,{\\rm TeV}$, corresponding to an integrated luminosity of $5.4\\,{\\rm\nfb}^{-1}$, collected with the LHCb detector between 2016 and 2018. The\nbranching fraction ratios are measured to be\n$\\frac{\\mathcal{B}(\\Omega_{c}^{0}\\to\\Omega^{-}K^{+})}{\\mathcal{B}(\\Omega_{c}^{0}\\to\\Omega^{-}\\pi^{+})}=0.0608\\pm0.0051({\\rm\nstat})\\pm 0.0040({\\rm syst})$,\n$\\frac{\\mathcal{B}(\\Omega_{c}^{0}\\to\\Xi^{-}\\pi^{+})}{\\mathcal{B}(\\Omega_{c}^{0}\\to\\Omega^{-}\\pi^{+})}=0.1581\\pm0.0087({\\rm\nstat})\\pm0.0043({\\rm syst})\\pm0.0016({\\rm ext})$. In addition, using the\n$\\Omega_{c}^{0}\\to\\Omega^{-}\\pi^{+}$ decay channel, the $\\Omega_{c}^{0}$ baryon\nmass is measured to be $M(\\Omega_{c}^{0})=2695.28\\pm0.07({\\rm\nstat})\\pm0.27({\\rm syst})\\pm0.30({\\rm ext})\\,{\\rm MeV}/c^{2}$, improving the\nprecision of the previous world average by a factor of four.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:09:03 GMT"}],"update_date":"2023-08-17","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.",""],["Kondybayeva","A.",""],["Konoplyannikov","A.",""],["Kopciewicz","P.",""],["Kopecna","R.",""],["Koppenburg","P.",""],["Korolev","M.",""],["Kostiuk","I.",""],["Kot","O.",""],["Kotriakhova","S.",""],["Kozachuk","A.",""],["Kravchenko","P.",""],["Kravchuk","L.",""],["Kreps","M.",""],["Kretzschmar","S.",""],["Krokovny","P.",""],["Krupa","W.",""],["Krzemien","W.",""],["Kubat","J.",""],["Kubis","S.",""],["Kucewicz","W.",""],["Kucharczyk","M.",""],["Kudryavtsev","V.",""],["Kulikova","E.",""],["Kupsc","A.",""],["Kutsenko","B. K.",""],["Lacarrere","D.",""],["Lafferty","G.",""],["Lai","A.",""],["Lampis","A.",""],["Lancierini","D.",""],["Gomez","C. Landesa",""],["Lane","J. J.",""],["Lane","R.",""],["Langenbruch","C.",""],["Langer","J.",""],["Lantwin","O.",""],["Latham","T.",""],["Lazzari","F.",""],["Lazzeroni","C.",""],["Gac","R. Le",""],["Lee","S. H.",""],["Lef\u00e8vre","R.",""],["Leflat","A.",""],["Legotin","S.",""],["Leroy","O.",""],["Lesiak","T.",""],["Leverington","B.",""],["Li","A.",""],["Li","H.",""],["Li","K.",""],["Li","L.",""],["Li","P.",""],["Li","P. -R.",""],["Li","S.",""],["Li","T.",""],["Li","T.",""],["Li","Y.",""],["Li","Z.",""],["Lian","Z.",""],["Liang","X.",""],["Lin","C.",""],["Lin","T.",""],["Lindner","R.",""],["Lisovskyi","V.",""],["Litvinov","R.",""],["Liu","G.",""],["Liu","H.",""],["Liu","K.",""],["Liu","Q.",""],["Liu","S.",""],["Liu","Y.",""],["Salvia","A. Lobo",""],["Loi","A.",""],["Castro","J. Lomba",""],["Long","T.",""],["Longstaff","I.",""],["Lopes","J. H.",""],["Huertas","A. Lopez",""],["Soli\u00f1o","S. L\u00f3pez",""],["Lovell","G. H.",""],["Lu","Y.",""],["Lucarelli","C.",""],["Lucchesi","D.",""],["Luchuk","S.",""],["Martinez","M. Lucio",""],["Lukashenko","V.",""],["Luo","Y.",""],["Lupato","A.",""],["Luppi","E.",""],["Lynch","K.",""],["Lyu","X. -R.",""],["Ma","R.",""],["Maccolini","S.",""],["Machefert","F.",""],["Maciuc","F.",""],["Mackay","I.",""],["Macko","V.",""],["Mohan","L. R. Madhan",""],["Madurai","M. M.",""],["Maevskiy","A.",""],["Maisuzenko","D.",""],["Majewski","M. W.",""],["Malczewski","J. J.",""],["Malde","S.",""],["Malecki","B.",""],["Malinin","A.",""],["Maltsev","T.",""],["Manca","G.",""],["Mancinelli","G.",""],["Mancuso","C.",""],["Escalero","R. Manera",""],["Manuzzi","D.",""],["Manzari","C. A.",""],["Marangotto","D.",""],["Marchand","J. F.",""],["Marconi","U.",""],["Mariani","S.",""],["Benito","C. Marin",""],["Marks","J.",""],["Marshall","A. M.",""],["Marshall","P. J.",""],["Martelli","G.",""],["Martellotti","G.",""],["Martinazzoli","L.",""],["Martinelli","M.",""],["Santos","D. Martinez",""],["Vidal","F. Martinez",""],["Massafferri","A.",""],["Materok","M.",""],["Matev","R.",""],["Mathad","A.",""],["Matiunin","V.",""],["Matteuzzi","C.",""],["Mattioli","K. R.",""],["Mauri","A.",""],["Maurice","E.",""],["Mauricio","J.",""],["Mazurek","M.",""],["McCann","M.",""],["Mcconnell","L.",""],["McGrath","T. H.",""],["McHugh","N. T.",""],["McNab","A.",""],["McNulty","R.",""],["Meadows","B.",""],["Meier","G.",""],["Melnychuk","D.",""],["Merk","M.",""],["Merli","A.",""],["Garcia","L. Meyer",""],["Miao","D.",""],["Miao","H.",""],["Mikhasenko","M.",""],["Milanes","D. A.",""],["Milovanovic","M.",""],["Minard","M. -N.",""],["Minotti","A.",""],["Minucci","E.",""],["Miralles","T.",""],["Mitchell","S. E.",""],["Mitreska","B.",""],["Mitzel","D. S.",""],["Modak","A.",""],["M\u00f6dden","A.",""],["Mohammed","R. A.",""],["Moise","R. D.",""],["Mokhnenko","S.",""],["Momb\u00e4cher","T.",""],["Monk","M.",""],["Monroy","I. A.",""],["Monteil","S.",""],["Morello","G.",""],["Morello","M. J.",""],["Morgenthaler","M. P.",""],["Moron","J.",""],["Morris","A. B.",""],["Morris","A. G.",""],["Mountain","R.",""],["Mu","H.",""],["Mu","Z. M.",""],["Muhammad","E.",""],["Muheim","F.",""],["Mulder","M.",""],["M\u00fcller","K.",""],["Murray","D.",""],["Murta","R.",""],["Naik","P.",""],["Nakada","T.",""],["Nandakumar","R.",""],["Nanut","T.",""],["Nasteva","I.",""],["Needham","M.",""],["Neri","N.",""],["Neubert","S.",""],["Neufeld","N.",""],["Neustroev","P.",""],["Newcombe","R.",""],["Nicolini","J.",""],["Nicotra","D.",""],["Niel","E. M.",""],["Nieswand","S.",""],["Nikitin","N.",""],["Nogga","P.",""],["Nolte","N. S.",""],["Normand","C.",""],["Fernandez","J. Novoa",""],["Nowak","G.",""],["Nunez","C.",""],["Nur","H. N.",""],["Oblakowska-Mucha","A.",""],["Obraztsov","V.",""],["Oeser","T.",""],["Okamura","S.",""],["Oldeman","R.",""],["Oliva","F.",""],["Olocco","M.",""],["Onderwater","C. J. G.",""],["O'Neil","R. H.",""],["Goicochea","J. M. Otalora",""],["Ovsiannikova","T.",""],["Owen","P.",""],["Oyanguren","A.",""],["Ozcelik","O.",""],["Padeken","K. O.",""],["Pagare","B.",""],["Pais","P. R.",""],["Pajero","T.",""],["Palano","A.",""],["Palutan","M.",""],["Panshin","G.",""],["Paolucci","L.",""],["Papanestis","A.",""],["Pappagallo","M.",""],["Pappalardo","L. L.",""],["Pappenheimer","C.",""],["Parkes","C.",""],["Passalacqua","B.",""],["Passaleva","G.",""],["Pastore","A.",""],["Patel","M.",""],["Patoc","J.",""],["Patrignani","C.",""],["Pawley","C. J.",""],["Pellegrino","A.",""],["Altarelli","M. Pepe",""],["Perazzini","S.",""],["Pereima","D.",""],["Castro","A. Pereiro",""],["Perret","P.",""],["Perro","A.",""],["Petridis","K.",""],["Petrolini","A.",""],["Petrucci","S.",""],["Pham","H.",""],["Philippov","A.",""],["Pica","L.",""],["Piccini","M.",""],["Pietrzyk","B.",""],["Pietrzyk","G.",""],["Pinci","D.",""],["Pisani","F.",""],["Pizzichemi","M.",""],["Placinta","V.",""],["Casasus","M. Plo",""],["Polci","F.",""],["Lener","M. Poli",""],["Poluektov","A.",""],["Polukhina","N.",""],["Polyakov","I.",""],["Polycarpo","E.",""],["Ponce","S.",""],["Popov","D.",""],["Poslavskii","S.",""],["Prasanth","K.",""],["Promberger","L.",""],["Prouve","C.",""],["Pugatch","V.",""],["Puill","V.",""],["Punzi","G.",""],["Qi","H. R.",""],["Qian","W.",""],["Qin","N.",""],["Qu","S.",""],["Quagliani","R.",""],["Rachwal","B.",""],["Rademacker","J. H.",""],["Rajagopalan","R.",""],["Rama","M.",""],["Garc\u00eda","M. Ram\u00edrez",""],["Pernas","M. Ramos",""],["Rangel","M. S.",""],["Ratnikov","F.",""],["Raven","G.",""],["De Miguel","M. Rebollo",""],["Redi","F.",""],["Reich","J.",""],["Reiss","F.",""],["Ren","Z.",""],["Resmi","P. K.",""],["Ribatti","R.",""],["Ricart","G. R.",""],["Ricciardi","S.",""],["Richardson","K.",""],["Richardson-Slipper","M.",""],["Rinnert","K.",""],["Robbe","P.",""],["Robertson","G.",""],["Rodrigues","E.",""],["Fernandez","E. Rodriguez",""],["Lopez","J. A. Rodriguez",""],["Rodriguez","E. Rodriguez",""],["Rolf","D. L.",""],["Rollings","A.",""],["Roloff","P.",""],["Romanovskiy","V.",""],["Lamas","M. Romero",""],["Vidal","A. Romero",""],["Ronchetti","F.",""],["Rotondo","M.",""],["Rudolph","M. S.",""],["Ruf","T.",""],["Fernandez","R. A. Ruiz",""],["Vidal","J. Ruiz",""],["Ryzhikov","A.",""],["Ryzka","J.",""],["Silva","J. J. Saborido",""],["Sagidova","N.",""],["Sahoo","N.",""],["Saitta","B.",""],["Salomoni","M.",""],["Gras","C. Sanchez",""],["Sanderswood","I.",""],["Santacesaria","R.",""],["Rios","C. Santamarina",""],["Santimaria","M.",""],["Santoro","L.",""],["Santovetti","E.",""],["Saranin","D.",""],["Sarpis","G.",""],["Sarpis","M.",""],["Sarti","A.",""],["Satriano","C.",""],["Satta","A.",""],["Saur","M.",""],["Savrina","D.",""],["Sazak","H.",""],["Smead","L. G. Scantlebury",""],["Scarabotto","A.",""],["Schael","S.",""],["Scherl","S.",""],["Schertz","A. M.",""],["Schiller","M.",""],["Schindler","H.",""],["Schmelling","M.",""],["Schmidt","B.",""],["Schmitt","S.",""],["Schneider","O.",""],["Schopper","A.",""],["Schubiger","M.",""],["Schulte","N.",""],["Schulte","S.",""],["Schune","M. H.",""],["Schwemmer","R.",""],["Schwering","G.",""],["Sciascia","B.",""],["Sciuccati","A.",""],["Sellam","S.",""],["Semennikov","A.",""],["Soares","M. Senghi",""],["Sergi","A.",""],["Serra","N.",""],["Sestini","L.",""],["Seuthe","A.",""],["Shang","Y.",""],["Shangase","D. M.",""],["Shapkin","M.",""],["Shchemerov","I.",""],["Shchutska","L.",""],["Shears","T.",""],["Shekhtman","L.",""],["Shen","Z.",""],["Sheng","S.",""],["Shevchenko","V.",""],["Shi","B.",""],["Shields","E. B.",""],["Shimizu","Y.",""],["Shmanin","E.",""],["Shorkin","R.",""],["Shupperd","J. D.",""],["Siddi","B. G.",""],["Coutinho","R. Silva",""],["Simi","G.",""],["Simone","S.",""],["Singla","M.",""],["Skidmore","N.",""],["Skuza","R.",""],["Skwarnicki","T.",""],["Slater","M. W.",""],["Smallwood","J. C.",""],["Smeaton","J. G.",""],["Smith","E.",""],["Smith","K.",""],["Smith","M.",""],["Snoch","A.",""],["Lavra","L. Soares",""],["Sokoloff","M. D.",""],["Soler","F. J. P.",""],["Solomin","A.",""],["Solovev","A.",""],["Solovyev","I.",""],["Song","R.",""],["Song","Y.",""],["Song","Y.",""],["Song","Y. S.",""],["De Almeida","F. L. Souza",""],["De Paula","B. Souza",""],["Norella","E. Spadaro",""],["Spedicato","E.",""],["Speer","J. G.",""],["Spiridenkov","E.",""],["Spradlin","P.",""],["Sriskaran","V.",""],["Stagni","F.",""],["Stahl","M.",""],["Stahl","S.",""],["Stanislaus","S.",""],["Stein","E. N.",""],["Steinkamp","O.",""],["Stenyakin","O.",""],["Stevens","H.",""],["Strekalina","D.",""],["Su","Y.",""],["Suljik","F.",""],["Sun","J.",""],["Sun","L.",""],["Sun","Y.",""],["Swallow","P. N.",""],["Swientek","K.",""],["Swystun","F.",""],["Szabelski","A.",""],["Szumlak","T.",""],["Szymanski","M.",""],["Tan","Y.",""],["Taneja","S.",""],["Tat","M. D.",""],["Terentev","A.",""],["Teubert","F.",""],["Thomas","E.",""],["Thompson","D. J. D.",""],["Tilquin","H.",""],["Tisserand","V.",""],["T'Jampens","S.",""],["Tobin","M.",""],["Tomassetti","L.",""],["Tonani","G.",""],["Tong","X.",""],["Machado","D. Torres",""],["Toscano","L.",""],["Tou","D. Y.",""],["Trippl","C.",""],["Tuci","G.",""],["Tuning","N.",""],["Ukleja","A.",""],["Unverzagt","D. J.",""],["Ursov","E.",""],["Usachov","A.",""],["Ustyuzhanin","A.",""],["Uwer","U.",""],["Vagnoni","V.",""],["Valassi","A.",""],["Valenti","G.",""],["Canudas","N. Valls",""],["Van Dijk","M.",""],["Van Hecke","H.",""],["van Herwijnen","E.",""],["Van Hulse","C. B.",""],["Van Laak","R.",""],["van Veghel","M.",""],["Gomez","R. Vazquez",""],["Regueiro","P. Vazquez",""],["Sierra","C. V\u00e1zquez",""],["Vecchi","S.",""],["Velthuis","J. J.",""],["Veltri","M.",""],["Venkateswaran","A.",""],["Vesterinen","M.",""],["Vieira","D.",""],["Diaz","M. Vieites",""],["Vilasis-Cardona","X.",""],["Figueras","E. Vilella",""],["Villa","A.",""],["Vincent","P.",""],["Volle","F. C.",""],["Bruch","D. vom",""],["Vorobyev","V.",""],["Voropaev","N.",""],["Vos","K.",""],["Vrahas","C.",""],["Walsh","J.",""],["Walton","E. J.",""],["Wan","G.",""],["Wang","C.",""],["Wang","G.",""],["Wang","J.",""],["Wang","J.",""],["Wang","J.",""],["Wang","J.",""],["Wang","M.",""],["Wang","N. W.",""],["Wang","R.",""],["Wang","X.",""],["Wang","Y.",""],["Wang","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.08513","submitter":"Abinash Sahu","authors":"Abinash Sahu, Naga Dileep Varikuti, Bishal Kumar Das, and Vaibhav\n  Madhok","title":"Quantifying operator spreading and chaos in Krylov subspaces with\n  quantum state reconstruction","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph nlin.CD nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study operator spreading in many-body quantum systems by its potential to\ngenerate an informationally complete measurement record in quantum tomography.\nWe adopt continuous weak measurement tomography for this purpose. We generate\nthe measurement record as a series of expectation values of an observable\nevolving under the desired dynamics, which can show a transition from\nintegrability to full chaos. We find that the amount of operator spreading, as\nquantified by the fidelity in quantum tomography, increases with the degree of\nchaos in the system. We also observe a remarkable increase in information gain\nwhen the dynamics transitions from integrable to non-integrable. We find our\napproach in quantifying operator spreading is a more consistent indicator of\nquantum chaos than Krylov complexity as the latter may correlate/anti-correlate\nor show no clear behavior with the level of chaos in the dynamics. We support\nour argument through various metrics of information gain for two models; the\nIsing spin chain with a tilted magnetic field and the Heisenberg XXZ spin chain\nwith an integrability breaking field. Our study gives an operational\ninterpretation for operator spreading in quantum chaos.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:10:00 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Sahu","Abinash",""],["Varikuti","Naga Dileep",""],["Das","Bishal Kumar",""],["Madhok","Vaibhav",""]]}
{"id":"2308.08514","submitter":"Jincheng Zhuang","authors":"Jingyuan Zhong, Ming Yang, Zhijian Shi, Yaqi Li, Dan Mu, Yundan Liu,\n  Ningyan Cheng, Wenxuan Zhao, Weichang Hao, Jianfeng Wang, Lexian Yang,\n  Jincheng Zhuang, Yi Du","title":"Towards Layer-Selective Quantum Spin Hall Channels in Weak Topological\n  Insulator Bi4Br2I2","comments":null,"journal-ref":"Nature Communications 14, 4964 (2023)","doi":"10.1038/s41467-023-40735-7","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Weak topological insulators, constructed by stacking quantum spin Hall\ninsulators with weak interlayer coupling, offer promising quantum electronic\napplications through topologically nontrivial edge channels. However, the\ncurrently available weak topological insulators are stacks of the same quantum\nspin Hall layer with translational symmetry in the out-of-plane direction,\nleading to the absence of the channel degree of freedom for edge states. Here,\nwe study a candidate weak topological insulator, Bi4Br2I2, which is alternately\nstacked by three different quantum spin Hall insulators, each with tunable\ntopologically non-trivial edge states. Our angle-resolved photoemission\nspectroscopy and first-principles calculations show that an energy gap opens at\nthe crossing points of different Dirac cones correlated with different layers\ndue to the interlayer interaction. This is essential to achieve the tunability\nof topological edge states as controlled by varying the chemical potential. Our\nwork offers a perspective for the construction of tunable quantized conductance\ndevices for future spintronic applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:10:19 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhong","Jingyuan",""],["Yang","Ming",""],["Shi","Zhijian",""],["Li","Yaqi",""],["Mu","Dan",""],["Liu","Yundan",""],["Cheng","Ningyan",""],["Zhao","Wenxuan",""],["Hao","Weichang",""],["Wang","Jianfeng",""],["Yang","Lexian",""],["Zhuang","Jincheng",""],["Du","Yi",""]]}
{"id":"2308.08515","submitter":"Seshasainadh Pudi","authors":"Seshasainadh Pudi, Navneet Bhardwaj, Ritam Sarkar, V S Santhosh N\n  Varma Bellamkonda, Umang Singh, Anshul Jain, Swagata Bhunia, Soumyadip\n  Chatterjee, and Apurba Laha","title":"Investigation of Magnesium Silicate as an Effective Gate Dielectric for\n  AlGaN/GaN Metal Oxide High Electron Mobility Transistors (MOSHEMT)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this study, a 6 nm layer of Magnesium Silicate (Mg-Silicate) was deposited\non AlGaN/GaN heterostructure by sputtering of multiple stacks of MgO and\nSiO$_{2}$, followed by rapid thermal annealing in a nitrogen (N$_{2}$)\nenvironment. The X-ray photoelectron spectroscopy (XPS) analysis confirmed the\nstoichiometric Mg-Silicate (MgSiO$_{3}$) after being annealed at a temperature\nof 850 $^\\circ$C for 70 seconds. Atomic force microscopy (AFM) was employed to\nmeasure the root mean square (RMS) roughness (2.20 nm) of the Mg-Silicate. A\nsignificant reduction in reverse leakage current, by a factor of three orders\nof magnitude, was noted for the Mg-Silicate/AlGaN/GaN metal-oxide-semiconductor\n(MOS) diode in comparison to the Schottky diode. The dielectric constant of\nMg-Silicate($\\mathcal{E}_{Mg-Silicate}$) and the interface density of states\n(D$_{it}$) with AlGaN were approximated at $\\sim$ 6.6 and 2.0 $\\times$\n10$^{13}$ cm$^{-2}$eV$^{-1}$ respectively, utilizing capacitance-voltage (CV)\ncharacteristics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:10:41 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pudi","Seshasainadh",""],["Bhardwaj","Navneet",""],["Sarkar","Ritam",""],["Bellamkonda","V S Santhosh N Varma",""],["Singh","Umang",""],["Jain","Anshul",""],["Bhunia","Swagata",""],["Chatterjee","Soumyadip",""],["Laha","Apurba",""]]}
{"id":"2308.08518","submitter":"YuHao Yang","authors":"Yuhao Yang, Jun Wu, Guangjian Zhang and Rong Xiong","title":"Exploiting Point-Wise Attention in 6D Object Pose Estimation Based on\n  Bidirectional Prediction","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":"  Traditional geometric registration based estimation methods only exploit the\nCAD model implicitly, which leads to their dependence on observation quality\nand deficiency to occlusion. To address the problem,the paper proposes a\nbidirectional correspondence prediction network with a point-wise\nattention-aware mechanism. This network not only requires the model points to\npredict the correspondence but also explicitly models the geometric\nsimilarities between observations and the model prior. Our key insight is that\nthe correlations between each model point and scene point provide essential\ninformation for learning point-pair matches. To further tackle the correlation\nnoises brought by feature distribution divergence, we design a simple but\neffective pseudo-siamese network to improve feature homogeneity. Experimental\nresults on the public datasets of LineMOD, YCB-Video, and Occ-LineMOD show that\nthe proposed method achieves better performance than other state-of-the-art\nmethods under the same evaluation criteria. Its robustness in estimating poses\nis greatly improved, especially in an environment with severe occlusions.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:13:45 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 04:18:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Yuhao",""],["Wu","Jun",""],["Zhang","Guangjian",""],["Xiong","Rong",""]]}
{"id":"2308.08519","submitter":"Xiaofa Chen","authors":"Xiaofa Chen","title":"Auslander--Iyama correspondence for exact dg categories","comments":"20 pages. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend Auslander--Iyama correspondence to the setting of exact dg\ncategories. By specializing it to exact dg categories concentrated in degree\nzero, we obtain a generalization of the higher Auslander correspondence for\nexact categories due to Ebrahimi--Nasr-Isfahani (in the case of exact\ncategories with split retractions).\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:16:58 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Xiaofa",""]]}
{"id":"2308.08520","submitter":"Reza Pourreza","authors":"Reza Pourreza, Apratim Bhattacharyya, Sunny Panchal, Mingu Lee, Pulkit\n  Madan, Roland Memisevic","title":"Painter: Teaching Auto-regressive Language Models to Draw Sketches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) have made tremendous progress in natural\nlanguage understanding and they have also been successfully adopted in other\ndomains such as computer vision, robotics, reinforcement learning, etc. In this\nwork, we apply LLMs to image generation tasks by directly generating the\nvirtual brush strokes to paint an image. We present Painter, an LLM that can\nconvert user prompts in text description format to sketches by generating the\ncorresponding brush strokes in an auto-regressive way. We construct Painter\nbased on off-the-shelf LLM that is pre-trained on a large text corpus, by\nfine-tuning it on the new task while preserving language understanding\ncapabilities. We create a dataset of diverse multi-object sketches paired with\ntextual prompts that covers several object types and tasks. Painter can\ngenerate sketches from text descriptions, remove objects from canvas, and\ndetect and classify objects in sketches. Although this is an unprecedented\npioneering work in using LLMs for auto-regressive image generation, the results\nare very encouraging.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:18:30 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pourreza","Reza",""],["Bhattacharyya","Apratim",""],["Panchal","Sunny",""],["Lee","Mingu",""],["Madan","Pulkit",""],["Memisevic","Roland",""]]}
{"id":"2308.08521","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Search for vector-boson resonances decaying into a top quark and a\n  bottom quark using $pp$ collisions at $\\sqrt{s} = 13$ TeV with the ATLAS\n  detector","comments":"60 pages in total, author list starting page 43, 14 figures, 6\n  tables, submitted to JHEP. All figures including auxiliary figures are\n  available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/EXOT-2021-36","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-149","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A search for a new massive charged gauge boson, $W'$, is performed with the\nATLAS detector at the LHC. The dataset used in this analysis was collected from\nproton-proton collisions at a centre-of-mass energy of $\\sqrt{s} =13$ TeV, and\ncorresponds to an integrated luminosity of 139 fb$^{-1}$. The reconstructed\n$tb$ invariant mass is used to search for a $W'$ boson decaying into a top\nquark and a bottom quark. The result is interpreted in terms of a $W'$ boson\nwith purely right-handed or left-handed chirality in a mass range of 0.5-6 TeV.\nDifferent values for the coupling of the $W'$ boson to the top and bottom\nquarks are considered, taking into account interference with single-top-quark\nproduction in the $s$-channel. No significant deviation from the background\nprediction is observed. The results are expressed as upper limits on the $W'\n\\rightarrow tb$ production cross-section times branching ratio as a function of\nthe $W'$-boson mass and in the plane of the coupling vs the $W'$-boson mass.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:19:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.08522","submitter":"Marc Goerigk","authors":"Werner Baak, Marc Goerigk, Adam Kasperski, Pawe{\\l} Zieli\\'nski","title":"Generalizing the Min-Max Regret Criterion using Ordered Weighted\n  Averaging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In decision making under uncertainty, several criteria have been studied to\naggregate the performance of a solution over multiple possible scenarios,\nincluding the ordered weighted averaging (OWA) criterion and min-max regret.\nThis paper introduces a novel generalization of min-max regret, leveraging the\nmodeling power of OWA to enable a more nuanced expression of preferences in\nhandling regret values. This new OWA regret approach is studied both\ntheoretically and numerically. We derive several properties, including\npolynomially solvable and hard cases, and introduce an approximation algorithm.\nThrough computational experiments using artificial and real-world data, we\ndemonstrate the advantages of our OWAR method over the conventional min-max\nregret approach, alongside the effectiveness of the proposed clustering\nheuristics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:20:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Baak","Werner",""],["Goerigk","Marc",""],["Kasperski","Adam",""],["Zieli\u0144ski","Pawe\u0142",""]]}
{"id":"2308.08523","submitter":"Silvan Suter","authors":"Adam Kurpisz and Silvan Suter","title":"Improved Approximations for Translational Packing of Convex Polygons","comments":"This is the full version of the same-named paper which will be\n  presented at ESA 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optimal packing of objects in containers is a critical problem in various\nreal-life and industrial applications. This paper investigates the\ntwo-dimensional packing of convex polygons without rotations, where only\ntranslations are allowed. We study different settings depending on the type of\ncontainers used, including minimizing the number of containers or the size of\nthe container based on an objective function.\n  Building on prior research in the field, we develop polynomial-time\nalgorithms with improved approximation guarantees upon the best-known results\nby Alt, de Berg and Knauer, as well as Aamand, Abrahamsen, Beretta and Kleist,\nfor problems such as Polygon Area Minimization, Polygon Perimeter Minimization,\nPolygon Strip Packing, and Polygon Bin Packing. Our approach utilizes a\nsequence of object transformations that allows sorting by height and\norientation, thus enhancing the effectiveness of shelf packing algorithms for\npolygon packing problems. In addition, we present efficient approximation\nalgorithms for special cases of the Polygon Bin Packing problem, progressing\ntoward solving an open question concerning an O(1)-approximation algorithm for\narbitrary polygons.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:20:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kurpisz","Adam",""],["Suter","Silvan",""]]}
{"id":"2308.08524","submitter":"Carsten Conradi","authors":"Carsten Conradi and Maya Mincheva","title":"In distributive phosphorylation catalytic constants enable non-trivial\n  dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Distributive phosphorylation is recurrent motif in intracellular signaling\nand control. It is either sequential or cyclic. Sequential distributive\nphosphorylation has been extensively studied and it has been shown that the\ncatalytic constants of kinase and phosphatase enable multistationarity and\nhence bistability. Here we show for cyclic distributive phosphorylation that if\nits catalytic constants satisfy the very same inequality as in the sequential\ncase, then Hopf bifurcations and hence sustained oscillations can occur. Hence\nwe conclude that in distributive phosphorylation (sequential and distributive)\nit is the catalytic constants that enable nontrivial dynamics.\n  In fact, if the rate constants in a network of cyclic distributive\nphosphorylation are such that Hopf bifurcations and sustained oscillations\noccur, then a network of sequential distributive phosphorylation with the same\nrate constants will show multistationarity. For cyclic distributive\nphosphorylation we further describe a procedure to generate rate constants\nwhere Hopf bifurcations and hence sustained oscillations occur. This may allow\nan efficient sampling of oscillatory regions in parameter space.\n  Our analysis is greatly simplified by the fact that it is possible to reduce\nthe network of cyclic distributive phosphorylation to what we call a network\nwith a single extreme ray. We summarize key properties of these networks.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:20:52 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Conradi","Carsten",""],["Mincheva","Maya",""]]}
{"id":"2308.08525","submitter":"Chaorui Deng","authors":"Qi Chen, Chaorui Deng, Zixiong Huang, Bowen Zhang, Mingkui Tan, Qi Wu","title":"Likelihood-Based Text-to-Image Evaluation with Patch-Level Perceptual\n  and Semantic Credit Assignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-to-image synthesis has made encouraging progress and attracted lots of\npublic attention recently. However, popular evaluation metrics in this area,\nlike the Inception Score and Fr'echet Inception Distance, incur several issues.\nFirst of all, they cannot explicitly assess the perceptual quality of generated\nimages and poorly reflect the semantic alignment of each text-image pair. Also,\nthey are inefficient and need to sample thousands of images to stabilise their\nevaluation results. In this paper, we propose to evaluate text-to-image\ngeneration performance by directly estimating the likelihood of the generated\nimages using a pre-trained likelihood-based text-to-image generative model,\ni.e., a higher likelihood indicates better perceptual quality and better\ntext-image alignment. To prevent the likelihood of being dominated by the\nnon-crucial part of the generated image, we propose several new designs to\ndevelop a credit assignment strategy based on the semantic and perceptual\nsignificance of the image patches. In the experiments, we evaluate the proposed\nmetric on multiple popular text-to-image generation models and datasets in\naccessing both the perceptual quality and the text-image alignment. Moreover,\nit can successfully assess the generation ability of these models with as few\nas a hundred samples, making it very efficient in practice.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:26:47 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Chen","Qi",""],["Deng","Chaorui",""],["Huang","Zixiong",""],["Zhang","Bowen",""],["Tan","Mingkui",""],["Wu","Qi",""]]}
{"id":"2308.08526","submitter":"Basudeb Mondal","authors":"Manoj Gupta, Basudeb Mondal, Subhro Bhattacharjee, Tanusri Saha\n  Dasgupta","title":"Ab-initio Insights on the Fermiology of $d^1$ Transition metals in\n  Honeycomb lattice : Hierarchy of hopping pathways and spin-orbit coupling","comments":"16 pages, 11 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":"  Motivated by the intriguing suggestion of realizing SU(8) Dirac semi-metal\nwith $J=3/2$ electrons on a honeycomb lattice, we provide a systematic study of\nthe interplay of various hopping pathways and atomic spin-orbit coupling for\nthe low energy electrons in candidate d$^1$ transition metal halides MX$_3$\n(M=Ti, Zr, Hf; X=F, Cl, Br). By combining first principle calculations and\nminimal hopping Hamiltonian, we uncover the role of dominant direct metal-metal\nhopping on top of indirect metal-halide-metal hopping. This sets up a hierarchy\nof hopping pathways that centrally modify the SU(8) picture for the above\nmaterials. These hopping interactions, along with the spin-orbit coupling, lead\nto a plethora of exactly compensated metals instead of the SU(8) Dirac\nsemi-metal. Remarkably the same can be understood as descendants of a\ntopological insulator obtained by gapping out the SU(8) Dirac semi-metallic\nphase. The resultant compensated metals have varied Fermi surface topology and\nare separated by Lifshitz phase transitions. We discuss the implications of the\nproximate Lifshitz transition, which may be accessed via strain, in the context\nof the relevant materials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:29:43 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Gupta","Manoj",""],["Mondal","Basudeb",""],["Bhattacharjee","Subhro",""],["Dasgupta","Tanusri Saha",""]]}
{"id":"2308.08527","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi, Saeid Aliakbar, AmirMahdi Mohammadi","title":"Patterns and Pathways: Applying Social Network Analysis to Understand\n  User Behavior in the Tourism Industry Websites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The contemporary tourism landscape is undergoing rapid digitization,\nnecessitating a nuanced comprehension of online user behavior to guide\ndata-driven decision-making. This research bridges an existing gap by\ninvestigating the tourism website ecosystem through social network analysis. It\nfocuses specifically on inter-website communication patterns based on user\nnavigation. Data mining facilitates the identification of 162 core Iranian\ntourism websites, which are visualized as an interconnected network with\nwebsites as nodes and user transitions as weighted directed edges. By\nimplementing community detection, eight key clusters are discerned,\nencompassing domains like ticket/tour bookings, accommodations, location\nservices, and cuisine. Further analysis of inter-community relationships\nreveals website groupings frequently accessed together by users, highlighting\ncomplementary services sought during travel planning. The research derives\ninvaluable insights into user preferences and information propagation within\nthe tourism ecosystem. The methodology and findings contribute original\nperspectives to academia while offering pragmatic strategic recommendations to\nindustry stakeholders like service providers, investors, and policymakers. This\npioneering exploration of latent user behavior patterns advances comprehension\nof the evolving digital tourism landscape in Iran. It contributes pathways\ntoward a sustainable future vision of the ecosystem, guiding stakeholders in\ntargeted decision-making based on empirical evidence derived from social\nnetwork analysis of websites and consumption patterns. The innovative\nmethodology expands the toolkit for data-driven tourism research within\nacademia.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:31:08 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Maghsoudi","Mehrdad",""],["Aliakbar","Saeid",""],["Mohammadi","AmirMahdi",""]]}
{"id":"2308.08528","submitter":"Arka Chatterjee","authors":"Prantik Nandi, Arka Chatterjee, Arghajit Jana, Sandip K. Chakrabarti,\n  Sachindra Naik, Samar Safi-Harb, Hsiang-Kuang Chang and Jeremy Heyl","title":"Survey of Bare Active Galactic Nuclei in the local universe (z < 0.2):\n  I. On the origin of Soft-Excess","comments":"Accepted for publication in ApJ Supplement Series, 37 pages, 12\n  figures 5 tables","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 analyse a sample of 21 `bare' Seyfert~1 Active Galactic Nuclei (AGNs), a\nsub-class of Seyfert~1s, with intrinsic absorption $\\mathrm{N_{H}} \\sim\n10^{20}~ \\mathrm{cm}^{-2}$, in the local universe (z $<$ 0.2) using {\\it\nXMM-Newton} and {\\it Swift}/XRT observations. The luminosities of the primary\ncontinuum, the X-ray emission in the 3 to 10 keV energy range and the\nsoft-excess, the excess emission that appears above the low-energy\nextrapolation of the power-law fit of 3 to 10 keV X-ray spectra, are\ncalculated. Our spectral analysis reveals that the long-term intrinsic\nluminosities of the soft-excess and the primary continuum are tightly\ncorrelated $(L_{PC}\\propto L_{SE}^{1.1\\pm0.04})$. We also found that the\nluminosities are correlated for each source. This result suggests that both the\nprimary continuum and soft excess emissions exhibit a dependency on the\naccretion rate in a similar way.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:32:46 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nandi","Prantik",""],["Chatterjee","Arka",""],["Jana","Arghajit",""],["Chakrabarti","Sandip K.",""],["Naik","Sachindra",""],["Safi-Harb","Samar",""],["Chang","Hsiang-Kuang",""],["Heyl","Jeremy",""]]}
{"id":"2308.08529","submitter":"Fangrui Zhu","authors":"Fangrui Zhu, Yiming Xie, Weidi Xie, Huaizu Jiang","title":"Diagnosing Human-object Interaction Detectors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although we have witnessed significant progress in human-object interaction\n(HOI) detection with increasingly high mAP (mean Average Precision), a single\nmAP score is too concise to obtain an informative summary of a model's\nperformance and to understand why one approach is better than another. In this\npaper, we introduce a diagnosis toolbox for analyzing the error sources of the\nexisting HOI detection models. We first conduct holistic investigations in the\npipeline of HOI detection, consisting of human-object pair detection and then\ninteraction classification. We define a set of errors and the oracles to fix\neach of them. By measuring the mAP improvement obtained from fixing an error\nusing its oracle, we can have a detailed analysis of the significance of\ndifferent errors. We then delve into the human-object detection and interaction\nclassification, respectively, and check the model's behavior. For the first\ndetection task, we investigate both recall and precision, measuring the\ncoverage of ground-truth human-object pairs as well as the noisiness level in\nthe detections. For the second classification task, we compute mAP for\ninteraction classification only, without considering the detection scores. We\nalso measure the performance of the models in differentiating human-object\npairs with and without actual interactions using the AP (Average Precision)\nscore. Our toolbox is applicable for different methods across different\ndatasets and available at https://github.com/neu-vi/Diag-HOI.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:39:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Zhu","Fangrui",""],["Xie","Yiming",""],["Xie","Weidi",""],["Jiang","Huaizu",""]]}
{"id":"2308.08530","submitter":"Georgios Kouros","authors":"Georgios Kouros and Minye Wu and Shubham Shrivastava and Sushruth\n  Nagesh and Punarjay Chakravarty and Tinne Tuytelaars","title":"Ref-DVGO: Reflection-Aware Direct Voxel Grid Optimization for an\n  Improved Quality-Efficiency Trade-Off in Reflective Scene Reconstruction","comments":"5 pages, 4 figures, 3 tables, ICCV TRICKY 2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural Radiance Fields (NeRFs) have revolutionized the field of novel view\nsynthesis, demonstrating remarkable performance. However, the modeling and\nrendering of reflective objects remain challenging problems. Recent methods\nhave shown significant improvements over the baselines in handling reflective\nscenes, albeit at the expense of efficiency. In this work, we aim to strike a\nbalance between efficiency and quality. To this end, we investigate an\nimplicit-explicit approach based on conventional volume rendering to enhance\nthe reconstruction quality and accelerate the training and rendering processes.\nWe adopt an efficient density-based grid representation and reparameterize the\nreflected radiance in our pipeline. Our proposed reflection-aware approach\nachieves a competitive quality efficiency trade-off compared to competing\nmethods. Based on our experimental results, we propose and discuss hypotheses\nregarding the factors influencing the results of density-based methods for\nreconstructing reflective objects. The source code is available at\nhttps://github.com/gkouros/ref-dvgo.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:40:18 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 15:44:13 GMT"},{"version":"v3","created":"Mon, 21 Aug 2023 07:22:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kouros","Georgios",""],["Wu","Minye",""],["Shrivastava","Shubham",""],["Nagesh","Sushruth",""],["Chakravarty","Punarjay",""],["Tuytelaars","Tinne",""]]}
{"id":"2308.08531","submitter":"Ahmad Omar .","authors":"Luke Langford and Ahmad K. Omar","title":"Theory of Capillary Tension and Interfacial Dynamics of Motility-Induced\n  Phases","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":"  The statistical mechanics of equilibrium interfaces has been well-established\nfor over a half century. In the last decade, a wealth of observations have made\nincreasingly clear that a new perspective is required to describe interfaces\narbitrarily far from equilibrium. In this Article, beginning from microscopic\nparticle dynamics that break time-reversal symmetry, we systematically derive\nthe interfacial dynamics of coexisting motility-induced phases. Doing so allows\nus to identify the athermal energy scale that excites interfacial fluctuations\nand the nonequilibrium surface tension that resists these excitations. In\naddition to establishing an active capillary-wave theory, our theory identifies\nthat, in contrast to equilibrium fluids, this active surface tension contains\ncontributions arising from nonconservative forces which act to suppress\ninterfacial fluctuations. The identified contribution bares a remarkable\nresemblance with that envisioned by Edwards and Wilkinson in their description\nof the surface of athermal granular materials, suggesting that\ndynamically-stabilized interfaces may be a phenomenon common to a wide class of\nnonequilibrium systems.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:41:29 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 05:41:00 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Langford","Luke",""],["Omar","Ahmad K.",""]]}
{"id":"2308.08532","submitter":"Naghi Behzadi","authors":"Naghi Behzadi","title":"Refrigeration by modified Otto cycles and modified swaps through\n  generalized measurements","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce two types of thermodynamic refrigeration cycles obtained through\nmodification of the Otto cycle refrigerator by a generalized measurement\nchannel. These refrigerators are corresponding to the activation of the\nmeasurement-based stroke before (first type) and after (second type) the full\nthermalization of the cooling medium by the cold reservoir in the related\nfamiliar Otto cycle. We show that the coefficient of performance for the first\ntype modified refrigerator increases linearly in terms of measurement strength\nparameter, beyond the classical cooling of the known Otto cycle refrigerator.\nThe second type interestingly introduces another autonomous refrigerator whose\nsupplying work is provided by a quantum engine induced by the measurement\nchannel along the modified cycle. By the considered measurement channel, we\nalso establish such modifications on the swap refrigerator. It is observed that\nthe thermodynamic properties of the obtained modified swap refrigerators are\nthe same as of the modified Otto cycle ones respectively.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:45:56 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:48:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Behzadi","Naghi",""]]}
{"id":"2308.08533","submitter":"Zheng Liu","authors":"Zheng Liu","title":"$p$-adic $L$-functions for ${\\rm GSp}(4)\\times{\\rm GL}(2)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct $p$-adic $L$-functions interpolating the critical values of the\ndegree eight $L$-functions of ${\\rm GSp}(4)\\times {\\rm GL}(2)$ for cuspidal\nautomorphic representations generated by $p$-ordinary Siegel modular forms of\ngenus two and $p$-ordinary modular forms.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:47:02 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Zheng",""]]}
{"id":"2308.08534","submitter":"Hoang Nguyen","authors":"Hoang M. Nguyen, Sydney Gyurek, Russell Mierop, Kenneth V. Pecota,\n  Kylie LaGamba, Michael Boyette, G. Craig Yencho, Cranos M. Williams, Michael\n  W. Kudenov","title":"Deployment and Analysis of Instance Segmentation Algorithm for In-field\n  Grade Estimation of Sweetpotatoes","comments":"21 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shape estimation of sweetpotato (SP) storage roots is inherently challenging\ndue to their varied size and shape characteristics. Even measuring \"simple\"\nmetrics, such as length and width, requires significant time investments either\ndirectly in-field or afterward using automated graders. In this paper, we\npresent the results of a model that can perform grading and provide yield\nestimates directly in the field quicker than manual measurements. Detectron2, a\nlibrary consisting of deep-learning object detection algorithms, was used to\nimplement Mask R-CNN, an instance segmentation model. This model was deployed\nfor in-field grade estimation of SPs and evaluated against an optical sorter.\nStorage roots from various clones imaged with a cellphone during trials between\n2019 and 2020, were used in the model's training and validation to fine-tune a\nmodel to detect SPs. Our results showed that the model could distinguish\nindividual SPs in various environmental conditions including variations in\nlighting and soil characteristics. RMSE for length, width, and weight, from the\nmodel compared to a commercial optical sorter, were 0.66 cm, 1.22 cm, and 74.73\ng, respectively, while the RMSE of root counts per plot was 5.27 roots, with\nr^2 = 0.8. This phenotyping strategy has the potential enable rapid yield\nestimates in the field without the need for sophisticated and costly optical\nsorters and may be more readily deployed in environments with limited access to\nthese kinds of resources or facilities.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:47:05 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Nguyen","Hoang M.",""],["Gyurek","Sydney",""],["Mierop","Russell",""],["Pecota","Kenneth V.",""],["LaGamba","Kylie",""],["Boyette","Michael",""],["Yencho","G. Craig",""],["Williams","Cranos M.",""],["Kudenov","Michael W.",""]]}
{"id":"2308.08535","submitter":"Alp M\\\"uyesser","authors":"Tom Kelly and Alp M\\\"uyesser and Alexey Pokrovskiy","title":"Optimal spread for spanning subgraphs of Dirac hypergraphs","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ and $H$ be hypergraphs on $n$ vertices, and suppose $H$ has large\nenough minimum degree to necessarily contain a copy of $G$ as a subgraph. We\ngive a general method to randomly embed $G$ into $H$ with good \"spread\". More\nprecisely, for a wide class of $G$, we find a randomised embedding $f\\colon\nG\\hookrightarrow H$ with the following property: for every $s$, for any partial\nembedding $f'$ of $s$ vertices of $G$ into $H$, the probability that $f$\nextends $f'$ is at most $O(1/n)^s$. This is a common generalisation of several\nstreams of research surrounding the classical Dirac-type problem. For example,\nsetting $s=n$, we obtain an asymptotically tight lower bound on the number of\nembeddings of $G$ into $H$. This recovers and extends recent results of Glock,\nGould, Joos, K\\\"uhn, and Osthus and of Montgomery and Pavez-Sign\\'e regarding\nenumerating Hamilton cycles in Dirac hypergraphs. Moreover, using the recent\ndevelopments surrounding the Kahn--Kalai conjecture, this result implies that\nmany Dirac-type results hold robustly, meaning $G$ still embeds into $H$ after\na random sparsification of its edge set. This allows us to recover a recent\nresult of Kang, Kelly, K\\\"uhn, Osthus, and Pfenninger and of Pham, Sah,\nSawhney, and Simkin for perfect matchings, and obtain novel results for\nHamilton cycles and factors in Dirac hypergraphs. Notably, our randomised\nembedding algorithm is self-contained and does not require Szemer\\'edi's\nregularity lemma or iterative absorption.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:47:31 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Kelly","Tom",""],["M\u00fcyesser","Alp",""],["Pokrovskiy","Alexey",""]]}
{"id":"2308.08536","submitter":"Haldun Balim","authors":"Haldun Balim, Zhe Du, Samet Oymak, Necmiye Ozay","title":"Can Transformers Learn Optimal Filtering for Unknown Systems?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AI cs.LG cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transformers have demonstrated remarkable success in natural language\nprocessing; however, their potential remains mostly unexplored for problems\narising in dynamical systems. In this work, we investigate the optimal output\nestimation problem using transformers, which generate output predictions using\nall the past ones. We train the transformer using various systems drawn from a\nprior distribution and then evaluate its performance on previously unseen\nsystems from the same distribution. As a result, the obtained transformer acts\nlike a prediction algorithm that learns in-context and quickly adapts to and\npredicts well for different systems - thus we call it meta-output-predictor\n(MOP). MOP matches the performance of the optimal output estimator, based on\nKalman filter, for most linear dynamical systems even though it does not have\naccess to a model. We observe via extensive numerical experiments that MOP also\nperforms well in challenging scenarios with non-i.i.d. noise, time-varying\ndynamics, and nonlinear dynamics like a quadrotor system with unknown\nparameters. To further support this observation, in the second part of the\npaper, we provide statistical guarantees on the performance of MOP and quantify\nthe required amount of training to achieve a desired excess risk during\ntest-time. Finally, we point out some limitations of MOP by identifying two\nclasses of problems MOP fails to perform well, highlighting the need for\ncaution when using transformers for control and estimation.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:52:11 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Balim","Haldun",""],["Du","Zhe",""],["Oymak","Samet",""],["Ozay","Necmiye",""]]}
{"id":"2308.08537","submitter":"Leonid Kagan","authors":"Jorge Yanez, Leonid Kagan, Gregory Sivashinsky and Mike Kuznetsov","title":"Modeling of 2D self-drifting flame-balls in Hele-Shaw cells","comments":"19 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The disintegration of near limit flames propagating through the gap of\nHele-Shaw cells has recently become a subject of active research. In this\npaper, the flamelets resulting from the disintegration of the continuous front\na reinterpreted in terms of the Zeldovich flame-balls stabilized by volumetric\nheat losses. A complicated free-boundary problem for 2D self-drifting near\ncircular flamelets is reduced to a 1D model. The 1D formulation is then\nutilized to obtain the locus of the flamelet velocity, radius, heat losses and\nLewis numbers at which the self-drifting flamelet exists.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:52:57 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Yanez","Jorge",""],["Kagan","Leonid",""],["Sivashinsky","Gregory",""],["Kuznetsov","Mike",""]]}
{"id":"2308.08538","submitter":"Chaoyang Song","authors":"Xiaobo Liu, Xudong Han, Wei Hong, Fang Wan, Chaoyang Song","title":"Proprioceptive Learning with Soft Polyhedral Networks","comments":"20 pages, 10 figures, 2 tables, submitted to the International\n  Journal of Robotics Research for review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Proprioception is the \"sixth sense\" that detects limb postures with motor\nneurons. It requires a natural integration between the musculoskeletal systems\nand sensory receptors, which is challenging among modern robots that aim for\nlightweight, adaptive, and sensitive designs at a low cost. Here, we present\nthe Soft Polyhedral Network with an embedded vision for physical interactions,\ncapable of adaptive kinesthesia and viscoelastic proprioception by learning\nkinetic features. This design enables passive adaptations to omni-directional\ninteractions, visually captured by a miniature high-speed motion tracking\nsystem embedded inside for proprioceptive learning. The results show that the\nsoft network can infer real-time 6D forces and torques with accuracies of\n0.25/0.24/0.35 N and 0.025/0.034/0.006 Nm in dynamic interactions. We also\nincorporate viscoelasticity in proprioception during static adaptation by\nadding a creep and relaxation modifier to refine the predicted results. The\nproposed soft network combines simplicity in design, omni-adaptation, and\nproprioceptive sensing with high accuracy, making it a versatile solution for\nrobotics at a low cost with more than 1 million use cycles for tasks such as\nsensitive and competitive grasping, and touch-based geometry reconstruction.\nThis study offers new insights into vision-based proprioception for soft robots\nin adaptive grasping, soft manipulation, and human-robot interaction.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:53:40 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Liu","Xiaobo",""],["Han","Xudong",""],["Hong","Wei",""],["Wan","Fang",""],["Song","Chaoyang",""]]}
{"id":"2308.08539","submitter":"Jo\\~ao F. Doriguello","authors":"Jonathan Allcock, Jinge Bao, Jo\\~ao F. Doriguello, Alessandro Luongo,\n  Miklos Santha","title":"Constant-depth circuits for Uniformly Controlled Gates and Boolean\n  functions with application to quantum memory circuits","comments":"50 pages, 10 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC cs.ET","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We explore the power of the unbounded Fan-Out gate and the Global Tunable\ngates generated by Ising-type Hamiltonians in constructing constant-depth\nquantum circuits, with particular attention to quantum memory devices. We\npropose two types of constant-depth constructions for implementing Uniformly\nControlled Gates. These gates include the Fan-In gates defined by\n$|x\\rangle|b\\rangle\\mapsto |x\\rangle|b\\oplus f(x)\\rangle$ for $x\\in\\{0,1\\}^n$\nand $b\\in\\{0,1\\}$, where $f$ is a Boolean function. The first of our\nconstructions is based on computing the one-hot encoding of the control\nregister $|x\\rangle$, while the second is based on Boolean analysis and\nexploits different representations of $f$ such as its Fourier expansion. Via\nthese constructions, we obtain constant-depth circuits for the quantum\ncounterparts of read-only and read-write memory devices -- Quantum Random\nAccess Memory (QRAM) and Quantum Random Access Gate (QRAG) -- of memory size\n$n$. The implementation based on one-hot encoding requires either\n$O(n\\log{n}\\log\\log{n})$ ancillae and $O(n\\log{n})$ Fan-Out gates or\n$O(n\\log{n})$ ancillae and $6$ Global Tunable gates. On the other hand, the\nimplementation based on Boolean analysis requires only $2$ Global Tunable gates\nat the expense of $O(n^2)$ ancillae.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:54:56 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Allcock","Jonathan",""],["Bao","Jinge",""],["Doriguello","Jo\u00e3o F.",""],["Luongo","Alessandro",""],["Santha","Miklos",""]]}
{"id":"2308.08540","submitter":"Hakim Atek","authors":"Hakim Atek, Ivo Labb\\'e, Lukas J. Furtak, Iryna Chemerynska, Seiji\n  Fujimoto, David J. Setton, Tim B. Miller, Pascal Oesch, Rachel Bezanson,\n  Sedona H. Price, Pratika Dayal, Adi Zitrin, Vasily Kokorev, John R. Weaver,\n  Gabriel Brammer, Pieter van Dokkum, Christina C. Williams, Sam E. Cutler,\n  Robert Feldmann, Yoshinobu Fudamoto, Jenny E. Greene, Joel Leja, Michael V.\n  Maseda, Adam Muzzin, Richard Pan, Casey Papovich, Erica J. Nelson, Themiya\n  Nanayakkara, Daniel P. Stark, Mauro Stefanon, Katherine A. Suess, Bingjie\n  Wang, and Katherine E. Whitaker","title":"First spectroscopic observations of the galaxies that reionized the\n  Universe","comments":"29 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low-mass galaxies in the early universe are believed to be the building\nblocks of present-day galaxies. These fledgling systems likely played a pivotal\nrole in cosmic reionization, a major phase transition from neutral Hydrogen to\nionized plasma around 600-800 Myr after the Big Bang. However, these galaxies\nhave eluded comprehensive spectroscopic studies owing to their extreme\nfaintness. Here we report the first spectroscopic analysis of 8 ultra-faint\ngalaxies during the epoch of reionization with absolute magnitudes between\nM$_{\\rm UV}$ $\\sim -17$ to $-15$ mag (down to 0.005 $L^{\\star}$). The\ncombination of ultra-deep NIRSpec (Near-Infrared Spectrograph) observations and\nthe strong gravitational lensing boost of Abell~2744 allow us to derive the\nfirst spectroscopic constraints on the prevalence of faint galaxies and their\nionizing properties during the Universe's first billion years. We find that\nfaint galaxies are prodigious producers of ionizing photons with log($\\xi_{\\rm\nion}$/ Hz erg$^{-1}$) =$25.8\\pm 0.05$, a factor of 4 larger than canonical\nvalues. This means that the total rate of ionizing photons produced by galaxies\nexceeds that needed for reionization, even for modest values of escape fraction\n($f_{\\rm esc}$ =5%). These findings provide robust evidence that faint galaxies\nwere the main drivers of cosmic reionization at $z\\sim7$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:55:28 GMT"},{"version":"v2","created":"Fri, 18 Aug 2023 13:11:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Atek","Hakim",""],["Labb\u00e9","Ivo",""],["Furtak","Lukas J.",""],["Chemerynska","Iryna",""],["Fujimoto","Seiji",""],["Setton","David J.",""],["Miller","Tim B.",""],["Oesch","Pascal",""],["Bezanson","Rachel",""],["Price","Sedona H.",""],["Dayal","Pratika",""],["Zitrin","Adi",""],["Kokorev","Vasily",""],["Weaver","John R.",""],["Brammer","Gabriel",""],["van Dokkum","Pieter",""],["Williams","Christina C.",""],["Cutler","Sam E.",""],["Feldmann","Robert",""],["Fudamoto","Yoshinobu",""],["Greene","Jenny E.",""],["Leja","Joel",""],["Maseda","Michael V.",""],["Muzzin","Adam",""],["Pan","Richard",""],["Papovich","Casey",""],["Nelson","Erica J.",""],["Nanayakkara","Themiya",""],["Stark","Daniel P.",""],["Stefanon","Mauro",""],["Suess","Katherine A.",""],["Wang","Bingjie",""],["Whitaker","Katherine E.",""]]}
{"id":"2308.08541","submitter":"Mahendra Panthee","authors":"Mikaela Baldasso and Mahendra Panthee","title":"Improved algebraic lower bound for the radius of spatial analyticity for\n  the generalized KdV equation","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the initial value problema (IVP) for the generalized Korteweg-de\nVries (gKdV) equation \\begin{equation} \\begin{cases}\n\\partial_tu+\\partial_x^3u+\\mu u^k\\partial_xu=0, \\,\\;\\; x\\in \\mathbb{R}, \\, t\n\\in \\mathbb{R},\\\\ u(x,0)=u_0(x), \\end{cases} \\end{equation} where $u(x,\\,t)$ is\na real valued function, $u_0(x)$ is a real analytic function, $\\mu=\\pm 1$ and\n$k\\geq 4$. We prove that if the initial data $u_0$ has radius of analyticity\n$\\sigma_0$, then there exists $T_0>0$ such that the radius of spatial\nanalyticity of the solution remains the same in the time interval $[-T_0, \\,\nT_0]$. In the defocusing case, for $k\\geq 4$ even, we prove that when the local\nsolution extends globally in time, then for any $T\\geq T_0$, the radius of\nanalyticity cannot decay faster than\n$cT^{-\\left(\\frac{2k}{k+4}+\\epsilon\\right)}$, $\\epsilon>0$ arbitrarily small\nand $c>0$ a constant. The result of this work improves the one obtained by Bona\net al. in [ J. L. Bona, Z. Gruji\\'c, H. Kalisch, Algebraic lower bounds for the\nuniform radius of spatial analyticity for the generalized KdV equation, Ann\nInst. H. Poincar\\'e, 22 (2005) 783--797].\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:56:57 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 12:23:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Baldasso","Mikaela",""],["Panthee","Mahendra",""]]}
{"id":"2308.08542","submitter":"Grazia Salerno","authors":"Ville A. J. Pyykk\\\"onen, Grazia Salerno, Jaakko K\\\"ah\\\"ar\\\"a, and\n  P\\\"aivi T\\\"orm\\\"a","title":"All-optical switching at the two-photon limit with\n  interference-localized states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a single-photon-by-single-photon all-optical switch concept based\non interference-localized states on lattices and their delocalization by\ninteraction. In its 'open' operation, the switch stops single photons while\nallows photon pairs to pass the switch. Alternatively, in the 'closed'\noperation, the switch geometrically separates single-photon and two-photon\nstates. We demonstrate the concept using a three-site Stub unit cell and the\ndiamond chain. The systems are modeled by Bose-Hubbard Hamiltonians, and the\ndynamics is solved by exact diagonalization with Lindblad master equation. We\ndiscuss realization of the switch using photonic lattices with nonlinearities,\nsuperconductive qubit arrays, and ultracold atoms. We show that the switch\nallows arbitrary 'ON'/'OFF' contrast while achieving picosecond switching time\nat the single-photon switching energy with contemporary photonic materials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:58:25 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Pyykk\u00f6nen","Ville A. J.",""],["Salerno","Grazia",""],["K\u00e4h\u00e4r\u00e4","Jaakko",""],["T\u00f6rm\u00e4","P\u00e4ivi",""]]}
{"id":"2308.08543","submitter":"Zhenhua Xu","authors":"Zhenhua Xu, Kenneth K.Y. Wong, Hengshuang Zhao","title":"InsightMapper: A Closer Look at Inner-instance Information for\n  Vectorized High-Definition Mapping","comments":"Code and demo will be available at\n  https://tonyxuqaq.github.io/projects/InsightMapper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vectorized high-definition (HD) maps contain detailed information about\nsurrounding road elements, which are crucial for various downstream tasks in\nmodern autonomous driving vehicles, such as vehicle planning and control.\nRecent works have attempted to directly detect the vectorized HD map as a point\nset prediction task, resulting in significant improvements in detection\nperformance. However, these approaches fail to analyze and exploit the\ninner-instance correlations between predicted points, impeding further\nadvancements. To address these challenges, we investigate the utilization of\ninner-$\\textbf{INS}$tance information for vectorized h$\\textbf{IGH}$-definition\nmapping through $\\textbf{T}$ransformers and introduce InsightMapper. This paper\npresents three novel designs within InsightMapper that leverage inner-instance\ninformation in distinct ways, including hybrid query generation, inner-instance\nquery fusion, and inner-instance feature aggregation. Comparative experiments\nare conducted on the NuScenes dataset, showcasing the superiority of our\nproposed method. InsightMapper surpasses previous state-of-the-art (SOTA)\nmethods by 5.78 mAP and 5.12 TOPO, which assess topology correctness.\nSimultaneously, InsightMapper maintains high efficiency during both training\nand inference phases, resulting in remarkable comprehensive performance. The\nproject page for this work is available at\nhttps://tonyxuqaq.github.io/projects/InsightMapper .\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:58:28 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Xu","Zhenhua",""],["Wong","Kenneth K. Y.",""],["Zhao","Hengshuang",""]]}
{"id":"2308.08544","submitter":"Henghui Ding","authors":"Henghui Ding, Chang Liu, Shuting He, Xudong Jiang, Chen Change Loy","title":"MeViS: A Large-scale Benchmark for Video Segmentation with Motion\n  Expressions","comments":"ICCV 2023, Project Page: https://henghuiding.github.io/MeViS/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper strives for motion expressions guided video segmentation, which\nfocuses on segmenting objects in video content based on a sentence describing\nthe motion of the objects. Existing referring video object datasets typically\nfocus on salient objects and use language expressions that contain excessive\nstatic attributes that could potentially enable the target object to be\nidentified in a single frame. These datasets downplay the importance of motion\nin video content for language-guided video object segmentation. To investigate\nthe feasibility of using motion expressions to ground and segment objects in\nvideos, we propose a large-scale dataset called MeViS, which contains numerous\nmotion expressions to indicate target objects in complex environments. We\nbenchmarked 5 existing referring video object segmentation (RVOS) methods and\nconducted a comprehensive comparison on the MeViS dataset. The results show\nthat current RVOS methods cannot effectively address motion expression-guided\nvideo segmentation. We further analyze the challenges and propose a baseline\napproach for the proposed MeViS dataset. The goal of our benchmark is to\nprovide a platform that enables the development of effective language-guided\nvideo segmentation algorithms that leverage motion expressions as a primary cue\nfor object segmentation in complex video scenes. The proposed MeViS dataset has\nbeen released at https://henghuiding.github.io/MeViS.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:58:34 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ding","Henghui",""],["Liu","Chang",""],["He","Shuting",""],["Jiang","Xudong",""],["Loy","Chen Change",""]]}
{"id":"2308.08545","submitter":"Yuliang Xiu","authors":"Yangyi Huang, Hongwei Yi, Yuliang Xiu, Tingting Liao, Jiaxiang Tang,\n  Deng Cai, Justus Thies","title":"TeCH: Text-guided Reconstruction of Lifelike Clothed Humans","comments":"Project: https://huangyangyi.github.io/TeCH, Code:\n  https://github.com/huangyangyi/TeCH","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite recent research advancements in reconstructing clothed humans from a\nsingle image, accurately restoring the \"unseen regions\" with high-level details\nremains an unsolved challenge that lacks attention. Existing methods often\ngenerate overly smooth back-side surfaces with a blurry texture. But how to\neffectively capture all visual attributes of an individual from a single image,\nwhich are sufficient to reconstruct unseen areas (e.g., the back view)?\nMotivated by the power of foundation models, TeCH reconstructs the 3D human by\nleveraging 1) descriptive text prompts (e.g., garments, colors, hairstyles)\nwhich are automatically generated via a garment parsing model and Visual\nQuestion Answering (VQA), 2) a personalized fine-tuned Text-to-Image diffusion\nmodel (T2I) which learns the \"indescribable\" appearance. To represent\nhigh-resolution 3D clothed humans at an affordable cost, we propose a hybrid 3D\nrepresentation based on DMTet, which consists of an explicit body shape grid\nand an implicit distance field. Guided by the descriptive prompts +\npersonalized T2I diffusion model, the geometry and texture of the 3D humans are\noptimized through multi-view Score Distillation Sampling (SDS) and\nreconstruction losses based on the original observation. TeCH produces\nhigh-fidelity 3D clothed humans with consistent & delicate texture, and\ndetailed full-body geometry. Quantitative and qualitative experiments\ndemonstrate that TeCH outperforms the state-of-the-art methods in terms of\nreconstruction accuracy and rendering quality. The code will be publicly\navailable for research purposes at https://huangyangyi.github.io/TeCH\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:59:13 GMT"},{"version":"v2","created":"Sat, 19 Aug 2023 20:08:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Yangyi",""],["Yi","Hongwei",""],["Xiu","Yuliang",""],["Liao","Tingting",""],["Tang","Jiaxiang",""],["Cai","Deng",""],["Thies","Justus",""]]}
{"id":"2308.08546","submitter":"Juan Urrutia","authors":"John Ellis, Malcolm Fairbairn, Gabriele Franciolini, Gert H\\\"utsi,\n  Antonio Iovino Jr., Marek Lewicki, Martti Raidal, Juan Urrutia, Ville\n  Vaskonen and Hardi Veerm\\\"ae","title":"What is the source of the PTA GW signal?","comments":"15 pages, 17 figures, 1 table","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-43, CERN-TH-2023-153, AION-REPORT/2023-08","categories":"astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The most conservative interpretation of the nHz stochastic gravitational wave\nbackground (SGWB) discovered by NANOGrav and other Pulsar Timing Array (PTA)\nCollaborations is astrophysical, namely that it originates from supermassive\nblack hole (SMBH) binaries. However, alternative cosmological models have been\nproposed, including cosmic strings, phase transitions, domain walls, primordial\nfluctuations and \"audible\" axions. We perform a multi-model analysis (MMA) to\ncompare how well these different hypotheses fit the NANOGrav data, both in\nisolation and in combination with SMBH binaries, and address the questions:\nWhich interpretations fit the data best, and which are disfavoured? We also\ndiscuss experimental signatures that can help discriminate between different\nsources of the PTA GW signal, including fluctuations in the signal strength\nbetween frequency bins, individual sources and how the PTA signal extends to\nhigher frequencies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:59:15 GMT"}],"update_date":"2023-08-17","authors_parsed":[["Ellis","John",""],["Fairbairn","Malcolm",""],["Franciolini","Gabriele",""],["H\u00fctsi","Gert",""],["Iovino","Antonio","Jr."],["Lewicki","Marek",""],["Raidal","Martti",""],["Urrutia","Juan",""],["Vaskonen","Ville",""],["Veerm\u00e4e","Hardi",""]]}
{"id":"2308.08547","submitter":"Shubho Roy","authors":"Arpan Bhattacharyya, Manas Dogra, Shubho R. Roy","title":"CFT reconstruction of local bulk operators in half-Minkowski space","comments":"Updated bibliography, Updated discussion section, 20 pages, 2 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 construct a holographic map that reconstructs massless fields (scalars,\nMaxwell field \\& Fierz-Pauli field) in half-Minkowski spacetime in $d+1$\ndimensions terms of smeared primary operators in a large $N$ factorizable CFT\nin $\\mathbb{R}^{d-1,1}$ spacetime dimensions. This map is based on a Weyl\n(rescaling) transformation from the Poincar\\'e wedge of AdS to the Minkowski\nhalf-space; and on the HKLL smearing function, which reconstructs local bulk\noperators in the Poincar\\'e AdS in terms of smeared operators on the conformal\nboundary of the Poincar\\'e wedge. The massless scalar field is reconstructed up\nto the level of two-point functions, while the Maxwell field and massless\nspin-2 fields are reconstructed at the level of the one-point function. We also\ndiscuss potential ways the map can be generalized to higher dimensions, and to\nthe full Minkowski space.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:59:27 GMT"},{"version":"v2","created":"Thu, 17 Aug 2023 13:41:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhattacharyya","Arpan",""],["Dogra","Manas",""],["Roy","Shubho R.",""]]}
{"id":"2308.08549","submitter":"Satish Srinivas Ragunathan","authors":"S.Srinivas, R.Gadela, R.Sabu, A.Das, G.Nath and V.Datla","title":"Effects of Daily News Sentiment on Stock Price Forecasting","comments":"9th ICBAI conference on December'2022 at IIM Bangalore","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting future prices of a stock is an arduous task to perform. However,\nincorporating additional elements can significantly improve our predictions,\nrather than relying solely on a stock's historical price data to forecast its\nfuture price. Studies have demonstrated that investor sentiment, which is\nimpacted by daily news about the company, can have a significant impact on\nstock price swings. There are numerous sources from which we can get this\ninformation, but they are cluttered with a lot of noise, making it difficult to\naccurately extract the sentiments from them. Hence the focus of our research is\nto design an efficient system to capture the sentiments from the news about the\nNITY50 stocks and investigate how much the financial news sentiment of these\nstocks are affecting their prices over a period of time. This paper presents a\nrobust data collection and preprocessing framework to create a news database\nfor a timeline of around 3.7 years, consisting of almost half a million news\narticles. We also capture the stock price information for this timeline and\ncreate multiple time series data, that include the sentiment scores from\nvarious sections of the article, calculated using different sentiment\nlibraries. Based on this, we fit several LSTM models to forecast the stock\nprices, with and without using the sentiment scores as features and compare\ntheir performances.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 06:42:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Srinivas","S.",""],["Gadela","R.",""],["Sabu","R.",""],["Das","A.",""],["Nath","G.",""],["Datla","V.",""]]}
{"id":"2308.08550","submitter":"Vincent Ragel Mr","authors":"Damien Challet and Vincent Ragel","title":"Recurrent Neural Networks with more flexible memory: better predictions\n  than rough volatility","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend recurrent neural networks to include several flexible timescales\nfor each dimension of their output, which mechanically improves their abilities\nto account for processes with long memory or with highly disparate time scales.\nWe compare the ability of vanilla and extended long short term memory networks\n(LSTMs) to predict asset price volatility, known to have a long memory.\nGenerally, the number of epochs needed to train extended LSTMs is divided by\ntwo, while the variation of validation and test losses among models with the\nsame hyperparameters is much smaller. We also show that the model with the\nsmallest validation loss systemically outperforms rough volatility predictions\nby about 20% when trained and tested on a dataset with multiple time series.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 14:24:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Challet","Damien",""],["Ragel","Vincent",""]]}
{"id":"2308.08551","submitter":"Alexander Izzo","authors":"Alexander J. Izzo","title":"Every connected bounded domain of holomorphy has connected boundary","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that every connected, bounded domain of holomorphy in\n${\\mathbb{C}}^n$, $n\\geq 2$, has connected boundary.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 16:49:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Izzo","Alexander J.",""]]}
{"id":"2308.08552","submitter":"Xuezhi Yang","authors":"Xuezhi Yang","title":"Logic and Paradox","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article discusses the logical errors in the liar paradox, G\\\"odel's\nincompleteness theorems, Russell's paradox, and the halting problem. In order\nto avoid these errors, a redefinition of logic has been presented, which is\nconcluded as four principles in set-theoretic language, including 1. Don't talk\nabout empty; 2. Elements of set should have identity; 3. Sets should have\ndefinitions; and 4. A total set should be defined. The new definition of logic\ncan eliminate all paradoxes and invalid statements, thus becoming a solid\nfoundation for human language and knowledge.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:32:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Xuezhi",""]]}
{"id":"2308.08553","submitter":"Xiao Zhang","authors":"Xiao Zhang","title":"Upgrading Urban Water Storage System: Achieving Water Conservation,\n  Power Generation, Carbon Reduction, and Water Quality Enhancement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beijing is a megacity with a population of over 20 million. It has a massive\ndemand for water and electricity and is responsible for achieving carbon\nneutrality. However, Beijing is in a highly arid region, and its local\nelectricity production supply is less than 30% of the demand. The city's carbon\nneutrality goal also faces enormous challenges. To address these problems, this\npaper proposes a plan to cover the Beijing area's surface reservoirs and water\nchannels with solar panels. The results show that the plan is expected to save\nan average of 383 million m3 of water per year (which can meet the annual water\nneeds of 2.13 million households), generate 72.6 billion kWh of electricity\n(which can meet the annual electricity needs of 25.23 million households),\nreduce carbon dioxide emissions by 6.84 billion kg (equivalent to the annual\ncarbon dioxide absorption of 3.1 billion mature trees), and reduce the\nconcentration of one carcinogenic substance, microcystin, by 97.3%, while also\naddressing the issue of bromate. The results strongly suggest the potential\nsocial and economic value of using solar panels to cover surface reservoirs and\nwater channels. Field control experiments and related research should be\nactively promoted.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 03:38:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Xiao",""]]}
{"id":"2308.08554","submitter":"Abdulrezzak Zekiye","authors":"Abdulrezzak Zekiye, Semih Utku, Fadi Amroush, Oznur Ozkasap","title":"AI-Assisted Investigation of On-Chain Parameters: Risky Cryptocurrencies\n  and Price Factors","comments":"8 pages, 5 figures, 7 tables. Accepted for publication in The Fifth\n  International Conference on Blockchain Computing and Applications (BCCA 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.AI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cryptocurrencies have become a popular and widely researched topic of\ninterest in recent years for investors and scholars. In order to make informed\ninvestment decisions, it is essential to comprehend the factors that impact\ncryptocurrency prices and to identify risky cryptocurrencies. This paper\nfocuses on analyzing historical data and using artificial intelligence\nalgorithms on on-chain parameters to identify the factors affecting a\ncryptocurrency's price and to find risky cryptocurrencies. We conducted an\nanalysis of historical cryptocurrencies' on-chain data and measured the\ncorrelation between the price and other parameters. In addition, we used\nclustering and classification in order to get a better understanding of a\ncryptocurrency and classify it as risky or not. The analysis revealed that a\nsignificant proportion of cryptocurrencies (39%) disappeared from the market,\nwhile only a small fraction (10%) survived for more than 1000 days. Our\nanalysis revealed a significant negative correlation between cryptocurrency\nprice and maximum and total supply, as well as a weak positive correlation\nbetween price and 24-hour trading volume. Moreover, we clustered\ncryptocurrencies into five distinct groups using their on-chain parameters,\nwhich provides investors with a more comprehensive understanding of a\ncryptocurrency when compared to those clustered with it. Finally, by\nimplementing multiple classifiers to predict whether a cryptocurrency is risky\nor not, we obtained the best f1-score of 76% using K-Nearest Neighbor.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 09:20:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zekiye","Abdulrezzak",""],["Utku","Semih",""],["Amroush","Fadi",""],["Ozkasap","Oznur",""]]}
{"id":"2308.08555","submitter":"Francisco Caruso","authors":"Francisco Caruso and Vitor Oguri and Felipe Silveira","title":"On the Galilean covariance of the d'Alembert equation for acoustic\n  phenomena","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The covariance of the d'Alembert equation for acoustic phenomena -- which is\na mechanical wave equation -- under the conventional Galilean transformation is\ndemonstrated without the need to abandon the hypothesis that time is absolute\nin Classical Mechanics, {what would imply} a modification of Galileo's\ntransformations, as suggested in a paper recently published in this journal.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:44:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Caruso","Francisco",""],["Oguri","Vitor",""],["Silveira","Felipe",""]]}
{"id":"2308.08556","submitter":"Saturnino Luz","authors":"Saturnino Luz and Masood Masoodian","title":"Causally Linking Health Application Data and Personal Information\n  Management Tools","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proliferation of consumer health devices such as smart watches, sleep\nmonitors, smart scales, etc, in many countries, has not only led to growing\ninterest in health monitoring, but also to the development of a countless\nnumber of ``smart'' applications to support the exploration of such data by\nmembers of the general public, sometimes with integration into professional\nhealth services. While a variety of health data streams has been made available\nby such devices to users, these streams are often presented as separate\ntime-series visualizations, in which the potential relationships between health\nvariables are not explicitly made visible. Furthermore, despite the fact that\nother aspects of life, such as work and social connectivity, have become\nincreasingly digitised, health and well-being applications make little use of\nthe potentially useful contextual information provided by widely used personal\ninformation management tools, such as shared calendar and email systems. This\npaper presents a framework for the integration of these diverse data sources,\nanalytic and visualization tools, with inference methods and graphical user\ninterfaces to help users by highlighting causal connections among such\ntime-series.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 19:22:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luz","Saturnino",""],["Masoodian","Masood",""]]}
{"id":"2308.08557","submitter":"Ali Mostafazadeh","authors":"Farhang Loran and Ali Mostafazadeh","title":"Introducing a general method for solving electromagnetic radiation\n  problem in an arbitrary linear medium","comments":"26 pages, 2 figures, accepted for publication in Phys. Rev. A","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Numerical transfer matrices have been widely used in the study of wave\npropagation and scattering. These may be viewed as descretizations of a\nrecently introduced fundamental notion of transfer matrix which admits a\nrepresentation in terms of the evolution operator for an effective non-unitary\nquantum system. We use the fundamental transfer matrix to develop a general\nmethod for the solution of the problem of radiation of an oscillating source in\nan arbitrary, possibly non-homogenous, anisotropic, and active or lossy linear\nmedium. This allows us to obtain an analytic solution of this problem for an\noscillating source located in the vicinity of a planar collection of possibly\nanisotropic and active/lossy point scatterers such as those modeling a\ntwo-dimensional photonic crystal.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:12:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Loran","Farhang",""],["Mostafazadeh","Ali",""]]}
{"id":"2308.08558","submitter":"Gyeongmin Kim","authors":"Minsuk Kim, Byungchul Kim, Junyeong Yong, Jeongwoo Park and Gyeongmin\n  Kim","title":"BIRP: Bitcoin Information Retrieval Prediction Model Based on Multimodal\n  Pattern Matching","comments":"5 pages, 2 figures, KDD 2023 Machine Learning in Finance workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Financial time series have historically been assumed to be a martingale\nprocess under the Random Walk hypothesis. Instead of making investment\ndecisions using the raw prices alone, various multimodal pattern matching\nalgorithms have been developed to help detect subtly hidden repeatable patterns\nwithin the financial market. Many of the chart-based pattern matching tools\nonly retrieve similar past chart (PC) patterns given the current chart (CC)\npattern, and leaves the entire interpretive and predictive analysis, thus\nultimately the final investment decision, to the investors. In this paper, we\npropose an approach of ranking similar PC movements given the CC information\nand show that exploiting this as additional features improves the directional\nprediction capacity of our model. We apply our ranking and directional\nprediction modeling methodologies on Bitcoin due to its highly volatile prices\nthat make it challenging to predict its future movements.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 07:04:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Minsuk",""],["Kim","Byungchul",""],["Yong","Junyeong",""],["Park","Jeongwoo",""],["Kim","Gyeongmin",""]]}
{"id":"2308.08559","submitter":"Marie Touboul","authors":"Marie Touboul and Benjamin Vial and Rapha\\\"el Assier and S\\'ebastien\n  Guenneau and Richard Craster","title":"High-frequency homogenization for periodic dispersive media","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph math-ph math.MP physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-frequency homogenization is used to study dispersive media, containing\ninclusions placed periodically, for which the properties of the material depend\non the frequency (Lorentz or Drude model with damping, for example). Effective\nproperties are obtained near a given point of the dispersion diagram in\nfrequency-wavenumber space. The asymptotic approximations of the dispersion\ndiagrams, and the wavefields, so obtained are then cross-validated via detailed\ncomparison with finite element method simulations in both one and two\ndimensions.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:38:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Touboul","Marie",""],["Vial","Benjamin",""],["Assier","Rapha\u00ebl",""],["Guenneau","S\u00e9bastien",""],["Craster","Richard",""]]}
{"id":"2308.08560","submitter":"Gunther Gust","authors":"Gunther Gust, Tobias Brandt, Otto Koppius, Markus Rosenfelder, Dirk\n  Neumann","title":"3D Analytics: Opportunities and Guidelines for Information Systems\n  Research","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Progress in sensor technologies has made three-dimensional (3D)\nrepresentations of the physical world available at a large scale. Leveraging\nsuch 3D representations with analytics has the potential to advance Information\nSystems (IS) research in several areas. However, this novel data type has\nrarely been incorporated. To address this shortcoming, this article first\npresents two showcases of 3D analytics applications together with general\nmodeling guidelines for 3D analytics, in order to support IS researchers in\nimplementing research designs with 3D components. Second, the article presents\nseveral promising opportunities for 3D analytics to advance behavioral and\ndesign-oriented IS research in several contextual areas, such as healthcare IS,\nhuman-computer interaction, mobile commerce, energy informatics and others.\nThird, we investigate the nature of the benefits resulting from the application\nof 3D analytics, resulting in a list of common tasks of research projects that\n3D analytics can support, regardless of the contextual application area. Based\non the given showcases, modeling guidelines, research opportunities and\ntask-related benefits, we encourage IS researchers to start their journey into\nthis largely unexplored third spatial dimension.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:40:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gust","Gunther",""],["Brandt","Tobias",""],["Koppius","Otto",""],["Rosenfelder","Markus",""],["Neumann","Dirk",""]]}
{"id":"2308.08561","submitter":"Yifan Zhou","authors":"Yew Kee Wong, Yifan Zhou, Yan Shing Liang, Haichuan Qiu, Yu Xi Wu, Bin\n  He","title":"Implementation of The Future of Drug Discovery: QuantumBased Machine\n  Learning Simulation (QMLS)","comments":"13 pages, 6 figures","journal-ref":"International Journal of Computer Science and Mobile Applications,\n  Vol 11 Issue 5,May- 2023","doi":"10.5281/zenodo.7983561","report-no":null,"categories":"q-bio.BM cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Research & Development (R&D) phase of drug development is a lengthy and\ncostly process. To revolutionize this process, we introduce our new concept\nQMLS to shorten the whole R&D phase to three to six months and decrease the\ncost to merely fifty to eighty thousand USD. For Hit Generation, Machine\nLearning Molecule Generation (MLMG) generates possible hits according to the\nmolecular structure of the target protein while the Quantum Simulation (QS)\nfilters molecules from the primary essay based on the reaction and binding\neffectiveness with the target protein. Then, For Lead Optimization, the\nresultant molecules generated and filtered from MLMG and QS are compared, and\nmolecules that appear as a result of both processes will be made into dozens of\nmolecular variations through Machine Learning Molecule Variation (MLMV), while\nothers will only be made into a few variations. Lastly, all optimized molecules\nwould undergo multiple rounds of QS filtering with a high standard for reaction\neffectiveness and safety, creating a few dozen pre-clinical-trail-ready drugs.\nThis paper is based on our first paper, where we pitched the concept of machine\nlearning combined with quantum simulations. In this paper we will go over the\ndetailed design and framework of QMLS, including MLMG, MLMV, and QS.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:18:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wong","Yew Kee",""],["Zhou","Yifan",""],["Liang","Yan Shing",""],["Qiu","Haichuan",""],["Wu","Yu Xi",""],["He","Bin",""]]}
{"id":"2308.08562","submitter":"Da Zhou Dr.","authors":"Shuli Chen and Yuman Wang and Da Zhou and Jie Hu","title":"Bayesian Inference of Phenotypic Plasticity of Cancer Cells Based on\n  Dynamic Model for Temporal Cell Proportion Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP q-bio.CB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mounting evidence underscores the prevalent hierarchical organization of\ncancer tissues. At the foundation of this hierarchy reside cancer stem cells, a\nsubset of cells endowed with the pivotal role of engendering the entire cancer\ntissue through cell differentiation. In recent times, substantial attention has\nbeen directed towards the phenomenon of cancer cell plasticity, where the\ndynamic interconversion between cancer stem cells and non-stem cancer cells has\ngarnered significant interest. Since the task of detecting cancer cell\nplasticity from empirical data remains a formidable challenge, we propose a\nBayesian statistical framework designed to infer phenotypic plasticity within\ncancer cells, utilizing temporal data on cancer stem cell proportions. Our\napproach is grounded in a stochastic model, adept at capturing the dynamic\nbehaviors of cells. Leveraging Bayesian analysis, we explore the moment\nequation governing cancer stem cell proportions, derived from the Kolmogorov\nforward equation of our stochastic model. With improved Euler method for\nordinary differential equations, a new statistical method for parameter\nestimation in nonlinear ordinary differential equations models is developed,\nwhich also provides novel ideas for the study of compositional data. Extensive\nsimulations robustly validate the efficacy of our proposed method. To further\ncorroborate our findings, we apply our approach to analyze published data from\nSW620 colon cancer cell lines. Our results harmonize with \\emph{in situ}\nexperiments, thereby reinforcing the utility of our method in discerning and\nquantifying phenotypic plasticity within cancer cells.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 13:56:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Shuli",""],["Wang","Yuman",""],["Zhou","Da",""],["Hu","Jie",""]]}
{"id":"2308.08563","submitter":"Likang Wu","authors":"Likang Wu, Junji Jiang, Hongke Zhao, Hao Wang, Defu Lian, Mengdi Zhang\n  and Enhong Chen","title":"KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot\n  Node Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Zero-Shot Node Classification (ZNC) has been an emerging and\ncrucial task in graph data analysis. This task aims to predict nodes from\nunseen classes which are unobserved in the training process. Existing work\nmainly utilizes Graph Neural Networks (GNNs) to associate features' prototypes\nand labels' semantics thus enabling knowledge transfer from seen to unseen\nclasses. However, the multi-faceted semantic orientation in the\nfeature-semantic alignment has been neglected by previous work, i.e. the\ncontent of a node usually covers diverse topics that are relevant to the\nsemantics of multiple labels. It's necessary to separate and judge the semantic\nfactors that tremendously affect the cognitive ability to improve the\ngenerality of models. To this end, we propose a Knowledge-Aware Multi-Faceted\nframework (KMF) that enhances the richness of label semantics via the extracted\nKG (Knowledge Graph)-based topics. And then the content of each node is\nreconstructed to a topic-level representation that offers multi-faceted and\nfine-grained semantic relevancy to different labels. Due to the particularity\nof the graph's instance (i.e., node) representation, a novel geometric\nconstraint is developed to alleviate the problem of prototype drift caused by\nnode information aggregation. Finally, we conduct extensive experiments on\nseveral public graph datasets and design an application of zero-shot\ncross-domain recommendation. The quantitative results demonstrate both the\neffectiveness and generalization of KMF with the comparison of state-of-the-art\nbaselines.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 02:38:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Likang",""],["Jiang","Junji",""],["Zhao","Hongke",""],["Wang","Hao",""],["Lian","Defu",""],["Zhang","Mengdi",""],["Chen","Enhong",""]]}
{"id":"2308.08564","submitter":"Kazuharu Bamba","authors":"Kazuharu Bamba, Z. Yousaf, M. Z. Bhatti, R. Nazer, Yuki Hashimoto","title":"Collapsing dynamics of relativistic fluid in modified gravity admitting\n  a conformal Killing vector","comments":"26 pages, version accepted for publication in the European Physical\n  Journal C","journal-ref":null,"doi":"10.1140/epjc/s10052-023-11911-2","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The collapsing dynamics of relativistic fluid are explored in $f(R)$ gravity\nin a detailed systematic manner for the non-static spherically symmetric\nspacetime satisfying the equation of the conformal Killing vector. With\nquasi-homologous condition and diminishing complexity factor condition, exact\nsolutions for dissipative as well as for non-dissipative systems are found and\nthe astrophysical applications of these exact solutions are discussed.\nFurthermore, it is demonstrated that $f(R)=R$, which is the extensive\nrestriction of $f(R)$ gravity, prior solutions of the collapsing fluid in\ngeneral relativity, can be retrieved.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 09:10:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bamba","Kazuharu",""],["Yousaf","Z.",""],["Bhatti","M. Z.",""],["Nazer","R.",""],["Hashimoto","Yuki",""]]}
{"id":"2308.08565","submitter":"Gamal G.L. Nashed","authors":"G.G.L Nashed","title":"Confront $f(R,T)=\\mathcal{R}+\\beta T$ modified gravity with the massive\n  pulsar PSR J0740+6620","comments":"22 pages 10 figures","journal-ref":"The European Physical Journal C volume 83, Article number: 698\n  (2023)","doi":"10.1140/epjc/s10052-023-11882-4","report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many physically inspired general relativity (GR) modifications predict\nsignificant deviations in the properties of spacetime surrounding massive\nneutron stars. Among these modifications is $f(\\mathcal{R}, \\mathbb{T})$, where\n$\\mathcal{R}$ is the Ricci scalar, $\\mathbb{T}$ represents the trace of the\nenergy-momentum tensor, the gravitational theory that is thought to be a\nneutral extension of GR. Neutron stars with masses above 1.8 $M_\\odot$\nexpressed as radio pulsars are precious tests of fundamental physics in extreme\nconditions unique in the observable universe and unavailable to terrestrial\nexperiments. We obtained an exact analytical solution for spherically symmetric\nanisotropic perfect-fluid objects in equilibrium hydrostatic using the frame of\nthe form of $f(\\mathcal{R},\\mathbb{T})=\\mathcal{R}+\\beta \\mathbb{T}$ where\n$\\beta$ is a dimensional parameter. We show that the dimensional parameter\n$\\beta$ and the compactness, $C=\\frac{ 2GM}{Rc^2}$ can be used to express all\nphysical quantities within the star. We fix the dimensional parameter $\\beta$\nto be at most. (Here ${\\mathrm \\kappa^2}$ is the coupling constant of Einstein\nwhich is figured as $\\kappa^2=\\frac{8\\pi G}{c^4}$, the Newtonian constant of\ngravitation is denoted as $G$ while $c$ represents the speed of light.)\n$\\beta_1=\\frac{\\beta}{\\kappa^2}= 0.1$ in positive values through the use of\nobservational data from NICER and X-ray Multi-Mirror telescopes on the pulsar\nPSR J0740+6620, which provide information on its mass and radius.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:43:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nashed","G. G. L",""]]}
{"id":"2308.08566","submitter":"\\'Oscar Alejos","authors":"\\'Oscar Alejos and Jos\\'e Mar\\'ia Mu\\~noz","title":"A review of the classical Doppler effect based on the mathematical\n  description of the phase function","comments":"7 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper aims to shed some more light on one of the best known phenomena in\nthe field of physics, the Doppler effect, in particular, on its classical\nversion. Although, as mentioned, it is a phenomenon already described more than\n150 years ago, the general case, even considering constant velocities,\ncontinues to be the subject of very recent bibliographical works which either\nshow it incompletely or start from a not entirely accurate description of it.\nHere, general expressions of both frequency shift and aberration are obtained\nby geometrical description and, more interestingly, by describing the phase of\nthe wave in the reference frame in which the propagating medium is at rest. The\ncoherence between the two points of view permits to contrast the validity of\nthe proposed results, and allows for a generalization of the resulting\nexpressions for any reference frame, even those where the propagating medium is\nnot still.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:09:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alejos","\u00d3scar",""],["Mu\u00f1oz","Jos\u00e9 Mar\u00eda",""]]}
{"id":"2308.08567","submitter":"Honggui Li","authors":"Honggui Li, Maria Trocan, Dimitri Galayko, Mohamad Sawan","title":"CMISR: Circular Medical Image Super-Resolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Classical methods of medical image super-resolution (MISR) utilize open-loop\narchitecture with implicit under-resolution (UR) unit and explicit\nsuper-resolution (SR) unit. The UR unit can always be given, assumed, or\nestimated, while the SR unit is elaborately designed according to various SR\nalgorithms. The closed-loop feedback mechanism is widely employed in current\nMISR approaches and can efficiently improve their performance. The feedback\nmechanism may be divided into two categories: local and global feedback.\nTherefore, this paper proposes a global feedback-based closed-cycle framework,\ncircular MISR (CMISR), with unambiguous UR and SR elements. Mathematical model\nand closed-loop equation of CMISR are built. Mathematical proof with\nTaylor-series approximation indicates that CMISR has zero recovery error in\nsteady-state. In addition, CMISR holds plug-and-play characteristic which can\nbe established on any existing MISR algorithms. Five CMISR algorithms are\nrespectively proposed based on the state-of-the-art open-loop MISR algorithms.\nExperimental results with three scale factors and on three open medical image\ndatasets show that CMISR is superior to MISR in reconstruction performance and\nis particularly suited to medical images with strong edges or intense contrast.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:14:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Honggui",""],["Trocan","Maria",""],["Galayko","Dimitri",""],["Sawan","Mohamad",""]]}
{"id":"2308.08568","submitter":"Loris Ferrari","authors":"Loris Ferrari","title":"Gas in external fields: the weird case of the logarithmic trap","comments":"21 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The effects of an attractive logarithmic potential $u_0\\ln(r/r_0)$ on a gas\nof $N$ non interacting particles (Bosons or Fermions), in a box of volume\n$V_D$, are studied in $D=2,3$ dimensions. The unconventional behavior of the\ngas challenges the current notions of thermodynamic limit and size\nindependence. When $V_D$ and $N$ diverge, with finite density $N/V_D<\\infty$\nand finite trap strength $u_0>0$, the gas collapses in the ground state,\nindependently from the bosonic/fermionic nature of the particles, at \\emph{any}\ntemperature. If, instead, $N/V_D\\rightarrow0$, there exists a critical\ntemperature $T_c$, such that the gas remains in the ground state at any\n$T<T_c$, and \"evaporates\" above, in a non-equilibrium state of borderless\ndiffusion. For the gas to exhibit a conventional Bose-Einstein condensation\n(BEC) or a finite Fermi level, the strength $u_0$ must vanish with\n$V_D\\rightarrow\\infty$, according to a complicated exponential relationship, as\na consequence of the exponentially increasing density of states, specific of\nthe logarithmic trap.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 15:19:36 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 06:33:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ferrari","Loris",""]]}
{"id":"2308.08569","submitter":"Owen Miller","authors":"Wenjin Xue, Hanwen Zhang, Abinand Gopal, Vladimir Rokhlin, Owen D.\n  Miller","title":"Fullwave design of cm-scale cylindrical metasurfaces via fast direct\n  solvers","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale metasurfaces promise nanophotonic performance improvements to\nmacroscopic optics functionality, for applications from imaging to analog\ncomputing. Yet the size scale mismatch of centimeter-scale chips versus\nmicron-scale wavelengths prohibits use of conventional full-wave simulation\ntechniques, and has necessitated dramatic approximations. Here, we show that\ntailoring \"fast direct\" integral-equation simulation techniques to the form\nfactor of metasurfaces offers the possibility for accurate and efficient\nfull-wave, large-scale metasurface simulations. For cylindrical\n(two-dimensional) metasurfaces, we demonstrate accurate simulations whose\nsolution time scales \\emph{linearly} with the metasurface diameter. Moreover,\nthe solver stores compressed information about the simulation domain that is\nreusable over many design iterations. We demonstrate the capabilities of our\nsolver through two designs: first, a high-efficiency, high-numerical-aperture\nmetalens that is 20,000 wavelengths in diameter. Second, a high-efficiency,\nlarge-beam-width grating coupler. The latter corresponds to millimeter-scale\nbeam design at standard telecommunications wavelengths, while the former, at a\nvisible wavelength of 500 nm, corresponds to a design diameter of 1 cm, created\nthrough full simulations of Maxwell's equations.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:54:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xue","Wenjin",""],["Zhang","Hanwen",""],["Gopal","Abinand",""],["Rokhlin","Vladimir",""],["Miller","Owen D.",""]]}
{"id":"2308.08570","submitter":"Domingos Salazar","authors":"Domingos S. P. Salazar","title":"Improving the Cram\\'er-Rao bound with the detailed fluctuation theorem","comments":"2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In some non-equilibrium systems, the distribution of entropy production\n$p(\\Sigma)$ satisfies the detailed fluctuation theorem (DFT),\n$p(\\Sigma)/p(-\\Sigma)=\\exp(\\Sigma)$. When the distribution $p(\\Sigma)$ shows\ntime-dependency, the celebrated Cram\\'{e}r-Rao (CR) bound asserts that the mean\nentropy production rate is upper bounded in terms of the variance of $\\Sigma$\nand the Fisher information with respect to time. In this letter, we employ the\nDFT to derive an upper bound for the mean entropy production rate that improves\nthe CR bound. We show that this new bound serves as an accurate approximation\nfor the entropy production rate in the heat exchange problem mediated by a\nweakly coupled bosonic mode. The bound is saturated for the same setup when\nmediated by a weakly coupled qubit.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:16:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salazar","Domingos S. P.",""]]}
{"id":"2308.08571","submitter":"Gledson Tondo","authors":"Gledson Rodrigo Tondo and Igor Kavrakov and Guido Morgenthal","title":"A physics-informed machine learning model for reconstruction of dynamic\n  loads","comments":"8 pages, 7 figures and 10 references","journal-ref":"IABSE Symposium: Long Span Bridges, Istanbul, Turkey, 26-28 April\n  2023","doi":"10.2749/istanbul.2023.0315","report-no":null,"categories":"cs.LG cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Long-span bridges are subjected to a multitude of dynamic excitations during\ntheir lifespan. To account for their effects on the structural system, several\nload models are used during design to simulate the conditions the structure is\nlikely to experience. These models are based on different simplifying\nassumptions and are generally guided by parameters that are stochastically\nidentified from measurement data, making their outputs inherently uncertain.\nThis paper presents a probabilistic physics-informed machine-learning framework\nbased on Gaussian process regression for reconstructing dynamic forces based on\nmeasured deflections, velocities, or accelerations. The model can work with\nincomplete and contaminated data and offers a natural regularization approach\nto account for noise in the measurement system. An application of the developed\nframework is given by an aerodynamic analysis of the Great Belt East Bridge.\nThe aerodynamic response is calculated numerically based on the quasi-steady\nmodel, and the underlying forces are reconstructed using sparse and noisy\nmeasurements. Results indicate a good agreement between the applied and the\npredicted dynamic load and can be extended to calculate global responses and\nthe resulting internal forces. Uses of the developed framework include\nvalidation of design models and assumptions, as well as prognosis of responses\nto assist in damage detection and structural health monitoring.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 18:33:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tondo","Gledson Rodrigo",""],["Kavrakov","Igor",""],["Morgenthal","Guido",""]]}
{"id":"2308.08572","submitter":"Natalie Kiesler","authors":"Natalie Kiesler and Daniel Schiffner","title":"Large Language Models in Introductory Programming Education: ChatGPT's\n  Performance and Implications for Assessments","comments":"10 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper investigates the performance of the Large Language Models (LLMs)\nChatGPT-3.5 and GPT-4 in solving introductory programming tasks. Based on the\nperformance, implications for didactic scenarios and assessment formats\nutilizing LLMs are derived. For the analysis, 72 Python tasks for novice\nprogrammers were selected from the free site CodingBat. Full task descriptions\nwere used as input to the LLMs, while the generated replies were evaluated\nusing CodingBat's unit tests. In addition, the general availability of textual\nexplanations and program code was analyzed. The results show high scores of\n94.4 to 95.8% correct responses and reliable availability of textual\nexplanations and program code, which opens new ways to incorporate LLMs into\nprogramming education and assessment.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 19:48:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kiesler","Natalie",""],["Schiffner","Daniel",""]]}
{"id":"2308.08573","submitter":"Martin Schubert","authors":"Martin F. Schubert and Alec M. Hammond","title":"Fourier modal method for inverse design of metasurface-enhanced\n  micro-LEDs","comments":"15 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a simulation capability for micro-scale light-emitting diodes\n(uLEDs) that achieves comparable accuracy to CPU-based finite-difference\ntime-domain simulation but is more than 10^7 times faster. Our approach is\nbased on the Fourier modal method (FMM) -- which, as we demonstrate, is well\nsuited to modeling thousands of incoherent sources -- with extensions that\nallow rapid convergence for uLED structures that are challenging to model with\nstandard approaches. The speed of our method makes the inverse design of uLEDs\ntractable, which we demonstrate by designing a metasurface-enhanced uLED that\ndoubles the light extraction efficiency of an unoptimized device.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:14:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schubert","Martin F.",""],["Hammond","Alec M.",""]]}
{"id":"2308.08574","submitter":"Thomas Trask","authors":"Thomas Trask","title":"A Comparative Analysis of the Capabilities of Nature-inspired Feature\n  Selection Algorithms in Predicting Student Performance","comments":"Draft","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predicting student performance is key in leveraging effective pre-failure\ninterventions for at-risk students. In this paper, I have analyzed the relative\nperformance of a suite of 12 nature-inspired algorithms when used to predict\nstudent performance across 3 datasets consisting of instance-based clickstream\ndata, intra-course single-course performance, and performance when taking\nmultiple courses simultaneously. I found that, for all datasets, leveraging an\nensemble approach using NIAs for feature selection and traditional ML\nalgorithms for classification increased predictive accuracy while also reducing\nfeature set size by 2/3.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 21:18:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Trask","Thomas",""]]}
{"id":"2308.08575","submitter":"Guoxing Lin","authors":"Guoxing Lin, Shaokun Zheng","title":"Asymmetric discrete random walk and drift-diffusion with unequal jump\n  times, lengths, and probabilities","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Random walk has wide applications in many fields, such as machine learning,\nbiology, physics, and chemistry. Random walk can be discrete or continuous in\ntime and space. Asymmetric random walk could be described by drift-diffusion\nequation. The discrete asymmetric random walk provides a basis for\nunderstanding biased drift-diffusion. However, the current reported theoretical\nresults for discrete random walks do not give a general theoretical treatment\nfor the asymmetry due to unequal jump times. In this paper, the theoretical\nexpressions for asymmetric random walks with unequal jump probabilities, times,\nand lengths are derived. The obtained theoretical results can be reduced to\nreported results when jump times are equal. Additionally, discrete random walk\nsimulations are performed to verify the obtained theoretical results. There are\ngood agreements between the theoretical predictions and simulation results.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 22:38:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lin","Guoxing",""],["Zheng","Shaokun",""]]}
{"id":"2308.08576","submitter":"Jamal Knight","authors":"Jamal Knight, Andrew Johnston, Adam Berry","title":"Artistic control over the glitch in AI-generated motion capture","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial intelligence (AI) models are prevalent today and provide a\nvaluable tool for artists. However, a lesser-known artifact that comes with AI\nmodels that is not always discussed is the glitch. Glitches occur for various\nreasons; sometimes, they are known, and sometimes they are a mystery. Artists\nwho use AI models to generate art might not understand the reason for the\nglitch but often want to experiment and explore novel ways of augmenting the\noutput of the glitch. This paper discusses some of the questions artists have\nwhen leveraging the glitch in AI art production. It explores the unexpected\npositive outcomes produced by glitches in the specific context of motion\ncapture and performance art.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 02:55:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Knight","Jamal",""],["Johnston","Andrew",""],["Berry","Adam",""]]}
{"id":"2308.08577","submitter":"Hrishikesh Viswanath","authors":"Hrishikesh Viswanath, Aneesh Bhattacharya, Pascal Jutras-Dub\\'e,\n  Prerit Gupta, Mridu Prashanth, Yashvardhan Khaitan, Aniket Bera","title":"AffectEcho: Speaker Independent and Language-Agnostic Emotion and Affect\n  Transfer for Speech Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.HC eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Affect is an emotional characteristic encompassing valence, arousal, and\nintensity, and is a crucial attribute for enabling authentic conversations.\nWhile existing text-to-speech (TTS) and speech-to-speech systems rely on\nstrength embedding vectors and global style tokens to capture emotions, these\nmodels represent emotions as a component of style or represent them in discrete\ncategories. We propose AffectEcho, an emotion translation model, that uses a\nVector Quantized codebook to model emotions within a quantized space featuring\nfive levels of affect intensity to capture complex nuances and subtle\ndifferences in the same emotion. The quantized emotional embeddings are\nimplicitly derived from spoken speech samples, eliminating the need for one-hot\nvectors or explicit strength embeddings. Experimental results demonstrate the\neffectiveness of our approach in controlling the emotions of generated speech\nwhile preserving identity, style, and emotional cadence unique to each speaker.\nWe showcase the language-independent emotion modeling capability of the\nquantized emotional embeddings learned from a bilingual (English and Chinese)\nspeech corpus with an emotion transfer task from a reference speech to a target\nspeech. We achieve state-of-art results on both qualitative and quantitative\nmetrics.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:28:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Viswanath","Hrishikesh",""],["Bhattacharya","Aneesh",""],["Jutras-Dub\u00e9","Pascal",""],["Gupta","Prerit",""],["Prashanth","Mridu",""],["Khaitan","Yashvardhan",""],["Bera","Aniket",""]]}
{"id":"2308.08578","submitter":"Issar Arab","authors":"Issar Arab","title":"PEvoLM: Protein Sequence Evolutionary Information Language Model","comments":"8","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the exponential increase of the protein sequence databases over time,\nmultiple-sequence alignment (MSA) methods, like PSI-BLAST, perform exhaustive\nand time-consuming database search to retrieve evolutionary information. The\nresulting position-specific scoring matrices (PSSMs) of such search engines\nrepresent a crucial input to many machine learning (ML) models in the field of\nbioinformatics and computational biology. A protein sequence is a collection of\ncontiguous tokens or characters called amino acids (AAs). The analogy to\nnatural language allowed us to exploit the recent advancements in the field of\nNatural Language Processing (NLP) and therefore transfer NLP state-of-the-art\nalgorithms to bioinformatics. This research presents an Embedding Language\nModel (ELMo), converting a protein sequence to a numerical vector\nrepresentation. While the original ELMo trained a 2-layer bidirectional Long\nShort-Term Memory (LSTMs) network following a two-path architecture, one for\nthe forward and the second for the backward pass, by merging the idea of PSSMs\nwith the concept of transfer-learning, this work introduces a novel\nbidirectional language model (bi-LM) with four times less free parameters and\nusing rather a single path for both passes. The model was trained not only on\npredicting the next AA but also on the probability distribution of the next AA\nderived from similar, yet different sequences as summarized in a PSSM,\nsimultaneously for multi-task learning, hence learning evolutionary information\nof protein sequences as well. The network architecture and the pre-trained\nmodel are made available as open source under the permissive MIT license on\nGitHub at https://github.com/issararab/PEvoLM.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 06:46:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Arab","Issar",""]]}
{"id":"2308.08579","submitter":"Chandan Kumar Sheemar","authors":"Chandan Kumar Sheemar, Sourabh Solanki, Jorge Querol, Sumit Kumar and\n  Symeon Chatzinotas","title":"IRS Assisted MIMO Full Duplex: Rate Analysis and Beamforming Under\n  Imperfect CSI","comments":"arXiv admin note: substantial text overlap with arXiv:2308.08016","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligent reflecting surfaces (IRS) have emerged as a promising technology\nto enhance the performance of wireless communication systems. By actively\nmanipulating the wireless propagation environment, IRS enables efficient signal\ntransmission and reception. In recent years, the integration of IRS with\nfull-duplex (FD) communication has garnered significant attention due to its\npotential to further improve spectral and energy efficiencies. IRS-assisted FD\nsystems combine the benefits of both IRS and FD technologies, providing a\npowerful solution for the next generation of cellular systems. In this\nmanuscript, we present a novel approach to jointly optimize active and passive\nbeamforming in a multiple-input-multiple-output (MIMO) FD system assisted by an\nIRS for weighted sum rate (WSR) maximization. Given the inherent difficulty in\nobtaining perfect channel state information (CSI) in practical scenarios, we\nconsider imperfect CSI and propose a statistically robust beamforming strategy\nto maximize the ergodic WSR. Additionally, we analyze the achievable WSR for an\nIRS-assisted MIMO FD system under imperfect CSI by deriving both the lower and\nupper bounds. To tackle the problem of ergodic WSR maximization, we employ the\nconcept of expected weighted minimum mean squared error (EWMMSE), which\nexploits the information of the expected error covariance matrices and ensures\nconvergence to a local optimum. We evaluate the effectiveness of our proposed\ndesign through extensive simulations. The results demonstrate that our robust\napproach yields significant performance improvements compared to the simplistic\nbeamforming approach that disregards CSI errors, while also outperforming the\nrobust half-duplex (HD) system considerably\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 11:41:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sheemar","Chandan Kumar",""],["Solanki","Sourabh",""],["Querol","Jorge",""],["Kumar","Sumit",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.08580","submitter":"Muhammad Sharif","authors":"M. Sharif and Arooj Fatima","title":"Impact of Charge on Traversable Wormhole Solutions in $f(R,T)$ Theory","comments":"21 pages, 5 figures","journal-ref":"Eur. Phys. J. Plus 138(2023)721","doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper examines the effects of charge on traversable wormhole structure\nin $f(R,T)$ theory. For this purpose, we use the embedding class-I approach to\nbuild a wormhole shape function from the static spherically symmetric\nspacetime. The developed shape function satisfies all the required conditions\nand connects two asymptotically flat regions of spacetime. We consider\ndifferent models of this modified theory to examine the traversable wormhole\nsolutions through null energy condition and also check their stable state. We\nconclude that viable and stable wormhole solutions are obtained under the\ninfluence of charge in this gravitational theory.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:36:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sharif","M.",""],["Fatima","Arooj",""]]}
{"id":"2308.08581","submitter":"Ron Fulbright","authors":"Ron Fulbright","title":"On the Augmentation of Cognitive Accuracy and Cognitive Precision in\n  Human/Cog Ensembles","comments":"12 pages, 7 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Whenever humans use tools human performance is enhanced. Cognitive systems\nare a new kind of tool continually increasing in cognitive capability and are\nnow performing high level cognitive tasks previously thought to be explicitly\nhuman. Usage of such tools, known as cogs, are expected to result in ever\nincreasing levels of human cognitive augmentation. In a human cog ensemble, a\ncooperative, peer to peer, and collaborative dialog between a human and a\ncognitive system, human cognitive capability is augmented as a result of the\ninteraction. The human cog ensemble is therefore able to achieve more than just\nthe human or the cog working alone. This article presents results from two\nstudies designed to measure the effect information supplied by a cog has on\ncognitive accuracy, the ability to produce the correct result, and cognitive\nprecision, the propensity to produce only the correct result. Both cognitive\naccuracy and cognitive precision are shown to be increased by information of\ndifferent types (policies and rules, examples, and suggestions) and with\ndifferent kinds of problems (inventive problem solving and puzzles). Similar\neffects shown in other studies are compared.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:36:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fulbright","Ron",""]]}
{"id":"2308.08582","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi","title":"Uncovering the Skillsets Required in Computer Science Jobs Using Social\n  Network Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapid growth of technology and computer science, which has led to a surge\nin demand for skilled professionals in this field. The skill set required for\ncomputer science jobs has evolved rapidly, creating challenges for those\nalready in the workforce who need to adapt their skills quickly to meet\nindustry demands. To stay ahead of the curve, it is essential to understand the\nhottest skills needed in the field. The article introduces a new method for\nanalyzing job advertisements using social network analysis to identify the most\ncritical skills required by employers in the market. In this research, to form\nthe communication network of skills, first 5763 skills were collected from the\nLinkedIn social network, then the relationship between skills was collected and\nsearched in 7777 computer science job advertisements, and finally, the balanced\ncommunication network of skills was formed. The study analyzes the formed\ncommunication network of skills in the computer science job market and\nidentifies four distinct communities of skills: Generalists, Infrastructure and\nSecurity, Software Development, and Embedded Systems. The findings reveal that\nemployers value both hard and soft skills, such as programming languages and\nteamwork. Communication skills were found to be the most important skill in the\nlabor market. Additionally, certain skills were highlighted based on their\ncentrality indices, including communication, English, SQL, Git, and business\nskills, among others. The study provides valuable insights into the current\nstate of the computer science job market and can help guide individuals and\norganizations in making informed decisions about skills acquisition and hiring\npractices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:16:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Maghsoudi","Mehrdad",""]]}
{"id":"2308.08583","submitter":"Linu Malakkal","authors":"Linu Malakkal, Ankita Katre, Shuxiang Zhou, Chao Jiang, David H.\n  Hurley, Chris A. Marianetti, and Marat Khafizov","title":"First-principles determination of the phonon-point defect scattering and\n  thermal transport due to fission products in ThO2","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents the first principles calculations of the lattice thermal\nconductivity degradation due to point defects in thorium dioxide using an\nalternative solution of the Pierels-Boltzmann transport equation. We have used\nthe non-perturbative Green's function methodology to compute the phonon point\ndefect scattering rates that consider the local distortion around the point\ndefect, including the mass difference changes, interatomic force constants and\nstructural relaxation near the point defects. The point defects considered in\nthe work include the vacancy of thorium and oxygen, substitution of helium,\nkrypton, zirconium, iodine, xenon, in the thorium site, and the three different\nconfiguration of the Schottky defects. The results of the phonon-defect\nscattering rate reveals that among the considered intrinsic defects, the\nthorium vacancy and helium substitution in the thorium site scatter the phonon\nmost due to substantial changes in the force constant and structural\ndistortions. The scattering of phonons due to the substitutional defects\nunveils that the zirconium atom scatters phonons the least, followed by xenon,\niodine, krypton, and helium. This is contrary to the intuition that the\nscattering strength follows HeTh > KrTh > ZrTh > ITh > XeTh based on the mass\ndifference. This striking difference in the zirconium phonon scattering is due\nto the local chemical environment changes. Zirconium is an electropositive\nelement with valency similar to thorium and, therefore, can bond with the\noxygen atoms, thus creating less force constant variance compared to iodine, an\nelectronegative element, noble gas helium, xenon, and krypton. These results\ncan serve as the benchmark for the analytical models and help the\nengineering-scale modeling effort for nuclear design.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:30:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Malakkal","Linu",""],["Katre","Ankita",""],["Zhou","Shuxiang",""],["Jiang","Chao",""],["Hurley","David H.",""],["Marianetti","Chris A.",""],["Khafizov","Marat",""]]}
{"id":"2308.08584","submitter":"Hsiang-Chih Hwang","authors":"Hsiang-Chih Hwang, Yuan-Sen Ting, Sihao Cheng, Joshua S. Speagle","title":"Dynamical masses across the Hertzsprung-Russell diagram","comments":"Fig. 5 and Fig. 12 are the key results. Submitted to MNRAS. Comments\n  are welcome!","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 infer the dynamical masses of stars across the Hertzsprung-Russell (H-R)\ndiagram using wide binaries from the Gaia survey. Gaia's high-precision\nastrometry measures the wide binaries' orbital motion, which contains the mass\ninformation. Using wide binaries as the training sample, we measure the mass of\nstars across the two-dimensional H-R diagram using the combination of\nstatistical inference and neural networks. Our results provide the dynamical\nmass measurements for main-sequence stars from 0.1 to 2 M$_\\odot$, unresolved\nbinaries and unresolved triples on the main sequence, and the mean masses of\ngiants and white dwarfs. Two regions in the H-R diagram show interesting\nbehaviors in mass, where one of them is pre-main-sequence stars, and the other\none may be related to close compact object companions like M dwarf-white dwarf\nbinaries. These mass measurements depend solely on Newtonian dynamics,\nproviding independent constraints on stellar evolutionary models and the\noccurrence rate of compact objects.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hwang","Hsiang-Chih",""],["Ting","Yuan-Sen",""],["Cheng","Sihao",""],["Speagle","Joshua S.",""]]}
{"id":"2308.08585","submitter":"Kevin Hinze","authors":"Stefan Antusch, Kevin Hinze, Shaikh Saad","title":"Minimal $SU(5)$ GUTs with vectorlike fermions","comments":"27 pages + references, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we attempt to answer the question, \"What is the minimal viable\nrenormalizable $SU(5)$ GUT with representations no higher than adjoints?\". We\nfind that an $SU(5)$ model with a pair of vectorlike fermions\n$5_F+\\overline{5}_F$, as well as two copies of $15_H$ Higgs fields, is the\nminimal candidate that accommodates for correct charged fermion and neutrino\nmasses and can also address the matter-antimatter asymmetry of the universe.\nOur results show that the presented model is highly predictive and will be\nfully tested by a combination of upcoming proton decay experiments, collider\nsearches, and low-energy experiments in search of flavor violations. Moreover,\nwe also entertain the possibility of adding a pair of vectorlike fermions\n$10_F+\\overline{10}_F$ or $15_F+\\overline{15}_F$ (instead of a\n$5_F+\\overline{5}_F$). Our study reveals that the entire parameter space of\nthese two models, even with minimal particle content, cannot be fully probed\ndue to possible longer proton lifetime beyond the reach of Hyper-Kamiokande.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Antusch","Stefan",""],["Hinze","Kevin",""],["Saad","Shaikh",""]]}
{"id":"2308.08586","submitter":"Nirmalya Brahma","authors":"Nirmalya Brahma, Asher Berlin, Katelin Schutz","title":"Photon-Dark Photon Conversion with Multiple Level Crossings","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dark photons can oscillate into Standard Model (SM) photons via kinetic\nmixing. The conversion probability depends sensitively on properties of the\nambient background, such as the density and electromagnetic field strength,\nwhich cause the SM photon to acquire an in-medium effective mass. Resonances\ncan enhance the conversion probability when there is a level-crossing between\nthe dark photon and background-dependent SM photon states. In this work, we\nshow that the widely used Landau-Zener (LZ) approximation breaks down when\nthere are multiple level-crossings due to a non-monotonic SM photon potential.\nPhase interference effects, especially when the dark photon mass is close to an\nextremum of the SM photon effective mass, can cause deviations from the LZ\napproximation at the level of a few orders of magnitude in the conversion\nprobability. We present an analytic approximation that is valid in this regime\nand that can accurately predict the conversion probabilities in a wide range of\nastrophysical environments.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brahma","Nirmalya",""],["Berlin","Asher",""],["Schutz","Katelin",""]]}
{"id":"2308.08587","submitter":"Atakan Hilmi F{\\i}rat","authors":"Harold Erbin and Atakan Hilmi F{\\i}rat","title":"Open string stub as an auxiliary string field","comments":"29+10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"MIT-CTP/5594","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Witten's open string field theory with a generalized version of stubs is\nreformulated as a cubic string field theory using an auxiliary string field.\nThe gauge symmetries and equations of motion as well as the associative algebra\nof the resulting theory are investigated. Integrating out either the original\nor auxiliary field is shown to recover the conventional cubic theory. Our\nanalysis demonstrates that deformations due to the stubs can be described as a\nhomotopy transfer purely in the context of strong deformation retract. We also\ndiscuss to what extent the vertex regions resulting from stubs provide a model\nfor the elementary interactions of closed string field theory.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Erbin","Harold",""],["F\u0131rat","Atakan Hilmi",""]]}
{"id":"2308.08588","submitter":"Luiz Santos","authors":"Daniel Shaffer, Martin Claassen, Ajit Srivastava, Luiz H. Santos","title":"Entanglement and Topology in Su-Schrieffer-Heeger Cavity Quantum\n  Electrodynamics","comments":"4.5 pages and 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cavity materials are a frontier to investigate the role of light-matter\ninteractions on the properties of electronic phases of matter. In this work, we\nraise a fundamental question: can non-local interactions mediated by cavity\nphotons destabilize a topological electronic phase? We investigate this\nquestion by characterizing entanglement, energy spectrum and correlation\nfunctions of the topological Su-Schrieffer-Heeger (SSH) chain interacting with\nan optical cavity mode. Employing density-matrix renormalization group (DMRG)\nand exact diagonalization (ED), we demonstrate the stability of the edge state\nand establish an area law scaling for the ground state entanglement entropy,\ndespite long-range correlations induced by light-matter interactions. These\nfeatures are linked to gauge invariance and the scaling of virtual photon\nexcitations entangled with matter, effectively computed in a low-dimensional\nKrylov subspace of the full Hilbert space. This work provides a framework for\ncharacterizing novel equilibrium phenomena in topological cavity materials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shaffer","Daniel",""],["Claassen","Martin",""],["Srivastava","Ajit",""],["Santos","Luiz H.",""]]}
{"id":"2308.08589","submitter":"Ryan Plestid","authors":"Yohei Ema and Zhen Liu and Ryan Plestid","title":"Searching for axions with kaon decay at rest","comments":null,"journal-ref":null,"doi":null,"report-no":"UMN-TH-4221/23, FTPI-MINN-23-13, CALT-TH/2023-028","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe a novel search strategy for axions (or hadronically coupled\naxion-like particles) in the mass range of $m_a \\lesssim 350\\,{\\rm MeV}$. The\nsearch relies on kaon decay at rest, which produces a mono-energetic signal in\na large volume detector (e.g.\\ a tank of liquid scintillator) from axion decays\n$a\\rightarrow \\gamma\\gamma$ or $a\\rightarrow e^+e^-$. The decay modes $K^+\\to\n\\pi^+ a$ and $a \\to \\gamma \\gamma$ are induced by the axion's coupling to\ngluons, which is generic to any model which addresses the strong CP problem. We\nrecast a recent search from MicroBooNE for $e^+e^-$ pairs, and study prospects\nat JSNS$^2$ and other near-term facilities. We find that JSNS$^2$ will have\nworld-leading sensitivity to hadronically coupled axions in the mass range of\n$40\\,\\mathrm{MeV} \\lesssim m_a \\lesssim 350\\,\\mathrm{MeV}$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ema","Yohei",""],["Liu","Zhen",""],["Plestid","Ryan",""]]}
{"id":"2308.08590","submitter":"Nikita Astrakhantsev","authors":"Nikita Astrakhantsev, Glenn Wagner, Tom Westerhout, Titus Neupert and\n  Mark H. Fischer","title":"Understanding Symmetry Breaking in Twisted Bilayer Graphene from Cluster\n  Constraints","comments":"10 pages, 6 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":"  Twisted bilayer graphene is an exciting platform for exploring correlated\nquantum phases, extremely tunable with respect to both the single-particle\nbands and the interaction profile of electrons. Here, we investigate the phase\ndiagram of twisted bilayer graphene as described by an extended Hubbard model\non the honeycomb lattice with two fermionic orbitals (valleys) per site.\nBesides the special extended {\\it cluster interaction} $Q$, we incorporate the\neffect of gating through an onsite Hubbard-interaction $U$. Within Quantum\nMonte Carlo (QMC), we find valence-bond-solid, N\\'eel-valley antiferromagnetic\nor charge-density wave phases. Further, we elucidate the competition of these\nphases by noticing that the cluster interaction induces an exotic constraint on\nthe Hilbert space, which we dub {\\it the cluster rule}, in analogy to the\nfamous pyrochlore spin-ice rule. Formulating the perturbative Hamiltonian by\nprojecting into the cluster-rule manifold, we perform exact diagonalization and\nconstruct the fixed-point states of the observed phases. Finally, we compute\nthe local electron density patterns as signatures distinguishing these phases,\nwhich could be observed with scanning tunneling microscopy. Our work\ncapitalizes on the notion of cluster constraints in the extended Hubbard model\nof twisted bilayer graphene, and suggests a scheme towards realization of\nseveral symmetry-breaking insulating phases in a twisted-bilayer graphene\nsheet.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:01 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 09:29:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Astrakhantsev","Nikita",""],["Wagner","Glenn",""],["Westerhout","Tom",""],["Neupert","Titus",""],["Fischer","Mark H.",""]]}
{"id":"2308.08591","submitter":"Tomer Shenar","authors":"T. Shenar, G. A. Wade, P. Marchant, S. Bagnulo, J. Bodensteiner, D. M.\n  Bowman, A. Gilkis, N. Langer, A.-N. Chene, L. Oskinova, T. Van Reeth, H.\n  Sana, N. St-Louis, A. Soares de Oliveira, H. Todt, S. Toonen","title":"A massive helium star with a sufficiently strong magnetic field to form\n  a magnetar","comments":"Published in Science on the 18 August 2023. Radial velocities,\n  spectra, and software available in: https://zenodo.org/record/8042656 ESO\n  press release: www.eso.org/public/news/eso2313","journal-ref":null,"doi":"10.1126/science.ade3293","report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetars are highly magnetized neutron stars; their formation mechanism is\nunknown. Hot helium-rich stars with spectra dominated by emission lines are\nknown as Wolf-Rayet stars. We observe the binary system HD 45166 using\nspectropolarimetry, finding that it contains a Wolf-Rayet star with a mass of 2\nsolar masses and a magnetic field of 43 kilogauss. Stellar evolution\ncalculations indicate that this component will explode as a type Ib or IIb\nsupernova, and the strong magnetic field favors a magnetar remnant. We propose\nthat the magnatized Wolf-Rayet star formed by the merger of two lower mass\nhelium stars.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shenar","T.",""],["Wade","G. A.",""],["Marchant","P.",""],["Bagnulo","S.",""],["Bodensteiner","J.",""],["Bowman","D. M.",""],["Gilkis","A.",""],["Langer","N.",""],["Chene","A. -N.",""],["Oskinova","L.",""],["Van Reeth","T.",""],["Sana","H.",""],["St-Louis","N.",""],["de Oliveira","A. Soares",""],["Todt","H.",""],["Toonen","S.",""]]}
{"id":"2308.08592","submitter":"Matja\\v{z} Kebri\\v{c}","authors":"Matja\\v{z} Kebri\\v{c}, Jad C. Halimeh, Ulrich Schollw\\\"ock, Fabian\n  Grusdt","title":"Confinement in 1+1D $\\mathbb{Z}_2$ Lattice Gauge Theories at Finite\n  Temperature","comments":"$7+7$ pages, $4+7$ figures, supplemental videos of the\n  parton-separation probability dynamics at\n  https://www.youtube.com/playlist?list=PLoUsb3eaKix5yAeQWXmCgnU88Ivn9BzsR","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.str-el hep-lat quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Confinement is a paradigmatic phenomenon of gauge theories, and its\nunderstanding lies at the forefront of high-energy physics. Here, we study\nconfinement in a simple one-dimensional \\Zt lattice gauge theory at finite\ntemperature and filling, which is within the reach of current cold-atom and\nsuperconducting-qubit platforms. By employing matrix product states (MPS)\ncalculations, we investigate the decay of the finite-temperature Green's\nfunction and uncover a smooth crossover between the confined and deconfined\nregimes. This is furthermore confirmed by considering the Friedel oscillations\nand string length distributions obtained from snapshots sampled from MPS, both\nof which are experimentally readily available. Finally, we verify that confined\nmesons remain well-defined at finite temperature by probing their quench\ndynamics with exact diagonalization. Our results shed new light on confinement\nat finite temperature from an experimentally relevant standpoint.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kebri\u010d","Matja\u017e",""],["Halimeh","Jad C.",""],["Schollw\u00f6ck","Ulrich",""],["Grusdt","Fabian",""]]}
{"id":"2308.08593","submitter":"Yosuke Kobayashi","authors":"Yosuke Kobayashi","title":"Fast computation of non-Gaussian covariance of redshift-space galaxy\n  power spectrum multipoles","comments":"13 pages, 4 figures, to be submitted to Phys. Rev. D","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The non-Gaussian part of the covariance matrix of the galaxy power spectrum\ninvolves the connected four-point correlation in Fourier space, i.e.\ntrispectrum. This paper introduces a fast method to compute the non-Gaussian\npart of the covariance matrix of the galaxy power spectrum multipoles in\nredshift space at tree-level standard perturbation theory. For the tree-level\ngalaxy trispectrum, the angular integral between two wavevectors can be\nevaluated analytically by employing an FFTLog. The new implementation computes\nthe non-Gaussian covariance of the power spectrum monopole, quadrupole,\nhexadecapole and their cross-covariance in O(10) seconds, for an effectively\narbitrary number of instances of cosmological and galaxy bias parameters and\nredshift, without any parallelization or acceleration. It is a large advantage\nover conventional numerical integration. We demonstrate that the computation of\nthe covariance at k = 0.005 - 0.4 h/Mpc gives results with 0.1 - 1% accuracy.\nThe efficient computation of the analytic covariance can be useful for future\ngalaxy surveys, especially utilizing multi-tracer analysis.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kobayashi","Yosuke",""]]}
{"id":"2308.08594","submitter":"Ryan Levy","authors":"Ryan Levy, Miguel Morales, Shiwei Zhang","title":"Automatic Order Detection and Restoration Through Systematically\n  Improvable Variational Wave Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variational wave function ansatze are an invaluable tool to study the\nproperties of strongly correlated systems. We propose such a wave function,\nbased on the theory of auxiliary fields and combining aspects of\nauxiliary-field quantum Monte Carlo and modern variational optimization\ntechniques including automatic differentiation. The resulting ansatz,\nconsisting of several slices of optimized projectors, is highly expressive and\nsystematically improvable. We benchmark this form on the two-dimensional\nHubbard model, using both cylindrical and large, fully periodic supercells. The\ncomputed ground-state energies are competitive with the best variational\nresults. Moreover, the optimized wave functions predict the correct\nground-state order with near full symmetry restoration (i.e. translation\ninvariance) despite initial states with incorrect orders. The ansatz can become\na tool for local order prediction, leading to a new paradigm for variational\nstudies of bulk systems. It can also be viewed as an approach to produce\naccurate and systematically improvable wave functions in a convenient form of\nnon-orthogonal Slater determinants (e.g., for quantum chemistry) at polynomial\ncomputational cost.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Levy","Ryan",""],["Morales","Miguel",""],["Zhang","Shiwei",""]]}
{"id":"2308.08595","submitter":"Omer Granek","authors":"Omer Granek","title":"Universal Fluctuations of Local Measurement in Low-Dimensional Systems","comments":"7 pages, 2 figures","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":"  Probes perform local measurements by interacting with the surrounding system.\nThis often occurs in a dilute system whose effective macroscopic dynamics are\ndiffusive. It is analytically shown here that, for dimensions two or less, the\nrelative uncertainty of any such measurement converges to an explicit universal\npower law in the long-time limit. The dynamical exponent depends on the\ndimension, and the prefactor depends solely on the bulk density and the\neffective mass diffusivity. Simulations of four distinct microscopic models\nsupport the results. The results imply that saturation of thermodynamic\nuncertainty relations cannot be approached for local measurements.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Granek","Omer",""]]}
{"id":"2308.08596","submitter":"Penghao Zhu","authors":"A. Alexandradinata and Penghao Zhu","title":"Anomalous shift and optical vorticity in the steady photovoltaic current","comments":"14+45 pages, 7+7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Steady illumination of a non-centrosymmetric semiconductor results in a bulk\nphotovoltaic current, which is contributed by real-space displacements\n(`shifts') of charged quasiparticles as they transit between Bloch states. The\nshift induced by interband excitation via absorption of photons has received\nthe prevailing attention. However, this excitation-induced shift can be far\noutweighed ($\\ll$) by the shift induced by intraband relaxation, or by the\nshift induced by radiative recombination of electron-hole pairs. This\noutweighing ($\\ll$) is attributed to (i) time-reversal-symmetric, intraband\nBerry curvature, which results in an anomalous shift of quasiparticles as they\nscatter with phonons, as well as to (ii) topological singularities in the\ninterband Berry phase (`optical vortices'), which makes the photovoltaic\ncurrent extraordinarily sensitive to the linear polarization vector of the\nlight source. Both (i-ii) potentially lead to nonlinear conductivities of order\n$mAV^{-2}$, without finetuning of the incident radiation frequency, band gap,\nor joint density of states.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alexandradinata","A.",""],["Zhu","Penghao",""]]}
{"id":"2308.08597","submitter":"Noemi Anau Montel","authors":"Noemi Anau Montel, James Alvey, Christoph Weniger","title":"Scalable inference with Autoregressive Neural Ratio Estimation","comments":"12 pages. 6 figures. Codes: swyft is available at\n  https://github.com/undark-lab/swyft , torchns is available at\n  https://github.com/undark-lab/torchns","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, there has been a remarkable development of simulation-based\ninference (SBI) algorithms, and they have now been applied across a wide range\nof astrophysical and cosmological analyses. There are a number of key\nadvantages to these methods, centred around the ability to perform scalable\nstatistical inference without an explicit likelihood. In this work, we propose\ntwo technical building blocks to a specific sequential SBI algorithm, truncated\nmarginal neural ratio estimation (TMNRE). In particular, first we develop\nautoregressive ratio estimation with the aim to robustly estimate correlated\nhigh-dimensional posteriors. Secondly, we propose a slice-based nested sampling\nalgorithm to efficiently draw both posterior samples and constrained prior\nsamples from ratio estimators, the latter being instrumental for sequential\ninference. To validate our implementation, we carry out inference tasks on\nthree concrete examples: a toy model of a multi-dimensional Gaussian, the\nanalysis of a stellar stream mock observation, and finally, a proof-of-concept\napplication to substructure searches in strong gravitational lensing. In\naddition, we publicly release the code for both the autoregressive ratio\nestimator and the slice sampler.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Montel","Noemi Anau",""],["Alvey","James",""],["Weniger","Christoph",""]]}
{"id":"2308.08598","submitter":"Guangwen Chen","authors":"Guangwen Chen, George J. Bendo, Gary A. Fuller, Christian Henkel, Xu\n  Kong","title":"Star formation in the centre of NGC 1808 as observed by ALMA","comments":"18 pages, 7 figures, 10 tables, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2450","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Atacama Large Millimeter/submillimeter Array (ALMA) observations\nof 85.69 and 99.02 GHz continuum emission and H42$\\alpha$ and H40$\\alpha$ lines\nemission from the central 1~kpc of NGC 1808. These forms of emission are\ntracers of photoionizing stars but unaffected by dust obscuration that we use\nto test the applicability of other commonly star formation metrics. An analysis\nof the spectral energy distributions shows that free-free emission contributes\nabout 60 to 90 per cent of the continuum emission in the 85-100 GHz frequency\nrange, dependent on the region. The star formation rate (SFR) derived from the\nALMA free-free emission is $3.1\\pm0.3$~M$_\\odot$~yr$^{-1}$. This is comparable\nto the SFRs measured from the infrared emission, mainly because most of the\nbolometric energy from the heavily obscured region is emitted as infrared\nemission. The radio 1.5~GHz emission yields a SFR 25 per cent lower than the\nALMA value, probably because of the diffusion of the electrons producing the\nsynchrotron emission beyond the star-forming regions. The SFRs measured from\nthe extinction-corrected H$\\alpha$ line emission are about 40 to 65 per cent of\nthe SFR derived from the ALMA data, likely because this metric was not\ncalibrated for high extinction regions. Some SFRs based on extinction-corrected\nultraviolet emission are similar to those from ALMA and infrared data, but\ngiven that the ultraviolet terms in the extinction correction equations are\nvery small, these metrics seem inappropriate to apply to this dusty starburst.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Guangwen",""],["Bendo","George J.",""],["Fuller","Gary A.",""],["Henkel","Christian",""],["Kong","Xu",""]]}
{"id":"2308.08599","submitter":"Michael Tucker","authors":"M. A. Tucker and B. J. Shappee","title":"Gone But Not Forgotten: The HST Non-Detection of SN Ia 2011fe 11.5yr\n  After Explosion Further Restricts Single-Degenerate Progenitor Systems","comments":"5 pages excluding references, 4 figures, 1 table. Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present deep Hubble Space Telescope imaging of the nearby Type Ia\nsupernova (SN Ia) 2011fe obtained 11.5yr after explosion. No emission is\ndetected at the SN location to a $1\\sigma$ ($3\\sigma$) limit of ${F555W > 30.2\n\\;(29.0)}~$mag, or equivalently $M_V > 1.2 \\;(-0.1)~$mag, neglecting the\ndistance uncertainty to M101. We constrain the presence of donor stars impacted\nby the SN ejecta with the strictest limits thus far on compact (i.e., $\\log \\,g\n\\gtrsim 4$) companions. H-rich zero-age main-sequence companions with masses\n$\\geq 2~\\rm M_\\odot$ are excluded, a significant improvement upon the\npre-explosion imaging limit of $\\approx 5~\\rm M_\\odot$. Main-sequence He stars\nwith masses $\\geq 0.5~\\rm M_\\odot$ and subgiant He stars with masses $\\lesssim\n1~\\rm M_\\odot$ are also disfavored by our late-time imaging. Synthesizing our\nlimits on post-impact donors with previous constraints from pre-explosion\nimaging, early-time radio and X-ray observations, and nebular-phase\nspectroscopy, essentially all formation channels for SN2011fe invoking a\nnon-degenerate donor star at the time of explosion are unlikely.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tucker","M. A.",""],["Shappee","B. J.",""]]}
{"id":"2308.08600","submitter":"Laimei Nie","authors":"Jonah Kudler-Flam, Laimei Nie, Akash Vijay","title":"R\\'enyi mutual information in quantum field theory, tensor networks, and\n  gravity","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore a large class of correlation measures called the $\\alpha-z$\nR\\'enyi mutual informations (RMIs). Unlike the commonly used notion of RMI\ninvolving linear combinations of R\\'enyi entropies, the $\\alpha-z$ RMIs are\npositive semi-definite and monotonically decreasing under quantum operations,\nmaking them sensible measures of total (quantum and classical) correlations.\nThis follows from their descendance from R\\'enyi relative entropies. In\naddition to upper bounding connected correlation functions between subsystems,\nwe prove the much stronger statement that for certain values of $\\alpha$ and\n$z$, the $\\alpha-z$ RMIs also lower bound connected correlation functions. We\ndevelop an easily implementable replica trick which enables us to compute the\n$\\alpha-z$ RMIs in a variety of many-body systems including conformal field\ntheories, free fermions, random tensor networks, and holography.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kudler-Flam","Jonah",""],["Nie","Laimei",""],["Vijay","Akash",""]]}
{"id":"2308.08601","submitter":"Victor Barizien","authors":"Victor Barizien, Pavel Sekatski, Jean-Daniel Bancal","title":"Custom Bell inequalities from formal sums of squares","comments":"16+7 pages, 4+1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bell inequalities play a key role in certifying quantum properties for\ndevice-independent quantum information protocols. It is still a major\nchallenge, however, to devise Bell inequalities tailored for an arbitrary given\nquantum state. Existing approaches based on sums of squares provide results in\nthis direction, but they are restricted by the necessity of first choosing\nmeasurement settings suited to the state. Here, we show how the sum of square\nproperty can be enforced for an arbitrary target state by making an appropriate\nchoice of nullifiers, which is made possible by leaving freedom in the choice\nof measurement. Using our method, we construct simple Bell inequalities for\nseveral families of quantum states, including partially entangled multipartite\nGHZ states and qutrit states. In most cases we are able to prove that the\nconstructed Bell inequalities achieve self-testing of the target state. We also\nuse the freedom in the choice of measurement to self-test partially entangled\ntwo-qubit states with a family of settings with two parameters. Finally, we\nshow that some statistics can be self-tested with distinct Bell inequalities,\nhence obtaining new insight on the shape of the set of quantum correlations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Barizien","Victor",""],["Sekatski","Pavel",""],["Bancal","Jean-Daniel",""]]}
{"id":"2308.08602","submitter":"Mairead Heiger","authors":"M. E. Heiger (Department of Astronomy and Astrophysics, University of\n  Toronto, Dunlap Institute for Astronomy & Astrophysics, University of\n  Toronto), T. S. Li (Department of Astronomy and Astrophysics, University of\n  Toronto, Dunlap Institute for Astronomy & Astrophysics, University of\n  Toronto), A. B. Pace (McWilliams Center for Cosmology, Carnegie Mellon\n  University), J. D. Simon (Observatories of the Carnegie Institution for\n  Science), A. P. Ji (Department of Astronomy & Astrophysics, University of\n  Chicago, Kavli Institute for Cosmological Physics, University of Chicago), A.\n  Chiti (Department of Astronomy and Astrophysics, University of Chicago), C.\n  R. Bom (Centro Brasileiro de Pesquisas F\\'isicas), J. A. Carballo-Bello\n  (Instituto de Alta Investigaci\\'on, Sede Esmeralda, Universidad de\n  Tarapac\\'a), J. L. Carlin (Rubin Observatory/AURA), W. Cerny (Kavli Institute\n  for Cosmological Physics, University of Chicago, USA, Department of Astronomy\n  and Astrophysics, University of Chicago), Y. Choi (Department of Astronomy,\n  University of California), A. Drlica-Wagner (Fermi National Accelerator\n  Laboratory, Batavia, IL, USA, Kavli Institute for Cosmological Physics,\n  University of Chicago, Department of Astronomy and Astrophysics, University\n  of Chicago), D. J. James (ASTRAVEO LLC, Gloucester, MA, USA, Applied\n  Materials Inc.), C. E. Mart\\'inez-V\\'azquez (Gemini Observatory, NSF's\n  NOIRLab), G. E. Medina (Department of Astronomy and Astrophysics, University\n  of Toronto), B. Mutlu-Pakdil (Department of Physics and Astronomy, Dartmouth\n  College), M. Navabi (Department of Physics, University of Surrey), N. E. D.\n  No\\\"el (Department of Physics, University of Surrey), J. D. Sakowska\n  (Department of Physics, University of Surrey), G. S. Stringfellow (Center for\n  Astrophysics and Space Astronomy, University of Colorado)","title":"Reading Between the (Spectral) Lines: Magellan/IMACS spectroscopy of the\n  Ultra-faint Dwarf Galaxies Eridanus IV and Centaurus I","comments":"25 pages, 11 figures, submitted to AAS journals","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 spectroscopic analysis of Eridanus IV (Eri IV) and Centaurus I\n(Cen I), two ultra-faint dwarf galaxies of the Milky Way. Using IMACS/Magellan\nspectroscopy, we identify 28 member stars of Eri IV and 34 member stars of Cen\nI. For Eri IV, we measure a systemic velocity of $v_{sys} =\n-31.5^{+1.3}_{-1.2}\\:\\mathrm{km\\:s^{-1}}$ and velocity dispersion $\\sigma_{v}=\n6.1^{+1.2}_{-0.9}\\:\\mathrm{km\\:s^{-1}}$. Additionally, we measure the\nmetallicities of 16 member stars of Eri IV. We find a metallicity of\n$\\mathrm{[Fe/H]}=-2.87^{+0.08}_{-0.07}$ and resolve a dispersion of\n$\\sigma_{\\mathrm{[Fe/H]}} = 0.20\\pm0.09$. The mean metallicity is marginally\nlower than all other known ultra-faint dwarf galaxies, making it one of the\nmost metal-poor galaxies discovered thus far. Eri IV also has a somewhat\nunusual right-skewed metallicity distribution. For Cen I, we find a velocity\n$v_{sys} = 44.9\\pm0.8\\:\\mathrm{km\\:s^{-1}}$ and velocity dispersion $\\sigma_{v}\n= 4.2^{+0.6}_{-0.5} \\:\\mathrm{km\\:s^{-1}}$. We measure the metallicities of 27\nmember stars of Cen I, and find a mean metallicity $\\mathrm{[Fe/H]} =\n-2.57\\pm0.08$ and metallicity dispersion $\\sigma_{\\mathrm{[Fe/H]}} =\n0.38^{+0.07}_{-0.05}$. We calculate the systemic proper motion, orbit, and the\nastrophysical J-factor for each system, the latter of which indicates that Eri\nIV is a good target for indirect dark matter detection. We also find no strong\nevidence for tidal stripping of Cen I or Eri IV. Overall, our measurements\nconfirm that Eri IV and Cen I are dark matter-dominated galaxies with\nproperties largely consistent with other known ultra-faint dwarf galaxies. The\nlow metallicity, right-skewed metallicity distribution, and high J-factor make\nEri IV an especially interesting candidate for further followup.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Heiger","M. E.","","Department of Astronomy and Astrophysics, University of\n  Toronto, Dunlap Institute for Astronomy & Astrophysics, University of\n  Toronto"],["Li","T. S.","","Department of Astronomy and Astrophysics, University of\n  Toronto, Dunlap Institute for Astronomy & Astrophysics, University of\n  Toronto"],["Pace","A. B.","","McWilliams Center for Cosmology, Carnegie Mellon\n  University"],["Simon","J. D.","","Observatories of the Carnegie Institution for\n  Science"],["Ji","A. P.","","Department of Astronomy & Astrophysics, University of\n  Chicago, Kavli Institute for Cosmological Physics, University of Chicago"],["Chiti","A.","","Department of Astronomy and Astrophysics, University of Chicago"],["Bom","C. R.","","Centro Brasileiro de Pesquisas F\u00edsicas"],["Carballo-Bello","J. A.","","Instituto de Alta Investigaci\u00f3n, Sede Esmeralda, Universidad de\n  Tarapac\u00e1"],["Carlin","J. L.","","Rubin Observatory/AURA"],["Cerny","W.","","Kavli Institute\n  for Cosmological Physics, University of Chicago, USA, Department of Astronomy\n  and Astrophysics, University of Chicago"],["Choi","Y.","","Department of Astronomy,\n  University of California"],["Drlica-Wagner","A.","","Fermi National Accelerator\n  Laboratory, Batavia, IL, USA, Kavli Institute for Cosmological Physics,\n  University of Chicago, Department of Astronomy and Astrophysics, University\n  of Chicago"],["James","D. J.","","ASTRAVEO LLC, Gloucester, MA, USA, Applied\n  Materials Inc."],["Mart\u00ednez-V\u00e1zquez","C. E.","","Gemini Observatory, NSF's\n  NOIRLab"],["Medina","G. E.","","Department of Astronomy and Astrophysics, University\n  of Toronto"],["Mutlu-Pakdil","B.","","Department of Physics and Astronomy, Dartmouth\n  College"],["Navabi","M.","","Department of Physics, University of Surrey"],["No\u00ebl","N. E. D.","","Department of Physics, University of Surrey"],["Sakowska","J. D.","","Department of Physics, University of Surrey"],["Stringfellow","G. S.","","Center for\n  Astrophysics and Space Astronomy, University of Colorado"]]}
{"id":"2308.08603","submitter":"Mingyang Zhuang","authors":"Ming-Yang Zhuang and Luis C. Ho","title":"Evolutionary Paths of Active Galactic Nuclei and Their Host Galaxies","comments":"Author's version, 38 pages, 12 figures (+12 figures and 2 tables in\n  Supplementary Materials), published in Nature Astronomy on August 17 2023 at\n  https://www.nature.com/articles/s41550-023-02051-4","journal-ref":null,"doi":"10.1038/s41550-023-02051-4","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The tight correlations between the masses of supermassive black holes (BHs)\nand the properties of their host galaxies suggest that BHs coevolve with\ngalaxies. However, what is the link between BH mass ($M_{\\rm BH}$) and the\nproperties of the host galaxies of active galactic nuclei (AGNs) in the nearby\nUniverse? We measure stellar masses ($M_*$), colors, and structural properties\nfor $\\sim11,500$ $z\\leq0.35$ broad-line AGNs, nearly 40 times larger than that\nin any previous work. We find that early-type and late-type AGNs follow a\nsimilar $M_{\\rm BH}-M_*$ relation. The position of AGNs on the $M_{\\rm BH}-M_*$\nplane is connected with the properties of star formation and BH accretion. Our\nresults unveil the evolutionary paths of galaxies on the $M_{\\rm BH}-M_*$\nplane: objects above the relation tend to evolve more horizontally with\nsubstantial $M_*$ growth; objects on the relation move along the local\nrelation; and objects below the relation migrate more vertically with\nsubstantial $M_{\\rm BH}$ growth. These trajectories suggest that radiative-mode\nfeedback cannot quench the growth of BHs and their host galaxies for AGNs that\nlie below the relation, while kinetic-mode feedback hardly suppress long-term\nstar formation for AGNs situated above the relation. This work provides\nimportant constraints for numerical simulations and offers a framework for\nstudying the cosmic coevolution of supermassive BHs and their host galaxies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhuang","Ming-Yang",""],["Ho","Luis C.",""]]}
{"id":"2308.08604","submitter":"Prativa Biswas","authors":"Prativa Biswas, Mousumi Mandal","title":"A study of $v$-number for some monomial ideals","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we give formulas for $v$-number of edge ideals of some graphs\nlike path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two\ncycles and join of two graphs. For an $\\mathfrak{m}$-primary monomial ideal\n$I\\subset S=K[x_1,\\ldots,x_t]$, we provide an explicit expression of $v$-number\nof $I$, denoted by $v(I)$, and give an upper bound of $v(I)$ in terms of the\ndegree of its generators. We show that for a monomial ideal $I$, $v(I^{n+1})$\nis bounded above by a linear polynomial for large $n$ and for certain classes\nof monomial ideals, the upper bound is achieved for all $n\\geq 1$. For\n$\\mathfrak m$-primary monomial ideal $I$ we prove that $v(I)\\leq$ reg$(S/I)$\nand their difference can be arbitrarily large.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:00:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Biswas","Prativa",""],["Mandal","Mousumi",""]]}
{"id":"2308.08605","submitter":"Reed Hodges","authors":"Marston Copeland, Sean Fleming, Rohit Gupta, Reed Hodges, Thomas Mehen","title":"Polarized TMD fragmentation functions for $J/\\psi$ production","comments":"27 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculate the matching, at leading order, of the transverse momentum\ndependent fragmentation functions (TMDFFs) for light quarks and gluons\nfragmenting to a $J/\\psi$ onto polarized non-relativistic QCD (NRQCD) TMDFFs.\nThe NRQCD TMDFFs have an operator-product-expansion in terms of\nnon-perturbative NRQCD production matrix elements. Using the results we obtain,\nwe make predictions for the light quark fragmentation contribution to the\nproduction of polarized $J/\\psi$ in semi-inclusive deep inelastic scattering\n(SIDIS) both for unpolarized and longitudinally polarized beams. These results\nare an important contribution to polarized $J/\\psi$ production in SIDIS, and\nthus are needed for comparison with experiments at the future Electron-Ion\nCollider.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:01:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Copeland","Marston",""],["Fleming","Sean",""],["Gupta","Rohit",""],["Hodges","Reed",""],["Mehen","Thomas",""]]}
{"id":"2308.08606","submitter":"Bj{\\o}rnulf Brekke","authors":"Bj{\\o}rnulf Brekke, Arne Brataas, Asle Sudb{\\o}","title":"Two-dimensional altermagnets: A minimal microscopic model","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"QuSpin 2023","categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a minimal toy model for a two-dimensional altermagnet. The model\nunravels altermagnetic properties at a microscopic level. We find spin-split\nelectron- and non-degenerate magnon bands with a $d$-wave symmetry. We use the\nmodel to explore magnon-mediated superconductivity in altermagnets. The\ndominant superconducting state is spin-polarized with a $p$-wave symmetry. The\nstate adopts its characteristics from the spin-split electron bands.\nFurthermore, we find that the superconducting critical temperature of\naltermagnets can be significantly enhanced by tuning the chemical potential.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:01:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brekke","Bj\u00f8rnulf",""],["Brataas","Arne",""],["Sudb\u00f8","Asle",""]]}
{"id":"2308.08607","submitter":"Florian Stecker","authors":"Le\\'on Carvajales and Florian Stecker","title":"Anosov representations acting on homogeneous spaces: domains of\n  discontinuity","comments":"34 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct open domains of discontinuity for Anosov representations acting\non some homogeneous spaces, including (pseudo-Riemannian) symmetric spaces.\nThis generalizes work of Kapovich-Leeb-Porti on flag spaces. Our results\ncomplement those of Gu\\'eritaud-Guichard-Kassel-Wienhard, who constructed\nproper actions of Anosov representations. For Zariski dense Anosov\nrepresentations with respect to a minimal parabolic subgroup acting on some\nsymmetric spaces, we show that our construction describes the largest possible\nopen domains of discontinuity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:02:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Carvajales","Le\u00f3n",""],["Stecker","Florian",""]]}
{"id":"2308.08608","submitter":"Sourav Nandy","authors":"Sourav Nandy, Markus Schmitt, Marin Bukov, Zala Lenar\\v{c}i\\v{c}","title":"Reconstructing effective Hamiltonians from nonequilibrium (pre-)thermal\n  steady states","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.quant-gas cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconstructing Hamiltonians from local measurements is key to enabling\nreliable quantum simulation: both validating the implemented model, and\nidentifying any left-over terms with sufficient precision is a problem of\nincreasing importance. Here we propose a deep-learning-assisted variational\nalgorithm for Hamiltonian reconstruction by pre-processing a dataset that is\ndiagnosed to contain thermal measurements of local operators. We demonstrate\nthe efficient and precise reconstruction of local Hamiltonians, while\nlong-range interacting Hamiltonians are reconstructed approximately. Away from\nequilibrium, for periodically and random multipolar driven systems, we\nreconstruct the effective Hamiltonian widely used for Floquet engineering of\nmetastable steady states. Moreover, our approach allows us to reconstruct an\neffective quasilocal Hamiltonian even in the heating regime beyond the validity\nof the prethermal plateau, where perturbative expansions fail.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:02:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nandy","Sourav",""],["Schmitt","Markus",""],["Bukov","Marin",""],["Lenar\u010di\u010d","Zala",""]]}
{"id":"2308.08609","submitter":"Yi-Fan Jiang","authors":"Yi-Fan Jiang and Hong Yao","title":"Pair density wave superconductivity: a microscopic model in two\n  dimensions","comments":"4 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":"  Pair-density-wave (PDW) superconductivity is a long-sought exotic state with\noscillating superconducting order parameter without the need of applying\nexternal magnetic field. So far it has been rare in establishing a\ntwo-dimensional (2D) microscopic model with such exotic long-range order in its\nground state. Here we propose to study PDW superconductivity in a minimal model\nof spinless fermions on the honeycomb lattice with nearest-neighbor (NN) and\nnext-nearest-neighbor (NNN) interaction $V_1$ and $V_2$, respectively. By\nperforming a state-of-the-art density-matrix renormalization group (DMRG) study\nof this $t$-$V_1$-$V_2$ model at finite doping on six-leg and eight-leg\nhoneycomb cylinders, we showed that the ground state exhibits PDW ordering\n(namely quasi-long-range order with a divergent PDW susceptibility). Remarkably\nthis PDW state persists on the wider cylinder with 2D-like Fermi surfaces (FS).\nTo the best of our knowledge, this is probably the first controlled numerical\nevidence of PDW in systems with 2D-like FS.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:03:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Yi-Fan",""],["Yao","Hong",""]]}
{"id":"2308.08610","submitter":"Eren Unlu Ph. D.","authors":"Eren Unlu","title":"FootGPT : A Large Language Model Development Experiment on a Minimal\n  Setting","comments":"10 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":"  With recent empirical observations, it has been argued that the most\nsignificant aspect of developing accurate language models may be the proper\ndataset content and training strategy compared to the number of neural\nparameters, training duration or dataset size. Following this argument, we\nopted to fine tune a one billion parameter size trained general purpose causal\nlanguage model with a dataset curated on team statistics of the Italian\nfootball league first ten game weeks, using low rank adaptation. The limited\ntraining dataset was compiled based on a framework where a powerful commercial\nlarge language model provides distilled paragraphs and question answer pairs as\nintended. The training duration was kept relatively short to provide a basis\nfor our minimal setting exploration. We share our key observations on the\nprocess related to developing a specific purpose language model which is\nintended to interpret soccer data with constrained resources in this article.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:03:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Unlu","Eren",""]]}
{"id":"2308.08611","submitter":"Abdul Wahid","authors":"A. Wahid, I faiud, K. Mason","title":"Integrating Renewable Energy in Agriculture: A Deep Reinforcement\n  Learning-based Approach","comments":"This paper has been accepted at the 2023 Deep Learning for Precision\n  Agriculture (DLSPA) Workshop, at The 2023 European Conference on Machine\n  Learning and Principles and Practice of Knowledge Discovery in Databases\n  (ECML PKDD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article investigates the use of Deep Q-Networks (DQNs) to optimize\ndecision-making for photovoltaic (PV) systems installations in the agriculture\nsector. The study develops a DQN framework to assist agricultural investors in\nmaking informed decisions considering factors such as installation budget,\ngovernment incentives, energy requirements, system cost, and long-term\nbenefits. By implementing a reward mechanism, the DQN learns to make\ndata-driven decisions on PV integration. The analysis provides a comprehensive\nunderstanding of how DQNs can support investors in making decisions about PV\ninstallations in agriculture. This research has significant implications for\npromoting sustainable and efficient farming practices while also paving the way\nfor future advancements in this field. By leveraging DQNs, agricultural\ninvestors can make optimized decisions that improve energy efficiency, reduce\nenvironmental impact, and enhance profitability. This study contributes to the\nadvancement of PV integration in agriculture and encourages further innovation\nin this promising area.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:03:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wahid","A.",""],["faiud","I",""],["Mason","K.",""]]}
{"id":"2308.08612","submitter":"Felix Yu","authors":"Felix Yu","title":"Primer on Axion Physics","comments":"15 pages, 1 figure; invited contribution to Annalen der Physik","journal-ref":null,"doi":null,"report-no":"MITP-23-038","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  I review the canonical axion potential, with an emphasis on the field theory\nunderlying radial and angular modes of complex scalar fields. I present the\nexplicit calculation of the instanton-induced breaking of the Goldstone field\ndirection necessary to derive the canonical axion mass and decay constant\nrelation. The primer is intended to serve an audience with elementary quantum\nfield theory expertise.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:06:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yu","Felix",""]]}
{"id":"2308.08613","submitter":"Keshav Dasgupta","authors":"Joydeep Chakravarty, Keshav Dasgupta, Diksha Jain, Dileep P. Jatkar,\n  Archana Maji, and Radu Tatar","title":"Coherent States in M-Theory: A Brane Scan using the Taub-NUT","comments":"6 pages, no figure, LaTex","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Taub-NUT geometry corresponds to the Kaluza-Klein monopole solution of\nM-theory and on dimension reduction along the Taub-NUT circle direction it\nbecomes the D6 brane of type IIA string theory. We show that the Taub-NUT\ngeometry can be realised as a coherent state, or more appropriately as a\nGlauber-Sudarshan state in M-theory, once we take the underlying resurgence\nstructure carefully. Using the duality chain it in turn implies that all\nD-branes as well as NS5-branes can be realised as Glauber-Sudarshan states in\nstring theory. Our analysis also leads to an intriguing possibility of\nrealizing the gravity duals of certain non-conformal minimally-supersymmetric\ngauge theories by deforming a class of Glauber-Sudarshan states.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:10:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chakravarty","Joydeep",""],["Dasgupta","Keshav",""],["Jain","Diksha",""],["Jatkar","Dileep P.",""],["Maji","Archana",""],["Tatar","Radu",""]]}
{"id":"2308.08614","submitter":"Bin Lei","authors":"Bin Lei, pei-Hung Lin, Chunhua Liao, Caiwen Ding","title":"Boosting Logical Reasoning in Large Language Models through a New\n  Framework: The Graph of Thought","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":"  Recent advancements in large-scale models, such as GPT-4, have showcased\nremarkable capabilities in addressing standard queries. However, when facing\ncomplex problems that require multi-step logical reasoning, their accuracy\ndramatically decreases. Current research has explored the realm of\n\\textit{prompting engineering} to bolster the inferential capacities of these\nmodels. Our paper unveils a pioneering prompting technique, dubbed\n\\textit{Graph of Thoughts (GoT)}. Through testing on a trio of escalating\nchallenges: the 24-point game, resolution of high-degree polynomial equations,\nand derivation of formulas for recursive sequences, our method outperformed\nGPT-4, achieving accuracy improvements of $89.7\\%$, $86\\%$, and $56\\%$ for each\nrespective task. Moreover, when juxtaposed with the state-of-the-art (SOTA)\nprompting method, \\textit{Tree of Thought (ToT)}, our approach registered an\naverage accuracy boost of $23\\%$, $24\\%$, and $15\\%$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:13:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lei","Bin",""],["Lin","pei-Hung",""],["Liao","Chunhua",""],["Ding","Caiwen",""]]}
{"id":"2308.08615","submitter":"Ankur Singha","authors":"Ali Faraz, Ankur Singha, Dootika Vats, Dipankar Chakrabarti, Vipul\n  Arora","title":"Scalable Lattice Sampling using Factorized Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.dis-nn cond-mat.stat-mech hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Boltzmann distributions over lattices are pervasive in Computational Physics.\nSampling them becomes increasingly difficult with the increase in the number of\ndimensions, especially near critical regions, e.g., phase transitions or\ncontinuum limits. Conditional generative models are emerging as promising tools\nfor sampling in critical regions. When conditioned on the parameters to be\nvaried, they can be efficaciously extended to critical regions without the need\nfor retraining. However, current approaches do not scale well to large\nlattices. We present a novel approach called Parallelizable Block\nMetropolis-within-Gibbs (PBMG) for generating samples for any local lattice\nmodel. It factorizes the joint distribution of lattice into local parametric\nkernels, thereby allowing efficient sampling of very large lattices. We\noptimize the model with reverse Kullback-Leibler divergence (RKLD) to avoid the\nneed for ground truth samples. Since the local distributions are simpler, the\nmodel is not affected by mode collapse, which generally occurs while training\nwith RKLD. We validate our approach on the XY model and the Scalar $\\phi^4$\ntheory. PBMG achieves high acceptance rates and the observable statistics\nestimated from the samples match the ground truth.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:18:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Faraz","Ali",""],["Singha","Ankur",""],["Vats","Dootika",""],["Chakrabarti","Dipankar",""],["Arora","Vipul",""]]}
{"id":"2308.08616","submitter":"Pieter Bomans","authors":"Pieter Bomans, Christopher Couzens, Yein Lee, and Sirui Ning","title":"Symmetry Breaking and Consistent Truncations from M5-branes Wrapping a\n  Disc","comments":"27 pages + appendices, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct new supersymmetric solutions corresponding to M5-branes wrapped\non a topological disc by turning on additional scalars in the background. The\npresence of such scalar fields breaks one of the U(1) isometries of the\ninternal space, explicitly realising the breaking by the Stuckelberg mechanism\nobserved previously. In addition, we construct a consistent truncation of\nmaximal seven-dimensional gauged supergravity on the disc to five-dimensional\nRomans' SU (2) x U(1) gauged supergravity, allowing us to construct a plethora\nof new supergravity solutions corresponding to more general states in the dual\nSCFTs as well as solutions corresponding to M5-branes wrapping four-dimensional\norbifolds.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:20:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bomans","Pieter",""],["Couzens","Christopher",""],["Lee","Yein",""],["Ning","Sirui",""]]}
{"id":"2308.08617","submitter":"Frederico Bolsoni Oliveira","authors":"Frederico Bolsoni Oliveira and Jo\\~ao Luiz F. Azevedo","title":"Stability and Order of Accuracy Analysis of High-Order Schemes\n  Formulated Using the Flux Reconstruction Approach","comments":"14 pages, 4 figures, 4 tables, part of the proceedings of the 26th\n  ABCM International Congress of Mechanical Engineering","journal-ref":"Oliveira, F. B. and Azevedo, J. L. F., \"Stability and Order of\n  Accuracy Analysis of High-Order Schemes Formulated Using the Flux\n  Reconstruction Approach\". Paper COB-2021-0112, 26th COBEM Congress, Online,\n  2021","doi":"10.26678/ABCM.COBEM2021.COB2021-0112","report-no":"COB-2021-0112","categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A stability analysis is performed on high-order schemes formulated using the\nFlux Reconstruction (FR) approach. The one-dimensional advection model equation\nis used for the assessment of the stability region of these schemes when\ncoupled with Runge-Kutta-type time-march procedures. Schemes are created using\ndifferent numbers of internal points for each cell of the discrete domain, in\nsuch a way that a broad spectrum of spatial discretization orders can be\nanalyzed. Multiple correction functions are employed so that well-known\nschemes, for instance the Discontinuous Galerkin (DG) and the Staggered-Grid\nschemes, may also be included in the study. The stability analysis is performed\nby identifying the behavior, in the complex plane, of the eigenvalues\nassociated with each one of the considered cases. It is observed that, as the\norder of the scheme increases, a significant decrease in its domain of\nstability occurs, followed by a significant reduction in the amount of\nartificial dissipation that is introduced to the solution.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:21:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Oliveira","Frederico Bolsoni",""],["Azevedo","Jo\u00e3o Luiz F.",""]]}
{"id":"2308.08618","submitter":"Brian Weiser","authors":"Venkat D. Abbaraju, Tamaraty L. Robinson, Brian P. Weiser","title":"Modeling Biphasic, Non-Sigmoidal Dose-Response Relationships: Comparison\n  of Brain-Cousens and Cedergreen Models for a Biochemical Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biphasic, non-sigmoidal dose-response relationships are frequently observed\nin biochemistry and pharmacology, but they are not always analyzed with\nappropriate statistical methods. Here, we examine curve fitting methods for\n\"hormetic\" dose-response relationships where low and high doses of an effector\nproduce opposite responses. We provide the full dataset used for modeling, and\nwe provide the code for analyzing the dataset in SAS using two established\nmathematical models of hormesis, the Brain-Cousens model and the Cedergreen\nmodel. We show how to obtain and interpret curve parameters such as the ED50\nthat arise from modeling, and we discuss how curve parameters might change in a\npredictable manner when the conditions of the dose-response assay are altered.\nIn addition to modeling the raw dataset that we provide, we also model the\ndataset after applying common normalization techniques, and we indicate how\nthis affects the parameters that are associated with the fit curves. The\nBrain-Cousens and Cedergreen models that we used for curve fitting were\nsimilarly effective at capturing quantitative information about the biphasic\ndose-response relationships.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:22:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Abbaraju","Venkat D.",""],["Robinson","Tamaraty L.",""],["Weiser","Brian P.",""]]}
{"id":"2308.08619","submitter":"Adrian Valadkhani","authors":"Adrian Valadkhani, Mikel Iraola, Axel F\\\"unfhaus, Young-Joon Song,\n  Libor Smejkal, Jairo Sinova, Roser Valenti","title":"Influence of magnetism, strain and pressure on the band topology of\n  EuCd$_2$As$_2$","comments":"v3 fixed typo in Fig. 3","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the wealth of proposals and realizations of nontrivial\ntopological phases in EuCd$_2$As$_2$, such as a Weyl semimetallic state and the\nrecently discussed semimetallic versus semiconductor behavior in this system,\nwe analyze in this work the role of the delicate interplay of Eu magnetism,\nstrain and pressure on the realization of such phases. For that we invoke a\ncombination of a group theoretical analysis with ab initio density functional\ntheory calculations and uncover a rich phase diagram with various non-trivial\ntopological phases beyond a Weyl semimetallic state, such as axion and\ntopological crystalline insulating phases, and discuss their realization.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:23:35 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 20:20:14 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 08:39:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Valadkhani","Adrian",""],["Iraola","Mikel",""],["F\u00fcnfhaus","Axel",""],["Song","Young-Joon",""],["Smejkal","Libor",""],["Sinova","Jairo",""],["Valenti","Roser",""]]}
{"id":"2308.08620","submitter":"Mingdai Yang","authors":"Mingdai Yang, Zhiwei Liu, Liangwei Yang, Xiaolong Liu, Chen Wang, Hao\n  Peng, Philip S. Yu","title":"Group Identification via Transitional Hypergraph Convolution with\n  Cross-view Self-supervised Learning","comments":"11 pages. Accepted by CIKM'23","journal-ref":null,"doi":"10.1145/3583780.3614902","report-no":null,"categories":"cs.IR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the proliferation of social media, a growing number of users search for\nand join group activities in their daily life. This develops a need for the\nstudy on the group identification (GI) task, i.e., recommending groups to\nusers. The major challenge in this task is how to predict users' preferences\nfor groups based on not only previous group participation of users but also\nusers' interests in items. Although recent developments in Graph Neural\nNetworks (GNNs) accomplish embedding multiple types of objects in graph-based\nrecommender systems, they, however, fail to address this GI problem\ncomprehensively. In this paper, we propose a novel framework named Group\nIdentification via Transitional Hypergraph Convolution with Graph\nSelf-supervised Learning (GTGS). We devise a novel transitional hypergraph\nconvolution layer to leverage users' preferences for items as prior knowledge\nwhen seeking their group preferences. To construct comprehensive user/group\nrepresentations for GI task, we design the cross-view self-supervised learning\nto encourage the intrinsic consistency between item and group preferences for\neach user, and the group-based regularization to enhance the distinction among\ngroup embeddings. Experimental results on three benchmark datasets verify the\nsuperiority of GTGS. Additional detailed investigations are conducted to\ndemonstrate the effectiveness of the proposed framework.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:24:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Mingdai",""],["Liu","Zhiwei",""],["Yang","Liangwei",""],["Liu","Xiaolong",""],["Wang","Chen",""],["Peng","Hao",""],["Yu","Philip S.",""]]}
{"id":"2308.08621","submitter":"Elahe Moradi","authors":"Neda Darbeheshti and Elahe Moradi","title":"LSTM-Based Forecasting Model for GRACE Accelerometer Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Gravity Recovery and Climate Experiment (GRACE) satellite mission,\nspanning from 2002 to 2017, has provided a valuable dataset for monitoring\nvariations in Earth's gravity field, enabling diverse applications in\ngeophysics and hydrology. The mission was followed by GRACE Follow-On in 2018,\ncontinuing data collection efforts. The monthly Earth gravity field, derived\nfrom the integration different instruments onboard satellites, has shown\ninconsistencies due to various factors, including gaps in observations for\ncertain instruments since the beginning of the GRACE mission.\n  With over two decades of GRACE and GRACE Follow-On data now available, this\npaper proposes an approach to fill the data gaps and forecast GRACE\naccelerometer data. Specifically, we focus on accelerometer data and employ\nLong Short-Term Memory (LSTM) networks to train a model capable of predicting\naccelerometer data for all three axes.\n  In this study, we describe the methodology used to preprocess the\naccelerometer data, prepare it for LSTM training, and evaluate the model's\nperformance. Through experimentation and validation, we assess the model's\naccuracy and its ability to predict accelerometer data for the three axes. Our\nresults demonstrate the effectiveness of the LSTM forecasting model in filling\ngaps and forecasting GRACE accelerometer data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:39:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Darbeheshti","Neda",""],["Moradi","Elahe",""]]}
{"id":"2308.08622","submitter":"Rory Smith Mr","authors":"Rory Smith, Ho Seong Hwang, Katarina Kraljic, Paula Calderon-Castillo,\n  Thomas M. Jackson, Anna Pasquali, Jihye Shin, Jongwan Ko, Jaewon Yoo, Hyowon\n  Kim, Jaewoo Kim","title":"BCG alignment with the Locations of Cluster Members and the Large Scale\n  Structure out to 10 R$_{200}$","comments":"21 pages, 5 tables, 5 figures ,Accepted to MNRAS, August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using a sample of $>200$ clusters, each with typically $100-200$\nspectroscopically confirmed cluster members, we search for a signal of\nalignment between the Position Angle (PA) of the Brightest Cluster Galaxy (BCG)\nand the distribution of cluster members on the sky about the cluster centre out\nto projected distances of 3~R$_{200}$. The deep spectroscopy, combined with\ncorrections for spectroscopic incompleteness, makes our sample ideal to\ndetermine alignment signal strengths. We also use an SDSS based skeleton of the\nfilamentary Large Scale Structure (LSS), and measure BCG alignment with the\nlocation of the LSS skeleton segments on the sky out to projected distances of\n10~R$_{200}$. The alignment signal is measured using three separate statistical\nmeasures; Rao's spacing test (U), Kuiper's V parameter (V), and the Binomial\nprobability test (P). The significance of the BCG alignment signal with both\ncluster members and LSS segments is extremely high (1 in a million chance or\nless to be drawn randomly from a uniform distribution). We investigate a wide\nset of parameters that may influence the strength of the alignment signal.\nClusters with more elliptical-shaped BCGs show stronger alignment with both\ntheir cluster members and LSS segments. Also, selecting clusters with closely\nconnected filaments, or using a luminosity-weighted LSS skeleton, increases the\nalignment signal significantly. Alignment strength decreases with increasing\nprojected distance. Combined, these results provide strong evidence for the\ngrowth of clusters and their BCGs by preferential feeding along the direction\nof the filaments in which they are embedded.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:40:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Smith","Rory",""],["Hwang","Ho Seong",""],["Kraljic","Katarina",""],["Calderon-Castillo","Paula",""],["Jackson","Thomas M.",""],["Pasquali","Anna",""],["Shin","Jihye",""],["Ko","Jongwan",""],["Yoo","Jaewon",""],["Kim","Hyowon",""],["Kim","Jaewoo",""]]}
{"id":"2308.08623","submitter":"Marcos Flores","authors":"Marcos M. Flores, Alexander Kusenko, Andrea M. Ghez, Smadar Naoz","title":"$G$ Objects and primordial black holes","comments":"8 pages, 2 figures, Accepted into Phys. Rev. D","journal-ref":null,"doi":null,"report-no":"IPMU23-0026","categories":"astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We suggest that \"$G$ objects\" recently discovered in the Galactic Center may\nbe clouds of gas bound by the gravitational field of stellar-mass black holes\nproduced in the interactions of sublunar primordial black holes with neutron\nstars. If dark matter is composed of primordial black holes with masses\n$(10^{-16} - 10^{-10}) M_\\odot$, these black holes can be captured by neutron\nstars in the Galactic Center, where the dark matter density is high. After the\ncapture, the neutron star is consumed by the black hole, resulting in a\npopulation of $(1-2) M_\\odot $ black holes. These stellar-mass black holes,\naccompanied by gaseous atmospheres, can account for the observed properties of\nthe $G$ objects, including their resilience to tidal disruption by the\nsupermassive black hole in the Galactic Center while also producing emission\nconsistent with inferred luminosities.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:46:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Flores","Marcos M.",""],["Kusenko","Alexander",""],["Ghez","Andrea M.",""],["Naoz","Smadar",""]]}
{"id":"2308.08624","submitter":"Takashi Imai","authors":"Takashi Imai, Jiaming Wang, Rebecca W. Smaha, Wei He, Jiajia Wen,\n  Young S. Lee","title":"Local probe investigation of the spin dynamics in the kagome and\n  inter-layers of orthorhombic barlowite Cu$_4$(OD)$_6$FBr: $^{79}$Br and\n  $^{63}$Cu NQR study","comments":"5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report $^{79}$Br and $^{63}$Cu nuclear quadrupole resonance (NQR) in the\nparamagnetic state above $T_\\text{N} = 15$ K of the antiferromagnetic\northorhombic phase of barlowite Cu$_4$(OD)$_6$FBr consisting of a layered\nkagome structure. The divergent behavior of the longitudinal $^{79}(1/T_{1})$\nand transverse $^{79}(1/T_{2})$ relaxation rates observed at $^{79}$Br sites\nevidences that critical slowing down of Cu spin fluctuations sets in below\n$\\sim20$ K. This means that one or more Cu sites, most likely at the interlayer\nCu(3,4,5) sites between the kagome planes, undergo the antiferromagnetic phase\ntransition in a fairly conventional way. On the other hand, the $^{63}$Cu NQR\nsignal intensity is gradually wiped out below $\\sim30$ K, pointing toward\ngradual spin freezing of the kagome layers instead. These contrasting findings\nsuggest significant roles played by magnetic frustration effects within the\nkagome layers.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:46:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Imai","Takashi",""],["Wang","Jiaming",""],["Smaha","Rebecca W.",""],["He","Wei",""],["Wen","Jiajia",""],["Lee","Young S.",""]]}
{"id":"2308.08625","submitter":"Vera Pavlova","authors":"Pavlova Vera and Mohammed Makhlouf","title":"BIOptimus: Pre-training an Optimal Biomedical Language Model with\n  Curriculum Learning for Named Entity Recognition","comments":null,"journal-ref":"https://aclanthology.org/2023.bionlp-1.31/","doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using language models (LMs) pre-trained in a self-supervised setting on large\ncorpora and then fine-tuning for a downstream task has helped to deal with the\nproblem of limited label data for supervised learning tasks such as Named\nEntity Recognition (NER). Recent research in biomedical language processing has\noffered a number of biomedical LMs pre-trained using different methods and\ntechniques that advance results on many BioNLP tasks, including NER. However,\nthere is still a lack of a comprehensive comparison of pre-training approaches\nthat would work more optimally in the biomedical domain. This paper aims to\ninvestigate different pre-training methods, such as pre-training the biomedical\nLM from scratch and pre-training it in a continued fashion. We compare existing\nmethods with our proposed pre-training method of initializing weights for new\ntokens by distilling existing weights from the BERT model inside the context\nwhere the tokens were found. The method helps to speed up the pre-training\nstage and improve performance on NER. In addition, we compare how masking rate,\ncorruption strategy, and masking strategies impact the performance of the\nbiomedical LM. Finally, using the insights from our experiments, we introduce a\nnew biomedical LM (BIOptimus), which is pre-trained using Curriculum Learning\n(CL) and contextualized weight distillation method. Our model sets new states\nof the art on several biomedical Named Entity Recognition (NER) tasks. We\nrelease our code and all pre-trained models\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:48:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Vera","Pavlova",""],["Makhlouf","Mohammed",""]]}
{"id":"2308.08626","submitter":"Oleg Kechkin","authors":"Oleg V. Kechkin","title":"Kink in the dilaton-axion theory with a potential possessing dilaton\n  shift symmetry","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The sigma model with dilaton and axion is generalized by including in it a\npotential that is invariant under the global transformation of the dilaton\nshift. In the (1 + 1)-dimensional case, a soliton is constructed, which turned\nout to be an axion-type kink (anti-kink) with a nontrivial distribution of the\ndilaton field. The solution is obtained for an arbitrary value of the\ndilaton-axion coupling constant, and its mass is found.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:48:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kechkin","Oleg V.",""]]}
{"id":"2308.08627","submitter":"Leia Barrowes","authors":"Bryan Helz, Leia Barrowes, Igor Jovanovic, Dean Price, Brendan\n  Kochunas, James D. Wells","title":"Nuclear Reactor Safeguarding with Neutrino Detection for MOX Loading\n  Verification","comments":"35 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph hep-ex hep-ph physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The resurgence of interest in nuclear power around the world highlights the\nimportance of effective methods to safeguard against nuclear proliferation.\nMany powerful safeguarding techniques have been developed and are currently\nemployed, but new approaches are needed to address proliferation challenges\nfrom emerging advanced reactor designs and fuel cycles. Building on prior work\nthat demonstrated monitoring of nuclear reactor operation using neutrino\ndetectors, we develop and present a simple quantitative statistical test\nsuitable for analysis of measured reactor neutrino data and demonstrate its\nefficacy in a semi-cooperative reactor monitoring scenario. In this approach, a\nmoderate-sized neutrino detector is placed near the reactor site to help\nmonitor possible MOX fuel diversion independent of inspection-based monitoring.\nWe take advantage of differing time-dependent neutrino count rates during the\noperating cycle of a reactor core to monitor any deviations of measurements\nfrom expectations given a declared fuel composition. For a five-ton idealized\ndetector placed 25m away from a hypothetical 3565 MWth reactor, the statistical\ntest is capable of detecting the diversion of ~80kg plutonium at the 95%\nconfidence level 90% of the time over a 540-day observation period.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:50:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Helz","Bryan",""],["Barrowes","Leia",""],["Jovanovic","Igor",""],["Price","Dean",""],["Kochunas","Brendan",""],["Wells","James D.",""]]}
{"id":"2308.08628","submitter":"Eva Portelance","authors":"Eva Portelance and Michael C. Frank and Dan Jurafsky","title":"Learning the meanings of function words from grounded language using a\n  visual question answering model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Interpreting a seemingly-simple function word like \"or\", \"behind\", or \"more\"\ncan require logical, numerical, and relational reasoning. How are such words\nlearned by children? Prior acquisition theories have often relied on positing a\nfoundation of innate knowledge. Yet recent neural-network based visual question\nanswering models apparently can learn to use function words as part of\nanswering questions about complex visual scenes. In this paper, we study what\nthese models learn about function words, in the hope of better understanding\nhow the meanings of these words can be learnt by both models and children. We\nshow that recurrent models trained on visually grounded language learn gradient\nsemantics for function words requiring spacial and numerical reasoning.\nFurthermore, we find that these models can learn the meanings of logical\nconnectives \"and\" and \"or\" without any prior knowledge of logical reasoning, as\nwell as early evidence that they can develop the ability to reason about\nalternative expressions when interpreting language. Finally, we show that word\nlearning difficulty is dependent on frequency in models' input. Our findings\noffer evidence that it is possible to learn the meanings of function words in\nvisually grounded context by using non-symbolic general statistical learning\nalgorithms, without any prior knowledge of linguistic meaning.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:53:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Portelance","Eva",""],["Frank","Michael C.",""],["Jurafsky","Dan",""]]}
{"id":"2308.08629","submitter":"Michal B\\'ilek","authors":"Michal B\\'ilek, Michael Hilker, Florent Renaud, Tom Richtler, Avinash\n  Chaturvedi, Srdjan Samurovi\\'c","title":"The galactic acceleration scale is imprinted on globular cluster systems\n  of early-type galaxies of most masses and on red and blue globular cluster\n  subpopulations","comments":"39 pages, ~15 pages main text, 33 figures, 12 tables. Accepted for\n  publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. Globular clusters carry information about the formation histories\nand gravitational fields of their host galaxies. B\\'ilek et al. (2019, BSR19\nhereafter) reported that the radial profiles of volume number density of GCs in\nGC systems (GCS) follow broken power laws, while the breaks occur approximately\nat the $a_0$ radii. These are the radii at which the gravitational fields of\nthe galaxies equal the galactic acceleration scale $a_0 = 1.2 \\times\n10^{-10}$ms$^{-2}$ known from the radial acceleration relation or the MOND\ntheory of modified dynamics.\n  Aims. Our main goals here are to explore whether the results of BSR19 hold\ntrue for galaxies of a wider mass range and for the red and blue GCs\nsub-populations.\n  Methods. We exploited catalogs of photometric GC candidates in the Fornax\ngalaxy cluster based on ground and space observations and a new catalog of\nspectroscopic GCs of NGC 1399, the central galaxy of the cluster. For every\ngalaxy, we obtained the parameters of the broken power law density by fitting\nthe on-sky distribution of the GC candidates, while allowing for a constant\ndensity of contaminants. The logarithmic stellar masses of our galaxy sample\nspan 8.0-11.4 $M_\\odot$.\n  Results. All investigated GCSs with a sufficient number of members show\nbroken power-law density profiles. This holds true for the total GC population\nand the blue and red subpopulations. The inner and outer slopes and the break\nradii agree well for the different GC populations. The break radii agree with\nthe $a_0$ radii typically within a factor of two for all GC color\nsubpopulations. The outer slopes correlate better with the $a_0$ radii than\nwith the galactic stellar masses. The break radii of NGC 1399 vary in azimuth,\nsuch that they are greater toward and against the neighboring galaxy NGC 1404.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:54:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["B\u00edlek","Michal",""],["Hilker","Michael",""],["Renaud","Florent",""],["Richtler","Tom",""],["Chaturvedi","Avinash",""],["Samurovi\u0107","Srdjan",""]]}
{"id":"2308.08630","submitter":"Lili Miao","authors":"Lili Miao, Vincent Larivi\\`ere, Feifei Wang, Yong-Yeol Ahn, Cassidy R.\n  Sugimoto","title":"Cooperation and interdependence in global science funding","comments":"34 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.SI q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Research and development investments are key to scientific and economic\ndevelopment and to the well-being of society. Because scientific research\ndemands significant resources, national scientific investment is a crucial\ndriver of scientific production. As scientific production becomes increasingly\nmultinational, it is critically important to study how nations' scientific\nactivities are funded both domestically and internationally. By tracing\nresearch grants acknowledged in scholarly publications, our study reveals a\nduopoly of China and the United States in the global funding landscape, with a\ncontrasting funding pattern; while China has surpassed the United States both\nin acknowledged domestic and international funding with its strong funding\nactivity for the Chinese institutions, the United States largely maintains its\nplace as the most important research partner for most countries. Our results\nalso highlight the precarity of low- and middle-income countries to global\nfunding disruptions. By revealing the complex interdependence and collaboration\nbetween countries in the global scientific enterprise, our study informs future\nstudies investigating the national and global scientific enterprise and how\nfunding leads to both productive cooperation and dependencies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:54:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Miao","Lili",""],["Larivi\u00e8re","Vincent",""],["Wang","Feifei",""],["Ahn","Yong-Yeol",""],["Sugimoto","Cassidy R.",""]]}
{"id":"2308.08631","submitter":"Idris Kempf","authors":"Idris Kempf and Paul J. Goulart and Stephen Duncan","title":"Control of Cross-Directional Systems using the Generalised Singular\n  Value Decomposition","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":"  Diamond Light Source produces synchrotron radiation by accelerating electrons\nto relativistic speeds. In order to maximise the intensity of the radiation,\nvibrations of the electron beam are attenuated by a multi-input multi-output\n(MIMO) control system actuating hundreds of magnets at kilohertz rates. For\nfuture accelerator configurations, in which two separate arrays of magnets with\ndifferent bandwidths are used in combination, standard accelerator control\ndesign methods based on the singular value decomposition (SVD) of the system\ngain matrix are not suitable. We therefore propose to use the generalised\nsingular value decomposition (GSVD) to decouple a two-array cross-directional\n(CD) system into sets of two-input single-output (TISO) and single-input\nsingle-output (SISO) systems. We demonstrate that the two-array decomposition\nis linked to a single-array system, which is used to accommodate\nill-conditioned systems and compensate for the non-orthogonality of the GSVD.\nThe GSVD-based design is implemented and validated through real-world\nexperiments at Diamond. Our approach provides a natural extension of\nsingle-array methods and has potential application in other CD systems,\nincluding paper making, steel rolling or battery manufacturing processes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:55:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kempf","Idris",""],["Goulart","Paul J.",""],["Duncan","Stephen",""]]}
{"id":"2308.08632","submitter":"Haodong Chen","authors":"Haodong Chen, Ming C. Leu, Md Moniruzzaman, Zhaozheng Yin, Solmaz\n  Hajmohammadi, Zhuoqing Chang","title":"Advancements in Repetitive Action Counting: Joint-Based PoseRAC Model\n  With Improved Performance","comments":"6 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Repetitive counting (RepCount) is critical in various applications, such as\nfitness tracking and rehabilitation. Previous methods have relied on the\nestimation of red-green-and-blue (RGB) frames and body pose landmarks to\nidentify the number of action repetitions, but these methods suffer from a\nnumber of issues, including the inability to stably handle changes in camera\nviewpoints, over-counting, under-counting, difficulty in distinguishing between\nsub-actions, inaccuracy in recognizing salient poses, etc. In this paper, based\non the work done by [1], we integrate joint angles with body pose landmarks to\naddress these challenges and achieve better results than the state-of-the-art\nRepCount methods, with a Mean Absolute Error (MAE) of 0.211 and an Off-By-One\n(OBO) counting accuracy of 0.599 on the RepCount data set [2]. Comprehensive\nexperimental results demonstrate the effectiveness and robustness of our\nmethod.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 16:54:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Haodong",""],["Leu","Ming C.",""],["Moniruzzaman","Md",""],["Yin","Zhaozheng",""],["Hajmohammadi","Solmaz",""],["Chang","Zhuoqing",""]]}
{"id":"2308.08633","submitter":"Peter Lemmens","authors":"V. P. Gnezdilov, A. Yu. Glamazda, P. Lemmens, K. Kudo, and M. Nohara","title":"Phase separation and phase transitions in undoped and Rh3+ doped iron\n  pnictide CaFe2As2: a Raman scattering study","comments":"18 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":"  Iron-pnictides Ca(Fe1-xRhx)2As2 (x = 0, 0.035, and 0.19) were studied across\nthe tetragonal-orthorhombic and uncollapsed to collapsed tetragonal phase\ntransitions using Raman spectroscopy. The effect of the phase separation was\nobserved in the high-temperature phase for the first time. Two phases with the\nlow-spin and high-spin states of the Fe2+ ions coexist in the undoped (x = 0)\nand doped (x = 0.035) samples at ambient conditions. These two phases are\npresent on a larger length scale and they are not limited to the local\ndistortions. Both phases in the undoped sample successfully undergo\ntetra-to-ortho phase transitions approximately at the same temperature T0 = 160\nK. In doped samples, a cascade of phase transitions is observed at temperatures\nT* = 100 K and Tc = 72 K with cooling for the first time. A complex type of the\nre-entrant magnetic structure is realized in the x = 0.035 sample at\ntemperatures below Tc, which is distinct from the usual orthorhombic twofold\none. The overdoped sample (x = 0.19) also shows phase separation at\ntemperatures 7 - 295 K in Raman spectra similar to these of the remnant phase.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:08:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gnezdilov","V. P.",""],["Glamazda","A. Yu.",""],["Lemmens","P.",""],["Kudo","K.",""],["Nohara","M.",""]]}
{"id":"2308.08634","submitter":"Haokun Chen","authors":"Haokun Chen, Denis Krompass, Jindong Gu, Volker Tresp","title":"FedPop: Federated Population-based Hyperparameter Tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated Learning (FL) is a distributed machine learning (ML) paradigm, in\nwhich multiple clients collaboratively train ML models without centralizing\ntheir local data. Similar to conventional ML pipelines, the client local\noptimization and server aggregation procedure in FL are sensitive to the\nhyperparameter (HP) selection. Despite extensive research on tuning HPs for\ncentralized ML, these methods yield suboptimal results when employed in FL.\nThis is mainly because their \"training-after-tuning\" framework is unsuitable\nfor FL with limited client computation power. While some approaches have been\nproposed for HP-Tuning in FL, they are limited to the HPs for client local\nupdates. In this work, we propose a novel HP-tuning algorithm, called Federated\nPopulation-based Hyperparameter Tuning (FedPop), to address this vital yet\nchallenging problem. FedPop employs population-based evolutionary algorithms to\noptimize the HPs, which accommodates various HP types at both client and server\nsides. Compared with prior tuning methods, FedPop employs an online\n\"tuning-while-training\" framework, offering computational efficiency and\nenabling the exploration of a broader HP search space. Our empirical validation\non the common FL benchmarks and complex real-world FL datasets demonstrates the\neffectiveness of the proposed method, which substantially outperforms the\nconcurrent state-of-the-art HP tuning methods for FL.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:14:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Haokun",""],["Krompass","Denis",""],["Gu","Jindong",""],["Tresp","Volker",""]]}
{"id":"2308.08635","submitter":"Keith Promislow","authors":"Keith Promislow and Abba Ramadan","title":"Curvature and Chaos in the Defocusing Parameteric Nonlinear Schrodinger\n  System","comments":"15 pages and 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP nlin.PS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The parametric nonlinear Schrodinger equation models a variety of\nparametrically forced and damped dispersive waves. For the defocusing regime,\nwe derive a normal velocity for the evolution of curved dark-soliton fronts\nthat represent a $\\pi$-phase shift across a thin interface. We establish that\ndepending upon the strength of parametric term the normal velocity evolution\ncan transition from a curvature driven flow to motion against curvature\nregularized by surface diffusion of curvature. In the former case interfacial\nlength shrinks, while in the later the interface length generically grows until\nself-intersection followed by a transition to chaotic motion.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:17:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Promislow","Keith",""],["Ramadan","Abba",""]]}
{"id":"2308.08636","submitter":"Martin Feinberg","authors":"Martin Feinberg and Richard B. Lavine","title":"Entropy and Thermodynamic Temperature in Nonequilibrium Classical\n  Thermodynamics as Immediate Consequences of the Hahn-Banach Theorem: I.\n  Existence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.FA math.MP physics.chem-ph physics.class-ph q-bio.MN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Kelvin-Planck statement of the Second Law of Thermodynamics is a\nstricture on the nature of heat receipt by any body suffering a cyclic process.\nIt makes no mention of temperature or of entropy. Beginning with a\nKelvin-Planck statement of the Second Law, we show that entropy and temperature\n-- in particular, existence of functions that relate the local specific entropy\nand thermodynamic temperature to the local state in a material body -- emerge\nimmediately and simultaneously as consequences of the Hahn-Banach Theorem.\nExistence of such functions of state requires no stipulation that their domains\nbe restricted to equilibrium states. Further properties, including uniqueness,\nare addressed in a companion paper.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:17:35 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 19:17:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Feinberg","Martin",""],["Lavine","Richard B.",""]]}
{"id":"2308.08637","submitter":"Kausik Majumdar","authors":"Garima Gupta and Kausik Majumdar","title":"Polarized and narrow excitonic emission from graphene-capped monolayer\n  WS$_2$ through resonant phonon relaxation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The broadening and polarization of excitonic luminescence in monolayer TMDs\nlargely suffer from inhomogeneity and temperature - an unresolved problem to\ndate. In this work, through few-layer-graphene encapsulation of monolayer\nWS$_2$, we reduce the inter-excitonic energy separation, which then can have a\nnarrow resonance with a specific phonon mode of our choice. The resulting\nsingle-step exciton relaxation with the resonating phonon mode significantly\nsuppresses the inhomogeneous broadening, allowing us to achieve the narrowest\nexciton linewidth of 1.06 meV (which translates to 0.19 meV after deconvolution\nwith the excitation laser linewidth). The single-phonon resonance helps to\nachieve a high quantum efficiency despite graphene encapsulation. The technique\nis powerful in tuning the exciton polarization during relaxation by choosing a\nspecific resonating phonon mode. For example, the valley coherence\n(polarization) improves from $\\sim$68% ($\\sim$40%) to $\\sim$90% ($\\sim$75%) on\nresonance with 2$A_1$' and $A_1$' modes respectively. We further demonstrate a\nstrong polarization reversal on resonance with a chiral phonon mode.\nStrikingly, the above features remain robust against temperature (up to 200 K)\nand sample age (few months in ambient condition). The findings will lead to\nclean excitonic measurements without requiring cryogenic cooling.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:19:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gupta","Garima",""],["Majumdar","Kausik",""]]}
{"id":"2308.08638","submitter":"Anubhav Jain","authors":"Anubhav Jain, Nasir Memon, Julian Togelius","title":"Fair GANs through model rebalancing with synthetic data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep generative models require large amounts of training data. This often\nposes a problem as the collection of datasets can be expensive and difficult,\nin particular datasets that are representative of the appropriate underlying\ndistribution (e.g. demographic). This introduces biases in datasets which are\nfurther propagated in the models. We present an approach to mitigate biases in\nan existing generative adversarial network by rebalancing the model\ndistribution. We do so by generating balanced data from an existing unbalanced\ndeep generative model using latent space exploration and using this data to\ntrain a balanced generative model. Further, we propose a bias mitigation loss\nfunction that shows improvements in the fairness metric even when trained with\nunbalanced datasets. We show results for the Stylegan2 models while training on\nthe FFHQ dataset for racial fairness and see that the proposed approach\nimproves on the fairness metric by almost 5 times, whilst maintaining image\nquality. We further validate our approach by applying it to an imbalanced\nCifar-10 dataset. Lastly, we argue that the traditionally used image quality\nmetrics such as Frechet inception distance (FID) are unsuitable for bias\nmitigation problems.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:20:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jain","Anubhav",""],["Memon","Nasir",""],["Togelius","Julian",""]]}
{"id":"2308.08639","submitter":"Yu-Meng Xu","authors":"Yumeng Xu, Shubhanshu Tiwari, Marco Drago","title":"PycWB: A User-friendly, Modular, and Python-based Framework for\n  Gravitational Wave Unmodelled Search","comments":"16 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmodelled searches and reconstruction is a critical aspect of gravitational\nwave data analysis, requiring sophisticated software tools for robust data\nanalysis. This paper introduces PycWB, a user-friendly and modular Python-based\nframework developed to enhance such analyses based on the widely used\nunmodelled search and reconstruction algorithm Coherent Wave Burst (cWB). The\nmain features include a transition from C++ scripts to YAML format for\nuser-defined parameters, improved modularity, and a shift from complex\nclass-encapsulated algorithms to compartmentalized modules. The pycWB\narchitecture facilitates efficient dependency management, better\nerror-checking, and the use of parallel computation for performance\nenhancement. Moreover, the use of Python harnesses its rich library of\npackages, facilitating post-production analysis and visualization. The PycWB\nframework is designed to improve the user experience and accelerate the\ndevelopment of unmodelled gravitational wave analysis.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:20:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Yumeng",""],["Tiwari","Shubhanshu",""],["Drago","Marco",""]]}
{"id":"2308.08640","submitter":"Andrea Mazzullo","authors":"Alessandro Artale, Andrea Mazzullo","title":"Non-Rigid Designators in Epistemic and Temporal Free Description Logics\n  (Extended Version)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Definite descriptions, such as 'the smallest planet in the Solar System',\nhave been recently recognised as semantically transparent devices for object\nidentification in knowledge representation formalisms. Along with individual\nnames, they have been introduced also in the context of description logic\nlanguages, enriching the expressivity of standard nominal constructors.\nMoreover, in the first-order modal logic literature, definite descriptions have\nbeen widely investigated for their non-rigid behaviour, which allows them to\ndenote different objects at different states. In this direction, we introduce\nepistemic and temporal extensions of standard description logics, with nominals\nand the universal role, additionally equipped with definite descriptions\nconstructors. Regarding names and descriptions, in these languages we allow\nfor: possible lack of denotation, ensured by partial models, coming from free\nlogic semantics as a generalisation of the classical ones; and non-rigid\ndesignation features, obtained by assigning to terms distinct values across\nstates, as opposed to the standard rigidity condition on individual\nexpressions. In the absence of the rigid designator assumption, we show that\nthe satisfiability problem for epistemic free description logics is\nNExpTime-complete, while satisfiability for temporal free description logics\nover linear time structures is undecidable.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:27:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Artale","Alessandro",""],["Mazzullo","Andrea",""]]}
{"id":"2308.08641","submitter":"Shaojie Tang","authors":"Shaojie Tang and Jing Yuan","title":"Non-monotone Sequential Submodular Maximization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study a fundamental problem in submodular optimization,\nwhich is called sequential submodular maximization. Specifically, we aim to\nselect and rank a group of $k$ items from a ground set $V$ such that the\nweighted summation of $k$ (possibly non-monotone) submodular functions $f_1,\n\\cdots ,f_k: 2^V \\rightarrow \\mathbb{R}^+$ is maximized, here each function\n$f_j$ takes the first $j$ items from this sequence as input. The existing\nresearch on sequential submodular maximization has predominantly concentrated\non the monotone setting, assuming that the submodular functions are\nnon-decreasing. However, in various real-world scenarios, like diversity-aware\nrecommendation systems, adding items to an existing set might negatively impact\nthe overall utility. In response, this paper pioneers the examination of the\naforementioned problem with non-monotone submodular functions and offers\neffective solutions for both flexible and fixed length constraints, as well as\na special case with identical utility functions. The empirical evaluations\nfurther validate the effectiveness of our proposed algorithms in the domain of\nvideo recommendations. The results of this research have implications in\nvarious fields, including recommendation systems and assortment optimization,\nwhere the ordering of items significantly impacts the overall value obtained.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:32:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tang","Shaojie",""],["Yuan","Jing",""]]}
{"id":"2308.08642","submitter":"Soetkin Janssens","authors":"S. Janssens, T. Shenar, N. Degenaar, J. Bodensteiner, H. Sana, J.\n  Audenaert, A. J. Frost","title":"MWC 656 is unlikely to contain a black hole","comments":"6 pages, 2 + 6 figures, 3 + 1 tables, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context. MWC 656 was reported as the first known Be star with a black-hole\n(BH) companion in a 60 d period. The mass of the proposed BH companion is\nestimated to be between 4 - 7 MSun. This estimate is based on radial velocity\n(RV) measurements derived from the Fe ii 4583 emission line of the Be star disc\nand from the He ii 4686 emission line, assumed to be formed in a disc around\nthe putative BH. Aims. Using new high-resolution spectroscopic data, we\ninvestigate whether MWC 656 truly contains a BH. Methods. We used the\ncross-correlation method to calculate the RVs of both the Be star and the He ii\n4686 emission line and we derive a new orbital solution. We also performed\ndisentangling to look for the spectral signature of a companion. Results. We\nderive an orbital period of 59.028 +- 0.011 d and a mass ratio q = M_Heii/M_Be\n= 0.12 +- 0.03, much lower than the previously reported q = 0.41 +- 0.07.\nAdopting a mass of the Be star of M_Be = 7.8 +- 2.0MSun, the companion has a\nmass of 0.94 +- 0.34MSun. For the upper limit of M_Be = 16MSun and q = 0.15,\nthe companion has a mass 2.4MSun. Performing disentangling on mock spectra\nshows that the spectral signature of a non-degenerate stellar companion with\nsuch a low mass cannot be retrieved using our data. Conclusions. Our\nmeasurements do not support the presence of a BH companion in MWC 656. The\nderived upper limit on the mass of the companion rather indicates that it is a\nneutron star, a white dwarf, or a hot helium star. Far-UV data will help to\nreject or confirm a hot helium-star companion.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:32:30 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:22:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Janssens","S.",""],["Shenar","T.",""],["Degenaar","N.",""],["Bodensteiner","J.",""],["Sana","H.",""],["Audenaert","J.",""],["Frost","A. J.",""]]}
{"id":"2308.08643","submitter":"Jiaqi Wang","authors":"Jiaqi Wang, Xingyi Yang, Suhan Cui, Liwei Che, Lingjuan Lyu, Dongkuan\n  Xu, Fenglong Ma","title":"Towards Personalized Federated Learning via Heterogeneous Model\n  Reassembly","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper focuses on addressing the practical yet challenging problem of\nmodel heterogeneity in federated learning, where clients possess models with\ndifferent network structures. To track this problem, we propose a novel\nframework called pFedHR, which leverages heterogeneous model reassembly to\nachieve personalized federated learning. In particular, we approach the problem\nof heterogeneous model personalization as a model-matching optimization task on\nthe server side. Moreover, pFedHR automatically and dynamically generates\ninformative and diverse personalized candidates with minimal human\nintervention. Furthermore, our proposed heterogeneous model reassembly\ntechnique mitigates the adverse impact introduced by using public data with\ndifferent distributions from the client data to a certain extent. Experimental\nresults demonstrate that pFedHR outperforms baselines on three datasets under\nboth IID and Non-IID settings. Additionally, pFedHR effectively reduces the\nadverse impact of using different public data and dynamically generates diverse\npersonalized models in an automated manner.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:36:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Jiaqi",""],["Yang","Xingyi",""],["Cui","Suhan",""],["Che","Liwei",""],["Lyu","Lingjuan",""],["Xu","Dongkuan",""],["Ma","Fenglong",""]]}
{"id":"2308.08644","submitter":"Julien Fageot","authors":"Julien Fageot, Sadegh Farhadkhani, L\\^e Nguy\\^en Hoang, Oscar\n  Villemaud","title":"Generalized Bradley-Terry Models for Score Estimation from Paired\n  Comparisons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many applications, e.g. in content recommendation, sports, or recruitment,\nleverage the comparisons of alternatives to score those alternatives. The\nclassical Bradley-Terry model and its variants have been widely used to do so.\nThe historical model considers binary comparisons (victory or defeat) between\nalternatives, while more recent developments allow finer comparisons to be\ntaken into account. In this article, we introduce a probabilistic model\nencompassing a broad variety of paired comparisons that can take discrete or\ncontinuous values. We do so by considering a well-behaved subset of the\nexponential family, which we call the family of generalized Bradley-Terry (GBT)\nmodels, as it includes the classical Bradley-Terry model and many of its\nvariants. Remarkably, we prove that all GBT models are guaranteed to yield a\nstrictly convex negative log-likelihood. Moreover, assuming a Gaussian prior on\nalternatives' scores, we prove that the maximum a posteriori (MAP) of GBT\nmodels, whose existence, uniqueness and fast computation are thus guaranteed,\nvaries monotonically with respect to comparisons (the more A beats B, the\nbetter the score of A) and is Lipschitz-resilient with respect to each new\ncomparison (a single new comparison can only have a bounded effect on all the\nestimated scores). These desirable properties make GBT models appealing for\npractical use. We illustrate some features of GBT models on simulations.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:40:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fageot","Julien",""],["Farhadkhani","Sadegh",""],["Hoang","L\u00ea Nguy\u00ean",""],["Villemaud","Oscar",""]]}
{"id":"2308.08645","submitter":"Ibtissam Issa","authors":"Mohammad Akil, Genni Fragnelli, Ibtissam Issa","title":"Stability for degenerate wave equations with drift under simultaneous\n  degenerate damping","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 study the stability of two different problems. The first one\nis a one-dimensional degenerate wave equation with degenerate damping,\nincorporating a drift term and a leading operator in non-divergence form. In\nthe second problem we consider a system that couples degenerate and\nnon-degenerate wave equations, connected through transmission, and subject to a\nsingle dissipation law at the boundary of the non-degenerate equation. In both\nscenarios, we derive exponential stability results.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:44:49 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 21:22:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Akil","Mohammad",""],["Fragnelli","Genni",""],["Issa","Ibtissam",""]]}
{"id":"2308.08646","submitter":"Xiucai Ding","authors":"Xiucai Ding and Zhenggang Wang","title":"Global and local CLTs for linear spectral statistics of general sample\n  covariance matrices when the dimension is much larger than the sample size\n  with applications","comments":"Some typos are corrected and some proofs are simplified","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, under the assumption that the dimension is much larger than\nthe sample size, i.e., $p \\asymp n^{\\alpha}, \\alpha>1,$ we consider the\n(unnormalized) sample covariance matrices $Q = \\Sigma^{1/2} XX^*\\Sigma^{1/2}$,\nwhere $X=(x_{ij})$ is a $p \\times n$ random matrix with centered i.i.d entries\nwhose variances are $(pn)^{-1/2}$, and $\\Sigma$ is the deterministic population\ncovariance matrix. We establish two classes of central limit theorems (CLTs)\nfor the linear spectral statistics (LSS) for $Q,$ the global CLTs on the\nmacroscopic scales and the local CLTs on the mesoscopic scales. We prove that\nthe LSS converge to some Gaussian processes whose mean and covariance functions\ndepending on $\\Sigma$, the ratio $p/n$ and the test functions, can be\nidentified explicitly on both macroscopic and mesoscopic scales. We also show\nthat even though the global CLTs depend on the fourth cumulant of $x_{ij},$ the\nlocal CLTs do not. Based on these results, we propose two classes of statistics\nfor testing the structures of $\\Sigma,$ the global statistics and the local\nstatistics, and analyze their superior power under general local alternatives.\nTo our best knowledge, the local LSS testing statistics which do not rely on\nthe fourth moment of $x_{ij},$ is used for the first time in hypothesis testing\nwhile the literature mostly uses the global statistics and requires the prior\nknowledge of the fourth cumulant. Numerical simulations also confirm the\naccuracy and powerfulness of our proposed statistics and illustrate better\nperformance compared to the existing methods in the literature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:45:19 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:08:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ding","Xiucai",""],["Wang","Zhenggang",""]]}
{"id":"2308.08647","submitter":"Roman Khakimov","authors":"R. V. Khakimov, G. Yu. Prokhorov, O. V. Teryaev, V. I. Zakharov","title":"Unruh effect in curved space-time and hydrodynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We consider an accelerated relativistic fluid in four-dimensional (anti-)de\nSitter space-time. Analyzing only hydrodynamic equations, we construct the\nequilibrium stress-energy tensor. We confirm that (A)dS vacuum corresponds to a\nthermal bath in the accelerated frame with a temperature, depending on the\nacceleration in a flat higher-dimensional (namely, five-dimensional) space, in\nwhich curved space-times are embedded. We develop the duality between\nhydrodynamics and gravity finding a direct relationship between the transport\ncoefficients in flat and curved space-times.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:46:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khakimov","R. V.",""],["Prokhorov","G. Yu.",""],["Teryaev","O. V.",""],["Zakharov","V. I.",""]]}
{"id":"2308.08648","submitter":"Qian Xu","authors":"Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin\n  Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasic, Mikhail D. Lukin,\n  Liang Jiang, and Hengyun Zhou","title":"Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable\n  Atom Arrays","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum low-density parity-check (qLDPC) codes can achieve high encoding\nrates and good code distance scaling, providing a promising route to\nlow-overhead fault-tolerant quantum computing. However, the long-range\nconnectivity required to implement such codes makes their physical realization\nchallenging. Here, we propose a hardware-efficient scheme to perform\nfault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable\natom arrays, directly compatible with recently demonstrated experimental\ncapabilities. Our approach utilizes the product structure inherent in many\nqLDPC codes to implement the non-local syndrome extraction circuit via atom\nrearrangement, resulting in effectively constant overhead in practically\nrelevant regimes. We prove the fault tolerance of these protocols, perform\ncircuit-level simulations of memory and logical operations with these codes,\nand find that our qLDPC-based architecture starts to outperform the surface\ncode with as few as several hundred physical qubits at a realistic physical\nerror rate of $10^{-3}$. We further find that less than 3000 physical qubits\nare sufficient to obtain over an order of magnitude qubit savings compared to\nthe surface code, and quantum algorithms involving thousands of logical qubits\ncan be performed using less than $10^5$ physical qubits. Our work paves the way\nfor explorations of low-overhead quantum computing with qLDPC codes at a\npractical scale, based on current experimental technologies.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:47:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Qian",""],["Ataides","J. Pablo Bonilla",""],["Pattison","Christopher A.",""],["Raveendran","Nithin",""],["Bluvstein","Dolev",""],["Wurtz","Jonathan",""],["Vasic","Bane",""],["Lukin","Mikhail D.",""],["Jiang","Liang",""],["Zhou","Hengyun",""]]}
{"id":"2308.08649","submitter":"Bin Lei","authors":"Bin Lei, Sheng Lin, Pei-Hung Lin, Chunhua Liao, Caiwen Ding","title":"Towards Zero Memory Footprint Spiking Neural Network Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biologically-inspired Spiking Neural Networks (SNNs), processing information\nusing discrete-time events known as spikes rather than continuous values, have\ngarnered significant attention due to their hardware-friendly and\nenergy-efficient characteristics. However, the training of SNNs necessitates a\nconsiderably large memory footprint, given the additional storage requirements\nfor spikes or events, leading to a complex structure and dynamic setup. In this\npaper, to address memory constraint in SNN training, we introduce an innovative\nframework, characterized by a remarkably low memory footprint. We \\textbf{(i)}\ndesign a reversible SNN node that retains a high level of accuracy. Our design\nis able to achieve a $\\mathbf{58.65\\times}$ reduction in memory usage compared\nto the current SNN node. We \\textbf{(ii)} propose a unique algorithm to\nstreamline the backpropagation process of our reversible SNN node. This\nsignificantly trims the backward Floating Point Operations Per Second (FLOPs),\nthereby accelerating the training process in comparison to current reversible\nlayer backpropagation method. By using our algorithm, the training time is able\nto be curtailed by $\\mathbf{23.8\\%}$ relative to existing reversible layer\narchitectures.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:49:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lei","Bin",""],["Lin","Sheng",""],["Lin","Pei-Hung",""],["Liao","Chunhua",""],["Ding","Caiwen",""]]}
{"id":"2308.08650","submitter":"Andrea Marchini","authors":"William Black, Ercument Ilhan, Andrea Marchini and Vilda Markeviciute","title":"AdaptEx: A Self-Service Contextual Bandit Platform","comments":null,"journal-ref":null,"doi":"10.1145/3604915.3608870","report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents AdaptEx, a self-service contextual bandit platform widely\nused at Expedia Group, that leverages multi-armed bandit algorithms to\npersonalize user experiences at scale. AdaptEx considers the unique context of\neach visitor to select the optimal variants and learns quickly from every\ninteraction they make. It offers a powerful solution to improve user\nexperiences while minimizing the costs and time associated with traditional\ntesting methods. The platform unlocks the ability to iterate towards optimal\nproduct solutions quickly, even in ever-changing content and continuous \"cold\nstart\" situations gracefully.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:32:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Black","William",""],["Ilhan","Ercument",""],["Marchini","Andrea",""],["Markeviciute","Vilda",""]]}
{"id":"2308.08651","submitter":"William Horowitz","authors":"W. A. Horowitz and J. F. Du Plessis","title":"Finite System Size Correction to the Effective Coupling in $\\phi^4$\n  Scattering","comments":"34 pages, 24 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":"  We compute and explore numerically the finite system size correction to NLO\n$2\\to2$ scattering in massive scalar $\\phi^4$ theory. The derivation uses\n\"denominator regularization\" (instead of the usual dimensional regularization)\non a spacetime with spatial directions compactified to a torus, with\ncharacteristic lengths not necessarily of equal size. We determine a useful\nanalytic continuation of the generalized Epstein zeta function to isolate the\nusual UV divergence. Self-consistently, the renormalized finite system size\ncorrection reduces to zero as the system size goes to infinity and, further,\nsatisfies the optical theorem. One of our checks of unitarity leads to a\ngeneralization of a number theoretic result from Hardy and Ramanujan. Precise\nnumerical exploration of the finite system size correction to the amplitude and\ncoupling when two spatial dimensions are finite requires the exploitation of\nthe analytic structure of the finite system size result via a dispersion\nrelation. We find that the finite system size scattering amplitude exhibits\n\"geometric\" bound states. Even away from these bound states, the finite system\nsize correction to the effective coupling can be large.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:58:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Horowitz","W. A.",""],["Plessis","J. F. Du",""]]}
{"id":"2308.08652","submitter":"Mohammad Javad-Kalbasi","authors":"Mohammad Javad-Kalbasi, Mohammed S Al-Abiad, Shahrokh Valaee","title":"Energy Efficient Communications in RIS-assisted UAV Networks Based on\n  Genetic Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a solution for energy-efficient communication in\nreconfigurable intelligent surface (RIS)-assisted unmanned aerial vehicle (UAV)\nnetworks. The limited battery life of UAVs is a major concern for their\nsustainable operation, and RIS has emerged as a promising solution to reducing\nthe energy consumption of communication systems. The paper formulates the\nproblem of maximizing the energy efficiency of the network as a mixed integer\nnon-linear program, in which UAV placement, UAV beamforming, On-Off strategy of\nRIS elements, and phase shift of RIS elements are optimized. The proposed\nsolution utilizes the block coordinate descent approach and a combination of\ncontinuous and binary genetic algorithms. Moreover, for optimizing the UAV\nplacement, Adam optimizer is used. The simulation results show that the\nproposed solution outperforms the existing literature. Specifically, we\ncompared the proposed method with the successive convex approximation (SCA)\napproach for optimizing the phase shift of RIS elements.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:58:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Javad-Kalbasi","Mohammad",""],["Al-Abiad","Mohammed S",""],["Valaee","Shahrokh",""]]}
{"id":"2308.08653","submitter":"Michael G. Rawson","authors":"Michael G. Rawson, Timothy Doster, Tegan Emerson","title":"Reproducing Kernel Hilbert Space Pruning for Sparse Hyperspectral\n  Abundance Prediction","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":"  Hyperspectral measurements from long range sensors can give a detailed\npicture of the items, materials, and chemicals in a scene but analysis can be\ndifficult, slow, and expensive due to high spatial and spectral resolutions of\nstate-of-the-art sensors. As such, sparsity is important to enable the future\nof spectral compression and analytics. It has been observed that environmental\nand atmospheric effects, including scattering, can produce nonlinear effects\nposing challenges for existing source separation and compression methods. We\npresent a novel transformation into Hilbert spaces for pruning and constructing\nsparse representations via non-negative least squares minimization. Then we\nintroduce max likelihood compression vectors to decrease information loss. Our\napproach is benchmarked against standard pruning and least squares as well as\ndeep learning methods. Our methods are evaluated in terms of overall spectral\nreconstruction error and compression rate using real and synthetic data. We\nfind that pruning least squares methods converge quickly unlike matching\npursuit methods. We find that Hilbert space pruning can reduce error by as much\nas 40% of the error of standard pruning and also outperform neural network\nautoencoders.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 19:59:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rawson","Michael G.",""],["Doster","Timothy",""],["Emerson","Tegan",""]]}
{"id":"2308.08654","submitter":"Amita Giri","authors":"Sidharth Pancholi and Amita Giri","title":"Advancing Brain-Computer Interface System Performance in Hand Trajectory\n  Estimation with NeuroKinect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Brain-computer interface (BCI) technology enables direct communication\nbetween the brain and external devices, allowing individuals to control their\nenvironment using brain signals. However, existing BCI approaches face three\ncritical challenges that hinder their practicality and effectiveness: a)\ntime-consuming preprocessing algorithms, b) inappropriate loss function\nutilization, and c) less intuitive hyperparameter settings. To address these\nlimitations, we present \\textit{NeuroKinect}, an innovative deep-learning model\nfor accurate reconstruction of hand kinematics using electroencephalography\n(EEG) signals. \\textit{NeuroKinect} model is trained on the Grasp and Lift\n(GAL) tasks data with minimal preprocessing pipelines, subsequently improving\nthe computational efficiency. A notable improvement introduced by\n\\textit{NeuroKinect} is the utilization of a novel loss function, denoted as\n$\\mathcal{L}_{\\text{Stat}}$. This loss function addresses the discrepancy\nbetween correlation and mean square error in hand kinematics prediction.\nFurthermore, our study emphasizes the scientific intuition behind parameter\nselection to enhance accuracy. We analyze the spatial and temporal dynamics of\nthe motor movement task by employing event-related potential and brain source\nlocalization (BSL) results. This approach provides valuable insights into the\noptimal parameter selection, improving the overall performance and accuracy of\nthe \\textit{NeuroKinect} model. Our model demonstrates strong correlations\nbetween predicted and actual hand movements, with mean Pearson correlation\ncoefficients of 0.92 ($\\pm$0.015), 0.93 ($\\pm$0.019), and 0.83 ($\\pm$0.018) for\nthe X, Y, and Z dimensions. The precision of \\textit{NeuroKinect} is evidenced\nby low mean squared errors (MSE) of 0.016 ($\\pm$0.001), 0.015 ($\\pm$0.002), and\n0.017 ($\\pm$0.005) for the X, Y, and Z dimensions, respectively.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:04:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pancholi","Sidharth",""],["Giri","Amita",""]]}
{"id":"2308.08655","submitter":"Faisal Nissar Malik","authors":"Faisal Nissar Malik, James Ricles, Masoud Yari, Malik Arsala Nissar","title":"Physics Informed Recurrent Neural Networks for Seismic Response\n  Evaluation of Nonlinear Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dynamic response evaluation in structural engineering is the process of\ndetermining the response of a structure, such as member forces, node\ndisplacements, etc when subjected to dynamic loads such as earthquakes, wind,\nor impact. This is an important aspect of structural analysis, as it enables\nengineers to assess structural performance under extreme loading conditions and\nmake informed decisions about the design and safety of the structure.\nConventional methods for dynamic response evaluation involve numerical\nsimulations using finite element analysis (FEA), where the structure is modeled\nusing finite elements, and the equations of motion are solved numerically.\nAlthough effective, this approach can be computationally intensive and may not\nbe suitable for real-time applications. To address these limitations, recent\nadvancements in machine learning, specifically artificial neural networks, have\nbeen applied to dynamic response evaluation in structural engineering. These\ntechniques leverage large data sets and sophisticated algorithms to learn the\ncomplex relationship between inputs and outputs, making them ideal for such\nproblems. In this paper, a novel approach is proposed for evaluating the\ndynamic response of multi-degree-of-freedom (MDOF) systems using\nphysics-informed recurrent neural networks. The focus of this paper is to\nevaluate the seismic (earthquake) response of nonlinear structures. The\npredicted response will be compared to state-of-the-art methods such as FEA to\nassess the efficacy of the physics-informed RNN model.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:06:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Malik","Faisal Nissar",""],["Ricles","James",""],["Yari","Masoud",""],["Nissar","Malik Arsala",""]]}
{"id":"2308.08656","submitter":"Keziah Naggita Ms","authors":"Keziah Naggita, Julienne LaChance, Alice Xiang","title":"Flickr Africa: Examining Geo-Diversity in Large-Scale, Human-Centric\n  Visual Data","comments":"35 pages, AI, Ethics, and Society Conference (AIES'23)","journal-ref":null,"doi":"10.1145/3600211.3604659","report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biases in large-scale image datasets are known to influence the performance\nof computer vision models as a function of geographic context. To investigate\nthe limitations of standard Internet data collection methods in low- and\nmiddle-income countries, we analyze human-centric image geo-diversity on a\nmassive scale using geotagged Flickr images associated with each nation in\nAfrica. We report the quantity and content of available data with comparisons\nto population-matched nations in Europe as well as the distribution of data\naccording to fine-grained intra-national wealth estimates. Temporal analyses\nare performed at two-year intervals to expose emerging data trends.\nFurthermore, we present findings for an ``othering'' phenomenon as evidenced by\na substantial number of images from Africa being taken by non-local\nphotographers. The results of our study suggest that further work is required\nto capture image data representative of African people and their environments\nand, ultimately, to improve the applicability of computer vision models in a\nglobal context.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:12:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Naggita","Keziah",""],["LaChance","Julienne",""],["Xiang","Alice",""]]}
{"id":"2308.08657","submitter":"Kevin Mitchell","authors":"Kevin A. Mitchell, Md Mainul Hasan Sabbir, Kevin Geumhan, Spencer A.\n  Smith, Brandon Klein, Daniel A. Beller","title":"Maximally mixing active nematics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Active nematics are an important new paradigm in soft condensed matter\nsystems. They consist of rod-like components with an internal driving force\npushing them out of equilibrium. The resulting fluid motion exhibits chaotic\nadvection, in which a small patch of fluid is stretched exponentially in\nlength. Using simulation, this Letter shows that this system can exhibit stable\nperiodic motion when sufficiently confined to a square with periodic boundary\nconditions. Moreover, employing tools from braid theory, we show that this\nmotion is maximally mixing, in that it optimizes the (dimensionless)\n``topological entropy'' -- the exponential stretching rate of a material line\nadvected by the fluid. That is, this periodic motion of the defects,\ncounterintuitively, produces more chaotic mixing than chaotic motion of the\ndefects. We also explore the stability of the periodic state. Importantly, we\nshow how to stabilize this orbit into a larger periodic tiling, a critical\nnecessity for it to be seen in future experiments.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:12:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mitchell","Kevin A.",""],["Sabbir","Md Mainul Hasan",""],["Geumhan","Kevin",""],["Smith","Spencer A.",""],["Klein","Brandon",""],["Beller","Daniel A.",""]]}
{"id":"2308.08658","submitter":"Arindam Kumar Paul","authors":"Arindam Kumar Paul, Md Maruf Hasan, Md. Delwar Hosen","title":"A New Data-Driven Method to Identify Violent Facial Expression","comments":"Submitted to the 1st International Conference on Artificial\n  Intelligence, Advanced Materials, and Mechatronics Systems : Submission\n  Number:230)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Human Facial Expressions plays an important role in identifying human actions\nor intention. Facial expressions can represent any specific action of any\nperson and the pattern of violent behavior of any person strongly depends on\nthe geographic region. Here we have designed an automated system by using a\nConvolutional Neural Network which can detect whether a person has any\nintention to commit any crime or not. Here we proposed a new method that can\nidentify criminal intentions or violent behavior of any person before executing\ncrimes more efficiently by using very little data on facial expressions before\nexecuting a crime or any violent tasks. Instead of using image features which\nis a time-consuming and faulty method we used an automated feature selector\nConvolutional Neural Network model which can capture exact facial expressions\nfor training and then can predict that target facial expressions more\naccurately. Here we used only the facial data of a specific geographic region\nwhich can represent the violent and before-crime before-crime facial patterns\nof the people of the whole region.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:12:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Paul","Arindam Kumar",""],["Hasan","Md Maruf",""],["Hosen","Md. Delwar",""]]}
{"id":"2308.08659","submitter":"Theodore Kareta","authors":"Theodore Kareta (Lowell Observatory) and Vishnu Reddy (Lunar and\n  Planetary Laboratory, University of Arizona)","title":"Nuclear and Orbital Characterization of the Transition Object (4015)\n  107P/Wilson-Harrington","comments":"22 pages, 5 figures, accepted for publication in the AAS's Planetary\n  Science Journal (PSJ)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Comet 107P/Wilson-Harrington, cross-listed as asteroid 4015, is one of the\noriginal transition objects whose properties do not neatly fit into a cometary\nor asteroidal origin. Discovered in a period of apparently gas-dominated\nactivity in 1949, it was subsequently lost and recovered as the inactive\nasteroid 1979 VA. We obtained new and re-analyzed archival observations of the\nobject, compared to meteorites, and conducted new orbital integrations in order\nto understand the nature of this object and to understand where it falls on the\nasteroid-comet continuum. Wilson-Harrington's reflectance spectrum is\napproximately neutral from visible to near-infrared wavelengths, but has a\nreflectance maximum near 0.8-0.9 microns. The object's spectrum is well matched\nby laboratory spectra of carbonaceous chondrite meteorites like the CM\nMurchison or the CI Ivuna. The object's phase curve is compatible with either\nan asteroidal or cometary origin, and its recent orbital history has no periods\nwith high enough temperatures to have altered its surface. While it is possible\nthat some unknown process has acted to change the surface from an originally\ncometary one, we instead prefer a fundamentally asteroidal origin for\nWilson-Harrington which can explain its surface and orbital properties.\nHowever, this would require a way to maintain significant (hyper-)volatile\nsupplies on the near-Earth objects beyond what is currently expected.\nWilson-Harrington's similar meteorite affinity and possible orbital link to\nsample return targets (162173) Ryugu and (101955) Bennu suggest that the\nreturned samples from the Hayabusa-2 and OSIRIS-REx missions might hold the key\nto understanding this object.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:15:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kareta","Theodore","","Lowell Observatory"],["Reddy","Vishnu","","Lunar and\n  Planetary Laboratory, University of Arizona"]]}
{"id":"2308.08660","submitter":"Jenna Kefeli","authors":"Jenna Kefeli, Ali Soroush, Courtney J. Diamond, Haley M. Zylberberg,\n  Benjamin May, Julian A. Abrams, Chunhua Weng, Nicholas Tatonetti","title":"Large Language Models for Granularized Barrett's Esophagus Diagnosis\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Diagnostic codes for Barrett's esophagus (BE), a precursor to esophageal\ncancer, lack granularity and precision for many research or clinical use cases.\nLaborious manual chart review is required to extract key diagnostic phenotypes\nfrom BE pathology reports. We developed a generalizable transformer-based\nmethod to automate data extraction. Using pathology reports from Columbia\nUniversity Irving Medical Center with gastroenterologist-annotated targets, we\nperformed binary dysplasia classification as well as granularized multi-class\nBE-related diagnosis classification. We utilized two clinically pre-trained\nlarge language models, with best model performance comparable to a highly\ntailored rule-based system developed using the same data. Binary dysplasia\nextraction achieves 0.964 F1-score, while the multi-class model achieves 0.911\nF1-score. Our method is generalizable and faster to implement as compared to a\ntailored rule-based approach.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:17:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kefeli","Jenna",""],["Soroush","Ali",""],["Diamond","Courtney J.",""],["Zylberberg","Haley M.",""],["May","Benjamin",""],["Abrams","Julian A.",""],["Weng","Chunhua",""],["Tatonetti","Nicholas",""]]}
{"id":"2308.08661","submitter":"Haitian Sun","authors":"Haitian Sun, William W. Cohen, Ruslan Salakhutdinov","title":"Answering Ambiguous Questions with a Database of Questions, Answers, and\n  Revisions","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":"  Many open-domain questions are under-specified and thus have multiple\npossible answers, each of which is correct under a different interpretation of\nthe question. Answering such ambiguous questions is challenging, as it requires\nretrieving and then reasoning about diverse information from multiple passages.\nWe present a new state-of-the-art for answering ambiguous questions that\nexploits a database of unambiguous questions generated from Wikipedia. On the\nchallenging ASQA benchmark, which requires generating long-form answers that\nsummarize the multiple answers to an ambiguous question, our method improves\nperformance by 15% (relative improvement) on recall measures and 10% on\nmeasures which evaluate disambiguating questions from predicted outputs.\nRetrieving from the database of generated questions also gives large\nimprovements in diverse passage retrieval (by matching user questions q to\npassages p indirectly, via questions q' generated from p).\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:23:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Haitian",""],["Cohen","William W.",""],["Salakhutdinov","Ruslan",""]]}
{"id":"2308.08662","submitter":"Steven Rossi","authors":"Steven P. Rossi, Yanjun Wang, Cornelia E. den Heyer, Hugues P.\n  Beno\\^it","title":"Evaluating the potential impacts of grey seal predation and fishery\n  bycatch/discards on cod productivity on the Western Scotian Shelf and in the\n  Bay of Fundy","comments":"27 pages, 4 tables, 10 figures, 2 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recovery of many groundfish stocks throughout the Northwest Atlantic has\nbeen impeded by elevated natural (i.e., non-fishing) mortality (M) among\nolder/larger individuals. The causes of elevated mortality are not well known,\nthough predation by rapidly growing grey seal herds and unreported fishing are\nthought to be possible drivers of mortality for Atlantic Cod (Gadus morhua) on\nthe Western Scotian Shelf and in the Bay of Fundy (known as \"4X5Y cod\") and in\nnearby ecosystems. We developed a statistical catch-at-age model for 4X5Y cod\nthat accounted for both grey seal predation and estimated bycatch/discards to\nevaluate the degree to which either of these factors may influence cod\nmortality. The model was fit over a range of predation and discarding scenarios\nto account for uncertainties and a lack of data for these processes. We found\nthat most cod M remained unaccounted for unless cod comprised a large\nproportion (>0.45) of the grey seal diet by weight. If the reported bycatch\nestimates are taken as accurate, then the magnitude of cod discards from\nnon-directed fisheries was minor, though these estimates are highly uncertain.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:26:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rossi","Steven P.",""],["Wang","Yanjun",""],["Heyer","Cornelia E. den",""],["Beno\u00eet","Hugues P.",""]]}
{"id":"2308.08663","submitter":"Daniel Barrera Salazar","authors":"Daniel Barrera Salazar, Ariel Pacetti, Gonzalo Tornar\\'ia","title":"On the $2$-Selmer group of Jacobians of hyperelliptic curves","comments":"28 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathcal{C}$ be a hyperelliptic curve $y^2 = p(x)$ defined over a number\nfield $K$ with $p(x)$ integral of odd degree. The purpose of the present\narticle is to prove lower and upper bounds for the $2$-Selmer group of the\nJacobian of $\\mathcal{C}$ in terms of the class group of the $K$-algebra\n$K[x]/(p(x))$. Our main result is a formula relating these two quantities under\nsome mild hypothesis. We provide some examples that prove that our lower and\nupper bounds are as sharp as possible.\n  As a first application, we study the rank distribution of the $2$-Selmer\ngroup in families of quadratic twists. Under some extra hypothesis we prove\nthat among prime quadratic twists, a positive proportion has fixed $2$-Selmer\ngroup. As a second application, we study the family of octic twists of the\ngenus $2$ curve $y^2 = x^5 + x$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:28:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salazar","Daniel Barrera",""],["Pacetti","Ariel",""],["Tornar\u00eda","Gonzalo",""]]}
{"id":"2308.08664","submitter":"Andre Kornell","authors":"Guram Bezhanishvili, Andre Kornell","title":"On the structure of modal and tense operators on a boolean algebra","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the poset NO(B) of necessity operators on a boolean algebra B. We\nshow that NO(B) is a meet-semilattice that need not be distributive. However,\nwhen B is complete, NO(B) is necessarily a frame, which is spatial iff B is\natomic. In that case, NO(B) is a locally Stone frame. Dual results hold for the\nposet PO(B) of possibility operators. We also obtain similar results for the\nposets TNO(B) and TPO(B) of tense necessity and possibility operators on B. Our\nmain tool is Jonsson-Tarski duality, by which such operators correspond to\ncontinuous and interior relations on the Stone space of B.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:29:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bezhanishvili","Guram",""],["Kornell","Andre",""]]}
{"id":"2308.08665","submitter":"Alyssa Bulatek","authors":"Alyssa Bulatek, Adam Ginsburg, Jeremy Darling, Christian Henkel, and\n  Karl M. Menten","title":"The 107 GHz methanol transition is a dasar in G0.253+0.016","comments":"19 pages, 9 figures, 1 table. Accepted for publication in ApJ (August\n  14, 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present observations of population anti-inversion in the $3_1 - 4_0\\ A^+$\ntransition of CH$_3$OH (methanol) at 107.013831 GHz toward the Galactic Center\ncloud G0.253+0.016 (\"The Brick\"). Anti-inversion of molecular level populations\ncan result in absorption lines against the cosmic microwave background (CMB) in\na phenomenon known as a \"dasar.\" We model the physical conditions under which\nthe 107 GHz methanol transition dases and determine that dasing occurs at\ndensities below $10^6$ cm$^{-3}$ and column densities between $10^{13}$ and\n$10^{16}$ cm$^{-2}$. We also find that for this transition, dasing does not\nstrongly depend on the gas kinetic temperature. We evaluate the potential of\nthis tool for future deep galaxy surveys. We note that other works have already\nreported absorption in this transition (e.g., in NGC 253), but we provide the\nfirst definitive evidence that it is absorption against the CMB rather than\nagainst undetected continuum sources.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:32:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bulatek","Alyssa",""],["Ginsburg","Adam",""],["Darling","Jeremy",""],["Henkel","Christian",""],["Menten","Karl M.",""]]}
{"id":"2308.08666","submitter":"Shikhar Tuli","authors":"Shikhar Tuli and Niraj K. Jha","title":"BREATHE: Second-Order Gradients and Heteroscedastic Emulation based\n  Design Space Exploration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Researchers constantly strive to explore larger and more complex search\nspaces in various scientific studies and physical experiments. However, such\ninvestigations often involve sophisticated simulators or time-consuming\nexperiments that make exploring and observing new design samples challenging.\nPrevious works that target such applications are typically sample-inefficient\nand restricted to vector search spaces. To address these limitations, this work\nproposes a constrained multi-objective optimization (MOO) framework, called\nBREATHE, that searches not only traditional vector-based design spaces but also\ngraph-based design spaces to obtain best-performing graphs. It leverages\nsecond-order gradients and actively trains a heteroscedastic surrogate model\nfor sample-efficient optimization. In a single-objective vector optimization\napplication, it leads to 64.1% higher performance than the next-best baseline,\nrandom forest regression. In graph-based search, BREATHE outperforms the\nnext-best baseline, i.e., a graphical version of Gaussian-process-based\nBayesian optimization, with up to 64.9% higher performance. In a MOO task, it\nachieves up to 21.9$\\times$ higher hypervolume than the state-of-the-art\nmethod, multi-objective Bayesian optimization (MOBOpt). BREATHE also\noutperforms the baseline methods on most standard MOO benchmark applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:33:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tuli","Shikhar",""],["Jha","Niraj K.",""]]}
{"id":"2308.08667","submitter":"Diego Elias Costa","authors":"Suhaib Mujahid and Diego Elias Costa and Rabe Abdalkareem and Emad\n  Shihab","title":"Where to Go Now? Finding Alternatives for Declining Packages in the npm\n  Ecosystem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software ecosystems (e.g., npm, PyPI) are the backbone of modern software\ndevelopments. Developers add new packages to ecosystems every day to solve new\nproblems or provide alternative solutions, causing obsolete packages to decline\nin their importance to the community. Packages in decline are reused less\novertime and may become less frequently maintained. Thus, developers usually\nmigrate their dependencies to better alternatives. Replacing packages in\ndecline with better alternatives requires time and effort by developers to\nidentify packages that need to be replaced, find the alternatives, asset\nmigration benefits, and finally, perform the migration.\n  This paper proposes an approach that automatically identifies packages that\nneed to be replaced and finds their alternatives supported with real-world\nexamples of open source projects performing the suggested migrations. At its\ncore, our approach relies on the dependency migration patterns performed in the\necosystem to suggest migrations to other developers. We evaluated our approach\non the npm ecosystem and found that 96% of the suggested alternatives are\naccurate. Furthermore, by surveying expert JavaScript developers, 67% of them\nindicate that they will use our suggested alternative packages in their future\nprojects.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:37:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mujahid","Suhaib",""],["Costa","Diego Elias",""],["Abdalkareem","Rabe",""],["Shihab","Emad",""]]}
{"id":"2308.08668","submitter":"Alastair Fletcher","authors":"Alastair N. Fletcher, Jacob Pratscher","title":"A Unified Approach to Quasiregular Linearization in the Plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalize the classical K\\\"onig's and B\\\"ottcher's Theorems in complex\ndynamics to certain quasiregular mappings in the plane. Our approach to these\nresults is unified in the sense that it does not depend on the local\ninjectivity, or not, of the map at the fixed point. By passing to the\nlogarithmic transform we obtain a quasiconformal mapping in either case.\nCertain restrictions on the quasiregular mappings are needed in order for there\nto be a candidate to linearize to. These are provided by requiring a simple\ninfinitesimal space of the mapping at the fixed point and restricting to the\nBIP mappings introduced by the authors in prior work.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:38:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fletcher","Alastair N.",""],["Pratscher","Jacob",""]]}
{"id":"2308.08669","submitter":"Vlad-Constantin Lungu-Stan","authors":"Vlad-Constantin Lungu-Stan, Dumitru-Clementin Cercel, Florin Pop","title":"SkinDistilViT: Lightweight Vision Transformer for Skin Lesion\n  Classification","comments":"Accepted at ICANN 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Skin cancer is a treatable disease if discovered early. We provide a\nproduction-specific solution to the skin cancer classification problem that\nmatches human performance in melanoma identification by training a vision\ntransformer on melanoma medical images annotated by experts. Since inference\ncost, both time and memory wise is important in practice, we employ knowledge\ndistillation to obtain a model that retains 98.33% of the teacher's balanced\nmulti-class accuracy, at a fraction of the cost. Memory-wise, our model is\n49.60% smaller than the teacher. Time-wise, our solution is 69.25% faster on\nGPU and 97.96% faster on CPU. By adding classification heads at each level of\nthe transformer and employing a cascading distillation process, we improve the\nbalanced multi-class accuracy of the base model by 2.1%, while creating a range\nof models of various sizes but comparable performance. We provide the code at\nhttps://github.com/Longman-Stan/SkinDistilVit.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:39:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lungu-Stan","Vlad-Constantin",""],["Cercel","Dumitru-Clementin",""],["Pop","Florin",""]]}
{"id":"2308.08670","submitter":"Vignesh Manoharan","authors":"Vignesh Manoharan and Vijaya Ramachandran","title":"Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST\n  Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of\nminimum weight in a graph $G=(V,E)$. This is a fundamental graph problem with\nclassical sequential algorithms that run in $\\tilde{O}(n^3)$ and\n$\\tilde{O}(mn)$ time where $n=|V|$ and $m=|E|$. In recent years this problem\nhas received significant attention in the context of hardness through fine\ngrained sequential complexity as well as in design of faster sequential\napproximation algorithms.\n  For computing minimum weight cycle in the distributed CONGEST model,\nnear-linear in $n$ lower and upper bounds on round complexity are known for\ndirected graphs (weighted and unweighted), and for undirected weighted graphs;\nthese lower bounds also apply to any $(2-\\epsilon)$-approximation algorithm.\nThis paper focuses on round complexity bounds for approximating MWC in the\nCONGEST model: For coarse approximations we show that for any constant $\\alpha\n>1$, computing an $\\alpha$-approximation of MWC requires $\\Omega (\\frac{\\sqrt\nn}{\\log n})$ rounds on weighted undirected graphs and on directed graphs, even\nif unweighted. We complement these lower bounds with sublinear\n$\\tilde{O}(n^{2/3}+D)$-round algorithms for approximating MWC close to a factor\nof 2 in these classes of graphs.\n  A key ingredient of our approximation algorithms is an efficient algorithm\nfor computing $(1+\\epsilon)$-approximate shortest paths from $k$ sources in\ndirected and weighted graphs, which may be of independent interest for other\nCONGEST problems. We present an algorithm that runs in $\\tilde{O}(\\sqrt{nk} +\nD)$ rounds if $k \\ge n^{1/3}$ and $\\tilde{O}(\\sqrt{nk} +\nk^{2/5}n^{2/5+o(1)}D^{2/5} + D)$ rounds if $k<n^{1/3}$, and this round\ncomplexity smoothly interpolates between the best known upper bounds for\napproximate (or exact) SSSP when $k=1$ and APSP when $k=n$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:41:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Manoharan","Vignesh",""],["Ramachandran","Vijaya",""]]}
{"id":"2308.08671","submitter":"Emilio Gallicchio","authors":"Lieyang Chen, Yujie Wu, Chuanjie Wu, Ana Silveira, Woody Sherman,\n  Huafeng Xu, Emilio Gallicchio","title":"Performance and Analysis of the Alchemical Transfer Method for Binding\n  Free Energy Predictions of Diverse Ligands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Alchemical Transfer Method (ATM) is herein validated against the relative\nbinding free energies of a diverse set of protein-ligand complexes. We employed\na streamlined setup workflow, a bespoke force field, and the AToM-OpenMM\nsoftware to compute the relative binding free energies (RBFE) of the benchmark\nset prepared by Schindler and collaborators at Merck KGaA. This benchmark set\nincludes examples of standard small R-group ligand modifications as well as\nmore challenging scenarios, such as large R-group changes, scaffold hopping,\nformal charge changes, and charge-shifting transformations. The novel\ncoordinate perturbation scheme and a dual-topology approach of ATM address some\nof the challenges of single-topology alchemical relative binding free energy\nmethods. Specifically, ATM eliminates the need for splitting electrostatic and\nLennard-Jones interactions, atom mapping, defining ligand regions, and\npost-corrections for charge-changing perturbations. Thus, ATM is simpler and\nmore broadly applicable than conventional alchemical methods, especially for\nscaffold-hopping and charge-changing transformations. Here, we performed well\nover 500 relative binding free energy calculations for eight protein targets\nand found that ATM achieves accuracy comparable to existing state-of-the-art\nmethods, albeit with larger statistical fluctuations. We discuss insights into\nspecific strengths and weaknesses of the ATM method that will inform future\ndeployments. This study confirms that ATM is applicable as a production tool\nfor relative binding free energy (RBFE) predictions across a wide range of\nperturbation types within a unified, open-source framework.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:43:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Lieyang",""],["Wu","Yujie",""],["Wu","Chuanjie",""],["Silveira","Ana",""],["Sherman","Woody",""],["Xu","Huafeng",""],["Gallicchio","Emilio",""]]}
{"id":"2308.08672","submitter":"Matey Neykov","authors":"Matey Neykov, Larry Wasserman, Ilmun Kim, Sivaraman Balakrishnan","title":"Nearly Minimax Optimal Wasserstein Conditional Independence Testing","comments":"24 pages, 1 figure, ordering of the last three authors is random","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with minimax conditional independence testing. In\ncontrast to some previous works on the topic, which use the total variation\ndistance to separate the null from the alternative, here we use the Wasserstein\ndistance. In addition, we impose Wasserstein smoothness conditions which on\nbounded domains are weaker than the corresponding total variation smoothness\nimposed, for instance, by Neykov et al. [2021]. This added flexibility expands\nthe distributions which are allowed under the null and the alternative to\ninclude distributions which may contain point masses for instance. We\ncharacterize the optimal rate of the critical radius of testing up to\nlogarithmic factors. Our test statistic which nearly achieves the optimal\ncritical radius is novel, and can be thought of as a weighted multi-resolution\nversion of the U-statistic studied by Neykov et al. [2021].\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:49:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Neykov","Matey",""],["Wasserman","Larry",""],["Kim","Ilmun",""],["Balakrishnan","Sivaraman",""]]}
{"id":"2308.08673","submitter":"Peter Henderson","authors":"Eugene Volokh, Mark Lemley, Peter Henderson","title":"Freedom of Speech and AI Output","comments":"Published in the Journal of Free Speech Law (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Is the output of generative AI entitled to First Amendment protection? We're\ninclined to say yes. Even though current AI programs are of course not people\nand do not themselves have constitutional rights, their speech may potentially\nbe protected because of the rights of the programs' creators. But beyond that,\nand likely more significantly, AI programs' speech should be protected because\nof the rights of their users-both the users' rights to listen and their rights\nto speak. In this short Article, we sketch the outlines of this analysis.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:49:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Volokh","Eugene",""],["Lemley","Mark",""],["Henderson","Peter",""]]}
{"id":"2308.08674","submitter":"Jenny Kaufmann","authors":"Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams","title":"Approximating Min-Diameter: Standard and Bichromatic","comments":"ESA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The min-diameter of a directed graph $G$ is a measure of the largest distance\nbetween nodes. It is equal to the maximum min-distance $d_{min}(u,v)$ across\nall pairs $u,v \\in V(G)$, where $d_{min}(u,v) = \\min(d(u,v), d(v,u))$. Our work\nprovides a $O(m^{1.426}n^{0.288})$-time $3/2$-approximation algorithm for\nmin-diameter in DAGs, and a faster $O(m^{0.713}n)$-time\nalmost-$3/2$-approximation variant. (An almost-$\\alpha$-approximation algorithm\ndetermines the min-diameter to within a multiplicative factor of $\\alpha$ plus\nconstant additive error.) By a conditional lower bound result of [Abboud et al,\nSODA 2016], a better than $3/2$-approximation can't be achieved in truly\nsubquadratic time under the Strong Exponential Time Hypothesis (SETH), so our\nresult is conditionally tight. We additionally obtain a new conditional lower\nbound for min-diameter approximation in general directed graphs, showing that\nunder SETH, one cannot achieve an approximation factor below 2 in truly\nsubquadratic time. We also present the first study of approximating bichromatic\nmin-diameter, which is the maximum min-distance between oppositely colored\nvertices in a 2-colored graph.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:58:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Berger","Aaron",""],["Kaufmann","Jenny",""],["Williams","Virginia Vassilevska",""]]}
{"id":"2308.08675","submitter":"David Ferreyra","authors":"D.E. Ferreyra, F.E. Levis, Saroj B. Malik, R.P. Moas","title":"One sided Star and Core orthogonality of matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate two one-sided orthogonalities of matrices, the first of which\nis left (right) $*$-orthogonality for rectangular matrices and the other is\nleft (right) core-orthogonality of index $1$ matrices. We obtain some basic\nresults for these matrices, their canonical forms, and characterizations. Also,\nrelations between left (right) orthogonal matrices and parallel sums are\ninvestigated. Finally under these one-sided orthogonalities we explore the\nconditions of additivity of the Moore-Penrose inverse and the core inverse.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:10:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ferreyra","D. E.",""],["Levis","F. E.",""],["Malik","Saroj B.",""],["Moas","R. P.",""]]}
{"id":"2308.08676","submitter":"Kevin Wong","authors":"Thomas Griffin, Bailey Hall, Jackson Hebner, David Herzog, Denis\n  Selyuzhitsky, Kevin Wong, John Wright","title":"Cutoff in the Bernoulli-Laplace Model With Unequal Colors and Urn Sizes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a generalization of the Bernoulli-Laplace model in which there\nare two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and\nwhere the left urn holds $m$ balls. At each time increment, $k$ balls are\nchosen uniformly at random from each urn and then swapped. This system can be\nused to model phenomena such as gas particle interchange between containers or\ncard shuffling. Under a reasonable set of assumptions, we bound the mixing time\nof the resulting Markov chain asymptotically in $n$ with cutoff at $\\log{n}$\nand constant window. Among other techniques, we employ the spectral analysis of\narXiv:0906.4242 on the Markov transition kernel and the chain coupling tools of\narXiv:2203.08647 and arXiv:1606.01437.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:19:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Griffin","Thomas",""],["Hall","Bailey",""],["Hebner","Jackson",""],["Herzog","David",""],["Selyuzhitsky","Denis",""],["Wong","Kevin",""],["Wright","John",""]]}
{"id":"2308.08677","submitter":"Levi Smith","authors":"Ali Dehghanian, Walid Gomaa, Mohsen Haghighat, Thomas Darcie, and Levi\n  Smith","title":"Demonstration of an Integrated Terahertz Band-Stop Filter Using an\n  Apodized Bragg Grating","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents the demonstration of an on-chip integrated Terahertz\n(THz) Apodized Bragg grating (TABG) which functions as band-stop filter with a\ncenter frequency of 0.8 THz and a bandwidth of 200 GHz. For experimentation, we\nintegrate the TABG into our THz System-on-Chip to enable wideband (DC - 1.5\nTHz) device characterization. Using this methodology, we measure the signal\ntransmission through the TABG and find the experimental results align with\nsimulation and theory provides a rejection of approximately 20 dB across the\nstop-band.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:20:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dehghanian","Ali",""],["Gomaa","Walid",""],["Haghighat","Mohsen",""],["Darcie","Thomas",""],["Smith","Levi",""]]}
{"id":"2308.08678","submitter":"Eduardo Barredo-Alamilla","authors":"Eduardo Barredo-Alamilla, Daniel A. Bobylev, Maxim A. Gorlach","title":"Axion electrodynamics without Witten effect in metamaterials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Artificial media provide unique playground to test fundamental theories\nallowing one to probe the laws of electromagnetism in the presence of\nhypothetical axions. While some materials are known to realize this physics,\nhere we propose the nonlocal extension of axion electrodynamics. Compared to\nthe usual axion case, the suggested metamaterial features similar optical\nproperties including Kerr and Faraday rotation. However, the external sources\nin this structure do not induce dyon charges eliminating well-celebrated Witten\neffect. We put forward the design of such nonreciprocal non-local metamaterial\nand discuss its potential applications.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:22:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Barredo-Alamilla","Eduardo",""],["Bobylev","Daniel A.",""],["Gorlach","Maxim A.",""]]}
{"id":"2308.08679","submitter":"Ruslan Prozorov","authors":"Elizabeth H. Krenkel, Makariy A. Tanatar, Sunil Ghimire, Kamal R.\n  Joshi, Shuzhang Chen, Cedomir Petrovic, and Ruslan Prozorov","title":"Robust superconductivity and the suppression of charge-density wave in\n  $\\text{Ca}_{3}(\\text{Ir}_{1-x}\\text{Rh}_{x})_{4}\\text{Sn}_{13}$ single\n  crystals at ambient pressure","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Single crystals of Ca$_3$(Ir$_{1-x}$Rh$_x$)$_4$Sn$_{13}$ (3-4-13) were\nsynthesized by flux growth and characterized by X-ray diffraction, EDX,\nmagnetization, resistivity and radio frequency magnetic susceptibility tunnel\ndiode resonator (TDR) techniques. Compositional variation of the Rh/Ir ratio\nwas used to study the coexistence and competition between the charge density\nwave (CDW) and superconductivity. The superconducting transition temperature\nvaries from approximately 7 K in pure Ir ($x=0$) to approximately 8.3 K in pure\nRh ($x=1$). Temperature-dependent electrical resistivity reveals monotonic\nsuppression of the CDW transition temperature, $T_{\\text{CDW}}(x)$. The CDW\nstarts in pure Ir, $x=0$, with $T_{\\text{CDW}}\\approx40$~K and extrapolates\nroughly linearly to zero at $x_c=0.58$ under the dome of superconductivity.\nMagnetization and transport measurements show a significant influence of CDW on\nthe superconducting and normal state. Vortex pinning is substantially enhanced\nin the CDW region, and the resistivity is larger in this part of the phase\ndiagram. The London penetration depth is attenuated exponentially upon cooling\nat low temperatures for all compositions, indicating a fully-gapped Fermi\nsurface. We conclude that a novel\n$\\text{Ca}_3(\\text{Ir}_{1-x}\\text{Rh}_x)_4\\text{Sn}_{13}$ alloy with\ncoexisting/competing CDW and superconductivity, is a good candidate to look for\na composition-driven quantum critical point at ambient pressure.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:28:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Krenkel","Elizabeth H.",""],["Tanatar","Makariy A.",""],["Ghimire","Sunil",""],["Joshi","Kamal R.",""],["Chen","Shuzhang",""],["Petrovic","Cedomir",""],["Prozorov","Ruslan",""]]}
{"id":"2308.08680","submitter":"Andrew Ferguson","authors":"Nicholas S.M. Herringer, Siva Dasetty, Diya Gandhi, Junhee Lee, and\n  Andrew L. Ferguson","title":"Permutationally Invariant Networks for Enhanced Sampling (PINES):\n  Discovery of Multi-Molecular and Solvent-Inclusive Collective Variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The typically rugged nature of molecular free energy landscapes can frustrate\nefficient sampling of the thermodynamically relevant phase space due to the\npresence of high free energy barriers. Enhanced sampling techniques can improve\nphase space exploration by accelerating sampling along particular collective\nvariables (CVs). A number of techniques exist for data-driven discovery of CVs\nparameterizing the important large scale motions of the system. A challenge to\nCV discovery is learning CVs invariant to symmetries of the molecular system,\nfrequently rigid translation, rigid rotation, and permutational relabeling of\nidentical particles. Of these, permutational invariance have proved a\npersistent challenge in frustrating the the data-driven discovery of\nmulti-molecular CVs in systems of self-assembling particles and\nsolvent-inclusive CVs for solvated systems. In this work, we integrate\nPermutation Invariant Vector (PIV) featurizations with autoencoding neural\nnetworks to learn nonlinear CVs invariant to translation, rotation, and\npermutation, and perform interleaved rounds of CV discovery and enhanced\nsampling to iteratively expand sampling of configurational phase space and\nobtain converged CVs and free energy landscapes. We demonstrate the\nPermutationally Invariant Network for Enhanced Sampling (PINES) approach in\napplications to the self-assembly of a 13-atom Argon cluster,\nassociation/dissociation of a NaCl ion pair in water, and hydrophobic collapse\nof a C45H92 n-pentatetracontane polymer chain. We make the approach freely\navailable as a new module within the PLUMED2 enhanced sampling libraries.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:28:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Herringer","Nicholas S. M.",""],["Dasetty","Siva",""],["Gandhi","Diya",""],["Lee","Junhee",""],["Ferguson","Andrew L.",""]]}
{"id":"2308.08681","submitter":"Po-Feng Wu","authors":"Po-Feng Wu, Rachel Bezanson, Francesco D'Eugenio, Anna R. Gallazzi,\n  Jenny E. Greene, Michael V. Maseda, Katherine A. Suess, and Arjen van der Wel","title":"Stars, gas, and star formation of distant post-starburst galaxies","comments":"Accepted by 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 multi-wavelength study of 5 poststarburst galaxies\nwith $M_\\ast > 10^{11} M_\\odot$ at $z\\sim 0.7$, examining their stars, gas, and\ncurrent and past star-formation activities. Using optical images from the\nSubaru telescope and Hubble Space Telescope, we observe a high incidence of\ncompanion galaxies and low surface brightness tidal features, indicating that\nquenching is closely related to interactions between galaxies. From optical\nspectra provided by the LEGA-C survey, we model the stellar continuum to derive\nthe star-formation histories and show that the stellar masses of progenitors\nranging from $2\\times10^9 M_\\odot$ to $10^{11} M_\\odot$, undergoing a burst of\nstar formation several hundred million years prior to observation, with a decay\ntime scale of $\\sim100$ million years. Our ALMA observations detect CO(2-1)\nemission in four galaxies, with the molecular gas spreading over up to $>1\"$,\nor $\\sim10$ kpc, with a mass of up to $\\sim2 \\times10^{10} M_\\odot$. However,\nstar-forming regions are unresolved by either the slit spectra or 3~GHz\ncontinuum observed by the Very Large Array. Comparisons between the\nstar-formation rates and gas masses, and the sizes of CO emission and\nstar-forming regions suggest a low star-forming efficiency. We show that the\nstar-formation rates derived from IR and radio luminosities with commonly-used\ncalibrations tend to overestimate the true values because of the prodigious\namount of radiation from old stars and the contribution from AGN, as the\noptical spectra reveal weak AGN-driven outflows.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:31:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Po-Feng",""],["Bezanson","Rachel",""],["D'Eugenio","Francesco",""],["Gallazzi","Anna R.",""],["Greene","Jenny E.",""],["Maseda","Michael V.",""],["Suess","Katherine A.",""],["van der Wel","Arjen",""]]}
{"id":"2308.08682","submitter":"Sanad Aburass","authors":"Sanad Aburass","title":"Quantifying Overfitting: Introducing the Overfitting Index","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the rapidly evolving domain of machine learning, ensuring model\ngeneralizability remains a quintessential challenge. Overfitting, where a model\nexhibits superior performance on training data but falters on unseen data, is a\nrecurrent concern. This paper introduces the Overfitting Index (OI), a novel\nmetric devised to quantitatively assess a model's tendency to overfit. Through\nextensive experiments on the Breast Ultrasound Images Dataset (BUS) and the\nMNIST dataset using architectures such as MobileNet, U-Net, ResNet, Darknet,\nand ViT-32, we illustrate the utility and discernment of the OI. Our results\nunderscore the variable overfitting behaviors across architectures and\nhighlight the mitigative impact of data augmentation, especially on smaller and\nmore specialized datasets. The ViT-32's performance on MNIST further emphasizes\nthe robustness of certain models and the dataset's comprehensive nature. By\nproviding an objective lens to gauge overfitting, the OI offers a promising\navenue to advance model optimization and ensure real-world efficacy.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:32:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Aburass","Sanad",""]]}
{"id":"2308.08683","submitter":"Haochen Li","authors":"Haochen Li, Maria Polukarova and Carmine Ventre","title":"Detecting Financial Market Manipulation with Statistical Physics Tools","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR q-fin.CP q-fin.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We take inspiration from statistical physics to develop a novel conceptual\nframework for the analysis of financial markets. We model the order book\ndynamics as a motion of particles and define the momentum measure of the system\nas a way to summarise and assess the state of the market. Our approach proves\nuseful in capturing salient financial market phenomena: in particular, it helps\ndetect the market manipulation activities called spoofing and layering. We\napply our method to identify pathological order book behaviours during the\nflash crash of the LUNA cryptocurrency, uncovering widespread instances of\nspoofing and layering in the market. Furthermore, we establish that our\ntechnique outperforms the conventional Z-score-based anomaly detection method\nin identifying market manipulations across both LUNA and Bitcoin cryptocurrency\nmarkets.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:35:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Haochen",""],["Polukarova","Maria",""],["Ventre","Carmine",""]]}
{"id":"2308.08684","submitter":"Joseph Sklenar","authors":"Mitra Mani Subedi, Kuangyin Deng, Benedetta Flebus, and Joseph Sklenar","title":"Even-Odd-Layer-Dependent Symmetry Breaking in Synthetic Antiferromagnets","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":"  In this work we examine synthetic antiferromagnetic structures consisting of\ntwo, three, and four antiferromagnetic coupled layers, i.e., bilayers,\ntrilayers, and tetralayers. We vary the thickness of the ferromagnetic layers\nacross all structures and, using a macrospin formalism, find that the nearest\nneighbor exchange interaction between layers is consistent across all\nstructures for a given thickness. Our model and experimental results\ndemonstrate significant differences in how the magnetostatic equilibrium states\nof even and odd-layered structures evolve as a function of the external field.\nEven layered structures continuously evolve from a collinear antiferromagnetic\nstate to a spin canted non-collinear magnetic configuration that is\nmirror-symmetric about the external field. In contrast, odd-layered structures\nbegin with a ferrimagnetic ground state; at a critical field, the ferrimagnetic\nground state evolves into a non-collinear state with broken symmetry.\nSpecifically, the magnetic moments found in the odd-layered samples possess\nstable static equilibrium states that are no longer mirror-symmetric about the\nexternal field after a critical field is reached. Our results reveal the rich\nbehavior of synthetic antiferromagnets.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:45:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Subedi","Mitra Mani",""],["Deng","Kuangyin",""],["Flebus","Benedetta",""],["Sklenar","Joseph",""]]}
{"id":"2308.08685","submitter":"Thi Thai Tran","authors":"Tran Thi Thai (1,2,3), Pham Tuan-Anh (2,3), Roser Pello (1), Ilias\n  Goovaerts (1), Johan Richard (4), Ad\\'ela\\\"ide Claeyssens (5), Guillaume\n  Mahler (6,7), David J. Lagattuta (6,7), Geoffroy de la Vieuville (10), Eduard\n  Salvador-Sol\\'e (8), Thibault Garel (9,4), Franz E. Bauer (11,12,13),\n  Alexandre Jeanneau (4), Benjamin Cl\\'ement (12), Jorryt Matthee (14) ((1) LAM\n  (2) DAP/VNSC/VAST (3) GUST/VAST (4) CRAL, Lyon (5) Stockholm (6) ICC, Durham\n  (7) CEA, Durham (8) DFQA Spain (9) Univ. Geneve, Switzerland (10) France (11)\n  IACA Chile (12) MIA Chile (13) SSI USA (14) DOP ETH Switzerland)","title":"Probing the faint end Luminosity Function of Lyman Alpha Emitters at\n  3<z<7 behind 17 MUSE lensing clusters","comments":"20 pages, 15 figures, 6 tables. Accepted for publication in A\\&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a study of the galaxy Lyman-alpha luminosity function (LF) using a\nsample of 17 lensing clusters observed by the MUSE/VLT. Magnification from\nstrong gravitational lensing by clusters of galaxies and MUSE apabilities allow\nus to blindly detect LAEs without any photometric pre-selection, reaching the\nfaint luminosity regime. 600 lensed LAEs were selected behind these clusters in\nthe redshift range 2.9<$z$< 6.7, covering four orders of magnitude in\nmagnification-corrected Lyman-alpha luminosity (39.0<log$L$< 43.0). The method\nused in this work ($V_{\\text{max}}$) follows the recipes originally developed\nby arXiv:1905.13696(N) (DLV19) with some improvements to better account for the\neffects of lensing when computing the effective volume. The total co-moving\nvolume at 2.9<$z$<6.7 is $\\sim$50 $10^{3}Mpc^{3}$. Our LF points in the bright\nend (log L)>42 are consistent with those obtained from blank field\nobservations. In the faint luminosity regime, the density of sources is well\ndescribed by a steep slope, $\\alpha\\sim-2$ for the global redshift range. Up to\nlog(L)$\\sim$41, the steepening of the faint end slope with redshift, suggested\nby the earlier work of DLV19 is observed, but the uncertainties remain large. A\nsignificant flattening is observed towards the faintest end, for the highest\nredshift bins (log$L$<41). Using face values, the steep slope at the faint-end\ncauses the SFRD to dramatically increase with redshift, implying that LAEs\ncould play a major role in the process of cosmic reionization. The flattening\nobserved towards the faint end for the highest redshift bins still needs\nfurther investigation. This turnover is similar to the one observed for the UV\nLF at $z\\geq6$ in lensing clusters, with the same conclusions regarding the\nreliability of current results (e.g.arXiv:1803.09747(N); arXiv:2205.11526(N)).\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:04:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thai","Tran Thi",""],["Tuan-Anh","Pham",""],["Pello","Roser",""],["Goovaerts","Ilias",""],["Richard","Johan",""],["Claeyssens","Ad\u00e9la\u00efde",""],["Mahler","Guillaume",""],["Lagattuta","David J.",""],["de la Vieuville","Geoffroy",""],["Salvador-Sol\u00e9","Eduard",""],["Garel","Thibault",""],["Bauer","Franz E.",""],["Jeanneau","Alexandre",""],["Cl\u00e9ment","Benjamin",""],["Matthee","Jorryt",""]]}
{"id":"2308.08686","submitter":"Bashu Khanal","authors":"B. D. Khanal, P. Dhakal and G. Ciovati","title":"Quench Detection in a Superconducting Radio Frequency Cavity with\n  Combine Temperature and Magnetic Field Mapping","comments":"21st International Conference on Radio-Frequency Superconductivity\n  (SRF 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Local dissipation of RF power in superconducting radio frequency cavities\ncreate so called hot spots, primary precursors of cavity quench driven by\neither thermal or magnetic instability. These hot spots are detected by a\ntemperature mapping system, and a large increase in temperature on the outer\nsurface is detected during cavity quench events. Here, we have used combined\nmagnetic and temperature mapping systems using anisotropic magnetoresistance\n(AMR) sensors and carbon resisters to locate the hot spots and areas with high\ntrapped flux on a 3.0 GHz single-cell Nb cavity during the RF tests at 2.0 K.\nThe quench location and hot spots were detected near the equator when the\nresidual magnetic field in the Dewar is kept < 1 mG. The hot spots and quench\nlocations moved when the magnetic field is trapped locally, as detected by\nT-mapping system. No significant dynamics of trapped flux is detected by AMR\nsensors, however, change in magnetic flux during cavity quench is detected by a\nflux gate magnetometer, close to the quench location. The result provides the\ndirect evidence of hot spots and quench events due to localized trapped\nvortices.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:09:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khanal","B. D.",""],["Dhakal","P.",""],["Ciovati","G.",""]]}
{"id":"2308.08687","submitter":"Jayshil Patel","authors":"J. A. Patel, J. A. Egger, T. G. Wilson, V. Bourrier, L. Carone, M.\n  Beck, D. Ehrenreich, S. G. Sousa, W. Benz, A. Brandeker, A. Deline, Y.\n  Alibert, K. W. F. Lam, M. Lendl, R. Alonso, G. Anglada, T. B\\'arczy, D.\n  Barrado, S. C. C. Barros, W. Baumjohann, T. Beck, N. Billot, X. Bonfils, C.\n  Broeg, M.-D. Busch, J. Cabrera, S. Charnoz, A. Collier Cameron, Sz.\n  Csizmadia, M. B. Davies, M. Deleuil, L. Delrez, O. D. S. Demangeon, B.-O.\n  Demory, A. Erikson, A. Fortier, L. Fossati, M. Fridlund, D. Gandolfi, M.\n  Gillon, M. G\\\"udel, K. Heng, S. Hoyer, K. G. Isaak, L. L. Kiss, E. Kopp, J.\n  Laskar, A. Lecavelier des Etangs, C. Lovis, D. Magrin, P. F. L. Maxted, V.\n  Nascimbeni, G. Olofsson, R. Ottensamer, I. Pagano, E. Pall\\'e, G. Peter, G.\n  Piotto, D. Pollacco, D. Queloz, R. Ragazzoni, N. Rando, F. Ratti, H. Rauer,\n  I. Ribas, N. C. Santos, G. Scandariato, D. S\\'egransan, A. E. Simon, A. M. S.\n  Smith, M. Steller, Gy. M. Szab\\'o, N. Thomas, S. Udry, B. Ulmer, V. Van\n  Grootel, V. Viotto, N. A. Walton","title":"CHEOPS and TESS view of the ultra-short period super-Earth TOI-561 b","comments":"17 pages, 10 + 3 figures, 4 tables, accepted for publication in A&A\n  (abstract abbreviated)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultra-short period planets (USPs) are a unique class of super-Earths with an\norbital period of less than a day and hence subject to intense radiation from\ntheir host star. While most of them are consistent with bare rocks, some show\nevidence of a heavyweight envelope, which could be a water layer or a secondary\nmetal-rich atmosphere sustained by an outgassing surface. Much remains to be\nlearned about the nature of USPs. The prime goal of the present work is to\nstudy the bulk planetary properties and atmosphere of TOI-561b, through the\nstudy of its transits and occultations. We obtained ultra-precise transit\nphotometry of TOI-561b with CHEOPS and performed a joint analysis of this data\nwith four TESS sectors. Our analysis of TOI-561b transit photometry put strong\nconstraints on its properties, especially on its radius, Rp=1.42 +/- 0.02\nR_Earth (at ~2% error). The internal structure modelling of the planet shows\nthat the observations are consistent with negligible H/He atmosphere, however\nrequiring other lighter materials, in addition to pure iron core and silicate\nmantle to explain the observed density. We find that this can be explained by\nthe inclusion of a water layer in our model. We searched for variability in the\nmeasured Rp/R* over time to trace changes in the structure of the planetary\nenvelope but none found within the data precision. In addition to the transit\nevent, we tentatively detect occultation signal in the TESS data with an\neclipse depth of ~27 +/- 11 ppm. Using the models of outgassed atmospheres from\nthe literature we find that the thermal emission from the planet can mostly\nexplain the observation. Based on this, we predict that NIR/MIR observations\nwith JWST should be able to detect silicate species in the atmosphere of the\nplanet. This could also reveal important clues about the planetary interior and\nhelp disentangle planet formation and evolution models.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:13:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Patel","J. A.",""],["Egger","J. A.",""],["Wilson","T. G.",""],["Bourrier","V.",""],["Carone","L.",""],["Beck","M.",""],["Ehrenreich","D.",""],["Sousa","S. G.",""],["Benz","W.",""],["Brandeker","A.",""],["Deline","A.",""],["Alibert","Y.",""],["Lam","K. W. F.",""],["Lendl","M.",""],["Alonso","R.",""],["Anglada","G.",""],["B\u00e1rczy","T.",""],["Barrado","D.",""],["Barros","S. C. C.",""],["Baumjohann","W.",""],["Beck","T.",""],["Billot","N.",""],["Bonfils","X.",""],["Broeg","C.",""],["Busch","M. -D.",""],["Cabrera","J.",""],["Charnoz","S.",""],["Cameron","A. Collier",""],["Csizmadia","Sz.",""],["Davies","M. B.",""],["Deleuil","M.",""],["Delrez","L.",""],["Demangeon","O. D. S.",""],["Demory","B. -O.",""],["Erikson","A.",""],["Fortier","A.",""],["Fossati","L.",""],["Fridlund","M.",""],["Gandolfi","D.",""],["Gillon","M.",""],["G\u00fcdel","M.",""],["Heng","K.",""],["Hoyer","S.",""],["Isaak","K. G.",""],["Kiss","L. L.",""],["Kopp","E.",""],["Laskar","J.",""],["Etangs","A. Lecavelier des",""],["Lovis","C.",""],["Magrin","D.",""],["Maxted","P. F. L.",""],["Nascimbeni","V.",""],["Olofsson","G.",""],["Ottensamer","R.",""],["Pagano","I.",""],["Pall\u00e9","E.",""],["Peter","G.",""],["Piotto","G.",""],["Pollacco","D.",""],["Queloz","D.",""],["Ragazzoni","R.",""],["Rando","N.",""],["Ratti","F.",""],["Rauer","H.",""],["Ribas","I.",""],["Santos","N. C.",""],["Scandariato","G.",""],["S\u00e9gransan","D.",""],["Simon","A. E.",""],["Smith","A. M. S.",""],["Steller","M.",""],["Szab\u00f3","Gy. M.",""],["Thomas","N.",""],["Udry","S.",""],["Ulmer","B.",""],["Van Grootel","V.",""],["Viotto","V.",""],["Walton","N. A.",""]]}
{"id":"2308.08688","submitter":"Amit Kumar Jaiswal","authors":"Amit Kumar Jaiswal, Haiming Liu","title":"Lightweight Adaptation of Neural Language Models via Subspace Embedding","comments":"5 pages, Accepted as a Main Conference Short Paper at CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditional neural word embeddings are usually dependent on a richer\ndiversity of vocabulary. However, the language models recline to cover major\nvocabularies via the word embedding parameters, in particular, for multilingual\nlanguage models that generally cover a significant part of their overall\nlearning parameters. In this work, we present a new compact embedding structure\nto reduce the memory footprint of the pre-trained language models with a\nsacrifice of up to 4% absolute accuracy. The embeddings vectors reconstruction\nfollows a set of subspace embeddings and an assignment procedure via the\ncontextual relationship among tokens from pre-trained language models. The\nsubspace embedding structure calibrates to masked language models, to evaluate\nour compact embedding structure on similarity and textual entailment tasks,\nsentence and paraphrase tasks. Our experimental evaluation shows that the\nsubspace embeddings achieve compression rates beyond 99.8% in comparison with\nthe original embeddings for the language models on XNLI and GLUE benchmark\nsuites.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:16:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jaiswal","Amit Kumar",""],["Liu","Haiming",""]]}
{"id":"2308.08689","submitter":"Zaza Osmanov","authors":"Z.N. Osmanov","title":"Are we visible to advanced alien civilizations?","comments":"8 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.pop-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We considered the question of how our artificial constructions are visible to\nadvanced extraterrestrial civilizations. Taking the universality of the laws of\nphysics, we found that the maximum distance where the detection is possible is\nof the order of $3000$ ly and under certain conditions Type-II advanced alien\nsocieties might be able to resolve this problem.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:24:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Osmanov","Z. N.",""]]}
{"id":"2308.08690","submitter":"Michael Zlatin","authors":"Daniel Hathcock, Michael Zlatin","title":"Improved Approximation Algorithms for Steiner Connectivity Augmentation\n  Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Weighted Connectivity Augmentation Problem is the problem of augmenting\nthe edge-connectivity of a given graph by adding links of minimum total cost.\nThis work focuses on connectivity augmentation problems in the Steiner setting,\nwhere we are not interested in the connectivity between all nodes of the graph,\nbut only the connectivity between a specified subset of terminals.\n  We consider two related settings. In the Steiner Augmentation of a Graph\nproblem ($k$-SAG), we are given a $k$-edge-connected subgraph $H$ of a graph\n$G$. The goal is to augment $H$ by including links and nodes from $G$ of\nminimum cost so that the edge-connectivity between nodes of $H$ increases by 1.\nIn the Steiner Connectivity Augmentation Problem ($k$-SCAP), we are given a\nSteiner $k$-edge-connected graph connecting terminals $R$, and we seek to add\nlinks of minimum cost to create a Steiner $(k+1)$-edge-connected graph for $R$.\nNote that $k$-SAG is a special case of $k$-SCAP.\n  All of the above problems can be approximated to within a factor of 2 using\ne.g. Jain's iterative rounding algorithm for Survivable Network Design. In this\nwork, we leverage the framework of Traub and Zenklusen to give a $(1 + \\ln{2}\n+\\varepsilon)$-approximation for the Steiner Ring Augmentation Problem (SRAP):\ngiven a cycle $H = (V(H),E)$ embedded in a larger graph $G = (V, E \\cup L)$ and\na subset of terminals $R \\subseteq V(H)$, choose a subset of links $S \\subseteq\nL$ of minimum cost so that $(V, E \\cup S)$ has 3 pairwise edge-disjoint paths\nbetween every pair of terminals.\n  We show this yields a polynomial time algorithm with approximation ratio $(1\n+ \\ln{2} + \\varepsilon)$ for $2$-SCAP. We obtain an improved approximation\nguarantee of $(1.5+\\varepsilon)$ for SRAP in the case that $R = V(H)$, which\nyields a $(1.5+\\varepsilon)$-approximation for $k$-SAG for any $k$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:25:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hathcock","Daniel",""],["Zlatin","Michael",""]]}
{"id":"2308.08691","submitter":"Ido Kaplan","authors":"Ido Kaplan, Haim Suchowski, and Yaron Oz","title":"Correlation thresholds for effective composite pulse quantum error\n  mitigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Composite pulse segmentation has emerged as a promising error mitigation\ntechnique for a wide range of physical systems. In recent years, composite\nschemes were applied as mitigation strategies for quantum information\nprocessing and quantum computing. However, most of these strategies assume full\nerror correlation between segments, which can result in gates with worse\nfidelity performance compared to non-composite gates. In our research, we\ninvestigate how error correlations impact the fidelity of quantum gates within\nthe composite segmentation framework. In our study, we prove the existence of a\ncritical correlation threshold, above which the composite pulse method\nsignificantly enhances both the mean value and variance of the fidelity. To\ngain deeper insights, we analyze various properties of the threshold in the\nrealm of integrated photonics, including the effects of geometrical variations\nand the limit where the number of segments approaches infinity. We numerically\nexplore diverse scenarios, showcasing different aspects of the critical\nthreshold within the photonic quantum gates framework. These findings\ncontribute open new pathways of error mitigation strategies and their\nimplications in quantum information processing.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:25:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kaplan","Ido",""],["Suchowski","Haim",""],["Oz","Yaron",""]]}
{"id":"2308.08692","submitter":"Yong Niu","authors":"Yuanyuan Qiao, Yong Niu, Zhu Han, Shiwen Mao, Ruisi He, Ning Wang,\n  Zhangdui Zhong, Bo Ai","title":"Joint Optimization of Resource Allocation and User Association in\n  Multi-Frequency Cellular Networks Assisted by RIS","comments":"18 pages","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":"  Due to the development of communication technology and the rise of user\nnetwork demand, a reasonable resource allocation for wireless networks is the\nkey to guaranteeing regular operation and improving system performance. Various\nfrequency bands exist in the natural network environment, and heterogeneous\ncellular network (HCN) has become a hot topic for current research. Meanwhile,\nReconfigurable Intelligent Surface (RIS) has become a key technology for\ndeveloping next-generation wireless networks. By modifying the phase of the\nincident signal arriving at the RIS surface, RIS can improve the signal quality\nat the receiver and reduce co-channel interference. In this paper, we develop a\nRIS-assisted HCN model for a multi-base station (BS) multi-frequency network,\nwhich includes 4G, 5G, millimeter wave (mmwave), and terahertz networks, and\nconsiders the case of multiple network coverage users, which is more in line\nwith the realistic network characteristics and the concept of 6G networks. We\npropose the optimization objective of maximizing the system sum rate, which is\ndecomposed into two subproblems, i.e., the user resource allocation and the\nphase shift optimization problem of RIS components. Due to the NP-hard and\ncoupling relationship, we use the block coordinate descent (BCD) method to\nalternately optimize the local solutions of the coalition game and the local\ndiscrete phase search algorithm to obtain the global solution. In contrast,\nmost previous studies have used the coalition game algorithm to solve the\nresource allocation problem alone. Simulation results show that the algorithm\nperforms better than the rest of the algorithms, effectively improves the\nsystem sum rate, and achieves performance close to the optimal solution of the\ntraversal algorithm with low complexity.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:39:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qiao","Yuanyuan",""],["Niu","Yong",""],["Han","Zhu",""],["Mao","Shiwen",""],["He","Ruisi",""],["Wang","Ning",""],["Zhong","Zhangdui",""],["Ai","Bo",""]]}
{"id":"2308.08693","submitter":"Carlos Martin","authors":"Carlos Martin, Tuomas Sandholm","title":"Planning in the imagination: High-level planning on learned abstract\n  search spaces","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":"  We propose a new method, called PiZero, that gives an agent the ability to\nplan in an abstract search space of its own creation that is completely\ndecoupled from the real environment. Unlike prior approaches, this enables the\nagent to perform high-level planning at arbitrary timescales and reason in\nterms of compound or temporally-extended actions, which can be useful in\nenvironments where large numbers of base-level micro-actions are needed to\nperform relevant macro-actions. In addition, our method is more general than\ncomparable prior methods because it handles settings with continuous action\nspaces and partial observability. We evaluate our method on multiple domains,\nincluding navigation tasks and Sokoban. Experimentally, it outperforms\ncomparable prior methods without assuming access to an environment simulator.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:47:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Martin","Carlos",""],["Sandholm","Tuomas",""]]}
{"id":"2308.08694","submitter":"Noam Lifshitz","authors":"Noam Lifshitz and Avichai Marmor","title":"Bounds for Characters of the Symmetric Group: A Hypercontractive\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.FA math.GR math.PR math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding upper bounds for character ratios is a fundamental problem in\nasymptotic group theory. Previous bounds in the symmetric group have led to\nremarkable applications in unexpected domains. The existing approaches\npredominantly relied on algebraic methods, whereas our approach combines\nanalytic and algebraic tools. Specifically, we make use of a tool called\n`hypercontractivity for global functions' from the theory of Boolean functions.\nBy establishing sharp upper bounds on the $L^p$-norms of characters of the\nsymmetric group, we improve existing results on character ratios from the work\nof Larsen and Shalev [Larsen M., Shalev A. Characters of the symmetric group:\nsharp bounds and applications. Invent. math. 174 645-687 (2008)]. We use our\nnorm bounds to bound Kronecker coefficients, Fourier coefficients of class\nfunctions, product mixing of normal sets, and mixing time of normal Cayley\ngraphs. Our approach bypasses the need for the $S_n$-specific\nMurnaghan--Nakayama rule. Instead we leverage more flexible representation\ntheoretic tools, such as Young's branching rule, which potentially extend the\napplicability of our method to groups beyond $S_n$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:48:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lifshitz","Noam",""],["Marmor","Avichai",""]]}
{"id":"2308.08695","submitter":"Afshin Besharat","authors":"Afshin Besharat, Jury Radkovski, and Sergey Sibiryakov","title":"Effective Action for Dissipative and Nonholonomic Systems","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph cond-mat.soft cond-mat.stat-mech hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the action of a dynamical system can be supplemented by an\neffective action for its environment to reproduce arbitrary coordinate\ndependent ohmic dissipation and gyroscopic forces. The action is a\ngeneralization of the harmonic bath model and describes a set of massless\ninteracting scalar fields in an auxiliary space coupled to the original system\nat the boundary. A certain limit of the model implements nonholonomic\nconstraints. In the case of dynamics with nonlinearly realized symmetries the\neffective action takes the form of a two-dimensional nonlinear sigma-model. It\nprovides a basis for application of path integral methods to general\ndissipative and nonholonomic systems.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:48:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Besharat","Afshin",""],["Radkovski","Jury",""],["Sibiryakov","Sergey",""]]}
{"id":"2308.08696","submitter":"Zhi-Qi Cheng","authors":"Ji Zhang, Xiao Wu, Zhi-Qi Cheng, Qi He, Wei Li","title":"Improving Anomaly Segmentation with Multi-Granularity Cross-Domain\n  Alignment","comments":"Accepted to ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly segmentation plays a crucial role in identifying anomalous objects\nwithin images, which facilitates the detection of road anomalies for autonomous\ndriving. Although existing methods have shown impressive results in anomaly\nsegmentation using synthetic training data, the domain discrepancies between\nsynthetic training data and real test data are often neglected. To address this\nissue, the Multi-Granularity Cross-Domain Alignment (MGCDA) framework is\nproposed for anomaly segmentation in complex driving environments. It uniquely\ncombines a new Multi-source Domain Adversarial Training (MDAT) module and a\nnovel Cross-domain Anomaly-aware Contrastive Learning (CACL) method to boost\nthe generality of the model, seamlessly integrating multi-domain data at both\nscene and sample levels. Multi-source domain adversarial loss and a dynamic\nlabel smoothing strategy are integrated into the MDAT module to facilitate the\nacquisition of domain-invariant features at the scene level, through\nadversarial training across multiple stages. CACL aligns sample-level\nrepresentations with contrastive loss on cross-domain data, which utilizes an\nanomaly-aware sampling strategy to efficiently sample hard samples and anchors.\nThe proposed framework has decent properties of parameter-free during the\ninference stage and is compatible with other anomaly segmentation networks.\nExperimental conducted on Fishyscapes and RoadAnomaly datasets demonstrate that\nthe proposed framework achieves state-of-the-art performance.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:54:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Ji",""],["Wu","Xiao",""],["Cheng","Zhi-Qi",""],["He","Qi",""],["Li","Wei",""]]}
{"id":"2308.08697","submitter":"Alan Smeaton","authors":"Sharmistha S. Sawant and Saloni D. Thakare and Derek Greene and\n  Gerardine Meaney and Alan F. Smeaton","title":"Handwriting Analysis on the Diaries of Rosamond Jacob","comments":"International Conference on Content-based Multimedia Indexing,\n  September 20--22, 2023, Orleans, France","journal-ref":null,"doi":"10.1145/3617233.3617255","report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Handwriting is an art form that most people learn at an early age. Each\nperson's writing style is unique with small changes as we grow older and as our\nmood changes. Here we analyse handwritten text in a culturally significant\npersonal diary. We compare changes in handwriting and relate this to the\nsentiment of the written material and to the topic of diary entries. We\nidentify handwritten text from digitised images and generate a canonical form\nfor words using shape matching to compare how the same handwritten word appears\nover a period of time. For determining the sentiment of diary entries, we use\nthe Hedonometer, a dictionary-based approach to scoring sentiment. We apply\nthese techniques to the historical diary entries of Rosamond Jacob (1888-1960),\nan Irish writer and political activist whose daily diary entries report on the\nmajor events in Ireland during the first half of the last century.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:55:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sawant","Sharmistha S.",""],["Thakare","Saloni D.",""],["Greene","Derek",""],["Meaney","Gerardine",""],["Smeaton","Alan F.",""]]}
{"id":"2308.08698","submitter":"Zeyu Kuang","authors":"Zeyu Kuang","title":"Fundamental Limits of Nanophotonic Design","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nanoscale fabrication techniques, computational inverse design, and fields\nfrom silicon photonics to metasurface optics are enabling transformative use of\nan unprecedented number of structural degrees of freedom in nanophotonics. A\ncritical need is to understand the extreme limits to what is possible by\nengineering nanophotonic structures. This thesis establishes the first general\ntheoretical framework identifying fundamental limits to light--matter\ninteractions. It derives bounds for applications across nanophotonics,\nincluding far-field scattering, optimal wavefront shaping, optical beam\nswitching, and wave communication, as well as the miniaturization of optical\ncomponents, including perfect absorbers, linear optical analog computing units,\nresonant optical sensors, multilayered thin films, and high-NA metalenses. The\nbounds emerge from an infinite set of physical constraints that have to be\nsatisfied by polarization fields in response to an excitation. The constraints\nencode power conservation in single-scenario scattering and requisite field\ncorrelations in multi-scenario scattering. The framework developed in this\nthesis, encompassing general linear wave scattering dynamics, offers a new way\nto understand optimal designs and their fundamental limits, in nanophotonics\nand beyond.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 22:56:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kuang","Zeyu",""]]}
{"id":"2308.08699","submitter":"Alina Iacob","authors":"Alina Iacob","title":"Direct limits of Gorenstein injective modules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the open problems in Gorenstein homological algebra is: when is the\nclass of Gorenstein injective modules closed under arbitrary direct limits? It\nis known that if the class of Gorenstein injective modules, $\\mathcal{GI}$, is\nclosed under direct limits, then the ring is noetherian. The open problem is\nwhether or not the converse holds. We give equivalent characterizations of\n$\\mathcal{GI}$ being closed under direct limits. More precisely, we show that\nthe following statements are equivalent:\\\\ (1) The class of Gorenstein\ninjective left $R$-modules is closed under direct limits.\\\\ (2) The ring $R$ is\nleft noetherian and the character module of every Gorenstein injective left\n$R$-module is Gorenstein flat.\\\\ (3) The class of Gorenstein injective modules\nis covering and it is closed under pure quotients.\\\\ (4) $\\mathcal{GI}$ is\nclosed under pure submodules.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:00:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Iacob","Alina",""]]}
{"id":"2308.08700","submitter":"Sumner Harris","authors":"Sumner B. Harris, Arpan Biswas, Seok Joon Yun, Christopher M. Rouleau,\n  Alexander A. Puretzky, Rama K. Vasudevan, David B. Geohegan, and Kai Xiao","title":"Autonomous synthesis of thin film materials with pulsed laser deposition\n  enabled by in situ spectroscopy and automation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synthesis of thin films has traditionally relied upon slow, sequential\nprocesses carried out with substantial human intervention, frequently utilizing\na mix of experience and serendipity to optimize material structure and\nproperties. With recent advances in autonomous systems which combine synthesis,\ncharacterization, and decision making with artificial intelligence (AI), large\nparameter spaces can be explored autonomously at rates beyond what is possible\nby human experimentalists, greatly accelerating discovery, optimization, and\nunderstanding in materials synthesis which directly address the grand\nchallenges in synthesis science. Here, we demonstrate autonomous synthesis of a\ncontemporary 2D material by combining the highly versatile pulsed laser\ndeposition (PLD) technique with automation and machine learning (ML). We\nincorporated in situ and real-time spectroscopy, a high-throughput methodology,\nand cloud connectivity to enable autonomous synthesis workflows with PLD.\nUltrathin WSe2 films were grown using co-ablation of two targets and showed a\n10x increase in throughput over traditional PLD workflows. Gaussian process\nregression and Bayesian optimization were used with in situ Raman spectroscopy\nto autonomously discover two distinct growth windows and the process-property\nrelationship after sampling only 0.25% of a large 4D parameter space. Any\nmaterial that can be grown with PLD could be autonomously synthesized with our\nplatform and workflows, enabling accelerated discovery and optimization of a\nvast number of materials.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:03:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Harris","Sumner B.",""],["Biswas","Arpan",""],["Yun","Seok Joon",""],["Rouleau","Christopher M.",""],["Puretzky","Alexander A.",""],["Vasudevan","Rama K.",""],["Geohegan","David B.",""],["Xiao","Kai",""]]}
{"id":"2308.08701","submitter":"Axel Turnquist","authors":"Axel G. R. Turnquist","title":"Optimal Transport with Defective Cost Functions with Applications to the\n  Lens Refractor Problem","comments":"32 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define and discuss the properties of a class of cost functions on the\nsphere which we term defective cost functions. We discuss how to extend these\ndefinitions and some properties to cost functions defined on Euclidean space\nand on surfaces embedded in Euclidean space. Some important properties of\ndefective cost functions are that they result in Optimal Transport mappings\nwhich map to points along geodesics, have a nonzero mixed Hessian term, among\nother important properties. We also compute the cost-sectional curvature for a\nbroad class of cost functions using the notation built from defining defective\ncost functions and apply the formulas to a few known examples of cost\nfunctions. Finally, we discuss how we can construct a regularity theory for\ndefective cost functions by satisfying the Ma-Trudinger-Wang (MTW) conditions\non an appropriately defined domain. As we develop the regularity theory of\ndefective cost functions, we discuss how the results apply to a particular\ninstance of the far-field lens refractor problem and to cost functions that\nalready fit into the preexisting regularity theory, but now by employing simple\nformulas derived in this paper.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:14:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Turnquist","Axel G. R.",""]]}
{"id":"2308.08702","submitter":"George Chernishev","authors":"Mikhail Firsov, Michael Polyntsov, Kirill Smirnov, George Chernishev","title":"Finding a Second Wind: Speeding Up Graph Traversal Queries in RDBMSs\n  Using Column-Oriented Processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.PF","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recursive queries and recursive derived tables constitute an important part\nof the SQL standard. Their efficient processing is important for many real-life\napplications that rely on graph or hierarchy traversal. Position-enabled\ncolumn-stores offer a novel opportunity to improve run times for this type of\nqueries. Such systems allow the engine to explicitly use data positions (row\nids) inside its core and thus, enable novel efficient implementations of query\nplan operators.\n  In this paper, we present an approach that significantly speeds up recursive\nquery processing inside RDBMSes. Its core idea is to employ a particular aspect\nof column-store technology (late materialization) which enables the query\nengine to manipulate data positions during query execution. Based on it, we\npropose two sets of Volcano-style operators intended to process different query\ncases.\n  In order validate our ideas, we have implemented the proposed approach in\nPosDB, an RDBMS column-store with SQL support. We experimentally demonstrate\nthe viability of our approach by providing a comparison with PostgreSQL.\nExperiments show that for breadth-first search: 1) our position-based approach\nyields up to 6x better results than PostgreSQL, 2) our tuple-based one results\nin only 3x improvement when using a special rewriting technique, but it can\nwork in a larger number of cases, and 3) both approaches can't be emulated in\nrow-stores efficiently.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:17:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Firsov","Mikhail",""],["Polyntsov","Michael",""],["Smirnov","Kirill",""],["Chernishev","George",""]]}
{"id":"2308.08703","submitter":"Markus Reiher","authors":"Nina Glaser, Alberto Baiardi, and Markus Reiher","title":"Flexible DMRG-based framework for anharmonic vibrational calculations","comments":"46 pages, 6 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel formulation of the vibrational density matrix\nrenormalization group (vDMRG) algorithm tailored to strongly anharmonic\nmolecules described by general high-dimensional model representations of\npotential energy surfaces. For this purpose, we extend the vDMRG framework to\nsupport vibrational Hamiltonians expressed in the so-called $n$-mode\nsecond-quantization formalism. The resulting $n$-mode vDMRG method offers full\nflexibility with respect to both the functional form of the PES and the choice\nof single-particle basis set. We leverage this framework to apply, for the\nfirst time, vDMRG based on an anharmonic modal basis set optimized with the\nvibrational self-consistent field algorithm on an on-the-fly constructed PES.\nWe also extend the $n$-mode vDMRG framework to include excited-state targeting\nalgorithms in order to efficiently calculate anharmonic transition frequencies.\nWe demonstrate the capabilities of our novel $n$-mode vDMRG framework for\nmethyloxirane, a challenging molecule with 24 coupled vibrational modes.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:31:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Glaser","Nina",""],["Baiardi","Alberto",""],["Reiher","Markus",""]]}
{"id":"2308.08704","submitter":"Salvatore Stuvard","authors":"Camillo De Lellis, Jonas Hirsch, Andrea Marchese, Luca Spolaor,\n  Salvatore Stuvard","title":"Excess decay for minimizing hypercurrents mod $2Q$","comments":"74 pages, 1 figure. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider codimension $1$ area-minimizing $m$-dimensional currents $T$ mod\nan even integer $p=2Q$ in a $C^2$ Riemannian submanifold $\\Sigma$ of the\nEuclidean space. We prove a suitable excess-decay estimate towards the unique\ntangent cone at every point $q\\in \\mathrm{spt} (T)\\setminus \\mathrm{spt}^p\n(\\partial T)$ where at least one such tangent cone is $Q$ copies of a single\nplane. While an analogous decay statement was proved in arXiv:2111.11202 as a\ncorollary of a more general theory for stable varifolds, in our statement we\nstrive for the optimal dependence of the estimates upon the second fundamental\nform of $\\Sigma$. This technical improvement is in fact needed in\narXiv:2201.10204 to prove that the singular set of $T$ can be decomposed into a\n$C^{1,\\alpha}$ $(m-1)$-dimensional submanifold and an additional closed\nremaining set of Hausdorff dimension at most $m-2$.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:35:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["De Lellis","Camillo",""],["Hirsch","Jonas",""],["Marchese","Andrea",""],["Spolaor","Luca",""],["Stuvard","Salvatore",""]]}
{"id":"2308.08705","submitter":"Xiangyu Liu","authors":"Xiangyu Liu, Kaiqing Zhang","title":"Partially Observable Multi-agent RL with (Quasi-)Efficiency: The\n  Blessing of Information Sharing","comments":"International Conference on Machine Learning (ICML) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.GT cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study provable multi-agent reinforcement learning (MARL) in the general\nframework of partially observable stochastic games (POSGs). To circumvent the\nknown hardness results and the use of computationally intractable oracles, we\nadvocate leveraging the potential \\emph{information-sharing} among agents, a\ncommon practice in empirical MARL, and a standard model for multi-agent control\nsystems with communications. We first establish several computation complexity\nresults to justify the necessity of information-sharing, as well as the\nobservability assumption that has enabled quasi-efficient single-agent RL with\npartial observations, for computational efficiency in solving POSGs. We then\npropose to further \\emph{approximate} the shared common information to\nconstruct an {approximate model} of the POSG, in which planning an approximate\nequilibrium (in terms of solving the original POSG) can be quasi-efficient,\ni.e., of quasi-polynomial-time, under the aforementioned assumptions.\nFurthermore, we develop a partially observable MARL algorithm that is both\nstatistically and computationally quasi-efficient. We hope our study may open\nup the possibilities of leveraging and even designing different\n\\emph{information structures}, for developing both sample- and\ncomputation-efficient partially observable MARL.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:42:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Xiangyu",""],["Zhang","Kaiqing",""]]}
{"id":"2308.08706","submitter":"Dominique Spehner","authors":"Dominique Spehner","title":"Bures geodesics and quantum metrology","comments":"20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study the geodesics on the manifold of mixed quantum states for the Bures\nmetric. It is shown that these geodesics correspond to physical non-Markovian\nevolutions of the system coupled to an ancilla. Furthermore, we argue that\ngeodesics lead to optimal precision in single-parameter estimation in quantum\nmetrology. More precisely, if the unknown parameter is a phase shift\nproportional to the time parametrizing the geodesic, the estimation error\nobtained by processing the data of measurements on the system is equal to the\nsmallest error that can be achieved from joint detections on the system and\nancilla, meaning that the ancilla does not carry any information on this\nparameter. The error can saturate the Heisenberg bound. In addition, the\nmeasurement on the system bringing most information on the parameter is\nparameter-independent and can be determined in terms of the intersections of\nthe geodesic with the boundary of quantum states. These results show that\ngeodesic evolutions are of interest for high-precision detections in systems\ncoupled to an ancilla in the absence of measurements on the ancilla.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:00:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Spehner","Dominique",""]]}
{"id":"2308.08707","submitter":"Yong Niu","authors":"Ziqi Guo, Yong Niu, Shiwen Mao, Ruisi He, Ning Wang, Zhangdui Zhong,\n  Bo Ai","title":"Joint Design of Access and Backhaul in Densely Deployed MmWave Small\n  Cells","comments":"15 pages","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":"  With the rapid growth of mobile data traffic, the shortage of radio spectrum\nresource has become increasingly prominent. Millimeter wave (mmWave) small\ncells can be densely deployed in macro cells to improve network capacity and\nspectrum utilization. Such a network architecture is referred to as mmWave\nheterogeneous cellular networks (HetNets). Compared with the traditional wired\nbackhaul, The integrated access and backhaul (IAB) architecture with wireless\nbackhaul is more flexible and cost-effective for mmWave HetNets. However, the\nimbalance of throughput between the access and backhaul links will constrain\nthe total system throughput. Consequently, it is necessary to jointly design of\nradio access and backhaul link. In this paper, we study the joint optimization\nof user association and backhaul resource allocation in mmWave HetNets, where\ndifferent mmWave bands are adopted by the access and backhaul links.\nConsidering the non-convex and combinatorial characteristics of the\noptimization problem and the dynamic nature of the mmWave link, we propose a\nmulti-agent deep reinforcement learning (MADRL) based scheme to maximize the\nlong-term total link throughput of the network. The simulation results show\nthat the scheme can not only adjust user association and backhaul resource\nallocation strategy according to the dynamics in the access link state, but\nalso effectively improve the link throughput under different system\nconfigurations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:06:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","Ziqi",""],["Niu","Yong",""],["Mao","Shiwen",""],["He","Ruisi",""],["Wang","Ning",""],["Zhong","Zhangdui",""],["Ai","Bo",""]]}
{"id":"2308.08708","submitter":"Robert Long","authors":"Patrick Butlin, Robert Long, Eric Elmoznino, Yoshua Bengio, Jonathan\n  Birch, Axel Constant, George Deane, Stephen M. Fleming, Chris Frith, Xu Ji,\n  Ryota Kanai, Colin Klein, Grace Lindsay, Matthias Michel, Liad Mudrik, Megan\n  A. K. Peters, Eric Schwitzgebel, Jonathan Simon, Rufin VanRullen","title":"Consciousness in Artificial Intelligence: Insights from the Science of\n  Consciousness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CY cs.LG q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Whether current or near-term AI systems could be conscious is a topic of\nscientific interest and increasing public concern. This report argues for, and\nexemplifies, a rigorous and empirically grounded approach to AI consciousness:\nassessing existing AI systems in detail, in light of our best-supported\nneuroscientific theories of consciousness. We survey several prominent\nscientific theories of consciousness, including recurrent processing theory,\nglobal workspace theory, higher-order theories, predictive processing, and\nattention schema theory. From these theories we derive \"indicator properties\"\nof consciousness, elucidated in computational terms that allow us to assess AI\nsystems for these properties. We use these indicator properties to assess\nseveral recent AI systems, and we discuss how future systems might implement\nthem. Our analysis suggests that no current AI systems are conscious, but also\nsuggests that there are no obvious technical barriers to building AI systems\nwhich satisfy these indicators.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:10:16 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:18:34 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 17:33:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Butlin","Patrick",""],["Long","Robert",""],["Elmoznino","Eric",""],["Bengio","Yoshua",""],["Birch","Jonathan",""],["Constant","Axel",""],["Deane","George",""],["Fleming","Stephen M.",""],["Frith","Chris",""],["Ji","Xu",""],["Kanai","Ryota",""],["Klein","Colin",""],["Lindsay","Grace",""],["Michel","Matthias",""],["Mudrik","Liad",""],["Peters","Megan A. K.",""],["Schwitzgebel","Eric",""],["Simon","Jonathan",""],["VanRullen","Rufin",""]]}
{"id":"2308.08709","submitter":"Mirazul Haque","authors":"Mirazul Haque and Wei Yang","title":"Dynamic Neural Network is All You Need: Understanding the Robustness of\n  Dynamic Mechanisms in Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Neural Networks (DNNs) have been used to solve different day-to-day\nproblems. Recently, DNNs have been deployed in real-time systems, and lowering\nthe energy consumption and response time has become the need of the hour. To\naddress this scenario, researchers have proposed incorporating dynamic\nmechanism to static DNNs (SDNN) to create Dynamic Neural Networks (DyNNs)\nperforming dynamic amounts of computation based on the input complexity.\nAlthough incorporating dynamic mechanism into SDNNs would be preferable in\nreal-time systems, it also becomes important to evaluate how the introduction\nof dynamic mechanism impacts the robustness of the models. However, there has\nnot been a significant number of works focusing on the robustness trade-off\nbetween SDNNs and DyNNs. To address this issue, we propose to investigate the\nrobustness of dynamic mechanism in DyNNs and how dynamic mechanism design\nimpacts the robustness of DyNNs. For that purpose, we evaluate three research\nquestions. These evaluations are performed on three models and two datasets.\nThrough the studies, we find that attack transferability from DyNNs to SDNNs is\nhigher than attack transferability from SDNNs to DyNNs. Also, we find that\nDyNNs can be used to generate adversarial samples more efficiently than SDNNs.\nThen, through research studies, we provide insight into the design choices that\ncan increase robustness of DyNNs against the attack generated using static\nmodel. Finally, we propose a novel attack to understand the additional attack\nsurface introduced by the dynamic mechanism and provide design choices to\nimprove robustness against the attack.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:15:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Haque","Mirazul",""],["Yang","Wei",""]]}
{"id":"2308.08710","submitter":"Han Zhang","authors":"Han Zhang, Leijie Wang, Yilun Sheng, Xuhai Xu, Jennifer Mankoff, and\n  Anind K. Dey","title":"A Framework for Designing Fair Ubiquitous Computing Systems","comments":"8 pages, 1 figure, published in 2023 ACM International Joint\n  Conference on Pervasive and Ubiquitous Computing & the 2023 ACM International\n  Symposium on Wearable Computing","journal-ref":null,"doi":"10.1145/3594739.3610677","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past few decades, ubiquitous sensors and systems have been an\nintegral part of humans' everyday life. They augment human capabilities and\nprovide personalized experiences across diverse contexts such as healthcare,\neducation, and transportation. However, the widespread adoption of ubiquitous\ncomputing has also brought forth concerns regarding fairness and equitable\ntreatment. As these systems can make automated decisions that impact\nindividuals, it is essential to ensure that they do not perpetuate biases or\ndiscriminate against specific groups. While fairness in ubiquitous computing\nhas been an acknowledged concern since the 1990s, it remains understudied\nwithin the field. To bridge this gap, we propose a framework that incorporates\nfairness considerations into system design, including prioritizing stakeholder\nperspectives, inclusive data collection, fairness-aware algorithms, appropriate\nevaluation criteria, enhancing human engagement while addressing privacy\nconcerns, and interactive improvement and regular monitoring. Our framework\naims to guide the development of fair and unbiased ubiquitous computing\nsystems, ensuring equal treatment and positive societal impact.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:19:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Han",""],["Wang","Leijie",""],["Sheng","Yilun",""],["Xu","Xuhai",""],["Mankoff","Jennifer",""],["Dey","Anind K.",""]]}
{"id":"2308.08711","submitter":"Toshiyuki Tanisaki","authors":"Toshiyuki Tanisaki","title":"Categories of $D$-modules on a quantized flag manifold","comments":"38pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There are two approaches in defining the category of $D$-modules on a\nquantized flag manifold. One is due to Lunts and Rosenberg based on the\n$\\mathrm{Proj}$- construction of the quantized flag manifold, and the other is\ndue to Backelin and Kremnizer using equivariant $D$-modules on the\ncorresponding quantized algebraic group. In this paper we compare the two\napproaches.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:30:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tanisaki","Toshiyuki",""]]}
{"id":"2308.08712","submitter":"Nathan Schley","authors":"Nathan Schley","title":"Cohomological Kernels for Cyclic by Cyclic Semi-Direct Product\n  Extensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $F$ be a field and $E$ an extension of $F$ with $[E:F]=d$ where the\ncharacteristic of $F$ is zero or prime to $d$. We assume $\\mu_{d^2}\\subset F$\nwhere $\\mu_{d^2}$ are the $d^2$th roots of unity. This paper studies the\nproblem of determining the cohomological kernel $H^n(E/F):=\\ker(H^n(F,\\mu_d)\n\\rightarrow H^n(E,\\mu_d))$ (Galois cohomology with coefficients in the $d$th\nroots of unity) when the Galois closure of $E$ is a semi-direct product of\ncyclic groups. The main result is a six-term exact sequence determining the\nkernel as the middle map and is based on tools of Positelski. When $n=2$ this\nkernel is the relative Brauer group ${\\rm Br}(E/F)$, the classes of central\nsimple algebras in the Brauer group of $F$ split in the field $E$. The work of\nAravire and Jacob which calculated the groups $H^n_{p^m}(E/F)$ in the case of\nsemidirect products of cyclic groups in characteristic $p$, provides motivation\nfor this work.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:30:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schley","Nathan",""]]}
{"id":"2308.08713","submitter":"Anant Singh","authors":"Anant Singh and Akshat Gupta","title":"Decoding Emotions: A comprehensive Multilingual Study of Speech Models\n  for Speech Emotion Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advancements in transformer-based speech representation models have\ngreatly transformed speech processing. However, there has been limited research\nconducted on evaluating these models for speech emotion recognition (SER)\nacross multiple languages and examining their internal representations. This\narticle addresses these gaps by presenting a comprehensive benchmark for SER\nwith eight speech representation models and six different languages. We\nconducted probing experiments to gain insights into inner workings of these\nmodels for SER. We find that using features from a single optimal layer of a\nspeech model reduces the error rate by 32\\% on average across seven datasets\nwhen compared to systems where features from all layers of speech models are\nused. We also achieve state-of-the-art results for German and Persian\nlanguages. Our probing results indicate that the middle layers of speech models\ncapture the most important emotional information for speech emotion\nrecognition.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:30:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Anant",""],["Gupta","Akshat",""]]}
{"id":"2308.08714","submitter":"Minzheng Li","authors":"Minzheng Li, Xiangzhong Fang, Haixin Yang","title":"Probabilistic Results on the Architecture of Mathematical Reasoning\n  Aligned by Cognitive Alternation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We envision a machine capable of solving mathematical problems. Dividing the\nquantitative reasoning system into two parts: thought processes and cognitive\nprocesses, we provide probabilistic descriptions of the architecture.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:35:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Minzheng",""],["Fang","Xiangzhong",""],["Yang","Haixin",""]]}
{"id":"2308.08715","submitter":"Nathaniel Burgdorfer","authors":"Nathaniel Burgdorfer, Philippos Mordohai","title":"V-FUSE: Volumetric Depth Map Fusion with Long-Range Constraints","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a learning-based depth map fusion framework that accepts a set\nof depth and confidence maps generated by a Multi-View Stereo (MVS) algorithm\nas input and improves them. This is accomplished by integrating volumetric\nvisibility constraints that encode long-range surface relationships across\ndifferent views into an end-to-end trainable architecture. We also introduce a\ndepth search window estimation sub-network trained jointly with the larger\nfusion sub-network to reduce the depth hypothesis search space along each ray.\nOur method learns to model depth consensus and violations of visibility\nconstraints directly from the data; effectively removing the necessity of\nfine-tuning fusion parameters. Extensive experiments on MVS datasets show\nsubstantial improvements in the accuracy of the output fused depth and\nconfidence maps.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:39:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Burgdorfer","Nathaniel",""],["Mordohai","Philippos",""]]}
{"id":"2308.08716","submitter":"Evan Crawford","authors":"Miroslav D. Filipovi\\'c and Shi Dai and Bojan Arbutina and Natasha\n  Hurley-Walker and Robert Brose and Werner Becker and Hidetoshi Sano and Dejan\n  Uro\\v{s}evi\\'c and T.H. Jarrett and Andrew M. Hopkins and Rami Z. E. Alsaberi\n  and R. Alsulami and Cristobal Bordiu and Brianna Ball and Filomena Bufano and\n  Christopher Burger-Scheidlin and Evan Crawford and Jayanne English and Frank\n  Haberl and Adriano Ingallinera and Anna D. Kapinska and Patrick J. Kavanagh\n  and B\\\"arbel S. Koribalski and Roland Kothes and Sanja Lazarevi\\'c and\n  Jonathan Mackey and Gavin Rowell and Denis Leahy and Sara Loru and Peter J.\n  Macgregor and Luciano Nicastro and Ray P. Norris and Simone Riggi and Manami\n  Sasaki and Milorad Stupar and Corrado Trigilio and Grazia Umana and Tessa\n  Vernstrom and Branislav Vukoti\\'c","title":"EMU Detection of a Large and Low Surface Brightness Galactic SNR\n  G288.8-6.3","comments":"Accepted for publication in The Astrophysical Journal","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":"  We present the serendipitous detection of a new Galactic Supernova Remnant\n(SNR), G288.8-6.3 using data from the Australian Square Kilometre Array\nPathfinder (ASKAP)-Evolutionary Map of the Universe (EMU) survey. Using\nmulti-frequency analysis, we confirm this object as an evolved Galactic SNR at\nhigh Galactic latitude with low radio surface brightness and typical SNR\nspectral index of $\\alpha = -0.41\\pm0.12$. To determine the magnetic field\nstrength in SNR G288.8-6.3, we present the first derivation of the\nequipartition formulae for SNRs with spectral indices $\\alpha>-0.5$. The\nangular size is $1.\\!^\\circ 8\\times 1.\\!^\\circ 6$ $(107.\\!^\\prime 6 \\times\n98.\\!^\\prime 4)$ and we estimate that its intrinsic size is $\\sim40$pc which\nimplies a distance of $\\sim1.3$kpc and a position of $\\sim140$pc above the\nGalactic plane. This is one of the largest angular size and closest Galactic\nSNRs. Given its low radio surface brightness, we suggest that it is about 13000\nyears old.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:43:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Filipovi\u0107","Miroslav D.",""],["Dai","Shi",""],["Arbutina","Bojan",""],["Hurley-Walker","Natasha",""],["Brose","Robert",""],["Becker","Werner",""],["Sano","Hidetoshi",""],["Uro\u0161evi\u0107","Dejan",""],["Jarrett","T. H.",""],["Hopkins","Andrew M.",""],["Alsaberi","Rami Z. E.",""],["Alsulami","R.",""],["Bordiu","Cristobal",""],["Ball","Brianna",""],["Bufano","Filomena",""],["Burger-Scheidlin","Christopher",""],["Crawford","Evan",""],["English","Jayanne",""],["Haberl","Frank",""],["Ingallinera","Adriano",""],["Kapinska","Anna D.",""],["Kavanagh","Patrick J.",""],["Koribalski","B\u00e4rbel S.",""],["Kothes","Roland",""],["Lazarevi\u0107","Sanja",""],["Mackey","Jonathan",""],["Rowell","Gavin",""],["Leahy","Denis",""],["Loru","Sara",""],["Macgregor","Peter J.",""],["Nicastro","Luciano",""],["Norris","Ray P.",""],["Riggi","Simone",""],["Sasaki","Manami",""],["Stupar","Milorad",""],["Trigilio","Corrado",""],["Umana","Grazia",""],["Vernstrom","Tessa",""],["Vukoti\u0107","Branislav",""]]}
{"id":"2308.08717","submitter":"Jianzong Wang","authors":"Liang Wang, Nan Zhang, Xiaoyang Qu, Jianzong Wang, Jiguang Wan,\n  Guokuan Li, Kaiyu Hu, Guilin Jiang, Jing Xiao","title":"EdgeMA: Model Adaptation System for Real-Time Video Analytics on Edge\n  Devices","comments":"Accepted by 30th International Conference on Neural Information\n  Processing (ICONIP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time video analytics on edge devices for changing scenes remains a\ndifficult task. As edge devices are usually resource-constrained, edge deep\nneural networks (DNNs) have fewer weights and shallower architectures than\ngeneral DNNs. As a result, they only perform well in limited scenarios and are\nsensitive to data drift. In this paper, we introduce EdgeMA, a practical and\nefficient video analytics system designed to adapt models to shifts in\nreal-world video streams over time, addressing the data drift problem. EdgeMA\nextracts the gray level co-occurrence matrix based statistical texture feature\nand uses the Random Forest classifier to detect the domain shift. Moreover, we\nhave incorporated a method of model adaptation based on importance weighting,\nspecifically designed to update models to cope with the label distribution\nshift. Through rigorous evaluation of EdgeMA on a real-world dataset, our\nresults illustrate that EdgeMA significantly improves inference accuracy.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:49:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Liang",""],["Zhang","Nan",""],["Qu","Xiaoyang",""],["Wang","Jianzong",""],["Wan","Jiguang",""],["Li","Guokuan",""],["Hu","Kaiyu",""],["Jiang","Guilin",""],["Xiao","Jing",""]]}
{"id":"2308.08718","submitter":"Kurt Stoeckl","authors":"Kurt Stoeckl","title":"Koszul Operads Governing Props and Wheeled Props","comments":"Questions or comments are most welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.CT math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we construct groupoid coloured operads governing props and\nwheeled props, and show they are Koszul. This is accomplished by new biased\ndefinitions for (wheeled) props, and an extension of the theory of Groebner\nbases for operads to apply to groupoid coloured operads. Using the Koszul\nmachine, we define homotopy (wheeled) props, and show they are not formed by\npolytope based models. Finally, using homotopy transfer theory, we construct\nMassey products for (wheeled) props, show these products characterise the\nformality of these structures, and re-obtain a theorem of Mac Lane on the\nexistence of higher homotopies of (co)commutative Hopf algebras.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:52:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Stoeckl","Kurt",""]]}
{"id":"2308.08719","submitter":"Wenming Zou","authors":"Tianhao Liu, Wenming Zou","title":"Sign-changing solution for logarithmic elliptic equations with critical\n  exponent","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 logarithmic elliptic equations with critical\nexponent\n  \\begin{equation} \\begin{cases} -\\Delta u=\\lambda u+ |u|^{2^*-2}u+\\theta u\\log\nu^2, \\\\ u \\in H_0^1(\\Omega), \\quad \\Omega \\subset \\R^N. \\end{cases}\n\\end{equation} Here, the parameters $N\\geq 6$, $\\lambda\\in \\R$, $\\theta>0$ and\n$ 2^*=\\frac{2N}{N-2} $ is the Sobolev critical exponent. We prove the existence\nof sign-changing solution with exactly two nodal domain for an arbitrary smooth\nbounded domain $\\Omega\\subset \\mathbb{R}^{N}$. When $\\Omega=B_R(0)$ is a ball,\nwe also construct infinitely many radial sign-changing solutions with\nalternating signs and prescribed nodal characteristic.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:10:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Tianhao",""],["Zou","Wenming",""]]}
{"id":"2308.08720","submitter":"Roberto Alvarenga","authors":"Roberto Alvarenga and Nans Bonnel","title":"Hecke eigenspaces for the projective line","comments":"32 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article we investigate the action of (ramified and unramified) Hecke\noperators on automorphic forms for the function field of the projective line\ndefined over a finite field and for the group GL_2. We first compute the\ndimension of the Hecke eigenspaces for every generator of the unramified Hecke\nalgebra. Thus, we consider the ramification in a point of degree one and\ndescribe explicitly the action of certain ramified Hecke operators on\nautomorphic forms. Moreover, for those ramified Hecke operators, we also\ncompute the dimensions of its eigenspaces. We finish the article considering\nmore general ramifications, namely, those one attached to a closed point of\nhigher degree.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:12:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alvarenga","Roberto",""],["Bonnel","Nans",""]]}
{"id":"2308.08721","submitter":"Mengyao Li","authors":"Mengyao Li, Liquan Shen, Peng Ye, Guorui Feng, Zheyin Wang","title":"RFD-ECNet: Extreme Underwater Image Compression with Reference to\n  Feature Dictionar","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Thriving underwater applications demand efficient extreme compression\ntechnology to realize the transmission of underwater images (UWIs) in very\nnarrow underwater bandwidth. However, existing image compression methods\nachieve inferior performance on UWIs because they do not consider the\ncharacteristics of UWIs: (1) Multifarious underwater styles of color shift and\ndistance-dependent clarity, caused by the unique underwater physical imaging;\n(2) Massive redundancy between different UWIs, caused by the fact that\ndifferent UWIs contain several common ocean objects, which have plenty of\nsimilarities in structures and semantics. To remove redundancy among UWIs, we\nfirst construct an exhaustive underwater multi-scale feature dictionary to\nprovide coarse-to-fine reference features for UWI compression. Subsequently, an\nextreme UWI compression network with reference to the feature dictionary\n(RFD-ECNet) is creatively proposed, which utilizes feature match and reference\nfeature variant to significantly remove redundancy among UWIs. To align the\nmultifarious underwater styles and improve the accuracy of feature match, an\nunderwater style normalized block (USNB) is proposed, which utilizes underwater\nphysical priors extracted from the underwater physical imaging model to\nnormalize the underwater styles of dictionary features toward the input.\nMoreover, a reference feature variant module (RFVM) is designed to adaptively\nmorph the reference features, improving the similarity between the reference\nand input features. Experimental results on four UWI datasets show that our\nRFD-ECNet is the first work that achieves a significant BD-rate saving of 31%\nover the most advanced VVC.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:20:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Mengyao",""],["Shen","Liquan",""],["Ye","Peng",""],["Feng","Guorui",""],["Wang","Zheyin",""]]}
{"id":"2308.08722","submitter":"Santiago Beltr\\'an Romero","authors":"S. S. Beltr\\'an-Romero, F. J. Rodr\\'iguez, L. Quiroga, N. F. Johnson","title":"Novel cavity-induced switching between Bell-state textures in a quantum\n  dot","comments":"28 pages, 7 figures, supplementary material is located after the\n  bibliography","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":"  Nanoscale quantum dots in microwave cavities can be used as a laboratory for\nexploring electron-electron interactions and their spin in the presence of\nquantized light and a magnetic field. We show how a simple theoretical model of\nthis interplay at resonance predicts complex but measurable effects. New\npolariton states emerge that combine spin, relative modes, and radiation. These\nstates have intricate spin-space correlations and undergo polariton transitions\ncontrolled by the microwave cavity field. We uncover novel topological effects\ninvolving highly correlated spin and charge density, that display\nsinglet-triplet and inhomogeneous Bell-state distributions. Signatures of these\ntransitions are imprinted in the photon distribution, which will allow for\noptical read out protocols in future experiments and nanoscale quantum\ntechnologies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:31:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beltr\u00e1n-Romero","S. S.",""],["Rodr\u00edguez","F. J.",""],["Quiroga","L.",""],["Johnson","N. F.",""]]}
{"id":"2308.08723","submitter":"Huairui Wang","authors":"Huairui Wang, Nianxiang Fu, Zhenzhong Chen and Shan Liu","title":"Dynamic Kernel-Based Adaptive Spatial Aggregation for Learned Image\n  Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learned image compression methods have shown superior rate-distortion\nperformance and remarkable potential compared to traditional compression\nmethods. Most existing learned approaches use stacked convolution or\nwindow-based self-attention for transform coding, which aggregate spatial\ninformation in a fixed range. In this paper, we focus on extending spatial\naggregation capability and propose a dynamic kernel-based transform coding. The\nproposed adaptive aggregation generates kernel offsets to capture valid\ninformation in the content-conditioned range to help transform. With the\nadaptive aggregation strategy and the sharing weights mechanism, our method can\nachieve promising transform capability with acceptable model complexity.\nBesides, according to the recent progress of entropy model, we define a\ngeneralized coarse-to-fine entropy model, considering the coarse global\ncontext, the channel-wise, and the spatial context. Based on it, we introduce\ndynamic kernel in hyper-prior to generate more expressive global context.\nFurthermore, we propose an asymmetric spatial-channel entropy model according\nto the investigation of the spatial characteristics of the grouped latents. The\nasymmetric entropy model aims to reduce statistical redundancy while\nmaintaining coding efficiency. Experimental results demonstrate that our method\nachieves superior rate-distortion performance on three benchmarks compared to\nthe state-of-the-art learning-based methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:34:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Huairui",""],["Fu","Nianxiang",""],["Chen","Zhenzhong",""],["Liu","Shan",""]]}
{"id":"2308.08724","submitter":"Liying Yang","authors":"Liying Yang, Zhenwei Zhu, Xuxin Lin, Jian Nong, Yanyan Liang","title":"Long-Range Grouping Transformer for Multi-View 3D Reconstruction","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":"  Nowadays, transformer networks have demonstrated superior performance in many\ncomputer vision tasks. In a multi-view 3D reconstruction algorithm following\nthis paradigm, self-attention processing has to deal with intricate image\ntokens including massive information when facing heavy amounts of view input.\nThe curse of information content leads to the extreme difficulty of model\nlearning. To alleviate this problem, recent methods compress the token number\nrepresenting each view or discard the attention operations between the tokens\nfrom different views. Obviously, they give a negative impact on performance.\nTherefore, we propose long-range grouping attention (LGA) based on the\ndivide-and-conquer principle. Tokens from all views are grouped for separate\nattention operations. The tokens in each group are sampled from all views and\ncan provide macro representation for the resided view. The richness of feature\nlearning is guaranteed by the diversity among different groups. An effective\nand efficient encoder can be established which connects inter-view features\nusing LGA and extract intra-view features using the standard self-attention\nlayer. Moreover, a novel progressive upsampling decoder is also designed for\nvoxel generation with relatively high resolution. Hinging on the above, we\nconstruct a powerful transformer-based network, called LRGT. Experimental\nresults on ShapeNet verify our method achieves SOTA accuracy in multi-view\nreconstruction. Code will be available at\nhttps://github.com/LiyingCV/Long-Range-Grouping-Transformer.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:34:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Liying",""],["Zhu","Zhenwei",""],["Lin","Xuxin",""],["Nong","Jian",""],["Liang","Yanyan",""]]}
{"id":"2308.08725","submitter":"Wei Li","authors":"A. Liam Fitzpatrick, Wei Li","title":"Improving Modular Bootstrap Bounds with Integrality","comments":"19 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We implement methods that efficiently impose integrality -- i.e., the\ncondition that the coefficients of characters in the partition function must be\nintegers -- into numerical modular bootstrap. We demonstrate the method with a\nnumber of examples where it can be used to strengthen modular bootstrap\nresults. First, we show that, with a mild extra assumption, imposing\nintegrality improves the bound on the maximal allowed gap in dimensions of\noperators in theories with a $U(1)^c$ symmetry at $c=3$, and reduces it to the\nvalue saturated by the $SU(4)_1$ WZW model point of $c=3$ Narain lattices\nmoduli space. Second, we show that our method can be used to eliminate all but\na discrete set of points saturating the bound from previous Virasoro modular\nbootstrap results. Finally, when central charge is close to $1$, we can\nslightly improve the upper bound on the scaling dimension gap.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:52:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fitzpatrick","A. Liam",""],["Li","Wei",""]]}
{"id":"2308.08726","submitter":"Jason Wu","authors":"Jason Wu, Rebecca Krosnick, Eldon Schoop, Amanda Swearngin, Jeffrey P.\n  Bigham, Jeffrey Nichols","title":"Never-ending Learning of User Interfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning models have been trained to predict semantic information\nabout user interfaces (UIs) to make apps more accessible, easier to test, and\nto automate. Currently, most models rely on datasets that are collected and\nlabeled by human crowd-workers, a process that is costly and surprisingly\nerror-prone for certain tasks. For example, it is possible to guess if a UI\nelement is \"tappable\" from a screenshot (i.e., based on visual signifiers) or\nfrom potentially unreliable metadata (e.g., a view hierarchy), but one way to\nknow for certain is to programmatically tap the UI element and observe the\neffects. We built the Never-ending UI Learner, an app crawler that\nautomatically installs real apps from a mobile app store and crawls them to\ndiscover new and challenging training examples to learn from. The Never-ending\nUI Learner has crawled for more than 5,000 device-hours, performing over half a\nmillion actions on 6,000 apps to train three computer vision models for i)\ntappability prediction, ii) draggability prediction, and iii) screen\nsimilarity.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:54:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Jason",""],["Krosnick","Rebecca",""],["Schoop","Eldon",""],["Swearngin","Amanda",""],["Bigham","Jeffrey P.",""],["Nichols","Jeffrey",""]]}
{"id":"2308.08727","submitter":"Yangtianze Tao","authors":"Yangtianze Tao, Jiayi Kang and Stephen Shing-Toung Yau","title":"Maximum Correntropy Ensemble Kalman Filter","comments":"Accepted by 62nd IEEE Conference on Decision and Control (CDC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, a robust ensemble Kalman filter (EnKF) called MC-EnKF is\nproposed for nonlinear state-space model to deal with filtering problems with\nnon-Gaussian observation noises. Our MC-EnKF is derived based on maximum\ncorrentropy criterion (MCC) with some technical approximations. Moreover, we\npropose an effective adaptive strategy for kernel bandwidth selection.Besides,\nthe relations between the common EnKF and MC-EnKF are given, i.e., MC-EnKF will\nconverge to the common EnKF when the kernel bandwidth tends to infinity. This\njustification provides a complementary understanding of the kernel bandwidth\nselection for MC-EnKF. In experiments, non-Gaussian observation noises\nsignificantly reduce the performance of the common EnKF for both linear and\nnonlinear systems, whereas our proposed MC-EnKF with a suitable kernel\nbandwidth maintains its good performance at only a marginal increase in\ncomputing cost, demonstrating its robustness and efficiency to non-Gaussian\nobservation noises.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:54:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tao","Yangtianze",""],["Kang","Jiayi",""],["Yau","Stephen Shing-Toung",""]]}
{"id":"2308.08728","submitter":"Jia-Rui Lin","authors":"Zhe Zheng, Ke-Yin Chen, Xin-Yu Cao, Xin-Zheng Lu, Jia-Rui Lin","title":"LLM-FuncMapper: Function Identification for Interpreting Complex Clauses\n  in Building Codes via LLM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As a vital stage of automated rule checking (ARC), rule interpretation of\nregulatory texts requires considerable effort. However, interpreting regulatory\nclauses with implicit properties or complex computational logic is still\nchallenging due to the lack of domain knowledge and limited expressibility of\nconventional logic representations. Thus, LLM-FuncMapper, an approach to\nidentifying predefined functions needed to interpret various regulatory clauses\nbased on the large language model (LLM), is proposed. First, by systematically\nanalysis of building codes, a series of atomic functions are defined to capture\nshared computational logics of implicit properties and complex constraints,\ncreating a database of common blocks for interpreting regulatory clauses. Then,\na prompt template with the chain of thought is developed and further enhanced\nwith a classification-based tuning strategy, to enable common LLMs for\neffective function identification. Finally, the proposed approach is validated\nwith statistical analysis, experiments, and proof of concept. Statistical\nanalysis reveals a long-tail distribution and high expressibility of the\ndeveloped function database, with which almost 100% of computer-processible\nclauses can be interpreted and represented as computer-executable codes.\nExperiments show that LLM-FuncMapper achieve promising results in identifying\nrelevant predefined functions for rule interpretation. Further proof of concept\nin automated rule interpretation also demonstrates the possibility of\nLLM-FuncMapper in interpreting complex regulatory clauses. To the best of our\nknowledge, this study is the first attempt to introduce LLM for understanding\nand interpreting complex regulatory clauses, which may shed light on further\nadoption of LLM in the construction domain.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:58:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zheng","Zhe",""],["Chen","Ke-Yin",""],["Cao","Xin-Yu",""],["Lu","Xin-Zheng",""],["Lin","Jia-Rui",""]]}
{"id":"2308.08729","submitter":"Abhay Ashtekar","authors":"Abhay Ashtekar","title":"Black Hole Horizons and their Mechanics","comments":"Invited article for 2nd Edition of the Encyclopedia of Mathematical\n  Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th math-ph math.DG math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Black holes are often characterized by event horizons, following the\nliterature that laid the mathematical foundations of the subject in the 1970s.\nHowever black hole event horizons have two fundamental conceptual limitations.\nFirst, they are defined only in space-times that admit a future conformal\nboundary. Second, they are teleological; their formation and growth is not\ndetermined by local physics but depends on what could happen in the distant\nfuture. Therefore, event horizons have not played much of a role in the recent\ntheoretical advances that were sparked by discoveries of the LIGO-virgo\ncollaborations. This article focuses on quasi-local horizons that have been\nused instead. Laws governing them -- mechanics of quasi-local horizons --\ngeneralize those that were first found using event horizons. These results,\nobtained over the last two decades or so, have provided much insight into\ndynamical predictions of general relativity in the fully nonlinear regime. The\narticle summarizes the deep and multi-faceted interplay between geometry and\nphysics that has emerged. Conceptually, quasi-local horizons also play a key\nrole in the discussion of the quantum evaporation of black holes. However, due\nto space limitations, this application is only briefly discussed in Section 6.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:58:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ashtekar","Abhay",""]]}
{"id":"2308.08730","submitter":"Liyan Wang","authors":"Liyan Wang, Qinyu Yang, Cong Wang, Wei Wang, Jinshan Pan, Zhixun Su","title":"Learning A Coarse-to-Fine Diffusion Transformer for Image Restoration","comments":"9 pages, 8 figures","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 the remarkable performance of diffusion models in\nvarious vision tasks. However, for image restoration that aims to recover clear\nimages with sharper details from given degraded observations, diffusion-based\nmethods may fail to recover promising results due to inaccurate noise\nestimation. Moreover, simple constraining noises cannot effectively learn\ncomplex degradation information, which subsequently hinders the model capacity.\nTo solve the above problems, we propose a coarse-to-fine diffusion Transformer\n(C2F-DFT) for image restoration. Specifically, our C2F-DFT contains diffusion\nself-attention (DFSA) and diffusion feed-forward network (DFN) within a new\ncoarse-to-fine training scheme. The DFSA and DFN respectively capture the\nlong-range diffusion dependencies and learn hierarchy diffusion representation\nto facilitate better restoration. In the coarse training stage, our C2F-DFT\nestimates noises and then generates the final clean image by a sampling\nalgorithm. To further improve the restoration quality, we propose a simple yet\neffective fine training scheme. It first exploits the coarse-trained diffusion\nmodel with fixed steps to generate restoration results, which then would be\nconstrained with corresponding ground-truth ones to optimize the models to\nremedy the unsatisfactory results affected by inaccurate noise estimation.\nExtensive experiments show that C2F-DFT significantly outperforms\ndiffusion-based restoration method IR-SDE and achieves competitive performance\ncompared with Transformer-based state-of-the-art methods on $3$ tasks,\nincluding deraining, deblurring, and real denoising. The code is available at\nhttps://github.com/wlydlut/C2F-DFT.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:59:59 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 11:31:43 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 08:52:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Liyan",""],["Yang","Qinyu",""],["Wang","Cong",""],["Wang","Wei",""],["Pan","Jinshan",""],["Su","Zhixun",""]]}
{"id":"2308.08731","submitter":"Harshala Gammulle","authors":"Harshala Gammulle, Yubo Chen, Sridha Sridharan, Travis Klein and\n  Clinton Fookes","title":"Learning Through Guidance: Knowledge Distillation for Endoscopic Image\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Endoscopy plays a major role in identifying any underlying abnormalities\nwithin the gastrointestinal (GI) tract. There are multiple GI tract diseases\nthat are life-threatening, such as precancerous lesions and other intestinal\ncancers. In the usual process, a diagnosis is made by a medical expert which\ncan be prone to human errors and the accuracy of the test is also entirely\ndependent on the expert's level of experience. Deep learning, specifically\nConvolution Neural Networks (CNNs) which are designed to perform automatic\nfeature learning without any prior feature engineering, has recently reported\ngreat benefits for GI endoscopy image analysis. Previous research has developed\nmodels that focus only on improving performance, as such, the majority of\nintroduced models contain complex deep network architectures with a large\nnumber of parameters that require longer training times. However, there is a\nlack of focus on developing lightweight models which can run in low-resource\nenvironments, which are typically encountered in medical clinics. We\ninvestigate three KD-based learning frameworks, response-based, feature-based,\nand relation-based mechanisms, and introduce a novel multi-head attention-based\nfeature fusion mechanism to support relation-based learning. Compared to the\nexisting relation-based methods that follow simplistic aggregation techniques\nof multi-teacher response/feature-based knowledge, we adopt the multi-head\nattention technique to provide flexibility towards localising and transferring\nimportant details from each teacher to better guide the student. We perform\nextensive evaluations on two widely used public datasets, KVASIR-V2 and\nHyper-KVASIR, and our experimental results signify the merits of our proposed\nrelation-based framework in achieving an improved lightweight model (only 51.8k\ntrainable parameters) that can run in a resource-limited environment.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:02:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gammulle","Harshala",""],["Chen","Yubo",""],["Sridharan","Sridha",""],["Klein","Travis",""],["Fookes","Clinton",""]]}
{"id":"2308.08732","submitter":"Enrique Valderrama Araya Ph.D.","authors":"Aidan S. Wright, Nathaniel P. Youmans, Enrique F. Valderrama Araya\n  (Oral Roberts University)","title":"Recursive Detection and Analysis of Nanoparticles in Scanning Electron\n  Microscopy Images","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cond-mat.mtrl-sci cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we present a computational framework tailored for the precise\ndetection and comprehensive analysis of nanoparticles within scanning electron\nmicroscopy (SEM) images. The primary objective of this framework revolves\naround the accurate localization of nanoparticle coordinates, accompanied by\nsecondary objectives encompassing the extraction of pertinent morphological\nattributes including area, orientation, brightness, and length.\n  Constructed leveraging the robust image processing capabilities of Python,\nparticularly harnessing libraries such as OpenCV, SciPy, and Scikit-Image, the\nframework employs an amalgamation of techniques, including thresholding,\ndilating, and eroding, to enhance the fidelity of image processing outcomes.\n  The ensuing nanoparticle data is seamlessly integrated into the RStudio\nenvironment to facilitate meticulous post-processing analysis. This encompasses\na comprehensive evaluation of model accuracy, discernment of feature\ndistribution patterns, and the identification of intricate particle\narrangements. The finalized framework exhibits high nanoparticle identification\nwithin the primary sample image and boasts 97\\% accuracy in detecting particles\nacross five distinct test images drawn from a SEM nanoparticle dataset.\nFurthermore, the framework demonstrates the capability to discern nanoparticles\nof faint intensity, eluding manual labeling within the control group.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:08:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wright","Aidan S.","","Oral Roberts University"],["Youmans","Nathaniel P.","","Oral Roberts University"],["Araya","Enrique F. Valderrama","","Oral Roberts University"]]}
{"id":"2308.08733","submitter":"Fucai Lin","authors":"Fucai Lin","title":"A note on complementary knowledge spaces","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pair $(Q, \\mathscr{K})$ is a {\\it knowledge space} if\n$\\bigcup\\mathscr{K}=Q$ and $\\mathscr{K}$ is closed under union, where $Q$ is a\nnonempty set and $\\mathscr{K}$ is a family of subsets of $Q$. A knowledge space\n$(Q, \\mathscr{K})$ is called {\\it complementary} if there exists a non-discrete\nknowledge space $(Q, \\mathscr{L})$ such that the following (i) and (ii)\nsatisfy:\n  (i) for any $q\\in Q$, there are finitely many $K_{1}, \\cdots, K_{n}\\in\n\\mathscr{K}$ and $L_{1}, \\cdots, L_{m}\\in \\mathscr{L}$ such that\n$$(\\bigcap_{i=1}^{n}K_{i})\\cap (\\bigcap_{j=1}^{m}L_{j})=\\{q\\};$$ (ii)\n$\\mathscr{K}\\cap \\mathscr{L}=\\{\\emptyset, Q\\}$.\n  In this paper, the existence of a complementary knowledge space for each\nknowledge space is proved, and a method of the construction of complementary\nfinite knowledge spaces is given.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:09:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lin","Fucai",""]]}
{"id":"2308.08734","submitter":"Kyle Hwangbo","authors":"Kyle Hwangbo, John Cenker, Elliott Rosenberg, Qianni Jiang, Haidan\n  Wen, Di Xiao, Jiun-Haw Chu, Xiaodong Xu","title":"Strain Tuning Three-state Potts Nematicity in a Correlated\n  Antiferromagnet","comments":"20 pages, 4 figures, 6 additional figures. Initial submission on May\n  30th","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":"  Electronic nematicity, a state in which rotational symmetry is spontaneously\nbroken, has become a familiar characteristic of many strongly correlated\nmaterials. One widely studied example is the discovered Ising-nematicity and\nits interplay with superconductivity in tetragonal iron pnictides. Since\nnematic directors in crystalline solids are restricted by the underlying\ncrystal symmetry, recently identified quantum material systems with three-fold\nrotational (C3) symmetry offer a new platform to investigate nematic order with\nthree-state Potts character. Here, we report reversible strain tuning of the\nthree-state Potts nematicity in a zigzag antiferromagnetic insulator, FePSe3.\nProbing the nematicity via optical linear dichroism, we demonstrate either\n2{\\pi}/3 or {\\pi}/2 rotation of nematic director by uniaxial strain. The nature\nof the nematic phase transition can also be controlled such that it undergoes a\nsmooth crossover transition, a Potts nematic transition, or a Ising nematic\nflop transition. The ability to tune the nematic order with in-situ strain\nfurther enables the extraction of nematic susceptibility, which exhibits a\ndivergent behavior near the magnetic ordering temperature. Our work points to\nan active control approach to manipulate and explore nematicity in three-state\nPotts correlated materials.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:11:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hwangbo","Kyle",""],["Cenker","John",""],["Rosenberg","Elliott",""],["Jiang","Qianni",""],["Wen","Haidan",""],["Xiao","Di",""],["Chu","Jiun-Haw",""],["Xu","Xiaodong",""]]}
{"id":"2308.08735","submitter":"Yaohua Hu","authors":"Yu Wang, Shengjie Li, Yaohua Hu, Minghua Li, Xiaobing Li","title":"The Behavior of Error Bounds via Moreau Envelopes","comments":"12 pages","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 first establish the equivalence of three types of error\nbounds: uniformized Kurdyka-{\\L}ojasiewicz (u-KL) property, uniformized\nlevel-set subdifferential error bound (u-LSEB) and uniformized H\\\"{o}lder error\nbound (u-HEB) for prox-regular functions. Then we study the behavior of the\nlevel-set subdifferential error bound (LSEB) and the local H\\\"{o}lder error\nbound (LHEB) which is expressed respectively by Moreau envelopes, under\nsuitable assumptions. Finally, in order to illustrate our main results and to\ncompare them with those of recent references, some examples are also given.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:13:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yu",""],["Li","Shengjie",""],["Hu","Yaohua",""],["Li","Minghua",""],["Li","Xiaobing",""]]}
{"id":"2308.08736","submitter":"Xingfang Wu","authors":"Xingfang Wu, Heng Li, Foutse Khomh","title":"On the Effectiveness of Log Representation for Log-based Anomaly\n  Detection","comments":"Accepted by Journal of Empirical Software Engineering (EMSE)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Logs are an essential source of information for people to understand the\nrunning status of a software system. Due to the evolving modern software\narchitecture and maintenance methods, more research efforts have been devoted\nto automated log analysis. In particular, machine learning (ML) has been widely\nused in log analysis tasks. In ML-based log analysis tasks, converting textual\nlog data into numerical feature vectors is a critical and indispensable step.\nHowever, the impact of using different log representation techniques on the\nperformance of the downstream models is not clear, which limits researchers and\npractitioners' opportunities of choosing the optimal log representation\ntechniques in their automated log analysis workflows. Therefore, this work\ninvestigates and compares the commonly adopted log representation techniques\nfrom previous log analysis research. Particularly, we select six log\nrepresentation techniques and evaluate them with seven ML models and four\npublic log datasets (i.e., HDFS, BGL, Spirit and Thunderbird) in the context of\nlog-based anomaly detection. We also examine the impacts of the log parsing\nprocess and the different feature aggregation approaches when they are employed\nwith log representation techniques. From the experiments, we provide some\nheuristic guidelines for future researchers and developers to follow when\ndesigning an automated log analysis workflow. We believe our comprehensive\ncomparison of log representation techniques can help researchers and\npractitioners better understand the characteristics of different log\nrepresentation techniques and provide them with guidance for selecting the most\nsuitable ones for their ML-based log analysis workflow.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:18:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Xingfang",""],["Li","Heng",""],["Khomh","Foutse",""]]}
{"id":"2308.08737","submitter":"Tejaswini Manjunath","authors":"Tejaswini Manjunath, Mozhgan Navardi, Prakhar Dixit, Bharat Prakash,\n  Tinoosh Mohsenin","title":"ReProHRL: Towards Multi-Goal Navigation in the Real World using\n  Hierarchical Agents","comments":"AAAI 2023 RL Ready for Production Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robots have been successfully used to perform tasks with high precision. In\nreal-world environments with sparse rewards and multiple goals, learning is\nstill a major challenge and Reinforcement Learning (RL) algorithms fail to\nlearn good policies. Training in simulation environments and then fine-tuning\nin the real world is a common approach. However, adapting to the real-world\nsetting is a challenge. In this paper, we present a method named Ready for\nProduction Hierarchical RL (ReProHRL) that divides tasks with hierarchical\nmulti-goal navigation guided by reinforcement learning. We also use object\ndetectors as a pre-processing step to learn multi-goal navigation and transfer\nit to the real world. Empirical results show that the proposed ReProHRL method\noutperforms the state-of-the-art baseline in simulation and real-world\nenvironments in terms of both training time and performance. Although both\nmethods achieve a 100% success rate in a simple environment for single\ngoal-based navigation, in a more complex environment and multi-goal setting,\nthe proposed method outperforms the baseline by 18% and 5%, respectively. For\nthe real-world implementation and proof of concept demonstration, we deploy the\nproposed method on a nano-drone named Crazyflie with a front camera to perform\nmulti-goal navigation experiments.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:23:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Manjunath","Tejaswini",""],["Navardi","Mozhgan",""],["Dixit","Prakhar",""],["Prakash","Bharat",""],["Mohsenin","Tinoosh",""]]}
{"id":"2308.08738","submitter":"I. V. Kanatchikov","authors":"I.V. Kanatchikov","title":"The Quantum Waves of Minkowski Spacetime And The Minimal Acceleration\n  From Precanonical Quantum Gravity","comments":"10 pp. Appeared as doi:10.1088/1742-6596/2533/1/012037 in DICE2022\n  Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct the simplest solutions of the previously obtained precanonical\nSchr\\\"odinger equation for quantum gravity, which correspond to the plane waves\non the spin connection bundle and reproduce the Minkowski spacetime on average.\nQuantum fluctuations lead to the emergence of the minimal acceleration $a_0$\nrelated to the range of the Yukawa modes in the fibers of the spin connection\nbundle. This minimal acceleration is proportional to the square root of the\ncosmological constant $\\Lambda$ generated by the operator re-ordering in the\nprecanonical Schr\\\"odinger equation. Thus the mysterious connection between the\nminimal acceleration $a_0$ in the dynamics of galaxies as described by\nMilgrom's MOND and the cosmological constant emerges as an elementary effect of\nprecanonical quantum gravity. We also argue that the observable values of $a_0$\nand $\\Lambda$ can be obtained when the scale of the parameter $\\varkappa$\nintroduced by precanonical quantization is subnuclear, in agreement with the\npreviously established connection between the scale of $\\varkappa$ and the mass\ngap in quantum SU(2) Yang-Mills theory.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:24:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kanatchikov","I. V.",""]]}
{"id":"2308.08739","submitter":"Yuanzhen Luo","authors":"Yuanzhen Luo, Qingyu Zhou and Feng Zhou","title":"Enhancing Phrase Representation by Information Bottleneck Guided Text\n  Diffusion Process for Keyphrase Extraction","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Keyphrase extraction (KPE) is an important task in Natural Language\nProcessing for many scenarios, which aims to extract keyphrases that are\npresent in a given document. Many existing supervised methods treat KPE as\nsequential labeling, span-level classification, or generative tasks. However,\nthese methods lack the ability to utilize keyphrase information, which may\nresult in biased results. In this study, we propose Diff-KPE, which leverages\nthe supervised Variational Information Bottleneck (VIB) to guide the text\ndiffusion process for generating enhanced keyphrase representations. Diff-KPE\nfirst generates the desired keyphrase embeddings conditioned on the entire\ndocument and then injects the generated keyphrase embeddings into each phrase\nrepresentation. A ranking network and VIB are then optimized together with rank\nloss and classification loss, respectively. This design of Diff-KPE allows us\nto rank each candidate phrase by utilizing both the information of keyphrases\nand the document. Experiments show that Diff-KPE outperforms existing KPE\nmethods on a large open domain keyphrase extraction benchmark, OpenKP, and a\nscientific domain dataset, KP20K.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:26:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","Yuanzhen",""],["Zhou","Qingyu",""],["Zhou","Feng",""]]}
{"id":"2308.08740","submitter":"Zhe Wang","authors":"Rui Bao, Lvbin Song, Zhiwei Fang, Jinmin Chen, Zhe Wang, Jian Liu,\n  Lang Gao, Zhaoxiang Liu, Zhihao Zhang, Min Wang, Haisu Zhang, and Ya Cheng","title":"On-chip coherent beam combination of waveguide amplifiers on\n  Er$^{3+}$-doped thin film lithium niobate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate on-chip coherent beam combination of two waveguide amplifiers\non Er$^{3+}$-doped thin film lithium niobate (Er: TFLN) platform. Our device is\nbuilt based on an electro-optic modulator fabricated on Er: TFLN. The output\npower of the coherently combined amplifiers is measured as high as 12.9 mW,\nsurpassing that of previous single waveguide amplifiers based on\nEr$^{3+}$-doped thin film lithium niobate platform.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:28:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bao","Rui",""],["Song","Lvbin",""],["Fang","Zhiwei",""],["Chen","Jinmin",""],["Wang","Zhe",""],["Liu","Jian",""],["Gao","Lang",""],["Liu","Zhaoxiang",""],["Zhang","Zhihao",""],["Wang","Min",""],["Zhang","Haisu",""],["Cheng","Ya",""]]}
{"id":"2308.08741","submitter":"Jiazhao Zhang","authors":"Yijie Tang, Jiazhao Zhang, Zhinan Yu, He Wang, Kai Xu","title":"MIPS-Fusion: Multi-Implicit-Submaps for Scalable and Robust Online\n  Neural RGB-D Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce MIPS-Fusion, a robust and scalable online RGB-D reconstruction\nmethod based on a novel neural implicit representation --\nmulti-implicit-submap. Different from existing neural RGB-D reconstruction\nmethods lacking either flexibility with a single neural map or scalability due\nto extra storage of feature grids, we propose a pure neural representation\ntackling both difficulties with a divide-and-conquer design. In our method,\nneural submaps are incrementally allocated alongside the scanning trajectory\nand efficiently learned with local neural bundle adjustments. The submaps can\nbe refined individually in a back-end optimization and optimized jointly to\nrealize submap-level loop closure. Meanwhile, we propose a hybrid tracking\napproach combining randomized and gradient-based pose optimizations. For the\nfirst time, randomized optimization is made possible in neural tracking with\nseveral key designs to the learning process, enabling efficient and robust\ntracking even under fast camera motions. The extensive evaluation demonstrates\nthat our method attains higher reconstruction quality than the state of the\narts for large-scale scenes and under fast camera motions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:33:16 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 15:43:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tang","Yijie",""],["Zhang","Jiazhao",""],["Yu","Zhinan",""],["Wang","He",""],["Xu","Kai",""]]}
{"id":"2308.08742","submitter":"Xiaopeng Li","authors":"Xiaopeng Li, Shasha Li, Shezheng Song, Jing Yang, Jun Ma, and Jie Yu","title":"PMET: Precise Model Editing in a Transformer","comments":"Preprint. Under review","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":"  Model editing techniques modify a minor proportion of knowledge in Large\nLanguage Models (LLMs) at a relatively low cost, which have demonstrated\nnotable success. Existing methods assume Transformer Layer (TL) hidden states\nare values of key-value memories of the Feed-Forward Network (FFN). They\nusually optimize the TL hidden states to memorize target knowledge and use it\nto update the weights of the FFN in LLMs. However, the information flow of TL\nhidden states comes from three parts: Multi-Head Self-Attention (MHSA), FFN,\nand residual connections. Existing methods neglect the fact that the TL hidden\nstates contains information not specifically required for FFN. Consequently,\nthe performance of model editing decreases. To achieve more precise model\nediting, we analyze hidden states of MHSA and FFN, finding that MHSA encodes\ncertain general knowledge extraction patterns. This implies that MHSA weights\ndo not require updating when new knowledge is introduced. Based on above\nfindings, we introduce PMET, which simultaneously optimizes Transformer\nComponent (TC, namely MHSA and FFN) hidden states, while only using the\noptimized TC hidden states of FFN to precisely update FFN weights. Our\nexperiments demonstrate that PMET exhibits state-of-the-art performance on both\nthe COUNTERFACT and zsRE datasets. Our ablation experiments substantiate the\neffectiveness of our enhancements, further reinforcing the finding that the\nMHSA encodes certain general knowledge extraction patterns and indicating its\nstorage of a small amount of factual knowledge. Our code is available at\nhttps://github.com/xpq-tech/PMET.git.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:33:43 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 03:19:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Xiaopeng",""],["Li","Shasha",""],["Song","Shezheng",""],["Yang","Jing",""],["Ma","Jun",""],["Yu","Jie",""]]}
{"id":"2308.08743","submitter":"Shiladitya Sengupta","authors":"Santu Nath and Shiladitya Sengupta","title":"Is the glassy dynamics same in 2D as in 3D? The Adam Gibbs relation test","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has been recognized of late that even amorphous, glass-forming materials\nin two dimensions (2D) are significantly affected by Mermin-Wagner type long\nwavelength thermal fluctuation which is inconsequential in three (3D) and\nhigher dimensions. Thus any study of glassy dynamics in 2D should first remove\nthe effect of such fluctuations. The present work considers the question of\nwhether the role of spatial dimension on glassy dynamics is only limited to\nsuch fluctuations, or whether the nature of glassy dynamics is intrinsically\ndifferent in 2D. We address this issue by studying the relationship between\ndynamics and thermodynamics within the framework of the Adam-Gibbs (AG)\nrelation and its generalization the Random First Order Transition (RFOT)\ntheory. Using two model glass-forming liquids we find that even after removing\nthe effect of long wavelength fluctuations, the AG relation breaks down in two\ndimensions. Then we consider the effect of anharmonicity of vibrational entropy\n- a second factor highlighted recently that can qualitatively change the nature\nof dynamics. We explicitly compute the configurational entropy both with and\nwithout the anharmonic correction. We show that the anharmonic correction\nreduces the extent of deviation from the AG relation, but even after taking\ninto account its effects, the AG relation still breaks down in 2D. It is also\nmore prominent if one considers diffusion coefficient rather than\n$\\alpha$-relaxation time. Overall, the impact of the anharmonicity of vibration\nis larger than the long wavelength fluctuation in determining the qualitative\nrelation between timescales and entropy. The extent and nature of deviation\nfrom the AG relation crucially depends on the attractive vs. repulsive nature\nof the inter-particle interaction. Thus our results suggest that the glassy\ndynamics in 2D may be intrinsically different from that in 3D.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:37:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nath","Santu",""],["Sengupta","Shiladitya",""]]}
{"id":"2308.08744","submitter":"Andrew Musser","authors":"Suman Gunasekaran, Ryan F. Pinard, Andrew J. Musser","title":"Continuum model of strong light-matter coupling for molecular polaritons","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":"  Strong coupling between light and matter generates hybrid polaritons. We\npresent a continuum model that describes the polaritons by light and matter\ndensities of states (DOS) that only depend on the refractive index of the\nmaterial. This model is applied to molecular polaritons derived from molecules\nwith broad spectral absorption. While the photonic DOS has a complex spectral\ndistribution, the matter DOS is largely unmodified by strong coupling. We argue\nthat bright states cannot be partitioned from dark states, and instead the\nphotonic DOS is shared over a vast number of matter states.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:48:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gunasekaran","Suman",""],["Pinard","Ryan F.",""],["Musser","Andrew J.",""]]}
{"id":"2308.08745","submitter":"Masaaki Fukasawa","authors":"Masayuki Ando and Masaaki Fukasawa","title":"When to efficiently rebalance a portfolio","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A constant weight asset allocation is a popular investment strategy and is\noptimal under a suitable continuous model. We study the tracking error for the\ntarget continuous rebalancing strategy by a feasible discrete-in-time\nrebalancing under a general multi-dimensional Brownian semimartingale model of\nasset prices. In a high-frequency asymptotic framework, we derive an\nasymptotically efficient sequence of simple predictable strategies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:50:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ando","Masayuki",""],["Fukasawa","Masaaki",""]]}
{"id":"2308.08746","submitter":"Wenxi Yue","authors":"Wenxi Yue, Jing Zhang, Kun Hu, Yong Xia, Jiebo Luo, Zhiyong Wang","title":"SurgicalSAM: Efficient Class Promptable Surgical Instrument Segmentation","comments":"Technical Report. The source code will be released at\n  https://github.com/wenxi-yue/SurgicalSAM","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":"  The Segment Anything Model (SAM) is a powerful foundation model that has\nrevolutionised image segmentation. To apply SAM to surgical instrument\nsegmentation, a common approach is to locate precise points or boxes of\ninstruments and then use them as prompts for SAM in a zero-shot manner.\nHowever, we observe two problems with this naive pipeline: (1) the domain gap\nbetween natural objects and surgical instruments leads to poor generalisation\nof SAM; and (2) SAM relies on precise point or box locations for accurate\nsegmentation, requiring either extensive manual guidance or a well-performing\nspecialist detector for prompt preparation, which leads to a complex\nmulti-stage pipeline. To address these problems, we introduce SurgicalSAM, a\nnovel end-to-end efficient-tuning approach for SAM to effectively integrate\nsurgical-specific information with SAM's pre-trained knowledge for improved\ngeneralisation. Specifically, we propose a lightweight prototype-based class\nprompt encoder for tuning, which directly generates prompt embeddings from\nclass prototypes and eliminates the use of explicit prompts for improved\nrobustness and a simpler pipeline. In addition, to address the low inter-class\nvariance among surgical instrument categories, we propose contrastive prototype\nlearning, further enhancing the discrimination of the class prototypes for more\naccurate class prompting. The results of extensive experiments on both\nEndoVis2018 and EndoVis2017 datasets demonstrate that SurgicalSAM achieves\nstate-of-the-art performance while only requiring a small number of tunable\nparameters. The source code will be released at\nhttps://github.com/wenxi-yue/SurgicalSAM.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:51:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yue","Wenxi",""],["Zhang","Jing",""],["Hu","Kun",""],["Xia","Yong",""],["Luo","Jiebo",""],["Wang","Zhiyong",""]]}
{"id":"2308.08747","submitter":"Yun Luo","authors":"Yun Luo and Zhen Yang and Fandong Meng and Yafu Li and Jie Zhou and\n  Yue Zhang","title":"An Empirical Study of Catastrophic Forgetting in Large Language Models\n  During Continual Fine-tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Catastrophic forgetting (CF) is a phenomenon that occurs in machine learning\nwhen a model forgets previously learned information as it learns new\ninformation. As large language models (LLMs) have shown excellent performance,\nit is interesting to uncover whether CF exists in the continual fine-tuning of\nLLMs. In this study, we empirically evaluate the forgetting phenomenon in LLMs'\nknowledge, from the perspectives of domain knowledge, reasoning, and reading\ncomprehension. The experiments demonstrate that catastrophic forgetting is\ngenerally observed in LLMs ranging from 1b to 7b. Furthermore, as the scale\nincreases, the severity of forgetting also intensifies. Comparing the\ndecoder-only model BLOOMZ with the encoder-decoder model mT0, BLOOMZ suffers\nless forgetting and maintains more knowledge. We also observe that LLMs can\nmitigate language bias (e.g. gender bias) during continual fine-tuning.\nMoreover, we find that ALPACA can maintain more knowledge and capacity compared\nwith LLAMA during the continual fine-tuning, which implies that general\ninstruction tuning can help mitigate the forgetting phenomenon of LLMs in the\nfurther fine-tuning process.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:53:23 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 08:18:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Yun",""],["Yang","Zhen",""],["Meng","Fandong",""],["Li","Yafu",""],["Zhou","Jie",""],["Zhang","Yue",""]]}
{"id":"2308.08748","submitter":"Yuanhang Liu","authors":"Yuanhang Liu, Weijia Wu, Donghui Yang","title":"Optimal Actuator Location of the Norm Optimal Controls for Degenerate\n  Parabolic Equations","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 focuses on investigating the optimal actuator location for\nachieving minimum norm controls in the context of approximate controllability\nfor degenerate parabolic equations. We propose a formulation of the\noptimization problem that encompasses both the actuator location and its\nassociated minimum norm control. Specifically, we transform the problem into a\ntwo-person zero-sum game problem, resulting in the development of four\nequivalent formulations. Finally, we establish the crucial result that the\nsolution to the relaxed optimization problem serves as an optimal actuator\nlocation for the classical problem.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:54:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Yuanhang",""],["Wu","Weijia",""],["Yang","Donghui",""]]}
{"id":"2308.08749","submitter":"Wataru Horiuchi","authors":"H. Moriya, W. Horiuchi, B. Zhou","title":"Novel approach to the removal of the Pauli-forbidden states in the\n  orthogonality condition model: A case of multi-$\\alpha$ systems","comments":"7 pages, 3 figures, to appear in the European Physical Journal A","journal-ref":null,"doi":null,"report-no":"NITEP 182","categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose to use a basis function constructed based on the microscopic\ncluster model for an efficient description of multi-cluster systems with the\northogonality condition originating from the Pauli principle. The basis\nfunction is expressed analytically by a superposition of correlated Gaussian\nfunctions. We demonstrate the power of this approach by taking an example of a\n$3\\alpha$ system, $^{12}$C. A comparison with the conventional pseudopotential\nmethod using the projection operator is made. The present method offers\nefficient and numerically stable computations as the number of basis functions\nis significantly reduced compared to the conventional method. We show that the\npresent basis function includes reasonably small components of the\nPauli-forbidden states, allowing us to discuss simply the structure of the\nfirst excited $0^+$ state, Hoyle state.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:56:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Moriya","H.",""],["Horiuchi","W.",""],["Zhou","B.",""]]}
{"id":"2308.08750","submitter":"Xing-Ri Jin","authors":"Gang Li, Ying-Qiao Zhang and Xing-Ri Jin","title":"Nonreciprocal photon transport in indirectly coupled whispering-gallery\n  mode resonators","comments":"9 pages, 6 figures, 47 references","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the reflection and transmission properties of a system comprising\ntwo whispering-gallery mode resonators, each containing a Zeeman-split quantum\ndot and side-coupled to an optical fiber. Our results demonstrate that\nunidirectional reflection and transmission can be achieved by tuning the\ncoupling strength between the resonators and the optical fiber. Furthermore, we\nestablish a correspondence between quantum dot energy level resonance\nfrequencies and the positions of low reflection (transmission) peaks at a phase\nshift of {\\pi}. This research provides insights for the development of quantum\noptical devices like isolators, circulators, and routers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 02:58:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Gang",""],["Zhang","Ying-Qiao",""],["Jin","Xing-Ri",""]]}
{"id":"2308.08751","submitter":"Omar Al Ghattas","authors":"Omar Al Ghattas, Jiajun Bao, Daniel Sanz-Alonso","title":"Ensemble Kalman Filters with Resampling","comments":"32 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.NA cs.SY math.NA math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Filtering is concerned with online estimation of the state of a dynamical\nsystem from partial and noisy observations. In applications where the state of\nthe system is high dimensional, ensemble Kalman filters are often the method of\nchoice. These algorithms rely on an ensemble of interacting particles to\nsequentially estimate the state as new observations become available. Despite\nthe practical success of ensemble Kalman filters, theoretical understanding is\nhindered by the intricate dependence structure of the interacting particles.\nThis paper investigates ensemble Kalman filters that incorporate an additional\nresampling step to break the dependency between particles. The new algorithm is\namenable to a theoretical analysis that extends and improves upon those\navailable for filters without resampling, while also performing well in\nnumerical examples.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:01:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ghattas","Omar Al",""],["Bao","Jiajun",""],["Sanz-Alonso","Daniel",""]]}
{"id":"2308.08752","submitter":"Yuanhang Liu","authors":"Yuanhang Liu, Weijia Wu, Donghui Yang","title":"Null controllability of two kinds of coupled parabolic systems with\n  switching control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The focus of this paper is on the null controllability of two kinds of\ncoupled systems including both degenerate and non-degenerate equations with\nswitching control. We first establish the observability inequality for\nmeasurable subsets in time for such coupled system, and then by the HUM method\nto obtain the null controllability. Next, we investigate the null\ncontrollability of such coupled system for segmented time intervals. Notably,\nthese results are obtained through spectral inequalities rather than using the\nmethod of Carleman estimates. Such coupled systems with switching control, to\nthe best of our knowledge, are among the first to discuss.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:02:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Yuanhang",""],["Wu","Weijia",""],["Yang","Donghui",""]]}
{"id":"2308.08753","submitter":"Xiaoli Meng","authors":"Lubing Zhou, Xiaoli Meng, Yiluan Guo, Jiong Yang","title":"BOTT: Box Only Transformer Tracker for 3D Object Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Tracking 3D objects is an important task in autonomous driving. Classical\nKalman Filtering based methods are still the most popular solutions. However,\nthese methods require handcrafted designs in motion modeling and can not\nbenefit from the growing data amounts. In this paper, Box Only Transformer\nTracker (BOTT) is proposed to learn to link 3D boxes of the same object from\nthe different frames, by taking all the 3D boxes in a time window as input.\nSpecifically, transformer self-attention is applied to exchange information\nbetween all the boxes to learn global-informative box embeddings. The\nsimilarity between these learned embeddings can be used to link the boxes of\nthe same object. BOTT can be used for both online and offline tracking modes\nseamlessly. Its simplicity enables us to significantly reduce engineering\nefforts required by traditional Kalman Filtering based methods. Experiments\nshow BOTT achieves competitive performance on two largest 3D MOT benchmarks:\n69.9 and 66.7 AMOTA on nuScenes validation and test splits, respectively, 56.45\nand 59.57 MOTA L2 on Waymo Open Dataset validation and test splits,\nrespectively. This work suggests that tracking 3D objects by learning features\ndirectly from 3D boxes using transformers is a simple yet effective way.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:04:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhou","Lubing",""],["Meng","Xiaoli",""],["Guo","Yiluan",""],["Yang","Jiong",""]]}
{"id":"2308.08754","submitter":"Jun Zhou","authors":"Wei Song, Jun Zhou, Mingjie Wang, Hongchen Tan, Nannan Li, Xiuping Liu","title":"Fine-grained Text and Image Guided Point Cloud Completion with CLIP\n  Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper focuses on the recently popular task of point cloud completion\nguided by multimodal information. Although existing methods have achieved\nexcellent performance by fusing auxiliary images, there are still some\ndeficiencies, including the poor generalization ability of the model and\ninsufficient fine-grained semantic information for extracted features. In this\nwork, we propose a novel multimodal fusion network for point cloud completion,\nwhich can simultaneously fuse visual and textual information to predict the\nsemantic and geometric characteristics of incomplete shapes effectively.\nSpecifically, to overcome the lack of prior information caused by the\nsmall-scale dataset, we employ a pre-trained vision-language model that is\ntrained with a large amount of image-text pairs. Therefore, the textual and\nvisual encoders of this large-scale model have stronger generalization ability.\nThen, we propose a multi-stage feature fusion strategy to fuse the textual and\nvisual features into the backbone network progressively. Meanwhile, to further\nexplore the effectiveness of fine-grained text descriptions for point cloud\ncompletion, we also build a text corpus with fine-grained descriptions, which\ncan provide richer geometric details for 3D shapes. The rich text descriptions\ncan be used for training and evaluating our network. Extensive quantitative and\nqualitative experiments demonstrate the superior performance of our method\ncompared to state-of-the-art point cloud completion networks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:05:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Song","Wei",""],["Zhou","Jun",""],["Wang","Mingjie",""],["Tan","Hongchen",""],["Li","Nannan",""],["Liu","Xiuping",""]]}
{"id":"2308.08755","submitter":"Hang Ren","authors":"Hang Ren, Yipei Zhang, Ze Zheng, Cuifeng Ying, Lei Xu, Mohsen Rahmani,\n  K. Birgitta Whaley","title":"Error Mitigated Metasurface-Based Randomized Measurement Schemes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Estimating properties of quantum states via randomized measurements has come\nto play a significant role in quantum information science. In this paper, we\ndesign an innovative approach leveraging metasurfaces to perform randomized\nmeasurements on photonic qubits, together with error mitigation techniques that\nsuppress realistic metasurface measurement noise. Through fidelity and purity\nestimation, we confirm the capability of metasurfaces to implement randomized\nmeasurements and the unbiased nature of our error-mitigated estimator. Our\nfindings show the potential of metasurface-based randomized measurement schemes\nin achieving robust and resource-efficient estimation of quantum state\nproperties.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:07:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ren","Hang",""],["Zhang","Yipei",""],["Zheng","Ze",""],["Ying","Cuifeng",""],["Xu","Lei",""],["Rahmani","Mohsen",""],["Whaley","K. Birgitta",""]]}
{"id":"2308.08756","submitter":"Jiahao Cheng","authors":"Jiahao Cheng","title":"Real-Time Construction Algorithm of Co-Occurrence Network Based on\n  Inverted Index","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Co-occurrence networks are an important method in the field of natural\nlanguage processing and text mining for discovering semantic relationships\nwithin texts. However, the traditional traversal algorithm for constructing\nco-occurrence networks has high time complexity and space complexity when\ndealing with large-scale text data. In this paper, we propose an optimized\nalgorithm based on inverted indexing and breadth-first search to improve the\nefficiency of co-occurrence network construction and reduce memory consumption.\nFirstly, the traditional traversal algorithm is analyzed, and its performance\nissues in constructing co-occurrence networks are identified. Then, the\ndetailed implementation process of the optimized algorithm is presented.\nSubsequently, the CSL large-scale Chinese scientific literature dataset is used\nfor experimental validation, comparing the performance of the traditional\ntraversal algorithm and the optimized algorithm in terms of running time and\nmemory usage. Finally, using non-parametric test methods, the optimized\nalgorithm is proven to have significantly better performance than the\ntraditional traversal algorithm. The research in this paper provides an\neffective method for the rapid construction of co-occurrence networks,\ncontributing to the further development of the Information Organization fields.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:09:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cheng","Jiahao",""]]}
{"id":"2308.08757","submitter":"Ben Adenbaum","authors":"Ben Adenbaum","title":"On the Order of P-Strict Promotion on $V\\times [\\ell]$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Denote by $V$ the poset consisting of the elements $\\{A,B,C\\}$ with cover\nrelations $\\{A\\lessdot B, A\\lessdot C\\}$. We show that $P$-strict promotion, as\ndefined by Bernstein, Striker, and Vorland, on $P$-strict labelings of $V\\times\n[\\ell]$ with labels in the set $[q]$ has order $2q$ for every $\\ell\\ge 1$ and\n$q\\ge 3$ as conjectured by Bernstein, Striker, and Vorland. This resolves the\nequivalent conjecture of Hopkins that the order of Piecewise-Linear Rowmotion\non the Order Polytope of $V\\times [k]$ has order $2(k+2)$ for all $k\\ge 1$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:09:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Adenbaum","Ben",""]]}
{"id":"2308.08758","submitter":"Hoyoun Jung","authors":"Hoyoun Jung and Kyung-Joong Kim","title":"Discrete Prompt Compression with Reinforcement Learning","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":"  Instruction-tuned Language Models (LMs) are widely used by users to address\nvarious problems with task-specific prompts. Constraints associated with the\ncontext window length and computational costs encourage the development of\ncompressed prompts. Existing methods rely heavily on training embeddings, which\nare designed to accommodate multiple token meanings. This presents challenges\nin terms of interpretability, a fixed number of embedding tokens, reusability\nacross different LMs, and inapplicability when interacting with black-box APIs.\nThis study proposes prompt compression with reinforcement learning (PCRL), a\nnovel discrete prompt compression method that addresses these issues. PCRL\nemploys a computationally efficient policy network that directly edits prompts.\nThe PCRL training approach can be flexibly applied to various types of LMs, as\nwell as decoder-only and encoder-decoder architecture, and can be trained\nwithout gradient access to LMs or labeled data. PCRL achieves an average\nreduction of 24.6% in token count across various instruction prompts while\npreserving performance. Further, we demonstrate that the learned policy can be\ntransferred to larger LMs, and through various analyses, we aid the\nunderstanding of token importance within prompts.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:10:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jung","Hoyoun",""],["Kim","Kyung-Joong",""]]}
{"id":"2308.08759","submitter":"Nikolaos Dimakis","authors":"N. Dimakis, A. Paliathanasis and T. Christodoulakis","title":"Exploring Quantum Cosmology within the Framework of Teleparallel\n  $f(T)$-gravity","comments":"38 pages, 5 figures, Latex2e source file","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate quantum cosmology in teleparallel $f(T)$-gravity. We delve\nextensively into the minisuperspace description within the context of\nteleparallelism. The $f(T)$-theory constitutes a second-order theory of\ngravity, whose cosmological counterpart is delineated by a degenerate\npoint-like Lagrangian. To formulate the Hamiltonian function encompassing all\nconstraints and degrees of freedom inherent to $f(T)$ cosmology, we employ the\nDirac-Bergmann algorithm. Subsequently, we determine the wave function of the\nuniverse and introduce a ``probabilistic'' interpretation. We perform\ncomparisons to some classical solutions to see to what extent the quantum\napproach can cure classical singularities.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:14:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dimakis","N.",""],["Paliathanasis","A.",""],["Christodoulakis","T.",""]]}
{"id":"2308.08760","submitter":"Andrey Itkin","authors":"Andrey Itkin","title":"Semi-analytic pricing of American options in some time-dependent\n  jump-diffusion models","comments":"18 pages, 1 table, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PR q-fin.CP q-fin.MF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we propose a semi-analytic approach to pricing American options\nfor some time-dependent jump-diffusions models. The idea of the method is to\nfurther generalize our approach developed for pricing barrier, [Itkin et al.,\n2021], and American, [Carr and Itkin, 2021; Itkin and Muravey, 2023], options\nin various time-dependent one factor and even stochastic volatility models. Our\napproach i) allows arbitrary dependencies of the model parameters on time; ii)\nreduces solution of the pricing problem for American options to a simpler\nproblem of solving an algebraic nonlinear equation for the exercise boundary\nand a linear Fredholm-Volterra equation for the the option price; iii) the\noptions Greeks solve a similar Fredholm-Volterra linear equation obtained by\njust differentiating Eq. (25) by the required parameter.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:19:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Itkin","Andrey",""]]}
{"id":"2308.08761","submitter":"Quan Shi","authors":"Quan Shi, Kaiyuan Deng","title":"Privacy-Preserving Detection Method for Transmission Line Based on Edge\n  Collaboration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unmanned aerial vehicles (UAVs) are commonly used for edge collaborative\ncomputing in current transmission line object detection, where computationally\nintensive tasks generated by user nodes are offloaded to more powerful edge\nservers for processing. However, performing edge collaborative processing on\ntransmission line image data may result in serious privacy breaches. To address\nthis issue, we propose a secure single-stage detection model called SecYOLOv7\nthat preserves the privacy of object detecting. Based on secure multi-party\ncomputation (MPC), a series of secure computing protocols are designed for the\ncollaborative execution of Secure Feature Contraction, Secure Bounding-Box\nPrediction and Secure Object Classification by two non-edge servers.\nPerformance evaluation shows that both computational and communication overhead\nin this framework as well as calculation error significantly outperform\nexisting works.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:26:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shi","Quan",""],["Deng","Kaiyuan",""]]}
{"id":"2308.08762","submitter":"Quan Shi","authors":"Yanjie Sun, Zhike Gong, Quan Shi, Lin Chen","title":"Efficient Commercial Bank Customer Credit Risk Assessment Based on\n  LightGBM and Feature Engineering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Effective control of credit risk is a key link in the steady operation of\ncommercial banks. This paper is mainly based on the customer information\ndataset of a foreign commercial bank in Kaggle, and we use LightGBM algorithm\nto build a classifier to classify customers, to help the bank judge the\npossibility of customer credit default. This paper mainly deals with\ncharacteristic engineering, such as missing value processing, coding,\nimbalanced samples, etc., which greatly improves the machine learning effect.\nThe main innovation of this paper is to construct new feature attributes on the\nbasis of the original dataset so that the accuracy of the classifier reaches\n0.734, and the AUC reaches 0.772, which is more than many classifiers based on\nthe same dataset. The model can provide some reference for commercial banks'\ncredit granting, and also provide some feature processing ideas for other\nsimilar studies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:32:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Yanjie",""],["Gong","Zhike",""],["Shi","Quan",""],["Chen","Lin",""]]}
{"id":"2308.08763","submitter":"Ge Bai","authors":"Ge Bai, Dominik \\v{S}afr\\'anek, Joseph Schindler, Francesco Buscemi,\n  Valerio Scarani","title":"Observational entropy with general quantum priors","comments":"11 pages, no figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observational entropy captures both the intrinsic uncertainty of a\nthermodynamic state and the lack of knowledge due to coarse-graining. We\ndemonstrate two interpretations of observational entropy, one as the\nstatistical deficiency resulted from a measurement, the other one as the\ndifficulty to infer the input state from the measurement statistics by quantum\nBayesian retrodiction. These interpretations reveal that the observational\nentropy implicitly includes a uniform reference prior, from which we propose\nfully quantum generalizations by replacing the uniform prior by arbitrary\nquantum states. We propose three candidates for this generalization, discuss\ntheir properties, and show one of them gives a unified expression relating both\ninterpretations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:32:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bai","Ge",""],["\u0160afr\u00e1nek","Dominik",""],["Schindler","Joseph",""],["Buscemi","Francesco",""],["Scarani","Valerio",""]]}
{"id":"2308.08764","submitter":"Zijian Song","authors":"Zijian Song, Huikun Bi, Ruisi Zhang, Tianlu Mao, Zhaoqi Wang","title":"XVTP3D: Cross-view Trajectory Prediction Using Shared 3D Queries for\n  Autonomous Driving","comments":"11 pages, 6 figures, accepted by IJCAI 23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Trajectory prediction with uncertainty is a critical and challenging task for\nautonomous driving. Nowadays, we can easily access sensor data represented in\nmultiple views. However, cross-view consistency has not been evaluated by the\nexisting models, which might lead to divergences between the multimodal\npredictions from different views. It is not practical and effective when the\nnetwork does not comprehend the 3D scene, which could cause the downstream\nmodule in a dilemma. Instead, we predicts multimodal trajectories while\nmaintaining cross-view consistency. We presented a cross-view trajectory\nprediction method using shared 3D Queries (XVTP3D). We employ a set of 3D\nqueries shared across views to generate multi-goals that are cross-view\nconsistent. We also proposed a random mask method and coarse-to-fine\ncross-attention to capture robust cross-view features. As far as we know, this\nis the first work that introduces the outstanding top-down paradigm in BEV\ndetection field to a trajectory prediction problem. The results of experiments\non two publicly available datasets show that XVTP3D achieved state-of-the-art\nperformance with consistent cross-view predictions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:35:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Song","Zijian",""],["Bi","Huikun",""],["Zhang","Ruisi",""],["Mao","Tianlu",""],["Wang","Zhaoqi",""]]}
{"id":"2308.08765","submitter":"Saleh ValizadehSotubadi","authors":"Saleh Valizadeh Sotubadi and Rui Liu and Vinh Neguyen","title":"Explainable AI for tool wear prediction in turning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This research aims develop an Explainable Artificial Intelligence (XAI)\nframework to facilitate human-understandable solutions for tool wear prediction\nduring turning. A random forest algorithm was used as the supervised Machine\nLearning (ML) classifier for training and binary classification using\nacceleration, acoustics, temperature, and spindle speed during the orthogonal\ntube turning process as input features. The ML classifier was used to predict\nthe condition of the tool after the cutting process, which was determined in a\nbinary class form indicating if the cutting tool was available or failed. After\nthe training process, the Shapley criterion was used to explain the predictions\nof the trained ML classifier. Specifically, the significance of each input\nfeature in the decision-making and classification was identified to explain the\nreasoning of the ML classifier predictions. After implementing the Shapley\ncriterion on all testing datasets, the tool temperature was identified as the\nmost significant feature in determining the classification of available versus\nfailed cutting tools. Hence, this research demonstrates capability of XAI to\nprovide machining operators the ability to diagnose and understand complex ML\nclassifiers in prediction of tool wear.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:36:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sotubadi","Saleh Valizadeh",""],["Liu","Rui",""],["Neguyen","Vinh",""]]}
{"id":"2308.08766","submitter":"Ze Li","authors":"Ze Li, Yuke Lin, Xiaoyi Qin, Ning Jiang, Guoqing Zhao, Ming Li","title":"The DKU-MSXF Speaker Verification System for the VoxCeleb Speaker\n  Recognition Challenge 2023","comments":"arXiv admin note: text overlap with arXiv:2210.05092","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is the system description of the DKU-MSXF System for the track1,\ntrack2 and track3 of the VoxCeleb Speaker Recognition Challenge 2023\n(VoxSRC-23). For Track 1, we utilize a network structure based on ResNet for\ntraining. By constructing a cross-age QMF training set, we achieve a\nsubstantial improvement in system performance. For Track 2, we inherite the\npre-trained model from Track 1 and conducte mixed training by incorporating the\nVoxBlink-clean dataset. In comparison to Track 1, the models incorporating\nVoxBlink-clean data exhibit a performance improvement by more than 10%\nrelatively. For Track3, the semi-supervised domain adaptation task, a novel\npseudo-labeling method based on triple thresholds and sub-center purification\nis adopted to make domain adaptation. The final submission achieves mDCF of\n0.1243 in task1, mDCF of 0.1165 in Track 2 and EER of 4.952% in Track 3.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:49:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Ze",""],["Lin","Yuke",""],["Qin","Xiaoyi",""],["Jiang","Ning",""],["Zhao","Guoqing",""],["Li","Ming",""]]}
{"id":"2308.08767","submitter":"Liang He","authors":"Liang He, Ruida Li, and Mengqi Niu","title":"Graph Neural Network Backend for Speaker Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Currently, most speaker recognition backends, such as cosine, linear\ndiscriminant analysis (LDA), or probabilistic linear discriminant analysis\n(PLDA), make decisions by calculating similarity or distance between enrollment\nand test embeddings which are already extracted from neural networks. However,\nfor each embedding, the local structure of itself and its neighbor embeddings\nin the low-dimensional space is different, which may be helpful for the\nrecognition but is often ignored. In order to take advantage of it, we propose\na graph neural network (GNN) backend to mine latent relationships among\nembeddings for classification. We assume all the embeddings as nodes on a\ngraph, and their edges are computed based on some similarity function, such as\ncosine, LDA+cosine, or LDA+PLDA. We study different graph settings and explore\nvariants of GNN to find a better message passing and aggregation way to\naccomplish the recognition task. Experimental results on NIST SRE14 i-vector\nchallenging, VoxCeleb1-O, VoxCeleb1-E, and VoxCeleb1-H datasets demonstrate\nthat our proposed GNN backends significantly outperform current mainstream\nmethods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:50:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["He","Liang",""],["Li","Ruida",""],["Niu","Mengqi",""]]}
{"id":"2308.08768","submitter":"Di Wu","authors":"Rui Li, Jinfeng Li, Di Wu","title":"A tight linear chromatic bound for ($P_3\\cup P_2, W_4$)-free graphs","comments":"arXiv admin note: text overlap with arXiv:2308.05442,\n  arXiv:2307.11946","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For two vertex disjoint graphs $H$ and $F$, we use $H\\cup F$ to denote the\ngraph with vertex set $V(H)\\cup V(F)$ and edge set $E(H)\\cup E(F)$, and use\n$H+F$ to denote the graph with vertex set $V(H)\\cup V(F)$ and edge set\n$E(H)\\cup E(F)\\cup\\{xy\\;|\\; x\\in V(H), y\\in V(F)$$\\}$. A $W_4$ is the graph\n$K_1+C_4$. In this paper, we prove that $\\chi(G)\\le 2\\omega(G)$ if $G$ is a\n($P_3\\cup P_2, W_4$)-free graph. This bound is tight when $\\omega =2$ and $3$,\nand improves the main result of Wang and Zhang. Also, this bound partially\ngeneralizes some results of Prashant {\\em et al.}.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:51:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Rui",""],["Li","Jinfeng",""],["Wu","Di",""]]}
{"id":"2308.08769","submitter":"Zehan Wang","authors":"Zehan Wang, Haifeng Huang, Yang Zhao, Ziang Zhang, Zhou Zhao","title":"Chat-3D: Data-efficiently Tuning Large Language Model for Universal\n  Dialogue of 3D Scenes","comments":"The project page is \\url{https://chat-3d.github.io/}","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  3D scene understanding has gained significant attention due to its wide range\nof applications. However, existing methods for 3D scene understanding are\nlimited to specific downstream tasks, which hinders their practicality in\nreal-world applications. This paper presents Chat-3D, which combines the 3D\nvisual perceptual ability of pre-trained 3D representations and the impressive\nreasoning and conversation capabilities of advanced LLMs to achieve the first\nuniversal dialogue systems for 3D scenes. Specifically, we align 3D\nrepresentations into the feature space of LLMs, thus enabling LLMs to perceive\nthe 3D world. Given the scarcity of 3D scene-text data, we propose a\nthree-stage training strategy to efficiently utilize the available data for\nbetter alignment. To enhance the reasoning ability and develop a user-friendly\ninteraction scheme, we further construct a high-quality object-centric 3D\ninstruction dataset and design an associated object-centric prompt. Our\nexperiments show that Chat-3D achieves an impressive ability to comprehend\ndiverse instructions for 3D scenes, engage in intricate spatial reasoning, and\nincorporate external knowledge into its responses. Chat-3D achieves a 75.6%\nrelative score compared with GPT-4 on the constructed instruction dataset.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:52:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Zehan",""],["Huang","Haifeng",""],["Zhao","Yang",""],["Zhang","Ziang",""],["Zhao","Zhou",""]]}
{"id":"2308.08770","submitter":"Ken Shirakawa","authors":"Ryota Nakayashiki and Ken Shirakawa","title":"Kobayashi-Warren-Carter System of Singular Type under Dynamic Boundary\n  Condition","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider a coupled system, known as\nKobayashi--Warren--Carter system, abbreviated as the KWC system. KWC system\nconsists of an Allen--Cahn type equation and a singular diffusion equation, and\nit was proposed by [Kobayashi et al, Phys. D, 140, 141--150 (2000)] as a\npossible mathematical model of grain boundary motion. The focus of this work is\non the dynamic boundary condition imposed in our KWC system, and the\nmathematical interest is in a conflicting situation between: the continuity of\nthe transmission condition included in the dynamic boundary condition; and the\ndiscontinuity encouraged by the singular diffusion equation. On this basis, we\nwill prove the Main Theorem concerned with the existence of solution to our KWC\nsystem with energy-dissipation. Additionally, as a sub-result, we will prove a\nkey-lemma that is to give a certain mathematical interpretation for the\nconflicting situation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:00:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nakayashiki","Ryota",""],["Shirakawa","Ken",""]]}
{"id":"2308.08771","submitter":"Hengxin Tan","authors":"Hengxin Tan and Binghai Yan","title":"Surface Instability and Surface Charge Orders in the Kagome Metal\n  TbV$_6$Sn$_6$","comments":"Supplementary is included. 4 figures + 1 table","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":"  The ideal kagome lattice shows an electronic structure with intriguing\ncorrelated and topological electronic states. In realistic materials, however,\nthe kagome atomic layer is generally buried inside a bulk while little is known\nabout the kagome layer on a surface. In this work, we reveal that the kagome\nlayer of the recently discovered kagome metals $R$V$_6$Sn$_6$ ($R$ = Y and\nrare-earth elements) exhibits strong lattice instabilities when exposed on the\nsurface, despite that it is stable inside the bulk. Exemplified by\nTbV$_6$Sn$_6$ without bulk charge density waves, surface kagome layers present\n$\\sqrt 3 \\times \\sqrt 3$ and $2 \\times 2$ surface charge orders (SCOs). In\ncontrast, SCOs disappear when kagome surfaces are covered by a Sn or TbSn\natomic layer. These SCOs exhibit clover-like patterns with trimers of V atoms,\ndifferent from known bulk CDWs. Furthermore, we find that SCOs are generally\npresent (absent) in thin films of $R$V$_6$Sn$_6$ terminated with kagome\n(non-kagome) sublattices, indicating its surface origin. The SCOs distort the\nkagome lattice and sensitively modify kagome surface bands. Our work reveals\nunexpected surface instability of kagome materials and calls for\nsurface-sensitive measurements such as scanning tunneling microscopy.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:03:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tan","Hengxin",""],["Yan","Binghai",""]]}
{"id":"2308.08772","submitter":"Xianze Ai","authors":"Xianze Ai, Zehui Liao, and Yong Xia","title":"URL: Combating Label Noise for Lung Nodule Malignancy Grading","comments":"11 pages, accepted by DALI@MICCAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Due to the complexity of annotation and inter-annotator variability, most\nlung nodule malignancy grading datasets contain label noise, which inevitably\ndegrades the performance and generalizability of models. Although researchers\nadopt the label-noise-robust methods to handle label noise for lung nodule\nmalignancy grading, they do not consider the inherent ordinal relation among\nclasses of this task. To model the ordinal relation among classes to facilitate\ntackling label noise in this task, we propose a Unimodal-Regularized\nLabel-noise-tolerant (URL) framework. Our URL contains two stages, the\nSupervised Contrastive Learning (SCL) stage and the Memory pseudo-labels\ngeneration and Unimodal regularization (MU) stage. In the SCL stage, we select\nreliable samples and adopt supervised contrastive learning to learn better\nrepresentations. In the MU stage, we split samples with multiple annotations\ninto multiple samples with a single annotation and shuffle them into different\nbatches. To handle label noise, pseudo-labels are generated using the\nsimilarity between each sample and the central feature of each class, and\ntemporal ensembling is used to obtain memory pseudo-labels that supervise the\nmodel training. To model the ordinal relation, we introduce unimodal\nregularization to keep the ordinal relation among classes in the predictions.\nMoreover, each lung nodule is characterized by three orthographic views.\nExperiments conducted on the LIDC-IDRI dataset indicate the superiority of our\nURL over other competing methods. Code is available at\nhttps://github.com/axz520/UR.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:06:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ai","Xianze",""],["Liao","Zehui",""],["Xia","Yong",""]]}
{"id":"2308.08773","submitter":"Bifeng Guo","authors":"B. F. Guo, Q. Y. Peng, A. Vienne and X. Q. Fang","title":"Astrometry via Close Approach Events: Applications to Main-Belt Asteroid\n  (702) Alauda","comments":"11 pages, 22 figures","journal-ref":null,"doi":"10.1093/mnras/stad2454","report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The release of Gaia catalog is revolutionary to the astronomy of solar system\nobjects. After some effects such as atmospheric refraction and CCD geometric\ndistortion have been taken into account, the astrometric precision for\nground-based telescopes can reach the level of tens of milli-arcseconds. If an\nobject approaches a reference star in a small relative angular distance (less\nthan 100 arcseconds), which is called close approach event in this work, the\nrelative positional precision between the object and reference star will be\nfurther improved since the systematic effects of atmospheric turbulence and\nlocal telescope optics can be reduced. To obtain the precise position of a\nmain-belt asteroid in an close approach event, a second-order angular velocity\nmodel with time is supposed in the sky plane. By fitting the relationship\nbetween the relative angular distance and observed time, we can derive the time\nof maximum approximation and calculate the corresponding position of the\nasteroid. In practice, 5 nights' CCD observations including 15 close approach\nevents of main-belt asteroid (702) Alauda are taken for testing by the 1m\ntelescope at Yunnan Observatory, China. Compared with conventional solutions,\nour results show that the positional precision significantly improves, which\nreaches better than 4 milli-arcseconds, and 1 milli-arcsecond in the best case\nwhen referenced for JPL ephemeris in both right ascension and declination.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:09:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","B. F.",""],["Peng","Q. Y.",""],["Vienne","A.",""],["Fang","X. Q.",""]]}
{"id":"2308.08774","submitter":"Phillip Rust","authors":"Phillip Rust, Anders S{\\o}gaard","title":"Differential Privacy, Linguistic Fairness, and Training Data Influence:\n  Impossibility and Possibility Theorems for Multilingual Language Models","comments":"ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Language models such as mBERT, XLM-R, and BLOOM aim to achieve multilingual\ngeneralization or compression to facilitate transfer to a large number of\n(potentially unseen) languages. However, these models should ideally also be\nprivate, linguistically fair, and transparent, by relating their predictions to\ntraining data. Can these requirements be simultaneously satisfied? We show that\nmultilingual compression and linguistic fairness are compatible with\ndifferential privacy, but that differential privacy is at odds with training\ndata influence sparsity, an objective for transparency. We further present a\nseries of experiments on two common NLP tasks and evaluate multilingual\ncompression and training data influence sparsity under different privacy\nguarantees, exploring these trade-offs in more detail. Our results suggest that\nwe need to develop ways to jointly optimize for these objectives in order to\nfind practical trade-offs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:13:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rust","Phillip",""],["S\u00f8gaard","Anders",""]]}
{"id":"2308.08775","submitter":"Chen Mingjin","authors":"Mingjin Chen, Yongkang He, Yongyi Lu, Zhijing Yang","title":"Learning to In-paint: Domain Adaptive Shape Completion for 3D Organ\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":"  We aim at incorporating explicit shape information into current 3D organ\nsegmentation models. Different from previous works, we formulate shape learning\nas an in-painting task, which is named Masked Label Mask Modeling (MLM).\nThrough MLM, learnable mask tokens are fed into transformer blocks to complete\nthe label mask of organ. To transfer MLM shape knowledge to target, we further\npropose a novel shape-aware self-distillation with both in-painting\nreconstruction loss and pseudo loss. Extensive experiments on five public organ\nsegmentation datasets show consistent improvements over prior arts with at\nleast 1.2 points gain in the Dice score, demonstrating the effectiveness of our\nmethod in challenging unsupervised domain adaptation scenarios including: (1)\nIn-domain organ segmentation; (2) Unseen domain segmentation and (3) Unseen\norgan segmentation. We hope this work will advance shape analysis and geometric\nlearning in medical imaging.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:19:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Mingjin",""],["He","Yongkang",""],["Lu","Yongyi",""],["Yang","Zhijing",""]]}
{"id":"2308.08776","submitter":"Xingcheng Xu","authors":"Qin Chen, Jinfeng Ge, Huaqing Xie, Xingcheng Xu, Yanqing Yang","title":"Large Language Models at Work in China's Labor Market","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.AI cs.CY q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores the potential impacts of large language models (LLMs) on\nthe Chinese labor market. We analyze occupational exposure to LLM capabilities\nby incorporating human expertise and LLM classifications, following Eloundou et\nal. (2023)'s methodology. We then aggregate occupation exposure to the industry\nlevel to obtain industry exposure scores. The results indicate a positive\ncorrelation between occupation exposure and wage levels/experience premiums,\nsuggesting higher-paying and experience-intensive jobs may face greater\ndisplacement risks from LLM-powered software. The industry exposure scores\nalign with expert assessments and economic intuitions. We also develop an\neconomic growth model incorporating industry exposure to quantify the\nproductivity-employment trade-off from AI adoption. Overall, this study\nprovides an analytical basis for understanding the labor market impacts of\nincreasingly capable AI systems in China. Key innovations include the\noccupation-level exposure analysis, industry aggregation approach, and economic\nmodeling incorporating AI adoption and labor market effects. The findings will\ninform policymakers and businesses on strategies for maximizing the benefits of\nAI while mitigating adverse disruption risks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:20:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Qin",""],["Ge","Jinfeng",""],["Xie","Huaqing",""],["Xu","Xingcheng",""],["Yang","Yanqing",""]]}
{"id":"2308.08777","submitter":"Axel Schmidt","authors":"A. Schmidt, W. J. Briscoe, O. Cortes, L. Earnest, G. N. Grauvogel, S.\n  Ratliff, E. M. Seroka, P. Sharp, I. I. Strakovsky, G. Niculescu, S. Diehl, P.\n  G. Blunden, E. Cline, I. Korover, T. Kutz, S. N. Santiesteban, C. Fogler, L.\n  B. Weinstein, D. Marchand, S. Niccolai, E. Voutier, A. D'Angelo, J. C.\n  Bernauer, R. Singh, V. Burkert, F. Hauenstein, D. W. Higinbotham, D. Nguyen,\n  E. Pasyuk, H. Szumila-Vance, X. Wei, D. Keller","title":"A Direct Measurement of Hard Two-Photon Exchange with Electrons and\n  Positrons at CLAS12","comments":"Experimental Proposal E12+23-008 submitted to Jefferson Lab PAC 51,\n  34 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most surprising discoveries made at Jefferson Lab has been the\ndiscrepancy in the determinations of the proton's form factor ratio $\\mu_p\nG_E^p/G_M^p$ between unpolarized cross section measurements and the\npolarization transfer technique. Over two decades later, the discrepancy not\nonly persists but has been confirmed at higher momentum transfers now\naccessible in the 12-GeV era. The leading hypothesis for the cause of this\ndiscrepancy, a non-negligible contribution from hard two-photon exchange, has\nneither been conclusively proven or disproven. This state of uncertainty not\nonly clouds our knowledge of one-dimensional nucleon structure but also poses a\nmajor concern for our field's efforts to map out the three-dimensional nuclear\nstructure. A better understanding of multi-photon exchange over a wide phase\nspace is needed. We propose making comprehensive measurements of two-photon\nexchange over a wide range in momentum transfer and scattering angle using the\nCLAS12 detector. Specifically, we will measure the ratio of positron-proton to\nelectron-proton elastic scattering cross sections, using the proposed positron\nbeam upgrade for CEBAF. The experiment will use 2.2, 4.4, and 6.6 GeV lepton\nbeams incident on the standard CLAS12 unpolarized hydrogen target. Data will be\ncollected by the CLAS12 detector in its standard configuration, except for a\nmodified trigger to allow the recording of events with beam leptons scattered\ninto the CLAS12 central detector. The sign of the beam charge, as well as the\npolarity of the CLAS12 solenoid and toroid, will be reversed several times in\norder to suppress systematics associated with local detector efficiency and\ntime-dependent detector performance. The proposed high-precision determination\nof two-photon effects will be...\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:28:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schmidt","A.",""],["Briscoe","W. J.",""],["Cortes","O.",""],["Earnest","L.",""],["Grauvogel","G. N.",""],["Ratliff","S.",""],["Seroka","E. M.",""],["Sharp","P.",""],["Strakovsky","I. I.",""],["Niculescu","G.",""],["Diehl","S.",""],["Blunden","P. G.",""],["Cline","E.",""],["Korover","I.",""],["Kutz","T.",""],["Santiesteban","S. N.",""],["Fogler","C.",""],["Weinstein","L. B.",""],["Marchand","D.",""],["Niccolai","S.",""],["Voutier","E.",""],["D'Angelo","A.",""],["Bernauer","J. C.",""],["Singh","R.",""],["Burkert","V.",""],["Hauenstein","F.",""],["Higinbotham","D. W.",""],["Nguyen","D.",""],["Pasyuk","E.",""],["Szumila-Vance","H.",""],["Wei","X.",""],["Keller","D.",""]]}
{"id":"2308.08778","submitter":"Bo-Wei Huang","authors":"Bo-Wei Huang, Keng-Te Liao, Chang-Sheng Kao, Shou-De Lin","title":"Environment Diversification with Multi-head Neural Network for Invariant\n  Learning","comments":"In Proceedings of 36th Conference on Neural Information Processing\n  Systems (NeurIPS 2022)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks are often trained with empirical risk minimization; however,\nit has been shown that a shift between training and testing distributions can\ncause unpredictable performance degradation. On this issue, a research\ndirection, invariant learning, has been proposed to extract invariant features\ninsensitive to the distributional changes. This work proposes EDNIL, an\ninvariant learning framework containing a multi-head neural network to absorb\ndata biases. We show that this framework does not require prior knowledge about\nenvironments or strong assumptions about the pre-trained model. We also reveal\nthat the proposed algorithm has theoretical connections to recent studies\ndiscussing properties of variant and invariant features. Finally, we\ndemonstrate that models trained with EDNIL are empirically more robust against\ndistributional shifts.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:33:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Bo-Wei",""],["Liao","Keng-Te",""],["Kao","Chang-Sheng",""],["Lin","Shou-De",""]]}
{"id":"2308.08779","submitter":"Othman Benomar","authors":"Othman Benomar and Masao Takata and Michael Bazot and Takashi Sekii\n  and Laurent Gizon and Yuting Lu","title":"Detecting active latitudes of Sun-like stars using asteroseismic\n  a-coefficients","comments":"Accepted to 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":"  We introduce a framework to measure the asphericity of Sun-like stars using\n$a_1$, $a_2$ and $a_4$ coefficients, and constrain their latitudes of magnetic\nactivity. Systematic errors on the inferred coefficients are evaluated in\nfunction of key physical and seismic parameters (inclination of rotation axis,\naverage rotation, height-to-noise ratio of peaks in power spectrum). The\nmeasured a-coefficients account for rotational oblateness and the effect of\nsurface magnetic activity. We use a simple model that assumes a single\nlatitudinal band of activity. Using solar SOHO/VIRGO/SPM data, we demonstrate\nthe capability of the method to detect the mean active latitude and its\nintensity changes between 1999-2002 (maximum of activity) and 2006-2009\n(minimum of activity). We further apply the method to study the solar-analogue\nstars 16 Cyg A and B using Kepler observations. An equatorial band of activity,\nexhibiting intensity that could be comparable to that of the Sun, is detected\nin 16 Cyg A. However, 16 Cyg B exhibits a bi-modality in $a_4$ that is\nchallenging to explain. We suggest that this could be a manifestation of the\ntransition between a quiet and an active phase of activity. Validating or\ninvalidating this hypothesis may require new observations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:44:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Benomar","Othman",""],["Takata","Masao",""],["Bazot","Michael",""],["Sekii","Takashi",""],["Gizon","Laurent",""],["Lu","Yuting",""]]}
{"id":"2308.08780","submitter":"Muhammad Khalifa","authors":"Muhammad Khalifa, Lajanugen Logeswaran, Moontae Lee, Honglak Lee, Lu\n  Wang","title":"Exploring Demonstration Ensembling for In-context Learning","comments":"Published at ME-FoMo workshop at ICLR 2023. Arxiv version includes\n  evaluation on 5 more tasks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In-context learning (ICL) operates by showing language models (LMs) examples\nof input-output pairs for a given task, i.e., demonstrations. The standard\napproach for ICL is to prompt the LM with concatenated demonstrations followed\nby the test input. This approach suffers from some issues. First, concatenation\noffers almost no control over the contribution of each demo to the model\nprediction. This can be sub-optimal when some demonstrations are irrelevant to\nthe test example. Second, due to the input length limit of some transformer\nmodels, it might be infeasible to fit many examples into the context,\nespecially when dealing with long-input tasks. In this work, we explore\nDemonstration Ensembling (DENSE) as an alternative to simple concatenation.\nDENSE predicts outputs using subsets (i.e., buckets) of the demonstrations and\nthen combines the output probabilities resulting from each subset to produce\nthe final prediction. We study different ensembling methods using GPT-j and\nexperiment on 12 language tasks. Our experiments show weighted max ensembling\nto outperform vanilla concatenation by as large as 2.4 average points. Code\navailable at https://github.com/mukhal/icl-ensembling.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:45:19 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:25:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khalifa","Muhammad",""],["Logeswaran","Lajanugen",""],["Lee","Moontae",""],["Lee","Honglak",""],["Wang","Lu",""]]}
{"id":"2308.08781","submitter":"Corey Ostrove","authors":"Corey Ostrove, Kenneth Rudinger, Stefan Seritan, Kevin Young, Robin\n  Blume-Kohout","title":"Near-Minimal Gate Set Tomography Experiment Designs","comments":"11 pages, 6 figures, to be published in proceedings of 2023 IEEE\n  International Conference on Quantum Computing and Engineering (QCE)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gate set tomography (GST) provides precise, self-consistent estimates of the\nnoise channels for all of a quantum processor's logic gates. But GST\nexperiments are large, involving many distinct quantum circuits. This has\nprevented their use on systems larger than two qubits. Here, we show how to\nstreamline GST experiment designs by removing almost all redundancy, creating\nsmaller and more scalable experiments without losing precision. We do this by\nanalyzing the \"germ\" subroutines at the heart of GST circuits, identifying\nexactly what gate set parameters they are sensitive to, and leveraging this\ninformation to remove circuits that duplicate other circuits' sensitivities. We\napply this technique to two-qubit GST experiments, generating streamlined\nexperiment designs that contain only slightly more circuits than the\ntheoretical minimum bounds, but still achieve Heisenberg-like scaling in\nprecision (as demonstrated via simulation and a theoretical analysis using\nFisher information). In practical use, the new experiment designs can match the\nprecision of previous GST experiments with significantly fewer circuits. We\ndiscuss the prospects and feasibility of extending GST to three-qubit systems\nusing our techniques.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:46:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ostrove","Corey",""],["Rudinger","Kenneth",""],["Seritan","Stefan",""],["Young","Kevin",""],["Blume-Kohout","Robin",""]]}
{"id":"2308.08782","submitter":"Fen Zou","authors":"Fen Zou, Lei Du, Yong Li, Hui Dong","title":"Amplifying Frequency Up-Converted Infrared Signals with a Molecular\n  Optomechanical Cavity","comments":"5 pages, 4 figures for the main text; 6 pages, 2 figures for\n  Supplementary Material","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Frequency up-conversion, enabled by molecular optomechanical coupling, has\nrecently emerged as a promising approach for converting infrared signals into\nthe visible range through quantum coherent conversion of signals. However,\ndetecting these converted signals poses a significant challenge due to their\ninherently weak signal intensity. In this work, we propose an amplification\nmechanism capable of enhancing the signal intensity by a factor of 1000 or more\nin a molecular-cavity system consisting $10^{7}$ molecules. The mechanism takes\nadvantage of the strong coupling enhancement with molecular collective mode and\nStokes sideband pump. Our work demonstrates a feasible approach for\nup-converting infrared signals to the visible range.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:53:59 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 13:15:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zou","Fen",""],["Du","Lei",""],["Li","Yong",""],["Dong","Hui",""]]}
{"id":"2308.08783","submitter":"Minduli Wijayatunga","authors":"Minduli Wijayatunga, Roberto Armellin, Harry Holt, Laura Pirovano,\n  Claudio Bombardelli","title":"Convex Optimization-Based Model Predictive Control for the Guidance of\n  Active Debris Removal Transfers","comments":null,"journal-ref":"Preprint AAS 2023, Big Sky, Montana","doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Active debris removal (ADR) missions have garnered significant interest as\nmeans of mitigating collision risks in space. This work proposes a convex\noptimization-based model predictive control (MPC) approach to provide guidance\nfor such missions. While convex optimization can obtain optimal solutions in\npolynomial time, it relies on the successive convexification of nonconvex\ndynamics, leading to inaccuracies. Here, the need for successive\nconvexification is eliminated by using near-linear Generalized Equinoctial\nOrbital Elements (GEqOE) and by updating the reference trajectory through a new\nsplit-Edelbaum approach. The solution accuracy is then measured relative to a\nhigh-fidelity dynamics model, showing that the MPC-convex method can generate\naccurate solutions without iterations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:56:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wijayatunga","Minduli",""],["Armellin","Roberto",""],["Holt","Harry",""],["Pirovano","Laura",""],["Bombardelli","Claudio",""]]}
{"id":"2308.08784","submitter":"Qingwen Bu","authors":"Dong Huang, Qingwen Bu, Heming Cui","title":"CodeCoT and Beyond: Learning to Program and Test like a Developer","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":"  In natural language processing, transformer-based large language models\n(LLMs) like GPT-x models developed by OpenAI have revolutionized the landscape.\nDespite their impressive capabilities, these models often encounter challenges\nwhen handling tasks that differ from their training data, resulting in\ncompromised performance. To address this, few-shot learning has emerged as a\nvaluable technique, allowing LLMs to adapt with minimal task-specific data. One\ninnovative strategy, known as Chain-of-Thought Prompting (CoT), has been\nintroduced to guide LLMs in revealing cognitive processes during multi-step\nreasoning. In this paper, we propose Code Chain-of-Thought~(CodeCoT), which\nconsists of two components: the Vanilla CodeCoT and the Self-exam CodeCoT. The\nlatter incorporates self-examination, empowering the model to iteratively\ngenerate code, formulate test cases, and refine its outputs. Specifically, the\nprocess entails the generation of test examples by the model corresponding to\nthe code it is tasked to implement. If it fails on the test examples, then it\nregenerates the code based on the erroneous code and associated error types.\nThrough comprehensive experiments, we observed that both techniques\nsignificantly enhance code generation accuracy across various LLM variants. Our\nevaluation results reveal that CodeCoT improves the code generation\neffectiveness, including an unprecedented pass@1 accuracy of 79.27\\% using the\nSelf-exam CodeCoT approach on the gpt-3.5-turbo-0613 model in the HumanEval\ndataset.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:58:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Dong",""],["Bu","Qingwen",""],["Cui","Heming",""]]}
{"id":"2308.08785","submitter":"Ningyi Xie","authors":"Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi\n  Asai, Hoong Chuin Lau","title":"A Feasibility-Preserved Quantum Approximate Solver for the Capacitated\n  Vehicle Routing Problem","comments":"9 pages, 8 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem\n(NPO) that arises in various fields including transportation and logistics. The\nCVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the\nmost efficient plan for a fleet of vehicles to deliver goods to a set of\ncustomers, subject to the limited carrying capacity of each vehicle. As the\nnumber of possible solutions skyrockets when the number of customers increases,\nfinding the optimal solution remains a significant challenge. Recently, a\nquantum-classical hybrid algorithm known as Quantum Approximate Optimization\nAlgorithm (QAOA) can provide better solutions in some cases of combinatorial\noptimization problems, compared to classical heuristics. However, the QAOA\nexhibits a diminished ability to produce high-quality solutions for some\nconstrained optimization problems including the CVRP. One potential approach\nfor improvement involves a variation of the QAOA known as the Grover-Mixer\nQuantum Alternating Operator Ansatz (GM-QAOA). In this work, we attempt to use\nGM-QAOA to solve the CVRP. We present a new binary encoding for the CVRP, with\nan alternative objective function of minimizing the shortest path that bypasses\nthe vehicle capacity constraint of the CVRP. The search space is further\nrestricted by the Grover-Mixer. We examine and discuss the effectiveness of the\nproposed solver through its application to several illustrative examples.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:14:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xie","Ningyi",""],["Lee","Xinwei",""],["Cai","Dongsheng",""],["Saito","Yoshiyuki",""],["Asai","Nobuyoshi",""],["Lau","Hoong Chuin",""]]}
{"id":"2308.08786","submitter":"Zilinghan Li","authors":"Zilinghan Li, Shilan He, Pranshu Chaturvedi, Trung-Hieu Hoang, Minseok\n  Ryu, E. A. Huerta, Volodymyr Kindratenko, Jordan Fuhrman, Maryellen Giger,\n  Ryan Chard, Kibaek Kim, Ravi Madduri","title":"APPFLx: Providing Privacy-Preserving Cross-Silo Federated Learning as a\n  Service","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-silo privacy-preserving federated learning (PPFL) is a powerful tool to\ncollaboratively train robust and generalized machine learning (ML) models\nwithout sharing sensitive (e.g., healthcare of financial) local data. To ease\nand accelerate the adoption of PPFL, we introduce APPFLx, a ready-to-use\nplatform that provides privacy-preserving cross-silo federated learning as a\nservice. APPFLx employs Globus authentication to allow users to easily and\nsecurely invite trustworthy collaborators for PPFL, implements several\nsynchronous and asynchronous FL algorithms, streamlines the FL experiment\nlaunch process, and enables tracking and visualizing the life cycle of FL\nexperiments, allowing domain experts and ML practitioners to easily orchestrate\nand evaluate cross-silo FL under one platform. APPFLx is available online at\nhttps://appflx.link\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:15:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Zilinghan",""],["He","Shilan",""],["Chaturvedi","Pranshu",""],["Hoang","Trung-Hieu",""],["Ryu","Minseok",""],["Huerta","E. A.",""],["Kindratenko","Volodymyr",""],["Fuhrman","Jordan",""],["Giger","Maryellen",""],["Chard","Ryan",""],["Kim","Kibaek",""],["Madduri","Ravi",""]]}
{"id":"2308.08787","submitter":"Lipeng Zhu","authors":"Lipeng Zhu, Wenyan Ma, and Rui Zhang","title":"Movable-Antenna Array Enhanced Beamforming: Achieving Full Array Gain\n  with Null Steering","comments":"Submitted to IEEE Communications Letters","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":"  Conventional beamforming with fixed-position antenna (FPA) arrays has a\nfundamental trade-off between maximizing the signal power (array gain) over a\ndesired direction and simultaneously minimizing the interference power over\nundesired directions. To overcome this limitation, this letter investigates the\nmovable antenna (MA) array enhanced beamforming by exploiting the new degree of\nfreedom (DoF) via antenna position optimization, in addition to the design of\nantenna weights. We show that by jointly optimizing the antenna positions\nvector (APV) and antenna weights vector (AWV) of a linear MA array, the full\narray gain can be achieved over the desired direction while null steering can\nbe realized over all undesired directions, under certain numbers of MAs and\nnull-steering directions. The optimal solutions for AWV and APV are derived in\nclosed form, which reveal that the optimal AWV for MA arrays requires only the\nsignal phase adjustment with a fixed amplitude. Numerical results validate our\nanalytical solutions for MA array beamforming and show their superior\nperformance to the conventional beamforming techniques with FPA arrays.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:24:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhu","Lipeng",""],["Ma","Wenyan",""],["Zhang","Rui",""]]}
{"id":"2308.08788","submitter":"Grace Gu","authors":"Zixiao Wei, Stanley Wang, Sean Farris, Naga Chennuri, Ningping Wang,\n  Stara Shinsato, Kahraman Demir, Maya Horii, and Grace X. Gu","title":"Nature-inspired three-dimensional surface serration topologies enable\n  silent flight by suppressing airfoil-turbulence interaction noise","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As natural predators, owls fly with astonishing stealth due to the\nsophisticated serrated surface morphology of their feathers that produces\nadvantageous flow characteristics and favorable boundary layer structures.\nTraditionally, these serrations are tailored for airfoil edges with simple\ntwo-dimensional patterns, limiting their effect on overall noise reduction\nwhile negotiating tradeoffs in aerodynamic performance. Here, we formulate new\ndesign strategies that can mitigate tradeoffs between noise reduction and\naerodynamic performance by merging owl feather and cicada insect wing\ngeometries to create a three-dimensional topology that features silent and\nefficient flight. Aeroacoustics and aerodynamics experimental results show that\nthe application of our hybrid topology yields a reduction in overall sound\npressure levels by up to 9.93% and an increase in propulsive efficiency by over\n48.14% compared to benchmark designs. Computational fluid dynamics simulations\nreveal that the three-dimensional, owl-inspired surface serrations can enhance\nsurface vorticity. The produced coherent vortex structures serve to suppress\nthe source strength of dipole and quadrupole pressure sources at various\nReynolds numbers, resulting in a universal noise reduction effect. Our work\ndemonstrates how a bioinspired three-dimensional serration topology refines the\nturbulence-airfoil interaction mode and improves multiple functionalities of an\naerodynamic surface to enable quieter and more fuel-efficient, aerial vehicles.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:29:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wei","Zixiao",""],["Wang","Stanley",""],["Farris","Sean",""],["Chennuri","Naga",""],["Wang","Ningping",""],["Shinsato","Stara",""],["Demir","Kahraman",""],["Horii","Maya",""],["Gu","Grace X.",""]]}
{"id":"2308.08789","submitter":"Adrian van Kan","authors":"A. van Kan, B. Favier, K. Julien and E. Knobloch","title":"From a vortex gas to a vortex crystal in instability-driven\n  two-dimensional turbulence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft nlin.PS physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study structure formation in two-dimensional turbulence driven by an\nexternal force, interpolating between linear instability forcing and random\nstirring, subject to nonlinear damping. Using extensive direct numerical\nsimulations, we uncover a rich parameter space featuring four distinct branches\nof stationary solutions: large-scale vortices, hybrid states with embedded\nshielded vortices (SVs) of either sign, and two states composed of many similar\nSVs. Of the latter, the first is a dense vortex gas where all SVs have the same\nsign and diffuse across the domain. The second is a hexagonal vortex crystal\nforming from this gas when the instability is sufficiently weak. These\nsolutions coexist stably over a wide parameter range. The late-time evolution\nof the system from small-amplitude initial conditions is nearly self-similar,\ninvolving three phases: initial inverse cascade, random nucleation of SVs from\nturbulence and, once a critical number of vortices is reached, a phase of\nexplosive nucleation of SVs, leading to a statistically stationary state. The\nvortex gas is continued in the forcing parameter, revealing a sharp transition\ntowards the crystal state as the forcing strength decreases. This transition is\nanalysed in terms of the diffusion of individual vortices and tools from\nstatistical physics. The crystal can also decay via an inverse cascade\nresulting from the breakdown of shielding or insufficient nonlinear damping\nacting on SVs. Our study highlights the importance of the forcing details in\ntwo-dimensional turbulence and reveals the presence of nontrivial SV states in\nthis system, specifically the emergence and melting of a vortex crystal.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:29:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["van Kan","A.",""],["Favier","B.",""],["Julien","K.",""],["Knobloch","E.",""]]}
{"id":"2308.08790","submitter":"Matthew Crimson","authors":"Matthew Crimson, Justin M. Kennedy, Daniel E. Quevedo","title":"Remote State Estimation with Privacy Against Active Eavesdroppers","comments":"13 pages, 7 figures. arXiv admin note: text overlap with\n  arXiv:2211.13411","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper considers a cyber-physical system under an active eavesdropping\nattack. A remote legitimate user estimates the state of a linear plant from the\nstate information received from a sensor. Transmissions from the sensor occur\nvia an insecure and unreliable network. An active eavesdropper may perform an\nattack during system operation. The eavesdropper intercepts transmissions from\nthe sensor, whilst simultaneously sabotaging the data transfer from the sensor\nto the remote legitimate user to harm its estimation performance. To maintain\nstate confidentiality, we propose an encoding scheme that is activated on the\ndetection of an eavesdropper. Our scheme transmits noise based on a\npseudo-random indicator, pre-arranged at the legitimate user and sensor. The\ntransmission of noise harms the eavesdropper's performance, more than that of\nthe legitimate user. Using the proposed encoding scheme, we impair the\neavesdropper's expected estimation performance, whilst minimising expected\nperformance degradation at the legitimate user. We explore the trade-off\nbetween state confidentiality and legitimate user performance degradation\nthrough selecting the probability that the sensor transmits noise. Under\ncertain design choices, the trace of the expected estimation error covariance\nof the eavesdropper is greater than that of the legitimate user. Numerical\nexamples are provided to illustrate the proposed encoding scheme.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:30:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Crimson","Matthew",""],["Kennedy","Justin M.",""],["Quevedo","Daniel E.",""]]}
{"id":"2308.08791","submitter":"David Mount","authors":"Ahmed Abdelkader and David M. Mount","title":"Smooth Distance Approximation","comments":"To appear in the European Symposium on Algorithms (ESA) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditional problems in computational geometry involve aspects that are both\ndiscrete and continuous. One such example is nearest-neighbor searching, where\nthe input is discrete, but the result depends on distances, which vary\ncontinuously. In many real-world applications of geometric data structures, it\nis assumed that query results are continuous, free of jump discontinuities.\nThis is at odds with many modern data structures in computational geometry,\nwhich employ approximations to achieve efficiency, but these approximations\noften suffer from discontinuities.\n  In this paper, we present a general method for transforming an approximate\nbut discontinuous data structure into one that produces a smooth approximation,\nwhile matching the asymptotic space efficiencies of the original. We achieve\nthis by adapting an approach called the partition-of-unity method, which\nsmoothly blends multiple local approximations into a single smooth global\napproximation.\n  We illustrate the use of this technique in a specific application of\napproximating the distance to the boundary of a convex polytope in\n$\\mathbb{R}^d$ from any point in its interior. We begin by developing a novel\ndata structure that efficiently computes an absolute\n$\\varepsilon$-approximation to this query in time $O(\\log (1/\\varepsilon))$\nusing $O(1/\\varepsilon^{d/2})$ storage space. Then, we proceed to apply the\nproposed partition-of-unity blending to guarantee the smoothness of the\napproximate distance field, establishing optimal asymptotic bounds on the norms\nof its gradient and Hessian.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:34:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Abdelkader","Ahmed",""],["Mount","David M.",""]]}
{"id":"2308.08792","submitter":"Yuning Jiang","authors":"Junkai Qian and Yuning Jiang and Xin Liu and Qing Wang and Ting Wang\n  and Yuanming Shi and Wei Chen","title":"Federated Reinforcement Learning for Electric Vehicles Charging Control\n  on Distribution Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.MA cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With the growing popularity of electric vehicles (EVs), maintaining power\ngrid stability has become a significant challenge. To address this issue, EV\ncharging control strategies have been developed to manage the switch between\nvehicle-to-grid (V2G) and grid-to-vehicle (G2V) modes for EVs. In this context,\nmulti-agent deep reinforcement learning (MADRL) has proven its effectiveness in\nEV charging control. However, existing MADRL-based approaches fail to consider\nthe natural power flow of EV charging/discharging in the distribution network\nand ignore driver privacy. To deal with these problems, this paper proposes a\nnovel approach that combines multi-EV charging/discharging with a radial\ndistribution network (RDN) operating under optimal power flow (OPF) to\ndistribute power flow in real time. A mathematical model is developed to\ndescribe the RDN load. The EV charging control problem is formulated as a\nMarkov Decision Process (MDP) to find an optimal charging control strategy that\nbalances V2G profits, RDN load, and driver anxiety. To effectively learn the\noptimal EV charging control strategy, a federated deep reinforcement learning\nalgorithm named FedSAC is further proposed. Comprehensive simulation results\ndemonstrate the effectiveness and superiority of our proposed algorithm in\nterms of the diversity of the charging control strategy, the power fluctuations\non RDN, the convergence efficiency, and the generalization ability.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:34:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qian","Junkai",""],["Jiang","Yuning",""],["Liu","Xin",""],["Wang","Qing",""],["Wang","Ting",""],["Shi","Yuanming",""],["Chen","Wei",""]]}
{"id":"2308.08793","submitter":"Duzhen Zhang","authors":"Duzhen Zhang, Hongliu Li, Wei Cong, Rongtao Xu, Jiahua Dong, Xiuyi\n  Chen","title":"Task Relation Distillation and Prototypical Pseudo Label for Incremental\n  Named Entity Recognition","comments":"Accepted by CIKM2023 as a long paper with an oral presentation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Incremental Named Entity Recognition (INER) involves the sequential learning\nof new entity types without accessing the training data of previously learned\ntypes. However, INER faces the challenge of catastrophic forgetting specific\nfor incremental learning, further aggravated by background shift (i.e., old and\nfuture entity types are labeled as the non-entity type in the current task). To\naddress these challenges, we propose a method called task Relation Distillation\nand Prototypical pseudo label (RDP) for INER. Specifically, to tackle\ncatastrophic forgetting, we introduce a task relation distillation scheme that\nserves two purposes: 1) ensuring inter-task semantic consistency across\ndifferent incremental learning tasks by minimizing inter-task relation\ndistillation loss, and 2) enhancing the model's prediction confidence by\nminimizing intra-task self-entropy loss. Simultaneously, to mitigate background\nshift, we develop a prototypical pseudo label strategy that distinguishes old\nentity types from the current non-entity type using the old model. This\nstrategy generates high-quality pseudo labels by measuring the distances\nbetween token embeddings and type-wise prototypes. We conducted extensive\nexperiments on ten INER settings of three benchmark datasets (i.e., CoNLL2003,\nI2B2, and OntoNotes5). The results demonstrate that our method achieves\nsignificant improvements over the previous state-of-the-art methods, with an\naverage increase of 6.08% in Micro F1 score and 7.71% in Macro F1 score.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:36:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Duzhen",""],["Li","Hongliu",""],["Cong","Wei",""],["Xu","Rongtao",""],["Dong","Jiahua",""],["Chen","Xiuyi",""]]}
{"id":"2308.08794","submitter":"Miguel Liu-Schiaffini","authors":"Miguel Liu-Schiaffini, Clare E. Singer, Nikola Kovachki, Tapio\n  Schneider, Kamyar Azizzadenesheli, Anima Anandkumar","title":"Tipping Point Forecasting in Non-Stationary Dynamics on Function Spaces","comments":"29 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tipping points are abrupt, drastic, and often irreversible changes in the\nevolution of non-stationary and chaotic dynamical systems. For instance,\nincreased greenhouse gas concentrations are predicted to lead to drastic\ndecreases in low cloud cover, referred to as a climatological tipping point. In\nthis paper, we learn the evolution of such non-stationary dynamical systems\nusing a novel recurrent neural operator (RNO), which learns mappings between\nfunction spaces. After training RNO on only the pre-tipping dynamics, we employ\nit to detect future tipping points using an uncertainty-based approach. In\nparticular, we propose a conformal prediction framework to forecast tipping\npoints by monitoring deviations from physics constraints (such as conserved\nquantities and partial differential equations), enabling forecasting of these\nabrupt changes along with a rigorous measure of uncertainty. We illustrate our\nproposed methodology on non-stationary ordinary and partial differential\nequations, such as the Lorenz-63 and Kuramoto-Sivashinsky equations. We also\napply our methods to forecast a climate tipping point in stratocumulus cloud\ncover. In our experiments, we demonstrate that even partial or approximate\nphysics constraints can be used to accurately forecast future tipping points.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:42:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu-Schiaffini","Miguel",""],["Singer","Clare E.",""],["Kovachki","Nikola",""],["Schneider","Tapio",""],["Azizzadenesheli","Kamyar",""],["Anandkumar","Anima",""]]}
{"id":"2308.08795","submitter":"Dmitri Wiebe","authors":"D. S. Wiebe, T. G. Sitnik, A. S. Rastorguev, T. A. Lozinskaya, A. M.\n  Tatarnikov, A. A. Tatarnikova, A. P. Topchieva, M. V. Zabolotskikh, A. A.\n  Fedoteva, A. A. Tatarnikov","title":"Analysis of the interstellar matter at the periphery of the supershell\n  surrounding the CYG OB1 association in 2.12 micron molecular hydrogen line","comments":"Accepted by Astrophysical Bulletin","journal-ref":null,"doi":"10.1134/S1990341323010017","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present observations of the vdB 130 cluster vicinity in a narrow-band\nfilter centered at a $2.12\\,\\mu$m molecular hydrogen line performed at the\nCaucasus Mountain Observatory of the Lomonosov Moscow State University. The\nobservations reveal an H$_2$ emission shell around vdB 130, coincident with a\nbright infrared shell, visible in all \\textit{Spitzer} bands. Also, numerous\nH$_{2}$ emission features are detected around infrared Blobs E and W and in the\nvicinity of a protocluster located to the east of the shell, in a tail of a\ncometary molecular cloud. H$_2$ emission in the vicinity of the vdB~130 cluster\nis mostly generated in well-developed \\HII\\ regions and is of fluorescent\nnature. In the protocluster area, isolated spots are observed, where H$_2$\nemission is collisionally excited and is probably related to shocks in\nprotostellar outflows. Obtained results are discussed in the context of\npossible sequential star formation in the vicinity of the vdB 130 cluster,\ntriggered by the interaction of the expanding supershell surrounding the Cyg\nOB1 association with the molecular cloud and an associated molecular filament.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:48:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wiebe","D. S.",""],["Sitnik","T. G.",""],["Rastorguev","A. S.",""],["Lozinskaya","T. A.",""],["Tatarnikov","A. M.",""],["Tatarnikova","A. A.",""],["Topchieva","A. P.",""],["Zabolotskikh","M. V.",""],["Fedoteva","A. A.",""],["Tatarnikov","A. A.",""]]}
{"id":"2308.08796","submitter":"Hongqiu Wu","authors":"Linfeng Liu, Hongqiu Wu, Hai Zhao","title":"Chinese Spelling Correction as Rephrasing Language Model","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 studies Chinese Spelling Correction (CSC), which aims to detect\nand correct potential spelling errors in a given sentence. Current\nstate-of-the-art methods regard CSC as a sequence tagging task and fine-tune\nBERT-based models on sentence pairs. However, we note a critical flaw in the\nprocess of tagging one character to another, that the correction is excessively\nconditioned on the error. This is opposite from human mindset, where\nindividuals rephrase the complete sentence based on its semantics, rather than\nsolely on the error patterns memorized before. Such a counter-intuitive\nlearning process results in the bottleneck of generalizability and\ntransferability of machine spelling correction. To address this, we propose\n$Rephrasing Language Modeling$ (ReLM), where the model is trained to rephrase\nthe entire sentence by infilling additional slots, instead of\ncharacter-to-character tagging. This novel training paradigm achieves the new\nstate-of-the-art results across fine-tuned and zero-shot CSC benchmarks,\noutperforming previous counterparts by a large margin. Our method also learns\ntransferable language representation when CSC is jointly trained with other\ntasks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:04:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Linfeng",""],["Wu","Hongqiu",""],["Zhao","Hai",""]]}
{"id":"2308.08797","submitter":"Asish Bera","authors":"Ritwiz Singh, Keshav Kashyap, Rajesh Mukherjee, Asish Bera, and Mamata\n  Dalui Chakraborty","title":"Deep Ear Biometrics for Gender Classification","comments":"10 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":"  Human gender classification based on biometric features is a major concern\nfor computer vision due to its vast variety of applications. The human ear is\npopular among researchers as a soft biometric trait, because it is less\naffected by age or changing circumstances, and is non-intrusive. In this study,\nwe have developed a deep convolutional neural network (CNN) model for automatic\ngender classification using the samples of ear images. The performance is\nevaluated using four cutting-edge pre-trained CNN models. In terms of trainable\nparameters, the proposed technique requires significantly less computational\ncomplexity. The proposed model has achieved 93% accuracy on the EarVN1.0 ear\ndataset.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:15:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Ritwiz",""],["Kashyap","Keshav",""],["Mukherjee","Rajesh",""],["Bera","Asish",""],["Chakraborty","Mamata Dalui",""]]}
{"id":"2308.08798","submitter":"Nikolai Beluhov","authors":"Nikolai Beluhov","title":"Slitherlink Signatures","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a planar graph and let $C$ be a cycle in $G$. Inside of each\nfinite face of $G$, we write down the number of edges of that face which belong\nto $C$. This is the signature of $C$ in $G$. The notion of a signature arises\nnaturally in the context of Slitherlink puzzles. The signature of a cycle does\nnot always determine it uniquely. We focus on the ambiguity of signatures in\nthe case when $G$ is a rectangular grid of unit square cells. We describe all\ngrids which admit an ambiguous signature. For each such grid, we then determine\nthe greatest possible difference between two cycles with the same signature on\nit. We also study the possible values of the total number of cycles which fit a\ngiven signature. We discuss various related questions as well.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:17:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beluhov","Nikolai",""]]}
{"id":"2308.08799","submitter":"Jiazheng Jing","authors":"Jiazheng Jing, Yinan Zhang, Xin Zhou, Zhiqi Shen","title":"Capturing Popularity Trends: A Simplistic Non-Personalized Approach for\n  Enhanced Item Recommendation","comments":"9 pages, 5 figures","journal-ref":null,"doi":"10.1145/3583780.3614801","report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recommender systems have been gaining increasing research attention over the\nyears. Most existing recommendation methods focus on capturing users'\npersonalized preferences through historical user-item interactions, which may\npotentially violate user privacy. Additionally, these approaches often overlook\nthe significance of the temporal fluctuation in item popularity that can sway\nusers' decision-making. To bridge this gap, we propose Popularity-Aware\nRecommender (PARE), which makes non-personalized recommendations by predicting\nthe items that will attain the highest popularity. PARE consists of four\nmodules, each focusing on a different aspect: popularity history, temporal\nimpact, periodic impact, and side information. Finally, an attention layer is\nleveraged to fuse the outputs of four modules. To our knowledge, this is the\nfirst work to explicitly model item popularity in recommendation systems.\nExtensive experiments show that PARE performs on par or even better than\nsophisticated state-of-the-art recommendation methods. Since PARE prioritizes\nitem popularity over personalized user preferences, it can enhance existing\nrecommendation methods as a complementary component. Our experiments\ndemonstrate that integrating PARE with existing recommendation methods\nsignificantly surpasses the performance of standalone models, highlighting\nPARE's potential as a complement to existing recommendation methods.\nFurthermore, the simplicity of PARE makes it immensely practical for industrial\napplications and a valuable baseline for future research.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:20:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jing","Jiazheng",""],["Zhang","Yinan",""],["Zhou","Xin",""],["Shen","Zhiqi",""]]}
{"id":"2308.08800","submitter":"Sapna Thapar","authors":"Sapna Thapar, Deepak Mishra, and Ravikant Saini","title":"Secure Transmission in NOMA-enabled Industrial IoT with\n  Resource-Constrained Untrusted Devices","comments":"10 pages and 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The security of confidential information associated with devices in the\nindustrial Internet of Things (IIoT) network is a serious concern. This article\nfocuses on achieving a nonorthogonal multiple access (NOMA)-enabled secure IIoT\nnetwork in the presence of untrusted devices by jointly optimizing the\nresources, such as decoding order and power allocated to devices. Assuming that\nthe devices are resource-constrained for performing perfect successive\ninterference cancellation (SIC), we characterize the residual interference at\nreceivers with the linear model. Firstly, considering all possible decoding\norders in an untrusted scenario, we obtain secure decoding orders that are\nfeasible to obtain a positive secrecy rate for each device. Then, under the\nsecrecy fairness criterion, we formulate a joint optimization problem of\nmaximizing the minimum secrecy rate among devices. Since the formulated problem\nis non-convex and combinatorial, we first obtain the optimal secure decoding\norder and then solve it for power allocation by analyzing Karush-Kuhn-Tucker\npoints. Thus, we provide the closed-form global-optimal solution of the\nformulated optimization problem. Numerical results validate the analytical\nclaims and demonstrate an interesting observation that the conventional\ndecoding order and assigning more power allocation to the weak device, as\npresumed in many works on NOMA, is not an optimal strategy from the secrecy\nfairness viewpoint. Also, the average percentage gain of about 22.75%, 50.58%,\n94.59%, and 98.16%, respectively, is achieved by jointly optimized solution\nover benchmarks ODEP (optimal decoding order, equal power allocation), ODFP\n(optimal decoding order, fixed power allocation), FDEP (fixed decoding order,\nequal power allocation), and FDFP (fixed decoding order, fixed power\nallocation).\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:20:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thapar","Sapna",""],["Mishra","Deepak",""],["Saini","Ravikant",""]]}
{"id":"2308.08801","submitter":"Tomona Kinugawa","authors":"Tomona Kinugawa and Tetsuo Hyodo","title":"Compositeness of near-threshold exotic hadrons with decay and\n  coupled-channel effects","comments":"4 pages, 2 figures, Proceedings of 17th International Workshop on\n  Meson Physics (MESON2023), 22nd - 27th June, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The near-threshold exotic hadrons such as $T_{cc}$ and $X(3872)$ are naively\nconsidered as the hadronic molecular state from the viewpoint of the low-energy\nuniversality. However, it is also known that the elementary dominant state is\nnot completely excluded as the internal structure of the near-threshold states.\nFurthermore, the dominance of molecules is expected to be modified by the decay\nor coupled channels. We discuss these features of the near-threshold bound\nstates by calculating the compositeness with the effective field theory.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:23:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kinugawa","Tomona",""],["Hyodo","Tetsuo",""]]}
{"id":"2308.08802","submitter":"Shunsuke Endo","authors":"Shunsuke Endo, Shiori Kawamura, Takuya Okudaira, Hiromoto Yoshikawa,\n  Gerard Rovira, Atsushi Kimura, Shoji Nakamura, Osamu Iwamoto, Nobuyuki\n  Iwamoto","title":"Measurements of neutron total and capture cross sections of $^{139}$La\n  and evaluation of resonance parameters","comments":"12 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neutron total and capture cross sections of Lanthanum(La)-139 were measured\nat the Accurate Ne-utron-Nucleus Reaction measurement Instrument (ANNRI) of the\nMaterials and Life Science Experimental Facility (MLF) in the Japan Proton\nAccelerator Research Complex (J-PARC). The total cross section was largely\ndifferent from that in evaluated libraries, such as JENDL-5, in the energy\nrange from 80 to 900~eV. Resonance parameters for four resonances including one\nnegative resonance were obtained using a resonance analysis code, REFIT. The\nresonance analysis revealed discrepancies in several resonance parameters with\nthe evaluated libraries. Furthermore, the information about the scattering\nradius was also extracted from the results of the total cross section. The\nobtained scattering radius was larger than that recorded in the evaluated\nlibraries.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:27:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Endo","Shunsuke",""],["Kawamura","Shiori",""],["Okudaira","Takuya",""],["Yoshikawa","Hiromoto",""],["Rovira","Gerard",""],["Kimura","Atsushi",""],["Nakamura","Shoji",""],["Iwamoto","Osamu",""],["Iwamoto","Nobuyuki",""]]}
{"id":"2308.08803","submitter":"Arun Silivery","authors":"Arun Kumar Silivery, Kovvur Ram Mohan Rao, L K Suresh Kumar","title":"An Effective Deep Learning Based Multi-Class Classification of DoS and\n  DDoS Attack Detection","comments":null,"journal-ref":null,"doi":"10.32985/ijeces.14.4.6","report-no":null,"categories":"cs.CR cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the past few years, cybersecurity is becoming very important due to the\nrise in internet users. The internet attacks such as Denial of service (DoS)\nand Distributed Denial of Service (DDoS) attacks severely harm a website or\nserver and make them unavailable to other users. Network Monitoring and control\nsystems have found it challenging to identify the many classes of DoS and DDoS\nattacks since each operates uniquely. Hence a powerful technique is required\nfor attack detection. Traditional machine learning techniques are inefficient\nin handling extensive network data and cannot extract high-level features for\nattack detection. Therefore, an effective deep learning-based intrusion\ndetection system is developed in this paper for DoS and DDoS attack\nclassification. This model includes various phases and starts with the Deep\nConvolutional Generative Adversarial Networks (DCGAN) based technique to\naddress the class imbalance issue in the dataset. Then a deep learning\nalgorithm based on ResNet-50 extracts the critical features for each class in\nthe dataset. After that, an optimized AlexNet-based classifier is implemented\nfor detecting the attacks separately, and the essential parameters of the\nclassifier are optimized using the Atom search optimization algorithm. The\nproposed approach was evaluated on benchmark datasets, CCIDS2019 and UNSW-NB15,\nusing key classification metrics and achieved 99.37% accuracy for the UNSW-NB15\ndataset and 99.33% for the CICIDS2019 dataset. The investigational results\ndemonstrate that the suggested approach performs superior to other competitive\ntechniques in identifying DoS and DDoS attacks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:27:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Silivery","Arun Kumar",""],["Rao","Kovvur Ram Mohan",""],["Kumar","L K Suresh",""]]}
{"id":"2308.08804","submitter":"Sapna Thapar","authors":"Sapna Thapar, Deepak Mishra, Derrick Wing Kwan Ng, and Ravikant Saini","title":"Secrecy Outage Probability Analysis for Downlink Untrusted NOMA Under\n  Practical SIC Error","comments":"6 pages, 5 figures, GLOBECOM 2021","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-orthogonal multiple access (NOMA) serves multiple users simultaneously\nvia the same resource block by exploiting superposition coding at the\ntransmitter and successive interference cancellation (SIC) at the receivers.\nUnder practical considerations, perfect SIC may not be achieved. Thus, residual\ninterference (RI) occurs inevitably due to imperfect SIC. In this work, we\nfirst propose a novel model for characterizing RI to provide a more realistic\nsecrecy performance analysis of a downlink NOMA system under imperfect SIC at\nreceivers. In the presence of untrusted users, NOMA has an inherent security\nflaw. Therefore, for this untrusted users' scenario, we derive new analytical\nexpressions of secrecy outage probability (SOP) for each user in a two-user\nuntrusted NOMA system by using the proposed RI model. To further shed light on\nthe obtained results and obtain a deeper understanding, a high signal-to-noise\nratio approximation of the SOPs is also obtained. Lastly, numerical\ninvestigations are provided to validate the accuracy of the desired analytical\nresults and present valuable insights into the impact of various system\nparameters on the secrecy rate performance of the secure NOMA communication\nsystem.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:32:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thapar","Sapna",""],["Mishra","Deepak",""],["Ng","Derrick Wing Kwan",""],["Saini","Ravikant",""]]}
{"id":"2308.08805","submitter":"Xin Zhang","authors":"Xin Zhang and Andrew Curtis","title":"Bayesian Variational Time-lapse Full-waveform Inversion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time-lapse seismic full-waveform inversion (FWI) provides estimates of\ndynamic changes in the subsurface by performing multiple seismic surveys at\ndifferent times. Since FWI problems are highly non-linear and non-unique, it is\nimportant to quantify uncertainties in such estimates to allow robust decision\nmaking. Markov chain Monte Carlo (McMC) methods have been used for this\npurpose, but due to their high computational cost, those studies often require\nan accurate baseline model and estimates of the locations of potential velocity\nchanges, and neglect uncertainty in the baseline velocity model. Such detailed\nand accurate prior information is not always available in practice.\n  In this study we use an efficient optimization method called stochastic Stein\nvariational gradient descent (sSVGD) to solve time-lapse FWI problems without\nassuming such prior knowledge, and to estimate uncertainty both in the baseline\nvelocity model and the velocity change. We test two Bayesian strategies:\nseparate Bayesian inversions for each seismic survey, and a single join\ninversion for baseline and repeat surveys, and compare the methods with the\nstandard linearised double difference inversion. The results demonstrate that\nall three methods can produce accurate velocity change estimates in the case of\nhaving fixed (exactly repeatable) acquisition geometries, but that the two\nBayesian methods generate more accurate results when the acquisition geometry\nchanges between surveys. Furthermore the joint inversion provides the most\naccurate velocity change and uncertainty estimates in all cases. We therefore\nconclude that Bayesian time-lapse inversion, especially adopting a joint\ninversion strategy, may be useful to image and monitor the subsurface changes,\nin particular where uncertainty in the results might lead to significantly\ndifferent decisions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:32:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Xin",""],["Curtis","Andrew",""]]}
{"id":"2308.08806","submitter":"Ziyin Zhang","authors":"Ziyin Zhang, Ning Lu, Minghui Liao, Yongshuai Huang, Cheng Li, Min\n  Wang and Wei Peng","title":"Self-distillation Regularized Connectionist Temporal Classification Loss\n  for Text Recognition: A Simple Yet Effective Approach","comments":"Ziyin Zhang and Ning Lu are co-first authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text recognition methods are gaining rapid development. Some advanced\ntechniques, e.g., powerful modules, language models, and un- and\nsemi-supervised learning schemes, consecutively push the performance on public\nbenchmarks forward. However, the problem of how to better optimize a text\nrecognition model from the perspective of loss functions is largely overlooked.\nCTC-based methods, widely used in practice due to their good balance between\nperformance and inference speed, still grapple with accuracy degradation. This\nis because CTC loss emphasizes the optimization of the entire sequence target\nwhile neglecting to learn individual characters. We propose a self-distillation\nscheme for CTC-based model to address this issue. It incorporates a framewise\nregularization term in CTC loss to emphasize individual supervision, and\nleverages the maximizing-a-posteriori of latent alignment to solve the\ninconsistency problem that arises in distillation between CTC-based models. We\nrefer to the regularized CTC loss as Distillation Connectionist Temporal\nClassification (DCTC) loss. DCTC loss is module-free, requiring no extra\nparameters, longer inference lag, or additional training data or phases.\nExtensive experiments on public benchmarks demonstrate that DCTC can boost text\nrecognition model accuracy by up to 2.6%, without any of these drawbacks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:32:57 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 02:50:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Ziyin",""],["Lu","Ning",""],["Liao","Minghui",""],["Huang","Yongshuai",""],["Li","Cheng",""],["Wang","Min",""],["Peng","Wei",""]]}
{"id":"2308.08807","submitter":"Jivnesh Sandhan","authors":"Jivnesh Sandhan","title":"Linguistically-Informed Neural Architectures for Lexical, Syntactic and\n  Semantic Tasks in Sanskrit","comments":"Ph.D. dissertation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The primary focus of this thesis is to make Sanskrit manuscripts more\naccessible to the end-users through natural language technologies. The\nmorphological richness, compounding, free word orderliness, and low-resource\nnature of Sanskrit pose significant challenges for developing deep learning\nsolutions. We identify four fundamental tasks, which are crucial for developing\na robust NLP technology for Sanskrit: word segmentation, dependency parsing,\ncompound type identification, and poetry analysis. The first task, Sanskrit\nWord Segmentation (SWS), is a fundamental text processing task for any other\ndownstream applications. However, it is challenging due to the sandhi\nphenomenon that modifies characters at word boundaries. Similarly, the existing\ndependency parsing approaches struggle with morphologically rich and\nlow-resource languages like Sanskrit. Compound type identification is also\nchallenging for Sanskrit due to the context-sensitive semantic relation between\ncomponents. All these challenges result in sub-optimal performance in NLP\napplications like question answering and machine translation. Finally, Sanskrit\npoetry has not been extensively studied in computational linguistics.\n  While addressing these challenges, this thesis makes various contributions:\n(1) The thesis proposes linguistically-informed neural architectures for these\ntasks. (2) We showcase the interpretability and multilingual extension of the\nproposed systems. (3) Our proposed systems report state-of-the-art performance.\n(4) Finally, we present a neural toolkit named SanskritShala, a web-based\napplication that provides real-time analysis of input for various NLP tasks.\nOverall, this thesis contributes to making Sanskrit manuscripts more accessible\nby developing robust NLP technology and releasing various resources, datasets,\nand web-based toolkit.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:33:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sandhan","Jivnesh",""]]}
{"id":"2308.08808","submitter":"Saeed Siyal","authors":"Rahmat Ullah, Rashid Aftab, Saeed Siyal, and Kashif Zaheer","title":"Entrepreneurial Higher Education Education, Knowledge and Wealth\n  Creation","comments":"130 pages, 10 figures","journal-ref":"Riphah Institute of Public Policy, Riphah International\n  University, Islamabad 2023","doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This book presents detailed discussion on the role of higher education in\nterms of serving basic knowledge creation, teaching, and doing applied research\nfor commercialization. The book presents an historical account on how this\nchallenge was addressed earlier in education history, the cases of successful\nacademic commercialization, the marriage between basic and applied science and\nhow universities develop economies of the regions and countries. This book also\ndiscusses cultural and social challenges in research commercialization and\npathways to break the status quo.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:36:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ullah","Rahmat",""],["Aftab","Rashid",""],["Siyal","Saeed",""],["Zaheer","Kashif",""]]}
{"id":"2308.08809","submitter":"Shuta Tanaka","authors":"Shuta J. Tanaka and Kazumi Kashiyama","title":"Testing a stochastic acceleration model of pulsar wind nebulae: Early\n  evolution of a wind nebula associated with SN 1986J","comments":"Accepted for publication in MNRAS, 8 pages, 2 figures and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over three thousand pulsars have been discovered, but none have been\nconfirmed to be younger than a few hundred years. Observing a pulsar after a\nsupernova explosion will help us understand the properties of newborn ones,\nincluding their capability to produce gamma-ray bursts and fast radio bursts.\nHere, the possible youngest pulsar wind nebula (PWN) at the center of the SN\n1986J remnant is studied. We demonstrate that the 5 GHz flux of 'PWN 1986J',\nincreasing with time, is consistent with a stochastic acceleration model of\nPWNe developed to explain the flat radio spectrum of the Crab Nebula. We obtain\nan acceleration time-scale of electrons/positrons and a decay time-scale of the\nturbulence responsible for the stochastic acceleration as about 10 and 70\nyears, respectively. Our findings suggest that efficient stochastic\nacceleration and rising radio/submm light curves are characteristic signatures\nof the youngest PWNe. Follow-up ${\\it ALMA}$ observations of decades-old\nsupernovae within a few tens of Mpc, including SN 1986J, are encouraged to\nreveal the origin of the flat radio spectrum of PWNe.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:36:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tanaka","Shuta J.",""],["Kashiyama","Kazumi",""]]}
{"id":"2308.08810","submitter":"Sunghyun Park","authors":"Sunghyun Park, Seunghan Yang, Jaegul Choo, Sungrack Yun","title":"Label Shift Adapter for Test-Time Adaptation under Covariate and Label\n  Shifts","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Test-time adaptation (TTA) aims to adapt a pre-trained model to the target\ndomain in a batch-by-batch manner during inference. While label distributions\noften exhibit imbalances in real-world scenarios, most previous TTA approaches\ntypically assume that both source and target domain datasets have balanced\nlabel distribution. Due to the fact that certain classes appear more frequently\nin certain domains (e.g., buildings in cities, trees in forests), it is natural\nthat the label distribution shifts as the domain changes. However, we discover\nthat the majority of existing TTA methods fail to address the coexistence of\ncovariate and label shifts. To tackle this challenge, we propose a novel label\nshift adapter that can be incorporated into existing TTA approaches to deal\nwith label shifts during the TTA process effectively. Specifically, we estimate\nthe label distribution of the target domain to feed it into the label shift\nadapter. Subsequently, the label shift adapter produces optimal parameters for\nthe target label distribution. By predicting only the parameters for a part of\nthe pre-trained source model, our approach is computationally efficient and can\nbe easily applied, regardless of the model architectures. Through extensive\nexperiments, we demonstrate that integrating our strategy with TTA approaches\nleads to substantial performance improvements under the joint presence of label\nand covariate shifts.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:37:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Park","Sunghyun",""],["Yang","Seunghan",""],["Choo","Jaegul",""],["Yun","Sungrack",""]]}
{"id":"2308.08811","submitter":"Sapna Thapar","authors":"Sapna Thapar, Insha Amin, Deepak Mishra, and Ravikant Saini","title":"Secrecy Outage Probability Analysis for Downlink NOMA with Imperfect SIC\n  at Untrusted Users","comments":"5 pages, 5 figures, and EUSIPCO 2021","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-orthogonal multiple access (NOMA) has come to the fore as a spectrally\nefficient technique for fifth-generation networks and beyond. At the same time,\nNOMA faces severe security issues in the presence of untrusted users due to\nsuccessive interference cancellation (SIC)-based decoding at receivers. In this\npaper, to make the system model more realistic, we consider the impact of\nimperfect SIC during the decoding process. Assuming the downlink mode, we focus\non designing a secure NOMA communication protocol for the considered system\nmodel with two untrusted users. In this regard, we obtain the power allocation\nbounds to achieve a positive secrecy rate for both near and far users.\nAnalytical expressions of secrecy outage probability (SOP) for both users are\nderived to analyze secrecy performance. Closed-form approximations of SOPs are\nalso provided to gain analytical insights. Lastly, numerical results have been\npresented, which validate the exactness of the analysis and reveal the effect\nof various key parameters on achieved secrecy performance.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:40:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thapar","Sapna",""],["Amin","Insha",""],["Mishra","Deepak",""],["Saini","Ravikant",""]]}
{"id":"2308.08812","submitter":"Sanchar Palit","authors":"Sanchar Palit and Sandika Biswas","title":"A Fusion of Variational Distribution Priors and Saliency Map Replay for\n  Continual 3D Reconstruction","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Single-image 3D reconstruction is a research challenge focused on predicting\n3D object shapes from single-view images. This task requires significant data\nacquisition to predict both visible and occluded portions of the shape.\nFurthermore, learning-based methods face the difficulty of creating a\ncomprehensive training dataset for all possible classes. To this end, we\npropose a continual learning-based 3D reconstruction method where our goal is\nto design a model using Variational Priors that can still reconstruct the\npreviously seen classes reasonably even after training on new classes.\nVariational Priors represent abstract shapes and combat forgetting, whereas\nsaliency maps preserve object attributes with less memory usage. This is vital\ndue to resource constraints in storing extensive training data. Additionally,\nwe introduce saliency map-based experience replay to capture global and\ndistinct object features. Thorough experiments show competitive results\ncompared to established methods, both quantitatively and qualitatively.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:48:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Palit","Sanchar",""],["Biswas","Sandika",""]]}
{"id":"2308.08813","submitter":"Sapna Thapar","authors":"Sapna Thapar, Deepak Mishra, and Ravikant Saini","title":"Untrusted NOMA with Imperfect SIC: Outage Performance Analysis and\n  Optimization","comments":"6 pages, 5 figures, WCNC 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-orthogonal multiple access (NOMA) has come to the fore as a\nspectral-efficient technique for fifth-generation and beyond communication\nnetworks. We consider the downlink of a NOMA system with untrusted users. In\norder to consider a more realistic scenario, imperfect successive interference\ncancellation is assumed at the receivers during the decoding process. Since\npair outage probability (POP) ensures a minimum rate guarantee to each user, it\nbehaves as a measure of the quality of service for the pair of users. With the\nobjective of designing a reliable communication protocol, we derive the\nclosed-form expression of POP. Further, we find the optimal power allocation\nthat minimizes the POP. Lastly, numerical results have been presented which\nvalidate the exactness of the analysis, and reveal the effect of various key\nparameters on achieved pair outage performance. In addition, we benchmark\noptimal power allocation against equal and fixed power allocations with respect\nto POP. The results indicate that optimal power allocation results in improved\ncommunication reliability.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:51:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thapar","Sapna",""],["Mishra","Deepak",""],["Saini","Ravikant",""]]}
{"id":"2308.08814","submitter":"Mihir Pendharkar","authors":"Mihir Pendharkar, Steven J. Tran, Gregory Zaborski Jr., Joe Finney,\n  Aaron L. Sharpe, Rupini V. Kamat, Sandesh S. Kalantre, Marisa Hocking, Nathan\n  J. Bittner, Kenji Watanabe, Takashi Taniguchi, Bede Pittenger, Christina J.\n  Newcomb, Marc A. Kastner, Andrew J. Mannix, David Goldhaber-Gordon","title":"Torsional Force Microscopy of Van der Waals Moir\\'es and Atomic Lattices","comments":"28 pages, 14 figures including supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a stack of atomically-thin Van der Waals layers, introducing interlayer\ntwist creates a moir\\'e superlattice whose period is a function of twist angle.\nChanges in that twist angle of even hundredths of a degree can dramatically\ntransform the system's electronic properties. Setting a precise and uniform\ntwist angle for a stack remains difficult, hence determining that twist angle\nand mapping its spatial variation is very important. Techniques have emerged to\ndo this by imaging the moir\\'e, but most of these require sophisticated\ninfrastructure, time-consuming sample preparation beyond stack synthesis, or\nboth. In this work, we show that Torsional Force Microscopy (TFM), a scanning\nprobe technique sensitive to dynamic friction, can reveal surface and shallow\nsubsurface structure of Van der Waals stacks on multiple length scales: the\nmoir\\'es formed between bilayers of graphene and between graphene and hexagonal\nboron nitride (hBN), and also the atomic crystal lattices of graphene and hBN.\nIn TFM, torsional motion of an AFM cantilever is monitored as the it is\nactively driven at a torsional resonance while a feedback loop maintains\ncontact at a set force with the surface of a sample. TFM works at room\ntemperature in air, with no need for an electrical bias between the tip and the\nsample, making it applicable to a wide array of samples. It should enable\ndetermination of precise structural information including twist angles and\nstrain in moir\\'e superlattices and crystallographic orientation of VdW flakes\nto support predictable moir\\'e heterostructure fabrication.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:53:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pendharkar","Mihir",""],["Tran","Steven J.",""],["Zaborski","Gregory","Jr."],["Finney","Joe",""],["Sharpe","Aaron L.",""],["Kamat","Rupini V.",""],["Kalantre","Sandesh S.",""],["Hocking","Marisa",""],["Bittner","Nathan J.",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Pittenger","Bede",""],["Newcomb","Christina J.",""],["Kastner","Marc A.",""],["Mannix","Andrew J.",""],["Goldhaber-Gordon","David",""]]}
{"id":"2308.08815","submitter":"Ya-Dong Wu","authors":"Yan Zhu, Ya-Dong Wu, Qiushi Liu, Yuexuan Wang, Giulio Chiribella","title":"Predictive Modelling of Quantum Process with Neural Networks","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Complete characterization of an unknown quantum process can be achieved by\nprocess tomography, or, for continuous time processes, by Hamiltonian learning.\nHowever, such a characterization becomes unfeasible for high dimensional\nquantum systems. In this paper, we develop the first neural network algorithm\nfor predicting the behavior of an unknown quantum process when applied on a\ngiven ensemble of input states. The network is trained with classical data\nobtained from measurements on a few pairs of input/output quantum states. After\ntraining, it can be used to predict the measurement statistics of a set of\nmeasurements of interest performed on the output state corresponding to any\ninput in the state ensemble. Besides learning a quantum gate or quantum\ncircuit, our model can also be applied to the task of learning a noisy quantum\nevolution and predicting the measurement statistics on a time-evolving quantum\nstate. We show numerical results using our neural network model for various\nrelevant processes in quantum computing, quantum many-body physics, and quantum\noptics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:53:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhu","Yan",""],["Wu","Ya-Dong",""],["Liu","Qiushi",""],["Wang","Yuexuan",""],["Chiribella","Giulio",""]]}
{"id":"2308.08816","submitter":"Zhengxiong Luo","authors":"Zhengxiong Luo, Yan Huang, Shang Li, Liang Wang, Tieniu Tan","title":"End-to-end Alternating Optimization for Real-World Blind Super\n  Resolution","comments":"Extension of our previous NeurIPS paper. Accepted to IJCV","journal-ref":"International Journal of Computer Vision (IJCV) 2023","doi":"10.1007/s11263-023-01833-7","report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blind Super-Resolution (SR) usually involves two sub-problems: 1) estimating\nthe degradation of the given low-resolution (LR) image; 2) super-resolving the\nLR image to its high-resolution (HR) counterpart. Both problems are ill-posed\ndue to the information loss in the degrading process. Most previous methods try\nto solve the two problems independently, but often fall into a dilemma: a good\nsuper-resolved HR result requires an accurate degradation estimation, which\nhowever, is difficult to be obtained without the help of original HR\ninformation. To address this issue, instead of considering these two problems\nindependently, we adopt an alternating optimization algorithm, which can\nestimate the degradation and restore the SR image in a single model.\nSpecifically, we design two convolutional neural modules, namely\n\\textit{Restorer} and \\textit{Estimator}. \\textit{Restorer} restores the SR\nimage based on the estimated degradation, and \\textit{Estimator} estimates the\ndegradation with the help of the restored SR image. We alternate these two\nmodules repeatedly and unfold this process to form an end-to-end trainable\nnetwork. In this way, both \\textit{Restorer} and \\textit{Estimator} could get\nbenefited from the intermediate results of each other, and make each\nsub-problem easier. Moreover, \\textit{Restorer} and \\textit{Estimator} are\noptimized in an end-to-end manner, thus they could get more tolerant of the\nestimation deviations of each other and cooperate better to achieve more robust\nand accurate final results. Extensive experiments on both synthetic datasets\nand real-world images show that the proposed method can largely outperform\nstate-of-the-art methods and produce more visually favorable results. The codes\nare rleased at \\url{https://github.com/greatlog/RealDAN.git}.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:55:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","Zhengxiong",""],["Huang","Yan",""],["Li","Shang",""],["Wang","Liang",""],["Tan","Tieniu",""]]}
{"id":"2308.08817","submitter":"Mehdi Sadeghi","authors":"Mehdi Sadeghi, S. M. Moosavi Khansari","title":"Conductivity and Shear Viscosity of $arcsin$-Yang-Mills AdS Black Brane","comments":"9 Pages, no figure, version accepted for publication in INJP","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, a non-abelian $arcsin$-Yang-Mills AdS black brane solution is\nintroduced. Then, the color non-abelian direct current (DC) conductivity and\nshear viscosity to entropy density ratio of this model is calculated using\nfluid-gravity duality. Our results show that the Kovtun, Son and Starinets\n(KSS) bound is saturated and is exactly equal to $\\frac{1}{4 \\pi}$ but the\ncolor conductivity bound is violated for this model. Also, our outcomes recover\nthe Yang-Mills AdS black brane when the coupling of Yang-Mills and gravity\nfields approaches zero.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:56:48 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 16:11:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sadeghi","Mehdi",""],["Khansari","S. M. Moosavi",""]]}
{"id":"2308.08818","submitter":"Sapna Thapar","authors":"Sapna Thapar, Deepak Mishra, Ravikant Saini, and Zhiguo Ding","title":"User-Pair Selection for QoS-Aware Secrecy Rate Maximization in Untrusted\n  NOMA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-orthogonal multiple access (NOMA) has been recognized as one of the key\nenabling technologies for future generation wireless networks. Sharing the same\ntime-frequency resource among users imposes secrecy challenges in NOMA in the\npresence of untrusted users. This paper characterizes the impact of user-pair\nselection on the secrecy performance of an untrusted NOMA system. In this\nregard, an optimization problem is formulated to maximize the secrecy rate of\nthe strong user while satisfying the quality of service (QoS) demands of the\nuser with poorer channel conditions. To solve this problem, we first obtain\noptimal power allocation in a two-user NOMA system, and then investigate the\nuser-pair selection problem in a more generalized four user NOMA system.\nExtensive performance evaluations are conducted to validate the accuracy of the\nproposed results and present valuable insights on the impact of various system\nparameters on the secrecy performance of the NOMA communication system.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:57:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thapar","Sapna",""],["Mishra","Deepak",""],["Saini","Ravikant",""],["Ding","Zhiguo",""]]}
{"id":"2308.08819","submitter":"Kevin Ren","authors":"Kevin Ren, Hong Wang","title":"Furstenberg sets estimate in the plane","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We fully resolve the Furstenberg set conjecture in $\\mathbb{R}^2$, that a\n$(s, t)$-Furstenberg set has Hausdorff dimension $\\ge \\min(s+t, \\frac{s+3t}{2},\ns+1)$. As a result, we obtain an analogue of Elekes' bound for the discretized\nsum-product problem and resolve an orthogonal projection question of Oberlin.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:04:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ren","Kevin",""],["Wang","Hong",""]]}
{"id":"2308.08820","submitter":"Go Uchida","authors":"Go Uchida, Hitoshi Washizu, Hiromi Miyoshi","title":"Diffusion with a broad class of stochastic diffusion coefficients","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In many physical or biological systems, diffusion can be described by\nBrownian motions with stochastic diffusion coefficients (DCs). Recently,\nspecific models of the motions have been proposed for anomalous diffusion. In\nthe present study, we investigate properties of the diffusion with a broad\nclass of stochastic DCs using the Fokker-Planck formalism. We show that for a\nfinite time, the propagator is non-Gaussian and heavy-tailed. This means that\nwhen the mean square displacements are the same, for a finite time, some of the\ndiffusing particles with stochastic DCs diffuse farther than the particles with\ndeterministic DCs or exhibiting a fractional Brownian motion.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:05:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Uchida","Go",""],["Washizu","Hitoshi",""],["Miyoshi","Hiromi",""]]}
{"id":"2308.08821","submitter":"Hua-Lei Yin","authors":"Xiao-Yu Cao, Bing-Hong Li, Yang Wang, Yao Fu, Hua-Lei Yin, Zeng-Bing\n  Chen","title":"Experimental quantum e-commerce","comments":"16 pages, 5 figures, Comments are weclome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CR physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  E-commerce, a type of trading that occurs at a high frequency on the\nInternet, requires guaranteeing the integrity, authentication and\nnon-repudiation of messages through long distance. As current e-commerce\nschemes are vulnerable to computational attacks, quantum cryptography, ensuring\ninformation-theoretic security against adversary's repudiation and forgery,\nprovides a solution to this problem. However, quantum solutions generally have\nmuch lower performance compared to classical ones. Besides, when considering\nimperfect devices, the performance of quantum schemes exhibits a significant\ndecline. Here, for the first time, we demonstrate the whole e-commerce process\nof involving the signing of a contract and payment among three parties by\nproposing a quantum e-commerce scheme, which shows resistance of attacks from\nimperfect devices. Results show that with a maximum attenuation of 25 dB among\nparticipants, our scheme can achieve a signature rate of 0.82 times per second\nfor an agreement size of approximately 0.428 megabit. This proposed scheme\npresents a promising solution for providing information-theoretic security for\ne-commerce.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:06:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cao","Xiao-Yu",""],["Li","Bing-Hong",""],["Wang","Yang",""],["Fu","Yao",""],["Yin","Hua-Lei",""],["Chen","Zeng-Bing",""]]}
{"id":"2308.08822","submitter":"Shinnosuke Matsuo","authors":"Takanori Asanomi, Shinnosuke Matsuo, Daiki Suehiro, Ryoma Bise","title":"MixBag: Bag-Level Data Augmentation for Learning from Label Proportions","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":"  Learning from label proportions (LLP) is a promising weakly supervised\nlearning problem. In LLP, a set of instances (bag) has label proportions, but\nno instance-level labels are given. LLP aims to train an instance-level\nclassifier by using the label proportions of the bag. In this paper, we propose\na bag-level data augmentation method for LLP called MixBag, based on the key\nobservation from our preliminary experiments; that the instance-level\nclassification accuracy improves as the number of labeled bags increases even\nthough the total number of instances is fixed. We also propose a confidence\ninterval loss designed based on statistical theory to use the augmented bags\neffectively. To the best of our knowledge, this is the first attempt to propose\nbag-level data augmentation for LLP. The advantage of MixBag is that it can be\napplied to instance-level data augmentation techniques and any LLP method that\nuses the proportion loss. Experimental results demonstrate this advantage and\nthe effectiveness of our method.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:06:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Asanomi","Takanori",""],["Matsuo","Shinnosuke",""],["Suehiro","Daiki",""],["Bise","Ryoma",""]]}
{"id":"2308.08823","submitter":"Tianmeng Yang","authors":"Tianmeng Yang, Min Zhou, Yujing Wang, Zhengjie Lin, Lujia Pan, Bin\n  Cui, Yunhai Tong","title":"Mitigating Semantic Confusion from Hostile Neighborhood for Graph Active\n  Learning","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Active Learning (GAL), which aims to find the most informative nodes in\ngraphs for annotation to maximize the Graph Neural Networks (GNNs) performance,\nhas attracted many research efforts but remains non-trivial challenges. One\nmajor challenge is that existing GAL strategies may introduce semantic\nconfusion to the selected training set, particularly when graphs are noisy.\nSpecifically, most existing methods assume all aggregating features to be\nhelpful, ignoring the semantically negative effect between inter-class edges\nunder the message-passing mechanism. In this work, we present Semantic-aware\nActive learning framework for Graphs (SAG) to mitigate the semantic confusion\nproblem. Pairwise similarities and dissimilarities of nodes with semantic\nfeatures are introduced to jointly evaluate the node influence. A new\nprototype-based criterion and query policy are also designed to maintain\ndiversity and class balance of the selected nodes, respectively. Extensive\nexperiments on the public benchmark graphs and a real-world financial dataset\ndemonstrate that SAG significantly improves node classification performances\nand consistently outperforms previous methods. Moreover, comprehensive analysis\nand ablation study also verify the effectiveness of the proposed framework.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:06:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Tianmeng",""],["Zhou","Min",""],["Wang","Yujing",""],["Lin","Zhengjie",""],["Pan","Lujia",""],["Cui","Bin",""],["Tong","Yunhai",""]]}
{"id":"2308.08824","submitter":"Takahiro Maeda","authors":"Takahiro Maeda and Norimichi Ukita","title":"Fast Inference and Update of Probabilistic Density Estimation on\n  Trajectory Prediction","comments":"Accepted at ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Safety-critical applications such as autonomous vehicles and social robots\nrequire fast computation and accurate probability density estimation on\ntrajectory prediction. To address both requirements, this paper presents a new\nnormalizing flow-based trajectory prediction model named FlowChain. FlowChain\nis a stack of conditional continuously-indexed flows (CIFs) that are expressive\nand allow analytical probability density computation. This analytical\ncomputation is faster than the generative models that need additional\napproximations such as kernel density estimation. Moreover, FlowChain is more\naccurate than the Gaussian mixture-based models due to fewer assumptions on the\nestimated density. FlowChain also allows a rapid update of estimated\nprobability densities. This update is achieved by adopting the \\textit{newest\nobserved position} and reusing the flow transformations and its\nlog-det-jacobians that represent the \\textit{motion trend}. This update is\ncompleted in less than one millisecond because this reuse greatly omits the\ncomputational cost. Experimental results showed our FlowChain achieved\nstate-of-the-art trajectory prediction accuracy compared to previous methods.\nFurthermore, our FlowChain demonstrated superiority in the accuracy and speed\nof density estimation. Our code is available at\n\\url{https://github.com/meaten/FlowChain-ICCV2023}\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:16:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Maeda","Takahiro",""],["Ukita","Norimichi",""]]}
{"id":"2308.08825","submitter":"Vikram Krishnamurthy","authors":"Adit Jain and Vikram Krishnamurthy","title":"Controlling Federated Learning for Covertness","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":"  A learner aims to minimize a function $f$ by repeatedly querying a\ndistributed oracle that provides noisy gradient evaluations. At the same time,\nthe learner seeks to hide $\\arg\\min f$ from a malicious eavesdropper that\nobserves the learner's queries. This paper considers the problem of\n\\textit{covert} or \\textit{learner-private} optimization, where the learner has\nto dynamically choose between learning and obfuscation by exploiting the\nstochasticity. The problem of controlling the stochastic gradient algorithm for\ncovert optimization is modeled as a Markov decision process, and we show that\nthe dynamic programming operator has a supermodular structure implying that the\noptimal policy has a monotone threshold structure. A computationally efficient\npolicy gradient algorithm is proposed to search for the optimal querying policy\nwithout knowledge of the transition probabilities. As a practical application,\nour methods are demonstrated on a hate speech classification task in a\nfederated setting where an eavesdropper can use the optimal weights to generate\ntoxic content, which is more easily misclassified. Numerical results show that\nwhen the learner uses the optimal policy, an eavesdropper can only achieve a\nvalidation accuracy of $52\\%$ with no information and $69\\%$ when it has a\npublic dataset with 10\\% positive samples compared to $83\\%$ when the learner\nemploys a greedy policy.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:16:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jain","Adit",""],["Krishnamurthy","Vikram",""]]}
{"id":"2308.08826","submitter":"Ion Dinca Mr","authors":"Ion I. Dinca","title":"The B\\\"{a}cklund transforms of Peterson's isometric deformations of\n  diagonal higher dimensional quadrics without center","comments":"arXiv admin note: substantial text overlap with arXiv:0808.2007,\n  arXiv:2208.11419; text overlap with arXiv:0905.0216, arXiv:0902.1421","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We provide the B\\\"{a}cklund transforms of Peterson's isometric deformations\nof diagonal higher dimensional quadrics without center. These are found\nexplicitly. can be iterated via the Bianchi Permutability Theorem and can be\nfurther iterated via the $3$-M\\\"{o}bius configuration, thus producing explicit\nsolutions depending on arbitrarily many constants.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:16:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dinca","Ion I.",""]]}
{"id":"2308.08827","submitter":"Leonhard Hennig","authors":"Mohammed Bin Sumait, Aleksandra Gabryszak, Leonhard Hennig, Roland\n  Roller","title":"Factuality Detection using Machine Translation -- a Use Case for German\n  Clinical Text","comments":"Accepted at KONVENS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Factuality can play an important role when automatically processing clinical\ntext, as it makes a difference if particular symptoms are explicitly not\npresent, possibly present, not mentioned, or affirmed. In most cases, a\nsufficient number of examples is necessary to handle such phenomena in a\nsupervised machine learning setting. However, as clinical text might contain\nsensitive information, data cannot be easily shared. In the context of\nfactuality detection, this work presents a simple solution using machine\ntranslation to translate English data to German to train a transformer-based\nfactuality detection model.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:24:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sumait","Mohammed Bin",""],["Gabryszak","Aleksandra",""],["Hennig","Leonhard",""],["Roller","Roland",""]]}
{"id":"2308.08828","submitter":"Yuanhong Wang","authors":"Yuanhong Wang, Juhua Pu, Yuyi Wang and Ond\\v{r}ej Ku\\v{z}elka","title":"Lifted Algorithms for Symmetric Weighted First-Order Model Sampling","comments":"47 pages, 6 figures. An expanded version of \"On exact sampling in the\n  two-variable fragment of first-order logic\" in LICS23, submitted to AIJ.\n  arXiv admin note: substantial text overlap with arXiv:2302.02730","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weighted model counting (WMC) is the task of computing the weighted sum of\nall satisfying assignments (i.e., models) of a propositional formula.\nSimilarly, weighted model sampling (WMS) aims to randomly generate models with\nprobability proportional to their respective weights. Both WMC and WMS are hard\nto solve exactly, falling under the $\\#\\mathsf{P}$-hard complexity class.\nHowever, it is known that the counting problem may sometimes be tractable, if\nthe propositional formula can be compactly represented and expressed in\nfirst-order logic. In such cases, model counting problems can be solved in time\npolynomial in the domain size, and are known as domain-liftable. The following\nquestion then arises: Is it also the case for weighted model sampling? This\npaper addresses this question and answers it affirmatively. Specifically, we\nprove the domain-liftability under sampling for the two-variables fragment of\nfirst-order logic with counting quantifiers in this paper, by devising an\nefficient sampling algorithm for this fragment that runs in time polynomial in\nthe domain size. We then further show that this result continues to hold even\nin the presence of cardinality constraints. To empirically verify our approach,\nwe conduct experiments over various first-order formulas designed for the\nuniform generation of combinatorial structures and sampling in\nstatistical-relational models. The results demonstrate that our algorithm\noutperforms a start-of-the-art WMS sampler by a substantial margin, confirming\nthe theoretical results.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:40:47 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:32:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yuanhong",""],["Pu","Juhua",""],["Wang","Yuyi",""],["Ku\u017eelka","Ond\u0159ej",""]]}
{"id":"2308.08829","submitter":"Sky Button","authors":"Sky Button and Ama\\\"el Borz\\'ee","title":"A new multi-metric approach for quantifying global biodiscovery and\n  conservation priorities reveals overlooked hotspots for amphibians","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Undocumented species represent one of the largest hurdles for conservation\nefforts due to the uncertainty they introduce into conservation planning. Until\nthe distribution of earth's biodiversity is better understood, substantial\nconjecture will continue to be required for protecting species from\nanthropogenic extinction. Therefore, we developed a novel approach for\nidentifying regions with promising biodiscovery prospects, linked to\nintegrative conservation priorities, which we illustrate using amphibians. Our\napproach builds on previous estimates of biodiscovery priorities by\nsimultaneously (1) considering linkages between spatio-environmental variables\nand biodiversity, (2) accounting for the negative relationship between past\nsampling intensity and future biodiscovery potential, (3) incorporating a\npriori knowledge about global species distribution patterns, (4) addressing\nspatial autocorrelation in community composition, and (5) weighting theoretical\nundocumented species by their predicted levels of conservation need. Using\nboosted regression trees and 50km^2 map pixels spread across the global range\nof amphibians, we identified several regions likely to contain many\nundocumented amphibian species and conservation needs, including the Southeast\nAsian Archipelago, humid portions of sub-Saharan Africa, and undersampled\nportions of the Amazon, Andes Mountains, and Central America. We also ranked\ntop-scoring ecoregions by their mean and maximum biodiscovery potential and\nfound that the top-20 ranked ecoregions were most concentrated in the Southeast\nAsian Archipelago and tropical Africa for undocumented species richness, and in\ntropical Africa and tropical South America for integrative undocumented\namphibian conservation needs. However, high-scoring pixels tended to be widely\ndistributed across different ecoregions for both biodiscovery scoring\napproaches.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:42:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Button","Sky",""],["Borz\u00e9e","Ama\u00ebl",""]]}
{"id":"2308.08830","submitter":"Veronika Spieker","authors":"Veronika Spieker, Wenqi Huang, Hannah Eichhorn, Jonathan Stelter,\n  Kilian Weiss, Veronika A. Zimmer, Rickmer F. Braren, Dimitrios C. Karampinos,\n  Kerstin Hammernik, Julia A. Schnabel","title":"ICoNIK: Generating Respiratory-Resolved Abdominal MR Reconstructions\n  Using Neural Implicit Representations in k-Space","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":"  Motion-resolved reconstruction for abdominal magnetic resonance imaging (MRI)\nremains a challenge due to the trade-off between residual motion blurring\ncaused by discretized motion states and undersampling artefacts. In this work,\nwe propose to generate blurring-free motion-resolved abdominal reconstructions\nby learning a neural implicit representation directly in k-space (NIK). Using\nmeasured sampling points and a data-derived respiratory navigator signal, we\ntrain a network to generate continuous signal values. To aid the regularization\nof sparsely sampled regions, we introduce an additional informed correction\nlayer (ICo), which leverages information from neighboring regions to correct\nNIK's prediction. Our proposed generative reconstruction methods, NIK and\nICoNIK, outperform standard motion-resolved reconstruction techniques and\nprovide a promising solution to address motion artefacts in abdominal MRI.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:46:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Spieker","Veronika",""],["Huang","Wenqi",""],["Eichhorn","Hannah",""],["Stelter","Jonathan",""],["Weiss","Kilian",""],["Zimmer","Veronika A.",""],["Braren","Rickmer F.",""],["Karampinos","Dimitrios C.",""],["Hammernik","Kerstin",""],["Schnabel","Julia A.",""]]}
{"id":"2308.08831","submitter":"Jinhan Guo","authors":"Jinhan Guo, Ye Qiu, Yiwei Ni, Yang Guo, Chuan Li, Yuhang Gao, Brigitte\n  Schmieder, Stefaan Poedts, Pengfei Chen","title":"Understanding the Lateral Drifting of an Erupting Filament with a\n  Data-constrained Magnetohydrodynamic Simulation","comments":"25 pages, 14 figures, Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Solar filaments often exhibit rotation and deflection during eruptions, which\nwould significantly affect the geoeffectiveness of the corresponding coronal\nmass ejections (CMEs). Therefore, understanding the mechanisms that lead to\nsuch rotation and lateral displacement of filaments is a great concern to space\nweather forecasting. In this paper, we examine an intriguing filament eruption\nevent observed by the Chinese H{\\alpha} Solar Explorer (CHASE) and the Solar\nDynamics Observatory (SDO). The filament, which eventually evolves into a CME,\nexhibits significant lateral drifting during its rising. Moreover, the\norientation of the CME flux rope axis deviates from that of the pre-eruptive\nfilament observed in the source region. To investigate the physical processes\nbehind these observations, we perform a data-constrained magnetohydrodynamic\n(MHD) simulation. Many prominent observational features in the eruption are\nreproduced by our numerical model, including the morphology of the eruptive\nfilament, eruption path, and flare ribbons. The simulation results reveal that\nthe magnetic reconnection between the flux-rope leg and neighboring low-lying\nsheared arcades may be the primary mechanism responsible for the lateral\ndrifting of the filament material. Such a reconnection geometry leads to\nflux-rope footpoint migration and a reconfiguration of its morphology. As a\nconsequence, the filament material hosted in the flux rope drifts laterally,\nand the CME flux rope deviates from the pre-eruptive filament. This finding\nunderscores the importance of external magnetic reconnection in influencing the\norientation of a flux rope axis during eruption.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:47:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","Jinhan",""],["Qiu","Ye",""],["Ni","Yiwei",""],["Guo","Yang",""],["Li","Chuan",""],["Gao","Yuhang",""],["Schmieder","Brigitte",""],["Poedts","Stefaan",""],["Chen","Pengfei",""]]}
{"id":"2308.08832","submitter":"Pei Wang","authors":"Pei Wang, Jian Li, Long Ji, Xian Hou, Erbil Gugercinoglu, Di Li, Diego\n  F. Torres, Yutong Chen, Jiarui Niu, Weiwei Zhu, Bing Zhang, En-wei Liang, Li\n  Zhang, Mingyu Ge, Zigao Dai, Lin Lin, Jinlin Han, Yi Feng, Chenhui Niu,\n  Yongkun Zhang, Dengjiang Zhou, Heng Xu, Chunfeng Zhang, Jinchen Jiang,\n  Chenchen Miao, Mao Yuan, Weiyang Wang, Youling Yue, Yunsheng Wu, Yabiao Wang,\n  Chengjie Wang, Zhenye Gan, Yuxi Li, Zhongyi Sun, Mingmin Chi","title":"Atypical radio pulsations from magnetar SGR 1935+2154","comments":"47 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetars are neutron stars with extremely strong magnetic fields, frequently\npowering high-energy activity in X-rays. Pulsed radio emission following some\nX-ray outbursts have been detected, albeit its physical origin is unclear. It\nhas long been speculated that the origin of magnetars' radio signals is\ndifferent from those from canonical pulsars, although convincing evidence is\nstill lacking. Five months after magnetar SGR 1935+2154's X-ray outburst and\nits associated Fast Radio Burst (FRB) 20200428, a radio pulsar phase was\ndiscovered. Here we report the discovery of X-ray spectral hardening associated\nwith the emergence of periodic radio pulsations from SGR 1935+2154 and a\ndetailed analysis of the properties of the radio pulses. The complex radio\npulse morphology, which contains both narrow-band emission and frequency\ndrifts, has not been seen before in other magnetars, but is similar to those of\nrepeating FRBs - even though the luminosities are many orders of magnitude\ndifferent. The observations suggest that radio emission originates from the\nouter magnetosphere of the magnetar, and the surface heating due to the\nbombardment of inward-going particles from the radio emission region is\nresponsible for the observed X-ray spectral hardening.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:50:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Pei",""],["Li","Jian",""],["Ji","Long",""],["Hou","Xian",""],["Gugercinoglu","Erbil",""],["Li","Di",""],["Torres","Diego F.",""],["Chen","Yutong",""],["Niu","Jiarui",""],["Zhu","Weiwei",""],["Zhang","Bing",""],["Liang","En-wei",""],["Zhang","Li",""],["Ge","Mingyu",""],["Dai","Zigao",""],["Lin","Lin",""],["Han","Jinlin",""],["Feng","Yi",""],["Niu","Chenhui",""],["Zhang","Yongkun",""],["Zhou","Dengjiang",""],["Xu","Heng",""],["Zhang","Chunfeng",""],["Jiang","Jinchen",""],["Miao","Chenchen",""],["Yuan","Mao",""],["Wang","Weiyang",""],["Yue","Youling",""],["Wu","Yunsheng",""],["Wang","Yabiao",""],["Wang","Chengjie",""],["Gan","Zhenye",""],["Li","Yuxi",""],["Sun","Zhongyi",""],["Chi","Mingmin",""]]}
{"id":"2308.08833","submitter":"Dingjie Song","authors":"Xidong Wang, Guiming Hardy Chen, Dingjie Song, Zhiyi Zhang, Zhihong\n  Chen, Qingying Xiao, Feng Jiang, Jianquan Li, Xiang Wan, Benyou Wang, Haizhou\n  Li","title":"CMB: A Comprehensive Medical Benchmark in Chinese","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) provide a possibility to make a great\nbreakthrough in medicine. The establishment of a standardized medical benchmark\nbecomes a fundamental cornerstone to measure progression. However, medical\nenvironments in different regions have their local characteristics, e.g., the\nubiquity and significance of traditional Chinese medicine within China.\nTherefore, merely translating English-based medical evaluation may result in\n\\textit{contextual incongruities} to a local region. To solve the issue, we\npropose a localized medical benchmark called CMB, a Comprehensive Medical\nBenchmark in Chinese, designed and rooted entirely within the native Chinese\nlinguistic and cultural framework. While traditional Chinese medicine is\nintegral to this evaluation, it does not constitute its entirety. Using this\nbenchmark, we have evaluated several prominent large-scale LLMs, including\nChatGPT, GPT-4, dedicated Chinese LLMs, and LLMs specialized in the medical\ndomain. It is worth noting that our benchmark is not devised as a leaderboard\ncompetition but as an instrument for self-assessment of model advancements. We\nhope this benchmark could facilitate the widespread adoption and enhancement of\nmedical LLMs within China. Check details in\n\\url{https://cmedbenchmark.llmzoo.com/}.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:51:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Xidong",""],["Chen","Guiming Hardy",""],["Song","Dingjie",""],["Zhang","Zhiyi",""],["Chen","Zhihong",""],["Xiao","Qingying",""],["Jiang","Feng",""],["Li","Jianquan",""],["Wan","Xiang",""],["Wang","Benyou",""],["Li","Haizhou",""]]}
{"id":"2308.08834","submitter":"Roger Fenn Dr","authors":"Andrew Bartholomew and Roger Fenn","title":"Planar Doodles: Their Properties, Codes and Classification","comments":"28 pages, many figures and tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present those properties of planar doodles, especially when regarded as\n4-valent graphs, that enable us to classify them into {\\it prime} and {\\it\nsuper prime} doodles by analogy to a knot sum. We describe a method for\npartially characterising a doodle diagram by a {\\it doodle code} that describes\nthe complementary regions of the diagram and use that code to enumerate all\npossible prime and super prime doodle diagrams via their dual graph. In\naddition we explore the relationship between planar doodles and twin groups,\nand note that a theorem of Tutte means that super prime doodles have a\nHamiltonian circuit. We hope to expand upon this last point in a follow-up\npaper.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:52:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bartholomew","Andrew",""],["Fenn","Roger",""]]}
{"id":"2308.08835","submitter":"Bai-Song Xie","authors":"Zhen-Hua Feng, Hai-Bo Sang and B. S. Xie","title":"Stability range of parameters at fixed points for a class of complex\n  dynamics","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the parameters range for the fixed point of a class of complex\ndynamics with the rational fractional function as\n$R_{n,a,c}(z)=z^n+\\frac{a}{z^n}+c$, where $n=1,2,3,4$ is specified, $a$ and $c$\nare two complex parameters. The relationship between two parameters, $a$ and\n$c$, is obtained at the fixed point. Moreover the explicit expression of the\nparameter $a$ and $c$ in terms of $\\lambda$ is derived, where $\\lambda$ is the\nderivative function at fixed point. The parameter regimes for the stability of\nthe fixed point are presented numerically for some typical different cases.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:52:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Feng","Zhen-Hua",""],["Sang","Hai-Bo",""],["Xie","B. S.",""]]}
{"id":"2308.08836","submitter":"Zhenhao Li","authors":"Zhenhao Li, An Ran Chen, Xing Hu, Xin Xia, Tse-Hsun Chen, Weiyi Shang","title":"Are They All Good? Studying Practitioners' Expectations on the\n  Readability of Log Messages","comments":"Accepted as a research paper at the 38th IEEE/ACM International\n  Conference on Automated Software Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Developers write logging statements to generate logs that provide run-time\ninformation for various tasks. The readability of log messages in the logging\nstatements (i.e., the descriptive text) is rather crucial to the value of the\ngenerated logs. Immature log messages may slow down or even obstruct the\nprocess of log analysis. Despite the importance of log messages, there is still\na lack of standards on what constitutes good readability in log messages and\nhow to write them. In this paper, we conduct a series of interviews with 17\nindustrial practitioners to investigate their expectations on the readability\nof log messages. Through the interviews, we derive three aspects related to the\nreadability of log messages, including Structure, Information, and Wording,\nalong with several specific practices to improve each aspect. We validate our\nfindings through a series of online questionnaire surveys and receive positive\nfeedback from the participants. We then manually investigate the readability of\nlog messages in large-scale open source systems and find that a large portion\n(38.1%) of the log messages have inadequate readability. Motivated by such\nobservation, we further explore the potential of automatically classifying the\nreadability of log messages using deep learning and machine learning models. We\nfind that both deep learning and machine learning models can effectively\nclassify the readability of log messages with a balanced accuracy above 80.0%\non average. Our study provides comprehensive guidelines for composing log\nmessages to further improve practitioners' logging practices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:53:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Zhenhao",""],["Chen","An Ran",""],["Hu","Xing",""],["Xia","Xin",""],["Chen","Tse-Hsun",""],["Shang","Weiyi",""]]}
{"id":"2308.08837","submitter":"Tonghang Han","authors":"Tonghang Han, Zhengguang Lu, Giovanni Scuri, Jiho Sung, Jue Wang,\n  Tianyi Han, Kenji Watanabe, Takashi Taniguchi, Liang Fu, Hongkun Park, Long\n  Ju","title":"Orbital Multiferroicity in Pentalayer Rhombohedral Graphene","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ferroic orders describe spontaneous polarization of spin, charge, and lattice\ndegrees of freedom in materials. Materials featuring multiple ferroic orders,\nknown as multiferroics, play important roles in multi-functional electrical and\nmagnetic device applications. 2D materials with honeycomb lattices offer\nexciting opportunities to engineer unconventional multiferroicity, where the\nferroic orders are driven purely by the orbital degrees of freedom but not\nelectron spin. These include ferro-valleytricity corresponding to the electron\nvalley and ferro-orbital-magnetism supported by quantum geometric effects. Such\norbital multiferroics could offer strong valley-magnetic couplings and large\nresponses to external fields-enabling device applications such as\nmultiple-state memory elements, and electric control of valley and magnetic\nstates. Here we report orbital multiferroicity in pentalayer rhombohedral\ngraphene using low temperature magneto-transport measurements. We observed\nanomalous Hall signals Rxy with an exceptionally large Hall angle (tan{\\Theta}H\n> 0.6) and orbital magnetic hysteresis at hole doping. There are four such\nstates with different valley polarizations and orbital magnetizations, forming\na valley-magnetic quartet. By sweeping the gate electric field E we observed a\nbutterfly-shaped hysteresis of Rxy connecting the quartet. This hysteresis\nindicates a ferro-valleytronic order that couples to the composite field E\\cdot\nB, but not the individual fields. Tuning E would switch each ferroic order\nindependently, and achieve non-volatile switching of them together. Our\nobservations demonstrate a new type of multiferroics and point to electrically\ntunable ultra-low power valleytronic and magnetic devices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:53:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Han","Tonghang",""],["Lu","Zhengguang",""],["Scuri","Giovanni",""],["Sung","Jiho",""],["Wang","Jue",""],["Han","Tianyi",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Fu","Liang",""],["Park","Hongkun",""],["Ju","Long",""]]}
{"id":"2308.08838","submitter":"Xiaochun Wu","authors":"Xiaochun Wu","title":"Stability of planar shock wave for the 3-dimensional compressible\n  Navier-Stokes-Poisson equations","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 is concerned with the stability of planar viscous shock wave for\nthe 3-dimensional compressible Navier-Stokes-Poisson (NSP) system in the domain\n$\\Omega:=\\mathbb{R}\\times \\mathbb{T}^2$ with\n$\\mathbb{T}^2=(\\mathbb{R}/\\mathbb{Z})^2$. The stability problem of viscous\nshock under small 1-dimensional perturbations was solved in Duan-Liu-Zhang [7].\nIn this paper, we prove the viscous shock is still stable under small 3-d\nperturbations. Firstly, we decompose the perturbation into the zero mode and\nnon-zero mode. Then we can show that both the perturbation and zero-mode\ntime-asymptotically tend to zero by the anti-derivative technique and crucial\nestimates on the zero-mode. Moreover, we can further prove that the non-zero\nmode tends to zero with exponential decay rate. The key point is to estimate\nthe non-zero mode of nonlinear terms involving electronic potential, see Lemma\n6.1 below.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:54:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Xiaochun",""]]}
{"id":"2308.08839","submitter":"Yun-Kai Liu","authors":"Yun-Kai Liu, Pei-Chao Cao, Minghong Qi, Qiang-Kai-Lai Huang, Yu-Gui\n  Peng, Ying Li, Xue-Feng Zhu","title":"Observation of Non-Hermitian Skin Effect in Thermal Diffusion","comments":"23 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The paradigm shift of the Hermitian systems into the non-Hermitian regime\nprofoundly modifies the inherent topological property, leading to various\nunprecedented effects such as the non-Hermitian skin effect (NHSE). In the past\ndecade, the NHSE effect has been demonstrated in quantum, optical and acoustic\nsystems. Besides in those non-Hermitian wave systems, the NHSE in diffusive\nsystems has not yet been explicitly demonstrated, despite recent abundant\nadvances in the study of topological thermal diffusion. Here we first design a\nthermal diffusion lattice based on a modified Su-Schrieffer-Heeger model which\nenables the observation of diffusive NHSE. In the proposed model, the periodic\nheat exchange rate among adjacent unit cells and the asymmetric temperature\nfield coupling inside unit cells can be judiciously realized by appropriate\nconfigurations of structural parameters of unit cells. The transient\nconcentration feature of temperature field on the boundary regardless of\ninitial excitation conditions can be clearly observed, indicating the\noccurrence of transient thermal skin effect. Nonetheless, we experimentally\ndemonstrated the NHSE and verified the remarkable robustness against various\ndefects. Our work provides a platform for exploration of non-Hermitian physics\nin the diffusive systems, which has important applications in efficient heat\ncollection, highly sensitive thermal sensing and others.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:55:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Yun-Kai",""],["Cao","Pei-Chao",""],["Qi","Minghong",""],["Huang","Qiang-Kai-Lai",""],["Peng","Yu-Gui",""],["Li","Ying",""],["Zhu","Xue-Feng",""]]}
{"id":"2308.08840","submitter":"Arsenii Sagdeev","authors":"N\\'ora Frankl, Panna Geh\\'er, Arsenii Sagdeev, G\\'eza T\\'oth","title":"Monochromatic infinite sets in Minkowski planes","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that for any $\\ell_p$-norm in the plane with $1<p<\\infty$ and for\nevery infinite $\\mathcal{M} \\subset \\mathbb{R}^2$, there exists a two-colouring\nof the plane such that no isometric copy of $\\mathcal{M}$ is monochromatic. On\nthe contrary, we show that for every polygonal norm (that is, the unit ball is\na polygon) in the plane, there exists an infinite $\\mathcal{M} \\subset\n\\mathbb{R}^2$ such that for every two-colouring of the plane there exists a\nmonochromatic isometric copy of $\\mathcal{M}$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:58:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Frankl","N\u00f3ra",""],["Geh\u00e9r","Panna",""],["Sagdeev","Arsenii",""],["T\u00f3th","G\u00e9za",""]]}
{"id":"2308.08841","submitter":"Tom Savage Mr","authors":"Tom Savage, Nausheen Basha, Jonathan McDonough, Omar K Matar, Ehecatl\n  Antonio del Rio Chanona","title":"Machine Learning-Assisted Discovery of Novel Reactor Designs via\n  CFD-Coupled Multi-fidelity Bayesian Optimisation","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Additive manufacturing has enabled the production of more advanced reactor\ngeometries, resulting in the potential for significantly larger and more\ncomplex design spaces. Identifying and optimising promising configurations\nwithin broader design spaces presents a significant challenge for existing\nhuman-centric design approaches. As such, existing parameterisations of\ncoiled-tube reactor geometries are low-dimensional with expensive optimisation\nlimiting more complex solutions. Given algorithmic improvements and the onset\nof additive manufacturing, we propose two novel coiled-tube parameterisations\nenabling the variation of cross-section and coil path, resulting in a series of\nhigh dimensional, complex optimisation problems. To ensure tractable, non-local\noptimisation where gradients are not available, we apply multi-fidelity\nBayesian optimisation. Our approach characterises multiple continuous\nfidelities and is coupled with parameterised meshing and simulation, enabling\nlower quality, but faster simulations to be exploited throughout optimisation.\nThrough maximising the plug-flow performance, we identify key characteristics\nof optimal reactor designs, and extrapolate these to produce two novel\ngeometries that we 3D print and experimentally validate. By demonstrating the\ndesign, optimisation, and manufacture of highly parameterised reactors, we seek\nto establish a framework for the next-generation of reactors, demonstrating\nthat intelligent design coupled with new manufacturing processes can\nsignificantly improve the performance and sustainability of future chemical\nprocesses.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:00:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Savage","Tom",""],["Basha","Nausheen",""],["McDonough","Jonathan",""],["Matar","Omar K",""],["Chanona","Ehecatl Antonio del Rio",""]]}
{"id":"2308.08842","submitter":"Lina Ye","authors":"Alain Finkel, Serge Haddad, Lina Ye","title":"Introducing Divergence for Infinite Probabilistic Models","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computing the reachability probability in infinite state probabilistic models\nhas been the topic of numerous works. Here we introduce a new property called\n\\emph{divergence} that when satisfied allows to compute reachability\nprobabilities up to an arbitrary precision. One of the main interest of\ndivergence is that our algorithm does not require the reachability problem to\nbe decidable. Then we study the decidability of divergence for probabilistic\nversions of pushdown automata and Petri nets where the weights associated with\ntransitions may also depend on the current state. This should be contrasted\nwith most of the existing works that assume weights independent of the state.\nSuch an extended framework is motivated by the modeling of real case studies.\nMoreover, we exhibit some divergent subclasses of channel systems and pushdown\nautomata, particularly suited for specifying open distributed systems and\nnetworks prone to performance collapsing in order to compute the probabilities\nrelated to service requirements.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:02:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Finkel","Alain",""],["Haddad","Serge",""],["Ye","Lina",""]]}
{"id":"2308.08843","submitter":"Yichen Sheng","authors":"Yichen Sheng, Zixun Yu, Lu Ling, Zhiwen Cao, Cecilia Zhang, Xin Lu, Ke\n  Xian, Haiting Lin, Bedrich Benes","title":"Dr.Bokeh: DiffeRentiable Occlusion-aware Bokeh Rendering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bokeh is widely used in photography to draw attention to the subject while\neffectively isolating distractions in the background. Computational methods\nsimulate bokeh effects without relying on a physical camera lens. However, in\nthe realm of digital bokeh synthesis, the two main challenges for bokeh\nsynthesis are color bleeding and partial occlusion at object boundaries. Our\nprimary goal is to overcome these two major challenges using physics principles\nthat define bokeh formation. To achieve this, we propose a novel and accurate\nfiltering-based bokeh rendering equation and a physically-based occlusion-aware\nbokeh renderer, dubbed Dr.Bokeh, which addresses the aforementioned challenges\nduring the rendering stage without the need of post-processing or data-driven\napproaches. Our rendering algorithm first preprocesses the input RGBD to obtain\na layered scene representation. Dr.Bokeh then takes the layered representation\nand user-defined lens parameters to render photo-realistic lens blur. By\nsoftening non-differentiable operations, we make Dr.Bokeh differentiable such\nthat it can be plugged into a machine-learning framework. We perform\nquantitative and qualitative evaluations on synthetic and real-world images to\nvalidate the effectiveness of the rendering quality and the differentiability\nof our method. We show Dr.Bokeh not only outperforms state-of-the-art bokeh\nrendering algorithms in terms of photo-realism but also improves the depth\nquality from depth-from-defocus.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:02:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sheng","Yichen",""],["Yu","Zixun",""],["Ling","Lu",""],["Cao","Zhiwen",""],["Zhang","Cecilia",""],["Lu","Xin",""],["Xian","Ke",""],["Lin","Haiting",""],["Benes","Bedrich",""]]}
{"id":"2308.08844","submitter":"Mira Khalil","authors":"Mira Khalil, Romain Postoyan, St\\'ephane Ra\\\"el","title":"Enhancing accuracy of finite-dimensional models for lithium-ion\n  batteries, observer design and experimental validation","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":"  Accurate estimation of the internal states of lithium-ion batteries is key\ntowards improving their management for safety, efficiency and longevity\npurposes. Various approaches exist in the literature in this context, among\nwhich designing an observer based on an electrochemical model of the battery\ndynamics. With this approach, the performance of the observer depends on the\naccuracy of the considered model. It appears that electrochemical models, and\nthus their associated observer, typically require to be of high dimension to\ngenerate accurate internal variables. In this work, we present a method to\nmitigate this limitation by correcting the lithium concentrations generated by\na general class of finite-dimensional electrochemical models such that they\nasymptotically match those generated by the original partial differential\nequations (PDE) they are based on, for constant input currents. These\ncorrections apply irrespectively of the order of the considered\nfinite-dimensional model. The proposed correction leads to a new state space\nmodel for which we design observers, whose global, robust convergences are\nsupported by a Lyapunov analysis. Both numerical and experimental validations\nare presented, which show the improvement of the accuracy of the state\nestimates as a result of the proposed corrections.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:06:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khalil","Mira",""],["Postoyan","Romain",""],["Ra\u00ebl","St\u00e9phane",""]]}
{"id":"2308.08845","submitter":"Pengfei Lan","authors":"Jiacheng Huang, Xiang Lu, Feilong Hu, Jie Long, Jiajun Tang, Lixin He,\n  Qingbin Zhang, Pengfei Lan, Peixiang Lu","title":"Efficient spectral broadening and few-cycle pulse generation with\n  multiple thin water films","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.atm-clus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-energy, few-cycle laser pulses are essential for numerous applications\nin the fields of ultrafast optics and strong-field physics, due to their\nultrafast temporal resolution and high peak intensity. In this work, different\nfrom the traditional hollow-core fibers and multiple thin solid plates, we\nrepresent the first demonstration of the octave-spanning supercontinuum\nbroadening by utilizing multiple ultrathin liquid films (MTLFs) as the\nnonlinear media. The continuum covers a range from 380 to 1050 nm,\ncorresponding to a Fourier transform limit pulse width of 2.5 fs, when 35 fs\nTi:sapphire laser pulse is applied on the MTLFs. The output pulses are\ncompressed to 3.9 fs by employing chirped mirrors. Furthermore, a continuous\nhigh-order harmonic spectrum up to the 33rd order is realized by subjecting the\ncompressed laser pulses to interact with Kr gas. The utilization of flowing\nwater films eliminates permanent optical damage and enables wider and stronger\nspectrum broadening. Therefore, this MTLFs scheme provides new solutions for\nthe generation of highly efficient femtosecond supercontinuum and nonlinear\npulse compression, with potential applications in the fields of strong-field\nphysics and attosecond science.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:07:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Jiacheng",""],["Lu","Xiang",""],["Hu","Feilong",""],["Long","Jie",""],["Tang","Jiajun",""],["He","Lixin",""],["Zhang","Qingbin",""],["Lan","Pengfei",""],["Lu","Peixiang",""]]}
{"id":"2308.08846","submitter":"Michael Dallaston","authors":"Michael C Dallaston, Michael J W Jackson, Liam C Morrow, Scott W McCue","title":"Two-interface and thin filament approximation in Hele--Shaw channel flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a viscous fluid trapped in a Hele--Shaw channel, and pushed by a pressure\ndifference, the fluid interface is unstable due to the Saffman--Taylor\ninstability. We consider the evolution of a fluid region of finite extent,\nbounded between two interfaces, in the limit the interfaces are close, that is,\nwhen the fluid region is a thin liquid filament separating two gases of\ndifferent pressure. In this limit, we derive a geometric flow rule that\ndescribes the normal velocity of the filament centreline, and evolution of the\nfilament thickness, as functions of the thickness and centreline curvature. We\nshow that transverse flow along the filament is necessary to regularise the\ninstability. Numerical simulation of the thin filament flow rule is shown to\nclosely match level-set computations of the complete two-interface model, and\nsolutions ultimately evolve to form a bubble of increasing radius and\ndecreasing thickness.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:10:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dallaston","Michael C",""],["Jackson","Michael J W",""],["Morrow","Liam C",""],["McCue","Scott W",""]]}
{"id":"2308.08847","submitter":"Jinbo Hu","authors":"Jinbo Hu, Yin Cao, Ming Wu, Feiran Yang, Ziying Yu, Wenwu Wang, Mark\n  D. Plumbley, Jun Yang","title":"META-SELD: Meta-Learning for Fast Adaptation to the new environment in\n  Sound Event Localization and Detection","comments":"Submitted to DCASE 2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For learning-based sound event localization and detection (SELD) methods,\ndifferent acoustic environments in the training and test sets may result in\nlarge performance differences in the validation and evaluation stages.\nDifferent environments, such as different sizes of rooms, different\nreverberation times, and different background noise, may be reasons for a\nlearning-based system to fail. On the other hand, acquiring annotated spatial\nsound event samples, which include onset and offset time stamps, class types of\nsound events, and direction-of-arrival (DOA) of sound sources is very\nexpensive. In addition, deploying a SELD system in a new environment often\nposes challenges due to time-consuming training and fine-tuning processes. To\naddress these issues, we propose Meta-SELD, which applies meta-learning methods\nto achieve fast adaptation to new environments. More specifically, based on\nModel Agnostic Meta-Learning (MAML), the proposed Meta-SELD aims to find good\nmeta-initialized parameters to adapt to new environments with only a small\nnumber of samples and parameter updating iterations. We can then quickly adapt\nthe meta-trained SELD model to unseen environments. Our experiments compare\nfine-tuning methods from pre-trained SELD models with our Meta-SELD on the\nSony-TAU Realistic Spatial Soundscapes 2023 (STARSSS23) dataset. The evaluation\nresults demonstrate the effectiveness of Meta-SELD when adapting to new\nenvironments.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:10:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hu","Jinbo",""],["Cao","Yin",""],["Wu","Ming",""],["Yang","Feiran",""],["Yu","Ziying",""],["Wang","Wenwu",""],["Plumbley","Mark D.",""],["Yang","Jun",""]]}
{"id":"2308.08848","submitter":"Anna Torstensson","authors":"Anna Torstensson","title":"On conjugacy classes of groups of Squarefree order","comments":"17 pages","journal-ref":null,"doi":null,"report-no":"Preprints in Mathematical Sciences 2006:6 Lund University","categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The problem of finding the largest finite group with a certain class number\n(number of conjugacy classes), $k(G)$, has been investigated by a number of\nresearchers since the early 1900's and has been solved by computer for $k(G)\n\\leq 9$. (For the restriction to simple groups for $k(G) \\leq 12$.) One has\nalso tried to find a general upper bound on $|G|$ in terms of $k(G)$. The best\nknown upper bound in the general case is in the order of magnitude $|G| \\leq\nk(G)^{2^{k(G)-1}}$. In this paper we consider the restriction of this\nlongstanding problem to groups of squarefree order. We derive an explicit\nformula for the class number $k(G)$ of any group of squarefree order and we\nalso obtain an estimate $|G| \\leq k(G)^3$ in this case. Combining the two\nresults we get an efficient way to compute the largest squarefree order a group\nwith a certain class number can have. We also provide an implementation of this\nalgorithm to compute the maximal squarefree $|G|$ for arbitrary $k(G)$ and\ndisplay the results obtained for $k(G) \\leq 100$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:12:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Torstensson","Anna",""]]}
{"id":"2308.08849","submitter":"Li Liu","authors":"Li Liu, Lufei Gao, Wentao Lei, Fengji Ma, Xiaotian Lin, Jinting Wang","title":"A Survey on Deep Multi-modal Learning for Body Language Recognition and\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Body language (BL) refers to the non-verbal communication expressed through\nphysical movements, gestures, facial expressions, and postures. It is a form of\ncommunication that conveys information, emotions, attitudes, and intentions\nwithout the use of spoken or written words. It plays a crucial role in\ninterpersonal interactions and can complement or even override verbal\ncommunication. Deep multi-modal learning techniques have shown promise in\nunderstanding and analyzing these diverse aspects of BL. The survey emphasizes\ntheir applications to BL generation and recognition. Several common BLs are\nconsidered i.e., Sign Language (SL), Cued Speech (CS), Co-speech (CoS), and\nTalking Head (TH), and we have conducted an analysis and established the\nconnections among these four BL for the first time. Their generation and\nrecognition often involve multi-modal approaches. Benchmark datasets for BL\nresearch are well collected and organized, along with the evaluation of SOTA\nmethods on these datasets. The survey highlights challenges such as limited\nlabeled data, multi-modal learning, and the need for domain adaptation to\ngeneralize models to unseen speakers or languages. Future research directions\nare presented, including exploring self-supervised learning techniques,\nintegrating contextual information from other modalities, and exploiting\nlarge-scale pre-trained multi-modal models. In summary, this survey paper\nprovides a comprehensive understanding of deep multi-modal learning for various\nBL generations and recognitions for the first time. By analyzing advancements,\nchallenges, and future directions, it serves as a valuable resource for\nresearchers and practitioners in advancing this field. n addition, we maintain\na continuously updated paper list for deep multi-modal learning for BL\nrecognition and generation: https://github.com/wentaoL86/awesome-body-language.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:15:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Li",""],["Gao","Lufei",""],["Lei","Wentao",""],["Ma","Fengji",""],["Lin","Xiaotian",""],["Wang","Jinting",""]]}
{"id":"2308.08850","submitter":"Yang Ai","authors":"Yang Ai, Ye-Xin Lu, Zhen-Hua Ling","title":"Long-frame-shift Neural Speech Phase Prediction with Spectral Continuity\n  Enhancement and Interpolation Error Compensation","comments":"Published at IEEE Signal Processing Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Speech phase prediction, which is a significant research focus in the field\nof signal processing, aims to recover speech phase spectra from\namplitude-related features. However, existing speech phase prediction methods\nare constrained to recovering phase spectra with short frame shifts, which are\nconsiderably smaller than the theoretical upper bound required for exact\nwaveform reconstruction of short-time Fourier transform (STFT). To tackle this\nissue, we present a novel long-frame-shift neural speech phase prediction\n(LFS-NSPP) method which enables precise prediction of long-frame-shift phase\nspectra from long-frame-shift log amplitude spectra. The proposed method\nconsists of three stages: interpolation, prediction and decimation. The\nshort-frame-shift log amplitude spectra are first constructed from\nlong-frame-shift ones through frequency-by-frequency interpolation to enhance\nthe spectral continuity, and then employed to predict short-frame-shift phase\nspectra using an NSPP model, thereby compensating for interpolation errors.\nUltimately, the long-frame-shift phase spectra are obtained from\nshort-frame-shift ones through frame-by-frame decimation. Experimental results\nshow that the proposed LFS-NSPP method can yield superior quality in predicting\nlong-frame-shift phase spectra than the original NSPP model and other\nsignal-processing-based phase estimation algorithms.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:21:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ai","Yang",""],["Lu","Ye-Xin",""],["Ling","Zhen-Hua",""]]}
{"id":"2308.08851","submitter":"Jiangang Kang","authors":"Jiangang Kang, Chang-Zhi Lu, TongJie Zhang, Ming Zhu","title":"Toward a direct measurement of the cosmic acceleration: The first\n  observation of HI 21cm absorption line at FAST","comments":"26 pages,8 figures, 3 tables, submitted to JCAP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we report the first result from the investgation of Neutral\natomic hydrogen(HI) 21cm absorption line in spectrum of PKS1413+135 as a\nassociated type at redshift $z\\approx 0.24670041$ observed by FAST using the\nobserving time of 10 minutes for the absorber and the spectral resolution of\nthe raw data was setted to 10 Hz. The full spectral profile is analysed by\nfitting the absorption line with single Gaussian function as the resolution of\n10kHz in 2MHz bandwidth, eventually intending to illustrate the latest cosmic\nacceleration by the direct measurement of time evolution of the redshift of HI\n21cm absorption line with Hubble flow toward a same background Quasar in the\ntime interval of more than a decade or many years as a detectable signal that\nproduced by the accelerated expansion of the Universe in the era of FAST at low\nredshift space,namely redshift drift $\\dot{z}$ or SL effect. The obtained HI\ngas column density $\\rm N_{HI} \\approx 2.2867\\times 10^{22}/cm^2$ of this DLA\nsystem, much equivalent to the originally observed value $\\rm N_{HI} \\approx\n1.3\\times 10^{19}\\times(T_s/f)/cm^2$ within the uncertainties of the spin\ntemperature of a spiral host galaxy, and the signal to noise ratio SNR highly\nreaching 57.4357 for the resolution of 10kHz evidently validates the\nopportunities of the HI 21cm absorption lines of DLA systems to enforce the\nawareness of the physical motivation of dark energy by the probe of\n$\\rm\\dot{z}$ with the enhancement of accuracy in the level of $\\sim 10^{-10}$\nper decade.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:22:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kang","Jiangang",""],["Lu","Chang-Zhi",""],["Zhang","TongJie",""],["Zhu","Ming",""]]}
{"id":"2308.08852","submitter":"Chengjing Wang","authors":"Chengjing Wang, Peipei Tang, Wenling He, Meixia Lin","title":"Learning the hub graphical Lasso model with the structured sparsity via\n  an efficient algorithm","comments":"28 pages,3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG cs.NA math.NA stat.CO stat.ML","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Graphical models have exhibited their performance in numerous tasks ranging\nfrom biological analysis to recommender systems. However, graphical models with\nhub nodes are computationally difficult to fit, particularly when the dimension\nof the data is large. To efficiently estimate the hub graphical models, we\nintroduce a two-phase algorithm. The proposed algorithm first generates a good\ninitial point via a dual alternating direction method of multipliers (ADMM),\nand then warm starts a semismooth Newton (SSN) based augmented Lagrangian\nmethod (ALM) to compute a solution that is accurate enough for practical tasks.\nThe sparsity structure of the generalized Jacobian ensures that the algorithm\ncan obtain a nice solution very efficiently. Comprehensive experiments on both\nsynthetic data and real data show that it obviously outperforms the existing\nstate-of-the-art algorithms. In particular, in some high dimensional tasks, it\ncan save more than 70\\% of the execution time, meanwhile still achieves a\nhigh-quality estimation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:24:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Chengjing",""],["Tang","Peipei",""],["He","Wenling",""],["Lin","Meixia",""]]}
{"id":"2308.08853","submitter":"Tianjie Dai","authors":"Feng Hong, Tianjie Dai, Jiangchao Yao, Ya Zhang, Yanfeng Wang","title":"Bag of Tricks for Long-Tailed Multi-Label Classification on Chest X-Rays","comments":"Accepted for the ICCV 2023 Workshop on Computer Vision for Automated\n  Medical Diagnosis (CVAMD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Clinical classification of chest radiography is particularly challenging for\nstandard machine learning algorithms due to its inherent long-tailed and\nmulti-label nature. However, few attempts take into account the coupled\nchallenges posed by both the class imbalance and label co-occurrence, which\nhinders their value to boost the diagnosis on chest X-rays (CXRs) in the\nreal-world scenarios. Besides, with the prevalence of pretraining techniques,\nhow to incorporate these new paradigms into the current framework lacks of the\nsystematical study. This technical report presents a brief description of our\nsolution in the ICCV CVAMD 2023 CXR-LT Competition. We empirically explored the\neffectiveness for CXR diagnosis with the integration of several advanced\ndesigns about data augmentation, feature extractor, classifier design, loss\nfunction reweighting, exogenous data replenishment, etc. In addition, we\nimprove the performance through simple test-time data augmentation and\nensemble. Our framework finally achieves 0.349 mAP on the competition test set,\nranking in the top five.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:25:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hong","Feng",""],["Dai","Tianjie",""],["Yao","Jiangchao",""],["Zhang","Ya",""],["Wang","Yanfeng",""]]}
{"id":"2308.08854","submitter":"Francesco Taioli","authors":"Francesco Taioli, Federico Cunico, Federico Girella, Riccardo Bologna,\n  Alessandro Farinelli, Marco Cristani","title":"Language-enhanced RNR-Map: Querying Renderable Neural Radiance Field\n  maps with natural language","comments":"Accepted at ICCVW23 VLAR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Le-RNR-Map, a Language-enhanced Renderable Neural Radiance map for\nVisual Navigation with natural language query prompts. The recently proposed\nRNR-Map employs a grid structure comprising latent codes positioned at each\npixel. These latent codes, which are derived from image observation, enable: i)\nimage rendering given a camera pose, since they are converted to Neural\nRadiance Field; ii) image navigation and localization with astonishing\naccuracy. On top of this, we enhance RNR-Map with CLIP-based embedding latent\ncodes, allowing natural language search without additional label data. We\nevaluate the effectiveness of this map in single and multi-object searches. We\nalso investigate its compatibility with a Large Language Model as an\n\"affordance query resolver\". Code and videos are available at\nhttps://intelligolabs.github.io/Le-RNR-Map/\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:27:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Taioli","Francesco",""],["Cunico","Federico",""],["Girella","Federico",""],["Bologna","Riccardo",""],["Farinelli","Alessandro",""],["Cristani","Marco",""]]}
{"id":"2308.08855","submitter":"Xiaozheng Zheng","authors":"Xiaozheng Zheng, Zhuo Su, Chao Wen, Zhou Xue, Xiaojie Jin","title":"Realistic Full-Body Tracking from Sparse Observations via Joint-Level\n  Modeling","comments":"Accepted to ICCV 2023. Project page:\n  https://zxz267.github.io/AvatarJLM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To bridge the physical and virtual worlds for rapidly developed VR/AR\napplications, the ability to realistically drive 3D full-body avatars is of\ngreat significance. Although real-time body tracking with only the head-mounted\ndisplays (HMDs) and hand controllers is heavily under-constrained, a carefully\ndesigned end-to-end neural network is of great potential to solve the problem\nby learning from large-scale motion data. To this end, we propose a two-stage\nframework that can obtain accurate and smooth full-body motions with the three\ntracking signals of head and hands only. Our framework explicitly models the\njoint-level features in the first stage and utilizes them as spatiotemporal\ntokens for alternating spatial and temporal transformer blocks to capture\njoint-level correlations in the second stage. Furthermore, we design a set of\nloss terms to constrain the task of a high degree of freedom, such that we can\nexploit the potential of our joint-level modeling. With extensive experiments\non the AMASS motion dataset and real-captured data, we validate the\neffectiveness of our designs and show our proposed method can achieve more\naccurate and smooth motion compared to existing approaches.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:27:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zheng","Xiaozheng",""],["Su","Zhuo",""],["Wen","Chao",""],["Xue","Zhou",""],["Jin","Xiaojie",""]]}
{"id":"2308.08856","submitter":"Jiaqi Yang","authors":"Jiaqi Yang, Yucong Chen, Xiangting Meng, Chenxin Yan, Min Li, Ran\n  Chen, Lige Liu, Tao Sun, Laurent Kneip","title":"MV-ROPE: Multi-view Constraints for Robust Category-level Object Pose\n  and Size Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel framework for RGB-based category-level 6D object pose and\nsize estimation. Our approach relies on the prediction of normalized object\ncoordinate space (NOCS), which serves as an efficient and effective object\ncanonical representation that can be extracted from RGB images. Unlike previous\napproaches that heavily relied on additional depth readings as input, our\nnovelty lies in leveraging multi-view information, which is commonly available\nin practical scenarios where a moving camera continuously observes the\nenvironment. By introducing multi-view constraints, we can obtain accurate\ncamera pose and depth estimation from a monocular dense SLAM framework.\nAdditionally, by incorporating constraints on the camera relative pose, we can\napply trimming strategies and robust pose averaging on the multi-view object\nposes, resulting in more accurate and robust estimations of category-level\nobject poses even in the absence of direct depth readings. Furthermore, we\nintroduce a novel NOCS prediction network that significantly improves\nperformance. Our experimental results demonstrate the strong performance of our\nproposed method, even comparable to state-of-the-art RGB-D methods across\npublic dataset sequences. Additionally, we showcase the generalization ability\nof our method by evaluating it on self-collected datasets.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:29:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Jiaqi",""],["Chen","Yucong",""],["Meng","Xiangting",""],["Yan","Chenxin",""],["Li","Min",""],["Chen","Ran",""],["Liu","Lige",""],["Sun","Tao",""],["Kneip","Laurent",""]]}
{"id":"2308.08857","submitter":"Xueting Yang","authors":"Xueting Yang, Yihao Luo, Yuliang Xiu, Wei Wang, Hao Xu, Zhaoxin Fan","title":"D-IF: Uncertainty-aware Human Digitization via Implicit Distribution\n  Field","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":"  Realistic virtual humans play a crucial role in numerous industries, such as\nmetaverse, intelligent healthcare, and self-driving simulation. But creating\nthem on a large scale with high levels of realism remains a challenge. The\nutilization of deep implicit function sparks a new era of image-based 3D\nclothed human reconstruction, enabling pixel-aligned shape recovery with fine\ndetails. Subsequently, the vast majority of works locate the surface by\nregressing the deterministic implicit value for each point. However, should all\npoints be treated equally regardless of their proximity to the surface? In this\npaper, we propose replacing the implicit value with an adaptive uncertainty\ndistribution, to differentiate between points based on their distance to the\nsurface. This simple ``value to distribution'' transition yields significant\nimprovements on nearly all the baselines. Furthermore, qualitative results\ndemonstrate that the models trained using our uncertainty distribution loss,\ncan capture more intricate wrinkles, and realistic limbs. Code and models are\navailable for research purposes at https://github.com/psyai-net/D-IF_release.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:31:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Xueting",""],["Luo","Yihao",""],["Xiu","Yuliang",""],["Wang","Wei",""],["Xu","Hao",""],["Fan","Zhaoxin",""]]}
{"id":"2308.08858","submitter":"Ming Yin","authors":"Songtao Feng, Ming Yin, Yu-Xiang Wang, Jing Yang, Yingbin Liang","title":"Model-Free Algorithm with Improved Sample Efficiency for Zero-Sum Markov\n  Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.GT stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of two-player zero-sum Markov games has recently attracted\nincreasing interests in theoretical studies of multi-agent reinforcement\nlearning (RL). In particular, for finite-horizon episodic Markov decision\nprocesses (MDPs), it has been shown that model-based algorithms can find an\n$\\epsilon$-optimal Nash Equilibrium (NE) with the sample complexity of\n$O(H^3SAB/\\epsilon^2)$, which is optimal in the dependence of the horizon $H$\nand the number of states $S$ (where $A$ and $B$ denote the number of actions of\nthe two players, respectively). However, none of the existing model-free\nalgorithms can achieve such an optimality. In this work, we propose a\nmodel-free stage-based Q-learning algorithm and show that it achieves the same\nsample complexity as the best model-based algorithm, and hence for the first\ntime demonstrate that model-free algorithms can enjoy the same optimality in\nthe $H$ dependence as model-based algorithms. The main improvement of the\ndependency on $H$ arises by leveraging the popular variance reduction technique\nbased on the reference-advantage decomposition previously used only for\nsingle-agent RL. However, such a technique relies on a critical monotonicity\nproperty of the value function, which does not hold in Markov games due to the\nupdate of the policy via the coarse correlated equilibrium (CCE) oracle. Thus,\nto extend such a technique to Markov games, our algorithm features a key novel\ndesign of updating the reference value functions as the pair of optimistic and\npessimistic value functions whose value difference is the smallest in the\nhistory in order to achieve the desired improvement in the sample efficiency.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:34:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Feng","Songtao",""],["Yin","Ming",""],["Wang","Yu-Xiang",""],["Yang","Jing",""],["Liang","Yingbin",""]]}
{"id":"2308.08859","submitter":"Alea Miako Tokita","authors":"Alea Miako Tokita and J\\\"org Behler","title":"Tutorial: How to Train a Neural Network Potential","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The introduction of modern Machine Learning Potentials (MLP) has led to a\nparadigm change in the development of potential energy surfaces for atomistic\nsimulations. By providing efficient access to energies and forces, they allow\nto perform large-scale simulations of extended systems, which are not directly\naccessible by demanding first-principles methods. In these simulations, MLPs\ncan reach the accuracy of electronic structure calculations provided that they\nhave been properly trained and validated using a suitable set of reference\ndata. Due to their highly flexible functional form the construction of MLPs has\nto be done with great care. In this tutorial, we describe the necessary key\nsteps for training reliable MLPs, from data generation via training to final\nvalidation. The procedure, which is illustrated for the example of a\nhigh-dimensional neural network potential, is general and applicable to many\ntypes of MLPs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:35:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tokita","Alea Miako",""],["Behler","J\u00f6rg",""]]}
{"id":"2308.08860","submitter":"Khushvind Maurya","authors":"Ahad N. Zehmakan and Khushvind Maurya","title":"Mitigating Misinformation Spreading in Social Networks Via Edge Blocking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The wide adoption of social media platforms has brought about numerous\nbenefits for communication and information sharing. However, it has also led to\nthe rapid spread of misinformation, causing significant harm to individuals,\ncommunities, and society at large. Consequently, there has been a growing\ninterest in devising efficient and effective strategies to contain the spread\nof misinformation. One popular countermeasure is blocking edges in the\nunderlying network.\n  We model the spread of misinformation using the classical Independent Cascade\nmodel and study the problem of minimizing the spread by blocking a given number\nof edges. We prove that this problem is computationally hard, but we propose an\nintuitive community-based algorithm, which aims to detect well-connected\ncommunities in the network and disconnect the inter-community edges. Our\nexperiments on various real-world social networks demonstrate that the proposed\nalgorithm significantly outperforms the prior methods, which mostly rely on\ncentrality measures.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:41:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zehmakan","Ahad N.",""],["Maurya","Khushvind",""]]}
{"id":"2308.08861","submitter":"Kai-Yu Zhang","authors":"Pujian Mao and Kai-Yu Zhang","title":"Soft theorems in de Sitter spacetime","comments":"18 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":"  In this paper, we derive a soft photon theorem and a soft gluon theorem in\nthe de Sitter spacetime from the Ward identity of the near cosmological horizon\nlarge gauge transformation. Taking the flat limit of the de Sitter spacetime,\nthe soft theorems naturally recover the corresponding flat spacetime soft\ntheorems.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:43:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mao","Pujian",""],["Zhang","Kai-Yu",""]]}
{"id":"2308.08862","submitter":"Hao Zhang","authors":"Hao Zhang, Jiaming Chen, Jiyu Cheng, Yibin Li, Simon X. Yang, Wei\n  Zhang","title":"Nowhere to Go: Benchmarking Multi-robot Collaboration in Target Trapping\n  Environment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collaboration is one of the most important factors in multi-robot systems.\nConsidering certain real-world applications and to further promote its\ndevelopment, we propose a new benchmark to evaluate multi-robot collaboration\nin Target Trapping Environment (T2E). In T2E, two kinds of robots (called\ncaptor robot and target robot) share the same space. The captors aim to catch\nthe target collaboratively, while the target will try to escape from the trap.\nBoth the trapping and escaping process can use the environment layout to help\nachieve the corresponding objective, which requires high collaboration between\nrobots and the utilization of the environment. For the benchmark, we present\nand evaluate multiple learning-based baselines in T2E, and provide insights\ninto regimes of multi-robot collaboration. We also make our benchmark publicly\navailable and encourage researchers from related robotics disciplines to\npropose, evaluate, and compare their solutions in this benchmark. Our project\nis released at https://github.com/Dr-Xiaogaren/T2E.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:45:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Hao",""],["Chen","Jiaming",""],["Cheng","Jiyu",""],["Li","Yibin",""],["Yang","Simon X.",""],["Zhang","Wei",""]]}
{"id":"2308.08863","submitter":"Renjun Duan","authors":"Renjun Duan, Dongcheng Yang, and Hongjun Yu","title":"KdV limit for the Vlasov-Poisson-Landau system","comments":"68 pages. All comments are welcome. arXiv admin note: text overlap\n  with arXiv:2212.07654","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":"  Two fundamental models in plasma physics are given by the\nVlasov-Poisson-Landau system and the compressible Euler-Poisson system which\nboth capture the complex dynamics of plasmas under the self-consistent electric\nfield interactions at the kinetic and fluid levels, respectively. Although\nthere have been extensive studies on the long wave limit of the Euler-Poisson\nsystem towards Korteweg-de Vries equations, few results on this topic are known\nfor the Vlasov-Poisson-Landau system due to the complexity of the system and\nits underlying multiscale feature. In this article, we derive and justify the\nKorteweg-de Vries equations from the Vlasov-Poisson-Landau system modelling the\nmotion of ions under the Maxwell-Boltzmann relation. Specifically, under the\nGardner-Morikawa transformation $$ (t,x,v)\\to\n(\\delta^{\\frac{3}{2}}t,\\delta^{\\frac{1}{2}}(x-\\sqrt{\\frac{8}{3}}t),v) $$ with $\n\\varepsilon^{\\frac{2}{3}}\\leq \\delta\\leq \\varepsilon^{\\frac{2}{5}}$ and\n$\\varepsilon>0$ being the Knudsen number, we construct smooth solutions of the\nrescaled Vlasov-Poisson-Landau system over an arbitrary finite time interval\nthat can converge uniformly to smooth solutions of the Korteweg-de Vries\nequations as $\\delta\\to 0$. Moreover, the explicit rate of convergence in\n$\\delta$ is also obtained. The proof is obtained by an appropriately chosen\nscaling and the intricate weighted energy method through the micro-macro\ndecomposition around local Maxwellians.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:45:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Duan","Renjun",""],["Yang","Dongcheng",""],["Yu","Hongjun",""]]}
{"id":"2308.08864","submitter":"Dipam Das","authors":"Debasish Bhattacharjee, Nabajit Ray, Dipam Das, Hemanta Kumar Sarmah","title":"A discrete-time dynamical model of prey and stage-structured predator\n  with juvenile hunting incorporating negative effects of prey refuge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper examines a discrete predator-prey model that incorporates prey\nrefuge and its detrimental impact on the growth of the prey population. Age\nstructure is taken into account for predator species. Furthermore, juvenile\nhunting as well as prey counter-attack are also considered. This paper provides\na comprehensive analysis of the existence and stability conditions pertaining\nto all possible fixed points. The analytical and numerical investigation into\nthe occurrence of different bifurcations, such as the Neimark-Sacker\nbifurcation and period-doubling bifurcation, in relation to various parameters\nis discussed. The impact of the parameters reflecting prey growth and prey\nrefuge is thoroughly addressed. Numerous numerical simulations are presented in\norder to validate the theoretical findings.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:47:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhattacharjee","Debasish",""],["Ray","Nabajit",""],["Das","Dipam",""],["Sarmah","Hemanta Kumar",""]]}
{"id":"2308.08865","submitter":"Sophie Marques Dr.","authors":"Sophie Marques and Elizabeth Mrema","title":"2-Cyclotomic field extensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a thorough investigation of $2$-cyclotomic extensions,\ncovering various aspects such as their degrees, intermediate subextensions,\nGalois \\\\ structures, and the minimal polynomials over an arbitrary base field.\nIn our quest to provide explicit expressions for the coefficients of the\nminimal polynomials of these intermediate subextensions in the cyclotomic\nfield, we discovered fascinating \\\\ characterizations, some of which are linked\nto the well-known Catalan numbers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:47:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Marques","Sophie",""],["Mrema","Elizabeth",""]]}
{"id":"2308.08866","submitter":"Chengjing Wang","authors":"Chengjing Wang, Xile Zhao, Qingsong Wang, Zepei Ma, Peipei Tang","title":"An inexact proximal majorization-minimization Algorithm for remote\n  sensing image stripe noise removal","comments":"19 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA eess.IV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The stripe noise existing in remote sensing images badly degrades the visual\nquality and restricts the precision of data analysis. Therefore, many\ndestriping models have been proposed in recent years. In contrast to these\nexisting models, in this paper, we propose a nonconvex model with a DC function\n(i.e., the difference of convex functions) structure to remove the strip noise.\nTo solve this model, we make use of the DC structure and apply an inexact\nproximal majorization-minimization algorithm with each inner subproblem solved\nby the alternating direction method of multipliers. It deserves mentioning that\nwe design an implementable stopping criterion for the inner subproblem, while\nthe convergence can still be guaranteed. Numerical experiments demonstrate the\nsuperiority of the proposed model and algorithm.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:51:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Chengjing",""],["Zhao","Xile",""],["Wang","Qingsong",""],["Ma","Zepei",""],["Tang","Peipei",""]]}
{"id":"2308.08867","submitter":"Xin Zhang","authors":"Jincheng Tang and Xin Zhang","title":"Sum-product phenomenon in quotients of rings of algebraic integers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain a bounded generation theorem over $\\mathcal O/\\mathfrak a$, where\n$\\mathcal O$ is the ring of integers of a number field and $\\mathfrak a$ a\ngeneral ideal of $\\mathcal O$. This addresses a conjecture of Salehi-Golsefidy.\nAlong the way, we obtain nontrivial bounds for additive character sums over\n$\\mathcal O/\\mathcal P^n$ for a prime ideal $\\mathcal P$ with the aid of\ncertain sum-product estimates.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:56:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tang","Jincheng",""],["Zhang","Xin",""]]}
{"id":"2308.08868","submitter":"P{\\aa}l Gr{\\o}n{\\aa}s Drange","authors":"P{\\aa}l Gr{\\o}n{\\aa}s Drange, Patrick Greaves, Irene Muzi, Felix Reidl","title":"Computing complexity measures of degenerate graphs","comments":"Accepted for publication in the 18th International Symposium on\n  Parameterized and Exact Computation (IPEC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We show that the VC-dimension of a graph can be computed in time $n^{\\log\nd+1} d^{O(d)}$, where $d$ is the degeneracy of the input graph. The core idea\nof our algorithm is a data structure to efficiently query the number of\nvertices that see a specific subset of vertices inside of a (small) query set.\nThe construction of this data structure takes time $O(d2^dn)$, afterwards\nqueries can be computed efficiently using fast M\\\"obius inversion.\n  This data structure turns out to be useful for a range of tasks, especially\nfor finding bipartite patterns in degenerate graphs, and we outline an\nefficient algorithms for counting the number of times specific patterns occur\nin a graph. The largest factor in the running time of this algorithm is\n$O(n^c)$, where $c$ is a parameter of the pattern we call its left covering\nnumber.\n  Concrete applications of this algorithm include counting the number of\n(non-induced) bicliques in linear time, the number of co-matchings in quadratic\ntime, as well as a constant-factor approximation of the ladder index in linear\ntime.\n  Finally, we supplement our theoretical results with several implementations\nand run experiments on more than 200 real-world datasets -- the largest of\nwhich has 8 million edges -- where we obtain interesting insights into the\nVC-dimension of real-world networks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:01:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Drange","P\u00e5l Gr\u00f8n\u00e5s",""],["Greaves","Patrick",""],["Muzi","Irene",""],["Reidl","Felix",""]]}
{"id":"2308.08869","submitter":"\\v{S}imon Schierreich","authors":"Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, \\v{S}imon\n  Schierreich","title":"The Complexity of Fair Division of Indivisible Items with Externalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the computational complexity of fairly allocating a set of\nindivisible items under externalities. In this recently-proposed setting, in\naddition to the utility the agent gets from their bundle, they also receive\nutility from items allocated to other agents. We focus on the extended\ndefinitions of envy-freeness up to one item (EF1) and of envy-freeness up to\nany item (EFX), and we provide the landscape of their complexity for several\ndifferent scenarios. We prove that it is NP-complete to decide whether there\nexists an EFX allocation, even when there are only three agents, or even when\nthere are only six different values for the items. We complement these negative\nresults by showing that when both the number of agents and the number of\ndifferent values for items are bounded by a parameter the problem becomes\nfixed-parameter tractable. Furthermore, we prove that two-valued and\nbinary-valued instances are equivalent and that EFX and EF1 allocations\ncoincide for this class of instances. Finally, motivated from real-life\nscenarios, we focus on a class of structured valuation functions, which we term\nagent/item-correlated. We prove their equivalence to the ``standard'' setting\nwithout externalities. Therefore, all previous results for EF1 and EFX apply\nimmediately for these valuations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:02:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Deligkas","Argyrios",""],["Eiben","Eduard",""],["Korchemna","Viktoriia",""],["Schierreich","\u0160imon",""]]}
{"id":"2308.08870","submitter":"Adam Karczmarz","authors":"Adam Karczmarz, Piotr Sankowski","title":"Sensitivity and Dynamic Distance Oracles via Generic Matrices and\n  Frobenius Form","comments":"To appear at FOCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Algebraic techniques have had an important impact on graph algorithms so far.\nPorting them, e.g., the matrix inverse, into the dynamic regime improved\nbest-known bounds for various dynamic graph problems. In this paper, we develop\nnew algorithms for another cornerstone algebraic primitive, the Frobenius\nnormal form (FNF). We apply our developments to dynamic and fault-tolerant\nexact distance oracle problems on directed graphs.\n  For generic matrices $A$ over a finite field accompanied by an FNF, we show\n(1) an efficient data structure for querying submatrices of the first $k\\geq 1$\npowers of $A$, and (2) a near-optimal algorithm updating the FNF explicitly\nunder rank-1 updates.\n  By representing an unweighted digraph using a generic matrix over a\nsufficiently large field (obtained by random sampling) and leveraging the\ndeveloped FNF toolbox, we obtain: (a) a conditionally optimal distance\nsensitivity oracle (DSO) in the case of single-edge or single-vertex failures,\nproviding a partial answer to the open question of Gu and Ren [ICALP'21], (b) a\nmultiple-failures DSO improving upon the state of the art (vd. Brand and\nSaranurak [FOCS'19]) wrt. both preprocessing and query time, (c) improved\ndynamic distance oracles in the case of single-edge updates, and (d) a dynamic\ndistance oracle supporting vertex updates, i.e., changing all edges incident to\na single vertex, in $\\tilde{O}(n^2)$ worst-case time and distance queries in\n$\\tilde{O}(n)$ time.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:02:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Karczmarz","Adam",""],["Sankowski","Piotr",""]]}
{"id":"2308.08871","submitter":"Mingze Sun","authors":"Mingze Sun and Shiwei Mao and Puhua Jiang and Maks Ovsjanikov and Ruqi\n  Huang","title":"Spatially and Spectrally Consistent Deep Functional Maps","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":"  Cycle consistency has long been exploited as a powerful prior for jointly\noptimizing maps within a collection of shapes. In this paper, we investigate\nits utility in the approaches of Deep Functional Maps, which are considered\nstate-of-the-art in non-rigid shape matching. We first justify that under\ncertain conditions, the learned maps, when represented in the spectral domain,\nare already cycle consistent. Furthermore, we identify the discrepancy that\nspectrally consistent maps are not necessarily spatially, or point-wise,\nconsistent. In light of this, we present a novel design of unsupervised Deep\nFunctional Maps, which effectively enforces the harmony of learned maps under\nthe spectral and the point-wise representation. By taking advantage of cycle\nconsistency, our framework produces state-of-the-art results in mapping shapes\neven under significant distortions. Beyond that, by independently estimating\nmaps in both spectral and spatial domains, our method naturally alleviates\nover-fitting in network training, yielding superior generalization performance\nand accuracy within an array of challenging tests for both near-isometric and\nnon-isometric datasets. Codes are available at\nhttps://github.com/rqhuang88/Spatiallyand-Spectrally-Consistent-Deep-Functional-Maps.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:04:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Mingze",""],["Mao","Shiwei",""],["Jiang","Puhua",""],["Ovsjanikov","Maks",""],["Huang","Ruqi",""]]}
{"id":"2308.08872","submitter":"Yue Duan","authors":"Yue Duan, Zhen Zhao, Lei Qi, Luping Zhou, Lei Wang, Yinghuan Shi","title":"Towards Semi-supervised Learning with Non-random Missing Labels","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semi-supervised learning (SSL) tackles the label missing problem by enabling\nthe effective usage of unlabeled data. While existing SSL methods focus on the\ntraditional setting, a practical and challenging scenario called label Missing\nNot At Random (MNAR) is usually ignored. In MNAR, the labeled and unlabeled\ndata fall into different class distributions resulting in biased label\nimputation, which deteriorates the performance of SSL models. In this work,\nclass transition tracking based Pseudo-Rectifying Guidance (PRG) is devised for\nMNAR. We explore the class-level guidance information obtained by the Markov\nrandom walk, which is modeled on a dynamically created graph built over the\nclass tracking matrix. PRG unifies the historical information of class\ndistribution and class transitions caused by the pseudo-rectifying procedure to\nmaintain the model's unbiased enthusiasm towards assigning pseudo-labels to all\nclasses, so as the quality of pseudo-labels on both popular classes and rare\nclasses in MNAR could be improved. Finally, we show the superior performance of\nPRG across a variety of MNAR scenarios, outperforming the latest SSL approaches\ncombining bias removal solutions by a large margin. Code and model weights are\navailable at https://github.com/NJUyued/PRG4SSL-MNAR.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:09:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Duan","Yue",""],["Zhao","Zhen",""],["Qi","Lei",""],["Zhou","Luping",""],["Wang","Lei",""],["Shi","Yinghuan",""]]}
{"id":"2308.08873","submitter":"Mahyar Jahaninasab","authors":"Mahyar Jahaninasab, Mohamad Ali Bijarchi","title":"Feature Enforcing PINN (FE-PINN): A Framework to Learn the\n  Underlying-Physics Features Before Target Task","comments":"23 pages, 8 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, a new data-free framework called Feature Enforcing Physics\nInformed Neural Network (FE-PINN) is introduced. This framework is capable of\nlearning the underlying pattern of any problem with low computational cost\nbefore the main training loop. The loss function of vanilla PINN due to the\nexistence of two terms of partial differential residuals and boundary condition\nmean squared error is imbalanced. FE-PINN solves this challenge with just one\nminute of training instead of time-consuming hyperparameter tuning for loss\nfunction that can take hours. The FE-PINN accomplishes this process by\nperforming a sequence of sub-tasks. The first sub-task learns useful features\nabout the underlying physics. Then, the model trains on the target task to\nrefine the calculations. FE-PINN is applied to three benchmarks, flow over a\ncylinder, 2D heat conduction, and an inverse problem of calculating inlet\nvelocity. FE-PINN can solve each case with, 15x, 2x, and 5x speed up\naccordingly. Another advantage of FE-PINN is that reaching lower order of value\nfor loss function is systematically possible. In this study, it was possible to\nreach a loss value near 1e-5 which is challenging for vanilla PINN. FE-PINN\nalso has a smooth convergence process which allows for utilizing higher\nlearning rates in comparison to vanilla PINN. This framework can be used as a\nfast, accurate tool for solving a wide range of Partial Differential Equations\n(PDEs) across various fields.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:10:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jahaninasab","Mahyar",""],["Bijarchi","Mohamad Ali",""]]}
{"id":"2308.08874","submitter":"Hugo Aaronson","authors":"Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum","title":"Distribution-Free Proofs of Proximity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the fact that input distributions are often unknown in advance,\ndistribution-free property testing considers a setting in which the algorithmic\ntask is to accept functions $f : [n] \\to \\{0,1\\}$ having a certain property\n$\\Pi$ and reject functions that are $\\epsilon$-far from $\\Pi$, where the\ndistance is measured according to an arbitrary and unknown input distribution\n$D \\sim [n]$. As usual in property testing, the tester is required to do so\nwhile making only a sublinear number of input queries, but as the distribution\nis unknown, we also allow a sublinear number of samples from the distribution\n$D$.\n  In this work we initiate the study of distribution-free interactive proofs of\nproximity (df-IPP) in which the distribution-free testing algorithm is assisted\nby an all powerful but untrusted prover. Our main result is a df-IPP for any\nproblem $\\Pi \\in NC$, with $\\tilde{O}(\\sqrt{n})$ communication, sample, query,\nand verification complexities, for any proximity parameter\n$\\epsilon>1/\\sqrt{n}$. For such proximity parameters, this result matches the\nparameters of the best-known general purpose IPPs in the standard uniform\nsetting, and is optimal under reasonable cryptographic assumptions.\n  For general values of the proximity parameter $\\epsilon$, our\ndistribution-free IPP has optimal query complexity $O(1/\\epsilon)$ but the\ncommunication complexity is $\\tilde{O}(\\epsilon \\cdot n + 1/\\epsilon)$, which\nis worse than what is known for uniform IPPs when $\\epsilon<1/\\sqrt{n}$. With\nthe aim of improving on this gap, we further show that for IPPs over\nspecialised, but large distribution families, such as sufficiently smooth\ndistributions and product distributions, the communication complexity can be\nreduced to $\\epsilon\\cdot n\\cdot(1/\\epsilon)^{o(1)}$ (keeping the query\ncomplexity roughly the same as before) to match the communication complexity of\nthe uniform case.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:11:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Aaronson","Hugo",""],["Gur","Tom",""],["Rajgopal","Ninad",""],["Rothblum","Ron D.",""]]}
{"id":"2308.08875","submitter":"Takamichi Sano","authors":"Takamichi Sano","title":"Derived Bockstein regulators and anticyclotomic $p$-adic Birch and\n  Swinnerton-Dyer conjectures","comments":"46 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce \"derived Bockstein regulators\" by using an idea of\nNekov\\'a\\v{r}. We establish a general descent formalism involving derived\nBockstein regulators. We give three applications of this formalism. Firstly, we\nshow that a conjecture of Birch and Swinnerton-Dyer type for Heegner points\nformulated by Bertolini and Darmon in 1996 follows from Perrin-Riou's Heegner\npoint main conjecture up to a $p$-adic unit. Secondly, we show that a $p$-adic\nBirch and Swinnerton-Dyer conjecture for the Bertolini-Darmon-Prasanna $p$-adic\n$L$-function recently formulated by Agboola and Castella follows from the\nIwasawa-Greenberg main conjecture up to a $p$-adic unit. Finally, we extend\nconjectures and results on derivatives of Euler systems for a general motive\ngiven by Kataoka and the present author into a natural derived setting.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:12:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sano","Takamichi",""]]}
{"id":"2308.08876","submitter":"Tomohiro Ichinose","authors":"Tomohiro Ichinose, Tatsuya Yamamoto, Takayuki Nozaki, Kay Yakushiji,\n  Shingo Tamaru, Shinji Yuasa","title":"Interfacial Fe segregation and its influence on magnetic properties of\n  CoFeB/MgFeO multilayers","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigated the effect of Fe segregated from partially Fe-substituted MgO\n(MgFeO) on the magnetic properties of CoFeB/MgFeO multilayers. X-ray\nphotoelectron spectroscopy (XPS) as well as magnetic measurements revealed that\nthe segregated Fe was reduced to metal and exhibited ferromagnetism at the\nCoFeB/MgFeO interface. The CoFeB/MgFeO multilayer showed more than 2-fold\nenhancement in perpendicular magnetic anisotropy (PMA) energy density compared\nwith a standard CoFeB/MgO multilayer. The PMA energy density was further\nenhanced by inserting an ultrathin MgO layer in between CoFeB and MgFeO layers.\nFerromagnetic resonance measurement also revealed a remarkable reduction of\nmagnetic damping in the CoFeB/MgFeO multilayers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:15:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ichinose","Tomohiro",""],["Yamamoto","Tatsuya",""],["Nozaki","Takayuki",""],["Yakushiji","Kay",""],["Tamaru","Shingo",""],["Yuasa","Shinji",""]]}
{"id":"2308.08877","submitter":"Shahariar Sarkar","authors":"Shahariar Sarkar, P. K. Rath, V. Nanal, R. G. Pillay, Pushpendra P.\n  Singh, Y. Iwata, K. Jha, and P. K. Raina","title":"Nuclear matrix elements calculation for $0\\nu\\beta\\beta$ decay of\n  $^{124}$Sn using nonclosure approach in nuclear shell model","comments":"12 pages, 6 figures, submitted in the journal Physical Review C.\n  arXiv admin note: text overlap with arXiv:2308.08216","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 calculate the nuclear matrix elements (NMEs) for the light\nneutrino-exchange mechanism of neutrinoless double beta $0\\nu\\beta\\beta$) decay\nof $^{124}$Sn within the framework of the interacting nuclear shell model using\nthe effective shell model Hamiltonian GCN5082. A novel method based on a\nnonclosure approach is employed, wherein for the intermediate nucleus\n$^{124}$Sb, effects of energy of 100 states for each $J_{k}^{\\pi}$=$0^{+}$ to\n$11^{+}$ and $2^{-}$ to $9^{-}$ ($\\Delta J_{k}$=1) are explicitly included in\nthe NMEs calculation. Other common effects such as the finite size of nucleons,\nhigher-order effects of nucleon currents, and short-range correlations (SRC) of\nnucleons are also taken into account. The extracted optimal closure energy is\n2.9 MeV for a total NME of $^{124}$Sn $0\\nu\\beta\\beta$ decay, which is\nindependent of different forms of SRC parametrizations. A comparison of NMEs\nand half-lives with some of the recent calculations is presented. Further, to\ngain a comprehensive understanding of the role of nuclear structure on the\n$0\\nu\\beta\\beta$ decay, the dependence of NMEs on spin-parity of the\nintermediate states, coupled spin-parity of neutrons and protons, and the\nnumber of intermediate states, is explored. It is observed that the inclusion\nof the effects of excitation energies of the intermediate nucleus yields more\nreliable NMEs. The present findings provide valuable insights for experimental\ninvestigations of $0\\nu\\beta\\beta$ decay of $^{124}$Sn in India and elsewhere.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:19:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sarkar","Shahariar",""],["Rath","P. K.",""],["Nanal","V.",""],["Pillay","R. G.",""],["Singh","Pushpendra P.",""],["Iwata","Y.",""],["Jha","K.",""],["Raina","P. K.",""]]}
{"id":"2308.08878","submitter":"Gabor Szabo","authors":"G\\'abor Szab\\'o","title":"Equivariant property (SI) revisited, II","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate Matui-Sato's notion of property (SI) for C*-dynamics, this\ntime with a focus on actions of possibly non-amenable groups. The main result\nis a generalization of earlier work: For any countable group $\\Gamma$ and any\nnon-elementary separable simple nuclear C*-algebra $A$ with strict comparison,\nevery amenable $\\Gamma$-action on $A$ has equivariant property (SI). This is\ndeduced from a more general statement involving relative property (SI) for\ncertain inclusions into ultraproducts. The article concludes with a few\nconsequences of this result.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:21:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Szab\u00f3","G\u00e1bor",""]]}
{"id":"2308.08879","submitter":"Justus Springer","authors":"Justus Springer","title":"The Picard index of a surface with torus action","comments":"28 pager, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider normal rational projective surfaces with torus action and provide\na formula for their Picard index, that means the index of the Picard group\ninside the divisor class group. As an application, we classify the log del\nPezzo surfaces with torus action of Picard number one up to Picard index\n10,000.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:26:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Springer","Justus",""]]}
{"id":"2308.08880","submitter":"Stefan Weyers","authors":"Burghard Lipphardt, Patrick Walkemeyer, Michael Kazda, Johannes Rahm\n  and Stefan Weyers","title":"Continuous optical generation of microwave signals for fountain clocks","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For the optical generation of ultrastable microwave signals for fountain\nclocks we developed a setup, which is based on a cavity stabilized laser and a\ncommercial frequency comb. The robust system, in operation since 2020, is\nlocked to a 100 MHz output frequency of a hydrogen maser and provides an\nultrastable 9.6 GHz signal for the interrogation of atoms in two caesium\nfountain clocks, acting as primary frequency standards. Measurements reveal\nthat the system provides a phase noise level which enables quantum projection\nnoise limited fountain frequency instabilities at the low $10^{-14} (\\tau\n/\\mathrm{s})^{-1/2}$ level. At the same time it offers largely maintenance-free\noperation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:27:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lipphardt","Burghard",""],["Walkemeyer","Patrick",""],["Kazda","Michael",""],["Rahm","Johannes",""],["Weyers","Stefan",""]]}
{"id":"2308.08881","submitter":"Yuechen Wang","authors":"Yuechen Wang, Wengang Zhou, Zhenbo Lu, Houqiang Li","title":"Text-Only Training for Visual Storytelling","comments":"ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual storytelling aims to generate a narrative based on a sequence of\nimages, necessitating both vision-language alignment and coherent story\ngeneration. Most existing solutions predominantly depend on paired image-text\ntraining data, which can be costly to collect and challenging to scale. To\naddress this, we formulate visual storytelling as a visual-conditioned story\ngeneration problem and propose a text-only training method that separates the\nlearning of cross-modality alignment and story generation. Our approach\nspecifically leverages the cross-modality pre-trained CLIP model to integrate\nvisual control into a story generator, trained exclusively on text data.\nMoreover, we devise a training-free visual condition planner that accounts for\nthe temporal structure of the input image sequence while balancing global and\nlocal visual content. The distinctive advantage of requiring only text data for\ntraining enables our method to learn from external text story data, enhancing\nthe generalization capability of visual storytelling. We conduct extensive\nexperiments on the VIST benchmark, showcasing the effectiveness of our approach\nin both in-domain and cross-domain settings. Further evaluations on expression\ndiversity and human assessment underscore the superiority of our method in\nterms of informativeness and robustness.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:32:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yuechen",""],["Zhou","Wengang",""],["Lu","Zhenbo",""],["Li","Houqiang",""]]}
{"id":"2308.08882","submitter":"Fangfang Xu","authors":"Fangfang Xu, Bo Li, Zhengxue Ren, Pengwei Zhao","title":"Tetrahedral shape of $^{110}$Zr from covariant density functional theory\n  in 3D lattice space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Covariant density functional theory is solved in 3D lattice space by\nimplementing the preconditioned conjugate gradient method with a filtering\nfunction (PCG-F). It considerably improves the computational efficiency\ncompared to the previous inverse Hamiltonian method (IHM). This new method is\nthen applied to explore the tetrahedral shape of $^{110}$Zr in the full\ndeformation space. The ground state of $^{110}$Zr is found to have a\ntetrahedral shape, but the deformations $\\beta_{31}$ and $\\beta_{33}$ greatly\nsoften the potential energy surface. This effect is analysed with the\nmicroscopic evolution of the single-particle levels near the Fermi surface\ndriven by the deformation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:35:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Fangfang",""],["Li","Bo",""],["Ren","Zhengxue",""],["Zhao","Pengwei",""]]}
{"id":"2308.08883","submitter":"Min Qiu","authors":"Min Qiu and Yu-Chih Huang and Jinhong Yuan","title":"Coexistence of Heterogeneous Services in the Uplink with Discrete\n  Signaling and Treating Interference as Noise","comments":"7 pages, accepted for presentation at IEEE Global Communications\n  Conference (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":"  The problem of enabling the coexistence of heterogeneous services, e.g.,\ndifferent ultra-reliable low-latency communications (URLLC) services and/or\nenhanced mobile broadband (eMBB) services, in the uplink is studied. Each\nservice has its own error probability and blocklength constraints and the\nlonger transmission block suffers from heterogeneous interference. Due to the\nlatency concern, the decoding of URLLC messages cannot leverage successive\ninterference cancellation (SIC) and should always be performed before the\ndecoding of eMBB messages. This can significantly degrade the achievable rates\nof URLLC users when the interference from other users is strong. To overcome\nthis issue, we propose a new transmission scheme based on discrete signaling\nand treating interference as noise decoding, i.e., without SIC. Guided by the\ndeterministic model, we provide a systematic way to construct discrete\nsignaling for handling heterogeneous interference effectively. We demonstrate\ntheoretically and numerically that the proposed scheme can perform close to the\nbenchmark scheme based on capacity-achieving Gaussian signaling with the\nassumption of perfect SIC.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:40:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qiu","Min",""],["Huang","Yu-Chih",""],["Yuan","Jinhong",""]]}
{"id":"2308.08884","submitter":"Zhiming Wang","authors":"Zhiming Wang, Lin Gu, Feng Lu","title":"SRMAE: Masked Image Modeling for Scale-Invariant Deep Representations","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 prevalence of scale variance in nature images, we propose to use\nimage scale as a self-supervised signal for Masked Image Modeling (MIM). Our\nmethod involves selecting random patches from the input image and downsampling\nthem to a low-resolution format. Our framework utilizes the latest advances in\nsuper-resolution (SR) to design the prediction head, which reconstructs the\ninput from low-resolution clues and other patches. After 400 epochs of\npre-training, our Super Resolution Masked Autoencoders (SRMAE) get an accuracy\nof 82.1% on the ImageNet-1K task. Image scale signal also allows our SRMAE to\ncapture scale invariance representation. For the very low resolution (VLR)\nrecognition task, our model achieves the best performance, surpassing DeriveNet\nby 1.3%. Our method also achieves an accuracy of 74.84% on the task of\nrecognizing low-resolution facial expressions, surpassing the current\nstate-of-the-art FMD by 9.48%.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:43:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Zhiming",""],["Gu","Lin",""],["Lu","Feng",""]]}
{"id":"2308.08885","submitter":"Anlan Wang","authors":"An-Lan Wang, Kun-Yu Lin, Jia-Run Du, Jingke Meng, Wei-Shi Zheng","title":"Event-Guided Procedure Planning from Instructional Videos with Text\n  Supervision","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":"  In this work, we focus on the task of procedure planning from instructional\nvideos with text supervision, where a model aims to predict an action sequence\nto transform the initial visual state into the goal visual state. A critical\nchallenge of this task is the large semantic gap between observed visual states\nand unobserved intermediate actions, which is ignored by previous works.\nSpecifically, this semantic gap refers to that the contents in the observed\nvisual states are semantically different from the elements of some action text\nlabels in a procedure. To bridge this semantic gap, we propose a novel\nevent-guided paradigm, which first infers events from the observed states and\nthen plans out actions based on both the states and predicted events. Our\ninspiration comes from that planning a procedure from an instructional video is\nto complete a specific event and a specific event usually involves specific\nactions. Based on the proposed paradigm, we contribute an Event-guided\nPrompting-based Procedure Planning (E3P) model, which encodes event information\ninto the sequential modeling process to support procedure planning. To further\nconsider the strong action associations within each event, our E3P adopts a\nmask-and-predict approach for relation mining, incorporating a probabilistic\nmasking scheme for regularization. Extensive experiments on three datasets\ndemonstrate the effectiveness of our proposed model.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:43:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","An-Lan",""],["Lin","Kun-Yu",""],["Du","Jia-Run",""],["Meng","Jingke",""],["Zheng","Wei-Shi",""]]}
{"id":"2308.08886","submitter":"Vincent Roulet","authors":"Vincent Roulet, Mathieu Blondel","title":"Dual Gauss-Newton Directions for Deep Learning","comments":"Presented at the Duality Principles for Modern Machine Learning\n  Workshop at ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inspired by Gauss-Newton-like methods, we study the benefit of leveraging the\nstructure of deep learning objectives, namely, the composition of a convex loss\nfunction and of a nonlinear network, in order to derive better direction\noracles than stochastic gradients, based on the idea of partial linearization.\nIn a departure from previous works, we propose to compute such direction\noracles via their dual formulation, leading to both computational benefits and\nnew insights. We demonstrate that the resulting oracles define descent\ndirections that can be used as a drop-in replacement for stochastic gradients,\nin existing optimization algorithms. We empirically study the advantage of\nusing the dual formulation as well as the computational trade-offs involved in\nthe computation of such oracles.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:44:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Roulet","Vincent",""],["Blondel","Mathieu",""]]}
{"id":"2308.08887","submitter":"Zhaopeng Dou","authors":"Zhaopeng Dou, Zhongdao Wang, Yali Li, and Shengjin Wang","title":"Identity-Seeking Self-Supervised Representation Learning for\n  Generalizable Person Re-identification","comments":"ICCV 2023 Oral","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper aims to learn a domain-generalizable (DG) person re-identification\n(ReID) representation from large-scale videos \\textbf{without any annotation}.\nPrior DG ReID methods employ limited labeled data for training due to the high\ncost of annotation, which restricts further advances. To overcome the barriers\nof data and annotation, we propose to utilize large-scale unsupervised data for\ntraining. The key issue lies in how to mine identity information. To this end,\nwe propose an Identity-seeking Self-supervised Representation learning (ISR)\nmethod. ISR constructs positive pairs from inter-frame images by modeling the\ninstance association as a maximum-weight bipartite matching problem. A\nreliability-guided contrastive loss is further presented to suppress the\nadverse impact of noisy positive pairs, ensuring that reliable positive pairs\ndominate the learning process. The training cost of ISR scales approximately\nlinearly with the data size, making it feasible to utilize large-scale data for\ntraining. The learned representation exhibits superior generalization ability.\n\\textbf{Without human annotation and fine-tuning, ISR achieves 87.0\\% Rank-1 on\nMarket-1501 and 56.4\\% Rank-1 on MSMT17}, outperforming the best supervised\ndomain-generalizable method by 5.0\\% and 19.5\\%, respectively. In the\npre-training$\\rightarrow$fine-tuning scenario, ISR achieves state-of-the-art\nperformance, with 88.4\\% Rank-1 on MSMT17. The code is at\n\\url{https://github.com/dcp15/ISR_ICCV2023_Oral}.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:46:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dou","Zhaopeng",""],["Wang","Zhongdao",""],["Li","Yali",""],["Wang","Shengjin",""]]}
{"id":"2308.08888","submitter":"Yong-Liang Zhao","authors":"Yong-Liang Zhao","title":"A low-rank algorithm for strongly damped wave equations with\n  visco-elastic damping and mass terms","comments":"14 pages, 3 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Damped wave equations have been used in many real-world fields. In this\npaper, we study a low-rank solution of the strongly damped wave equation with\nthe damping term, visco-elastic damping term and mass term. Firstly, a\nsecond-order finite difference method is employed for spatial discretization.\nThen, we receive a second-order matrix differential system. Next, we transform\nit into an equivalent first-order matrix differential system, and split the\ntransformed system into three subproblems. Applying a Strang splitting to these\nsubproblems and combining a dynamical low-rank approach, we obtain a low-rank\nalgorithm. Numerical experiments are reported to demonstrate that the proposed\nlow-rank algorithm is robust and accurate, and has second-order convergence\nrate in time.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:49:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhao","Yong-Liang",""]]}
{"id":"2308.08889","submitter":"Konstantin Merz","authors":"Jean-Claude Cuenin, Konstantin Merz","title":"Lieb-Thirring-type inequalities for random Schr\\\"odinger operators with\n  complex potentials","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.AP math.FA math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review some results and proofs on eigenvalue bounds for random\nSchr\\\"odinger operators with complex-valued potentials. We also include new\nSchatten norm estimates for the resolvent and use them to obtain bounds for\nsums of eigenvalues.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:54:19 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 17:39:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cuenin","Jean-Claude",""],["Merz","Konstantin",""]]}
{"id":"2308.08890","submitter":"Lea Schenk","authors":"Vicky Fasen-Hartmann, Lea Schenk","title":"Mixed causality graphs for continuous-time stationary processes","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":"  In this paper, we introduce different concepts of Granger non-causality and\ncontemporaneous uncorrelation for stationary continuous-time processes to model\nthe different dependencies between the component series of multivariate time\nseries models. Several equivalent characterisations for the different\ndefinitions are given, in particular by linear projections. We then define two\nmixed graphs based on different definitions of causality and contemporaneous\nuncorrelation, the (mixed) causality graph and the local (mixed) causality\ngraph, to visualise and to analyse the different dependencies in stationary\ncontinuous-time processes. In these graphs, the components of the process are\nrepresented by vertices, directed edges between the vertices indicate causal\ninfluences and undirected edges indicate contemporaneous uncorrelation between\nthe component processes. Further, we introduce various notions of causal Markov\nproperties in analogy to Eichler (2012), which relate the different dependence\nstructures of subprocesses, and we derive sufficient criteria for the (local)\ncausality graph to satisfy them. Finally, as an example, the popular\nmultivariate continuous-time AR (MCAR) processes satisfy our assumptions. For\nMCAR processes we show that the (local) causality graphs can be characterised\nexplicitly by the model parameters.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:54:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fasen-Hartmann","Vicky",""],["Schenk","Lea",""]]}
{"id":"2308.08891","submitter":"Ben Lanyon","authors":"V. Krutyanskiy, M. Canteri, M. Meraner, V. Krcmarsky, B. P. Lanyon","title":"Multimode ion-photon entanglement over 101 kilometers of optical fiber","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A three-qubit quantum network node based on trapped atomic ions is presented.\nThe ability to establish entanglement between each of the qubits in the node\nand a separate photon that has travelled over a 101km-long optical fiber is\ndemonstrated. By sending those photons through the fiber in close succession, a\nremote entanglement rate is achieved that is greater than when using only a\nsingle qubit in the node. Once extended to more qubits, this multimode approach\ncan be a useful technique to boost entanglement distribution rates in future\nlong-distance quantum networks of light and matter.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 09:56:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Krutyanskiy","V.",""],["Canteri","M.",""],["Meraner","M.",""],["Krcmarsky","V.",""],["Lanyon","B. P.",""]]}
{"id":"2308.08892","submitter":"Yiru Zhou","authors":"Yiru Zhou, Pooja Malik, Florian Fertig, Matthias Bock, Tobias Bauer,\n  Tim van Leent, Wei Zhang, Christoph Becher, Harald Weinfurter","title":"Long-lived quantum memory enabling atom-photon entanglement over 101 km\n  telecom fiber","comments":"11 pages, 8 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Long-distance entanglement distribution is the key task for quantum networks,\nenabling applications such as secure communication and distributed quantum\ncomputing. Here we report on novel developments extending the reach for sharing\nentanglement between a single $^{87}$Rb atom and a single photon over long\noptical fibers. To maintain a high fidelity during the long flight times\nthrough such fibers, the coherence time of the single atom is prolonged to 7 ms\nby applying a long-lived qubit encoding. In addition, the attenuation in the\nfibers is minimized by converting the photon's wavelength to the telecom S-Band\nvia polarization-preserving quantum frequency conversion. This enables to\nobserve entanglement between the atomic quantum memory and the emitted photon\nafter passing 101 km of optical fiber with a fidelity better than\n70.8$\\pm$2.4%. The fidelity, however, is no longer reduced due to loss of\ncoherence of the atom or photon but in the current setup rather due to detector\ndark counts, showing the suitability of our platform to realize city-to-city\nscale quantum network links.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:00:22 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 15:26:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Yiru",""],["Malik","Pooja",""],["Fertig","Florian",""],["Bock","Matthias",""],["Bauer","Tobias",""],["van Leent","Tim",""],["Zhang","Wei",""],["Becher","Christoph",""],["Weinfurter","Harald",""]]}
{"id":"2308.08893","submitter":"Mats Tholen","authors":"Mats O. Thol\\'en, Riccardo Borgani, Christian Kri\\v{z}an, Jonas\n  Bylander, David B. Haviland","title":"Characterization and benchmarking of a phase-sensitive two-qubit gate\n  using direct digital synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We implement an iSWAP gate with two transmon qubits using a flux-tunable\ncoupler. Precise control of the relative phase of the qubit-control pulses and\nthe parametric-coupler drive is achieved with a multi-channel instrument called\nPresto using direct digital synthesis (DDS), a promising technique for scaling\nup quantum systems. We describe the process of tuning and benchmarking the\niSWAP gate, where the relative phase of the pulses is controlled via software.\nWe perform the iSWAP gate in 290 ns, validate it with quantum-state tomography,\nand measure 2\\% error with interleaved randomized benchmarking.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:01:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thol\u00e9n","Mats O.",""],["Borgani","Riccardo",""],["Kri\u017ean","Christian",""],["Bylander","Jonas",""],["Haviland","David B.",""]]}
{"id":"2308.08894","submitter":"Cheryl Feuillet-Palma Dr","authors":"Sergei Kozlov, J\\'er\\^ome Lesueur, Dimitri Roditchev, Cheryl\n  Feuillet-Palma","title":"Dynamic metastable vortex states in interacting vortex lines","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The electron transport in current-biased superconducting nano-bridges is\ndetermined by the motion of the quantum vortex confined in the internal\ndisorder landscape. Here we consider a simple case of a single or two\nneighbouring linear defects crossing a nano-bridge. The strong anharmonicity of\nthe vortex motion along the defect leads, upon RF-excitation, to fractional\nShapiro steps. In the case of two defects, the vortex motion becomes\ncorrelated, characterized by metastable states that can be locked to a resonant\nRF-drive. The lock-unlock process causes sudden voltage jumps and drops in the\nvoltage-current characteristics observed in experiments. We analyze the\nparameters promoting these metastable dynamic states and discuss their\npotential applications in quantum devices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:01:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kozlov","Sergei",""],["Lesueur","J\u00e9r\u00f4me",""],["Roditchev","Dimitri",""],["Feuillet-Palma","Cheryl",""]]}
{"id":"2308.08895","submitter":"Shoudong Man","authors":"Shoudong Man","title":"Existence results for some nonlinear elliptic systems on graphs","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, several nonlinear elliptic systems are investigated on graphs.\nOne type of the sobolev embedding theorem and a new version of the strong\nmaximum principle are established. Then, by using the variational method, the\nexistence of different types of solutions to some elliptic systems is\nconfirmed. Such problems extend the existence results on closed Riemann surface\nto graphs and extend the existence results for one single equation on graphs\n[A. Grigor'yan, Y. Lin, Y. Yang, J. Differential Equations, 2016] to nonlinear\nelliptic systems on graphs. Such problems can also be viewed as one type of\ndiscrete version of the elliptic systems on Euclidean space and Riemannian\nmanifold.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:02:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Man","Shoudong",""]]}
{"id":"2308.08896","submitter":"Song Lyu","authors":"Song Lyu, Zheng Lin, Guanqiao Qu, Xianhao Chen, Xiaoxia Huang, and Pan\n  Li","title":"Optimal Resource Allocation for U-Shaped Parallel Split Learning","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Split learning (SL) has emerged as a promising approach for model training\nwithout revealing the raw data samples from the data owners. However,\ntraditional SL inevitably leaks label privacy as the tail model (with the last\nlayers) should be placed on the server. To overcome this limitation, one\npromising solution is to utilize U-shaped architecture to leave both early\nlayers and last layers on the user side. In this paper, we develop a novel\nparallel U-shaped split learning and devise the optimal resource optimization\nscheme to improve the performance of edge networks. In the proposed framework,\nmultiple users communicate with an edge server for SL. We analyze the\nend-to-end delay of each client during the training process and design an\nefficient resource allocation algorithm, called LSCRA, which finds the optimal\ncomputing resource allocation and split layers. Our experimental results show\nthe effectiveness of LSCRA and that U-shaped PSL can achieve a similar\nperformance with other SL baselines while preserving label privacy. Index\nTerms: U-shaped network, split learning, label privacy, resource allocation,\n5G/6G edge networks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:07:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lyu","Song",""],["Lin","Zheng",""],["Qu","Guanqiao",""],["Chen","Xianhao",""],["Huang","Xiaoxia",""],["Li","Pan",""]]}
{"id":"2308.08897","submitter":"David Egger","authors":"Martin Schwade, Maximilian J. Schilcher, Christian Rever\\'on Baecker,\n  Manuel Grumet, David A. Egger","title":"Dynamic tight binding for large-scale electronic-structure calculations\n  of semiconductors at finite temperatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Calculating the electronic structure of materials at finite temperatures is\nimportant for rationalizing their physical properties and assessing their\ntechnological capabilities. However, finite-temperature calculations typically\nrequire large system sizes or long simulation times. This is challenging for\nnon-empirical theoretical methods because the involved bottleneck of performing\nmany first-principles calculations can pose a steep computational barrier for\nlarger systems. While machine-learning molecular dynamics enables\nlarge-scale/long-time simulations of the structural properties, the difficulty\nof computing in particular the electronic structure of large and disordered\nmaterials still remains. In this work, we suggest an adaptation of the\ntight-binding formalism which allows for computationally efficient calculations\nof temperature-dependent properties of semiconductors. Our dynamic\ntight-binding approach utilizes hybrid-orbital basis functions and a modeling\nof the distance dependence of matrix elements via numerical integration of\natomic orbitals. We show that these design choices lead to a dynamic\ntight-binding model with a minimal amount of parameters which are\nstraightforwardly optimized using density functional theory. Combining dynamic\ntight-binding with machine learning molecular dynamics and hybrid density\nfunctional theory, we find that it accurately describes finite-temperature\nelectronic properties in comparison to experiment for the prototypical\nsemiconductor gallium-arsenide.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:10:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schwade","Martin",""],["Schilcher","Maximilian J.",""],["Baecker","Christian Rever\u00f3n",""],["Grumet","Manuel",""],["Egger","David A.",""]]}
{"id":"2308.08898","submitter":"Sitabhra Sinha","authors":"Anand Pathak, Shakti N. Menon and Sitabhra Sinha","title":"A hierarchy index for networks in the brain reveals a complex entangled\n  organizational structure","comments":"16 pages, 5 figures + 10 pages Supplementary Information","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Networks involved in information processing often have their nodes arranged\nhierarchically, with the majority of connections occurring in adjacent levels.\nHowever, despite being an intuitively appealing concept, the hierarchical\norganization of large networks, such as those in the brain, are difficult to\nidentify, especially in absence of additional information beyond that provided\nby the connectome. In this paper, we propose a framework to uncover the\nhierarchical structure of a given network, that identifies the nodes occupying\neach level as well as the sequential order of the levels. It involves\noptimizing a metric that we use to quantify the extent of hierarchy present in\na network. Applying this measure to various brain networks, ranging from the\nnervous system of the nematode Caenorhabditis elegans to the human connectome,\nwe unexpectedly find that they exhibit a common network architectural motif\nintertwining hierarchy and modularity. This suggests that brain networks may\nhave evolved to simultaneously exploit the functional advantages of these two\ntypes of organizations, viz., relatively independent modules performing\ndistributed processing in parallel and a hierarchical structure that allows\nsequential pooling of these multiple processing streams. An intriguing\npossibility is that this property we report may be common to information\nprocessing networks in general.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:15:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pathak","Anand",""],["Menon","Shakti N.",""],["Sinha","Sitabhra",""]]}
{"id":"2308.08899","submitter":"Petr Petrov","authors":"P. P. Petrov, K. N. Grankin, E. V. Babina, S. A. Artemenko, M. M.\n  Romanova, S. Yu. Gorda, A. A. Djupvik, J. F. Gameiro","title":"Density streams in the disc winds of Classical T Tauri stars","comments":"9 pages, 10 figures","journal-ref":"Monthly Notices of the Royal Astronomical Society, 2023, V.524,\n  pp.5944-5953","doi":"10.1093/mnras/stad2252","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spectral and photometric variability of the Classical T Tauri stars RY Tau\nand SU Aur from 2013 to 2022 is analyzed. We find that in SU Aur the H-alpha\nline's flux at radial velocity RV = -50 +- 7 km/s varies with a period P = 255\n+- 5 days. A similar effect previously discovered in RY Tau is confirmed with\nthese new data: P = 21.6 days at RV = -95 +- 5 km/s. In both stars, the radial\nvelocity of these variations, the period, and the mass of the star turn out to\nbe related by Kepler's law, suggesting structural features on the disc plane\norbiting at radii of 0.2 AU in RY Tau and 0.9 AU in SU Aur, respectively. Both\nstars have a large inclination of the accretion disc to the line of sight - so\nthat the line of sight passes through the region of the disc wind. We propose\nthere is an azimuthal asymmetry in the disc wind, presumably in the form of\n'density streams', caused by substructures of the accretion disc surface. These\nstreams cannot dissipate until they go beyond the Alfven surface in the disc's\nmagnetic field. These findings open up the possibility to learn about the\nstructure of the inner accretion disc of CTTS on scales less than 1 AU and to\nreveal the orbital distances related to the planet's formation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:15:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Petrov","P. P.",""],["Grankin","K. N.",""],["Babina","E. V.",""],["Artemenko","S. A.",""],["Romanova","M. M.",""],["Gorda","S. Yu.",""],["Djupvik","A. A.",""],["Gameiro","J. F.",""]]}
{"id":"2308.08900","submitter":"Baosheng Gao","authors":"Belle Collaboration: B. S. Gao, W. J. Zhu, X. L. Wang, I. Adachi, H.\n  Aihara, D. M. Asner, V. Aulchenko, T. Aushev, R. Ayad, V. Babu, Sw. Banerjee,\n  M. Bauer, P. Behera, K. Belous, J. Bennett, M. Bessner, V. Bhardwaj, T.\n  Bilka, D. Biswas, A. Bobrov, D. Bodrov, A. Bondar, A. Bozek, M. Bra\\v{c}ko,\n  P. Branchini, T. E. Browder, A. Budano, D. \\v{C}ervenkov, M.-C. Chang, P.\n  Chang, V. Chekelian, B. G. Cheon, K. Chilikin, H. E. Cho, K. Cho, S.-K. Choi,\n  Y. Choi, S. Choudhury, D. Cinabro, G. De Nardo, G. De Pietro, R. Dhamija, F.\n  Di Capua, J. Dingfelder, Z. Dole\\v{z}al, T. V. Dong, P. Ecker, T. Ferber, D.\n  Ferlewicz, B. G. Fulsom, V. Gaur, A. Giri, E. Graziani, T. Gu, K. Gudkova, C.\n  Hadjivasiliou, K. Hayasaka, H. Hayashii, S. Hazra, M. T. Hedges, D. Herrmann,\n  W.-S. Hou, C.-L. Hsu, T. Iijima, K. Inami, N. Ipsita, A. Ishikawa, R. Itoh,\n  M. Iwasaki, W. W. Jacobs, E.-J. Jang, S. Jia, Y. Jin, K. K. Joo, T. Kawasaki,\n  C. Kiesling, C. H. Kim, D. Y. Kim, K.-H. Kim, Y.-K. Kim, K. Kinoshita, P.\n  Kody\\v{s}, T. Konno, A. Korobov, S. Korpar, P. Kri\\v{z}an, M. Kumar, R.\n  Kumar, K. Kumara, A. Kuzmin, Y.-J. Kwon, Y.-T. Lai, S. C. Lee, D. Levit, P.\n  Lewis, L. K. Li, L. Li Gioi, J. Libby, K. Lieret, D. Liventsev, Y. Ma, M.\n  Masuda, T. Matsuda, S. K. Maurya, F. Meier, M. Merola, R. Mizuk, I. Nakamura,\n  M. Nakao, D. Narwal, A. Natochii, L. Nayak, M. Niiyama, N. K. Nisar, S.\n  Nishida, S. Ogawa, P. Pakhlov, G. Pakhlova, S. Pardi, J. Park, S. Patra, S.\n  Paul, T. K. Pedlar, R. Pestotnik, L. E. Piilonen, T. Podobnik, E. Prencipe,\n  M. T. Prim, G. Russo, S. Sandilya, V. Savinov, G. Schnell, C. Schwanda, Y.\n  Seino, K. Senyo, M. E. Sevior, W. Shan, C. Sharma, J.-G. Shiu, B. Shwartz, E.\n  Solovieva, M. Stari\\v{c}, Z. S. Stottler, M. Sumihama, K. Tanida, F.\n  Tenchini, M. Uchida, T. Uglov, Y. Unno, S. Uno, S. E. Vahsen, K. E. Varvell,\n  D. Wang, E. Wang, M.-Z. Wang, S. Watanuki, E. Won, X. Xu, B. D. Yabsley, W.\n  Yan, S. B. Yang, J. H. Yin, Y. Yook, C. Z. Yuan, L. Yuan, V. Zhilich, V.\n  Zhukova","title":"Observation of charmed strange meson pair production in $\\Upsilon(2S)$\n  decays and in $e^{+}e^{-}$ annihilation at $\\sqrt{s} = 10.52~ \\rm{GeV}$","comments":null,"journal-ref":null,"doi":null,"report-no":"Belle Preprint 2023-12, KEK Preprint 2023-16","categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We observe the process $\\Upsilon(2S)\\to D_s^{(*)+} D_{sJ}^{-}$ and continuum\nproduction $e^+e^- \\to D_s^{(*)+} D_{sJ}^- $ at $\\sqrt{s} = 10.52$ GeV (and\ntheir charge conjugates) using the data samples collected by the Belle detector\nat KEKB, where $D_{sJ}^-$ is $D_{s1}(2536)^-$ or $D^{*}_{s2}(2573)^-$. Both\n$D_{sJ}^-$ states are identified through their decay into\n$\\bar{K}\\bar{D}^{(*)}$. We measure the products of branching fractions ${\\cal\nB}(\\Upsilon(2S) \\to D_{s}^{(*)+} D_{sJ}^-) {\\cal B}(D_{sJ}^-\\to \\bar{K}\n\\bar{D}^{(*)})$ and the Born cross sections $\\sigma^{\\rm Born}(e^+e^- \\to\nD_{s}^{(*)+} D_{sJ}^-) {\\cal B}(D_{sJ}^-\\to \\bar{K} \\bar{D}^{(*)})$, and then\ncompare the ratios $R_1 \\equiv {\\cal B}(\\Upsilon(2S)\\to D_{s}^{(*)+}\nD_{sJ}^-)/{\\cal B}(\\Upsilon(2S)\\to\\mu^{+}\\mu^-)$ for $\\Upsilon(2S)$ decays and\n$R_2 \\equiv \\sigma^{\\rm Born}(e^+e^-\\to D_{s}^{(*)+}D_{sJ}^-)/\\sigma^{\\rm\nBorn}(e^+e^-\\to \\mu^{+}\\mu^-)$ for continuum production. We obtain $R_1/R_2 =\n9.7\\pm 2.3 \\pm 1.1$, $6.8 \\pm 2.1 \\pm 0.8$, $10.2 \\pm 3.3 \\pm 2.5$, and $3.4\n\\pm 2.1 \\pm 0.5$ for the $D_s^+ D_{s1}(2536)^-$, $D_s^{*+} D_{s1}(2536)^-$,\n$D_s^+ D_{s2}^{*}(2573)^{-}$, and $D_s^{*+} D_{s2}^{*}(2573)^{-}$ final states\nin the $D_{sJ}^-\\to K^{-} \\bar{D}^{(*)0}$ modes, respectively. Therefore, the\nstrong decay is expected to dominate in the $\\Upsilon(2S)\\to\nD_{s}^{(*)+}D_{sJ}^-$ processes. We also measure the ratios of branching\nfractions ${\\cal B}(D_{s1}(2536)^-\\to K_S^0 D^{*}(2010)^{-})/{\\cal\nB}(D_{s1}(2536)^-\\to K^{-} D^{*}(2007)^0) = 0.48 \\pm 0.07 \\pm 0.02$ and ${\\cal\nB}(D_{s2}^{*}(2573)^- \\to K_S^0 D^-)/{\\cal B}(D_{s2}^{*}(2573)^- \\to K^{-}D^0)\n= 0.49 \\pm 0.10 \\pm 0.02$, which are consistent with isospin symmetry. The\nsecond ratio is the first measurement of this quantity. Here, the first\nuncertainties are statistical and the second are systematic.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:18:56 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:48:50 GMT"},{"version":"v3","created":"Tue, 22 Aug 2023 01:23:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Belle Collaboration","",""],["Gao","B. S.",""],["Zhu","W. J.",""],["Wang","X. L.",""],["Adachi","I.",""],["Aihara","H.",""],["Asner","D. M.",""],["Aulchenko","V.",""],["Aushev","T.",""],["Ayad","R.",""],["Babu","V.",""],["Banerjee","Sw.",""],["Bauer","M.",""],["Behera","P.",""],["Belous","K.",""],["Bennett","J.",""],["Bessner","M.",""],["Bhardwaj","V.",""],["Bilka","T.",""],["Biswas","D.",""],["Bobrov","A.",""],["Bodrov","D.",""],["Bondar","A.",""],["Bozek","A.",""],["Bra\u010dko","M.",""],["Branchini","P.",""],["Browder","T. E.",""],["Budano","A.",""],["\u010cervenkov","D.",""],["Chang","M. -C.",""],["Chang","P.",""],["Chekelian","V.",""],["Cheon","B. G.",""],["Chilikin","K.",""],["Cho","H. E.",""],["Cho","K.",""],["Choi","S. -K.",""],["Choi","Y.",""],["Choudhury","S.",""],["Cinabro","D.",""],["De Nardo","G.",""],["De Pietro","G.",""],["Dhamija","R.",""],["Di Capua","F.",""],["Dingfelder","J.",""],["Dole\u017eal","Z.",""],["Dong","T. V.",""],["Ecker","P.",""],["Ferber","T.",""],["Ferlewicz","D.",""],["Fulsom","B. G.",""],["Gaur","V.",""],["Giri","A.",""],["Graziani","E.",""],["Gu","T.",""],["Gudkova","K.",""],["Hadjivasiliou","C.",""],["Hayasaka","K.",""],["Hayashii","H.",""],["Hazra","S.",""],["Hedges","M. T.",""],["Herrmann","D.",""],["Hou","W. -S.",""],["Hsu","C. -L.",""],["Iijima","T.",""],["Inami","K.",""],["Ipsita","N.",""],["Ishikawa","A.",""],["Itoh","R.",""],["Iwasaki","M.",""],["Jacobs","W. W.",""],["Jang","E. -J.",""],["Jia","S.",""],["Jin","Y.",""],["Joo","K. K.",""],["Kawasaki","T.",""],["Kiesling","C.",""],["Kim","C. H.",""],["Kim","D. Y.",""],["Kim","K. -H.",""],["Kim","Y. -K.",""],["Kinoshita","K.",""],["Kody\u0161","P.",""],["Konno","T.",""],["Korobov","A.",""],["Korpar","S.",""],["Kri\u017ean","P.",""],["Kumar","M.",""],["Kumar","R.",""],["Kumara","K.",""],["Kuzmin","A.",""],["Kwon","Y. -J.",""],["Lai","Y. -T.",""],["Lee","S. C.",""],["Levit","D.",""],["Lewis","P.",""],["Li","L. K.",""],["Gioi","L. Li",""],["Libby","J.",""],["Lieret","K.",""],["Liventsev","D.",""],["Ma","Y.",""],["Masuda","M.",""],["Matsuda","T.",""],["Maurya","S. K.",""],["Meier","F.",""],["Merola","M.",""],["Mizuk","R.",""],["Nakamura","I.",""],["Nakao","M.",""],["Narwal","D.",""],["Natochii","A.",""],["Nayak","L.",""],["Niiyama","M.",""],["Nisar","N. K.",""],["Nishida","S.",""],["Ogawa","S.",""],["Pakhlov","P.",""],["Pakhlova","G.",""],["Pardi","S.",""],["Park","J.",""],["Patra","S.",""],["Paul","S.",""],["Pedlar","T. K.",""],["Pestotnik","R.",""],["Piilonen","L. E.",""],["Podobnik","T.",""],["Prencipe","E.",""],["Prim","M. T.",""],["Russo","G.",""],["Sandilya","S.",""],["Savinov","V.",""],["Schnell","G.",""],["Schwanda","C.",""],["Seino","Y.",""],["Senyo","K.",""],["Sevior","M. E.",""],["Shan","W.",""],["Sharma","C.",""],["Shiu","J. -G.",""],["Shwartz","B.",""],["Solovieva","E.",""],["Stari\u010d","M.",""],["Stottler","Z. S.",""],["Sumihama","M.",""],["Tanida","K.",""],["Tenchini","F.",""],["Uchida","M.",""],["Uglov","T.",""],["Unno","Y.",""],["Uno","S.",""],["Vahsen","S. E.",""],["Varvell","K. E.",""],["Wang","D.",""],["Wang","E.",""],["Wang","M. -Z.",""],["Watanuki","S.",""],["Won","E.",""],["Xu","X.",""],["Yabsley","B. D.",""],["Yan","W.",""],["Yang","S. B.",""],["Yin","J. H.",""],["Yook","Y.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Zhilich","V.",""],["Zhukova","V.",""]]}
{"id":"2308.08901","submitter":"Baohong Guo","authors":"Baohong Guo, Ute Ebert, Jannis Teunissen","title":"3D particle-in-cell simulations of negative and positive streamers in\n  C4F7N-CO2 mixtures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate negative and positive streamers in C4F7N-CO2 mixtures through\nsimulations. These mixtures are considered to be more environmentally friendly\nthan the insulating gas SF6 that is widely used in high voltage technology.\nSimulations are performed using a 3D particle-in-cell model. Negative streamers\ncan propagate when the background field is close to the critical field. We\nrelate this to their short conductive channels, due to rapid electron\nattachment, which limits their field enhancement. Positive streamers also\nrequire a background field close to the critical field, and in addition a\nsource of free electrons ahead of them. In our simulations these electrons are\nprovided through an artificial stochastic background ionization process as no\nefficient photoionization process is known for these gases. In 3D, we can only\nsimulate the early inception stage of positive discharges, due to the extremely\nhigh electric fields and electron densities that occur. Qualitative 2D\nCartesian simulations show that the growth of these discharges is highly\nirregular, resulting from incoming negative streamers that connect to existing\nchannels. The inclusion of a stochastic background ionization process also has\nan interesting effect on negative discharges: new streamers can be generated\nbehind previous ones, thereby forming a chain of negative streamers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:20:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","Baohong",""],["Ebert","Ute",""],["Teunissen","Jannis",""]]}
{"id":"2308.08902","submitter":"Yonatan Woodbridge","authors":"Yonatan Woodbridge, Micha Mandel, Yair Goldberg and Amit Huppert","title":"Estimating Mean Viral Load Trajectory from Intermittent Longitudinal\n  Data and Unknown Time Origins","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Viral load (VL) in the respiratory tract is the leading proxy for assessing\ninfectiousness potential. Understanding the dynamics of disease-related VL\nwithin the host is very important and help to determine different policy and\nhealth recommendations. However, often only partial followup data are available\nwith unknown infection date. In this paper we introduce a discrete time\nlikelihood-based approach to modeling and estimating partial observed\nlongitudinal samples. We model the VL trajectory by a multivariate normal\ndistribution that accounts for possible correlation between measurements within\nindividuals. We derive an expectation-maximization (EM) algorithm which treats\nthe unknown time origins and the missing measurements as latent variables. Our\nmain motivation is the reconstruction of the daily mean SARS-Cov-2 VL, given\nmeasurements performed on random patients, whose VL was measured multiple times\non different days. The method is applied to SARS-Cov-2 cycle-threshold-value\ndata collected in Israel.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:22:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Woodbridge","Yonatan",""],["Mandel","Micha",""],["Goldberg","Yair",""],["Huppert","Amit",""]]}
{"id":"2308.08903","submitter":"Mingwei Yang","authors":"Xiaohui Bei, Biaoshuai Tao, Jiajun Wu, Mingwei Yang","title":"The Incentive Guarantees Behind Nash Welfare in Divisible Resources\n  Allocation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of allocating divisible resources among $n$ agents,\nhopefully in a fair and efficient manner. With the presence of strategic\nagents, additional incentive guarantees are also necessary, and the problem of\ndesigning fair and efficient mechanisms becomes much less tractable. While the\nmaximum Nash welfare (MNW) mechanism has been proven to be prominent by\nproviding desirable fairness and efficiency guarantees as well as other\nintuitive properties, no incentive property is known for it.\n  We show a surprising result that, when agents have piecewise constant value\ndensity functions, the incentive ratio of the MNW mechanism is $2$ for cake\ncutting, where the incentive ratio of a mechanism is defined as the ratio\nbetween the largest possible utility that an agent can gain by manipulation and\nhis utility in honest behavior. Remarkably, this result holds even without the\nfree disposal assumption, which is hard to get rid of in the design of truthful\ncake cutting mechanisms. We also show that the MNW mechanism is group\nstrategyproof when agents have piecewise uniform value density functions.\n  Moreover, we show that, for cake cutting, the Partial Allocation (PA)\nmechanism proposed by Cole et al., which is truthful and $1/e$-MNW for\nhomogeneous divisible items, has an incentive ratio between $[e^{1 / e}, e]$\nand when randomization is allowed, can be turned to be truthful in expectation.\nGiven two alternatives for a trade-off between incentive ratio and Nash welfare\nprovided by the MNW and PA mechanisms, we establish an interpolation between\nthem for both cake cutting and homogeneous divisible items.\n  Finally, we study the existence of fair mechanisms with a low incentive ratio\nin the connected pieces setting. We show that any envy-free cake cutting\nmechanism with the connected pieces constraint has an incentive ratio of at\nleast $\\Omega(n)$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:25:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bei","Xiaohui",""],["Tao","Biaoshuai",""],["Wu","Jiajun",""],["Yang","Mingwei",""]]}
{"id":"2308.08904","submitter":"Jaya Chaturvedi","authors":"Jaya Chaturvedi, Tao Wang, Sumithra Velupillai, Robert Stewart, Angus\n  Roberts","title":"Development of a Knowledge Graph Embeddings Model for Pain","comments":"Accepted at AMIA 2023, New Orleans","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pain is a complex concept that can interconnect with other concepts such as a\ndisorder that might cause pain, a medication that might relieve pain, and so\non. To fully understand the context of pain experienced by either an individual\nor across a population, we may need to examine all concepts related to pain and\nthe relationships between them. This is especially useful when modeling pain\nthat has been recorded in electronic health records. Knowledge graphs represent\nconcepts and their relations by an interlinked network, enabling semantic and\ncontext-based reasoning in a computationally tractable form. These graphs can,\nhowever, be too large for efficient computation. Knowledge graph embeddings\nhelp to resolve this by representing the graphs in a low-dimensional vector\nspace. These embeddings can then be used in various downstream tasks such as\nclassification and link prediction. The various relations associated with pain\nwhich are required to construct such a knowledge graph can be obtained from\nexternal medical knowledge bases such as SNOMED CT, a hierarchical systematic\nnomenclature of medical terms. A knowledge graph built in this way could be\nfurther enriched with real-world examples of pain and its relations extracted\nfrom electronic health records. This paper describes the construction of such\nknowledge graph embedding models of pain concepts, extracted from the\nunstructured text of mental health electronic health records, combined with\nexternal knowledge created from relations described in SNOMED CT, and their\nevaluation on a subject-object link prediction task. The performance of the\nmodels was compared with other baseline models.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:27:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chaturvedi","Jaya",""],["Wang","Tao",""],["Velupillai","Sumithra",""],["Stewart","Robert",""],["Roberts","Angus",""]]}
{"id":"2308.08905","submitter":"Nuno Azevedo Silva","authors":"Tiago D. Ferreira, Jakub Garwola, Nuno A. Silva","title":"Exploring the dynamics of the Kelvin-Helmoltz instability in paraxial\n  fluids of light","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Paraxial fluids of light have recently emerged as promising analogue physical\nsimulators of quantum fluids using laser propagation inside nonlinear optical\nmedia. In particular, recent works have explored the versatility of such\nsystems for the observation of two-dimensional quantum-like turbulence regimes,\ndominated by quantized vortex formation and interaction that results in\ndistinctive kinetic energy power laws and inverse energy cascades. In this\nmanuscript, we explore a regime analogue to Kelvin-Helmoltz instability to look\ninto further detail the qualitative dynamics involved in the transition from\nsmooth laminar flow to turbulence at the interface of two fluids with distinct\nvelocities. Both numerical and experimental results reveal the formation of a\nvortex sheet as expected, with a quantized number of vortices determined by\ninitial conditions. Using an effective length transformation scale we get a\ndeeper insight into the vortex formation phase, observing the appearance of\ncharacteristic power-laws in the incompressible kinetic energy spectrum that\nare related to the single vortex structures. The results enclosed demonstrate\nthe versatility of paraxial fluids of light and may set the stage for the\nfuture observation of distinct classes of phenomena recently predicted to occur\nin these systems, such as radiant instability and superradiance.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:27:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ferreira","Tiago D.",""],["Garwola","Jakub",""],["Silva","Nuno A.",""]]}
{"id":"2308.08906","submitter":"Daniel Gibert","authors":"Daniel Gibert, Giulio Zizzo, Quan Le","title":"Towards a Practical Defense against Adversarial Attacks on Deep\n  Learning-based Malware Detectors via Randomized Smoothing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Malware detectors based on deep learning (DL) have been shown to be\nsusceptible to malware examples that have been deliberately manipulated in\norder to evade detection, a.k.a. adversarial malware examples. More\nspecifically, it has been show that deep learning detectors are vulnerable to\nsmall changes on the input file. Given this vulnerability of deep learning\ndetectors, we propose a practical defense against adversarial malware examples\ninspired by randomized smoothing. In our work, instead of employing Gaussian or\nLaplace noise when randomizing inputs, we propose a randomized ablation-based\nsmoothing scheme that ablates a percentage of the bytes within an executable.\nDuring training, our randomized ablation-based smoothing scheme trains a base\nclassifier based on ablated versions of the executable files. At test time, the\nfinal classification for a given input executable is taken as the class most\ncommonly predicted by the classifier on a set of ablated versions of the\noriginal executable. To demonstrate the suitability of our approach we have\nempirically evaluated the proposed ablation-based model against various\nstate-of-the-art evasion attacks on the BODMAS dataset. Results show greater\nrobustness and generalization capabilities to adversarial malware examples in\ncomparison to a non-smoothed classifier.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:30:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gibert","Daniel",""],["Zizzo","Giulio",""],["Le","Quan",""]]}
{"id":"2308.08907","submitter":"Rupam Barman Dr","authors":"Deepa Antony and Rupam Barman","title":"On $p$-adic denseness of quotients of values of integral forms","comments":"9 pages. arXiv admin note: text overlap with arXiv:2201.04372","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a set of integers $A$, the ratio set of $A$ is defined by $R(A):=\\{a/b:\na, b\\in A, b\\neq 0\\}$. It is an open problem to study the denseness of $R(A)$\nin the $p$-adic numbers when $A$ is the set of nonzero values attained by an\nintegral form. In 2019, Donnay, Garcia and Rouse answered this problem for\nquadratic forms. Recently, we have studied this problem for the diagonal binary\ncubic forms $ax^3+by^3$, where $a$ and $b$ are integers. Later on, jointly with\nMiska, we extend the results on the diagonal binary cubic forms to the diagonal\nbinary forms $ax^n+by^n$ for all $n\\geq 3$. In this article, we study this\nproblem for the binary form $ax^d+bxy^{d-1}+cy^d$ of degree $d\\geq 2$. Also, we\ngive a sufficient condition for the existence of infinitely many primes $p$\nsuch that the ratio set of the values assumed by an integral form is dense in\n$\\mathbb{Q}_p$. Furthermore, we study the denseness of ratio sets of values\nassumed by cubic and quartic forms in two variables. A result for quintic forms\nis also discussed in the article.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:39:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Antony","Deepa",""],["Barman","Rupam",""]]}
{"id":"2308.08908","submitter":"Atila Poro","authors":"Somayeh Soomandar and Atila Poro","title":"A New Look at the YY CrB Binary System","comments":"Accepted by the New Astronomy Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study presented a new analysis for the TESS-observed W Ursae Majoris (W\nUMa) binary star YY Coronea Borealis (YY CrB). The light curve was analyzed by\nthe PHysics Of Eclipsing BinariEs (PHOEBE) Python version together with the\nMarkov chain Monte Carlo (MCMC) method. The light curve solutions required a\nhot spot and l3. New eclipse times from the TESS observations were extracted,\nand the O-C curve of primary and secondary minima showed an anti-correlated\nmanner. In order to study the O-C curve of minima, minima times between 1991\nand 2023 were collected. This investigation reported a new linear ephemeris and\nby fitting a quadratic function to the O-C curve of minima, calculated the\norbital period rate of \\mathop P\\limits^.\\approx 5.786*{10^{-8}} day/year.\nAssuming mass conservation, a mass exchange rate of\n\\mathop{{M_2}}\\limits^.=2.472*{10^{-8}} calculated from the more massive\ncomponent to the less massive one. Then, by using the light travel time\nfunction, the possible third body was determined in the binary and derived the\nmass of the third body as 0.498M_Sun with a period of \\simeq 7351.018 days. The\nO-C curve analysis and the quantity of mass indicate that the presence of a\nthird body is unlikely. This binary is expected to evolve into a broken-contact\nphase and is a good case to support the thermal relaxation oscillation model.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:42:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Soomandar","Somayeh",""],["Poro","Atila",""]]}
{"id":"2308.08909","submitter":"James Wootton","authors":"Milan Liepelt, Tommaso Peduzzi, James R. Wootton","title":"Enhanced repetition codes for the cross-platform comparison of progress\n  towards fault-tolerance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Achieving fault-tolerance will require a strong relationship between the\nhardware and the protocols used. Different approaches will therefore naturally\nhave tailored proof-of-principle experiments to benchmark progress.\nNevertheless, repetition codes have become a commonly used basis of experiments\nthat allow cross-platform comparisons. Here we propose methods by which\nrepetition code experiments can be expanded and improved, while retaining\ncross-platform compatibility. We also consider novel methods of analyzing the\nresults, which offer more detailed insights than simple calculation of the\nlogical error rate.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:43:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liepelt","Milan",""],["Peduzzi","Tommaso",""],["Wootton","James R.",""]]}
{"id":"2308.08910","submitter":"Xiangfu Zou","authors":"Xueying Liang, Xiangfu Zou, Xin Wang, Shenggen Zheng, Zhenbang Rong,\n  Zhiming Huang, Jianfeng Liu, Ying Chen, Jianxiong Wu","title":"Semiquantum key distribution using initial states in only one basis\n  without the classical user measuring","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":"  From the perspective of resource theory, it is interesting to achieve the\nsame quantum task using as few quantum resources as possible. Semiquantum key\ndistribution (SQKD), which allows a quantum user to share a confidential key\nwith a classical user who prepares and operates qubits in only one basis, is an\nimportant example for studying this issue. To further limit the quantum\nresources used by users, in this paper, we constructed the first SQKD protocol\nwhich restricts the quantum user to prepare quantum states in only one basis\nand removes the classical user's measurement capability. Furthermore, we prove\nthat the constructed protocol is unconditionally secure by deriving a key rate\nexpression of the error rate in the asymptotic scenario. The work of this paper\nprovides inspiration for achieving quantum superiority with minimal quantum\nresources.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:44:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liang","Xueying",""],["Zou","Xiangfu",""],["Wang","Xin",""],["Zheng","Shenggen",""],["Rong","Zhenbang",""],["Huang","Zhiming",""],["Liu","Jianfeng",""],["Chen","Ying",""],["Wu","Jianxiong",""]]}
{"id":"2308.08911","submitter":"Weronika {\\L}ajewska","authors":"Weronika {\\L}ajewska and Krisztian Balog","title":"Towards Filling the Gap in Conversational Search: From Passage Retrieval\n  to Conversational Response Generation","comments":"Extended version of the paper that appeared in the Proceedings of the\n  32nd ACM International Conference on Information and Knowledge Management\n  (CIKM '23)","journal-ref":null,"doi":"10.1145/3583780.3615132","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research on conversational search has so far mostly focused on query\nrewriting and multi-stage passage retrieval. However, synthesizing the top\nretrieved passages into a complete, relevant, and concise response is still an\nopen challenge. Having snippet-level annotations of relevant passages would\nenable both (1) the training of response generation models that are able to\nground answers in actual statements and (2) the automatic evaluation of the\ngenerated responses in terms of completeness. In this paper, we address the\nproblem of collecting high-quality snippet-level answer annotations for two of\nthe TREC Conversational Assistance track datasets. To ensure quality, we first\nperform a preliminary annotation study, employing different task designs,\ncrowdsourcing platforms, and workers with different qualifications. Based on\nthe outcomes of this study, we refine our annotation protocol before proceeding\nwith the full-scale data collection. Overall, we gather annotations for 1.8k\nquestion-paragraph pairs, each annotated by three independent crowd workers.\nThe process of collecting data at this magnitude also led to multiple insights\nabout the problem that can inform the design of future response-generation\nmethods. This is an extended version of the article published with the same\ntitle in the Proceedings of CIKM'23.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:54:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["\u0141ajewska","Weronika",""],["Balog","Krisztian",""]]}
{"id":"2308.08912","submitter":"Babatunde Ayeni","authors":"Babatunde M. Ayeni","title":"A Bottom-up Approach to Constructing Symmetric Variational Quantum\n  Circuits","comments":"18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the age of noisy quantum processors, the exploitation of quantum\nsymmetries can be quite beneficial in the efficient preparation of trial\nstates, an important part of the variational quantum eigensolver algorithm. The\nbenefits include building quantum circuits which are more compact, with lesser\nnumber of paramaters, and more robust to noise, than their non-symmetric\ncounterparts. Leveraging on ideas from representation theory we show how to\nconstruct symmetric quantum circuits. Similar ideas have been previously used\nin the field of tensor networks to construct symmetric tensor networks. We\nfocus on the specific case of particle number conservation, that is systems\nwith U(1) symmetry. Based on the representation theory of U(1), we show how to\nderive the particle-conserving exchange gates, which are commonly used in\nconstructing hardware-efficient quantum circuits for fermionic systems, like in\nquantum chemistry, material science, and condensed-matter physics. We tested\nthe effectiveness of our circuits with the Heisenberg XXZ model.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:57:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ayeni","Babatunde M.",""]]}
{"id":"2308.08913","submitter":"Emad Chaparian","authors":"Emad Chaparian","title":"Yielding to percolation: a universal scale","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A theoretical and computational study analysing the initiation of\nyield-stress fluids percolation in porous media is presented. Yield-stress\nfluid flows through porous media are complicated due to the non-linear\nrheological behaviour of this type of fluids, rendering the conventional Darcy\ntype approach invalid. A critical pressure gradient must be exceeded to\ncommence the flow of a yield-stress fluid in a porous medium. As the first step\nin generalising the Darcy law for yield-stress fluids, a universal scale based\non the variational formulation of the energy equation is derived for the\ncritical pressure gradient which reduces to purely geometrical feature of the\nporous media. The presented scaling is then validated by both exhaustive\nnumerical simulations (using an adaptive finite element approach based on the\naugmented Lagrangian method), and also the previously published data. The\nconsidered porous media is constructed by randomised obstacles with various\ntopologies; namely, square, circular and alternatively polygonal obstacles\nwhich are mimicked based on Voronoi tessellation of circular cases. Moreover,\ncomputations for the bi-dispersed obstacle cases are performed which further\ndemonstrate the validity of the proposed universal scaling.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:59:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chaparian","Emad",""]]}
{"id":"2308.08914","submitter":"Ravil Iakhibbaev","authors":"R.M. Iakhibbaev, D.M. Tolkachev","title":"Generalising holographic fishchain","comments":"18 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper we present an attempt to generalise the integrable Gromov-Sever\nmodels, the so-called fishchain models, which are dual to biscalar fishnets. We\nshow that in any dimension they can be derived at least for some integer\ndeformation parameter of the fishnet lattice. We focus in particular on the\nstudy of fishchain models in AdS$_7$ that are dual to the six-dimensional\nfishnet models.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:59:42 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 13:58:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Iakhibbaev","R. M.",""],["Tolkachev","D. M.",""]]}
{"id":"2308.08915","submitter":"Haotian Si","authors":"Haotian Si, Changhua Pei, Zhihan Li, Yadong Zhao, Jingjing Li, Haiming\n  Zhang, Zulong Diao, Jianhui Li, Gaogang Xie, Dan Pei","title":"Beyond Sharing: Conflict-Aware Multivariate Time Series Anomaly\n  Detection","comments":"11 pages, ESEC/FSE industry track 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Massive key performance indicators (KPIs) are monitored as multivariate time\nseries data (MTS) to ensure the reliability of the software applications and\nservice system. Accurately detecting the abnormality of MTS is very critical\nfor subsequent fault elimination. The scarcity of anomalies and manual labeling\nhas led to the development of various self-supervised MTS anomaly detection\n(AD) methods, which optimize an overall objective/loss encompassing all\nmetrics' regression objectives/losses. However, our empirical study uncovers\nthe prevalence of conflicts among metrics' regression objectives, causing MTS\nmodels to grapple with different losses. This critical aspect significantly\nimpacts detection performance but has been overlooked in existing approaches.\nTo address this problem, by mimicking the design of multi-gate\nmixture-of-experts (MMoE), we introduce CAD, a Conflict-aware multivariate KPI\nAnomaly Detection algorithm. CAD offers an exclusive structure for each metric\nto mitigate potential conflicts while fostering inter-metric promotions. Upon\nthorough investigation, we find that the poor performance of vanilla MMoE\nmainly comes from the input-output misalignment settings of MTS formulation and\nconvergence issues arising from expansive tasks. To address these challenges,\nwe propose a straightforward yet effective task-oriented metric selection and\np&s (personalized and shared) gating mechanism, which establishes CAD as the\nfirst practicable multi-task learning (MTL) based MTS AD model. Evaluations on\nmultiple public datasets reveal that CAD obtains an average F1-score of 0.943\nacross three public datasets, notably outperforming state-of-the-art methods.\nOur code is accessible at https://github.com/dawnvince/MTS_CAD.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:00:01 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 09:01:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Si","Haotian",""],["Pei","Changhua",""],["Li","Zhihan",""],["Zhao","Yadong",""],["Li","Jingjing",""],["Zhang","Haiming",""],["Diao","Zulong",""],["Li","Jianhui",""],["Xie","Gaogang",""],["Pei","Dan",""]]}
{"id":"2308.08916","submitter":"Fatim Zahra Mouhib","authors":"F. Mouhib, B. Gao, T. Al-Samman","title":"On the role of selective nucleation and growth to recrystallization\n  texture development in a Mg-Gd-Zn alloy","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":"  One of the main material properties altered by rare earth additions in\nmagnesium alloys is texture, which can be specifically adjusted to enhance\nductility and formability. The current study aims at illuminating the texture\nselection process in a Mg-0.073at%Gd-0.165at%Zn alloy by investigating\nrecrystallization nucleation and early nucleus growth during static\nrecrystallization. An as-cast sample of the investigated alloy was deformed in\nuniaxial compression at 200{\\deg}C till 40% strain and was then cut into two\nhalves for subsequent microstructure characterization via ex-situ and quasi\nin-situ EBSD investigations. In order to gain insights into the evolution of\ntexture during recrystallization, the contributions from dynamic and static\nrecrystallization were initially separated and the origin of the non-basal\norientation of recrystallization nuclei was traced back to several potential\nnucleation sites within the deformed matrix. Considering the significant role\nof double-twin band recrystallization in determining the recrystallization\ntexture, this type of recrystallization nucleation was further investigated via\nquasi-in-situ EBSD on a deformed sample, annealed at 400{\\deg} for different\nannealing times. With progressive annealing a noticeable trend was observed, in\nwhich the basal nuclei gradually diminished and eventually vanished from the\nannealed microstructure. In contrast, the off-basal nuclei exhibited continuous\ngrowth, ultimately becoming the dominant contributors to the recrystallization\ntexture. The study therefore emphasizes the importance of particular nucleation\nsites that generate favorably oriented off-basal nuclei, which over the course\nof recrystallization outcompete the neighboring basal-oriented nuclei in terms\nof growth, and thereby dominate the recrystallization texture.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:00:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mouhib","F.",""],["Gao","B.",""],["Al-Samman","T.",""]]}
{"id":"2308.08917","submitter":"Swati Bhattacharya","authors":"Swati Bhattacharya, K.V.S. Hari, Yonina C. Eldar","title":"Unfolding for Joint Channel Estimation and Symbol Detection in MIMO\n  Communication Systems","comments":"14 pages, 19 figures, submitted to IEEE Transactions on Signal\n  Processing","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 paper proposes a Joint Channel Estimation and Symbol Detection (JED)\nscheme for Multiple-Input Multiple-Output (MIMO) wireless communication\nsystems. Our proposed method for JED using Alternating Direction Method of\nMultipliers (JED-ADMM) and its model-based neural network version JED using\nUnfolded ADMM (JED-U-ADMM) markedly improve the symbol detection performance\nover JED using Alternating Minimization (JED-AM) for a range of MIMO antenna\nconfigurations. Both proposed algorithms exploit the non-smooth constraint,\nthat occurs as a result of the Quadrature Amplitude Modulation (QAM) data\nsymbols, to effectively improve the performance using the ADMM iterations. The\nproposed unfolded network JED-U-ADMM consists of a few trainable parameters and\nrequires a small training set. We show the efficacy of the proposed methods for\nboth uncorrelated and correlated MIMO channels. For certain configurations, the\ngain in SNR for a desired BER of $10^{-2}$ for the proposed JED-ADMM and\nJED-U-ADMM is upto $4$ dB and is also accompanied by a significant reduction in\ncomputational complexity of upto $75\\%$, depending on the MIMO configuration,\nas compared to the complexity of JED-AM.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:02:46 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:41:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bhattacharya","Swati",""],["Hari","K. V. S.",""],["Eldar","Yonina C.",""]]}
{"id":"2308.08918","submitter":"Hui Niu","authors":"Hui Niu, Siyuan Li, Jiahao Zheng, Zhouchi Lin, Jian Li, Jian Guo, Bo\n  An","title":"IMM: An Imitative Reinforcement Learning Approach with Predictive\n  Representation Learning for Automatic Market Making","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-fin.TR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Market making (MM) has attracted significant attention in financial trading\nowing to its essential function in ensuring market liquidity. With strong\ncapabilities in sequential decision-making, Reinforcement Learning (RL)\ntechnology has achieved remarkable success in quantitative trading.\nNonetheless, most existing RL-based MM methods focus on optimizing single-price\nlevel strategies which fail at frequent order cancellations and loss of queue\npriority. Strategies involving multiple price levels align better with actual\ntrading scenarios. However, given the complexity that multi-price level\nstrategies involves a comprehensive trading action space, the challenge of\neffectively training profitable RL agents for MM persists. Inspired by the\nefficient workflow of professional human market makers, we propose Imitative\nMarket Maker (IMM), a novel RL framework leveraging both knowledge from\nsuboptimal signal-based experts and direct policy interactions to develop\nmulti-price level MM strategies efficiently. The framework start with\nintroducing effective state and action representations adept at encoding\ninformation about multi-price level orders. Furthermore, IMM integrates a\nrepresentation learning unit capable of capturing both short- and long-term\nmarket trends to mitigate adverse selection risk. Subsequently, IMM formulates\nan expert strategy based on signals and trains the agent through the\nintegration of RL and imitation learning techniques, leading to efficient\nlearning. Extensive experimental results on four real-world market datasets\ndemonstrate that IMM outperforms current RL-based market making strategies in\nterms of several financial criteria. The findings of the ablation study\nsubstantiate the effectiveness of the model components.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:04:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Niu","Hui",""],["Li","Siyuan",""],["Zheng","Jiahao",""],["Lin","Zhouchi",""],["Li","Jian",""],["Guo","Jian",""],["An","Bo",""]]}
{"id":"2308.08919","submitter":"Zurab Silagadze","authors":"Zurab K. Silagadze","title":"Evading Quantum Mechanics \\'{a} la Sudarshan: quantum-mechanics-free\n  subsystem as a realization of Koopman-von Neumann mechanics","comments":"5 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tsang and Caves suggested the idea of a quantum-mechanics-free subsystem in\n2012. We contend that Sudarshan's viewpoint on Koopman-von Neumann mechanics is\nrealized in the quantum-mechanics-free subsystem. Since quantum-mechanics-free\nsubsystems are being experimentally realized, Koopman-von Neumann mechanics is\nessentially transformed into an engineering science.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:06:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Silagadze","Zurab K.",""]]}
{"id":"2308.08920","submitter":"EPTCS","authors":"Cl\\'ement Aubert (Augusta University, USA), Cinzia Di Giusto\n  (Universit\\'e C\\^ote d'Azur, CNRS, I3SSophia Antipolis, FR), Simon Fowler\n  (University of Glasgow School of Computing Science, GB-SCT), Larisa Safina\n  (Inria, FR)","title":"Proceedings 16th Interaction and Concurrency Experience","comments":null,"journal-ref":"EPTCS 383, 2023","doi":"10.4204/EPTCS.383","report-no":null,"categories":"cs.DC cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This volume contains the proceedings of ICE'23, the 16th Interaction and\nConcurrency Experience, which was held at the NOVA University in Lisbon,\nPortugal, as a satellite event of DisCoTec'22. The ICE workshop series features\na distinguishing review and selection procedure: PC members are encouraged to\ninteract, anonymously, with authors. The 2023 edition of ICE included double\nblind reviewing of original research papers, in order to increase fairness and\navoid bias in reviewing. Each paper was reviewed by three PC members, and\naltogether 5 papers were accepted for publication plus 4 oral presentations\nwhich are not part of this volume. We were proud to host 2 invited talks, by\nCarla Ferreira and Adrian Francalanza. The abstracts of these talks are\nincluded in this volume, together with the final versions of the research\npapers, which take into account the discussion at the workshop and during the\nreview process.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:06:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Aubert","Cl\u00e9ment","","Augusta University, USA"],["Di Giusto","Cinzia","","Universit\u00e9 C\u00f4te d'Azur, CNRS, I3SSophia Antipolis, FR"],["Fowler","Simon","","University of Glasgow School of Computing Science, GB-SCT"],["Safina","Larisa","","Inria, FR"]]}
{"id":"2308.08921","submitter":"Weihua Zhang","authors":"Weihua Zhang, Gabriel M. Lando, Barbara Dietz, and Sergej Flach","title":"Thermalization Universality-Class Transition Induced by Anderson\n  Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the disorder-induced crossover between the two recently discovered\nthermalization slowing-down universality classes -- characterized by long- and\nshort-range coupling -- in classical unitary circuits maps close to\nintegrability. We compute Lyapunov spectra, which display qualitatively\ndistinct features depending on whether the proximity to the integrable limit is\nshort or long ranged. For sufficiently small nonlinearity, translationally\ninvariant systems fall into the long-range class. Adding disorder breaks this\ninvariance and Anderson localization emerges at the very limit. The crossover\nfrom long- to short-range class is attained by tuning the localization length,\n$\\xi$, from $\\xi \\approx N$ to $\\xi \\ll N$, where $N$ is the system size. As a\nconsequence, the Lyapunov spectrum becomes exponentially suppressed, depending\non how strongly its translational invariance is destroyed. We expect that this\ndisorder-induced crossover will lead to prethermalized phases and, following\nquantization, to many-body localization.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:18:09 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 01:15:25 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Weihua",""],["Lando","Gabriel M.",""],["Dietz","Barbara",""],["Flach","Sergej",""]]}
{"id":"2308.08922","submitter":"Calum Robson","authors":"Calum J. Robson","title":"Relational Quantum Mechanics and Consistent Histories","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper discusses several issues around Relational Quantum Mechanics.\nFirst, I discuss possible ontologies underlying the interpretation, before\nsettling on the hypothesis that RQM follows from contextuality of measurements,\ndue to quantum measurements changing the system measured. I then examine how\nthe consistent histories formalism can be used to clarify which infomation\nabout a system can be shared between different observers. Finally I discuss the\nsimilarities and differences between special relativity and RQM.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:25:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Robson","Calum J.",""]]}
{"id":"2308.08923","submitter":"Bivudutta Mishra Dr.","authors":"S. K. Tripathy, D. Nayak, B. Mishra, D. Behera, S. K. Sahu","title":"Existence of non-exotic traversable wormholes in squared trace extended\n  gravity theory","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An extended gravity theory is used to explore the possibility of non-exotic\nmatter traversable wormholes. In the extended gravity theory, additional terms\nlinear and quadratic in the trace of the energy momentum tensor are considered\nin the Einstein-Hilbert action. Obviously, such an addition leads to violation\nof the energy-momentum tensor. The model parameters are constrained from the\nstructure of the field equations. Non-exotic matter wormholes tend to satisfy\nthe null energy conditions. We use two different traversable wormhole\ngeometries namely an exponential and a power law shape functions to model the\nwormholes. From a detailed analysis of the energy conditions, it is found that,\nthe existence of non-exotic matter traversable wormholes is not obvious in the\nmodel considered and its possibility may depend on the choice of the wormhole\ngeometry. Also, we found that, non-exotic wormholes are possible within the\ngiven squared trace extended gravity theory for a narrow range of the chosen\nequation of state parameter.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:27:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tripathy","S. K.",""],["Nayak","D.",""],["Mishra","B.",""],["Behera","D.",""],["Sahu","S. K.",""]]}
{"id":"2308.08924","submitter":"Runmin Cong","authors":"Runmin Cong, Mengyao Sun, Sanyi Zhang, Xiaofei Zhou, Wei Zhang, and\n  Yao Zhao","title":"Frequency Perception Network for Camouflaged Object Detection","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Camouflaged object detection (COD) aims to accurately detect objects hidden\nin the surrounding environment. However, the existing COD methods mainly locate\ncamouflaged objects in the RGB domain, their performance has not been fully\nexploited in many challenging scenarios. Considering that the features of the\ncamouflaged object and the background are more discriminative in the frequency\ndomain, we propose a novel learnable and separable frequency perception\nmechanism driven by the semantic hierarchy in the frequency domain. Our entire\nnetwork adopts a two-stage model, including a frequency-guided coarse\nlocalization stage and a detail-preserving fine localization stage. With the\nmulti-level features extracted by the backbone, we design a flexible frequency\nperception module based on octave convolution for coarse positioning. Then, we\ndesign the correction fusion module to step-by-step integrate the high-level\nfeatures through the prior-guided correction and cross-layer feature channel\nassociation, and finally combine them with the shallow features to achieve the\ndetailed correction of the camouflaged objects. Compared with the currently\nexisting models, our proposed method achieves competitive performance in three\npopular benchmark datasets both qualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:30:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cong","Runmin",""],["Sun","Mengyao",""],["Zhang","Sanyi",""],["Zhou","Xiaofei",""],["Zhang","Wei",""],["Zhao","Yao",""]]}
{"id":"2308.08925","submitter":"Zhongliang Guo","authors":"Zhongliang Guo, Yifei Qian, Ognjen Arandjelovi\\'c, Lei Fang","title":"A White-Box False Positive Adversarial Attack Method on Contrastive\n  Loss-Based Offline Handwritten Signature Verification Models","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we tackle the challenge of white-box false positive\nadversarial attacks on contrastive loss-based offline handwritten signature\nverification models. We propose a novel attack method that treats the attack as\na style transfer between closely related but distinct writing styles. To guide\nthe generation of deceptive images, we introduce two new loss functions that\nenhance the attack success rate by perturbing the Euclidean distance between\nthe embedding vectors of the original and synthesized samples, while ensuring\nminimal perturbations by reducing the difference between the generated image\nand the original image. Our method demonstrates state-of-the-art performance in\nwhite-box attacks on contrastive loss-based offline handwritten signature\nverification models, as evidenced by our experiments. The key contributions of\nthis paper include a novel false positive attack method, two new loss\nfunctions, effective style transfer in handwriting styles, and superior\nperformance in white-box false positive attacks compared to other white-box\nattack methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:30:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guo","Zhongliang",""],["Qian","Yifei",""],["Arandjelovi\u0107","Ognjen",""],["Fang","Lei",""]]}
{"id":"2308.08926","submitter":"Ye-Xin Lu","authors":"Ye-Xin Lu, Yang Ai, and Zhen-Hua Ling","title":"Explicit Estimation of Magnitude and Phase Spectra in Parallel for\n  High-Quality Speech Enhancement","comments":"Submmited to IEEE Transactions on Audio, Speech and Language\n  Processing","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phase information has a significant impact on speech perceptual quality and\nintelligibility. However, existing speech enhancement methods encounter\nlimitations in explicit phase estimation due to the non-structural nature and\nwrapping characteristics of the phase, leading to a bottleneck in enhanced\nspeech quality. To overcome the above issue, in this paper, we proposed\nMP-SENet, a novel Speech Enhancement Network which explicitly enhances\nMagnitude and Phase spectra in parallel. The proposed MP-SENet adopts a codec\narchitecture in which the encoder and decoder are bridged by time-frequency\nTransformers along both time and frequency dimensions. The encoder aims to\nencode time-frequency representations derived from the input distorted\nmagnitude and phase spectra. The decoder comprises dual-stream magnitude and\nphase decoders, directly enhancing magnitude and wrapped phase spectra by\nincorporating a magnitude estimation architecture and a phase parallel\nestimation architecture, respectively. To train the MP-SENet model effectively,\nwe define multi-level loss functions, including mean square error and\nperceptual metric loss of magnitude spectra, anti-wrapping loss of phase\nspectra, as well as mean square error and consistency loss of short-time\ncomplex spectra. Experimental results demonstrate that our proposed MP-SENet\nexcels in high-quality speech enhancement across multiple tasks, including\nspeech denoising, dereverberation, and bandwidth extension. Compared to\nexisting phase-aware speech enhancement methods, it successfully avoids the\nbidirectional compensation effect between the magnitude and phase, leading to a\nbetter harmonic restoration. Notably, for the speech denoising task, the\nMP-SENet yields a state-of-the-art performance with a PESQ of 3.60 on the\npublic VoiceBank+DEMAND dataset.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:37:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Ye-Xin",""],["Ai","Yang",""],["Ling","Zhen-Hua",""]]}
{"id":"2308.08927","submitter":"Jingshan Chen","authors":"Jingshan Chen, Chongning Wang, Lei Zhang","title":"On canonical bundle formula for fibrations of curves with arithmetic\n  genus one","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we develop canonical bundle formulas for fibrations of\nrelative dimension one in characteristic $p>0$. For such a fibration from a log\npair $f\\colon (X, \\Delta) \\to S$, if $f$ is separable, we can obtain a formula\nsimilar to the one due to Witaszek \\cite{Wit21}; if $f$ is inseparable, we\ntreat the case when $S$ is of maximal Albanese dimension. As an application, we\nprove that for a klt pair $(X,\\Delta)$ with $-(K_X+\\Delta)$ nef, if the\nAlbanese morphism $a_X\\colon X \\to A$ is of relative dimension one, then $X$ is\na fiber space over $A$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:38:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Jingshan",""],["Wang","Chongning",""],["Zhang","Lei",""]]}
{"id":"2308.08928","submitter":"Isabell Piantschitsch","authors":"I. Piantschitsch, J. Terradas, E. Soubrie, S.G. Heinemann, S.J.\n  Hofmeister, R. Soler, and M. Temmer","title":"The role of initial density profiles in simulations of coronal wave -\n  coronal hole interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Interactions between global coronal waves (CWs) and coronal holes (CHs)\nreveal many interesting features of reflected waves and coronal hole boundaries\n(CHB) but have fairly been studied so far. Magnetohydrodynamic (MHD)\nsimulations can help us to better understand what is happening during these\ninteraction events, and therefore, to achieve a broader understanding of the\nparameters involved. In this study, we perform for the first time 2D MHD\nsimulations of a CW-CH interaction including a realistic initial wave density\nprofile that consists of an enhanced as well as a depleted wave part. We vary\nseveral initial parameters, such as the initial density amplitudes of the\nincoming wave, the CH density, and the CHB width, which are all based on actual\nmeasurements. We analyse the effects of different incident angles on the\ninteraction features and we use the corresponding time-distance plots to detect\nspecific features of the incoming and the reflected wave. We found that a\nparticular combination of a small CH density, a realistic initial density\nprofile and a sufficiently small incident angle leads to remarkable interaction\nfeatures, such as a large density amplitude of the reflected wave with respect\nto the incoming one. The parameter studies in this paper provide a tool to\ncompare time-distance plots based on observational measurements to those\ncreated from simulations and therefore enable us to derive interaction\nparameters from observed CW-CH interaction events that usually cannot be\nobtained directly. The simulation results in this study are augmented by\nanalytical expressions for the reflection coefficient of the CW-CH interaction\nwhich allows us to verify the simulations results in an additional way. This\nwork is the first of a series of studies aiming to finally reconstruct actual\nobserved CW-CH interaction events by means of MHD-simulations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:49:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Piantschitsch","I.",""],["Terradas","J.",""],["Soubrie","E.",""],["Heinemann","S. G.",""],["Hofmeister","S. J.",""],["Soler","R.",""],["Temmer","M.",""]]}
{"id":"2308.08929","submitter":"Gergely Hajdu","authors":"Johanna Jurcsik, Gergely Hajdu","title":"Photometric metallicities of fundamental-mode RR Lyr stars from Gaia\n  $G$-band photometry of globular-cluster variables","comments":"MNRAS, accepted","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":"  Photometric metallicity formulae of fundamental-mode RR Lyr (RRab) stars are\npresented using globular-cluster data exclusively. The aim is to check whether\nthis selection may help increasing the overall accuracy of the fits and\neliminating the systematic bias of the photometric results, namely that they\ntend to overestimate [Fe/H] of the most metal-poor variables. The $G$-band\ntime-series data available in the Gaia DR3 archive and a new compilation of the\npublished spectroscopic globular cluster [Fe/H] values on a uniform solar\nreference metallicity scale are utilized. We have derived a new\n${\\mathrm{[Fe/H]}}_{\\mathrm{phot}}- P,\\varphi_{31}$ formula, and have diagnosed\nthat no significant increase in the accuracy of the fit can be achieved using\nnon-linear or multi-parameter formulae. The best result is obtained when\ndifferent formulae are applied for variables with Oosterhoff-type I and II\nproperties. However, even this solution cannot eliminate the systematic bias of\nthe results completely. This separation of the variables has also led to the\nconclusion that the photometric estimates of the [Fe/H] are less reliable for\nthe Oo-type II variables than for the Oo-type I sample. Published\n${\\mathrm{[Fe/H]}}_{\\mathrm{phot}}$ values and the results of the available\nphotometric formulae in the Gaia $G$-band are compared with the present\nresults. It is found that each of the solutions yields very similar results,\nwith similar accuracy and systematic biases. Major differences are detected\nonly in the zero-points of the [Fe/H] scales, and these offsets are larger than\ndifferences in the accepted solar reference values would explain.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:49:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jurcsik","Johanna",""],["Hajdu","Gergely",""]]}
{"id":"2308.08930","submitter":"Runmin Cong","authors":"Runmin Cong, Hongyu Liu, Chen Zhang, Wei Zhang, Feng Zheng, Ran Song,\n  and Sam Kwong","title":"Point-aware Interaction and CNN-induced Refinement Network for RGB-D\n  Salient Object Detection","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  By integrating complementary information from RGB image and depth map, the\nability of salient object detection (SOD) for complex and challenging scenes\ncan be improved. In recent years, the important role of Convolutional Neural\nNetworks (CNNs) in feature extraction and cross-modality interaction has been\nfully explored, but it is still insufficient in modeling global long-range\ndependencies of self-modality and cross-modality. To this end, we introduce\nCNNs-assisted Transformer architecture and propose a novel RGB-D SOD network\nwith Point-aware Interaction and CNN-induced Refinement (PICR-Net). On the one\nhand, considering the prior correlation between RGB modality and depth\nmodality, an attention-triggered cross-modality point-aware interaction (CmPI)\nmodule is designed to explore the feature interaction of different modalities\nwith positional constraints. On the other hand, in order to alleviate the block\neffect and detail destruction problems brought by the Transformer naturally, we\ndesign a CNN-induced refinement (CNNR) unit for content refinement and\nsupplementation. Extensive experiments on five RGB-D SOD datasets show that the\nproposed network achieves competitive results in both quantitative and\nqualitative comparisons.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:57:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cong","Runmin",""],["Liu","Hongyu",""],["Zhang","Chen",""],["Zhang","Wei",""],["Zheng","Feng",""],["Song","Ran",""],["Kwong","Sam",""]]}
{"id":"2308.08931","submitter":"Zhuocheng Xie","authors":"W. Luo, C. Gasper, S. Zhang, P. L. Sun, Z. Xie, S. Korte-Kerzel","title":"Origins of limited non-basal plasticity in {\\mu}-phase at room\n  temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We unveil a new non-basal slip mechanism in the {\\mu}-phase at room\ntemperature using nanomechanical testing, transmission electron microscopy and\natomistic simulations. The (1-105) planar faults with a displacement vector of\n0.07[-5502] can be formed by dislocation glide. They do not disrupt the\nFrank-Kasper packing and therefore enable the accommodation of plastic strain\nat low temperatures without requiring atomic diffusion. The intersections\nbetween the (1-105) planar faults and basal slip result in stress concentration\nand crack nucleation during loading.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:58:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","W.",""],["Gasper","C.",""],["Zhang","S.",""],["Sun","P. L.",""],["Xie","Z.",""],["Korte-Kerzel","S.",""]]}
{"id":"2308.08932","submitter":"S\\'ergio S. Rodrigues","authors":"Karl Kunisch and S\\'ergio S. Rodrigues and Daniel Walter","title":"Stabilizability for nonautonomous linear parabolic equations with\n  actuators as distributions","comments":"7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The stabilizability of a general class of abstract parabolic-like equations\nis investigated, with a finite number of actuators. This class includes the\ncase of actuators given as delta distributions located at given points in the\nspatial domain of concrete parabolic equations. A stabilizing feedback control\noperator is constructed and given in explicit form. Then, an associated optimal\ncontrol is considered and the corresponding Riccati feedback is investigated.\nResults of simulations are presented showing the stabilizing performance of\nboth explicit and Riccati feedbacks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:00:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kunisch","Karl",""],["Rodrigues","S\u00e9rgio S.",""],["Walter","Daniel",""]]}
{"id":"2308.08933","submitter":"Mahmoud Ibrahim Mr","authors":"Mahmoud A. E. Ibrahim, X. LiU and J. P\\'erez-R\\'ios","title":"Spectroscopic constants from atomic properties: a machine learning\n  approach","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 machine-learning approach toward predicting spectroscopic\nconstants based on atomic properties. After collecting spectroscopic\ninformation on diatomics and generating an extensive database, we employ\nGaussian process regression to identify the most efficient characterization of\nmolecules to predict the equilibrium distance, vibrational harmonic frequency,\nand dissociation energy. As a result, we show that it is possible to predict\nthe equilibrium distance with an absolute error of 0.04 {\\AA} and vibrational\nharmonic frequency with an absolute error of 36 $\\text{cm}^{-1}$, including\nonly atomic properties. These results can be improved by including prior\ninformation on molecular properties leading to an absolute error of 0.02 {\\AA}\nand 28 $\\text{cm}^{-1}$ for the equilibrium distance and vibrational harmonic\nfrequency, respectively. In contrast, the dissociation energy is predicted with\nan absolute error $\\lesssim 0.4$ eV. Alongside these results, we prove that it\nis possible to predict spectroscopic constants of homonuclear molecules from\nthe atomic and molecular properties of heteronuclear. Finally, based on our\nresults, we present a new way to classify diatomic molecules beyond chemical\nbond properties.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:03:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ibrahim","Mahmoud A. E.",""],["LiU","X.",""],["P\u00e9rez-R\u00edos","J.",""]]}
{"id":"2308.08934","submitter":"Limin Wang","authors":"Limin Wang, Masatoshi Hanai, Toyotaro Suzumura, Shun Takashige,\n  Kenjiro Taura","title":"On Data Imbalance in Molecular Property Prediction with Pre-training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Revealing and analyzing the various properties of materials is an essential\nand critical issue in the development of materials, including batteries,\nsemiconductors, catalysts, and pharmaceuticals. Traditionally, these properties\nhave been determined through theoretical calculations and simulations. However,\nit is not practical to perform such calculations on every single candidate\nmaterial. Recently, a combination method of the theoretical calculation and\nmachine learning has emerged, that involves training machine learning models on\na subset of theoretical calculation results to construct a surrogate model that\ncan be applied to the remaining materials. On the other hand, a technique\ncalled pre-training is used to improve the accuracy of machine learning models.\nPre-training involves training the model on pretext task, which is different\nfrom the target task, before training the model on the target task. This\nprocess aims to extract the input data features, stabilizing the learning\nprocess and improving its accuracy. However, in the case of molecular property\nprediction, there is a strong imbalance in the distribution of input data and\nfeatures, which may lead to biased learning towards frequently occurring data\nduring pre-training. In this study, we propose an effective pre-training method\nthat addresses the imbalance in input data. We aim to improve the final\naccuracy by modifying the loss function of the existing representative\npre-training method, node masking, to compensate the imbalance. We have\ninvestigated and assessed the impact of our proposed imbalance compensation on\npre-training and the final prediction accuracy through experiments and\nevaluations using benchmark of molecular property prediction models.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:04:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Limin",""],["Hanai","Masatoshi",""],["Suzumura","Toyotaro",""],["Takashige","Shun",""],["Taura","Kenjiro",""]]}
{"id":"2308.08935","submitter":"Runmin Cong","authors":"Runmin Cong, Yuchen Guan, Jinpeng Chen, Wei Zhang, Yao Zhao, and Sam\n  Kwong","title":"SDDNet: Style-guided Dual-layer Disentanglement Network for Shadow\n  Detection","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Despite significant progress in shadow detection, current methods still\nstruggle with the adverse impact of background color, which may lead to errors\nwhen shadows are present on complex backgrounds. Drawing inspiration from the\nhuman visual system, we treat the input shadow image as a composition of a\nbackground layer and a shadow layer, and design a Style-guided Dual-layer\nDisentanglement Network (SDDNet) to model these layers independently. To\nachieve this, we devise a Feature Separation and Recombination (FSR) module\nthat decomposes multi-level features into shadow-related and background-related\ncomponents by offering specialized supervision for each component, while\npreserving information integrity and avoiding redundancy through the\nreconstruction constraint. Moreover, we propose a Shadow Style Filter (SSF)\nmodule to guide the feature disentanglement by focusing on style\ndifferentiation and uniformization. With these two modules and our overall\npipeline, our model effectively minimizes the detrimental effects of background\ncolor, yielding superior performance on three public datasets with a real-time\ninference speed of 32 FPS.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:10:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cong","Runmin",""],["Guan","Yuchen",""],["Chen","Jinpeng",""],["Zhang","Wei",""],["Zhao","Yao",""],["Kwong","Sam",""]]}
{"id":"2308.08936","submitter":"Hansong Xiao","authors":"Hansong Xiao","title":"Estimating fire Duration using regression methods","comments":"15pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wildfire forecasting problems usually rely on complex grid-based mathematical\nmodels, mostly involving Computational fluid dynamics(CFD) and Celluar\nAutomata, but these methods have always been computationally expensive and\ndifficult to deliver a fast decision pattern. In this paper, we provide machine\nlearning based approaches that solve the problem of high computational effort\nand time consumption. This paper predicts the burning duration of a known\nwildfire by RF(random forest), KNN, and XGBoost regression models and also\nimage-based, like CNN and Encoder. Model inputs are based on the map of\nlandscape features provided by satellites and the corresponding historical fire\ndata in this area. This model is trained by happened fire data and landform\nfeature maps and tested with the most recent real value in the same area. By\nprocessing the input differently to obtain the optimal outcome, the system is\nable to make fast and relatively accurate future predictions based on landscape\nimages of known fires.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:11:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xiao","Hansong",""]]}
{"id":"2308.08937","submitter":"Nathan O'Malley","authors":"Kaiyi Wu, Nathan P. O'Malley, Saleha Fatema, Cong Wang, Marcello\n  Girardi, Mohammed S. Alshaykh, Zhichao Ye, Daniel E. Leaird, Minghao Qi,\n  Victor Torres-Company, Andrew M. Weiner","title":"Vernier Microcombs for Integrated Optical Atomic Clocks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CMOS-compatible Kerr microcombs have drawn substantial interest as\nmass-manufacturable, compact alternatives to bulk frequency combs. This could\nenable deployment of many comb-reliant applications previously confined to\nlaboratories. Particularly enticing is the prospect of microcombs performing\noptical frequency division in compact optical atomic clocks. Unfortunately, it\nis difficult to meet the self-referencing requirement of microcombs in these\nsystems due to the $\\sim$THz repetition rates typically required for\noctave-spanning comb generation. Additionally, it is challenging to spectrally\nengineer a microcomb system to align a comb mode with an atomic clock\ntransition with sufficient signal-to-noise ratio. Here, we adopt a Vernier\ndual-microcomb scheme for optical frequency division of a stabilized\nultranarrow-linewidth continuous-wave laser at 871 nm to a $\\sim$235 MHz output\nfrequency. In addition to enabling measurement of the comb repetition rates,\nthis scheme brings the freedom to pick comb lines from either or both of the\ncombs. We exploit this flexibility to shift an ultra-high-frequency ($\\sim$100\nGHz) carrier-envelope offset beat down to frequencies where detection is\npossible and to place a comb line close to the 871 nm laser - tuned so that if\nfrequency-doubled it would fall close to the clock transition in\n$^{171}$Yb$^+$. Moreover, we introduce a novel scheme which suppresses\nfrequency noise arising from interferometric phase fluctuations in our\ndual-comb system and reduces the frequency instability down to our measurement\nlimit. Our dual-comb system can potentially combine with an integrated ion trap\ntoward future chip-scale optical atomic clocks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:16:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Kaiyi",""],["O'Malley","Nathan P.",""],["Fatema","Saleha",""],["Wang","Cong",""],["Girardi","Marcello",""],["Alshaykh","Mohammed S.",""],["Ye","Zhichao",""],["Leaird","Daniel E.",""],["Qi","Minghao",""],["Torres-Company","Victor",""],["Weiner","Andrew M.",""]]}
{"id":"2308.08938","submitter":"Ahmad Reza Ehyaei","authors":"Ahmad-Reza Ehyaei, Kiarash Mohammadi, Amir-Hossein Karimi, Samira\n  Samadi, Golnoosh Farnadi","title":"Causal Adversarial Perturbations for Individual Fairness and Robustness\n  in Heterogeneous Data Spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As responsible AI gains importance in machine learning algorithms, properties\nsuch as fairness, adversarial robustness, and causality have received\nconsiderable attention in recent years. However, despite their individual\nsignificance, there remains a critical gap in simultaneously exploring and\nintegrating these properties. In this paper, we propose a novel approach that\nexamines the relationship between individual fairness, adversarial robustness,\nand structural causal models in heterogeneous data spaces, particularly when\ndealing with discrete sensitive attributes. We use causal structural models and\nsensitive attributes to create a fair metric and apply it to measure semantic\nsimilarity among individuals. By introducing a novel causal adversarial\nperturbation and applying adversarial training, we create a new regularizer\nthat combines individual fairness, causality, and robustness in the classifier.\nOur method is evaluated on both real-world and synthetic datasets,\ndemonstrating its effectiveness in achieving an accurate classifier that\nsimultaneously exhibits fairness, adversarial robustness, and causal awareness.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:16:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ehyaei","Ahmad-Reza",""],["Mohammadi","Kiarash",""],["Karimi","Amir-Hossein",""],["Samadi","Samira",""],["Farnadi","Golnoosh",""]]}
{"id":"2308.08939","submitter":"S{\\o}ren Knudsen","authors":"S{\\o}ren Knudsen, Mathilde Bech Bennetsen, Terese Kimmie H{\\o}j,\n  Camilla Jensen, Rebecca Louise N{\\o}rskov J{\\o}rgensen, Christian S{\\o}e Loft","title":"Reflections on Designing and Running Visualization Design and\n  Programming Activities in Courses with Many Students","comments":"To appear in the proceedings of the IEEE VIS 2023 Workshop on\n  Visualization Education, Literacy, and Activities","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we reflect on the educational challenges and research\nopportunities in running data visualization design activities in the context of\nlarge courses. With the increasing number and sizes of data visualization\ncourse, we need to better understand approaches to scaling our teaching\nefforts. We draw on experiences organizing and facilitating activities\nprimarily based on one instance of a master's course given to about 130\nstudents. We provide a detailed account of the course with particular focus on\nthe purpose, structure, and outcome of six two-hour design activities. Based on\nthis, we reflect on three aspects of the course: First, how the course scale\nled us to thoroughly plan, evaluate, and revise communication between students,\nteaching assistants, and lecturers. Second, how we designed learning scaffolds\nthrough the design activities, and the reflections we received from students on\nthis matter. Finally, we reflect on the diversity of the students that followed\nthe course, the visualization exercises we used, the projects they worked on,\nand when to key in on simple boring problems and data sets. Thus, our paper\ncontributes with discussions about balancing topical diversity, scaling courses\nto many students, and problem-based learning.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:19:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Knudsen","S\u00f8ren",""],["Bennetsen","Mathilde Bech",""],["H\u00f8j","Terese Kimmie",""],["Jensen","Camilla",""],["J\u00f8rgensen","Rebecca Louise N\u00f8rskov",""],["Loft","Christian S\u00f8e",""]]}
{"id":"2308.08940","submitter":"Guillaume Tahar","authors":"Kai Fu, Guillaume Tahar","title":"Bounds on saddle connections for flat spheres","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a flat metric with conical singularities on the sphere. Assuming\nno partial sum of angle defects is equal to $2\\pi$, we draw on the geometry of\nimmersed disks to obtain an explicit upper bound on the number of saddle\nconnections with at most $k$ self-intersections. We also deduce a bound on\ntheir lengths for a surface with a normalized area.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:20:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fu","Kai",""],["Tahar","Guillaume",""]]}
{"id":"2308.08941","submitter":"Priyanka Choudhary","authors":"Manas Kagde, Priyanka Choudhary, Rishi Joshi and Somnath Dey","title":"Automatic Signboard Recognition in Low Quality Night Images","comments":"13 pages, CVIP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An essential requirement for driver assistance systems and autonomous driving\ntechnology is implementing a robust system for detecting and recognizing\ntraffic signs. This system enables the vehicle to autonomously analyze the\nenvironment and make appropriate decisions regarding its movement, even when\noperating at higher frame rates. However, traffic sign images captured in\ninadequate lighting and adverse weather conditions are poorly visible, blurred,\nfaded, and damaged. Consequently, the recognition of traffic signs in such\ncircumstances becomes inherently difficult. This paper addressed the challenges\nof recognizing traffic signs from images captured in low light, noise, and\nblurriness. To achieve this goal, a two-step methodology has been employed. The\nfirst step involves enhancing traffic sign images by applying a modified MIRNet\nmodel and producing enhanced images. In the second step, the Yolov4 model\nrecognizes the traffic signs in an unconstrained environment. The proposed\nmethod has achieved 5.40% increment in mAP@0.5 for low quality images on\nYolov4. The overall mAP@0.5 of 96.75% has been achieved on the GTSRB dataset.\nIt has also attained mAP@0.5 of 100% on the GTSDB dataset for the broad\ncategories, comparable with the state-of-the-art work.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:26:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kagde","Manas",""],["Choudhary","Priyanka",""],["Joshi","Rishi",""],["Dey","Somnath",""]]}
{"id":"2308.08942","submitter":"Chenxin Xu","authors":"Chenxin Xu, Robby T. Tan, Yuhong Tan, Siheng Chen, Xinchao Wang,\n  Yanfeng Wang","title":"Auxiliary Tasks Benefit 3D Skeleton-based Human Motion Prediction","comments":"Accpeted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Exploring spatial-temporal dependencies from observed motions is one of the\ncore challenges of human motion prediction. Previous methods mainly focus on\ndedicated network structures to model the spatial and temporal dependencies.\nThis paper considers a new direction by introducing a model learning framework\nwith auxiliary tasks. In our auxiliary tasks, partial body joints' coordinates\nare corrupted by either masking or adding noise and the goal is to recover\ncorrupted coordinates depending on the rest coordinates. To work with auxiliary\ntasks, we propose a novel auxiliary-adapted transformer, which can handle\nincomplete, corrupted motion data and achieve coordinate recovery via capturing\nspatial-temporal dependencies. Through auxiliary tasks, the auxiliary-adapted\ntransformer is promoted to capture more comprehensive spatial-temporal\ndependencies among body joints' coordinates, leading to better feature\nlearning. Extensive experimental results have shown that our method outperforms\nstate-of-the-art methods by remarkable margins of 7.2%, 3.7%, and 9.4% in terms\nof 3D mean per joint position error (MPJPE) on the Human3.6M, CMU Mocap, and\n3DPW datasets, respectively. We also demonstrate that our method is more robust\nunder data missing cases and noisy data cases. Code is available at\nhttps://github.com/MediaBrain-SJTU/AuxFormer.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:26:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Chenxin",""],["Tan","Robby T.",""],["Tan","Yuhong",""],["Chen","Siheng",""],["Wang","Xinchao",""],["Wang","Yanfeng",""]]}
{"id":"2308.08943","submitter":"Antonio Mastropaolo","authors":"Antonio Mastropaolo, Massimiliano Di Penta, Gabriele Bavota","title":"Towards Automatically Addressing Self-Admitted Technical Debt: How Far\n  Are We?","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":"  Upon evolving their software, organizations and individual developers have to\nspend a substantial effort to pay back technical debt, i.e., the fact that\nsoftware is released in a shape not as good as it should be, e.g., in terms of\nfunctionality, reliability, or maintainability. This paper empirically\ninvestigates the extent to which technical debt can be automatically paid back\nby neural-based generative models, and in particular models exploiting\ndifferent strategies for pre-training and fine-tuning. We start by extracting a\ndateset of 5,039 Self-Admitted Technical Debt (SATD) removals from 595\nopen-source projects. SATD refers to technical debt instances documented (e.g.,\nvia code comments) by developers. We use this dataset to experiment with seven\ndifferent generative deep learning (DL) model configurations. Specifically, we\ncompare transformers pre-trained and fine-tuned with different combinations of\ntraining objectives, including the fixing of generic code changes, SATD\nremovals, and SATD-comment prompt tuning. Also, we investigate the\napplicability in this context of a recently-available Large Language Model\n(LLM)-based chat bot. Results of our study indicate that the automated\nrepayment of SATD is a challenging task, with the best model we experimented\nwith able to automatically fix ~2% to 8% of test instances, depending on the\nnumber of attempts it is allowed to make. Given the limited size of the\nfine-tuning dataset (~5k instances), the model's pre-training plays a\nfundamental role in boosting performance. Also, the ability to remove SATD\nsteadily drops if the comment documenting the SATD is not provided as input to\nthe model. Finally, we found general-purpose LLMs to not be a competitive\napproach for addressing SATD.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:27:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mastropaolo","Antonio",""],["Di Penta","Massimiliano",""],["Bavota","Gabriele",""]]}
{"id":"2308.08944","submitter":"Maksim Zhukovskii","authors":"Michael Krivelevich, Maksim Zhukovskii","title":"Maximum chordal 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":"  We find asymptotics of the maximum size of a chordal subgraph in a binomial\nrandom graph $G(n,p)$, for $p=\\mathrm{const}$ and $p=n^{-\\alpha+o(1)}$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:29:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Krivelevich","Michael",""],["Zhukovskii","Maksim",""]]}
{"id":"2308.08945","submitter":"Amr Alkhatib","authors":"Amr Alkhatib, Sofiane Ennadir, Henrik Bostr\\\"om, Michalis Vazirgiannis","title":"Interpretable Graph Neural Networks for Tabular Data","comments":"18 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Data in tabular format is frequently occurring in real-world applications.\nGraph Neural Networks (GNNs) have recently been extended to effectively handle\nsuch data, allowing feature interactions to be captured through representation\nlearning. However, these approaches essentially produce black-box models, in\nthe form of deep neural networks, precluding users from following the logic\nbehind the model predictions. We propose an approach, called IGNNet\n(Interpretable Graph Neural Network for tabular data), which constrains the\nlearning algorithm to produce an interpretable model, where the model shows how\nthe predictions are exactly computed from the original input features. A\nlarge-scale empirical investigation is presented, showing that IGNNet is\nperforming on par with state-of-the-art machine-learning algorithms that target\ntabular data, including XGBoost, Random Forests, and TabNet. At the same time,\nthe results show that the explanations obtained from IGNNet are aligned with\nthe true Shapley values of the features without incurring any additional\ncomputational overhead.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:35:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alkhatib","Amr",""],["Ennadir","Sofiane",""],["Bostr\u00f6m","Henrik",""],["Vazirgiannis","Michalis",""]]}
{"id":"2308.08946","submitter":"Alejandro Ram\\'irez-Arroyo","authors":"Alejandro Ram\\'irez-Arroyo, Melisa L\\'opez, Ignacio Rodr\\'iguez,\n  Troels B. S{\\o}rensen, Samantha Caporal del Barrio, Pablo Padilla, Juan F.\n  Valenzuela-Vald\\'es, Preben Mogensen","title":"FR2 5G Networks for Industrial Scenarios: An Experimental\n  Characterization and Beam Management Procedures in Operational Conditions","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Industrial environments constitute a challenge in terms of radio propagation\ndue to the presence of machinery and the mobility of the different agents,\nespecially at mmWave bands. This paper presents an experimental evaluation of a\nFR2 5G network deployed in an operational factory scenario at 26 GHz. The\nexperimental characterization, performed with autonomous mobile robots that\nself-navigate the industrial lab, leads to the analysis of the received power\nalong the factory and the evaluation of reference path gain models. The\nproposed assessment deeply analyzes the physical layer of the communication\nnetwork under operational conditions. Thus, two different network\nconfigurations are assessed by measuring the power received in the entire\nfactory, providing a comparison between deployments. Additionally, beam\nmanagement procedures, such as beam recovery, beam sweeping or beam switching,\nare analyzed since they are crucial in environments where mobile agents are\ninvolved. They aim for a zero interruption approach based on reliable\ncommunications. The results analysis shows that beam recovery procedures can\nperform a beam switching to an alternative serving beam with power losses of\nless than 1.6 dB on average. Beam sweeping analysis demonstrates the prevalence\nof the direct component in Line-of-Sight conditions despite the strong\nscattering component and large-scale fading in the environment.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:35:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ram\u00edrez-Arroyo","Alejandro",""],["L\u00f3pez","Melisa",""],["Rodr\u00edguez","Ignacio",""],["S\u00f8rensen","Troels B.",""],["del Barrio","Samantha Caporal",""],["Padilla","Pablo",""],["Valenzuela-Vald\u00e9s","Juan F.",""],["Mogensen","Preben",""]]}
{"id":"2308.08947","submitter":"Ashkan Mirzaei","authors":"Ashkan Mirzaei, Tristan Aumentado-Armstrong, Marcus A. Brubaker,\n  Jonathan Kelly, Alex Levinshtein, Konstantinos G. Derpanis, Igor\n  Gilitschenski","title":"Watch Your Steps: Local Image and Scene Editing by Text Instructions","comments":"Project page: https://ashmrz.github.io/WatchYourSteps/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Denoising diffusion models have enabled high-quality image generation and\nediting. We present a method to localize the desired edit region implicit in a\ntext instruction. We leverage InstructPix2Pix (IP2P) and identify the\ndiscrepancy between IP2P predictions with and without the instruction. This\ndiscrepancy is referred to as the relevance map. The relevance map conveys the\nimportance of changing each pixel to achieve the edits, and is used to to guide\nthe modifications. This guidance ensures that the irrelevant pixels remain\nunchanged. Relevance maps are further used to enhance the quality of\ntext-guided editing of 3D scenes in the form of neural radiance fields. A field\nis trained on relevance maps of training views, denoted as the relevance field,\ndefining the 3D region within which modifications should be made. We perform\niterative updates on the training views guided by rendered relevance maps from\nthe relevance field. Our method achieves state-of-the-art performance on both\nimage and NeRF editing tasks. Project page:\nhttps://ashmrz.github.io/WatchYourSteps/\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:39:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mirzaei","Ashkan",""],["Aumentado-Armstrong","Tristan",""],["Brubaker","Marcus A.",""],["Kelly","Jonathan",""],["Levinshtein","Alex",""],["Derpanis","Konstantinos G.",""],["Gilitschenski","Igor",""]]}
{"id":"2308.08948","submitter":"Deepak Pathak","authors":"Deepak Pathak, Miro Miranda, Francisco Mena, Cristhian Sanchez,\n  Patrick Helber, Benjamin Bischke, Peter Habelitz, Hiba Najjar, Jayanth\n  Siddamsetty, Diego Arenas, Michaela Vollmer, Marcela Charfuelan, Marlon\n  Nuske, Andreas Dengel","title":"Predicting Crop Yield With Machine Learning: An Extensive Analysis Of\n  Input Modalities And Models On a Field and sub-field Level","comments":"4 pages, 1 figure, 3 tables, IEEE IGARSS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a simple yet effective early fusion method for crop yield\nprediction that handles multiple input modalities with different temporal and\nspatial resolutions. We use high-resolution crop yield maps as ground truth\ndata to train crop and machine learning model agnostic methods at the sub-field\nlevel. We use Sentinel-2 satellite imagery as the primary modality for input\ndata with other complementary modalities, including weather, soil, and DEM\ndata. The proposed method uses input modalities available with global coverage,\nmaking the framework globally scalable. We explicitly highlight the importance\nof input modalities for crop yield prediction and emphasize that the\nbest-performing combination of input modalities depends on region, crop, and\nchosen model.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:40:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pathak","Deepak",""],["Miranda","Miro",""],["Mena","Francisco",""],["Sanchez","Cristhian",""],["Helber","Patrick",""],["Bischke","Benjamin",""],["Habelitz","Peter",""],["Najjar","Hiba",""],["Siddamsetty","Jayanth",""],["Arenas","Diego",""],["Vollmer","Michaela",""],["Charfuelan","Marcela",""],["Nuske","Marlon",""],["Dengel","Andreas",""]]}
{"id":"2308.08949","submitter":"Yawei Li","authors":"Yawei Li, Yang Zhang, Kenji Kawaguchi, Ashkan Khakzar, Bernd Bischl,\n  Mina Rezaei","title":"A Dual-Perspective Approach to Evaluating Feature Attribution Methods","comments":"16 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Feature attribution methods attempt to explain neural network predictions by\nidentifying relevant features. However, establishing a cohesive framework for\nassessing feature attribution remains a challenge. There are several views\nthrough which we can evaluate attributions. One principal lens is to observe\nthe effect of perturbing attributed features on the model's behavior (i.e.,\nfaithfulness). While providing useful insights, existing faithfulness\nevaluations suffer from shortcomings that we reveal in this paper. In this\nwork, we propose two new perspectives within the faithfulness paradigm that\nreveal intuitive properties: soundness and completeness. Soundness assesses the\ndegree to which attributed features are truly predictive features, while\ncompleteness examines how well the resulting attribution reveals all the\npredictive features. The two perspectives are based on a firm mathematical\nfoundation and provide quantitative metrics that are computable through\nefficient algorithms. We apply these metrics to mainstream attribution methods,\noffering a novel lens through which to analyze and compare feature attribution\nmethods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:41:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Yawei",""],["Zhang","Yang",""],["Kawaguchi","Kenji",""],["Khakzar","Ashkan",""],["Bischl","Bernd",""],["Rezaei","Mina",""]]}
{"id":"2308.08950","submitter":"\\'Oscar L\\'opez Pouso","authors":"\\'Oscar L\\'opez Pouso and Javier Segura","title":"Analysis of difference schemes for the Fokker-Planck angular diffusion\n  operator","comments":"35 pages, 1 figure, 2 subfigures","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 is dedicated to the mathematical analysis of finite difference\nschemes for the angular diffusion operator present in the azimuth-independent\nFokker-Planck equation. The study elucidates the reasons behind the lack of\nconvergence in half range mode for certain widely recognized discrete ordinates\nmethods, and establishes sets of sufficient conditions to ensure that the\nschemes achieve convergence of order $2$. In the process, interesting\nproperties regarding Gaussian nodes and weights, which until now have remained\nunnoticed by mathematicians, naturally emerge.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:41:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pouso","\u00d3scar L\u00f3pez",""],["Segura","Javier",""]]}
{"id":"2308.08951","submitter":"Alberto Raffero","authors":"Anna Fino, Alberto Raffero","title":"An example of homogeneous soliton of gradient type for the\n  G$_2$-Laplacian flow","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 short note, we exhibit the first known example of homogeneous soliton\nof gradient type for the G$_2$-Laplacian flow.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:44:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fino","Anna",""],["Raffero","Alberto",""]]}
{"id":"2308.08952","submitter":"Xin Gui","authors":"Gina Angelo, Jeremy G. Philbrick, Jian Zhang, Tai Kong, Xin Gui","title":"Magnetic Order and Crystallographic Disorder in Cu-Doped MnBi Crystals","comments":"30 pages, 10 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Permanent magnets are of great importance due to their vast applications.\nMnBi has been proposed to be a potential permanent magnet that can be widely\nused while past efforts have been focused on optimizing the ferromagnetic\nlow-temperature phase of MnBi. Herein, we report a series of new materials,\nCuxMn1-xBi, crystallizing in a high-temperature-phase (HTP) MnBi-related\nstructure. We synthesized single crystals of CuxMn1-xBi and found that they\ncrystallize in an unreported trigonal structure (P -31c). Magnetic properties\nmeasurements imply high-temperature antiferromagnetic (AFM) ordering and\nlow-temperature ferromagnetic or ferrimagnetic (FM/FiM) ordering. By analyzing\nthe doping effect on crystal structure and magnetic properties, we established\na magnetic phase diagram for Cu-doped MnBi and attributed the AFM and FM/FiM to\ntwo different atomic sites of Mn. The newly found materials can help interpret\nthe structure-magnetism relation in HTP-MnBi and open a new way for\ninvestigating future MnBi permanent magnets.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:44:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Angelo","Gina",""],["Philbrick","Jeremy G.",""],["Zhang","Jian",""],["Kong","Tai",""],["Gui","Xin",""]]}
{"id":"2308.08953","submitter":"Goran Durakovic","authors":"Goran Durakovic, Hongyu Zhang, Brage Rugstad Knudsen, Asgeir\n  Tomasgard, Pedro Crespo del Granado","title":"Decarbonizing the European energy system in the absence of Russian gas:\n  Hydrogen uptake and carbon capture developments in the power, heat and\n  industry sectors","comments":"39 pages, 7 figures, submitted to the Journal of Cleaner Production","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN math.OC q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogen and carbon capture and storage are pivotal to decarbonize the\nEuropean energy system in a broad range of pathway scenarios. Yet, their timely\nuptake in different sectors and distribution across countries are affected by\nsupply options of renewable and fossil energy sources. Here, we analyze the\ndecarbonization of the European energy system towards 2060, covering the power,\nheat, and industry sectors, and the change in use of hydrogen and carbon\ncapture and storage in these sectors upon Europe's decoupling from Russian gas.\nThe results indicate that the use of gas is significantly reduced in the power\nsector, instead being replaced by coal with carbon capture and storage, and\nwith a further expansion of renewable generators. Coal coupled with carbon\ncapture and storage is also used in the steel sector as an intermediary step\nwhen Russian gas is neglected, before being fully decarbonized with hydrogen.\nHydrogen production mostly relies on natural gas with carbon capture and\nstorage until natural gas is scarce and costly at which time green hydrogen\nproduction increases sharply. The disruption of Russian gas imports has\nsignificant consequences on the decarbonization pathways for Europe, with local\nenergy sources and carbon capture and storage becoming even more important.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:50:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Durakovic","Goran",""],["Zhang","Hongyu",""],["Knudsen","Brage Rugstad",""],["Tomasgard","Asgeir",""],["del Granado","Pedro Crespo",""]]}
{"id":"2308.08954","submitter":"Manoel Dos Santos","authors":"Manoel J. Dos Santos and Renato F. C. Lobato","title":"Upper semicontinuity of the attractor for a nonlinear\n  hyperbolic-parabolic coupled system with fractional Laplacian","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 establish the existence and uniqueness of global solutions\n(in time), as well as the existence, regularity and stability (upper\nsemicontinuity) of the attractor for the semigroup generated by the solutions\nof a two-dimensional nonlinear hyperbolic-parabolic coupled system with\nfractional Laplacian. In addition, we also obtain the existence of an\nexponential attractor and show that this attractor has a finite fractal\ndimension in a space containing the phase space of the dynamical system.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:50:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Santos","Manoel J. Dos",""],["Lobato","Renato F. C.",""]]}
{"id":"2308.08955","submitter":"Maximilian Knespel","authors":"Maximilian Knespel and Holger Brunst","title":"Rapidgzip: Parallel Decompression and Seeking in Gzip Files Using Cache\n  Prefetching","comments":"HPDC'23","journal-ref":null,"doi":"10.1145/3588195.3592992","report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gzip is a file compression format, which is ubiquitously used. Although a\nmultitude of gzip implementations exist, only pugz can fully utilize current\nmulti-core processor architectures for decompression. Yet, pugz cannot\ndecompress arbitrary gzip files. It requires the decompressed stream to only\ncontain byte values 9-126. In this work, we present a generalization of the\nparallelization scheme used by pugz that can be reliably applied to arbitrary\ngzip-compressed data without compromising performance. We show that the\nrequirements on the file contents posed by pugz can be dropped by implementing\nan architecture based on a cache and a parallelized prefetcher. This\narchitecture can safely handle faulty decompression results, which can appear\nwhen threads start decompressing in the middle of a gzip file by using trial\nand error. Using 128 cores, our implementation reaches 8.7 GB/s decompression\nbandwidth for gzip-compressed base64-encoded data, a speedup of 55 over the\nsingle-threaded GNU gzip, and 5.6 GB/s for the Silesia corpus, a speedup of 33\nover GNU gzip.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:54:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Knespel","Maximilian",""],["Brunst","Holger",""]]}
{"id":"2308.08956","submitter":"Emma Nilsson","authors":"Emma Nilsson, Jonas Lukasczyk, Talha Bin Masood, Christoph Garth,\n  Ingrid Hotz","title":"Probabilistic Gradient-Based Extrema Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Feature tracking is a common task in visualization applications, where\nmethods based on topological data analysis (TDA) have successfully been applied\nin the past for feature definition as well as tracking. In this work, we focus\non tracking extrema of temporal scalar fields. A family of TDA approaches\naddress this task by establishing one-to-one correspondences between extrema\nbased on discrete gradient vector fields. More specifically, two extrema of\nsubsequent time steps are matched if they fall into their respective ascending\nand descending manifolds. However, due to this one-to-one assignment, these\napproaches are prone to fail where, e.g., extrema are located in regions with\nlow gradient magnitude, or are located close to boundaries of the manifolds.\nTherefore, we propose a probabilistic matching that captures a larger set of\npossible correspondences via neighborhood sampling, or by computing the overlap\nof the manifolds. We illustrate the usefulness of the approach with two\napplication cases.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:55:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nilsson","Emma",""],["Lukasczyk","Jonas",""],["Masood","Talha Bin",""],["Garth","Christoph",""],["Hotz","Ingrid",""]]}
{"id":"2308.08957","submitter":"Igor Rogachevskii","authors":"N. Kleeorin, I. Rogachevskii, N. Safiullin, R. Gershberg, S. Porshnev","title":"Magnetic fields of low-mass main sequences stars: Nonlinear dynamo\n  theory and mean-field numerical simulations","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our theoretical and numerical analysis have suggested that for low-mass main\nsequences stars (of the spectral classes from M5 to G0) rotating much faster\nthan the sun, the generated large-scale magnetic field is caused by the\nmean-field $\\alpha^2\\Omega$ dynamo, whereby the $\\alpha^2$ dynamo is modified\nby a weak differential rotation. Even for a weak differential rotation, the\nbehaviour of the magnetic activity is changed drastically from aperiodic regime\nto nonlinear oscillations and appearance of a chaotic behaviour with increase\nof the differential rotation. Periods of the magnetic cycles decrease with\nincrease of the differential rotation, and they vary from tens to thousand\nyears. This long-term behaviour of the magnetic cycles may be related to the\ncharacteristic time of the evolution of the magnetic helicity density of the\nsmall-scale field. The performed analysis is based on the mean-field numerical\nsimulations of the $\\alpha^2\\Omega$ and $\\alpha^2$ dynamos and a developed\nnonlinear theory of $\\alpha^2$ dynamo.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:55:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kleeorin","N.",""],["Rogachevskii","I.",""],["Safiullin","N.",""],["Gershberg","R.",""],["Porshnev","S.",""]]}
{"id":"2308.08958","submitter":"Mikkel S{\\o}lvsten","authors":"Anna Mikusheva, Mikkel S{\\o}lvsten","title":"Linear Regression with Weak Exogeneity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies linear time series regressions with many regressors. Weak\nexogeneity is the most used identifying assumption in time series. Weak\nexogeneity requires the structural error to have zero conditional expectation\ngiven the present and past regressor values, allowing errors to correlate with\nfuture regressor realizations. We show that weak exogeneity in time series\nregressions with many controls may produce substantial biases and even render\nthe least squares (OLS) estimator inconsistent. The bias arises in settings\nwith many regressors because the normalized OLS design matrix remains\nasymptotically random and correlates with the regression error when only weak\n(but not strict) exogeneity holds. This bias's magnitude increases with the\nnumber of regressors and their average autocorrelation. To address this issue,\nwe propose an innovative approach to bias correction that yields a new\nestimator with improved properties relative to OLS. We establish consistency\nand conditional asymptotic Gaussianity of this new estimator and provide a\nmethod for inference.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:57:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mikusheva","Anna",""],["S\u00f8lvsten","Mikkel",""]]}
{"id":"2308.08959","submitter":"Mathias Drton","authors":"Jun Wu and Mathias Drton","title":"Partial Homoscedasticity in Causal Discovery with Linear Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recursive linear structural equation models and the associated directed\nacyclic graphs (DAGs) play an important role in causal discovery. The classic\nidentifiability result for this class of models states that when only\nobservational data is available, each DAG can be identified only up to a Markov\nequivalence class. In contrast, recent work has shown that the DAG can be\nuniquely identified if the errors in the model are homoscedastic, i.e., all\nhave the same variance. This equal variance assumption yields methods that, if\nappropriate, are highly scalable and also sheds light on fundamental\ninformation-theoretic limits and optimality in causal discovery. In this paper,\nwe fill the gap that exists between the two previously considered cases, which\nassume the error variances to be either arbitrary or all equal. Specifically,\nwe formulate a framework of partial homoscedasticity, in which the variables\nare partitioned into blocks and each block shares the same error variance. For\nany such groupwise equal variances assumption, we characterize when two DAGs\ngive rise to identical Gaussian linear structural equation models. Furthermore,\nwe show how the resulting distributional equivalence classes may be represented\nusing a completed partially directed acyclic graph (CPDAG), and we give an\nalgorithm to efficiently construct this CPDAG. In a simulation study, we\ndemonstrate that greedy search provides an effective way to learn the CPDAG and\nexploit partial knowledge about homoscedasticity of errors in structural\nequation models.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 12:59:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Jun",""],["Drton","Mathias",""]]}
{"id":"2308.08960","submitter":"Manuel C\\'aceres","authors":"Manuel C\\'aceres, Brendan Mumey, Santeri Toivonen and Alexandru I.\n  Tomescu","title":"Minimum Path Cover: The Power of Parameterization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a\nfundamental problem with a myriad of applications, including reachability.\nAlthough it is known how to solve the problem by a simple reduction to minimum\nflow, recent theoretical advances exploit this idea to obtain algorithms\nparameterized by the number of paths of an MPC, known as the width. These\nresults obtain fast [M\\\"akinen et al., TALG] and even linear time [C\\'aceres et\nal., SODA 2022] algorithms in the small-width regime.\n  In this paper, we present the first publicly available high-performance\nimplementation of state-of-the-art MPC algorithms, including the parameterized\napproaches. Our experiments on random DAGs show that parameterized algorithms\nare orders-of-magnitude faster on dense graphs. Additionally, we present new\npre-processing heuristics based on transitive edge sparsification. We show that\nour heuristics improve MPC-solvers by orders-of-magnitude.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:02:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["C\u00e1ceres","Manuel",""],["Mumey","Brendan",""],["Toivonen","Santeri",""],["Tomescu","Alexandru I.",""]]}
{"id":"2308.08961","submitter":"Mingsheng Jiao","authors":"Mingsheng Jiao, Tingrui Yu, Xuan Li, Guanjie Qiu, Xiaodong Gu, Beijun\n  Shen","title":"On the Evaluation of Neural Code Translation: Taxonomy and Benchmark","comments":"accepted by ASE2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, neural code translation has gained increasing attention.\nWhile most of the research focuses on improving model architectures and\ntraining processes, we notice that the evaluation process and benchmark for\ncode translation models are severely limited: they primarily treat source code\nas natural languages and provide a holistic accuracy score while disregarding\nthe full spectrum of model capabilities across different translation types and\ncomplexity. In this paper, we present a comprehensive investigation of four\nstate-of-the-art models and analyze in-depth the advantages and limitations of\nthree existing benchmarks. Based on the empirical results, we develop a\ntaxonomy that categorizes code translation tasks into four primary types\naccording to their complexity and knowledge dependence: token level (type 1),\nsyntactic level (type 2), library level (type 3), and algorithm level (type 4).\nWe then conduct a thorough analysis of how existing approaches perform across\nthese four categories. Our findings indicate that while state-of-the-art code\ntranslation models excel in type-1 and type-2 translations, they struggle with\nknowledge-dependent ones such as type-3 and type-4. Existing benchmarks are\nbiased towards trivial translations, such as keyword mapping. To overcome these\nlimitations, we construct G-TransEval, a new benchmark by manually curating\ntype-3 and type-4 translation pairs and unit test cases. Results on our new\nbenchmark suggest that G-TransEval can exhibit more comprehensive and\nfiner-grained capability of code translation models and thus provide a more\nrigorous evaluation. Our studies also provide more insightful findings and\nsuggestions for future research, such as building type-3 and type-4 training\ndata and ensembling multiple pretraining approaches.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:05:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiao","Mingsheng",""],["Yu","Tingrui",""],["Li","Xuan",""],["Qiu","Guanjie",""],["Gu","Xiaodong",""],["Shen","Beijun",""]]}
{"id":"2308.08962","submitter":"Daniel Tafoya Dr.","authors":"Daniel Tafoya, Peter A. M. van Hoof, Jesus A. Toala, Griet Van de\n  Steene, Suzanna Randall, Ramlal Unnikrishnan, Stefan Kimeswenger, Marcin\n  Hajduk, Daniela Barria and Albert Zijlstra","title":"The heart of Sakurai's Object revealed by ALMA","comments":"9 pages, 5 figures. Accepted for publication as a Letter in Astronomy\n  and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present high angular-resolution observations of Sakurai's object using the\nAtacama Large Millimeter Array, shedding new light on its morpho-kinematical\nstructure. The millimetre continuum emission, observed at an angular resolution\nof 20 milliarcsec (corresponding to 70 AU), reveals a bright compact central\ncomponent whose spectral index indicates that it composed of amorphous carbon\ndust. Based on these findings, we conclude that this emission traces the\npreviously suggested dust disc observed in mid-infrared observations.\nTherefore, our observations provide the first direct imaging of such a disc.\nThe H$^{12}$CN($J$=4$\\rightarrow$3) line emission, observed at an angular\nresolution of 300 milliarcsec (corresponding to 1000 AU), displays bipolar\nstructure with a north-south velocity gradient. From the position-velocity\ndiagram of this emission we identify the presence of an expanding disc and a\nbipolar molecular outflow. The inclination of the disc is determined to be\n$i$=72$^\\circ$. The derived values for the de-projected expansion velocity and\nthe radius of the disc are $v_{\\rm exp}$=53 km s$^{-1}$ and $R$=277 AU,\nrespectively. On the other hand, the de-projected expansion velocity of the\nbipolar outflow detected in the H$^{12}$CN($J$=4$\\rightarrow$3) emission of\napproximately 1000 km s$^{-1}$. We propose that the molecular outflow has an\nhourglass morphology with an opening angle of around 60$^{\\circ}$. Our\nobservations unambiguously show that an equatorial disc and bipolar outflows\nformed in Sakurai's object in less than 30 years after the born-again event\noccurred, providing important constraints for future modelling efforts of this\nphenomenon.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:06:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tafoya","Daniel",""],["van Hoof","Peter A. M.",""],["Toala","Jesus A.",""],["Van de Steene","Griet",""],["Randall","Suzanna",""],["Unnikrishnan","Ramlal",""],["Kimeswenger","Stefan",""],["Hajduk","Marcin",""],["Barria","Daniela",""],["Zijlstra","Albert",""]]}
{"id":"2308.08963","submitter":"Xihong Yang","authors":"Xihong Yang, Cheng Tan, Yue Liu, Ke Liang, Siwei Wang, Sihang Zhou,\n  Jun Xia, Stan Z. Li, Xinwang Liu, En Zhu","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contrastive graph node clustering via learnable data augmentation is a hot\nresearch spot in the field of unsupervised graph learning. The existing methods\nlearn the sampling distribution of a pre-defined augmentation to generate\ndata-driven augmentations automatically. Although promising clustering\nperformance has been achieved, we observe that these strategies still rely on\npre-defined augmentations, the semantics of the augmented graph can easily\ndrift. The reliability of the augmented view semantics for contrastive learning\ncan not be guaranteed, thus limiting the model performance. To address these\nproblems, we propose a novel CONtrastiVe Graph ClustEring network with Reliable\nAugmenTation (COVERT). Specifically, in our method, the data augmentations are\nprocessed by the proposed reversible perturb-recover network. It distills\nreliable semantic information by recovering the perturbed latent embeddings.\nMoreover, to further guarantee the reliability of semantics, a novel semantic\nloss is presented to constrain the network via quantifying the perturbation and\nrecovery. Lastly, a label-matching mechanism is designed to guide the model by\nclustering information through aligning the semantic labels and the selected\nhigh-confidence clustering pseudo labels. Extensive experimental results on\nseven datasets demonstrate the effectiveness of the proposed method. We release\nthe code and appendix of CONVERT at https://github.com/xihongyang1999/CONVERT\non GitHub.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:07:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Xihong",""],["Tan","Cheng",""],["Liu","Yue",""],["Liang","Ke",""],["Wang","Siwei",""],["Zhou","Sihang",""],["Xia","Jun",""],["Li","Stan Z.",""],["Liu","Xinwang",""],["Zhu","En",""]]}
{"id":"2308.08964","submitter":"Manuel Escudero L\\'opez","authors":"Manuel Escudero, Sabina Spiga, Mauro di Marco, Mauro Forti, Giacomo\n  Innocenti, Alberto Tesi, Fernando Corinto and Stefano Brivio","title":"Physical Implementation of a Tunable Memristor-based Chua's Circuit","comments":"Accepted by IEEE 48th European Solid State Circuits Conference\n  (ESSCIRC 2022)","journal-ref":null,"doi":"10.1109/ESSCIRC55480.2022.9911527","report-no":null,"categories":"cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nonlinearity is a central feature in demanding computing applications that\naim to deal with tasks such as optimization or classification. Furthermore, the\nconsensus is that nonlinearity should not be only exploited at the algorithm\nlevel, but also at the physical level by finding devices that incorporate\ndesired nonlinear features to physically implement energy, area and/or time\nefficient computing applications. Chaotic oscillators are one type of system\npowered by nonlinearity, which can be used for computing purposes. In this work\nwe present a physical implementation of a tunable Chua's circuit in which the\nnonlinear part is based on a nonvolatile memristive device. Device\ncharacterization and circuit analysis serve as guidelines to design the circuit\nand results prove the possibility to tune the circuit oscillatory response by\nelectrically programming the device.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:11:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Escudero","Manuel",""],["Spiga","Sabina",""],["di Marco","Mauro",""],["Forti","Mauro",""],["Innocenti","Giacomo",""],["Tesi","Alberto",""],["Corinto","Fernando",""],["Brivio","Stefano",""]]}
{"id":"2308.08965","submitter":"Ragni Piene","authors":"Alicia Dickenstein and Ragni Piene","title":"Interpolation of toric varieties","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X\\subset \\mathbb P^d$ be a $m$-dimensional variety in $d$-dimensional\nprojective space. Let $k$ be a positive integer such that $\\binom{m+k}k \\le d$.\nConsider the following interpolation problem: does there exist a variety\n$Y\\subset \\mathbb P^d$ of dimension $\\le \\binom{m+k}k -1$, with $X\\subset Y$,\nsuch that the tangent space to $Y$ at a point $p\\in X$ is equal to the $k$th\nosculating space to $X$ at $p$, for almost all points $p\\in X$? In this paper\nwe consider this question in the toric setting. We prove that if $X$ is toric,\nthen there is a unique toric variety $Y$ solving the above interpolation\nproblem. We identify $Y$ in the general case and we explicitly compute some of\nits invariants when $X$ is a toric curve.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:12:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dickenstein","Alicia",""],["Piene","Ragni",""]]}
{"id":"2308.08966","submitter":"Otfried Cheong","authors":"Otfried Cheong, Henry F\\\"orster, Julia Katheder, Maximilian Pfister,\n  Lena Schlipf","title":"Weakly and Strongly Fan-Planar 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":"math.CO cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study two notions of fan-planarity introduced by (Cheong et al., GD22),\ncalled weak and strong fan-planarity, which separate two non-equivalent\ndefinitions of fan-planarity in the literature. We prove that not every weakly\nfan-planar graph is strongly fan-planar, while the upper bound on the edge\ndensity is the same for both families.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:13:58 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 19:31:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Cheong","Otfried",""],["F\u00f6rster","Henry",""],["Katheder","Julia",""],["Pfister","Maximilian",""],["Schlipf","Lena",""]]}
{"id":"2308.08967","submitter":"Rafaela Correia Brum","authors":"Rafaela C. Brum, Maria Clicia Stelling de Castro, Luciana Arantes,\n  L\\'ucia Maria de A. Drummond, Pierre Sens","title":"Multi-FedLS: a Framework for Cross-Silo Federated Learning Applications\n  on Multi-Cloud Environments","comments":"In review by Journal of Parallel and Distributed Computing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a distributed Machine Learning (ML) technique that\ncan benefit from cloud environments while preserving data privacy. We propose\nMulti-FedLS, a framework that manages multi-cloud resources, reducing execution\ntime and financial costs of Cross-Silo Federated Learning applications by using\npreemptible VMs, cheaper than on-demand ones but that can be revoked at any\ntime. Our framework encloses four modules: Pre-Scheduling, Initial Mapping,\nFault Tolerance, and Dynamic Scheduler. This paper extends our previous work\n\\cite{brum2022sbac} by formally describing the Multi-FedLS resource manager\nframework and its modules. Experiments were conducted with three Cross-Silo FL\napplications on CloudLab and a proof-of-concept confirms that Multi-FedLS can\nbe executed on a multi-cloud composed by AWS and GCP, two commercial cloud\nproviders. Results show that the problem of executing Cross-Silo FL\napplications in multi-cloud environments with preemptible VMs can be\nefficiently resolved using a mathematical formulation, fault tolerance\ntechniques, and a simple heuristic to choose a new VM in case of revocation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:15:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brum","Rafaela C.",""],["de Castro","Maria Clicia Stelling",""],["Arantes","Luciana",""],["Drummond","L\u00facia Maria de A.",""],["Sens","Pierre",""]]}
{"id":"2308.08968","submitter":"Bin Chen","authors":"Bin Chen and Zhiwei Liang and Shen Li and Yi Lei and Gabriele Liga and\n  Alex Alvarado","title":"On the Performance of Multidimensional Constellation Shaping for Linear\n  and Nonlinear Optical Fiber Channel","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multidimensional constellation shaping of up to 32 dimensions with different\nspectral efficiencies are compared through AWGN and fiber-optic simulations.\nThe results show that no constellation is universal and the balance of required\nand effective SNRs should be jointly considered for the specific optical\ntransmission scenario.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:18:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Bin",""],["Liang","Zhiwei",""],["Li","Shen",""],["Lei","Yi",""],["Liga","Gabriele",""],["Alvarado","Alex",""]]}
{"id":"2308.08969","submitter":"Quentin Remy","authors":"Q. Remy","title":"Towards the second H.E.S.S. Galactic plane catalogue","comments":null,"journal-ref":null,"doi":"10.22323/1.444.0744","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The H.E.S.S. Galactic Plane Survey (HGPS), carried out between 2004 and 2013,\nis the most extensive survey of our Galaxy at very-high energies that covers\nthe southern sky. Since the first HPGS catalogue release, the new observations\naccumulated provide a deeper scan of many Galactic sources, and a number of\nimprovements have been made at various stages of the data processing chain,\nnotably on events reconstruction and background modeling techniques. In\nparallel a new catalog production workflow has been tested and optimized on\nsimulations done in preparation for the future Galactic Plane survey to be\nconducted by the Cherenkov Telescope Array (CTA). The development of a common\ndata format and open scientific tools for gamma-ray astronomy allowed a smooth\ntransition from the exploratory work done on CTA simulations to its application\nfor H.E.S.S. data analysis. These elements offered a solid ground to build the\nsecond H.E.S.S. Galactic Plane Survey catalogue (2HGPS). In the following we\nwill focus on the description of the catalogue workflow and show few results\nalong the way.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:19:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Remy","Q.",""]]}
{"id":"2308.08970","submitter":"Florian Stober","authors":"Florian Stober and Armin Wei{\\ss}","title":"Geodetic Graphs: Experiments and New Constructions","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":"  In 1962 Ore initiated the study of geodetic graphs. A graph is called\ngeodetic if the shortest path between every pair of vertices is unique. In the\nsubsequent years a wide range of papers appeared investigating their peculiar\nproperties. Yet, a complete classification of geodetic graphs is out of reach.\n  In this work we present a program enumerating all geodetic graphs of a given\nsize. Using our program, we succeed to find all geodetic graphs with up to 25\nvertices and all regular geodetic graphs with up to 32 vertices. This leads to\nthe discovery of two new infinite families of geodetic graphs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:20:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Stober","Florian",""],["Wei\u00df","Armin",""]]}
{"id":"2308.08971","submitter":"Anshima Singh","authors":"Anshima Singh and Sunil Kumar","title":"Error analysis of a high-order fully discrete method for two-dimensional\n  time-fractional convection-diffusion equations exhibiting weak initial\n  singularity","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study presents a novel high-order numerical method designed for solving\nthe two-dimensional time-fractional convection-diffusion (TFCD) equation. The\nCaputo definition is employed to characterize the time-fractional derivative. A\nweak singularity at the initial time ($t=0$) is encountered in the considered\nproblem, which is effectively managed by adopting a discretization approach for\nthe time-fractional derivative, where Alikhanov's high-order L2-1$_\\sigma$\nformula is applied on a non-uniform fitted mesh, resulting in successful\ntackling of the singularity. A high-order two-dimensional compact operator is\nimplemented to approximate the spatial variables. The alternating direction\nimplicit (ADI) approach is then employed to solve the resulting system of\nequations by decomposing the two-dimensional problem into two separate\none-dimensional problems. The theoretical analysis, encompassing both stability\nand convergence aspects, has been conducted comprehensively, and it has shown\nthat method is convergent with an order $\\mathcal\nO\\left(N_t^{-\\min\\{3-\\alpha,\\theta\\alpha,1+2\\alpha,2+\\alpha\\}}+h_x^4+h_y^4\\right)$,\nwhere $\\alpha\\in(0,1)$ represents the order of the fractional derivative, $N_t$\nis the temporal discretization parameter and $h_x$ and $h_y$ represent spatial\nmesh widths. Moreover, the parameter $\\theta$ is utilized in the construction\nof the fitted mesh.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:21:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Anshima",""],["Kumar","Sunil",""]]}
{"id":"2308.08972","submitter":"Prathamesh Muzumdar","authors":"Prathamesh Muzumdar, George Kurian, Ganga Prasad Basyal, Apoorva Muley","title":"Econometrics Modelling Approach to Examine the Effect of STEM Policy\n  Changes on Asian Students Enrollment Decision in USA","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":"  Academic research has shown significant interest in international student\nmobility, with previous literature primarily focusing on the migration industry\nfrom a political and public policy perspective. For many countries,\ninternational student mobility plays a crucial role in bolstering their\neconomies through financial gains and attracting skilled immigrants. While\nprevious studies have explored the determinants of mobility and country\neconomic policies, only a few have examined the impact of policy changes on\nmobility trends. In this study, the researchers investigate the influence of\nimmigration policy changes, particularly the optional practical training (OPT)\nextension on STEM programs, on Asian students' preference for enrolling in STEM\nmajors at universities. The study utilizes observational data and employs a\nquasi-experimental design, analysing the information using the\ndifference-in-difference technique. The findings of the research indicate that\nthe implementation of the STEM extension policy in 2008 has a significant\neffect on Asian students' decisions to enroll in a STEM major. Additionally,\nthe study highlights the noteworthy role of individual factors such as the\nspecific STEM major, terminal degree pursued, and gender in influencing Asian\nstudents' enrollment decisions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:22:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Muzumdar","Prathamesh",""],["Kurian","George",""],["Basyal","Ganga Prasad",""],["Muley","Apoorva",""]]}
{"id":"2308.08973","submitter":"Jiahao Zhang","authors":"Jiahao Zhang, Haiyang Zhang, Dongmei Zhang, Yong Liu and Shen Huang","title":"Beam Retrieval: General End-to-End Retrieval for Multi-Hop Question\n  Answering","comments":"Code is available at https://github.com/canghongjian/beam_retriever","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-hop QA involves finding multiple relevant passages and step-by-step\nreasoning to answer complex questions. While previous approaches have developed\nretrieval modules for selecting relevant passages, they face challenges in\nscenarios beyond two hops, owing to the limited performance of one-step methods\nand the failure of two-step methods when selecting irrelevant passages in\nearlier stages. In this work, we introduce Beam Retrieval, a general end-to-end\nretrieval framework for multi-hop QA. This approach maintains multiple partial\nhypotheses of relevant passages at each step, expanding the search space and\nreducing the risk of missing relevant passages. Moreover, Beam Retrieval\njointly optimizes an encoder and two classification heads by minimizing the\ncombined loss across all hops. To establish a complete QA system, we\nincorporate a supervised reader or a zero-shot GPT-3.5. Experimental results\ndemonstrate that Beam Retrieval achieves a nearly 50% improvement compared with\nbaselines on challenging MuSiQue-Ans, and it also surpasses all previous\nretrievers on HotpotQA and 2WikiMultiHopQA. Providing high-quality context,\nBeam Retrieval helps our supervised reader achieve new state-of-the-art\nperformance and substantially improves (up to 28.8 points) the QA performance\nof zero-shot GPT-3.5.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:24:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Jiahao",""],["Zhang","Haiyang",""],["Zhang","Dongmei",""],["Liu","Yong",""],["Huang","Shen",""]]}
{"id":"2308.08974","submitter":"Juming Xiong","authors":"Yilin Liu, Ruining Deng, Juming Xiong, Regina N Tyree, Hernan Correa,\n  Girish Hiremath, Yaohong Wang, Yuankai Huo","title":"Eosinophils Instance Object Segmentation on Whole Slide Imaging Using\n  Multi-label Circle Representation","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":"  Eosinophilic esophagitis (EoE) is a chronic and relapsing disease\ncharacterized by esophageal inflammation. Symptoms of EoE include difficulty\nswallowing, food impaction, and chest pain which significantly impact the\nquality of life, resulting in nutritional impairments, social limitations, and\npsychological distress. The diagnosis of EoE is typically performed with a\nthreshold (15 to 20) of eosinophils (Eos) per high-power field (HPF). Since the\ncurrent counting process of Eos is a resource-intensive process for human\npathologists, automatic methods are desired. Circle representation has been\nshown as a more precise, yet less complicated, representation for automatic\ninstance cell segmentation such as CircleSnake approach. However, the\nCircleSnake was designed as a single-label model, which is not able to deal\nwith multi-label scenarios. In this paper, we propose the multi-label\nCircleSnake model for instance segmentation on Eos. It extends the original\nCircleSnake model from a single-label design to a multi-label model, allowing\nsegmentation of multiple object types. Experimental results illustrate the\nCircleSnake model's superiority over the traditional Mask R-CNN model and\nDeepSnake model in terms of average precision (AP) in identifying and\nsegmenting eosinophils, thereby enabling enhanced characterization of EoE. This\nautomated approach holds promise for streamlining the assessment process and\nimproving diagnostic accuracy in EoE analysis. The source code has been made\npublicly available at https://github.com/yilinliu610730/EoE.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:27:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Yilin",""],["Deng","Ruining",""],["Xiong","Juming",""],["Tyree","Regina N",""],["Correa","Hernan",""],["Hiremath","Girish",""],["Wang","Yaohong",""],["Huo","Yuankai",""]]}
{"id":"2308.08975","submitter":"Julien Chaste Dr","authors":"Meryem Bouaziz, Aymen Mahmoudi, Geoffroy Kremer, Julien Chaste, Cesar\n  Gonzalez, Yannick J. Dappe, Francois Bertran, Patrick Le Fevre, Marco Pala,\n  Fabrice Oehler, Jean-Christophe Girard, Abdelkarim Ouerghi","title":"Intrinsic defects and mid-gap states in quasi-one-dimensional Indium\n  Telluride","comments":"no","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":"  Recently, intriguing physical properties have been unraveled in anisotropic\nsemiconductors, in which the in-plane electronic band structure anisotropy\noften originates from the low crystallographic symmetry. The atomic chain is\nthe ultimate limit in material downscaling for electronics, a frontier for\nestablishing an entirely new field of one-dimensional quantum materials.\nElectronic and structural properties of chain-like InTe are essential for\nbetter understanding of device applications such as thermoelectrics. Here, we\nuse scanning tunneling microscopy/spectroscopy (STM/STS) measurements and\ndensity functional theory (DFT) calculations to directly image the in-plane\nstructural anisotropy in tetragonal Indium Telluride (InTe). As results, we\nreport the direct observation of one-dimensional In1+ chains in InTe. We\ndemonstrate that InTe exhibits a band gap of about 0.40 +-0.02 eV located at\nthe M point of the Brillouin zone. Additionally, line defects are observed in\nour sample, were attributed to In1+ chain vacancy along the c-axis, a general\nfeature in many other TlSe-like compounds. Our STS and DFT results prove that\nthe presence of In1+ induces localized gap state, located near the valence band\nmaximum (VBM). This acceptor state is responsible for the high intrinsic p-type\ndoping of InTe that we also confirm using angle-resolved photoemission\nspectroscopy.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:28:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bouaziz","Meryem",""],["Mahmoudi","Aymen",""],["Kremer","Geoffroy",""],["Chaste","Julien",""],["Gonzalez","Cesar",""],["Dappe","Yannick J.",""],["Bertran","Francois",""],["Fevre","Patrick Le",""],["Pala","Marco",""],["Oehler","Fabrice",""],["Girard","Jean-Christophe",""],["Ouerghi","Abdelkarim",""]]}
{"id":"2308.08976","submitter":"Berthold J\\\"ack","authors":"Caiyun Chen, Jiangchang Zheng, Ruopeng Yu, Soumya Sankar, Hoi Chun Po,\n  Kam Tuen Law, and Berthold J\\\"ack","title":"Visualizing the Localized Electrons of a Kagome Flat Band","comments":null,"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":"  Destructive interference between electron wavefunctions on the\ntwo-dimensional (2D) kagome lattice induces an electronic flat band, which\ncould host a variety of interesting many-body quantum states. Key to realize\nthese proposals is to demonstrate the real space localization of kagome flat\nband electrons. In particular, the extent to which the often more complex\nlattice structure and orbital composition of realistic materials counteract the\nlocalizing effect of destructive interference, described by the 2D kagome\nlattice model, is hitherto unknown. We used scanning tunneling microscopy (STM)\nto visualize the non-trivial Wannier states of a kagome flat band at the\nsurface of CoSn, a kagome metal. We find that the local density of states\nassociated with the flat bands of CoSn is localized at the center of the kagome\nlattice, consistent with theoretical expectations for their corresponding\nWannier states. Our results show that these states exhibit an extremely small\nlocalization length of two to three angstroms concomitant with a strongly\nrenormalized quasiparticle velocity, which is comparable to that of moir\\'e\nsuperlattices. Hence, interaction effects in the flat bands of CoSn could be\nmuch more significant than previously thought. Our findings provide fundamental\ninsight into the electronic properties of kagome metals and are a key step for\nfuture research on emergent many-body states in transition metal based kagome\nmaterials.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:28:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Caiyun",""],["Zheng","Jiangchang",""],["Yu","Ruopeng",""],["Sankar","Soumya",""],["Po","Hoi Chun",""],["Law","Kam Tuen",""],["J\u00e4ck","Berthold",""]]}
{"id":"2308.08977","submitter":"Elliot Paquette","authors":"Elizabeth Collins-Woodfin, Courtney Paquette, Elliot Paquette, Inbar\n  Seroussi","title":"Hitting the High-Dimensional Notes: An ODE for SGD learning dynamics on\n  GLMs and multi-index models","comments":"Preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG math.PR math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze the dynamics of streaming stochastic gradient descent (SGD) in the\nhigh-dimensional limit when applied to generalized linear models and\nmulti-index models (e.g. logistic regression, phase retrieval) with general\ndata-covariance. In particular, we demonstrate a deterministic equivalent of\nSGD in the form of a system of ordinary differential equations that describes a\nwide class of statistics, such as the risk and other measures of\nsub-optimality. This equivalence holds with overwhelming probability when the\nmodel parameter count grows proportionally to the number of data. This\nframework allows us to obtain learning rate thresholds for stability of SGD as\nwell as convergence guarantees. In addition to the deterministic equivalent, we\nintroduce an SDE with a simplified diffusion coefficient (homogenized SGD)\nwhich allows us to analyze the dynamics of general statistics of SGD iterates.\nFinally, we illustrate this theory on some standard examples and show numerical\nsimulations which give an excellent match to the theory.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:33:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Collins-Woodfin","Elizabeth",""],["Paquette","Courtney",""],["Paquette","Elliot",""],["Seroussi","Inbar",""]]}
{"id":"2308.08978","submitter":"Vaios Papaspyros","authors":"Vaios Papaspyros, Guy Theraulaz, Cl\\'ement Sire, Francesco Mondada","title":"Quantifying the biomimicry gap in biohybrid systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biohybrid systems in which robotic lures interact with animals have become\ncompelling tools for probing and identifying the mechanisms underlying\ncollective animal behavior. One key challenge lies in the transfer of social\ninteraction models from simulations to reality, using robotics to validate the\nmodeling hypotheses. This challenge arises in bridging what we term the\n\"biomimicry gap\", which is caused by imperfect robotic replicas, communication\ncues and physics constrains not incorporated in the simulations that may elicit\nunrealistic behavioral responses in animals. In this work, we used a biomimetic\nlure of a rummy-nose tetra fish (Hemigrammus rhodostomus) and a neural network\n(NN) model for generating biomimetic social interactions. Through experiments\nwith a biohybrid pair comprising a fish and the robotic lure, a pair of real\nfish, and simulations of pairs of fish, we demonstrate that our biohybrid\nsystem generates high-fidelity social interactions mirroring those of genuine\nfish pairs. Our analyses highlight that: 1) the lure and NN maintain minimal\ndeviation in real-world interactions compared to simulations and fish-only\nexperiments, 2) our NN controls the robot efficiently in real-time, and 3) a\ncomprehensive validation is crucial to bridge the biomimicry gap, ensuring\nrealistic biohybrid systems.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:33:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Papaspyros","Vaios",""],["Theraulaz","Guy",""],["Sire","Cl\u00e9ment",""],["Mondada","Francesco",""]]}
{"id":"2308.08979","submitter":"Johannes Vrana","authors":"Johannes Vrana, Ripudaman Singh","title":"Modeling Digital Penetration of the Industrialized Society and its\n  Ensuing Transfiguration","comments":"22 pages, 6 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Fourth Industrial Revolution, ushered by the deeper integration of\ndigital technologies into professional and social spaces, provides an\nopportunity to meaningfully serve society. Humans have tremendous capability to\ninnovatively improve social well-being when the situation is clear. Which was\nnot the case during the first three revolutions. Thus, society has been\naccepting lifestyle changes willingly and several negative consequences\nunwillingly. Since the fourth one is still in its infancy, we can control it\nbetter. This paper presents a unified model of the industrialized ecosystem\ncovering value creation, value consumption, enabling infrastructure, required\nskills, and additional governance. This design thinking viewpoint, which\nincludes the consumer side of digital transformation, sets the stage for the\nnext major lifestyle change, termed Digital Transfiguration. For validation and\nease of comprehension, the model draws upon the well-understood automobile\nindustry. This model unifies the digital penetration of both industrial\ncreation and social consumption, in a manner that aligns several stakeholders\non their transformation journey.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:37:12 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:45:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Vrana","Johannes",""],["Singh","Ripudaman",""]]}
{"id":"2308.08980","submitter":"Alexander Zimmermann","authors":"Alexander Zimmermann (UPJV, LAMFA)","title":"Differential graded Brauer groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider central simple $K$-algebras which happen to bedifferential graded\n$K$-algebras. Two such algebras $A$ and $B$are considered equivalent if there\nare bounded complexes of finite dimensional$K$-vector spaces $C_A$ and $C_B$\nsuch that the differential graded algebras $A\\otimes_K {\\rm\nEnd}_K^\\bullet(C_A)$ and $B\\otimes_K {\\rm End}_K^\\bullet(C_B)$ are\nisomorphic.Equivalence classes form an abelian group, which we call thedg\nBrauer group.We prove that this group is isomorphic to the ordinary Brauer\ngroup of the field $K$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:43:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zimmermann","Alexander","","UPJV, LAMFA"]]}
{"id":"2308.08981","submitter":"Salvador Centelles Chuli\\'a","authors":"Salvador Centelles Chuli\\'a, Ranjeet Kumar, Oleg Popov, Rahul\n  Srivastava","title":"Neutrino Mass Sum Rules from Modular $\\mathcal{A}_4$ Symmetry","comments":"22 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Modular symmetries offer a dynamic approach to understanding the flavour\nstructure of leptonic mixing. Using the modular $\\mathcal{A}_4$ flavour\nsymmetry integrated in a type-II seesaw, we propose a simple and minimalistic\nmodel that restricts the neutrino oscillation parameter space and, most\nimportantly, introduces a sum rule in the physical neutrino masses. When\ncombined with the mass squared differences observed in neutrino oscillations,\nthis sum rule determines the absolute neutrino mass scale. This has significant\nimplications for cosmology, neutrinoless double beta decay experiments and\ndirect neutrino mass measurements. In particular, the model predicts $\\sum_i\nm_i \\approx 0.1$ eV for both normal and inverted ordering, and thus can be\nfully probed by the current generation of cosmological probes in the upcoming\nyears.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:44:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chuli\u00e1","Salvador Centelles",""],["Kumar","Ranjeet",""],["Popov","Oleg",""],["Srivastava","Rahul",""]]}
{"id":"2308.08982","submitter":"Robert \\\"Ostling","authors":"Robert \\\"Ostling, Katarina Gillholm, Murathan Kurfal{\\i}, Marie\n  Mattson, Mats Wir\\'en","title":"Evaluation of really good grammatical error correction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Although rarely stated, in practice, Grammatical Error Correction (GEC)\nencompasses various models with distinct objectives, ranging from grammatical\nerror detection to improving fluency. Traditional evaluation methods fail to\nfully capture the full range of system capabilities and objectives.\nReference-based evaluations suffer from limitations in capturing the wide\nvariety of possible correction and the biases introduced during reference\ncreation and is prone to favor fixing local errors over overall text\nimprovement. The emergence of large language models (LLMs) has further\nhighlighted the shortcomings of these evaluation strategies, emphasizing the\nneed for a paradigm shift in evaluation methodology. In the current study, we\nperform a comprehensive evaluation of various GEC systems using a recently\npublished dataset of Swedish learner texts. The evaluation is performed using\nestablished evaluation metrics as well as human judges. We find that GPT-3 in a\nfew-shot setting by far outperforms previous grammatical error correction\nsystems for Swedish, a language comprising only 0.11% of its training data. We\nalso found that current evaluation methods contain undesirable biases that a\nhuman evaluation is able to reveal. We suggest using human post-editing of GEC\nsystem outputs to analyze the amount of change required to reach native-level\nhuman performance on the task, and provide a dataset annotated with human\npost-edits and assessments of grammaticality, fluency and meaning preservation\nof GEC system outputs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:45:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["\u00d6stling","Robert",""],["Gillholm","Katarina",""],["Kurfal\u0131","Murathan",""],["Mattson","Marie",""],["Wir\u00e9n","Mats",""]]}
{"id":"2308.08983","submitter":"Roberto Gorrieri","authors":"Roberto Gorrieri","title":"Compositional Semantics of Finite Petri Nets","comments":"arXiv admin note: substantial text overlap with arXiv:2301.04483","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Structure-preserving bisimilarity is a truly concurrent behavioral\nequivalence for finite Petri nets, which relates markings (of the same size\nonly) generating the same causal nets, hence also the same partial orders of\nevents. The process algebra FNM truly represents all (and only) the finite\nPetri nets, up to isomorphism. We prove that structure-preserving bisimilarity\nis a congruence w.r.t. the FMN operators, In this way, we have defined a\ncompositional semantics, fully respecting causality and the branching structure\nof systems, for the class of all the finite Petri nets. Moreover, we study some\nalgebraic properties of structure-preserving bisimilarity, that are at the base\nof a sound (but incomplete) axiomatization over FNM process terms.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:45:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gorrieri","Roberto",""]]}
{"id":"2308.08984","submitter":"Sereina Riniker","authors":"Moritz Th\\\"urlemann, Sereina Riniker","title":"Hybrid Classical/Machine-Learning Force Fields for the Accurate\n  Description of Molecular Condensed-Phase Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Electronic structure methods offer in principle accurate predictions of\nmolecular properties, however, their applicability is limited by computational\ncosts. Empirical methods are cheaper, but come with inherent approximations and\nare dependent on the quality and quantity of training data. The rise of machine\nlearning (ML) force fields (FFs) exacerbates limitations related to training\ndata even further, especially for condensed-phase systems for which the\ngeneration of large and high-quality training datasets is difficult. Here, we\npropose a hybrid ML/classical FF model that is parametrized exclusively on\nhigh-quality ab initio data of dimers and monomers in vacuum but is\ntransferable to condensed-phase systems. The proposed hybrid model combines our\nprevious ML-parametrized classical model with ML corrections for situations\nwhere classical approximations break down, thus combining the robustness and\nefficiency of classical FFs with the flexibility of ML. Extensive validation on\nbenchmarking datasets and experimental condensed-phase data, including organic\nliquids and small-molecule crystal structures, showcases how the proposed\napproach may promote FF development and unlock the full potential of classical\nFFs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:47:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Th\u00fcrlemann","Moritz",""],["Riniker","Sereina",""]]}
{"id":"2308.08985","submitter":"Yannis Tevissen","authors":"Yannis Tevissen (IP Paris, NB), Dan Istrate (UTC), Vincent Zalc (UTC),\n  J\\'er\\^ome Boudy (IP Paris), G\\'erard Chollet (IP Paris), Fr\\'ed\\'eric\n  Petitpont (Newsbridge), Sami Boutamine (UTC)","title":"Home monitoring for frailty detection through sound and speaker\n  diarization analysis","comments":"JETSAN, Jun 2023, Aubervilliers & Paris, France","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the French, European and worldwide populations are aging, there is a\nstrong interest for new systems that guarantee a reliable and privacy\npreserving home monitoring for frailty prevention. This work is a part of a\nglobal environmental audio analysis system which aims to help identification of\nActivities of Daily Life (ADL) through human and everyday life sounds\nrecognition, speech presence and number of speakers detection. The focus is\nmade on the number of speakers detection. In this article, we present how\nrecent advances in sound processing and speaker diarization can improve the\nexisting embedded systems. We study the performances of two new methods and\ndiscuss the benefits of DNN based approaches which improve performances by\nabout 100%.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:47:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tevissen","Yannis","","IP Paris, NB"],["Istrate","Dan","","UTC"],["Zalc","Vincent","","UTC"],["Boudy","J\u00e9r\u00f4me","","IP Paris"],["Chollet","G\u00e9rard","","IP Paris"],["Petitpont","Fr\u00e9d\u00e9ric","","Newsbridge"],["Boutamine","Sami","","UTC"]]}
{"id":"2308.08986","submitter":"Krunal Kishor Patel","authors":"Krunal Kishor Patel","title":"Progressively Strengthening and Tuning MIP Solvers for Reoptimization","comments":"Submitted to MPC journal","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores reoptimization techniques for solving sequences of\nsimilar mixed integer programs (MIPs) more effectively. Traditionally, these\nMIPs are solved independently, without capitalizing on information from\npreviously solved instances. Our approach focuses on primal bound improvements\nby reusing the solutions of the previously solved instances as well as dual\nbound improvements by reusing the branching history and automating\nparameter-tuning. We also describe ways to improve the solver performance by\nextending ideas from reliability branching to generate better pseudocosts. Our\nreoptimization approach, which we developed for the computational competition\nof the MIP 2023 workshop, earned us the first prize. In this paper, we\nthoroughly analyze the performance of each technique and their combined impact\non the solver's performance. Finally, we present ways to extend our techniques\nin practice for further improvements.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:47:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Patel","Krunal Kishor",""]]}
{"id":"2308.08987","submitter":"Jesper Leong","authors":"Jesper Leong, Anthony W. Thomas and Pierre A. M. Guichon","title":"Excluded Volume Effects on Cold Neutron Star Phenomenology","comments":null,"journal-ref":null,"doi":null,"report-no":"ADP-23-22/T1231","categories":"nucl-th astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Observable properties of neutron stars are studied within a hadronic equation\nof state derived from the quark level. The effect of short-range repulsion is\nincorporated within the excluded volume framework. It is found that one can\nsustain neutron stars with masses as large as 2.2$M_\\odot$ even including\nhyperons in $\\beta$ equilibrium, while producing radii and tidal\ndeformabilities consistent with current constraints.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:48:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Leong","Jesper",""],["Thomas","Anthony W.",""],["Guichon","Pierre A. M.",""]]}
{"id":"2308.08988","submitter":"Bibekananda Maji","authors":"Anushree Gupta, Md Kashif Jamal, Nilmoni Karak, and Bibekananda Maji","title":"A Dirichlet character analogue of Ramanujan's formula for odd zeta\n  values","comments":"24 pages, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 2001, Kanemitsu, Tanigawa, and Yoshimoto studied the following generalized\nLambert series, $$\n  \\sum_{n=1}^{\\infty} \\frac{n^{N-2h} }{\\exp(n^N x)-1},\n  $$ for $N \\in \\mathbb{N}$ and $h\\in \\mathbb{Z}$ with some restriction on $h$.\nRecently, Dixit and the last author pointed out that this series has already\nbeen present in the Lost Notebook of Ramanujan with a more general form.\nAlthough, Ramanujan did not provide any transformation identity for it. In the\nsame paper, Dixit and the last author found an elegant generalization of\nRamanujan's celebrated identity for $\\zeta(2m+1)$ while extending the results\nof Kanemitsu et al. In a subsequent work, Kanemitsu et al. explored another\nextended version of the aforementioned series, namely,\n$$\\sum_{r=1}^{q}\\sum_{n=1}^{\\infty}\n\\frac{\\chi(r)n^{N-2h}{\\exp\\left(-\\frac{r}{q}n^N x\\right)}}{1-\\exp({-n^N x})},$$\nwhere $\\chi$ denotes a Dirichlet character modulo $q$, $N\\in 2\\mathbb{N}$ and\nwith some restriction on the variable $h$. In the current paper, we investigate\nthe above series for {\\it any} $N \\in \\mathbb{N}$ and $h \\in \\mathbb{Z}$. We\nobtain a Dirichlet character analogue of Dixit and the last author's identity\nand there by derive a two variable generalization of Ramanujan's identity for\n$\\zeta(2m+1)$. Moreover, we establish a new identity for $L(1/3, \\chi)$\nanalogous to Ramanujan's famous identity for $\\zeta(1/2)$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:49:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gupta","Anushree",""],["Jamal","Md Kashif",""],["Karak","Nilmoni",""],["Maji","Bibekananda",""]]}
{"id":"2308.08989","submitter":"Taniya Kapoor","authors":"Taniya Kapoor, Abhishek Chandra, Daniel M. Tartakovsky, Hongrui Wang,\n  Alfredo Nunez, Rolf Dollevoet","title":"Neural oscillators for generalization of physics-informed machine\n  learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A primary challenge of physics-informed machine learning (PIML) is its\ngeneralization beyond the training domain, especially when dealing with complex\nphysical problems represented by partial differential equations (PDEs). This\npaper aims to enhance the generalization capabilities of PIML, facilitating\npractical, real-world applications where accurate predictions in unexplored\nregions are crucial. We leverage the inherent causality and temporal sequential\ncharacteristics of PDE solutions to fuse PIML models with recurrent neural\narchitectures based on systems of ordinary differential equations, referred to\nas neural oscillators. Through effectively capturing long-time dependencies and\nmitigating the exploding and vanishing gradient problem, neural oscillators\nfoster improved generalization in PIML tasks. Extensive experimentation\ninvolving time-dependent nonlinear PDEs and biharmonic beam equations\ndemonstrates the efficacy of the proposed approach. Incorporating neural\noscillators outperforms existing state-of-the-art methods on benchmark problems\nacross various metrics. Consequently, the proposed method improves the\ngeneralization capabilities of PIML, providing accurate solutions for\nextrapolation and prediction beyond the training data.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:50:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kapoor","Taniya",""],["Chandra","Abhishek",""],["Tartakovsky","Daniel M.",""],["Wang","Hongrui",""],["Nunez","Alfredo",""],["Dollevoet","Rolf",""]]}
{"id":"2308.08990","submitter":"Jean-Francois Nies","authors":"Jean-Francois Nies","title":"Semantic Information for Object Detection","comments":"11 pages, 3 Figures, Report for Guided Research Project at RPTU\n  Kaiserslautern","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we demonstrate that the concept of Semantic Consistency and\nthe ensuing method of Knowledge-Aware Re-Optimization can be adapted for the\nproblem of object detection in intricate traffic scenes. Furthermore, we\nintroduce a novel method for extracting a knowledge graph from a dataset of\nimages provided with instance-level annotations, and integrate this new\nknowledge graph with the existing semantic consistency model. Combining both\nthis novel hybrid knowledge graph and the preexisting methods of frequency\nanalysis and external knowledge graph as sources for semantic information, we\ninvestigate the effectiveness of knowledge-aware re-optimization on the\nFaster-RCNN and DETR object detection models. We find that limited but\nconsistent improvements in precision and or recall can be achieved using this\nmethod for all combinations of model and method studied.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:53:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nies","Jean-Francois",""]]}
{"id":"2308.08991","submitter":"Yuqiang Sun","authors":"Yuqiang Sun, Zhengzi Xu, Chengwei Liu, Yiran Zhang, Yang Liu","title":"Who is the Real Hero? Measuring Developer Contribution via\n  Multi-dimensional Data Integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Proper incentives are important for motivating developers in open-source\ncommunities, which is crucial for maintaining the development of open-source\nsoftware healthy. To provide such incentives, an accurate and objective\ndeveloper contribution measurement method is needed. However, existing methods\nrely heavily on manual peer review, lacking objectivity and transparency. The\nmetrics of some automated works about effort estimation use only syntax-level\nor even text-level information, such as changed lines of code, which lack\nrobustness. Furthermore, some works about identifying core developers provide\nonly a qualitative understanding without a quantitative score or have some\nproject-specific parameters, which makes them not practical in real-world\nprojects. To this end, we propose CValue, a multidimensional information\nfusion-based approach to measure developer contributions. CValue extracts both\nsyntax and semantic information from the source code changes in four\ndimensions: modification amount, understandability, inter-function and\nintra-function impact of modification. It fuses the information to produce the\ncontribution score for each of the commits in the projects. Experimental\nresults show that CValue outperforms other approaches by 19.59% on 10\nreal-world projects with manually labeled ground truth. We validated and proved\nthat the performance of CValue, which takes 83.39 seconds per commit, is\nacceptable to be applied in real-world projects. Furthermore, we performed a\nlarge-scale experiment on 174 projects and detected 2,282 developers having\ninflated commits. Of these, 2,050 developers did not make any syntax\ncontribution; and 103 were identified as bots.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:57:44 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:42:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sun","Yuqiang",""],["Xu","Zhengzi",""],["Liu","Chengwei",""],["Zhang","Yiran",""],["Liu","Yang",""]]}
{"id":"2308.08992","submitter":"John Addy","authors":"John W. G. Addy, Chloe Maclaren, Kirsty Hassall","title":"Horseshoe Priors for Time-Varying AR and GARCH Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Grassland ecosystems support a wide range of species and provide key services\nincluding food production, carbon storage, biodiversity support, and flood\nmitigation. However, yield stability in these grassland systems is not yet well\nunderstood, with recent evidence suggesting water stress throughout summer and\nwarmer temperatures in late summer reduce yield stability. In this study we\ninvestigate how grassland yield stability of the Park Grass Experiment, UK, has\nchanged over time by developing a Bayesian time-varying Autoregressive and\ntime-varying Generalised Autoregressive Conditional Heterogeneity model using\nthe variance-parameterised Gamma likelihood function.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:58:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Addy","John W. G.",""],["Maclaren","Chloe",""],["Hassall","Kirsty",""]]}
{"id":"2308.08993","submitter":"Nadia Bihari Padhan","authors":"Nadia Bihari Padhan and Rahul Pandit","title":"Unveiling the Spatiotemporal Evolution of Liquid-Lens Coalescence:\n  Self-Similarity, Vortex Quadrupoles, and Turbulence in a Three-Phase Fluid\n  System","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate that the three-phase Cahn-Hilliard-Navier-Stokes (CHNS3)\nsystem provides a natural theoretical framework for studying liquid-lens\ncoalescence, which has been investigated in recent experiments. Our extensive\ndirect numerical simulations (DNSs) of lens coalescence, in the two and three\ndimensional (2D and 3D) CHNS3, uncover the rich spatiotemporal evolution of the\nfluid velocity $\\bf u$ and vorticity $\\omega$, the concentration fields $c_1,\n\\, c_2,$ and $c_3$ of the three liquids, and a generalized Laplace pressure\n$P^G_\\mathcal{L}$, which we define in terms of these concentrations via a\nPoisson equation. We find, in agreement with experiments, that as the lenses\ncoalesce, their neck height $h(t) \\sim t^{\\alpha_v}$, with $\\alpha_v \\simeq 1$\nin the viscous regime, and $h(t) \\sim t^{\\alpha_i}$, with $\\alpha_i \\simeq 2/3$\nin the inertial regime. We obtain the crossover from the viscous to the\ninertial regimes as a function of the Ohnesorge number $Oh$, a dimensionless\ncombination of viscous stresses and inertial and surface tension forces. We\nshow that a vortex quadrupole, which straddles the neck of the merging lenses,\nand $P^G_\\mathcal{L}$ play crucial roles in distinguishing between the viscous-\nand inertial-regime growths of the merging lenses. In the inertial regime we\nfind signatures of turbulence, which we quantify via kinetic-energy and\nconcentration spectra. Finally, we examine the merger of asymmetric lenses, in\nwhich the initial stages of coalescence occur along the circular parts of the\nlens interfaces; in this case, we obtain power-law forms for the $h(t)$ with\ninertial-regime exponents that lie between their droplet-coalescence and\nlens-merger counterparts.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:03:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Padhan","Nadia Bihari",""],["Pandit","Rahul",""]]}
{"id":"2308.08994","submitter":"Christopher Iliffe Sprague","authors":"Christopher Iliffe Sprague, Petter \\\"Ogren","title":"An Extended Convergence Result for Behaviour Tree Controllers","comments":"Submitted to the IEEE Transactions on Robotics (T-RO)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AI cs.RO cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Behavior trees (BTs) are an optimally modular framework to assemble\nhierarchical hybrid control policies from a set of low-level control policies\nusing a tree structure. Many robotic tasks are naturally decomposed into a\nhierarchy of control tasks, and modularity is a well-known tool for handling\ncomplexity, therefor behavior trees have garnered widespread usage in the\nrobotics community. In this paper, we study the convergence of BTs, in the\nsense of reaching a desired part of the state space. Earlier results on BT\nconvergence were often tailored to specific families of BTs, created using\ndifferent design principles. The results of this paper generalize the earlier\nresults and also include new cases of cyclic switching not covered in the\nliterature.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:05:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sprague","Christopher Iliffe",""],["\u00d6gren","Petter",""]]}
{"id":"2308.08995","submitter":"Xinyu Huang","authors":"Xinyu Huang and Wen Wu and Shisheng Hu and Mushu Li and Conghao Zhou\n  and Xuemin Shen","title":"Digital Twin Based User-Centric Resource Management for Multicast Short\n  Video Streaming","comments":"13 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multicast short video streaming (MSVS) can effectively reduce network traffic\nload by delivering identical video sequences to multiple users simultaneously.\nThe existing MSVS schemes mainly rely on the aggregated video requests to\nreserve bandwidth and computing resources, which cannot satisfy users' diverse\nand dynamic service requirements, particularly when users' swipe behaviors\nexhibit spatiotemporal fluctuation. In this paper, we propose a user-centric\nresource management scheme based on the digital twin (DT) technique, which aims\nto enhance user satisfaction as well as reduce resource consumption. Firstly,\nwe design a user DT (UDT)-assisted resource reservation framework.\nSpecifically, UDTs are constructed for individual users, which store users'\nhistorical data for updating multicast groups and abstracting useful\ninformation. The swipe probability distributions and recommended video lists\nare abstracted from UDTs to predict bandwidth and computing resource demands.\nParameterized sigmoid functions are leveraged to characterize multicast groups'\nuser satisfaction. Secondly, we formulate a joint non-convex bandwidth and\ncomputing resource reservation problem which is transformed into a convex\npiecewise problem by utilizing a tangent function to approximately substitute\nthe concave part. A low-complexity scheduling algorithm is then developed to\nfind the optimal resource reservation decisions. Simulation results based on\nthe real-world dataset demonstrate that the proposed scheme outperforms\nbenchmark schemes in terms of user satisfaction and resource consumption.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:07:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Xinyu",""],["Wu","Wen",""],["Hu","Shisheng",""],["Li","Mushu",""],["Zhou","Conghao",""],["Shen","Xuemin",""]]}
{"id":"2308.08996","submitter":"Maryna Pankratova","authors":"M. Pankratova, I. P. Miranda, D. Thonig, M. Pereiro, E. Sjoqvist, A.\n  Delin, P. Scheid, O. Eriksson, and A. Bergman","title":"Heat-conserving three-temperature model for ultrafast demagnetization of\n  3d ferromagnets","comments":"9 pages, 9 figures, Submitted to Physical Review B","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the ultrafast magnetization dynamics of bcc Fe and fcc Co using the\nrecently suggested heat-conserving three-temperature model (HC3TM), together\nwith atomistic spin- and lattice dynamics simulations. It is shown that this\ntype of Langevin-based simulation is able to reproduce observed trends of the\nultrafast magnetization dynamics of fcc Co and bcc Fe, in agreement with\nprevious findings for fcc Ni. The simulations are performed by using parameters\nthat to as large extent as possible are obtained from electronic structure\ntheory. The one parameter that was not calculated in this way, was the damping\nterm used for the lattice dynamics simulations, and here a range of parameters\nwere investigated. It is found that this term has a large influence on the\ndetails of the magnetization dynamics. The dynamics of iron and cobalt is\ncompared with previous results for nickel and similarities and differences in\nthe materials' behavior are analysed following the absorption of a femtosecond\nlaser pulse. Importantly, for all elements investigated so far with this model,\nwe obtain a linear relationship between the value of the maximally demagnetized\nstate and the fluence of the laser pulse, which is in agreement with\nexperiments.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:08:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pankratova","M.",""],["Miranda","I. P.",""],["Thonig","D.",""],["Pereiro","M.",""],["Sjoqvist","E.",""],["Delin","A.",""],["Scheid","P.",""],["Eriksson","O.",""],["Bergman","A.",""]]}
{"id":"2308.08997","submitter":"Mikhail Khlopunov","authors":"M. Khlopunov","title":"Non-local tails in radiation in odd dimensions","comments":"44 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Huygens principle violation in a spacetime of odd dimensions leads to the\nfact that the retarded massless fields of localised sources depend on their\nhistory of motion preceding the retarded time. This non-local character of\nretarded fields should result into the formation of tail signals in the\nradiation of localised sources. In particular, in gravity theories with odd\nnumber of extra spacetime dimensions the gravitational radiation of binary\nsystems should contain the tail terms. In this work, we demonstrate the\npresence of tail signal in radiation within a simple model of scalar field\ninteracting with the point charge moving on elliptical orbit in three\ndimensions. We find that the tail term results into the characteristic\ndependence of radiation power of the charge on time. In particular, its\nextremum points do not correspond to the moments when the charge passes the\npericenter and apocenter of the orbit, in contrast with the four-dimensional\ntheory. We obtain the formulae for the shifts of radiation power extremum\npoints up to the contributions quadratic in the orbital eccentricity. We also\ncompute the spectral distribution of radiation power of the charge. We find\nthat in three dimensions the charge on elliptical orbit radiates into the lower\nharmonics of the spectrum, compared to the four-dimensional theory. We\nconjecture that in higher dimensions the character of spectral distributions is\nopposite - the charge mainly radiates into the higher harmonics of the\nspectrum.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:09:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Khlopunov","M.",""]]}
{"id":"2308.08998","submitter":"Caglar Gulcehre","authors":"Caglar Gulcehre, Tom Le Paine, Srivatsan Srinivasan, Ksenia\n  Konyushkova, Lotte Weerts, Abhishek Sharma, Aditya Siddhant, Alex Ahern,\n  Miaosen Wang, Chenjie Gu, Wolfgang Macherey, Arnaud Doucet, Orhan Firat,\n  Nando de Freitas","title":"Reinforced Self-Training (ReST) for Language Modeling","comments":"23 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Reinforcement learning from human feedback (RLHF) can improve the quality of\nlarge language model's (LLM) outputs by aligning them with human preferences.\nWe propose a simple algorithm for aligning LLMs with human preferences inspired\nby growing batch reinforcement learning (RL), which we call Reinforced\nSelf-Training (ReST). Given an initial LLM policy, ReST produces a dataset by\ngenerating samples from the policy, which are then used to improve the LLM\npolicy using offline RL algorithms. ReST is more efficient than typical online\nRLHF methods because the training dataset is produced offline, which allows\ndata reuse. While ReST is a general approach applicable to all generative\nlearning settings, we focus on its application to machine translation. Our\nresults show that ReST can substantially improve translation quality, as\nmeasured by automated metrics and human evaluation on machine translation\nbenchmarks in a compute and sample-efficient manner.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:12:48 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 10:23:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gulcehre","Caglar",""],["Paine","Tom Le",""],["Srinivasan","Srivatsan",""],["Konyushkova","Ksenia",""],["Weerts","Lotte",""],["Sharma","Abhishek",""],["Siddhant","Aditya",""],["Ahern","Alex",""],["Wang","Miaosen",""],["Gu","Chenjie",""],["Macherey","Wolfgang",""],["Doucet","Arnaud",""],["Firat","Orhan",""],["de Freitas","Nando",""]]}
{"id":"2308.08999","submitter":"Toshinori Kobayashi","authors":"Olgur Celikbas, Toshinori Kobayashi, Hiroki Matsui, Arash Sadeghi","title":"Two theorems on the vanishing of Ext","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove two theorems on the vanishing of Ext over commutative Noetherian\nlocal rings. Our first theorem shows that, over non-regular Cohen-Macaulay\nlocal domains, there are no ideals that are both Burch and rigid. Our second\ntheorem reformulates a conjecture of Huneke-Wiegand concerning rigid modules\nand highlights its relation with the celebrated Auslander-Reiten conjecture. We\nalso discuss a byproduct of our argument which yields a generalization of a\nresult of Araya.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:13:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Celikbas","Olgur",""],["Kobayashi","Toshinori",""],["Matsui","Hiroki",""],["Sadeghi","Arash",""]]}
{"id":"2308.09000","submitter":"Xihong Yang","authors":"Xihong Yang, Jiaqi Jin, Siwei Wang, Ke Liang, Yue Liu, Yi Wen, Suyuan\n  Liu, Sihang Zhou, Xinwang Liu, En Zhu","title":"DealMVC: Dual Contrastive Calibration for Multi-view Clustering","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":"  Benefiting from the strong view-consistent information mining capacity,\nmulti-view contrastive clustering has attracted plenty of attention in recent\nyears. However, we observe the following drawback, which limits the clustering\nperformance from further improvement. The existing multi-view models mainly\nfocus on the consistency of the same samples in different views while ignoring\nthe circumstance of similar but different samples in cross-view scenarios. To\nsolve this problem, we propose a novel Dual contrastive calibration network for\nMulti-View Clustering (DealMVC). Specifically, we first design a fusion\nmechanism to obtain a global cross-view feature. Then, a global contrastive\ncalibration loss is proposed by aligning the view feature similarity graph and\nthe high-confidence pseudo-label graph. Moreover, to utilize the diversity of\nmulti-view information, we propose a local contrastive calibration loss to\nconstrain the consistency of pair-wise view features. The feature structure is\nregularized by reliable class information, thus guaranteeing similar samples\nhave similar features in different views. During the training procedure, the\ninteracted cross-view feature is jointly optimized at both local and global\nlevels. In comparison with other state-of-the-art approaches, the comprehensive\nexperimental results obtained from eight benchmark datasets provide substantial\nvalidation of the effectiveness and superiority of our algorithm. We release\nthe code of DealMVC at https://github.com/xihongyang1999/DealMVC on GitHub.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:14:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Xihong",""],["Jin","Jiaqi",""],["Wang","Siwei",""],["Liang","Ke",""],["Liu","Yue",""],["Wen","Yi",""],["Liu","Suyuan",""],["Zhou","Sihang",""],["Liu","Xinwang",""],["Zhu","En",""]]}
{"id":"2308.09001","submitter":"Lambert Lin","authors":"Lambert Lin and Steven R White","title":"A Novel Method of Function Extrapolation Inspired by Techniques in\n  Low-entangled Many-body Physics","comments":"10 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel extrapolation algorithm inspired by quantum mechanics\nand evaluate its performance against linear prediction. Our method involves\nmapping function values onto a quantum state and estimating future function\nvalues by minimizing entanglement entropy. We demonstrate the effectiveness of\nour approach on various simple functions, both with and without noise,\ncomparing it to linear prediction. Our results show that the proposed algorithm\nproduces extrapolations comparable to linear prediction, while exhibiting\nimproved performance for functions with sharp features.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:16:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lin","Lambert",""],["White","Steven R",""]]}
{"id":"2308.09002","submitter":"Payel Nandi","authors":"Payel Nandi and C. S. Stalin","title":"Star formation characteristics of galaxies hosting AGN","comments":"Comments are welcome. Accepted for the 3rd BINA Proceedings","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 ultra-violet (UV) observations of two Seyfert\ntype active galactic nuclei (AGN), namely NGC$~$4051 and NGC$~$4151. These\nobservations aimed at studying the star formation in the hosts of these AGN\nwere carried out with the ultra-violet imaging telescope on board AstroSat in\nfar-UV. A total of 193 and 328 star-forming regions (SF) were identified using\nSExtractor in NGC$~$4051 and NGC$~$4151, respectively. Using aperture\nphotometry of the identified SF regions, we estimated the star formation rates\n(SFRs). We found NGC$~$4051 to have the lowest SFR with a median value of 3.16\n$\\times$ 10$^{-5}$ M$_{\\odot}$ yr$^{-1}$ while for NGC$~$4151, we found a\nmedian SFR of 0.012 M$_{\\odot}$ yr$^{-1}$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:18:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nandi","Payel",""],["Stalin","C. S.",""]]}
{"id":"2308.09003","submitter":"Stefan Petrescu","authors":"Stefan Petrescu, Floris den Hengst, Alexandru Uta, Jan S. Rellermeyer","title":"Log Parsing Evaluation in the Era of Modern Software Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the complexity and size of modern software systems, the amount of logs\ngenerated is tremendous. Hence, it is infeasible to manually investigate these\ndata in a reasonable time, thereby requiring automating log analysis to derive\ninsights about the functioning of the systems. Motivated by an industry\nuse-case, we zoom-in on one integral part of automated log analysis, log\nparsing, which is the prerequisite to deriving any insights from logs. Our\ninvestigation reveals problematic aspects within the log parsing field,\nparticularly its inefficiency in handling heterogeneous real-world logs. We\nshow this by assessing the 14 most-recognized log parsing approaches in the\nliterature using (i) nine publicly available datasets, (ii) one dataset\ncomprised of combined publicly available data, and (iii) one dataset generated\nwithin the infrastructure of a large bank. Subsequently, toward improving log\nparsing robustness in real-world production scenarios, we propose a tool,\nLogchimera, that enables estimating log parsing performance in industry\ncontexts through generating synthetic log data that resemble industry logs. Our\ncontributions serve as a foundation to consolidate past research efforts,\nfacilitate future research advancements, and establish a strong link between\nresearch and industry log parsing.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:19:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Petrescu","Stefan",""],["Hengst","Floris den",""],["Uta","Alexandru",""],["Rellermeyer","Jan S.",""]]}
{"id":"2308.09004","submitter":"Renan Souza","authors":"Renan Souza, Tyler J. Skluzacek, Sean R. Wilkinson, Maxim Ziatdinov,\n  Rafael Ferreira da Silva","title":"Towards Lightweight Data Integration using Multi-workflow Provenance and\n  Data Observability","comments":"10 pages, 5 figures, 2 Listings, 42 references, Paper accepted at\n  IEEE eScience'23","journal-ref":"19th IEEE International Conference on e-Science (eScience) 2023 -\n  Limassol, Cyprus","doi":null,"report-no":null,"categories":"cs.DC cs.AI cs.DB cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern large-scale scientific discovery requires multidisciplinary\ncollaboration across diverse computing facilities, including High Performance\nComputing (HPC) machines and the Edge-to-Cloud continuum. Integrated data\nanalysis plays a crucial role in scientific discovery, especially in the\ncurrent AI era, by enabling Responsible AI development, FAIR, Reproducibility,\nand User Steering. However, the heterogeneous nature of science poses\nchallenges such as dealing with multiple supporting tools, cross-facility\nenvironments, and efficient HPC execution. Building on data observability,\nadapter system design, and provenance, we propose MIDA: an approach for\nlightweight runtime Multi-workflow Integrated Data Analysis. MIDA defines data\nobservability strategies and adaptability methods for various parallel systems\nand machine learning tools. With observability, it intercepts the dataflows in\nthe background without requiring instrumentation while integrating domain,\nprovenance, and telemetry data at runtime into a unified database ready for\nuser steering queries. We conduct experiments showing end-to-end multi-workflow\nanalysis integrating data from Dask and MLFlow in a real distributed deep\nlearning use case for materials science that runs on multiple environments with\nup to 276 GPUs in parallel. We show near-zero overhead running up to 100,000\ntasks on 1,680 CPU cores on the Summit supercomputer.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:20:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Souza","Renan",""],["Skluzacek","Tyler J.",""],["Wilkinson","Sean R.",""],["Ziatdinov","Maxim",""],["da Silva","Rafael Ferreira",""]]}
{"id":"2308.09005","submitter":"Ramij Raja","authors":"Ramij Raja, Majidul Rahaman, Abhirup Datta and Oleg M. Smirnov","title":"A radio bridge connecting the minihalo and phoenix in the Abell 85\n  cluster","comments":"7 pages, 6 Figures, 2 Tables. Accepted for publication in MNRAS-L","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":"  Galaxy clusters are located at the nodes of cosmic filaments and therefore\nhost a lot of hydrodynamical activity. However, cool core clusters are\nconsidered to be relatively relaxed systems without much merging activity. The\nAbell 85 cluster is a unique example where the cluster hosts both a cool core\nand multiple ongoing merging processes. In this work, we used 700 MHz uGMRT as\nwell as MeerKAT L-band observations, carried out as part of the MGCLS, of the\nAbell 85. We reconfirm the presence of a minihalo in the cluster centre at\n700MHz that was recently discovered in MGCLS. Furthermore, we discovered a\nradio bridge connecting the central minihalo and the peripheral radio phoenix.\nThe mean surface brightness, size and flux density of the bridge at 700 MHz is\nfound to be $\\sim 0.14\\ \\mu$Jy/arcsec$^2$, $\\sim 220$ kpc and $\\sim 4.88$ mJy,\nrespectively, with a spectral index of $\\alpha_{700}^{1.28} = -0.92$. Although\nthe origin of the seed relativistic electrons is still unknown, turbulent\nre-acceleration caused by both the spiralling sloshing gas in the intracluster\nmedium (ICM) and the post-shock turbulence from the outgoing merging shock\nassociated with the phoenix formation may be responsible for the bridge.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:22:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Raja","Ramij",""],["Rahaman","Majidul",""],["Datta","Abhirup",""],["Smirnov","Oleg M.",""]]}
{"id":"2308.09006","submitter":"Jisuke Kubo","authors":"Jisuke Kubo and Taichiro Kugo","title":"Unitarity Violation in Field Theories of Lee-Wick's Complex Ghost","comments":"42pages, 7 figures","journal-ref":null,"doi":null,"report-no":"YITP-23-104","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Theories with fourth-order derivatives, including the Lee-Wick finite QED\nmodel and Quadratic Gravity, have a better UV behaviour, but the presence of\nnegative metric ghost modes endanger unitarity. Noticing that the ghost\nacquires a complex mass by radiative corrections, Lee and Wick, in particular,\nclaimed that such complex ghosts would never be created by collisions of\nphysical particles because of energy conservation, so that the physical\nS-matrix unitarity must hold.\n  We investigate the unitarity problem faithfully working in the operator\nformalism of quantum field theory. When complex ghosts participate, a complex\ndelta function (generalization of Dirac delta function) appears at each\ninteraction vertex, which enforces a specific conservation law of complex\nenergy. Its particular property implies that the naive Feynman rule is wrong if\nthe four-momenta are assigned to the internal lines after taking account of the\nconservation law in advance. We show that the complex ghosts are actually\ncreated and unitarity is violated in such fourth-order derivative theories. We\nalso find a definite energy threshold below which the ghosts cannot be created:\nThe theories are unitary and renormalizable below the threshold.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:22:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kubo","Jisuke",""],["Kugo","Taichiro",""]]}
{"id":"2308.09007","submitter":"Vito Vitrih","authors":"Andrea Farahat, Mario Kapl, Alja\\v{z} Kosma\\v{c}, Vito Vitrih","title":"A locally based construction of analysis-suitable $G^1$ multi-patch\n  spline surfaces","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":"  Analysis-suitable $G^1$ (AS-$G^1$) multi-patch spline surfaces [4] are\nparticular $G^1$-smooth multi-patch spline surfaces, which are needed to ensure\nthe construction of $C^1$-smooth multi-patch spline spaces with optimal\npolynomial reproduction properties [16]. We present a novel local approach for\nthe design of AS-$G^1$ multi-patch spline surfaces, which is based on the use\nof Lagrange multipliers. The presented method is simple and generates an\nAS-$G^1$ multi-patch spline surface by approximating a given $G^1$-smooth but\nnon-AS-$G^1$ multi-patch surface. Several numerical examples demonstrate the\npotential of the proposed technique for the construction of AS-$G^1$\nmulti-patch spline surfaces and show that these surfaces are especially suited\nfor applications in isogeometric analysis by solving the biharmonic problem, a\nparticular fourth order partial differential equation, over them.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:22:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Farahat","Andrea",""],["Kapl","Mario",""],["Kosma\u010d","Alja\u017e",""],["Vitrih","Vito",""]]}
{"id":"2308.09008","submitter":"Probit Kalita","authors":"Probit Jyoti Kalita, Pinku Routaray, Sayantan Ghosh, Bharat Kumar","title":"Effects of Delta-Baryons on Neutron Star Oscillations: Exploring f-Mode\n  Frequencies","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we investigate the effects heavy baryons in neutron stars\nusing the DDMEX model within the Density-Dependent Relativistic Mean Field\nTheory (DDRMF). We analyze hyperon-free and $\\Delta$-admixed hypernuclear\nmatter, revealing insights into composition, emergence, and their effects on\nproperties. The nucleon effective mass is influenced by baryon species,\nparticularly $\\Delta$-resonances. Coupling constants impact the equation of\nstate, radius, and maximum mass. Our models align with observations for both\nscenarios. We explore $\\Delta$-resonances role in the dimensionless tidal\ndeformability ($\\Lambda$), and their impact on non-radial $f-$mode oscillation\nfrequency.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:23:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kalita","Probit Jyoti",""],["Routaray","Pinku",""],["Ghosh","Sayantan",""],["Kumar","Bharat",""]]}
{"id":"2308.09009","submitter":"Dennis Kristensen","authors":"Dennis Kristensen, Young Jun Lee, Antonio Mele","title":"Closed-form approximations of moments and densities of continuous-time\n  Markov models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper develops power series expansions of a general class of moment\nfunctions, including transition densities and option prices, of continuous-time\nMarkov processes, including jump--diffusions. The proposed expansions extend\nthe ones in Kristensen and Mele (2011) to cover general Markov processes. We\ndemonstrate that the class of expansions nests the transition density and\noption price expansions developed in Yang, Chen, and Wan (2019) and Wan and\nYang (2021) as special cases, thereby connecting seemingly different ideas in a\nunified framework. We show how the general expansion can be implemented for\nfully general jump--diffusion models. We provide a new theory for the validity\nof the expansions which shows that series expansions are not guaranteed to\nconverge as more terms are added in general. Thus, these methods should be used\nwith caution. At the same time, the numerical studies in this paper demonstrate\ngood performance of the proposed implementation in practice when a small number\nof terms are included.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:25:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kristensen","Dennis",""],["Lee","Young Jun",""],["Mele","Antonio",""]]}
{"id":"2308.09010","submitter":"Bryan Quaife","authors":"Ashley Gannon and Bryan Quaife and Y.-N. Young","title":"Hydrodynamics of Multicomponent Vesicles Under Strong Confinement","comments":null,"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 investigate the hydrodynamics and membrane dynamics of\nmulticomponent vesicles in two strongly confined geometries. This serves as a\nsimplified model for red blood cells undergoing large deformations while\ntraversing narrow constrictions. We propose a new parameterization for the\nbending modulus that remains positive for all lipid phase parameter values. For\na multicomponent vesicle passing through a stenosis, we establish connections\nbetween various properties: lipid phase coarsening, size and flow profile of\nthe lubrication layers, excess pressure, and the tank-treading velocity of the\nmembrane. For a multicomponent vesicle passing through a contracting channel,\nwe find that the lipid always phase separates so that the vesicle is stiffer in\nthe front as it passes through the constriction. For both cases of confinement,\nwe find that lipid coarsening is arrested under strong confinement and proceeds\nat a high rate upon relief from extreme confinement. The results may be useful\nfor efficient sorting lipid domains using microfluidic flows by controlled\nrelease of vesicles passing through strong confinement\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:25:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gannon","Ashley",""],["Quaife","Bryan",""],["Young","Y. -N.",""]]}
{"id":"2308.09011","submitter":"Blas Fern\\'andez","authors":"Blas Fern\\'andez, Marija Maksimovi\\'c and Sanja Rukavina","title":"Characterizing bipartite distance-regularized graphs with vertices of\n  eccentricity 4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The characterization of bipartite distance-regularized graphs, where some\nvertices have eccentricity less than four, in terms of the incidence structures\nof which they are incidence graphs, is known. In this paper we prove that there\nis a one-to-one correspondence between the incidence graphs of quasi-symmetric\nSPBIBDs with parameters $(v,b,r,k, \\lambda_1,0)$ of type $(k-1,t)$ with\nintersection numbers $x=0$ and $y>0$, where $0< y\\leq t<k$ , and bipartite\ndistance-regularized graphs with $D=D'=4$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:25:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fern\u00e1ndez","Blas",""],["Maksimovi\u0107","Marija",""],["Rukavina","Sanja",""]]}
{"id":"2308.09012","submitter":"Yulin Su","authors":"Yulin Su, Min Yang, Minghui Qiu, Jing Wang, Tao Wang","title":"FashionLOGO: Prompting Multimodal Large Language Models for Fashion Logo\n  Embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Logo embedding plays a crucial role in various e-commerce applications by\nfacilitating image retrieval or recognition, such as intellectual property\nprotection and product search. However, current methods treat logo embedding as\na purely visual problem, which may limit their performance in real-world\nscenarios. A notable issue is that the textual knowledge embedded in logo\nimages has not been adequately explored. Therefore, we propose a novel approach\nthat leverages textual knowledge as an auxiliary to improve the robustness of\nlogo embedding. The emerging Multimodal Large Language Models (MLLMs) have\ndemonstrated remarkable capabilities in both visual and textual understanding\nand could become valuable visual assistants in understanding logo images.\nInspired by this observation, our proposed method, FashionLOGO, aims to utilize\nMLLMs to enhance fashion logo embedding. We explore how MLLMs can improve logo\nembedding by prompting them to generate explicit textual knowledge through\nthree types of prompts, including image OCR, brief captions, and detailed\ndescriptions prompts, in a zero-shot setting. We adopt a cross-attention\ntransformer to enable image embedding queries to learn supplementary knowledge\nfrom textual embeddings automatically. To reduce computational costs, we only\nuse the image embedding model in the inference stage, similar to traditional\ninference pipelines. Our extensive experiments on three real-world datasets\ndemonstrate that FashionLOGO learns generalized and robust logo embeddings,\nachieving state-of-the-art performance in all benchmark datasets. Furthermore,\nwe conduct comprehensive ablation studies to demonstrate the performance\nimprovements resulting from the introduction of MLLMs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:30:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Su","Yulin",""],["Yang","Min",""],["Qiu","Minghui",""],["Wang","Jing",""],["Wang","Tao",""]]}
{"id":"2308.09013","submitter":"Carlos Lima Azevedo","authors":"Antoine Dubois, Carlos Lima Azevedo, Sonja Haustein and Bruno Miranda","title":"Deep-seeded Clustering for Unsupervised Valence-Arousal Emotion\n  Recognition from Physiological Signals","comments":"7 pages, 1 figure, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emotions play a significant role in the cognitive processes of the human\nbrain, such as decision making, learning and perception. The use of\nphysiological signals has shown to lead to more objective, reliable and\naccurate emotion recognition combined with raising machine learning methods.\nSupervised learning methods have dominated the attention of the research\ncommunity, but the challenge in collecting needed labels makes emotion\nrecognition difficult in large-scale semi- or uncontrolled experiments.\nUnsupervised methods are increasingly being explored, however sub-optimal\nsignal feature selection and label identification challenges unsupervised\nmethods' accuracy and applicability. This article proposes an unsupervised deep\ncluster framework for emotion recognition from physiological and psychological\ndata. Tests on the open benchmark data set WESAD show that deep k-means and\ndeep c-means distinguish the four quadrants of Russell's circumplex model of\naffect with an overall accuracy of 87%. Seeding the clusters with the subject's\nsubjective assessments helps to circumvent the need for labels.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:37:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dubois","Antoine",""],["Azevedo","Carlos Lima",""],["Haustein","Sonja",""],["Miranda","Bruno",""]]}
{"id":"2308.09014","submitter":"Christopher Manon","authors":"Courtney George and Christopher Manon","title":"Positivity properties of divisors on Toric Vector Bundles","comments":"30 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use presentations of the Cox rings of projectivized toric vector bundles\nand elements of matroid theory to compute Newton-Okounkov bodies, effective\ncones, and nef cones of these spaces. As an application we analyze the Fano\nproperty and establish Fujita's freeness and ampleness conjectures for several\nclasses of projectivized toric vector bundles.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:39:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["George","Courtney",""],["Manon","Christopher",""]]}
{"id":"2308.09015","submitter":"Talha Bin Masood","authors":"Jochen Jankowai, Talha Bin Masood, and Ingrid Hotz","title":"Multi-field Visualisation via Trait-induced Merge Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we propose trait-based merge trees a generalization of merge\ntrees to feature level sets, targeting the analysis of tensor field or general\nmulti-variate data. For this, we employ the notion of traits defined in\nattribute space as introduced in the feature level sets framework. The\nresulting distance field in attribute space induces a scalar field in the\nspatial domain that serves as input for topological data analysis. The leaves\nin the merge tree represent those areas in the input data that are closest to\nthe defined trait and thus most closely resemble the defined feature. Hence,\nthe merge tree yields a hierarchy of features that allows for querying the most\nrelevant and persistent features. The presented method includes different query\nmethods for the tree which enable the highlighting of different aspects. We\ndemonstrate the cross-application capabilities of this approach with three case\nstudies from different domains.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:40:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jankowai","Jochen",""],["Masood","Talha Bin",""],["Hotz","Ingrid",""]]}
{"id":"2308.09016","submitter":"Pierre-Henri Chavanis","authors":"Pierre-Henri Chavanis","title":"Kinetic theory of inhomogeneous systems with long-range interactions and\n  fluctuation-dissipation theorem","comments":"arXiv admin note: substantial text overlap with arXiv:2211.14353","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We complete the kinetic theory of inhomogeneous systems with long-range\ninteractions initiated in previous works. We use a simpler and more physical\nformalism. We consider a system of particles submitted to a small external\nstochastic perturbation and determine the response of the system to the\nperturbation. We derive the diffusion tensor and the friction by polarization\nof a test particle. We introduce a general Fokker-Planck equation involving a\ndiffusion term and a friction term. When the friction by polarization can be\nneglected, we obtain a secular dressed diffusion (SDD) equation sourced by the\nexternal noise. When the external perturbation is created by a discrete\ncollection of $N$ field particles, we obtain the inhomogeneous Lenard-Balescu\nkinetic equation reducing to the inhomogeneous Landau kinetic equation when\ncollective effects are neglected. We consider a multi-species system of\nparticles. When the field particles are at statistical equilibrium (thermal\nbath), we establish the proper expression of the fluctuation-dissipation\ntheorem for systems with long-range interactions relating the power spectrum of\nthe fluctuations to the response function of the system. In that case, the\nfriction and diffusion coefficients satisfy the Einstein relation and the\nFokker-Planck equation reduces to the inhomogeneous Kramers equation. We also\nconsider a gas of Brownian particles with long-range interactions described by\n$N$ coupled stochastic Langevin equations and determine its mean and mesoscopic\nevolution. We discuss the notion of stochastic kinetic equations and the role\nof fluctuations possibly triggering random transitions from one equilibrium\nstate to the other. Our presentation parallels the one given for\ntwo-dimensional point vortices in a previous paper [P.H. Chavanis, Eur. Phys.\nJ. Plus 138, 136 (2023)].\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:41:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chavanis","Pierre-Henri",""]]}
{"id":"2308.09017","submitter":"Christopher Manon","authors":"Courtney George and Christopher Manon","title":"Algebra and Geometry of Irreducible toric vector bundles of rank $n$ on\n  $\\mathbb{P}^n$","comments":"18 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a presentation for the Cox ring of the projectivization\n$\\mathbb{P}\\mathcal{E}$ of any rank $n$ irreducible toric vector bundle on\n$\\mathbb{P}^n$. We use this presentation to show that $\\mathbb{P}\\mathcal{E}$\nalways satisfies Fujita's freeness and ampleness conjectures.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:44:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["George","Courtney",""],["Manon","Christopher",""]]}
{"id":"2308.09018","submitter":"Pablo Tieben","authors":"Pablo Tieben and Andreas W. Schell","title":"Fingerprinting Defects in Hexagonal Boron Nitride via Multi-Phonon\n  Excitation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single photon emitters in hexagonal boron nitride have gathered a lot of\nattention due to their favourable emission properties and the manifold of\npossible applications. Despite extensive scientific effort, the exact atomic\norigin of these emitters has remained unkown thus far. Recently, several\nstudies have tied the emission in the yellow spectral region to carbon-related\ndefects, but the exact atomic structure of the defects remains elusive. In this\nstudy, photoluminescence emission and excitation spectroscopy is performed on a\nlarge number of emitters within this region. By comparison of the experimental\ndata with theoretical predictions, the origin of yellow single photon emission\nin hexagonal boron nitride is determined. Knowledge of this atomic structure\nand its optical properties is crucial for the reliable implementation of these\nemitters in quantum technologies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:47:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tieben","Pablo",""],["Schell","Andreas W.",""]]}
{"id":"2308.09019","submitter":"Davide Bonaventura","authors":"Davide Bonaventura, Sergio Esposito and Giampaolo Bella","title":"Smart Bulbs can be Hacked to Hack into your Household","comments":null,"journal-ref":"In Proceedings of the 20th International Conference on Security\n  and Cryptography (2023), ISBN 978-989-758-666-8, ISSN 2184-7711, pages\n  218-229","doi":"10.5220/0012092900003555","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IoT is getting more and more pervasive. Even the simplest devices, such\nas a light bulb or an electrical plug, are made \"smart\" and controllable by our\nsmartphone. This paper describes the findings obtained by applying the PETIoT\nkill chain to conduct a Vulnerability Assessment and Penetration Testing\nsession on a smart bulb, the Tapo L530E by Tp-Link, currently best seller on\nAmazon Italy. We found that four vulnerabilities affect the bulb, two of High\nseverity and two of Medium severity according to the CVSS v3.1 scoring system.\nIn short, authentication is not well accounted for and confidentiality is\ninsufficiently achieved by the implemented cryptographic measures. In\nconsequence, an attacker who is nearby the bulb can operate at will not just\nthe bulb but all devices of the Tapo family that the user may have on her Tapo\naccount. Moreover, the attacker can learn the victim's Wi-Fi password, thereby\nescalating his malicious potential considerably. The paper terminates with an\noutline of possible fixes.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:48:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bonaventura","Davide",""],["Esposito","Sergio",""],["Bella","Giampaolo",""]]}
{"id":"2308.09020","submitter":"Leo Tsukada","authors":"Leo Tsukada","title":"Extension of the Bayesian searches for anisotropic stochastic\n  gravitational-wave background with non-tensorial polarizations","comments":"20 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent announcement of strong evidence for a stochastic\ngravitational-wave background (SGWB) by various pulsar timing array\ncollaborations has highlighted this signal as a promising candidate for future\nobservations. Despite its non-detection by ground-based detectors such as\nAdvanced LIGO and Advanced Virgo, Callister \\textit{et\nal.}~\\cite{tom_nongr_method} developed a Bayesian formalism to search for an\nisotropic SGWB with non-tensorial polarizations, imposing constraints on signal\namplitude in those components that violate general relativity using LIGO's\ndata. Since our ultimate aim is to estimate the spatial distribution of\ngravitational-wave sources, we have extended this existing method to allow for\nanisotropic components in signal models. We then examined the potential\nbenefits from including these additional components. Using injection campaigns,\nwe found that introducing anisotropic components into a signal model led to\nmore significant identification of the signal itself and violations of general\nrelativity. Moreover, the results of our Bayesian parameter estimation\nsuggested that anisotropic components aid in breaking down degeneracies between\ndifferent polarization components, allowing us to infer model parameters more\nprecisely than through an isotropic analysis. In contrast, constraints on\nsignal amplitude remained comparable in the absence of such a signal. Although\nthese results might depend on the assumed source distribution on the sky, such\nas the Galactic plane, the formalism presented in this work has laid a\nfoundation for establishing a generalized Bayesian analysis for an SGWB,\nincluding its anisotropies and non-tensorial polarizations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:49:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tsukada","Leo",""]]}
{"id":"2308.09021","submitter":"Zipei Nie","authors":"Zhiyi Huang, Chris Lambert, Zipei Nie, Richard Peng","title":"Simpler Analyses of Union-Find","comments":"13 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze union-find using potential functions motivated by continuous\nalgorithms, and give alternate proofs of the $O(\\log\\log{n})$, $O(\\log^{*}n)$,\n$O(\\log^{**}n)$, and $O(\\alpha(n))$ amortized cost upper bounds. The proof of\nthe $O(\\log\\log{n})$ amortized bound goes as follows. Let each node's potential\nbe the square root of its size, i.e., the size of the subtree rooted from it.\nThe overall potential increase is $O(n)$ because the node sizes increase\ngeometrically along any tree path. When compressing a path, each node on the\npath satisfies that either its potential decreases by $\\Omega(1)$, or its\nchild's size along the path is less than the square root of its size: this can\nhappen at most $O(\\log\\log{n})$ times along any tree path.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:49:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Zhiyi",""],["Lambert","Chris",""],["Nie","Zipei",""],["Peng","Richard",""]]}
{"id":"2308.09022","submitter":"Zhiwei Wei","authors":"Song Zhang, Wenjia Xu, Zhiwei Wei, Lili Zhang, Yang Wang, Junyi Liu","title":"ARAI-MVSNet: A multi-view stereo depth estimation network with adaptive\n  depth range and depth interval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-View Stereo~(MVS) is a fundamental problem in geometric computer vision\nwhich aims to reconstruct a scene using multi-view images with known camera\nparameters. However, the mainstream approaches represent the scene with a fixed\nall-pixel depth range and equal depth interval partition, which will result in\ninadequate utilization of depth planes and imprecise depth estimation. In this\npaper, we present a novel multi-stage coarse-to-fine framework to achieve\nadaptive all-pixel depth range and depth interval. We predict a coarse depth\nmap in the first stage, then an Adaptive Depth Range Prediction module is\nproposed in the second stage to zoom in the scene by leveraging the reference\nimage and the obtained depth map in the first stage and predict a more accurate\nall-pixel depth range for the following stages. In the third and fourth stages,\nwe propose an Adaptive Depth Interval Adjustment module to achieve adaptive\nvariable interval partition for pixel-wise depth range. The depth interval\ndistribution in this module is normalized by Z-score, which can allocate dense\ndepth hypothesis planes around the potential ground truth depth value and vice\nversa to achieve more accurate depth estimation. Extensive experiments on four\nwidely used benchmark datasets~(DTU, TnT, BlendedMVS, ETH 3D) demonstrate that\nour model achieves state-of-the-art performance and yields competitive\ngeneralization ability. Particularly, our method achieves the highest Acc and\nOverall on the DTU dataset, while attaining the highest Recall and\n$F_{1}$-score on the Tanks and Temples intermediate and advanced dataset.\nMoreover, our method also achieves the lowest $e_{1}$ and $e_{3}$ on the\nBlendedMVS dataset and the highest Acc and $F_{1}$-score on the ETH 3D dataset,\nsurpassing all listed methods.Project website:\nhttps://github.com/zs670980918/ARAI-MVSNet\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:52:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Song",""],["Xu","Wenjia",""],["Wei","Zhiwei",""],["Zhang","Lili",""],["Wang","Yang",""],["Liu","Junyi",""]]}
{"id":"2308.09023","submitter":"Abdul Wahid","authors":"Nawazish Ali, Abdul Wahid, Rachael shaw, Karl Mason","title":"Reinforcement Learning for Battery Management in Dairy Farming","comments":"This paper has been accepted at the 2023 Artificial Intelligence for\n  Sustainability (AI4S) Workshop, at 26th European Conference on Artificial\n  Intelligence ECAI 2023","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":"  Dairy farming is a particularly energy-intensive part of the agriculture\nsector. Effective battery management is essential for renewable integration\nwithin the agriculture sector. However, controlling battery\ncharging/discharging is a difficult task due to electricity demand variability,\nstochasticity of renewable generation, and energy price fluctuations. Despite\nthe potential benefits of applying Artificial Intelligence (AI) to renewable\nenergy in the context of dairy farming, there has been limited research in this\narea. This research is a priority for Ireland as it strives to meet its\ngovernmental goals in energy and sustainability. This research paper utilizes\nQ-learning to learn an effective policy for charging and discharging a battery\nwithin a dairy farm setting. The results demonstrate that the developed policy\nsignificantly reduces electricity costs compared to the established baseline\nalgorithm. These findings highlight the effectiveness of reinforcement learning\nfor battery management within the dairy farming sector.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:52:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ali","Nawazish",""],["Wahid","Abdul",""],["shaw","Rachael",""],["Mason","Karl",""]]}
{"id":"2308.09024","submitter":"Seongyeon Kim","authors":"Seongyeon Kim, Hyeongjin Lee, Ihyeok Seo","title":"On Dirac equations with Hartree type nonlinearity in modulation spaces","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain well-posedness for Dirac equations with a Hartree-type nonlinearity\nderived by decoupling the Dirac-Klein-Gordon system. We extend the function\nspace of initial data, enabling us to handle initial data that were not\naddressed in previous studies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:52:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Seongyeon",""],["Lee","Hyeongjin",""],["Seo","Ihyeok",""]]}
{"id":"2308.09025","submitter":"Florian Alexander Mausolf","authors":"Johannes Erdmann, Aaron van der Graaf, Florian Mausolf, Olaf\n  Nackenhorst","title":"SR-GAN for SR-gamma: photon super resolution at collider experiments","comments":"24 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex cs.CV physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study single-image super-resolution algorithms for photons at collider\nexperiments based on generative adversarial networks. We treat the energy\ndepositions of simulated electromagnetic showers of photons and neutral-pion\ndecays in a toy electromagnetic calorimeter as 2D images and we train\nsuper-resolution networks to generate images with an artificially increased\nresolution by a factor of four in each dimension. The generated images are able\nto reproduce features of the electromagnetic showers that are not obvious from\nthe images at nominal resolution. Using the artificially-enhanced images for\nthe reconstruction of shower-shape variables and of the position of the shower\ncenter results in significant improvements. We additionally investigate the\nutilization of the generated images as a pre-processing step for deep-learning\nphoton-identification algorithms and observe improvements in the case of low\ntraining statistics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:55:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Erdmann","Johannes",""],["van der Graaf","Aaron",""],["Mausolf","Florian",""],["Nackenhorst","Olaf",""]]}
{"id":"2308.09026","submitter":"Berke Doga Basaran","authors":"Berke Doga Basaran, Weitong Zhang, Mengyun Qiao, Bernhard Kainz, Paul\n  M. Matthews, Wenjia Bai","title":"LesionMix: A Lesion-Level Data Augmentation Method for Medical Image\n  Segmentation","comments":"13 pages, 5 figures, 4 tables, MICCAI DALI Workshop 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":"  Data augmentation has become a de facto component of deep learning-based\nmedical image segmentation methods. Most data augmentation techniques used in\nmedical imaging focus on spatial and intensity transformations to improve the\ndiversity of training images. They are often designed at the image level,\naugmenting the full image, and do not pay attention to specific abnormalities\nwithin the image. Here, we present LesionMix, a novel and simple lesion-aware\ndata augmentation method. It performs augmentation at the lesion level,\nincreasing the diversity of lesion shape, location, intensity and load\ndistribution, and allowing both lesion populating and inpainting. Experiments\non different modalities and different lesion datasets, including four brain MR\nlesion datasets and one liver CT lesion dataset, demonstrate that LesionMix\nachieves promising performance in lesion image segmentation, outperforming\nseveral recent Mix-based data augmentation methods. The code will be released\nat https://github.com/dogabasaran/lesionmix.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 14:56:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Basaran","Berke Doga",""],["Zhang","Weitong",""],["Qiao","Mengyun",""],["Kainz","Bernhard",""],["Matthews","Paul M.",""],["Bai","Wenjia",""]]}
{"id":"2308.09027","submitter":"Roger Wesson","authors":"R. Wesson, Mikako Matsuura, Albert A. Zijlstra, Kevin Volk, Patrick J.\n  Kavanagh, Guillermo Garc\\'ia-Segura, I. McDonald, Raghvendra Sahai, M. J.\n  Barlow, Nick L. J. Cox, Jeronimo Bernard-Salas, Isabel Aleman, Jan Cami,\n  Nicholas Clark, Harriet L. Dinerstein, K. Justtanont, Kyle F. Kaplan, A.\n  Manchado, Els Peeters, Griet C. Van de Steene, Peter A. M. van Hoof","title":"JWST observations of the Ring Nebula (NGC 6720): I. Imaging of the\n  rings, globules, and arcs","comments":"25 pages, 23 figures. Submitted to Monthly Notices of the Royal\n  Astronomical Society. Corrected typos in metadata","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present JWST images of the well-known planetary nebula NGC 6720 (the Ring\nNebula), covering wavelengths from 1.6$\\mu$m to 25 $\\mu$m. The bright shell is\nstrongly fragmented with some 20 000 dense globules, bright in H$_2$, with a\ncharacteristic diameter of 0.2 arcsec and density $n_{\\rm H} \\sim 10^5$-$10^6$\ncm$^{-3}$. The shell contains a thin ring of polycyclic aromatic hydrocarbon\n(PAH) emission. H$_2$ is found throughout the shell and in the halo. H$_2$ in\nthe halo may be located on the swept-up walls of a biconal polar flow. The\ncentral cavity is shown to be filled with high ionization gas and shows two\nlinear structures. The central star is located 2 arcsec from the emission\ncentroid of the cavity and shell. Linear features (`spikes') extend outward\nfrom the ring, pointing away from the central star. Hydrodynamical simulations\nare shown which reproduce the clumping and possibly the spikes. Around ten\nlow-contrast, regularly spaced concentric arc-like features are present; they\nsuggest orbital modulation by a low-mass companion with a period of about 280\nyr. A previously known much wider companion is located at a projected\nseparation of about 15 000 au; we show that it is an M2-M4 dwarf. The system is\ntherefore a triple star. These features, including the multiplicity, are\nsimilar to those seen in the Southern Ring Nebula (NGC 3132) and may be a\ncommon aspect of such nebulae.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:01:55 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 08:07:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wesson","R.",""],["Matsuura","Mikako",""],["Zijlstra","Albert A.",""],["Volk","Kevin",""],["Kavanagh","Patrick J.",""],["Garc\u00eda-Segura","Guillermo",""],["McDonald","I.",""],["Sahai","Raghvendra",""],["Barlow","M. J.",""],["Cox","Nick L. J.",""],["Bernard-Salas","Jeronimo",""],["Aleman","Isabel",""],["Cami","Jan",""],["Clark","Nicholas",""],["Dinerstein","Harriet L.",""],["Justtanont","K.",""],["Kaplan","Kyle F.",""],["Manchado","A.",""],["Peeters","Els",""],["Van de Steene","Griet C.",""],["van Hoof","Peter A. M.",""]]}
{"id":"2308.09028","submitter":"Roger Wesson","authors":"R. Wesson, A. M. Bevan, M.J. Barlow, I. De Looze, M. Matsuura, G.\n  Clayton, J. Andrews","title":"Evidence for late-time dust formation in the ejecta of supernova\n  SN~1995N from emission-line asymmetries","comments":"14 pages, 16 figures. Accepted for publication in Monthly Notices of\n  the Royal Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a study of the dust associated with the core-collapse supernova\nSN~1995N. Infrared emission detected 14--15 years after the explosion was\npreviously attributed to thermally echoing circumstellar material associated\nwith the SN progenitor. We argue that this late-time emission is unlikely to be\nan echo, and is more plausibly explained by newly formed dust in the supernova\nejecta, indirectly heated by the interaction between the ejecta and the CSM.\nFurther evidence in support of this scenario comes from emission line profiles\nin spectra obtained 22 years after the explosion; these are asymmetric, showing\ngreater attenuation on the red wing, consistent with absorption by dust within\nthe expanding ejecta. The spectral energy distribution and emission line\nprofiles at epochs later than $\\sim$5000 days are both consistent with the\npresence of about 0.4~M$_\\odot$ of amorphous carbon dust. The onset of dust\nformation is apparent in archival optical spectra, taken between 700 and 1700\ndays after the assumed explosion date. As this is considerably later than most\nother instances where the onset of dust formation has been detected, we argue\nthat the explosion date must be later than previously assumed.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:02:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wesson","R.",""],["Bevan","A. M.",""],["Barlow","M. J.",""],["De Looze","I.",""],["Matsuura","M.",""],["Clayton","G.",""],["Andrews","J.",""]]}
{"id":"2308.09029","submitter":"Yuxin Zhang","authors":"Yuxin Zhang, Sen Chen, Lingling Fan, Chunyang Chen, Xiaohong Li","title":"Automated and Context-Aware Repair of Color-Related Accessibility Issues\n  for Android Apps","comments":"11 pages plus 2 additional pages for references","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Approximately 15% of the world's population is suffering from various\ndisabilities or impairments. However, many mobile UX designers and developers\ndisregard the significance of accessibility for those with disabilities when\ndeveloping apps. A large number of studies and some effective tools for\ndetecting accessibility issues have been conducted and proposed to mitigate\nsuch a severe problem. However, compared with detection, the repair work is\nobviously falling behind. Especially for the color-related accessibility\nissues, which is one of the top issues in apps with a greatly negative impact\non vision and user experience. Apps with such issues are difficult to use for\npeople with low vision and the elderly. Unfortunately, such an issue type\ncannot be directly fixed by existing repair techniques. To this end, we propose\nIris, an automated and context-aware repair method to fix the color-related\naccessibility issues (i.e., the text contrast issues and the image contrast\nissues) for apps. By leveraging a novel context-aware technique that resolves\nthe optimal colors and a vital phase of attribute-to-repair localization, Iris\nnot only repairs the color contrast issues but also guarantees the consistency\nof the design style between the original UI page and repaired UI page. Our\nexperiments unveiled that Iris can achieve a 91.38% repair success rate with\nhigh effectiveness and efficiency. The usefulness of Iris has also been\nevaluated by a user study with a high satisfaction rate as well as developers'\npositive feedback. 9 of 40 submitted pull requests on GitHub repositories have\nbeen accepted and merged into the projects by app developers, and another 4\ndevelopers are actively discussing with us for further repair. Iris is publicly\navailable to facilitate this new research direction.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:03:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Yuxin",""],["Chen","Sen",""],["Fan","Lingling",""],["Chen","Chunyang",""],["Li","Xiaohong",""]]}
{"id":"2308.09030","submitter":"Fritz Laux","authors":"Fritz Laux and Martti Laiho","title":"SQL Access Patterns for Optimistic Concurrency Control","comments":"5 pages, 1 figure","journal-ref":"2009 Computation World: Future Computing, Service Computation,\n  Cognitive, Adaptive, Content, Patterns","doi":"10.1109/ComputationWorld.2009.63","report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transaction processing is of growing importance for mobile and web\napplications. Booking tickets, flight reservation, e-Banking, e-Payment, and\nbooking holiday arrangements are just a few examples. Due to temporarily\ndisconnected situations the synchronization and consistent transaction\nprocessing are key issues. To avoid difficulties with blocked transactions or\ncommunication loss several authors and technology providers have recommended to\nuse Optimistic Concurrency Control (OCC) to solve the problem. However most\nvendors of Relational Database Management Systems (DBMS) implemented only\nlocking schemes for concurrency control which prohibit the immediate use of\nOCC. We propose Row Version Verifying (RVV) discipline to avoid lost updates\nand achieve a kind of OCC for those DBMS not providing an adequate non-blocking\nconcurrency control. Moreover, the different mechanisms are categorized as\naccess pattern in order to provide programmers with a general guideline for SQL\ndatabases. The proposed SQL access patterns are relevant for all transactional\napplications with unreliable communication and low conflicting situations. We\ndemonstrate the proposed solution using mainstream database systems like\nOracle, DB2, and SQLServer.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:04:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Laux","Fritz",""],["Laiho","Martti",""]]}
{"id":"2308.09031","submitter":"Karthik Vedula","authors":"Andrey Khesin, Andrew Tung, Karthik Vedula","title":"New Properties of Intrinsic Information and Their Relation to Bound\n  Secrecy","comments":"23 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CR math.IT quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The secret-key rate measures the rate at which Alice and Bob can extract\nsecret bits from sampling a joint probability distribution, unknown to an\neavesdropper Eve. The secret-key rate has been bounded above by the intrinsic\ninformation and reduced intrinsic information. However, we prove that the\nreduced intrinsic information is 0 if and only if the intrinsic information is\n0. This result implies that at least one of the following two conjectures is\nfalse: bound secrecy exists, or the reduced intrinsic information equals the\nsecret-key rate. We give an explicit construction of an information-erasing\nbinarization for a candidate for bound secrecy. We then introduce some\napproaches for proving the existence of bound secrecy, such as reducing the\nchannel space, linearly transforming Bob's map, and perturbing a channel for\nEve.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:10:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khesin","Andrey",""],["Tung","Andrew",""],["Vedula","Karthik",""]]}
{"id":"2308.09032","submitter":"Michael LaHaye","authors":"Zhenwei Lyu and Michael LaHaye and Huan Yang and B\\'eatrice Bonga","title":"Probing Spin-Induced Quadrupole Moments in Precessing Compact Binaries","comments":"14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"LIGO-P2300223","categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spin-induced quadrupole moments provide an important characterization of\ncompact objects, such as black holes, neutron stars and black hole mimickers\ninspired by additional fields and/or modified theories of gravity. Black holes\nin general relativity have a specific spin-induced quadrupole moment, with\nother objects potentially having differing values. Different values of this\nquadrupole moment lead to modifications of the spin precession dynamics, and\nconsequently modifications to the inspiral waveform. Based on the spin-dynamics\nand the associated precessing waveform developed in our previous work, we\nassess the prospects of measuring spin-induced moments in various black hole,\nneutron star, and black-hole mimicker binaries. We focus on binaries in which\nat least one of the objects is in the mass-gap (similar to the $2.6 M_\\odot$\nobject found in GW190814). We find that for generic precessing binaries, the\neffect of the spin-induced quadrupole moments on the precession is sensitive to\nthe nature of the mass-gap object, i.e., whether it is a light black hole or a\nmassive neutron star. So that this is a good probe of the nature of these\nobjects. For precessing black-hole mimicker binaries, this waveform also\nprovides significantly tighter constraints on their spin-induced quadrupole\nmoments than the previous results obtained without incorporating the precession\neffects of spin-induced quadrupole moments. We apply the waveform to sample\nevents in GWTC catalogs to obtain better constraints on the spin-induced\nquadrupole moments, and discuss the measurement prospects for events in the\nO$4$ run of the LIGO-Virgo-KAGRA collaboration.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:14:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lyu","Zhenwei",""],["LaHaye","Michael",""],["Yang","Huan",""],["Bonga","B\u00e9atrice",""]]}
{"id":"2308.09033","submitter":"Fawaz Sammani","authors":"Fawaz Sammani, Nikos Deligiannis","title":"Uni-NLX: Unifying Textual Explanations for Vision and Vision-Language\n  Tasks","comments":"Accepted to ICCVW 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Natural Language Explanations (NLE) aim at supplementing the prediction of a\nmodel with human-friendly natural text. Existing NLE approaches involve\ntraining separate models for each downstream task. In this work, we propose\nUni-NLX, a unified framework that consolidates all NLE tasks into a single and\ncompact multi-task model using a unified training objective of text generation.\nAdditionally, we introduce two new NLE datasets: 1) ImageNetX, a dataset of\n144K samples for explaining ImageNet categories, and 2) VQA-ParaX, a dataset of\n123K samples for explaining the task of Visual Question Answering (VQA). Both\ndatasets are derived leveraging large language models (LLMs). By training on\nthe 1M combined NLE samples, our single unified framework is capable of\nsimultaneously performing seven NLE tasks including VQA, visual recognition and\nvisual reasoning tasks with 7X fewer parameters, demonstrating comparable\nperformance to the independent task-specific models in previous approaches, and\nin certain tasks even outperforming them. Code is at\nhttps://github.com/fawazsammani/uni-nlx\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:15:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sammani","Fawaz",""],["Deligiannis","Nikos",""]]}
{"id":"2308.09034","submitter":"Jin-Ke Bao Dr.","authors":"Chenfei Shi, Yi Liu, Bishal Baran Maity, Qi Wang, Surya Rohith Kotla,\n  Sitaram Ramakrishnan, Claudio Eisele, Harshit Agarwal, Leila Noohinejad, Qian\n  Tao, Baojuan Kang, Zhefeng Lou, Xiaohui Yang, Yanpeng Qi, Xiao Lin, Zhu-An\n  Xu, A. Thamizhavel, Guang-Han Cao, Sander van Smaalen, Shixun Cao, and Jin-Ke\n  Bao","title":"Disordered structure for long-range charge density wave order in\n  annealed crystals of magnetic kagome FeGe","comments":"18 pages, 4 figures. 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":"  Recently, charge density wave (CDW) has been observed well below the order of\nantiferromagnetism (AFM) in kagome FeGe in which magnetism and CDW are\nintertwined to form an emergent quantum ground state. The mechanism of CDW\nprecipitating from an A-type AFM of Fe kagome sublattice is intensively\ndebated. The structural distortion originating from the CDW has yet to be\naccurately determined in FeGe. Here we resolved the structure model of the CDW\nin annealed FeGe crystals through single crystal x-ray diffraction via a\nsynchrotron radiation source. The annealed crystals exhibit strong CDW\ntransition signals exemplified by sharp magnetic susceptibility drop and\nspecific heat jump, as well as intense superlattice reflections from 2 $\\times$\n2 $\\times$ 2 CDW order. Occupational disorder of Ge atoms resulting from\nshort-range CDW correlations above $T_\\mathrm{CDW}$ has also been identified\nfrom the structure refinements. The dimerization of Ge atoms along c axis has\nbeen demonstrated to be the dominant distortion for CDW. The Fe kagome and Ge\nhoneycomb sublattices only undergo subtle distortions. Occupational disorder of\nGe atoms is also proved to exist in the CDW phase due to the random selection\nof partial Ge sites to be dimerized to realize the structural distortion. Our\nwork paves the way to understanding the unconventional nature of CDW in FeGe\nnot only by solving the structural distortion below $T_\\mathrm{CDW}$ and\nidentifying fluctuations above it but also by rationalizing the synthesis of\nhigh-quality crystals for in-depth investigations in the future.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:16:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shi","Chenfei",""],["Liu","Yi",""],["Maity","Bishal Baran",""],["Wang","Qi",""],["Kotla","Surya Rohith",""],["Ramakrishnan","Sitaram",""],["Eisele","Claudio",""],["Agarwal","Harshit",""],["Noohinejad","Leila",""],["Tao","Qian",""],["Kang","Baojuan",""],["Lou","Zhefeng",""],["Yang","Xiaohui",""],["Qi","Yanpeng",""],["Lin","Xiao",""],["Xu","Zhu-An",""],["Thamizhavel","A.",""],["Cao","Guang-Han",""],["van Smaalen","Sander",""],["Cao","Shixun",""],["Bao","Jin-Ke",""]]}
{"id":"2308.09035","submitter":"Edwin Barnes","authors":"Chenxu Liu, Rafail Frantzeskakis, Sophia E. Economou, Edwin Barnes","title":"Protocol for nearly deterministic parity projection on two photonic\n  qubits","comments":"12+6 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Photonic parity projection plays a significant role in photonic quantum\ninformation processing. Non-destructive parity projections normally require\nhigh-fidelity Controlled-Z gates between photonic and matter qubits, which can\nbe experimentally demanding. In this paper, we propose a nearly deterministic\nparity projection protocol on two photonic qubits which only requires stable\nmatter-photon Controlled-Phase gates. The fact that our protocol does not\nrequire perfect Controlled-Z gates makes it more amenable to experimental\nimplementation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:17:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Chenxu",""],["Frantzeskakis","Rafail",""],["Economou","Sophia E.",""],["Barnes","Edwin",""]]}
{"id":"2308.09036","submitter":"Liang Pan","authors":"Liang Pan, Jingbo Wang, Buzhen Huang, Junyu Zhang, Haofan Wang, Xu\n  Tang, Yangang Wang","title":"Synthesizing Physically Plausible Human Motions in 3D Scenes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Synthesizing physically plausible human motions in 3D scenes is a challenging\nproblem. Kinematics-based methods cannot avoid inherent artifacts (e.g.,\npenetration and foot skating) due to the lack of physical constraints.\nMeanwhile, existing physics-based methods cannot generalize to multi-object\nscenarios since the policy trained with reinforcement learning has limited\nmodeling capacity. In this work, we present a framework that enables physically\nsimulated characters to perform long-term interaction tasks in diverse,\ncluttered, and unseen scenes. The key idea is to decompose human-scene\ninteractions into two fundamental processes, Interacting and Navigating, which\nmotivates us to construct two reusable Controller, i.e., InterCon and NavCon.\nSpecifically, InterCon contains two complementary policies that enable\ncharacters to enter and leave the interacting state (e.g., sitting on a chair\nand getting up). To generate interaction with objects at different places, we\nfurther design NavCon, a trajectory following policy, to keep characters'\nlocomotion in the free space of 3D scenes. Benefiting from the divide and\nconquer strategy, we can train the policies in simple environments and\ngeneralize to complex multi-object scenes. Experimental results demonstrate\nthat our framework can synthesize physically plausible long-term human motions\nin complex 3D scenes. Code will be publicly released at\nhttps://github.com/liangpan99/InterScene.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:17:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pan","Liang",""],["Wang","Jingbo",""],["Huang","Buzhen",""],["Zhang","Junyu",""],["Wang","Haofan",""],["Tang","Xu",""],["Wang","Yangang",""]]}
{"id":"2308.09037","submitter":"Tiberiu Sosea","authors":"Tiberiu Sosea, Cornelia Caragea","title":"MarginMatch: Improving Semi-Supervised Learning with Pseudo-Margins","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce MarginMatch, a new SSL approach combining consistency\nregularization and pseudo-labeling, with its main novelty arising from the use\nof unlabeled data training dynamics to measure pseudo-label quality. Instead of\nusing only the model's confidence on an unlabeled example at an arbitrary\niteration to decide if the example should be masked or not, MarginMatch also\nanalyzes the behavior of the model on the pseudo-labeled examples as the\ntraining progresses, to ensure low quality predictions are masked out.\nMarginMatch brings substantial improvements on four vision benchmarks in low\ndata regimes and on two large-scale datasets, emphasizing the importance of\nenforcing high-quality pseudo-labels. Notably, we obtain an improvement in\nerror rate over the state-of-the-art of 3.25% on CIFAR-100 with only 25 labels\nper class and of 3.78% on STL-10 using as few as 4 labels per class. We make\nour code available at https://github.com/tsosea2/MarginMatch.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:19:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sosea","Tiberiu",""],["Caragea","Cornelia",""]]}
{"id":"2308.09038","submitter":"Wenxin Xiao","authors":"Wenxin Xiao, Jingyue Li, Hao He, Ruiqiao Qiu, and Minghui Zhou","title":"Personalized First Issue Recommender for Newcomers in Open Source\n  Projects","comments":"The 38th IEEE/ACM International Conference on Automated Software\n  Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many open source projects provide good first issues (GFIs) to attract and\nretain newcomers. Although several automated GFI recommenders have been\nproposed, existing recommenders are limited to recommending generic GFIs\nwithout considering differences between individual newcomers. However, we\nobserve mismatches between generic GFIs and the diverse background of\nnewcomers, resulting in failed attempts, discouraged onboarding, and delayed\nissue resolution. To address this problem, we assume that personalized first\nissues (PFIs) for newcomers could help reduce the mismatches. To justify the\nassumption, we empirically analyze 37 newcomers and their first issues resolved\nacross multiple projects. We find that the first issues resolved by the same\nnewcomer share similarities in task type, programming language, and project\ndomain. These findings underscore the need for a PFI recommender to improve\nover state-of-the-art approaches. For that purpose, we identify features that\ninfluence newcomers' personalized selection of first issues by analyzing the\nrelationship between possible features of the newcomers and the characteristics\nof the newcomers' chosen first issues. We find that the expertise preference,\nOSS experience, activeness, and sentiment of newcomers drive their personalized\nchoice of the first issues. Based on these findings, we propose a Personalized\nFirst Issue Recommender (PFIRec), which employs LamdaMART to rank candidate\nissues for a given newcomer by leveraging the identified influential features.\nWe evaluate PFIRec using a dataset of 68,858 issues from 100 GitHub projects.\nThe evaluation results show that PFIRec outperforms existing first issue\nrecommenders, potentially doubling the probability that the top recommended\nissue is suitable for a specific newcomer and reducing one-third of a\nnewcomer's unsuccessful attempts to identify suitable first issues, in the\nmedian.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:19:13 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 11:54:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiao","Wenxin",""],["Li","Jingyue",""],["He","Hao",""],["Qiu","Ruiqiao",""],["Zhou","Minghui",""]]}
{"id":"2308.09039","submitter":"Davide Selvatici","authors":"Davide Selvatici, Maurizio Quadrio and Alessandro Chiarini","title":"Curvature effects on the structure of near-wall turbulence","comments":"Under consideration by Journal of Fluid Mechanics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The interaction between near-wall turbulence and wall curvature is described\nfor the incompressible flow in a plane channel with a small\nconcave-convex-concave bump on the bottom wall, with height comparable to the\nwall-normal location of the main turbulent structures. The analysis starts from\na database generated by a direct numerical simulation and hinges upon the\nanisotropic generalised Kolmogorov equations, i.e. the exact budget equations\nfor the second-order structure function tensor. The influence of the bump on\nthe wall cycle and on the energy production, redistribution and transfers is\ndescribed in the physical and scale spaces. Over the upstream side of the bump,\nthe energy drained from the mean flow to sustain the streamwise fluctuations\ndecreases, and the streaks of high and low streamwise velocity weaken and are\nstretched spanwise. After the bump tip, instead, the production of streamwise\nfluctuations grows and the streaks intensify, progressively recovering their\ncharacteristic spanwise scale. The wall-normal fluctuations, and thus the\nquasi-streamwise vortices, are sustained by the mean flow over the upstream\nside of the bump, while energy flows from the vertical fluctuations to the mean\nfield over the downstream side. On the concave portion of the upstream side,\nthe near-wall fluctuations form structures of spanwise velocity which are\nconsistent with Taylor-G\\\"ortler vortices at an early stage of development.\nTheir evolution is described by analysing the scale-space pressure-strain term.\nA schematic description of the bump flow is presented, in which various regions\nare identified according to the signs of curvature and streamwise pressure\ngradient.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:19:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Selvatici","Davide",""],["Quadrio","Maurizio",""],["Chiarini","Alessandro",""]]}
{"id":"2308.09040","submitter":"Hao Feng Mr.","authors":"Hao Feng, Wendi Wang, Jiajun Deng, Wengang Zhou, Li Li, Houqiang Li","title":"SimFIR: A Simple Framework for Fisheye Image Rectification with\n  Self-supervised Representation Learning","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":"  In fisheye images, rich distinct distortion patterns are regularly\ndistributed in the image plane. These distortion patterns are independent of\nthe visual content and provide informative cues for rectification. To make the\nbest of such rectification cues, we introduce SimFIR, a simple framework for\nfisheye image rectification based on self-supervised representation learning.\nTechnically, we first split a fisheye image into multiple patches and extract\ntheir representations with a Vision Transformer (ViT). To learn fine-grained\ndistortion representations, we then associate different image patches with\ntheir specific distortion patterns based on the fisheye model, and further\nsubtly design an innovative unified distortion-aware pretext task for their\nlearning. The transfer performance on the downstream rectification task is\nremarkably boosted, which verifies the effectiveness of the learned\nrepresentations. Extensive experiments are conducted, and the quantitative and\nqualitative results demonstrate the superiority of our method over the\nstate-of-the-art algorithms as well as its strong generalization ability on\nreal-world fisheye images.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:20:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Feng","Hao",""],["Wang","Wendi",""],["Deng","Jiajun",""],["Zhou","Wengang",""],["Li","Li",""],["Li","Houqiang",""]]}
{"id":"2308.09041","submitter":"Basak Sakcak","authors":"Basak Sakcak, Kalle G. Timperi, Vadim Weinstein, and Steven M. LaValle","title":"A Mathematical Characterization of Minimally Sufficient Robot Brains","comments":"arXiv admin note: text overlap with arXiv:2212.00523","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the lower limits of encoding and processing the\ninformation acquired through interactions between an internal system (robot\nalgorithms or software) and an external system (robot body and its environment)\nin terms of action and observation histories. Both are modeled as transition\nsystems. We want to know the weakest internal system that is sufficient for\nachieving passive (filtering) and active (planning) tasks. We introduce the\nnotion of an information transition system for the internal system which is a\ntransition system over a space of information states that reflect a robot's or\nother observer's perspective based on limited sensing, memory, computation, and\nactuation. An information transition system is viewed as a filter and a policy\nor plan is viewed as a function that labels the states of this information\ntransition system. Regardless of whether internal systems are obtained by\nlearning algorithms, planning algorithms, or human insight, we want to know the\nlimits of feasibility for given robot hardware and tasks. We establish, in a\ngeneral setting, that minimal information transition systems exist up to\nreasonable equivalence assumptions, and are unique under some general\nconditions. We then apply the theory to generate new insights into several\nproblems, including optimal sensor fusion/filtering, solving basic planning\ntasks, and finding minimal representations for modeling a system given\ninput-output relations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:22:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sakcak","Basak",""],["Timperi","Kalle G.",""],["Weinstein","Vadim",""],["LaValle","Steven M.",""]]}
{"id":"2308.09042","submitter":"Sudarsana Kadiri","authors":"Sudarsana Reddy Kadiri, Manila Kodali, Paavo Alku","title":"Severity Classification of Parkinson's Disease from Speech using Single\n  Frequency Filtering-based Features","comments":"Accepted by INTERSPEECH 2023","journal-ref":null,"doi":"10.21437/Interspeech.2023-2531","report-no":null,"categories":"eess.AS cs.AI cs.SD eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developing objective methods for assessing the severity of Parkinson's\ndisease (PD) is crucial for improving the diagnosis and treatment. This study\nproposes two sets of novel features derived from the single frequency filtering\n(SFF) method: (1) SFF cepstral coefficients (SFFCC) and (2) MFCCs from the SFF\n(MFCC-SFF) for the severity classification of PD. Prior studies have\ndemonstrated that SFF offers greater spectro-temporal resolution compared to\nthe short-time Fourier transform. The study uses the PC-GITA database, which\nincludes speech of PD patients and healthy controls produced in three speaking\ntasks (vowels, sentences, text reading). Experiments using the SVM classifier\nrevealed that the proposed features outperformed the conventional MFCCs in all\nthree speaking tasks. The proposed SFFCC and MFCC-SFF features gave a relative\nimprovement of 5.8% and 2.3% for the vowel task, 7.0% & 1.8% for the sentence\ntask, and 2.4% and 1.1% for the read text task, in comparison to MFCC features.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:22:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kadiri","Sudarsana Reddy",""],["Kodali","Manila",""],["Alku","Paavo",""]]}
{"id":"2308.09043","submitter":"Tianze Jiang","authors":"Patrik R\\'obert Gerber, Tianze Jiang, Yury Polyanskiy, Rui Sun","title":"Kernel-Based Tests for Likelihood-Free Hypothesis Testing","comments":"36 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.IT cs.LG math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given $n$ observations from two balanced classes, consider the task of\nlabeling an additional $m$ inputs that are known to all belong to \\emph{one} of\nthe two classes. Special cases of this problem are well-known: with complete\nknowledge of class distributions ($n=\\infty$) the problem is solved optimally\nby the likelihood-ratio test; when $m=1$ it corresponds to binary\nclassification; and when $m\\approx n$ it is equivalent to two-sample testing.\nThe intermediate settings occur in the field of likelihood-free inference,\nwhere labeled samples are obtained by running forward simulations and the\nunlabeled sample is collected experimentally. In recent work it was discovered\nthat there is a fundamental trade-off between $m$ and $n$: increasing the data\nsample $m$ reduces the amount $n$ of training/simulation data needed. In this\nwork we (a) introduce a generalization where unlabeled samples come from a\nmixture of the two classes -- a case often encountered in practice; (b) study\nthe minimax sample complexity for non-parametric classes of densities under\n\\textit{maximum mean discrepancy} (MMD) separation; and (c) investigate the\nempirical performance of kernels parameterized by neural networks on two tasks:\ndetection of the Higgs boson and detection of planted DDPM generated images\namidst CIFAR-10 images. For both problems we confirm the existence of the\ntheoretically predicted asymmetric $m$ vs $n$ trade-off.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:24:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gerber","Patrik R\u00f3bert",""],["Jiang","Tianze",""],["Polyanskiy","Yury",""],["Sun","Rui",""]]}
{"id":"2308.09044","submitter":"Qiong Qin","authors":"Qiong Qin and Yi-feng Yang","title":"High-$T_c$ superconductivity by mobilizing local spin singlets and\n  possible route to higher $T_c$ in pressurized La$_3$Ni$_2$O$_7$","comments":"6 pages,4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We clarify the pairing mechanism of high-$T_c$ superconductivity in bilayer\nLa$_3$Ni$_2$O$_7$ under high pressure by employing the static auxiliary field\nMonte Carlo approach to simulate a minimal effective model that contains local\n$d_{z^2}$ inter-layer spin singlets and metallic $d_{x^2-y^2}$ bands.\nSuperconductivity is induced when the local spin singlet pairs are mobilized\nand attain long-distance phase coherence by hybridization with the metallic\nbands. We find a dual role of hybridization that not only induces global phase\ncoherence but also competes with the spin singlet formation. This lead to a\ntentative phase diagram where $T_c$ varies nonmonotonically with the\nhybridization, in good correspondence with experimental observation. A roughly\nlinear relation is obtained for realistic hopping and hybridization parameters:\n$T_c\\approx 0.05 J$, where $J$ is the inter-layer superexchange interaction. We\nemphasize the peculiar tunability of the bilayer structure and propose that\n$T_c$ may be further enhanced by applying uniaxial pressure along the $c$ axis\non superconducting La$_3$Ni$_2$O$_7$. Our work provides numerical evidences for\nthe pairing mechanism of high-$T_c$ superconductivity in La$_3$Ni$_2$O$_7$ and\npoints out a potential route to achieve even higher $T_c$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:24:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qin","Qiong",""],["Yang","Yi-feng",""]]}
{"id":"2308.09045","submitter":"Toby Ord","authors":"Toby Ord","title":"The Lindy Effect","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph math.PR stat.OT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Lindy effect is a statistical tendency for things with longer pasts\nbehind them to have longer futures ahead. It has been experimentally confirmed\nto apply to some categories, but not others, raising questions about when it is\napplicable and why. I shed some light on these questions by examining the\nmathematical properties required for the effect and generating mechanisms that\ncan produce them. While the Lindy effect is often thought to require a\ndeclining hazard rate, I show that it arises very naturally even in cases with\nconstant (or increasing) hazard rates -- so long as there is a probability\ndistribution over the size of that rate. One implication is that even things\nwhich are becoming less robust over time can display the Lindy effect.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:25:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ord","Toby",""]]}
{"id":"2308.09046","submitter":"Satya Singh","authors":"Satya Vikram Pratap Singh, Tanu Prasad, Siddharth Kamila and Prashant\n  Agnihotri","title":"Fault Detection and Classification using Wavelet and ANN in DFIG and\n  TCSC Connected Transmission Line","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 presents fault detection and classification using Wavelet and ANN\nbased methods in a DFIG-based series compensated system. The state-of-the art\nmethods include Wavelet transform, Fourier transform, and Wavelet-neuro fuzzy\nmethods-based system for fault detection and classification. However, the\naccuracy of these state-of-the-art methods diminishes during variable\nconditions such as changes in wind speed, high impedance faults, and the\nchanges in the series compensation level. Specifically, in Wavelet transform\nbased methods, the threshold values need to be adapted based on the variable\nfield conditions. To solve this problem, this paper has proposed a Wavelet-ANN\nbased fault detection method where Wavelet is used as an identifier and ANN is\nused as a classifier for detecting various fault cases. This methodology is\nalso effective under SSR condition. The proposed methodology is evaluated on\nvarious fault and non-fault cases generated on an IEEE first benchmark model\nunder varying compensation levels from 20% to 55%, impedance faults, and wind\nvelocity from 6m/sec to 10m/sec using MATLAB/Simulink, OPALRT(OP4510)\nmanufactured real-time digital simulator environment, Arduino board I/O ports\ncommunicating with external PC in which ANN model dumped, using Arduino support\npackage of MATLAB. The preliminary results are compared with the\nstate-of-the-art fault detection method, where the proposed method shows robust\nperformance under varying field conditions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:27:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Satya Vikram Pratap",""],["Prasad","Tanu",""],["Kamila","Siddharth",""],["Agnihotri","Prashant",""]]}
{"id":"2308.09047","submitter":"Anastasia Tsvetkova","authors":"Anastasia Tsvetkova (1,2), Luciano Burderi (1,3,4), Alessandro Riggio\n  (1,3,5), Andrea Sanna (1,3,4), Tiziana Di Salvo (6) ((1) Dipartimento di\n  Fisica, Universita degli Studi di Cagliari, SP Monserrato-Sestu, Monserrato,\n  Italy, (2) Ioffe Institute, St. Petersburg, Russia, (3) INFN, Sezione di\n  Cagliari, Cittadella Universitaria, Monserrato, CA, Italy, (4)\n  INAF-Osservatorio Astronomico di Cagliari, Selargius (CA), Italy, (5)\n  INAF-Istituto di Astrofisica Spaziale e Fisica Cosmica di Palermo, Palermo,\n  Italy, (6) Dipartimento di Fisica e Chimica, Universita degli Studi di\n  Palermo, Palermo, Italy)","title":"A Concept of Assessment of LIV Tests with THESEUS Using the Gamma-Ray\n  Bursts Detected by Fermi/GBM","comments":null,"journal-ref":"Universe 2023, 9(8), 359","doi":"10.3390/universe9080359","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  According to Einstein's special relativity theory, the speed of light in a\nvacuum is constant for all observers. However, quantum gravity effects could\nintroduce its dispersion depending on the energy of photons. The investigation\nof the spectral lags between the gamma-ray burst (GRB) light curves recorded in\ndistinct energy ranges could shed light on this phenomenon: the lags could\nreflect the variation of the speed of light if it is linearly dependent on the\nphoton energy and a function of the GRB redshift. We propose a methodology to\nstart investigating the dispersion law of light propagation in a vacuum using\nGRB light curves. This technique is intended to be fully exploited using the\nGRB data collected with THESEUS.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:29:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tsvetkova","Anastasia",""],["Burderi","Luciano",""],["Riggio","Alessandro",""],["Sanna","Andrea",""],["Di Salvo","Tiziana",""]]}
{"id":"2308.09048","submitter":"Haowei Xu","authors":"Haowei Xu, Changhao Li, Guoqing Wang, Hao Tang, Paola Cappellaro, and\n  Ju Li","title":"Efficient Quantum Transduction Using Anti-Ferromagnetic Topological\n  Insulators","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transduction of quantum information between distinct quantum systems is an\nessential step in various applications, including quantum networks and quantum\ncomputing. However, quantum transduction needs to mediate between photons with\nvastly different frequencies, making it challenging to design high-performance\ntransducers, due to multifaceted and sometimes conflicting requirements. In\nthis work, we first discuss some general principles for quantum transducer\ndesign, and then propose solid-state anti-ferromagnetic topological insulators\nto serve as highly effective transducers. First, topological insulators exhibit\nband-inversion, which can greatly enhance their optical responses. Coupled with\ntheir robust spin-orbit coupling and high spin density, this property leads to\nstrong nonlinear interaction in topological insulators, thereby substantially\nimproving transduction efficiency. Second, the anti-ferromagnetic order can\nminimize the detrimental influence on other neighboring quantum systems due to\nmagnetic interactions. Using $\\rm MnBi_2Te_4$ as an example, we showcase that\nunit transduction fidelity can be achieved with modest experimental\nrequirements, while the transduction bandwidth can reach the GHz range. The\nstrong nonlinear interaction in magnetic topological insulators can find\ndiverse applications, including the generation of entanglement between photons\nof distinct frequencies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:30:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Haowei",""],["Li","Changhao",""],["Wang","Guoqing",""],["Tang","Hao",""],["Cappellaro","Paola",""],["Li","Ju",""]]}
{"id":"2308.09049","submitter":"Ren\\'e Harmann","authors":"Ren\\'e Harmann, Lukas Sohlbach, Fernando Perez-Pe\\~na and Karsten\n  Schmidt","title":"Development of an interface for digital neuromorphic hardware based on\n  an FPGA","comments":"Accepted for publication with Proceedings of the Unified Conference\n  of DAMAS, InCoME and TEPEN Conferences (UNIfied 2023), Springer Nature","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Exploring and understanding the functioning of the human brain is one of the\ngreatest challenges for current research. Neuromorphic engineering tries to\naddress this challenge by abstracting biological mechanisms and translating\nthem into technology. Via the abstraction process and experiments with the\nresulting technical system, an attempt is made to obtain information about the\nbiological counterpart. One subsection of Neuromorphic Engineering (NE) are\nSpiking Neural Networks (SNN), which describe the structures of the human brain\nmore and more closely than Artificial Neural Networks (ANN). Together with\ntheir dedicated hardware, SNNs provide a good platform for developing new\nalgorithms for information processing. In the context of these neuromorphic\nhardware platforms, this paper aims to develop an interface for a digital\nhardware platform (SPINN-3 Development Board) to enable the use of industrial\nor conventional sensors and thus create new approaches for experimental\nresearch. The basis for this endeavor is a Field Programmable Gate Array\n(FPGA), which is placed as a gateway between the sensors and the neuromorphic\nhardware. Overall, the developed system provides a robust solution for a wide\nvariety of investigations related to neuromorphic hardware and SNNs.\nFurthermore, the solution also offers suitable possibilities to monitor all\nprocesses within the system in order to obtain suitable measurements, which can\nbe examined in search of meaningful results.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:30:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Harmann","Ren\u00e9",""],["Sohlbach","Lukas",""],["Perez-Pe\u00f1a","Fernando",""],["Schmidt","Karsten",""]]}
{"id":"2308.09050","submitter":"Diogo Gomes","authors":"Alexandra A. Gomes and Diogo A. Gomes","title":"Derivative-Free Global Minimization in One Dimension: Relaxation, Monte\n  Carlo, and Sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a derivative-free global optimization algorithm that efficiently\ncomputes minima for various classes of one-dimensional functions, including\nnon-convex, and non-smooth functions.This algorithm numerically approximates\nthe gradient flow of a relaxed functional, integrating strategies such as Monte\nCarlos methods, rejection sampling, and adaptive techniques. These strategies\nenhance performance in solving a diverse range of optimization problems while\nsignificantly reducing the number of required function evaluations compared to\nestablished methods. We present a proof of the convergence of the algorithm and\nillustrate its performance by comprehensive benchmarking. The proposed\nalgorithm offers a substantial potential for real-world models. It is\nparticularly advantageous in situations requiring computationally intensive\nobjective function evaluations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:31:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gomes","Alexandra A.",""],["Gomes","Diogo A.",""]]}
{"id":"2308.09051","submitter":"Sudarsana Kadiri","authors":"Paavo Alku, Sudarsana Reddy Kadiri, Dhananjaya Gowda","title":"Refining a Deep Learning-based Formant Tracker using Linear Prediction\n  Methods","comments":"Computer Speech and Language, Vol. 81, Article 101515, June 2023","journal-ref":null,"doi":"10.1016/j.csl.2023.101515","report-no":null,"categories":"eess.AS cs.AI cs.LG cs.SD eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, formant tracking is investigated by refining the formants\ntracked by an existing data-driven tracker, DeepFormants, using the formants\nestimated in a model-driven manner by linear prediction (LP)-based methods. As\nLP-based formant estimation methods, conventional covariance analysis (LP-COV)\nand the recently proposed quasi-closed phase forward-backward (QCP-FB) analysis\nare used. In the proposed refinement approach, the contours of the three lowest\nformants are first predicted by the data-driven DeepFormants tracker, and the\npredicted formants are replaced frame-wise with local spectral peaks shown by\nthe model-driven LP-based methods. The refinement procedure can be plugged into\nthe DeepFormants tracker with no need for any new data learning. Two refined\nDeepFormants trackers were compared with the original DeepFormants and with\nfive known traditional trackers using the popular vocal tract resonance (VTR)\ncorpus. The results indicated that the data-driven DeepFormants trackers\noutperformed the conventional trackers and that the best performance was\nobtained by refining the formants predicted by DeepFormants using QCP-FB\nanalysis. In addition, by tracking formants using VTR speech that was corrupted\nby additive noise, the study showed that the refined DeepFormants trackers were\nmore resilient to noise than the reference trackers. In general, these results\nsuggest that LP-based model-driven approaches, which have traditionally been\nused in formant estimation, can be combined with a modern data-driven tracker\neasily with no further training to improve the tracker's performance.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:32:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alku","Paavo",""],["Kadiri","Sudarsana Reddy",""],["Gowda","Dhananjaya",""]]}
{"id":"2308.09052","submitter":"Cristina Draper","authors":"Yolanda Cabrera, Cristina Draper and Antonio Garvin","title":"Linear models of the exceptional Lie algebra $\\mathfrak{e}_8$","comments":"44 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work provides five explicit constructions of the exceptional Lie algebra\n$\\mathfrak{e}_8$, based on its semisimple subalgebras of maximal rank. Each of\nthese models is graded by an abelian group, namely, $\\mathbb{Z}_4$,\n$\\mathbb{Z}_5$, $\\mathbb{Z}_6$, $\\mathbb{Z}_3^2$ and\n$\\mathbb{Z}_2\\times\\mathbb{Z}_4$; the neutral component is direct sum of\nspecial linear algebras and the remaining homogeneous components are\nirreducible modules for it.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:36:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cabrera","Yolanda",""],["Draper","Cristina",""],["Garvin","Antonio",""]]}
{"id":"2308.09053","submitter":"Syed Mohammed Faizanuddin","authors":"Syed Mohammed Faizanuddin, Ching-Hang Chien, Yao-Jui Chan, Si-Tong\n  Liu, Chia-Nung Kuo, Chin Shuan Lue, and Yu-Chieh Wen","title":"Surface Second Harmonic Generation from Topological Dirac Semimetal\n  PdTe$_2$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent experiments and calculations in topological semimetals have observed\nanomalously strong second-order optical nonlinearity, but yet whether the\nenhancement also occurs at surfaces of topological semimetals in general\nremains an open question. In this work, we tackle this problem by measuring\npolarization-dependent and rotational-anisotropy optical second harmonic\ngeneration (SHG) from centrosymmetric type-II Dirac semimetal PdTe$_2$. We\nfound the SHG to follow C$_{3v}$ surface symmetry with a time-varying intensity\ndictated by the oxidation kinetics of the material after its surface cleavage,\nindicating the surface origin of SHG. Quantitative characterization of the\nsurface nonlinear susceptibility indicates a large out-of-plane response of\nPdTe$_2$ with $|\\chi_{ccc}^{(2)}|$ up to 25 $\\times$ 10$^{-18}$ m$^2$/V. Our\nresults support the topological surfaces/interfaces as a new route toward\napplications of nonlinear optical effects with released symmetry constraints,\nand demonstrate SHG as a viable means to in situ study of kinetics of\ntopological surfaces.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:38:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Faizanuddin","Syed Mohammed",""],["Chien","Ching-Hang",""],["Chan","Yao-Jui",""],["Liu","Si-Tong",""],["Kuo","Chia-Nung",""],["Lue","Chin Shuan",""],["Wen","Yu-Chieh",""]]}
{"id":"2308.09054","submitter":"Micael Toledo","authors":"Isabel Hubard, Micael Toledo","title":"Sparse groups need not be semisparse","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In 1999 Michael Hartley showed that any abstract polytope can be constructed\nas a double coset poset, by means of a C-group $\\C$ and a subgroup $N \\leq \\C$.\nSubgroups $N \\leq \\C$ that give rise to abstract polytopes through such\nconstruction are called {\\em sparse}. If, further, the stabilizer of a base\nflag of the poset is precisely $N$, then $N$ is said to be {\\em semisparse}. In\n\\cite[Conjecture 5.2]{hartley1999more} Hartley conjectures that sparse groups\nare always semisparse. In this paper, we show that this conjecture is in fact\nfalse: there exist sparse groups that are not semisparse. In particular, we\nshow that such groups are always obtained from non-faithful maniplexes that\ngive rise to polytopes. Using this, we show that Hartely's conjecture holds for\nrank 3, but we construct examples to disprove the conjecture for all ranks\n$n\\geq 4$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:40:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hubard","Isabel",""],["Toledo","Micael",""]]}
{"id":"2308.09055","submitter":"David Dale","authors":"Nikolay Babakov, David Dale, Ilya Gusev, Irina Krotova, Alexander\n  Panchenko","title":"Don't lose the message while paraphrasing: A study on content preserving\n  style transfer","comments":"Published at the NLDB 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text style transfer techniques are gaining popularity in natural language\nprocessing allowing paraphrasing text in the required form: from toxic to\nneural, from formal to informal, from old to the modern English language, etc.\nSolving the task is not sufficient to generate some neural/informal/modern\ntext, but it is important to preserve the original content unchanged. This\nrequirement becomes even more critical in some applications such as style\ntransfer of goal-oriented dialogues where the factual information shall be kept\nto preserve the original message, e.g. ordering a certain type of pizza to a\ncertain address at a certain time. The aspect of content preservation is\ncritical for real-world applications of style transfer studies, but it has\nreceived little attention. To bridge this gap we perform a comparison of\nvarious style transfer models on the example of the formality transfer domain.\nTo perform a study of the content preservation abilities of various style\ntransfer methods we create a parallel dataset of formal vs. informal\ntask-oriented dialogues. The key difference between our dataset and the\nexisting ones like GYAFC [17] is the presence of goal-oriented dialogues with\npredefined semantic slots essential to be kept during paraphrasing, e.g. named\nentities. This additional annotation allowed us to conduct a precise\ncomparative study of several state-of-the-art techniques for style transfer.\nAnother result of our study is a modification of the unsupervised method LEWIS\n[19] which yields a substantial improvement over the original method and all\nevaluated baselines on the proposed task.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:41:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Babakov","Nikolay",""],["Dale","David",""],["Gusev","Ilya",""],["Krotova","Irina",""],["Panchenko","Alexander",""]]}
{"id":"2308.09056","submitter":"David Wehlau","authors":"H.E.A. Campbell and David L. Wehlau","title":"When are permutation invariants Cohen-Macaulay?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over a field of characteristic 0, every ring of invariants of any finite\ngroup is Cohen-Macaulay. This is not true for fields of positive\ncharacteristic. We consider permutation representations and their invariant\nrings over fields $\\mathbb{F}_p$ of prime order. We give an efficient algorithm\nwhich for any given permutation representation, determines those primes $p$ for\nwhich the invariant ring over $\\mathbb{F}_p$ is Cohen-Macaulay. Extensions to\nsubgroups of reflection groups other than the symmetric group are indicated.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:42:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Campbell","H. E. A.",""],["Wehlau","David L.",""]]}
{"id":"2308.09057","submitter":"F\\'elix Llorente De Andr\\'es","authors":"F\\'elix Llorente de Andr\\'es","title":"Could the number of blue straggler stars help to determine the age of\n  their parent globular cluster?","comments":"12 pages, 5 figures, paper","journal-ref":"SCIREA Journal of Astronomy Volume 5, Issue 2, August 22, 2023","doi":"10.54647/astronomy160048","report-no":null,"categories":"astro-ph.SR astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A recent study shows, from an empirical deduction, that the number and the\npresence of the blue straggler stars (BSS) in an open cluster follow a function\nwhose components are the ratio between age and the relaxation time, $\\it f$,\nand a factor, $\\varpi$ , which is an indicator of stellar collisions plus\nprimordial binaries. The relation among the number of blue straggler stars, the\nfactor $\\it f$, and the factor $\\varpi$ of each globular cluster allows for\nderiving the age of the respective globular clusters. This method has been\napplied individually over 56 globular clusters containing BSS. The values\nderived for the cluster ages from our methodology do not differ from those\nderived from other methods. A special case is cluster NGC 104 whose age exceeds\n13.8 Gyr (its age is between 19.04 and 20.30 Gyr), which would have a very\nexotic explanation: the existence of an intermediate black hole in the center\nof the cluster. That black hole main-sequence star (BH-MS) binaries with an\ninitial orbital period less than the bifurcation period can evolve into\nultra-compact X-ray binaries (UCXBs) that can be detected by LISA. On the other\nhand, if that age were true, it would call into question the expansion velocity\nfor a flat Universe. This would call into question the case for dark energy\ndominated Universe.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:46:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["de Andr\u00e9s","F\u00e9lix Llorente",""]]}
{"id":"2308.09058","submitter":"Samira Mansourzadeh","authors":"Samira Mansourzadeh, Tim Vogel, Alan Omar, Tobias O. Buchmann, Edmund\n  J. R. Kelleher, Peter U. Jepsen and Clara J. Saraceno","title":"Towards Intense Ultra-Broadband High Repetition Rate Terahertz Sources\n  Based on Organic Crystals [Invited]","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increasing the average power of broadband, few-cycle terahertz (THz) sources\nis currently a topic of intense investigation, fueled by recent immense\nprogress in high average power femtosecond laser driving sources at 1030 nm.\nHowever, many crucial applications would benefit not only from an increase in\naverage power, but also from ultra-broad bandwidth, while maintaining high\ndynamic range at these frequencies. This calls for the challenging combination\nof high repetition rates and high average power simultaneously. Here, we\ndiscuss the recent progress in the promising approach enabled by organic\ncrystals for THz-generation. Specifically, this review article discusses\nadvances with the most commonly used organic crystals BNA, DAST, DSTMS, OH1 and\nHMQ-TMS. We place special emphasis on nonlinear and thermal properties and\ndiscuss future directions for this field.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:46:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mansourzadeh","Samira",""],["Vogel","Tim",""],["Omar","Alan",""],["Buchmann","Tobias O.",""],["Kelleher","Edmund J. R.",""],["Jepsen","Peter U.",""],["Saraceno","Clara J.",""]]}
{"id":"2308.09059","submitter":"Chen-Yu Liu","authors":"R. Alarcon, A. Aleksandrova, S. Bae{\\ss}ler, D. H. Beck, T.\n  Bhattacharya, M. Blatnik, T. J. Bowles, J. D. Bowman, J. Brewington, L. J.\n  Broussard, A. Bryant, J. F. Burdine, J. Caylor, Y. Chen, J. H. Choi, L.\n  Christie, T. E. Chupp, V. Cianciolo, V. Cirigliano, S. M. Clayton, B.\n  Collett, C. Crawford, W. Dekens, M. Demarteau, D. DeMille, G. Dodson, B. W.\n  Filippone, N. Floyd, N. Fomin, J Fry, K. Fuyuto, S. Gardner, R. Godri, R.\n  Golub, F. Gonzalez, G. L. Greene, V. Gudkov, R. Gupta, J. Hamblen, L. Hayen,\n  J C. Hendrus, K. Hickerson, F. B. Hills, A. T. Holley, S. Hoogerheide, M.\n  Hubert, P. R. Huffman, S. K. Imam, T. M. Ito, L. Jin, G. Jones, A. Komives,\n  E. Korobkina, W. Korsch, K.K.H. Leung, C.-Y. Liu, K.-F. Liu, J. C. Long, D.\n  Mathews, A. Mendelsohn, E. Mereghetti, P. Mohanmurthy, C. L. Morris, P.\n  Mueller, H. P. Mumm, A. Nelsen, A. Nicholson, J. Nico, C. M. O'Shaughnessy,\n  P. A. Palamure, S. Pastore, R. W. Pattie Jr., N. S. Phan, J. A. Pioquinto, B.\n  Plaster, D. Po\\v{c}ani\\'c, H. Rahangdale, R. Redwine, A. Reid, D. J. Salvat,\n  A. Saunders, D. Schaper, C.-Y. Seng, M. Singh, A. Shindler, W. M. Snow, Z.\n  Tang, A. Walker-Loud, D. K.-T. Wong, F. Wietfeldt, and A. R. Young","title":"Fundamental Neutron Physics: a White Paper on Progress and Prospects in\n  the US","comments":"arXiv admin note: text overlap with arXiv:2304.03451","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fundamental neutron physics, combining precision measurements and theory,\nprobes particle physics at short range with reach well beyond the highest\nenergies probed by the LHC. Significant US efforts are underway that will probe\nBSM CP violation with orders of magnitude more sensitivity, provide new data on\nthe Cabibbo anomaly, more precisely measure the neutron lifetime and decay, and\nexplore hadronic parity violation. World-leading results from the US\nFundamental Neutron Physics community since the last Long Range Plan, include\nthe world's most precise measurement of the neutron lifetime from UCN$\\tau$,\nthe final results on the beta-asymmetry from UCNA and new results on hadronic\nparity violation from the NPDGamma and n-${^3}$He runs at the FNPB (Fundamental\nNeutron Physics Beamline), precision measurement of the radiative neutron decay\nmode and n-${}^4$He at NIST. US leadership and discovery potential are ensured\nby the development of new high-impact experiments including BL3, Nab, LANL nEDM\nand nEDM@SNS. On the theory side, the last few years have seen results for the\nneutron EDM from the QCD $\\theta$ term, a factor of two reduction in the\nuncertainty for inner radiative corrections in beta-decay which impacts CKM\nunitarity, and progress on {\\it ab initio} calculations of nuclear structure\nfor medium-mass and heavy nuclei which can eventually improve the connection\nbetween nuclear and nucleon EDMs. In order to maintain this exciting program\nand capitalize on past investments while also pursuing new ideas and building\nUS leadership in new areas, the Fundamental Neutron Physics community has\nidentified a number of priorities and opportunities for our sub-field covering\nthe time-frame of the last Long Range Plan (LRP) under development. This white\npaper elaborates on these priorities.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:47:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alarcon","R.",""],["Aleksandrova","A.",""],["Bae\u00dfler","S.",""],["Beck","D. H.",""],["Bhattacharya","T.",""],["Blatnik","M.",""],["Bowles","T. J.",""],["Bowman","J. D.",""],["Brewington","J.",""],["Broussard","L. J.",""],["Bryant","A.",""],["Burdine","J. F.",""],["Caylor","J.",""],["Chen","Y.",""],["Choi","J. H.",""],["Christie","L.",""],["Chupp","T. E.",""],["Cianciolo","V.",""],["Cirigliano","V.",""],["Clayton","S. M.",""],["Collett","B.",""],["Crawford","C.",""],["Dekens","W.",""],["Demarteau","M.",""],["DeMille","D.",""],["Dodson","G.",""],["Filippone","B. W.",""],["Floyd","N.",""],["Fomin","N.",""],["Fry","J",""],["Fuyuto","K.",""],["Gardner","S.",""],["Godri","R.",""],["Golub","R.",""],["Gonzalez","F.",""],["Greene","G. L.",""],["Gudkov","V.",""],["Gupta","R.",""],["Hamblen","J.",""],["Hayen","L.",""],["Hendrus","J C.",""],["Hickerson","K.",""],["Hills","F. B.",""],["Holley","A. T.",""],["Hoogerheide","S.",""],["Hubert","M.",""],["Huffman","P. R.",""],["Imam","S. K.",""],["Ito","T. M.",""],["Jin","L.",""],["Jones","G.",""],["Komives","A.",""],["Korobkina","E.",""],["Korsch","W.",""],["Leung","K. K. H.",""],["Liu","C. -Y.",""],["Liu","K. -F.",""],["Long","J. C.",""],["Mathews","D.",""],["Mendelsohn","A.",""],["Mereghetti","E.",""],["Mohanmurthy","P.",""],["Morris","C. L.",""],["Mueller","P.",""],["Mumm","H. P.",""],["Nelsen","A.",""],["Nicholson","A.",""],["Nico","J.",""],["O'Shaughnessy","C. M.",""],["Palamure","P. A.",""],["Pastore","S.",""],["Pattie","R. W.","Jr."],["Phan","N. S.",""],["Pioquinto","J. A.",""],["Plaster","B.",""],["Po\u010dani\u0107","D.",""],["Rahangdale","H.",""],["Redwine","R.",""],["Reid","A.",""],["Salvat","D. J.",""],["Saunders","A.",""],["Schaper","D.",""],["Seng","C. -Y.",""],["Singh","M.",""],["Shindler","A.",""],["Snow","W. M.",""],["Tang","Z.",""],["Walker-Loud","A.",""],["Wong","D. K. -T.",""],["Wietfeldt","F.",""],["Young","A. R.",""]]}
{"id":"2308.09060","submitter":"Luke Kelly","authors":"Luke J. Kelly, Geoff K. Nicholls, Robin J. Ryder, David Welch","title":"TraitLab: a Matlab package for fitting and simulating binary tree-like\n  data","comments":"Manual describing the TraitLab software for phylogenetic inference","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  TraitLab is a software package for simulating, fitting and analysing\ntree-like binary data under a stochastic Dollo model of evolution. The model\nalso allows for rate heterogeneity through catastrophes, evolutionary events\nwhere many traits are simultaneously lost while new ones arise, and borrowing,\nwhereby traits transfer laterally between species as well as through ancestral\nrelationships. The core of the package is a Markov chain Monte Carlo (MCMC)\nsampling algorithm that enables the user to sample from the Bayesian joint\nposterior distribution for tree topologies, clade and root ages, and the trait\nloss, catastrophe and borrowing rates for a given data set. Data can be\nsimulated according to the fitted Dollo model or according to a number of\ngeneralized models that allow for heterogeneity in the trait loss rate, biases\nin the data collection process and borrowing of traits between lineages.\nCoupled pairs of Markov chains can be used to diagnose MCMC mixing and\nconvergence and to debias MCMC estimators. The raw data, MCMC run output, and\nmodel fit can be inspected using a number of useful graphical and analytical\ntools provided within the package or imported into other popular analysis\nprograms. TraitLab is freely available and runs within the Matlab computing\nenvironment with its Statistics and Machine Learning toolbox, no other\nadditional toolboxes are required.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:47:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kelly","Luke J.",""],["Nicholls","Geoff K.",""],["Ryder","Robin J.",""],["Welch","David",""]]}
{"id":"2308.09061","submitter":"Klaus Weber","authors":"Klaus Weber, Annalena Aicher, Wolfang Minker, Stefan Ultes, Elisabeth\n  Andr\\'e","title":"Fostering User Engagement in the Critical Reflection of Arguments","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A natural way to resolve different points of view and form opinions is\nthrough exchanging arguments and knowledge. Facing the vast amount of available\ninformation on the internet, people tend to focus on information consistent\nwith their beliefs. Especially when the issue is controversial, information is\noften selected that does not challenge one's beliefs. To support a fair and\nunbiased opinion-building process, we propose a chatbot system that engages in\na deliberative dialogue with a human. In contrast to persuasive systems, the\nenvisioned chatbot aims to provide a diverse and representative overview -\nembedded in a conversation with the user. To account for a reflective and\nunbiased exploration of the topic, we enable the system to intervene if the\nuser is too focused on their pre-existing opinion. Therefore we propose a model\nto estimate the users' reflective engagement (RUE), defined as their critical\nthinking and open-mindedness. We report on a user study with 58 participants to\ntest our model and the effect of the intervention mechanism, discuss the\nimplications of the results, and present perspectives for future work. The\nresults show a significant effect on both user reflection and total user focus,\nproving our proposed approach's validity.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:48:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Weber","Klaus",""],["Aicher","Annalena",""],["Minker","Wolfang",""],["Ultes","Stefan",""],["Andr\u00e9","Elisabeth",""]]}
{"id":"2308.09062","submitter":"Caterina Cocchi","authors":"Jannis Krumland, Michele Guerrini, Antonietta De Sio, Christoph\n  Lienau, Caterina Cocchi","title":"Two-dimensional electronic spectroscopy from first principles","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 development of multidimensional, ultrafast spectroscopy techniques calls\nfor the development of efficient computational schemes that allow for the\nsimulation of such experiments and thus for the interpretation of the\ncorresponding results. In this work, we present the development of a fully\nfirst-principles scheme to compute two-dimensional electron spectroscopy maps\nbased on real-time time-dependent density-functional theory. The interface of\nthis approach with the Ehrenfest scheme for molecular dynamics enables the\ninclusion of vibronic effects in the calculations. We demonstrate the\neffectiveness of this method by applying it to prototypical molecules such as\nbenzene, pyridine, and pyrene. We discuss the role of the approximations that\ninevitably enter the adopted theoretical framework and set the stage for\nfurther extensions of the proposed method.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:51:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Krumland","Jannis",""],["Guerrini","Michele",""],["De Sio","Antonietta",""],["Lienau","Christoph",""],["Cocchi","Caterina",""]]}
{"id":"2308.09063","submitter":"David D. Awschalom","authors":"Jonathan C. Marcks, Mykyta Onizhuk, Nazar Delegan, Yu-Xin Wang, Masaya\n  Fukami, Maya Watts, Aashish A. Clerk, F. Joseph Heremans, Giulia Galli and\n  David D. Awschalom","title":"Guiding Diamond Spin Qubit Growth with Computational Methods","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The nitrogen vacancy (NV) center in diamond, a well-studied, optically active\nspin defect, is the prototypical system in many state of the art quantum\nsensing and communication applications. In addition to the enticing properties\nintrinsic to the NV center, its diamond host's nuclear and electronic spin\nbaths can be leveraged as resources for quantum information, rather than\nconsidered solely as sources of decoherence. However, current synthesis\napproaches result in stochastic defect spin positions, reducing the\ntechnology's potential for deterministic control and yield of NV-spin bath\nsystems, as well as scalability and integration with other technologies. Here,\nwe demonstrate the use of theoretical calculations of electronic central spin\ndecoherence as an integral part of an NV-spin bath synthesis workflow,\nproviding a path forward for the quantitative design of NV center-based quantum\nsensing systems. We use computationally generated coherence data to\ncharacterize the properties of single NV center qubits across relevant growth\nparameters to find general trends in coherence time distributions dependent on\nspin bath dimensionality and density. We then build a maximum likelihood\nestimator with our theoretical model, enabling the characterization of a test\nsample through NV T2* measurements. Finally, we explore the impact of\ndimensionality on the yield of strongly coupled electron spin systems. The\nmethods presented herein are general and applicable to other qubit platforms\nthat can be appropriately simulated.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:53:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Marcks","Jonathan C.",""],["Onizhuk","Mykyta",""],["Delegan","Nazar",""],["Wang","Yu-Xin",""],["Fukami","Masaya",""],["Watts","Maya",""],["Clerk","Aashish A.",""],["Heremans","F. Joseph",""],["Galli","Giulia",""],["Awschalom","David D.",""]]}
{"id":"2308.09064","submitter":"Xin Wang","authors":"Xin Wang, Harry I. Teplitz, Brent M. Smith, Rogier A. Windhorst, Marc\n  Rafelski, Vihang Mehta, Anahita Alavi, Gabriel Brammer, James Colbert, Norman\n  Grogin, Nimish P. Hathi, Anton M. Koekemoer, Laura Prichard, Claudia\n  Scarlata, Ben Sunnquist, Pablo Arrabal Haro, Christopher Conselice, Eric\n  Gawiser, Yicheng Guo, Matthew Hayes, Rolf A. Jansen, Zhiyuan Ji, Ray A.\n  Lucas, Robert O'Connell, Brant Robertson, Michael Rutkowski, Brian Siana,\n  Eros Vanzella, Teresa Ashcraft, Micaela Bagley, Ivano Baronchelli, Guillermo\n  Barro, Alex Blanche, Adam Broussard, Timothy Carleton, Nima Chartab, Yingjie\n  Cheng, Alex Codoreanu, Seth Cohen, Y. Sophia Dai, Behnam Darvish, Romeel\n  Dave, Laura DeGroot, Duilia De Mello, Mark Dickinson, Najmeh Emami, Henry\n  Ferguson, Leonardo Ferreira, Keely Finkelstein, Steven Finkelstein, Jonathan\n  P. Gardner, Timothy Gburek, Mauro Giavalisco, Andrea Grazian, Caryl Gronwall,\n  Shoubaneh Hemmati, Justin Howell, Kartheik Iyer, Sugata Kaviraj, Peter\n  Kurczynski, Ilin Lazar, John MacKenty, Kameswara Bharadwaj Mantha, Alec\n  Martin, Garreth Martin, Tyler McCabe, Bahram Mobasher, Kalina Nedkova,\n  Charlotte Olsen, Lillian Otteson, Swara Ravindranath, Caleb Redshaw, Zahra\n  Sattari, Emmaris Soto, L. Y. Aaron Yung, Bonnabelle Zabelle, and the\n  UVCANDELS team","title":"The Lyman Continuum Escape Fraction of Star-forming Galaxies at\n  $2.4\\lesssim z\\lesssim3.7$ from UVCANDELS","comments":"33 pages, 21 figures, and 5 tables. Resubmitted after addressing the\n  referee report","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The UltraViolet Imaging of the Cosmic Assembly Near-infrared Deep\nExtragalactic Legacy Survey Fields (UVCANDELS) survey is a Hubble Space\nTelescope (HST) Cycle-26 Treasury Program, allocated in total 164 orbits of\nprimary Wide-Field Camera 3 Ultraviolet and Visible light F275W imaging with\ncoordinated parallel Advanced Camera for Surveys F435W imaging, on four of the\nfive premier extragalactic survey fields: GOODS-N, GOODS-S, EGS, and COSMOS. We\nintroduce this survey by presenting a thorough search for galaxies at\n$z\\gtrsim2.4$ that leak significant Lyman continuum (LyC) radiation, as well as\na stringent constraint on the LyC escape fraction ($f_{\\rm esc}$) from stacking\nthe UV images of a population of star-forming galaxies with secure redshifts.\nOur extensive search for LyC emission and stacking analysis benefit from the\ncatalogs of high-quality spectroscopic redshifts compiled from archival\nground-based data and HST slitless spectroscopy, carefully vetted by dedicated\nvisual inspection efforts. We report a sample of five galaxies as individual\nLyC leaker candidates, showing $f_{\\rm esc}^{\\rm rel}\\gtrsim60\\%$ estimated\nusing detailed Monte Carlo analysis of intergalactic medium attenuation. We\ndevelop a robust stacking method to apply to five samples of in total 85\nnon-detection galaxies in the redshift range of $z\\in[2.4,3.7]$. Most stacks\ngive tight 2-$\\sigma$ upper limits below $f_{\\rm esc}^{\\rm rel}<6\\%$. A stack\nfor a subset of 32 emission-line galaxies shows tentative LyC leakage detected\nat 2.9-$\\sigma$, indicating $f_{\\rm esc}^{\\rm rel}=5.7\\%$ at $z\\sim2.65$,\nsupporting the key role of such galaxies in contributing to the cosmic\nreionization and maintaining the UV ionization background. These new F275W and\nF435W imaging mosaics from UVCANDELS have been made publicly available on the\nBarbara A. Mikulski Archive for Space Telescopes.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:53:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Xin",""],["Teplitz","Harry I.",""],["Smith","Brent M.",""],["Windhorst","Rogier A.",""],["Rafelski","Marc",""],["Mehta","Vihang",""],["Alavi","Anahita",""],["Brammer","Gabriel",""],["Colbert","James",""],["Grogin","Norman",""],["Hathi","Nimish P.",""],["Koekemoer","Anton M.",""],["Prichard","Laura",""],["Scarlata","Claudia",""],["Sunnquist","Ben",""],["Haro","Pablo Arrabal",""],["Conselice","Christopher",""],["Gawiser","Eric",""],["Guo","Yicheng",""],["Hayes","Matthew",""],["Jansen","Rolf A.",""],["Ji","Zhiyuan",""],["Lucas","Ray A.",""],["O'Connell","Robert",""],["Robertson","Brant",""],["Rutkowski","Michael",""],["Siana","Brian",""],["Vanzella","Eros",""],["Ashcraft","Teresa",""],["Bagley","Micaela",""],["Baronchelli","Ivano",""],["Barro","Guillermo",""],["Blanche","Alex",""],["Broussard","Adam",""],["Carleton","Timothy",""],["Chartab","Nima",""],["Cheng","Yingjie",""],["Codoreanu","Alex",""],["Cohen","Seth",""],["Dai","Y. Sophia",""],["Darvish","Behnam",""],["Dave","Romeel",""],["DeGroot","Laura",""],["De Mello","Duilia",""],["Dickinson","Mark",""],["Emami","Najmeh",""],["Ferguson","Henry",""],["Ferreira","Leonardo",""],["Finkelstein","Keely",""],["Finkelstein","Steven",""],["Gardner","Jonathan P.",""],["Gburek","Timothy",""],["Giavalisco","Mauro",""],["Grazian","Andrea",""],["Gronwall","Caryl",""],["Hemmati","Shoubaneh",""],["Howell","Justin",""],["Iyer","Kartheik",""],["Kaviraj","Sugata",""],["Kurczynski","Peter",""],["Lazar","Ilin",""],["MacKenty","John",""],["Mantha","Kameswara Bharadwaj",""],["Martin","Alec",""],["Martin","Garreth",""],["McCabe","Tyler",""],["Mobasher","Bahram",""],["Nedkova","Kalina",""],["Olsen","Charlotte",""],["Otteson","Lillian",""],["Ravindranath","Swara",""],["Redshaw","Caleb",""],["Sattari","Zahra",""],["Soto","Emmaris",""],["Yung","L. Y. Aaron",""],["Zabelle","Bonnabelle",""],["team","the UVCANDELS",""]]}
{"id":"2308.09065","submitter":"Xuanlong Yu","authors":"Xuanlong Yu, Gianni Franchi, Jindong Gu, Emanuel Aldea","title":"Discretization-Induced Dirichlet Posterior for Robust Uncertainty\n  Quantification on Regression","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Uncertainty quantification is critical for deploying deep neural networks\n(DNNs) in real-world applications. An Auxiliary Uncertainty Estimator (AuxUE)\nis one of the most effective means to estimate the uncertainty of the main task\nprediction without modifying the main task model. To be considered robust, an\nAuxUE must be capable of maintaining its performance and triggering higher\nuncertainties while encountering Out-of-Distribution (OOD) inputs, i.e., to\nprovide robust aleatoric and epistemic uncertainty. However, for vision\nregression tasks, current AuxUE designs are mainly adopted for aleatoric\nuncertainty estimates, and AuxUE robustness has not been explored. In this\nwork, we propose a generalized AuxUE scheme for more robust uncertainty\nquantification on regression tasks. Concretely, to achieve a more robust\naleatoric uncertainty estimation, different distribution assumptions are\nconsidered for heteroscedastic noise, and Laplace distribution is finally\nchosen to approximate the prediction error. For epistemic uncertainty, we\npropose a novel solution named Discretization-Induced Dirichlet pOsterior\n(DIDO), which models the Dirichlet posterior on the discretized prediction\nerror. Extensive experiments on age estimation, monocular depth estimation, and\nsuper-resolution tasks show that our proposed method can provide robust\nuncertainty estimates in the face of noisy inputs and that it can be scalable\nto both image-level and pixel-wise tasks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:54:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yu","Xuanlong",""],["Franchi","Gianni",""],["Gu","Jindong",""],["Aldea","Emanuel",""]]}
{"id":"2308.09066","submitter":"Felipe Moraes","authors":"Felipe Moraes, Hugo Manuel Proen\\c{c}a, Anastasiia Kornilova, Javier\n  Albert, Dmitri Goldenberg","title":"Uplift Modeling: from Causal Inference to Personalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Uplift modeling is a collection of machine learning techniques for estimating\ncausal effects of a treatment at the individual or subgroup levels. Over the\nlast years, causality and uplift modeling have become key trends in\npersonalization at online e-commerce platforms, enabling the selection of the\nbest treatment for each user in order to maximize the target business metric.\nUplift modeling can be particularly useful for personalized promotional\ncampaigns, where the potential benefit caused by a promotion needs to be\nweighed against the potential costs. In this tutorial we will cover basic\nconcepts of causality and introduce the audience to state-of-the-art techniques\nin uplift modeling. We will discuss the advantages and the limitations of\ndifferent approaches and dive into the unique setup of constrained uplift\nmodeling. Finally, we will present real-life applications and discuss\nchallenges in implementing these models in production.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:54:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Moraes","Felipe",""],["Proen\u00e7a","Hugo Manuel",""],["Kornilova","Anastasiia",""],["Albert","Javier",""],["Goldenberg","Dmitri",""]]}
{"id":"2308.09067","submitter":"Alberto Mu\\~noz-Ortiz","authors":"Alberto Mu\\~noz-Ortiz and Carlos G\\'omez-Rodr\\'iguez and David Vilares","title":"Contrasting Linguistic Patterns in Human and LLM-Generated Text","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We conduct a quantitative analysis contrasting human-written English news\ntext with comparable large language model (LLM) output from 4 LLMs from the\nLLaMa family. Our analysis spans several measurable linguistic dimensions,\nincluding morphological, syntactic, psychometric and sociolinguistic aspects.\nThe results reveal various measurable differences between human and\nAI-generated texts. Among others, human texts exhibit more scattered sentence\nlength distributions, a distinct use of dependency and constituent types,\nshorter constituents, and more aggressive emotions (fear, disgust) than\nLLM-generated texts. LLM outputs use more numbers, symbols and auxiliaries\n(suggesting objective language) than human texts, as well as more pronouns. The\nsexist bias prevalent in human text is also expressed by LLMs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:54:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mu\u00f1oz-Ortiz","Alberto",""],["G\u00f3mez-Rodr\u00edguez","Carlos",""],["Vilares","David",""]]}
{"id":"2308.09068","submitter":"Alexander Osinsky","authors":"Alexander Osinsky","title":"Close to optimal column approximations with a single SVD","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 best column approximation in the Frobenius norm with $r$ columns has an\nerror at most $\\sqrt{r+1}$ times larger than the truncated singular value\ndecomposition. Reaching this bound in practice involves either expensive random\nvolume sampling or at least $r$ executions of singular value decomposition. In\nthis paper it will be shown that the same column approximation bound can be\nreached with only a single SVD (which can also be replaced with approximate\nSVD). As a corollary, it will be shown how to find a highly nondegenerate\nsubmatrix in $r$ rows of size $N$ in just $O(Nr^2)$ operations, which mostly\nhas the same properties as the maximum volume submatrix.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:54:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Osinsky","Alexander",""]]}
{"id":"2308.09069","submitter":"Carolus Schrijver","authors":"C.J. Schrijver","title":"A stellar view of the Sun","comments":"Invited memoir, accepted for publication in Solar Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This invited memoir looks back on my scientific career that straddles the\nsolar and stellar branches of astrophysics, with sprinklings of historical\ncontext and personal opinion. Except for a description of my life up to my\nPh.D. phase, the structure is thematic rather than purely chronological,\nfocusing on those topics that I worked on throughout substantial parts of my\nlife: stars like the Sun and the Sun-as-a-star, surface field evolution,\ncoronal structure and dynamics, heliophysics education, and space weather. Luck\nand a broadly inquisitive frame of mind shaped a fortunate life on two\ncontinents, taking me from one amazing mentor, colleague, and friend to\nanother, working in stimulating settings to interpret data from\nstate-of-the-art space observatories.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:55:53 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 16:41:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Schrijver","C. J.",""]]}
{"id":"2308.09070","submitter":"AmirHossein Naghshzan","authors":"AmirHossein Naghshzan, Sylvie Ratte","title":"Enhancing API Documentation through BERTopic Modeling and Summarization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the amount of textual data in various fields, including software\ndevelopment, continues to grow, there is a pressing demand for efficient and\neffective extraction and presentation of meaningful insights. This paper\npresents a unique approach to address this need, focusing on the complexities\nof interpreting Application Programming Interface (API) documentation. While\nofficial API documentation serves as a primary source of information for\ndevelopers, it can often be extensive and lacks user-friendliness. In light of\nthis, developers frequently resort to unofficial sources like Stack Overflow\nand GitHub. Our novel approach employs the strengths of BERTopic for topic\nmodeling and Natural Language Processing (NLP) to automatically generate\nsummaries of API documentation, thereby creating a more efficient method for\ndevelopers to extract the information they need. The produced summaries and\ntopics are evaluated based on their performance, coherence, and\ninteroperability.\n  The findings of this research contribute to the field of API documentation\nanalysis by providing insights into recurring topics, identifying common\nissues, and generating potential solutions. By improving the accessibility and\nefficiency of API documentation comprehension, our work aims to enhance the\nsoftware development process and empower developers with practical tools for\nnavigating complex APIs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 15:57:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Naghshzan","AmirHossein",""],["Ratte","Sylvie",""]]}
{"id":"2308.09071","submitter":"Hannah Bradley","authors":"Hannah Bradley (1), Steven Louis (2), Andrei Slavin (1), and Vasyl\n  Tyberkevych (1) ((1) Department of Physics, Oakland University, (2)\n  Department of Electrical Engineering, Oakland University)","title":"Pattern recognition using spiking antiferromagnetic neurons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spintronic devices offer a promising avenue for the development of nanoscale,\nenergy-efficient artificial neurons for neuromorphic computing. It has\npreviously been shown that with antiferromagnetic (AFM) oscillators, ultra-fast\nspiking artificial neurons can be made that mimic many unique features of\nbiological neurons. In this work, we train an artificial neural network of AFM\nneurons to perform pattern recognition. A simple machine learning algorithm\ncalled spike pattern association neuron (SPAN), which relies on the temporal\nposition of neuron spikes, is used during training. In under a microsecond of\nphysical time, the AFM neural network is trained to recognize symbols composed\nfrom a grid by producing a spike within a specified time window. We further\nachieve multi-symbol recognition with the addition of an output layer to\nsuppress undesirable spikes. Through the utilization of AFM neurons and the\nSPAN algorithm, we create a neural network capable of high-accuracy recognition\nwith overall power consumption on the order of picojoules.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:00:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bradley","Hannah",""],["Louis","Steven",""],["Slavin","Andrei",""],["Tyberkevych","Vasyl",""]]}
{"id":"2308.09072","submitter":"Rongfei Fan","authors":"Xuming An, Rongfei Fan, Shiyuan Zuo, Han Hu, Hai Jiang, and Ning Zhang","title":"Joint Power Control and Data Size Selection for Over-the-Air Computation\n  Aided Federated Learning","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) has emerged as an appealing machine learning approach\nto deal with massive raw data generated at multiple mobile devices, {which\nneeds to aggregate the training model parameter of every mobile device at one\nbase station (BS) iteratively}. For parameter aggregating in FL, over-the-air\ncomputation is a spectrum-efficient solution, which allows all mobile devices\nto transmit their parameter-mapped signals concurrently to a BS. Due to\nheterogeneous channel fading and noise, there exists difference between the\nBS's received signal and its desired signal, measured as the mean-squared error\n(MSE). To minimize the MSE, we propose to jointly optimize the signal\namplification factors at the BS and the mobile devices as well as the data size\n(the number of data samples involved in local training) at every mobile device.\nThe formulated problem is challenging to solve due to its non-convexity. To\nfind the optimal solution, with some simplification on cost function and\nvariable replacement, which still preserves equivalence, we transform the\nchanged problem to be a bi-level problem equivalently. For the lower-level\nproblem, optimal solution is found by enumerating every candidate solution from\nthe Karush-Kuhn-Tucker (KKT) condition. For the upper-level problem, the\noptimal solution is found by exploring its piecewise convexity. Numerical\nresults show that our proposed method can greatly reduce the MSE and can help\nto improve the training performance of FL compared with benchmark methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:01:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["An","Xuming",""],["Fan","Rongfei",""],["Zuo","Shiyuan",""],["Hu","Han",""],["Jiang","Hai",""],["Zhang","Ning",""]]}
{"id":"2308.09073","submitter":"Jian Yang","authors":"Ying Mo, Jian Yang, Jiahao Liu, Qifan Wang, Ruoyu Chen, Jingang Wang,\n  Zhoujun Li","title":"mCL-NER: Cross-Lingual Named Entity Recognition via Multi-view\n  Contrastive Learning","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-lingual named entity recognition (CrossNER) faces challenges stemming\nfrom uneven performance due to the scarcity of multilingual corpora, especially\nfor non-English data. While prior efforts mainly focus on data-driven transfer\nmethods, a significant aspect that has not been fully explored is aligning both\nsemantic and token-level representations across diverse languages. In this\npaper, we propose Multi-view Contrastive Learning for Cross-lingual Named\nEntity Recognition (mCL-NER). Specifically, we reframe the CrossNER task into a\nproblem of recognizing relationships between pairs of tokens. This approach\ntaps into the inherent contextual nuances of token-to-token connections within\nentities, allowing us to align representations across different languages. A\nmulti-view contrastive learning framework is introduced to encompass semantic\ncontrasts between source, codeswitched, and target sentences, as well as\ncontrasts among token-to-token relations. By enforcing agreement within both\nsemantic and relational spaces, we minimize the gap between source sentences\nand their counterparts of both codeswitched and target sentences. This\nalignment extends to the relationships between diverse tokens, enhancing the\nprojection of entities across languages. We further augment CrossNER by\ncombining self-training with labeled source data and unlabeled target data. Our\nexperiments on the XTREME benchmark, spanning 40 languages, demonstrate the\nsuperiority of mCL-NER over prior data-driven and model-based approaches. It\nachieves a substantial increase of nearly +2.0 $F_1$ scores across a broad\nspectrum and establishes itself as the new state-of-the-art performer.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:02:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mo","Ying",""],["Yang","Jian",""],["Liu","Jiahao",""],["Wang","Qifan",""],["Chen","Ruoyu",""],["Wang","Jingang",""],["Li","Zhoujun",""]]}
{"id":"2308.09074","submitter":"Georg Oberdieck","authors":"Georg Oberdieck","title":"On the descendent Gromov-Witten theory of a K3 surface","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the reduced descendent Gromov-Witten theory of K3 surfaces in\nprimitive curve classes. We present a conjectural closed formula for the\nstationary theory, which generalizes the Bryan-Leung formula. We also prove a\nnew recursion that allows to remove descendent insertions of $1$ in many\ninstances. Together this yields an efficient way to compute a large class of\ninvariants (modulo the conjecture on the stationary part). As a corollary we\nconjecture a surprising polynomial structure which underlies the Gromov-Witten\ninvariants of the K3 surface.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:04:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Oberdieck","Georg",""]]}
{"id":"2308.09075","submitter":"Souma Chowdhury","authors":"Prajit KrisshnaKumar, Jhoel Witter, Steve Paul, Hanvit Cho, Karthik\n  Dantu, and Souma Chowdhury","title":"Fast Decision Support for Air Traffic Management at Urban Air Mobility\n  Vertiports using Graph Learning","comments":"Accepted for presentation in proceedings of IEEE/RSJ International\n  Conference on Intelligent Robots and Systems 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Urban Air Mobility (UAM) promises a new dimension to decongested, safe, and\nfast travel in urban and suburban hubs. These UAM aircraft are conceived to\noperate from small airports called vertiports each comprising multiple\ntake-off/landing and battery-recharging spots. Since they might be situated in\ndense urban areas and need to handle many aircraft landings and take-offs each\nhour, managing this schedule in real-time becomes challenging for a traditional\nair-traffic controller but instead calls for an automated solution. This paper\nprovides a novel approach to this problem of Urban Air Mobility - Vertiport\nSchedule Management (UAM-VSM), which leverages graph reinforcement learning to\ngenerate decision-support policies. Here the designated physical spots within\nthe vertiport's airspace and the vehicles being managed are represented as two\nseparate graphs, with feature extraction performed through a graph\nconvolutional network (GCN). Extracted features are passed onto perceptron\nlayers to decide actions such as continue to hover or cruise, continue idling\nor take-off, or land on an allocated vertiport spot. Performance is measured\nbased on delays, safety (no. of collisions) and battery consumption. Through\nrealistic simulations in AirSim applied to scaled down multi-rotor vehicles,\nour results demonstrate the suitability of using graph reinforcement learning\nto solve the UAM-VSM problem and its superiority to basic reinforcement\nlearning (with graph embeddings) or random choice baselines.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:05:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["KrisshnaKumar","Prajit",""],["Witter","Jhoel",""],["Paul","Steve",""],["Cho","Hanvit",""],["Dantu","Karthik",""],["Chowdhury","Souma",""]]}
{"id":"2308.09076","submitter":"Wen Sun","authors":"Wen Sun, Luis C. Ho, Ming-Yang Zhuang, Chao Ma, Changhao Chen, Ruancun\n  Li","title":"The Structure and Morphology of Galaxies during the Epoch of\n  Reionization Revealed by JWST","comments":"23 pages, 17 figures, 2 tables, accepted for publication in The\n  Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze 347 galaxies at redshift $4<z<9.5$ using JWST observations from\nthe CEERS program by fitting a two-dimensional parametric model simultaneously\nto the seven-filter NIRCam images to measure the overall structural parameters\nand quantify the global properties of the galaxies in the rest-frame optical\nband. Particular attention is devoted to deriving robust uncertainties that\ninclude, among other factors, the influence of cosmological surface brightness\ndimming and resolution effects. Using the global S\\'ersic index ($n < 1.5$) and\nobserved axial ratio ($q < 0.6$) as a guide, we place a conservative lower\nlimit of $\\sim 45\\%$ on the incidence of galactic disks. Galaxies follow a\nrelation between rest-frame optical luminosity and effective radius in the\nredshift range $4<z<9.5$, as well as separately over the intervals $4 < z < 5$\nand $5 \\leq z < 9.5$, with a very similar slope but a marginally lower zero\npoint in the higher redshift bin ($R_e = 0.49 \\pm 0.07$ kpc) compared to the\nlower redshift bin ($R_e = 0.65 \\pm 0.12$ kpc). Within the limitations of the\ncurrent sample size, we find no significant redshift evolution of $n$ or $R_e$\nat these early epochs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:06:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Wen",""],["Ho","Luis C.",""],["Zhuang","Ming-Yang",""],["Ma","Chao",""],["Chen","Changhao",""],["Li","Ruancun",""]]}
{"id":"2308.09077","submitter":"Jonghee Yoo Professor","authors":"Byeongsu Yang, Hojin Yoon, Moohyun Ahn, Youngjae Lee, and Jonghee Yoo","title":"Extended Axion Dark Matter Search Using the CAPP18T Haloscope","comments":"7 pages and 4 figures","journal-ref":"Phys.Rev.Lett 131 081801 (2023)","doi":"10.1103/PhysRevLett.131.081801","report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report an extended search for the axion dark matter using the CAPP18T\nhaloscope. The CAPP18T experiment adopts innovative technologies of a\nhigh-temperature superconducting magnet and a Josephson parametric converter.\nThe CAPP18T detector was reconstructed after an unexpected incident of the\nhigh-temperature superconducting magnet quenching. The system reconstruction\nincludes rebuilding the magnet, improving the impedance matching in the\nmicrowave chain, and mechanically readjusting the tuning rod to the cavity for\nimproved thermal contact. The total system noise temperature is $\\sim$0.6\\,K.\nThe coupling between the cavity and the strong antenna is maintained at $\\beta\n\\simeq 2$ to enhance the axion search scanning speed. The scan frequency range\nis from 4.8077 to 4.8181 GHz. No significant indication of the axion dark\nmatter signature is observed. The results set the best upper bound of the\naxion-photon-photon coupling ($g_{a\\gamma\\gamma}$) in the mass ranges of 19.883\nto 19.926\\,$\\mu$eV at $\\sim$0.7$\\times|g_{a\\gamma\\gamma}^{\\text{KSVZ}}|$ or\n$\\sim$1.9$\\times|g_{a\\gamma\\gamma}^{\\text{DFSZ}}|$ with 90\\,\\% confidence\nlevel. The results demonstrate that a reliable search of the high-mass dark\nmatter axions can be achieved beyond the benchmark models using the technology\nadopted in CAPP18T.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:07:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Byeongsu",""],["Yoon","Hojin",""],["Ahn","Moohyun",""],["Lee","Youngjae",""],["Yoo","Jonghee",""]]}
{"id":"2308.09078","submitter":"Vaidotas Simkus","authors":"Vaidotas Simkus and Michael U. Gutmann","title":"Conditional Sampling of Variational Autoencoders via Iterated\n  Approximate Ancestral Sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conditional sampling of variational autoencoders (VAEs) is needed in various\napplications, such as missing data imputation, but is computationally\nintractable. A principled choice for asymptotically exact conditional sampling\nis Metropolis-within-Gibbs (MWG). However, we observe that the tendency of VAEs\nto learn a structured latent space, a commonly desired property, can cause the\nMWG sampler to get \"stuck\" far from the target distribution. This paper\nmitigates the limitations of MWG: we systematically outline the pitfalls in the\ncontext of VAEs, propose two original methods that address these pitfalls, and\ndemonstrate an improved performance of the proposed methods on a set of\nsampling tasks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:08:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Simkus","Vaidotas",""],["Gutmann","Michael U.",""]]}
{"id":"2308.09079","submitter":"Dennis Soldin","authors":"Dennis Soldin","title":"Astroparticle Physics with the Forward Physics Facility at the\n  High-Luminosity LHC","comments":"8 pages, 5 figures, presented at the 38th International Cosmic Ray\n  Conference (ICRC2023)","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-327","categories":"hep-ex astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-energy collisions at the High-Luminosity Large Hadron Collider (HL-LHC)\nwill produce an enormous flux of particles along the beam collision axis that\nis not accessible by existing LHC experiments. Multi-particle production in the\nfar-forward region is of particular interest for astroparticle physics.\nHigh-energy cosmic rays produce large particle cascades in the atmosphere,\nextensive air showers (EAS), which are driven by hadron-ion collisions under\nlow momentum transfer in the non-perturbative regime of QCD. Thus, the\nunderstanding of high-energy hadronic interactions in the forward region is\ncrucial for the interpretation of EAS data and for the estimation of\nbackgrounds for searches of astrophysical neutrinos. The Forward Physics\nFacility (FPF) is a proposal to build a new underground cavern at the HL-LHC\nwhich will host a variety of far-forward experiments to detect particles\noutside the acceptance of the existing LHC experiments.\n  We will present the current status of plans for the FPF and highlight the\nsynergies with astroparticle physics. In particular, we will discuss how\nmeasurements at the FPF will improve the modeling of high-energy hadronic\ninteractions in the atmosphere and thereby reduce the associated uncertainties\nof measurements in the context of multi-messenger astrophysics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:08:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Soldin","Dennis",""]]}
{"id":"2308.09080","submitter":"Adrian Holzbock","authors":"Adrian Holzbock, Alexander Tsaregorodtsev, and Vasileios Belagiannis","title":"Pedestrian Environment Model for Automated Driving","comments":"Accepted for presentation at the 26th IEEE International Conference\n  on Intelligent Transportation Systems (ITSC 2023), 24-28 September 2023,\n  Bilbao, Bizkaia, Spain","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Besides interacting correctly with other vehicles, automated vehicles should\nalso be able to react in a safe manner to vulnerable road users like\npedestrians or cyclists. For a safe interaction between pedestrians and\nautomated vehicles, the vehicle must be able to interpret the pedestrian's\nbehavior. Common environment models do not contain information like body poses\nused to understand the pedestrian's intent. In this work, we propose an\nenvironment model that includes the position of the pedestrians as well as\ntheir pose information. We only use images from a monocular camera and the\nvehicle's localization data as input to our pedestrian environment model. We\nextract the skeletal information with a neural network human pose estimator\nfrom the image. Furthermore, we track the skeletons with a simple tracking\nalgorithm based on the Hungarian algorithm and an ego-motion compensation. To\nobtain the 3D information of the position, we aggregate the data from\nconsecutive frames in conjunction with the vehicle position. We demonstrate our\npedestrian environment model on data generated with the CARLA simulator and the\nnuScenes dataset. Overall, we reach a relative position error of around 16% on\nboth datasets.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:10:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Holzbock","Adrian",""],["Tsaregorodtsev","Alexander",""],["Belagiannis","Vasileios",""]]}
{"id":"2308.09081","submitter":"Daniel Blackwell","authors":"Daniel Blackwell, Ingolf Becker, David Clark","title":"Hyperfuzzing: black-box security hypertesting with a grey-box fuzzer","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Information leakage is a class of error that can lead to severe consequences.\nHowever unlike other errors, it is rarely explicitly considered during the\nsoftware testing process. LeakFuzzer advances the state of the art by using a\nnoninterference security property together with a security flow policy as an\noracle. As the tool extends the state of the art fuzzer, AFL++, LeakFuzzer\ninherits the advantages of AFL++ such as scalability, automated input\ngeneration, high coverage and low developer intervention.\n  The tool can detect the same set of errors that a normal fuzzer can detect,\nwith the addition of being able to detect violations of secure information flow\npolicies.\n  We evaluated LeakFuzzer on a diverse set of 10 C and C++ benchmarks\ncontaining known information leaks, ranging in size from just 80 to over 900k\nlines of code. Seven of these are taken from real-world CVEs including\nHeartbleed and a recent error in PostgreSQL. Given 20 24-hour runs, LeakFuzzer\ncan find 100% of the leaks in the SUTs whereas existing techniques using such\nas the CBMC model checker and AFL++ augmented with different sanitizers can\nonly find 40% at best.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:15:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Blackwell","Daniel",""],["Becker","Ingolf",""],["Clark","David",""]]}
{"id":"2308.09082","submitter":"Rongfei Fan","authors":"Rongfei Fan, Xuming An, Shiyuan Zuo, and Han Hu","title":"Over-the-Air Computation Aided Federated Learning with the Aggregation\n  of Normalized Gradient","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over-the-air computation is a communication-efficient solution for federated\nlearning (FL). In such a system, iterative procedure is performed: Local\ngradient of private loss function is updated, amplified and then transmitted by\nevery mobile device; the server receives the aggregated gradient all-at-once,\ngenerates and then broadcasts updated model parameters to every mobile device.\nIn terms of amplification factor selection, most related works suppose the\nlocal gradient's maximal norm always happens although it actually fluctuates\nover iterations, which may degrade convergence performance. To circumvent this\nproblem, we propose to turn local gradient to be normalized one before\namplifying it. Under our proposed method, when the loss function is smooth, we\nprove our proposed method can converge to stationary point at sub-linear rate.\nIn case of smooth and strongly convex loss function, we prove our proposed\nmethod can achieve minimal training loss at linear rate with any small positive\ntolerance. Moreover, a tradeoff between convergence rate and the tolerance is\ndiscovered. To speedup convergence, problems optimizing system parameters are\nalso formulated for above two cases. Although being non-convex, optimal\nsolution with polynomial complexity of the formulated problems are derived.\nExperimental results show our proposed method can outperform benchmark methods\non convergence performance.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:15:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fan","Rongfei",""],["An","Xuming",""],["Zuo","Shiyuan",""],["Hu","Han",""]]}
{"id":"2308.09083","submitter":"Paul Thibado","authors":"P.M. Thibado, J. C. Neu, Pradeep Kumar, Surendra Singh, and L. L.\n  Bonilla","title":"Charging capacitors from thermal fluctuations using diodes","comments":"13 pages, 6 figures","journal-ref":"Physical Review E 108, 024130 (2023)","doi":"10.1103/PhysRevE.108.024130","report-no":null,"categories":"cond-mat.mes-hall cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We theoretically consider a graphene ripple as a Brownian particle coupled to\nan energy storage circuit. When circuit and particle are at the same\ntemperature, the second law forbids harvesting energy from the thermal motion\nof the Brownian particle, even if the circuit contains a rectifying diode.\nHowever, when the circuit contains a junction followed by two diodes wired in\nopposition, the approach to equilibrium may become ultraslow. Detailed balance\nis temporarily broken as current flows between the two diodes and charges\nstorage capacitors. The energy harvested by each capacitor comes from the\nthermal bath of the diodes while the system obeys the first and second laws of\nthermodynamics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:17:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thibado","P. M.",""],["Neu","J. C.",""],["Kumar","Pradeep",""],["Singh","Surendra",""],["Bonilla","L. L.",""]]}
{"id":"2308.09084","submitter":"Dongyang Yu","authors":"Dongyang Yu and Haoyue Zhang and Zhirui Zhou and Wangpeng An and\n  Yanhong Yang","title":"MovePose: A High-performance Human Pose Estimation Algorithm on Mobile\n  and Edge Devices","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":"  We present MovePose, an optimized lightweight convolutional neural network\ndesigned specifically for real-time body pose estimation on CPU-based mobile\ndevices. The current solutions do not provide satisfactory accuracy and speed\nfor human posture estimation, and MovePose addresses this gap. It aims to\nmaintain real-time performance while improving the accuracy of human posture\nestimation for mobile devices. The network produces 17 keypoints for each\nindividual at a rate exceeding 11 frames per second, making it suitable for\nreal-time applications such as fitness tracking, sign language interpretation,\nand advanced mobile human posture estimation. Our MovePose algorithm has\nattained an Mean Average Precision (mAP) score of 67.7 on the COCO\n\\cite{cocodata} validation dataset. The MovePose algorithm displayed efficiency\nwith a performance of 69+ frames per second (fps) when run on an Intel\ni9-10920x CPU. Additionally, it showcased an increased performance of 452+ fps\non an NVIDIA RTX3090 GPU. On an Android phone equipped with a Snapdragon 8 + 4G\nprocessor, the fps reached above 11. To enhance accuracy, we incorporated three\ntechniques: deconvolution, large kernel convolution, and coordinate\nclassification methods. Compared to basic upsampling, deconvolution is\ntrainable, improves model capacity, and enhances the receptive field. Large\nkernel convolution strengthens these properties at a decreased computational\ncost. In summary, MovePose provides high accuracy and real-time performance,\nmarking it a potential tool for a variety of applications, including those\nfocused on mobile-side human posture estimation. The code and models for this\nalgorithm will be made publicly accessible.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:23:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yu","Dongyang",""],["Zhang","Haoyue",""],["Zhou","Zhirui",""],["An","Wangpeng",""],["Yang","Yanhong",""]]}
{"id":"2308.09085","submitter":"Kai Zeng","authors":"Kai Zeng and Xiangming Xu and Yulie Wu and Xuezhong Wu and Dingbang\n  Xiao","title":"Optically levitated gyroscopes with a MHz rotating micro-rotor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The optically levitated particles have been driven to rotate at an ultra-high\nspeed of GHz, and the gyroscopic application of these levitated particles to\nmeasure angular motion have long been explored. However, this gyroscope has not\nbeen proven either theoretically or experimentally. Here, a rotor gyroscope\nbased on optically levitated high-speed rotating particles is proposed. In\nvacuum, an ellipsoidal vaterite particle with 3.58 $\\mu$m average diameter is\ndriven to rotate at MHz, and the optical axis orientation of the particle is\nmeasured by the particle rotational signal. The external inputted angular\nvelocity makes the optical axis deviate from the initial position, which\nchanges the frequency and amplitude of the rotational signal. The inputted\nangular velocity is hence detected by the rotational signal, and the angular\nrate bias instability of the prototype is measured to be $0.08^o/s$. It is the\nsmallest rotor gyroscope in the world, and the bias instability can be further\nimproved up to $10^{-9o}/h$ theoretically by cooling the motion and increasing\nthe angular moment of the levitated particle. Our work opens a new application\nparadigm of the levitated optomechanical systems and possibly bring the rotor\ngyroscope to the quantum realm.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:26:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zeng","Kai",""],["Xu","Xiangming",""],["Wu","Yulie",""],["Wu","Xuezhong",""],["Xiao","Dingbang",""]]}
{"id":"2308.09086","submitter":"Lucian Chan","authors":"Lucian Chan and Marcel Verdonk and Carl Poelking","title":"Embracing assay heterogeneity with neural processes for markedly\n  improved bioactivity predictions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predicting the bioactivity of a ligand is one of the hardest and most\nimportant challenges in computer-aided drug discovery. Despite years of data\ncollection and curation efforts by research organizations worldwide,\nbioactivity data remains sparse and heterogeneous, thus hampering efforts to\nbuild predictive models that are accurate, transferable and robust. The\nintrinsic variability of the experimental data is further compounded by data\naggregation practices that neglect heterogeneity to overcome sparsity. Here we\ndiscuss the limitations of these practices and present a hierarchical\nmeta-learning framework that exploits the information synergy across disparate\nassays by successfully accounting for assay heterogeneity. We show that the\nmodel achieves a drastic improvement in affinity prediction across diverse\nprotein targets and assay types compared to conventional baselines. It can\nquickly adapt to new target contexts using very few observations, thus enabling\nlarge-scale virtual screening in early-phase drug discovery.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:26:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chan","Lucian",""],["Verdonk","Marcel",""],["Poelking","Carl",""]]}
{"id":"2308.09087","submitter":"Federico Errica","authors":"Daniele Atzeni, Federico Errica, Davide Bacciu, Alessio Micheli","title":"Modeling Edge Features with Deep Bayesian Graph Networks","comments":"Releasing pre-print version to comply with TAILOR project\n  requirements","journal-ref":null,"doi":"10.1109/IJCNN52387.2021.9533430","report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an extension of the Contextual Graph Markov Model, a deep and\nprobabilistic machine learning model for graphs, to model the distribution of\nedge features. Our approach is architectural, as we introduce an additional\nBayesian network mapping edge features into discrete states to be used by the\noriginal model. In doing so, we are also able to build richer graph\nrepresentations even in the absence of edge features, which is confirmed by the\nperformance improvements on standard graph classification benchmarks. Moreover,\nwe successfully test our proposal in a graph regression scenario where edge\nfeatures are of fundamental importance, and we show that the learned edge\nrepresentation provides substantial performance improvements against the\noriginal model on three link prediction tasks. By keeping the computational\ncomplexity linear in the number of edges, the proposed model is amenable to\nlarge-scale graph processing.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:29:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Atzeni","Daniele",""],["Errica","Federico",""],["Bacciu","Davide",""],["Micheli","Alessio",""]]}
{"id":"2308.09088","submitter":"Hajime Yoshino","authors":"Hajime Yoshino, Normann Mertig, Akira Shudo","title":"Uniform hyperbolicity of a class of scattering maps","comments":"50 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years fractal Weyl laws and related quantum eigenfunction\nhypothesis have been studied in a plethora of numerical model systems, called\nquantum maps. In some models studied there one can easily prove uniform\nhyperbolicity. Yet, a numerically sound method for computing quantum resonance\nstates, did not exist. To address this challenge, we recently introduced a new\nclass of quantum maps. For these quantum maps, we showed that, quantum\nresonance states can numerically be computed using theoretically grounded\nmethods such as complex scaling or weak absorbing potentials. However, proving\nuniform hyperbolicty for this class of quantum maps was not straight forward.\nGoing beyond that work this article generalizes the class of scattering maps\nand provides mathematical proofs for their uniform hyperbolicity. In\nparticular, we show that the suggested class of two-dimensional symplectic\nscattering maps satisfies the topological horseshoe condition and uniform\nhyperbolicity. In order to prove these properties, we follow the procedure\ndeveloped in the paper by Devaney and Nitecki. Specifically, uniform\nhyperbolicity is shown by identifying a proper region in which the\nnon-wandering set satisfies a sufficient condition to have the so-called sector\nbundle or cone field. Since no quantum map is known where both a proof of\nuniform hyperbolicity and a methodologically sound method for numerically\ncomputing quantum resonance states exist simultaneously, the present result\nshould be valuable to further test fractal Weyl laws and related topics such as\nchaotic eigenfunction hypothesis.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:35:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yoshino","Hajime",""],["Mertig","Normann",""],["Shudo","Akira",""]]}
{"id":"2308.09089","submitter":"Julia Wilkins","authors":"Julia Wilkins, Justin Salamon, Magdalena Fuentes, Juan Pablo Bello,\n  Oriol Nieto","title":"Bridging High-Quality Audio and Video via Language for Sound Effects\n  Retrieval from Visual Queries","comments":"WASPAA 2023. Project page:\n  https://juliawilkins.github.io/sound-effects-retrieval-from-video/. 4 pages,\n  2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CV cs.IR cs.MM eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Finding the right sound effects (SFX) to match moments in a video is a\ndifficult and time-consuming task, and relies heavily on the quality and\ncompleteness of text metadata. Retrieving high-quality (HQ) SFX using a video\nframe directly as the query is an attractive alternative, removing the reliance\non text metadata and providing a low barrier to entry for non-experts. Due to\nthe lack of HQ audio-visual training data, previous work on audio-visual\nretrieval relies on YouTube (in-the-wild) videos of varied quality for\ntraining, where the audio is often noisy and the video of amateur quality. As\nsuch it is unclear whether these systems would generalize to the task of\nmatching HQ audio to production-quality video. To address this, we propose a\nmultimodal framework for recommending HQ SFX given a video frame by (1)\nleveraging large language models and foundational vision-language models to\nbridge HQ audio and video to create audio-visual pairs, resulting in a highly\nscalable automatic audio-visual data curation pipeline; and (2) using\npre-trained audio and visual encoders to train a contrastive learning-based\nretrieval system. We show that our system, trained using our automatic data\ncuration pipeline, significantly outperforms baselines trained on in-the-wild\ndata on the task of HQ SFX retrieval for video. Furthermore, while the\nbaselines fail to generalize to this task, our system generalizes well from\nclean to in-the-wild data, outperforming the baselines on a dataset of YouTube\nvideos despite only being trained on the HQ audio-visual pairs. A user study\nconfirms that people prefer SFX retrieved by our system over the baseline 67%\nof the time both for HQ and in-the-wild data. Finally, we present ablations to\ndetermine the impact of model and data pipeline design choices on downstream\nretrieval performance. Please visit our project website to listen to and view\nour SFX retrieval results.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:38:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wilkins","Julia",""],["Salamon","Justin",""],["Fuentes","Magdalena",""],["Bello","Juan Pablo",""],["Nieto","Oriol",""]]}
{"id":"2308.09090","submitter":"Mohammed Elrashidy","authors":"Hammam Salem, MD Muzakkir Quamar, Adeb Mansoor, Mohammed Elrashidy,\n  Nasir Saeed and Mudassir Masood","title":"Data-driven Integrated Sensing and Communication: Recent Advances,\n  Challenges, and Future Prospects","comments":"ISAC-ML survey","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Integrated Sensing and Communication (ISAC), combined with data-driven\napproaches, has emerged as a highly significant field, garnering considerable\nattention from academia and industry. Its potential to enable wide-scale\napplications in the future sixth-generation (6G) networks has led to extensive\nrecent research efforts. Machine learning (ML) techniques, including\n$K$-nearest neighbors (KNN), support vector machines (SVM), deep learning (DL)\narchitectures, and reinforcement learning (RL) algorithms, have been deployed\nto address various design aspects of ISAC and its diverse applications.\nTherefore, this paper aims to explore integrating various ML techniques into\nISAC systems, covering various applications. These applications span\nintelligent vehicular networks, encompassing unmanned aerial vehicles (UAVs)\nand autonomous cars, as well as radar applications, localization and tracking,\nmillimeter wave (mmWave) and Terahertz (THz) communication, and beamforming.\nThe contributions of this paper lie in its comprehensive survey of ML-based\nworks in the ISAC domain and its identification of challenges and future\nresearch directions. By synthesizing the existing knowledge and proposing new\nresearch avenues, this survey serves as a valuable resource for researchers,\npractitioners, and stakeholders involved in advancing the capabilities of ISAC\nsystems in the context of 6G networks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:39:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salem","Hammam",""],["Quamar","MD Muzakkir",""],["Mansoor","Adeb",""],["Elrashidy","Mohammed",""],["Saeed","Nasir",""],["Masood","Mudassir",""]]}
{"id":"2308.09091","submitter":"Yuanzhi Wang","authors":"Yuanzhi Wang, Yong Li, Xin Liu, Anbo Dai, Antoni Chan, Zhen Cui","title":"Edit Temporal-Consistent Videos with Image Diffusion Model","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large-scale text-to-image (T2I) diffusion models have been extended for\ntext-guided video editing, yielding impressive zero-shot video editing\nperformance. Nonetheless, the generated videos usually show spatial\nirregularities and temporal inconsistencies as the temporal characteristics of\nvideos have not been faithfully modeled. In this paper, we propose an elegant\nyet effective Temporal-Consistent Video Editing (TCVE) method, to mitigate the\ntemporal inconsistency challenge for robust text-guided video editing. In\naddition to the utilization of a pretrained 2D Unet for spatial content\nmanipulation, we establish a dedicated temporal Unet architecture to faithfully\ncapture the temporal coherence of the input video sequences. Furthermore, to\nestablish coherence and interrelation between the spatial-focused and\ntemporal-focused components, a cohesive joint spatial-temporal modeling unit is\nformulated. This unit effectively interconnects the temporal Unet with the\npretrained 2D Unet, thereby enhancing the temporal consistency of the generated\nvideo output while simultaneously preserving the capacity for video content\nmanipulation. Quantitative experimental results and visualization results\ndemonstrate that TCVE achieves state-of-the-art performance in both video\ntemporal consistency and video editing capability, surpassing existing\nbenchmarks in the field.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:40:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yuanzhi",""],["Li","Yong",""],["Liu","Xin",""],["Dai","Anbo",""],["Chan","Antoni",""],["Cui","Zhen",""]]}
{"id":"2308.09092","submitter":"Jaehyun Chung","authors":"Seungjae Jeon, Jaehyun Chung, Doowon Jeong","title":"Watch Out! Smartwatches as criminal tool and digital forensic\n  investigations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the rapidly advancing technological landscape, smartwatches have\nmaterialized as multifunctional devices integral to our daily routines.\nSmartwatches store a substantial amount of personal information, potentially\nserving as repositories of digital evidence. Thus, digital forensic researchers\nhave devoted considerable effort to exploring smartwatch forensic techniques.\nHowever, it has been observed that prior studies have primarily treated\nsmartwatches as mere storage mediums for digital evidence, neglecting their\npotential role in criminal activities. This paper presents the information\nleakage perpetrated through smartwatches. We represent crime scenarios in an\nenvironment where smartphones are not available, considering that the\nperception that smartphones can be used as tools for criminal behavior prevails\nin many organizations, while the potential of similar-use smartwatches is often\noverlooked. We detail mechanisms for information leakage via file transfer and\ncamera control using smartwatches. Additionally, we present methods to\ninvestigate each crime incident through smartwatch forensics. Finally, we\ndescribe the limitations of post-incident responses and propose proactive\nmeasures to prepare for potential crimes involving smartwatches. Keywords:\nInformation Leakage, Smartwatch Forensics, Android Forensics, Mobile Device\nManagement, Security Policy\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:41:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jeon","Seungjae",""],["Chung","Jaehyun",""],["Jeong","Doowon",""]]}
{"id":"2308.09093","submitter":"Aleksandr Mosenkov","authors":"Aleksandr V. Mosenkov, R. Michael Rich, Michael Fusco, Julia\n  Kennefick, David Thilker, Alexander Marchuk, Noah Brosch, Michael West,\n  Michael Gregg, Francis Longstaff, Andreas J. Koch-Hansen, Shameer Abdeen,\n  William Roque","title":"The haloes and environments of nearby galaxies (HERON) -- III. A 45 kpc\n  spiral structure in the GLSB galaxy UGC 4599","comments":"17 pages, 14 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use a 0.7-m telescope in the framework of the Halos and Environments of\nNearby Galaxies (HERON) survey to probe low surface brightness structures in\nnearby galaxies. One of our targets, UGC 4599, is usually classified as an\nearly-type galaxy surrounded by a blue ring making it a potential Hoag's Object\nanalog. Prior photometric studies of UGC 4599 were focused on its bright core\nand the blue ring. However, the HERON survey allows us to study its faint\nextended regions. With an eight hour integration, we detect an extremely faint\nouter disk with an extrapolated central surface brightness of\n$\\mu_\\mathrm{0,d}(r)=25.5$ mag arcsec$^{-2}$ down to 31 mag arcsec$^{-2}$ and a\nscale length of 15 kpc. We identify two distinct spiral arms of pitch angle\n~6{\\deg} surrounding the ring. The spiral arms are detected out to ~45 kpc in\nradius and the faint disk continues to ~70 kpc. These features are also seen in\nthe GALEX FUV and NUV bands, in a deep u-band image from the 4.3m Lowell\nDiscovery Telescope (which reveals inner spiral structure emerging from the\ncore), and in HI. We compare this galaxy to ordinary spiral and elliptical\ngalaxies, giant low surface brightness (GLSB) galaxies, and Hoag's Object\nitself using several standard galaxy scaling relations. We conclude that the\npseudobulge and disk properties of UGC 4599 significantly differ from those of\nHoag's Object and of normal galaxies, pointing toward a GLSB galaxy nature and\nfilamentary accretion of gas to generate its outer disk.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:42:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mosenkov","Aleksandr V.",""],["Rich","R. Michael",""],["Fusco","Michael",""],["Kennefick","Julia",""],["Thilker","David",""],["Marchuk","Alexander",""],["Brosch","Noah",""],["West","Michael",""],["Gregg","Michael",""],["Longstaff","Francis",""],["Koch-Hansen","Andreas J.",""],["Abdeen","Shameer",""],["Roque","William",""]]}
{"id":"2308.09094","submitter":"Yifan Lu","authors":"Marcos M. Flores, Yifan Lu, Alexander Kusenko","title":"Structure Formation after Reheating: Supermassive Primordial Black Holes\n  and Fermi Ball Dark Matter","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"IPMU23-0027","categories":"astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the presence of (relatively) long-range forces, structures can form even\nduring the radiation dominated era, leading to compact objects, such as Fermi\nballs or primordial black holes (PBH), which can account for all or part of\ndark matter. We present a detailed analysis of a model in which fermions are\nproduced from the inflaton decay developing some particle-antiparticle\nasymmetry. These fermions undergo clustering and structure formation driven by\na Yukawa interaction. The same interaction provides a cooling channel for the\ndark halos via scalar radiation, leading to rapid collapse and the formation of\na compact object. We discuss the criteria for the formation of either PBHs and\nFermi balls. In the PBH formation regime, supermassive PBHs can seed the active\ngalactic nuclei or quasars found at high redshift. Alternatively, Fermi balls\ncan account for all of the cold dark matter, while evading microlensing\nconstraints.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:43:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Flores","Marcos M.",""],["Lu","Yifan",""],["Kusenko","Alexander",""]]}
{"id":"2308.09095","submitter":"Farhang Bayat","authors":"Farhang Bayat, Dan Ruan, Moyed Miften, Cem Altunbas","title":"2D antiscatter grid and scatter sampling based CBCT pipeline for image\n  guided radiation therapy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Poor tissue visualization and quantitative accuracy in CBCT is a major\nbarrier in expanding the role of CBCT imaging from target localization to\nquantitative treatment monitoring and plan adaptations in radiation therapy\nsessions. To further improve image quality in CBCT, 2D antiscatter grid based\nscatter rejection was combined with a raw data processing pipeline and\niterative image reconstruction. The culmination of these steps was referred as\nquantitative CBCT, qCBCT. qCBCT data processing steps include 2D antiscatter\ngrid implementation, measurement based residual scatter, image lag, and beam\nhardening correction for offset detector geometry CBCT with a bow tie filter.\nImages were reconstructed with iterative image reconstruction to reduce image\nnoise. To evaluate image quality, qCBCT acquisitions were performed using a\nvariety of phantoms to investigate the effect of object size and its\ncomposition on image quality. qCBCT image quality was benchmarked against\nclinical CBCT and MDCT images. Addition of image lag and beam hardening\ncorrection to scatter suppression reduced HU degradation in qCBCT by 10 HU and\n40 HU, respectively. When compared to gold standard MDCT, mean HU errors in\nqCBCT and clinical CBCT were 10 HU and 27 HU, respectively. HU inaccuracy due\nto change in phantom size was 22 HU and 85 HU in qCBCT and clinical CBCT\nimages, respectively. With iterative reconstruction, contrast to noise ratio\nimproved by a factor of 1.25 when compared to clinical CBCT protocols. Robust\nartifact and noise suppression in qCBCT images can reduce the image quality gap\nbetween CBCT and MDCT, improving the promise of qCBCT in fulfilling the tasks\nthat demand high quantitative accuracy, such as CBCT based dose calculations\nand treatment response assessment in image guided radiation therapy.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:45:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bayat","Farhang",""],["Ruan","Dan",""],["Miften","Moyed",""],["Altunbas","Cem",""]]}
{"id":"2308.09096","submitter":"G\\\"urkan Soykan","authors":"G\\\"urkan Soykan, Deniz Yuret, Tevfik Metin Sezgin","title":"Identity-Aware Semi-Supervised Learning for Comic Character\n  Re-Identification","comments":"18 pages, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.IR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Character re-identification, recognizing characters consistently across\ndifferent panels in comics, presents significant challenges due to limited\nannotated data and complex variations in character appearances. To tackle this\nissue, we introduce a robust semi-supervised framework that combines metric\nlearning with a novel 'Identity-Aware' self-supervision method by contrastive\nlearning of face and body pairs of characters. Our approach involves processing\nboth facial and bodily features within a unified network architecture,\nfacilitating the extraction of identity-aligned character embeddings that\ncapture individual identities while preserving the effectiveness of face and\nbody features. This integrated character representation enhances feature\nextraction and improves character re-identification compared to\nre-identification by face or body independently, offering a parameter-efficient\nsolution. By extensively validating our method using in-series and inter-series\nevaluation metrics, we demonstrate its effectiveness in consistently\nre-identifying comic characters. Compared to existing methods, our approach not\nonly addresses the challenge of character re-identification but also serves as\na foundation for downstream tasks since it can produce character embeddings\nwithout restrictions of face and body availability, enriching the comprehension\nof comic books. In our experiments, we leverage two newly curated datasets: the\n'Comic Character Instances Dataset', comprising over a million character\ninstances and the 'Comic Sequence Identity Dataset', containing annotations of\nidentities within more than 3000 sets of four consecutive comic panels that we\ncollected.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:48:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Soykan","G\u00fcrkan",""],["Yuret","Deniz",""],["Sezgin","Tevfik Metin",""]]}
{"id":"2308.09097","submitter":"Tiago de Albuquerque Amorim","authors":"Tiago Amorim and Miriam Manoel","title":"Synchrony patterns in Laplacian networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A network of coupled dynamical systems is represented by a graph whose\nvertices represent individual cells and whose edges represent couplings between\ncells. Motivated by the impact of synchronization results of the Kuramoto\nnetworks, we introduce the generalized class of Laplacian networks, governed by\nmappings whose Jacobian at any point is a symmetric matrix with row entries\nsumming to zero. By recognizing this matrix with a weighted Laplacian of the\nassociated graph, we derive the optimal estimates of its positive, null and\nnegative eigenvalues directly from the graph topology. Furthermore, we provide\na characterization of the mappings that define Laplacian networks. Lastly, we\ndiscuss stability of equilibria inside synchrony subspaces for two types of\nLaplacian network on a ring with some extra couplings.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:49:17 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 12:32:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amorim","Tiago",""],["Manoel","Miriam",""]]}
{"id":"2308.09098","submitter":"Tao Tu","authors":"Tao Tu, Shun-Po Chuang, Yu-Lun Liu, Cheng Sun, Ke Zhang, Donna Roy,\n  Cheng-Hao Kuo, Min Sun","title":"ImGeoNet: Image-induced Geometry-aware Voxel Representation for\n  Multi-view 3D Object Detection","comments":"ICCV'23; project page: https://ttaoretw.github.io/imgeonet/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose ImGeoNet, a multi-view image-based 3D object detection framework\nthat models a 3D space by an image-induced geometry-aware voxel representation.\nUnlike previous methods which aggregate 2D features into 3D voxels without\nconsidering geometry, ImGeoNet learns to induce geometry from multi-view images\nto alleviate the confusion arising from voxels of free space, and during the\ninference phase, only images from multiple views are required. Besides, a\npowerful pre-trained 2D feature extractor can be leveraged by our\nrepresentation, leading to a more robust performance. To evaluate the\neffectiveness of ImGeoNet, we conduct quantitative and qualitative experiments\non three indoor datasets, namely ARKitScenes, ScanNetV2, and ScanNet200. The\nresults demonstrate that ImGeoNet outperforms the current state-of-the-art\nmulti-view image-based method, ImVoxelNet, on all three datasets in terms of\ndetection accuracy. In addition, ImGeoNet shows great data efficiency by\nachieving results comparable to ImVoxelNet with 100 views while utilizing only\n40 views. Furthermore, our studies indicate that our proposed image-induced\ngeometry-aware representation can enable image-based methods to attain superior\ndetection accuracy than the seminal point cloud-based method, VoteNet, in two\npractical scenarios: (1) scenarios where point clouds are sparse and noisy,\nsuch as in ARKitScenes, and (2) scenarios involve diverse object classes,\nparticularly classes of small objects, as in the case in ScanNet200.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:49:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tu","Tao",""],["Chuang","Shun-Po",""],["Liu","Yu-Lun",""],["Sun","Cheng",""],["Zhang","Ke",""],["Roy","Donna",""],["Kuo","Cheng-Hao",""],["Sun","Min",""]]}
{"id":"2308.09099","submitter":"Qiang Wu","authors":"Qiang Wu","title":"Thouless-Anderson-Palmer equations for the Multi-species\n  Sherrington-Kirkpatrick model","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the Thouless-Anderson-Palmer (TAP) equations for the local\nmagnetization in the multi-species Sherrington-Kirkpatrick (MSK) spin glass\nmodel. One of the key ingredients is based on concentration results established\nin~\\cite{arXiv:2012.13381}. The equations hold at high temperature for general\nMSK model without positive semi-definite assumption on the variance profile\nmatrix $\\mathbf{\\Delta}^2$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:49:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Qiang",""]]}
{"id":"2308.09100","submitter":"Aaron Pollack","authors":"Aaron Pollack","title":"Exceptional Siegel-Weil theorems for compact $\\mathrm{Spin}_8$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $E$ be a cubic \\'etale extension of the rational numbers which is totally\nreal, i.e., $E \\otimes \\mathbf{R} \\simeq \\mathbf{R} \\times \\mathbf{R} \\times\n\\mathbf{R}$. There is an algebraic $\\mathbf{Q}$-group $S_E$ defined in terms of\n$E$, which is semisimple simply-connected of type $D_4$ and for which\n$S_E(\\mathbf{R})$ is compact. We let $G_E$ denote a certain semisimple\nsimply-connected algebraic $\\mathbf{Q}$-group of type $D_4$, defined in terms\nof $E$, which is split over $\\mathbf{R}$. Then $G_E \\times S_E$ maps to\nquaternionic $E_8$. This latter group has an automorphic minimal\nrepresentation, which can be used to lift automorhpic forms on $S_E$ to\nautomorphic forms on $G_E$. We prove a Siegel-Weil theorem for this dual pair:\nI.e., we compute the lift of the trivial representation of $S_E$ to $G_E$,\nidentifying the automorphic form on $G_E$ with a certain degenerate Eisenstein\nseries.\n  Along the way, we prove a few more \"smaller\" Siegel-Weil theorems, for dual\npairs $M \\times S_E$ with $M \\subseteq G_E$. The main result of this paper is\nused in the companion paper \"Exceptional theta functions and arithmeticity of\nmodular forms on $G_2$\" to prove that the cuspidal quaternionic modular forms\non $G_2$ have an algebraic structure, defined in terms of Fourier coefficients.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:58:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pollack","Aaron",""]]}
{"id":"2308.09101","submitter":"Corey Shanbrom","authors":"Susan Jane Colley, Gary Kennedy, Corey Shanbrom","title":"The structural invariants of Goursat distributions","comments":"35 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This is the first of a pair of papers devoted to the local invariants of\nGoursat distributions. The study of these distributions naturally leads to a\ntower of spaces over an arbitrary surface, called the monster tower, and thence\nto connections with the topic of singularities of curves on surfaces. Here we\nstudy those invariants of Goursat distributions akin to those of curves on\nsurfaces, which we call structural invariants. In the subsequent paper we will\nrelate these structural invariants to the small-growth invariants.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:02:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Colley","Susan Jane",""],["Kennedy","Gary",""],["Shanbrom","Corey",""]]}
{"id":"2308.09102","submitter":"Luca Martino","authors":"E. Morgado, L. Martino, R. San Millan-Castillo","title":"Universal and Automatic Elbow Detection for Learning the Effective\n  Number of Components in Model Selection Problems","comments":null,"journal-ref":"Digital Signal Processing, Volume 140, 2023, 104103","doi":"10.1016/j.dsp.2023.104103","report-no":null,"categories":"cs.CE eess.SP stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We design a Universal Automatic Elbow Detector (UAED) for deciding the\neffective number of components in model selection problems. The relationship\nwith the information criteria widely employed in the literature is also\ndiscussed. The proposed UAED does not require the knowledge of a likelihood\nfunction and can be easily applied in diverse applications, such as regression\nand classification, feature and/or order selection, clustering, and dimension\nreduction. Several experiments involving synthetic and real data show the\nadvantages of the proposed scheme with benchmark techniques in the literature.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:02:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Morgado","E.",""],["Martino","L.",""],["Millan-Castillo","R. San",""]]}
{"id":"2308.09103","submitter":"Jiayu Fan","authors":"Jiayu Fan, Nikolce Murgovski, Jun Liang","title":"Efficient collision avoidance for autonomous vehicles in polygonal\n  domains","comments":"10 pages,2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research focuses on trajectory planning problems for autonomous vehicles\nutilizing numerical optimal control techniques. The study reformulates the\nconstrained optimization problem into a nonlinear programming problem,\nincorporating explicit collision avoidance constraints. We present three novel,\nexact formulations to describe collision constraints. The first formulation is\nderived from a proposition concerning the separation of a point and a convex\nset. We prove the separating proposition through De Morgan's laws. Then,\nleveraging the hyperplane separation theorem we propose two efficient\nreformulations. Compared with the existing dual formulations and the first\nformulation, they significantly reduce the number of auxiliary variables to be\noptimized and inequality constraints within the nonlinear programming problem.\nFinally, the efficacy of the proposed formulations is demonstrated in the\ncontext of typical autonomous parking scenarios compared with state of the art.\nFor generality, we design three initial guesses to assess the computational\neffort required for convergence to solutions when using the different collision\nformulations. The results illustrate that the scheme employing De Morgan's laws\nperforms equally well with those utilizing dual formulations, while the other\ntwo schemes based on hyperplane separation theorem exhibit the added benefit of\nrequiring lower computational resources.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:12:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fan","Jiayu",""],["Murgovski","Nikolce",""],["Liang","Jun",""]]}
{"id":"2308.09104","submitter":"Sanket Jantre","authors":"Sanket Jantre, Shrijita Bhattacharya, and Tapabrata Maiti","title":"A comprehensive study of spike and slab shrinkage priors for\n  structurally sparse Bayesian neural networks","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":"  Network complexity and computational efficiency have become increasingly\nsignificant aspects of deep learning. Sparse deep learning addresses these\nchallenges by recovering a sparse representation of the underlying target\nfunction by reducing heavily over-parameterized deep neural networks.\nSpecifically, deep neural architectures compressed via structured sparsity\n(e.g. node sparsity) provide low latency inference, higher data throughput, and\nreduced energy consumption. In this paper, we explore two well-established\nshrinkage techniques, Lasso and Horseshoe, for model compression in Bayesian\nneural networks. To this end, we propose structurally sparse Bayesian neural\nnetworks which systematically prune excessive nodes with (i) Spike-and-Slab\nGroup Lasso (SS-GL), and (ii) Spike-and-Slab Group Horseshoe (SS-GHS) priors,\nand develop computationally tractable variational inference including\ncontinuous relaxation of Bernoulli variables. We establish the contraction\nrates of the variational posterior of our proposed models as a function of the\nnetwork topology, layer-wise node cardinalities, and bounds on the network\nweights. We empirically demonstrate the competitive performance of our models\ncompared to the baseline models in prediction accuracy, model compression, and\ninference latency.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:14:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jantre","Sanket",""],["Bhattacharya","Shrijita",""],["Maiti","Tapabrata",""]]}
{"id":"2308.09105","submitter":"Shengcao Cao","authors":"Shengcao Cao, Mengtian Li, James Hays, Deva Ramanan, Yi-Xiong Wang,\n  Liang-Yan Gui","title":"Learning Lightweight Object Detectors via Multi-Teacher Progressive\n  Distillation","comments":"ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Resource-constrained perception systems such as edge computing and\nvision-for-robotics require vision models to be both accurate and lightweight\nin computation and memory usage. While knowledge distillation is a proven\nstrategy to enhance the performance of lightweight classification models, its\napplication to structured outputs like object detection and instance\nsegmentation remains a complicated task, due to the variability in outputs and\ncomplex internal network modules involved in the distillation process. In this\npaper, we propose a simple yet surprisingly effective sequential approach to\nknowledge distillation that progressively transfers the knowledge of a set of\nteacher detectors to a given lightweight student. To distill knowledge from a\nhighly accurate but complex teacher model, we construct a sequence of teachers\nto help the student gradually adapt. Our progressive strategy can be easily\ncombined with existing detection distillation mechanisms to consistently\nmaximize student performance in various settings. To the best of our knowledge,\nwe are the first to successfully distill knowledge from Transformer-based\nteacher detectors to convolution-based students, and unprecedentedly boost the\nperformance of ResNet-50 based RetinaNet from 36.5% to 42.0% AP and Mask R-CNN\nfrom 38.2% to 42.5% AP on the MS COCO benchmark.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:17:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cao","Shengcao",""],["Li","Mengtian",""],["Hays","James",""],["Ramanan","Deva",""],["Wang","Yi-Xiong",""],["Gui","Liang-Yan",""]]}
{"id":"2308.09106","submitter":"Satya Singh","authors":"Satya Vikram Pratap Singh, Siddharth Kamila, Prashanth Agnihotri","title":"Optimal Closed Loop Control of G2V/V2G Action Using Model Predictive\n  Controller","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 has developed a closed-loop control algorithm to operate the\nG2V/V2G action, tested under varying battery voltage conditions and load and\nsource power differences. Under V2G action, to maintain total harmonic\ndistortion under minimum level and grid frequency under the standard limit, a\nModel predictive controller (MPC) has been used to control the gate driver\ncircuit of the inverter. The state space model of the plant has been created\nusing the system identification toolbox, and the MPC Controller block has been\ndesigned using the Model Predictive Control Toolbox of MATLAB. The proposed\nmethodology is tested using MATLAB/Simulink and OPAL-RT (OP4510) in a real-time\nenvironment. This methodology reduces %THD to less than 0.5%, improves waveform\nquality of grid voltage, inverter output voltage, grid current, and inverter\noutput current to nearly 99%, and maintains the grid frequency in standard\nlimit while in G2V/V2G action.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:18:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Satya Vikram Pratap",""],["Kamila","Siddharth",""],["Agnihotri","Prashanth",""]]}
{"id":"2308.09107","submitter":"Shuangpeng Han","authors":"Shuangpeng Han, Rizhao Cai, Yawen Cui, Zitong Yu, Yongjian Hu, Alex\n  Kot","title":"Hyperbolic Face Anti-Spoofing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning generalized face anti-spoofing (FAS) models against presentation\nattacks is essential for the security of face recognition systems. Previous FAS\nmethods usually encourage models to extract discriminative features, of which\nthe distances within the same class (bonafide or attack) are pushed close while\nthose between bonafide and attack are pulled away. However, these methods are\ndesigned based on Euclidean distance, which lacks generalization ability for\nunseen attack detection due to poor hierarchy embedding ability. According to\nthe evidence that different spoofing attacks are intrinsically hierarchical, we\npropose to learn richer hierarchical and discriminative spoofing cues in\nhyperbolic space. Specifically, for unimodal FAS learning, the feature\nembeddings are projected into the Poincar\\'e ball, and then the hyperbolic\nbinary logistic regression layer is cascaded for classification. To further\nimprove generalization, we conduct hyperbolic contrastive learning for the\nbonafide only while relaxing the constraints on diverse spoofing attacks. To\nalleviate the vanishing gradient problem in hyperbolic space, a new feature\nclipping method is proposed to enhance the training stability of hyperbolic\nmodels. Besides, we further design a multimodal FAS framework with Euclidean\nmultimodal feature decomposition and hyperbolic multimodal feature fusion &\nclassification. Extensive experiments on three benchmark datasets (i.e., WMCA,\nPADISI-Face, and SiW-M) with diverse attack types demonstrate that the proposed\nmethod can bring significant improvement compared to the Euclidean baselines on\nunseen attack detection. In addition, the proposed framework is also\ngeneralized well on four benchmark datasets (i.e., MSU-MFSD, IDIAP\nREPLAY-ATTACK, CASIA-FASD, and OULU-NPU) with a limited number of attack types.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:18:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Han","Shuangpeng",""],["Cai","Rizhao",""],["Cui","Yawen",""],["Yu","Zitong",""],["Hu","Yongjian",""],["Kot","Alex",""]]}
{"id":"2308.09108","submitter":"Luca Martino","authors":"L. Martino, R. San Millan-Castillo, E. Morgado","title":"Spectral information criterion for automatic elbow detection","comments":null,"journal-ref":"Expert Systems with Applications, Volume 231, 30 November 2023,\n  120705","doi":"10.1016/j.eswa.2023.120705","report-no":null,"categories":"stat.ME cs.AI eess.SP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a generalized information criterion that contains other\nwell-known information criteria, such as Bayesian information Criterion (BIC)\nand Akaike information criterion (AIC), as special cases. Furthermore, the\nproposed spectral information criterion (SIC) is also more general than the\nother information criteria, e.g., since the knowledge of a likelihood function\nis not strictly required. SIC extracts geometric features of the error curve\nand, as a consequence, it can be considered an automatic elbow detector. SIC\nprovides a subset of all possible models, with a cardinality that often is much\nsmaller than the total number of possible models. The elements of this subset\nare elbows of the error curve. A practical rule for selecting a unique model\nwithin the sets of elbows is suggested as well. Theoretical invariance\nproperties of SIC are analyzed. Moreover, we test SIC in ideal scenarios where\nprovides always the optimal expected results. We also test SIC in several\nnumerical experiments: some involving synthetic data, and two experiments\ninvolving real datasets. They are all real-world applications such as\nclustering, variable selection, or polynomial order selection, to name a few.\nThe results show the benefits of the proposed scheme. Matlab code related to\nthe experiments is also provided. Possible future research lines are finally\ndiscussed.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:18:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Martino","L.",""],["Millan-Castillo","R. San",""],["Morgado","E.",""]]}
{"id":"2308.09109","submitter":"Manuel Rudolph","authors":"Manuel S. Rudolph, Enrico Fontana, Zo\\\"e Holmes, Lukasz Cincio","title":"Classical surrogate simulation of quantum systems with LOWESA","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29362","categories":"quant-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce LOWESA as a classical algorithm for faithfully simulating\nquantum systems via a classically constructed surrogate expectation landscape.\nAfter an initial overhead to build the surrogate landscape, one can rapidly\nstudy entire families of Hamiltonians, initial states and target observables.\nAs a case study, we simulate the 127-qubit transverse-field Ising quantum\nsystem on a heavy-hexagon lattice with up to 20 Trotter steps which was\nrecently presented in Nature 618, 500-505 (2023). Specifically, we\napproximately reconstruct (in minutes to hours on a laptop) the entire\nexpectation landscape spanned by the heavy-hex Ising model. The expectation of\na given observable can then be evaluated at different parameter values, i.e.\nwith different onsite magnetic fields and coupling strengths, in fractions of a\nsecond on a laptop. This highlights that LOWESA can attain state-of-the-art\nperformance in quantum simulation tasks, with the potential to become the\nalgorithm of choice for scanning a wide range of systems quickly.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:32:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rudolph","Manuel S.",""],["Fontana","Enrico",""],["Holmes","Zo\u00eb",""],["Cincio","Lukasz",""]]}
{"id":"2308.09110","submitter":"Mingyu Ouyang","authors":"Mingyu Ouyang, Zhenzhong Chen","title":"JPEG Quantized Coefficient Recovery via DCT Domain Spatial-Frequential\n  Transformer","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JPEG compression adopts the quantization of Discrete Cosine Transform (DCT)\ncoefficients for effective bit-rate reduction, whilst the quantization could\nlead to a significant loss of important image details. Recovering compressed\nJPEG images in the frequency domain has attracted more and more attention\nrecently, in addition to numerous restoration approaches developed in the pixel\ndomain. However, the current DCT domain methods typically suffer from limited\neffectiveness in handling a wide range of compression quality factors, or fall\nshort in recovering sparse quantized coefficients and the components across\ndifferent colorspace. To address these challenges, we propose a DCT domain\nspatial-frequential Transformer, named as DCTransformer. Specifically, a\ndual-branch architecture is designed to capture both spatial and frequential\ncorrelations within the collocated DCT coefficients. Moreover, we incorporate\nthe operation of quantization matrix embedding, which effectively allows our\nsingle model to handle a wide range of quality factors, and a\nluminance-chrominance alignment head that produces a unified feature map to\nalign different-sized luminance and chrominance components. Our proposed\nDCTransformer outperforms the current state-of-the-art JPEG artifact removal\ntechniques, as demonstrated by our extensive experiments.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:32:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ouyang","Mingyu",""],["Chen","Zhenzhong",""]]}
{"id":"2308.09111","submitter":"Mohammed Ibrahime Abdelkayoum Ghitri Mohammed  I.  A. Ghitri","authors":"M.I.A. Ghitri, A. Hantoute","title":"A non-convex relaxed version of minimax theorems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a subset $A\\times B$ of a locally convex space $X\\times Y$ (with $A$\ncompact) and a function $f:A\\times B\\rightarrow\\overline{\\mathbb{R}}$ such that\n$f(\\cdot,y),$ $y\\in B,$ are concave and upper semicontinuous, the minimax\ninequality $\\max_{x\\in A} \\inf_{y\\in B} f(x,y) \\geq \\inf_{y\\in B} \\sup_{x\\in\nA_{0}} f(x,y)$ is shown to hold provided that $A_{0}$ be the set of $x\\in A$\nsuch that $f(x,\\cdot)$ is proper, convex and lower semi-contiuous. Moreover, if\nin addition $A\\times B\\subset f^{-1}(\\mathbb{R})$, then we can take as $A_{0}$\nthe set of $x\\in A$ such that $f(x,\\cdot)$ is convex. The relation to Moreau's\nbiconjugate representation theorem is discussed, and some applications to\\\nconvex duality are provided.\n  Key words. Minimax theorem, Moreau theorem, conjugate function, convex\noptimization.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:38:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ghitri","M. I. A.",""],["Hantoute","A.",""]]}
{"id":"2308.09112","submitter":"Luben Miguel Cruz Cabezas","authors":"Rafael Izbicki, Luben M. C. Cabezas, Fernando A. B. Colugnatti,\n  Rodrigo F. L. Lassance, Altay A. L. de Souza, Rafael B. Stern","title":"Rethinking Hypothesis Tests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Null Hypothesis Significance Testing (NHST) have been a popular statistical\ntool across various scientific disciplines since the 1920s. However, the\nexclusive reliance on a p-value threshold of 0.05 has recently come under\ncriticism; in particular, it is argued to have contributed significantly to the\nreproducibility crisis. We revisit some of the main issues associated with NHST\nand propose an alternative approach that is easy to implement and can address\nthese concerns. Our proposed approach builds on equivalence tests and three-way\ndecision procedures, which offer several advantages over the traditional NHST.\nWe demonstrate the efficacy of our approach on real-world examples and show\nthat it has many desirable properties.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:43:21 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 11:45:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Izbicki","Rafael",""],["Cabezas","Luben M. C.",""],["Colugnatti","Fernando A. B.",""],["Lassance","Rodrigo F. L.",""],["de Souza","Altay A. L.",""],["Stern","Rafael B.",""]]}
{"id":"2308.09113","submitter":"Hewei Tang Dr.","authors":"Hewei Tang, Qingkai Kong and Joseph P. Morris","title":"Multi-fidelity Fourier Neural Operator for Fast Modeling of Large-Scale\n  Geological Carbon Storage","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":"  Deep learning-based surrogate models have been widely applied in geological\ncarbon storage (GCS) problems to accelerate the prediction of reservoir\npressure and CO2 plume migration. Large amounts of data from physics-based\nnumerical simulators are required to train a model to accurately predict the\ncomplex physical behaviors associated with this process. In practice, the\navailable training data are always limited in large-scale 3D problems due to\nthe high computational cost. Therefore, we propose to use a multi-fidelity\nFourier Neural Operator to solve large-scale GCS problems with more affordable\nmulti-fidelity training datasets. The Fourier Neural Operator has a desirable\ngrid-invariant property, which simplifies the transfer learning procedure\nbetween datasets with different discretization. We first test the model\nefficacy on a GCS reservoir model being discretized into 110k grid cells. The\nmulti-fidelity model can predict with accuracy comparable to a high-fidelity\nmodel trained with the same amount of high-fidelity data with 81% less data\ngeneration costs. We further test the generalizability of the multi-fidelity\nmodel on a same reservoir model with a finer discretization of 1 million grid\ncells. This case was made more challenging by employing high-fidelity and\nlow-fidelity datasets generated by different geostatistical models and\nreservoir simulators. We observe that the multi-fidelity FNO model can predict\npressure fields with reasonable accuracy even when the high-fidelity data are\nextremely limited.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:44:59 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 20:16:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tang","Hewei",""],["Kong","Qingkai",""],["Morris","Joseph P.",""]]}
{"id":"2308.09114","submitter":"Omar Valdivia O. Valdivia","authors":"Luis Avil\\'es, Diego Hidalgo and Omar Valdivia","title":"Thermodynamics of the three-dimensional black hole with torsion","comments":"19 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The stationary black hole solution of a Chern-Simons model based on the\nsemi-simple extension of the Poincar\\'e gauge group is studied. The solution\nresembles the metric properties of the BTZ geometry but contains, in addition,\nnon-vanishing torsion. The global structure of spacetime is characterized by\nthree conserved charges: two associated with the mass and angular momentum and\none extra constant triggered by spacetime torsion. Consequently, we show that\nthe entropy deviates from the standard Bekenstein-Hawking value and discuss the\nimplications of torsional charges in the context of black hole thermodynamics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:45:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Avil\u00e9s","Luis",""],["Hidalgo","Diego",""],["Valdivia","Omar",""]]}
{"id":"2308.09115","submitter":"N M Anoop Krishnan","authors":"Mohd Zaki, Jayadeva, Mausam, N. M. Anoop Krishnan","title":"MaScQA: A Question Answering Dataset for Investigating Materials Science\n  Knowledge of Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Information extraction and textual comprehension from materials literature\nare vital for developing an exhaustive knowledge base that enables accelerated\nmaterials discovery. Language models have demonstrated their capability to\nanswer domain-specific questions and retrieve information from knowledge bases.\nHowever, there are no benchmark datasets in the materials domain that can\nevaluate the understanding of the key concepts by these language models. In\nthis work, we curate a dataset of 650 challenging questions from the materials\ndomain that require the knowledge and skills of a materials student who has\ncleared their undergraduate degree. We classify these questions based on their\nstructure and the materials science domain-based subcategories. Further, we\nevaluate the performance of GPT-3.5 and GPT-4 models on solving these questions\nvia zero-shot and chain of thought prompting. It is observed that GPT-4 gives\nthe best performance (~62% accuracy) as compared to GPT-3.5. Interestingly, in\ncontrast to the general observation, no significant improvement in accuracy is\nobserved with the chain of thought prompting. To evaluate the limitations, we\nperformed an error analysis, which revealed conceptual errors (~64%) as the\nmajor contributor compared to computational errors (~36%) towards the reduced\nperformance of LLMs. We hope that the dataset and analysis performed in this\nwork will promote further research in developing better materials science\ndomain-specific LLMs and strategies for information extraction.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:51:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zaki","Mohd",""],["Jayadeva","",""],["Mausam","",""],["Krishnan","N. M. Anoop",""]]}
{"id":"2308.09116","submitter":"Dmitry Kobyakov","authors":"Dmitry Kobyakov","title":"Unified description of superconductivity in neutron stars","comments":"15 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, I study the location and symmetry of superconducting protons.\nSolving the Tolman-Oppenheimer-Volkoff (TOV) equations based on the unified\nBarcelona-Catania-Paris-Madrid equation of state (BCPM EoS) and on the pairing\ngap calculations by Lim and Holt [1], I find that roughly 500 meters of the\nliquid core (with isotropic and continuous symmetry) and roughly 100-150 meters\nof the core-crust interface (with anisotropic symmetry) are superconducting,\nwhile the rest of the star is normal. To specify whether the superconducting\nsymmetry is discreet in the pasta phase, I study the coexistence of the\nsaturated nuclear and the pure neutron matter using EoS based on the chiral\neffective field theory (ChEFT). I find that the maximum pressure at coexistence\nis $P_{*}\\simeq0.5\\;{\\rm MeV\\,fm^{-3}}$. To verify the precision of the\ncoexistence calculations I evaluate the surface and the Coulomb corrections\nusing the compressible liquid drop model. I calculate the proton tunneling rate\nin the perfectly ordered slab region of the pasta phase and conclude that for\nthe chosen EoS, the proton supercurrent tunneling between the adjacent slabs is\nnegligible and the slab region should be described as a discreet symmetry\nsystem of quasi two-dimensional layers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:53:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kobyakov","Dmitry",""]]}
{"id":"2308.09117","submitter":"Jasmin Mohn","authors":"Jasmin Mohn and Brian E. Raines","title":"Distributional Chaos in the Baire Space","comments":null,"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 consider the question of distributional chaos on non-compact\nmetric dynamical systems. We focus on a shift space over a countable alphabet,\nthe Baire Space. We prove that on the Baire Space subshifts of finite type\nexhibit dense distributional chaos and subshifts of bounded type that are\nperfect and have a dense set of periodic points also have distributional chaos.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:55:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mohn","Jasmin",""],["Raines","Brian E.",""]]}
{"id":"2308.09118","submitter":"Annina Lieberherr","authors":"Annina Z. Lieberherr, Paola Gori-Giorgi and Klaas J. H. Giesbertz","title":"Optimal transport distances to characterise electronic excitations","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the character of electronic excitations is important in\ncomputational and mechanistic studies, but their classification from numerical\nsimulations remains an open problem despite significant progress in\ndensity-based and exciton wavefunction-based descriptors. We propose and\ninvestigate a new diagnostic based on the Sinkhorn divergence from optimal\ntransport, which is highly sensitive to translations and hence promising for\nthe identification of charge transfer excitations. In spite of this, we show\nthrough numerical simulations on a representative set of molecules that the new\ndiagnostic is not able to separate charge transfer from Rydberg excitations in\npractice, which can be explained by its inability to distinguish between\ntranslational and diffusive processes. We trained a $k$-NN classification\nalgorithm on the optimal transport diagonistic, the popular $\\Lambda$\ndiagnostic as well as their combination, and assessed its performance in\nlabelling excitations, finding that (i) The combination improves the\nclassification, (ii) Rydberg excitations are not separated well in any setting,\nsuggesting that key information on the diffusivity of the excited state is\nmissing and (iii) the optimal transport diagnostic breaks down for charge\ntransfer in small molecules.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:55:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lieberherr","Annina Z.",""],["Gori-Giorgi","Paola",""],["Giesbertz","Klaas J. H.",""]]}
{"id":"2308.09119","submitter":"Xijun Wang","authors":"Xijun Wang, Anqi Liang, Junbang Liang, Ming Lin, Yu Lou, Shan Yang","title":"ICAR: Image-based Complementary Auto Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Scene-aware Complementary Item Retrieval (CIR) is a challenging task which\nrequires to generate a set of compatible items across domains. Due to the\nsubjectivity, it is difficult to set up a rigorous standard for both data\ncollection and learning objectives. To address this challenging task, we\npropose a visual compatibility concept, composed of similarity (resembling in\ncolor, geometry, texture, and etc.) and complementarity (different items like\ntable vs chair completing a group). Based on this notion, we propose a\ncompatibility learning framework, a category-aware Flexible Bidirectional\nTransformer (FBT), for visual \"scene-based set compatibility reasoning\" with\nthe cross-domain visual similarity input and auto-regressive complementary item\ngeneration. We introduce a \"Flexible Bidirectional Transformer (FBT)\"\nconsisting of an encoder with flexible masking, a category prediction arm, and\nan auto-regressive visual embedding prediction arm. And the inputs for FBT are\ncross-domain visual similarity invariant embeddings, making this framework\nquite generalizable. Furthermore, our proposed FBT model learns the\ninter-object compatibility from a large set of scene images in a\nself-supervised way. Compared with the SOTA methods, this approach achieves up\nto 5.3% and 9.6% in FITB score and 22.3% and 31.8% SFID improvement on fashion\nand furniture, respectively.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:55:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Xijun",""],["Liang","Anqi",""],["Liang","Junbang",""],["Lin","Ming",""],["Lou","Yu",""],["Yang","Shan",""]]}
{"id":"2308.09120","submitter":"Victor Goncalves","authors":"Celsina N. Azevedo, Victor P. Goncalves, Bruno D. Moreira","title":"Associated vector meson and bound-free electron-positron pair\n  photoproduction in ultraperipheral $PbPb$ collisions","comments":"5 pages, 2 figures, 1 table. arXiv admin note: substantial text\n  overlap with arXiv:2306.05519","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this letter we analyze the associated production of a vector meson with\nthe bound - free $e^+e^-$ process in ultraperipheral $PbPb$ collisions through\nthe double scattering mechanism for the energy of the Large Hadron Collider\n(LHC). Such process is characterized by the presence of a meson and a positron\nin the final state and by a forward hydrogen - like ion with a distinct\nelectric charge. We present our predictions for the total cross sections and\nrapidity distributions considering the rapidity ranges covered by the ALICE and\nLHCb detectors, which indicate that a future experimental analysis of the $\\phi\n+ e^+$ and $J/\\Psi + e^+$ final states is feasible.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:56:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Azevedo","Celsina N.",""],["Goncalves","Victor P.",""],["Moreira","Bruno D.",""]]}
{"id":"2308.09121","submitter":"Fritz Laux","authors":"Tim Lessner, Fritz Laux and Thomas M Connolly","title":"O$|$R$|$P$|$E -- A Data Semantics Driven Concurrency Control","comments":"20 pages, 7 tables, 15 figures","journal-ref":"International Journal On Advances in Software, volume 9, numbers 1\n  and 2, 2016","doi":null,"report-no":"ISSN: 1942-2628","categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a concurrency control mechanism that does not follow a\n'one concurrency control mechanism fits all needs' strategy. With the presented\nmechanism a transaction runs under several concurrency control mechanisms and\nthe appropriate one is chosen based on the accessed data. For this purpose, the\ndata is divided into four classes based on its access type and usage\n(semantics). Class $O$ (the optimistic class) implements a first-committer-wins\nstrategy, class $R$ (the reconciliation class) implements a\nfirst-n-committers-win strategy, class $P$ (the pessimistic class) implements a\nfirst-reader-wins strategy, and class $E$ (the escrow class) implements a\nfirst-n-readers-win strategy. Accordingly, the model is called \\PeFS. The\nselected concurrency control mechanism may be automatically adapted at run-time\naccording to the current load or a known usage profile. This run-time\nadaptation allows \\Pe to balance the commit rate and the response time even\nunder changing conditions. \\Pe outperforms the Snapshot Isolation concurrency\ncontrol in terms of response time by a factor of approximately 4.5 under heavy\ntransactional load (4000 concurrent transactions). As consequence, the degree\nof concurrency is 3.2 times higher.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:56:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lessner","Tim",""],["Laux","Fritz",""],["Connolly","Thomas M",""]]}
{"id":"2308.09122","submitter":"Seong Jin Lee","authors":"Seong Jin Lee, Bumsik Kim","title":"RTB Formulation Using Point Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.GT cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a general stochastic framework for modelling repeated auctions in\nthe Real Time Bidding (RTB) ecosystem using point processes. The flexibility of\nthe framework allows a variety of auction scenarios including configuration of\ninformation provided to player, determination of auction winner and\nquantification of utility gained from each auctions. We propose theoretical\nresults on how this formulation of process can be approximated to a Poisson\npoint process, which enables the analyzer to take advantage of well-established\nproperties. Under this framework, we specify the player's optimal strategy\nunder various scenarios. We also emphasize that it is critical to consider the\njoint distribution of utility and market condition instead of estimating the\nmarginal distributions independently.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:57:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lee","Seong Jin",""],["Kim","Bumsik",""]]}
{"id":"2308.09123","submitter":"Pooja Siwach","authors":"Pooja Siwach, Kaytlin Harrison, A. Baha Balantekin","title":"Collective neutrino oscillations on a quantum computer with hybrid\n  quantum-classical algorithm","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"LLNL-JRNL-853275-DRAFT","categories":"quant-ph hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We simulate the time evolution of collective neutrino oscillations in\ntwo-flavor settings on a quantum computer. We explore the generalization of\nTrotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The\ntrotterization steps are further optimized using the Cartan decomposition of\ntwo-qubit unitary gates U $\\in$ SU (4) in the minimum number of controlled-NOT\n(CNOT) gates making the algorithm more resilient to the hardware noise. A more\nefficient hybrid quantum-classical algorithm is also explored to solve the\nproblem on noisy intermediate-scale quantum (NISQ) devices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:59:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Siwach","Pooja",""],["Harrison","Kaytlin",""],["Balantekin","A. Baha",""]]}
{"id":"2308.09124","submitter":"Arnab Sen Sharma","authors":"Evan Hernandez, Arnab Sen Sharma, Tal Haklay, Kevin Meng, Martin\n  Wattenberg, Jacob Andreas, Yonatan Belinkov, David Bau","title":"Linearity of Relation Decoding in Transformer 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":"  Much of the knowledge encoded in transformer language models (LMs) may be\nexpressed in terms of relations: relations between words and their synonyms,\nentities and their attributes, etc. We show that, for a subset of relations,\nthis computation is well-approximated by a single linear transformation on the\nsubject representation. Linear relation representations may be obtained by\nconstructing a first-order approximation to the LM from a single prompt, and\nthey exist for a variety of factual, commonsense, and linguistic relations.\nHowever, we also identify many cases in which LM predictions capture relational\nknowledge accurately, but this knowledge is not linearly encoded in their\nrepresentations. Our results thus reveal a simple, interpretable, but\nheterogeneously deployed knowledge representation strategy in transformer LMs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:59:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hernandez","Evan",""],["Sharma","Arnab Sen",""],["Haklay","Tal",""],["Meng","Kevin",""],["Wattenberg","Martin",""],["Andreas","Jacob",""],["Belinkov","Yonatan",""],["Bau","David",""]]}
{"id":"2308.09125","submitter":"Waqas Ahmed","authors":"Waqas Ahmed, Mansoor Ur Rehman and Umer Zubair","title":"Probing Stochastic Gravitational Wave Background from $SU(5) \\times\n  U(1)_{\\chi}$ Strings in Light of NANOGrav 15-Year Data","comments":"22 pages and5 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph gr-qc hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A realistic model of $SU(5) \\times U(1)_{\\chi}$, embedded in $SO(10)$\nsupersymmetric grand unified theory, is investigated for the emergence of a\nmetastable cosmic string network. This network eventually decays via the\nSchwinger production of monopole-antimonopole pairs, subsequently generating a\nstochastic gravitational wave background that is compatible with the NANOGrav\n15-year data. In order to avoid the monopole problem in the breaking of both\n$SO(10)$ and $SU(5)$, a non-minimal Higgs inflation scenario is incorporated.\nThe radiative breaking of the $U(1)_{\\chi}$ symmetry at a slightly lower scale\nplays a pivotal role in aligning the string tension parameter with the\nobservable range. The resultant gravitational wave spectrum not only accounts\nfor the signal observed in the most recent pulsar timing array (PTA)\nexperiments but is also accessible to both current and future ground-based and\nspace-based experiments.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:59:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ahmed","Waqas",""],["Rehman","Mansoor Ur",""],["Zubair","Umer",""]]}
{"id":"2308.09126","submitter":"Karttikeya Mangalam","authors":"Karttikeya Mangalam, Raiymbek Akshulakov, Jitendra Malik","title":"EgoSchema: A Diagnostic Benchmark for Very Long-form Video Language\n  Understanding","comments":"https://egoschema.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce EgoSchema, a very long-form video question-answering dataset,\nand benchmark to evaluate long video understanding capabilities of modern\nvision and language systems. Derived from Ego4D, EgoSchema consists of over\n5000 human curated multiple choice question answer pairs, spanning over 250\nhours of real video data, covering a very broad range of natural human activity\nand behavior. For each question, EgoSchema requires the correct answer to be\nselected between five given options based on a three-minute-long video clip.\nWhile some prior works have proposed video datasets with long clip lengths, we\nposit that merely the length of the video clip does not truly capture the\ntemporal difficulty of the video task that is being considered. To remedy this,\nwe introduce temporal certificate sets, a general notion for capturing the\nintrinsic temporal understanding length associated with a broad range of video\nunderstanding tasks & datasets. Based on this metric, we find EgoSchema to have\nintrinsic temporal lengths over 5.7x longer than the second closest dataset and\n10x to 100x longer than any other video understanding dataset. Further, our\nevaluation of several current state-of-the-art video and language models shows\nthem to be severely lacking in long-term video understanding capabilities. Even\nmodels with several billions of parameters achieve QA accuracy less than 33%\n(random is 20%) on the EgoSchema multi-choice question answering task, while\nhumans achieve about 76% accuracy. We posit that \\name{}{}, with its long\nintrinsic temporal structures and diverse complexity, would serve as a valuable\nevaluation probe for developing effective long-term video understanding systems\nin the future. Data and Zero-shot model evaluation code are open-sourced for\nboth public and commercial use under the Ego4D license at\nhttp://egoschema.github.io\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 17:59:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mangalam","Karttikeya",""],["Akshulakov","Raiymbek",""],["Malik","Jitendra",""]]}
{"id":"2308.09127","submitter":"Zhoudunming Tu","authors":"Zhoudunming Tu","title":"Deep Exclusive Meson Production as a probe to the puzzle of $\\Lambda$\n  hyperon polarization","comments":"Manuscript has 5 pages with 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the 1970s, an unexpected transverse $\\Lambda$ polarization in unpolarized\nproton-Beryllium collisions was discovered, which initiated extensive studies\non spin phenomena in high-energy physics. Over the past five decades, similar\ntransverse $\\Lambda$ polarization has been observed across various collision\nsystems, including lepton-hadron deep inelastic scattering, hadron-hadron\ncollisions, and electron-positron collisions. Despite numerous promising\ntheoretical models, the fundamental mechanism underlying this polarization\nphenomenon remains inconclusive to this day. However, in both longitudinally\nand transversely polarized lepton-hadron and hadron-hadron collisions, it is\nfound that the $\\Lambda$ hyperon is not polarized with respect to the initial\nparton spin direction. How the $\\Lambda$ hyperon acquires its spin has become\none of the most crucial questions to address in order to resolve this puzzle.\nIn this Letter, I propose to use an exclusive process that can be measured at\nthe Electron-Ion Collider, the Deep Exclusive Meson Production, to explicitly\ntest the mechanism of $\\Lambda$ polarization. The outcomes of this experimental\nmeasurement are anticipated to unveil the dominant mechanism by which $\\Lambda$\nobtains its spin, eliminating many of the ambiguities that have been\nencountered in previous studies. Finally, experimental challenges and\nrequirements will be discussed.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tu","Zhoudunming",""]]}
{"id":"2308.09128","submitter":"Jacob Linder","authors":"Eirik Holm Fyhn, Hendrik Bentmann, Jacob Linder","title":"Barrier and finite size effects on the extension of topological\n  surface-states into magnetic insulators","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interplay between magnetic and topological order can give rise to\nphenomena such as the quantum anomalous Hall effect. The extension of\ntopological surface states into magnetic insulators (MIs) has been proposed as\nan alternative to using intrinsically magnetic topological insulators (TIs).\nHere, we theoretically study how this extension of surface states into a\nmagnetic insulator are influenced both by the interface barrier potential\nseparating a topological insulator and a magnetic insulator and by finite size\neffects in such structures. We find that the the gap in the surface states\ndepends non-monotonically on the barrier strength. A small, but finite, barrier\npotential turns out to be advantageous as it permits the surface states to\npenetrate even further into the MI. Moreover, we find that due to finite size\neffects in thin samples, increasing the spin-splitting in the MI can actually\ndecrease the gap of the surface states, in contrast to the usual expectation\nthat the gap opens as the spin-splitting increases.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fyhn","Eirik Holm",""],["Bentmann","Hendrik",""],["Linder","Jacob",""]]}
{"id":"2308.09129","submitter":"Yihan Wang","authors":"Yihan Wang, Zhaohuan Zhu and Douglas N. C. Lin","title":"Stellar/BH Population in AGN Disks: Direct Binary Formation from Capture\n  Objects in Nuclei Clusters","comments":"Comments are welcome","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":"  The Active Galatic Nuclei(AGN) disk has been proposed as a potential channel\nfor the merger of binary black holes. The population of massive stars and black\nholes in AGN disks captured from the nuclei cluster plays a crucial role in\ndetermining the efficiency of binary formation and final merger rate within the\nAGN disks. In this paper, we investigate the capture process using analytical\nand numerical approaches. We discover a new constant integral of motion for one\nobject's capture process. {Applying this result to the whole population of the\nnuclei cluster captured by the AGN disk, we find that the population of\ncaptured objects} depends on the angular density and eccentricity distribution\nof the nuclei clusters and is effectively independent of the radial density\nprofile of the nuclei cluster and disk models. An isotropic nuclei cluster with\nthermal eccentricity distribution predicts a captured profile $\\dd N/\\dd\nr\\propto r^{-1/4}$. The captured objects are found to be dynamically crowded\nwithin the disk. Direct binary formation right after the capture would be\npromising, especially for stars. The conventional migration traps that help\npile up single objects in AGN disks for black hole mergers might not be\nrequired.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yihan",""],["Zhu","Zhaohuan",""],["Lin","Douglas N. C.",""]]}
{"id":"2308.09130","submitter":"Peyman Parsa","authors":"Peyman Parsa, Prasoon Kumar Shandilya, David P. Lake, Matthew E.\n  Mitchell, and Paul E. Barclay","title":"Feedback Enhanced Phonon Lasing of a Microwave Frequency Resonator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The amplitude of self-oscillating mechanical resonators in cavity\noptomechanical systems is typically limited by nonlinearities arising from the\ncavity's finite optical bandwidth. We propose and demonstrate a feedback\ntechnique for increasing this limit. By modulating the cavity input field with\na signal derived from its output intensity, we increase the amplitude of a\nself-oscillating GHz frequency mechanical resonator by $22\\%$ (increase in\ncoherent phonon number of $50\\%$) limited only by the achievable optomechanical\ncooperativity of the system. This technique will advance applications dependent\non high dynamic mechanical stress, such as coherent spin-phonon coupling, as\nwell as implementations of sensors based on self-oscillating resonators.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Parsa","Peyman",""],["Shandilya","Prasoon Kumar",""],["Lake","David P.",""],["Mitchell","Matthew E.",""],["Barclay","Paul E.",""]]}
{"id":"2308.09131","submitter":"Fabio M. Mele","authors":"Philipp A. Hoehn, Isha Kotecha, Fabio M. Mele","title":"Quantum Frame Relativity of Subsystems, Correlations and Thermodynamics","comments":"49 pages + appendices, 12 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It was recently noted that different internal quantum reference frames (QRFs)\npartition a system in different ways into subsystems, much like different\ninertial observers in special relativity decompose spacetime in different ways\ninto space and time. Here we expand on this QRF relativity of subsystems and\nelucidate that it is the source of all novel QRF dependent effects, just like\nthe relativity of simultaneity is the origin of all characteristic special\nrelativistic phenomena. We show that subsystem relativity, in fact, also arises\nin special relativity with internal frames and, by implying the relativity of\nsimultaneity, constitutes a generalisation of it. Physical consequences of the\nQRF relativity of subsystems, which we explore here systematically, and the\nrelativity of simultaneity may thus be seen in similar light. We focus on\ninvestigating when and how subsystem correlations and entropies, interactions\nand types of dynamics (open vs. closed), as well as quantum thermodynamical\nprocesses change under QRF transformations. We show that thermal equilibrium is\ngenerically QRF relative and find that, remarkably, $\\textit{QRF\ntransformations not only can change a subsystem temperature, but even map\npositive into negative temperature states}$. We further examine how\nnon-equilibrium notions of heat and work exchange, as well as entropy\nproduction and flow depend on the QRF. Along the way, we develop the first\nstudy of how reduced subsystem states transform under QRF changes. Focusing on\nphysical insights, we restrict to ideal QRFs associated with finite abelian\ngroups. Besides being conducive to rigour, the ensuing finite-dimensional\nsetting is where quantum information-theoretic quantities and quantum\nthermodynamics are best developed. We anticipate, however, that our results\nextend qualitatively to more general groups and frames, and even to subsystems\nin gauge theory and gravity.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hoehn","Philipp A.",""],["Kotecha","Isha",""],["Mele","Fabio M.",""]]}
{"id":"2308.09132","submitter":"Andrei Igoshev Petrovich","authors":"Andrei P. Igoshev, Rainer Hollerbach and Toby Wood","title":"Three-dimensional magneto-thermal evolution of off-centred dipole\n  magnetic field configurations in neutron stars","comments":"23 pages, accepted to MNRAS on 3 August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Off-centred dipole configurations have been suggested to explain different\nphenomena in neutron stars, such as natal kicks, irregularities in polarisation\nof radio pulsars and properties of X-ray emission from millisecond pulsars.\nHere for the first time we model magneto-thermal evolution of neutron stars\nwith crust-confined magnetic fields and off-centred dipole moments. We find\nthat the dipole shift decays with time if the initial configuration has no\ntoroidal magnetic field. The decay timescale is inversely proportional to\nmagnetic field. The octupole moment decreases much faster than the quadrupole.\nAlternatively, if the initial condition includes strong dipolar toroidal\nmagnetic field, the external poloidal magnetic field evolves from centred\ndipole to off-centred dipole. The surface thermal maps are very different for\nconfigurations with weak $B = 10^{13}$ G and strong $B = 10^{14}$ G magnetic\nfields. In the former case, the magnetic equator is cold while in the latter\ncase it is hot. We model lightcurves and spectra of our magneto-thermal\nconfigurations. We found that in the case of cold equator, the pulsed fraction\nis small (below a few percent in most cases) and spectra are well described\nwith a single blackbody. Under the same conditions models with stronger\nmagnetic fields produce lightcurves with pulsed fraction of tens of percent.\nTheir spectra are significantly better described with two blackbodies. Overall,\nthe magnetic field strength has a more significant effect on bulk thermal\nemission of neutron stars than does the field geometry.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Igoshev","Andrei P.",""],["Hollerbach","Rainer",""],["Wood","Toby",""]]}
{"id":"2308.09133","submitter":"Bo Xing","authors":"Bo Xing, Xhek Turkeshi, Marco Schir\\'o, Rosario Fazio, Dario Poletti","title":"Interactions and integrability in weakly monitored Hamiltonian systems","comments":"4 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":"  Interspersing unitary dynamics with local measurements results in\nmeasurement-induced phases and transitions in many-body quantum systems. When\nthe evolution is driven by a local Hamiltonian, two types of transitions have\nbeen observed, characterized by an abrupt change in the system size scaling of\nentanglement entropy. The critical point separates the strongly monitored\narea-law phase from a volume law or a sub-extensive, typically logarithmic-like\none at low measurement rates. Identifying the key ingredients responsible for\nthe entanglement scaling in the weakly monitored phase is the key purpose of\nthis work. For this purpose, we consider prototypical one-dimensional spin\nchains with local monitoring featuring the presence/absence of U(1) symmetry,\nintegrability, and interactions. Using exact numerical methods, the system\nsizes studied reveal that the presence of interaction is always correlated to a\nvolume-law weakly monitored phase. In contrast, non-interacting systems present\nsub-extensive scaling of entanglement. Other characteristics, namely\nintegrability or U(1) symmetry, do not play a role in the character of the\nentanglement phase.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:00:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xing","Bo",""],["Turkeshi","Xhek",""],["Schir\u00f3","Marco",""],["Fazio","Rosario",""],["Poletti","Dario",""]]}
{"id":"2308.09134","submitter":"Joel Cox","authors":"Mikkel Have Eriksen, Christos Tserkezis, N. Asger Mortensen, Joel D.\n  Cox","title":"Nonlocal effects in atom-plasmon interactions","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nonlocal and quantum mechanical phenomena in noble metal nanostructures\nbecome increasingly crucial when the relevant length scales in hybrid\nnanostructures reach the few-nanometer regime. In practice, such mesoscopic\neffects at metal-dielectric interfaces can be described using exemplary\nsurface-response functions (SRFs) embodied by the Feibelman $d$-parameters.\nHere we show that SRFs dramatically influence quantum electrodynamic phenomena\n-- such as the Purcell enhancement and Lamb shift -- for quantum emitters close\nto a diverse range of noble metal nanostructures interfacing different\nhomogeneous media. Dielectric environments with higher permittivities are shown\nto increase the magnitude of SRFs calculated within the specular-reflection\nmodel. In parallel, the role of SRFs is enhanced in nanostructures\ncharacterized by large surface-to-volume ratios, such as thin planar metallic\nfilms or shells of core-shell nanoparticles. By investigating emitter quantum\ndynamics close to such plasmonic architectures, we show that decreasing the\nwidth of the metal region, or increasing the permittivity of the interfacing\ndielectric, leads to a significant change in the Purcell enhancement, Lamb\nshift, and visible far-field spontaneous emission spectrum, as an immediate\nconsequence of SRFs. We anticipate that fitting the theoretically modelled\nspectra to experiments could allow for experimental determination of the\n$d$-parameters.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:02:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Eriksen","Mikkel Have",""],["Tserkezis","Christos",""],["Mortensen","N. Asger",""],["Cox","Joel D.",""]]}
{"id":"2308.09135","submitter":"Anirban Karan","authors":"Anirban Karan, Soumya Sadhukhan and Jos\\'e W. F. Valle","title":"Phenomenological profile of scotogenic fermionic dark matter","comments":"26 pages, 15 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the possibility that neutrino masses arise from the exchange of\ndark matter states. We examine in detail the phenomenology of fermionic dark\nmatter in the singlet-triplet scotogenic reference model. We explore the case\nof singlet-like fermionic dark matter, examining in detail all co-annihilation\neffects relevant for determining its relic abundance, including fermion-fermion\nas well as scalar-fermion co-annihilation, which are properly taken into\naccount. Although this in principle allows for dark matter below 60 GeV, the\nlatter is in conflict with charged lepton flavour violation (cLFV) and/or\ncollider physics constraints. We examine the prospects for direct dark matter\ndetection in upcoming experiments up to 10 TeV. Fermion-scalar coannihilation\nis needed to obtain viable fermionic dark matter in the 60-100 GeV mass range.\nFermion-fermion and fermion-scalar coannihilation play complementary roles in\ndifferent parameter regions above 100 GeV.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:05:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Karan","Anirban",""],["Sadhukhan","Soumya",""],["Valle","Jos\u00e9 W. F.",""]]}
{"id":"2308.09136","submitter":"Leonid Burlachkov","authors":"Leonid Burlachkov and Nikita Fuzailov","title":"Bowstring effect as a trigger for flux instabilities in thin\n  superconductors","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":"  Magnetic vortices resemble bowstrings stretched across a corner at the\ninitial stage of their penetration into a flat superconducting sample of a\nrectangular cross-section. As the external magnetic field $H_e$ reaches the\nthreshold level $H_{th}$, a bowstring is \"released\" and instantaneously\ncontracted in length with a substantial heat generation. This heat can serve as\na trigger for nucleation of a flux instability (avalanche). At $H_e \\approx\n\\sqrt{2}H_{th}$ a usual vortex penetration starts at flat edges, and the\nbowstring mechanism is no longer effective. We describe the geometry of\nbowstring-like vortices, find $H_{th}$ for disk and strip shaped\nsuperconductors as a function of their thickness to width ratio, and determine\nthe heat effect related to a bowstring release. Our results enable a novel\ntreatment of numerous experimental data on flux instabilities and avalanche\ntype penetration in flat superconducting samples. A moderate anisotropy of a\nsuperconducting penetration depth ($\\lambda_c > \\lambda_{ab}$) diminishes or\neven completely removes the bowstring effect. This explains the absence of\nspontaneous instabilities in epitaxial\n$\\mathrm{YBa}_{2}\\mathrm{Cu}_{3}\\mathrm{O}_{7-\\delta }$ films at all\ntemperatures and in $\\mathrm{MgB_{2}}$ above 10 K.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:06:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Burlachkov","Leonid",""],["Fuzailov","Nikita",""]]}
{"id":"2308.09137","submitter":"Walter Lynn","authors":"Walter Lynn (1), Tianzhe Xu (2), Gerard Andonian (1), Scott Doran (3),\n  Gwanghui Ha (3), Nathan Majernik (1), Philippe Piot (2), John Power (3),\n  James Rosenzweig (1), Charles Whiteford (3), Eric Wisniewski (3) ((1) UCLA\n  Department of Physics and Astronomy, (2) Northern Illinois Center for\n  Accelerator & Detector Development and Department of Physics, (3) Argonne\n  National Laboratory)","title":"Observation of Skewed Electromagnetic Wakefields in an Asymmetric\n  Structure Driven by Flat Electron Bunches","comments":"Six pages, seven figures. Submitted to Physical Review","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Relativistic charged-particle beams which generate intense longitudinal\nfields in accelerating structures also inherently couple to transverse modes.\nThe effects of this coupling may lead to beam break-up instability, and thus\nmust be countered to preserve beam quality in applications such as linear\ncolliders. Beams with highly asymmetric transverse sizes (flat-beams) have been\nshown to suppress the initial instability in slab-symmetric structures.\nHowever, as the coupling to transverse modes remains, this solution serves only\nto delay instability. In order to understand the hazards of transverse coupling\nin such a case, we describe here an experiment characterizing the transverse\neffects on a flat-beam, traversing near a planar dielectric lined structure.\nThe measurements reveal the emergence of a previously unobserved\nskew-quadrupole-like interaction when the beam is canted transversely, which is\nnot present when the flat-beam travels parallel to the dielectric surface. We\ndeploy a multipole field fitting algorithm to reconstruct the projected\ntransverse wakefields from the data. We generate the effective kick vector map\nusing a simple two-particle theoretical model, with particle-in-cell\nsimulations used to provide further insight for realistic particle\ndistributions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:09:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lynn","Walter",""],["Xu","Tianzhe",""],["Andonian","Gerard",""],["Doran","Scott",""],["Ha","Gwanghui",""],["Majernik","Nathan",""],["Piot","Philippe",""],["Power","John",""],["Rosenzweig","James",""],["Whiteford","Charles",""],["Wisniewski","Eric",""]]}
{"id":"2308.09138","submitter":"Subhabrata Majumdar","authors":"Harsh Raj, Vipul Gupta, Domenic Rosati, Subhabrata Majumdar","title":"Semantic Consistency for Assuring Reliability of Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) exhibit remarkable fluency and competence across\nvarious natural language tasks. However, recent research has highlighted their\nsensitivity to variations in input prompts. To deploy LLMs in a safe and\nreliable manner, it is crucial for their outputs to be consistent when prompted\nwith expressions that carry the same meaning or intent. While some existing\nwork has explored how state-of-the-art LLMs address this issue, their\nevaluations have been confined to assessing lexical equality of single- or\nmulti-word answers, overlooking the consistency of generative text sequences.\nFor a more comprehensive understanding of the consistency of LLMs in open-ended\ntext generation scenarios, we introduce a general measure of semantic\nconsistency, and formulate multiple versions of this metric to evaluate the\nperformance of various LLMs. Our proposal demonstrates significantly higher\nconsistency and stronger correlation with human evaluations of output\nconsistency than traditional metrics based on lexical consistency. Finally, we\npropose a novel prompting strategy, called Ask-to-Choose (A2C), to enhance\nsemantic consistency. When evaluated for closed-book question answering based\non answer variations from the TruthfulQA benchmark, A2C increases accuracy\nmetrics for pretrained and finetuned LLMs by up to 47%, and semantic\nconsistency metrics for instruction-tuned models by up to 7-fold.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:11:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Raj","Harsh",""],["Gupta","Vipul",""],["Rosati","Domenic",""],["Majumdar","Subhabrata",""]]}
{"id":"2308.09139","submitter":"Alessandro Conti","authors":"Giacomo Zara, Alessandro Conti, Subhankar Roy, St\\'ephane\n  Lathuili\\`ere, Paolo Rota, Elisa Ricci","title":"The Unreasonable Effectiveness of Large Language-Vision Models for\n  Source-free Video Domain Adaptation","comments":"Accepted at ICCV2023, 14 pages, 7 figures, code is available at\n  https://github.com/giaczara/dallv","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Source-Free Video Unsupervised Domain Adaptation (SFVUDA) task consists in\nadapting an action recognition model, trained on a labelled source dataset, to\nan unlabelled target dataset, without accessing the actual source data. The\nprevious approaches have attempted to address SFVUDA by leveraging\nself-supervision (e.g., enforcing temporal consistency) derived from the target\ndata itself. In this work, we take an orthogonal approach by exploiting\n\"web-supervision\" from Large Language-Vision Models (LLVMs), driven by the\nrationale that LLVMs contain a rich world prior surprisingly robust to\ndomain-shift. We showcase the unreasonable effectiveness of integrating LLVMs\nfor SFVUDA by devising an intuitive and parameter-efficient method, which we\nname Domain Adaptation with Large Language-Vision models (DALL-V), that\ndistills the world prior and complementary source model information into a\nstudent network tailored for the target. Despite the simplicity, DALL-V\nachieves significant improvement over state-of-the-art SFVUDA methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:12:05 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 12:17:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zara","Giacomo",""],["Conti","Alessandro",""],["Roy","Subhankar",""],["Lathuili\u00e8re","St\u00e9phane",""],["Rota","Paolo",""],["Ricci","Elisa",""]]}
{"id":"2308.09140","submitter":"Ignacio Araya","authors":"Giorgos Anastasiou, Ignacio J. Araya, Cristobal Corral and Rodrigo\n  Olea","title":"Conformal Renormalization of topological black holes in AdS$_6$","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a streamlined proof that any Einstein-AdS space is a solution of\nthe Lu, Pang and Pope conformal gravity theory in six dimensions. The reduction\nof conformal gravity into Einstein theory manifestly shows that the action of\nthe latter can be written as the Einstein-Hilbert term plus the Euler\ntopological density and an additional contribution that depends on the\nLaplacian of the bulk Weyl tensor squared. The prescription for obtaining this\nform of the action by embedding the Einstein theory into a Weyl-invariant\npurely metric theory, was dubbed Conformal Renormalization and its resulting\naction was shown to be equivalent to the one obtained by holographic\nrenormalization. As a non-trivial application of the method, we compute the\nNoether-Wald charges and thermodynamic quantities for topological black hole\nsolutions with generic transverse section in Einstein-AdS$_6$ theory.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:17:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Anastasiou","Giorgos",""],["Araya","Ignacio J.",""],["Corral","Cristobal",""],["Olea","Rodrigo",""]]}
{"id":"2308.09141","submitter":"Junqing Huang","authors":"Junqing Huang, Haihui Wang, Michael Ruzhansky","title":"Semi-sparsity Priors for Image Structure Analysis and Extraction","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Image structure-texture decomposition is a long-standing and fundamental\nproblem in both image processing and computer vision fields. In this paper, we\npropose a generalized semi-sparse regularization framework for image structural\nanalysis and extraction, which allows us to decouple the underlying image\nstructures from complicated textural backgrounds. Combining with different\ntextural analysis models, such a regularization receives favorable properties\ndiffering from many traditional methods. We demonstrate that it is not only\ncapable of preserving image structures without introducing notorious staircase\nartifacts in polynomial-smoothing surfaces but is also applicable for\ndecomposing image textures with strong oscillatory patterns. Moreover, we also\nintroduce an efficient numerical solution based on an alternating direction\nmethod of multipliers (ADMM) algorithm, which gives rise to a simple and\nmaneuverable way for image structure-texture decomposition. The versatility of\nthe proposed method is finally verified by a series of experimental results\nwith the capability of producing comparable or superior image decomposition\nresults against cutting-edge methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:22:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Junqing",""],["Wang","Haihui",""],["Ruzhansky","Michael",""]]}
{"id":"2308.09142","submitter":"Sebastien R\\\"ocken","authors":"Sebastien R\\\"ocken and Julija Zavadlav","title":"Accurate machine learning force fields via experimental and simulation\n  data fusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cs.LG physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine Learning (ML)-based force fields are attracting ever-increasing\ninterest due to their capacity to span spatiotemporal scales of classical\ninteratomic potentials at quantum-level accuracy. They can be trained based on\nhigh-fidelity simulations or experiments, the former being the common case.\nHowever, both approaches are impaired by scarce and erroneous data resulting in\nmodels that either do not agree with well-known experimental observations or\nare under-constrained and only reproduce some properties. Here we leverage both\nDensity Functional Theory (DFT) calculations and experimentally measured\nmechanical properties and lattice parameters to train an ML potential of\ntitanium. We demonstrate that the fused data learning strategy can concurrently\nsatisfy all target objectives, thus resulting in a molecular model of higher\naccuracy compared to the models trained with a single data source. The\ninaccuracies of DFT functionals at target experimental properties were\ncorrected, while the investigated off-target properties remained largely\nunperturbed. Our approach is applicable to any material and can serve as a\ngeneral strategy to obtain highly accurate ML potentials.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:22:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["R\u00f6cken","Sebastien",""],["Zavadlav","Julija",""]]}
{"id":"2308.09143","submitter":"Nikolai Nikolov","authors":"{\\L}ukasz Kosi\\'nski, Nikolai Nikolov, and Ahmed Yekta \\\"Okten","title":"Precise estimates of invariant distances on strongly pseudoconvex\n  domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Studying the behavior of real and complex geodesics we provide sharp\nestimates for the Kobayashi distance, the Lempert function, and the\nCarath\\'eodory distance on $\\mathcal{C}^{2,\\alpha}$-smooth strongly\npseudoconvex domains. Similar estimates are also provided for the Bergman\ndistance on strongly pseudoconvex domains with $\\mathcal{C}^{3,1}$-boundary.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:23:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kosi\u0144ski","\u0141ukasz",""],["Nikolov","Nikolai",""],["\u00d6kten","Ahmed Yekta",""]]}
{"id":"2308.09144","submitter":"Beatriz Salvador","authors":"C. Franceschini, P. Gon\\c{c}alves, M. Jara, B. Salvador","title":"Non-equilibrium fluctuations for SEP($\\alpha$) with open boundary","comments":"45 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We analyze the non-equilibrium fluctuations of the partial symmetric simple\nexclusion process, SEP($\\alpha$), which allows at most $\\alpha \\in \\mathbb{N}$\nparticles per site, and we put it in contact with stochastic reservoirs whose\nstrength is regulated by a parameter $\\theta \\in \\mathbb{R}$. Setting $\\alpha =\n1$, we find the results of [22, 16, 17] and extend the known results to cover\nall range of $\\theta$.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:24:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Franceschini","C.",""],["Gon\u00e7alves","P.",""],["Jara","M.",""],["Salvador","B.",""]]}
{"id":"2308.09145","submitter":"Igor Baliukin","authors":"I. I. Baliukin, V. V. Izmodenov, D. B. Alexashov","title":"Adiabatic energy change in the inner heliosheath: How does it affect the\n  distribution of pickup protons and energetic neutral atom fluxes?","comments":"7 pages, 4 figures; accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.SR physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The hydrogen atoms penetrate the heliosphere from the local interstellar\nmedium, and while being ionized, they form the population of pickup protons.\nThe distribution of pickup protons is modified by the adiabatic heating\n(cooling) induced by the solar wind plasma compression (expansion). In this\nstudy, we emphasize the importance of the adiabatic energy change in the inner\nheliosheath that is usually either neglected or considered improperly. The\neffect of this process on the energy and spatial distributions of pickup\nprotons and energetic neutral atoms (ENAs), which originate in the charge\nexchange of pickup protons, has been investigated and quantified using a\nkinetic model. The model employs the global distributions of plasma and\nhydrogen atoms in the heliosphere from the simulations of a\nkinetic-magnetohydrodynamic model of solar wind interaction with the local\ninterstellar medium. The findings indicate that the adiabatic energy change is\nresponsible for the broadening of the pickup proton velocity distribution and\nthe significant enhancement of ENA fluxes (up to $\\sim$5 and $\\sim$20 times in\nthe upwind and downwind directions at energies $\\sim$1-2 keV for an observer at\n1 au). It sheds light on the role of adiabatic energy change in explaining the\ndiscrepancies between the ENA flux observations and the results of numerical\nsimulations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:28:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Baliukin","I. I.",""],["Izmodenov","V. V.",""],["Alexashov","D. B.",""]]}
{"id":"2308.09146","submitter":"Yicheng Zhang","authors":"Carter Slocum, Yicheng Zhang, Erfan Shayegani, Pedram Zaree, Nael\n  Abu-Ghazaleh, Jiasi Chen","title":"That Doesn't Go There: Attacks on Shared State in Multi-User Augmented\n  Reality Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Augmented Reality (AR) is expected to become a pervasive component in\nenabling shared virtual experiences. In order to facilitate collaboration among\nmultiple users, it is crucial for multi-user AR applications to establish a\nconsensus on the \"shared state\" of the virtual world and its augmentations,\nthrough which they interact within augmented reality spaces. Current methods to\ncreate and access shared state collect sensor data from devices (e.g., camera\nimages), process them, and integrate them into the shared state. However, this\nprocess introduces new vulnerabilities and opportunities for attacks.\nMaliciously writing false data to \"poison\" the shared state is a major concern\nfor the security of the downstream victims that depend on it. Another type of\nvulnerability arises when reading the shared state; by providing false inputs,\nan attacker can view hologram augmentations at locations they are not allowed\nto access. In this work, we demonstrate a series of novel attacks on multiple\nAR frameworks with shared states, focusing on three publicly-accessible\nframeworks. We show that these frameworks, while using different underlying\nimplementations, scopes, and mechanisms to read from and write to the shared\nstate, have shared vulnerability to a unified threat model. Our evaluation of\nthese state-of-art AR applications demonstrates reliable attacks both on\nupdating and accessing shared state across the different systems. To defend\nagainst such threats, we discuss a number of potential mitigation strategies\nthat can help enhance the security of multi-user AR applications.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:33:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Slocum","Carter",""],["Zhang","Yicheng",""],["Shayegani","Erfan",""],["Zaree","Pedram",""],["Abu-Ghazaleh","Nael",""],["Chen","Jiasi",""]]}
{"id":"2308.09147","submitter":"Durvudkhan Suragan","authors":"Aidyn Kassymov, Maria Alessandra Ragusa, Michael Ruzhansky and\n  Durvudkhan Suragan","title":"Stein-Weiss-Adams inequality on Morrey spaces","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 establish Adams type Stein-Weiss inequality on global Morrey spaces on\ngeneral homogeneous groups. Special properties of homogeneous norms and some\nboundedness results on global Morrey spaces play key roles in our proofs. As\nconsequence, we obtain fractional Hardy, Hardy-Sobolev, Rellich and\nGagliardo-Nirenberg inequalities on Morrey spaces on stratified groups. While\nthe results are obtained in the setting of general homogeneous groups, they are\nnew already for the Euclidean space $\\mathbb{R}^{N}.$\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:40:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kassymov","Aidyn",""],["Ragusa","Maria Alessandra",""],["Ruzhansky","Michael",""],["Suragan","Durvudkhan",""]]}
{"id":"2308.09148","submitter":"Arne Mertens","authors":"Violeta Borges Marques, Wendy Lowen and Arne Mertens","title":"Deformations of quasi-categories in modules","comments":"22 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The framework of templicial objects was put forth in arXiv:2302.02484v1 in\norder to develop higher categorical concepts in the presence of enrichment. In\nparticular, quasi-categories in modules constitute a subclass of templicial\nmodules which may be considered as a kind of \"weak dg-categories (concentrated\nin homologically positive degrees)\" according to arXiv:2005.04778v3. The main\ngoal of the present paper is to initiate the deformation theory of templicial\nmodules. In particular, we show that quasi-categories in modules are preserved\nunder levelwise flat infinitesimal deformation.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:41:26 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Marques","Violeta Borges",""],["Lowen","Wendy",""],["Mertens","Arne",""]]}
{"id":"2308.09149","submitter":"William Verreault","authors":"Jean-Marie De Koninck, William Verreault","title":"On the tower factorization of integers","comments":"8 pages. Accepted for publication in the Amer. Math. Monthly","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Under the fundamental theorem of arithmetic, any integer $n>1$ can be\nuniquely written as a product of prime powers $p^a$; factoring each exponent\n$a$ as a product of prime powers $q^b$, and so on, one will obtain what is\ncalled the tower factorization of $n$. Here, given an integer $n>1$, we study\nits height $h(n)$, that is, the number of \"floors\" in its tower factorization.\nIn particular, given a fixed integer $k\\geq 1$, we provide a formula for the\ndensity of the set of integers $n$ with $h(n)=k$. This allows us to estimate\nthe number of floors that a positive integer will have on average. We also show\nthat there exist arbitrarily long sequences of consecutive integers with\narbitrarily large heights.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:43:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["De Koninck","Jean-Marie",""],["Verreault","William",""]]}
{"id":"2308.09150","submitter":"V\\'ictor H. Ortiz","authors":"V\\'ictor H. Ortiz, Shashi B. Mishra, Luat Vuong, Sinisa Coh and\n  Richard B. Wilson","title":"Transient Ellipsometry Measurements of the Specular Inverse Faraday\n  Effect in Transition Metals","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 inverse Faraday effect is an opto-magnetic phenomenon that describes the\nability of circularly polarized light to induce magnetism in solids. The\ncapability of light to control magnetic order in solid state materials and\ndevices is of interest for a variety of applications, such as magnetic\nrecording, quantum computation and spintronic technologies. However,\nsignificant gaps in understanding about the effect persist, such as what\nmaterial properties govern the magnitude of the effect in metals. In this work,\nwe report time-resolved measurements of the specular inverse Faraday effect in\nnon-magnetic metals, i.e., the magneto-optic Kerr effect induced by circularly\npolarized light. We measure this specular inverse Faraday effect in Cu, Pd, Pt,\nW, Ta, and Au at a laser wavelength of 783 nm. For Ta and W, we investigate\nboth {\\alpha} and \\{beta} phases. We observe that excitation of these metals\nwith circularly polarized light induces significant circular dichroism. This\nnonlinear magneto-optical response to circularly polarized light is an order of\nmagnitude larger in {\\alpha}-W than other metals, e.g., Pt, Au, and is greater\nthan nearly all other reported values for IFE in other materials. Our results\nbenchmark the range of IFE that can be observed in non-magnetic metals and\nprovide insight into what material properties govern the inverse Faraday effect\nin metals.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:44:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ortiz","V\u00edctor H.",""],["Mishra","Shashi B.",""],["Vuong","Luat",""],["Coh","Sinisa",""],["Wilson","Richard B.",""]]}
{"id":"2308.09151","submitter":"Kevin Zelaya","authors":"Matthew Markowitz, Kevin Zelaya, Mohammad-Ali Miri","title":"Auto-calibrating Universal Programmable Photonic Circuits: Hardware\n  Error-Correction and Defect Resilience","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET physics.optics quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It is recently shown that discrete $N\\times N$ linear unitary operators can\nbe represented by interlacing $N+1$ phase shift layers with a fixed intervening\noperator such as Discrete Fractional Fourier Transform (DFrFT). Here, we show\nthat introducing perturbations to the intervening operations does not\ncompromise the universality of this architecture. Furthermore, we show that\nthis architecture is resilient to defects in the phase shifters as long as no\nmore than one faulty phase shifter is present in each layer. These properties\nenable post-fabrication auto-calibration of such universal photonic circuits,\neffectively compensating for fabrication errors and defects in phase\ncomponents.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:45:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Markowitz","Matthew",""],["Zelaya","Kevin",""],["Miri","Mohammad-Ali",""]]}
{"id":"2308.09152","submitter":"Carlos Esteve-Yag\\\"ue","authors":"Carlos Esteve-Yag\\\"ue and Richard Tsai","title":"Usable boundary for visibility-based surveillance-evasion games","comments":"33 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a surveillance-evasion game in an environment with obstacles. In\nsuch an environment, a mobile pursuer seeks to maintain the visibility with a\nmobile evader, who tries to get occluded from the pursuer in the shortest time\npossible. In this two-player zero-sum game setting, we study the\ndiscontinuities of the value of the game near the boundary of the target set\n(the non-visibility region). In particular, we describe the transition between\nthe usable part of the boundary of the target (where the value vanishes) and\nthe non-usable part (where the value is positive). We show that the value\nenjoys a different behaviour depending on the regularity of the obstacles\ninvolved in the game. Namely, we prove that the boundary profile is continuous\nfor the case of smooth obstacles, and that it exhibits a jump discontinuity\nwhen the obstacle contains corners. Moreover, we prove that, in the latter\ncase, there is a semi-permeable barrier emanating from the interface between\nthe usable and the non-usable part of the boundary of the target set.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:47:52 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 00:05:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Esteve-Yag\u00fce","Carlos",""],["Tsai","Richard",""]]}
{"id":"2308.09153","submitter":"Isaiah Lyons-Galante","authors":"Isaiah Lyons-Galante, Morteza Karimzadeh, Samantha Molnar, Graham\n  Johnson, Kenny Gruchalla","title":"Alternatives to Contour Visualizations for Power Systems Data","comments":"IEEE Vis 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electrical grids are geographical and topological structures whose voltage\nstates are challenging to represent accurately and efficiently for visual\nanalysis. The current common practice is to use colored contour maps, yet these\ncan misrepresent the data. We examine the suitability of four alternative\nvisualization methods for depicting voltage data in a geographically dense\ndistribution system -- Voronoi polygons, H3 tessellations, S2 tessellations,\nand a network-weighted contour map. We find that Voronoi tessellations and\nnetwork-weighted contour maps more accurately represent the statistical\ndistribution of the data than regular contour maps.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:50:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lyons-Galante","Isaiah",""],["Karimzadeh","Morteza",""],["Molnar","Samantha",""],["Johnson","Graham",""],["Gruchalla","Kenny",""]]}
{"id":"2308.09154","submitter":"Jason Erbele","authors":"Jason Erbele, Joseph D. Chavez, Rolland Trapp","title":"The Cyclic Cutwidth of $Q_n$","comments":"8 pages, 3 figures. Summer Research Experiences for Undergraduates\n  report from August 2003, with some typos fixed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article the cyclic cutwidth of the $n$-dimensional cube is explored.\nIt has been conjectured by Dr. Chavez and Dr. Trapp that the cyclic cutwidth of\n$Q_n$ is minimized with the Graycode numbering. Several results have been found\ntoward the proof of this conjecture.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:52:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Erbele","Jason",""],["Chavez","Joseph D.",""],["Trapp","Rolland",""]]}
{"id":"2308.09155","submitter":"Churna Bhandari","authors":"Churna Bhandari, S Satpathy","title":"Dielectric Screening and Electric Field Control of Ferromagnetism at the\n  CaMnO$_3$/CaRuO$_3$ Interface","comments":"7 pages, 6 figures","journal-ref":"Phys. Rev. B 104, 085134 (2021)","doi":"10.1103/PhysRevB.104.085134","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Control of magnetism by an applied electric field is a desirable technique\nfor the functionalization of magnetic materials. Motivated by recent\nexperiments, we study the electric field control of the interfacial magnetism\nof CaRuO$_3$/CaMnO$_3$ (CRO/CMO) (001), a prototype interface between a\nnon-magnetic metal and an antiferromagnetic insulator. Even without the\nelectric field, the interfacial CMO layer acquires a ferromagnetic moment due\nto a spin-canted state, caused by the Anderson-Hasegawa double exchange (DEX)\nbetween the Mn moments and the leaked electrons from the CRO side. An electric\nfield would alter the carrier density at the interface, leading to the\npossibility of controlling the magnetism, since DEX is sensitive to the carrier\ndensity. We study this effect quantitatively usingdensity-functional\ncalculations in the slab geometry. We find a text-book like dielectric\nscreening of the electric field, which introduces polarization charges at the\ninterfaces and the surfaces. The extra charge at the interface enhances the\nferromagnetism via the DEX interaction, while away from the interface the\noriginal AFM state of the Mn layers remains unchanged. The effect could have\npotential application in spintronics devices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:03:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhandari","Churna",""],["Satpathy","S",""]]}
{"id":"2308.09156","submitter":"Omar Sharif","authors":"Omar Sharif, Madhusudan Basak, Tanzia Parvin, Ava Scharfstein,\n  Alphonso Bradham, Jacob T. Borodovsky, Sarah E. Lord, Sarah Masud Preum","title":"Characterizing Information Seeking Events in Health-Related Social\n  Discourse","comments":"Under review AAAI-2024. 10 pages, 6 tables, 2 figues","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Social media sites have become a popular platform for individuals to seek and\nshare health information. Despite the progress in natural language processing\nfor social media mining, a gap remains in analyzing health-related texts on\nsocial discourse in the context of events. Event-driven analysis can offer\ninsights into different facets of healthcare at an individual and collective\nlevel, including treatment options, misconceptions, knowledge gaps, etc. This\npaper presents a paradigm to characterize health-related information-seeking in\nsocial discourse through the lens of events. Events here are board categories\ndefined with domain experts that capture the trajectory of the\ntreatment/medication. To illustrate the value of this approach, we analyze\nReddit posts regarding medications for Opioid Use Disorder (OUD), a critical\nglobal health concern. To the best of our knowledge, this is the first attempt\nto define event categories for characterizing information-seeking in OUD social\ndiscourse. Guided by domain experts, we develop TREAT-ISE, a novel multilabel\ntreatment information-seeking event dataset to analyze online discourse on an\nevent-based framework. This dataset contains Reddit posts on\ninformation-seeking events related to recovery from OUD, where each post is\nannotated based on the type of events. We also establish a strong performance\nbenchmark (77.4% F1 score) for the task by employing several machine learning\nand deep learning classifiers. Finally, we thoroughly investigate the\nperformance and errors of ChatGPT on this task, providing valuable insights\ninto the LLM's capabilities and ongoing characterization efforts.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:08:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sharif","Omar",""],["Basak","Madhusudan",""],["Parvin","Tanzia",""],["Scharfstein","Ava",""],["Bradham","Alphonso",""],["Borodovsky","Jacob T.",""],["Lord","Sarah E.",""],["Preum","Sarah Masud",""]]}
{"id":"2308.09157","submitter":"Matthew Russo","authors":"Matthew Russo, Tatsunori Hashimoto, Daniel Kang, Yi Sun, Matei Zaharia","title":"Accelerating Aggregation Queries on Unstructured Streams of Data","comments":"14 pages, 11 figures, to be published in Proceedings of the VLDB\n  Endowment, Vol. 16, No. 11","journal-ref":"PVLDB, 16(11): 2897 - 2910, 2023","doi":"10.14778/3611479.3611496","report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analysts and scientists are interested in querying streams of video, audio,\nand text to extract quantitative insights. For example, an urban planner may\nwish to measure congestion by querying the live feed from a traffic camera.\nPrior work has used deep neural networks (DNNs) to answer such queries in the\nbatch setting. However, much of this work is not suited for the streaming\nsetting because it requires access to the entire dataset before a query can be\nsubmitted or is specific to video. Thus, to the best of our knowledge, no prior\nwork addresses the problem of efficiently answering queries over multiple\nmodalities of streams.\n  In this work we propose InQuest, a system for accelerating aggregation\nqueries on unstructured streams of data with statistical guarantees on query\naccuracy. InQuest leverages inexpensive approximation models (\"proxies\") and\nsampling techniques to limit the execution of an expensive high-precision model\n(an \"oracle\") to a subset of the stream. It then uses the oracle predictions to\ncompute an approximate query answer in real-time. We theoretically analyzed\nInQuest and show that the expected error of its query estimates converges on\nstationary streams at a rate inversely proportional to the oracle budget. We\nevaluated our algorithm on six real-world video and text datasets and show that\nInQuest achieves the same root mean squared error (RMSE) as two streaming\nbaselines with up to 5.0x fewer oracle invocations. We further show that\nInQuest can achieve up to 1.9x lower RMSE at a fixed number of oracle\ninvocations than a state-of-the-art batch setting algorithm.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:11:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Russo","Matthew",""],["Hashimoto","Tatsunori",""],["Kang","Daniel",""],["Sun","Yi",""],["Zaharia","Matei",""]]}
{"id":"2308.09158","submitter":"Yi-Kai Zhang","authors":"Yi-Kai Zhang, Lu Ren, Chao Yi, Qi-Wei Wang, De-Chuan Zhan, Han-Jia Ye","title":"ZhiJian: A Unifying and Rapidly Deployable Toolbox for Pre-trained Model\n  Reuse","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid expansion of foundation pre-trained models and their fine-tuned\ncounterparts has significantly contributed to the advancement of machine\nlearning. Leveraging pre-trained models to extract knowledge and expedite\nlearning in real-world tasks, known as \"Model Reuse\", has become crucial in\nvarious applications. Previous research focuses on reusing models within a\ncertain aspect, including reusing model weights, structures, and hypothesis\nspaces. This paper introduces ZhiJian, a comprehensive and user-friendly\ntoolbox for model reuse, utilizing the PyTorch backend. ZhiJian presents a\nnovel paradigm that unifies diverse perspectives on model reuse, encompassing\ntarget architecture construction with PTM, tuning target model with PTM, and\nPTM-based inference. This empowers deep learning practitioners to explore\ndownstream tasks and identify the complementary advantages among different\nmethods. ZhiJian is readily accessible at\nhttps://github.com/zhangyikaii/lamda-zhijian facilitating seamless utilization\nof pre-trained models and streamlining the model reuse process for researchers\nand developers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:12:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Yi-Kai",""],["Ren","Lu",""],["Yi","Chao",""],["Wang","Qi-Wei",""],["Zhan","De-Chuan",""],["Ye","Han-Jia",""]]}
{"id":"2308.09159","submitter":"Robert McConkey","authors":"Rob McConkey","title":"Linear Bounds of the Crosscap Number of Knots","comments":"26 pages, 12 figures. Comments and feedback welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kalfagianni and Lee found two-sided bounds for the crosscap number of an\nalternating link in terms of certain coefficients of the Jones polynomial. We\nshow here that we can find similar two-sided bounds for the crosscap number of\nConway sums of strongly alternating tangles. Then we find families of links for\nwhich these coefficients of the Jones polynomial and the crosscap number grow\nindependently. These families will enable us to show that neither linear bound\ngeneralizes for all links.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:12:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["McConkey","Rob",""]]}
{"id":"2308.09160","submitter":"Guangyu Sun","authors":"Guangyu Sun, Matias Mendieta, Jun Luo, Shandong Wu, Chen Chen","title":"FedPerfix: Towards Partial Model Personalization of Vision Transformers\n  in Federated Learning","comments":"2023 IEEE/CVF International Conference on Computer Vision (ICCV)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Personalized Federated Learning (PFL) represents a promising solution for\ndecentralized learning in heterogeneous data environments. Partial model\npersonalization has been proposed to improve the efficiency of PFL by\nselectively updating local model parameters instead of aggregating all of them.\nHowever, previous work on partial model personalization has mainly focused on\nConvolutional Neural Networks (CNNs), leaving a gap in understanding how it can\nbe applied to other popular models such as Vision Transformers (ViTs). In this\nwork, we investigate where and how to partially personalize a ViT model.\nSpecifically, we empirically evaluate the sensitivity to data distribution of\neach type of layer. Based on the insights that the self-attention layer and the\nclassification head are the most sensitive parts of a ViT, we propose a novel\napproach called FedPerfix, which leverages plugins to transfer information from\nthe aggregated model to the local client as a personalization. Finally, we\nevaluate the proposed approach on CIFAR-100, OrganAMNIST, and Office-Home\ndatasets and demonstrate its effectiveness in improving the model's performance\ncompared to several advanced PFL methods.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:22:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Guangyu",""],["Mendieta","Matias",""],["Luo","Jun",""],["Wu","Shandong",""],["Chen","Chen",""]]}
{"id":"2308.09161","submitter":"Kyle Fruhling","authors":"Kyle Fruhling, Xiaohan Yao, Alenna Streeter, Fazel Tafti","title":"Rare-earth Engineering of the Magnetocaloric Effect in RMn6Sn6","comments":"Main Text: 14 pages, 6 figures Supplemental: 3 pages, 2 figures, 1\n  table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive study of the magnetocaloric effect (MCE) in a\nfamily of kagome magnets with formula RMn6Sn6 (R=Tb, Ho, Er, and Lu). These\nmaterials have a small rare-earth content and tunable magnetic ordering, hence\nthey provide a venue to study the fundamentals of the MCE. We examine the\neffect of different types of order (ferromagnetic, ferrimagnetic, and\nantiferromagnetic) and the presence of a metamagnetic transition on the MCE. We\nextend the study to a high-entropy rare-earth alloys of the family, and\nconclude with several guidelines for enhancing the MCE in tunable magnetic\nmaterials with a small rare-earth content.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:24:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fruhling","Kyle",""],["Yao","Xiaohan",""],["Streeter","Alenna",""],["Tafti","Fazel",""]]}
{"id":"2308.09162","submitter":"Sudipta Chakraborty","authors":"Tamoghna Mukhopadhyay, Sudipta Chakraborty, Somesh Chamoli, Malaya K.\n  Nayak, and Achintya Kumar Dutta","title":"Analytic Calculation of Transition dipole moment using four-component\n  relativistic equation-of-motion coupled-cluster expectation value approach","comments":"14 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have developed an efficient scheme for the calculation of transition\nproperties within the four-component relativistic coupled cluster method using\nthe EOM-CCSD expectation value approach. The calculation of transition\nproperties within the relativistic EOM-CCSD framework requires the solution of\nboth right and left eigenvectors using Davidson's iterative diagonalization\nscheme. The accuracy of the approach has been investigated by calculating\nlow-lying transitions of Xe atom and spin forbidden\n$^{1}$S$_{0}$$\\rightarrow$$^{3}$P$_{1}$ transition in Na$^{+}$ atom. The\ncalculated results show good agreement with the earlier finite-field Fock space\nmulti-reference coupled cluster results and experimental values\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:33:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mukhopadhyay","Tamoghna",""],["Chakraborty","Sudipta",""],["Chamoli","Somesh",""],["Nayak","Malaya K.",""],["Dutta","Achintya Kumar",""]]}
{"id":"2308.09163","submitter":"Evgeniy Kurianovych","authors":"Evgeniy Kurianovych and Mikhail Shifman","title":"$U(1)$ Defects on Domain Lines","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"FTPI-MINN-23-14, UMN-TH-4222/23","categories":"hep-th cond-mat.mes-hall nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on recent experimental results, we give field-theoretic description of\n$U(1)$ defects localized on the domain lines on thin films. We describe\ntopology of our model and solve this model in the adiabatic approximation. It\nturns out that such a model naturally provides periodic structure observed in\nexperiment. The effective theory turns out to be the sine-Gordon model, but\nunlike the previous theoretical considerations we argue that in this case it is\nfavorable for sine-Gordon kinks to merge into one defect with a uniform\nwinding. We consider a system of adjacent domain lines and anti-lines and\nexplain the experimental fact that the appearance of defects on a domain line\nprevents defect creation on the adjacent anti-lines. We also quantize the model\nand investigate possible effects of finite transverse dimension of the film.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:39:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kurianovych","Evgeniy",""],["Shifman","Mikhail",""]]}
{"id":"2308.09164","submitter":"Hao Wang","authors":"Hao Wang, Paz Beniamini, Dimitrios Giannios","title":"Constraining the long-living supramassive neutron stars by magnetar\n  boosted kilonovae","comments":"16 pages, 9 figures. Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kilonovae are optical transients following the merger of neutron star\nbinaries, which are powered by the r-process heating of merger ejecta. However,\nif a merger remnant is a long-living supramassive neutron star supported by its\nuniform rotation, it will inject energy into the ejecta through spindown power.\nThe energy injection can boost the peak luminosity of a kilonova by many orders\nof magnitudes, thus significantly increasing the detectable volume. Therefore,\neven if such events are only a small fraction of the kilonovae population, they\ncould dominate the detection rates. However, after many years of optical sky\nsurveys, no such event has been confirmed. In this work, we build a boosted\nkilonova model with rich physical details, including the description of the\nevolution and stability of a proto neutron star, and the energy absorption\nthrough X-ray photoionization. We simulate the observation prospects and find\nthe only way to match the absence of detection is to limit the energy injection\nby the newly born magnetar to only a small fraction of the neutron star\nrotational energy, thus they should collapse soon after the merger. Our result\nindicates that most supramassive neutron stars resulting from binary neutron\nstar mergers are short lived and they must be rare in the universe.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:46:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Hao",""],["Beniamini","Paz",""],["Giannios","Dimitrios",""]]}
{"id":"2308.09165","submitter":"Nick Salter","authors":"Nick Salter and Abdoul Karim Sane","title":"Connected components of the topological surgery graph of a unicellular\n  collection","comments":"13 pages, 12 figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A unicellular collection on a surface is a collection of curves whose\ncomplement is a single disk. There is a natural surgery operation on\nunicellular collections, endowing the set of such with a graph structure where\nthe edge relation is given by surgery. Here we determine the connected\ncomponents of this graph, showing that they are enumerated by a certain\nhomological \"surgery invariant\". Our approach is group-theoretic and proceeds\nby understanding the action of the mapping class group on unicellular\ncollections. In the course of our arguments, we determine simple generating\nsets for the stabilizer in the mapping class group of a mod-$2$ homology class,\nwhich may be of independent interest.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:47:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salter","Nick",""],["Sane","Abdoul Karim",""]]}
{"id":"2308.09166","submitter":"Sara Venkatraman","authors":"Sara Venkatraman, Sumanta Basu, Martin T. Wells","title":"Sparse reconstruction of ordinary differential equations with inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Sparse regression has emerged as a popular technique for learning dynamical\nsystems from temporal data, beginning with the SINDy (Sparse Identification of\nNonlinear Dynamics) framework proposed by arXiv:1509.03580. Quantifying the\nuncertainty inherent in differential equations learned from data remains an\nopen problem, thus we propose leveraging recent advances in statistical\ninference for sparse regression to address this issue. Focusing on systems of\nordinary differential equations (ODEs), SINDy assumes that each equation is a\nparsimonious linear combination of a few candidate functions, such as\npolynomials, and uses methods such as sequentially-thresholded least squares or\nthe Lasso to identify a small subset of these functions that govern the\nsystem's dynamics. We instead employ bias-corrected versions of the Lasso and\nridge regression estimators, as well as an empirical Bayes variable selection\ntechnique known as SEMMS, to estimate each ODE as a linear combination of terms\nthat are statistically significant. We demonstrate through simulations that\nthis approach allows us to recover the functional terms that correctly describe\nthe dynamics more often than existing methods that do not account for\nuncertainty.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:50:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Venkatraman","Sara",""],["Basu","Sumanta",""],["Wells","Martin T.",""]]}
{"id":"2308.09167","submitter":"Ruoyan Kong","authors":"Ruoyan Kong","title":"Towards an Effective Organization-Wide Bulk Email System","comments":"PhD Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bulk email is widely used in organizations to communicate messages to\nemployees. It is an important tool in making employees aware of policies,\nevents, leadership updates, etc. However, in large organizations, the problem\nof overwhelming communication is widespread. Ineffective organizational bulk\nemails waste employees' time and organizations' money, and cause a lack of\nawareness or compliance with organizations' missions and priorities. This\nthesis focuses on improving organizational bulk email systems by 1) conducting\nqualitative research to understand different stakeholders; 2) conducting field\nstudies to evaluate personalization's effects on getting employees to read bulk\nmessages; 3) designing tools to support communicators in evaluating bulk\nemails. We performed these studies at the University of Minnesota, interviewing\n25 employees (both senders and recipients), and including 317 participants in\ntotal. We found that the university's current bulk email system is ineffective\nas only 22% of the information communicated was retained by employees. To\nencourage employees to read high-level information, we implemented a\nmulti-stakeholder personalization framework that mixed\nimportant-to-organization messages with employee-preferred messages and\nimproved the studied bulk email's recognition rate by 20%. On the sender side,\nwe iteratively designed a prototype of a bulk email evaluation platform. In\nfield evaluation, we found bulk emails' message-level performance helped\ncommunicators in designing bulk emails. We collected eye-tracking data and\ndeveloped a neural network technique to estimate how much time each message is\nbeing read using recipients' interactions with browsers only, which improved\nthe estimation accuracy to 73%. In summary, this work sheds light on how to\ndesign organizational bulk email systems that communicate effectively and\nrespect different stakeholders' value.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:54:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kong","Ruoyan",""]]}
{"id":"2308.09168","submitter":"Elizabeth Ruddy","authors":"E. P. Ruddy, Y. Jiang, N. E. Frattini, K. O. Quinlan, and K. W.\n  Lehnert","title":"Protecting backaction-evading measurements from parametric instability","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Noiseless measurement of a single quadrature in systems of parametrically\ncoupled oscillators is theoretically possible by pumping at the sum and\ndifference frequencies of the two oscillators, realizing a backaction-evading\n(BAE) scheme. Although this would hold true in the simplest scenario for a\nsystem with pure three-wave mixing, implementations of this scheme are hindered\nby unwanted higher-order parametric processes that destabilize the system and\nadd noise. We show analytically that detuning the two pumps from the sum and\ndifference frequencies can stabilize the system and fully recover the BAE\nperformance, enabling operation at otherwise inaccessible cooperativities. We\nalso show that the acceleration demonstrated in a weak signal detection\nexperiment [PRX QUANTUM 4, 020302 (2023)] was only achievable because of this\ndetuning technique.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:55:18 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 02:14:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ruddy","E. P.",""],["Jiang","Y.",""],["Frattini","N. E.",""],["Quinlan","K. O.",""],["Lehnert","K. W.",""]]}
{"id":"2308.09169","submitter":"Francisco Fuica","authors":"Thomas F\\\"uhrer and Francisco Fuica","title":"A DPG method for linear quadratic optimal control problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The DPG method with optimal test functions for solving linear quadratic\noptimal control problems with control constraints is studied. We prove\nexistence of a unique optimal solution of the nonlinear discrete problem and\ncharacterize it through first order optimality conditions. Furthermore, we\nsystematically develop a priori as well as a posteriori error estimates. Our\nproposed method can be applied to a wide range of constrained optimal control\nproblems subject to, e.g., scalar second-order PDEs and the Stokes equations.\nNumerical experiments that illustrate our theoretical findings are presented.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:56:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["F\u00fchrer","Thomas",""],["Fuica","Francisco",""]]}
{"id":"2308.09170","submitter":"Thibault Lechien","authors":"Thibault Lechien and Gernot Hei{\\ss}el and Jai Grover and Dario Izzo","title":"Dark Matter reconstruction from stellar orbits in the Galactic Centre","comments":"8 pages, 4 figures, submitted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. Current constraints on distributed matter in the innermost Galactic\nCentre (such as a cluster of faint stars and stellar remnants, Dark Matter or a\ncombination thereof) based on the orbital dynamics of the visible stars closest\nto the central black hole, typically assume simple functional forms for the\ndistributions. Aims. We take instead a general model agnostic approach in which\nthe form of the distribution is not constrained by prior assumptions on the\nphysical composition of the matter. This approach yields unbiased - entirely\nobservation driven - fits for the matter distribution and places constraints on\nour ability to discriminate between different density profiles (and\nconsequently between physical compositions) of the distributed matter. Methods.\nWe construct a spherical shell model with the flexibility to fit a wide variety\nof physically reasonable density profiles by modelling the distribution as a\nseries of concentric mass shells. We test this approach in an analysis of mock\nobservations of the star S2. Results. For a sufficiently large and precise data\nset, we find that it is possible to discriminate between several physically\nmotivated density profiles. However, for data coming from current and expected\nnext generation observational instruments, the potential for profile\ndistinction will remain limited by the precision of the instruments. Future\nobservations will still be able to constrain the overall enclosed distributed\nmass within the apocentre of the probing orbit in an unbiased manner. We\ninterpret this in the theoretical context of constraining the secular versus\nnon-secular orbital dynamics.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:01:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lechien","Thibault",""],["Hei\u00dfel","Gernot",""],["Grover","Jai",""],["Izzo","Dario",""]]}
{"id":"2308.09171","submitter":"Li Yang","authors":"Li Yang, Abdallah Moubayed, Abdallah Shami, Amine Boukhtouta, Parisa\n  Heidari, Stere Preda, Richard Brunner, Daniel Migault, and Adel Larabi","title":"Forensic Data Analytics for Anomaly Detection in Evolving Networks","comments":"Electronic version of an article published as [Book Series: World\n  Scientific Series in Digital Forensics and Cybersecurity, Volume 2,\n  Innovations in Digital Forensics, 2023, Pages 99-137]\n  [DOI:10.1142/9789811273209_0004] \\c{opyright} copyright World Scientific\n  Publishing Company [https://doi.org/10.1142/9789811273209_0004]","journal-ref":null,"doi":"10.1142/9789811273209_0004","report-no":null,"categories":"cs.CR cs.AI cs.LG cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the prevailing convergence of traditional infrastructure-based deployment\n(i.e., Telco and industry operational networks) towards evolving deployments\nenabled by 5G and virtualization, there is a keen interest in elaborating\neffective security controls to protect these deployments in-depth. By\nconsidering key enabling technologies like 5G and virtualization, evolving\nnetworks are democratized, facilitating the establishment of point presences\nintegrating different business models ranging from media, dynamic web content,\ngaming, and a plethora of IoT use cases. Despite the increasing services\nprovided by evolving networks, many cybercrimes and attacks have been launched\nin evolving networks to perform malicious activities. Due to the limitations of\ntraditional security artifacts (e.g., firewalls and intrusion detection\nsystems), the research on digital forensic data analytics has attracted more\nattention. Digital forensic analytics enables people to derive detailed\ninformation and comprehensive conclusions from different perspectives of\ncybercrimes to assist in convicting criminals and preventing future crimes.\nThis chapter presents a digital analytics framework for network anomaly\ndetection, including multi-perspective feature engineering, unsupervised\nanomaly detection, and comprehensive result correction procedures. Experiments\non real-world evolving network data show the effectiveness of the proposed\nforensic data analytics solution.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:09:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Li",""],["Moubayed","Abdallah",""],["Shami","Abdallah",""],["Boukhtouta","Amine",""],["Heidari","Parisa",""],["Preda","Stere",""],["Brunner","Richard",""],["Migault","Daniel",""],["Larabi","Adel",""]]}
{"id":"2308.09172","submitter":"Krzysztof Pomorski","authors":"Lukasz Stepien and Krzysztof Pomorski","title":"Bogomolny approach in description of superconducting structures","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bogomolny approach in the context of strong necessary conditions is\nformulated for the case of various superconducting and semiconductor\nstructures. Certain results were obtained for a constant magnetic field, which\nexperimentally corresponds to spiral-like superconducting cable placed inside\nsolenoid.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:16:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Stepien","Lukasz",""],["Pomorski","Krzysztof",""]]}
{"id":"2308.09173","submitter":"Uwe Semmelmann","authors":"Oscar Macia, Uwe Semmelmann, Gregor Weingart","title":"On quaternionic bisectional curvature","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article we study the concept of quaternionic bisectional curvature\nintroduced by B. Chow and D. Yang for quaternion-K\\\"ahler manifolds. We show\nthat non-negative quaternionic bisectional curvature is only realized for the\nquaternionic projective space. We also show that all symmetric\nquaternion-K\\\"ahler manifolds different from the quaternionic projective space\nadmit quaternionic lines of negative quaternionic bisectional curvature. In\nparticular this implies that non-negative sectional curvature does not imply\nnon-negative quaternionic bisectional curvature. Moreover we give a new and\nrather short proof of a classification result by A. Gray on compact K\\\"ahler\nmanifolds of non-negative sectional curvature.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:21:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Macia","Oscar",""],["Semmelmann","Uwe",""],["Weingart","Gregor",""]]}
{"id":"2308.09174","submitter":"Fabio Duvan Lora Clavijo","authors":"German D. Prada-M\\'endez, F. D. Lora-Clavijo and J. M.\n  Vel\\'asquez-Cadavid","title":"Synchrotron emitting Komissarov torus around naked singularities","comments":"27 pages, 9 figures. Accepted for publication in Classical and\n  Quantum Gravity","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  From a theoretical perspective, matter accretion processes around compact\nobjects are highly relevant as they serve as a natural laboratory to test\ngeneral relativity in the strong field regime. This enables us to validate\nfundamental concepts such as the no-hair theorem, the cosmic censorship\nhypothesis, and the existence of alternative solutions to Einstein's equations\nthat mimic the effects of black holes. In this study, we analyze the emission\nspectra of geometrically thick accretion disks, referred to as Polish\ndoughnuts, around naked singularities described by the $q$-metric. To begin, we\nrevisit the construction of equilibrium configurations of magnetized tori in\nthis spacetime and evaluate the role of the deformation parameter over these\nconfigurations. Once we have systematically studied the disks in this\nspacetime, we use the \\texttt{OSIRIS} code to perform a backward ray-tracing\nmethod, resulting in the first simulations of the intensity map and emission\nprofiles of magnetized tori within this metric. Furthermore, we validate the\neffect of both the quadrupole moment and the angular momentum on observable\nquantities such as flux and intensity for optically thin and thick disks, since\nfor values of $ q < 0$, which correspond to objects with prolate deformation,\nand which in turn, are constructed with higher values of angular momentum, the\nemission spectrum exhibits higher intensity than that obtained for\nSchwarzschild's spacetime. Hence, we find a first differential feature that\ndistinguishes tori formed around naked singularities from those around static\nblack holes.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:24:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Prada-M\u00e9ndez","German D.",""],["Lora-Clavijo","F. D.",""],["Vel\u00e1squez-Cadavid","J. M.",""]]}
{"id":"2308.09175","submitter":"Tom Zahavy","authors":"Tom Zahavy, Vivek Veeriah, Shaobo Hou, Kevin Waugh, Matthew Lai,\n  Edouard Leurent, Nenad Tomasev, Lisa Schut, Demis Hassabis, and Satinder\n  Singh","title":"Diversifying AI: Towards Creative Chess with AlphaZero","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":"  In recent years, Artificial Intelligence (AI) systems have surpassed human\nintelligence in a variety of computational tasks. However, AI systems, like\nhumans, make mistakes, have blind spots, hallucinate, and struggle to\ngeneralize to new situations. This work explores whether AI can benefit from\ncreative decision-making mechanisms when pushed to the limits of its\ncomputational rationality. In particular, we investigate whether a team of\ndiverse AI systems can outperform a single AI in challenging tasks by\ngenerating more ideas as a group and then selecting the best ones. We study\nthis question in the game of chess, the so-called drosophila of AI. We build on\nAlphaZero (AZ) and extend it to represent a league of agents via a\nlatent-conditioned architecture, which we call AZ_db. We train AZ_db to\ngenerate a wider range of ideas using behavioral diversity techniques and\nselect the most promising ones with sub-additive planning. Our experiments\nsuggest that AZ_db plays chess in diverse ways, solves more puzzles as a group\nand outperforms a more homogeneous team. Notably, AZ_db solves twice as many\nchallenging puzzles as AZ, including the challenging Penrose positions. When\nplaying chess from different openings, we notice that players in AZ_db\nspecialize in different openings, and that selecting a player for each opening\nusing sub-additive planning results in a 50 Elo improvement over AZ. Our\nfindings suggest that diversity bonuses emerge in teams of AI agents, just as\nthey do in teams of humans and that diversity is a valuable asset in solving\ncomputationally hard problems.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:27:33 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 20:33:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zahavy","Tom",""],["Veeriah","Vivek",""],["Hou","Shaobo",""],["Waugh","Kevin",""],["Lai","Matthew",""],["Leurent","Edouard",""],["Tomasev","Nenad",""],["Schut","Lisa",""],["Hassabis","Demis",""],["Singh","Satinder",""]]}
{"id":"2308.09176","submitter":"Margret Westerkamp","authors":"Margret Westerkamp, Vincent Eberle, Matteo Guardiani, Philipp Frank,\n  Lukas Platz, Philipp Arras, Jakob Knollm\\\"uller, Julia Stadler, Torsten\n  En{\\ss}lin","title":"First spatio-spectral Bayesian imaging of SN1006 in X-ray","comments":null,"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":"  Supernovae are an important source of energy in the interstellar medium.\nYoung remnants of supernovae have a peak emission in the X-ray region, making\nthem interesting objects for X-ray observations. In particular, the supernova\nremnant SN1006 is of great interest due to its historical record, proximity and\nbrightness. It has therefore been studied by several X-ray telescopes.\nImproving the X-ray imaging of this and other remnants is important but\nchallenging as it requires to address a spatially varying instrument response\nin order to achieve a high signal-to-noise ratio. Here, we use Chandra\nobservations to demonstrate the capabilities of Bayesian image reconstruction\nusing information field theory. Our objective is to reconstruct denoised,\ndeconvolved and spatio-spectral resolved images from X-ray observations and to\ndecompose the emission into different morphologies, namely diffuse and\npoint-like. Further, we aim to fuse data from different detectors and pointings\ninto a mosaic and quantify the uncertainty of our result. Utilizing prior\nknowledge on the spatial and spectral correlation structure of the two\ncomponents, diffuse emission and point sources, the presented method allows the\neffective decomposition of the signal into these. In order to accelerate the\nimaging process, we introduce a multi-step approach, in which the spatial\nreconstruction obtained for a single energy range is used to derive an informed\nstarting point for the full spatio-spectral reconstruction. The method is\napplied to 11 Chandra observations of SN1006 from 2008 and 2012, providing a\ndetailed, denoised and decomposed view of the remnant. In particular, the\nseparated view of the diffuse emission should provide new insights into its\ncomplex small-scale structures in the center of the remnant and at the shock\nfront profiles.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:28:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Westerkamp","Margret",""],["Eberle","Vincent",""],["Guardiani","Matteo",""],["Frank","Philipp",""],["Platz","Lukas",""],["Arras","Philipp",""],["Knollm\u00fcller","Jakob",""],["Stadler","Julia",""],["En\u00dflin","Torsten",""]]}
{"id":"2308.09177","submitter":"Zhanibek Rysbek","authors":"Zhanibek Rysbek, Ki Hwan Oh and Milos Zefran","title":"Recognizing Intent in Collaborative Manipulation","comments":null,"journal-ref":null,"doi":"10.1145/3577190.3614174","report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collaborative manipulation is inherently multimodal, with haptic\ncommunication playing a central role. When performed by humans, it involves\nback-and-forth force exchanges between the participants through which they\nresolve possible conflicts and determine their roles. Much of the existing work\non collaborative human-robot manipulation assumes that the robot follows the\nhuman. But for a robot to match the performance of a human partner it needs to\nbe able to take initiative and lead when appropriate. To achieve such\nhuman-like performance, the robot needs to have the ability to (1) determine\nthe intent of the human, (2) clearly express its own intent, and (3) choose its\nactions so that the dyad reaches consensus. This work proposes a framework for\nrecognizing human intent in collaborative manipulation tasks using force\nexchanges. Grounded in a dataset collected during a human study, we introduce a\nset of features that can be computed from the measured signals and report the\nresults of a classifier trained on our collected human-human interaction data.\nTwo metrics are used to evaluate the intent recognizer: overall accuracy and\nthe ability to correctly identify transitions. The proposed recognizer shows\nrobustness against the variations in the partner's actions and the confounding\neffects due to the variability in grasp forces and dynamic effects of walking.\nThe results demonstrate that the proposed recognizer is well-suited for\nimplementation in a physical interaction control scheme.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:31:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rysbek","Zhanibek",""],["Oh","Ki Hwan",""],["Zefran","Milos",""]]}
{"id":"2308.09178","submitter":"M\\'arcio Eduardo Da Silva Alves","authors":"M\\'arcio E.S. Alves","title":"Testing gravity with gauge-invariant polarization states of\n  gravitational waves","comments":"27 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The determination of the polarization modes of gravitational waves (GWs), and\nof their dispersion relations is decisive to scrutinize the viability of\nextended theories of gravity. A tool to investigate the polarization states of\nGWs is the Newman-Penrose (NP) formalism. However, if the speed of GWs is\nsmaller than the speed of light, the number of NP variables is greater than the\nnumber of polarizations. To overpass this inconvenience we use the Bardeen\nformalism to describe the six possible polarization modes of GWs considering\ndifferent general dispersion relations for the modes. The definition of a new\ngauge-invariant quantity enables an unambiguous description of the scalar\nlongitudinal polarization mode. We apply the formalism to General Relativity,\nscalar-tensor theories, and $f(R)$-gravity. To obtain a bridge between theory\nand experiment, we derive an explicit relation between a physical observable\n(the derivative of the frequency shift of an electromagnetic signal) with the\ngauge-invariant variables. From this relation, we find an analytical formula\nfor the Pulsar Timing rms response to each polarization mode. To estimate the\nsensitivity of a single Pulsar Timing we focus on the case of a dispersion\nrelation of a massive particle. The sensitivity curves of the scalar\nlongitudinal and vector polarization modes change significantly depending on\nthe value of the effective mass. The detection (or absence of detection) of the\npolarization modes using the Pulsar Timing technique has decisive implications\nfor alternative theories of gravity. Finally, the investigation of a cutoff\nfrequency in the Pulsar Timing band can lead to a more stringent bound on the\ngraviton mass than that presented by ground-based interferometers.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:33:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alves","M\u00e1rcio E. S.",""]]}
{"id":"2308.09179","submitter":"Jean-Pierre Sleiman","authors":"Jean-Pierre Sleiman, Farbod Farshidian, and Marco Hutter","title":"Versatile Multi-Contact Planning and Control for Legged\n  Loco-Manipulation","comments":null,"journal-ref":"Science Robotics, 16 Aug 2023, Vol 8, Issue 81","doi":"10.1126/scirobotics.adg5014","report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Loco-manipulation planning skills are pivotal for expanding the utility of\nrobots in everyday environments. These skills can be assessed based on a\nsystem's ability to coordinate complex holistic movements and multiple contact\ninteractions when solving different tasks. However, existing approaches have\nbeen merely able to shape such behaviors with hand-crafted state machines,\ndensely engineered rewards, or pre-recorded expert demonstrations. Here, we\npropose a minimally-guided framework that automatically discovers whole-body\ntrajectories jointly with contact schedules for solving general\nloco-manipulation tasks in pre-modeled environments. The key insight is that\nmulti-modal problems of this nature can be formulated and treated within the\ncontext of integrated Task and Motion Planning (TAMP). An effective bilevel\nsearch strategy is achieved by incorporating domain-specific rules and\nadequately combining the strengths of different planning techniques: trajectory\noptimization and informed graph search coupled with sampling-based planning. We\nshowcase emergent behaviors for a quadrupedal mobile manipulator exploiting\nboth prehensile and non-prehensile interactions to perform real-world tasks\nsuch as opening/closing heavy dishwashers and traversing spring-loaded doors.\nThese behaviors are also deployed on the real system using a two-layer\nwhole-body tracking controller.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:35:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sleiman","Jean-Pierre",""],["Farshidian","Farbod",""],["Hutter","Marco",""]]}
{"id":"2308.09180","submitter":"Gregory Holste","authors":"Gregory Holste, Ziyu Jiang, Ajay Jaiswal, Maria Hanna, Shlomo\n  Minkowitz, Alan C. Legasto, Joanna G. Escalon, Sharon Steinberger, Mark\n  Bittman, Thomas C. Shen, Ying Ding, Ronald M. Summers, George Shih, Yifan\n  Peng, and Zhangyang Wang","title":"How Does Pruning Impact Long-Tailed Multi-Label Medical Image\n  Classifiers?","comments":"Early accepted to MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pruning has emerged as a powerful technique for compressing deep neural\nnetworks, reducing memory usage and inference time without significantly\naffecting overall performance. However, the nuanced ways in which pruning\nimpacts model behavior are not well understood, particularly for long-tailed,\nmulti-label datasets commonly found in clinical settings. This knowledge gap\ncould have dangerous implications when deploying a pruned model for diagnosis,\nwhere unexpected model behavior could impact patient well-being. To fill this\ngap, we perform the first analysis of pruning's effect on neural networks\ntrained to diagnose thorax diseases from chest X-rays (CXRs). On two large CXR\ndatasets, we examine which diseases are most affected by pruning and\ncharacterize class \"forgettability\" based on disease frequency and\nco-occurrence behavior. Further, we identify individual CXRs where uncompressed\nand heavily pruned models disagree, known as pruning-identified exemplars\n(PIEs), and conduct a human reader study to evaluate their unifying qualities.\nWe find that radiologists perceive PIEs as having more label noise, lower image\nquality, and higher diagnosis difficulty. This work represents a first step\ntoward understanding the impact of pruning on model behavior in deep\nlong-tailed, multi-label medical image classification. All code, model weights,\nand data access instructions can be found at\nhttps://github.com/VITA-Group/PruneCXR.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:40:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Holste","Gregory",""],["Jiang","Ziyu",""],["Jaiswal","Ajay",""],["Hanna","Maria",""],["Minkowitz","Shlomo",""],["Legasto","Alan C.",""],["Escalon","Joanna G.",""],["Steinberger","Sharon",""],["Bittman","Mark",""],["Shen","Thomas C.",""],["Ding","Ying",""],["Summers","Ronald M.",""],["Shih","George",""],["Peng","Yifan",""],["Wang","Zhangyang",""]]}
{"id":"2308.09181","submitter":"Stefan Tirkas","authors":"Scott E. Parker, Calder Haubrich, Qiheng Cai, Stefan Tirkas and Yang\n  Chen","title":"Comparison of saturation rules used for gyrokinetic quasilinear\n  transport modeling","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Theory-based transport modeling has been widely successful and is built on\nthe foundations of quasilinear theory. Specifically, the quasilinear expression\nof the flux can be used in combination with a saturation rule for the toroidal\nmode amplitude. Most transport models follow this approach. Saturation rules\nare heuristic and difficult to rigorously derive. We compare three common\nsaturation rules using a fairly accurate quasilinear expression for the fluxes\ncomputed using local linear gyrokinetic simulation. We take plasma parameters\nfrom experimental H-mode profiles and magnetic equilibrium and include\nelectrons, Deuterium, and Carbon species. We find that the various saturation\nrules give qualitatively similar behavior. This may help explain why the\ndifferent theory-based transport models can all predict core tokamak profiles\nreasonably well. Comparisons with nonlinear local and global gyrokinetic\nsimulations are also discussed.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:43:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Parker","Scott E.",""],["Haubrich","Calder",""],["Cai","Qiheng",""],["Tirkas","Stefan",""],["Chen","Yang",""]]}
{"id":"2308.09182","submitter":"C\\'esar Augusto Caretta","authors":"C\\'esar A. Caretta, Heinz Andernach, Marcel Chow-Mart\\'inez, Roger\n  Coziol, Juan De Anda-Su\\'arez, C\\'esar Hern\\'andez-Aguayo, Juan M.\n  Islas-Islas, M\\'onica M. Mireles-Vidales, Miguel A. Mu\\~niz-Torres, Humberto\n  Santoyo-Ruiz, Josu\\'e J. Trejo-Alonso, Yoganarasimhan Venkatapathy, and Johan\n  M. Z\\'u\\~niga","title":"Tracing the assembly histories of galaxy clusters in the nearby universe","comments":"Contains 33 pages, 12 figures, 8 tables. On the accompanying webpage\n  ( http://www.astro.ugto.mx/recursos/HP_SCls/Top70.html ), we offer the\n  complete set of figures describing all clusters presented in this article","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":"  We have compiled a sample of 67 nearby ($z$ < 0.15) clusters of galaxies, for\nwhich on average more than 150 spectroscopic members are available, and, by\napplying different methods to detect substructures in their galaxy\ndistribution, we have studied their assembly history. Our analysis confirms\nthat substructures are present in 70% of our sample, having a significant\ndynamical impact in 57% of them. A classification of the assembly state of the\nclusters based on the dynamical significance of their substructures is\nproposed. In 19% of our clusters, the originally identified brightest cluster\ngalaxy is not the central gravitationally dominant galaxy (CDG), but turns out\nto be either the second-rank, or the dominant galaxy of a substructure (a SDG,\nin our classification), or even a possible \"fossil\" galaxy in the periphery of\nthe cluster. Moreover, no correlation was found in general between the\nprojected offset of the CDG from the X-ray peak and its peculiar velocity. The\ncomparison of the CDGs properties with the assembly states and dynamical state\nof the intracluster media, especially the core cooling status, suggests a\ncomplex assembly history, with clear evidence of co-evolution of the CDG and\nits host cluster in the innermost regions.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:47:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Caretta","C\u00e9sar A.",""],["Andernach","Heinz",""],["Chow-Mart\u00ednez","Marcel",""],["Coziol","Roger",""],["De Anda-Su\u00e1rez","Juan",""],["Hern\u00e1ndez-Aguayo","C\u00e9sar",""],["Islas-Islas","Juan M.",""],["Mireles-Vidales","M\u00f3nica M.",""],["Mu\u00f1iz-Torres","Miguel A.",""],["Santoyo-Ruiz","Humberto",""],["Trejo-Alonso","Josu\u00e9 J.",""],["Venkatapathy","Yoganarasimhan",""],["Z\u00fa\u00f1iga","Johan M.",""]]}
{"id":"2308.09183","submitter":"Laura Plein","authors":"Mika Beckerich, Laura Plein, Sergio Coronado","title":"RatGPT: Turning online LLMs into Proxies for Malware Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The evolution of Generative AI and the capabilities of the newly released\nLarge Language Models (LLMs) open new opportunities in software engineering.\nHowever, they also lead to new challenges in cybersecurity. Recently,\nresearchers have shown the possibilities of using LLMs such as ChatGPT to\ngenerate malicious content that can directly be exploited or guide\ninexperienced hackers to weaponize tools and code. Those studies covered\nscenarios that still require the attacker in the middle of the loop. In this\nstudy, we leverage openly available plugins and use an LLM as proxy between the\nattacker and the victim. We deliver a proof-of-concept where ChatGPT is used\nfor the dissemination of malicious software while evading detection, alongside\nestablishing the communication to a command and control (C2) server to receive\ncommands to interact with a victim's system. Finally, we present the general\napproach as well as essential elements in order to stay undetected and make the\nattack a success. This proof-of-concept highlights significant cybersecurity\nissues with openly available plugins and LLMs, which require the development of\nsecurity guidelines, controls, and mitigation strategies.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:54:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beckerich","Mika",""],["Plein","Laura",""],["Coronado","Sergio",""]]}
{"id":"2308.09184","submitter":"Csaba Fabri","authors":"Csaba F\\'abri, G\\'abor J. Hal\\'asz, Lorenz S. Cederbaum, \\'Agnes\n  Vib\\'ok","title":"Impact of Cavity on Molecular Ionization Spectra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ionization phenomena are widely studied for decades. With the advent of\ncavity technology, the question arises how the presence of quantum light\naffects the ionization of molecules. As the ionization spectrum is recorded\nfrom the ground state of the neutral molecule, it is usually possible to choose\ncavities which do not change the ground state of the target, but can have a\nsignificant impact on the ion and the ionization spectrum. Particularly\ninteresting are cases where the produced ion exhibits conical intersections\nbetween its close-lying electronic states which is known to give rise to\nsubstantial nonadiabatic effects. We demonstrate by an explicit realistic\nexample that vibrational modes not relevant in the absence of the cavity do\nplay a decisive role when the molecule is in the cavity. In this example,\ndynamical symmetry breaking is responsible for the coupling between the ion and\nthe cavity and the high spatial symmetry enables a control of their activity\nvia the molecular orientation relative to the cavity field polarization.\nSignificant impact on the spectrum by the cavity is found and shown to even\nsubstantially increase when less symmetric molecules are considered.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:08:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["F\u00e1bri","Csaba",""],["Hal\u00e1sz","G\u00e1bor J.",""],["Cederbaum","Lorenz S.",""],["Vib\u00f3k","\u00c1gnes",""]]}
{"id":"2308.09185","submitter":"Runtian Zhou","authors":"Ervin Gy\\H{o}ri, Alan Li, Runtian Zhou","title":"The planar Tur\\'an number of $\\{K_4,C_5\\}$ and $\\{K_4,C_6\\}$","comments":"11 pages, 11 figures. arXiv admin note: text overlap with\n  arXiv:2307.06909","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\mathcal{H}$ be a set of graphs. The planar Tur\\'an number,\n$ex_\\mathcal{P}(n,\\mathcal{H})$, is the maximum number of edges in an\n$n$-vertex planar graph which does not contain any member of $\\mathcal{H}$ as a\nsubgraph. When $\\mathcal{H}=\\{H\\}$ has only one element, we usually write\n$ex_\\mathcal{P}(n,H)$ instead. The topic of extremal planar graphs was\ninitiated by Dowden (2016). He obtained sharp upper bound for both\n$ex_\\mathcal{P}(n,C_5)$ and $ex_\\mathcal{P}(n,K_4)$. Later on, we obtained\nsharper bound for $ex_\\mathcal{P}(n,\\{K_4,C_7\\})$. In this paper, we give upper\nbounds of $ex_\\mathcal{P}(n,\\{K_4,C_5\\})\\leq {15\\over 7}(n-2)$ and\n$ex_\\mathcal{P}(n,\\{K_4,C_6\\})\\leq {7\\over 3}(n-2)$. We also give constructions\nwhich show the bounds are tight for infinitely many graphs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:08:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gy\u0151ri","Ervin",""],["Li","Alan",""],["Zhou","Runtian",""]]}
{"id":"2308.09186","submitter":"Yuguang Duan","authors":"Yuguang Duan, Zi Lin, Weiwei Sun","title":"Is Argument Structure of Learner Chinese Understandable: A Corpus-Based\n  Analysis","comments":"Proceedings of the 2018 International Conference on Bilingual\n  Learning and Teaching (ICBLT-2018)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a corpus-based analysis of argument structure errors in\nlearner Chinese. The data for analysis includes sentences produced by language\nlearners as well as their corrections by native speakers. We couple the data\nwith semantic role labeling annotations that are manually created by two senior\nstudents whose majors are both Applied Linguistics. The annotation procedure is\nguided by the Chinese PropBank specification, which is originally developed to\ncover first language phenomena. Nevertheless, we find that it is quite\ncomprehensive for handling second language phenomena. The inter-annotator\nagreement is rather high, suggesting the understandability of learner texts to\nnative speakers. Based on our annotations, we present a preliminary analysis of\ncompetence errors related to argument structure. In particular, speech errors\nrelated to word order, word selection, lack of proposition, and\nargument-adjunct confounding are discussed.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:10:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Duan","Yuguang",""],["Lin","Zi",""],["Sun","Weiwei",""]]}
{"id":"2308.09187","submitter":"Ali Ramezani-Kebrya","authors":"Ali Ramezani-Kebrya and Kimon Antonakopoulos and Igor Krawczuk and\n  Justin Deschenaux and Volkan Cevher","title":"Distributed Extra-gradient with Optimal Complexity and Communication\n  Guarantees","comments":"International Conference on Learning Representations (ICLR 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider monotone variational inequality (VI) problems in multi-GPU\nsettings where multiple processors/workers/clients have access to local\nstochastic dual vectors. This setting includes a broad range of important\nproblems from distributed convex minimization to min-max and games.\nExtra-gradient, which is a de facto algorithm for monotone VI problems, has not\nbeen designed to be communication-efficient. To this end, we propose a\nquantized generalized extra-gradient (Q-GenX), which is an unbiased and\nadaptive compression method tailored to solve VIs. We provide an adaptive\nstep-size rule, which adapts to the respective noise profiles at hand and\nachieve a fast rate of ${\\mathcal O}(1/T)$ under relative noise, and an\norder-optimal ${\\mathcal O}(1/\\sqrt{T})$ under absolute noise and show\ndistributed training accelerates convergence. Finally, we validate our\ntheoretical results by providing real-world experiments and training generative\nadversarial networks on multiple GPUs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:15:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ramezani-Kebrya","Ali",""],["Antonakopoulos","Kimon",""],["Krawczuk","Igor",""],["Deschenaux","Justin",""],["Cevher","Volkan",""]]}
{"id":"2308.09188","submitter":"Rolf Binder","authors":"R. Binder, J.S. Schaibley, N.H. Kwong","title":"Non-Hermitian dispersion sign reversal of radiative resonances in two\n  dimensions","comments":null,"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":"  In a recent publication [Wurdack et al., Nat. Comm. 14:1026 (2023)], it was\nshown that in microcavities containing atomically thin semiconductors\nnon-Hermitian quantum mechanics can lead to negative exciton polariton masses.\nWe show that mass-sign reversal can occur generally in radiative resonances in\ntwo dimensions (without cavity) and derive conditions for it (critical\ndephasing threshold etc.). In monolayer transition-metal dichalcogenides, this\nphenomenon is not invalidated by the strong electron-hole exchange interaction,\nwhich is known to make the exciton massless.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:24:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Binder","R.",""],["Schaibley","J. S.",""],["Kwong","N. H.",""]]}
{"id":"2308.09189","submitter":"Ivan Ovinnikov","authors":"Ivan Ovinnikov, Joachim M. Buhmann","title":"Regularizing Adversarial Imitation Learning Using Causal Invariance","comments":"Published at the ICML 2023 Workshop on Spurious Correlations,\n  Invariance, and Stability","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Imitation learning methods are used to infer a policy in a Markov decision\nprocess from a dataset of expert demonstrations by minimizing a divergence\nmeasure between the empirical state occupancy measures of the expert and the\npolicy. The guiding signal to the policy is provided by the discriminator used\nas part of an versarial optimization procedure. We observe that this model is\nprone to absorbing spurious correlations present in the expert data. To\nalleviate this issue, we propose to use causal invariance as a regularization\nprinciple for adversarial training of these models. The regularization\nobjective is applicable in a straightforward manner to existing adversarial\nimitation frameworks. We demonstrate the efficacy of the regularized\nformulation in an illustrative two-dimensional setting as well as a number of\nhigh-dimensional robot locomotion benchmark tasks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:24:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ovinnikov","Ivan",""],["Buhmann","Joachim M.",""]]}
{"id":"2308.09190","submitter":"Tamir Shaqarin","authors":"T. Shaqarin, Mahmoud M. S. Al-Suod","title":"Linear Parameter Varying Power Regulation of Variable Speed Pitch\n  Manipulated Wind Turbine in the Full Load Regime","comments":"12 pages, 10 figures","journal-ref":"WSEAS TRANSACTIONS on SYSTEMS and CONTROL Volume 17. 2022","doi":"10.37394/23203.2022.17.57","report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a wind energy conversion system (WECS), changing the pitch angle of the\nwind turbine blades is a typical practice to regulate the electrical power\ngeneration in the full-load regime. Due to the turbulent nature of the wind and\nthe large variations of the mean wind speed during the day, the rotary elements\nof the WECS are subjected to significant mechanical stresses and fatigue,\nresulting in conceivably mechanical failures and higher maintenance costs.\nConsequently, it is imperative to design a control system capable of handling\ncontinuous wind changes. In this work, Linear Parameter Varying (LPV) H_inf\ncontroller is used to cope with wind variations and turbulent winds with a\nturbulence intensity greater than 10%. The proposed controller is designed to\nregulate the rotational rotor speed and generator torque, thus, regulating the\noutput power via pitch angle manipulations. In addition, a PI-Fuzzy control\nsystem is designed to be compared with the proposed control system. The\nclosed-loop simulations of both controllers established the robustness and\nstability of the suggested LPV controller under large wind velocity variations,\nwith minute power fluctuations compared to the PI-Fuzzy controller. The results\nshow that in the presence of turbulent wind speed variations, the proposed LPV\ncontroller achieves improved transient and steady-state performance along with\nreduced mechanical loads in the above-rated wind speed region.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:26:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shaqarin","T.",""],["Al-Suod","Mahmoud M. S.",""]]}
{"id":"2308.09191","submitter":"Jiajian Liang","authors":"Qian-Ping Gu and Jiajian Leo Liang","title":"Algorithms and Computational Study on a Transportation System\n  Integrating Public Transit and Ridesharing of Personal Vehicles","comments":"44 pages, 11 figures. arXiv admin note: substantial text overlap with\n  arXiv:2106.00232","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The potential of integrating public transit with ridesharing includes shorter\ntravel time for commuters and higher occupancy rate of personal vehicles and\npublic transit ridership. In this paper, we describe a centralized transit\nsystem that integrates public transit and ridesharing to reduce travel time for\ncommuters. In the system, a set of ridesharing providers (drivers) and a set of\npublic transit riders are received. The optimization goal of the system is to\nassign riders to drivers by arranging public transit and ridesharing combined\nroutes subject to shorter commuting time for as many riders as possible. We\ngive an exact algorithm, which is an ILP formulation based on a hypergraph\nrepresentation of the problem. By using the ILP and the hypergraph, we give\napproximation algorithms based on LP-rounding and hypergraph matching/weighted\nset packing, respectively. As a case study, we conduct an extensive\ncomputational study based on real-world public transit dataset and ridesharing\ndataset in Chicago city. To evaluate the effectiveness of the transit system\nand our algorithms, we generate data instances from the datasets. The\nexperimental results show that more than 60% of riders are assigned to drivers\non average, riders' commuting time is reduced by 23% and vehicle occupancy rate\nis improved to almost 3. Our proposed algorithms are efficient for practical\nscenarios.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:28:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gu","Qian-Ping",""],["Liang","Jiajian Leo",""]]}
{"id":"2308.09192","submitter":"Michael Widom","authors":"Michael Widom and Marek Mihalkovic","title":"Quasicrystal structure prediction: A review","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":"  Predicting quasicrystal structures is a multifaceted problem that can involve\npredicting a previously unknown phase, predicting the structure of an\nexperimentally observed phase, or predicting the thermodynamic stability of a\ngiven structure. We survey the history and current state of these prediction\nefforts with a focus on methods that have improved our understanding of the\nstructure and stability of known metallic quasicrystal phases. Advances in the\nstructural modeling of quasicrystals, along with first principles total energy\ncalculation and statistical mechanical methods that enable the calculation of\nquasicrystal thermodynamic stability, are illustrated by means of cited\nexamples of recent work.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:31:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Widom","Michael",""],["Mihalkovic","Marek",""]]}
{"id":"2308.09193","submitter":"Avinash Patil","authors":"Avinash Patil, Kihwan Han, Sabyasachi Mukhopadhyay","title":"A Comparative Study of Text Embedding Models for Semantic Text\n  Similarity in Bug Reports","comments":"7 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bug reports are an essential aspect of software development, and it is\ncrucial to identify and resolve them quickly to ensure the consistent\nfunctioning of software systems. Retrieving similar bug reports from an\nexisting database can help reduce the time and effort required to resolve bugs.\nIn this paper, we compared the effectiveness of semantic textual similarity\nmethods for retrieving similar bug reports based on a similarity score. We\nexplored several embedding models such as TF-IDF (Baseline), FastText, Gensim,\nBERT, and ADA. We used the Software Defects Data containing bug reports for\nvarious software projects to evaluate the performance of these models. Our\nexperimental results showed that BERT generally outperformed the rest of the\nmodels regarding recall, followed by ADA, Gensim, FastText, and TFIDF. Our\nstudy provides insights into the effectiveness of different embedding methods\nfor retrieving similar bug reports and highlights the impact of selecting the\nappropriate one for this task. Our code is available on GitHub.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:36:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Patil","Avinash",""],["Han","Kihwan",""],["Mukhopadhyay","Sabyasachi",""]]}
{"id":"2308.09194","submitter":"Qiaoren Wang","authors":"Hyung S. Choi, Ye Jin Han, Collin Kessinger, Qiaoren Wang","title":"Quantum Key Distribution using Expectation Values of Super-classical GHZ\n  States","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new quantum key distribution scheme that is based on the optimum\nexpectation values of maximally entangled Greenberger-Horne-Zeilinger states.\nOur protocol makes use of the degrees of freedom in continuously variable\nangles, thereby increasing the security of the key distribution. Outlined are\ntwo protocols that distribute a key from Alice to Bob using the above idea,\nfollowed by an extension that allows for the same key to be shared with\nCharlie. We show how this scheme provides for certain detection of any\neavesdropper through absolute violation rather than the probabilistic violation\nused in many protocols.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:40:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Choi","Hyung S.",""],["Han","Ye Jin",""],["Kessinger","Collin",""],["Wang","Qiaoren",""]]}
{"id":"2308.09195","submitter":"Anush Lakshman Sivaraman","authors":"S. Anush Lakshman, S. Akash, J. Cynthia, R. Gautam, D. Ebenezer","title":"Architecture and Applications of IoT Devices in Socially Relevant Fields","comments":"17","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.SE cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Number of IoT enabled devices are being tried and introduced every year and\nthere is a healthy competition among researched and businesses to capitalize\nthe space created by IoT, as these devices have a great market potential.\nDepending on the type of task involved and sensitive nature of data that the\ndevice handles, various IoT architectures, communication protocols and\ncomponents are chosen and their performance is evaluated. This paper reviews\nsuch IoT enabled devices based on their architecture, communication protocols\nand functions in few key socially relevant fields like health care, farming,\nfirefighting, women/individual safety/call for help/harm alert, home\nsurveillance and mapping as these fields involve majority of the general\npublic. It can be seen, to one's amazement, that already significant number of\ndevices are being reported on these fields and their performance is promising.\nThis paper also outlines the challenges involved in each of these fields that\nrequire solutions to make these devices reliable\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:43:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lakshman","S. Anush",""],["Akash","S.",""],["Cynthia","J.",""],["Gautam","R.",""],["Ebenezer","D.",""]]}
{"id":"2308.09196","submitter":"Olivier Caron-Grenier","authors":"Olivier Caron-Grenier, Jonathan Poree, Vincent Perrot, Gerardo\n  Ramos-Palacio, Abbas F Sadikot and Jean Provost","title":"Ergodic encoding for single-element ultrasound imaging in vivo","comments":"5 pages, 4 figures, Letter","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conventional ultrasound imaging relies on the computation of geometric time\ndelay from multiple sensors to detect the position of a scatterer. In this\npaper, we present Ergodic Relay Ultrasound Imaging (ERUI), a method that\nutilizes an ergodic cavity down to a single ultrasonic sensor for ultrasound\nimaging. With the proposed method, the ergodic cavity creates a unique temporal\nsignature that encodes the position of a scatterer. When compared to standard\napproaches, ERUI enables the generation of images of comparable quality while\nutilizing fewer detector elements. Our results suggest that ERUI has the\npotential to achieve image resolution similar to that of traditional imaging\ntechniques, shifting the complexity from hardware to sofware. The demonstrated\nfeasibility offers a promising path towards ultrasound probes with reduced\ncosts and complexity for more portable scanning devices.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:49:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Caron-Grenier","Olivier",""],["Poree","Jonathan",""],["Perrot","Vincent",""],["Ramos-Palacio","Gerardo",""],["Sadikot","Abbas F",""],["Provost","Jean",""]]}
{"id":"2308.09197","submitter":"Harald Andres Helfgott","authors":"Jitendra Bajpai, Daniele Dona and Harald Andr\\'es Helfgott","title":"New dimensional estimates for subvarieties of linear algebraic groups","comments":"35 pages. Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.AG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For every connected, almost simple linear algebraic group\n$G\\leq\\mathrm{GL}_{n}$ over a large enough field $K$, every subvariety\n$V\\subseteq G$, and every finite generating set $A\\subseteq G(K)$, we prove a\ngeneral {\\em dimensional bound}, that is, a bound of the form $$|A\\cap\nV(\\overline{K})|\\leq C_{1}|A^{C_{2}}|^{\\frac{\\dim(V)}{\\dim(G)}}$$ with\n$C_{1},C_{2}$ depending only on $n,\\mathrm{deg}(V)$. The dependence of $C_1$ on\n$n$ (or rather on $\\dim V$) is doubly exponential, whereas $C_2$ (which is\nindependent of $\\mathrm{deg}(V)$) depends simply exponentially on $n$.\n  Bounds of this form have proved useful in the study of growth in linear\nalgebraic groups since 2005 (Helfgott) and, before then, in the study of\nsubgroup structure (Larsen-Pink: $A$ a subgroup). In bounds for general $V$ and\n$G$ available before our work, the dependence of $C_1$ and $C_2$ on $n$ was of\nexponential-tower type.\n  We draw immediate consequences regarding diameter bounds for classical\nChevalley groups $G(\\mathbb{F}_{q})$. (In a separate paper, we derive stronger\ndiameter bounds from stronger dimensional bounds we prove for specific families\nof varieties $V$.)\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 21:54:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bajpai","Jitendra",""],["Dona","Daniele",""],["Helfgott","Harald Andr\u00e9s",""]]}
{"id":"2308.09198","submitter":"Mehdi Azabou","authors":"Mehdi Azabou, Venkataramana Ganesh, Shantanu Thakoor, Chi-Heng Lin,\n  Lakshmi Sathidevi, Ran Liu, Michal Valko, Petar Veli\\v{c}kovi\\'c, Eva L. Dyer","title":"Half-Hop: A graph upsampling approach for slowing down message passing","comments":"Published as a conference paper at ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Message passing neural networks have shown a lot of success on\ngraph-structured data. However, there are many instances where message passing\ncan lead to over-smoothing or fail when neighboring nodes belong to different\nclasses. In this work, we introduce a simple yet general framework for\nimproving learning in message passing neural networks. Our approach essentially\nupsamples edges in the original graph by adding \"slow nodes\" at each edge that\ncan mediate communication between a source and a target node. Our method only\nmodifies the input graph, making it plug-and-play and easy to use with existing\nmodels. To understand the benefits of slowing down message passing, we provide\ntheoretical and empirical analyses. We report results on several supervised and\nself-supervised benchmarks, and show improvements across the board, notably in\nheterophilic conditions where adjacent nodes are more likely to have different\nlabels. Finally, we show how our approach can be used to generate augmentations\nfor self-supervised learning, where slow nodes are randomly introduced into\ndifferent edges in the graph to generate multi-scale views with variable path\nlengths.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:24:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Azabou","Mehdi",""],["Ganesh","Venkataramana",""],["Thakoor","Shantanu",""],["Lin","Chi-Heng",""],["Sathidevi","Lakshmi",""],["Liu","Ran",""],["Valko","Michal",""],["Veli\u010dkovi\u0107","Petar",""],["Dyer","Eva L.",""]]}
{"id":"2308.09199","submitter":"Apollo Albright","authors":"Apollo Albright, Boris Gelfand, Michael Dixon","title":"Polynomial Bounds for Learning Noisy Optical Physical Unclonable\n  Functions and Connections to Learning With Errors","comments":"10 pages, 2 figures, submitted to IEEE Transactions on Information\n  Forensics and Security","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29328","categories":"cs.LG cs.CR physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is shown that a class of optical physical unclonable functions (PUFs) can\nbe learned to arbitrary precision with arbitrarily high probability, even in\nthe presence of noise, given access to polynomially many challenge-response\npairs and polynomially bounded computational power, under mild assumptions\nabout the distributions of the noise and challenge vectors. This extends the\nresults of Rh\\\"uramir et al. (2013), who showed a subset of this class of PUFs\nto be learnable in polynomial time in the absence of noise, under the\nassumption that the optics of the PUF were either linear or had negligible\nnonlinear effects. We derive polynomial bounds for the required number of\nsamples and the computational complexity of a linear regression algorithm,\nbased on size parameters of the PUF, the distributions of the challenge and\nnoise vectors, and the probability and accuracy of the regression algorithm,\nwith a similar analysis to one done by Bootle et al. (2018), who demonstrated a\nlearning attack on a poorly implemented version of the Learning With Errors\nproblem.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:26:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Albright","Apollo",""],["Gelfand","Boris",""],["Dixon","Michael",""]]}
{"id":"2308.09200","submitter":"Etera R. Livine","authors":"Marc Geiller, Etera R. Livine, Francesco Sartini","title":"Regularized Black Holes from Doubled FLRW Cosmologies","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reduced general relativity for four-dimensional spherically-symmetric\nstationary space-times, more simply called the black hole mini-superspace, was\nshown in previous work to admit a symmetry under the three-dimensional\nPoincar\\'e group ISO(2,1). Such a non-semi-simple symmetry group usually\nsignals that the system is a special case of a more general model admitting a\nsemi-simple Lie group symmetry. We explore here possible modifications of the\nHamiltonian constraint of the mini-superspace. We identify in particular a\ncontinuous deformation of the dynamics that lifts the degeneracy of the\nPoincar\\'e group and leads to a SO(3,1) or SO(2,2) symmetry. This deformation\nis not related to the cosmological constant. We show that the deformed dynamics\ncan be represented as the superposition of two non-interacting homogeneous FRW\ncosmologies, with flat slices filled with perfect fluid. The resulting modified\nblack hole metrics are found to be non-singular.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:27:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Geiller","Marc",""],["Livine","Etera R.",""],["Sartini","Francesco",""]]}
{"id":"2308.09201","submitter":"Marcus R\\\"ub","authors":"Marcus R\\\"ub, Daniel Maier, Daniel Mueller-Gritschneder, Axel Sikora","title":"TinyProp -- Adaptive Sparse Backpropagation for Efficient TinyML\n  On-device Learning","comments":"7 Pages, AIPE Conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Training deep neural networks using backpropagation is very memory and\ncomputationally intensive. This makes it difficult to run on-device learning or\nfine-tune neural networks on tiny, embedded devices such as low-power\nmicro-controller units (MCUs). Sparse backpropagation algorithms try to reduce\nthe computational load of on-device learning by training only a subset of the\nweights and biases. Existing approaches use a static number of weights to\ntrain. A poor choice of this so-called backpropagation ratio limits either the\ncomputational gain or can lead to severe accuracy losses. In this paper we\npresent TinyProp, the first sparse backpropagation method that dynamically\nadapts the back-propagation ratio during on-device training for each training\nstep. TinyProp induces a small calculation overhead to sort the elements of the\ngradient, which does not significantly impact the computational gains. TinyProp\nworks particularly well on fine-tuning trained networks on MCUs, which is a\ntypical use case for embedded applications. For typical datasets from three\ndatasets MNIST, DCASE2020 and CIFAR10, we are 5 times faster compared to\nnon-sparse training with an accuracy loss of on average 1%. On average,\nTinyProp is 2.9 times faster than existing, static sparse backpropagation\nalgorithms and the accuracy loss is reduced on average by 6 % compared to a\ntypical static setting of the back-propagation ratio.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:32:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["R\u00fcb","Marcus",""],["Maier","Daniel",""],["Mueller-Gritschneder","Daniel",""],["Sikora","Axel",""]]}
{"id":"2308.09202","submitter":"Amit Kumar Jaiswal","authors":"Amit Kumar Jaiswal, Yu Xiong","title":"A Model-Agnostic Framework for Recommendation via Interest-aware Item\n  Embeddings","comments":"Accepted Paper under LBR track in the Seventeenth ACM Conference on\n  Recommender Systems (RecSys) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Item representation holds significant importance in recommendation systems,\nwhich encompasses domains such as news, retail, and videos. Retrieval and\nranking models utilise item representation to capture the user-item\nrelationship based on user behaviours. While existing representation learning\nmethods primarily focus on optimising item-based mechanisms, such as attention\nand sequential modelling. However, these methods lack a modelling mechanism to\ndirectly reflect user interests within the learned item representations.\nConsequently, these methods may be less effective in capturing user interests\nindirectly. To address this challenge, we propose a novel Interest-aware\nCapsule network (IaCN) recommendation model, a model-agnostic framework that\ndirectly learns interest-oriented item representations. IaCN serves as an\nauxiliary task, enabling the joint learning of both item-based and\ninterest-based representations. This framework adopts existing recommendation\nmodels without requiring substantial redesign. We evaluate the proposed\napproach on benchmark datasets, exploring various scenarios involving different\ndeep neural networks, behaviour sequence lengths, and joint learning ratios of\ninterest-oriented item representations. Experimental results demonstrate\nsignificant performance enhancements across diverse recommendation models,\nvalidating the effectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:40:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jaiswal","Amit Kumar",""],["Xiong","Yu",""]]}
{"id":"2308.09203","submitter":"Oderico-Benjamin Buran","authors":"Zhirayr Avetisyan, Abigail Brauer, Oderico-Benjamin Buran, Jimmy\n  Morentin, Tianyi Wang","title":"Invariant Geometric Structures on Almost Abelian Lie Groups","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An almost Abelian group is a non-Abelian Lie group with a codimension 1\nAbelian subgroup. This paper investigates invariant Hermitian and K\\\"{a}hler\nstructures on connected complex almost Abelian groups. We find explicit\nformulas for the left and right Haar measures, the modular function, and left\nand right generator vector fields on simply connected complex almost Abelian\ngroups. From the generator fields, we obtain invariant vector and tensor field\nframes, allowing us to find an explicit form for all invariant tensor fields.\nNamely, all such invariant tensor fields have constant coefficients in the\ninvariant frame. From this, we classify all invariant Hermitian forms on\ncomplex simply connected almost Abelian groups, and we prove the nonexistence\nof invariant K\\\"{a}hler forms on all such groups. Via constructions involving\nthe pullback of the quotient map, we extend the explicit description of\ninvariant Hermitian structures and the nonexistence of K\\\"{a}hler structures to\nconnected almost Abelian groups.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:00:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Avetisyan","Zhirayr",""],["Brauer","Abigail",""],["Buran","Oderico-Benjamin",""],["Morentin","Jimmy",""],["Wang","Tianyi",""]]}
{"id":"2308.09204","submitter":"Yuri Abramovich","authors":"Yuri Abramovich, Tanit Pongsiri","title":"Toeplitz Inverse Eigenvalue Problem (ToIEP) and Random Matrix Theory\n  (RMT) Support for the Toeplitz Covariance Matrix Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  \"Toeplitzification\" or \"redundancy (spatial) averaging\", the well-known\nroutine for deriving the Toeplitz covariance matrix estimate from the standard\nsample covariance matrix, recently regained new attention due to the important\nRandom Matrix Theory (RMT) findings. The asymptotic consistency in the spectral\nnorm was proven for the Kolmogorov's asymptotics when the matrix dimension N\nand independent identically distributed (i.i.d.) sample volume T both tended to\ninfinity (N->inf, T->inf, T/N->c > 0). These novel RMT results encouraged us to\nreassess the well-known drawback of the redundancy averaging methodology, which\nis the generation of the negative minimal eigenvalues for covariance matrices\nwith big eigenvalues spread, typical for most covariance matrices of interest.\nWe demonstrate that for this type of Toeplitz covariance matrices, convergence\nin the spectral norm does not prevent the generation of negative eigenvalues,\neven for the sample volume T that significantly exceeds the covariance matrix\ndimension (T >> N). We demonstrate that the ad-hoc attempts to remove the\nnegative eigenvalues by the proper diagonal loading result in solutions with\nthe very low likelihood. We demonstrate that attempts to exploit Newton's type\niterative algorithms, designed to produce a Hermitian Toeplitz matrix with the\ngiven eigenvalues lead to the very poor likelihood of the very slowly\nconverging solution to the desired eigenvalues. Finally, we demonstrate that\nthe proposed algorithm for restoration of a positive definite (p.d.) Hermitian\nToeplitz matrix with the specified Maximum Entropy spectrum, allows for the\ntransformation of the (unstructured) Hermitian maximum likelihood (ML) sample\nmatrix estimate in a p.d. Toeplitz matrix with sufficiently high likelihood.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:04:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Abramovich","Yuri",""],["Pongsiri","Tanit",""]]}
{"id":"2308.09205","submitter":"Bin Gao","authors":"Bin Gao, Tong Chen, Chien-Lung Huang, Yiming Qiu, Guangyong Xu, Jesse\n  Liebman, Lebing Chen, Matthew B. Stone, Erxi Feng, Huibo Cao, Xiaoping Wang,\n  Xianghan Xu, Sang-Wook Cheong, Stephen M. Winter, Pengcheng Dai","title":"Disorder-induced excitation continuum in a spin-1/2 cobaltate on a\n  triangular lattice","comments":null,"journal-ref":"Phys. Rev. B 108, 024431 2023","doi":"10.1103/PhysRevB.108.024431","report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A spin-1/2 triangular-lattice antiferromagnet is a prototypical frustrated\nquantum magnet, which exhibits remarkable quantum many-body effects that arise\nfrom the synergy between geometric spin frustration and quantum fluctuations.\nIt can host quantum frustrated magnetic topological phenomena like quantum spin\nliquid (QSL) states, highlighted by the presence of fractionalized\nquasiparticles within a continuum of magnetic excitations. In this work, we use\nneutron scattering to study CoZnMo$_3$O$_8$, which has a triangular lattice of\nJeff = 1/2 Co2+ ions with octahedral coordination. We found a\nwave-vector-dependent excitation continuum at low energy that disappears with\nincreasing temperature. Although these excitations are reminiscent of a spin\nexcitation continuum in a QSL state, their presence in CoZnMo$_3$O$_8$\noriginates from magnetic intersite disorder-induced dynamic spin states with\npeculiar excitations. Our results, therefore, give direct experimental evidence\nfor the presence of a disorder-induced spin excitation continuum.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:08:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gao","Bin",""],["Chen","Tong",""],["Huang","Chien-Lung",""],["Qiu","Yiming",""],["Xu","Guangyong",""],["Liebman","Jesse",""],["Chen","Lebing",""],["Stone","Matthew B.",""],["Feng","Erxi",""],["Cao","Huibo",""],["Wang","Xiaoping",""],["Xu","Xianghan",""],["Cheong","Sang-Wook",""],["Winter","Stephen M.",""],["Dai","Pengcheng",""]]}
{"id":"2308.09206","submitter":"\\'Alvaro Lozano-Onrubia","authors":"Sergio L\\'opez-Zurdo, \\'Alvaro Lozano-Onrubia, Luca Merlo, Jos\\'e\n  Miguel No","title":"Early Universe hypercharge breaking and neutrino mass generation","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the conditions allowing for a spontaneous breaking of the\n$U(1)_Y$ hypercharge gauge symmetry of the Standard Model (SM) in the early\nUniverse are generically present in extensions of the SM addressing the\ngeneration of light neutrino masses via radiative contributions. In such\nscenarios, the breaking of (hyper)charge at high-temperatures yields new\npossibilities for explaining the observed matter-antimatter asymmetry of the\nUniverse. Considering for concreteness the Zee-Babu radiative neutrino mass\ngeneration model, we show that a period of hypercharge breaking prior to the\nelectroweak phase transition could allow for successful baryogenesis via a\nnon-conventional leptogenesis mechanism, based on the presence of\ncharge-breaking masses for the SM leptons in the early Universe.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:09:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["L\u00f3pez-Zurdo","Sergio",""],["Lozano-Onrubia","\u00c1lvaro",""],["Merlo","Luca",""],["No","Jos\u00e9 Miguel",""]]}
{"id":"2308.09207","submitter":"Harvey Klyne","authors":"Harvey Klyne and Rajen D. Shah","title":"Average partial effect estimation using double machine learning","comments":"61 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Single-parameter summaries of variable effects are desirable for ease of\ninterpretation, but linear models, which would deliver these, may fit poorly to\nthe data. A modern approach is to estimate the average partial effect -- the\naverage slope of the regression function with respect to the predictor of\ninterest -- using a doubly robust semiparametric procedure. Most existing work\nhas focused on specific forms of nuisance function estimators. We extend the\nscope to arbitrary plug-in nuisance function estimation, allowing for the use\nof modern machine learning methods which in particular may deliver\nnon-differentiable regression function estimates. Our procedure involves\nresmoothing a user-chosen first-stage regression estimator to produce a\ndifferentiable version, and modelling the conditional distribution of the\npredictors through a location-scale model. We show that our proposals lead to a\nsemiparametric efficient estimator under relatively weak assumptions. Our\ntheory makes use of a new result on the sub-Gaussianity of Lipschitz score\nfunctions that may be of independent interest. We demonstrate the attractive\nnumerical performance of our approach in a variety of settings including ones\nwith misspecification.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:14:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Klyne","Harvey",""],["Shah","Rajen D.",""]]}
{"id":"2308.09208","submitter":"Hern\\'an Mella","authors":"Hern\\'an Mella and Esteban S\\'aez and Joaqu\\'in Mura","title":"A hybrid PML formulation for the 2D three-field dynamic poroelastic\n  equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulation of wave propagation in poroelastic half-spaces presents a common\nchallenge in fields like geomechanics and biomechanics, requiring Absorbing\nBoundary Conditions (ABCs) at the semi-infinite space boundaries. Perfectly\nMatched Layers (PML) are a popular choice due to their excellent wave\nabsorption properties. However, PML implementation can lead to problems with\nunknown stresses or strains, time convolutions, or PDE systems with Auxiliary\nDifferential Equations (ADEs), which increases computational complexity and\nresource consumption.\n  This article presents two new PML formulations for arbitrary poroelastic\ndomains. The first formulation is a fully-mixed form that employs time-history\nvariables instead of ADEs, reducing the number of unknowns and mathematical\noperations. The second formulation is a hybrid form that restricts the\nfully-mixed formulation to the PML domain, resulting in smaller matrices for\nthe solver while preserving governing equations in the interior domain. The\nfully-mixed formulation introduces three scalar variables over the whole\ndomain, whereas the hybrid form confines them to the PML domain.\n  The proposed formulations were tested in three numerical experiments in\ngeophysics using realistic parameters for soft sites with free surfaces. The\nresults were compared with numerical solutions from extended domains and\nsimpler ABCs, such as paraxial approximation, demonstrating the accuracy,\nefficiency, and precision of the proposed methods. The article also discusses\nthe applicability of these methods to complex media and their extension to the\nMultiaxial PML formulation.\n  The codes for the simulations are available for download from\n\\url{https://github.com/hmella/POROUS-HYBRID-PML}.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:27:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mella","Hern\u00e1n",""],["S\u00e1ez","Esteban",""],["Mura","Joaqu\u00edn",""]]}
{"id":"2308.09209","submitter":"Xinyi Bai","authors":"Lu Yang, Zhenglun Kong, Ting Li, Xinyi Bai, Zhiye Lin, Hong Cheng","title":"GPU Accelerated Color Correction and Frame Warping for Real-time Video\n  Stitching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditional image stitching focuses on a single panorama frame without\nconsidering the spatial-temporal consistency in videos. The straightforward\nimage stitching approach will cause temporal flicking and color inconstancy\nwhen it is applied to the video stitching task. Besides, inaccurate camera\nparameters will cause artifacts in the image warping. In this paper, we propose\na real-time system to stitch multiple video sequences into a panoramic video,\nwhich is based on GPU accelerated color correction and frame warping without\naccurate camera parameters. We extend the traditional 2D-Matrix (2D-M) color\ncorrection approach and a present spatio-temporal 3D-Matrix (3D-M) color\ncorrection method for the overlap local regions with online color balancing\nusing a piecewise function on global frames. Furthermore, we use pairwise\nhomography matrices given by coarse camera calibration for global warping\nfollowed by accurate local warping based on the optical flow. Experimental\nresults show that our system can generate highquality panorama videos in real\ntime.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:28:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Lu",""],["Kong","Zhenglun",""],["Li","Ting",""],["Bai","Xinyi",""],["Lin","Zhiye",""],["Cheng","Hong",""]]}
{"id":"2308.09210","submitter":"Ziao Wang","authors":"Ziao Wang, Weina Wang, Lele Wang","title":"Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge\n  Correlation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph alignment refers to the task of finding the vertex correspondence\nbetween two positively correlated graphs. Extensive study has been done on\npolynomial-time algorithms for the graph alignment problem under the\nErd\\H{o}s--R\\'enyi graph pair model, where the two graphs are\nErd\\H{o}s--R\\'enyi graphs with edge probability $q_\\mathrm{u}$, correlated\nunder certain vertex correspondence. To achieve exact recovery of the vertex\ncorrespondence, all existing algorithms at least require the edge correlation\ncoefficient $\\rho_\\mathrm{u}$ between the two graphs to satisfy\n$\\rho_\\mathrm{u} > \\sqrt{\\alpha}$, where $\\alpha \\approx 0.338$ is Otter's\ntree-counting constant. Moreover, it is conjectured in [1] that no\npolynomial-time algorithm can achieve exact recovery under weak edge\ncorrelation $\\rho_\\mathrm{u}<\\sqrt{\\alpha}$.\n  In this paper, we show that with a vanishing amount of additional attribute\ninformation, exact recovery is polynomial-time feasible under vanishing edge\ncorrelation $\\rho_\\mathrm{u} \\ge n^{-\\Theta(1)}$. We identify a local tree\nstructure, which incorporates one layer of user information and one layer of\nattribute information, and apply the subgraph counting technique to such\nstructures. A polynomial-time algorithm is proposed that recovers the vertex\ncorrespondence for all but a vanishing fraction of vertices. We then further\nrefine the algorithm output to achieve exact recovery. The motivation for\nconsidering additional attribute information comes from the widely available\nside information in real-world applications, such as the user's birthplace and\neducational background on LinkedIn and Twitter social networks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:32:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Ziao",""],["Wang","Weina",""],["Wang","Lele",""]]}
{"id":"2308.09211","submitter":"Daehyun Kim","authors":"Daehyun Kim, Ichiro Obara","title":"On the Value of Information Structures in Stochastic Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies how improved monitoring affects the limit equilibrium\npayoff set for stochastic games with imperfect public monitoring. We introduce\na simple generalization of Blackwell garbling called weighted garbling in order\nto compare different information structures for this class of games. Our main\nresult is the monotonicity of the limit perfect public equilibrium (PPE) payoff\nset with respect to this information order: we show that the limit PPE payoff\nsets with one information structure is larger than the limit PPE payoff sets\nwith another information structure state by state if the latter information\nstructure is a weighted garbling of the former. We show that this monotonicity\nresult also holds for the class of strongly symmetric equilibrium. Finally, we\nintroduce and discuss another weaker sufficient condition for the expansion of\nlimit PPE payoff set. It is more complex and difficult to verify, but useful in\nsome special cases.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 23:37:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Daehyun",""],["Obara","Ichiro",""]]}
{"id":"2308.09212","submitter":"Junsuke Yamanishi","authors":"Junsuke Yamanishi, Hyo-Yong Ahn and Hiromi Okamoto","title":"Nano-Imaging of Chiro-Optical Force","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nanoscopic observation of chiro-optical phenomena is essential in wide\nscientific areas but has measurement difficulties; hence, its physics are still\nunknown. Currently, in most cases, chiro-optical phenomena have been\ninvestigated by polarized light handling far-field measurements or via\npredictions by theoretical simulations. To obtain a full understanding of the\nphysics of chiro-optical systems and derive the full potentials, it is\nessential to perform in situ observation of the chiro-optical effect from the\nindividual parts because the macroscopic chiro-optical effect cannot be\ntranslated directly into microscopic effects. In the present study, we observed\nthe chiro-optical responses at the nanoscale level by detecting the\nchiro-optical forces, which were generated by illumination of the\nmaterial/probe system with circularly polarized light. The induced optical\nforce was dependent on the handedness of the incident circularly polarized\nlight and well correlated to the electromagnetically simulated differential\nintensity of the longitudinal electric field. Our results facilitate the\nclarification of chiro-optical phenomena at the nanoscale level and could\ninnovate chiro-optical nanotechnologies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:04:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yamanishi","Junsuke",""],["Ahn","Hyo-Yong",""],["Okamoto","Hiromi",""]]}
{"id":"2308.09213","submitter":"Santosh Ganji","authors":"Santosh Ganji and P R Kumar","title":"Seeing the Unseen: The REVEAL protocol to expose the wireless\n  Man-in-the-Middle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.SY eess.SY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A Man-in-the-Middle (MiM) can collect over-the-air packets whether from a\nmobile or a base station, process them, possibly modify them, and forward them\nto the intended receiver. This paper exhibits the REVEAL protocol that can\ndetect a MiM, whether it has half duplex capability, full duplex capability, or\ndouble full duplex capability. Protocol is based on synchronizing clocks\nbetween the mobile and the base station, with the MiM being detected if it\ninterferes in the synchronization process. Once synchronized, the REVEAL\nprotocol creates a sequence of challenge packets where the transmission times\nof the packets, their durations, and their frequencies, are chosen to create\nconflicts at the MiM, and make it impossible for the MiM to function. We\nimplement the REVEAL protocol for detecting a MiM in 4G technology. We\ninstantiate a MiM between the 4G/5G base station and a mobile, and exhibit the\nsuccessful detection mechanisms. With the shared source code, our work can be\nreproduced using open software defined cellular networks with off-the-shelf\ndevices\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:13:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ganji","Santosh",""],["Kumar","P R",""]]}
{"id":"2308.09214","submitter":"Raghavendra Tripathi","authors":"Siva Athreya, Soumik Pal, Raghav Somani, Raghavendra Tripathi","title":"Path convergence of Markov chains on large graphs","comments":"43 pages+references, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider two classes of natural stochastic processes on finite unlabeled\ngraphs. These are Euclidean stochastic optimization algorithms on the adjacency\nmatrix of weighted graphs and a modified version of the Metropolis MCMC\nalgorithm on stochastic block models over unweighted graphs. In both cases we\nshow that, as the size of the graph goes to infinity, the random trajectories\nof the stochastic processes converge to deterministic limits. These\ndeterministic limits are curves on the space of measure-valued graphons.\nMeasure-valued graphons, introduced by Lov\\'{a}sz and Szegedy, are a refinement\nof the concept of graphons that can distinguish between two infinite\nexchangeable arrays that give rise to the same graphon limit. We introduce new\nmetrics on this space which provide us with a natural notion of convergence for\nour limit theorems. This notion is equivalent to the convergence of\ninfinite-exchangeable arrays. Under a suitable time-scaling, the Metropolis\nchain admits a diffusion limit as the number of vertices go to infinity. We\nthen demonstrate that, in an appropriately formulated zero-noise limit, the\nstochastic process of adjacency matrices of this diffusion converge to a\ndeterministic gradient flow curve on the space of graphons introduced in\narXiv:2111.09459 [math.PR]. Under suitable assumptions, this allows us to\nestimate an exponential convergence rate for the Metropolis chain in a certain\nlimiting regime. To the best of our knowledge, both the actual rate and the\nconnection between a natural Metropolis chain commonly used in exponential\nrandom graph models and gradient flows on graphons are new in the literature.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:13:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Athreya","Siva",""],["Pal","Soumik",""],["Somani","Raghav",""],["Tripathi","Raghavendra",""]]}
{"id":"2308.09215","submitter":"Alex Iosevich","authors":"Paige Bright, Xinyu Fang, Barrett Heritage, Alex Iosevich, and Maxwell\n  Sun","title":"Improved bounds for embedding certain configurations in subsets of\n  vector spaces over finite fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fourth listed author and Hans Parshall (\\cite{IosevichParshall}) proved\nthat if $E \\subset {\\mathbb F}_q^d$, $d \\ge 2$, and $G$ is a connected graph on\n$k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E|\n\\ge C q^{m+\\frac{d-1}{2}}$, for any $t>0$, there exist $k+1$ points $x^1,\n\\dots, x^{k+1}$ in $E$ such that $||x^i-x^j||=t$ if the $i$'th vertex is\nconnected to the $j$'th vertex by an edge in $G$. In this paper, we give\nseveral indications that the maximum degree is not always the right notion of\ncomplexity and prove several concrete results to obtain better exponents than\nthe Iosevich-Parshall result affords. This can be viewed as a step towards\nunderstanding the right notion of complexity for graph embeddings in subsets of\nvector spaces over finite fields.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:20:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bright","Paige",""],["Fang","Xinyu",""],["Heritage","Barrett",""],["Iosevich","Alex",""],["Sun","Maxwell",""]]}
{"id":"2308.09216","submitter":"Zhanybek Alpichshev","authors":"Dusan Lorenc and Zhanybek Alpichshev","title":"Dispersive effects in ultrafast non-linear phenomena","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is a basic principle that an effect cannot come before the cause.\nDispersive relations that follow from this fundamental fact have proven to be\nan indispensable tool in physics and engineering. They are most powerful in the\ndomain of linear response where they are known as Kramers-Kronig relations.\nHowever when it comes to nonlinear phenomena the implications of causality are\nmuch less explored, apart from several notable exceptions. Here in this work we\ndemonstrate how to apply the dispersive formalism to analyse the ultrafast\nnonlinear response in the context of the paradigmatic nonlinear Kerr effect. We\nfind that the requirement of causality introduces a noticeable effect even\nunder assumption that Kerr effect is mediated by quasi-instantaneous\noff-resonant electronic hyperpolarizability. We confirm this by experimentally\nmeasuring the time resolved Kerr dynamics in GaAs by means of a hybrid\npump-probe Mach-Zehnder interferometer and demonstrate the presence of an\nintrinsic lagging between amplitude and phase responses as predicted by\ndispersive analysis. Our results describe a general property of the\ntime-resolved nonlinear processes thereby highlighting the importance of\naccounting for dispersive effects in the nonlinear optical processes involving\nultrashort pulses.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:22:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lorenc","Dusan",""],["Alpichshev","Zhanybek",""]]}
{"id":"2308.09217","submitter":"Sanaz Saki Norouzi","authors":"Sanaz Saki Norouzi, Mohammad Saeid Mahdavinejad, Pascal Hitzler","title":"Conversational Ontology Alignment with ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This study evaluates the applicability and efficiency of ChatGPT for ontology\nalignment using a naive approach. ChatGPT's output is compared to the results\nof the Ontology Alignment Evaluation Initiative 2022 campaign using conference\ntrack ontologies. This comparison is intended to provide insights into the\ncapabilities of a conversational large language model when used in a naive way\nfor ontology matching, and to investigate the potential advantages and\ndisadvantages of this approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:26:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Norouzi","Sanaz Saki",""],["Mahdavinejad","Mohammad Saeid",""],["Hitzler","Pascal",""]]}
{"id":"2308.09218","submitter":"Sandra Palau","authors":"Airam Blancas, Adri\\'an Gonz\\'alez Casanova, Sebastian Hummel, Sandra\n  Palau","title":"Absorption and stationary times for the $\\Lambda$-Wright-Fisher process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We derive stationary and fixation times for the multi-type\n$\\Lambda$-Wright-Fisher process with and without the classic linear drift that\nmodels mutations. Our method relies on a grand coupling of the process realized\nthrough the so-called lookdown-construction. A well-known process embedded in\nthis construction is the fixation line. We generalise the process to our setup\nand make use of the associated explosion times to obtain a representation of\nthe fixation and stationary times in terms of the waiting time in a coupon\ncollector problem.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:36:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Blancas","Airam",""],["Casanova","Adri\u00e1n Gonz\u00e1lez",""],["Hummel","Sebastian",""],["Palau","Sandra",""]]}
{"id":"2308.09219","submitter":"Thuy Ngoc Nguyen","authors":"Thuy Ngoc Nguyen and Duy Nhat Phan and Cleotilde Gonzalez","title":"Learning in Cooperative Multiagent Systems Using Cognitive and Machine\n  Models","comments":"22 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developing effective Multi-Agent Systems (MAS) is critical for many\napplications requiring collaboration and coordination with humans. Despite the\nrapid advance of Multi-Agent Deep Reinforcement Learning (MADRL) in cooperative\nMAS, one major challenge is the simultaneous learning and interaction of\nindependent agents in dynamic environments in the presence of stochastic\nrewards. State-of-the-art MADRL models struggle to perform well in Coordinated\nMulti-agent Object Transportation Problems (CMOTPs), wherein agents must\ncoordinate with each other and learn from stochastic rewards. In contrast,\nhumans often learn rapidly to adapt to nonstationary environments that require\ncoordination among people. In this paper, motivated by the demonstrated ability\nof cognitive models based on Instance-Based Learning Theory (IBLT) to capture\nhuman decisions in many dynamic decision making tasks, we propose three\nvariants of Multi-Agent IBL models (MAIBL). The idea of these MAIBL algorithms\nis to combine the cognitive mechanisms of IBLT and the techniques of MADRL\nmodels to deal with coordination MAS in stochastic environments from the\nperspective of independent learners. We demonstrate that the MAIBL models\nexhibit faster learning and achieve better coordination in a dynamic CMOTP task\nwith various settings of stochastic rewards compared to current MADRL models.\nWe discuss the benefits of integrating cognitive insights into MADRL models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:39:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nguyen","Thuy Ngoc",""],["Phan","Duy Nhat",""],["Gonzalez","Cleotilde",""]]}
{"id":"2308.09220","submitter":"Hyunwoo Kwon","authors":"Hongjie Dong and Hyunwoo Kwon","title":"Interior and boundary mixed norm derivative estimates for nonstationary\n  Stokes equations","comments":"51 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We obtain weighted mixed norm Sobolev estimates in the whole space for\nnonstationary Stokes equations in divergence and nondivergence form with\nvariable viscosity coefficients that are merely measurable in time variable and\nhave small mean oscillation in spatial variables in small cylinders. As an\napplication, we prove interior mixed norm derivative estimates for solutions to\nboth equations. We also discuss boundary mixed norm Hessian estimates for\nsolutions to equations in nondivergence form under the Lions boundary\nconditions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:39:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dong","Hongjie",""],["Kwon","Hyunwoo",""]]}
{"id":"2308.09221","submitter":"Sam Khallaghi","authors":"Sam Khallaghi, J. Ronald Eastman, Lyndon D. Estes","title":"A review of technical factors to consider when designing neural networks\n  for semantic segmentation of Earth Observation imagery","comments":"145 pages with 32 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Semantic segmentation (classification) of Earth Observation imagery is a\ncrucial task in remote sensing. This paper presents a comprehensive review of\ntechnical factors to consider when designing neural networks for this purpose.\nThe review focuses on Convolutional Neural Networks (CNNs), Recurrent Neural\nNetworks (RNNs), Generative Adversarial Networks (GANs), and transformer\nmodels, discussing prominent design patterns for these ANN families and their\nimplications for semantic segmentation. Common pre-processing techniques for\nensuring optimal data preparation are also covered. These include methods for\nimage normalization and chipping, as well as strategies for addressing data\nimbalance in training samples, and techniques for overcoming limited data,\nincluding augmentation techniques, transfer learning, and domain adaptation. By\nencompassing both the technical aspects of neural network design and the\ndata-related considerations, this review provides researchers and practitioners\nwith a comprehensive and up-to-date understanding of the factors involved in\ndesigning effective neural networks for semantic segmentation of Earth\nObservation imagery.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:40:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khallaghi","Sam",""],["Eastman","J. Ronald",""],["Estes","Lyndon D.",""]]}
{"id":"2308.09222","submitter":"Corey Bregman","authors":"Corey Bregman, Ruth Charney, and Karen Vogtmann","title":"Finite subgroups of outer automorphism groups of RAAGs I: untwisted\n  subgroups","comments":"29 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any right-angled Artin group $A_{\\Gamma}$, Charney-Stambaugh-Vogtmann\nshowed that the subgroup $U^0(A_{\\Gamma}) \\leq \\text{Out}(A_{\\Gamma})$\ngenerated by Whitehead automorphisms and inversions acts properly and\ncocompactly on a contractible space $K_{\\Gamma}$. In the present paper we show\nthat any finite subgroup of $U^0(A_{\\Gamma})$ fixes a point of $K_{\\Gamma}$.\nThis generalizes the fact that any finite subgroup of $\\text{Out}(F_n)$ fixes a\npoint of Outer Space, and implies that there are only finitely many conjugacy\nclasses of finite subgroups in $U^0(A_{\\Gamma})$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:43:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bregman","Corey",""],["Charney","Ruth",""],["Vogtmann","Karen",""]]}
{"id":"2308.09223","submitter":"Xiaoxiao He","authors":"Xiaoxiao He, Chaowei Tan, Ligong Han, Bo Liu, Leon Axel, Kang Li,\n  Dimitris N. Metaxas","title":"DMCVR: Morphology-Guided Diffusion Model for 3D Cardiac Volume\n  Reconstruction","comments":"Accepted in MICCAI 2023","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":"  Accurate 3D cardiac reconstruction from cine magnetic resonance imaging\n(cMRI) is crucial for improved cardiovascular disease diagnosis and\nunderstanding of the heart's motion. However, current cardiac MRI-based\nreconstruction technology used in clinical settings is 2D with limited\nthrough-plane resolution, resulting in low-quality reconstructed cardiac\nvolumes. To better reconstruct 3D cardiac volumes from sparse 2D image stacks,\nwe propose a morphology-guided diffusion model for 3D cardiac volume\nreconstruction, DMCVR, that synthesizes high-resolution 2D images and\ncorresponding 3D reconstructed volumes. Our method outperforms previous\napproaches by conditioning the cardiac morphology on the generative model,\neliminating the time-consuming iterative optimization process of the latent\ncode, and improving generation quality. The learned latent spaces provide\nglobal semantics, local cardiac morphology and details of each 2D cMRI slice\nwith highly interpretable value to reconstruct 3D cardiac shape. Our\nexperiments show that DMCVR is highly effective in several aspects, such as 2D\ngeneration and 3D reconstruction performance. With DMCVR, we can produce\nhigh-resolution 3D cardiac MRI reconstructions, surpassing current techniques.\nOur proposed framework has great potential for improving the accuracy of\ncardiac disease diagnosis and treatment planning. Code can be accessed at\nhttps://github.com/hexiaoxiao-cs/DMCVR.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:48:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["He","Xiaoxiao",""],["Tan","Chaowei",""],["Han","Ligong",""],["Liu","Bo",""],["Axel","Leon",""],["Li","Kang",""],["Metaxas","Dimitris N.",""]]}
{"id":"2308.09224","submitter":"Duy Nhat Phan","authors":"Jalal Fadili and Tran T. A. Nghia and Duy Nhat Phan","title":"Geometric characterizations for strong minima with applications to\n  nuclear norm minimization problems","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce several geometric characterizations for strong\nminima of optimization problems. Applying these results to nuclear norm\nminimization problems allows us to obtain new necessary and sufficient\nquantitative conditions for this important property. Our characterizations for\nstrong minima are weaker than the Restricted Injectivity and Nondegenerate\nSource Condition, which are usually used to identify solution uniqueness of\nnuclear norm minimization problems. Consequently, we obtain the minimum (tight)\nbound on the number of measurements for (strong) exact recovery of low-rank\nmatrices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:56:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fadili","Jalal",""],["Nghia","Tran T. A.",""],["Phan","Duy Nhat",""]]}
{"id":"2308.09225","submitter":"Dong-han Yeom","authors":"Xiao Yan Chew, Dong-han Yeom","title":"Insights and guidelines on the Cauchy horizon theorems","comments":"18 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":"  Recently there is progress to resolve the issue regarding the non-existence\nof the Cauchy horizon inside the static, charged, and spherically symmetric\nblack holes. However, when we generically extend the black holes' spacetime,\nthey are not just static but can be dynamical, thus the interior of black holes\ndoes not remain the same as the static case when we take into account the\ndynamical evolution of black holes. Then, our aim in this paper is to provide a\nfew constructive insights and guidelines regarding this issue by revisiting a\nfew examples of the gravitational collapse of spherically symmetric charged\nblack holes using the double-null formalism. Our numerical results demonstrate\nthat the inside of the outer horizon is no longer static even in late time, and\nthe inner apparent horizon exists but is not regular. The inner apparent\nhorizon can be distinguished clearly from the Cauchy horizon. The spherical\nsymmetric property of black holes allows the inner horizon to be defined in two\ndirections, i.e., the differentiation of the areal radius vanishes along either\nthe out-going or the in-going null direction. Moreover, the Cauchy horizon can\nbe generated from a singularity. Still, the notion of the singularity can be\nsubtle where it can have a vanishing or non-vanishing areal radius; the\ncorresponding curvature quantities could be finite or diverge, although the\ncurvatures can be greater than the Planck scale. Finally, we show some examples\nthat the \"hair\" which is associated with the matter field on the inner horizon\nis not important to determine the existence of the Cauchy horizon; rather, the\nhair on the outer horizon might play an important role on the Cauchy horizon.\nTherefore, the dynamic properties of the interior of charged black holes could\nshed light for us to understand deeply about the Cauchy horizon for the\nextensions of no-Cauchy-horizon theorems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:00:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chew","Xiao Yan",""],["Yeom","Dong-han",""]]}
{"id":"2308.09226","submitter":"Judith Bunder","authors":"Thien Tran-Duc, J. E. Bunder, A. J. Roberts","title":"Efficient computational homogenisation of 2D beams of heterogeneous\n  elasticity using the patch scheme","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern 'smart' materials have complex heterogeneous microscale structure,\noften with unknown macroscale closure but one we need to realise for large\nscale engineering and science. The multiscale Equation-Free Patch Scheme\nempowers us to non-intrusively, efficiently, and accurately predict the large\nscale, system level, solutions through computations on only small sparse\npatches of the given detailed microscale system. Here the microscale system is\nthat of a 2D beam of heterogeneous elasticity, with either fixed fixed,\nfixed-free, or periodic boundary conditions. We demonstrate that the described\nmultiscale Patch Scheme simply, efficiently, and stably predicts the beam's\nmacroscale, with a controllable accuracy, at finite scale separation. Dynamical\nsystems theory supports the scheme. This article points the way for others to\nuse this systematic non-intrusive approach, via a developing toolbox of\nfunctions, to model and compute accurately macroscale system-levels of general\ncomplex physical and engineering systems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:12:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tran-Duc","Thien",""],["Bunder","J. E.",""],["Roberts","A. J.",""]]}
{"id":"2308.09227","submitter":"Lanyu Li","authors":"Lanyu Li and Zhao Pan","title":"Three-Dimensional Time Resolved Lagrangian Flow Field Reconstruction\n  Based on Constrained Least Squares and Stable Radial Basis Function","comments":"30 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The three-dimensional Time-Resolved Lagrangian Particle Tracking (3D TR-LPT)\ntechnique has recently advanced flow diagnostics by providing high\nspatiotemporal resolution measurements under the Lagrangian framework. To fully\nexploit its potential, accurate and robust data processing algorithms are\nneeded. These algorithms are responsible for reconstructing particle\ntrajectories, velocities, and differential quantities (e.g., pressure\ngradients, strain- and rotation-rate tensors, and coherent structures) from raw\nLPT data. In this paper, we propose a three-dimensional (3D) divergence-free\nLagrangian reconstruction method, where three foundation algorithms --\nConstrained Least Squares (CLS), stable Radial Basis Function (RBF-QR), and\nPartition-of-Unity Method (PUM) -- are integrated into one comprehensive\nreconstruction strategy. Our method, named CLS-RBF PUM, is able to (i) directly\nreconstruct flow fields at scattered data points, avoiding\nLagrangian-to-Eulerian data conversions; (ii) assimilate the flow diagnostics\nin Lagrangian and Eulerian descriptions to achieve high-accuracy flow\nreconstruction; (iii) process large-scale LPT data sets with more than hundreds\nof thousand particles in two dimensions (2D) or 3D; (iv) enable spatiotemporal\nsuper-resolution while imposing physical constraints (e.g., divergence-free for\nincompressible flows) at arbitrary time and location. Validation based on\nsynthetic and experimental LPT data confirmed that our method can consistently\nachieve the above advantages with accuracy and robustness.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:13:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Lanyu",""],["Pan","Zhao",""]]}
{"id":"2308.09228","submitter":"Yeti Z. Gurbuz","authors":"Yeti Z. Gurbuz, Ozan Sener and A. Ayd{\\i}n Alatan","title":"Generalized Sum Pooling for Metric Learning","comments":"Accepted as a conference paper at International Conference on\n  Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A common architectural choice for deep metric learning is a convolutional\nneural network followed by global average pooling (GAP). Albeit simple, GAP is\na highly effective way to aggregate information. One possible explanation for\nthe effectiveness of GAP is considering each feature vector as representing a\ndifferent semantic entity and GAP as a convex combination of them. Following\nthis perspective, we generalize GAP and propose a learnable generalized sum\npooling method (GSP). GSP improves GAP with two distinct abilities: i) the\nability to choose a subset of semantic entities, effectively learning to ignore\nnuisance information, and ii) learning the weights corresponding to the\nimportance of each entity. Formally, we propose an entropy-smoothed optimal\ntransport problem and show that it is a strict generalization of GAP, i.e., a\nspecific realization of the problem gives back GAP. We show that this\noptimization problem enjoys analytical gradients enabling us to use it as a\ndirect learnable replacement for GAP. We further propose a zero-shot loss to\nease the learning of GSP. We show the effectiveness of our method with\nextensive evaluations on 4 popular metric learning benchmarks. Code is\navailable at: GSP-DML Framework\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:20:25 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:39:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gurbuz","Yeti Z.",""],["Sener","Ozan",""],["Alatan","A. Ayd\u0131n",""]]}
{"id":"2308.09229","submitter":"Carlos Andres Agudelo Serna","authors":"Carlos Andres Agudelo Serna","title":"Mitigating the Risk of Knowledge Leakage in Knowledge Intensive\n  Organizations: a Mobile Device Perspective","comments":"The University of Melbourne PhD Thesis","journal-ref":"Doctoral Thesis, The University of Melbourne (2023)\n  http://hdl.handle.net/11343/336916","doi":null,"report-no":null,"categories":"cs.CY cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the current knowledge economy, knowledge represents the most strategically\nsignificant resource of organizations. Knowledge-intensive activities advance\ninnovation and create and sustain economic rent and competitive advantage. In\norder to sustain competitive advantage, organizations must protect knowledge\nfrom leakage to third parties, particularly competitors. However, the number\nand scale of leakage incidents reported in news media as well as industry\nwhitepapers suggests that modern organizations struggle with the protection of\nsensitive data and organizational knowledge. The increasing use of mobile\ndevices and technologies by knowledge workers across the organizational\nperimeter has dramatically increased the attack surface of organizations, and\nthe corresponding level of risk exposure. While much of the literature has\nfocused on technology risks that lead to information leakage, human risks that\nlead to knowledge leakage are relatively understudied. Further, not much is\nknown about strategies to mitigate the risk of knowledge leakage using mobile\ndevices, especially considering the human aspect. Specifically, this research\nstudy identified three gaps in the current literature (1) lack of in-depth\nstudies that provide specific strategies for knowledge-intensive organizations\nbased on their varied risk levels. Most of the analysed studies provide\nhigh-level strategies that are presented in a generalised manner and fail to\nidentify specific strategies for different organizations and risk levels. (2)\nlack of research into management of knowledge in the context of mobile devices.\nAnd (3) lack of research into the tacit dimension of knowledge as the majority\nof the literature focuses on formal and informal strategies to protect explicit\n(codified) knowledge.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:22:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Serna","Carlos Andres Agudelo",""]]}
{"id":"2308.09230","submitter":"Mohammad Saeed Ebrahimi Saadabadi","authors":"Mohammad Saeed Ebrahimi Saadabadi, Sahar Rahimi Malakshan, Hossein\n  Kashiani, Nasser M. Nasrabadi","title":"CCFace: Classification Consistency for Low-Resolution Face Recognition","comments":"2023 IEEE International Joint Conference on Biometrics (IJCB)","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 face recognition methods have demonstrated impressive\nresults on in-the-wild datasets. However, these methods have shown a\nsignificant decline in performance when applied to real-world low-resolution\nbenchmarks like TinyFace or SCFace. To address this challenge, we propose a\nnovel classification consistency knowledge distillation approach that transfers\nthe learned classifier from a high-resolution model to a low-resolution\nnetwork. This approach helps in finding discriminative representations for\nlow-resolution instances. To further improve the performance, we designed a\nknowledge distillation loss using the adaptive angular penalty inspired by the\nsuccess of the popular angular margin loss function. The adaptive penalty\nreduces overfitting on low-resolution samples and alleviates the convergence\nissue of the model integrated with data augmentation. Additionally, we utilize\nan asymmetric cross-resolution learning approach based on the state-of-the-art\nsemi-supervised representation learning paradigm to improve discriminability on\nlow-resolution instances and prevent them from forming a cluster. Our proposed\nmethod outperforms state-of-the-art approaches on low-resolution benchmarks,\nwith a three percent improvement on TinyFace while maintaining performance on\nhigh-resolution benchmarks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:24:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Saadabadi","Mohammad Saeed Ebrahimi",""],["Malakshan","Sahar Rahimi",""],["Kashiani","Hossein",""],["Nasrabadi","Nasser M.",""]]}
{"id":"2308.09231","submitter":"Yi Hong Teoh","authors":"Zewen Sun, Yi Hong Teoh, Fereshteh Rajabi, Rajibul Islam","title":"Investigations of 2D ion crystals in a hybrid optical cavity trap for\n  quantum information processing","comments":"10 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We numerically investigate a hybrid trapping architecture for 2D ion crystals\nusing static electrode voltages and optical cavity fields for in-plane and\nout-of-plane confinements, respectively. By studying the stability of 2D\ncrystals against 2D-3D structural phase transitions, we identify the necessary\ntrapping parameters for ytterbium ions. Multiple equilibrium configurations for\n2D crystals are possible, and we analyze their stability by estimating\npotential barriers between them. We find that scattering to anti-trapping\nstates limits the trapping lifetime, which is consistent with recent\nexperiments employing other optical trapping architectures. These 2D ion\ncrystals offer an excellent platform for quantum simulation of frustrated spin\nsystems, benefiting from their 2D triangular lattice structure and\nphonon-mediated spin-spin interactions. Quantum information processing with\ntens of ions is feasible in this scheme with current technologies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:25:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Zewen",""],["Teoh","Yi Hong",""],["Rajabi","Fereshteh",""],["Islam","Rajibul",""]]}
{"id":"2308.09232","submitter":"Yuxiao Wei","authors":"Yuxiao Wei, Jin Cheng, Robert Burridge, and Jianliang Qian","title":"Hadamard integrator for time-dependent wave equations: Lagrangian\n  formulation via ray tracing","comments":"38 pages, 14 figures, 1 table","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":"  We propose a novel Hadamard integrator for the self-adjoint time-dependent\nwave equation in an inhomogeneous medium. First, we create a new asymptotic\nseries based on the Gelfand-Shilov function, dubbed Hadamard's ansatz, to\napproximate the Green's function of the time-dependent wave equation. Second,\nincorporating the leading term of Hadamard's ansatz into the Kirchhoff-Huygens\nrepresentation, we develop an original Hadamard integrator for the Cauchy\nproblem of the time-dependent wave equation and derive the corresponding\nLagrangian formulation in geodesic polar coordinates. Third, to construct the\nHadamard integrator in the Lagrangian formulation efficiently, we use a\nshort-time ray tracing method to obtain wavefront locations accurately, and we\nfurther develop fast algorithms to compute Chebyshev-polynomial based low-rank\nrepresentations of both wavefront locations and variants of Hadamard\ncoefficients. Fourth, equipped with these low-rank representations, we apply\nthe Hadamard integrator to efficiently solve time-dependent wave equations with\nhighly oscillatory initial conditions, where the time step size is independent\nof the initial conditions. By judiciously choosing the medium-dependent time\nstep, our new Hadamard integrator can propagate wave field beyond caustics\nimplicitly and advance spatially overturning waves in time naturally. Moreover,\nsince the integrator is independent of initial conditions, the Hadamard\nintegrator can be applied to many different initial conditions once it is\nconstructed. Both two-dimensional and three-dimensional numerical examples\nillustrate the accuracy and performance of the proposed method.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:25:38 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 02:27:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wei","Yuxiao",""],["Cheng","Jin",""],["Burridge","Robert",""],["Qian","Jianliang",""]]}
{"id":"2308.09233","submitter":"Daniel Mathews","authors":"Daniel V. Mathews","title":"Spinors and horospheres","comments":"24 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give an explicit bijective correspondence between between nonzero pairs of\ncomplex numbers, which we regard as spinors or spin vectors, and horospheres in\n3-dimensional hyperbolic space decorated with certain spinorial directions.\nThis correspondence builds upon work of Penrose--Rindler and Penner. We show\nthat the natural bilinear form on spin vectors describes a certain\ncomplex-valued distance between spin-decorated horospheres, generalising\nPenner's lambda lengths to 3 dimensions.\n  From this, we derive several applications. We show that the complex lambda\nlengths in a hyperbolic ideal tetrahedron satisfy a Ptolemy equation. We also\nobtain correspondences between certain spaces of hyperbolic ideal polygons and\ncertain Grassmannian spaces, under which lambda lengths correspond to\nPl\\\"{u}cker coordinates, illuminating the connection between Grassmannians,\nhyperbolic polygons, and type A cluster algebras.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:43:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mathews","Daniel V.",""]]}
{"id":"2308.09234","submitter":"Mohammad Saeed Ebrahimi Saadabadi","authors":"Sahar Rahimi Malakshan, Mohammad Saeed Ebrahimi Saadabadi, Nima\n  Najafzadeh, Nasser M. Nasrabadi","title":"Deep Boosting Multi-Modal Ensemble Face Recognition with Sample-Level\n  Weighting","comments":"2023 IEEE International Joint Conference on Biometrics (IJCB)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep convolutional neural networks have achieved remarkable success in face\nrecognition (FR), partly due to the abundant data availability. However, the\ncurrent training benchmarks exhibit an imbalanced quality distribution; most\nimages are of high quality. This poses issues for generalization on hard\nsamples since they are underrepresented during training. In this work, we\nemploy the multi-model boosting technique to deal with this issue. Inspired by\nthe well-known AdaBoost, we propose a sample-level weighting approach to\nincorporate the importance of different samples into the FR loss. Individual\nmodels of the proposed framework are experts at distinct levels of sample\nhardness. Therefore, the combination of models leads to a robust feature\nextractor without losing the discriminability on the easy samples. Also, for\nincorporating the sample hardness into the training criterion, we analytically\nshow the effect of sample mining on the important aspects of current angular\nmargin loss functions, i.e., margin and scale. The proposed method shows\nsuperior performance in comparison with the state-of-the-art algorithms in\nextensive experiments on the CFP-FP, LFW, CPLFW, CALFW, AgeDB, TinyFace, IJB-B,\nand IJB-C evaluation datasets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:44:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Malakshan","Sahar Rahimi",""],["Saadabadi","Mohammad Saeed Ebrahimi",""],["Najafzadeh","Nima",""],["Nasrabadi","Nasser M.",""]]}
{"id":"2308.09235","submitter":"Xu Huang","authors":"Xu Huang, Zhiqiang Wang and Shijie Zhou","title":"The Dichotomy Property in Stabilizability of $2\\times2$ Linear\n  Hyperbolic Systems","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 is devoted to discuss the stabilizability of a class of $ 2\n\\times2 $ non-homogeneous hyperbolic systems. Motivated by the example in\n\\cite[Page 197]{CB2016}, we analyze the influence of the interval length $L$ on\nstabilizability of the system. By spectral analysis, we prove that either the\nsystem is stabilizable for all $L>0$ or it possesses the dichotomy property:\nthere exists a critical length $L_c>0$ such that the system is stabilizable for\n$L\\in (0,L_c)$ but unstabilizable for $L\\in [L_c,+\\infty)$. In addition, for\n$L\\in [L_c,+\\infty)$, we obtain that the system can reach equilibrium state in\nfinite time by backstepping control combined with observer. Finally, we also\nprovide some numerical simulations to confirm our developed analytical\ncriteria.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:47:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Xu",""],["Wang","Zhiqiang",""],["Zhou","Shijie",""]]}
{"id":"2308.09236","submitter":"Vanamali Shastry C","authors":"Vanamali Shastry, Wojciech Broniowski, Enrique Ruiz Arriola","title":"Off-shellness in generalized parton distributions and form factors of\n  the pion","comments":"20 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the effects of off-shellness in the generalized parton distributions\nof the pion. On general grounds, these distributions exhibit a richer structure\nthan in the on-shell case due to absence of the crossing symmetry. In\nparticular, their moments involve additional terms odd in the skewness\nparameter, associated with new form factors. We bring up relations between the\noff-shell charge and gravitational form factors, as well as the pion form\nfactor, and discuss their derivations based on the Ward-Takahashi identities.\nWe illustrate the features at the (leading-$N_c$) one-quark-loop level with the\nhelp of the spectral quark model of the pion, constructed to embed the vector\nmeson dominance. Simple analytic expressions for the form factors and the\ndistributions follow. Thus obtained off-shell generalized parton distributions\nare evolved from the quark model scale to higher scales with the LO DGLAP\nequations. We evaluate the corresponding Compton amplitudes which enter the\ncross-section for the electroproduction of the pion off the proton (the\nSullivan process). It is found in our model that the effects of off-shellness\nin the generalized parton distribution are substantial, however, they can be\nlargely canceled by the corresponding off-shell corrections to the pion\npropagator. In particular, this is the case of the Compton form factors\nentering the deeply virtual Compton scattering amplitude. As a result, we\nexpect small off-shellness effects in electroproduction reactions, such as the\nSullivan process.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:47:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shastry","Vanamali",""],["Broniowski","Wojciech",""],["Arriola","Enrique Ruiz",""]]}
{"id":"2308.09237","submitter":"Ziaur Rahman","authors":"Ziaur Rahman, Xun Yi, Ibrahim Khalil, Adnan Anwar and Shantanu Pal","title":"Blockchain-Based and Fuzzy Logic-Enabled False Data Discovery for the\n  Intelligent Autonomous Vehicular System","comments":"11 pages, 11 figures, 4 tables AsiaCCS conference 2023","journal-ref":"ACM Symposium on Information, Computer and Communications Security\n  (ASIA CCS 2023)","doi":"10.1145/3591365.3592947","report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since the beginning of this decade, several incidents report that false data\ninjection attacks targeting intelligent connected vehicles cause huge\nindustrial damage and loss of lives. Data Theft, Flooding, Fuzzing, Hijacking,\nMalware Spoofing and Advanced Persistent Threats have been immensely growing\nattack that leads to end-user conflict by abolishing trust on autonomous\nvehicle. Looking after those sensitive data that contributes to measure the\nlocalisation factors of the vehicle, conventional centralised techniques can be\nmisused to update the legitimate vehicular status maliciously. As investigated,\nthe existing centralized false data detection approach based on state and\nlikelihood estimation has a reprehensible trade-off in terms of accuracy,\ntrust, cost, and efficiency. Blockchain with Fuzzy-logic Intelligence has shown\nits potential to solve localisation issues, trust and false data detection\nchallenges encountered by today's autonomous vehicular system. The proposed\nBlockchain-based fuzzy solution demonstrates a novel false data detection and\nreputation preservation technique. The illustrated proposed model filters false\nand anomalous data based on the vehicles' rules and behaviours. Besides\nimproving the detection accuracy and eliminating the single point of failure,\nthe contributions include appropriating fuzzy AI functions within the Road-side\nUnit node before authorizing status data by a Blockchain network. Finally,\nthorough experimental evaluation validates the effectiveness of the proposed\nmodel.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:47:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rahman","Ziaur",""],["Yi","Xun",""],["Khalil","Ibrahim",""],["Anwar","Adnan",""],["Pal","Shantanu",""]]}
{"id":"2308.09238","submitter":"Carl McMillan","authors":"Carl McMillan, Junhong Zhao, Bing Xue, Ross Vennell, Mengjie Zhang","title":"Improving Buoy Detection with Deep Transfer Learning for Mussel Farm\n  Automation","comments":"7 pages, 5 figures, submitted to ICVNZ 2023 conference\n  https://ivcnz2023.massey.ac.nz/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aquaculture sector in New Zealand is experiencing rapid expansion, with a\nparticular emphasis on mussel exports. As the demands of mussel farming\noperations continue to evolve, the integration of artificial intelligence and\ncomputer vision techniques, such as intelligent object detection, is emerging\nas an effective approach to enhance operational efficiency. This study delves\ninto advancing buoy detection by leveraging deep learning methodologies for\nintelligent mussel farm monitoring and management. The primary objective\ncenters on improving accuracy and robustness in detecting buoys across a\nspectrum of real-world scenarios. A diverse dataset sourced from mussel farms\nis captured and labeled for training, encompassing imagery taken from cameras\nmounted on both floating platforms and traversing vessels, capturing various\nlighting and weather conditions. To establish an effective deep learning model\nfor buoy detection with a limited number of labeled data, we employ transfer\nlearning techniques. This involves adapting a pre-trained object detection\nmodel to create a specialized deep learning buoy detection model. We explore\ndifferent pre-trained models, including YOLO and its variants, alongside data\ndiversity to investigate their effects on model performance. Our investigation\ndemonstrates a significant enhancement in buoy detection performance through\ndeep learning, accompanied by improved generalization across diverse weather\nconditions, highlighting the practical effectiveness of our approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:53:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["McMillan","Carl",""],["Zhao","Junhong",""],["Xue","Bing",""],["Vennell","Ross",""],["Zhang","Mengjie",""]]}
{"id":"2308.09239","submitter":"Kunpeng Zhang","authors":"Kunpeng Zhang, Xiaogang Zhu, Xiao Xi, Minhui Xue, Chao Zhang, Sheng\n  Wen","title":"SHAPFUZZ: Efficient Fuzzing via Shapley-Guided Byte Selection","comments":null,"journal-ref":"Network and Distributed System Security (NDSS) Symposium 2024, 26\n  February - 1 March 2024, San Diego, CA, USA","doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mutation-based fuzzing is popular and effective in discovering unseen code\nand exposing bugs. However, only a few studies have concentrated on quantifying\nthe importance of input bytes, which refers to the degree to which a byte\ncontributes to the discovery of new code. They often focus on obtaining the\nrelationship between input bytes and path constraints, ignoring the fact that\nnot all constraint-related bytes can discover new code. In this paper, we\nconduct Shapely analysis to understand the effect of byte positions on fuzzing\nperformance, and find that some byte positions contribute more than others and\nthis property often holds across seeds. Based on this observation, we propose a\nnovel fuzzing solution, ShapFuzz, to guide byte selection and mutation.\nSpecifically, ShapFuzz updates Shapley values (importance) of bytes when each\ninput is tested during fuzzing with a low overhead, and utilizes contextual\nmulti-armed bandit to trade off between mutating high Shapley value bytes and\nlow-frequently chosen bytes. We implement a prototype of this solution based on\nAFL++, i.e., ShapFuzz. We evaluate ShapFuzz against ten state-of-the-art\nfuzzers, including five byte schedule-reinforced fuzzers and five commonly used\nfuzzers. Compared with byte schedule-reinforced fuzzers, ShapFuzz discovers\nmore edges and exposes more bugs than the best baseline on three different sets\nof initial seeds. Compared with commonly used fuzzers, ShapFuzz exposes 20 more\nbugs than the best comparison fuzzer, and discovers 6 more CVEs than the best\nbaseline on MAGMA. Furthermore, ShapFuzz discovers 11 new bugs on the latest\nversions of programs, and 3 of them are confirmed by vendors.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:59:12 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:10:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Kunpeng",""],["Zhu","Xiaogang",""],["Xi","Xiao",""],["Xue","Minhui",""],["Zhang","Chao",""],["Wen","Sheng",""]]}
{"id":"2308.09240","submitter":"Mark Field","authors":"Mark Field, Angela Q. Chen, Ben Scharmann, Eyob A. Sete, Feyza Oruc,\n  Kim Vu, Valentin Kosenko, Joshua Y. Mutus, Stefano Poletto, Andrew Bestwick","title":"Modular Superconducting Qubit Architecture with a Multi-chip Tunable\n  Coupler","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use a floating tunable coupler to mediate interactions between qubits on\nseparate chips to build a modular architecture. We demonstrate three different\ndesigns of multi-chip tunable couplers using vacuum gap capacitors or\nsuperconducting indium bump bonds to connect the coupler to a microwave line on\na common substrate and then connect to the qubit on the next chip. We show that\nthe zero-coupling condition between qubits on separate chips can be achieved in\neach design and that the relaxation rates for the coupler and qubits are not\nnoticeably affected by the extra circuit elements. Finally, we demonstrate\ntwo-qubit gate operations with fidelity at the same level as qubits with a\ntunable coupler on a single chip. Using one or more indium bonds does not\ndegrade qubit coherence or impact the performance of two-qubit gates.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:00:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Field","Mark",""],["Chen","Angela Q.",""],["Scharmann","Ben",""],["Sete","Eyob A.",""],["Oruc","Feyza",""],["Vu","Kim",""],["Kosenko","Valentin",""],["Mutus","Joshua Y.",""],["Poletto","Stefano",""],["Bestwick","Andrew",""]]}
{"id":"2308.09241","submitter":"Wang Rui","authors":"Rui Wang, Tao Yang, Baigeng Wang, X. C. Xie","title":"Susceptibility indicator for chiral topological orders emergent from\n  correlated fermions","comments":"20 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":"  Chiral topological orders formed in correlated fermion systems have been\nwidely explored. However, the mechanism on how they emerge from interacting\nfermions is still unclear. Here, we propose a susceptibility condition. Under\nthis condition, we show that chiral topological orders can spontaneously take\nplace in correlated fermion systems. The condition leads to a low-energy\neffective theory of bosons with strong frustration, mimicking the flat band\nsystems. The frustration then melts the long-range orders and results in\ntopological orders with time-reversal symmetry breaking. We apply the theory to\nstrongly-correlated semiconductors doped to the metallic phase. A novel\nexcitonic topological order with semionic excitations and chiral excitonic edge\nstate is revealed, which goes beyond the common knowledge that excitonic phases\nare generally formed in semimetals or semiconductors. These results demonstrate\nan unprecedented indicator for chiral topological orders, which bridges the\nexisting gap between interacting fermions and correlated topological matter.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:01:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Rui",""],["Yang","Tao",""],["Wang","Baigeng",""],["Xie","X. C.",""]]}
{"id":"2308.09242","submitter":"Shenghao Fu","authors":"Shenghao Fu, Junkai Yan, Yipeng Gao, Xiaohua Xie, Wei-Shi Zheng","title":"ASAG: Building Strong One-Decoder-Layer Sparse Detectors via Adaptive\n  Sparse Anchor Generation","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":"  Recent sparse detectors with multiple, e.g. six, decoder layers achieve\npromising performance but much inference time due to complex heads. Previous\nworks have explored using dense priors as initialization and built\none-decoder-layer detectors. Although they gain remarkable acceleration, their\nperformance still lags behind their six-decoder-layer counterparts by a large\nmargin. In this work, we aim to bridge this performance gap while retaining\nfast speed. We find that the architecture discrepancy between dense and sparse\ndetectors leads to feature conflict, hampering the performance of\none-decoder-layer detectors. Thus we propose Adaptive Sparse Anchor Generator\n(ASAG) which predicts dynamic anchors on patches rather than grids in a sparse\nway so that it alleviates the feature conflict problem. For each image, ASAG\ndynamically selects which feature maps and which locations to predict, forming\na fully adaptive way to generate image-specific anchors. Further, a simple and\neffective Query Weighting method eases the training instability from\nadaptiveness. Extensive experiments show that our method outperforms\ndense-initialized ones and achieves a better speed-accuracy trade-off. The code\nis available at \\url{https://github.com/iSEE-Laboratory/ASAG}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:06:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fu","Shenghao",""],["Yan","Junkai",""],["Gao","Yipeng",""],["Xie","Xiaohua",""],["Zheng","Wei-Shi",""]]}
{"id":"2308.09243","submitter":"Masaki Kashiwara","authors":"Masaki Kashiwara, Myungho Kim, Se-jin Oh and Euiyong Park","title":"Localizations for quiver Hecke algebras III","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $R$ be a quiver Hecke algebra, and let $\\mathcal{C}_{w,v}$ be the\ncategory of finite-dimensional graded $R$-module categorifying a\n$q$-deformation of the doubly-invariant algebra $^{N'(w)} \\mathbb{C}[N] ^{N(v)}\n$. In this paper, we prove that the localization $\\tilde{\\mathcal{C}}_{w,v}$ of\nthe category $\\mathcal{C}_{w,v}$ can be obtained as the localization by right\nbraiders arising from determinantial modules. As its application, we show\nseveral interesting properties of the localized category\n$\\tilde{\\mathcal{C}}_{w,v} $ including the right rigidity.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:07:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kashiwara","Masaki",""],["Kim","Myungho",""],["Oh","Se-jin",""],["Park","Euiyong",""]]}
{"id":"2308.09244","submitter":"Haisong Liu","authors":"Haisong Liu, Yao Teng, Tao Lu, Haiguang Wang, Limin Wang","title":"SparseBEV: High-Performance Sparse 3D Object Detection from Multi-Camera\n  Videos","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":"  Camera-based 3D object detection in BEV (Bird's Eye View) space has drawn\ngreat attention over the past few years. Dense detectors typically follow a\ntwo-stage pipeline by first constructing a dense BEV feature and then\nperforming object detection in BEV space, which suffers from complex view\ntransformations and high computation cost. On the other side, sparse detectors\nfollow a query-based paradigm without explicit dense BEV feature construction,\nbut achieve worse performance than the dense counterparts. In this paper, we\nfind that the key to mitigate this performance gap is the adaptability of the\ndetector in both BEV and image space. To achieve this goal, we propose\nSparseBEV, a fully sparse 3D object detector that outperforms the dense\ncounterparts. SparseBEV contains three key designs, which are (1)\nscale-adaptive self attention to aggregate features with adaptive receptive\nfield in BEV space, (2) adaptive spatio-temporal sampling to generate sampling\nlocations under the guidance of queries, and (3) adaptive mixing to decode the\nsampled features with dynamic weights from the queries. On the test split of\nnuScenes, SparseBEV achieves the state-of-the-art performance of 67.5 NDS. On\nthe val split, SparseBEV achieves 55.8 NDS while maintaining a real-time\ninference speed of 23.5 FPS. Code is available at\nhttps://github.com/MCG-NJU/SparseBEV.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:11:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Haisong",""],["Teng","Yao",""],["Lu","Tao",""],["Wang","Haiguang",""],["Wang","Limin",""]]}
{"id":"2308.09245","submitter":"Zhiqiang Shen","authors":"Zhiqiang Shen and Xiaoxiao Sheng and Hehe Fan and Longguang Wang and\n  Yulan Guo and Qiong Liu and Hao Wen and Xi Zhou","title":"Masked Spatio-Temporal Structure Prediction for Self-supervised Learning\n  on Point Cloud Videos","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, the community has made tremendous progress in developing effective\nmethods for point cloud video understanding that learn from massive amounts of\nlabeled data. However, annotating point cloud videos is usually notoriously\nexpensive. Moreover, training via one or only a few traditional tasks (e.g.,\nclassification) may be insufficient to learn subtle details of the\nspatio-temporal structure existing in point cloud videos. In this paper, we\npropose a Masked Spatio-Temporal Structure Prediction (MaST-Pre) method to\ncapture the structure of point cloud videos without human annotations. MaST-Pre\nis based on spatio-temporal point-tube masking and consists of two\nself-supervised learning tasks. First, by reconstructing masked point tubes,\nour method is able to capture the appearance information of point cloud videos.\nSecond, to learn motion, we propose a temporal cardinality difference\nprediction task that estimates the change in the number of points within a\npoint tube. In this way, MaST-Pre is forced to model the spatial and temporal\nstructure in point cloud videos. Extensive experiments on MSRAction-3D,\nNTU-RGBD, NvGesture, and SHREC'17 demonstrate the effectiveness of the proposed\nmethod.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:12:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shen","Zhiqiang",""],["Sheng","Xiaoxiao",""],["Fan","Hehe",""],["Wang","Longguang",""],["Guo","Yulan",""],["Liu","Qiong",""],["Wen","Hao",""],["Zhou","Xi",""]]}
{"id":"2308.09246","submitter":"Eduardo Guendelman I","authors":"Eduardo Guendelman","title":"Holomorphic General Coordinate Invariant Modified Measure Gravitational\n  Theory","comments":"additional references added. It is also pointed out that an action\n  for Finsler geometry, with a small modification can serve as a Holomorphic\n  General Coordinate Invariant Modified Measure Gravitational Theory. arXiv\n  admin note: substantial text overlap with arXiv:2304.04056","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Complexifying space time has many interesting applications, from the\nconstruction of higher dimensional unification, to provide a useful framework\nfor quantum gravity and to better define some local symmetries that suffer\nsingularities in real space time. In this context here spacetime is extended to\ncomplex spacetime and standard general coordinate invariance is also extended\nto complex holomorphic general coordinate transformations. This is possible by\nintroducing a non Riemannian Measure of integration, which transforms avoiding\nnon holomorphic behavior . Instead the measure transforms according to the\ninverse of the jacobian of the coordinate transformation and avoids the\ntraditional square root of the determinant of the metric $\\sqrt{-g}$. which is\nnot globally holomorphic , or the determinant of the vierbein which is\nsensitive to the vierbein orientations and not invariant under local lorentz\ntransformations with negative determinants. It is impossible to introduce a\ncosmological constant term in the complex holomorphic invariant theory action,\nbut a cosmological term appears as an integration constant in the equations of\nmotion. A proposed action for Finsler geometry, which involves $-g$ rather than\n$\\sqrt{-g}$ will also constitute an example of a Holomorphic General Coordinate\nInvariant Modified Measure Gravitational Theory.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:14:37 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 15:29:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Guendelman","Eduardo",""]]}
{"id":"2308.09247","submitter":"Zhiqiang Shen","authors":"Xiaoxiao Sheng and Zhiqiang Shen and Gang Xiao and Longguang Wang and\n  Yulan Guo and Hehe Fan","title":"Point Contrastive Prediction with Semantic Clustering for\n  Self-Supervised Learning on Point Cloud Videos","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a unified point cloud video self-supervised learning framework for\nobject-centric and scene-centric data. Previous methods commonly conduct\nrepresentation learning at the clip or frame level and cannot well capture\nfine-grained semantics. Instead of contrasting the representations of clips or\nframes, in this paper, we propose a unified self-supervised framework by\nconducting contrastive learning at the point level. Moreover, we introduce a\nnew pretext task by achieving semantic alignment of superpoints, which further\nfacilitates the representations to capture semantic cues at multiple scales. In\naddition, due to the high redundancy in the temporal dimension of dynamic point\nclouds, directly conducting contrastive learning at the point level usually\nleads to massive undesired negatives and insufficient modeling of positive\nrepresentations. To remedy this, we propose a selection strategy to retain\nproper negatives and make use of high-similarity samples from other instances\nas positive supplements. Extensive experiments show that our method outperforms\nsupervised counterparts on a wide range of downstream tasks and demonstrates\nthe superior transferability of the learned representations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:17:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sheng","Xiaoxiao",""],["Shen","Zhiqiang",""],["Xiao","Gang",""],["Wang","Longguang",""],["Guo","Yulan",""],["Fan","Hehe",""]]}
{"id":"2308.09248","submitter":"Jiwoong Im","authors":"Daniel Jiwoong Im, Kyunghyun Cho","title":"Active and Passive Causal Inference Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper serves as a starting point for machine learning researchers,\nengineers and students who are interested in but not yet familiar with causal\ninference. We start by laying out an important set of assumptions that are\ncollectively needed for causal identification, such as exchangeability,\npositivity, consistency and the absence of interference. From these\nassumptions, we build out a set of important causal inference techniques, which\nwe do so by categorizing them into two buckets; active and passive approaches.\nWe describe and discuss randomized controlled trials and bandit-based\napproaches from the active category. We then describe classical approaches,\nsuch as matching and inverse probability weighting, in the passive category,\nfollowed by more recent deep learning based algorithms. By finishing the paper\nwith some of the missing aspects of causal inference from this paper, such as\ncollider biases, we expect this paper to provide readers with a diverse set of\nstarting points for further reading and research in causal inference and\ndiscovery.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:23:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Im","Daniel Jiwoong",""],["Cho","Kyunghyun",""]]}
{"id":"2308.09249","submitter":"Dongxu Lyu","authors":"Dongxu Lyu, Zhenyu Li, Yuzhou Chen, Jinming Zhang, Ningyi Xu, Guanghui\n  He","title":"SpOctA: A 3D Sparse Convolution Accelerator with Octree-Encoding-Based\n  Map Search and Inherent Sparsity-Aware Processing","comments":"Accepted to ICCAD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Point-cloud-based 3D perception has attracted great attention in various\napplications including robotics, autonomous driving and AR/VR. In particular,\nthe 3D sparse convolution (SpConv) network has emerged as one of the most\npopular backbones due to its excellent performance. However, it poses severe\nchallenges to real-time perception on general-purpose platforms, such as\nlengthy map search latency, high computation cost, and enormous memory\nfootprint. In this paper, we propose SpOctA, a SpConv accelerator that enables\nhigh-speed and energy-efficient point cloud processing. SpOctA parallelizes the\nmap search by utilizing algorithm-architecture co-optimization based on octree\nencoding, thereby achieving 8.8-21.2x search speedup. It also attenuates the\nheavy computational workload by exploiting inherent sparsity of each voxel,\nwhich eliminates computation redundancy and saves 44.4-79.1% processing\nlatency. To optimize on-chip memory management, a SpConv-oriented non-uniform\ncaching strategy is introduced to reduce external memory access energy by 57.6%\non average. Implemented on a 40nm technology and extensively evaluated on\nrepresentative benchmarks, SpOctA rivals the state-of-the-art SpConv\naccelerators by 1.1-6.9x speedup with 1.5-3.1x energy efficiency improvement.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:23:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lyu","Dongxu",""],["Li","Zhenyu",""],["Chen","Yuzhou",""],["Zhang","Jinming",""],["Xu","Ningyi",""],["He","Guanghui",""]]}
{"id":"2308.09250","submitter":"Anastasis Kratsios","authors":"Anastasis Kratsios, Ruiyang Hong, Haitz S\\'aez de Oc\\'ariz Borde","title":"Capacity Bounds for Hyperbolic Neural Network Representations of Latent\n  Tree Structures","comments":"22 Pages + References, 1 Table, 4 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DM cs.NA cs.NE math.MG math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the representation capacity of deep hyperbolic neural networks\n(HNNs) with a ReLU activation function. We establish the first proof that HNNs\ncan $\\varepsilon$-isometrically embed any finite weighted tree into a\nhyperbolic space of dimension $d$ at least equal to $2$ with prescribed\nsectional curvature $\\kappa<0$, for any $\\varepsilon> 1$ (where $\\varepsilon=1$\nbeing optimal). We establish rigorous upper bounds for the network complexity\non an HNN implementing the embedding. We find that the network complexity of\nHNN implementing the graph representation is independent of the representation\nfidelity/distortion. We contrast this result against our lower bounds on\ndistortion which any ReLU multi-layer perceptron (MLP) must exert when\nembedding a tree with $L>2^d$ leaves into a $d$-dimensional Euclidean space,\nwhich we show at least $\\Omega(L^{1/d})$; independently of the depth, width,\nand (possibly discontinuous) activation function defining the MLP.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:24:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kratsios","Anastasis",""],["Hong","Ruiyang",""],["Borde","Haitz S\u00e1ez de Oc\u00e1riz",""]]}
{"id":"2308.09251","submitter":"Qingbo Liu","authors":"Qing-Bo Liu, Xiang-Feng Yang, Zhe-Qi Wang, Ziyang Yu, Lun Xiong, and\n  Hua-Hua Fu","title":"Catalogue of topological electrons and phonons in all allotropes of\n  carbon","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":"  Carbon, as one of the most common element in the earth, constructs hundreds\nof allotropic phases to present rich physical nature. In this work, by\ncombining the ab inito calculations and symmetry analyses method, we\nsystematically study a large number of allotropes of carbon (703), and\ndiscovered 315 ideal topological phononic materials and 32 topological\nelectronic materials. The ideal topological phononic nature includes single,\ncharge-two, three, four Weyl honons, the Dirac or Weyl nodal lines phonons, and\nnodal surfaces phonons. And the topological electron nature ncludes topological\ninsulator, (Type-II) Dirac points, triple nodal points, the Dirac (Weyl) nodal\nlines, quadratic nodal lines and so on. For convenience, we take the uni in SG\n178 and pbg in SG 230 as the examples to describe the topological features in\nthe main. We find that it is the coexistence of single pair Weyl phonons and\none-nodal surfaces phonons in the uni in SG 178, which can form the single\nsurface arc in the (100) surface BZ and isolated double-helix surface states\n(IDHSSs)in the (110) surface BZ. In topological semimetal pbg in SG 230, we\nfind that the perfect triple degenerate nodal point can be found in the near\nFermi level, and it can form the clear surface states in the (001) and (110)\nsurface BZ. Our work not only greatly expands the topological features in all\nallotropes of carbon, but also provide many ideal platforms to study the\ntopological electrons and phonons.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:26:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Qing-Bo",""],["Yang","Xiang-Feng",""],["Wang","Zhe-Qi",""],["Yu","Ziyang",""],["Xiong","Lun",""],["Fu","Hua-Hua",""]]}
{"id":"2308.09252","submitter":"Kallol Paul","authors":"Suvendu Jana, Pintu Bhunia and Kallol Paul","title":"Euclidean operator radius and numerical radius inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $T$ be a bounded linear operator on a complex Hilbert space\n$\\mathscr{H}.$ We obtain various lower and upper bounds for the numerical\nradius of $T$ by developing the Euclidean operator radius bounds of a pair of\noperators, which are stronger than the existing ones. In particular, we develop\nan inequality that improves on the inequality $$ w(T) \\geq \\frac12\n{\\|T\\|}+\\frac14 {\\left|\\|Re(T)\\|-\\frac12 \\|T\\| \\right|} + \\frac14 { \\left|\n\\|Im(T)\\|-\\frac12 \\|T\\| \\right|}.$$ Various equality conditions of the existing\nnumerical radius inequalities are also provided. Further, we study the\nnumerical radius inequalities of $2\\times 2$ off-diagonal operator matrices.\nApplying the numerical radius bounds of operator matrices, we develop the upper\nbounds of $w(T)$ by using $t$-Aluthge transform. In particular, we improve the\nwell known inequality\n  $$ w(T) \\leq \\frac12 {\\|T\\|}+ \\frac12{ w(\\widetilde{T})}, $$ where\n$\\widetilde{T}=|T|^{1/2}U|T|^{1/2}$ is the Aluthge transform of $T$ and\n$T=U|T|$ is the polar decomposition of $T$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:26:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jana","Suvendu",""],["Bhunia","Pintu",""],["Paul","Kallol",""]]}
{"id":"2308.09253","submitter":"Masahiro Manago","authors":"Masahiro Manago, Ayano Ishigaki, Hideki Tou, Hisatomo Harima, Hiroshi\n  Tanida, and Hisashi Kotegawa","title":"Ferroic quadrupolar ordering in CeCoSi revealed using $^{59}$Co-NMR\n  measurements","comments":"7 pages, 6 figures, 1 table","journal-ref":"Phys. Rev. B 108, 085118 (2023)","doi":"10.1103/PhysRevB.108.085118","report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A nonmagnetic phase transition at $T_0 \\sim 12$ K in the tetragonal system\nCeCoSi with a Kramers doublet ground state is reminiscent of an electric\nquadrupole ordering, even though its well-separated crystal-electric-field\n(CEF) levels are unlikely to acquire higher-order multipole degrees of freedom.\nHere, we report $^{59}$Co nuclear magnetic resonance (NMR) studies that are\nhighly compatible with a ferroic quadrupole ordering below $T_0$. Changes in\nthe NMR spectra below $T_0$ suggest that an external magnetic field induces\nferroic Ce dipole moments orthogonal to the field, enabling domain selection in\nthe nonmagnetic phase. Our findings suggest the presence of a ferroic\n$O_{zx}$-type quadrupole component in CeCoSi and demonstrate that quadrupole\nordering may occur under well-separated CEF levels in tetragonal systems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:27:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Manago","Masahiro",""],["Ishigaki","Ayano",""],["Tou","Hideki",""],["Harima","Hisatomo",""],["Tanida","Hiroshi",""],["Kotegawa","Hisashi",""]]}
{"id":"2308.09254","submitter":"Daniel Violette","authors":"Daniel P. Violette, Branden Allen, Jaesub Hong, Hiromasa Miyasaka,\n  Jonathan Grindlay","title":"Tuning of Nuclear Spectroscopic Telescope Array (NuSTAR) Application\n  Specific Integrated Circuits (ASICs) to improve low energy threshold of\n  future Hard X-ray Imaging Detectors","comments":"20 pages, 11 figures, published in JATIS","journal-ref":"JATIS Vol. 9, Issue 01, 016001 (January 2023)","doi":"10.1117/1.JATIS.9.1.016001","report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detector commanding, processing and readout of spaceborne instrumentation is\noften accomplished with Application Specific Integrated Circuits (ASICs). The\nASIC designed for the Nuclear Spectroscopic Telescope Array (NuSTAR) mission\n(NuASIC) enables future tiled CdZnTe (CZT) detector array readout for x-ray\ndetectors such as the High Resolution Energetic X-ray Imager (HREXI). Modified\nNuASIC gain settings have been implemented for HREXI's broader targeted imaging\nenergy range (3-300 keV) compared to NuSTAR (2-79 keV), which may require\nupdated NuASIC internal parameters for optimal energy resolution. To reach\nHREXI's targeted low energy threshold, we have also enabled the NuASIC's\n\"Charge Pump Mode\" (CPM), which introduces an additional tuning parameter. In\nthis paper, we describe the mechanics of the NuASIC's adjustable parameters and\nuse our recently developed ASIC Test Stand (ATS) to probe a \"bare\" NuASIC using\nits internal test pulser. We record the effects of parameter tuning on the\ndevice's electronics noise and low energy threshold and report the optimal set\nof parameters for HREXI's updated gain setting. We detail a semi-automated\nprocedure to derive the optimal parameters for each of HREXI's large area,\nclosely tiled NuASIC/CZT detectors to expedite instrument integration.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:27:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Violette","Daniel P.",""],["Allen","Branden",""],["Hong","Jaesub",""],["Miyasaka","Hiromasa",""],["Grindlay","Jonathan",""]]}
{"id":"2308.09255","submitter":"Max Goldberg","authors":"Max Goldberg, Daniel Fabrycky, David V. Martin, Simon Albrecht, Hans\n  J. Deeg, Grzegorz Nowak","title":"A $5M_\\text{Jup}$ Non-Transiting Coplanar Circumbinary Planet Around\n  Kepler-1660AB","comments":"Resubmitted to MNRAS following positive referee report","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over a dozen transiting circumbinary planets have been discovered around\neclipsing binaries. Transit detections are biased towards aligned planet and\nbinary orbits, and indeed all of the known planets have mutual inclinations\nless than $4.5^{\\circ}$. One path to discovering circumbinary planets with\nmisaligned orbits is through eclipse timing variations (ETVs) of non-transiting\nplanets. Borkovits et al. (2016) discovered ETVs on the 18.6 d binary\nKepler-1660AB, indicative of a third body on a $\\approx 236$ d period, with a\nmisaligned orbit and a potentially planetary mass. Getley et al. (2017) agreed\nwith the planetary hypothesis, arguing for a $7.7M_{\\rm Jup}$ circumbinary\nplanet on an orbit that is highly misaligned by $120^{\\circ}$ with respect to\nthe binary. In this paper, we obtain the first radial velocities of the binary.\nWe combine these with an analysis of not only the ETVs but also the eclipse\ndepth variations. We confirm the existence of a $239.5$ d circumbinary planet,\nbut with a lower mass of $4.87M_{\\rm Jup}$ and a coplanar orbit. The misaligned\norbits proposed by previous authors are definitively ruled out by a lack of\neclipse depth variations. Kepler-1660ABb is the first confirmed circumbinary\nplanet found using ETVs around a main sequence binary.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:29:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Goldberg","Max",""],["Fabrycky","Daniel",""],["Martin","David V.",""],["Albrecht","Simon",""],["Deeg","Hans J.",""],["Nowak","Grzegorz",""]]}
{"id":"2308.09256","submitter":"Xinwei Deng","authors":"Xiaoning Kang, Jiayi Lian and Xinwei Deng","title":"On Block Cholesky Decomposition for Sparse Inverse Covariance Estimation","comments":null,"journal-ref":"Statistica Sinica 2023","doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The modified Cholesky decomposition is popular for inverse covariance\nestimation, but often needs pre-specification on the full information of\nvariable ordering. In this work, we propose a block Cholesky decomposition\n(BCD) for estimating inverse covariance matrix under the partial information of\nvariable ordering, in the sense that the variables can be divided into several\ngroups with available ordering among groups, but variables within each group\nhave no orderings. The proposed BCD model provides a unified framework for\nseveral existing methods including the modified Cholesky decomposition and the\nGraphical lasso. By utilizing the partial information on variable ordering, the\nproposed BCD model guarantees the positive definiteness of the estimated matrix\nwith statistically meaningful interpretation. Theoretical results are\nestablished under regularity conditions. Simulation and case studies are\nconducted to evaluate the proposed BCD model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:30:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kang","Xiaoning",""],["Lian","Jiayi",""],["Deng","Xinwei",""]]}
{"id":"2308.09257","submitter":"Amr Elsayed Abdelfattah","authors":"Amr Elsayed, Tomas Cerny, Jorge Yero Salazar, Austin Lehman, Joshua\n  Hunter, Ashley Bickham and Davide Taibi","title":"End-to-End Test Coverage Metrics in Microservice Systems: An Automated\n  Approach","comments":"This paper is accepted for publication at ESOCC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microservice architecture gains momentum by fueling systems with cloud-native\nbenefits, scalability, and decentralized evolution. However, new challenges\nemerge for end-to-end (E2E) testing. Testers who see the decentralized system\nthrough the user interface might assume their tests are comprehensive, covering\nall middleware endpoints scattered across microservices. However, they do not\nhave instruments to verify such assumptions. This paper introduces test\ncoverage metrics for evaluating the extent of E2E test suite coverage for\nmicroservice endpoints. Next, it presents an automated approach to compute\nthese metrics to provide feedback on the completeness of E2E test suites.\nFurthermore, a visual perspective is provided to highlight test coverage across\nthe system's microservices to guide on gaps in test suites. We implement a\nproof-of-concept tool and perform a case study on a well-established system\nbenchmark showing it can generate conclusive feedback on test suite coverage\nover system endpoints.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:30:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Elsayed","Amr",""],["Cerny","Tomas",""],["Salazar","Jorge Yero",""],["Lehman","Austin",""],["Hunter","Joshua",""],["Bickham","Ashley",""],["Taibi","Davide",""]]}
{"id":"2308.09258","submitter":"Kallol Paul","authors":"Pintu Bhunia, Suvendu Jana and Kallol Paul","title":"Estimations of Euclidean operator radius","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop several Euclidean operator radius bounds for the product of two\n$d$-tuple operators using positivity criteria of a $2\\times 2$ block matrix\nwhose entries are $d$-tuple operators. From these bounds, by using the polar\ndecomposition of operators, we obtain Euclidean operator radius bounds for\n$d$-tuple operators. Among many other interesting bounds, it is shown that\n\\begin{eqnarray*} w_e(\\mathbf{A}) &\\leq&\\frac1{\\sqrt2}\n\\mathbf{A}\\|^{1/2}\\sqrt{\\left\\|\\sum_{k=1}^{d} (|A_k|+|A_k^*|)\\right\\|},\n\\end{eqnarray*} where $w_e(\\mathbf{A})$ and $\\|\\mathbf{A}\\|$ are the Euclidean\noperator radius and the Euclidean operator norm, respectively, of a $d$-tuple\noperator $\\mathbf{A}=(A_1,A_2, \\ldots,A_d).$ Further, we develop an upper bound\nfor the Euclidean operator radius of $n\\times n$ operator matrix whose entries\nare $d$-tuple operators. In particular, it is proved that if $\\begin{bmatrix}\n\\mathbf{A_{ij}} \\end{bmatrix}_{n\\times n}$ is an $n\\times n$ operator matrix\nthen $$ w_e\\left( \\begin{bmatrix} \\mathbf{A_{ij}} \\end{bmatrix}_{n\\times\nn}\\right)\\leq w \\left(\\begin{bmatrix} a_{ij} \\end{bmatrix}_{n\\times\nn}\\right),$$ where each $\\mathbf{A_{ij}}$ is a $d$-tuple operator, $1\\leq\ni,j\\leq n$, $a_{ij}=w_e(\\mathbf{A_{ij}})\\, \\textit{ if i=j}$, $a_{ij}=\n\\sqrt{w_e\\left(|\\mathbf{A_{ji}|}+|\\mathbf{A_{ij}^*}|\\right)w_e\\left(|\\mathbf{A_{ij}|}+|\\mathbf{A_{ji}^*}|\\right)}\\,\\textit{\nif $i<j$}$, and $a_{ij}= 0\\,\\textit{ if $i>j$}.$ Other related applications are\nalso discussed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:32:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhunia","Pintu",""],["Jana","Suvendu",""],["Paul","Kallol",""]]}
{"id":"2308.09259","submitter":"Jielong Yang","authors":"Rui Ding, Jielong Yang, Feng Ji, Xionghu Zhong, Linbo Xie","title":"Distribution shift mitigation at test time with performance guarantees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to inappropriate sample selection and limited training data, a\ndistribution shift often exists between the training and test sets. This shift\ncan adversely affect the test performance of Graph Neural Networks (GNNs).\nExisting approaches mitigate this issue by either enhancing the robustness of\nGNNs to distribution shift or reducing the shift itself. However, both\napproaches necessitate retraining the model, which becomes unfeasible when the\nmodel structure and parameters are inaccessible. To address this challenge, we\npropose FR-GNN, a general framework for GNNs to conduct feature reconstruction.\nFRGNN constructs a mapping relationship between the output and input of a\nwell-trained GNN to obtain class representative embeddings and then uses these\nembeddings to reconstruct the features of labeled nodes. These reconstructed\nfeatures are then incorporated into the message passing mechanism of GNNs to\ninfluence the predictions of unlabeled nodes at test time. Notably, the\nreconstructed node features can be directly utilized for testing the\nwell-trained model, effectively reducing the distribution shift and leading to\nimproved test performance. This remarkable achievement is attained without any\nmodifications to the model structure or parameters. We provide theoretical\nguarantees for the effectiveness of our framework. Furthermore, we conduct\ncomprehensive experiments on various public datasets. The experimental results\ndemonstrate the superior performance of FRGNN in comparison to mainstream\nmethods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:34:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ding","Rui",""],["Yang","Jielong",""],["Ji","Feng",""],["Zhong","Xionghu",""],["Xie","Linbo",""]]}
{"id":"2308.09260","submitter":"Pavel Salev","authors":"Pavel Salev, Lorenzo Frantino, Dayne Sasaki, Soumen Bag, Yayoi\n  Takamura, Marcelo Rozenberg, Ivan K. Schuller","title":"Magnetoresistance anomaly during the electrical triggering of a\n  metal-insulator transition","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":"  Phase separation naturally occurs in a variety of magnetic materials and it\noften has a major impact on both electric and magnetotransport properties. In\nresistive switching systems, phase separation can be created on demand by\ninducing local switching, which provides an opportunity to tune the electronic\nand magnetic state of the device by applying voltage. Here we explore the\nmagnetotransport properties in the ferromagnetic oxide (La,Sr)MnO3 (LSMO)\nduring the electrical triggering of an intrinsic metal-insulator transition\n(MIT) that produces volatile resistive switching. This switching occurs in a\ncharacteristic spatial pattern, i.e., the formation of an insulating barrier\nperpendicular to the current flow, enabling an electrically actuated\nferromagnetic-paramagnetic-ferromagnetic phase separation. At the threshold\nvoltage of the MIT triggering, both anisotropic and colossal magnetoresistances\nexhibit anomalies including a large increase in magnitude and a sign flip.\nComputational analysis revealed that these anomalies originate from the\ncoupling between the switching-induced phase separation state and the intrinsic\nmagnetoresistance of LSMO. This work demonstrates that driving the MIT material\ninto an out-of-equilibrium resistive switching state provides the means to\nelectrically control of the magnetotransport phenomena.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:35:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salev","Pavel",""],["Frantino","Lorenzo",""],["Sasaki","Dayne",""],["Bag","Soumen",""],["Takamura","Yayoi",""],["Rozenberg","Marcelo",""],["Schuller","Ivan K.",""]]}
{"id":"2308.09261","submitter":"Kallol Paul","authors":"Suvendu Jana, Pintu Bhunia and Kallol Paul","title":"Refinements of generalized Euclidean operator radius inequalities of\n  2-tuple operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop several upper and lower bounds for the $A$-Euclidean operator\nradius of $2$-tuple operators admitting $A$-adjoint, and show that they refine\nthe earlier related bounds. As an application of the bounds developed here, we\nobtain sharper $A$-numerical radius bounds.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:36:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jana","Suvendu",""],["Bhunia","Pintu",""],["Paul","Kallol",""]]}
{"id":"2308.09262","submitter":"Ryandhimas Zezario","authors":"Ryandhimas E. Zezario, Bo-Ren Brian Bai, Chiou-Shann Fuh, Hsin-Min\n  Wang and Yu Tsao","title":"Multi-Task Pseudo-Label Learning for Non-Intrusive Speech Quality\n  Assessment Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study introduces multi-task pseudo-label (MPL) learning for a\nnon-intrusive speech quality assessment model. MPL consists of two stages which\nare obtaining pseudo-label scores from a pretrained model and performing\nmulti-task learning. The 3QUEST metrics, namely Speech-MOS (S-MOS), Noise-MOS\n(N-MOS), and General-MOS (G-MOS) are selected as the primary ground-truth\nlabels. Additionally, the pretrained MOSA-Net model is utilized to estimate\nthree pseudo-labels: perceptual evaluation of speech quality (PESQ), short-time\nobjective intelligibility (STOI), and speech distortion index (SDI). Multi-task\nlearning stage of MPL is then employed to train the MTQ-Net model (multi-target\nspeech quality assessment network). The model is optimized by incorporating\nLoss supervision (derived from the difference between the estimated score and\nthe real ground-truth labels) and Loss semi-supervision (derived from the\ndifference between the estimated score and pseudo-labels), where Huber loss is\nemployed to calculate the loss function. Experimental results first demonstrate\nthe advantages of MPL compared to training the model from scratch and using\nknowledge transfer mechanisms. Secondly, the benefits of Huber Loss in\nimproving the prediction model of MTQ-Net are verified. Finally, the MTQ-Net\nwith the MPL approach exhibits higher overall prediction capabilities when\ncompared to other SSL-based speech assessment models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:36:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zezario","Ryandhimas E.",""],["Bai","Bo-Ren Brian",""],["Fuh","Chiou-Shann",""],["Wang","Hsin-Min",""],["Tsao","Yu",""]]}
{"id":"2308.09263","submitter":"Denise Gorse Dr.","authors":"Piotr Pomorski, Denise Gorse","title":"Multi-Period Portfolio Optimisation Using a Regime-Switching Predictive\n  Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Regime-switching poses both problems and opportunities for portfolio\nmanagers. If a switch in the behaviour of the markets is not quickly detected\nit can be a source of loss, since previous trading positions may be\ninappropriate in the new regime. However, if a regime-switch can be detected\nquickly, and especially if it can be predicted ahead of time, these changes in\nmarket behaviour can instead be a source of substantial profit. The work of\nthis paper builds on two previous works by the authors, the first of these\ndealing with regime detection and the second, which is an extension of the\nfirst, with regime prediction. Specifically, this work uses our previous\nregime-prediction model (KMRF) within a framework of multi-period portfolio\noptimisation, achieved by model predictive control, (MPC), with the\nKMRF-derived return estimates accuracy-boosted by means of a novel use of a\nKalman filter. The resulting proposed model, which we term the KMRF+MPC model,\nto reflect its constituent methodologies, is demonstrated to outperform\nindustry-standard benchmarks, even though it is restricted, in order to be\nacceptable to the widest range of investors, to long-only positions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:36:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pomorski","Piotr",""],["Gorse","Denise",""]]}
{"id":"2308.09264","submitter":"Kwong Yu Chong","authors":"Kwong Yu Chong","title":"Black-Litterman, Bayesian Shrinkage, and Factor Models in Portfolio\n  Selection: You Can Have It All","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mean-variance analysis is widely used in portfolio management to identify the\nbest portfolio that makes an optimal trade-off between expected return and\nvolatility. Yet, this method has its limitations, notably its vulnerability to\nestimation errors and its reliance on historical data. While shrinkage\nestimators and factor models have been introduced to improve estimation\naccuracy through bias-variance trade-offs, and the Black-Litterman model has\nbeen developed to integrate investor opinions, a unified framework combining\nthree approaches has been lacking. Our study debuts a Bayesian blueprint that\nfuses shrinkage estimation with view inclusion, conceptualizing both as\nBayesian updates. This model is then applied within the context of the\nFama-French approach factor models, thereby integrating the advantages of each\nmethodology. Finally, through a comprehensive empirical study in the US equity\nmarket spanning a decade, we show that the model outperforms both the simple\n$1/N$ portfolio and the optimal portfolios based on sample estimators.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:42:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chong","Kwong Yu",""]]}
{"id":"2308.09265","submitter":"Zheng Sun","authors":"Zheng Sun and Yulong Xing","title":"On a numerical artifact of solving shallow water equations with a\n  discontinuous bottom: Analysis and a nontransonic fix","comments":"37 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study a numerical artifact of solving the nonlinear shallow\nwater equations with a discontinuous bottom topography. For various first-order\nschemes, the numerical solution of the momentum will form a spurious spike at\nthe discontinuous points of the bottom, which should not exist in the exact\nsolution. The height of the spike cannot be reduced even after the mesh is\nrefined. For subsonic problems, this numerical artifact may cause the wrong\nconvergence to a function far away from the exact solution. To explain the\nformation of the spurious spike, we perform a convergence analysis by proving a\nLax--Wendroff type theorem. It is shown that the spurious spike is caused by\nthe numerical viscosity in the computation of the water height at the\ndiscontinuous bottom. The height of the spike is proportional to the magnitude\nof the viscosity constant in the Lax--Friedrichs flux. Motivated by this\nconclusion, we propose a modified scheme by adopting the central flux at the\nbottom discontinuity in the equation of mass conservation, and show that this\nnumerical artifact can be removed in many cases. For various numerical tests\nwith nontransonic Riemann solutions, we observe that the modified scheme is\nable to retrieve the correct convergence.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:48:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sun","Zheng",""],["Xing","Yulong",""]]}
{"id":"2308.09266","submitter":"Partha Sarathi Pal Dr.","authors":"Rishank Diwan, Kees de Kuijper, Partha Sarathi Pal, Andreas Ritter,\n  Pablo Saz Parkinson, Andy C.T. Kong, Quentin Parker","title":"6U MeV CubeSat Mission: A low-cost approach towards gamma-ray astronomy","comments":"Submitted in Journal of Astronomical Telescopes, Instruments, and\n  Systems(SPIE). Manuscript# 23097G. 31 pages and 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The low-energy gamma-ray (0.1-30 MeV) sky has been poorly observed since the\ndecommissioning of the COMPTEL instrument on board the Compton Gamma-ray\nObserver (CGRO) satellite in 2000. The study of photons from this energy band\n(the MeV \"gap\") is, however, crucial to answer many unsolved questions in\nhigh-energy and multi-messenger astrophysics. Although several MeV gamma-ray\nmissions have been proposed (e.g. AMEGO, e-ASTROGAM), these are mostly in the\nplanning phase, and their launch is not expected until the next decade, at the\nearliest. Recently, there has been a proliferation of CubeSat missions proposed\nas \"pathfinder\" alternatives due to their low cost and faster cycles of\nimplementation. Indeed, a MeV CubeSat for gamma-ray astronomy can be a suitable\ndemonstrator for future, larger-scale MeV payloads. In this paper, a gamma-ray\npayload design with a silicon tracker and CsI calorimeter is proposed. We\nreport the results of simulations to assess the performance of this payload\npossibility and compare these with other previous gamma-ray instruments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:08:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Diwan","Rishank",""],["de Kuijper","Kees",""],["Pal","Partha Sarathi",""],["Ritter","Andreas",""],["Parkinson","Pablo Saz",""],["Kong","Andy C. T.",""],["Parker","Quentin",""]]}
{"id":"2308.09267","submitter":"Lang Cao","authors":"Lang Cao","title":"Enhancing Reasoning Capabilities of Large Language Models: A Graph-Based\n  Verification Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have showcased impressive reasoning\ncapabilities, particularly when guided by specifically designed prompts in\ncomplex reasoning tasks such as math word problems. These models typically\nsolve tasks using a chain-of-thought approach, which not only bolsters their\nreasoning abilities but also provides valuable insights into their\nproblem-solving process. However, there is still significant room for enhancing\nthe reasoning abilities of LLMs. Some studies suggest that the integration of\nan LLM output verifier can boost reasoning accuracy without necessitating\nadditional model training. In this paper, we follow these studies and introduce\na novel graph-based method to further augment the reasoning capabilities of\nLLMs. We posit that multiple solutions to a reasoning task, generated by an\nLLM, can be represented as a reasoning graph due to the logical connections\nbetween intermediate steps from different reasoning paths. Therefore, we\npropose the Reasoning Graph Verifier (RGV) to analyze and verify the solutions\ngenerated by LLMs. By evaluating these graphs, models can yield more accurate\nand reliable results.Our experimental results show that our graph-based\nverification method not only significantly enhances the reasoning abilities of\nLLMs but also outperforms existing verifier methods in terms of improving these\nmodels' reasoning performance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:12:59 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 05:24:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Lang",""]]}
{"id":"2308.09268","submitter":"Chongkai Lu","authors":"Chongkai Lu, Man-Wai Mak, Ruimin Li, Zheru Chi, Hong Fu","title":"Progression-Guided Temporal Action Detection in Videos","comments":"Under Review. Code available at https://github.com/makecent/APN","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel framework, Action Progression Network (APN), for temporal\naction detection (TAD) in videos. The framework locates actions in videos by\ndetecting the action evolution process. To encode the action evolution, we\nquantify a complete action process into 101 ordered stages (0\\%, 1\\%, ...,\n100\\%), referred to as action progressions. We then train a neural network to\nrecognize the action progressions. The framework detects action boundaries by\ndetecting complete action processes in the videos, e.g., a video segment with\ndetected action progressions closely follow the sequence 0\\%, 1\\%, ..., 100\\%.\nThe framework offers three major advantages: (1) Our neural networks are\ntrained end-to-end, contrasting conventional methods that optimize modules\nseparately; (2) The APN is trained using action frames exclusively, enabling\nmodels to be trained on action classification datasets and robust to videos\nwith temporal background styles differing from those in training; (3) Our\nframework effectively avoids detecting incomplete actions and excels in\ndetecting long-lasting actions due to the fine-grained and explicit encoding of\nthe temporal structure of actions. Leveraging these advantages, the APN\nachieves competitive performance and significantly surpasses its counterparts\nin detecting long-lasting actions. With an IoU threshold of 0.5, the APN\nachieves a mean Average Precision (mAP) of 58.3\\% on the THUMOS14 dataset and\n98.9\\% mAP on the DFMAD70 dataset.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:14:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Chongkai",""],["Mak","Man-Wai",""],["Li","Ruimin",""],["Chi","Zheru",""],["Fu","Hong",""]]}
{"id":"2308.09269","submitter":"Jin Yan","authors":"Jin Yan, Moitrish Majumdar, Stefano Ruffo, Yuzuru Sato, Christian Beck\n  and Rainer Klages","title":"Transition to anomalous dynamics in a simple random map","comments":"22 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD cond-mat.stat-mech math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The famous Bernoulli shift (or dyadic transformation) is perhaps the simplest\ndeterministic dynamical system exhibiting chaotic dynamics. It is a piecewise\nlinear time-discrete map on the unit interval with a uniform slope larger than\none, hence expanding, with a positive Lyapunov exponent and a uniform invariant\ndensity. If the slope is less than one the map becomes contracting, the\nLyapunov exponent is negative, and the density trivially collapses onto a fixed\npoint. Sampling from these two different types of maps at each time step by\nrandomly selecting the expanding one with probability $p$, and the contracting\none with probability $1-p$, gives a prototype of a random dynamical system.\nHere we calculate the invariant density of this simple random map, as well as\nits position autocorrelation function, analytically and numerically under\nvariation of $p$. We find that the map exhibits a non-trivial transition from\nfully chaotic to completely regular dynamics by generating a long-time\nanomalous dynamics at a critical sampling probability $p_c$, defined by a zero\nLyapunov exponent. This anomalous dynamics is characterised by an infinite\ninvariant density, weak ergodicity breaking and power law correlation decay.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:17:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yan","Jin",""],["Majumdar","Moitrish",""],["Ruffo","Stefano",""],["Sato","Yuzuru",""],["Beck","Christian",""],["Klages","Rainer",""]]}
{"id":"2308.09270","submitter":"Minje Choi","authors":"Minje Choi and Daniel M. Romero and David Jurgens","title":"Profile Update: The Effects of Identity Disclosure on Network\n  Connections and Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our social identities determine how we interact and engage with the world\nsurrounding us. In online settings, individuals can make these identities\nexplicit by including them in their public biography, possibly signaling a\nchange to what is important to them and how they should be viewed. Here, we\nperform the first large-scale study on Twitter that examines behavioral changes\nfollowing identity signal addition on Twitter profiles. Combining social\nnetworks with NLP and quasi-experimental analyses, we discover that after\ndisclosing an identity on their profiles, users (1) generate more tweets\ncontaining language that aligns with their identity and (2) connect more to\nsame-identity users. We also examine whether adding an identity signal\nincreases the number of offensive replies and find that (3) the combined effect\nof disclosing identity via both tweets and profiles is associated with a\nreduced number of offensive replies from others.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:21:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Choi","Minje",""],["Romero","Daniel M.",""],["Jurgens","David",""]]}
{"id":"2308.09271","submitter":"Chu Li","authors":"Rui Hou and Chu Li and Ding Pan","title":"Raman and IR spectra of water under graphene nanoconfinement at ambient\n  and extreme pressure-temperature conditions: a first-principles study","comments":null,"journal-ref":"Faraday Discussion 2023","doi":"10.1039/D3FD00111C","report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nanoconfinement of water can result in dramatic differences in its\nphysical and chemical properties compared to bulk water. However, a detailed\nmolecular-level understanding of these properties is still lacking. Vibrational\nspectroscopy, such as Raman and infrared, is a popular experimental tool for\nstudying the structure and dynamics of water, and is often complemented by\natomistic simulations to interpret experimental spectra, but there have been\nfew theoretical spectroscopy studies of nanoconfined water using\nfirst-principles methods at ambient conditions, let alone under extreme\npressure-temperature conditions. Here, we computed the Raman and IR spectra of\nwater nanoconfined by graphene at ambient and extreme pressure-temperature\nconditions using ab intio simulations. Our results revealed alterations in the\nRaman stretching and low-frequency bands due to the graphene confinement. We\nalso found spectroscopic evidence indicating that nanoconfinement considerably\nchanges the tetrahedral hydrogen bond network, which is typically found in bulk\nwater. Furthermore, we observed an unusual bending band in the Raman spectrum\nat ~10 GPa and 1000 K, which is attributed to the unique molecular structure of\nconfined ionic water. Additionally, we found that at ~20 GPa and 1000 K,\nconfined water transformed into a superionic fluid, making it challenging to\nidentify the IR stretching band. Finally, we computed the ionic conductivity of\nconfined water in the ionic and superionic phases. Our results highlight the\nefficacy of Raman and IR spectroscopy in studying the structure and dynamics of\nnanoconfined water in a large pressure-temperature range. Our predicted Raman\nand IR spectra can serve as a valuable guide for future experiments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:22:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hou","Rui",""],["Li","Chu",""],["Pan","Ding",""]]}
{"id":"2308.09272","submitter":"Kento Sasaki","authors":"Kento Sasaki and Eisuke Abe","title":"Suppression of Pulsed Dynamic Nuclear Polarization by Many-Body Spin\n  Dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a mechanism by which nuclear hyperpolarization due to the\npolarization transfer from a microwave-pulse-controlled electron spin is\nsuppressed. From analytical and numerical calculations of the unitary dynamics\nof multiple nuclear spins, we uncover that, combined with the formation of the\ndark state within a cluster of nuclei, coherent higher-order nuclear spin\ndynamics impose limits on the efficiency of the polarization transfer even in\nthe absence of mundane depolarization processes such as nuclear spin diffusion\nand relaxation. Furthermore, we show that the influence of the dark state can\nbe partly mitigated by introducing a disentangling operation. Our analysis is\napplied to the nuclear polarizations observed in $^{13}$C nuclei coupled with a\nsingle nitrogen-vacancy center in diamond [Science 374, 1474 (2021) by J.\nRandall et al.]. Our work sheds light on collective engineering of nuclear\nspins as well as future designs of pulsed dynamic nuclear polarization\nprotocols.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:28:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sasaki","Kento",""],["Abe","Eisuke",""]]}
{"id":"2308.09273","submitter":"Mohammad Sami","authors":"Sayantan Choudhury, Ahaskar Karde, Sudhakar Panda, M. Sami","title":"Scalar induced gravity waves from ultra slow-roll Galileon inflation","comments":"25 pages, 2 figures, Comments are welcome","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":"  We consider the production of secondary gravity waves in Galileon inflation\nwith an ultra-slow roll (USR) phase and show that the spectrum of\nscalar-induced gravitational waves (SIGWs) in this case is consistent with the\nrecent NANOGrav 15-year data and with sensitivities of other ground and\nspace-based missions, LISA, BBO, DECIGO, CE, ET, HLVK (consists of aLIGO,\naVirgo, and KAGRA), and HLV(03). Thanks to the non-renormalization property of\nGalileon theory, the amplitude of the large fluctuation is controllable at the\nsharp transitions between SR and USR regions. We show that the behaviour of the\nGW spectrum, when one-loop effects are included in the scalar power spectrum,\nis preserved under a shift of the sharp transition scale with peak amplitude\n$\\Omega_{\\rm GW}h^2\\sim {\\cal O}(10^{-6})$, and hence it can cover a wide range\nof frequencies within ${\\cal O}(10^{-9}{\\rm Hz} - 10^{7}{\\rm Hz})$. An analysis\nof the allowed mass range for primordial black holes (PBHs) is also performed,\nwhere we find that mass values ranging from ${\\cal O}(1M_{\\odot} -\n10^{-18}M_{\\odot})$ can be generated over the corresponding allowed range of\nlow and high frequencies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:30:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Choudhury","Sayantan",""],["Karde","Ahaskar",""],["Panda","Sudhakar",""],["Sami","M.",""]]}
{"id":"2308.09274","submitter":"Bo Chen","authors":"Bo Chen, Chenyu Wang, Weipeng Li, Haiyang Fu","title":"A hybrid Decoder-DeepONet operator regression framework for unaligned\n  observation data","comments":"35 pages, 10 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural operators (DNOs) have been utilized to approximate nonlinear\nmappings between function spaces. However, DNOs face the challenge of increased\ndimensionality and computational cost associated with unaligned observation\ndata. In this study, we propose a hybrid Decoder-DeepONet operator regression\nframework to handle unaligned data effectively. Additionally, we introduce a\nMulti-Decoder-DeepONet, which utilizes an average field of training data as\ninput augmentation. The consistencies of the frameworks with the operator\napproximation theory are provided, on the basis of the universal approximation\ntheorem. Two numerical experiments, Darcy problem and flow-field around an\nairfoil, are conducted to validate the efficiency and accuracy of the proposed\nmethods. Results illustrate the advantages of Decoder-DeepONet and\nMulti-Decoder-DeepONet in handling unaligned observation data and showcase\ntheir potentials in improving prediction accuracy.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:32:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Bo",""],["Wang","Chenyu",""],["Li","Weipeng",""],["Fu","Haiyang",""]]}
{"id":"2308.09275","submitter":"Jennifer Tang","authors":"Jennifer Tang, Aviv Adler, Amir Ajorlou, and Ali Jadbabaie","title":"Stochastic Opinion Dynamics under Social Pressure in Arbitrary Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SI cs.SY math.DS math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Social pressure is a key factor affecting the evolution of opinions on\nnetworks in many types of settings, pushing people to conform to their\nneighbors' opinions. To study this, the interacting Polya urn model was\nintroduced by Jadbabaie et al., in which each agent has two kinds of opinion:\ninherent beliefs, which are hidden from the other agents and fixed; and\ndeclared opinions, which are randomly sampled at each step from a distribution\nwhich depends on the agent's inherent belief and her neighbors' past declared\nopinions (the social pressure component), and which is then communicated to\ntheir neighbors. Each agent also has a bias parameter denoting her level of\nresistance to social pressure. At every step, the agents simultaneously update\ntheir declared opinions according to their neighbors' aggregate past declared\nopinions, their inherent beliefs, and their bias parameters. We study the\nasymptotic behavior of this opinion dynamics model and show that agents'\ndeclaration probabilities converge almost surely in the limit using Lyapunov\ntheory and stochastic approximation techniques. We also derive necessary and\nsufficient conditions for the agents to approach consensus on their declared\nopinions. Our work provides further insight into the difficulty of inferring\nthe inherent beliefs of agents when they are under social pressure.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:35:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tang","Jennifer",""],["Adler","Aviv",""],["Ajorlou","Amir",""],["Jadbabaie","Ali",""]]}
{"id":"2308.09276","submitter":"Vagson Luiz Carvalho-Santos","authors":"G. H. R. Bittencourt, M. Castro, A. S. Nunez, D. Altbir, S. Allende,\n  V. L. Carvalho-Santos","title":"Chiral spin-transfer torque induced by curvature gradient","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work analyzes the propagation of a transverse domain wall (DW) motion\nunder the action of an electric current along a nanowire (NW) with a curvature\ngradient. Our results evidence that the curvature gradient induces a chiral\nspin-transfer torque (CSTT) whose effect on the DW motion depends on the\ndirection along which the DW points. The origin of the CSTT is explained in\nterms of a position and phase-dependent effective field associated with the DW\nprofile and the electric current direction. Finally, our results reveal that\nthis chiral mechanism can also affect the behavior of other magnetization\ncollective modes, such as spin waves. This work shows the emergence of\ncurvature-induced chiral spin transport and highlights a new phenomenon to be\nconsidered for designing spintronic devices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:35:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bittencourt","G. H. R.",""],["Castro","M.",""],["Nunez","A. S.",""],["Altbir","D.",""],["Allende","S.",""],["Carvalho-Santos","V. L.",""]]}
{"id":"2308.09277","submitter":"Zongjun Yang","authors":"Zongjun Yang, Luofeng Liao, Christian Kroer","title":"Greedy-Based Online Fair Allocation with Adversarial Input: Enabling\n  Best-of-Many-Worlds Guarantees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study an online allocation problem with sequentially arriving items and\nadversarially chosen agent values, with the goal of balancing fairness and\nefficiency. Our goal is to study the performance of algorithms that achieve\nstrong guarantees under other input models such as stochastic inputs, in order\nto achieve robust guarantees against a variety of inputs. To that end, we study\nthe PACE (Pacing According to Current Estimated utility) algorithm, an existing\nalgorithm designed for stochastic input. We show that in the equal-budgets\ncase, PACE is equivalent to the integral greedy algorithm. We go on to show\nthat with natural restrictions on the adversarial input model, both integral\ngreedy allocation and PACE have asymptotically bounded multiplicative envy as\nwell as competitive ratio for Nash welfare, with the multiplicative factors\neither constant or with optimal order dependence on the number of agents. This\ncompletes a \"best-of-many-worlds\" guarantee for PACE, since past work showed\nthat PACE achieves guarantees for stationary and stochastic-but-non-stationary\ninput models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:36:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Zongjun",""],["Liao","Luofeng",""],["Kroer","Christian",""]]}
{"id":"2308.09278","submitter":"Xudong Xu","authors":"Xudong Xu, Zhaoyang Lyu, Xingang Pan, Bo Dai","title":"MATLABER: Material-Aware Text-to-3D via LAtent BRDF auto-EncodeR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Based on powerful text-to-image diffusion models, text-to-3D generation has\nmade significant progress in generating compelling geometry and appearance.\nHowever, existing methods still struggle to recover high-fidelity object\nmaterials, either only considering Lambertian reflectance, or failing to\ndisentangle BRDF materials from the environment lights. In this work, we\npropose Material-Aware Text-to-3D via LAtent BRDF auto-EncodeR\n(\\textbf{MATLABER}) that leverages a novel latent BRDF auto-encoder for\nmaterial generation. We train this auto-encoder with large-scale real-world\nBRDF collections and ensure the smoothness of its latent space, which\nimplicitly acts as a natural distribution of materials. During appearance\nmodeling in text-to-3D generation, the latent BRDF embeddings, rather than BRDF\nparameters, are predicted via a material network. Through exhaustive\nexperiments, our approach demonstrates the superiority over existing ones in\ngenerating realistic and coherent object materials. Moreover, high-quality\nmaterials naturally enable multiple downstream tasks such as relighting and\nmaterial editing. Code and model will be publicly available at\n\\url{https://sheldontsui.github.io/projects/Matlaber}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:40:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Xudong",""],["Lyu","Zhaoyang",""],["Pan","Xingang",""],["Dai","Bo",""]]}
{"id":"2308.09279","submitter":"Jian Zhang","authors":"Shuzhou Yang and Xuanyu Zhang and Yinhuai Wang and Jiwen Yu and Yuhan\n  Wang and Jian Zhang","title":"DiffLLE: Diffusion-guided Domain Calibration for Unsupervised 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":"  Existing unsupervised low-light image enhancement methods lack enough\neffectiveness and generalization in practical applications. We suppose this is\nbecause of the absence of explicit supervision and the inherent gap between\nreal-world scenarios and the training data domain. In this paper, we develop\nDiffusion-based domain calibration to realize more robust and effective\nunsupervised Low-Light Enhancement, called DiffLLE. Since the diffusion model\nperforms impressive denoising capability and has been trained on massive clean\nimages, we adopt it to bridge the gap between the real low-light domain and\ntraining degradation domain, while providing efficient priors of real-world\ncontent for unsupervised models. Specifically, we adopt a naive unsupervised\nenhancement algorithm to realize preliminary restoration and design two\nzero-shot plug-and-play modules based on diffusion model to improve\ngeneralization and effectiveness. The Diffusion-guided Degradation Calibration\n(DDC) module narrows the gap between real-world and training low-light\ndegradation through diffusion-based domain calibration and a lightness\nenhancement curve, which makes the enhancement model perform robustly even in\nsophisticated wild degradation. Due to the limited enhancement effect of the\nunsupervised model, we further develop the Fine-grained Target domain\nDistillation (FTD) module to find a more visual-friendly solution space. It\nexploits the priors of the pre-trained diffusion model to generate\npseudo-references, which shrinks the preliminary restored results from a coarse\nnormal-light domain to a finer high-quality clean field, addressing the lack of\nstrong explicit supervision for unsupervised methods. Benefiting from these,\nour approach even outperforms some supervised methods by using only a simple\nunsupervised baseline. Extensive experiments demonstrate the superior\neffectiveness of the proposed DiffLLE.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:40:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Shuzhou",""],["Zhang","Xuanyu",""],["Wang","Yinhuai",""],["Yu","Jiwen",""],["Wang","Yuhan",""],["Zhang","Jian",""]]}
{"id":"2308.09280","submitter":"Guy F. de T\\'eramond","authors":"Guy F. de Teramond, Stanley J. Brodsky","title":"Color symmetry and confinement as an underlying superconformal structure\n  in holographic QCD","comments":"20 pages, 5 figures, Invited contribution to the book dedicated to\n  the memory of Harald Fritzsch. arXiv admin note: substantial text overlap\n  with arXiv:2212.14028","journal-ref":null,"doi":null,"report-no":"SLAC-PUB-17740","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dedicated to the memory of our colleague, Harald Fritzsch, who, together with\nMurray Gell-Mann, introduced the color quantum number as the exact symmetry\nresponsible for the strong interaction, thus establishing quantum\nchromodynamics (QCD) as a fundamental non-Abelian gauge theory. A basic\nunderstanding of hadron properties, however, such as confinement and the\nemergence of a mass scale, from first principles QCD has remained elusive:\nHadronic characteristics are not explicit properties of the QCD Lagrangian and\nperturbative QCD, so successful in the large transverse momentum domain, is not\napplicable at large distances. In this article, we shall examine how this\ndaunting obstacle is overcome in holographic QCD with the introduction of a\nsuperconformal symmetry in anti de Sitter (AdS) space which is responsible for\nconfinement and the introduction of a mass scale within the superconformal\ngroup. When mapped to light-front coordinates in physical spacetime, this\napproach incorporates supersymmetric relations between the Regge trajectories\nof meson, baryon and tetraquark states which can be visualized in terms of\nspecific $SU(3)_C$ color representations of quarks. We will also briefly\ndiscuss here the implications of holographic models for QCD color transparency\nin view of the present experimental interest. Invited contribution to the book\ndedicated to the memory of Harald Fritzsch.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:45:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["de Teramond","Guy F.",""],["Brodsky","Stanley J.",""]]}
{"id":"2308.09281","submitter":"Yijiang Li","authors":"Yijiang Li, Xinjiang Wang, Lihe Yang, Litong Feng, Wayne Zhang and\n  Ying Gao","title":"Diverse Cotraining Makes Strong Semi-Supervised Segmentor","comments":"ICCV2023, Camera Ready Version, Code:\n  \\url{https://github.com/williamium3000/diverse-cotraining}","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep co-training has been introduced to semi-supervised segmentation and\nachieves impressive results, yet few studies have explored the working\nmechanism behind it. In this work, we revisit the core assumption that supports\nco-training: multiple compatible and conditionally independent views. By\ntheoretically deriving the generalization upper bound, we prove the prediction\nsimilarity between two models negatively impacts the model's generalization\nability. However, most current co-training models are tightly coupled together\nand violate this assumption. Such coupling leads to the homogenization of\nnetworks and confirmation bias which consequently limits the performance. To\nthis end, we explore different dimensions of co-training and systematically\nincrease the diversity from the aspects of input domains, different\naugmentations and model architectures to counteract homogenization. Our Diverse\nCo-training outperforms the state-of-the-art (SOTA) methods by a large margin\nacross different evaluation protocols on the Pascal and Cityscapes. For\nexample. we achieve the best mIoU of 76.2%, 77.7% and 80.2% on Pascal with only\n92, 183 and 366 labeled images, surpassing the previous best results by more\nthan 5%.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:46:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Yijiang",""],["Wang","Xinjiang",""],["Yang","Lihe",""],["Feng","Litong",""],["Zhang","Wayne",""],["Gao","Ying",""]]}
{"id":"2308.09282","submitter":"Perry T. Mahon","authors":"Perry T. Mahon, Chao Lei, and Allan H. MacDonald","title":"Reconciling magnetoelectric response and time-reversal symmetry in\n  non-magnetic $\\mathbb{Z}_2$ topological insulators","comments":"30 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A delicate tension complicates the relationship between the topological\nmagnetoelectric effect in three-dimensional $\\mathbb{Z}_2$ topological\ninsulators (TIs) and time-reversal symmetry (TRS). TRS underlies a particular\n$\\mathbb{Z}_2$ topological classification of the electronic ground state of a\nbulk insulator and the associated quantization of the magnetoelectric\ncoefficient calculated using linear response theory, but according to standard\nsymmetry arguments simultaneously forbids any physically meaningful\nmagnetoelectric response. This tension between theories of magnetoelectric\nresponse in bulk and finite-sized materials originates from the distinct\napproaches required to introduce notions of polarization and orbital\nmagnetization in those fundamentally different environments. In this work we\nargue for a modified interpretation of the bulk linear response calculations in\nnon-magnetic TIs that is more plainly consistent with TRS, and use this\ninterpretation to discuss the effect's observation - still absent over a decade\nafter its prediction. Our analysis is reinforced by microscopic bulk and thin\nfilm calculations carried out using a simplified but still realistic model for\nthe well established V$_2$VI$_3$ (V $=$ (Sb,Bi) and VI $=$ (Se,Te)) family of\nnon-magnetic $\\mathbb{Z}_2$ TIs. We conclude that the topological\nmagnetoelectric effect in non-magnetic $\\mathbb{Z}_2$ TIs is activated by\nmagnetic surface dopants, and that the charge density response to magnetic\nfields and the orbital magnetization response to electric fields in a given\nsample are controlled in part by the configuration of those dopants.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:46:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mahon","Perry T.",""],["Lei","Chao",""],["MacDonald","Allan H.",""]]}
{"id":"2308.09283","submitter":"Naveen Jain","authors":"Meghna Sharma, Naveen Kumar Jain, and Sushil Kumar","title":"Starlikeness Using Special Functions and Subordination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The association of subordination and special functions is used to find sharp\nestimates on the parameter $\\beta$ such that the analytic function $p(z)$ is\nsubordinate to certain functions having positive real part whenever $p(z)+\\beta\nz p'(z)$ is subordinate to the Janowski function. Further, when the traditional\napproach of solving higher order differential subordination implications\nfailed, the concept of admissibility is employed to establish certain second\nand third order differential subordination relations between the analytic\nfunction $p$ and the functions associated with right half plane. As a sequel,\nwe demonstrated the starlikeness of various well-known analytic functions as\nwell.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:48:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sharma","Meghna",""],["Jain","Naveen Kumar",""],["Kumar","Sushil",""]]}
{"id":"2308.09284","submitter":"Shaleen Deep","authors":"Paraschos Koutris, Shaleen Deep","title":"The Fine-Grained Complexity of CFL Reachability","comments":"Appeared in POPL 2023. Please note the erratum on the first page","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many problems in static program analysis can be modeled as the context-free\nlanguage (CFL) reachability problem on directed labeled graphs. The CFL\nreachability problem can be generally solved in time $O(n^3)$, where $n$ is the\nnumber of vertices in the graph, with some specific cases that can be solved\nfaster. In this work, we ask the following question: given a specific CFL, what\nis the exact exponent in the monomial of the running time? In other words, for\nwhich cases do we have linear, quadratic or cubic algorithms, and are there\nproblems with intermediate runtimes? This question is inspired by recent\nefforts to classify classic problems in terms of their exact polynomial\ncomplexity, known as {\\em fine-grained complexity}. Although recent efforts\nhave shown some conditional lower bounds (mostly for the class of combinatorial\nalgorithms), a general picture of the fine-grained complexity landscape for CFL\nreachability is missing.\n  Our main contribution is lower bound results that pinpoint the exact running\ntime of several classes of CFLs or specific CFLs under widely believed lower\nbound conjectures (Boolean Matrix Multiplication and $k$-Clique). We\nparticularly focus on the family of Dyck-$k$ languages (which are strings with\nwell-matched parentheses), a fundamental class of CFL reachability problems. We\npresent new lower bounds for the case of sparse input graphs where the number\nof edges $m$ is the input parameter, a common setting in the database\nliterature. For this setting, we show a cubic lower bound for Andersen's\nPointer Analysis which significantly strengthens prior known results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:52:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Koutris","Paraschos",""],["Deep","Shaleen",""]]}
{"id":"2308.09285","submitter":"Hui Miao","authors":"Hui Miao, Yuanfang Guo and Yunhong Wang","title":"RFDforFin: Robust Deep Forgery Detection for GAN-generated Fingerprint\n  Images","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid development of the image generation technologies, the\nmalicious abuses of the GAN-generated fingerprint images poses a significant\nthreat to the public safety in certain circumstances. Although the existing\nuniversal deep forgery detection approach can be applied to detect the fake\nfingerprint images, they are easily attacked and have poor robustness.\nMeanwhile, there is no specifically designed deep forgery detection method for\nfingerprint images. In this paper, we propose the first deep forgery detection\napproach for fingerprint images, which combines unique ridge features of\nfingerprint and generation artifacts of the GAN-generated images, to the best\nof our knowledge. Specifically, we firstly construct a ridge stream, which\nexploits the grayscale variations along the ridges to extract unique\nfingerprint-specific features. Then, we construct a generation artifact stream,\nin which the FFT-based spectrums of the input fingerprint images are exploited,\nto extract more robust generation artifact features. At last, the unique ridge\nfeatures and generation artifact features are fused for binary classification\n(\\textit{i.e.}, real or fake). Comprehensive experiments demonstrate that our\nproposed approach is effective and robust with low complexities.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:05:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Miao","Hui",""],["Guo","Yuanfang",""],["Wang","Yunhong",""]]}
{"id":"2308.09286","submitter":"Puxun Wu","authors":"Rongrong Zhai, Hongwei Yu, and Puxun Wu","title":"Power spectrum with $k^6$ growth for primordial black holes","comments":"29 pages, 14 figures, to appear in PRD","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The decrease of both the rolling speed of the inflaton and the sound speed of\nthe curvature perturbations can amplify the curvature perturbations during\ninflation so as to generate a sizable amount of primordial black holes. In the\nultraslow-roll inflation scenario, it has been found that the power spectrum of\ncurvature perturbations has a $k^4$ growth. In this paper, we find that when\nthe speed of sound decreases suddenly, the curvature perturbations becomes\nscale dependent in the infrared limit and the power spectrum of the curvature\nperturbation only has a $k^2$ growth. Furthermore, by studying the evolution of\nthe power spectrum in the inflation model, in which both the sound speed of the\ncurvature perturbations and the rolling speed of the inflaton are reduced, we\nfind that the power spectrum is nearly scale invariant at the large scales to\nsatisfy the constraint from the cosmic microwave background radiation\nobservations, and at the same time can be enhanced at the small scales to\nresult in an abundant formation of primordial black holes. In the cases of the\nsimultaneous changes of the sound speed and the slow-roll parameter $\\eta$ and\nthe change of the sound speed preceding that of the slow-roll parameter $\\eta$,\nthe power spectrum can possess a $k^6$ growth under certain conditions, which\nis the steepest growth of the power spectrum reported so far.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:05:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhai","Rongrong",""],["Yu","Hongwei",""],["Wu","Puxun",""]]}
{"id":"2308.09287","submitter":"Bo Liu","authors":"Rui Tian, Shuai Li, Maksims Arzamasovs, Hong Gao, Yong-Chang Zhang, Bo\n  Liu","title":"Localization-delocalization Transition in an electromagnetically induced\n  photonic lattice","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the localization-delocalization transition (LDT) in an\nelectromagnetically induced photonic lattice. A four-level tripod-type scheme\nin atomic ensembles is proposed to generate an effective photonic moir\\'{e}\nlattice through the electromagnetically induced transparency (EIT) mechanism.\nBy taking advantage of the tunable atomic coherence, we show that both periodic\n(commensurable) and aperiodic (incommensurable) structure can be created in\nsuch a photonic moir\\'{e} lattice via adjusting the twist angle between two\nsuperimposed periodic patterns with square primitive. Furthermore, we also find\nthat by tuning the amplitudes of these two superimposed periodic patterns, the\nlocalization-delocalization transition occurs for the light propagating in the\naperiodic moir\\'{e} lattice. Such localization is shown to link the fact that\nthe flat bands of moir\\'{e} lattice support quasi-nondiffracting localized\nmodes and thus induce the localization of the initially localized beam. It\nwould provide a promising approach to control the light propagation via the\nelectromagnetically induced photonic lattice.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:10:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tian","Rui",""],["Li","Shuai",""],["Arzamasovs","Maksims",""],["Gao","Hong",""],["Zhang","Yong-Chang",""],["Liu","Bo",""]]}
{"id":"2308.09288","submitter":"Jeremy Marzuola","authors":"Thomas Alazard and Jeremy L. Marzuola and Jian Wang","title":"Damping for fractional wave equations and applications to water waves","comments":"36 pages, 11 figures, comments welcome!!","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":"  Motivated by numerically modeling surface waves for inviscid Euler equations,\nwe analyze linear models for damped water waves and establish decay properties\nfor the energy for sufficiently regular initial configurations. Our findings\ngive the explicit decay rates for the energy, but do not address\nreflection/transmission of waves at the interface of the damping. Still for a\nsubset of the models considered, this represents the first result proving the\ndecay of the energy of the surface wave models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:18:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alazard","Thomas",""],["Marzuola","Jeremy L.",""],["Wang","Jian",""]]}
{"id":"2308.09289","submitter":"Sherif Abdelfattah","authors":"Sherif Abdelfattah, Adrian Brown, Pushi Zhang","title":"Preference-conditioned Pixel-based AI Agent For Game Testing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The game industry is challenged to cope with increasing growth in demand and\ngame complexity while maintaining acceptable quality standards for released\ngames. Classic approaches solely depending on human efforts for quality\nassurance and game testing do not scale effectively in terms of time and cost.\nGame-testing AI agents that learn by interaction with the environment have the\npotential to mitigate these challenges with good scalability properties on time\nand costs. However, most recent work in this direction depends on game state\ninformation for the agent's state representation, which limits generalization\nacross different game scenarios. Moreover, game test engineers usually prefer\nexploring a game in a specific style, such as exploring the golden path.\nHowever, current game testing AI agents do not provide an explicit way to\nsatisfy such a preference. This paper addresses these limitations by proposing\nan agent design that mainly depends on pixel-based state observations while\nexploring the environment conditioned on a user's preference specified by\ndemonstration trajectories. In addition, we propose an imitation learning\nmethod that couples self-supervised and supervised learning objectives to\nenhance the quality of imitation behaviors. Our agent significantly outperforms\nstate-of-the-art pixel-based game testing agents over exploration coverage and\ntest execution quality when evaluated on a complex open-world environment\nresembling many aspects of real AAA games.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:19:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Abdelfattah","Sherif",""],["Brown","Adrian",""],["Zhang","Pushi",""]]}
{"id":"2308.09290","submitter":"Ritam Majumdar","authors":"Ritam Majumdar, Vishal Jadhav, Anirudh Deodhar, Shirish Karande,\n  Lovekesh Vig, Venkataramana Runkana","title":"HyperLoRA for PDEs","comments":"8 pages, 4 figures, 3 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CE math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Physics-informed neural networks (PINNs) have been widely used to develop\nneural surrogates for solutions of Partial Differential Equations. A drawback\nof PINNs is that they have to be retrained with every change in\ninitial-boundary conditions and PDE coefficients. The Hypernetwork, a\nmodel-based meta learning technique, takes in a parameterized task embedding as\ninput and predicts the weights of PINN as output. Predicting weights of a\nneural network however, is a high-dimensional regression problem, and\nhypernetworks perform sub-optimally while predicting parameters for large base\nnetworks. To circumvent this issue, we use a low ranked adaptation (LoRA)\nformulation to decompose every layer of the base network into low-ranked\ntensors and use hypernetworks to predict the low-ranked tensors. Despite the\nreduced dimensionality of the resulting weight-regression problem, LoRA-based\nHypernetworks violate the underlying physics of the given task. We demonstrate\nthat the generalization capabilities of LoRA-based hypernetworks drastically\nimprove when trained with an additional physics-informed loss component\n(HyperPINN) to satisfy the governing differential equations. We observe that\nLoRA-based HyperPINN training allows us to learn fast solutions for\nparameterized PDEs like Burger's equation and Navier Stokes: Kovasznay flow,\nwhile having an 8x reduction in prediction parameters on average without\ncompromising on accuracy when compared to all other baselines.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:29:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Majumdar","Ritam",""],["Jadhav","Vishal",""],["Deodhar","Anirudh",""],["Karande","Shirish",""],["Vig","Lovekesh",""],["Runkana","Venkataramana",""]]}
{"id":"2308.09291","submitter":"Yi-Bo Liang","authors":"Yi-Bo Liang, Hong-Rong Li","title":"Rationalizing Unphysical Radiation in the Unruh Effect by Extending\n  Black Hole Spacetime","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate that Schwarzschild spacetime has a conformal extension and\nthat, beyond null infinity, there is a black hole with a timelike singularity.\nIn conformal extended spacetime, every null infinity is a killing horizon with\nvanishing surface gravity. When a quantized massless scalar field is taken into\nthis spacetime and different vacuums for the field are defined, thermal\nradiation coming from the extended black hole could be observed. This makes\nsense, much like the thermal radiation coming from the white hole. The Unruh\neffect is therefore plausible in conformal extended Schwarzschild spacetime. It\nis shown that the thermal radiation coming from past null infinity in\nSchwarzschild spacetime, which is difficult to imagine as the result of any\nphysical process, is the result of the reduction of the thermal radiation\npassing through past null infinity in conformal extended spacetime. We also\npresent a conformal extension of Kerr spacetime for the first time. Then, by\nexamining a quantized massless scalar field on this spacetime, we get the\nmeaningful conclusion that there is thermal radiation coming from a different\nrotating black hole passing through past null infinity. Similarly, the result\nof the Kerr black hole is consistent with that of the Schwarzschild black hole.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:30:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liang","Yi-Bo",""],["Li","Hong-Rong",""]]}
{"id":"2308.09292","submitter":"Liangwei Yang","authors":"Liangwei Yang, Zhiwei Liu, Chen Wang, Mingdai Yang, Xiaolong Liu, Jing\n  Ma, Philip S. Yu","title":"Graph-based Alignment and Uniformity for Recommendation","comments":"4 pages","journal-ref":null,"doi":"10.1145/3583780.3615185","report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collaborative filtering-based recommender systems (RecSys) rely on learning\nrepresentations for users and items to predict preferences accurately.\nRepresentation learning on the hypersphere is a promising approach due to its\ndesirable properties, such as alignment and uniformity. However, the sparsity\nissue arises when it encounters RecSys. To address this issue, we propose a\nnovel approach, graph-based alignment and uniformity (GraphAU), that explicitly\nconsiders high-order connectivities in the user-item bipartite graph. GraphAU\naligns the user/item embedding to the dense vector representations of\nhigh-order neighbors using a neighborhood aggregator, eliminating the need to\ncompute the burdensome alignment to high-order neighborhoods individually. To\naddress the discrepancy in alignment losses, GraphAU includes a layer-wise\nalignment pooling module to integrate alignment losses layer-wise. Experiments\non four datasets show that GraphAU significantly alleviates the sparsity issue\nand achieves state-of-the-art performance. We open-source GraphAU at\nhttps://github.com/YangLiangwei/GraphAU.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:33:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Liangwei",""],["Liu","Zhiwei",""],["Wang","Chen",""],["Yang","Mingdai",""],["Liu","Xiaolong",""],["Ma","Jing",""],["Yu","Philip S.",""]]}
{"id":"2308.09293","submitter":"Ritam Majumdar","authors":"Ritam Majumdar, Shirish Karande, Lovekesh Vig","title":"How important are specialized transforms in Neural Operators?","comments":"8 pages, 3 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CE math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Simulating physical systems using Partial Differential Equations (PDEs) has\nbecome an indispensible part of modern industrial process optimization.\nTraditionally, numerical solvers have been used to solve the associated PDEs,\nhowever recently Transform-based Neural Operators such as the Fourier Neural\nOperator and Wavelet Neural Operator have received a lot of attention for their\npotential to provide fast solutions for systems of PDEs. In this work, we\ninvestigate the importance of the transform layers to the reported success of\ntransform based neural operators. In particular, we record the cost in terms of\nperformance, if all the transform layers are replaced by learnable linear\nlayers. Surprisingly, we observe that linear layers suffice to provide\nperformance comparable to the best-known transform-based layers and seem to do\nso with a compute time advantage as well. We believe that this observation can\nhave significant implications for future work on Neural Operators, and might\npoint to other sources of efficiencies for these architectures.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:35:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Majumdar","Ritam",""],["Karande","Shirish",""],["Vig","Lovekesh",""]]}
{"id":"2308.09294","submitter":"Qianxiong Xu","authors":"Qianxiong Xu, Wenting Zhao, Guosheng Lin, Cheng Long","title":"Self-Calibrated Cross Attention Network for Few-Shot Segmentation","comments":"This paper is accepted by ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The key to the success of few-shot segmentation (FSS) lies in how to\neffectively utilize support samples. Most solutions compress support foreground\n(FG) features into prototypes, but lose some spatial details. Instead, others\nuse cross attention to fuse query features with uncompressed support FG. Query\nFG could be fused with support FG, however, query background (BG) cannot find\nmatched BG features in support FG, yet inevitably integrates dissimilar\nfeatures. Besides, as both query FG and BG are combined with support FG, they\nget entangled, thereby leading to ineffective segmentation. To cope with these\nissues, we design a self-calibrated cross attention (SCCA) block. For efficient\npatch-based attention, query and support features are firstly split into\npatches. Then, we design a patch alignment module to align each query patch\nwith its most similar support patch for better cross attention. Specifically,\nSCCA takes a query patch as Q, and groups the patches from the same query image\nand the aligned patches from the support image as K&V. In this way, the query\nBG features are fused with matched BG features (from query patches), and thus\nthe aforementioned issues will be mitigated. Moreover, when calculating SCCA,\nwe design a scaled-cosine mechanism to better utilize the support features for\nsimilarity calculation. Extensive experiments conducted on PASCAL-5^i and\nCOCO-20^i demonstrate the superiority of our model, e.g., the mIoU score under\n5-shot setting on COCO-20^i is 5.6%+ better than previous state-of-the-arts.\nThe code is available at https://github.com/Sam1224/SCCAN.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:41:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Qianxiong",""],["Zhao","Wenting",""],["Lin","Guosheng",""],["Long","Cheng",""]]}
{"id":"2308.09295","submitter":"Yerlan Aimuratov","authors":"Vitaliy Kim, Ildana Izmailova, and Yerlan Aimuratov","title":"Catalog of the Galactic population of X-ray pulsars in High-mass X-ray\n  binary systems","comments":"35 pages, 5 figures, 3 tables. Accepted for publication in ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A catalog of the Galactic population of X-ray pulsars in high-mass X-ray\nbinary (HMXB) systems is presented. It contains information about 82 confirmed\nsources: 18 persistent and 64 transient pulsars. Their basic parameters include\nspin period, spin evolution with global and local spin-up/spin-down and\nduration, orbital period, X-ray luminosity, magnetic field strength measured by\ncyclotron line analysis, distance, spectral and luminosity class, observable\nparameters of massive companions, which are shown in the tables provided, with\ncorresponding references. Candidates of the HMXB pulsars are also listed for\nfurther careful consideration.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:43:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Vitaliy",""],["Izmailova","Ildana",""],["Aimuratov","Yerlan",""]]}
{"id":"2308.09296","submitter":"Zahra Zamanzadeh Darban","authors":"Zahra Zamanzadeh Darban, Geoffrey I. Webb, Shirui Pan, Mahsa Salehi","title":"CARLA: A Self-supervised Contrastive Representation Learning Approach\n  for Time Series Anomaly Detection","comments":"33 pages, 9 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a Self-supervised Contrastive Representation Learning Approach\nfor Time Series Anomaly Detection (CARLA), an innovative end-to-end\nself-supervised framework carefully developed to identify anomalous patterns in\nboth univariate and multivariate time series data. By taking advantage of\ncontrastive representation learning, We introduce an innovative end-to-end\nself-supervised deep learning framework carefully developed to identify\nanomalous patterns in both univariate and multivariate time series data. By\ntaking advantage of contrastive representation learning, CARLA effectively\ngenerates robust representations for time series windows. It achieves this by\n1) learning similar representations for temporally close windows and dissimilar\nrepresentations for windows and their equivalent anomalous windows and 2)\nemploying a self-supervised approach to classify normal/anomalous\nrepresentations of windows based on their nearest/furthest neighbours in the\nrepresentation space. Most of the existing models focus on learning normal\nbehaviour. The normal boundary is often tightly defined, which can result in\nslight deviations being classified as anomalies, resulting in a high false\npositive rate and limited ability to generalise normal patterns. CARLA's\ncontrastive learning methodology promotes the production of highly consistent\nand discriminative predictions, thereby empowering us to adeptly address the\ninherent challenges associated with anomaly detection in time series data.\nThrough extensive experimentation on 7 standard real-world time series anomaly\ndetection benchmark datasets, CARLA demonstrates F1 and AU-PR superior to\nexisting state-of-the-art results. Our research highlights the immense\npotential of contrastive representation learning in advancing the field of time\nseries anomaly detection, thus paving the way for novel applications and\nin-depth exploration in this domain.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:45:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Darban","Zahra Zamanzadeh",""],["Webb","Geoffrey I.",""],["Pan","Shirui",""],["Salehi","Mahsa",""]]}
{"id":"2308.09297","submitter":"Tamasha Malepathirana","authors":"Tamasha Malepathirana, Damith Senanayake, Saman Halgamuge","title":"NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector\n  Quantization for Continual Learning","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Catastrophic forgetting; the loss of old knowledge upon acquiring new\nknowledge, is a pitfall faced by deep neural networks in real-world\napplications. Many prevailing solutions to this problem rely on storing\nexemplars (previously encountered data), which may not be feasible in\napplications with memory limitations or privacy constraints. Therefore, the\nrecent focus has been on Non-Exemplar based Class Incremental Learning (NECIL)\nwhere a model incrementally learns about new classes without using any past\nexemplars. However, due to the lack of old data, NECIL methods struggle to\ndiscriminate between old and new classes causing their feature representations\nto overlap. We propose NAPA-VQ: Neighborhood Aware Prototype Augmentation with\nVector Quantization, a framework that reduces this class overlap in NECIL. We\ndraw inspiration from Neural Gas to learn the topological relationships in the\nfeature space, identifying the neighboring classes that are most likely to get\nconfused with each other. This neighborhood information is utilized to enforce\nstrong separation between the neighboring classes as well as to generate old\nclass representative prototypes that can better aid in obtaining a\ndiscriminative decision boundary between old and new classes. Our comprehensive\nexperiments on CIFAR-100, TinyImageNet, and ImageNet-Subset demonstrate that\nNAPA-VQ outperforms the State-of-the-art NECIL methods by an average\nimprovement of 5%, 2%, and 4% in accuracy and 10%, 3%, and 9% in forgetting\nrespectively. Our code can be found in https://github.com/TamashaM/NAPA-VQ.git.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:47:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Malepathirana","Tamasha",""],["Senanayake","Damith",""],["Halgamuge","Saman",""]]}
{"id":"2308.09298","submitter":"Yusheng Liu","authors":"Yusheng Liu, Rui Xin, Tao Yang and Lisheng Wang","title":"Inferior Alveolar Nerve Segmentation in CBCT images using\n  Connectivity-Based Selective Re-training","comments":"technical paper for Miccai ToothFairy2023 Challenge","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Inferior Alveolar Nerve (IAN) canal detection in CBCT is an important step in\nmany dental and maxillofacial surgery applications to prevent irreversible\ndamage to the nerve during the procedure.The ToothFairy2023 Challenge aims to\nestablish a 3D maxillofacial dataset consisting of all sparse labels and\npartial dense labels, and improve the ability of automatic IAN segmentation. In\nthis work, in order to avoid the negative impact brought by sparse labeling, we\ntransform the mixed supervised problem into a semi-supervised problem. Inspired\nby self-training via pseudo labeling, we propose a selective re-training\nframework based on IAN connectivity. Our method is quantitatively evaluated on\nthe ToothFairy verification cases, achieving the dice similarity coefficient\n(DSC) of 0.7956, and 95\\% hausdorff distance (HD95) of 4.4905, and wining the\nchampion in the competition. Code is available at\nhttps://github.com/GaryNico517/SSL-IAN-Retraining.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:48:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Yusheng",""],["Xin","Rui",""],["Yang","Tao",""],["Wang","Lisheng",""]]}
{"id":"2308.09299","submitter":"Shiue Yuan Shiau","authors":"Shiue-Yuan Shiau, Monique Combescot","title":"A fresh view on Frenkel excitons: Electron-hole pair exchange and\n  many-body formalism","comments":"80 pages, 21 figures","journal-ref":"Annals of Physics 458, 169431 (2023)","doi":"10.1016/j.aop.2023.169431","report-no":null,"categories":"cond-mat.quant-gas cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We here present a fresh approach to Frenkel excitons in cubic semiconductor\ncrystals, with a special focus on the spin and spatial degeneracies of the\nelectronic states. This approach uses a second quantization formulation of the\nproblem in terms of creation operators for electronic states on all lattice\nsites -- their creation operators being true fermion operators in the\ntight-binding limit valid for semiconductors hosting Frenkel excitons. This\noperator formalism avoids using cumbersome ($6N_s$ x $6N_s$) Slater\ndeterminants -- 2 for spin, 3 for spatial degeneracy and $N_s$ for the number\nof lattice sites -- to represent state wave functions out of which the Frenkel\nexciton eigenstates are derived. A deep understanding of the tricky Coulomb\nphysics that takes place in the Frenkel exciton problem, is a prerequisite for\npossibly diagonalizing this very large matrix analytically. This is done in\nthree steps: (i) the first diagonalization, with respect to lattice sites,\nfollows from transforming excitations on the $N_s$ lattice sites\n$\\mathbf{R}_\\ell$ into $N_s$ exciton waves $\\mathbf{K}_n$, by using appropriate\nphase prefactors; (ii) the second diagonalization, with respect to spin,\nfollows from the introduction of spin-singlet and spin-triplet electron-hole\npair states, through the commonly missed sign change when transforming\nelectron-absence operators into hole operators; (iii) the third\ndiagonalization, with respect to threefold spatial degeneracy, leads to the\nsplitting of the exciton level into one longitudinal and two transverse modes,\nthat result from the singular interlevel Coulomb scattering in the small\n$\\mathbf{K}_n$ limit.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:49:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shiau","Shiue-Yuan",""],["Combescot","Monique",""]]}
{"id":"2308.09300","submitter":"Heng Wang","authors":"Heng Wang, Jianbo Ma, Santiago Pascual, Richard Cartwright, Weidong\n  Cai","title":"V2A-Mapper: A Lightweight Solution for Vision-to-Audio Generation by\n  Connecting Foundation Models","comments":"13 pages, 10 figures. Demo page: https://v2a-mapper.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building artificial intelligence (AI) systems on top of a set of foundation\nmodels (FMs) is becoming a new paradigm in AI research. Their representative\nand generative abilities learnt from vast amounts of data can be easily adapted\nand transferred to a wide range of downstream tasks without extra training from\nscratch. However, leveraging FMs in cross-modal generation remains\nunder-researched when audio modality is involved. On the other hand,\nautomatically generating semantically-relevant sound from visual input is an\nimportant problem in cross-modal generation studies. To solve this\nvision-to-audio (V2A) generation problem, existing methods tend to design and\nbuild complex systems from scratch using modestly sized datasets. In this\npaper, we propose a lightweight solution to this problem by leveraging\nfoundation models, specifically CLIP, CLAP, and AudioLDM. We first investigate\nthe domain gap between the latent space of the visual CLIP and the auditory\nCLAP models. Then we propose a simple yet effective mapper mechanism\n(V2A-Mapper) to bridge the domain gap by translating the visual input between\nCLIP and CLAP spaces. Conditioned on the translated CLAP embedding, pretrained\naudio generative FM AudioLDM is adopted to produce high-fidelity and\nvisually-aligned sound. Compared to previous approaches, our method only\nrequires a quick training of the V2A-Mapper. We further analyze and conduct\nextensive experiments on the choice of the V2A-Mapper and show that a\ngenerative mapper is better at fidelity and variability (FD) while a regression\nmapper is slightly better at relevance (CS). Both objective and subjective\nevaluation on two V2A datasets demonstrate the superiority of our proposed\nmethod compared to current state-of-the-art approaches - trained with 86% fewer\nparameters but achieving 53% and 19% improvement in FD and CS, respectively.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:49:38 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:51:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Heng",""],["Ma","Jianbo",""],["Pascual","Santiago",""],["Cartwright","Richard",""],["Cai","Weidong",""]]}
{"id":"2308.09301","submitter":"Eric Hsiung","authors":"Eric Hsiung, Joydeep Biswas, Swarat Chaudhuri","title":"Learning Reward Machines through Preference Queries over Sequences","comments":"24 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reward machines have shown great promise at capturing non-Markovian reward\nfunctions for learning tasks that involve complex action sequencing. However,\nno algorithm currently exists for learning reward machines with realistic weak\nfeedback in the form of preferences. We contribute REMAP, a novel algorithm for\nlearning reward machines from preferences, with correctness and termination\nguarantees. REMAP introduces preference queries in place of membership queries\nin the L* algorithm, and leverages a symbolic observation table along with\nunification and constraint solving to narrow the hypothesis reward machine\nsearch space. In addition to the proofs of correctness and termination for\nREMAP, we present empirical evidence measuring correctness: how frequently the\nresulting reward machine is isomorphic under a consistent yet inexact teacher,\nand the regret between the ground truth and learned reward machines.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:49:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hsiung","Eric",""],["Biswas","Joydeep",""],["Chaudhuri","Swarat",""]]}
{"id":"2308.09302","submitter":"Penghui Wen","authors":"Penghui Wen, Kun Hu, Wenxi Yue, Sen Zhang, Wanlei Zhou, Zhiyong Wang","title":"Robust Audio Anti-Spoofing with Fusion-Reconstruction Learning on\n  Multi-Order Spectrograms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.MM eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust audio anti-spoofing has been increasingly challenging due to the\nrecent advancements on deepfake techniques. While spectrograms have\ndemonstrated their capability for anti-spoofing, complementary information\npresented in multi-order spectral patterns have not been well explored, which\nlimits their effectiveness for varying spoofing attacks. Therefore, we propose\na novel deep learning method with a spectral fusion-reconstruction strategy,\nnamely S2pecNet, to utilise multi-order spectral patterns for robust audio\nanti-spoofing representations. Specifically, spectral patterns up to\nsecond-order are fused in a coarse-to-fine manner and two branches are designed\nfor the fine-level fusion from the spectral and temporal contexts. A\nreconstruction from the fused representation to the input spectrograms further\nreduces the potential fused information loss. Our method achieved the\nstate-of-the-art performance with an EER of 0.77% on a widely used dataset:\nASVspoof2019 LA Challenge.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:51:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wen","Penghui",""],["Hu","Kun",""],["Yue","Wenxi",""],["Zhang","Sen",""],["Zhou","Wanlei",""],["Wang","Zhiyong",""]]}
{"id":"2308.09303","submitter":"Jun-Yeong Moon","authors":"Jun-Yeong Moon, Keon-Hee Park, Jung Uk Kim and Gyeong-Moon Park","title":"Online Class Incremental Learning on Stochastic Blurry Task Boundary via\n  Mask and Visual Prompt Tuning","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":"  Continual learning aims to learn a model from a continuous stream of data,\nbut it mainly assumes a fixed number of data and tasks with clear task\nboundaries. However, in real-world scenarios, the number of input data and\ntasks is constantly changing in a statistical way, not a static way. Although\nrecently introduced incremental learning scenarios having blurry task\nboundaries somewhat address the above issues, they still do not fully reflect\nthe statistical properties of real-world situations because of the fixed ratio\nof disjoint and blurry samples. In this paper, we propose a new Stochastic\nincremental Blurry task boundary scenario, called Si-Blurry, which reflects the\nstochastic properties of the real-world. We find that there are two major\nchallenges in the Si-Blurry scenario: (1) inter- and intra-task forgettings and\n(2) class imbalance problem. To alleviate them, we introduce Mask and Visual\nPrompt tuning (MVP). In MVP, to address the inter- and intra-task forgetting\nissues, we propose a novel instance-wise logit masking and contrastive visual\nprompt tuning loss. Both of them help our model discern the classes to be\nlearned in the current batch. It results in consolidating the previous\nknowledge. In addition, to alleviate the class imbalance problem, we introduce\na new gradient similarity-based focal loss and adaptive feature scaling to ease\noverfitting to the major classes and underfitting to the minor classes.\nExtensive experiments show that our proposed MVP significantly outperforms the\nexisting state-of-the-art methods in our challenging Si-Blurry scenario.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:52:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Moon","Jun-Yeong",""],["Park","Keon-Hee",""],["Kim","Jung Uk",""],["Park","Gyeong-Moon",""]]}
{"id":"2308.09304","submitter":"Puskar Mondal","authors":"Puskar Mondal","title":"Mass and infinite dimensional geometry","comments":"comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I unravel an elegant geometric meaning of the mass of the lowest energy\nexcited state of a renormalizable quantized field theory by studying the\nweighted geometry of the classical configuration space of the theory. A\nsuitably defined regularized Bakry-Emery Ricci curvature of these infinite\ndimensional spaces controls the spectra of the corresponding quantum\nHamiltonians. The Ricci curvature part of the full Bakry-Emery Ricci curvature\nappears to be purely quantum in nature. This geometric contribution to the\nspectra in the context of quantum field theory has not been studied previously\nto my knowledge. Assuming the existence of rigorous quantization, I present a\nfew problems starting from massive free particles to the non-abelian Yang-Mills\ntheory. A remarkable property is observed in the large $N$ Yang-Mills theory,\nwhere a non-trivial mass gap is preserved. This occurs due to the fact that the\nregularized Bakry-Emery Ricci curvature that is responsible for the gap of the\nconfiguration space scales as $g^{2}_{YM}N=\\lambda$ ('t Hooft coupling) that\nremains invariant.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 04:59:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mondal","Puskar",""]]}
{"id":"2308.09305","submitter":"Taeryung Lee","authors":"Taeryung Lee, Yeonguk Oh, Kyoung Mu Lee","title":"Human Part-wise 3D Motion Context Learning for Sign Language Recognition","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":"  In this paper, we propose P3D, the human part-wise motion context learning\nframework for sign language recognition. Our main contributions lie in two\ndimensions: learning the part-wise motion context and employing the pose\nensemble to utilize 2D and 3D pose jointly. First, our empirical observation\nimplies that part-wise context encoding benefits the performance of sign\nlanguage recognition. While previous methods of sign language recognition\nlearned motion context from the sequence of the entire pose, we argue that such\nmethods cannot exploit part-specific motion context. In order to utilize\npart-wise motion context, we propose the alternating combination of a part-wise\nencoding Transformer (PET) and a whole-body encoding Transformer (WET). PET\nencodes the motion contexts from a part sequence, while WET merges them into a\nunified context. By learning part-wise motion context, our P3D achieves\nsuperior performance on WLASL compared to previous state-of-the-art methods.\nSecond, our framework is the first to ensemble 2D and 3D poses for sign\nlanguage recognition. Since the 3D pose holds rich motion context and depth\ninformation to distinguish the words, our P3D outperformed the previous\nstate-of-the-art methods employing a pose ensemble.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:01:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lee","Taeryung",""],["Oh","Yeonguk",""],["Lee","Kyoung Mu",""]]}
{"id":"2308.09306","submitter":"Runhui Huang","authors":"Runhui Huang, Jianhua Han, Guansong Lu, Xiaodan Liang, Yihan Zeng, Wei\n  Zhang, Hang Xu","title":"DiffDis: Empowering Generative Diffusion Model with Cross-Modal\n  Discrimination Capability","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, large-scale diffusion models, e.g., Stable diffusion and DallE2,\nhave shown remarkable results on image synthesis. On the other hand,\nlarge-scale cross-modal pre-trained models (e.g., CLIP, ALIGN, and FILIP) are\ncompetent for various downstream tasks by learning to align vision and language\nembeddings. In this paper, we explore the possibility of jointly modeling\ngeneration and discrimination. Specifically, we propose DiffDis to unify the\ncross-modal generative and discriminative pretraining into one single framework\nunder the diffusion process. DiffDis first formulates the image-text\ndiscriminative problem as a generative diffusion process of the text embedding\nfrom the text encoder conditioned on the image. Then, we propose a novel\ndual-stream network architecture, which fuses the noisy text embedding with the\nknowledge of latent images from different scales for image-text discriminative\nlearning. Moreover, the generative and discriminative tasks can efficiently\nshare the image-branch network structure in the multi-modality model.\nBenefiting from diffusion-based unified training, DiffDis achieves both better\ngeneration ability and cross-modal semantic alignment in one architecture.\nExperimental results show that DiffDis outperforms single-task models on both\nthe image generation and the image-text discriminative tasks, e.g., 1.65%\nimprovement on average accuracy of zero-shot classification over 12 datasets\nand 2.42 improvement on FID of zero-shot image synthesis.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:03:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Runhui",""],["Han","Jianhua",""],["Lu","Guansong",""],["Liang","Xiaodan",""],["Zeng","Yihan",""],["Zhang","Wei",""],["Xu","Hang",""]]}
{"id":"2308.09307","submitter":"Haiwei Wu","authors":"Haiwei Wu and Yiming Chen and Jiantao Zhou","title":"Rethinking Image Forgery Detection via Contrastive Learning and\n  Unsupervised Clustering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Image forgery detection aims to detect and locate forged regions in an image.\nMost existing forgery detection algorithms formulate classification problems to\nclassify pixels into forged or pristine. However, the definition of forged and\npristine pixels is only relative within one single image, e.g., a forged region\nin image A is actually a pristine one in its source image B (splicing forgery).\nSuch a relative definition has been severely overlooked by existing methods,\nwhich unnecessarily mix forged (pristine) regions across different images into\nthe same category. To resolve this dilemma, we propose the FOrensic ContrAstive\ncLustering (FOCAL) method, a novel, simple yet very effective paradigm based on\ncontrastive learning and unsupervised clustering for the image forgery\ndetection. Specifically, FOCAL 1) utilizes pixel-level contrastive learning to\nsupervise the high-level forensic feature extraction in an image-by-image\nmanner, explicitly reflecting the above relative definition; 2) employs an\non-the-fly unsupervised clustering algorithm (instead of a trained one) to\ncluster the learned features into forged/pristine categories, further\nsuppressing the cross-image influence from training data; and 3) allows to\nfurther boost the detection performance via simple feature-level concatenation\nwithout the need of retraining. Extensive experimental results over six public\ntesting datasets demonstrate that our proposed FOCAL significantly outperforms\nthe state-of-the-art competing algorithms by big margins: +24.3% on Coverage,\n+18.6% on Columbia, +17.5% on FF++, +14.2% on MISD, +13.5% on CASIA and +10.3%\non NIST in terms of IoU. The paradigm of FOCAL could bring fresh insights and\nserve as a novel benchmark for the image forgery detection task. The code is\navailable at https://github.com/HighwayWu/FOCAL.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:05:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Haiwei",""],["Chen","Yiming",""],["Zhou","Jiantao",""]]}
{"id":"2308.09308","submitter":"Yiming Qiu","authors":"Chenyu Zhao, Yunjiang Jiang, Yiming Qiu, Han Zhang, Wen-Yun Yang","title":"Differentiable Retrieval Augmentation via Generative Language Modeling\n  for E-commerce Query Intent Classification","comments":"5 pages, 2 figures; accepted by CIKM2023","journal-ref":null,"doi":"10.1145/3583780.3615210","report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Retrieval augmentation, which enhances downstream models by a knowledge\nretriever and an external corpus instead of by merely increasing the number of\nmodel parameters, has been successfully applied to many natural language\nprocessing (NLP) tasks such as text classification, question answering and so\non. However, existing methods that separately or asynchronously train the\nretriever and downstream model mainly due to the non-differentiability between\nthe two parts, usually lead to degraded performance compared to end-to-end\njoint training. In this paper, we propose Differentiable Retrieval Augmentation\nvia Generative lANguage modeling(Dragan), to address this problem by a novel\ndifferentiable reformulation. We demonstrate the effectiveness of our proposed\nmethod on a challenging NLP task in e-commerce search, namely query intent\nclassification. Both the experimental results and ablation study show that the\nproposed method significantly and reasonably improves the state-of-the-art\nbaselines on both offline evaluation and online A/B test.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:05:35 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 03:43:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Chenyu",""],["Jiang","Yunjiang",""],["Qiu","Yiming",""],["Zhang","Han",""],["Yang","Wen-Yun",""]]}
{"id":"2308.09309","submitter":"Jinze Wang","authors":"Jinze Wang, Lu Zhang, Zhu Sun, Yew-Soon Ong","title":"Meta-learning enhanced next POI recommendation by leveraging check-ins\n  from auxiliary cities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most existing point-of-interest (POI) recommenders aim to capture user\npreference by employing city-level user historical check-ins, thus facilitating\nusers' exploration of the city. However, the scarcity of city-level user\ncheck-ins brings a significant challenge to user preference learning. Although\nprior studies attempt to mitigate this challenge by exploiting various context\ninformation, e.g., spatio-temporal information, they ignore to transfer the\nknowledge (i.e., common behavioral pattern) from other relevant cities (i.e.,\nauxiliary cities). In this paper, we investigate the effect of knowledge\ndistilled from auxiliary cities and thus propose a novel Meta-learning Enhanced\nnext POI Recommendation framework (MERec). The MERec leverages the correlation\nof check-in behaviors among various cities into the meta-learning paradigm to\nhelp infer user preference in the target city, by holding the principle of\n\"paying more attention to more correlated knowledge\". Particularly, a\ncity-level correlation strategy is devised to attentively capture common\npatterns among cities, so as to transfer more relevant knowledge from more\ncorrelated cities. Extensive experiments verify the superiority of the proposed\nMERec against state-of-the-art algorithms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:07:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Jinze",""],["Zhang","Lu",""],["Sun","Zhu",""],["Ong","Yew-Soon",""]]}
{"id":"2308.09310","submitter":"Cheik Traor\\'e","authors":"Cheik Traor\\'e, Vassilis Apidopoulos, Saverio Salzo, Silvia Villa","title":"Variance reduction techniques for stochastic proximal point algorithms","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":"  In the context of finite sums minimization, variance reduction techniques are\nwidely used to improve the performance of state-of-the-art stochastic gradient\nmethods. Their practical impact is clear, as well as their theoretical\nproperties. Stochastic proximal point algorithms have been studied as an\nalternative to stochastic gradient algorithms since they are more stable with\nrespect to the choice of the stepsize but a proper variance reduced version is\nmissing. In this work, we propose the first study of variance reduction\ntechniques for stochastic proximal point algorithms. We introduce a stochastic\nproximal version of SVRG, SAGA, and some of their variants for smooth and\nconvex functions. We provide several convergence results for the iterates and\nthe objective function values. In addition, under the Polyak-{\\L}ojasiewicz\n(PL) condition, we obtain linear convergence rates for the iterates and the\nfunction values. Our numerical experiments demonstrate the advantages of the\nproximal variance reduction methods over their gradient counterparts,\nespecially about the stability with respect to the choice of the step size.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:11:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Traor\u00e9","Cheik",""],["Apidopoulos","Vassilis",""],["Salzo","Saverio",""],["Villa","Silvia",""]]}
{"id":"2308.09311","submitter":"JeongHun Yeo","authors":"Minsu Kim, Jeong Hun Yeo, Jeongsoo Choi, and Yong Man Ro","title":"Lip Reading for Low-resource Languages by Learning and Combining General\n  Speech Knowledge and Language-specific Knowledge","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.SD eess.AS eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel lip reading framework, especially for\nlow-resource languages, which has not been well addressed in the previous\nliterature. Since low-resource languages do not have enough video-text paired\ndata to train the model to have sufficient power to model lip movements and\nlanguage, it is regarded as challenging to develop lip reading models for\nlow-resource languages. In order to mitigate the challenge, we try to learn\ngeneral speech knowledge, the ability to model lip movements, from a\nhigh-resource language through the prediction of speech units. It is known that\ndifferent languages partially share common phonemes, thus general speech\nknowledge learned from one language can be extended to other languages. Then,\nwe try to learn language-specific knowledge, the ability to model language, by\nproposing Language-specific Memory-augmented Decoder (LMDecoder). LMDecoder\nsaves language-specific audio features into memory banks and can be trained on\naudio-text paired data which is more easily accessible than video-text paired\ndata. Therefore, with LMDecoder, we can transform the input speech units into\nlanguage-specific audio features and translate them into texts by utilizing the\nlearned rich language knowledge. Finally, by combining general speech knowledge\nand language-specific knowledge, we can efficiently develop lip reading models\neven for low-resource languages. Through extensive experiments using five\nlanguages, English, Spanish, French, Italian, and Portuguese, the effectiveness\nof the proposed method is evaluated.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:19:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Minsu",""],["Yeo","Jeong Hun",""],["Choi","Jeongsoo",""],["Ro","Yong Man",""]]}
{"id":"2308.09312","submitter":"Jonas F. Haderlein","authors":"Jonas F. Haderlein, Andre D. H. Peterson, Parvin Zarei Eskikand, Mark\n  J. Cook, Anthony N. Burkitt, Iven M. Y. Mareels, David B. Grayden","title":"Path Signatures for Seizure Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.OC q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Forecasting the state of a system from an observed time series is the subject\nof research in many domains, such as computational neuroscience. Here, the\nprediction of epileptic seizures from brain measurements is an unresolved\nproblem. There are neither complete models describing underlying brain\ndynamics, nor do individual patients exhibit a single seizure onset pattern,\nwhich complicates the development of a `one-size-fits-all' solution. Based on a\nlongitudinal patient data set, we address the automated discovery and\nquantification of statistical features (biomarkers) that can be used to\nforecast seizures in a patient-specific way. We use existing and novel feature\nextraction algorithms, in particular the path signature, a recent development\nin time series analysis. Of particular interest is how this set of complex,\nnonlinear features performs compared to simpler, linear features on this task.\nOur inference is based on statistical classification algorithms with in-built\nsubset selection to discern time series with and without an impending seizure\nwhile selecting only a small number of relevant features. This study may be\nseen as a step towards a generalisable pattern recognition pipeline for time\nseries in a broader context.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:19:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Haderlein","Jonas F.",""],["Peterson","Andre D. H.",""],["Eskikand","Parvin Zarei",""],["Cook","Mark J.",""],["Burkitt","Anthony N.",""],["Mareels","Iven M. Y.",""],["Grayden","David B.",""]]}
{"id":"2308.09313","submitter":"Ze Tang","authors":"Ze Tang, Jidong Ge, Shangqing Liu, Tingwei Zhu, Tongtong Xu, Liguo\n  Huang, Bin Luo","title":"Domain Adaptive Code Completion via Language Models and Decoupled Domain\n  Databases","comments":"Accepted by ASE2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have demonstrated remarkable performance in code\ncompletion. However, due to the lack of domain-specific knowledge, they may not\nbe optimal in completing code that requires intensive domain knowledge for\nexample completing the library names. Although there are several works that\nhave confirmed the effectiveness of fine-tuning techniques to adapt language\nmodels for code completion in specific domains. They are limited by the need\nfor constant fine-tuning of the model when the project is in constant\niteration.\n  To address this limitation, in this paper, we propose $k$NM-LM, a\nretrieval-augmented language model (R-LM), that integrates domain knowledge\ninto language models without fine-tuning. Different from previous techniques,\nour approach is able to automatically adapt to different language models and\ndomains. Specifically, it utilizes the in-domain code to build the\nretrieval-based database decoupled from LM, and then combines it with LM\nthrough Bayesian inference to complete the code. The extensive experiments on\nthe completion of intra-project and intra-scenario have confirmed that $k$NM-LM\nbrings about appreciable enhancements when compared to CodeGPT and UnixCoder. A\ndeep analysis of our tool including the responding speed, storage usage,\nspecific type code completion, and API invocation completion has confirmed that\n$k$NM-LM provides satisfactory performance, which renders it highly appropriate\nfor domain adaptive code completion. Furthermore, our approach operates without\nthe requirement for direct access to the language model's parameters. As a\nresult, it can seamlessly integrate with black-box code completion models,\nmaking it easy to integrate our approach as a plugin to further enhance the\nperformance of these models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:25:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tang","Ze",""],["Ge","Jidong",""],["Liu","Shangqing",""],["Zhu","Tingwei",""],["Xu","Tongtong",""],["Huang","Liguo",""],["Luo","Bin",""]]}
{"id":"2308.09314","submitter":"Peng Xiang","authors":"Peng Xiang, Xin Wen, Yu-Shen Liu, Hui Zhang, Yi Fang, Zhizhong Han","title":"Retro-FPN: Retrospective Feature Pyramid Network for Point Cloud\n  Semantic Segmentation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning per-point semantic features from the hierarchical feature pyramid is\nessential for point cloud semantic segmentation. However, most previous methods\nsuffered from ambiguous region features or failed to refine per-point features\neffectively, which leads to information loss and ambiguous semantic\nidentification. To resolve this, we propose Retro-FPN to model the per-point\nfeature prediction as an explicit and retrospective refining process, which\ngoes through all the pyramid layers to extract semantic features explicitly for\neach point. Its key novelty is a retro-transformer for summarizing semantic\ncontexts from the previous layer and accordingly refining the features in the\ncurrent stage. In this way, the categorization of each point is conditioned on\nits local semantic pattern. Specifically, the retro-transformer consists of a\nlocal cross-attention block and a semantic gate unit. The cross-attention\nserves to summarize the semantic pattern retrospectively from the previous\nlayer. And the gate unit carefully incorporates the summarized contexts and\nrefines the current semantic features. Retro-FPN is a pluggable neural network\nthat applies to hierarchical decoders. By integrating Retro-FPN with three\nrepresentative backbones, including both point-based and voxel-based methods,\nwe show that Retro-FPN can significantly improve performance over\nstate-of-the-art backbones. Comprehensive experiments on widely used benchmarks\ncan justify the effectiveness of our design. The source is available at\nhttps://github.com/AllenXiangX/Retro-FPN\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:28:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xiang","Peng",""],["Wen","Xin",""],["Liu","Yu-Shen",""],["Zhang","Hui",""],["Fang","Yi",""],["Han","Zhizhong",""]]}
{"id":"2308.09315","submitter":"David Kammer","authors":"Mohit Pundir, Mokhtar Adda-Bedia, David S. Kammer","title":"Transonic and supershear crack propagation driven by geometric\n  nonlinearities","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linear elastic fracture mechanics theory predicts that the speed of crack\ngrowth is limited by the Rayleigh wave speed. Although many experimental\nobservations and numerical simulations have supported this prediction, some\nexceptions have raised questions about its validity. The underlying reasons for\nthese discrepancies and the precise limiting speed of dynamic cracks remain\nunknown. Here, we demonstrate that tensile (mode I) cracks can exceed the\nRayleigh wave speed and propagate at supershear speeds. We show that taking\ninto account geometric non-linearities, inherent in most materials, is\nsufficient to enable such propagation modes. These geometric non-linearities\nmodify the crack-tip singularity, resulting in different crack-tip opening\ndisplacements, cohesive zone behavior, and energy flows towards the crack tip.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:30:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pundir","Mohit",""],["Adda-Bedia","Mokhtar",""],["Kammer","David S.",""]]}
{"id":"2308.09316","submitter":"Fan Yang","authors":"Fan Yang, Xingyu Li, Hui Zhai","title":"Non-Adiabatic Effect in Topological and Interacting Charge Pumping","comments":"5 pages, 3 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":"  Topological charge pumping occurs in the adiabatic limit, and the\nnon-adiabatic effect due to finite ramping velocity reduces the pumping\nefficiency and leads to deviation from quantized charge pumping. In this work,\nwe discuss the relation between this deviation from quantized charge pumping\nand the entanglement generation after a pumping circle. In this simplest\nsetting, we show that purity $\\mathcal{P}$ of the half system reduced density\nmatrix equals to $\\mathcal{R}$ defined as $(1-\\kappa)^2+\\kappa^2$, where\n$\\kappa$ denotes the pumping efficiency. In generic situations, we argue\n$\\mathcal{P}<\\mathcal{R}$ and the pumping efficiency can provide an upper bound\nfor purity and, therefore, a lower bound for generated entanglement. To support\nthis conjecture, we propose a solvable pumping scheme in the\nRice--Mele--Hubbard model, which can be represented as brick-wall type quantum\ncircuit model. With this pumping scheme, numerical calculation of charge\npumping only needs to include at most six sites, and therefore, the interaction\nand the finite temperature effects can be both included reliably in the exact\ndiagonalization calculation. The numerical results using the solvable pumping\ncircle identify two regimes where the pumping efficiency is sensitive to\nramping velocity and support the conjecture $\\mathcal{P}<\\mathcal{R}$ when both\ninteraction and finite temperature effects are present.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:33:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Fan",""],["Li","Xingyu",""],["Zhai","Hui",""]]}
{"id":"2308.09317","submitter":"Roberto Paoletti","authors":"Roberto Paoletti","title":"Poisson and Szeg\\\"{o} kernel scaling asymptotics on Grauert tube\n  boundaries (after Zelditch, Chang and Rabinowitz)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review and elaborate on recent work of Chang and Rabinowitz on scaling\nasymptotics of Poisson and Szeg\\\"{o} kernels on Grauert tubes, providing\nadditional results that may be useful in applications. In particular, focusing\non the near-diagonal case, we give an explicit description of the leading order\nterms, and an estimate on the growth of the degree of certain polynomials\ndescribing the rescaled asymptotics. Furthermore, we allow rescaled asymptotics\nin a range $O\\left(\\lambda^{\\epsilon-1/2}\\right)$ in all the variables\ninvolved, where $\\lambda\\rightarrow+\\infty$ is the asymptotic parameter, rather\nthan rescale according to Heisenberg type.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:33:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Paoletti","Roberto",""]]}
{"id":"2308.09318","submitter":"Sungwon Han","authors":"Sungwon Han, Sungwon Park, Fangzhao Wu, Sundong Kim, Bin Zhu, Xing Xie\n  and Meeyoung Cha","title":"Towards Attack-tolerant Federated Learning via Critical Parameter\n  Analysis","comments":"ICCV'23 Accepted","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 is used to train a shared model in a decentralized way\nwithout clients sharing private data with each other. Federated learning\nsystems are susceptible to poisoning attacks when malicious clients send false\nupdates to the central server. Existing defense strategies are ineffective\nunder non-IID data settings. This paper proposes a new defense strategy, FedCPA\n(Federated learning with Critical Parameter Analysis). Our attack-tolerant\naggregation method is based on the observation that benign local models have\nsimilar sets of top-k and bottom-k critical parameters, whereas poisoned local\nmodels do not. Experiments with different attack scenarios on multiple datasets\ndemonstrate that our model outperforms existing defense strategies in defending\nagainst poisoning attacks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:37:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Han","Sungwon",""],["Park","Sungwon",""],["Wu","Fangzhao",""],["Kim","Sundong",""],["Zhu","Bin",""],["Xie","Xing",""],["Cha","Meeyoung",""]]}
{"id":"2308.09319","submitter":"Tuomo Salmi","authors":"Tuomo Salmi, Serena Vinciguerra, Devarshi Choudhury, Anna L. Watts,\n  Wynn C. G. Ho, Sebastien Guillot, Yves Kini, Bas Dorsman, Sharon M. Morsink,\n  Slavko Bogdanov","title":"Atmospheric Effects on Neutron Star Parameter Constraints with NICER","comments":"26 pages, 12 figures (2 of which are figure sets), 3 tables. Accepted\n  for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an analysis of the effects of uncertainties in the atmosphere\nmodels on the radius, mass, and other neutron star parameter constraints for\nthe NICER observations of rotation-powered millisecond pulsars. To date, NICER\nhas applied the X-ray pulse profile modeling technique to two\nmillisecond-period pulsars: PSR J0030+0451 and the high-mass pulsar PSR\nJ0740+6620. These studies have commonly assumed a deep-heated fully-ionized\nhydrogen atmosphere model, although they have explored the effects of\npartial-ionization and helium composition in some cases. Here we extend that\nexploration and also include new models with partially ionized carbon\ncomposition, externally heated hydrogen, and an empirical atmospheric beaming\nparametrization to explore deviations in the expected anisotropy of the emitted\nradiation. None of the studied atmosphere cases have any significant influence\non the inferred radius of PSR J0740+6620, possibly due to its X-ray faintness,\ntighter external constraints, and/or viewing geometry. In the case of PSR\nJ0030+0451 both the composition and ionization state could significantly alter\nthe inferred radius. However, based on the evidence (prior predictive\nprobability of the data), partially ionized hydrogen and carbon atmospheres are\ndisfavored. The difference in the evidence for ionized hydrogen and helium\natmospheres is too small to be decisive for most cases, but the inferred radius\nfor helium models trends to larger sizes around or above 14-15 km. External\nheating or deviations in the beaming that are less than $5\\,\\%$ at emission\nangles smaller than 60 degrees, on the other hand, have no significant effect\non the inferred radius.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:40:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Salmi","Tuomo",""],["Vinciguerra","Serena",""],["Choudhury","Devarshi",""],["Watts","Anna L.",""],["Ho","Wynn C. G.",""],["Guillot","Sebastien",""],["Kini","Yves",""],["Dorsman","Bas",""],["Morsink","Sharon M.",""],["Bogdanov","Slavko",""]]}
{"id":"2308.09320","submitter":"Simon X. Yang","authors":"Tao Yan, Zhe Xu, Simon X. Yang","title":"Distributed Robust Learning-Based Backstepping Control Aided with\n  Neurodynamics for Consensus Formation Tracking of Underwater Vessels","comments":null,"journal-ref":null,"doi":"10.1109/TCYB.2023.3299222","report-no":null,"categories":"cs.RO cs.AI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses distributed robust learning-based control for consensus\nformation tracking of multiple underwater vessels, in which the system\nparameters of the marine vessels are assumed to be entirely unknown and subject\nto the modeling mismatch, oceanic disturbances, and noises. Towards this end,\ngraph theory is used to allow us to synthesize the distributed controller with\na stability guarantee. Due to the fact that the parameter uncertainties only\narise in the vessels' dynamic model, the backstepping control technique is then\nemployed. Subsequently, to overcome the difficulties in handling time-varying\nand unknown systems, an online learning procedure is developed in the proposed\ndistributed formation control protocol. Moreover, modeling errors,\nenvironmental disturbances, and measurement noises are considered and tackled\nby introducing a neurodynamics model in the controller design to obtain a\nrobust solution. Then, the stability analysis of the overall closed-loop system\nunder the proposed scheme is provided to ensure the robust adaptive performance\nat the theoretical level. Finally, extensive simulation experiments are\nconducted to further verify the efficacy of the presented distributed control\nprotocol.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:45:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yan","Tao",""],["Xu","Zhe",""],["Yang","Simon X.",""]]}
{"id":"2308.09321","submitter":"Lingrui Ge Dr","authors":"Lingrui Ge, Svetlana Jitomirskaya and Jiangong You","title":"Kotani theory, Puig's argument, and stability of The Ten Martini Problem","comments":"59 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.DS math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We solve the ten martini problem (Cantor spectrum with no condition on\nirrational frequencies, previously only established for the almost Mathieu) for\na large class of one-frequency quasiperiodic operators, including\nnonperturbative analytic neighborhoods of several popular explicit families.\nThe proof is based on the structural analysis of dual cocycles as introduced in\n[35]. As a part of the proof, we develop several general ingredients of\nindependent interest: Kotani theory, for a class of finite-range operators over\ngeneral minimal underlying dynamics, making the first step towards and\nproviding a partial solution of the Kotani-Simon problem, simplicity of point\nspectrum for the same class, and the all-frequency version of Puig's argument.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:45:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ge","Lingrui",""],["Jitomirskaya","Svetlana",""],["You","Jiangong",""]]}
{"id":"2308.09322","submitter":"Sangmin Woo","authors":"Muhammad Adi Nugroho, Sangmin Woo, Sumin Lee, Changick Kim","title":"Audio-Visual Glance Network for Efficient Video Recognition","comments":"ICCV 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":"  Deep learning has made significant strides in video understanding tasks, but\nthe computation required to classify lengthy and massive videos using\nclip-level video classifiers remains impractical and prohibitively expensive.\nTo address this issue, we propose Audio-Visual Glance Network (AVGN), which\nleverages the commonly available audio and visual modalities to efficiently\nprocess the spatio-temporally important parts of a video. AVGN firstly divides\nthe video into snippets of image-audio clip pair and employs lightweight\nunimodal encoders to extract global visual features and audio features. To\nidentify the important temporal segments, we use an Audio-Visual Temporal\nSaliency Transformer (AV-TeST) that estimates the saliency scores of each\nframe. To further increase efficiency in the spatial dimension, AVGN processes\nonly the important patches instead of the whole images. We use an\nAudio-Enhanced Spatial Patch Attention (AESPA) module to produce a set of\nenhanced coarse visual features, which are fed to a policy network that\nproduces the coordinates of the important patches. This approach enables us to\nfocus only on the most important spatio-temporally parts of the video, leading\nto more efficient video recognition. Moreover, we incorporate various training\ntechniques and multi-modal feature fusion to enhance the robustness and\neffectiveness of our AVGN. By combining these strategies, our AVGN sets new\nstate-of-the-art performance in multiple video recognition benchmarks while\nachieving faster processing speed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:46:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nugroho","Muhammad Adi",""],["Woo","Sangmin",""],["Lee","Sumin",""],["Kim","Changick",""]]}
{"id":"2308.09323","submitter":"Ruiyuan Ming","authors":"Ruiyuan Ming, Peng Ye, Kuojun Yang, Zhixiang Pan, ChenYang Li, Chuang\n  Huang","title":"Real-time frequency measurement based on parallel pipeline FFT for\n  time-stretched acquisition system","comments":"11 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Real-time frequency measurement for non-repetitive and statistically rare\nsignals are challenging problems in the electronic measurement area, which\nplaces high demands on the bandwidth, sampling rate, data processing and\ntransmission capabilities of the measurement system. The time-stretching\nsampling system overcomes the bandwidth limitation and sampling rate limitation\nof electronic digitizers, allowing continuous ultra-high-speed acquisition at\nrefresh rates of billions of frames per second. However, processing the high\nsampling rate signals of hundreds of GHz is an extremely challenging task,\nwhich becomes the bottleneck of the real-time analysis for non-stationary\nsignals. In this work, a real-time frequency measurement system is designed\nbased on a parallel pipelined FFT structure. Tens of FFT channels are pipelined\nto process the incoming high sampling rate signals in sequence, and a\nsimplified parabola fitting algorithm is implemented in the FFT channel to\nimprove the frequency precision. The frequency results of these FFT channels\nare reorganized and finally uploaded to an industrial personal computer for\nvisualization and offline data mining. A real-time transmission datapath is\ndesigned to provide a high throughput rate transmission, ensuring the frequency\nresults are uploaded without interruption. Several experiments are performed to\nevaluate the designed real-time frequency measurement system, the input signal\nhas a bandwidth of 4 GHz, and the repetition rate of frames is 22 MHz.\nExperimental results show that the frequency of the signal can be measured at a\nhigh sampling rate of 20 GSPS, and the frequency precision is better than 1\nMHz.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:51:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ming","Ruiyuan",""],["Ye","Peng",""],["Yang","Kuojun",""],["Pan","Zhixiang",""],["Li","ChenYang",""],["Huang","Chuang",""]]}
{"id":"2308.09324","submitter":"Yintong Huo","authors":"Yintong Huo, Yichen Li, Yuxin Su, Pinjia He, Zifan Xie, and Michael R.\n  Lyu","title":"AutoLog: A Log Sequence Synthesis Framework for Anomaly Detection","comments":"The paper has been accepted by ASE 2023 (Research Track)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid progress of modern computing systems has led to a growing interest\nin informative run-time logs. Various log-based anomaly detection techniques\nhave been proposed to ensure software reliability. However, their\nimplementation in the industry has been limited due to the lack of high-quality\npublic log resources as training datasets.\n  While some log datasets are available for anomaly detection, they suffer from\nlimitations in (1) comprehensiveness of log events; (2) scalability over\ndiverse systems; and (3) flexibility of log utility. To address these\nlimitations, we propose AutoLog, the first automated log generation methodology\nfor anomaly detection. AutoLog uses program analysis to generate run-time log\nsequences without actually running the system. AutoLog starts with probing\ncomprehensive logging statements associated with the call graphs of an\napplication. Then, it constructs execution graphs for each method after pruning\nthe call graphs to find log-related execution paths in a scalable manner.\nFinally, AutoLog propagates the anomaly label to each acquired execution path\nbased on human knowledge. It generates flexible log sequences by walking along\nthe log execution paths with controllable parameters. Experiments on 50 popular\nJava projects show that AutoLog acquires significantly more (9x-58x) log events\nthan existing log datasets from the same system, and generates log messages\nmuch faster (15x) with a single machine than existing passive data collection\napproaches. We hope AutoLog can facilitate the benchmarking and adoption of\nautomated log analysis techniques.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 05:56:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huo","Yintong",""],["Li","Yichen",""],["Su","Yuxin",""],["He","Pinjia",""],["Xie","Zifan",""],["Lyu","Michael R.",""]]}
{"id":"2308.09325","submitter":"Kamineni Rama Koteswara Rao","authors":"Pooja Lamba, Akshat Rana, Sougata Halder, Siddharth Dhomkar, Dieter\n  Suter, and Rama K. Kamineni","title":"Vector detection of AC magnetic fields by Nitrogen-Vacancy centers of\n  single orientation in diamond","comments":"7 pages, 5 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":"  Nitrogen-Vacancy (NV) centers in diamond have useful properties for detecting\nboth AC and DC magnetic fields with high sensitivity at nano-scale resolution.\nVector detection of AC magnetic fields can be achieved by using NV centers\nhaving three different orientations. Here, we propose a method to achieve this\nby using NV centers of single orientation. In this method, a static magnetic\nfield is applied perpendicular to the NV axis, leading to strong mixing of the\n$m_{s}=-1$ and $1$ electron spin states. As a result, all three electron spin\ntransitions of the triplet ground state have non-zero dipole moments, with each\ntransition coupling to a single component of the magnetic field. This can be\nused to measure both strength and orientation of the applied AC field. To\nvalidate the technique, we perform a proof of principle experiment using a\nsubset of ensemble NV centers in diamond, all having the same orientation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:02:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lamba","Pooja",""],["Rana","Akshat",""],["Halder","Sougata",""],["Dhomkar","Siddharth",""],["Suter","Dieter",""],["Kamineni","Rama K.",""]]}
{"id":"2308.09326","submitter":"Simon X. Yang","authors":"Tao Yan, Zhe Xu, Simon X. Yang, S. Andrew Gadsden","title":"Distributed Neurodynamics-Based Backstepping Optimal Control for Robust\n  Constrained Consensus of Underactuated Underwater Vehicles Fleet","comments":"This paper is accepted by IEEE Transactions on Cybernetics","journal-ref":null,"doi":"10.1109/TCYB.2023.3301737","report-no":null,"categories":"eess.SY cs.AI cs.RO cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust constrained formation tracking control of underactuated underwater\nvehicles (UUVs) fleet in three-dimensional space is a challenging but practical\nproblem. To address this problem, this paper develops a novel consensus based\noptimal coordination protocol and a robust controller, which adopts a\nhierarchical architecture. On the top layer, the spherical coordinate transform\nis introduced to tackle the nonholonomic constraint, and then a distributed\noptimal motion coordination strategy is developed. As a result, the optimal\nformation tracking of UUVs fleet can be achieved, and the constraints are\nfulfilled. To realize the generated optimal commands better and, meanwhile,\ndeal with the underactuation, at the lower-level control loop a neurodynamics\nbased robust backstepping controller is designed, and in particular, the issue\nof \"explosion of terms\" appearing in conventional backstepping based\ncontrollers is avoided and control activities are improved. The stability of\nthe overall UUVs formation system is established to ensure that all the states\nof the UUVs are uniformly ultimately bounded in the presence of unknown\ndisturbances. Finally, extensive simulation comparisons are made to illustrate\nthe superiority and effectiveness of the derived optimal formation tracking\nprotocol.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:04:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yan","Tao",""],["Xu","Zhe",""],["Yang","Simon X.",""],["Gadsden","S. Andrew",""]]}
{"id":"2308.09327","submitter":"Ruibing Jin","authors":"Ruibing Jin, Guosheng Lin, Min Wu, Jie Lin, Zhengguo Li, Xiaoli Li and\n  Zhenghua Chen","title":"Unlimited Knowledge Distillation for Action Recognition in the Dark","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dark videos often lose essential information, which causes the knowledge\nlearned by networks is not enough to accurately recognize actions. Existing\nknowledge assembling methods require massive GPU memory to distill the\nknowledge from multiple teacher models into a student model. In action\nrecognition, this drawback becomes serious due to much computation required by\nvideo process. Constrained by limited computation source, these approaches are\ninfeasible. To address this issue, we propose an unlimited knowledge\ndistillation (UKD) in this paper. Compared with existing knowledge assembling\nmethods, our UKD can effectively assemble different knowledge without\nintroducing high GPU memory consumption. Thus, the number of teaching models\nfor distillation is unlimited. With our UKD, the network's learned knowledge\ncan be remarkably enriched. Our experiments show that the single stream network\ndistilled with our UKD even surpasses a two-stream network. Extensive\nexperiments are conducted on the ARID dataset.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:04:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jin","Ruibing",""],["Lin","Guosheng",""],["Wu","Min",""],["Lin","Jie",""],["Li","Zhengguo",""],["Li","Xiaoli",""],["Chen","Zhenghua",""]]}
{"id":"2308.09328","submitter":"R. Rajesh","authors":"Kamal Tripathi, Hitesh Garg, R. Rajesh, Satyavani Vemparala","title":"The conformational phase diagram of charged polymers in the presence of\n  attractive bridging crowders","comments":"12 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using extensive molecular dynamics simulations, we obtain the conformational\nphase diagram of a charged polymer in the presence of oppositely charged\ncounterions and neutral attractive crowders for monovalent, divalent and\ntrivalent counterion valencies. We demonstrate that the charged polymer can\nexist in three phases: (1) an extended phase for low charge densities and weak\npolymer-crowder attractive interactions ($CE$), (2) a collapsed phase for high\ncharge densities and weak polymer-crowder attractive interactions, primarily\ndriven by counterion condensation ($CCI$), and (3) a collapsed phase for strong\npolymer-crowder attractive interactions, irrespective of the charge density,\ndriven by crowders acting as bridges or crosslinks ($CCB$). Importantly, the\nsimulations reveal that the interaction with crowders can induce collapse,\ndespite the presence of strong repulsive electrostatic interactions, and can\nreplace condensed counterions to facilitate a direct transition from the $CCI$\nand $CE$ phases to the $CCB$ phase.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:04:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tripathi","Kamal",""],["Garg","Hitesh",""],["Rajesh","R.",""],["Vemparala","Satyavani",""]]}
{"id":"2308.09329","submitter":"Yunzhi Qiu","authors":"Yunzhi Qiu, Xiaokun Zhang, Weiwei Wang, Tongxuan Zhang, Bo Xu, Hongfei\n  Lin","title":"KESDT: knowledge enhanced shallow and deep Transformer for detecting\n  adverse drug reactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adverse drug reaction (ADR) detection is an essential task in the medical\nfield, as ADRs have a gravely detrimental impact on patients' health and the\nhealthcare system. Due to a large number of people sharing information on\nsocial media platforms, an increasing number of efforts focus on social media\ndata to carry out effective ADR detection. Despite having achieved impressive\nperformance, the existing methods of ADR detection still suffer from three main\nchallenges. Firstly, researchers have consistently ignored the interaction\nbetween domain keywords and other words in the sentence. Secondly, social media\ndatasets suffer from the challenges of low annotated data. Thirdly, the issue\nof sample imbalance is commonly observed in social media datasets. To solve\nthese challenges, we propose the Knowledge Enhanced Shallow and Deep\nTransformer(KESDT) model for ADR detection. Specifically, to cope with the\nfirst issue, we incorporate the domain keywords into the Transformer model\nthrough a shallow fusion manner, which enables the model to fully exploit the\ninteractive relationships between domain keywords and other words in the\nsentence. To overcome the low annotated data, we integrate the synonym sets\ninto the Transformer model through a deep fusion manner, which expands the size\nof the samples. To mitigate the impact of sample imbalance, we replace the\nstandard cross entropy loss function with the focal loss function for effective\nmodel training. We conduct extensive experiments on three public datasets\nincluding TwiMed, Twitter, and CADEC. The proposed KESDT outperforms\nstate-of-the-art baselines on F1 values, with relative improvements of 4.87%,\n47.83%, and 5.73% respectively, which demonstrates the effectiveness of our\nproposed KESDT.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:10:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qiu","Yunzhi",""],["Zhang","Xiaokun",""],["Wang","Weiwei",""],["Zhang","Tongxuan",""],["Xu","Bo",""],["Lin","Hongfei",""]]}
{"id":"2308.09330","submitter":"Issei Oikawa","authors":"Issei Oikawa","title":"A non-overlapping Schwarz algorithm for the HDG 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":"  In this paper, we present two non-overlapping Schwarz algorithms for the\nhybridizable discontinuous Galerkin (HDG) method. The first algorithm is based\non the Neumann-Neumann method. The second one is an iterative algorithm uses\nboth trace and flux interface unknowns on interfaces between subdomains.\nNumerical results are provided to verify the validity of our algorithms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:24:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Oikawa","Issei",""]]}
{"id":"2308.09331","submitter":"Botond Fazekas","authors":"Botond Fazekas, Jos\\'e Morano, Dmitrii Lachinov, Guilherme Aresta,\n  Hrvoje Bogunovi\\'c","title":"SAMedOCT: Adapting Segment Anything Model (SAM) for Retinal OCT","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":"  The Segment Anything Model (SAM) has gained significant attention in the\nfield of image segmentation due to its impressive capabilities and prompt-based\ninterface. While SAM has already been extensively evaluated in various domains,\nits adaptation to retinal OCT scans remains unexplored. To bridge this research\ngap, we conduct a comprehensive evaluation of SAM and its adaptations on a\nlarge-scale public dataset of OCTs from RETOUCH challenge. Our evaluation\ncovers diverse retinal diseases, fluid compartments, and device vendors,\ncomparing SAM against state-of-the-art retinal fluid segmentation methods.\nThrough our analysis, we showcase adapted SAM's efficacy as a powerful\nsegmentation model in retinal OCT scans, although still lagging behind\nestablished methods in some circumstances. The findings highlight SAM's\nadaptability and robustness, showcasing its utility as a valuable tool in\nretinal OCT image analysis and paving the way for further advancements in this\ndomain.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:26:22 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:45:59 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Fazekas","Botond",""],["Morano","Jos\u00e9",""],["Lachinov","Dmitrii",""],["Aresta","Guilherme",""],["Bogunovi\u0107","Hrvoje",""]]}
{"id":"2308.09332","submitter":"Yuhao Cheng","authors":"Yuhao Cheng, Siru Zhang, Yiqiang Yan, Rong Chen, Yun Zhang","title":"LSCD: A Large-Scale Screen Content Dataset for Video Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimedia compression allows us to watch videos, see pictures and hear\nsounds within a limited bandwidth, which helps the flourish of the internet.\nDuring the past decades, multimedia compression has achieved great success\nusing hand-craft features and systems. With the development of artificial\nintelligence and video compression, there emerges a lot of research work\nrelated to using the neural network on the video compression task to get rid of\nthe complicated system. Not only producing the advanced algorithms, but\nresearchers also spread the compression to different content, such as User\nGenerated Content(UGC). With the rapid development of mobile devices, screen\ncontent videos become an important part of multimedia data. In contrast, we\nfind community lacks a large-scale dataset for screen content video\ncompression, which impedes the fast development of the corresponding\nlearning-based algorithms. In order to fulfill this blank and accelerate the\nresearch of this special type of videos, we propose the Large-scale Screen\nContent Dataset(LSCD), which contains 714 source sequences. Meanwhile, we\nprovide the analysis of the proposed dataset to show some features of screen\ncontent videos, which will help researchers have a better understanding of how\nto explore new algorithms. Besides collecting and post-processing the data to\norganize the dataset, we also provide a benchmark containing the performance of\nboth traditional codec and learning-based methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:27:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cheng","Yuhao",""],["Zhang","Siru",""],["Yan","Yiqiang",""],["Chen","Rong",""],["Zhang","Yun",""]]}
{"id":"2308.09333","submitter":"Siddartha Reddy Mr","authors":"Siddartha Reddy and Sundeep Prabhakar Chepuri","title":"Sampling and Recovery of Signals on a Simplicial Complex using\n  Neighbourhood Aggregation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we focus on sampling and recovery of signals over simplicial\ncomplexes. In particular, we subsample a simplicial signal of a certain order\nand focus on recovering multi-order bandlimited simplicial signals of one order\nhigher and one order lower. To do so, we assume that the simplicial signal\nadmits the Helmholtz decomposition that relates simplicial signals of these\ndifferent orders. Next, we propose an aggregation sampling scheme for\nsimplicial signals based on the Hodge Laplacian matrix and a simple least\nsquares estimator for recovery. We also provide theoretical conditions on the\nnumber of aggregations and size of the sampling set required for faithful\nreconstruction as a function of the bandwidth of simplicial signals to be\nrecovered. Numerical experiments are provided to show the effectiveness of the\nproposed method.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:27:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Reddy","Siddartha",""],["Chepuri","Sundeep Prabhakar",""]]}
{"id":"2308.09334","submitter":"Karim Boustany","authors":"Karim Boustany","title":"Lagrangian Intersections in Toric Del Pezzo Surfaces","comments":"61 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend a recent intersection result of R. Hind and E. Kerman for integral\nLagrangian tori in $\\mathbb{S}^{2} \\times \\mathbb{S}^{2}$ to all toric Del\nPezzo surfaces. An integral torus is one whose relative area homomorphism is\ninteger-valued, and we seek a maximal packing. By definition, this is a\ndisjoint collection $\\{L_{i}\\}$ of integral Lagrangian tori with the following\nproperty: any other integral Lagrangian torus not in this collection must\nintersect at least one of the $L_{i}$. We show that one can always find such a\npacking consisting of only the Clifford torus.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:29:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Boustany","Karim",""]]}
{"id":"2308.09335","submitter":"Servando Vargas Serdio","authors":"Cesar S. Lopez-Monsalvo, Servando Vargas-Serdio, Julian A.\n  Alzate-Cardenas, Daniel Flores-Alfonso","title":"The geometric theory of low dimensional superconductivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con math-ph math.MP physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of the electromagnetic properties of 2D materials is an area of\nintensive research. Most of the efforts in the subject have been oriented\ntowards the understanding and modelling of the microscopic behaviour of the\ncharge carriers within the medium. Albeit there is a well established manner to\nexpress London's equations in the language of differential geometry, an\neffective geometric theory of the macroscopic phenomenon is still lacking. In\nthis work we concentrate in obtaining the underlying geometric structure of\nsuperconductivity in two dimensional materials. To this effect, we produce an\nintrinsic framework which allows us to clearly identify the geometric\nassumptions leading to London's equations and the Meissner state. Specifically,\nwe show that any two-dimensional medium whose response to an externally applied\nelectromagnetic field results in a divergence free geodesically flowing induced\ncurrent must be a superconductor. In this manner, we conclude that the\nunderlying geometry of this type of media is that of a three dimensional\nLorentzian contact manifold. Moreover, we show that the geometric condition\nmacroscopically encoding the superconducting phenomena emerges from a\nvariational principle, exhibiting that the macroscopic hallmark of\nsuperconductivity is expressed as the non-vanishing of the induced current's\nhelicity.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:31:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lopez-Monsalvo","Cesar S.",""],["Vargas-Serdio","Servando",""],["Alzate-Cardenas","Julian A.",""],["Flores-Alfonso","Daniel",""]]}
{"id":"2308.09336","submitter":"Jingxuan Zhang","authors":"Jingxuan Zhang, Chenni Xu, Patrick Sebbah and Li-Gang Wang","title":"Diffraction limit of light in curved space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Overcoming diffraction limit is crucial for obtaining high-resolution image\nand observing fine microstructure. With this conventional difficulty still\npuzzling us and the prosperous development of wave dynamics of light\ninteracting with gravitational fields in recent years, how spatial curvature\naffect the diffraction limit is an attractive and important question. Here we\ninvestigate the issue of diffraction limit and optical resolution on\ntwo-dimensional curved spaces - surfaces of revolution (SORs) with constant or\nvariable spatial curvature. We show that the diffraction limit decreases and\nresolution is improved on SORs with positive Gaussian curvature, opening a new\navenue to super-resolution. The diffraction limit is also influenced by\npropagation direction, as well as the propagation distance in curved space with\nvariable spatial curvature. These results provide a possible method to control\noptical resolution in curved space or equivalent waveguides with varying\nrefractive index distribution and may allow one to detect the presence of\nnon-uniform strong gravitational effect by probing locally the optical\nresolution.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:31:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Jingxuan",""],["Xu","Chenni",""],["Sebbah","Patrick",""],["Wang","Li-Gang",""]]}
{"id":"2308.09337","submitter":"Raghunath Sahoo","authors":"Kshitish Kumar Pradhan, Ronald Scaria, Dushmanta Sahu, and Raghunath\n  Sahoo","title":"Proton number cumulants in a modified van der Waals hadron resonance gas","comments":"9-pages and 6-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":"  An estimate of the proton number cumulants in the hadronic matter is\npresented considering a van der Waals-type interaction between the constituent\nparticles. We argue that the attractive and repulsive parameters in the VDW\nhadron resonance gas (VDWHRG) model change as functions of baryochemical\npotential ($\\mu_{B}$) and temperature ($T$). This, in turn, affects the\nestimation of thermodynamic properties and, consequently, the conserved charge\nfluctuations. We employ a simple parametrization to bring in the center-of-mass\nenergy ($\\sqrt{s_{\\rm NN}}$) dependence on temperature and baryochemical\npotential and then estimate the proton number cumulants with the modified\napproach. The modified van der Waals hadron resonance gas model (MVDWHRG)\nexplains the existing experimental data very well.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:43:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pradhan","Kshitish Kumar",""],["Scaria","Ronald",""],["Sahu","Dushmanta",""],["Sahoo","Raghunath",""]]}
{"id":"2308.09338","submitter":"Bacim Alali","authors":"Bacim Alali, Nathan Albin, Thinh Dang","title":"Asymptotic Analysis for the Eigenvalues of Peridynamic Operators","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":"  Explicit representations of the eigenvalues of the peridynamic operator have\nbeen recently derived in [5]. These representations are given in terms of\ngeneralized hypergeometric functions. Asymptotic analysis of the hypergeometric\nfunctions is utilized to identify the asymptotic behavior of the eigenvalues.\nWe show that the eigenvalues are bounded when the kernel is integrable and\ndiverge when the kernel is singular. The bounds and decay rates are presented\nexplicitly in terms of the spatial dimension, the integral kernel and the\nperidynamic horizon.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:45:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Alali","Bacim",""],["Albin","Nathan",""],["Dang","Thinh",""]]}
{"id":"2308.09339","submitter":"Yuzo Maruyama","authors":"Yuzo Maruyama and Takeru Matsuda","title":"Minimaxity under half-Cauchy type priors","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is a follow-up paper of Polson and Scott (2012, Bayesian Analysis),\nwhich claimed that the half-Cauchy prior is a sensible default prior for a\nscale parameter in hierarchical models. For estimation of a normal mean vector\nunder the quadratic loss, they showed that the Bayes estimator with respect to\nthe half-Cauchy prior seems to be minimax through numerical experiments. In\nterms of the shrinkage coefficient, the half-Cauchy prior has a U-shape and can\nbe interpreted as a continuous spike and slab prior. In this paper, we consider\na general class of priors with U-shapes and theoretically establish sufficient\nconditions for the minimaxity of the corresponding (generalized) Bayes\nestimators. We also develop an algorithm for posterior sampling and present\nnumerical results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:47:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Maruyama","Yuzo",""],["Matsuda","Takeru",""]]}
{"id":"2308.09340","submitter":"David Otero","authors":"David Otero, Javier Parapar and Nicola Ferro","title":"How Discriminative Are Your Qrels? How To Study the Statistical\n  Significance of Document Adjudication Methods","comments":null,"journal-ref":"Proceedings of the 32nd ACM International Conference on\n  Information and Knowledge Management (CIKM 2023)","doi":"10.1145/3583780.3614916","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Creating test collections for offline retrieval evaluation requires human\neffort to judge documents' relevance. This expensive activity motivated much\nwork in developing methods for constructing benchmarks with fewer assessment\ncosts. In this respect, adjudication methods actively decide both which\ndocuments and the order in which experts review them, in order to better\nexploit the assessment budget or to lower it. Researchers evaluate the quality\nof those methods by measuring the correlation between the known gold ranking of\nsystems under the full collection and the observed ranking of systems under the\nlower-cost one. This traditional analysis ignores whether and how the low-cost\njudgements impact on the statistically significant differences among systems\nwith respect to the full collection. We fill this void by proposing a novel\nmethodology to evaluate how the low-cost adjudication methods preserve the\npairwise significant differences between systems as the full collection. In\nother terms, while traditional approaches look for stability in answering the\nquestion \"is system A better than system B?\", our proposed approach looks for\nstability in answering the question \"is system A significantly better than\nsystem B?\", which is the ultimate questions researchers need to answer to\nguarantee the generalisability of their results. Among other results, we found\nthat the best methods in terms of ranking of systems correlation do not always\nmatch those preserving statistical significance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:52:07 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 08:00:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Otero","David",""],["Parapar","Javier",""],["Ferro","Nicola",""]]}
{"id":"2308.09341","submitter":"Mohammad Ahmadi Achachlouei","authors":"Mohammad Ahmadi Achachlouei, Omkar Patil, Tarun Joshi, Vijayan N. Nair","title":"Document Automation Architectures: Updated Survey in Light of Large\n  Language Models","comments":"The current paper is the updated version of an earlier survey on\n  document automation [Ahmadi Achachlouei et al. 2021]. Updates in the current\n  paper are as follows: We shortened almost all sections to reduce the size of\n  the main paper (without references) from 28 pages to 10 pages, added a review\n  of selected papers on large language models, removed certain sections and\n  most of diagrams. arXiv admin note: substantial text overlap with\n  arXiv:2109.11603","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper surveys the current state of the art in document automation (DA).\nThe objective of DA is to reduce the manual effort during the generation of\ndocuments by automatically creating and integrating input from different\nsources and assembling documents conforming to defined templates. There have\nbeen reviews of commercial solutions of DA, particularly in the legal domain,\nbut to date there has been no comprehensive review of the academic research on\nDA architectures and technologies. The current survey of DA reviews the\nacademic literature and provides a clearer definition and characterization of\nDA and its features, identifies state-of-the-art DA architectures and\ntechnologies in academic research, and provides ideas that can lead to new\nresearch opportunities within the DA field in light of recent advances in\ngenerative AI and large language models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:59:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Achachlouei","Mohammad Ahmadi",""],["Patil","Omkar",""],["Joshi","Tarun",""],["Nair","Vijayan N.",""]]}
{"id":"2308.09342","submitter":"Go Uchida","authors":"Go Uchida","title":"Coherence resonance for time-averaged measures","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Noise can induce time order in the dynamics of nonlinear dynamical systems.\nFor example, coherence resonance occurs in various neuron models driven by a\nnoise. In studies of coherence resonance, ensemble-averaged measures of the\ncoherence are often used. In the present study, we examine coherence resonance\nfor time-averaged measures from a viewpoint of random dynamical systems. For\nthe examination, we use a Hodgkin-Huxley neuron model driven by a constant\ncurrent and a noise. We firstly show that for large times, the neuron is in a\nstationary state irrespective of initial conditions of the neuron. We then show\nnumerical evidence that in the stationary state, a given noise sample path\nuniquely determines the dynamics of the neuron. We then present numerical\nevidence suggesting that time-averaged coherence measures of the dynamics is\nindependent of noise sample paths and is equal to ensemble-averaged coherence\nmeasures. On the basis of this property, we show that coherence resonance is\nnot only a phenomenon related to ensemble-averaged measures but also a\nphenomenon that holds for time-averaged measures.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:02:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Uchida","Go",""]]}
{"id":"2308.09343","submitter":"Dario Rodighiero","authors":"Dario Rodighiero, Lins Derry, Douglas Duhaime, Jordan Kruguer,\n  Maximilian C. Mueller, Christopher Pietsch, Jeffrey T. Schnapp, Jeff Steward","title":"Surprise machines: revealing Harvard Art Museums' image collection","comments":"14 pages and 7 figures","journal-ref":"IDJ 27 (1): 21-34 (2022)","doi":"10.1075/idj.22013.rod","report-no":null,"categories":"cs.CY cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surprise Machines is a project of experimental museology that sets out to\nvisualize the entire image collection of the Harvard Art Museums, intending to\nopen up unexpected vistas on more than 200,000 objects usually inaccessible to\nvisitors. Part of the exhibition Curatorial A(i)gents organized by metaLAB (at)\nHarvard, the project explores the limits of artificial intelligence to display\na large set of images and create surprise among visitors. To achieve such a\nfeeling of surprise, a choreographic interface was designed to connect the\naudience's movement with several unique views of the collection.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:05:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rodighiero","Dario",""],["Derry","Lins",""],["Duhaime","Douglas",""],["Kruguer","Jordan",""],["Mueller","Maximilian C.",""],["Pietsch","Christopher",""],["Schnapp","Jeffrey T.",""],["Steward","Jeff",""]]}
{"id":"2308.09344","submitter":"Yunseo Choi","authors":"Christopher Bao, Yunseo Choi, Katelyn Gan, and Owen Zhang","title":"On a Conjecture by Baril, Cerbai, Khalil, and Vajnovszki on Two\n  Restricted Stacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $s$ be West's stack-sorting map, and let $s_{T}$ be the generalized\nstack-sorting map, where instead of being required to increase, the stack\navoids subpermutations that are order-isomorphic to any permutation in the set\n$T$. In 2020, Cerbai, Claesson, and Ferrari introduced the $\\sigma$-machine $s\n\\circ s_{\\sigma}$ as a generalization of West's $2$-stack-sorting-map $s \\circ\ns$. As a further generalization, in 2021, Baril, Cerbai, Khalil, and Vajnovski\nintroduced the $(\\sigma, \\tau)$-machine $s \\circ s_{\\sigma, \\tau}$ and\nenumerated $|\\mathrm{Sort}_{n}(\\sigma,\\tau)|$ -- the number of permutations in\n$S_n$ that are mapped to the identity by the $(\\sigma, \\tau)$-machine -- for\nsix pairs of length $3$ permutations $(\\sigma, \\tau)$. In this work, we settle\na conjecture by Baril, Cerbai, Khalil, and Vajnovski on the only remaining pair\nof length $3$ patterns $(\\sigma, \\tau) = (132, 321)$ for which\n$|\\mathrm{Sort}_{n}(\\sigma, \\tau)|$ appears in the OEIS. In addition, we\nenumerate $|\\mathrm{Sort}_n(123, 321)|$, which does not appear in the OEIS, but\nhas a simple closed form.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:06:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bao","Christopher",""],["Choi","Yunseo",""],["Gan","Katelyn",""],["Zhang","Owen",""]]}
{"id":"2308.09345","submitter":"Robert Graf","authors":"Robert Graf, Joachim Schmitt, Sarah Schlaeger, Hendrik Kristian\n  M\\\"oller, Vasiliki Sideri-Lampretsa, Anjany Sekuboyina, Sandro Manuel Krieg,\n  Benedikt Wiestler, Bjoern Menze, Daniel Rueckert, Jan Stefan Kirschke","title":"Denoising diffusion-based MR to CT image translation enables whole spine\n  vertebral segmentation in 2D and 3D without manual annotations","comments":"35 pages, 7 figures, Code and a model weights available\n  https://doi.org/10.5281/zenodo.8221159 and\n  https://doi.org/10.5281/zenodo.8198697","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":"  Background: Automated segmentation of spinal MR images plays a vital role\nboth scientifically and clinically. However, accurately delineating posterior\nspine structures presents challenges.\n  Methods: This retrospective study, approved by the ethical committee,\ninvolved translating T1w and T2w MR image series into CT images in a total of\nn=263 pairs of CT/MR series. Landmark-based registration was performed to align\nimage pairs. We compared 2D paired (Pix2Pix, denoising diffusion implicit\nmodels (DDIM) image mode, DDIM noise mode) and unpaired (contrastive unpaired\ntranslation, SynDiff) image-to-image translation using \"peak signal to noise\nratio\" (PSNR) as quality measure. A publicly available segmentation network\nsegmented the synthesized CT datasets, and Dice scores were evaluated on\nin-house test sets and the \"MRSpineSeg Challenge\" volumes. The 2D findings were\nextended to 3D Pix2Pix and DDIM.\n  Results: 2D paired methods and SynDiff exhibited similar translation\nperformance and Dice scores on paired data. DDIM image mode achieved the\nhighest image quality. SynDiff, Pix2Pix, and DDIM image mode demonstrated\nsimilar Dice scores (0.77). For craniocaudal axis rotations, at least two\nlandmarks per vertebra were required for registration. The 3D translation\noutperformed the 2D approach, resulting in improved Dice scores (0.80) and\nanatomically accurate segmentations in a higher resolution than the original MR\nimage.\n  Conclusion: Two landmarks per vertebra registration enabled paired\nimage-to-image translation from MR to CT and outperformed all unpaired\napproaches. The 3D techniques provided anatomically correct segmentations,\navoiding underprediction of small structures like the spinous process.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:07:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Graf","Robert",""],["Schmitt","Joachim",""],["Schlaeger","Sarah",""],["M\u00f6ller","Hendrik Kristian",""],["Sideri-Lampretsa","Vasiliki",""],["Sekuboyina","Anjany",""],["Krieg","Sandro Manuel",""],["Wiestler","Benedikt",""],["Menze","Bjoern",""],["Rueckert","Daniel",""],["Kirschke","Jan Stefan",""]]}
{"id":"2308.09346","submitter":"Jiazheng Xing","authors":"Jiazheng Xing, Mengmeng Wang, Yudi Ruan, Bofan Chen, Yaowei Guo, Boyu\n  Mu, Guang Dai, Jingdong Wang, Yong Liu","title":"Boosting Few-shot Action Recognition with Graph-guided Hybrid Matching","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":"  Class prototype construction and matching are core aspects of few-shot action\nrecognition. Previous methods mainly focus on designing spatiotemporal relation\nmodeling modules or complex temporal alignment algorithms. Despite the\npromising results, they ignored the value of class prototype construction and\nmatching, leading to unsatisfactory performance in recognizing similar\ncategories in every task. In this paper, we propose GgHM, a new framework with\nGraph-guided Hybrid Matching. Concretely, we learn task-oriented features by\nthe guidance of a graph neural network during class prototype construction,\noptimizing the intra- and inter-class feature correlation explicitly. Next, we\ndesign a hybrid matching strategy, combining frame-level and tuple-level\nmatching to classify videos with multivariate styles. We additionally propose a\nlearnable dense temporal modeling module to enhance the video feature temporal\nrepresentation to build a more solid foundation for the matching process. GgHM\nshows consistent improvements over other challenging baselines on several\nfew-shot datasets, demonstrating the effectiveness of our method. The code will\nbe publicly available at https://github.com/jiazheng-xing/GgHM.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:07:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xing","Jiazheng",""],["Wang","Mengmeng",""],["Ruan","Yudi",""],["Chen","Bofan",""],["Guo","Yaowei",""],["Mu","Boyu",""],["Dai","Guang",""],["Wang","Jingdong",""],["Liu","Yong",""]]}
{"id":"2308.09347","submitter":"Stefano Matta","authors":"Andrea Loi, Stefano Matta","title":"Endowments, patience types, and uniqueness in two-good HARA utility\n  economies","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper establishes a link between endowments, patience types, and the\nparameters of the HARA Bernoulli utility function that ensure equilibrium\nuniqueness in an economy with two goods and two impatience types with additive\nseparable preferences. We provide sufficient conditions that guarantee\nuniqueness of equilibrium for any possible value of $\\gamma$ in the HARA\nutility function\n$\\frac{\\gamma}{1-\\gamma}\\left(b+\\frac{a}{\\gamma}x\\right)^{1-\\gamma}$. The\nanalysis contributes to the literature on uniqueness in pure exchange economies\nwith two-goods and two agent types and extends the result in [4].\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:10:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Loi","Andrea",""],["Matta","Stefano",""]]}
{"id":"2308.09348","submitter":"\\'Oscar Amaro","authors":"\\'Oscar Amaro and Marija Vranic","title":"QScatter: Numerical Framework for Fast Prediction of Particle\n  Distributions in Electron-Laser Scattering","comments":"17 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The new generation of multi-PetaWatt laser facilities will allow tests of\nStrong Field QED, as well as provide an opportunity for novel photon and lepton\nsources. The first experiments are planned to study the (nearly) head-on\nscattering of intense, focused laser pulses with either relativistic electron\nbeams or high-energy photon sources. In this work, we present a numerical\nframework that can provide fast predictions of the asymptotic particle and\nphoton distributions after the scattering. The works presented in this\nmanuscript includes multiple features such as spatial and temporal misalignment\nbetween the laser and the scattering beam, broadband electron beams, and beam\ndivergence. The expected mean energy, energy spread, divergence or other\nobservables are calculated by combining an analytical description and numerical\nintegration. This method can provide results within minutes on a personal\ncomputer, which would otherwise require full-scale 3D QED-PIC simulations using\nthousands of cores. The model, which has been compiled into an open-source code\nQScatter, may be used to support the analysis of large-size data sets from\nhigh-repetition rate experiments, leveraging its speed for optimization or\nreconstruction of experimental parameters.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:10:38 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 05:34:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Amaro","\u00d3scar",""],["Vranic","Marija",""]]}
{"id":"2308.09349","submitter":"Yapeng Zhao","authors":"Yapeng Zhao, Qingqing Wu, Guangji Chen, Wen Chen, Ruiqi Liu, Ming-Min\n  Zhao, Shaodan Ma, and Yuan Wu","title":"Intelligent Reflecting Surface Aided Multi-Tier Hybrid Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Digital twin edge network (DITEN) aims to integrate mobile edge computing\n(MEC) and digital twin (DT) to provide real-time system configuration and\nflexible resource allocation for the sixth-generation network. This paper\ninvestigates an intelligent reflecting surface (IRS)-aided multi-tier hybrid\ncomputing system that can achieve mutual benefits for DT and MEC in the DITEN.\nFor the first time, this paper presents the opportunity to realize the\nnetwork-wide convergence of DT and MEC. In the considered system, specifically,\nover-the-air computation (AirComp) is employed to monitor the status of the DT\nsystem, while MEC is performed with the assistance of DT to provide low-latency\ncomputing services. Besides, the IRS is utilized to enhance signal transmission\nand mitigate interference among heterogeneous nodes. We propose a framework for\ndesigning the hybrid computing system, aiming to maximize the sum computation\nrate under communication and computation resources constraints. To tackle the\nnon-convex optimization problem, alternative optimization and successive convex\napproximation techniques are leveraged to decouple variables and then transform\nthe problem into a more tractable form. Simulation results verify the\neffectiveness of the proposed algorithm and demonstrate the IRS can\nsignificantly improve the system performance with appropriate phase shift\nconfigurations. Moreover, the results indicate that the DT assisted MEC system\ncan precisely achieve the balance between local computing and task offloading\nsince real-time system status can be obtained with the help of DT. This paper\nproposes the network-wide integration of DT and MEC, then demonstrates the\nnecessity of DT for achieving an optimal performance in DITEN systems through\nanalysis and numerical results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:12:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhao","Yapeng",""],["Wu","Qingqing",""],["Chen","Guangji",""],["Chen","Wen",""],["Liu","Ruiqi",""],["Zhao","Ming-Min",""],["Ma","Shaodan",""],["Wu","Yuan",""]]}
{"id":"2308.09350","submitter":"Jincheng Yang","authors":"Jincheng Yang","title":"Vorticity interior trace estimates and higher derivative estimates via\n  blow-up method","comments":"34 pages, 2 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive several nonlinear a priori trace estimates for the 3D\nincompressible Navier-Stokes equation, which extend the current picture of\nhigher derivative estimates in the mixed norm. The main ingredient is the\nblow-up method and a novel averaging operator, which could apply to PDEs with\nscaling invariance and $\\varepsilon$-regularity, possibly with a drift.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:16:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Jincheng",""]]}
{"id":"2308.09351","submitter":"Hangjie Yuan","authors":"Hangjie Yuan, Shiwei Zhang, Xiang Wang, Samuel Albanie, Yining Pan,\n  Tao Feng, Jianwen Jiang, Dong Ni, Yingya Zhang, Deli Zhao","title":"RLIPv2: Fast Scaling of Relational Language-Image Pre-training","comments":"Accepted to ICCV 2023. Code and models:\n  https://github.com/JacobYuan7/RLIPv2","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":"  Relational Language-Image Pre-training (RLIP) aims to align vision\nrepresentations with relational texts, thereby advancing the capability of\nrelational reasoning in computer vision tasks. However, hindered by the slow\nconvergence of RLIPv1 architecture and the limited availability of existing\nscene graph data, scaling RLIPv1 is challenging. In this paper, we propose\nRLIPv2, a fast converging model that enables the scaling of relational\npre-training to large-scale pseudo-labelled scene graph data. To enable fast\nscaling, RLIPv2 introduces Asymmetric Language-Image Fusion (ALIF), a mechanism\nthat facilitates earlier and deeper gated cross-modal fusion with sparsified\nlanguage encoding layers. ALIF leads to comparable or better performance than\nRLIPv1 in a fraction of the time for pre-training and fine-tuning. To obtain\nscene graph data at scale, we extend object detection datasets with free-form\nrelation labels by introducing a captioner (e.g., BLIP) and a designed Relation\nTagger. The Relation Tagger assigns BLIP-generated relation texts to region\npairs, thus enabling larger-scale relational pre-training. Through extensive\nexperiments conducted on Human-Object Interaction Detection and Scene Graph\nGeneration, RLIPv2 shows state-of-the-art performance on three benchmarks under\nfully-finetuning, few-shot and zero-shot settings. Notably, the largest RLIPv2\nachieves 23.29mAP on HICO-DET without any fine-tuning, yields 32.22mAP with\njust 1% data and yields 45.09mAP with 100% data. Code and models are publicly\navailable at https://github.com/JacobYuan7/RLIPv2.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:17:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yuan","Hangjie",""],["Zhang","Shiwei",""],["Wang","Xiang",""],["Albanie","Samuel",""],["Pan","Yining",""],["Feng","Tao",""],["Jiang","Jianwen",""],["Ni","Dong",""],["Zhang","Yingya",""],["Zhao","Deli",""]]}
{"id":"2308.09352","submitter":"Su Gao","authors":"Su Gao and Ruiwen Li","title":"Subshifts of finite symbolic rank","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The definition of subshifts of finite symbolic rank is motivated by the\nfinite rank measure-preserving transformations which have been extensively\nstudied in ergodic theory. In this paper we study subshifts of finite symbolic\nrank as essentially minimal Cantor systems. We show that minimal subshifts of\nfinite symbolic rank have finite topological rank, and conversely, every\nminimal Cantor system of finite topological rank is either an odometer or\nconjugate to a minimal subshift of finite symbolic rank. We characterize the\nclass of all minimal Cantor systems conjugate to a rank-$1$ subshift and show\nthat it is a dense but not a $G_\\delta$ subset in the Polish space of all\nminimal Cantor systems. We also study topological factors of minimal subshifts\nof finite symbolic rank. We show that every infinite odometer and every\nirrational rotation is the maximal equicontinuous factor of a minimal subshift\nof symbolic rank $2$, and that a subshift factor of a minimal subshift of\nfinite symbolic rank has finite symbolic rank.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:19:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gao","Su",""],["Li","Ruiwen",""]]}
{"id":"2308.09353","submitter":"Anatoly Kamchatnov","authors":"L. F. Calazans de Brito, A. M. Kamchatnov","title":"Undular bore theory for the modified Korteweg-de Vries-Burgers equation","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider nonlinear wave structures described by the modified Korteweg-de\nVries equation with taking into account a small Burgers viscosity for the case\nof step-like initial conditions. The Whitham modulation equations are derived\nwhich include the small viscosity as a perturbation. It is shown that for long\nenough time of evolution this small perturbation leads to stabilization of\ncnoidal bores and their main characteristics are obtained. Applicability\nconditions of this approach are discussed. Analytical theory is compared with\nnumerical solutions and good agreement is found.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:22:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["de Brito","L. F. Calazans",""],["Kamchatnov","A. M.",""]]}
{"id":"2308.09354","submitter":"Jaewoong Choi","authors":"Jaewoong Choi, Byungju Lee","title":"Accelerated materials language processing enabled by GPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Materials language processing (MLP) is one of the key facilitators of\nmaterials science research, as it enables the extraction of structured\ninformation from massive materials science literature. Prior works suggested\nhigh-performance MLP models for text classification, named entity recognition\n(NER), and extractive question answering (QA), which require complex model\narchitecture, exhaustive fine-tuning and a large number of human-labelled\ndatasets. In this study, we develop generative pretrained transformer\n(GPT)-enabled pipelines where the complex architectures of prior MLP models are\nreplaced with strategic designs of prompt engineering. First, we develop a\nGPT-enabled document classification method for screening relevant documents,\nachieving comparable accuracy and reliability compared to prior models, with\nonly small dataset. Secondly, for NER task, we design an entity-centric\nprompts, and learning few-shot of them improved the performance on most of\nentities in three open datasets. Finally, we develop an GPT-enabled extractive\nQA model, which provides improved performance and shows the possibility of\nautomatically correcting annotations. While our findings confirm the potential\nof GPT-enabled MLP models as well as their value in terms of reliability and\npracticability, our scientific methods and systematic approach are applicable\nto any materials science domain to accelerate the information extraction of\nscientific literature.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:31:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Choi","Jaewoong",""],["Lee","Byungju",""]]}
{"id":"2308.09355","submitter":"Pranav Ravindra Shirhatti","authors":"Saurabh Kumar Singh and Pranav R. Shirhatti","title":"The curious case of CO$_2$ dissociation on Cu(110)","comments":"Main manuscript: 15 pages, 5 figures, Supplementary Information: 11\n  pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Dissociation of CO$_2$ on copper surfaces, a model system for understanding\nthe elementary steps in catalytic conversion of CO$_2$ to methanol has been\nextensively studied in the past. It is thought to be reasonably well-understood\nfrom both experiments and theory. In contrast, our findings reported here\nsuggest a different picture. Using molecular beam surface scattering methods,\nwe measure the initial dissociation probabilities ($S_{\\rm 0}$) of CO$_2$ on a\nflat, clean Cu(110) surface under ultra-high vacuum conditions. The observed\n$S_{\\rm 0}$ ranges from $3.9\\times10^{-4}$ to $1.8\\times10^{-2}$ at incidence\nenergies of 0.64 eV to 1.59 eV with a lower limit to dissociation barrier\nestimated to be around 2.0 eV, much larger than that understood previously. We\ndiscuss the possible reasons behind such large differences in our results and\nprevious work. These findings are anticipated to be extremely important for\nobtaining a correct understanding of elementary steps in CO$_2$ dissociation on\nCu surfaces.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:32:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Singh","Saurabh Kumar",""],["Shirhatti","Pranav R.",""]]}
{"id":"2308.09356","submitter":"Toru Yoshinaga","authors":"Toru Yoshinaga and Yasushi Kawase","title":"The Last Success Problem with a Single Sample","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The last success problem is an optimal stopping problem that aims to maximize\nthe probability of stopping on the last success in a sequence of $n$ Bernoulli\ntrials. In a typical setting where complete information about the distributions\nis available, Bruss provided an optimal stopping policy ensuring a winning\nprobability of $1/e$. However, assuming complete knowledge of the distributions\nis unrealistic in many practical applications. In this paper, we investigate a\nvariant of the last success problem where we have single-sample access from\neach distribution instead of having comprehensive knowledge of the\ndistributions. Nuti and Vondr\\'{a}k demonstrated that a winning probability\nexceeding $1/4$ is unachievable for this setting, but it remains unknown\nwhether a stopping policy that meets this bound exists. We reveal that Bruss's\npolicy, when applied with the estimated success probabilities, cannot ensure a\nwinning probability greater than $(1-e^{-4})/4\\approx 0.2454~(< 1/4)$,\nirrespective of the estimations from the given samples. Nevertheless, we\ndemonstrate that by setting the threshold the second-to-last success in samples\nand stopping on the first success observed \\emph{after} this threshold, a\nwinning probability of $1/4$ can be guaranteed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:37:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yoshinaga","Toru",""],["Kawase","Yasushi",""]]}
{"id":"2308.09357","submitter":"Yuxuan Tan","authors":"Yuxuan Tan, Yuanman Li, Limin Zeng, Jiaxiong Ye, Wei wang, Xia Li","title":"Multi-scale Target-Aware Framework for Constrained Image Splicing\n  Detection and Localization","comments":"accepted by ACMMM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Constrained image splicing detection and localization (CISDL) is a\nfundamental task of multimedia forensics, which detects splicing operation\nbetween two suspected images and localizes the spliced region on both images.\nRecent works regard it as a deep matching problem and have made significant\nprogress. However, existing frameworks typically perform feature extraction and\ncorrelation matching as separate processes, which may hinder the model's\nability to learn discriminative features for matching and can be susceptible to\ninterference from ambiguous background pixels. In this work, we propose a\nmulti-scale target-aware framework to couple feature extraction and correlation\nmatching in a unified pipeline. In contrast to previous methods, we design a\ntarget-aware attention mechanism that jointly learns features and performs\ncorrelation matching between the probe and donor images. Our approach can\neffectively promote the collaborative learning of related patches, and perform\nmutual promotion of feature learning and correlation matching. Additionally, in\norder to handle scale transformations, we introduce a multi-scale projection\nmethod, which can be readily integrated into our target-aware framework that\nenables the attention process to be conducted between tokens containing\ninformation of varying scales. Our experiments demonstrate that our model,\nwhich uses a unified pipeline, outperforms state-of-the-art methods on several\nbenchmark datasets and is robust against scale transformations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:38:30 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 11:58:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tan","Yuxuan",""],["Li","Yuanman",""],["Zeng","Limin",""],["Ye","Jiaxiong",""],["wang","Wei",""],["Li","Xia",""]]}
{"id":"2308.09358","submitter":"Ioannis Chremmos Dr.","authors":"Ioannis Chremmos","title":"Design of quantum backflow in the complex plane","comments":"12 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A way is presented to design quantum wave functions that exhibit backflow,\nnamely negative probability current despite having a strictly positive spectrum\nof momentum. These wave functions are derived from rational complex functions\nwhich are analytic in the upper half-plane and have zeros in the lower\nhalf-plane through which the backflowing behavior is controlled. In analogy,\nbackflowing periodic wave functions are derived from rational complex functions\nwhich are analytic in the interior and have appropriately placed zeros or poles\nin the exterior of the unit circle. The concept is combined with a Pad\\'e-type\nprocedure to design wave functions of this type that approximate a desired\nprofile along the interval of backflow.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:39:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chremmos","Ioannis",""]]}
{"id":"2308.09359","submitter":"Li Zhang","authors":"Li Zhang, Yuan Fang, Zixiang Ren, Ling Qiu, and Jie Xu","title":"Training-Free Energy Beamforming Assisted by Wireless Sensing","comments":"6 pages, 5 figures, submitted to globecom workshop","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 studies the transmit energy beamforming in a multi-antenna\nwireless power transfer (WPT) system, in which an access point (AP) equipped\nwith a uniform linear array (ULA) sends radio signals to wirelessly charge\nmultiple single-antenna energy receivers (ERs). Different from conventional\nenergy beamforming designs that require the AP to acquire the channel state\ninformation (CSI) via training and feedback, we propose a new training-free\nenergy beamforming approach assisted by wireless radar sensing, which is\nimplemented based on the following two-stage protocol. In the first stage, the\nAP performs wireless radar sensing to estimate the path gain and angle\nparameters of the ERs for constructing the corresponding CSI. In the second\nstage, the AP implements the transmit energy beamforming based on the\nconstructed CSI to efficiently charge these ERs in a fair manner. Under this\nsetup, first, we jointly optimize the sensing beamformers and duration in the\nfirst stage to minimize the sensing duration, while ensuring a given accuracy\nthreshold for parameters estimation subject to the maximum transmit power\nconstraint at the AP. Next, we optimize the energy beamformers in the second\nstage to maximize the minimum harvested energy by all ERs. In this approach,\nthe estimation accuracy threshold for the first stage is properly designed to\nbalance the resource allocation between the two stages for optimizing the\nultimate energy harvesting performance. Finally, numerical results show that\nthe proposed training-free energy beamforming design performs close to the\nperformance upper bound with perfect CSI, and outperforms the benchmark schemes\nwithout such joint optimization and that with isotropic transmission.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:39:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Li",""],["Fang","Yuan",""],["Ren","Zixiang",""],["Qiu","Ling",""],["Xu","Jie",""]]}
{"id":"2308.09360","submitter":"Tao Jia","authors":"Yunsong Luo, Wenyu Chen, Ling Zhan, Jiang Qiu, Tao Jia","title":"Multi-feature concatenation and multi-classifier stacking: an\n  interpretable and generalizable machine learning method for MDD\n  discrimination with rsfMRI","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":"  Major depressive disorder is a serious and heterogeneous psychiatric disorder\nthat needs accurate diagnosis. Resting-state functional MRI (rsfMRI), which\ncaptures multiple perspectives on brain structure, function, and connectivity,\nis increasingly applied in the diagnosis and pathological research of mental\ndiseases. Different machine learning algorithms are then developed to exploit\nthe rich information in rsfMRI and discriminate MDD patients from normal\ncontrols. Despite recent advances reported, the discrimination accuracy has\nroom for further improvement. The generalizability and interpretability of the\nmethod are not sufficiently addressed either. Here, we propose a machine\nlearning method (MFMC) for MDD discrimination by concatenating multiple\nfeatures and stacking multiple classifiers. MFMC is tested on the REST-meta-MDD\ndata set that contains 2428 subjects collected from 25 different sites. MFMC\nyields 96.9% MDD discrimination accuracy, demonstrating a significant\nimprovement over existing methods. In addition, the generalizability of MFMC is\nvalidated by the good performance when the training and testing subjects are\nfrom independent sites. The use of XGBoost as the meta classifier allows us to\nprobe the decision process of MFMC. We identify 13 feature values related to 9\nbrain regions including the posterior cingulate gyrus, superior frontal gyrus\norbital part, and angular gyrus, which contribute most to the classification\nand also demonstrate significant differences at the group level. The use of\nthese 13 feature values alone can reach 87% of MFMC's full performance when\ntaking all feature values. These features may serve as clinically useful\ndiagnostic and prognostic biomarkers for mental disorders in the future.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:40:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","Yunsong",""],["Chen","Wenyu",""],["Zhan","Ling",""],["Qiu","Jiang",""],["Jia","Tao",""]]}
{"id":"2308.09361","submitter":"Ke Yang","authors":"Ke Yang, Sixian Wang, Jincheng Dai, Xiaoqi Qin, Kai Niu, and Ping\n  Zhang","title":"SwinJSCC: Taming Swin Transformer for Deep Joint Source-Channel Coding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As one of the key techniques to realize semantic communications, end-to-end\noptimized neural joint source-channel coding (JSCC) has made great progress\nover the past few years. A general trend in many recent works pushing the model\nadaptability or the application diversity of neural JSCC is based on the\nconvolutional neural network (CNN) backbone, whose model capacity is yet\nlimited, inherently leading to inferior system coding gain against traditional\ncoded transmission systems. In this paper, we establish a new neural JSCC\nbackbone that can also adapt flexibly to diverse channel conditions and\ntransmission rates within a single model, our open-source project aims to\npromote the research in this field. Specifically, we show that with elaborate\ndesign, neural JSCC codec built on the emerging Swin Transformer backbone\nachieves superior performance than conventional neural JSCC codecs built upon\nCNN, while also requiring lower end-to-end processing latency. Paired with two\nspatial modulation modules that scale latent representations based on the\nchannel state information and target transmission rate, our baseline SwinJSCC\ncan further upgrade to a versatile version, which increases its capability to\nadapt to diverse channel conditions and rate configurations. Extensive\nexperimental results show that our SwinJSCC achieves better or comparable\nperformance versus the state-of-the-art engineered BPG + 5G LDPC coded\ntransmission system with much faster end-to-end coding speed, especially for\nhigh-resolution images, in which case traditional CNN-based JSCC yet falls\nbehind due to its limited model capacity. \\emph{Our open-source code and model\nare available at\n\\href{https://github.com/semcomm/SwinJSCC}{https://github.com/semcomm/SwinJSCC}.}\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:43:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yang","Ke",""],["Wang","Sixian",""],["Dai","Jincheng",""],["Qin","Xiaoqi",""],["Niu","Kai",""],["Zhang","Ping",""]]}
{"id":"2308.09362","submitter":"Christian Ospelkaus","authors":"J. M. Cornejo, J. Brombacher, J.-A. Coenders, M. von Boehn, T.\n  Meiners, M. Niemann, S. Ulmer, C. Ospelkaus","title":"Optical stimulated-Raman sideband spectroscopy of a single $^9$Be$^+$\n  ion in a Penning trap","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate optical sideband spectroscopy of a single $^9$Be$^+$ ion in a\ncryogenic 5 Tesla Penning trap using two-photon stimulated-Raman transitions\nbetween the two Zeeman sublevels of the $1s^{2}2s$ ground state manifold. By\napplying two complementary coupling schemes, we accurately measure Raman\nresonances with and without contributions from motional sidebands. From the\nlatter we obtain an axial sideband spectrum with an effective mode temperature\nof (3.1 $\\pm$ 0.4)~mK. This results are a key step for quantum logic operations\nin Pennings traps, applicable to high precision matter-antimatter comparisons\ntests in the baryonic sector of the standard model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:43:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cornejo","J. M.",""],["Brombacher","J.",""],["Coenders","J. -A.",""],["von Boehn","M.",""],["Meiners","T.",""],["Niemann","M.",""],["Ulmer","S.",""],["Ospelkaus","C.",""]]}
{"id":"2308.09363","submitter":"Dohwan Ko","authors":"Dohwan Ko, Ji Soo Lee, Miso Choi, Jaewon Chu, Jihwan Park, Hyunwoo J.\n  Kim","title":"Open-vocabulary Video Question Answering: A New Benchmark for Evaluating\n  the Generalizability of Video Question Answering Models","comments":"Accepted paper at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video Question Answering (VideoQA) is a challenging task that entails complex\nmulti-modal reasoning. In contrast to multiple-choice VideoQA which aims to\npredict the answer given several options, the goal of open-ended VideoQA is to\nanswer questions without restricting candidate answers. However, the majority\nof previous VideoQA models formulate open-ended VideoQA as a classification\ntask to classify the video-question pairs into a fixed answer set, i.e.,\nclosed-vocabulary, which contains only frequent answers (e.g., top-1000\nanswers). This leads the model to be biased toward only frequent answers and\nfail to generalize on out-of-vocabulary answers. We hence propose a new\nbenchmark, Open-vocabulary Video Question Answering (OVQA), to measure the\ngeneralizability of VideoQA models by considering rare and unseen answers. In\naddition, in order to improve the model's generalization power, we introduce a\nnovel GNN-based soft verbalizer that enhances the prediction on rare and unseen\nanswers by aggregating the information from their similar words. For\nevaluation, we introduce new baselines by modifying the existing\n(closed-vocabulary) open-ended VideoQA models and improve their performances by\nfurther taking into account rare and unseen answers. Our ablation studies and\nqualitative analyses demonstrate that our GNN-based soft verbalizer further\nimproves the model performance, especially on rare and unseen answers. We hope\nthat our benchmark OVQA can serve as a guide for evaluating the\ngeneralizability of VideoQA models and inspire future research. Code is\navailable at https://github.com/mlvlab/OVQA.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:45:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ko","Dohwan",""],["Lee","Ji Soo",""],["Choi","Miso",""],["Chu","Jaewon",""],["Park","Jihwan",""],["Kim","Hyunwoo J.",""]]}
{"id":"2308.09364","submitter":"Pengcheng Shi","authors":"Pengcheng Shi, Jie Zhang, Haozhe Cheng, Junyang Wang, Yiyang Zhou,\n  Chenlin Zhao, Jihua Zhu","title":"Overlap Bias Matching is Necessary for Point Cloud Registration","comments":"arXiv admin note: text overlap with arXiv:2202.11292 by other authors","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 fundamental problem in many domains.\nPractically, the overlap between point clouds to be registered may be\nrelatively small. Most unsupervised methods lack effective initial evaluation\nof overlap, leading to suboptimal registration accuracy. To address this issue,\nwe propose an unsupervised network Overlap Bias Matching Network (OBMNet) for\npartial point cloud registration. Specifically, we propose a plug-and-play\nOverlap Bias Matching Module (OBMM) comprising two integral components, overlap\nsampling module and bias prediction module. These two components are utilized\nto capture the distribution of overlapping regions and predict bias\ncoefficients of point cloud common structures, respectively. Then, we integrate\nOBMM with the neighbor map matching module to robustly identify correspondences\nby precisely merging matching scores of points within the neighborhood, which\naddresses the ambiguities in single-point features. OBMNet can maintain\nefficacy even in pair-wise registration scenarios with low overlap ratios.\nExperimental results on extensive datasets demonstrate that our approach's\nperformance achieves a significant improvement compared to the state-of-the-art\nregistration approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:47:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shi","Pengcheng",""],["Zhang","Jie",""],["Cheng","Haozhe",""],["Wang","Junyang",""],["Zhou","Yiyang",""],["Zhao","Chenlin",""],["Zhu","Jihua",""]]}
{"id":"2308.09365","submitter":"Chengjian Yao","authors":"Chengjian Yao","title":"The dissolving limit and large volume limit of Einstein-Bogomol'nyi\n  metrics","comments":"26 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the limits of Einstein-Bogomol'nyi metrics on $\\mathbf{P}^1$, which\nis the solution to a dimensional reduction of Einstein-Maxwell-Higgs system in\ndimension four, in two regimes. In one regime called the \"dissolving limit\"\nwhere the volume of the metrics is approaching the admissible lower bound, it\nexhibits a pattern that all the vortices are dissolving similar to the Bradlow\nlimit in the study of vortices on Riemann surfaces. In another regime called\nthe \"large volume limit\" where the volume of of the metrics is approaching\ninfinity, the magnetic field is concentrating around the zeros of the Higgs\nfield. In the meantime, the volume-normalized underlying metric is approaching\nthe Euclidean cone metric determined by the Higgs field in the case of stable\nHiggs field. Moreover, by studying the large volume limit of Yang's solution\nfor a strictly polystable Higgs field, for each natural number $N'$ we recover\nthe Einstein-Bogomol'nyi metrics on $\\mathbf{C}$ which is asymptotically\ncylindrical at exponential rate and with total string number $N'$ firstly\ndiscovered by Linet and Yang.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 07:48:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yao","Chengjian",""]]}
{"id":"2308.09366","submitter":"Fikret Basic","authors":"Fikret Basic, Martin Gaertner, Christian Steger","title":"Towards Trustworthy NFC-based Sensor Readout for Battery Packs in\n  Battery Management Systems","comments":"Accepted copy for Publication at the IEEE International Conference on\n  RFID-Technologies and Applications, 2021","journal-ref":null,"doi":"10.1109/RFID-TA53372.2021.9617320","report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last several years, wireless Battery Management Systems (BMS) have\nslowly become a topic of interest from both academia and industry. It came from\na necessity derived from the increased production and use in different systems,\nincluding the electrical vehicles. Wireless communication allows for a more\nflexible and cost-efficient sensor installation in battery packs. However, many\nwireless technologies, such as those that use the 2.4 GHz frequency band,\nsuffer from the interference limitations that need to be addressed. In this\npaper we present an alternative approach to communication in BMS that relies on\nthe use of Near Field Communication (NFC) technology for battery sensor\nreadouts. Due to a vital concern over the counterfeited battery pack products,\nsecurity measures are also considered. To this end, we propose the use of an\neffective, and easy to integrate, authentication schema that is supported by\nthe dedicated NFC devices. To test the usability of our design, a demonstrator\nusing the targeted devices was implemented and evaluated.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:00:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Basic","Fikret",""],["Gaertner","Martin",""],["Steger","Christian",""]]}
{"id":"2308.09367","submitter":"Bangti Jin","authors":"Bangti Jin and Zehui Zhou and Jun Zou","title":"On the Approximation of Bi-Lipschitz Maps by Invertible Neural Networks","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.LG cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Invertible neural networks (INNs) represent an important class of deep neural\nnetwork architectures that have been widely used in several applications. The\nuniversal approximation properties of INNs have also been established recently.\nHowever, the approximation rate of INNs is largely missing. In this work, we\nprovide an analysis of the capacity of a class of coupling-based INNs to\napproximate bi-Lipschitz continuous mappings on a compact domain, and the\nresult shows that it can well approximate both forward and inverse maps\nsimultaneously. Furthermore, we develop an approach for approximating\nbi-Lipschitz maps on infinite-dimensional spaces that simultaneously\napproximate the forward and inverse maps, by combining model reduction with\nprincipal component analysis and INNs for approximating the reduced map, and we\nanalyze the overall approximation error of the approach. Preliminary numerical\nresults show the feasibility of the approach for approximating the solution\noperator for parameterized second-order elliptic problems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:01:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jin","Bangti",""],["Zhou","Zehui",""],["Zou","Jun",""]]}
{"id":"2308.09368","submitter":"Matthias A{\\ss}enmacher","authors":"Philipp Koch and Gilary Vera Nu\\~nez and Esteban Garces Arias and\n  Christian Heumann and Matthias Sch\\\"offel and Alexander H\\\"aberlin and\n  Matthias A{\\ss}enmacher","title":"A tailored Handwritten-Text-Recognition System for Medieval Latin","comments":"This paper has been accepted at the First Workshop on Ancient\n  Language Processing, co-located with RANLP 2023. This is the author's version\n  of the work. The definite version of record will be published in the\n  proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.CY cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bavarian Academy of Sciences and Humanities aims to digitize its Medieval\nLatin Dictionary. This dictionary entails record cards referring to lemmas in\nmedieval Latin, a low-resource language. A crucial step of the digitization\nprocess is the Handwritten Text Recognition (HTR) of the handwritten lemmas\nfound on these record cards. In our work, we introduce an end-to-end pipeline,\ntailored to the medieval Latin dictionary, for locating, extracting, and\ntranscribing the lemmas. We employ two state-of-the-art (SOTA) image\nsegmentation models to prepare the initial data set for the HTR task.\nFurthermore, we experiment with different transformer-based models and conduct\na set of experiments to explore the capabilities of different combinations of\nvision encoders with a GPT-2 decoder. Additionally, we also apply extensive\ndata augmentation resulting in a highly competitive model. The best-performing\nsetup achieved a Character Error Rate (CER) of 0.015, which is even superior to\nthe commercial Google Cloud Vision model, and shows more stable performance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:02:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Koch","Philipp",""],["Nu\u00f1ez","Gilary Vera",""],["Arias","Esteban Garces",""],["Heumann","Christian",""],["Sch\u00f6ffel","Matthias",""],["H\u00e4berlin","Alexander",""],["A\u00dfenmacher","Matthias",""]]}
{"id":"2308.09369","submitter":"S Guttikonda","authors":"Suresh Guttikonda and Jason Rambach","title":"Single Frame Semantic Segmentation Using Multi-Modal Spherical Images","comments":"Accepted at WACV 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, the research community has shown a lot of interest to\npanoramic images that offer a 360-degree directional perspective. Multiple data\nmodalities can be fed, and complimentary characteristics can be utilized for\nmore robust and rich scene interpretation based on semantic segmentation, to\nfully realize the potential. Existing research, however, mostly concentrated on\npinhole RGB-X semantic segmentation. In this study, we propose a\ntransformer-based cross-modal fusion architecture to bridge the gap between\nmulti-modal fusion and omnidirectional scene perception. We employ\ndistortion-aware modules to address extreme object deformations and panorama\ndistortions that result from equirectangular representation. Additionally, we\nconduct cross-modal interactions for feature rectification and information\nexchange before merging the features in order to communicate long-range\ncontexts for bi-modal and tri-modal feature streams. In thorough tests using\ncombinations of four different modality types in three indoor panoramic-view\ndatasets, our technique achieved state-of-the-art mIoU performance: 60.60% on\nStanford2D3DS (RGB-HHA), 71.97% Structured3D (RGB-D-N), and 35.92% Matterport3D\n(RGB-D). We plan to release all codes and trained models soon.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:06:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guttikonda","Suresh",""],["Rambach","Jason",""]]}
{"id":"2308.09370","submitter":"Yixuan Li","authors":"Yixuan Li, Huaping Liu, Qiang Jin, Miaomiao Cai, Peng Li","title":"TrOMR:Transformer-Based Polyphonic Optical Music Recognition","comments":null,"journal-ref":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics,\n  Speech and Signal Processing (ICASSP)","doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical Music Recognition (OMR) is an important technology in music and has\nbeen researched for a long time. Previous approaches for OMR are usually based\non CNN for image understanding and RNN for music symbol classification. In this\npaper, we propose a transformer-based approach with excellent global perceptual\ncapability for end-to-end polyphonic OMR, called TrOMR. We also introduce a\nnovel consistency loss function and a reasonable approach for data annotation\nto improve recognition accuracy for complex music scores. Extensive experiments\ndemonstrate that TrOMR outperforms current OMR methods, especially in\nreal-world scenarios. We also develop a TrOMR system and build a camera scene\ndataset for full-page music scores in real-world. The code and datasets will be\nmade available for reproducibility.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:06:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Yixuan",""],["Liu","Huaping",""],["Jin","Qiang",""],["Cai","Miaomiao",""],["Li","Peng",""]]}
{"id":"2308.09371","submitter":"Henri Lombardi","authors":"Henri Lombardi","title":"The constructive content of a local-global principle with an application\n  to the structure of a finitely generated projective module","comments":"in French language. arXiv admin note: text overlap with\n  arXiv:1611.02942","journal-ref":"Th\\'eorie des nombres, Ann\\'ees 1994/95--1995/96, Publ. Math. Fac.\n  Sci. Besan\\c con, 34 pages, 1997","doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the structure of an idempotent matrix $F$ over a commutative ring.\nWe make explicit the fundamental system of orthogonal idempotents, hidden in\nthis matrix, for each of which the matrix has a well-defined rank. Similarly we\nfind a finite number of comaximal elements of the ring which make explicit the\nfact that the codomain of $F$ is locally free. Our proofs are based on the\nabstract local-global principle. We give two methods to recover a constructive\nproof of these results. The most interesting one is a constructive\ninterpretation of a very simple version of the abstract local-global principle.\nWe think we have made a significant step towards a constructive version of the\n\"Hilbert programme\" for abstract algebra, i.e. the automatic translation of\nproofs of abstract algebra into constructive proofs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:06:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lombardi","Henri",""]]}
{"id":"2308.09372","submitter":"Tobias Nauen","authors":"Tobias Christian Nauen, Sebastian Palacio, Andreas Dengel","title":"Which Transformer to Favor: A Comparative Analysis of Efficiency in\n  Vision Transformers","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":"  The growing popularity of Vision Transformers as the go-to models for image\nclassification has led to an explosion of architectural modifications claiming\nto be more efficient than the original ViT. However, a wide diversity of\nexperimental conditions prevents a fair comparison between all of them, based\nsolely on their reported results. To address this gap in comparability, we\nconduct a comprehensive analysis of more than 30 models to evaluate the\nefficiency of vision transformers and related architectures, considering\nvarious performance metrics. Our benchmark provides a comparable baseline\nacross the landscape of efficiency-oriented transformers, unveiling a plethora\nof surprising insights. For example, we discover that ViT is still Pareto\noptimal across multiple efficiency metrics, despite the existence of several\nalternative approaches claiming to be more efficient. Results also indicate\nthat hybrid attention-CNN models fare particularly well when it comes to low\ninference memory and number of parameters, and also that it is better to scale\nthe model size, than the image size. Furthermore, we uncover a strong positive\ncorrelation between the number of FLOPS and the training memory, which enables\nthe estimation of required VRAM from theoretical measurements alone.\n  Thanks to our holistic evaluation, this study offers valuable insights for\npractitioners and researchers, facilitating informed decisions when selecting\nmodels for specific applications. We publicly release our code and data at\nhttps://github.com/tobna/WhatTransformerToFavor\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:06:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nauen","Tobias Christian",""],["Palacio","Sebastian",""],["Dengel","Andreas",""]]}
{"id":"2308.09373","submitter":"Pavlos Lagoudakis Prof","authors":"Ivan Gnusov, Stella Harrison, Sergey Alyatkin, Kirill Sitnik, Helgi\n  Sigurdsson, Pavlos G. Lagoudakis","title":"Vortex clusters in a stirred polariton condensate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.quant-gas physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The response of superfluids to the external rotation, evidenced by emergence\nof quantised vortices, distinguishes them from conventional fluids. In this\nwork, we demonstrate that the number of vortices in a stirred polariton\ncondensate depends on the characteristic size of the employed rotating\npotential induced by the nonresonant laser excitation. For smaller sizes, a\nsingle vortex with a topological charge of +-1 corresponding to the stirring\ndirection is formed. However, for larger optical traps, clusters of two or\nthree co-rotating vortices appear in the narrow range of GHz stirring speed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:07:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gnusov","Ivan",""],["Harrison","Stella",""],["Alyatkin","Sergey",""],["Sitnik","Kirill",""],["Sigurdsson","Helgi",""],["Lagoudakis","Pavlos G.",""]]}
{"id":"2308.09374","submitter":"Olof Zetterqvist","authors":"Johan Jonasson, Jeffrey E. Steif and Olof Zetterqvist","title":"Noise Sensitivity and Stability of Deep Neural Networks for Binary\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A first step is taken towards understanding often observed non-robustness\nphenomena of deep neural net (DNN) classifiers. This is done from the\nperspective of Boolean functions by asking if certain sequences of Boolean\nfunctions represented by common DNN models are noise sensitive or noise stable,\nconcepts defined in the Boolean function literature. Due to the natural\nrandomness in DNN models, these concepts are extended to annealed and quenched\nversions. Here we sort out the relation between these definitions and\ninvestigate the properties of two standard DNN architectures, the fully\nconnected and convolutional models, when initiated with Gaussian weights.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:09:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jonasson","Johan",""],["Steif","Jeffrey E.",""],["Zetterqvist","Olof",""]]}
{"id":"2308.09375","submitter":"Alexandre Zouaoui","authors":"Behnood Rasti (HZDR), Alexandre Zouaoui (Thoth), Julien Mairal\n  (Thoth), Jocelyn Chanussot (Thoth)","title":"Image Processing and Machine Learning for Hyperspectral Unmixing: An\n  Overview and the HySUPP Python Package","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":"  Spectral pixels are often a mixture of the pure spectra of the materials,\ncalled endmembers, due to the low spatial resolution of hyperspectral sensors,\ndouble scattering, and intimate mixtures of materials in the scenes. Unmixing\nestimates the fractional abundances of the endmembers within the pixel.\nDepending on the prior knowledge of endmembers, linear unmixing can be divided\ninto three main groups: supervised, semi-supervised, and unsupervised (blind)\nlinear unmixing. Advances in Image processing and machine learning\nsubstantially affected unmixing. This paper provides an overview of advanced\nand conventional unmixing approaches. Additionally, we draw a critical\ncomparison between advanced and conventional techniques from the three\ncategories. We compare the performance of the unmixing techniques on three\nsimulated and two real datasets. The experimental results reveal the advantages\nof different unmixing categories for different unmixing scenarios. Moreover, we\nprovide an open-source Python-based package available at\nhttps://github.com/BehnoodRasti/HySUPP to reproduce the results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:10:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rasti","Behnood","","HZDR"],["Zouaoui","Alexandre","","Thoth"],["Mairal","Julien","","Thoth"],["Chanussot","Jocelyn","","Thoth"]]}
{"id":"2308.09376","submitter":"Abubakar Ali","authors":"Abubakar S. Ali, Dimitrios Michael Manias, Abdallah Shami, Sami\n  Muhaidat","title":"Leveraging Large Language Models for DRL-Based Anti-Jamming Strategies\n  in Zero Touch Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the dawn of sixth-generation (6G) networking approaches, it promises\nunprecedented advancements in communication and automation. Among the leading\ninnovations of 6G is the concept of Zero Touch Networks (ZTNs), aiming to\nachieve fully automated, self-optimizing networks with minimal human\nintervention. Despite the advantages ZTNs offer in terms of efficiency and\nscalability, challenges surrounding transparency, adaptability, and human trust\nremain prevalent. Concurrently, the advent of Large Language Models (LLMs)\npresents an opportunity to elevate the ZTN framework by bridging the gap\nbetween automated processes and human-centric interfaces. This paper explores\nthe integration of LLMs into ZTNs, highlighting their potential to enhance\nnetwork transparency and improve user interactions. Through a comprehensive\ncase study on deep reinforcement learning (DRL)-based anti-jamming technique,\nwe demonstrate how LLMs can distill intricate network operations into\nintuitive, human-readable reports. Additionally, we address the technical and\nethical intricacies of melding LLMs with ZTNs, with an emphasis on data\nprivacy, transparency, and bias reduction. Looking ahead, we identify emerging\nresearch avenues at the nexus of LLMs and ZTNs, advocating for sustained\ninnovation and interdisciplinary synergy in the domain of automated networks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:13:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ali","Abubakar S.",""],["Manias","Dimitrios Michael",""],["Shami","Abdallah",""],["Muhaidat","Sami",""]]}
{"id":"2308.09377","submitter":"Yuman He","authors":"Yuman He, Kangle Li, Yanbai Zhang, Hoi Chun Po","title":"Stacked tree construction for free-fermion projected entangled pair\n  states","comments":"5 pages + 7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The tensor network representation of a state in higher dimensions, say a\nprojected entangled-pair state (PEPS), is typically obtained indirectly through\nvariational optimization or imaginary-time Hamiltonian evolution. Here, we\npropose a divide-and-conquer approach to directly construct a PEPS\nrepresentation for free-fermion states admitting descriptions in terms of\nfilling exponentially localized Wannier functions. Our approach relies on first\nobtaining a tree tensor network description of the state in local subregions.\nNext, a stacking procedure is used to combine the local trees into a PEPS.\nLastly, the local tensors are compressed to obtain a more efficient\ndescription. We demonstrate our construction for states in one and two\ndimensions, including the ground state of an obstructed atomic insulator on the\nsquare lattice.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:13:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["He","Yuman",""],["Li","Kangle",""],["Zhang","Yanbai",""],["Po","Hoi Chun",""]]}
{"id":"2308.09378","submitter":"Arup Chakraborty","authors":"A. Chakraborty and B. K. Sahoo","title":"High-precision Electric Dipole Polarizabilities of the Clock States in\n  $^{133}$Cs","comments":"13 pages, 6 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have calculated static and dynamic electric dipole (E1) polarizabilities\n($\\alpha_F$) of the hyperfine levels of the clock transition precisely in\n$^{133}$Cs. The scalar, vector, and tensor components of $\\alpha_F$ are\nestimated by expressing as sum of valence, core, core-core, core-valence, and\nvalence-core contributions that are arising from the virtual and core\nintermediate states. The dominant valence contributions are estimated by\ncombining a large number of matrix elements of the E1 and magnetic dipole\nhyperfine interaction operators from the relativistic coupled-cluster method\nand measurements. For an insightful understanding of their accurate\ndetermination, we explicitly give intermediate contributions in different forms\nto the above quantities. Very good agreement of the static values for the\nscalar and tensor components with their experimental results suggest that our\nestimated dynamic $\\alpha_F$ values can be used reliably to estimate the Stark\nshifts while conducting high-precision measurements at the respective laser\nfrequency using the clock states of $^{133}$Cs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:13:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chakraborty","A.",""],["Sahoo","B. K.",""]]}
{"id":"2308.09379","submitter":"Aram Mohammed","authors":"Anwar Mohammed Raouf, Kocher Omer Salih, Aram Akram Mohammad","title":"Examination of Some Nut Traits and Release From Dormancy Along With\n  Germination Capacity in Some Bitter Almond Genotypes","comments":null,"journal-ref":null,"doi":"10.25130/tjas.21.4.4","report-no":null,"categories":"q-bio.OT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study was conducted at College of Agricultural Engineering Sciences,\nUniversity of Sulaimani, Kurdistan Region-Iraq so as to investigate some nut\ntraits in 10 bitter almond genotypes, capacity of them to release from dormancy\nand finally germination ability. Nut traits were calculated, and stratified in\na sand medium at 6 C in a refrigerator for 55 days, then they were sown in fine\nsand on August 22, 2021 for 29 days to calculate germination percentage. There\nwere great discrepancies among genotypes in nut traits. Nut length was between\n(23.66-32.73 mm), nut width (18.77-21.84 mm), nut size (3.16-4.26 cm3), nut\nweight (2.67-4.13 g), kernel weight (0.6-0.99 g), shell weight (1.94-3.27 g)\nand shell thickness (2.31-3.37 mm). The results of release from dormancy and\ncalculation of germination percentage trials showed that the highest nut\nnumbers from G6 (100%), G4 (86.11%) and G2 (65.22%) were released from dormancy\nand the same genotypes gave the best germination percentage, particularly G6\nand G2 both gave (73.33%) germination. Depending on the results of release\npercentage from dormancy and germination percentage, G6 and G2 along with G4\nwere the best genotypes.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:15:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Raouf","Anwar Mohammed",""],["Salih","Kocher Omer",""],["Mohammad","Aram Akram",""]]}
{"id":"2308.09380","submitter":"Yun Xin Teoh","authors":"Yun Xin Teoh, Alice Othmani, Siew Li Goh, Juliana Usman, Khin Wee Lai","title":"Deciphering knee osteoarthritis diagnostic features with explainable\n  artificial intelligence: A systematic review","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":"  Existing artificial intelligence (AI) models for diagnosing knee\nosteoarthritis (OA) have faced criticism for their lack of transparency and\ninterpretability, despite achieving medical-expert-like performance. This\nopacity makes them challenging to trust in clinical practice. Recently,\nexplainable artificial intelligence (XAI) has emerged as a specialized\ntechnique that can provide confidence in the model's prediction by revealing\nhow the prediction is derived, thus promoting the use of AI systems in\nhealthcare. This paper presents the first survey of XAI techniques used for\nknee OA diagnosis. The XAI techniques are discussed from two perspectives: data\ninterpretability and model interpretability. The aim of this paper is to\nprovide valuable insights into XAI's potential towards a more reliable knee OA\ndiagnosis approach and encourage its adoption in clinical practice.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:23:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Teoh","Yun Xin",""],["Othmani","Alice",""],["Goh","Siew Li",""],["Usman","Juliana",""],["Lai","Khin Wee",""]]}
{"id":"2308.09381","submitter":"Yi Cai","authors":"Yi Cai, Gerhard Wunder","title":"On Gradient-like Explanation under a Black-box Setting: When Black-box\n  Explanations Become as Good as White-box","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Attribution methods shed light on the explainability of data-driven\napproaches such as deep learning models by revealing the most contributing\nfeatures to decisions that have been made. A widely accepted way of deriving\nfeature attributions is to analyze the gradients of the target function with\nrespect to input features. Analysis of gradients requires full access to the\ntarget system, meaning that solutions of this kind treat the target system as a\nwhite-box. However, the white-box assumption may be untenable due to security\nand safety concerns, thus limiting their practical applications. As an answer\nto the limited flexibility, this paper presents GEEX (gradient-estimation-based\nexplanation), an explanation method that delivers gradient-like explanations\nunder a black-box setting. Furthermore, we integrate the proposed method with a\npath method. The resulting approach iGEEX (integrated GEEX) satisfies the four\nfundamental axioms of attribution methods: sensitivity, insensitivity,\nimplementation invariance, and linearity. With a focus on image data, the\nexhaustive experiments empirically show that the proposed methods outperform\nstate-of-the-art black-box methods and achieve competitive performance compared\nto the ones with full access.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:24:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cai","Yi",""],["Wunder","Gerhard",""]]}
{"id":"2308.09382","submitter":"Heng Li","authors":"Jianfeng Hou, Heng Li, Guanghui Wang, Yixiao Zhang","title":"Hypergraphs with irrational Tur\\'{a}n density and many extremal\n  configurations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unlike graphs, determining Tur\\'{a}n densities of hypergraphs is known to be\nnotoriously hard in general. The essential reason is that for many classical\nfamilies of $r$-uniform hypergraphs $\\mathcal{F}$, there are perhaps many\nnear-extremal $\\mathcal{M}_t$-free configurations with very different\nstructure. Such a phenomenon is called not stable, and Liu and Mubayi gave a\nfirst not stable example. Another perhaps reason is that little is known about\nthe set consisting of all possible Tur\\'{a}n densities which has cardinality of\nthe continuum. Let $t\\ge 2$ be an integer. In this paper, we construct a finite\nfamily $\\mathcal{M}_t$ of 3-uniform hypergraphs such that the Tur\\'{a}n density\nof $\\mathcal{M}_t$ is irrational, and there are $t$ near-extremal\n$\\mathcal{M}_t$-free configurations that are far from each other in\nedit-distance. This is the first not stable example that has an irrational\nTur\\'{a}n density. It also provides a new phenomenon about feasible region\nfunctions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:25:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hou","Jianfeng",""],["Li","Heng",""],["Wang","Guanghui",""],["Zhang","Yixiao",""]]}
{"id":"2308.09383","submitter":"Hoonhee Cho","authors":"Hoonhee Cho, Hyeonseong Kim, Yujeong Chae, and Kuk-Jin Yoon","title":"Label-Free Event-based Object Recognition via Joint Learning with Image\n  Reconstruction from Events","comments":"Accepted to ICCV 2023 (Oral)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recognizing objects from sparse and noisy events becomes extremely difficult\nwhen paired images and category labels do not exist. In this paper, we study\nlabel-free event-based object recognition where category labels and paired\nimages are not available. To this end, we propose a joint formulation of object\nrecognition and image reconstruction in a complementary manner. Our method\nfirst reconstructs images from events and performs object recognition through\nContrastive Language-Image Pre-training (CLIP), enabling better recognition\nthrough a rich context of images. Since the category information is essential\nin reconstructing images, we propose category-guided attraction loss and\ncategory-agnostic repulsion loss to bridge the textual features of predicted\ncategories and the visual features of reconstructed images using CLIP.\nMoreover, we introduce a reliable data sampling strategy and local-global\nreconstruction consistency to boost joint learning of two tasks. To enhance the\naccuracy of prediction and quality of reconstruction, we also propose a\nprototype-based approach using unpaired images. Extensive experiments\ndemonstrate the superiority of our method and its extensibility for zero-shot\nobject recognition. Our project code is available at\n\\url{https://github.com/Chohoonhee/Ev-LaFOR}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:28:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cho","Hoonhee",""],["Kim","Hyeonseong",""],["Chae","Yujeong",""],["Yoon","Kuk-Jin",""]]}
{"id":"2308.09384","submitter":"Niels Lauritzen","authors":"Niels Lauritzen, Jesper Funch Thomsen","title":"Finitely generated bimodules over Weyl algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Affine space over the complex numbers is simply connected in the sense that\nit does not afford any non-trivial \\'etale finite covers. In this paper we\nprove the non-commutative analogue of this statement: an endomorphism of a Weyl\nalgebra provides a natural holonomic bimodule structure on the Weyl algebra. If\nthis bimodule is finitely generated from the left or right, then the\nendomorphism is an automorphism. Finite generation of this bimodule in large\npositive characteristics is equivalent to the Dixmier conjecture.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:31:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lauritzen","Niels",""],["Thomsen","Jesper Funch",""]]}
{"id":"2308.09385","submitter":"Ganesh Prasad","authors":"Jyotsna Rani and Ganesh Prasad","title":"Optimization of Resources to Minimize Power Dissipation in 5G Wireless\n  Networks","comments":null,"journal-ref":"5G and Beyond Wireless Systems, 2021","doi":"10.1007/978-981-15-6390-4_10","report-no":null,"categories":"cs.PF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In today's modern communications, with evolution of various applications, the\ndemand of data rate is increasing exponentially at the cost of huge consumption\nof available resources. It has been recorded that the communication networks\ndissipate nearly 1\\% of the world-wide total power consumption, results in\nmillions of tons of CO2 emission due to their production and thereby causes\nvarious environmental health hazards. The optimal utilization of available\nresources that can balance the present coexisting problem without any\ncompromise on the high throughput demand, paves the way for the next generation\ngreen 5G wireless networks. In this chapter, we study the minimization of total\npower consumption while satisfying the desired coverage of the user equipments\n(UEs) to provide the minimum throughput over the network. In this regard, the\ndeployment of base stations (BSs), their number, and transmit power are\noptimized in two scenarios (i) when the UEs are large in 5G wireless network\nand (ii) when moderate UEs are distributed over the field.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:33:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rani","Jyotsna",""],["Prasad","Ganesh",""]]}
{"id":"2308.09386","submitter":"Yu Chen","authors":"Yu Chen, Gim Hee Lee","title":"DReg-NeRF: Deep Registration for Neural Radiance Fields","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although Neural Radiance Fields (NeRF) is popular in the computer vision\ncommunity recently, registering multiple NeRFs has yet to gain much attention.\nUnlike the existing work, NeRF2NeRF, which is based on traditional optimization\nmethods and needs human annotated keypoints, we propose DReg-NeRF to solve the\nNeRF registration problem on object-centric scenes without human intervention.\nAfter training NeRF models, our DReg-NeRF first extracts features from the\noccupancy grid in NeRF. Subsequently, our DReg-NeRF utilizes a transformer\narchitecture with self-attention and cross-attention layers to learn the\nrelations between pairwise NeRF blocks. In contrast to state-of-the-art (SOTA)\npoint cloud registration methods, the decoupled correspondences are supervised\nby surface fields without any ground truth overlapping labels. We construct a\nnovel view synthesis dataset with 1,700+ 3D objects obtained from Objaverse to\ntrain our network. When evaluated on the test set, our proposed method beats\nthe SOTA point cloud registration methods by a large margin, with a mean\n$\\text{RPE}=9.67^{\\circ}$ and a mean $\\text{RTE}=0.038$.\n  Our code is available at https://github.com/AIBluefisher/DReg-NeRF.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:37:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Yu",""],["Lee","Gim Hee",""]]}
{"id":"2308.09387","submitter":"Byeonghwi Kim","authors":"Suvaansh Bhambri, Byeonghwi Kim, Jonghyun Choi","title":"Multi-Level Compositional Reasoning for Interactive Instruction\n  Following","comments":"AAAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Robotic agents performing domestic chores by natural language directives are\nrequired to master the complex job of navigating environment and interacting\nwith objects in the environments. The tasks given to the agents are often\ncomposite thus are challenging as completing them require to reason about\nmultiple subtasks, e.g., bring a cup of coffee. To address the challenge, we\npropose to divide and conquer it by breaking the task into multiple subgoals\nand attend to them individually for better navigation and interaction. We call\nit Multi-level Compositional Reasoning Agent (MCR-Agent). Specifically, we\nlearn a three-level action policy. At the highest level, we infer a sequence of\nhuman-interpretable subgoals to be executed based on language instructions by a\nhigh-level policy composition controller. At the middle level, we\ndiscriminatively control the agent's navigation by a master policy by\nalternating between a navigation policy and various independent interaction\npolicies. Finally, at the lowest level, we infer manipulation actions with the\ncorresponding object masks using the appropriate interaction policy. Our\napproach not only generates human interpretable subgoals but also achieves\n2.03% absolute gain to comparable state of the arts in the efficiency metric\n(PLWSR in unseen set) without using rule-based planning or a semantic spatial\nmemory.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:38:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bhambri","Suvaansh",""],["Kim","Byeonghwi",""],["Choi","Jonghyun",""]]}
{"id":"2308.09388","submitter":"Xin Li","authors":"Xin Li, Yulin Ren, Xin Jin, Cuiling Lan, Xingrui Wang, Wenjun Zeng,\n  Xinchao Wang, and Zhibo Chen","title":"Diffusion Models for Image Restoration and Enhancement -- A\n  Comprehensive Survey","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image restoration (IR) has been an indispensable and challenging task in the\nlow-level vision field, which strives to improve the subjective quality of\nimages distorted by various forms of degradation. Recently, the diffusion model\nhas achieved significant advancements in the visual generation of AIGC, thereby\nraising an intuitive question, \"whether diffusion model can boost image\nrestoration\". To answer this, some pioneering studies attempt to integrate\ndiffusion models into the image restoration task, resulting in superior\nperformances than previous GAN-based methods. Despite that, a comprehensive and\nenlightening survey on diffusion model-based image restoration remains scarce.\nIn this paper, we are the first to present a comprehensive review of recent\ndiffusion model-based methods on image restoration, encompassing the learning\nparadigm, conditional strategy, framework design, modeling strategy, and\nevaluation. Concretely, we first introduce the background of the diffusion\nmodel briefly and then present two prevalent workflows that exploit diffusion\nmodels in image restoration. Subsequently, we classify and emphasize the\ninnovative designs using diffusion models for both IR and blind/real-world IR,\nintending to inspire future development. To evaluate existing methods\nthoroughly, we summarize the commonly-used dataset, implementation details, and\nevaluation metrics. Additionally, we present the objective comparison for\nopen-sourced methods across three tasks, including image super-resolution,\ndeblurring, and inpainting. Ultimately, informed by the limitations in existing\nworks, we propose five potential and challenging directions for the future\nresearch of diffusion model-based IR, including sampling efficiency, model\ncompression, distortion simulation and estimation, distortion invariant\nlearning, and framework design.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:40:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Xin",""],["Ren","Yulin",""],["Jin","Xin",""],["Lan","Cuiling",""],["Wang","Xingrui",""],["Zeng","Wenjun",""],["Wang","Xinchao",""],["Chen","Zhibo",""]]}
{"id":"2308.09389","submitter":"Tuan Anh Le","authors":"Tuan Anh Le and Derrick Wing Kwan Ng and Xin-She Yang","title":"A Rank-One Optimization Framework and Its Applications to Transmit\n  Beamforming","comments":null,"journal-ref":null,"doi":"10.1109/TVT.2023.3303623","report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper proposes an elegant optimization framework consisting of a mix of\nlinear-matrix-inequality and second-order-cone constraints. The proposed\nframework generalizes the semidefinite relaxation (SDR) enabled solution to the\ntypical transmit beamforming problems presented in the form of quadratically\nconstrained quadratic programs (QCQPs) in the literature. It is proved that the\noptimization problems subsumed under the framework always admit a rank-one\noptimal solution when they are feasible and their optimal solutions are not\ntrivial. This finding indicates that the relaxation is tight as the optimal\nsolution of the original beamforming QCQP can be straightforwardly obtained\nfrom that of the SDR counterpart without any loss of optimality. Four\nrepresentative examples of transmit beamforming, i.e., transmit beamforming\nwith perfect channel state information (CSI), transmit beamforming with\nimperfect CSI, chance-constraint approach for imperfect CSI, and\nreconfigurable-intelligent-surface (RIS) aided beamforming, are shown to\ndemonstrate how the proposed optimization framework can be realized in deriving\nthe SDR counterparts for different beamforming designs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:45:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Le","Tuan Anh",""],["Ng","Derrick Wing Kwan",""],["Yang","Xin-She",""]]}
{"id":"2308.09390","submitter":"Sweta Shah","authors":"Sweta Shah and Valeriya Korol and Thomas Kupfer","title":"Optimal frequency plan for LISA pre-science operations using\n  verification binaries","comments":"submitted to Apj, 20 pages, 17 figures, 1 table, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The future Laser Interferometer Space Antenna (LISA) mission, which has\nsuccessfully passed Mission Formulation phase, is in planning to be launched in\n2030s. One of the ubiquitous LISA sources are the white-dwarf binaries (WDB) of\nwhich $\\sim$40 are guaranteed sources as of now, making LISA unique in\ncomparison to its ground-based counterpart. The current hardware design in\nplanning necessitates a thorough check to determine whether the various locking\nschemes influence the guaranteed sources' signals significantly in order to\nre-consider that what is hard-coded in the phasemeter before launch for\npre-science operations phase. Comparison of the phasemeter output of a face-on\n(V407Vul) binary and an edge-on (ZTFJ1539) binary indicates that the non-swap\nlocking scheme, N2a, is optimal for instrument calibration. Additionally, the\ninfluence of the $\\sim 7$ min orbital period edge-on source in two of the\nlocking schemes yields a difference of maximum $\\leq 10\\%$ at the Time Delay\nInterferometry (TDI) output for data stream of one day. Simplified analyses\nshow that neither of the locking schemes is favoured in the post-processing\nlevel. We find similar amplitudes in the TDI output stream for the face-on\nsystem V407Vul and the edge-on system ZTFJ1539 which leads to a significantly\nsmaller inclination bias for the non-swap locking scheme. Additionally, a\nlarger amplitude for edge-on systems will benefit most verification systems as\nthe population of verification systems is biased towards edge-on systems as\nthey are easier to detect in electromagnetic data.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:46:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shah","Sweta",""],["Korol","Valeriya",""],["Kupfer","Thomas",""]]}
{"id":"2308.09391","submitter":"Xiran Wang","authors":"Xiran Wang, Jian Zhang, Lei Qi, Yinghuan Shi","title":"Generalizable Decision Boundaries: Dualistic Meta-Learning for Open Set\n  Domain Generalization","comments":"10 pages, 5 figures, accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain generalization (DG) is proposed to deal with the issue of domain\nshift, which occurs when statistical differences exist between source and\ntarget domains. However, most current methods do not account for a common\nrealistic scenario where the source and target domains have different classes.\nTo overcome this deficiency, open set domain generalization (OSDG) then emerges\nas a more practical setting to recognize unseen classes in unseen domains. An\nintuitive approach is to use multiple one-vs-all classifiers to define decision\nboundaries for each class and reject the outliers as unknown. However, the\nsignificant class imbalance between positive and negative samples often causes\nthe boundaries biased towards positive ones, resulting in misclassification for\nknown samples in the unseen target domain. In this paper, we propose a novel\nmeta-learning-based framework called dualistic MEta-learning with joint\nDomaIn-Class matching (MEDIC), which considers gradient matching towards\ninter-domain and inter-class splits simultaneously to find a generalizable\nboundary balanced for all tasks. Experimental results demonstrate that MEDIC\nnot only outperforms previous methods in open set scenarios, but also maintains\ncompetitive close set generalization ability at the same time. Our code is\navailable at https://github.com/zzwdx/MEDIC.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:46:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Xiran",""],["Zhang","Jian",""],["Qi","Lei",""],["Shi","Yinghuan",""]]}
{"id":"2308.09392","submitter":"Jehyun Lee","authors":"Jehyun Lee, Zhe Xin, Melanie Ng Pei See, Kanav Sabharwal, Giovanni\n  Apruzzese, Dinil Mon Divakaran","title":"Attacking logo-based phishing website detectors with adversarial\n  perturbations","comments":"To appear in ESORICS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recent times have witnessed the rise of anti-phishing schemes powered by deep\nlearning (DL). In particular, logo-based phishing detectors rely on DL models\nfrom Computer Vision to identify logos of well-known brands on webpages, to\ndetect malicious webpages that imitate a given brand. For instance, Siamese\nnetworks have demonstrated notable performance for these tasks, enabling the\ncorresponding anti-phishing solutions to detect even \"zero-day\" phishing\nwebpages. In this work, we take the next step of studying the robustness of\nlogo-based phishing detectors against adversarial ML attacks. We propose a\nnovel attack exploiting generative adversarial perturbations to craft\n\"adversarial logos\" that evade phishing detectors. We evaluate our attacks\nthrough: (i) experiments on datasets containing real logos, to evaluate the\nrobustness of state-of-the-art phishing detectors; and (ii) user studies to\ngauge whether our adversarial logos can deceive human eyes. The results show\nthat our proposed attack is capable of crafting perturbed logos subtle enough\nto evade various DL models-achieving an evasion rate of up to 95%. Moreover,\nusers are not able to spot significant differences between generated\nadversarial logos and original ones.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:49:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lee","Jehyun",""],["Xin","Zhe",""],["See","Melanie Ng Pei",""],["Sabharwal","Kanav",""],["Apruzzese","Giovanni",""],["Divakaran","Dinil Mon",""]]}
{"id":"2308.09393","submitter":"C\\'eline Hocquette","authors":"C\\'eline Hocquette, Andreas Niskanen, Matti J\\\"arvisalo, Andrew\n  Cropper","title":"Learning MDL logic programs from noisy data","comments":"arXiv admin note: text overlap with arXiv:2206.01614","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.LO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Many inductive logic programming approaches struggle to learn programs from\nnoisy data. To overcome this limitation, we introduce an approach that learns\nminimal description length programs from noisy data, including recursive\nprograms. Our experiments on several domains, including drug design, game\nplaying, and program synthesis, show that our approach can outperform existing\napproaches in terms of predictive accuracies and scale to moderate amounts of\nnoise.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:49:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hocquette","C\u00e9line",""],["Niskanen","Andreas",""],["J\u00e4rvisalo","Matti",""],["Cropper","Andrew",""]]}
{"id":"2308.09394","submitter":"Florian Becker","authors":"Florian Becker, Katharina Rauthmann, Lutz Pauli, Philipp Knechtges","title":"An Eigenvalue-Free Implementation of the Log-Conformation Formulation","comments":"23 pages, 6 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The log-conformation formulation, although highly successful, was from the\nbeginning formulated as a partial differential equation that contains an, for\nPDEs unusual, eigenvalue decomposition of the unknown field. To this day, most\nnumerical implementations have been based on this or a similar eigenvalue\ndecomposition, with Knechtges et al. (2014) being the only notable exception\nfor two-dimensional flows.\n  In this paper, we present an eigenvalue-free algorithm to compute the\nconstitutive equation of the log-conformation formulation that works for two-\nand three-dimensional flows. Therefore, we first prove that the challenging\nterms in the constitutive equations are representable as a matrix function of a\nslightly modified matrix of the log-conformation field. We give a proof of\nequivalence of this term to the more common log-conformation formulations.\nBased on this formulation, we develop an eigenvalue-free algorithm to evaluate\nthis matrix function. The resulting full formulation is first discretized using\na finite volume method, and then tested on the confined cylinder and\nsedimenting sphere benchmarks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:51:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Becker","Florian",""],["Rauthmann","Katharina",""],["Pauli","Lutz",""],["Knechtges","Philipp",""]]}
{"id":"2308.09395","submitter":"Beichuan Zhang","authors":"Beichuan Zhang, Chenggen Sun, Jianchao Tan, Xinjun Cai, Jun Zhao,\n  Mengqi Miao, Kang Yin, Chengru Song, Na Mou, Yang Song","title":"SHARK: A Lightweight Model Compression Approach for Large-scale\n  Recommender Systems","comments":"accepted by cikm 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Increasing the size of embedding layers has shown to be effective in\nimproving the performance of recommendation models, yet gradually causing their\nsizes to exceed terabytes in industrial recommender systems, and hence the\nincrease of computing and storage costs. To save resources while maintaining\nmodel performances, we propose SHARK, the model compression practice we have\nsummarized in the recommender system of industrial scenarios. SHARK consists of\ntwo main components. First, we use the novel first-order component of Taylor\nexpansion as importance scores to prune the number of embedding tables (feature\nfields). Second, we introduce a new row-wise quantization method to apply\ndifferent quantization strategies to each embedding. We conduct extensive\nexperiments on both public and industrial datasets, demonstrating that each\ncomponent of our proposed SHARK framework outperforms previous approaches. We\nconduct A/B tests in multiple models on Kuaishou, such as short video,\ne-commerce, and advertising recommendation models. The results of the online\nA/B test showed SHARK can effectively reduce the memory footprint of the\nembedded layer. For the short-video scenarios, the compressed model without any\nperformance drop significantly saves 70% storage and thousands of machines,\nimproves 30\\% queries per second (QPS), and has been deployed to serve hundreds\nof millions of users and process tens of billions of requests every day.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:52:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Beichuan",""],["Sun","Chenggen",""],["Tan","Jianchao",""],["Cai","Xinjun",""],["Zhao","Jun",""],["Miao","Mengqi",""],["Yin","Kang",""],["Song","Chengru",""],["Mou","Na",""],["Song","Yang",""]]}
{"id":"2308.09396","submitter":"Chenwei Wang","authors":"Chenwei Wang, Xin Chen, You Qin, Siyi Luo, Yulin Huang, Jifang Pei and\n  Jianyu Yang","title":"Unveiling Causalities in SAR ATR: A Causal Interventional Approach for\n  Limited Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synthetic aperture radar automatic target recognition (SAR ATR) methods fall\nshort with limited training data. In this letter, we propose a causal\ninterventional ATR method (CIATR) to formulate the problem of limited SAR data\nwhich helps us uncover the ever-elusive causalities among the key factors in\nATR, and thus pursue the desired causal effect without changing the imaging\nconditions. A structural causal model (SCM) is comprised using causal inference\nto help understand how imaging conditions acts as a confounder introducing\nspurious correlation when SAR data is limited. This spurious correlation among\nSAR images and the predicted classes can be fundamentally tackled with the\nconventional backdoor adjustments. An effective implement of backdoor\nadjustments is proposed by firstly using data augmentation with\nspatial-frequency domain hybrid transformation to estimate the potential effect\nof varying imaging conditions on SAR images. Then, a feature discrimination\napproach with hybrid similarity measurement is introduced to measure and\nmitigate the structural and vector angle impacts of varying imaging conditions\non the extracted features from SAR images. Thus, our CIATR can pursue the true\ncausality between SAR images and the corresponding classes even with limited\nSAR data. Experiments and comparisons conducted on the moving and stationary\ntarget acquisition and recognition (MSTAR) and OpenSARship datasets have shown\nthe effectiveness of our method with limited SAR data.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:54:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Chenwei",""],["Chen","Xin",""],["Qin","You",""],["Luo","Siyi",""],["Huang","Yulin",""],["Pei","Jifang",""],["Yang","Jianyu",""]]}
{"id":"2308.09397","submitter":"Daisuke Jido","authors":"Yutaro Iizawa, Daisuke Jido, Stephan H\\\"ubsch","title":"$K^+ N$ elastic scatterings for estimation of in-medium quark condensate\n  with strange quarks","comments":"32 pages, 11 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the low-energy $K^+N$ elastic scatterings in the context of the\nin-medium quark condensate with strange quarks. The chiral ward identity\nconnects the in-medium quark condensate to the soft limit value of the\npseudoscalar correlation function evaluated in nuclear matter. The in-medium\ncorrelation function of the psuedoscalar fields with strangeness describes\nin-medium kaon propagation and is obtained by kaon-nucleon scattering\namplitudes in the low density approximation. We construct the kaon-nucleon\nscattering amplitudes in chiral perturbation theory up to the next-to-leading\norder and add some terms of the next-to-next-to-leading order with the strange\nquark mass to improve expansion of the strange quark sector. We also consider\nthe effect of a possible broad resonance state around $P_\\mathrm{lab} = 600$\nMeV/c for $I=0$ reported in the previous study. The low energy constants are\ndetermined by existent $K^+N$ scattering data. We obtain good reproduction of\nthe $K^+p$ scattering amplitude by chiral perturbation theory, while the\ndescription of the $KN$ amplitude with $I=0$ is not so satisfactory due to the\nlack of low energy data. Performing analytic continuation of the scattering\namplitudes obtained by chiral perturbation theory to the soft limit, we\nestimate the in-medium strange quark condensate.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:55:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Iizawa","Yutaro",""],["Jido","Daisuke",""],["H\u00fcbsch","Stephan",""]]}
{"id":"2308.09398","submitter":"Naohiko Otuka Dr.","authors":"Vidya Devi, Naohiko Otuka, S. Ganesan","title":"EXFOR-based simultaneous evaluation for fast neutron-induced fission\n  cross section of thorium-232","comments":"Submitted to Journal of Nuclear Science and Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The $^{232}$Th neutron-induced fission cross section was evaluated from 500\nkeV to 200 MeV. The experimental $^{232}$Th fission cross sections and their\nratios to the $^{235,238}$U fission cross sections in the EXFOR library were\nreviewed and analysed by the least-squares method. The newly published\n$^{232}$Th/$^{235}$U fission cross section ratios from the time-of-flight\nmeasurements at the CERN n_TOF and CSNS Back-n facilities were compiled in\nEXFOR. Additional simultaneous evaluation was performed by including the\nexperimental $^{233,238}$U and $^{239,240,241}$Pu fission cross sections and\ntheir ratios. The new evaluation provides the $^{232}$Th fission cross section\nsystematically lower than the JENDL-5 cross section. The reduction is 4% in the\nplateau region between 2 and 6 MeV and more significant in the subthreshold\nfission region. The present evaluation reduces the $^{232}$Th fission cross\nsection averaged over the $^{252}$Cf spontaneous fission neutron spectrum from\nthe JENDL-5 evaluation by 4%, which is closer to the other general purpose\nlibraries but underestimates Grundl et al's measurement by 11%.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:57:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Devi","Vidya",""],["Otuka","Naohiko",""],["Ganesan","S.",""]]}
{"id":"2308.09399","submitter":"Ulrich Pferschy","authors":"Nina Chiarelli, Matja\\v{z} Krnc, Martin Milani\\v{c}, Ulrich Pferschy,\n  Joachim Schauer","title":"Fair Allocation Algorithms for Indivisible Items under Structured\n  Conflict Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.CC math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the fair allocation of indivisible items to several agents with\nadditional conflict constraints. These are represented by a conflict graph\nwhere each item corresponds to a vertex of the graph and edges in the graph\nrepresent incompatible pairs of items which should not be allocated to the same\nagent. This setting combines the issues of Partition and Independent Set and\ncan be seen as a partial coloring of the conflict graph. In the resulting\noptimization problem each agent has its own valuation function for the profits\nof the items. We aim at maximizing the lowest total profit obtained by any of\nthe agents. In a previous paper this problem was shown to be strongly \\NP-hard\nfor several well-known graph classes, e.g., bipartite graphs and their line\ngraphs. On the other hand, it was shown that pseudo-polynomial time algorithms\nexist for the classes of chordal graphs, cocomparability graphs, biconvex\nbipartite graphs, and graphs of bounded treewidth. In this contribution we\nextend this line of research by developing pseudo-polynomial time algorithms\nthat solve the problem for the class of convex bipartite conflict graphs,\ngraphs of bounded clique-width, and graphs of bounded tree-independence number.\nThe algorithms are based on dynamic programming and also permit fully\npolynomial-time approximation schemes (FPTAS).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:59:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chiarelli","Nina",""],["Krnc","Matja\u017e",""],["Milani\u010d","Martin",""],["Pferschy","Ulrich",""],["Schauer","Joachim",""]]}
{"id":"2308.09400","submitter":"Floyd Chitalu PhD","authors":"Kemeng Huang and Floyd Chitalu and Huancheng Lin and Taku Komura","title":"Fast and stable Gauss-Newton optimization of IPC barrier energy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Barrier terms for Incremental Potential Contact (IPC) energy are crucial for\nmaintaining an intersection and inversion free simulation trajectory. However,\nexisting formulations which directly use distance for measuring the state of\ncontact can restrict implementation design and performance. This is because\nnumerical eigendecompositions are required for guaranteeing positive\nsemi-definiteness of the Hessian of the barrier energy during optimization with\nProjected-Newton solvers, and alternative Gauss-Newton methods suffer from\nsignificantly reduced convergence rates. We rewrite the barrier function of IPC\nto derive an efficient approximation its Hessian, which can then be used for\nsimultaneous construction and projection to positive semi-definite state. The\nkey idea is to formulate a simplicial geometric measure of contact using mesh\nboundary elements, where analytic eigensystems are obtained for minimising the\nproposed barrier energy with superlinear convergence to retain much of the\nadvantage of Newton-type methods. Our approach is suitable for standard second\norder unconstrained optimization strategies for IPC based collision processing,\nminimizing nonlinear nonconvex functions where the Hessian may be indefinite.\nThe result is a 3-times speedup over the standard full-space IPC barrier\nformulation based on direct Euclidean distance measures. We further apply our\nanalytic proxy eigensystems to produce an entirely GPU-based implementation of\nIPC with significant further acceleration.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:01:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Kemeng",""],["Chitalu","Floyd",""],["Lin","Huancheng",""],["Komura","Taku",""]]}
{"id":"2308.09401","submitter":"Valentin V. Khoze","authors":"Valentin V. Khoze","title":"Scattering Amplitudes of Fermions on Monopoles","comments":"15 pages","journal-ref":null,"doi":null,"report-no":"IPPP/23/XX","categories":"hep-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider scattering processes involving massless fermions and 't\nHooft-Polyakov magnetic monopoles in a minimal SU(2) model and in the Grand\nUnified SU(5) theory. We construct expressions for on-shell amplitudes for\nthese processes in the $J=0$ partial wave using the spinor helicity basis\nconsisting of single-particle and pairwise helicities. These processes are\nunsuppressed and are relevant for the monopole catalysis of proton decay. The\namplitudes for the minimal processes involving a single fermion scattering on a\nmonopole in the initial state and half-fermion solitons in the final state are\npresented for the first time and are used to obtain the amplitudes for\nprocesses involving more fermions in the initial state and integer fermion\nnumbers in the final state. A number of such anomalous and non-anomalous\nprocesses, along with their amplitude expressions, are written down for the\n$SU(5)$ GUT model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:03:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khoze","Valentin V.",""]]}
{"id":"2308.09402","submitter":"Francesco Terranova","authors":"F. Acerbi, I. Angelis, L. Bomben, M. Bonesini, F. Bramati, A. Branca,\n  C. Brizzolari, G. Brunetti, M. Calviani, S. Capelli, S. Carturan, M.G.\n  Catanesi, S. Cecchini, N. Charitonidis, F. Cindolo, G. Cogo, G. Collazuol, F.\n  Dal Corso, C. Delogu, G. De Rosa, A. Falcone, B. Goddard, A. Gola, D.\n  Guffanti, L. Hali\\'c, F. Iacob, C. Jollet, V. Kain, A. Kallitsopoulou, B.\n  Kli\\v{c}ek, Y. Kudenko, Ch. Lampoudis, M. Laveder, P. Legou, A. Longhin, L.\n  Ludovici, E. Lutsenko, L. Magaletti, G. Mandrioli, S. Marangoni, A. Margotti,\n  V. Mascagna, N. Mauri, J. McElwee, L. Meazza, A. Meregaglia, M. Mezzetto, M.\n  Nessi, A. Paoloni, M. Pari, T. Papaevangelou, E.G. Parozzi, L. Pasqualini, G.\n  Paternoster, L. Patrizii, M. Pozzato, M. Prest, F. Pupilli, E. Radicioni,\n  A.C. Ruggeri, G. Saibene, D. Sampsonidis, C. Scian, G. Sirri, M.\n  Stip\\v{c}evi\\'c, M. Tenti, F. Terranova, M. Torti, S.E. Tzamarias, E.\n  Vallazza, F. Velotti, L. Votano","title":"Design and performance of the ENUBET monitored neutrino beam","comments":"24 pages, 33 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph physics.acc-ph physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ENUBET project is aimed at designing and experimentally demonstrating the\nconcept of monitored neutrino beams. These novel beams are enhanced by an\ninstrumented decay tunnel, whose detectors reconstruct large-angle charged\nleptons produced in the tunnel and give a direct estimate of the neutrino flux\nat the source. These facilities are thus the ideal tool for high-precision\nneutrino cross-section measurements at the GeV scale because they offer\nsuperior control of beam systematics with respect to existing facilities. In\nthis paper, we present the first end-to-end design of a monitored neutrino beam\ncapable of monitoring lepton production at the single particle level. This goal\nis achieved by a new focusing system without magnetic horns, a 20 m\nnormal-conducting transfer line for charge and momentum selection, and a 40 m\ntunnel instrumented with cost-effective particle detectors. Employing such a\ndesign, we show that percent precision in cross-section measurements can be\nachieved at the CERN SPS complex with existing neutrino detectors.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:03:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Acerbi","F.",""],["Angelis","I.",""],["Bomben","L.",""],["Bonesini","M.",""],["Bramati","F.",""],["Branca","A.",""],["Brizzolari","C.",""],["Brunetti","G.",""],["Calviani","M.",""],["Capelli","S.",""],["Carturan","S.",""],["Catanesi","M. G.",""],["Cecchini","S.",""],["Charitonidis","N.",""],["Cindolo","F.",""],["Cogo","G.",""],["Collazuol","G.",""],["Corso","F. Dal",""],["Delogu","C.",""],["De Rosa","G.",""],["Falcone","A.",""],["Goddard","B.",""],["Gola","A.",""],["Guffanti","D.",""],["Hali\u0107","L.",""],["Iacob","F.",""],["Jollet","C.",""],["Kain","V.",""],["Kallitsopoulou","A.",""],["Kli\u010dek","B.",""],["Kudenko","Y.",""],["Lampoudis","Ch.",""],["Laveder","M.",""],["Legou","P.",""],["Longhin","A.",""],["Ludovici","L.",""],["Lutsenko","E.",""],["Magaletti","L.",""],["Mandrioli","G.",""],["Marangoni","S.",""],["Margotti","A.",""],["Mascagna","V.",""],["Mauri","N.",""],["McElwee","J.",""],["Meazza","L.",""],["Meregaglia","A.",""],["Mezzetto","M.",""],["Nessi","M.",""],["Paoloni","A.",""],["Pari","M.",""],["Papaevangelou","T.",""],["Parozzi","E. G.",""],["Pasqualini","L.",""],["Paternoster","G.",""],["Patrizii","L.",""],["Pozzato","M.",""],["Prest","M.",""],["Pupilli","F.",""],["Radicioni","E.",""],["Ruggeri","A. C.",""],["Saibene","G.",""],["Sampsonidis","D.",""],["Scian","C.",""],["Sirri","G.",""],["Stip\u010devi\u0107","M.",""],["Tenti","M.",""],["Terranova","F.",""],["Torti","M.",""],["Tzamarias","S. E.",""],["Vallazza","E.",""],["Velotti","F.",""],["Votano","L.",""]]}
{"id":"2308.09403","submitter":"Sen Wang","authors":"Wang Sen","title":"Target Clustering Based Multi-Bernoulli Filter for Superpositional\n  Sensors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The sensor whose output is a function of the sum of contributions from\ntargets present in the surveillance area is called superpositional sensor. In\nthis letter, target clustering based multi-Bernoulli filter for superpositional\nsensors is proposed.Targets are clustered according to the set of resolution\ncells illuminated by them. Single target posterior density is strictly derived,\nand densities of all the targets are combined to a approximate multi-target\nposterior, which makes the multiBernoulli density is conjugate with respect to\nthe likelihood of superpositional sensors. The Gaussian implementation of the\nproposed algorithm is also presented, where the multidimensionality and the\nnonlinearity of update equation are handled by sigma point transformation. The\nsimulation results illustrate that the proposed algorithm is effective\nconfronted with the interaction of multiple targets and long term overlapping\nof two targets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:04:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sen","Wang",""]]}
{"id":"2308.09404","submitter":"Xueqing Yin","authors":"Xueqing Yin, John M. Aiken, Richard Harris and Jonathan L. Bamber","title":"Spatio-temporal spread of COVID-19 and its associations with\n  socioeconomic, demographic and environmental factors in England: A Bayesian\n  hierarchical spatio-temporal model","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Exploring the spatio-temporal variations of COVID-19 transmission and its\npotential determinants could provide a deeper understanding of the dynamics of\ndisease spread. This study aims to investigate the spatio-temporal spread of\nCOVID-19 infection rate in England, and examine its associations with\nsocioeconomic, demographic and environmental risk factors. Using weekly\nreported COVID-19 cases from 7 March 2020 to 26 March 2022 at Middle Layer\nSuper Output Area (MSOA) level in mainland England, we developed a Bayesian\nhierarchical spatio-temporal model to predict the COVID-19 infection rates and\ninvestigate the influencing factors. The analysis showed that our model\noutperformed the ordinary least squares (OLS) and geographically weighted\nregression (GWR) models in terms of prediction accuracy. The results showed\nthat the spread of COVID-19 infection rates over space and time was\nheterogeneous. Hotspots of infection rate exhibited inconsistent clustered\npatterns over time. Among the selected risk factors, the annual household\nincome, unemployment rate, population density, percentage of Caribbean\npopulation, percentage of adults aged 45-64 years old, and particulate matter\nconcentrations were found to be positively associated with the COVID-19\ninfection rate. The findings assist policymakers in developing tailored public\nhealth interventions for COVID-19 prevention and control.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:12:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yin","Xueqing",""],["Aiken","John M.",""],["Harris","Richard",""],["Bamber","Jonathan L.",""]]}
{"id":"2308.09405","submitter":"Jiyuan Shi","authors":"Jiyuan Shi, Chenjia Bai, Haoran He, Lei Han, Dong Wang, Bin Zhao, Xiu\n  Li, Xuelong Li","title":"Robust Quadrupedal Locomotion via Risk-Averse Policy Learning","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The robustness of legged locomotion is crucial for quadrupedal robots in\nchallenging terrains. Recently, Reinforcement Learning (RL) has shown promising\nresults in legged locomotion and various methods try to integrate privileged\ndistillation, scene modeling, and external sensors to improve the\ngeneralization and robustness of locomotion policies. However, these methods\nare hard to handle uncertain scenarios such as abrupt terrain changes or\nunexpected external forces. In this paper, we consider a novel risk-sensitive\nperspective to enhance the robustness of legged locomotion. Specifically, we\nemploy a distributional value function learned by quantile regression to model\nthe aleatoric uncertainty of environments, and perform risk-averse policy\nlearning by optimizing the worst-case scenarios via a risk distortion measure.\nExtensive experiments in both simulation environments and a real Aliengo robot\ndemonstrate that our method is efficient in handling various external\ndisturbances, and the resulting policy exhibits improved robustness in harsh\nand uncertain situations in legged locomotion. Videos are available at\nhttps://risk-averse-locomotion.github.io/.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:12:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shi","Jiyuan",""],["Bai","Chenjia",""],["He","Haoran",""],["Han","Lei",""],["Wang","Dong",""],["Zhao","Bin",""],["Li","Xiu",""],["Li","Xuelong",""]]}
{"id":"2308.09406","submitter":"Toru Sera","authors":"Jon. Aaronson and Toru Sera","title":"Generalized uniform laws for tied-down occupation times of infinite\n  ergodic transformations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish a conditional limit theorem for occupation times of infinite\nergodic transformations under a tied-down condition, that is, the condition\nthat the orbit returns to a reference set with finite measure at the final\nobservation time. The class of limit distributions is the generalization of the\nuniform distribution which was discovered by M. Barlow, J. Pitman and M. Yor in\n[S\\'eminaire de Probabilit\\'es XXIII. Lecture Notes in Mathematics, volume 1372\n(1989), 294--314]. For the proof we utilize operator renewal theory. Our result\ncan be applied to intermittent maps with two or more indifferent fixed points.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:15:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Aaronson","Jon.",""],["Sera","Toru",""]]}
{"id":"2308.09407","submitter":"Markus Braden","authors":"S. Holbein, P. Steffens, S. Biesenkamp, J. Ollivier, A. C. Komarek, M.\n  Baum, and M. Braden","title":"Spin-wave dispersion and magnon chirality in multiferroic TbMnO3","comments":"20 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inelastic neutron scattering experiments combining time-of-flight and\npolarized techniques yield a comprehensive picture of the magnon dispersion in\nmultiferroic TbMnO3 including the dynamic chirality. Taking into account only\nMn3+ moments, spin-wave calculations including nearest-neighbor interactions,\nfrustrating next-nearest neighbor exchange as well as single-ion anisotropy and\nantisymmetric terms describe the energy dispersion and the distribution of\nneutron scattering intensity in the multiferroic state very well. Polarized\nneutron scattering reveals strong dynamic chirality of both signs that may be\ncontrolled by external electric fields in the multiferroic phase. Also above\nthe onset of long-range multiferroic order in zero electric field, a small\ninelastic chiral component can be inverted by an electric field. The\nmicroscopic spin-wave calculations fully explain also the dynamic chirality of\nmagnetic excitations, which is imprinted by the static chirality of the\nmultiferroic phase. The ordering of Tb3+ moments at lower temperature reduces\nthe broadening of magnons but also renders the magnon dispersion more complex.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:19:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Holbein","S.",""],["Steffens","P.",""],["Biesenkamp","S.",""],["Ollivier","J.",""],["Komarek","A. C.",""],["Baum","M.",""],["Braden","M.",""]]}
{"id":"2308.09408","submitter":"Seppo Hassi","authors":"Seppo Hassi and Henk de Snoo","title":"Complementation and Lebesgue type decompositions of linear operators and\n  relations","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper a new general approach is developed to construct and study\nLebesgue type decompositions of linear operators $T$ in the Hilbert space\nsetting. The new approach allows to introduce an essentially wider class of\nLebesgue type decompositions than what has been studied in the literature so\nfar. The key point is that they allow a nontrivial interaction between the\nclosable and the singular components of $T$. The motivation to study such\ndecompositions comes from the fact that they naturally occur in the\ncorresponding Lebesgue type decomposition for pairs of quadratic forms. The\napproach built in this paper uses so-called complementation in Hilbert spaces,\na notion going back to de Branges and Rovnyak.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:20:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hassi","Seppo",""],["de Snoo","Henk",""]]}
{"id":"2308.09409","submitter":"Malte Ten Wolde","authors":"Malte A. ten Wolde and Davood Farhadi","title":"A Single-Input State-Switching Building Block Harnessing Internal\n  Instabilities","comments":"11 pages, 5 figures. Journal submitted to Extreme Mechanics Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bistable mechanisms are prevalent across a broad spectrum of applications due\nto their ability to maintain two distinct stable states. Their energy\nconsumption is predominantly confined to the process of state transitions,\nthereby enhancing their efficiency. However, the transition often requires two\ndistinct inputs, implicating the requirement of multiple actuators. Here, we\npropose an elastic and contactless design strategy for inducing state\ntransitions in bistable mechanisms, requiring only a single cyclic input. The\nstrategy leverages internal information, interpreted as system state, as an\nextra input to make a weighted decision for transitioning to the subsequent\nstate. We characterize the behavior using a spring-based rigid-body model,\nconsisting of a column near bifurcation, combined with a non-linear spring\nconnected to a bistable element that represents the information state. The\nresults show that a nonlinear spring with a quadratic stiffness function, i.e.,\nrepresenting internal instability, is crucial for regulating state-switching\nbehavior. We then demonstrate this design strategy by developing a monolithic\nand compliant design embodiment and experimentally evaluate its behavior.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:22:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wolde","Malte A. ten",""],["Farhadi","Davood",""]]}
{"id":"2308.09410","submitter":"Shiue Yuan Shiau","authors":"Monique Combescot, Thierry Amand, Shiue-Yuan Shiau","title":"Ab initio quantum approach to electron-hole exchange for semiconductors\n  hosting Wannier excitons","comments":"15 pages, 8 figures","journal-ref":"Physical Review B 107, 115206 (2023)","doi":"10.1103/PhysRevB.107.115206","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a quantum approach to \"electron-hole exchange\", better named\nelectron-hole pair exchange, that makes use of the second quantization\nformalism to describe the problem in terms of Bloch-state electron operators.\nThis approach renders transparent the fact that such singular effect comes from\ninterband Coulomb processes. We first show that, due to the sign change when\nturning from valence-electron destruction operator to hole creation operator,\nthe interband Coulomb interaction only acts on spin-singlet electron-hole\npairs, just like the interband electron-photon interaction, thereby making\nthese spin-singlet pairs optically bright. We then show that when written in\nterms of reciprocal lattice vectors ${\\bf G}_m$, the singularity of the\ninterband Coulomb scattering in the small wave-vector transfer limit entirely\ncomes from the ${\\bf G}_m = 0$ term, which renders its singular behavior easy\nto calculate. Comparison with the usual real-space formulation in which the\nsingularity appears through a sum of \"long-range processes\" over all ${\\bf\nR}\\not= 0$ lattice vectors once more proves that periodic systems are easier to\nhandle in terms of reciprocal vectors ${\\bf G}_m$ than in terms of lattice\nvectors $\\bf R$. Well-accepted consequences of the electron-hole exchange on\nexcitons and polaritons are reconsidered and refuted for different major\nreasons.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:23:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Combescot","Monique",""],["Amand","Thierry",""],["Shiau","Shiue-Yuan",""]]}
{"id":"2308.09411","submitter":"Mikhail Papkov","authors":"Iaroslav Plutenko, Mikhail Papkov, Kaupo Palo, Leopold Parts, Dmytro\n  Fishman","title":"Metadata Improves Segmentation Through Multitasking Elicitation","comments":"Accepted for DART @ 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":"  Metainformation is a common companion to biomedical images. However, this\npotentially powerful additional source of signal from image acquisition has had\nlimited use in deep learning methods, for semantic segmentation in particular.\nHere, we incorporate metadata by employing a channel modulation mechanism in\nconvolutional networks and study its effect on semantic segmentation tasks. We\ndemonstrate that metadata as additional input to a convolutional network can\nimprove segmentation results while being inexpensive in implementation as a\nnimble add-on to popular models. We hypothesize that this benefit of metadata\ncan be attributed to facilitating multitask switching. This aspect of\nmetadata-driven systems is explored and discussed in detail.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:23:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Plutenko","Iaroslav",""],["Papkov","Mikhail",""],["Palo","Kaupo",""],["Parts","Leopold",""],["Fishman","Dmytro",""]]}
{"id":"2308.09412","submitter":"Chenwei Wang","authors":"Chenwei Wang, You Qin, Li Li, Siyi Luo, Yulin Huang, Jifang Pei, Yin\n  Zhang and Jianyu Yang","title":"Causal SAR ATR with Limited Data via Dual Invariance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synthetic aperture radar automatic target recognition (SAR ATR) with limited\ndata has recently been a hot research topic to enhance weak generalization.\nDespite many excellent methods being proposed, a fundamental theory is lacked\nto explain what problem the limited SAR data causes, leading to weak\ngeneralization of ATR. In this paper, we establish a causal ATR model\ndemonstrating that noise $N$ that could be blocked with ample SAR data, becomes\na confounder with limited data for recognition. As a result, it has a\ndetrimental causal effect damaging the efficacy of feature $X$ extracted from\nSAR images, leading to weak generalization of SAR ATR with limited data. The\neffect of $N$ on feature can be estimated and eliminated by using backdoor\nadjustment to pursue the direct causality between $X$ and the predicted class\n$Y$. However, it is difficult for SAR images to precisely estimate and\neliminated the effect of $N$ on $X$. The limited SAR data scarcely powers the\nmajority of existing optimization losses based on empirical risk minimization\n(ERM), thus making it difficult to effectively eliminate $N$'s effect. To\ntackle with difficult estimation and elimination of $N$'s effect, we propose a\ndual invariance comprising the inner-class invariant proxy and the\nnoise-invariance loss. Motivated by tackling change with invariance, the\ninner-class invariant proxy facilitates precise estimation of $N$'s effect on\n$X$ by obtaining accurate invariant features for each class with the limited\ndata. The noise-invariance loss transitions the ERM's data quantity necessity\ninto a need for noise environment annotations, effectively eliminating $N$'s\neffect on $X$ by cleverly applying the previous $N$'s estimation as the noise\nenvironment annotations. Experiments on three benchmark datasets indicate that\nthe proposed method achieves superior performance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:27:05 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Chenwei",""],["Qin","You",""],["Li","Li",""],["Luo","Siyi",""],["Huang","Yulin",""],["Pei","Jifang",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.09413","submitter":"Giorgio Di Tizio","authors":"Giorgio Di Tizio, Gilberto Atondo Siu, Alice Hutchings, Fabio Massacci","title":"A Graph-based Stratified Sampling Methodology for the Analysis of\n  (Underground) Forums","comments":null,"journal-ref":"IEEE Transactions on Information Forensics and Security, 2023","doi":"10.1109/TIFS.2023.3304424","report-no":null,"categories":"cs.SI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  [Context] Researchers analyze underground forums to study abuse and\ncybercrime activities. Due to the size of the forums and the domain expertise\nrequired to identify criminal discussions, most approaches employ supervised\nmachine learning techniques to automatically classify the posts of interest.\n[Goal] Human annotation is costly. How to select samples to annotate that\naccount for the structure of the forum? [Method] We present a methodology to\ngenerate stratified samples based on information about the centrality\nproperties of the population and evaluate classifier performance. [Result] We\nobserve that by employing a sample obtained from a uniform distribution of the\npost degree centrality metric, we maintain the same level of precision but\nsignificantly increase the recall (+30%) compared to a sample whose\ndistribution is respecting the population stratification. We find that\nclassifiers trained with similar samples disagree on the classification of\ncriminal activities up to 33% of the time when deployed on the entire forum.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:28:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Di Tizio","Giorgio",""],["Siu","Gilberto Atondo",""],["Hutchings","Alice",""],["Massacci","Fabio",""]]}
{"id":"2308.09414","submitter":"Ralf Metzler","authors":"Henrik Seckler, Janusz Szwabinski, and Ralf Metzler","title":"Machine-Learning Solutions for the Analysis of Single-Particle Diffusion\n  Trajectories","comments":"25 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cs.LG physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single-particle traces of the diffusive motion of molecules, cells, or\nanimals are by-now routinely measured, similar to stochastic records of stock\nprices or weather data. Deciphering the stochastic mechanism behind the\nrecorded dynamics is vital in understanding the observed systems. Typically,\nthe task is to decipher the exact type of diffusion and/or to determine system\nparameters. The tools used in this endeavor are currently revolutionized by\nmodern machine-learning techniques. In this Perspective we provide an overview\nover recently introduced methods in machine-learning for diffusive time series,\nmost notably, those successfully competing in the\nAnomalous-Diffusion-Challenge. As such methods are often criticized for their\nlack of interpretability, we focus on means to include uncertainty estimates\nand feature-based approaches, both improving interpretability and providing\nconcrete insight into the learning process of the machine. We expand the\ndiscussion by examining predictions on different out-of-distribution data. We\nalso comment on expected future developments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:29:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Seckler","Henrik",""],["Szwabinski","Janusz",""],["Metzler","Ralf",""]]}
{"id":"2308.09415","submitter":"Yogesh Chandra","authors":"Manjuleshwar Panda and Yogesh Chandra","title":"Unveiling The Mysteries Of The Cosmos: An Overview Of Radio Astronomy\n  And Its Profound Insights","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With its immensity and numerous mysteries waiting to be solved, the cosmos\nhas always captivated humankind. A ground-breaking field that has given us a\nprofound understanding of the mysteries of the cosmos is radio astronomy. This\npaper presents a comprehensive overview of radio astronomy, exploring its\ntechniques, discoveries, and the profound insights it offers into celestial\nobjects. Radio astronomy, which uses radio waves to analyse celestial\nphenomena, has completely changed how we think about the universe. This field\nhas given us crucial information about the formation of stars, galaxies, and\nother celestial objects through the analysis of radio emissions. Radio\nastronomy has enabled researchers to study cosmic processes that are\nundetectable to the human eye by penetrating the furthest reaches of space. We\nexplore radio astronomy techniques in this article, revealing how it can be\nused to see through interstellar dust and collect signals from the universe's\nfurthest reaches. Pulsars, quasars, and cosmic microwave background radiation\nare significant discoveries that have helped astronomers understand dark matter\nand dark energy in great detail. We also look into how radio astronomy might be\nused in cosmology and astrophysics. In conclusion, radio astronomy has become a\npotent tool for solving the cosmos' riddles. Its capacity for the detection and\nanalysis of radio emissions has produced a fundamental understanding of the\nbeginnings and evolution of the universe. Radio astronomy continues to advance\nour understanding of the cosmos and arouses interest in additional cosmic\nresearch by shedding light on celestial objects that are invisible to the human\neye.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:30:30 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Panda","Manjuleshwar",""],["Chandra","Yogesh",""]]}
{"id":"2308.09416","submitter":"K Premalatha","authors":"K. Premalatha, V K Chandrasekar, L. Senthilkumar, and M. Lakshmanan","title":"Shear induced symmetry breaking dynamical states","comments":"Accepted for publication in The European Physical Journal Plus","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine how shear influences the emergence of symmetry-breaking dynamical\nstates in a globally coupled Stuart-Landau (SL) oscillator system with combined\nattractive and repulsive interactions. In the absence of the shear parameter,\nthe system exhibits synchronization, nontrivial oscillation death states, and\noscillation death states. However, with the introduction of the shear\nparameter, we observe diverse dynamical patterns, including amplitude clusters,\nsolitary states, complete synchronization, and nontrivial oscillation death\nstates when the repulsive interaction is weak. As the strength of the repulsive\ninteraction increases, the system becomes more heterogeneous, resulting in\nimperfect solitary states. We also validate the analytical stability condition\nfor the oscillation death region and compare it with the numerical boundary,\nfinding a close match. Furthermore, we discover that the presence of shear\nleads to the emergence of symmetry-breaking dynamical states, specifically\ninhomogeneous oscillation death states and oscillatory cluster states under\nnonlocal coupling interaction.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:30:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Premalatha","K.",""],["Chandrasekar","V K",""],["Senthilkumar","L.",""],["Lakshmanan","M.",""]]}
{"id":"2308.09417","submitter":"Chris Hays","authors":"Simone Amoroso, Nansi Andari, William Barter, Josh Bendavid, Maarten\n  Boonekamp, Stephen Farry, Martin Gruenewald, Chris Hays, Ross Hunter, Jan\n  Kretzschmar, Oliver Lupton, Martina Pili, Miguel Ramos Pernas, Boris\n  Tuchming, Mika Vesterinen, Alessandro Vicini, Chen Wang, Menglin Xu","title":"Compatibility and combination of world W-boson mass measurements","comments":"Submitted to EPJC","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The compatibility of W-boson mass measurements performed by the ATLAS, LHCb,\nCDF, and D0 experiments is studied using a coherent framework with theory\nuncertainty correlations. The measurements are combined using a number of\nrecent sets of parton distribution functions (PDF), and are further combined\nwith the average value of measurements from the Large Electron-Positron\ncollider. The considered PDF sets generally have a low compatibility with a\nsuite of global rapidity-sensitive Drell-Yan measurements. The most compatible\nset is CT18 due to its larger uncertainties. A combination of all mW\nmeasurements yields a value of mW = 80394.6 +- 11.5 MeV with the CT18 set, but\nhas a probability of compatibility of 0.5% and is therefore disfavoured.\nCombinations are performed removing each measurement individually, and a 91%\nprobability of compatibility is obtained when the CDF measurement is removed.\nThe corresponding value of the W boson mass is 80369.2 +- 13.3 MeV, which\ndiffers by 3.6 sigma from the CDF value determined using the same PDF set.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:33:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Amoroso","Simone",""],["Andari","Nansi",""],["Barter","William",""],["Bendavid","Josh",""],["Boonekamp","Maarten",""],["Farry","Stephen",""],["Gruenewald","Martin",""],["Hays","Chris",""],["Hunter","Ross",""],["Kretzschmar","Jan",""],["Lupton","Oliver",""],["Pili","Martina",""],["Pernas","Miguel Ramos",""],["Tuchming","Boris",""],["Vesterinen","Mika",""],["Vicini","Alessandro",""],["Wang","Chen",""],["Xu","Menglin",""]]}
{"id":"2308.09418","submitter":"Kiyoshi Takeuchi","authors":"Kiyoshi Takeuchi","title":"Geometric monodromies, mixed Hodge numbers of motivic Milnor fibers and\n  Newton polyhedra","comments":"65 pages, revised, an expository paper written for Volume VI of the\n  Handbook of Geometry and Topology of Singularities","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce the theory of geometric monodromies in various situations,\nfocusing on its relations with toric geometry and motivic Milnor fibers, and\nmoreover in the modern languages of nearby and vanishing cycle sheaves.\nEquivariant mixed Hodge numbers of motivic Milnor fibers will be described in\nterms of Newton polyhedra of polynomials.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:34:14 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 14:18:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Takeuchi","Kiyoshi",""]]}
{"id":"2308.09419","submitter":"Peilin Zhou","authors":"Peilin Zhou, Qichen Ye, Yueqi Xie, Jingqi Gao, Shoujin Wang, Jae Boum\n  Kim, Chenyu You and Sunghun Kim","title":"Attention Calibration for Transformer-based Sequential Recommendation","comments":"Accepted by CIKM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer-based sequential recommendation (SR) has been booming in recent\nyears, with the self-attention mechanism as its key component. Self-attention\nhas been widely believed to be able to effectively select those informative and\nrelevant items from a sequence of interacted items for next-item prediction via\nlearning larger attention weights for these items. However, this may not always\nbe true in reality. Our empirical analysis of some representative\nTransformer-based SR models reveals that it is not uncommon for large attention\nweights to be assigned to less relevant items, which can result in inaccurate\nrecommendations. Through further in-depth analysis, we find two factors that\nmay contribute to such inaccurate assignment of attention weights: sub-optimal\nposition encoding and noisy input. To this end, in this paper, we aim to\naddress this significant yet challenging gap in existing works. To be specific,\nwe propose a simple yet effective framework called Attention Calibration for\nTransformer-based Sequential Recommendation (AC-TSR). In AC-TSR, a novel\nspatial calibrator and adversarial calibrator are designed respectively to\ndirectly calibrates those incorrectly assigned attention weights. The former is\ndevised to explicitly capture the spatial relationships (i.e., order and\ndistance) among items for more precise calculation of attention weights. The\nlatter aims to redistribute the attention weights based on each item's\ncontribution to the next-item prediction. AC-TSR is readily adaptable and can\nbe seamlessly integrated into various existing transformer-based SR models.\nExtensive experimental results on four benchmark real-world datasets\ndemonstrate the superiority of our proposed ACTSR via significant\nrecommendation performance enhancements. The source code is available at\nhttps://github.com/AIM-SE/AC-TSR.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:38:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhou","Peilin",""],["Ye","Qichen",""],["Xie","Yueqi",""],["Gao","Jingqi",""],["Wang","Shoujin",""],["Kim","Jae Boum",""],["You","Chenyu",""],["Kim","Sunghun",""]]}
{"id":"2308.09420","submitter":"Marco Rehmeier","authors":"Marco Rehmeier","title":"Weighted $L^1$-semigroup approach for nonlinear Fokker--Planck equations\n  and generalized Ornstein--Uhlenbeck processes","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the nonlinear Fokker--Planck equation $$\\partial_tu =\n\\Delta\\beta(u)-\\nabla \\Phi \\cdot \\nabla \\beta(u) -\ndiv_{\\varrho}\\big(D(x)b(u)u\\big),\\quad (t,x) \\in (0,\\infty)\\times\n\\mathbb{R}^d,$$ where $\\varrho = \\exp(-\\Phi)$ is the density of a finite Borel\nmeasure and $\\nabla \\Phi$ is unbounded, we construct mild solutions with\nbounded initial data via the Crandall--Liggett semigroup approach in the\nweighted space $L^1(\\mathbb{R}^d,\\mathbb{R};\\varrho dx)$. By the superposition\nprinciple, we lift these solutions to weak solutions to the corresponding\nMcKean--Vlasov SDE, which can be considered a model for generalized nonlinear\nperturbed Ornstein--Uhlenbeck processes. Finally, for these solutions we prove\nthe nonlinear Markov property in the sense of McKean.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:39:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rehmeier","Marco",""]]}
{"id":"2308.09421","submitter":"Junkai Xu","authors":"Junkai Xu, Liang Peng, Haoran Cheng, Hao Li, Wei Qian, Ke Li, Wenxiao\n  Wang, Deng Cai","title":"MonoNeRD: NeRF-like Representations for Monocular 3D Object Detection","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":"  In the field of monocular 3D detection, it is common practice to utilize\nscene geometric clues to enhance the detector's performance. However, many\nexisting works adopt these clues explicitly such as estimating a depth map and\nback-projecting it into 3D space. This explicit methodology induces sparsity in\n3D representations due to the increased dimensionality from 2D to 3D, and leads\nto substantial information loss, especially for distant and occluded objects.\nTo alleviate this issue, we propose MonoNeRD, a novel detection framework that\ncan infer dense 3D geometry and occupancy. Specifically, we model scenes with\nSigned Distance Functions (SDF), facilitating the production of dense 3D\nrepresentations. We treat these representations as Neural Radiance Fields\n(NeRF) and then employ volume rendering to recover RGB images and depth maps.\nTo the best of our knowledge, this work is the first to introduce volume\nrendering for M3D, and demonstrates the potential of implicit reconstruction\nfor image-based 3D perception. Extensive experiments conducted on the KITTI-3D\nbenchmark and Waymo Open Dataset demonstrate the effectiveness of MonoNeRD.\nCodes are available at https://github.com/cskkxjk/MonoNeRD.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:39:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Junkai",""],["Peng","Liang",""],["Cheng","Haoran",""],["Li","Hao",""],["Qian","Wei",""],["Li","Ke",""],["Wang","Wenxiao",""],["Cai","Deng",""]]}
{"id":"2308.09422","submitter":"Kornelija Passek-Kumericki","authors":"K. Passek-Kumericki","title":"Deeply-virtual and photoproduction of mesons at higher-order and\n  higher-twist","comments":"10 pages, 5 figures; Presented at XXIX Cracow Epiphany Conference on\n  Physics at the Electron-Ion Collider and Future Facilities, Cracow, Poland,\n  16-19 January 2023, to appear in Acta Physica Polonica B Supplemet","journal-ref":null,"doi":null,"report-no":"RBI-ThPhys-2023-26","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Both deeply-virtual and photoproduction of mesons offer promising access to\ngeneralized parton distributions and complementary description of different\nkinematical regions. The higher-order contributions offer stabilizing effect\nwith respect to the dependence on renormalization scales, while higher-twist\neffects have been identified as especially important in the case of the\nproduction of pseudo-scalar mesons. This was confirmed by recent evaluation of\nthe complete twist-3 contribution to $\\pi$ and $\\eta$/$\\eta'$ photoproduction\nand its confrontation with experimental data.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:41:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Passek-Kumericki","K.",""]]}
{"id":"2308.09423","submitter":"Andreas Langer","authors":"Andreas Langer","title":"Overconvergent prismatic cohomology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note I define an overconvergent version of prisms and prismatic\ncohomology as introduced by Bhatt and Scholze and show that overconvergent\nprismatic cohomology specialises to $p$-adic cohomologies, like\nMonsky-Washnitzer resp. rigid cohomology for smooth varieties over a perfect\nfield, the de Rham cohomology of smooth weak formal schemes over a perfectoid\nring and the \\'{e}tale cohomology of its generic fibre. Besides, I give an\noverconvergent version of the complex $A\\Omega$ of Bhatt-Morrow-Scholze and\nrelate it to overconvergent prismatic cohomology.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:45:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Langer","Andreas",""]]}
{"id":"2308.09424","submitter":"Viktorija Paneva","authors":"Naga Sai Surya Vamsy Malladi, Viktorija Paneva, J\\\"org M\\\"uller","title":"Feel the Breeze: Promoting Relaxation in Virtual Reality using Mid-Air\n  Haptics","comments":"5 pages, 6 figures. This is the author's version. Final version of\n  records is to appear in 2023 IEEE International Symposium on Mixed and\n  Augmented Reality Adjunct (ISMAR-Adjunct)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mid-air haptic interfaces employ focused ultrasound waves to generate\ntouchless haptic sensations on the skin. Prior studies have demonstrated the\npotential positive impact of mid-air haptic feedback on virtual experiences,\nenhancing aspects such as enjoyment, immersion, and sense of agency. As a\nhighly immersive environment, Virtual Reality (VR) is being explored as a tool\nfor stress management and relaxation in current research. However, the impact\nof incorporating mid-air haptic stimuli into relaxing experiences in VR has not\nbeen studied thus far. In this paper, for the first time, we design a mid-air\nhaptic stimulation that is congruent with a relaxing scene in VR, and conduct a\nuser study investigating the effectiveness of this experience. Our user study\nencompasses three different conditions: a control group with no relaxation\nintervention, a VR-only relaxation experience, and a VR+Haptics relaxation\nexperience that includes the mid-air haptic feedback. While we did not find any\nsignificant differences between the conditions, a trend suggesting that the\nVR+Haptics condition might be associated with greater pleasure emerged,\nrequiring further validation with a larger sample size. These initial findings\nset the foundation for future investigations into leveraging multimodal\ninterventions in VR, utilising mid-air haptics to potentially enhance\nrelaxation experiences.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:45:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Malladi","Naga Sai Surya Vamsy",""],["Paneva","Viktorija",""],["M\u00fcller","J\u00f6rg",""]]}
{"id":"2308.09425","submitter":"Heloise Constantin","authors":"H\\'elo\\\"ise Constantin","title":"Sampling Random Cycle-Rooted Spanning Forests on Infinite Graphs","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On a finite graph, there is a natural family of Boltzmann probability\nmeasures on cycle-rooted spanning forests, parametrized by weights on cycles.\nFor a certain subclass of those weights, we construct Gibbs measures in\ninfinite volume, as limits of probability measures on cycle-rooted spanning\nforests of increasing sequences of finite graphs. Those probability measures\nextend the family of already known random spanning forests and can be sampled\nby a random walks algorithm which generalizes Wilson's algorithm. We show that,\nunlike for uniform spanning forests, almost surely, all connected components\nare finite and two-points correlations decrease exponentially fast with the\ndistance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:49:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Constantin","H\u00e9lo\u00efse",""]]}
{"id":"2308.09426","submitter":"Mikhail Papkov","authors":"Mikhail Papkov, Kaupo Palo, Leopold Parts","title":"Self-Supervised Single-Image Deconvolution with Siamese Neural Networks","comments":"Accepted for DALI @ MICCAI 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":"  Inverse problems in image reconstruction are fundamentally complicated by\nunknown noise properties. Classical iterative deconvolution approaches amplify\nnoise and require careful parameter selection for an optimal trade-off between\nsharpness and grain. Deep learning methods allow for flexible parametrization\nof the noise and learning its properties directly from the data. Recently,\nself-supervised blind-spot neural networks were successfully adopted for image\ndeconvolution by including a known point-spread function in the end-to-end\ntraining. However, their practical application has been limited to 2D images in\nthe biomedical domain because it implies large kernels that are poorly\noptimized. We tackle this problem with Fast Fourier Transform convolutions that\nprovide training speed-up in 3D microscopy deconvolution tasks. Further, we\npropose to adopt a Siamese invariance loss for deconvolution and empirically\nidentify its optimal position in the neural network between blind-spot and full\nimage branches. The experimental results show that our improved framework\noutperforms the previous state-of-the-art deconvolution methods with a known\npoint spread function.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:51:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Papkov","Mikhail",""],["Palo","Kaupo",""],["Parts","Leopold",""]]}
{"id":"2308.09427","submitter":"Aya Ishihara","authors":"Aya Ishihara (for the IceCube-Gen2 Collaboration)","title":"The next generation neutrino telescope: 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-994","categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Neutrino Observatory, a cubic-kilometer-scale neutrino detector\nat the geographic South Pole, has reached a number of milestones in the field\nof neutrino astrophysics: the discovery of a high-energy astrophysical neutrino\nflux, the temporal and directional correlation of neutrinos with a flaring\nblazar, and a steady emission of neutrinos from the direction of an active\ngalaxy of a Seyfert II type and the Milky Way. The next generation neutrino\ntelescope, IceCube-Gen2, currently under development, will consist of three\nessential components: an array of about 10,000 optical sensors, embedded within\napproximately 8 cubic kilometers of ice, for detecting neutrinos with energies\nof TeV and above, with a sensitivity five times greater than that of IceCube; a\nsurface array with scintillation panels and radio antennas targeting air\nshowers; and buried radio antennas distributed over an area of more than 400\nsquare kilometers to significantly enhance the sensitivity of detecting\nneutrino sources beyond EeV. This contribution describes the design and status\nof IceCube-Gen2 and discusses the expected sensitivity from the simulations of\nthe optical, surface, and radio components.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:54:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ishihara","Aya","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.09428","submitter":"Firas Ben Ramdhane","authors":"Firas Ben Ramdhane (I2M, AMU), Pierre Guillon (I2M, AMU, CNRS)","title":"Dill maps in the Weyl-like space associated to the Levenshtein distance","comments":null,"journal-ref":"Automata 2023, IFIP Working Group 1.5, Aug 2023, Trieste (Italy),\n  Italy","doi":null,"report-no":null,"categories":"cs.DM math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Weyl pseudo-metric is a shift-invariant pseudo-metric over the set of\ninfinite sequences, that enjoys interesting properties and is suitable for\nstudying the dynamics of cellular automata. It corresponds to the asymptotic\nbehavior of the Hamming distance on longer and longer subwords. In this paper\nwe characterize well-defined dill maps (which are a generalization of cellular\nautomata and substitutions) in the Weyl space and the sliding Feldman-Katok\nspace where the Hamming distance appearing in the Weyl pseudo-metrics is\nreplaced by the Levenshtein distance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:56:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ramdhane","Firas Ben","","I2M, AMU"],["Guillon","Pierre","","I2M, AMU, CNRS"]]}
{"id":"2308.09429","submitter":"Gaetan Simian","authors":"David Cimasoni, Gaetan Simian","title":"On Arf invariants of colored links","comments":"15 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Several classical knot invariants, such as the Alexander polynomial, the\nLevine-Tristram signature and the Blanchfield pairing, admit natural extensions\nfrom knots to links, and more generally, from oriented links to so-called\ncolored links. In this note, we explore such extensions of the Arf invariant.\nInspired by the three examples stated above, we use generalized Seifert forms\nto construct quadratic forms, and determine when the Arf invariant of such a\nform yields a well-defined invariant of colored links. However, apart from the\nknown case of oriented links, these new Arf invariants turn out to be\ndetermined by the linking numbers.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:59:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cimasoni","David",""],["Simian","Gaetan",""]]}
{"id":"2308.09430","submitter":"Xiaoge Deng","authors":"Xiaoge Deng, Li Shen, Shengwei Li, Tao Sun, Dongsheng Li, and Dacheng\n  Tao","title":"Towards Understanding the Generalizability of Delayed Stochastic\n  Gradient Descent","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic gradient descent (SGD) performed in an asynchronous manner plays a\ncrucial role in training large-scale machine learning models. However, the\ngeneralization performance of asynchronous delayed SGD, which is an essential\nmetric for assessing machine learning algorithms, has rarely been explored.\nExisting generalization error bounds are rather pessimistic and cannot reveal\nthe correlation between asynchronous delays and generalization. In this paper,\nwe investigate sharper generalization error bound for SGD with asynchronous\ndelay $\\tau$. Leveraging the generating function analysis tool, we first\nestablish the average stability of the delayed gradient algorithm. Based on\nthis algorithmic stability, we provide upper bounds on the generalization error\nof $\\tilde{\\mathcal{O}}(\\frac{T-\\tau}{n\\tau})$ and\n$\\tilde{\\mathcal{O}}(\\frac{1}{n})$ for quadratic convex and strongly convex\nproblems, respectively, where $T$ refers to the iteration number and $n$ is the\namount of training data. Our theoretical results indicate that asynchronous\ndelays reduce the generalization error of the delayed SGD algorithm. Analogous\nanalysis can be generalized to the random delay setting, and the experimental\nresults validate our theoretical findings.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:00:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Deng","Xiaoge",""],["Shen","Li",""],["Li","Shengwei",""],["Sun","Tao",""],["Li","Dongsheng",""],["Tao","Dacheng",""]]}
{"id":"2308.09431","submitter":"Tim Kietzmann","authors":"Zejin Lu, Adrien Doerig, Victoria Bosch, Bas Krahmer, Daniel Kaiser,\n  Radoslaw M Cichy, Tim C Kietzmann","title":"End-to-end topographic networks as models of cortical map formation and\n  human visual behaviour: moving beyond convolutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational models are an essential tool for understanding the origin and\nfunctions of the topographic organisation of the primate visual system. Yet,\nvision is most commonly modelled by convolutional neural networks that ignore\ntopography by learning identical features across space. Here, we overcome this\nlimitation by developing All-Topographic Neural Networks (All-TNNs). Trained on\nvisual input, several features of primate topography emerge in All-TNNs: smooth\norientation maps and cortical magnification in their first layer, and\ncategory-selective areas in their final layer. In addition, we introduce a\nnovel dataset of human spatial biases in object recognition, which enables us\nto directly link models to behaviour. We demonstrate that All-TNNs\nsignificantly better align with human behaviour than previous state-of-the-art\nconvolutional models due to their topographic nature. All-TNNs thereby mark an\nimportant step forward in understanding the spatial organisation of the visual\nbrain and how it mediates visual behaviour.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:03:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Zejin",""],["Doerig","Adrien",""],["Bosch","Victoria",""],["Krahmer","Bas",""],["Kaiser","Daniel",""],["Cichy","Radoslaw M",""],["Kietzmann","Tim C",""]]}
{"id":"2308.09432","submitter":"Lukas Trottner","authors":"Leif D\\\"oring, Lukas Trottner and Alexander R. Watson","title":"Markov additive friendships","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Wiener--Hopf factorisation of a L\\'evy or Markov additive process\ndescribes the way that it attains new maxima and minima in terms of a pair of\nso-called ladder height processes. Vigon's theory of friendship for L\\'evy\nprocesses addresses the inverse problem: when does a process exist which has\ncertain prescribed ladder height processes? We give a complete answer to this\nproblem for Markov additive processes, provide simpler sufficient conditions\nfor constructing processes using friendship, and address in part the question\nof the uniqueness of the Wiener--Hopf factorisation for Markov additive\nprocesses.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:04:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["D\u00f6ring","Leif",""],["Trottner","Lukas",""],["Watson","Alexander R.",""]]}
{"id":"2308.09433","submitter":"Vanessa Gonzalez Duque","authors":"Vanessa Gonzalez Duque, Leonhard Zirus, Yordanka Velikova, Nassir\n  Navab, and Diana Mateus","title":"Can ultrasound confidence maps predict sonographers' labeling\n  variability?","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":"  Measuring cross-sectional areas in ultrasound images is a standard tool to\nevaluate disease progress or treatment response. Often addressed today with\nsupervised deep-learning segmentation approaches, existing solutions highly\ndepend upon the quality of experts' annotations. However, the annotation\nquality in ultrasound is anisotropic and position-variant due to the inherent\nphysical imaging principles, including attenuation, shadows, and missing\nboundaries, commonly exacerbated with depth. This work proposes a novel\napproach that guides ultrasound segmentation networks to account for\nsonographers' uncertainties and generate predictions with variability similar\nto the experts. We claim that realistic variability can reduce overconfident\npredictions and improve physicians' acceptance of deep-learning cross-sectional\nsegmentation solutions. Our method provides CM's certainty for each pixel for\nminimal computational overhead as it can be precalculated directly from the\nimage. We show that there is a correlation between low values in the confidence\nmaps and expert's label uncertainty. Therefore, we propose to give the\nconfidence maps as additional information to the networks. We study the effect\nof the proposed use of ultrasound CMs in combination with four state-of-the-art\nneural networks and in two configurations: as a second input channel and as\npart of the loss. We evaluate our method on 3D ultrasound datasets of the\nthyroid and lower limb muscles. Our results show ultrasound CMs increase the\nDice score, improve the Hausdorff and Average Surface Distances, and decrease\nthe number of isolated pixel predictions. Furthermore, our findings suggest\nthat ultrasound CMs improve the penalization of uncertain areas in the ground\ntruth data, thereby improving problematic interpolations. Our code and example\ndata will be made public at\nhttps://github.com/IFL-CAMP/Confidence-segmentation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:07:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Duque","Vanessa Gonzalez",""],["Zirus","Leonhard",""],["Velikova","Yordanka",""],["Navab","Nassir",""],["Mateus","Diana",""]]}
{"id":"2308.09434","submitter":"Hannah Comiskey","authors":"Hannah Comiskey and Niamh Cahill","title":"mcmsupply: An R Package for Estimating Contraceptive Method Market\n  Supply Shares","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce the R package mcmsupply which implements Bayesian\nhierarchical models for estimating and projecting modern contraceptive market\nsupply shares over time. The package implements four model types. These models\nvary by the administration level of their outcome estimates (national or\nsubnational estimates) and dataset type utilised in the estimation\n(multi-country or single-country contraceptive market supply datasets).\nmcmsupply contains a compilation of national and subnational level\ncontraceptive source datasets, generated by IPUMS and Demographic and Health\nSurvey microdata. We describe the functions that implement the models through\npractical examples. The annual estimates and projections with uncertainty of\nthe contraceptive market supply, produced by mcmcsupply at a national and\nsubnational level, are the first of their kind. These estimates and projections\nhave diverse applications, including acting as an indicator of family planning\nmarket stability over time and being utilised in the calculation of estimates\nof modern contraceptive use.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:07:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Comiskey","Hannah",""],["Cahill","Niamh",""]]}
{"id":"2308.09435","submitter":"Alena Fenogenova Ms","authors":"Nikita Martynov, Mark Baushenko, Anastasia Kozlova, Katerina\n  Kolomeytseva, Aleksandr Abramov, Alena Fenogenova","title":"A Methodology for Generative Spelling Correction via Natural Spelling\n  Errors Emulation across Multiple Domains and Languages","comments":"to appear in EACL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern large language models demonstrate impressive capabilities in text\ngeneration and generalization. However, they often struggle with solving text\nediting tasks, particularly when it comes to correcting spelling errors and\nmistypings. In this paper, we present a methodology for generative spelling\ncorrection (SC), which was tested on English and Russian languages and\npotentially can be extended to any language with minor changes. Our research\nmainly focuses on exploring natural spelling errors and mistypings in texts and\nstudying the ways those errors can be emulated in correct sentences to\neffectively enrich generative models' pre-train procedure. We investigate the\nimpact of such emulations and the models' abilities across different text\ndomains. In this work, we investigate two spelling corruption techniques: 1)\nfirst one mimics human behavior when making a mistake through leveraging\nstatistics of errors from particular dataset and 2) second adds the most common\nspelling errors, keyboard miss clicks, and some heuristics within the texts. We\nconducted experiments employing various corruption strategies, models'\narchitectures and sizes on the pre-training and fine-tuning stages and\nevaluated the models using single-domain and multi-domain test sets. As a\npractical outcome of our work, we introduce SAGE (Spell checking via\nAugmentation and Generative distribution Emulation) is a library for automatic\ngenerative SC that includes a family of pre-trained generative models and\nbuilt-in augmentation algorithms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:07:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Martynov","Nikita",""],["Baushenko","Mark",""],["Kozlova","Anastasia",""],["Kolomeytseva","Katerina",""],["Abramov","Aleksandr",""],["Fenogenova","Alena",""]]}
{"id":"2308.09436","submitter":"Nikolas Ebert","authors":"Nikolas Ebert, Didier Stricker, Oliver Wasenm\\\"uller","title":"Transformer-based Detection of Microorganisms on High-Resolution Petri\n  Dish Images","comments":"This paper has been accepted at IEEE International Conference on\n  Computer Vision Workshops (ICCV workshop), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many medical or pharmaceutical processes have strict guidelines regarding\ncontinuous hygiene monitoring. This often involves the labor-intensive task of\nmanually counting microorganisms in Petri dishes by trained personnel.\nAutomation attempts often struggle due to major challenges: significant scaling\ndifferences, low separation, low contrast, etc. To address these challenges, we\nintroduce AttnPAFPN, a high-resolution detection pipeline that leverages a\nnovel transformer variation, the efficient-global self-attention mechanism. Our\nstreamlined approach can be easily integrated in almost any multi-scale object\ndetection pipeline. In a comprehensive evaluation on the publicly available\nAGAR dataset, we demonstrate the superior accuracy of our network over the\ncurrent state-of-the-art. In order to demonstrate the task-independent\nperformance of our approach, we perform further experiments on COCO and\nLIVECell datasets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:07:38 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:32:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ebert","Nikolas",""],["Stricker","Didier",""],["Wasenm\u00fcller","Oliver",""]]}
{"id":"2308.09437","submitter":"Frederik Pahde","authors":"Maximilian Dreyer, Frederik Pahde, Christopher J. Anders, Wojciech\n  Samek, Sebastian Lapuschkin","title":"From Hope to Safety: Unlearning Biases of Deep Models by Enforcing the\n  Right Reasons in Latent Space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Neural Networks are prone to learning spurious correlations embedded in\nthe training data, leading to potentially biased predictions. This poses risks\nwhen deploying these models for high-stake decision-making, such as in medical\napplications. Current methods for post-hoc model correction either require\ninput-level annotations, which are only possible for spatially localized\nbiases, or augment the latent feature space, thereby hoping to enforce the\nright reasons. We present a novel method ensuring the right reasons on the\nconcept level by reducing the model's sensitivity towards biases through the\ngradient. When modeling biases via Concept Activation Vectors, we highlight the\nimportance of choosing robust directions, as traditional regression-based\napproaches such as Support Vector Machines tend to result in diverging\ndirections. We effectively mitigate biases in controlled and real-world\nsettings on the ISIC, Bone Age, ImageNet and CelebA datasets using VGG, ResNet\nand EfficientNet architectures.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:07:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dreyer","Maximilian",""],["Pahde","Frederik",""],["Anders","Christopher J.",""],["Samek","Wojciech",""],["Lapuschkin","Sebastian",""]]}
{"id":"2308.09438","submitter":"Michael Unterkalmsteiner","authors":"Carmine Giardino, Nicol\\`o Paternoster, Michael Unterkalmsteiner, Tony\n  Gorschek, Pekka Abrahamsson","title":"Software Development in Startup Companies: The Greenfield Startup Model","comments":null,"journal-ref":"IEEE Trans. Software Eng. 42(6): 585-604 (2016)","doi":"10.1109/TSE.2015.2509970","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Software startups are newly created companies with no operating history and\noriented towards producing cutting-edge products. However, despite the\nincreasing importance of startups in the economy, few scientific studies\nattempt to address software engineering issues, especially for early-stage\nstartups. If anything, startups need engineering practices of the same level or\nbetter than those of larger companies, as their time and resources are more\nscarce, and one failed project can put them out of business. In this study we\naim to improve understanding of the software development strategies employed by\nstartups. We performed this state-of-practice investigation using a grounded\ntheory approach. We packaged the results in the Greenfield Startup Model (GSM),\nwhich explains the priority of startups to release the product as quickly as\npossible. This strategy allows startups to verify product and market fit, and\nto adjust the product trajectory according to early collected user feedback.\nThe need to shorten time-to-market, by speeding up the development through\nlow-precision engineering activities, is counterbalanced by the need to\nrestructure the product before targeting further growth. The resulting\nimplications of the GSM outline challenges and gaps, pointing out opportunities\nfor future research to develop and validate engineering practices in the\nstartup context.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:08:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Giardino","Carmine",""],["Paternoster","Nicol\u00f2",""],["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""],["Abrahamsson","Pekka",""]]}
{"id":"2308.09439","submitter":"Jadav Mandal","authors":"A. Gogoi and J. C. Mandal","title":"A low Diffusion HLL-CPS Scheme for all Mach number flows","comments":"arXiv admin note: text overlap with arXiv:2207.06830","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":"  A low diffusion version of the HLL-CPS scheme for resolving the shear layers\nand the flow features at low Mach numbers is presented here. The low diffusion\nHLL-CPS scheme is obtained by reconstructing the velocities at the cell\ninterface with the face normal Mach number and a pressure function. Asymptotic\nanalysis of the modified scheme shows a correct scaling of the pressure at low\nMach numbers and a significant reduction in numerical dissipation. The\nrobustness of the HLL-CPS scheme for strong shock is improved by reducing the\ncontribution of the contact wave in the vicinity of the shock. The improvement\nin robustness for strong shock is demonstrated analytically through linear\nperturbation and matrix stability analyses. A set of numerical test cases are\nsolved to demonstrate the efficacy of the proposed scheme over a wide range of\nMach numbers.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:08:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gogoi","A.",""],["Mandal","J. C.",""]]}
{"id":"2308.09440","submitter":"Tal Kadosh","authors":"Tal Kadosh, Niranjan Hasabnis, Vy A. Vo, Nadav Schneider, Neva Krien,\n  Abdul Wasay, Nesreen Ahmed, Ted Willke, Guy Tamir, Yuval Pinter, Timothy\n  Mattson, and Gal Oren","title":"Scope is all you need: Transforming LLMs for HPC Code","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With easier access to powerful compute resources, there is a growing trend in\nthe field of AI for software development to develop larger and larger language\nmodels (LLMs) to address a variety of programming tasks. Even LLMs applied to\ntasks from the high-performance computing (HPC) domain are huge in size (e.g.,\nbillions of parameters) and demand expensive compute resources for training. We\nfound this design choice confusing - why do we need large LLMs trained on\nnatural languages and programming languages unrelated to HPC for HPC-specific\ntasks? In this line of work, we aim to question design choices made by existing\nLLMs by developing smaller LLMs for specific domains - we call them\ndomain-specific LLMs. Specifically, we start off with HPC as a domain and\npropose a novel tokenizer named Tokompiler, designed specifically for\npreprocessing code in HPC and compilation-centric tasks. Tokompiler leverages\nknowledge of language primitives to generate language-oriented tokens,\nproviding a context-aware understanding of code structure while avoiding human\nsemantics attributed to code structures completely. We applied Tokompiler to\npre-train two state-of-the-art models, SPT-Code and Polycoder, for a Fortran\ncode corpus mined from GitHub. We evaluate the performance of these models\nagainst the conventional LLMs. Results demonstrate that Tokompiler\nsignificantly enhances code completion accuracy and semantic understanding\ncompared to traditional tokenizers in normalized-perplexity tests, down to ~1\nperplexity score. This research opens avenues for further advancements in\ndomain-specific LLMs, catering to the unique demands of HPC and compilation\ntasks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:12:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kadosh","Tal",""],["Hasabnis","Niranjan",""],["Vo","Vy A.",""],["Schneider","Nadav",""],["Krien","Neva",""],["Wasay","Abdul",""],["Ahmed","Nesreen",""],["Willke","Ted",""],["Tamir","Guy",""],["Pinter","Yuval",""],["Mattson","Timothy",""],["Oren","Gal",""]]}
{"id":"2308.09441","submitter":"Markus Sch\\\"oller","authors":"S. Hubrig, S.P. Jarvinen, J.D. Alvarado-Gomez, I. Ilyin, M. Sch\\\"oller","title":"Searching for magnetic fields in pulsating A-type stars: the discovery\n  of a strong field in the probable delta Sct star HD340577 and a null result\n  for the gamma Dor star HR8799","comments":"5 pages, 4 figures, accepted for publication as a letter to MNRAS","journal-ref":null,"doi":"10.1093/mnrasl/slad116","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Numerous delta Sct and gamma Dor pulsators are identified in the region of\nthe Hertzsprung-Russell diagram that is occupied by chemically peculiar\nmagnetic Ap stars. The connection between delta Sct and gamma Dor pulsations\nand the magnetic field in Ap stars is however not clear: theory suggests for\nmagnetic Ap stars some critical field strengths for pulsation mode suppression\nby computing the magnetic damping effect for selected p and g modes. To test\nthese theoretical considerations, we obtained PEPSI spectropolarimetric\nsnapshots of the typical Ap star HD340577, for which delta Sct-like pulsations\nwere recently detected in TESS data, and the gamma Dor pulsator HR8799, which\nis a remarkable system with multiple planets and two debris disks. Our\nmeasurements reveal the presence of a magnetic field with a strength of several\nhundred Gauss in HD340577. The measured mean longitudinal field would be the\nstrongest field measured so far in a delta Sct star if the pulsational\ncharacter of HD340577 is confirmed spectroscopically. No magnetic field is\ndetected in HR8799.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:12:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hubrig","S.",""],["Jarvinen","S. P.",""],["Alvarado-Gomez","J. D.",""],["Ilyin","I.",""],["Sch\u00f6ller","M.",""]]}
{"id":"2308.09442","submitter":"Jiahuan Zhang","authors":"Yizhen Luo, Jiahuan Zhang, Siqi Fan, Kai Yang, Yushuai Wu, Mu Qiao,\n  Zaiqing Nie","title":"BioMedGPT: Open Multimodal Generative Pre-trained Transformer for\n  BioMedicine","comments":"12 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Foundation models (FMs) have exhibited remarkable performance across a wide\nrange of downstream tasks in many domains. Nevertheless, general-purpose FMs\noften face challenges when confronted with domain-specific problems, due to\ntheir limited access to the proprietary training data in a particular domain.\nIn biomedicine, there are various biological modalities, such as molecules,\nproteins, and cells, which are encoded by the language of life and exhibit\nsignificant modality gaps with human natural language. In this paper, we\nintroduce BioMedGPT, an open multimodal generative pre-trained transformer\n(GPT) for biomedicine, to bridge the gap between the language of life and human\nnatural language. BioMedGPT allows users to easily ``communicate'' with diverse\nbiological modalities through free text, which is the first of its kind.\nBioMedGPT aligns different biological modalities with natural language via a\nlarge generative language model, namely, BioMedGPT-LM. We publish\nBioMedGPT-10B, which unifies the feature spaces of molecules, proteins, and\nnatural language via encoding and alignment. Through fine-tuning, BioMedGPT-10B\noutperforms or is on par with human and significantly larger general-purpose\nfoundation models on the biomedical QA task. It also demonstrates promising\nperformance in the molecule QA and protein QA tasks, which could greatly\naccelerate the discovery of new drugs and therapeutic targets. In addition,\nBioMedGPT-LM-7B is the first large generative language model based on Llama2 in\nthe biomedical domain, therefore is commercial friendly. Both BioMedGPT-10B and\nBioMedGPT-LM-7B are open-sourced to the research community. In addition, we\npublish the datasets that are meticulously curated for the alignment of\nmulti-modalities, i.e., PubChemQA and UniProtQA. All the models, codes, and\ndatasets are available at \\url{https://github.com/PharMolix/OpenBioMed}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:14:35 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 07:49:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Yizhen",""],["Zhang","Jiahuan",""],["Fan","Siqi",""],["Yang","Kai",""],["Wu","Yushuai",""],["Qiao","Mu",""],["Nie","Zaiqing",""]]}
{"id":"2308.09443","submitter":"Veronique Bruyere","authors":"Thomas Brihaye and V\\'eronique Bruy\\`ere and Gaspard Reghem","title":"Quantitative Reachability Stackelberg-Pareto Synthesis is\n  NEXPTIME-Complete","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we deepen the study of two-player Stackelberg games played on\ngraphs in which Player $0$ announces a strategy and Player $1$, having several\nobjectives, responds rationally by following plays providing him Pareto-optimal\npayoffs given the strategy of Player $0$. The Stackelberg-Pareto synthesis\nproblem, asking whether Player $0$ can announce a strategy which satisfies his\nobjective, whatever the rational response of Player $1$, has been recently\ninvestigated for $\\omega$-regular objectives. We solve this problem for\nweighted graph games and quantitative reachability objectives such that Player\n$0$ wants to reach his target set with a total cost less than some given upper\nbound. We show that it is NEXPTIME-complete, as for Boolean reachability\nobjectives.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:17:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brihaye","Thomas",""],["Bruy\u00e8re","V\u00e9ronique",""],["Reghem","Gaspard",""]]}
{"id":"2308.09444","submitter":"Xuan Wu","authors":"Weiguo Lu, Xuan Wu, Deng Ding, Gangnan Yuan","title":"An Efficient 1 Iteration Learning Algorithm for Gaussian Mixture Model\n  And Gaussian Mixture Embedding For Neural Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an Gaussian Mixture Model (GMM) learning algorithm, based on our\nprevious work of GMM expansion idea. The new algorithm brings more robustness\nand simplicity than classic Expectation Maximization (EM) algorithm. It also\nimproves the accuracy and only take 1 iteration for learning. We theoretically\nproof that this new algorithm is guarantee to converge regardless the\nparameters initialisation. We compare our GMM expansion method with classic\nprobability layers in neural network leads to demonstrably better capability to\novercome data uncertainty and inverse problem. Finally, we test GMM based\ngenerator which shows a potential to build further application that able to\nutilized distribution random sampling for stochastic variation as well as\nvariation control.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:17:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Weiguo",""],["Wu","Xuan",""],["Ding","Deng",""],["Yuan","Gangnan",""]]}
{"id":"2308.09445","submitter":"Jose Cubero-Cascante","authors":"Jos\\'e Cubero-Cascante, Niko Zurstra{\\ss}en, J\\\"orn N\\\"oller, Rainer\n  Leupers, and Jan Moritz Joseph","title":"parti-gem5: gem5's Timing Mode Parallelised","comments":"17 pages, 9 figures, SAMOS Conference XXIII","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detailed timing models are indispensable tools for the design space\nexploration of Multiprocessor Systems on Chip (MPSoCs). As core counts continue\nto increase, the complexity in memory hierarchies and interconnect topologies\nis also growing, making accurate predictions of design decisions more\nchallenging than ever. In this context, the open-source Full System Simulator\n(FSS) gem5 is a popular choice for MPSoC design space exploration, thanks to\nits flexibility and robust set of detailed timing models. However, its\nsingle-threaded simulation kernel severely hampers its throughput. To address\nthis challenge, we introduce parti-gem5, an extension of gem5 that enables\nparallel timing simulations on modern multi-core simulation hosts. Unlike\nprevious works, parti-gem5 supports gem5's timing mode, the O3CPU, and Ruby's\ncustom cache and interconnect models. Compared to reference single-thread\nsimulations, we achieved speedups of up to 42.7x when simulating a 120-core ARM\nMPSoC on a 64-core x86-64 host system. While our method introduces timing\ndeviations, the error in total simulated time is below 15% in most cases.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:18:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cubero-Cascante","Jos\u00e9",""],["Zurstra\u00dfen","Niko",""],["N\u00f6ller","J\u00f6rn",""],["Leupers","Rainer",""],["Joseph","Jan Moritz",""]]}
{"id":"2308.09446","submitter":"Divesh Jain","authors":"Divesh Jain, Suvodip Mukherjee, Tirthankar Roy Choudhury","title":"Disentangling patchy reionization signatures from primordial\n  gravitational waves using CMB $E$-mode and $B$-mode polarization","comments":"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 detection of large angular scale $B$-mode in the Cosmic Microwave\nBackground (CMB) polarization signal will open a direct window into not only\nthe primary CMB anisotropies caused by the primordial gravitational waves (PGW)\noriginating in the epoch of inflation, but also the secondary anisotropies\nimprinted during the epoch of cosmic reionization. The existence of patchiness\nin the electron density during reionization produces a unique distortion in the\nCMB $B$-mode polarization, which can be distinguished from the PGW signal with\nthe aid of spatial frequency modes. In this work, we employ an $EB$ estimator\nby combining $E$-mode and $B$-mode polarization for the $\\tau$ power spectrum\nsignal generated in a photon-conserving semi-numerical reionization model\ncalled SCRIPT. We developed a Bayesian framework for the joint detection of the\nPGW and reionization signal from CMB observations and show the efficacy of this\ntechnique for upcoming CMB experiments. We find that, for our model, the $\\tau$\npower spectrum signal effectively tracks the inhomogeneous electron density\nfield, allowing for robust constraints on the patchy $B$-mode signal. Further,\nour results indicate that employing the $EB$ estimator for the $\\tau$ signal\nwill facilitate ground-based CMB-S4 to detect the patchy $B$-mode signal at\napproximately $\\geq 2\\sigma$ confidence level while observations with\nspace-based PICO will improve this detection to $\\geq 3\\sigma$ going as high as\n$\\geq 7\\sigma$ for extreme reionization models. These findings not only\nhighlight the future potential of these experiments to provide an improved\npicture of the reionization process but also have important implications\ntowards an unbiased measurement of $r$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:20:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jain","Divesh",""],["Mukherjee","Suvodip",""],["Choudhury","Tirthankar Roy",""]]}
{"id":"2308.09447","submitter":"Leo Herr","authors":"M\\'arton Hablicsek, Leo Herr, Francesca Leonardi","title":"Logarithmic Hochschild co/homology via formality of derived\n  intersections","comments":"45 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 define log Hochschild co/homology for log schemes that behaves well for\nsimple normal crossing pairs $(X,D)$ or toroidal singularities.\n  We prove a Hochschild-Kostant-Rosenberg isomorphism for log smooth schemes,\nas well as an equivariant version for log orbifolds. We define cyclic homology\nand compute it in simple cases. We show that log Hochschild co/homology is\ninvariant under log alterations.\n  Our main technical result in log geometry shows the tropicalization (Artin\nfan) of a product of log schemes $X \\times Y$ is usually the product of the\ntropicalizations of $X$ and $Y$. This and the machinery of \\emph{formality} of\nderived intersections facilitate a geometric approach to log Hochschild.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:21:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hablicsek","M\u00e1rton",""],["Herr","Leo",""],["Leonardi","Francesca",""]]}
{"id":"2308.09448","submitter":"Haoze Qiu","authors":"Haoze Qiu, Fei Zheng, Chaochao Chen, Xiaolin Zheng","title":"Defending Label Inference Attacks in Split Learning under Regression\n  Setting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a privacy-preserving method for implementing Vertical Federated Learning,\nSplit Learning has been extensively researched. However, numerous studies have\nindicated that the privacy-preserving capability of Split Learning is\ninsufficient. In this paper, we primarily focus on label inference attacks in\nSplit Learning under regression setting, which are mainly implemented through\nthe gradient inversion method. To defend against label inference attacks, we\npropose Random Label Extension (RLE), where labels are extended to obfuscate\nthe label information contained in the gradients, thereby preventing the\nattacker from utilizing gradients to train an attack model that can infer the\noriginal labels. To further minimize the impact on the original task, we\npropose Model-based adaptive Label Extension (MLE), where original labels are\npreserved in the extended labels and dominate the training process. The\nexperimental results show that compared to the basic defense methods, our\nproposed defense methods can significantly reduce the attack model's\nperformance while preserving the original task's performance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:22:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Qiu","Haoze",""],["Zheng","Fei",""],["Chen","Chaochao",""],["Zheng","Xiaolin",""]]}
{"id":"2308.09449","submitter":"Paolo Saracco","authors":"Johannes Berger, Paolo Saracco, Joost Vercruysse","title":"Everybody knows what a normal gabi-algebra is","comments":"40 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.CT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let A be a k-algebra over a commutative ring k. By the renowned Tannaka-Krein\nreconstruction, liftings of the monoidal structure from k-modules to A-modules\ncorrespond to bialgebra structures on A and liftings of the closed monoidal\nstructure correspond to Hopf algebra structures on A. In this paper, we\ndetermine conditions on A that correspond to liftings of the closed structure\nalone, i.e. without considering the monoidal one, which lead to the notion of\nwhat we call a gabi-algebra. First, we tackle the question from the general\nperspective of monads, then we focus on the set-theoretic and the linear\nsetting. Our main and most surprising result is that a normal gabi-algebra,\nthat is an algebra A whose category of modules is (associative and unital\nnormal) closed with closed forgetful functor to k-modules, is automatically a\nHopf algebra (thus justifying our title).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:25:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Berger","Johannes",""],["Saracco","Paolo",""],["Vercruysse","Joost",""]]}
{"id":"2308.09450","submitter":"Zhen He","authors":"Zhen He, Zhaoyang Yin","title":"Persistence property and the local well-posedness of the modified\n  Camassa-Holm equation in critical Besov 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 first establish the local well-posednesss for the Cauchy\nproblem of a modified Camassa-Holm (MOCH) equation in critical Besov spaces\n$B^{\\frac 1 p}_{p,1}$ with $1\\leq p<+\\infty.$ The obtained results improve\nconsiderably the recent result in \\cite{Luo1}. Then we show the persiscence\nproperty of MOCH.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:29:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["He","Zhen",""],["Yin","Zhaoyang",""]]}
{"id":"2308.09451","submitter":"Aur\\'elien Dersy","authors":"Aur\\'elien Dersy, Matthew D. Schwartz, Alexander Zhiboedov","title":"Reconstructing $S$-matrix Phases with Machine Learning","comments":"43 pages, 21 figures","journal-ref":null,"doi":null,"report-no":"CERN-TH-2023-161","categories":"hep-th cs.LG hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An important element of the $S$-matrix bootstrap program is the relationship\nbetween the modulus of an $S$-matrix element and its phase. Unitarity relates\nthem by an integral equation. Even in the simplest case of elastic scattering,\nthis integral equation cannot be solved analytically and numerical approaches\nare required. We apply modern machine learning techniques to studying the\nunitarity constraint. We find that for a given modulus, when a phase exists it\ncan generally be reconstructed to good accuracy with machine learning.\nMoreover, the loss of the reconstruction algorithm provides a good proxy for\nwhether a given modulus can be consistent with unitarity at all. In addition,\nwe study the question of whether multiple phases can be consistent with a\nsingle modulus, finding novel phase-ambiguous solutions. In particular, we find\na new phase-ambiguous solution which pushes the known limit on such solutions\nsignificantly beyond the previous bound.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:29:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dersy","Aur\u00e9lien",""],["Schwartz","Matthew D.",""],["Zhiboedov","Alexander",""]]}
{"id":"2308.09452","submitter":"Vladimir Zhdankin","authors":"Vladimir Zhdankin","title":"Dimensional measures of generalized entropy","comments":"16 pages, accepted for publication in Journal of Physics A: Math.\n  Theor 2023","journal-ref":null,"doi":"10.1088/1751-8121/acf175","report-no":null,"categories":"cond-mat.stat-mech math-ph math.MP physics.data-an physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Entropy is useful in statistical problems as a measure of irreversibility,\nrandomness, mixing, dispersion, and number of microstates. However, there\nremains ambiguity over the precise mathematical formulation of entropy,\ngeneralized beyond the additive definition pioneered by Boltzmann, Gibbs, and\nShannon (applicable to thermodynamic equilibria). For generalized entropies to\nbe applied rigorously to nonequilibrium statistical mechanics, we suggest that\nthere is a need for a physically interpretable (dimensional) framework that can\nbe connected to dynamical processes operating in phase space. In this work, we\nintroduce dimensional measures of entropy that admit arbitrary invertible\nweight functions (subject to curvature and convergence requirements). These\n\"dimensional entropies\" have physical dimensions of phase-space volume and\nrepresent the extent of level sets of the distribution function. Dimensional\nentropies with power-law weight functions (related to R\\'{e}nyi and Tsallis\nentropies) are particularly robust, as they do not require any internal\ndimensional parameters due to their scale invariance. We also point out the\nexistence of composite entropy measures that can be constructed from\nfunctionals of dimensional entropies. We calculate the response of the\ndimensional entropies to perturbations, showing that for a structured\ndistribution, perturbations have the largest impact on entropies weighted at a\nsimilar phase-space scale. This elucidates the link between dynamics\n(perturbations) and statistics (entropies). Finally, we derive corresponding\ngeneralized maximum-entropy distributions. Dimensional entropies may be useful\nas a diagnostic (for irreversibility) and for theoretical modeling (if the\nunderlying irreversible processes in phase space are understood) in chaotic and\ncomplex systems, such as collisionless systems of particles with long-range\ninteractions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:33:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhdankin","Vladimir",""]]}
{"id":"2308.09453","submitter":"Soronzonbold Otgonbaatar","authors":"Soronzonbold Otgonbaatar, Dieter Kranzlm\\\"uller","title":"Exploiting the Quantum Advantage for Satellite Image Processing: Quantum\n  Resource Estimation","comments":"It could be withdrawn if accepted in IEEE journal","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We first review the current state of the art of quantum computing for Earth\nobservation and satellite images. There are the persisting challenges of\nprofiting from quantum advantage, and finding the optimal sharing between\nhigh-performance computing (HPC) and quantum computing (QC), i.e. the HPC+QC\nparadigm, for computational EO problems and Artificial Intelligence (AI)\napproaches. Secondly, we assess some quantum models transpiled into a\nClifford+T universal gate set, where the Clifford+T quantum gate set sheds\nlight on the quantum resources required for deploying quantum models either on\nan HPC system or several QCs. If the Clifford+T quantum gate set cannot be\nsimulated efficiently on an HPC system then we can apply a quantum computer and\nits computational power over conventional computers. Our resulting quantum\nresource estimation demonstrates that Quantum Machine Learning (QML) models,\nwhich do not comprise a large number of T-gates, can be deployed on an HPC\nsystem during the training and validation process; otherwise, we can execute\nthem on several QCs. Namely, QML models having a sufficient number of T-gates\nprovide the quantum advantage if and only if they generalize on unseen data\npoints better than their classical counterparts deployed on the HPC system, and\nthey break the symmetry in their weights at each learning iteration like in\nconventional deep neural networks. As an initial innovation, we estimate the\nquantum resources required for some QML models. Secondly, we define the optimal\nsharing between an HPC+QC system for executing QML models for hyperspectral\nimages (HSIs); HSIs are a specific dataset compared to multispectral images to\nbe deployed on quantum computers due to the limited number of their input\nqubits, and the commonly used small number of labeled benchmark HSIs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:34:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Otgonbaatar","Soronzonbold",""],["Kranzlm\u00fcller","Dieter",""]]}
{"id":"2308.09454","submitter":"Mathias Rose Bjare MSc","authors":"Mathias Rose Bjare, Stefan Lattner and Gerhard Widmer","title":"Exploring Sampling Techniques for Generating Melodies with a Transformer\n  Language Model","comments":"7 pages, 5 figures, 1 table, accepted at the 24th Int. Society for\n  Music Information Retrieval Conf., Milan, Italy, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Research in natural language processing has demonstrated that the quality of\ngenerations from trained autoregressive language models is significantly\ninfluenced by the used sampling strategy. In this study, we investigate the\nimpact of different sampling techniques on musical qualities such as diversity\nand structure. To accomplish this, we train a high-capacity transformer model\non a vast collection of highly-structured Irish folk melodies and analyze the\nmusical qualities of the samples generated using distribution truncation\nsampling techniques. Specifically, we use nucleus sampling, the recently\nproposed \"typical sampling\", and conventional ancestral sampling. We evaluate\nthe effect of these sampling strategies in two scenarios: optimal circumstances\nwith a well-calibrated model and suboptimal circumstances where we\nsystematically degrade the model's performance. We assess the generated samples\nusing objective and subjective evaluations. We discover that probability\ntruncation techniques may restrict diversity and structural patterns in optimal\ncircumstances, but may also produce more musical samples in suboptimal\ncircumstances.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:34:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bjare","Mathias Rose",""],["Lattner","Stefan",""],["Widmer","Gerhard",""]]}
{"id":"2308.09455","submitter":"Siyu Zhang","authors":"Yeming Chen, Siyu Zhang, Yaoru Sun, Weijian Liang, Haoran Wang","title":"Artificial-Spiking Hierarchical Networks for Vision-Language\n  Representation Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the success of self-supervised learning, multimodal foundation models\nhave rapidly adapted a wide range of downstream tasks driven by vision and\nlanguage (VL) pretraining. State-of-the-art methods achieve impressive\nperformance by pre-training on large-scale datasets. However, bridging the\nsemantic gap between the two modalities remains a nonnegligible challenge for\nVL tasks. In this work, we propose an efficient computation framework for\nmultimodal alignment by introducing a novel visual semantic module to further\nimprove the performance of the VL tasks. Specifically, we propose a flexible\nmodel, namely Artificial-Spiking Hierarchical Networks (ASH-Nets), which\ncombines the complementary advantages of Artificial neural networks (ANNs) and\nSpiking neural networks (SNNs) to enrich visual semantic representations. In\nparticular, a visual concrete encoder and a semantic abstract encoder are\nconstructed to learn continuous and discrete latent variables to enhance the\nflexibility of semantic encoding. Considering the spatio-temporal properties of\nSNNs modeling, we introduce a contrastive learning method to optimize the\ninputs of similar samples. This can improve the computational efficiency of the\nhierarchical network, while the augmentation of hard samples is beneficial to\nthe learning of visual representations. Furthermore, the Spiking to Text\nUni-Alignment Learning (STUA) pre-training method is proposed, which only\nrelies on text features to enhance the encoding ability of abstract semantics.\nWe validate the performance on multiple well-established downstream VL tasks.\nExperiments show that the proposed ASH-Nets achieve competitive results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:40:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Yeming",""],["Zhang","Siyu",""],["Sun","Yaoru",""],["Liang","Weijian",""],["Wang","Haoran",""]]}
{"id":"2308.09456","submitter":"Gokhan Alcan","authors":"Jinxiong Lu, Gokhan Alcan, Ville Kyrki","title":"Integrating Expert Guidance for Efficient Learning of Safe Overtaking in\n  Autonomous Driving Using Deep Reinforcement Learning","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Overtaking on two-lane roads is a great challenge for autonomous vehicles, as\noncoming traffic appearing on the opposite lane may require the vehicle to\nchange its decision and abort the overtaking. Deep reinforcement learning (DRL)\nhas shown promise for difficult decision problems such as this, but it requires\nmassive number of data, especially if the action space is continuous. This\npaper proposes to incorporate guidance from an expert system into DRL to\nincrease its sample efficiency in the autonomous overtaking setting. The\nguidance system developed in this study is composed of constrained iterative\nLQR and PID controllers. The novelty lies in the incorporation of a fading\nguidance function, which gradually decreases the effect of the expert system,\nallowing the agent to initially learn an appropriate action swiftly and then\nimprove beyond the performance of the expert system. This approach thus\ncombines the strengths of traditional control engineering with the flexibility\nof learning systems, expanding the capabilities of the autonomous system. The\nproposed methodology for autonomous vehicle overtaking does not depend on a\nparticular DRL algorithm and three state-of-the-art algorithms are used as\nbaselines for evaluation. Simulation results show that incorporating expert\nsystem guidance improves state-of-the-art DRL algorithms greatly in both sample\nefficiency and driving safety.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:43:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Jinxiong",""],["Alcan","Gokhan",""],["Kyrki","Ville",""]]}
{"id":"2308.09457","submitter":"William Kai Alexander Worby","authors":"William Kai Alexander Worby, Kento Nakamine, Yuto Yokoyama, Masakazu\n  Muto, Yoshiyuki Tagawa","title":"Measurement of flow birefringence induced by the shear components along\n  the optical axis using a parallel-plate-type rheometer","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The present study investigated the flow birefringence induced by shear\ncomponents along a camera's optical axis, which has been neglected in\nconventional theories of photoelastic measurements. Measurements were conducted\nfor a wide range of shear rates from a direction perpendicular to the shear\nusing a high-speed polarization camera and a parallel-plate-type rheometer. The\nmeasurement results obtained from a fluid with low viscoelasticity,\nspecifically a dilute suspension of cellulose nanocrystals, showed that the\nbirefringence increases monotonically as the stress components along the\ncamera's optical axis increase. It was also found that the birefringence showed\na power law with respect to the shear rate. This letter reports a key fact\nrequired for polarization measurements of shear rate (shear stress) in\nthree-dimensional flows.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:44:11 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 05:06:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Worby","William Kai Alexander",""],["Nakamine","Kento",""],["Yokoyama","Yuto",""],["Muto","Masakazu",""],["Tagawa","Yoshiyuki",""]]}
{"id":"2308.09458","submitter":"Joao Ferreira","authors":"Nuno Saavedra, Jo\\~ao Gon\\c{c}alves, Miguel Henriques, Jo\\~ao F.\n  Ferreira, and Alexandra Mendes","title":"Polyglot Code Smell Detection for Infrastructure as Code with GLITCH","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents GLITCH, a new technology-agnostic framework that enables\nautomated polyglot code smell detection for Infrastructure as Code scripts.\nGLITCH uses an intermediate representation on which different code smell\ndetectors can be defined. It currently supports the detection of nine security\nsmells and nine design & implementation smells in scripts written in Ansible,\nChef, Docker, Puppet, or Terraform. Studies conducted with GLITCH not only show\nthat GLITCH can reduce the effort of writing code smell analyses for multiple\nIaC technologies, but also that it has higher precision and recall than current\nstate-of-the-art tools. A video describing and demonstrating GLITCH is\navailable at: https://youtu.be/E4RhCcZjWbk\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:44:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Saavedra","Nuno",""],["Gon\u00e7alves","Jo\u00e3o",""],["Henriques","Miguel",""],["Ferreira","Jo\u00e3o F.",""],["Mendes","Alexandra",""]]}
{"id":"2308.09459","submitter":"Sarah Massalkhi","authors":"S. Massalkhi, I. Jim\\'enez-Serra, J. Mart\\'in-Pintado, V. M. Rivilla,\n  L. Colzi, S. Zeng, S. Mart\\'in, B. Tercero, P. de Vicente, and M.A.\n  Requena-Torres","title":"The first detection of SiC$_2$ in the interstellar medium","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We report the first detection of SiC$_2$ in the interstellar medium. The\nmolecule was identified through six rotational transitions toward\nG\\,+0.693$-$0.027, a molecular cloud located in the Galactic center. The\ndetection is based on a line survey carried out with the GBT, the Yebes 40m,\nand the IRAM 30m telescopes covering a range of frequencies from 12 to 276 GHz.\nWe fit the observed spectra assuming local thermodynamic equilibrium and derive\na column density of ($1.02\\pm0.04)\\times10^{13}$ cm$^{-2}$, which gives a\nfractional abundance of $7.5\\times10^{-11}$ with respect to H$_2$, and an\nexcitation temperature of $5.9\\pm0.2$ K. We conclude that SiC$_2$ can be formed\nin the shocked gas by a reaction between the sputtered atomic silicon and\nC$_2$H$_2$, or it can be released directly from the dust grains due to\ndisruption. We also search for other Si-bearing molecules and detect eight\nrotational transitions of SiS and four transitions of Si$^{18}$O. The derived\nfractional abundances are $3.9\\times10^{-10}$ and $2.1\\times10^{-11}$,\nrespectively. All Si-bearing species toward G\\,+0.693$-$0.027 show fractional\nabundances well below what is typically found in late-type evolved stars.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:46:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Massalkhi","S.",""],["Jim\u00e9nez-Serra","I.",""],["Mart\u00edn-Pintado","J.",""],["Rivilla","V. M.",""],["Colzi","L.",""],["Zeng","S.",""],["Mart\u00edn","S.",""],["Tercero","B.",""],["de Vicente","P.",""],["Requena-Torres","M. A.",""]]}
{"id":"2308.09460","submitter":"Teresa Klatzer","authors":"Teresa Klatzer and Paul Dobson and Yoann Altmann and Marcelo Pereyra\n  and Jes\\'us Mar\\'ia Sanz-Serna and Konstantinos C. Zygalakis","title":"Accelerated Bayesian imaging by relaxed proximal-point Langevin sampling","comments":"34 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.CV cs.NA math.NA stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a new accelerated proximal Markov chain Monte Carlo\nmethodology to perform Bayesian inference in imaging inverse problems with an\nunderlying convex geometry. The proposed strategy takes the form of a\nstochastic relaxed proximal-point iteration that admits two complementary\ninterpretations. For models that are smooth or regularised by Moreau-Yosida\nsmoothing, the algorithm is equivalent to an implicit midpoint discretisation\nof an overdamped Langevin diffusion targeting the posterior distribution of\ninterest. This discretisation is asymptotically unbiased for Gaussian targets\nand shown to converge in an accelerated manner for any target that is\n$\\kappa$-strongly log-concave (i.e., requiring in the order of $\\sqrt{\\kappa}$\niterations to converge, similarly to accelerated optimisation schemes),\ncomparing favorably to [M. Pereyra, L. Vargas Mieles, K.C. Zygalakis, SIAM J.\nImaging Sciences, 13, 2 (2020), pp. 905-935] which is only provably accelerated\nfor Gaussian targets and has bias. For models that are not smooth, the\nalgorithm is equivalent to a Leimkuhler-Matthews discretisation of a Langevin\ndiffusion targeting a Moreau-Yosida approximation of the posterior distribution\nof interest, and hence achieves a significantly lower bias than conventional\nunadjusted Langevin strategies based on the Euler-Maruyama discretisation. For\ntargets that are $\\kappa$-strongly log-concave, the provided non-asymptotic\nconvergence analysis also identifies the optimal time step which maximizes the\nconvergence speed. The proposed methodology is demonstrated through a range of\nexperiments related to image deconvolution with Gaussian and Poisson noise,\nwith assumption-driven and data-driven convex priors.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:55:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Klatzer","Teresa",""],["Dobson","Paul",""],["Altmann","Yoann",""],["Pereyra","Marcelo",""],["Sanz-Serna","Jes\u00fas Mar\u00eda",""],["Zygalakis","Konstantinos C.",""]]}
{"id":"2308.09461","submitter":"Xinlei Wang","authors":"Xinlei Wang, Junhua Zhao, Haifeng Wu, Zhengwen Zhang, Guolong Liu,\n  Wenxuan Liu, Yuheng Cheng, Jing Qiu, Bohui Zhang, Jianwei Huang","title":"Towards Carbon Transparency: A High-Resolution Carbon Emissions Database\n  for China's Listed Companies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dual-carbon goals of China necessitate precise accounting of company\ncarbon emissions, vital for green development across all industries. Not only\nthe company itself but also financial investors require accurate and\ncomprehensive company-level emissions data for climate risk management. This\npaper introduces the structure and methodology of the High-resolution Database\nfor Carbon Emissions of China-listed companies, integrating three primary data\nsources: self-disclosed environmental data from listed companies,\nlong-accumulated national power emission data, and regional high-precision\nemission data derived from multi-source satellites. The database's innovation\nlies in the employment of artificial intelligence (AI) algorithms to aggregate\nmulti-source satellite data. This approach enables the precise identification\nof carbon emission sources and the prediction of company-level carbon\nemissions. Consequently, this methodology robustly cross-validates\nself-reported direct emissions, enhancing the accuracy and granularity of\ncompany-level emission records. Central to the database's utility includes the\nprovision of high-resolution company carbon emission data, which is not only\nhighly accurate but also instrumental in carbon management and emission market\ntransactions. By offering a more nuanced and verifiable picture of company\nemissions, the database supports China's broader efforts to meet its ambitious\ndual-carbon targets and transition towards a more sustainable and\nenvironmentally responsible economy.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:58:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Xinlei",""],["Zhao","Junhua",""],["Wu","Haifeng",""],["Zhang","Zhengwen",""],["Liu","Guolong",""],["Liu","Wenxuan",""],["Cheng","Yuheng",""],["Qiu","Jing",""],["Zhang","Bohui",""],["Huang","Jianwei",""]]}
{"id":"2308.09462","submitter":"Alessandra Colla","authors":"Irene Ada Picatoste, Alessandra Colla and Heinz-Peter Breuer","title":"Dynamically Emergent Quantum Thermodynamics: Non-Markovian Otto Cycle","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Employing a recently developed approach to dynamically emergent quantum\nthermodynamics, we revisit the thermodynamic behavior of the quantum Otto cycle\nwith a focus on memory effects and strong system-bath couplings. Our\ninvestigation is based on an exact treatment of non-Markovianity by means of an\nexact quantum master equation, modelling the dynamics through the Fano-Anderson\nmodel featuring a peaked environmental spectral density. By comparing the\nresults to the standard Markovian case, we find that non-Markovian baths can\ninduce work transfer to the system, and identify specific parameter regions\nwhich lead to enhanced work output and efficiency of the cycle. In particular,\nwe demonstrate that these improvements arise when the cycle operates in a\nfrequency interval which contains the peak of the spectral density. This can be\nunderstood from an analysis of the renormalized frequencies emerging through\nthe system-baths couplings.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:00:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Picatoste","Irene Ada",""],["Colla","Alessandra",""],["Breuer","Heinz-Peter",""]]}
{"id":"2308.09463","submitter":"Hong-Yan Zhang","authors":"Xiao Chen, Hong-Yan Zhang, Rui-Jia Lin, Zhi-Qiang Feng and Yu Zhou","title":"Fixed-Point Algorithms for Solving the Critical Value and Upper Tail\n  Quantile of Kuiper's Statistics","comments":"19 pages, 6 figures, code available on GitHub","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kuiper's statistic is a good measure for the difference of ideal distribution\nand empirical distribution in the goodness-of-fit test. However, it is a\nchallenging problem to solve the critical value and upper tail quantile, or\nsimply Kuiper pair, of Kuiper's statistics due to the difficulties of solving\nthe nonlinear equation and reasonable approximation of infinite series. The\npioneering work by Kuiper just provided the key ideas and few numerical tables\ncreated from the upper tail probability $\\alpha$ and sample capacity $n$, which\nlimited its propagation and possible applications in various fields since there\nare infinite configurations for the parameters $\\alpha$ and $n$. In this work,\nthe contributions lie in two perspectives: firstly, the second order\napproximation for the infinite series of the cumulative distribution of the\ncritical value is used to achieve higher precision; secondly, the principles\nand fixed-point algorithms for solving the Kuiper pair are presented with\ndetails. The algorithms are verified and validated by comparing with the table\nprovided by Kuiper. The methods and algorithms proposed are enlightening and\nworthy of introducing to the college students, computer programmers, engineers,\nexperimental psychologists and so on.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:00:48 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 11:33:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Xiao",""],["Zhang","Hong-Yan",""],["Lin","Rui-Jia",""],["Feng","Zhi-Qiang",""],["Zhou","Yu",""]]}
{"id":"2308.09464","submitter":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a","authors":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a","title":"Data augmentation and explainability for bias discovery and mitigation\n  in deep learning","comments":"A PhD Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This dissertation explores the impact of bias in deep neural networks and\npresents methods for reducing its influence on model performance. The first\npart begins by categorizing and describing potential sources of bias and errors\nin data and models, with a particular focus on bias in machine learning\npipelines. The next chapter outlines a taxonomy and methods of Explainable AI\nas a way to justify predictions and control and improve the model. Then, as an\nexample of a laborious manual data inspection and bias discovery process, a\nskin lesion dataset is manually examined. A Global Explanation for the Bias\nIdentification method is proposed as an alternative semi-automatic approach to\nmanual data exploration for discovering potential biases in data. Relevant\nnumerical methods and metrics are discussed for assessing the effects of the\nidentified biases on the model. Whereas identifying errors and bias is\ncritical, improving the model and reducing the number of flaws in the future is\nan absolute priority. Hence, the second part of the thesis focuses on\nmitigating the influence of bias on ML models. Three approaches are proposed\nand discussed: Style Transfer Data Augmentation, Targeted Data Augmentations,\nand Attribution Feedback. Style Transfer Data Augmentation aims to address\nshape and texture bias by merging a style of a malignant lesion with a\nconflicting shape of a benign one. Targeted Data Augmentations randomly insert\npossible biases into all images in the dataset during the training, as a way to\nmake the process random and, thus, destroy spurious correlations. Lastly,\nAttribution Feedback is used to fine-tune the model to improve its accuracy by\neliminating obvious mistakes and teaching it to ignore insignificant input\nparts via an attribution loss. The goal of these approaches is to reduce the\ninfluence of bias on machine learning models, rather than eliminate it\nentirely.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:02:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Miko\u0142ajczyk-Bare\u0142a","Agnieszka",""]]}
{"id":"2308.09465","submitter":"Adam Doherty","authors":"Adam Doherty, Ian Buchanan, Alberto Astolfo, Savvas Savvidis, Mattia\n  F. M. Gerli, Antonio Citro, Alessandro Olivo, Marco Endrizzi","title":"Single-shot X-ray Dark-field Tomography","comments":"7 pages, 3 figures with additional supplemental material of 3 pages,\n  3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  X-ray dark-field imaging creates a representation of the sample where\ncontrast is generated by subresolution features within the volume under\ninspection. These are detected by a local measurement of the radiation field's\nangular distribution, and how it is affected by the interaction with matter.\nX-ray dark-field imaging typically requires taking multiple exposures for\nseparating the contributions to the detected X-ray intensity arising from\nscattering, refraction and attenuation; a procedure often called phase\nretrieval. We propose an approach to retrieve an X-ray dark-field image from a\nsingle X-ray shot. We demonstrate the method using a laboratory-based, rotating\nanode X-ray tube system without the need for coherent radiation or a\nhigh-resolution detector. This reduces the complexity of data acquisition,\nenabling faster scanning and increasing dose efficiency. Moreover, our approach\nreduces the problem dimensionality by one, with substantial implications for\ndata-intensive applications like tomography. The model assumes a homogeneous\nmaterial, and we show this is a valid hypothesis for soft biological tissues by\nreconstructing dark-field tomography images from data sets containing a single\nshot per view. We believe our method to be broadly applicable and relevant for\nmany X-ray dark-field imaging implementations, including fast radiography,\ndirectional dark-field and for use with pulsed X-ray sources.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:03:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Doherty","Adam",""],["Buchanan","Ian",""],["Astolfo","Alberto",""],["Savvidis","Savvas",""],["Gerli","Mattia F. M.",""],["Citro","Antonio",""],["Olivo","Alessandro",""],["Endrizzi","Marco",""]]}
{"id":"2308.09466","submitter":"Clemens Schindler","authors":"Michael Pinsker, Clemens Schindler","title":"On the Zariski topology on endomorphism monoids of omega-categorical\n  structures","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.GN math.RA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The endomorphism monoid of a model-theoretic structure carries two\ninteresting topologies: on the one hand, the topology of pointwise convergence\ninduced externally by the action of the endomorphisms on the domain via\nevaluation; on the other hand, the Zariski topology induced within the monoid\nby (non-)solutions to equations. For all concrete endomorphism monoids of\n$\\omega$-categorical structures on which the Zariski topology has been analysed\nthus far, the two topologies were shown to coincide, in turn yielding that the\npointwise topology is the coarsest Hausdorff semigroup topology on those\nendomorphism monoids. We establish two systematic reasons for the two\ntopologies to agree, formulated in terms of the model-complete core of the\nstructure. Further, we give an example of an $\\omega$-categorical structure on\nwhose endomorphism monoid the topology of pointwise convergence and the Zariski\ntopology differ, answering a question of Elliott, Jonu\\v{s}as, Mitchell,\nP\\'eresse and Pinsker.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:06:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pinsker","Michael",""],["Schindler","Clemens",""]]}
{"id":"2308.09467","submitter":"Zhuang Xiong","authors":"Zhuang Xiong, Yang Gao, Yin Liu, Amir Fazlollahi, Peter Nestor, Feng\n  Liu, Hongfu Sun","title":"Quantitative Susceptibility Mapping through Model-based Deep Image Prior\n  (MoDIP)","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":"  The data-driven approach of supervised learning methods has limited\napplicability in solving dipole inversion in Quantitative Susceptibility\nMapping (QSM) with varying scan parameters across different objects. To address\nthis generalization issue in supervised QSM methods, we propose a novel\ntraining-free model-based unsupervised method called MoDIP (Model-based Deep\nImage Prior). MoDIP comprises a small, untrained network and a Data Fidelity\nOptimization (DFO) module. The network converges to an interim state, acting as\nan implicit prior for image regularization, while the optimization process\nenforces the physical model of QSM dipole inversion. Experimental results\ndemonstrate MoDIP's excellent generalizability in solving QSM dipole inversion\nacross different scan parameters. It exhibits robustness against pathological\nbrain QSM, achieving over 32% accuracy improvement than supervised deep\nlearning and traditional iterative methods. It is also 33% more computationally\nefficient and runs 4 times faster than conventional DIP-based approaches,\nenabling 3D high-resolution image reconstruction in under 4.5 minutes.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:07:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xiong","Zhuang",""],["Gao","Yang",""],["Liu","Yin",""],["Fazlollahi","Amir",""],["Nestor","Peter",""],["Liu","Feng",""],["Sun","Hongfu",""]]}
{"id":"2308.09468","submitter":"Benedikt Zipfel","authors":"Benedikt Zipfel, Felix Tamke, Leopold Kuttner","title":"A new branch-and-cut approach for integrated planning in additive\n  manufacturing","comments":"28 pages, 6 figures, 10 tables, Submitted to European Journal of\n  Operational Research","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, there has been considerable interest in the transformative\npotential of additive manufacturing (AM) since it allows for producing highly\ncustomizable and complex components while reducing lead times and costs. The\nrise of AM for traditional and new business models enforces the need for\nefficient planning procedures for AM facilities. In this area, the assignment\nand sequencing of components to be built by an AM machine, also called a 3D\nprinter, is a complex problem joining the nesting and scheduling of parts to be\nprinted. This paper proposes a new branch-and-cut algorithm for integrated\nplanning for unrelated parallel machines. The algorithm is based on\ncombinatorial Benders decomposition: The scheduling problem is considered in\nthe master problem, while the feasibility of a solution is checked in the\nsub-problem. Current state-of-the-art techniques are extended to solve the\northogonal packing with rotation to speed up the solution of the sub-problem.\nExtensive computational tests on existing instances and a new benchmark\ninstance set show the algorithm's superior performance compared to an existing\nintegrated mixed-integer programming model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:10:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zipfel","Benedikt",""],["Tamke","Felix",""],["Kuttner","Leopold",""]]}
{"id":"2308.09469","submitter":"Serena Vinciguerra","authors":"Serena Vinciguerra, Tuomo Salmi, Anna L. Watts, Devarshi Choudhury,\n  Thomas E. Riley, Paul S. Ray, Slavko Bogdanov, Yves Kini, Sebastien Guillot,\n  Deepto Chakrabarty, Wynn C. G. Ho, Daniela Huppenkothen, Sharon M. Morsink,\n  Zorawar Wadiasingh","title":"An updated mass-radius analysis of the 2017-2018 NICER data set of PSR\n  J0030+0451","comments":"35 pages, 11 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2019 the NICER collaboration published the first mass and radius inferred\nfor PSR J0030+0451, thanks to NICER observations, and consequent constraints on\nthe equation of state characterising dense matter. Two independent analyses\nfound a mass of $\\sim 1.3-1.4\\,\\mathrm{M_\\odot}$ and a radius of $\\sim 13\\,$km.\nThey also both found that the hot spots were all located on the same\nhemisphere, opposite to the observer, and that at least one of them had a\nsignificantly elongated shape. Here we reanalyse, in greater detail, the same\nNICER data set, incorporating the effects of an updated NICER response matrix\nand using an upgraded analysis framework. We expand the adopted models and\njointly analyse also XMM-Newton data, which enables us to better constrain the\nfraction of observed counts coming from PSR J0030+0451. Adopting the same\nmodels used in previous publications, we find consistent results, although with\nmore stringent inference requirements. We also find a multi-modal structure in\nthe posterior surface. This becomes crucial when XMM-Newton data is accounted\nfor. Including the corresponding constraints disfavors the main solutions found\npreviously, in favor of the new and more complex models. These have inferred\nmasses and radii of $\\sim [1.4 \\mathrm{M_\\odot}, 11.5$ km] and $\\sim [1.7\n\\mathrm{M_\\odot}, 14.5$ km], depending on the assumed model. They display\nconfigurations that do not require the two hot spots generating the observed\nX-rays to be on the same hemisphere, nor to show very elongated features, and\npoint instead to the presence of temperature gradients and the need to account\nfor them.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:10:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Vinciguerra","Serena",""],["Salmi","Tuomo",""],["Watts","Anna L.",""],["Choudhury","Devarshi",""],["Riley","Thomas E.",""],["Ray","Paul S.",""],["Bogdanov","Slavko",""],["Kini","Yves",""],["Guillot","Sebastien",""],["Chakrabarty","Deepto",""],["Ho","Wynn C. G.",""],["Huppenkothen","Daniela",""],["Morsink","Sharon M.",""],["Wadiasingh","Zorawar",""]]}
{"id":"2308.09470","submitter":"Aaqib Manzoor","authors":"Aaqib Manzoor, Sunder Sahayanathan, Zahir Shah, Subir Bhattacharyya,\n  Naseer Iqbal, Zahoor Malik","title":"Understanding the Very High Energy {\\gamma}-ray excess in nearby blazars\n  using leptonic model","comments":"9 Pages, 5 figures, Accepted for Publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The availability of simultaneous X-ray and Very High Energy (VHE)\nobservations of blazars helps to identify the plausible radiative contributors\nto the VHE emission. Under leptonic scenario, the VHE emission from BL Lacs are\nattributed to the synchrotron self Compton (SSC) emission. However, many BL\nLacerate (BL Lacs) have shown significant hardening at VHE after correction for\nthe Extra Galactic Background Light (EBL) attenuation. We study the spectral\nhardening of two nearby BL Lac objects, Mkn 421 and Mkn 501 having most number\nof simultaneous X-ray and VHE observations available among all the blazars.\nThese BL Lacs are relatively close and the effect of EBL attenuation is\nrelatively minimal/negligible. We study the scatter plot between the X-ray\nspectral indices and intrinsic VHE indices to identify the plausible origin of\nthe VHE emission. For Mkn 501, the VHE spectral indices are steeper than X-ray\nspectra, suggesting the scattering process happening at extreme Klein-Nishina\nregime. On the other hand, for Mkn 421, the VHE spectra is remarkably harder\nthan the X-ray spectra, which suggests an additional emission mechanism other\nthan the SSC process. We show this hard VHE spectrum of Mkn 421 can be\nexplained by considering the inverse Compton (IC) emission from a broken power\nlaw electron distribution with Maxwellian pileup. The possibility of the\nhadronic contribution at VHE {\\gamma}-rays is also explored by modeling the\nhard spectrum under photomeson process.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:11:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Manzoor","Aaqib",""],["Sahayanathan","Sunder",""],["Shah","Zahir",""],["Bhattacharyya","Subir",""],["Iqbal","Naseer",""],["Malik","Zahoor",""]]}
{"id":"2308.09471","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Software Performance of the ATLAS Track Reconstruction for LHC Run 3","comments":"46 pages in total, author list starting on page 28, 14 figures, 0\n  tables, submitted to CSBS. All figures including auxiliary figures are\n  available at\n  http://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/IDTR-2022-04","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-168","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Charged particle reconstruction in the presence of many simultaneous\nproton-proton $pp$ collisions in the LHC is a challenging task for the ATLAS\nexperiment's reconstruction software due to the combinatorial complexity. This\npaper describes the major changes made to adapt the software to reconstruct\nhigh-activity collisions with an average of 50 or more simultaneous $pp$\ninteractions per bunch crossing (pile-up) promptly using the available\ncomputing resources. The performance of the key components of the track\nreconstruction chain and its dependence on pile-up are evaluated, and the\nimprovement achieved compared to the previous software version is quantified.\nFor events with an average of 60 $pp$ collisions per bunch crossing, the\nupdated track reconstruction is twice as fast as the previous version, without\nsignificant reduction in reconstruction efficiency and while reducing the rate\nof combinatorial fake tracks by more than a factor two.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:12:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.09472","submitter":"Gopika Sudhakaran","authors":"Gopika Sudhakaran, Devendra Singh Dhami, Kristian Kersting, Stefan\n  Roth","title":"Vision Relation Transformer for Unbiased Scene Graph Generation","comments":"Accepted for publication in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent years have seen a growing interest in Scene Graph Generation (SGG), a\ncomprehensive visual scene understanding task that aims to predict entity\nrelationships using a relation encoder-decoder pipeline stacked on top of an\nobject encoder-decoder backbone. Unfortunately, current SGG methods suffer from\nan information loss regarding the entities local-level cues during the relation\nencoding process. To mitigate this, we introduce the Vision rElation\nTransfOrmer (VETO), consisting of a novel local-level entity relation encoder.\nWe further observe that many existing SGG methods claim to be unbiased, but are\nstill biased towards either head or tail classes. To overcome this bias, we\nintroduce a Mutually Exclusive ExperT (MEET) learning strategy that captures\nimportant relation features without bias towards head or tail classes.\nExperimental results on the VG and GQA datasets demonstrate that VETO + MEET\nboosts the predictive performance by up to 47 percentage over the state of the\nart while being 10 times smaller.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:15:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sudhakaran","Gopika",""],["Dhami","Devendra Singh",""],["Kersting","Kristian",""],["Roth","Stefan",""]]}
{"id":"2308.09473","submitter":"Xiaokun Liang","authors":"Chulong Zhang and Xiaokun Liang","title":"INR-LDDMM: Fluid-based Medical Image Registration Integrating Implicit\n  Neural Representation and Large Deformation Diffeomorphic Metric Mapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a flow-based registration framework of medical images based on\nimplicit neural representation. By integrating implicit neural representation\nand Large Deformable Diffeomorphic Metric Mapping (LDDMM), we employ a\nMultilayer Perceptron (MLP) as a velocity generator while optimizing velocity\nand image similarity. Moreover, we adopt a coarse-to-fine approach to address\nthe challenge of deformable-based registration methods dropping into local\noptimal solutions, thus aiding the management of significant deformations in\nmedical image registration. Our algorithm has been validated on a paired\nCT-CBCT dataset of 50 patients,taking the dice coefficient of transferred\nannotations as an evaluation metric. Compared to existing methods, our approach\nachieves the state-of-the-art performance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:18:18 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 06:03:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Chulong",""],["Liang","Xiaokun",""]]}
{"id":"2308.09474","submitter":"Ryan Cory-Wright","authors":"Ryan Cory-Wright, Bachir El Khadir, Cristina Cornelio, Sanjeeb Dash,\n  Lior Horesh","title":"AI Hilbert: From Data and Background Knowledge to Automated Scientific\n  Discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SC math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The discovery of scientific formulae that parsimoniously explain natural\nphenomena and align with existing background theory is a key goal in science.\nHistorically, scientists have derived natural laws by manipulating equations\nbased on existing knowledge, forming new equations, and verifying them\nexperimentally. In recent years, data-driven scientific discovery has emerged\nas a viable competitor in settings with large amounts of experimental data.\nUnfortunately, data-driven methods often fail to discover valid laws when data\nis noisy or scarce. Accordingly, recent works combine regression and reasoning\nto eliminate formulae inconsistent with background theory. However, the problem\nof searching over the space of formulae consistent with background theory to\nfind one that fits the data best is not well solved. We propose a solution to\nthis problem when all axioms and scientific laws are expressible via polynomial\nequalities and inequalities and argue that our approach is widely applicable.\nWe further model notions of minimal complexity using binary variables and\nlogical constraints, solve polynomial optimization problems via mixed-integer\nlinear or semidefinite optimization, and automatically prove the validity of\nour scientific discoveries via Positivestellensatz certificates. Remarkably,\nthe optimization techniques leveraged in this paper allow our approach to run\nin polynomial time with fully correct background theory, or non-deterministic\npolynomial (NP) time with partially correct background theory. We\nexperimentally demonstrate that some famous scientific laws, including Kepler's\nThird Law of Planetary Motion, the Hagen-Poiseuille Equation, and the Radiated\nGravitational Wave Power equation, can be automatically derived from sets of\npartially correct background axioms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:19:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cory-Wright","Ryan",""],["Khadir","Bachir El",""],["Cornelio","Cristina",""],["Dash","Sanjeeb",""],["Horesh","Lior",""]]}
{"id":"2308.09475","submitter":"Hongqiu Wang","authors":"Hongqiu Wang, Lei Zhu, Guang Yang, Yike Guo, Shichen Zhang, Bo Xu,\n  Yueming Jin","title":"Video-Instrument Synergistic Network for Referring Video Instrument\n  Segmentation in Robotic Surgery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robot-assisted surgery has made significant progress, with instrument\nsegmentation being a critical factor in surgical intervention quality. It\nserves as the building block to facilitate surgical robot navigation and\nsurgical education for the next generation of operating intelligence. Although\nexisting methods have achieved accurate instrument segmentation results, they\nsimultaneously generate segmentation masks for all instruments, without the\ncapability to specify a target object and allow an interactive experience. This\nwork explores a new task of Referring Surgical Video Instrument Segmentation\n(RSVIS), which aims to automatically identify and segment the corresponding\nsurgical instruments based on the given language expression. To achieve this,\nwe devise a novel Video-Instrument Synergistic Network (VIS-Net) to learn both\nvideo-level and instrument-level knowledge to boost performance, while previous\nwork only used video-level information. Meanwhile, we design a Graph-based\nRelation-aware Module (GRM) to model the correlation between multi-modal\ninformation (i.e., textual description and video frame) to facilitate the\nextraction of instrument-level information. We are also the first to produce\ntwo RSVIS datasets to promote related research. Our method is verified on these\ndatasets, and experimental results exhibit that the VIS-Net can significantly\noutperform existing state-of-the-art referring segmentation methods. Our code\nand our datasets will be released upon the publication of this work.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:24:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Hongqiu",""],["Zhu","Lei",""],["Yang","Guang",""],["Guo","Yike",""],["Zhang","Shichen",""],["Xu","Bo",""],["Jin","Yueming",""]]}
{"id":"2308.09476","submitter":"Ryo Ando","authors":"Ryo Ando and Fumiyasu Komaki","title":"On High-Dimensional Asymptotic Properties of Model Averaging Estimators","comments":"28 pages,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":"  When multiple models are considered in regression problems, the model\naveraging method can be used to weigh and integrate the models. In the present\nstudy, we examined how the goodness-of-prediction of the estimator depends on\nthe dimensionality of explanatory variables when using a generalization of the\nmodel averaging method in a linear model. We specifically considered the case\nof high-dimensional explanatory variables, with multiple linear models deployed\nfor subsets of these variables. Consequently, we derived the optimal weights\nthat yield the best predictions. we also observe that the double-descent\nphenomenon occurs in the model averaging estimator. Furthermore, we obtained\ntheoretical results by adapting methods such as the random forest to linear\nregression models. Finally, we conducted a practical verification through\nnumerical experiments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:26:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ando","Ryo",""],["Komaki","Fumiyasu",""]]}
{"id":"2308.09477","submitter":"Giancarlo Mattia","authors":"Giancarlo Mattia, Luca Del Zanna, Matteo Bugli, Andrea Pavan, Riccardo\n  Ciolfi, Gianluigi Bodo, Andrea Mignone","title":"Resistive relativistic MHD simulations of astrophysical jets","comments":"17 pages, 16 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aims. The main goal of the present paper is to provide the first systematic\nnumerical study of the propagation of astrophysical relativistic jets, in the\ncontext of high-resolution shock-capturing resistive relativistic\nmagnetohydrodynamics (RRMHD) simulations. We aim at investigating different\nvalues and models for the plasma resistivity coefficient, and at assessing\ntheir impact on the level of turbulence, the formation of current sheets and\nreconnection plasmoids, the electromagnetic energy content, and the dissipated\npower. Methods. We use the PLUTO code for simulations and we assume an\naxisymmetric setup for jets, endowed with both poloidal and toroidal magnetic\nfields, and propagating in a uniform magnetized medium. The gas is assumed to\nbe characterized by a realistic Synge-like equation of state (Taub equation),\nappropriate for such type of astrophysical jets. The Taub equation is combined\nhere for the first time with the Implicit-Explicit Runge-Kutta time-stepping\nprocedure, as required in RRMHD simulations. Results. The main result is that\nturbulence is clearly suppressed for the highest values of resistivity (low\nLundquist numbers), current sheets are broader, and plasmoids are barely\npresent, while for low values of resistivity results are very similar to ideal\nruns, where dissipation is purely numerical. We find that recipes employing a\nvariable resistivity based on the advection of a jet tracer or on the\nassumption of a uniform Lundquist number improve on the use of a constant\ncoefficient and are probably more realistic, preserving the development of\nturbulence and of sharp current sheets, possible sites for the acceleration of\nthe non-thermal particles producing the observed high-energy emission.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:27:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mattia","Giancarlo",""],["Del Zanna","Luca",""],["Bugli","Matteo",""],["Pavan","Andrea",""],["Ciolfi","Riccardo",""],["Bodo","Gianluigi",""],["Mignone","Andrea",""]]}
{"id":"2308.09478","submitter":"Michael Unterkalmsteiner","authors":"Michael Unterkalmsteiner, Gregory Gay, Michael Felderer, Elizabeth\n  Bjarnason, Markus Borg, Mirko Morandini","title":"Summary of the 3rd International Workshop on Requirements Engineering\n  and Testing","comments":null,"journal-ref":"ACM SIGSOFT Softw. Eng. Notes 41(3): 31-33 (2016)","doi":"10.1145/2934240.2934249","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 3rd workshop was held in co-location with REFSQ 2016 in\nGothenburg, Sweden. The workshop continued in the same interactive vein as the\npredecessors and included a keynote, paper presentations with ample time for\ndiscussions, and panels. In order to create an RET knowledge base, this\ncrosscutting area elicits contributions from both RE and Testing, and from both\nresearchers and practitioners. A range of papers were presented from short\npositions papers to full research papers that cover connections between the two\nfields.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:32:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Unterkalmsteiner","Michael",""],["Gay","Gregory",""],["Felderer","Michael",""],["Bjarnason","Elizabeth",""],["Borg","Markus",""],["Morandini","Mirko",""]]}
{"id":"2308.09479","submitter":"Roman Nikolaevich Lee","authors":"V.S. Fadin and R.N. Lee","title":"Two-loop radiative corrections to $e^+ e^-\\rightarrow \\gamma\\gamma^*$\n  cross section","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing accuracy of current and planned experiments to measure the\nanomalous magnetic moment of the muon requires more precision and reliability\nof its theoretical calculation. For this purpose, we calculate the differential\ncross section for the process of annihilation of an electron-positron pair into\ntwo photons, one of which is virtual, accompanied by the emission of soft\nphotons, taking into account radiative corrections of the order $\\alpha^2$. The\nresults obtained can be used to improve the accuracy of calculating the\ncontribution of the hadron vacuum polarization to the muon anomalous moment. It\nis shown that all logarithmically amplified two-loop corrections can be easily\nfound using modern theorems of soft and collinear factorizations and available\none-loop results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:34:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Fadin","V. S.",""],["Lee","R. N.",""]]}
{"id":"2308.09480","submitter":"Oliver Pf\\\"auti","authors":"Oliver Pf\\\"auti","title":"The Inflation Attention Threshold and Inflation Surges","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":"  At the outbreak of the recent inflation surge, the public's attention to\ninflation was low but increased rapidly once inflation started to rise. In this\npaper, I develop a general equilibrium monetary model where it is optimal for\nagents to pay little attention to inflation when inflation is low and stable,\nbut in which they increase their attention once inflation exceeds a certain\nthreshold. Using survey inflation expectations, I estimate the attention\nthreshold to be at an inflation rate of 4%, with attention in the\nhigh-attention regime being twice as high as in the low-attention regime. When\ncalibrated to match these findings, the model generates inflation and inflation\nexpectation dynamics consistent with the recent inflation surge in the US. The\nattention threshold induces a state dependency: cost-push shocks become more\ninflationary in times of loose monetary policy. These state-dependent effects\nare absent in the model with constant attention or under rational expectations.\nFollowing simple Taylor rules triggers frequent and prolonged episodes of\nheightened attention, thereby increasing the volatility of inflation, and-due\nto the asymmetry of the attention threshold-also the average level of\ninflation, which leads to substantial welfare losses.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:33:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pf\u00e4uti","Oliver",""]]}
{"id":"2308.09481","submitter":"Nicola Botta","authors":"Nicola Botta, Patrik Jansson, Guilherme Horta Alvares Da Silva","title":"Types, equations, dimensions and the Pi theorem","comments":"Submitted for publication in the \"Journal of Functional Programming\"\n  (Education Matters) in August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The languages of mathematical physics and modelling are endowed with a rich\n\"grammar of dimensions\" that common abstractions of programming languages fail\nto represent. We propose a dependently typed domain-specific language (embedded\nin Idris) that captures this grammar. We apply it to explain basic notions of\ndimensional analysis and Buckingham's Pi theorem. We argue that the language\nmakes mathematical physics more accessible to computer scientists and\nfunctional programming more palatable to modelers and physicists.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 14:33:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Botta","Nicola",""],["Jansson","Patrik",""],["Da Silva","Guilherme Horta Alvares",""]]}
{"id":"2308.09482","submitter":"Daniel Flam-Shepherd","authors":"Daniel Flam-Shepherd, Kevin Zhu and Al\\'an Aspuru-Guzik","title":"Atom-by-atom protein generation and beyond with language models","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":"  Protein language models learn powerful representations directly from\nsequences of amino acids. However, they are constrained to generate proteins\nwith only the set of amino acids represented in their vocabulary. In contrast,\nchemical language models learn atom-level representations of smaller molecules\nthat include every atom, bond, and ring. In this work, we show that chemical\nlanguage models can learn atom-level representations of proteins enabling\nprotein generation unconstrained to the standard genetic code and far beyond\nit. In doing so, we show that language models can generate entire proteins atom\nby atom -- effectively learning the multiple hierarchical layers of molecular\ninformation that define proteins from their primary sequence to their\nsecondary, and tertiary structure. We demonstrate language models are able to\nexplore beyond protein space -- generating proteins with modified sidechains\nthat form unnatural amino acids. Even further, we find that language models can\nexplore chemical space and protein space simultaneously and generate novel\nexamples of protein-drug conjugates. The results demonstrate the potential for\nbiomolecular design at the atom level using language models.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 17:56:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Flam-Shepherd","Daniel",""],["Zhu","Kevin",""],["Aspuru-Guzik","Al\u00e1n",""]]}
{"id":"2308.09483","submitter":"Sabah Al-Fedaghi Dr.","authors":"Sabah Al-Fedaghi","title":"Ontology for Conceptual Modeling: Reality of What Thinging Machines Talk\n  About, e.g., Information","comments":"15 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In conceptual modeling (CM) as a subdiscipline of software engineering,\ncurrent proposed ontologies (categorical analysis of entities) are typically\nestablished through whole adoption of philosophical theories (e.g. Bunge s). In\nthis paper, we pursue an interdisciplinary research approach to develop a\ndiagrammatic-based ontological foundation for CM using philosophical ontology\nas a secondary source. It is an endeavor to escape an offshore procurement of\nontology from philosophy and implant it in CM. In such an effort, the CM\ndiagrammatic language plays an important role in contrast to dogmatic\nphilosophical languages obsession with abstract entities. Specifically, this\npaper is about developing a descriptive (in contrast to formal) ontology that a\nmodeler accepts as a supplementary account of reality when using thinging\nmachines (TMs; i.e. a reality that uncovers the ontology of things that TM\nmodeling discusses or talks about, akin to the ontology of natural language).\nThe aim here is aligned toward developing CM notions and processes that are\nfirm enough. Classical analysis of being per se (e.g. identity, substance) is\nde-emphasized in this work; nevertheless, philosophical concepts form an\nacknowledged authority to compare to. As a case study, such a methodology is\napplied to the notion of information. This application would enhance\nunderstanding of the TM methodology and clarify some of the issues that shed\nlight on the question of the nature of information as an important concept in\nsoftware engineering. Information is defined as about events; that is, it is\nabout existing things. It is viewed as having a subsisting nature that exists\nonly through being carried on by other things. The results seem to indicate a\npromising approach to define information and understand its nature.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 03:21:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Al-Fedaghi","Sabah",""]]}
{"id":"2308.09484","submitter":"Mingqiu Fan","authors":"Lijuan Zhang, Mingqiu Fan, Chunni Yu, Lei Lei","title":"An Efficient Early-breaking Estimation and Tree-splitting Missing RFID\n  Tag Identification Protocol","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.OH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent statistics have demonstrated that missing items have become the main\ncause of loss for retailers in inventory management. To quickly identify\nmissing tags, traditional protocols adopt Aloha-based strategies which take a\nlong time, especially when the number of tags is large. Among them, few works\nconsidered the effect of unexpected unknown tags on the missing tag\nidentification process. With the presence of unknown tags, some missing tags\nmay be falsely identified as present. Thus, the system's reliability is hardly\nguaranteed. In this work, we propose an efficient early-breaking estimation and\ntree-splitting-based missing tag identification (ETMTI) protocol for\nlarge-scale RFID systems. In ETMTI, a new early-breaking estimation and\ndeactivation method is developed to effectively estimate the number of unknown\ntags and deactivate them within a short time. Next, a new tree-splitting-based\nmissing tag identification method is proposed to quickly identify missing tags\nwith a B-ary splitting tree. Besides, a bit-tracking response strategy is\ndesigned to further reduce the time cost. The optimal parameters, time cost,\nand false negative rate of ETMTI are analyzed theoretically. Simulation results\nare presented to demonstrate that the proposed ETMTI protocol takes a smaller\ntime and has a lower false negative rate than the best-performing benchmarks.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:08:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Lijuan",""],["Fan","Mingqiu",""],["Yu","Chunni",""],["Lei","Lei",""]]}
{"id":"2308.09485","submitter":"Valentina Semenova","authors":"Valentina Semenova, Dragos Gorduza, William Wildi, Xiaowen Dong,\n  Stefan Zohren","title":"Wisdom of the Crowds or Ignorance of the Masses? A data-driven guide to\n  WSB","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A trite yet fundamental question in economics is: What causes large asset\nprice fluctuations? A tenfold rise in the price of GameStop equity, between the\n22nd and 28th of January 2021, demonstrated that herding behaviour among retail\ninvestors is an important contributing factor. This paper presents a\ndata-driven guide to the forum that started the hype -- WallStreetBets (WSB).\nOur initial experiments decompose the forum using a large language topic model\nand network tools. The topic model describes the evolution of the forum over\ntime and shows the persistence of certain topics (such as the market / S\\&P500\ndiscussion), and the sporadic interest in others, such as COVID or crude oil.\nNetwork analysis allows us to decompose the landscape of retail investors into\nclusters based on their posting and discussion habits; several large,\ncorrelated asset discussion clusters emerge, surrounded by smaller, niche ones.\nA second set of experiments assesses the impact that WSB discussions have had\non the market. We show that forum activity has a Granger-causal relationship\nwith the returns of several assets, some of which are now commonly classified\nas `meme stocks', while others have gone under the radar. The paper extracts a\nset of short-term trade signals from posts and long-term (monthly and weekly)\ntrade signals from forum dynamics, and considers their predictive power at\ndifferent time horizons. In addition to the analysis, the paper presents the\ndataset, as well as an interactive dashboard, in order to promote further\nresearch.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:39:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Semenova","Valentina",""],["Gorduza","Dragos",""],["Wildi","William",""],["Dong","Xiaowen",""],["Zohren","Stefan",""]]}
{"id":"2308.09486","submitter":"Taekyun Kim","authors":"Dae san Kim, Hye Kyung Kim and Taekyun Kim","title":"New approach to $\\lambda$-stirling numbers","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this paper is to study the $\\lambda$-Stirling numbers of both\nkinds which are $\\lambda$-analogues of Stirling numbers of both kinds. Those\nnumbers have nice combinatorial interpretations when $\\lambda$ are positive\nintegers. If $\\lambda$ =1, then the $\\lambda$-Stirling numbers of both kinds\nreduce to the Stirling numbers of both kinds. We derive new types of generating\nfunctions of the $\\lambda$-Stirling numbers of both kinds which are related to\nthe reciprocals of the generalized rising factorials. Furthermore, some related\nidentities are also derived from those generating functions. In addition, all\nthe corresponding results to the $\\lambda$-Stirling numbers of both kinds are\nobtained also for the $\\lambda$-analogues of r-Stirling numbers of both kinds\nwhich are generalizations of those numbers.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:42:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Dae san",""],["Kim","Hye Kyung",""],["Kim","Taekyun",""]]}
{"id":"2308.09487","submitter":"Binhao Ma","authors":"Binhao Ma, Jiahui Wang, Dejun Wang, Bo Meng","title":"Poison Dart Frog: A Clean-Label Attack with Low Poisoning Rate and High\n  Attack Success Rate in the Absence of Training Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To successfully launch backdoor attacks, injected data needs to be correctly\nlabeled; otherwise, they can be easily detected by even basic data filters.\nHence, the concept of clean-label attacks was introduced, which is more\ndangerous as it doesn't require changing the labels of injected data. To the\nbest of our knowledge, the existing clean-label backdoor attacks largely relies\non an understanding of the entire training set or a portion of it. However, in\npractice, it is very difficult for attackers to have it because of training\ndatasets often collected from multiple independent sources. Unlike all current\nclean-label attacks, we propose a novel clean label method called 'Poison Dart\nFrog'. Poison Dart Frog does not require access to any training data; it only\nnecessitates knowledge of the target class for the attack, such as 'frog'. On\nCIFAR10, Tiny-ImageNet, and TSRD, with a mere 0.1\\%, 0.025\\%, and 0.4\\%\npoisoning rate of the training set size, respectively, Poison Dart Frog\nachieves a high Attack Success Rate compared to LC, HTBA, BadNets, and Blend.\nFurthermore, compared to the state-of-the-art attack, NARCISSUS, Poison Dart\nFrog achieves similar attack success rates without any training data. Finally,\nwe demonstrate that four typical backdoor defense algorithms struggle to\ncounter Poison Dart Frog.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:49:33 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 11:06:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Binhao",""],["Wang","Jiahui",""],["Wang","Dejun",""],["Meng","Bo",""]]}
{"id":"2308.09488","submitter":"Abdul Wahid","authors":"Hossein Khaleghy, Abdul Wahid, Eoghan Clifford, Karl Mason","title":"Modelling Electricity Consumption in Irish Dairy Farms Using Agent-Based\n  Modelling","comments":"This paper has been accepted at the 2023 Artificial Intelligence for\n  Sustainability (AI4S) Workshop, at 26th European Conference on Artificial\n  Intelligence ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dairy farming can be an energy intensive form of farming. Understanding the\nfactors affecting electricity consumption on dairy farms is crucial for farm\nowners and energy providers. In order to accurately estimate electricity\ndemands in dairy farms, it is necessary to develop a model. In this research\npaper, an agent-based model is proposed to model the electricity consumption of\nIrish dairy farms. The model takes into account various factors that affect the\nenergy consumption of dairy farms, including herd size, number of milking\nmachines, and time of year. The outputs are validated using existing\nstate-of-the-art dairy farm modelling frameworks. The proposed agent-based\nmodel is fully explainable, which is an advantage over other Artificial\nIntelligence techniques, e.g. deep learning.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:54:38 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Khaleghy","Hossein",""],["Wahid","Abdul",""],["Clifford","Eoghan",""],["Mason","Karl",""]]}
{"id":"2308.09489","submitter":"Guofa Cai","authors":"Kengyuan Xie, Guofa Cai, Jiguang He, Georges Kaddoum","title":"STAR-RIS Aided MISO SWIPT-NOMA System with Energy Buffer: Performance\n  Analysis and Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a simultaneous transmitting and reflecting\nreconfigurable intelligent surface (STAR-RIS) and energy buffer aided\nmultiple-input single-output (MISO) simultaneous wireless information and power\ntransfer (SWIPT) non-orthogonal multiple access (NOMA) system, which consists\nof a STAR-RIS, an access point (AP), and reflection users and transmission\nusers with energy buffers. In the proposed system, the multi-antenna AP can\ntransmit information and energy to several single-antenna reflection and\ntransmission users simultaneously in a NOMA fashion, where the power transfer\nand information transmission states of the users are modeled using Markov\nchains. The reflection and transmission users harvest and store the energy in\nenergy buffers as additional power supplies. The power outage probability,\ninformation outage probability, sum throughput, and joint outage probability\nclosed-form expressions of the proposed system are derived over Nakagami-m\nfading channels, which are validated via simulations. Results demonstrate that\nthe proposed system achieves better performance in comparison to the STAR-RIS\naided MISO SWIPT-NOMA buffer-less, conventional RIS and energy buffer aided\nMISO SWIPT-NOMA, and STAR-RIS and energy buffer aided MISO SWIPT-time-division\nmultiple access (TDMA) systems. Furthermore, a particle swarm optimization\nbased power allocation (PSO-PA) algorithm is designed to maximize the sum\nthroughput with a constraint on the joint outage probability. Simulation\nresults illustrate that the proposed PSO-PA algorithm can achieve an improved\nsum throughput performance of the proposed system.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:56:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xie","Kengyuan",""],["Cai","Guofa",""],["He","Jiguang",""],["Kaddoum","Georges",""]]}
{"id":"2308.09490","submitter":"Lukas Struppek","authors":"Dominik Hintersdorf, Lukas Struppek, Kristian Kersting","title":"Balancing Transparency and Risk: The Security and Privacy Risks of\n  Open-Source Machine Learning Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The field of artificial intelligence (AI) has experienced remarkable progress\nin recent years, driven by the widespread adoption of open-source machine\nlearning models in both research and industry. Considering the\nresource-intensive nature of training on vast datasets, many applications opt\nfor models that have already been trained. Hence, a small number of key players\nundertake the responsibility of training and publicly releasing large\npre-trained models, providing a crucial foundation for a wide range of\napplications. However, the adoption of these open-source models carries\ninherent privacy and security risks that are often overlooked. To provide a\nconcrete example, an inconspicuous model may conceal hidden functionalities\nthat, when triggered by specific input patterns, can manipulate the behavior of\nthe system, such as instructing self-driving cars to ignore the presence of\nother vehicles. The implications of successful privacy and security attacks\nencompass a broad spectrum, ranging from relatively minor damage like service\ninterruptions to highly alarming scenarios, including physical harm or the\nexposure of sensitive user data. In this work, we present a comprehensive\noverview of common privacy and security threats associated with the use of\nopen-source models. By raising awareness of these dangers, we strive to promote\nthe responsible and secure use of AI systems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:59:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hintersdorf","Dominik",""],["Struppek","Lukas",""],["Kersting","Kristian",""]]}
{"id":"2308.09491","submitter":"Xiumei Wang","authors":"Deyu Wu, Yipei Zhang, Xiumei Wang","title":"A note on removable edges in near-bricks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also\nmatching covered. Carvalho, Lucchesi, and Murty showed that every brick $G$\ndifferent from $K_4$ and $\\overline{C_6}$ has at least $\\Delta-2$ removable\nedges, where $\\Delta$ is the maximum degree of $G$. In this paper, we\ngeneralize the result to irreducible near-bricks, where a graph is irreducible\nif it contains no induced odd path of length three or more.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:00:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Deyu",""],["Zhang","Yipei",""],["Wang","Xiumei",""]]}
{"id":"2308.09492","submitter":"Gregor Maier","authors":"Gregor Maier, Jan Hamaekers, Dominik-Sergio Martilotti, Benedikt\n  Ziebarth","title":"Predicting Properties of Oxide Glasses Using Informed Neural Networks","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.dis-nn cond-mat.soft","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Many modern-day applications require the development of new materials with\nspecific properties. In particular, the design of new glass compositions is of\ngreat industrial interest. Current machine learning methods for learning the\ncomposition-property relationship of glasses promise to save on expensive\ntrial-and-error approaches. Even though quite large datasets on the composition\nof glasses and their properties already exist (i.e., with more than 350,000\nsamples), they cover only a very small fraction of the space of all possible\nglass compositions. This limits the applicability of purely data-driven models\nfor property prediction purposes and necessitates the development of models\nwith high extrapolation power. In this paper, we propose a neural network model\nwhich incorporates prior scientific and expert knowledge in its learning\npipeline. This informed learning approach leads to an improved extrapolation\npower compared to blind (uninformed) neural network models. To demonstrate\nthis, we train our models to predict three different material properties, that\nis, the glass transition temperature, the Young's modulus (at room\ntemperature), and the shear modulus of binary oxide glasses which do not\ncontain sodium. As representatives for conventional blind neural network\napproaches we use five different feed-forward neural networks of varying widths\nand depths. For each property, we set up model ensembles of multiple trained\nmodels and show that, on average, our proposed informed model performs better\nin extrapolating the three properties of previously unseen sodium borate glass\nsamples than all five conventional blind models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:02:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Maier","Gregor",""],["Hamaekers","Jan",""],["Martilotti","Dominik-Sergio",""],["Ziebarth","Benedikt",""]]}
{"id":"2308.09493","submitter":"Arijit Biswas","authors":"Guanxin Jiang, Lars Villemoes, Arijit Biswas","title":"Generative Machine Listener","comments":"Accepted to 155th Audio Engineering Society (AES) Convention, New\n  York, NY, USA, October 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show how a neural network can be trained on individual intrusive listening\ntest scores to predict a distribution of scores for each pair of reference and\ncoded input stereo or binaural signals. We nickname this method the Generative\nMachine Listener (GML), as it is capable of generating an arbitrary amount of\nsimulated listening test data. Compared to a baseline system using regression\nover mean scores, we observe lower outlier ratios (OR) for the mean score\npredictions, and obtain easy access to the prediction of confidence intervals\n(CI). The introduction of data augmentation techniques from the image domain\nresults in a significant increase in CI prediction accuracy as well as Pearson\nand Spearman rank correlation of mean scores.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:07:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiang","Guanxin",""],["Villemoes","Lars",""],["Biswas","Arijit",""]]}
{"id":"2308.09494","submitter":"R\\'obert Kov\\'acs","authors":"A. J. A. Ramos, A. D. S. Campelo, M. M. Freitas, R. Kov\\'acs","title":"Numerical analysis of the Maxwell-Cattaneo-Vernotte nonlinear model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the literature, one can find numerous modifications of Fourier's law from\nwhich the first one is called Maxwell-Cattaneo-Vernotte heat equation. Although\nthis model has been known for decades and successfully used to model\nlow-temperature damped heat wave propagation, its nonlinear properties are\nrarely investigated. In this paper, we aim to present the functional\nrelationship between the transport coefficients and the consequences of their\ntemperature dependence. Furthermore, we introduce a particular implicit\nnumerical scheme in order to solve such nonlinear heat equations reliably. We\ninvestigate the scheme's stability, dissipation, and dispersion attributes as\nwell. We demonstrate the effect of temperature-dependent thermal conductivity\non two different initial-boundary value problems, including time-dependent\nboundaries and heterogeneous initial conditions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:09:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ramos","A. J. A.",""],["Campelo","A. D. S.",""],["Freitas","M. M.",""],["Kov\u00e1cs","R.",""]]}
{"id":"2308.09495","submitter":"Henrik Koch","authors":"Sarai Dery Folkestad, Alexander C. Paul, Regina Paul, Sonia Coriani,\n  Michael Odelius, Marcella Iannuzzi, Henrik Koch","title":"Enhanced understanding of X-ray absorption in liquid water using novel\n  coupled cluster methodologies","comments":"25 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a rigorous charge transfer analysis of the X-ray absorption (XA)\nspectrum of liquid water. Unprecedented reliability of the analysis is achieved\nby employing newly developed coupled cluster methods for large molecular\nsystems. We combine coupled cluster singles and doubles (CCSD) and coupled\ncluster singles, doubles, and perturbative triples (CC3) in a multilevel\nframework. This new methodology allows us to overcome the size limitations of\nstandard coupled cluster theory and describe the delicate nature of\nintermolecular interactions in liquid water. Using molecular geometries from\nstate-of-the-art path-integral molecular dynamics, we obtain excellent\nagreement with the experimental XA spectrum. The quantitative charge transfer\nanalysis aligns with prior hypotheses regarding the character of the prominent\nfeatures of the spectrum. Additionally, we show that an accurate description of\nthe electronic structure within the first solvation shell is sufficient to\nmodel the XA spectrum of liquid water.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:10:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Folkestad","Sarai Dery",""],["Paul","Alexander C.",""],["Paul","Regina",""],["Coriani","Sonia",""],["Odelius","Michael",""],["Iannuzzi","Marcella",""],["Koch","Henrik",""]]}
{"id":"2308.09496","submitter":"Jing Ye","authors":"Jing Ye, John C. Raymond, Zhixing Mei, Qiangwei Cai, Yuhao Chen, Yan\n  Li, Jun Lin","title":"Three-dimensional simulation of thermodynamics on confined turbulence in\n  a large-scale CME-flare current sheet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Turbulence plays a key role for forming the complex geometry of the\nlarge-scale current sheet (CS) and fast energy release in a solar eruption. In\nthis paper, we present full 3D high-resolution simulations for the process of a\nmoderate Coronal Mass Ejection (CME) and the thermodynamical evolution of the\nhighly confined CS. Copious elongated blobs are generated due to tearing and\nplasmoid instabilities giving rise to a higher reconnection rate and undergo\nthe splitting, merging and kinking processes in a more complex way in 3D. A\ndetailed thermodynamical analysis shows that the CS is mainly heated by\nadiabatic and numerical viscous terms, and thermal conduction is the dominant\nfactor that balances the energy inside the CS. Accordingly, the temperature of\nthe CS reaches to a maximum of about 20 MK and the range of temperatures is\nrelatively narrow. From the face-on view in the synthetic Atmospheric Imaging\nAssembly 131 $\\mathring{A}$, the downflowing structures with similar morphology\nto supra-arcade downflows are mainly located between the post-flare loops and\nloop-top, while moving blobs can extend spikes higher above the loop-top. The\ndownward-moving plasmoids can keep the twisted magnetic field configuration\nuntil the annihilation at the flare loop-top, indicating that plasmoid\nreconnection dominates in the lower CS. Meanwhile, the upward-moving ones turn\ninto turbulent structures before arriving at the bottom of the CME, implying\nthat turbulent reconnection dominates in the upper CS. The spatial\ndistributions of the turbulent energy and anisotropy are addressed, which show\na significant variation in the spectra with height.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:12:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ye","Jing",""],["Raymond","John C.",""],["Mei","Zhixing",""],["Cai","Qiangwei",""],["Chen","Yuhao",""],["Li","Yan",""],["Lin","Jun",""]]}
{"id":"2308.09497","submitter":"Jayr Pereira","authors":"Jayr Pereira, Rodrigo Nogueira, Cleber Zanchettin, Robson Fidalgo","title":"Predictive Authoring for Brazilian Portuguese Augmentative and\n  Alternative Communication","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":"  Individuals with complex communication needs (CCN) often rely on augmentative\nand alternative communication (AAC) systems to have conversations and\ncommunique their wants. Such systems allow message authoring by arranging\npictograms in sequence. However, the difficulty of finding the desired item to\ncomplete a sentence can increase as the user's vocabulary increases. This paper\nproposes using BERTimbau, a Brazilian Portuguese version of BERT, for pictogram\nprediction in AAC systems. To finetune BERTimbau, we constructed an AAC corpus\nfor Brazilian Portuguese to use as a training corpus. We tested different\napproaches to representing a pictogram for prediction: as a word (using\npictogram captions), as a concept (using a dictionary definition), and as a set\nof synonyms (using related terms). We also evaluated the usage of images for\npictogram prediction. The results demonstrate that using embeddings computed\nfrom the pictograms' caption, synonyms, or definitions have a similar\nperformance. Using synonyms leads to lower perplexity, but using captions leads\nto the highest accuracies. This paper provides insight into how to represent a\npictogram for prediction using a BERT-like model and the potential of using\nimages for pictogram prediction.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:14:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pereira","Jayr",""],["Nogueira","Rodrigo",""],["Zanchettin","Cleber",""],["Fidalgo","Robson",""]]}
{"id":"2308.09498","submitter":"Lukas Spiegelhofer","authors":"Lukas Spiegelhofer","title":"Thue--Morse along the sequence of cubes","comments":"49 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathsf t=\\mathtt{01101001}\\cdots$ be the Thue--Morse word over the\nalphabet $\\{\\mathtt 0,\\mathtt 1\\}$. This automatic sequence can be defined as\nthe binary sum-of-digits function $\\mathsf s:\\mathbb N\\rightarrow\\mathbb N$,\nreduced modulo $2$. We prove that the asymptotic density of the set of natural\nnumbers $n$ satisfying $\\mathsf t(n^3)=\\mathtt 0$ equals $1/2$. Comparable\nresults, featuring asymptotic equivalence along a polynomial as in our theorem,\nwere previously only known for the linear case [A. O. Gelfond, Acta Arith. 13\n(1967/68), 259--265], and for the sequence of squares. The main theorem in [C.\nMauduit and J. Rivat, Acta Math. 203 (2009), no. 1, 107--148] was the first\nresult for the sequence of squares.\n  Concerning the sum-of-digits function along polynomials $p$ of degree at\nleast three, previous results were restricted either to lower bounds (such as\nfor the numbers $\\#\\{n<N:\\mathsf t(p(n))=\\mathtt 0\\}$), or to sum-of-digits\nfunctions in \"sufficiently large bases\". By proving an asymptotic equivalence\nfor the case of the Thue--Morse sequence, and a cubic polynomial, we move one\nstep closer to the solution of the third Gelfond problem on the sum-of-digits\nfunction (1967/1968), op. cit.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:14:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Spiegelhofer","Lukas",""]]}
{"id":"2308.09499","submitter":"Wendong Bi","authors":"Wendong Bi, Xueqi Cheng, Bingbing Xu, Xiaoqian Sun, Li Xu, Huawei Shen","title":"Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfer","comments":"Accepted by CIKM2023","journal-ref":null,"doi":"10.1145/3583780.3614796","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The data-hungry problem, characterized by insufficiency and low-quality of\ndata, poses obstacles for deep learning models. Transfer learning has been a\nfeasible way to transfer knowledge from high-quality external data of source\ndomains to limited data of target domains, which follows a domain-level\nknowledge transfer to learn a shared posterior distribution. However, they are\nusually built on strong assumptions, e.g., the domain invariant posterior\ndistribution, which is usually unsatisfied and may introduce noises, resulting\nin poor generalization ability on target domains. Inspired by Graph Neural\nNetworks (GNNs) that aggregate information from neighboring nodes, we redefine\nthe paradigm as learning a knowledge-enhanced posterior distribution for target\ndomains, namely Knowledge Bridge Learning (KBL). KBL first learns the scope of\nknowledge transfer by constructing a Bridged-Graph that connects knowledgeable\nsamples to each target sample and then performs sample-wise knowledge transfer\nvia GNNs.KBL is free from strong assumptions and is robust to noises in the\nsource data. Guided by KBL, we propose the Bridged-GNN} including an Adaptive\nKnowledge Retrieval module to build Bridged-Graph and a Graph Knowledge\nTransfer module. Comprehensive experiments on both un-relational and relational\ndata-hungry scenarios demonstrate the significant improvements of Bridged-GNN\ncompared with SOTA methods\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:14:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bi","Wendong",""],["Cheng","Xueqi",""],["Xu","Bingbing",""],["Sun","Xiaoqian",""],["Xu","Li",""],["Shen","Huawei",""]]}
{"id":"2308.09500","submitter":"Maria Bras-Amor\\'os","authors":"Mariana Rosas-Ribeiro and Maria Bras-Amor\\'os","title":"Infinite chains in the tree of numerical semigroups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.AC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  One major problem in the study of numerical semigroups is determining the\ngrowth of the semigroup tree. In the present work, infinite chains of numerical\nsemigroups in the semigroup tree, firstly introduced in Bras-Amor\\'os and\nNulygin (2009), are studied. Computational results show that these chains are\nrare, but without them the tree would not be infinite. It is proved that for\neach genus $g\\geq 5$ there are more semigroups of that genus not belonging to\ninfinite chains than semigroups belonging. The reference Bras-Amor\\'os and\nBulygin (2009) presented a characterization of the semigroups that belong to\ninfinite chains in terms of the coprimality of the left elements of the\nsemigroup as well as a result on the cardinality of the set of infinite chains\nto which a numerical semigroup belongs in terms of the primality of the\ngreatest common divisor of these left elements. We revisit these results and\nfix an imprecision on the cardinality of the set of infinite chains to which a\nsemigroup belongs in the case when the greatest common divisor of the left\nelements is a prime number. We then look at infinite chains in subtrees with\nfixed multiplicity. When the multiplicity is a prime number there is only one\ninfinite chain in the tree of semigroups with such multiplicity. When the\nmultpliplicity is $4$ or $6$ we prove a self-replication behavior in the\nsubtree and prove a formula for the number of semigroups in infinite chains of\na given genus and multiplicity $4$ and $6$, respectively.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:15:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rosas-Ribeiro","Mariana",""],["Bras-Amor\u00f3s","Maria",""]]}
{"id":"2308.09501","submitter":"\\v{S}imon Schierreich","authors":"\\v{S}imon Schierreich","title":"Anonymous Refugee Housing with Upper-Bounds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knop and Schierreich [AAMAS '23] recently introduced a novel model of refugee\nhousing and specifically asked for the computational complexity picture of the\nfollowing variant. Given a topology modelled as an undirected graph, a set of\ninhabitants, a number of refugees $R$, an assignment of inhabitants to houses\nof the topology, and an upper-bound for every inhabitant, find a set $\\pi$ of\nunoccupied houses of size $R$ intended such that the number of refugees in the\nneighbourhood of every inhabitant is at most its upper-bound. If such a set\n$\\pi$ exists, we say that the instance admits an inhabitant-respecting housing.\n  In this paper, we show that the existence of inhabitant-respecting housing is\nnot guaranteed even under several further restrictions of the upper-bounds.\nThen, we focus on the computational complexity of deciding whether\ninhabitant-respecting housing exists. To this end, we provide tractable\nalgorithms for several restrictions of the topology. We complement these\nresults with appropriate hardness results and running-time lower-bounds.\nFurthermore, we introduce a relaxed (or approximate) version of the\ninhabitant-respecting housing, where we allow at most $t$ upper-bounds to be\nexceeded.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:16:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Schierreich","\u0160imon",""]]}
{"id":"2308.09502","submitter":"Francesco Taglino","authors":"Anna Formica and Francesco Taglino","title":"Semantic relatedness in DBpedia: A comparative and experimental\n  assessment","comments":"37 pages, 16 figures","journal-ref":"Information Sciences (ISSN 0020-0255), Volume 621, 2023, 474-505","doi":"10.1016/j.ins.2022.11.025","report-no":null,"categories":"cs.AI cs.CL cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Evaluating semantic relatedness of Web resources is still an open challenge.\nThis paper focuses on knowledge-based methods, which represent an alternative\nto corpus-based approaches, and rely in general on the availability of\nknowledge graphs. In particular, we have selected 10 methods from the existing\nliterature, that have been organized according to it adjacent resources, triple\npatterns, and triple weights-based methods. They have been implemented and\nevaluated by using DBpedia as reference RDF knowledge graph. Since DBpedia is\ncontinuously evolving, the experimental results provided by these methods in\nthe literature are not comparable. For this reason, in this work, such methods\nhave been experimented by running them all at once on the same DBpedia release\nand against 14 well-known golden datasets. On the basis of the correlation\nvalues with human judgment obtained according to the experimental results,\nweighting the RDF triples in combination with evaluating all the directed paths\nlinking the compared resources is the best strategy in order to compute\nsemantic relatedness in DBpedia.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:26:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Formica","Anna",""],["Taglino","Francesco",""]]}
{"id":"2308.09503","submitter":"Paulo Jos\\'e Ferreira Porf\\'irio Da Silva","authors":"D. Bazeia, R. Menezes, A. Yu. Petrov, P. J. Porf\\'irio","title":"New brane-like solutions in modified four-dimensional Gauss-Bonnet\n  gravity","comments":"24 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate solutions of a new $4D$ Gauss-Bonnet gravity. We first\ndescribe the bulk vacuum solution, then we add a massive probe scalar field,\nand we follow considering a self-interacting scalar field which acts as a\nsource to support thick brane solutions in the four-dimensional Gauss-Bonnet\nscenario with a single extra dimension of infinite extent. We illustrate our\nresults with some distinct brane-like configurations engendering controllable\nthickness.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:28:13 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 22:42:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bazeia","D.",""],["Menezes","R.",""],["Petrov","A. Yu.",""],["Porf\u00edrio","P. J.",""]]}
{"id":"2308.09504","submitter":"Pierre BON","authors":"Minh-Chau Nguyen (XLIM-PHOT), Pierre Bon (XLIM-PHOT)","title":"Optical signal-based improvement of individual nanoparticle tracking\n  analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nanoparticle Tracking Analysis (NTA) provides a simple method to determine\nindividual nanoparticle size. However, because size quantification is based on\nthe slowly converging statistical law of random event, its intrinsic error is\nlarge, especially in case of limited event number, e.g. for weak scattering\nnanoparticles. Here, we introduce an NTA improvement by analyzing each\nindividual NP trajectory while taking into account the other trajectories with\na weighting coefficient. This weighting coefficient is directly derived from\nthe optical signature of each particle measured by quantitative phase\nmicroscopy. The simulations and experimental results demonstrate the\nimprovement of NTA accuracy, not only for mono-disperse but also for\npoly-disperse particle solutions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:29:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nguyen","Minh-Chau","","XLIM-PHOT"],["Bon","Pierre","","XLIM-PHOT"]]}
{"id":"2308.09505","submitter":"Claire Guimond","authors":"Claire Marie Guimond, Oliver Shorttle, Sean Jordan, John F. Rudge","title":"A mineralogical reason why all exoplanets cannot be equally oxidising","comments":"16 pages, 7 figures, accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2486","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  From core to atmosphere, the oxidation states of elements in a planet shape\nits character. Oxygen fugacity (fO$_2$) is one parameter indicating these\nlikely oxidation states. The ongoing search for atmospheres on rocky exoplanets\nbenefits from understanding the plausible variety of their compositions, which\ndepends strongly on their oxidation states -- and if derived from interior\noutgassing, on the fO$_2$ at the top of their silicate mantles. This fO$_2$\nmust vary across compositionally-diverse exoplanets, but for a given planet its\nvalue is unconstrained insofar as it depends on how iron (the dominant\nmultivalent element) is partitioned between its 2+ and 3+ oxidation states.\nHere we focus on another factor influencing how oxidising a mantle is -- a\nfactor modulating fO$_2$ even at fixed Fe$^{3+}$/Fe$^{2+}$ -- the planet's\nmineralogy. Only certain minerals (e.g., pyroxenes) incorporate Fe$^{3+}$.\nHaving such minerals in smaller mantle proportions concentrates Fe$^{3+}$,\nincreasing fO$_2$. Mineral proportions change within planets according to\npressure, and between planets according to bulk composition. Constrained by\nobserved host star refractory abundances, we calculate a minimum fO$_2$\nvariability across exoplanet mantles, of at least two orders of magnitude, due\nto mineralogy alone. This variability is enough to alter by a hundredfold the\nmixing ratio of SO$_2$ directly outgassed from these mantles. We further\npredict that planets orbiting high-Mg/Si stars are more likely to outgas\ndetectable amounts of SO$_2$ and H$_2$O; and for low-Mg/Si stars, detectable\nCH$_4$, all else equal. Even absent predictions of Fe$^{3+}$ budgets, general\ninsights can be obtained into how oxidising an exoplanet's mantle is.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:30:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Guimond","Claire Marie",""],["Shorttle","Oliver",""],["Jordan","Sean",""],["Rudge","John F.",""]]}
{"id":"2308.09506","submitter":"Andreas Grendas","authors":"Andreas Grendas and Benjamin Marussig","title":"Multi-level B\\'ezier extraction of truncated hierarchical B-splines for\n  isogeometric analysis","comments":"9 pages, submitted to Proceedings in Applied Mathematics and\n  Mechanics 2023 (PAMM)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multivariate B-splines and Non-uniform rational B-splines (NURBS) lack\nadaptivity due to their tensor product structure. Truncated hierarchical\nB-splines (THB-splines) provide a solution for this. THB-splines organize the\nparameter space into a hierarchical structure, which enables efficient\napproximation and representation of functions with different levels of detail.\nThe truncation mechanism ensures the partition of unity property of B-splines\nand defines a more scattered set of basis functions without overlapping on the\nmulti-level spline space. Transferring these multi-level splines into B\\'ezier\nelements representation facilitates straightforward incorporation into existing\nfinite element (FE) codes. By separating the multi-level extraction of the\nTHB-splines from the standard B\\'ezier extraction, a more general independent\nframework applicable to any sequence of nested spaces is created. The operators\nfor the multi-level structure of THB-splines and the operators of B\\'ezier\nextraction are constructed in a local approach. Adjusting the operators for the\nmulti-level structure from an element point of view and multiplying with the\nB\\'ezier extraction operators of those elements, a direct map between B\\'ezier\nelements and a hierarchical structure is obtained. The presented implementation\ninvolves the use of an open-source Octave/MATLAB isogeometric analysis (IGA)\ncode called GeoPDEs. A basic Poisson problem is presented to investigate the\nperformance of multi-level B\\'ezier extraction compared to a standard\nTHB-spline approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:32:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Grendas","Andreas",""],["Marussig","Benjamin",""]]}
{"id":"2308.09507","submitter":"Jon Arrizabalaga","authors":"Jon Arrizabalaga, Markus Ryll","title":"Pose-Following with Dual Quaternions","comments":"This paper has been accepted for publication at the IEEE Conference\n  on Decision and Control (CDC), 2023. Copyright @ IEEE","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 work focuses on pose-following, a variant of path-following in which the\ngoal is to steer the system's position and attitude along a path with a moving\nframe attached to it. Full body motion control, while accounting for the\nadditional freedom to self-regulate the progress along the path, is an\nappealing trade-off. Towards this end, we extend the well-established dual\nquaternion-based pose-tracking method into a pose-following control law.\nSpecifically, we derive the equations of motion for the full pose error between\nthe geometric reference and the rigid body in the form of a dual quaternion and\ndual twist. Subsequently, we formulate an almost globally asymptotically stable\ncontrol law. The global attractivity of the presented approach is validated in\na spatial example, while its benefits over pose-tracking are showcased through\na planar case-study.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:34:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Arrizabalaga","Jon",""],["Ryll","Markus",""]]}
{"id":"2308.09508","submitter":"Jakkrit Sangtawee","authors":"Saikat Chakraborty, Khamphee Karwan and Jakkrit Sangtawee","title":"Observational predictions of inflationary model in spatially covariant\n  gravity with two tensorial degrees of freedom for gravity","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the inflationary model constructed from a Spatially Covariant\nGravity (SCG). The Lagrangian for the SCG in our consideration is expressed as\nthe polynomial of irreducible SCG monomials where the total number of\nderivatives of each monomial is two, and the theory propagates two tensorial\ndegrees of freedom of gravity up to the first order in cosmological\nperturbations. The condition for having two tensorial degrees of freedom\nstudied earlier in literature for such theories is derived in vacuum. We extend\nthe condition for having two tensorial degrees of freedom to the case where a\nscalar field is included by imposing a gauge-fixing. We apply the resulting SCG\nto describe inflationary universe. The observational predictions such as the\nscalar spectral index and tensor-to-scalar ratio from this model are\ninvestigated. We find that the tensor-to-scalar ratio in this model can either\nbe in the order of unity or be small depending on the parameter of the model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:36:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chakraborty","Saikat",""],["Karwan","Khamphee",""],["Sangtawee","Jakkrit",""]]}
{"id":"2308.09509","submitter":"Dhanushka(Dan) Hewaralalage Subath Amaradasa","authors":"Dhanushka Subath Amaradasa Hewaralalage, Ian Sherrington, Nathalie\n  Renevier, Mara Bernabei, Ali Ghanbari","title":"A Review of Space Tribology Experiments in Low Earth Orbit: Challenges\n  and Opportunities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Operating mechanical devices in low earth orbit (LEO) environment presents\nunique challenges due to adverse effects of the LEO environment on lubricants\nand materials in tribo-mechanisms. These challenges include corrosion due to\natomic oxygen, molecular degradation of materials and fluids due to radiation,\ntemperature extremes influencing lubricant viscosity, and rapid evaporative\nloss of fluids in vacuum conditions. Therefore, lubricants for mechanisms and\ncomponents such as bearings and gears for spacecraft should be tested\nextensively in both air and vacuum to ensure their continuous and accurate\nfunction. Literature on ground based tribo-testing is extensive and\nwell-established. However, tribological investigations conducted in LEO are\nmuch fewer in number. The purpose of this paper is to draw together details of\ntribology experiments of this type, to try to clarify their purpose and value.\nThis review presents these studies according to a thematic categorization of\nthe mechanisms involved.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:39:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hewaralalage","Dhanushka Subath Amaradasa",""],["Sherrington","Ian",""],["Renevier","Nathalie",""],["Bernabei","Mara",""],["Ghanbari","Ali",""]]}
{"id":"2308.09510","submitter":"Max Tschaikowski","authors":"Antonio Jim\\'enez-Pastor, Kim G. Larsen, Mirco Tribastone, Max\n  Tschaikowski","title":"Efficient Simulation of Quantum Circuits by Model Order Reduction","comments":"15 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient methods for the simulation of quantum circuits on classic computers\nare crucial for their improvement and better understanding. Unfortunately,\nclassic array-based simulation of quantum circuits suffers from the curse of\ndimensionality because the size of the arrays is exponential in the number of\nqubits. Starting from the observation that results of quantum circuits are\noften evaluated by means of quantum measurements that capture only a subpart of\nthe entire quantum state, we reinterpret established reduction techniques as\nmeasurement-preserving reductions of quantum circuits. We further identify\nconditions under which the entire quantum state can be recovered from the\nreduced circuit and quantify the error whenever this is not possible. Finally,\nwe demonstrate the applicability of model reduction approaches in quantum\ncomputing by conducting a large-scale evaluation of quantum computing\nbenchmarks using an extension of the model reduction tool CLUE.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:40:47 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:46:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jim\u00e9nez-Pastor","Antonio",""],["Larsen","Kim G.",""],["Tribastone","Mirco",""],["Tschaikowski","Max",""]]}
{"id":"2308.09511","submitter":"Davide Abati","authors":"Davide Abati, Haitam Ben Yahia, Markus Nagel, Amirhossein Habibian","title":"ResQ: Residual Quantization for Video Perception","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper accelerates video perception, such as semantic segmentation and\nhuman pose estimation, by levering cross-frame redundancies. Unlike the\nexisting approaches, which avoid redundant computations by warping the past\nfeatures using optical-flow or by performing sparse convolutions on frame\ndifferences, we approach the problem from a new perspective: low-bit\nquantization. We observe that residuals, as the difference in network\nactivations between two neighboring frames, exhibit properties that make them\nhighly quantizable. Based on this observation, we propose a novel quantization\nscheme for video networks coined as Residual Quantization. ResQ extends the\nstandard, frame-by-frame, quantization scheme by incorporating temporal\ndependencies that lead to better performance in terms of accuracy vs.\nbit-width. Furthermore, we extend our model to dynamically adjust the bit-width\nproportional to the amount of changes in the video. We demonstrate the\nsuperiority of our model, against the standard quantization and existing\nefficient video perception models, using various architectures on semantic\nsegmentation and human pose estimation benchmarks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:41:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Abati","Davide",""],["Yahia","Haitam Ben",""],["Nagel","Markus",""],["Habibian","Amirhossein",""]]}
{"id":"2308.09512","submitter":"Lipeng Zhu","authors":"Zhenyu Xiao, Xiangyu Pi, Lipeng Zhu, Xiang-Gen Xia, and Rui Zhang","title":"Multiuser Communications with Movable-Antenna Base Station: Joint\n  Antenna Positioning, Receive Combining, and Power Control","comments":"arXiv admin note: substantial text overlap with arXiv:2308.05546","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 antenna (MA) is an emerging technology which enables a local movement\nof the antenna in the transmitter/receiver region for improving the channel\ncondition and communication performance. In this paper, we study the deployment\nof multiple MAs at the base station (BS) for enhancing the multiuser\ncommunication performance. First, we model the multiuser channel in the uplink\nto characterize the wireless channel variation due to MAs' movements at the BS.\nThen, an optimization problem is formulated to maximize the minimum achievable\nrate among multiple users for MA-aided uplink multiuser communications by\njointly optimizing the MAs' positions, their receive combining at the BS, and\nthe transmit power of users, under the constraints of finite moving region for\nMAs, minimum inter-MA distance, and maximum transmit power of each user. To\nsolve this challenging non-convex optimization problem, a two-loop iterative\nalgorithm is proposed by leveraging the particle swarm optimization (PSO)\nmethod. Specifically, the outer-loop updates the positions of a set of\nparticles, where each particle's position represents one realization of the\nantenna position vector (APV) of all MAs. The inner-loop implements the fitness\nevaluation for each particle in terms of the max-min achievable rate of\nmultiple users with its corresponding APV, where the receive combining matrix\nof the BS and the transmit power of each user are optimized by applying the\nblock coordinate descent (BCD) technique. Simulation results show that the\nantenna position optimization for MAs-aided BSs can significantly improve the\nrate performance as compared to conventional BSs with fixed-position antennas\n(FPAs).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:44:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xiao","Zhenyu",""],["Pi","Xiangyu",""],["Zhu","Lipeng",""],["Xia","Xiang-Gen",""],["Zhang","Rui",""]]}
{"id":"2308.09513","submitter":"Kosmas Tsakmakidis","authors":"Grigorios P. Zouros, Iridanos Loulas, Evangelos Almpanis, Alex\n  Krasnok, and Kosmas L. Tsakmakidis","title":"Anisotropic Virtual Gain and Large Tuning of Particles' Scattering by\n  Complex-Frequency Excitations","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Active tuning of the scattering of particles and metasurfaces is a highly\nsought-after property for a host of electromagnetic and photonic applications,\nbut it normally requires challenging-to-control tunable (reconfigurable) or\nactive (gain) media. Here, we introduce the concepts of anisotropic virtual\ngain and oblique Kerker effect, where a completely lossy anisotropic medium\nbehaves exactly as its anisotropic gain counterpart upon excitation by a\nsynthetic complex-frequency wave. The strategy allows one to largely tune the\nmagnitude and angle of a particle's scattering simply by changing the shape\n(envelope) of the incoming radiation, rather than by an involved medium-tuning\nmechanism. The so-attained anisotropic virtual gain enables directional\nsuper-scattering at an oblique direction with fine-management of the scattering\nangle. Our study, opening a unique light-management method, is based on\nanalytical techniques that allow multipolar decomposition of the scattered\nfield, and is found, throughout, to be in excellent agreement with full-wave\nsimulations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:44:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zouros","Grigorios P.",""],["Loulas","Iridanos",""],["Almpanis","Evangelos",""],["Krasnok","Alex",""],["Tsakmakidis","Kosmas L.",""]]}
{"id":"2308.09514","submitter":"Miguel Sarabia","authors":"Miguel Sarabia, Elena Menyaylenko, Alessandro Toso, Skyler Seto,\n  Zakaria Aldeneh, Shadi Pirhosseinloo, Luca Zappella, Barry-John Theobald,\n  Nicholas Apostoloff, Jonathan Sheaffer","title":"Spatial LibriSpeech: An Augmented Dataset for Spatial Audio Learning","comments":null,"journal-ref":"Proceedings of INTERSPEECH (2023), pp. 3724-3728","doi":"10.21437/Interspeech.2023-2117","report-no":null,"categories":"cs.SD cs.AI cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Spatial LibriSpeech, a spatial audio dataset with over 650 hours\nof 19-channel audio, first-order ambisonics, and optional distractor noise.\nSpatial LibriSpeech is designed for machine learning model training, and it\nincludes labels for source position, speaking direction, room acoustics and\ngeometry. Spatial LibriSpeech is generated by augmenting LibriSpeech samples\nwith 200k+ simulated acoustic conditions across 8k+ synthetic rooms. To\ndemonstrate the utility of our dataset, we train models on four spatial audio\ntasks, resulting in a median absolute error of 6.60{\\deg} on 3D source\nlocalization, 0.43m on distance, 90.66ms on T30, and 2.74dB on DRR estimation.\nWe show that the same models generalize well to widely-used evaluation\ndatasets, e.g., obtaining a median absolute error of 12.43{\\deg} on 3D source\nlocalization on TUT Sound Events 2018, and 157.32ms on T30 estimation on ACE\nChallenge.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:45:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sarabia","Miguel",""],["Menyaylenko","Elena",""],["Toso","Alessandro",""],["Seto","Skyler",""],["Aldeneh","Zakaria",""],["Pirhosseinloo","Shadi",""],["Zappella","Luca",""],["Theobald","Barry-John",""],["Apostoloff","Nicholas",""],["Sheaffer","Jonathan",""]]}
{"id":"2308.09515","submitter":"Ryan Wong","authors":"Ryan Wong, Necati Cihan Camgoz, Richard Bowden","title":"Learnt Contrastive Concept Embeddings for Sign Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In natural language processing (NLP) of spoken languages, word embeddings\nhave been shown to be a useful method to encode the meaning of words. Sign\nlanguages are visual languages, which require sign embeddings to capture the\nvisual and linguistic semantics of sign. Unlike many common approaches to Sign\nRecognition, we focus on explicitly creating sign embeddings that bridge the\ngap between sign language and spoken language. We propose a learning framework\nto derive LCC (Learnt Contrastive Concept) embeddings for sign language, a\nweakly supervised contrastive approach to learning sign embeddings. We train a\nvocabulary of embeddings that are based on the linguistic labels for sign\nvideo. Additionally, we develop a conceptual similarity loss which is able to\nutilise word embeddings from NLP methods to create sign embeddings that have\nbetter sign language to spoken language correspondence. These learnt\nrepresentations allow the model to automatically localise the sign in time. Our\napproach achieves state-of-the-art keypoint-based sign recognition performance\non the WLASL and BOBSL datasets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:47:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wong","Ryan",""],["Camgoz","Necati Cihan",""],["Bowden","Richard",""]]}
{"id":"2308.09516","submitter":"Yoosof Mashayekhi","authors":"Yoosof Mashayekhi, Bo Kang, Jefrey Lijffijt, Tijl De Bie","title":"ReCon: Reducing Congestion in Job Recommendation using Optimal Transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recommender systems may suffer from congestion, meaning that there is an\nunequal distribution of the items in how often they are recommended. Some items\nmay be recommended much more than others. Recommenders are increasingly used in\ndomains where items have limited availability, such as the job market, where\ncongestion is especially problematic: Recommending a vacancy -- for which\ntypically only one person will be hired -- to a large number of job seekers may\nlead to frustration for job seekers, as they may be applying for jobs where\nthey are not hired. This may also leave vacancies unfilled and result in job\nmarket inefficiency.\n  We propose a novel approach to job recommendation called ReCon, accounting\nfor the congestion problem. Our approach is to use an optimal transport\ncomponent to ensure a more equal spread of vacancies over job seekers, combined\nwith a job recommendation model in a multi-objective optimization problem. We\nevaluated our approach on two real-world job market datasets. The evaluation\nresults show that ReCon has good performance on both congestion-related (e.g.,\nCongestion) and desirability (e.g., NDCG) measures.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:49:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mashayekhi","Yoosof",""],["Kang","Bo",""],["Lijffijt","Jefrey",""],["De Bie","Tijl",""]]}
{"id":"2308.09517","submitter":"Van Thuy Hoang","authors":"Van Thuy Hoang and O-Joun Lee","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local\n  Connectivity and Role-based Similarity","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph representation learning (GRL) methods, such as graph neural networks\nand graph transformer models, have been successfully used to analyze\ngraph-structured data, mainly focusing on node classification and link\nprediction tasks. However, the existing studies mostly only consider local\nconnectivity while ignoring long-range connectivity and the roles of nodes. In\nthis paper, we propose Unified Graph Transformer Networks (UGT) that\neffectively integrate local and global structural information into fixed-length\nvector representations. First, UGT learns local structure by identifying the\nlocal substructures and aggregating features of the $k$-hop neighborhoods of\neach node. Second, we construct virtual edges, bridging distant nodes with\nstructural similarity to capture the long-range dependencies. Third, UGT learns\nunified representations through self-attention, encoding structural distance\nand $p$-step transition probability between node pairs. Furthermore, we propose\na self-supervised learning task that effectively learns transition probability\nto fuse local and global structural features, which could then be transferred\nto other downstream tasks. Experimental results on real-world benchmark\ndatasets over various downstream tasks showed that UGT significantly\noutperformed baselines that consist of state-of-the-art models. In addition,\nUGT reaches the expressive power of the third-order Weisfeiler-Lehman\nisomorphism test (3d-WL) in distinguishing non-isomorphic graph pairs. The\nsource code is available at\nhttps://github.com/NSLab-CUK/Unified-Graph-Transformer.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:49:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hoang","Van Thuy",""],["Lee","O-Joun",""]]}
{"id":"2308.09518","submitter":"Lukas Merten","authors":"Lukas Merten, Paolo Da Vela, Anita Reimer, Margot Boughelilba, Jon\n  Paul Lundquist, Serguei Vorobiov and Julia Becker Tjus","title":"Efficient Modeling of Heavy Cosmic Rays Propagation in Evolving\n  Astrophysical Environments","comments":"PoS 444 (38th ICRC) 1466","journal-ref":null,"doi":"10.22323/1.444.1466","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new energy transport code that models the time dependent and\nnon-linear evolution of spectra of cosmic-ray nuclei, their secondaries, and\nphoton target fields. The software can inject an arbitrary chemical composition\nincluding heavy elements up to iron nuclei. Energy losses and secondary\nproduction due to interactions of cosmic ray nuclei, secondary mesons, leptons,\nor gamma-rays with a target photon field are available for all relevant\nprocesses, e.g., photo-meson production, photo disintegration, synchrotron\nradiation, Inverse Compton scattering, and more. The resulting x-ray fluxes can\nbe fed back into the simulation chain to correct the initial photon targets,\nresulting in a non-linear treatment of the energy transport. The modular\nstructure of the code facilitates simple extension of interaction or target\nfield models. We will show how the software can be used to improve predictions\nof observables in various astrophysical sources such as jetted active galactic\nnuclei (AGN). Since the software can model the propagation of heavy\nultrahigh-energy cosmic rays inside the source it can precisely predict the\nchemical composition at the source. This will also refine predictions of\nneutrino emissions - they strongly depend on the chemical composition. This\nhelps in the future to optimize the selection and analyses of data from the\nIceCube neutrino observatory with the aim to enhance the sensitivity of IceCube\nand reduce the number of trial factors.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:51:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Merten","Lukas",""],["Da Vela","Paolo",""],["Reimer","Anita",""],["Boughelilba","Margot",""],["Lundquist","Jon Paul",""],["Vorobiov","Serguei",""],["Tjus","Julia Becker",""]]}
{"id":"2308.09519","submitter":"Siyou Lin","authors":"Siyou Lin, Boyao Zhou, Zerong Zheng, Hongwen Zhang, Yebin Liu","title":"Leveraging Intrinsic Properties for Non-Rigid Garment Alignment","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the problem of aligning real-world 3D data of garments, which\nbenefits many applications such as texture learning, physical parameter\nestimation, generative modeling of garments, etc. Existing extrinsic methods\ntypically perform non-rigid iterative closest point and struggle to align\ndetails due to incorrect closest matches and rigidity constraints. While\nintrinsic methods based on functional maps can produce high-quality\ncorrespondences, they work under isometric assumptions and become unreliable\nfor garment deformations which are highly non-isometric. To achieve\nwrinkle-level as well as texture-level alignment, we present a novel\ncoarse-to-fine two-stage method that leverages intrinsic manifold properties\nwith two neural deformation fields, in the 3D space and the intrinsic space,\nrespectively. The coarse stage performs a 3D fitting, where we leverage\nintrinsic manifold properties to define a manifold deformation field. The\ncoarse fitting then induces a functional map that produces an alignment of\nintrinsic embeddings. We further refine the intrinsic alignment with a second\nneural deformation field for higher accuracy. We evaluate our method with our\ncaptured garment dataset, GarmCap. The method achieves accurate wrinkle-level\nand texture-level alignment and works for difficult garment types such as long\ncoats. Our project page is\nhttps://jsnln.github.io/iccv2023_intrinsic/index.html.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:54:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lin","Siyou",""],["Zhou","Boyao",""],["Zheng","Zerong",""],["Zhang","Hongwen",""],["Liu","Yebin",""]]}
{"id":"2308.09520","submitter":"Marco Carvalho","authors":"Marco Carvalho, Damian Marriott, Mark Bilinski, Ahmad Ridley","title":"Proceedings of the 2nd International Workshop on Adaptive Cyber Defense","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 2nd International Workshop on Adaptive Cyber Defense was held at the\nFlorida Institute of Technology, Florida. This workshop was organized to share\nresearch that explores unique applications of Artificial Intelligence (AI) and\nMachine Learning (ML) as foundational capabilities for the pursuit of adaptive\ncyber defense. The cyber domain cannot currently be reliably and effectively\ndefended without extensive reliance on human experts. Skilled cyber defenders\nare in short supply and often cannot respond fast enough to cyber threats.\n  Building on recent advances in AI and ML the Cyber defense research community\nhas been motivated to develop new dynamic and sustainable defenses through the\nadoption of AI and ML techniques to cyber settings. Bridging critical gaps\nbetween AI and Cyber researchers and practitioners can accelerate efforts to\ncreate semi-autonomous cyber defenses that can learn to recognize and respond\nto cyber attacks or discover and mitigate weaknesses in cooperation with other\ncyber operation systems and human experts. Furthermore, these defenses are\nexpected to be adaptive and able to evolve over time to thwart changes in\nattacker behavior, changes in the system health and readiness, and natural\nshifts in user behavior over time.\n  The workshop was comprised of invited keynote talks, technical presentations\nand a panel discussion about how AI/ML can enable autonomous mitigation of\ncurrent and future cyber attacks. Workshop submissions were peer reviewed by a\npanel of domain experts with a proceedings consisting of six technical articles\nexploring challenging problems of critical importance to national and global\nsecurity. Participation in this workshop offered new opportunities to stimulate\nresearch and innovation in the emerging domain of adaptive and autonomous cyber\ndefense.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:56:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Carvalho","Marco",""],["Marriott","Damian",""],["Bilinski","Mark",""],["Ridley","Ahmad",""]]}
{"id":"2308.09521","submitter":"Steven de Jongh","authors":"Steven de Jongh, Felicitas Mueller, Fabian Osterberg, Claudio A.\n  Ca\\~nizares, Thomas Leibfried, and Kankar Bhattacharya","title":"Data-driven Topology and Parameter Identification in Distribution\n  Systems with limited Measurements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This manuscript presents novel techniques for identifying the switch states,\nphase identification, and estimation of equipment parameters in multi-phase low\nvoltage electrical grids, which is a major challenge in long-standing German\nlow voltage grids that lack observability and are heavily impacted by modelling\nerrors. The proposed methods are tailored for systems with a limited number of\nspatially distributed measuring devices, which measure voltage magnitudes at\nspecific nodes and some line current magnitudes. The overall approach employs a\nproblem decomposition strategy to divide the problem into smaller subproblems,\nwhich are addressed independently. The techniques for identifying switch states\nand system phases are based on heuristics and a binary optimization problem\nusing correlation analysis of the measured time series. The estimation of\nequipment parameters is achieved through a data-driven regression approach and\nby an optimization problem, and the identification of cable types is solved\nusing a Mixed-Integer Quadratic Programming solver. To validate the presented\nmethods, a realistic grid is used and the presented techniques are evaluated\nfor their resilience to data quality and time resolution, discussing the\nlimitations of the proposed methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:56:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["de Jongh","Steven",""],["Mueller","Felicitas",""],["Osterberg","Fabian",""],["Ca\u00f1izares","Claudio A.",""],["Leibfried","Thomas",""],["Bhattacharya","Kankar",""]]}
{"id":"2308.09522","submitter":"Vasileios Kouliaridis","authors":"Jose L. Hernandez-Ramos, Georgios Karopoulos, Efstratios Chatzoglou,\n  Vasileios Kouliaridis, Enrique Marmol, Aurora Gonzalez-Vidal and Georgios\n  Kambourakis","title":"Intrusion Detection based on Federated Learning: a systematic review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evolution of cybersecurity is undoubtedly associated and intertwined with\nthe development and improvement of artificial intelligence (AI). As a key tool\nfor realizing more cybersecure ecosystems, Intrusion Detection Systems (IDSs)\nhave evolved tremendously in recent years by integrating machine learning (ML)\ntechniques for the detection of increasingly sophisticated cybersecurity\nattacks hidden in big data. However, these approaches have traditionally been\nbased on centralized learning architectures, in which data from end nodes are\nshared with data centers for analysis. Recently, the application of federated\nlearning (FL) in this context has attracted great interest to come up with\ncollaborative intrusion detection approaches where data does not need to be\nshared. Due to the recent rise of this field, this work presents a complete,\ncontemporary taxonomy for FL-enabled IDS approaches that stems from a\ncomprehensive survey of the literature in the time span from 2018 to 2022.\nPrecisely, our discussion includes an analysis of the main ML models, datasets,\naggregation functions, as well as implementation libraries, which are employed\nby the proposed FL-enabled IDS approaches. On top of everything else, we\nprovide a critical view of the current state of the research around this topic,\nand describe the main challenges and future directions based on the analysis of\nthe literature and our own experience in this area.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:56:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hernandez-Ramos","Jose L.",""],["Karopoulos","Georgios",""],["Chatzoglou","Efstratios",""],["Kouliaridis","Vasileios",""],["Marmol","Enrique",""],["Gonzalez-Vidal","Aurora",""],["Kambourakis","Georgios",""]]}
{"id":"2308.09523","submitter":"Maksym Ivashechkin","authors":"Maksym Ivashechkin, Oscar Mendez, Richard Bowden","title":"Denoising Diffusion for 3D Hand Pose Estimation from Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Hand pose estimation from a single image has many applications. However,\napproaches to full 3D body pose estimation are typically trained on day-to-day\nactivities or actions. As such, detailed hand-to-hand interactions are poorly\nrepresented, especially during motion. We see this in the failure cases of\ntechniques such as OpenPose or MediaPipe. However, accurate hand pose\nestimation is crucial for many applications where the global body motion is\nless important than accurate hand pose estimation.\n  This paper addresses the problem of 3D hand pose estimation from monocular\nimages or sequences. We present a novel end-to-end framework for 3D hand\nregression that employs diffusion models that have shown excellent ability to\ncapture the distribution of data for generative purposes. Moreover, we enforce\nkinematic constraints to ensure realistic poses are generated by incorporating\nan explicit forward kinematic layer as part of the network. The proposed model\nprovides state-of-the-art performance when lifting a 2D single-hand image to\n3D. However, when sequence data is available, we add a Transformer module over\na temporal window of consecutive frames to refine the results, overcoming\njittering and further increasing accuracy.\n  The method is quantitatively and qualitatively evaluated showing\nstate-of-the-art robustness, generalization, and accuracy on several different\ndatasets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 12:57:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ivashechkin","Maksym",""],["Mendez","Oscar",""],["Bowden","Richard",""]]}
{"id":"2308.09524","submitter":"Flavio Lorez","authors":"Flavio Lorez, Mohit Pundir, David S. Kammer","title":"Eulerian framework for contact between solids represented as phase\n  fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mechanical contact between solids is almost exclusively modeled in Lagrangian\nframeworks. While these frameworks have been developed extensively and applied\nsuccessfully to numerous contact problems, they generally require complex\nalgorithms for contact detection and resolution. These challenges become\nparticularly important when contact appears between solids with evolving\nboundaries, such as in systems where crystals grow in a constrained space. In\nthis work, we introduce a fully Eulerian finite element framework for modeling\ncontact between elastic solids tailored towards problems including evolving and\nintricate surfaces. The proposed approach uses a phase-field method that\ninvolves a diffuse representation of geometries on a fixed mesh, simplifying\nthe modeling of evolving surfaces. Our methodology introduces a novel\nvolumetric contact constraint based on penalty body forces, efficiently\nresolving the interpenetration of solids. We showcase the validity and\nversatility of our method through numerical examples, highlighting its ability\nto accurately capture complex solid-solid interactions. The Eulerian\nphase-field formulation greatly simplifies contact detection and its\nresolution. Furthermore, the framework can be straightforwardly coupled with\nother physical phenomena through the inclusion of multiple energy terms in the\nevolution of the phase-field. This enables multiphysics modeling, potentially\nproviding a valuable tool for a wide range of applications involving chemically\nor physically evolving deformable solids in contact, as they commonly occur in\ndeterioration processes of porous media.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:00:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lorez","Flavio",""],["Pundir","Mohit",""],["Kammer","David S.",""]]}
{"id":"2308.09525","submitter":"Maksym Ivashechkin","authors":"Maksym Ivashechkin, Oscar Mendez, Richard Bowden","title":"Improving 3D Pose Estimation for Sign Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This work addresses 3D human pose reconstruction in single images. We present\na method that combines Forward Kinematics (FK) with neural networks to ensure a\nfast and valid prediction of 3D pose. Pose is represented as a hierarchical\ntree/graph with nodes corresponding to human joints that model their physical\nlimits. Given a 2D detection of keypoints in the image, we lift the skeleton to\n3D using neural networks to predict both the joint rotations and bone lengths.\nThese predictions are then combined with skeletal constraints using an FK layer\nimplemented as a network layer in PyTorch. The result is a fast and accurate\napproach to the estimation of 3D skeletal pose. Through quantitative and\nqualitative evaluation, we demonstrate the method is significantly more\naccurate than MediaPipe in terms of both per joint positional error and visual\nappearance. Furthermore, we demonstrate generalization over different datasets.\nThe implementation in PyTorch runs at between 100-200 milliseconds per image\n(including CNN detection) using CPU only.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:05:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ivashechkin","Maksym",""],["Mendez","Oscar",""],["Bowden","Richard",""]]}
{"id":"2308.09526","submitter":"Artittaya Boonkird","authors":"Artittaya Boonkird, Nathan Drucker, Manasi Mandal, Thanh Nguyen,\n  Jingjie Yeo, Vsevolod Belosevich, Ellan Spero, Christine Ortiz, Qiong Ma,\n  Liang Fu, Tomas Palacios, Mingda Li","title":"Sustainability-Driven Exploration of Topological Material","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological materials are at the forefront of quantum materials research,\noffering tremendous potential for next-generation energy and information\ndevices. However, current investigation of these materials remains largely\nfocused on performance and often neglects the crucial aspect of sustainability.\nRecognizing the pivotal role of sustainability in addressing global pollution,\ncarbon emissions, resource conservation, and ethical labor practices, we\npresent a comprehensive evaluation of topological materials based on their\nsustainability and environmental impact. Our approach involves a hierarchical\nanalysis encompassing cost, toxicity, energy demands, environmental impact,\nsocial implications, and resilience to imports. By applying this framework to\nover 16,000 topological materials, we establish a sustainable topological\nmaterials database. Our endeavor unveils environmental-friendly topological\nmaterials candidates which have been previously overlooked, providing insights\ninto their environmental ramifications and feasibility for industrial\nscalability. The work represents a critical step toward industrial adoption of\ntopological materials, offering the potential for significant technological\nadvancements and broader societal benefits.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:05:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Boonkird","Artittaya",""],["Drucker","Nathan",""],["Mandal","Manasi",""],["Nguyen","Thanh",""],["Yeo","Jingjie",""],["Belosevich","Vsevolod",""],["Spero","Ellan",""],["Ortiz","Christine",""],["Ma","Qiong",""],["Fu","Liang",""],["Palacios","Tomas",""],["Li","Mingda",""]]}
{"id":"2308.09527","submitter":"Jizhou Liu","authors":"Jizhou Liu, Eric J. Tchetgen Tchetgen, Carlos Varj\\~ao","title":"Proximal Causal Inference for Synthetic Control with Surrogates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The synthetic control method (SCM) has become a popular tool for estimating\ncausal effects in policy evaluation, where a single treated unit is observed,\nand a heterogeneous set of untreated units with pre- and post-policy change\ndata are also observed. However, the synthetic control method faces challenges\nin accurately predicting post-intervention potential outcome had, contrary to\nfact, the treatment been withheld, when the pre-intervention period is short or\nthe post-intervention period is long. To address these issues, we propose a\nnovel method that leverages post-intervention information, specifically\ntime-varying correlates of the causal effect called \"surrogates\", within the\nsynthetic control framework. We establish conditions for identifying model\nparameters using the proximal inference framework and apply the generalized\nmethod of moments (GMM) approach for estimation and inference about the average\ntreatment effect on the treated (ATT). Interestingly, we uncover specific\nconditions under which exclusively using post-intervention data suffices for\nestimation within our framework. Moreover, we explore several extensions,\nincluding covariates adjustment, relaxing linearity assumptions through\nnon-parametric identification, and incorporating so-called \"contaminated\"\nsurrogates, which do not exactly satisfy conditions to be valid surrogates but\nnevertheless can be incorporated via a simple modification of the proposed\napproach. Through a simulation study, we demonstrate that our method can\noutperform other synthetic control methods in estimating both short-term and\nlong-term effects, yielding more accurate inferences. In an empirical\napplication examining the Panic of 1907, one of the worst financial crises in\nU.S. history, we confirm the practical relevance of our theoretical results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:05:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Jizhou",""],["Tchetgen","Eric J. Tchetgen",""],["Varj\u00e3o","Carlos",""]]}
{"id":"2308.09528","submitter":"Jaksa Vucicevic","authors":"Jaksa Vucicevic and Michel Ferrero","title":"Simple predictors of $T_c$ in superconducting cuprates reveal role of\n  interactions between effective Wannier orbitals in the $d-p$ 3-band model","comments":"6 pages, 2 figures + supp. mat. 15 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  At optimal doping, different cuprate compounds can exhibit vastly different\ncritical temperatures for superconductivity ($T_c$), ranging from about 20 K to\nabout 135 K. The precise properties of the lattice that determine the magnitude\nof the $T_c$ are currently unknown. In this paper, we investigate the\ndependence of the optimal doping $T_c$ on the parameters of the Emery ($d-p$)\nmodel for the CuO$_2$ planes in the cuprates. We show that the best scaling is\nobtained not with the parameters of the model written in the real\n($d/p$-orbital) space, but rather written in the space of effective Wannier\norbitals. In this basis, one obtains a model of three sublattices coupled\nthrough all possible 4-point interactions. We identify multiple predictor\nvariables that fit the experimental $T_c$ to about $\\pm4$ K and that depend on\nthe coupling constants in the transformed Hamiltonian.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:06:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Vucicevic","Jaksa",""],["Ferrero","Michel",""]]}
{"id":"2308.09529","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Measurement of the $t\\bar{t}$ cross section and its ratio to the $Z$\n  production cross section using $pp$ collisions at $\\sqrt{s} = 13.6$ TeV with\n  the ATLAS detector","comments":"42 pages in total, author list starting page 24, 4 figures, 2 tables,\n  submitted to Phys. Lett. B. All figures including auxiliary figures are\n  available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/TOPQ-2023-21/","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-166","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inclusive top-quark-pair production cross section $\\sigma_{t\\bar{t}}$ and\nits ratio to the $Z$-boson production cross section have been measured in\nproton-proton collisions at $\\sqrt{s} = 13.6$ TeV, using 29 fb${}^{-1}$ of data\ncollected in 2022 with the ATLAS experiment at the Large Hadron Collider. Using\nevents with an opposite-charge electron-muon pair and $b$-tagged jets, and\nassuming Standard Model decays, the top-quark-pair production cross section is\nmeasured to be $\\sigma_{t\\bar{t}} = 850 \\pm 3\\mathrm{(stat.)}\\pm\n18\\mathrm{(syst.)}\\pm 20\\mathrm{(lumi.)}$ pb. The ratio of the $t\\bar{t}$ and\nthe $Z$-boson production cross sections is also measured, where the $Z$-boson\ncontribution is determined for inclusive $e^+e^-$ and $\\mu^+\\mu^-$ events in a\nfiducial phase space. The relative uncertainty on the ratio is reduced compared\nto the $t\\bar{t}$ cross section, thanks to the cancellation of several\nsystematic uncertainties. The result for the ratio, $R_{t\\bar{t}/Z} = 1.145 \\pm\n0.003\\mathrm{(stat.)}\\pm 0.021\\mathrm{(syst.)}\\pm 0.002\\mathrm{(lumi.)}$ is\nconsistent with the Standard Model prediction using the PDF4LHC21 PDF set.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:09:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.09530","submitter":"Linjie Liu","authors":"Shijia Hua, Linjie Liu","title":"Coevolutionary dynamics of population and institutional rewards in\n  public goods games","comments":"Submitted to Expert Systems With Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In social dilemmas, individuals face a conflict between their own\nself-interest and the collective interest of the group. The provision of reward\nhas been shown to be an effective means to drive cooperation in such\nsituations. However, previous research has often made the idealized assumption\nthat rewards are constant and do not change in response to changes in the game\nenvironment. In this paper, we introduce reward into the public goods game and\ndevelop a coevolutionary game model in which the strength of reward is\nadaptively adjusted according to the population state. Specifically, we assume\nthat decreasing levels of cooperation lead to an increase in reward strength,\nwhile increasing levels of cooperation result in a decrease in reward strength.\nBy investigating coevolutionary dynamics between population state and reward\nsystems, we find that interior stable coexistence state can emerge in our\nmodel, where the levels of cooperation and reward strength remain at constant\nlevels. In addition, we also reveal that the emergence of a full cooperation\nstate only requires a minimal level of reward strength. Our study highlights\nthe potential of adaptive feedback reward as a tool for achieving long-term\nstability and sustainability in social dilemmas.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:10:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hua","Shijia",""],["Liu","Linjie",""]]}
{"id":"2308.09531","submitter":"Li-Yue Sun","authors":"John Chiang","title":"Privacy-Preserving 3-Layer Neural Network Training using Mere\n  Homomorphic Encryption Technique","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this manuscript, we consider the problem of privacy-preserving training of\nneural networks in the mere homomorphic encryption setting. We combine several\nexsiting techniques available, extend some of them, and finally enable the\ntraining of 3-layer neural networks for both the regression and classification\nproblems using mere homomorphic encryption technique.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:11:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chiang","John",""]]}
{"id":"2308.09532","submitter":"Lukas Merten","authors":"Sophie Aerdker, Rafael Alves Batista, Julia Becker Tjus, Julien\n  D\\\"orner, Andrej Dundovic, Bj\\\"orn Eichmann, Antonius Frie, Christopher\n  Heiter, Mario Hoerbe, Karl-Heinz Kampert, Lukas Merten, Gero M\\\"uller,\n  Patrick Reichherzer, Simone Rossoni, Andrey Saveliev, Leander Schlegel,\n  G\\\"unter Sigl, Arjen van Vliet and Tobias Winchen","title":"CRPropa 3.2: a public framework for high-energy astroparticle\n  simulations","comments":"PoS 444 (38th ICRC) (2023) 1471","journal-ref":null,"doi":"10.22323/1.444.1471","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  CRPropa is a Monte Carlo framework for simulating the propagation of (ultra-)\nhigh-energy particles in the Universe, including cosmic rays, gamma rays,\nelectrons, and neutrinos. It covers energies from ZeV down to GeV for gamma\nrays and electrons, and TeV for cosmic rays and neutrinos, supporting various\nastrophysical environments such as the surroundings of astrophysical sources,\ngalactic, and extragalactic environments. The newest version, CRPropa 3.2,\nrepresents a significant leap forward towards a universal multi-messenger\nframework, opening up the possibility for many more astrophysical applications.\nThis includes extensions to simulate cosmic-ray acceleration and particle\ninteractions within astrophysical source environments, a full Monte Carlo\ntreatment of electromagnetic cascades, improved ensemble-averaged Galactic\npropagation, significant performance improvements for cosmic-ray tracking\nthrough magnetic fields, and a user-friendly implementation of custom photon\nfields, among many more enhancements. This contribution will give an overview\nof the new features and present several applications to cosmic-ray and\ngamma-ray propagation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:12:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Aerdker","Sophie",""],["Batista","Rafael Alves",""],["Tjus","Julia Becker",""],["D\u00f6rner","Julien",""],["Dundovic","Andrej",""],["Eichmann","Bj\u00f6rn",""],["Frie","Antonius",""],["Heiter","Christopher",""],["Hoerbe","Mario",""],["Kampert","Karl-Heinz",""],["Merten","Lukas",""],["M\u00fcller","Gero",""],["Reichherzer","Patrick",""],["Rossoni","Simone",""],["Saveliev","Andrey",""],["Schlegel","Leander",""],["Sigl","G\u00fcnter",""],["van Vliet","Arjen",""],["Winchen","Tobias",""]]}
{"id":"2308.09533","submitter":"Jasper van de Kreeke","authors":"Jasper van de Kreeke","title":"Explicit Hochschild Cocycles for Gentle Algebras","comments":"31 pages, numerous illustrations","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.RT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Hochschild cohomology is crucial for understanding deformation theory. In\narXiv:2304.10223, we have computed the Hochschild cohomology for gentle\nalgebras of punctured surfaces. The construction of that paper is rather\nimplicit and fails if the punctured surface has only a single puncture. In the\npresent note, we supplement the earlier method by providing an explicit\nconstruction of Hochschild cocycles which also succeeds in the case of a single\npuncture.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:13:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["van de Kreeke","Jasper",""]]}
{"id":"2308.09534","submitter":"Shaun Yuan","authors":"Xiang Yuan, Gong Cheng, Kebing Yan, Qinghua Zeng, Junwei Han","title":"Small Object Detection via Coarse-to-fine Proposal Generation and\n  Imitation Learning","comments":"Camera-ready version for ICCV2023. Our code will be available at\n  https://github.com/shaunyuan22/CFINet","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The past few years have witnessed the immense success of object detection,\nwhile current excellent detectors struggle on tackling size-limited instances.\nConcretely, the well-known challenge of low overlaps between the priors and\nobject regions leads to a constrained sample pool for optimization, and the\npaucity of discriminative information further aggravates the recognition. To\nalleviate the aforementioned issues, we propose CFINet, a two-stage framework\ntailored for small object detection based on the Coarse-to-fine pipeline and\nFeature Imitation learning. Firstly, we introduce Coarse-to-fine RPN (CRPN) to\nensure sufficient and high-quality proposals for small objects through the\ndynamic anchor selection strategy and cascade regression. Then, we equip the\nconventional detection head with a Feature Imitation (FI) branch to facilitate\nthe region representations of size-limited instances that perplex the model in\nan imitation manner. Moreover, an auxiliary imitation loss following supervised\ncontrastive learning paradigm is devised to optimize this branch. When\nintegrated with Faster RCNN, CFINet achieves state-of-the-art performance on\nthe large-scale small object detection benchmarks, SODA-D and SODA-A,\nunderscoring its superiority over baseline detector and other mainstream\ndetection approaches.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:13:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yuan","Xiang",""],["Cheng","Gong",""],["Yan","Kebing",""],["Zeng","Qinghua",""],["Han","Junwei",""]]}
{"id":"2308.09535","submitter":"Anna Mikusheva","authors":"Anna Mikusheva and Liyang Sun","title":"Weak Identification with Many Instruments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear instrumental variable regressions are widely used to estimate causal\neffects. Many instruments arise from the use of \"technical\" instruments and\nmore recently from the empirical strategy of \"judge design\". This paper surveys\nand summarizes ideas from recent literature on estimation and statistical\ninferences with many instruments. We discuss how to assess the strength of the\ninstruments and how to conduct weak identification-robust inference under\nheteroscedasticity. We establish new results for a jack-knifed version of the\nLagrange Multiplier (LM) test statistic. Many exogenous regressors arise often\nin practice to ensure the validity of the instruments. We extend the\nweak-identification-robust tests to settings with both many exogenous\nregressors and many instruments. We propose a test that properly partials out\nmany exogenous regressors while preserving the re-centering property of the\njack-knife. The proposed tests have uniformly correct size and good power\nproperties.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:13:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mikusheva","Anna",""],["Sun","Liyang",""]]}
{"id":"2308.09536","submitter":"Akihisa Yamada","authors":"Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred\n  Mesnard, \\'Etienne Payet","title":"The 19th International Workshop on Termination (WST 2023): Preface,\n  Invited Talk Abstract, and Tool Descriptions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report contains the proceedings of the 19th International Workshop on\nTermination (WST 2023), which was held in Obergurgl during August 24--25 as\npart of Obergurgl Summer on Rewriting (OSR 2023).\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:32:27 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yamada","Akihisa",""],["Kaminski","Benjamin Lucien",""],["Hofbauer","Dieter",""],["Mesnard","Fred",""],["Payet","\u00c9tienne",""]]}
{"id":"2308.09537","submitter":"Mohammad El Wajeh","authors":"Mohammad El Wajeh, Adel Mhamdi, Alexander Mitsos","title":"Optimal Design and Flexible Operation of a Fully Electrified Biodiesel\n  Production Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The flexible operation of electrified chemical processes, powered by\nrenewable electricity, offers economic and ecological incentives, paving the\nway for a more sustainable chemical industry. However, this requires a\ndeparture from the traditional steady-state operation, posing a challenge to\nprocess design and operation. We propose an approach for flexible biodiesel\nproduction by utilizing intermediate and final buffer tanks. These tanks serve\nto decouple the dynamics between different process unit operations. We\ninvestigate the flexibility of three different process configurations and\ncompare the outcomes of their dynamic optimization strategies with those of a\nsteady-state operation, considering a typical demand-side response scenario.\nFor all strategies, we employ local gradient-based optimization and solve them\nusing our open-source optimization framework DyOS. Our findings indicate that\nby incorporating intermediate buffer tanks, we fully exploit the process\nflexibility potential, leading to total energy savings of up to 29%. We also\npropose an implementation based on distributed optimization problems, yielding\nsimilar savings while significantly reducing computational costs by over\n10-fold and improving convergence, thus paving the way toward online\napplication. Overall, this study highlights the potential benefits of\nincorporating buffer tanks and optimization strategies in the flexible\noperation of electrified chemical processes, even those initially designed\nsolely for steady-state operation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:15:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wajeh","Mohammad El",""],["Mhamdi","Adel",""],["Mitsos","Alexander",""]]}
{"id":"2308.09538","submitter":"Elina Thibeau Sutre","authors":"Elina Thibeau-Sutre, Dieuwertje Alblas, Sophie Buurman, Christoph\n  Brune and Jelmer M. Wolterink","title":"Uncertainty-based quality assurance of carotid artery wall segmentation\n  in black-blood MRI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The application of deep learning models to large-scale data sets requires\nmeans for automatic quality assurance. We have previously developed a fully\nautomatic algorithm for carotid artery wall segmentation in black-blood MRI\nthat we aim to apply to large-scale data sets. This method identifies nested\nartery walls in 3D patches centered on the carotid artery. In this study, we\ninvestigate to what extent the uncertainty in the model predictions for the\ncontour location can serve as a surrogate for error detection and,\nconsequently, automatic quality assurance. We express the quality of automatic\nsegmentations using the Dice similarity coefficient. The uncertainty in the\nmodel's prediction is estimated using either Monte Carlo dropout or test-time\ndata augmentation. We found that (1) including uncertainty measurements did not\ndegrade the quality of the segmentations, (2) uncertainty metrics provide a\ngood proxy of the quality of our contours if the center found during the first\nstep is enclosed in the lumen of the carotid artery and (3) they could be used\nto detect low-quality segmentations at the participant level. This automatic\nquality assurance tool might enable the application of our model in large-scale\ndata sets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:16:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Thibeau-Sutre","Elina",""],["Alblas","Dieuwertje",""],["Buurman","Sophie",""],["Brune","Christoph",""],["Wolterink","Jelmer M.",""]]}
{"id":"2308.09539","submitter":"Florian Euchner","authors":"Phillip Stephan, Florian Euchner, Stephan ten Brink","title":"Angle-Delay Profile-Based and Timestamp-Aided Dissimilarity Metrics for\n  Channel Charting","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":"  Channel charting is a self-supervised learning technique whose objective is\nto reconstruct a map of the radio environment, called channel chart, by taking\nadvantage of similarity relationships in high-dimensional channel state\ninformation. We provide an overview of processing steps and evaluation methods\nfor channel charting and propose a novel dissimilarity metric that takes into\naccount angular-domain information as well as a novel deep learning-based\nmetric. Furthermore, we suggest a method to fuse dissimilarity metrics such\nthat both the time at which channels were measured as well as similarities in\nchannel state information can be taken into consideration while learning a\nchannel chart. By applying both classical and deep learning-based manifold\nlearning to a dataset containing sub-6GHz distributed massive MIMO channel\nmeasurements, we show that our metrics outperform previously proposed\ndissimilarity measures. The results indicate that the new metrics improve\nchannel charting performance, even under non-line-of-sight conditions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:16:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Stephan","Phillip",""],["Euchner","Florian",""],["Brink","Stephan ten",""]]}
{"id":"2308.09540","submitter":"Lu Zhang","authors":"Lu Zhang, Chenbo Zhang, Jiajia Zhao, Jihong Guan, Shuigeng Zhou","title":"Meta-ZSDETR: Zero-shot DETR with Meta-learning","comments":"Accepted in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-shot object detection aims to localize and recognize objects of unseen\nclasses. Most of existing works face two problems: the low recall of RPN in\nunseen classes and the confusion of unseen classes with background. In this\npaper, we present the first method that combines DETR and meta-learning to\nperform zero-shot object detection, named Meta-ZSDETR, where model training is\nformalized as an individual episode based meta-learning task. Different from\nFaster R-CNN based methods that firstly generate class-agnostic proposals, and\nthen classify them with visual-semantic alignment module, Meta-ZSDETR directly\npredict class-specific boxes with class-specific queries and further filter\nthem with the predicted accuracy from classification head. The model is\noptimized with meta-contrastive learning, which contains a regression head to\ngenerate the coordinates of class-specific boxes, a classification head to\npredict the accuracy of generated boxes, and a contrastive head that utilizes\nthe proposed contrastive-reconstruction loss to further separate different\nclasses in visual space. We conduct extensive experiments on two benchmark\ndatasets MS COCO and PASCAL VOC. Experimental results show that our method\noutperforms the existing ZSD methods by a large margin.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:17:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Lu",""],["Zhang","Chenbo",""],["Zhao","Jiajia",""],["Guan","Jihong",""],["Zhou","Shuigeng",""]]}
{"id":"2308.09541","submitter":"Bhupendra Kumar","authors":"Bhupendra Kumar, Sachin Verma, Tanuj Chamoli and Ajay","title":"Josephson Transport across T-shaped and Series-Configured Double Quantum\n  Dots System at Infinite-U Limit","comments":"12 pages, 9 figures","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-nc-nd/4.0/","abstract":"  The charge transport has been analyzed theoretically across a T-shaped and\nseries-configured double quantum dots Josephson junction by implementing the\nSlave Boson mean field approximation at an infinite-U limit. It has been shown\nthat Andreev Bound states (ABS) and Josephson current can be tuned by varying\nthe interdot tunneling (t) and quantum dots energy level. For the T-shape\nconfiguration of the quantum dots, an extra path is available for the transport\nof electrons which causes the interference destruction between two paths. For\ndecoupled quantum dots with $\\epsilon_{d1}=\\epsilon_{d2}=0$, the energy of ABS\ncrosses at $\\omega=0$ and Josephson current shows a discontinuity at $\\phi=\\pm\n\\pi$. On the other hand, for coupled quantum dots the lower and upper ABS has a\nfinite spacing, the Josephson current exhibits sinusoidal nature and its\nmagnitude suppresses with increasing interdot tunneling strength. While in the\nseries configuration, with increment in t, Josephson current increases and\nshows a discontinuity at $\\phi=\\pm \\pi$, once the system gets resonant\ntunneling for $t=0.5\\Gamma$ with $\\epsilon_{d1}=\\epsilon_{d2}=0.5\\Gamma$.\nFurther, we also analyze the nature of the energy of ABS and Josephson current\nwith the quantum dots energy level in both configurations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:19:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kumar","Bhupendra",""],["Verma","Sachin",""],["Chamoli","Tanuj",""],["Ajay","",""]]}
{"id":"2308.09542","submitter":"Camille Ruppli","authors":"Camille Ruppli, Pietro Gori, Roberto Ardon, Isabelle Bloch","title":"Decoupled conditional contrastive learning with variable metadata for\n  prostate lesion detection","comments":"Accepted at MILLanD workshop (MICCAI)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Early diagnosis of prostate cancer is crucial for efficient treatment.\nMulti-parametric Magnetic Resonance Images (mp-MRI) are widely used for lesion\ndetection. The Prostate Imaging Reporting and Data System (PI-RADS) has\nstandardized interpretation of prostate MRI by defining a score for lesion\nmalignancy. PI-RADS data is readily available from radiology reports but is\nsubject to high inter-reports variability. We propose a new contrastive loss\nfunction that leverages weak metadata with multiple annotators per sample and\ntakes advantage of inter-reports variability by defining metadata confidence.\nBy combining metadata of varying confidence with unannotated data into a single\nconditional contrastive loss function, we report a 3% AUC increase on lesion\ndetection on the public PI-CAI challenge dataset.\n  Code is available at: https://github.com/camilleruppli/decoupled_ccl\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:19:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ruppli","Camille",""],["Gori","Pietro",""],["Ardon","Roberto",""],["Bloch","Isabelle",""]]}
{"id":"2308.09543","submitter":"Michael Hu","authors":"Michael Y. Hu, Angelica Chen, Naomi Saphra, Kyunghyun Cho","title":"Latent State Models of Training Dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The impact of randomness on model training is poorly understood. How do\ndifferences in data order and initialization actually manifest in the model,\nsuch that some training runs outperform others or converge faster? Furthermore,\nhow can we interpret the resulting training dynamics and the phase transitions\nthat characterize different trajectories? To understand the effect of\nrandomness on the dynamics and outcomes of neural network training, we train\nmodels multiple times with different random seeds and compute a variety of\nmetrics throughout training, such as the $L_2$ norm, mean, and variance of the\nneural network's weights. We then fit a hidden Markov model (HMM) over the\nresulting sequences of metrics. The HMM represents training as a stochastic\nprocess of transitions between latent states, providing an intuitive overview\nof significant changes during training. Using our method, we produce a\nlow-dimensional, discrete representation of training dynamics on grokking\ntasks, image classification, and masked language modeling. We use the HMM\nrepresentation to study phase transitions and identify latent \"detour\" states\nthat slow down convergence.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:20:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hu","Michael Y.",""],["Chen","Angelica",""],["Saphra","Naomi",""],["Cho","Kyunghyun",""]]}
{"id":"2308.09544","submitter":"Filip Szatkowski","authors":"Filip Szatkowski, Mateusz Pyla, Marcin Przewi\\k{e}\\'zlikowski,\n  Sebastian Cygert, Bart{\\l}omiej Twardowski, Tomasz Trzci\\'nski","title":"Adapt Your Teacher: Improving Knowledge Distillation for Exemplar-free\n  Continual Learning","comments":"VCL workshop at ICCV 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":"  In this work, we investigate exemplar-free class incremental learning (CIL)\nwith knowledge distillation (KD) as a regularization strategy, aiming to\nprevent forgetting. KD-based methods are successfully used in CIL, but they\noften struggle to regularize the model without access to exemplars of the\ntraining data from previous tasks. Our analysis reveals that this issue\noriginates from substantial representation shifts in the teacher network when\ndealing with out-of-distribution data. This causes large errors in the KD loss\ncomponent, leading to performance degradation in CIL. Inspired by recent\ntest-time adaptation methods, we introduce Teacher Adaptation (TA), a method\nthat concurrently updates the teacher and the main model during incremental\ntraining. Our method seamlessly integrates with KD-based CIL approaches and\nallows for consistent enhancement of their performance across multiple\nexemplar-free CIL benchmarks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:22:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Szatkowski","Filip",""],["Pyla","Mateusz",""],["Przewi\u0119\u017alikowski","Marcin",""],["Cygert","Sebastian",""],["Twardowski","Bart\u0142omiej",""],["Trzci\u0144ski","Tomasz",""]]}
{"id":"2308.09545","submitter":"Hans-Werner Hammer","authors":"M. Ebert, H.-W. Hammer, A. Rusetsky","title":"An alternative scheme for pionless EFT: neutron-deuteron scattering in\n  the doublet S-wave","comments":"9 pages, 2 figures, REVTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using the effective-range expansion for the two-body amplitudes may generate\nspurious sub-threshold poles outside of the convergence range of the expansion.\nIn the infinite volume, the emergence of such poles leads to the breakdown of\nunitarity in the three-body amplitude. We discuss the extension of our\nalternative subtraction scheme for including effective range corrections in\npionless effective field theory for spinless bosons to nucleons. In particular,\nwe consider the neutron-deuteron system in the doublet S-wave channel\nexplicitly.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:23:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ebert","M.",""],["Hammer","H. -W.",""],["Rusetsky","A.",""]]}
{"id":"2308.09546","submitter":"Shu Wang","authors":"Shu Wang, Kun Sun, Qi Li","title":"Compensating Removed Frequency Components: Thwarting Voice Spectrum\n  Reduction Attacks","comments":"Accepted by 2024 Network and Distributed System Security Symposium\n  (NDSS'24)","journal-ref":null,"doi":"10.14722/ndss.2024.23150","report-no":null,"categories":"cs.CR cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic speech recognition (ASR) provides diverse audio-to-text services\nfor humans to communicate with machines. However, recent research reveals ASR\nsystems are vulnerable to various malicious audio attacks. In particular, by\nremoving the non-essential frequency components, a new spectrum reduction\nattack can generate adversarial audios that can be perceived by humans but\ncannot be correctly interpreted by ASR systems. It raises a new challenge for\ncontent moderation solutions to detect harmful content in audio and video\navailable on social media platforms. In this paper, we propose an acoustic\ncompensation system named ACE to counter the spectrum reduction attacks over\nASR systems. Our system design is based on two observations, namely, frequency\ncomponent dependencies and perturbation sensitivity. First, since the Discrete\nFourier Transform computation inevitably introduces spectral leakage and\naliasing effects to the audio frequency spectrum, the frequency components with\nsimilar frequencies will have a high correlation. Thus, considering the\nintrinsic dependencies between neighboring frequency components, it is possible\nto recover more of the original audio by compensating for the removed\ncomponents based on the remaining ones. Second, since the removed components in\nthe spectrum reduction attacks can be regarded as an inverse of adversarial\nnoise, the attack success rate will decrease when the adversarial audio is\nreplayed in an over-the-air scenario. Hence, we can model the acoustic\npropagation process to add over-the-air perturbations into the attacked audio.\nWe implement a prototype of ACE and the experiments show ACE can effectively\nreduce up to 87.9% of ASR inference errors caused by spectrum reduction\nattacks. Also, by analyzing residual errors, we summarize six general types of\nASR inference errors and investigate the error causes and potential mitigation\nsolutions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:23:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Shu",""],["Sun","Kun",""],["Li","Qi",""]]}
{"id":"2308.09547","submitter":"Luana Martins","authors":"Luana Martins, Valeria Pontillo, Heitor Costa, Filomena Ferrucci,\n  Fabio Palomba, Ivan Machado","title":"Test Code Refactoring Unveiled: Where and How Does It Affect Test Code\n  Quality and Effectiveness?","comments":"9 pages, 39th IEEE International Conference on Software Maintenance\n  and Evolution (ICSME) - Registered Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Context. Refactoring has been widely investigated in the past in relation to\nproduction code quality, yet still little is known on how developers apply\nrefactoring on test code. Specifically, there is still a lack of investigation\ninto how developers typically refactor test code and its effects on test code\nquality and effectiveness. Objective. This paper presents a research agenda\naimed to bridge this gap of knowledge by investigating (1) whether test\nrefactoring actually targets test classes affected by quality and effectiveness\nconcerns and (2) the extent to which refactoring contributes to the improvement\nof test code quality and effectiveness. Method. We plan to conduct an\nexploratory mining software repository study to collect test refactoring data\nof open-source Java projects from GitHub and statistically analyze them in\ncombination with quality metrics, test smells, and code/mutation coverage\nindicators. Furthermore, we will measure how refactoring operations impact the\nquality and effectiveness of test code.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:25:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Martins","Luana",""],["Pontillo","Valeria",""],["Costa","Heitor",""],["Ferrucci","Filomena",""],["Palomba","Fabio",""],["Machado","Ivan",""]]}
{"id":"2308.09548","submitter":"Yanhang Zhang","authors":"Zhifan Li, Yanhang Zhang, Jianxin Yin","title":"Sharp minimax optimality of LASSO and SLOPE under double sparsity\n  assumption","comments":"50 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a rigorous approach to establish the sharp minimax\noptimalities of both LASSO and SLOPE within the framework of double sparse\nstructures, notably without relying on RIP-type conditions. Crucially, our\nfindings illuminate that the achievement of these optimalities is fundamentally\nanchored in a sparse group normalization condition, complemented by several\nnovel sparse group restricted eigenvalue (RE)-type conditions introduced in\nthis study. We further provide a comprehensive comparative analysis of these\neigenvalue conditions. Furthermore, we demonstrate that these conditions hold\nwith high probability across a wide range of random matrices. Our exploration\nextends to encompass the random design, where we prove the random design\nproperties and optimal sample complexity under both weak moment distribution\nand sub-Gaussian distribution.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:27:24 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Zhifan",""],["Zhang","Yanhang",""],["Yin","Jianxin",""]]}
{"id":"2308.09549","submitter":"Tianrong Lin","authors":"Tianrong Lin","title":"Quantum and Probabilistic Computers Rigorously Powerful than Traditional\n  Computers, and Derandomization","comments":"[v2] some typos corrected; a reference added; 30 pages; comments are\n  welcome. arXiv admin note: text overlap with arXiv:2110.06211","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC math.PR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we extend the techniques used in our previous work to show\nthat there exists a probabilistic Turing machine running within time $O(n^k)$\nfor all $k\\in\\mathbb{N}_1$ accepting a language $L_d$ which is different from\nany language in $\\mathcal{P}$, and then to show that $L_d\\in\\mathcal{BPP}$,\nthus separating the complexity classes $\\mathcal{P}$ and $\\mathcal{BPP}$ (i.e.,\n$\\mathcal{P}\\subsetneq\\mathcal{BPP}$). Since the complexity class of {\\em\nbounded error quantum polynomial-time} $\\mathcal{BQP}$ contains the complexity\nclass $\\mathcal{BPP}$, i.e., $\\mathcal{BPP}\\subseteq\\mathcal{BQP}$, we thus\nobtain the result that quantum computers are {\\em rigorously powerful than}\ntraditional computers. Namely, $\\mathcal{P}\\subsetneq\\mathcal{BQP}$. We further\nshow that (1). $\\mathcal{P}\\subsetneq\\mathcal{RP}$; (2).\n$\\mathcal{P}\\subsetneq\\text{co-}\\mathcal{RP}$; (3).\n$\\mathcal{P}\\subsetneq\\mathcal{ZPP}$.\n  The result of $\\mathcal{P}\\subsetneq\\mathcal{BPP}$ shows that {\\em\nrandomness} plays an essential role in probabilistic algorithm design.\nSpecifically, we show that: (1). The number of random bits used by any\nprobabilistic algorithm which accepts the language $L_d$ can not be reduced to\n$O(\\log n)$; (2). There exits no efficient (complexity-theoretic) {\\em\npseudorandom generator} (PRG) $G:\\{0,1\\}^{O(\\log n)}\\rightarrow \\{0,1\\}^n$;\n(3). There exists no quick HSG $H:k(n)\\rightarrow n$ such that $k(n)=O(\\log\nn)$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:28:02 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 15:50:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lin","Tianrong",""]]}
{"id":"2308.09550","submitter":"Mikala {\\O}rsnes Jansen","authors":"Mikala Jansen","title":"Stratified homotopy theory of topological $\\infty$-stacks: a toolbox","comments":"25 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151","categories":"math.AT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We exploit the theory of $\\infty$-stacks to provide some basic definitions\nand calculational tools regarding stratified homotopy theory of stratified\ntopological stacks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:28:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jansen","Mikala",""]]}
{"id":"2308.09551","submitter":"Mikala {\\O}rsnes Jansen","authors":"Mikala Jansen","title":"Moduli stack of stable curves from a stratified homotopy viewpoint","comments":"55 pages (including a 15 page appendix on the Harvey\n  compactification), 3 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151","categories":"math.AG math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1984, Charney and Lee defined a category of stable curves and showed that\nthere is a rational homology equivalence from its geometric realisation to (the\nanalytification of) the moduli stack of stable curves, also known as the\nDeligne-Mumford-Knudsen compactification. We show that, in fact, this category\ncaptures the stratified homotopy type of the moduli stack. In particular, it\nclassifies constructible sheaves via an exodromy equivalence.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:28:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jansen","Mikala",""]]}
{"id":"2308.09552","submitter":"Vasisht Duddu","authors":"Vasisht Duddu, Anudeep Das, Nora Khayata, Hossein Yalame, Thomas\n  Schneider, N. Asokan","title":"Attesting Distributional Properties of Training Data for Machine\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The success of machine learning (ML) has been accompanied by increased\nconcerns about its trustworthiness. Several jurisdictions are preparing ML\nregulatory frameworks. One such concern is ensuring that model training data\nhas desirable distributional properties for certain sensitive attributes. For\nexample, draft regulations indicate that model trainers are required to show\nthat training datasets have specific distributional properties, such as\nreflecting diversity of the population.\n  We propose the notion of property attestation allowing a prover (e.g., model\ntrainer) to demonstrate relevant distributional properties of training data to\na verifier (e.g., a customer) without revealing the data. We present an\neffective hybrid property attestation combining property inference with\ncryptographic mechanisms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:33:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Duddu","Vasisht",""],["Das","Anudeep",""],["Khayata","Nora",""],["Yalame","Hossein",""],["Schneider","Thomas",""],["Asokan","N.",""]]}
{"id":"2308.09553","submitter":"Jing Yu","authors":"Jing Yu, Kangqiao Li, Gongxiang Liu","title":"Hopf algebras with the dual Chevalley property of finite\n  corepresentation type","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $H$ be a finite-dimensional Hopf algebra over an algebraically closed\nfield $\\Bbbk$ with the dual Chevalley property. We prove that $H$ is of finite\ncorepresentation type if and only if it is coNakayama, if and only if the link\nquiver $\\mathrm{Q}(H)$ of $H$ is a disjoint union of basic cycles, if and only\nif the link-indecomposable component $H_{(1)}$ containing $\\Bbbk1$ is a pointed\nHopf algebra and the link quiver of $H_{(1)}$ is a basic cycle.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:33:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yu","Jing",""],["Li","Kangqiao",""],["Liu","Gongxiang",""]]}
{"id":"2308.09554","submitter":"Justyn Campbell-White","authors":"Justyn Campbell-White, Carlo F. Manara, Myriam Benisty, Antonella\n  Natta, Rik A. B. Claes, Antonio Frasca, Jaehan Bae, Stefano Facchini, Andrea\n  Isella, Laura P\\'erez, Paola Pinilla, Aurora Sicilia-Aguilar, Richard Teague","title":"A magnetically driven disc wind in the inner disc of PDS 70","comments":"13 pages, 7 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  PDS 70 is so far the only young disc where multiple planets have been\ndetected by direct imaging. The disc has a large cavity when seen at sub-mm and\nNIR wavelengths, which hosts two massive planets. This makes PDS 70 the ideal\ntarget to study the physical conditions in a strongly depleted inner disc\nshaped by two giant planets, and in particular to test whether disc winds can\nplay a significant role in its evolution. Using X-Shooter and HARPS spectra, we\ndetected for the first time the wind-tracing [O I] 6300AA line, and confirm the\nlow-moderate value of mass-accretion rate in the literature. The [O I] line\nluminosity is high with respect to the accretion luminosity when compared to a\nlarge sample of discs with cavities in nearby star-forming regions. The FWHM\nand blue-shifted peak of the [O I] line suggest an emission in a region very\nclose to the star, favouring a magnetically driven wind as the origin. We also\ndetect wind emission and high variability in the He I 10830AA line, which is\nunusual for low-accretors. We discuss that, although the cavity of PDS 70 was\nclearly carved out by the giant planets, the substantial inner disc wind could\nalso have had a significant contribution to clearing the inner-disc.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:34:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Campbell-White","Justyn",""],["Manara","Carlo F.",""],["Benisty","Myriam",""],["Natta","Antonella",""],["Claes","Rik A. B.",""],["Frasca","Antonio",""],["Bae","Jaehan",""],["Facchini","Stefano",""],["Isella","Andrea",""],["P\u00e9rez","Laura",""],["Pinilla","Paola",""],["Sicilia-Aguilar","Aurora",""],["Teague","Richard",""]]}
{"id":"2308.09555","submitter":"Shidong Liang","authors":"Shi-Dong Liang and Wenjing Huang","title":"Connections between Weyl geometry, quantum potential and quantum\n  entanglement","comments":"16 pages, 4 figures","journal-ref":"Modern Physics Letter A, 36, 30 (2021) 2150216","doi":"10.1142/S0217732321502163","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Weyl geometry promises potential applications in gravity and quantum\nmechanics. We study the relationships between the Weyl geometry, quantum\nentropy and quantum entanglement based on the Weyl geometry endowing the\nEuclidean metric. We give the formulation of the Weyl Ricci curvature and Weyl\nscalar curvature in the $n$-dimensional system. The Weyl scalar field plays a\nbridge role to connect the Weyl scalar curvature, quantum potential and quantum\nentanglement. We also give the Einstein-Weyl tensor and the generalized field\nequation in 3D vacuum case, which reveals the relationship between Weyl\ngeometry and quantum potential. Particularly, we find that the correspondence\nbetween the Weyl scalar curvature and quantum potential is dimension-dependent\nand works only for the 3D space, which reveals a clue to quantize gravity and a\nunderstanding why our space must be 3D if quantum gravity is compatible with\nquantum mechanics. We analyze numerically a typical example of two orthogonal\noscillators to reveal the relationships between the Weyl scalar curvature,\nquantum potential and quantum entanglement based on this formulation. We find\nthat the Weyl scalar curvature shows a negative dip peak for separate state but\nbecomes a positive peak for the entangled state near original point region,\nwhich can be regarded as a geometric signal to detect quantum entanglement.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:35:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liang","Shi-Dong",""],["Huang","Wenjing",""]]}
{"id":"2308.09556","submitter":"Nils M\\\"uller","authors":"Nils M\\\"uller","title":"A Principle for Global Optimization with Gradients","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA cs.NE math.NA stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work demonstrates the utility of gradients for the global optimization\nof certain differentiable functions with many suboptimal local minima. To this\nend, a principle for generating search directions from non-local quadratic\napproximants based on gradients of the objective function is analyzed.\nExperiments measure the quality of non-local search directions as well as the\nperformance of a proposed simplistic algorithm, of the covariance matrix\nadaptation evolution strategy (CMA-ES), and of a randomly reinitialized\nBroyden-Fletcher-Goldfarb-Shanno (BFGS) method.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:39:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["M\u00fcller","Nils",""]]}
{"id":"2308.09557","submitter":"Rafa{\\l} Filip\\'ow","authors":"Rafa{\\l} Filip\\'ow, Adam Kwela","title":"Spaces not distinguishing ideal pointwise and $\\sigma$-uniform\n  convergence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine topological spaces not distinguishing ideal pointwise and ideal\n$\\sigma$-uniform convergence of sequences of real-valued continuous functions\ndefined on them. For instance, we introduce a purely combinatorial cardinal\ncharacteristic (a sort of the bounding number $\\mathfrak{b}$) and prove that it\ndescribes the minimal cardinality of topological spaces which distinguish ideal\npointwise and ideal $\\sigma$-uniform convergence. Moreover, we provide examples\nof topological spaces (focusing on subsets of reals) that do or do not\ndistinguish the considered convergences. Since similar investigations for ideal\nquasi-normal convergence instead of ideal $\\sigma$-uniform convergence have\nbeen performed in literature, we also study spaces not distinguishing ideal\nquasi-normal and ideal $\\sigma$-uniform convergence of sequences of real-valued\ncontinuous functions defined on them.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:40:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Filip\u00f3w","Rafa\u0142",""],["Kwela","Adam",""]]}
{"id":"2308.09558","submitter":"Pelin Icer Baykal","authors":"Pelin Icer Baykal, Pawe{\\l} P. {\\L}abaj, Florian Markowetz, Lynn M.\n  Schriml, Daniel J. Stekhoven, Serghei Mangul, Niko Beerenwinkel","title":"Genomic reproducibility in the bioinformatics era","comments":"10 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In biomedical research, validation of a new scientific discovery is tied to\nthe reproducibility of its experimental results. However, in genomics, the\ndefinition and implementation of reproducibility still remain imprecise. Here,\nwe argue that genomic reproducibility, defined as the ability of bioinformatics\ntools to maintain consistent genomics results across technical replicates, is\nkey to generating scientific knowledge and enabling medical applications. We\nfirst discuss different concepts of reproducibility and then focus on\nreproducibility in the context of genomics, aiming to establish clear\ndefinitions of relevant terms. We then focus on the role of bioinformatics\ntools and their impact on genomic reproducibility and assess methods of\nevaluating bioinformatics tools in terms of genomic reproducibility. Lastly, we\nsuggest best practices for enhancing genomic reproducibility, with an emphasis\non assessing the performance of bioinformatics tools through rigorous testing\nacross multiple technical replicates.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:43:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Baykal","Pelin Icer",""],["\u0141abaj","Pawe\u0142 P.",""],["Markowetz","Florian",""],["Schriml","Lynn M.",""],["Stekhoven","Daniel J.",""],["Mangul","Serghei",""],["Beerenwinkel","Niko",""]]}
{"id":"2308.09559","submitter":"Mario Silveirinha G.","authors":"Mario G. Silveirinha, Hugo Ter\\c{c}as, Mauro Antezza","title":"Spontaneous Symmetry Breaking and Time-Crystal States in Chiral Atomic\n  Systems","comments":"59 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a theoretical study of the interaction between an atom\ncharacterized by a degenerate ground state and a reciprocal environment, such\nas a semiconductor nanoparticle, without the presence of external bias. Our\nanalysis reveals that the combined influence of the electron's intrinsic spin\nmagnetic moment on the environment and the chiral atomic dipolar transitions\nmay lead to either the spontaneous breaking of time-reversal symmetry or the\nemergence of time-crystal-like states with remarkably long relaxation times.\nThe different behavior is ruled by the handedness of the precession motion of\nthe atom's spin vector, which is induced by virtual chiral-dipolar transitions.\nSpecifically, when the relative orientation of the precession angular velocity\nand the electron spin vector is as in a spinning top, the system manifests\ntime-crystal-like states. Conversely, with the opposite relative orientation,\nthe system experiences spontaneous symmetry breaking of time-reversal symmetry.\nOur findings introduce a novel mechanism for the spontaneous breaking of\ntime-reversal symmetry in atomic systems, and unveil an exciting opportunity to\nengineer a nonreciprocal response at the nanoscale, exclusively driven by the\nquantum vacuum fluctuations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:44:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Silveirinha","Mario G.",""],["Ter\u00e7as","Hugo",""],["Antezza","Mauro",""]]}
{"id":"2308.09560","submitter":"Jasper Van Der Veen","authors":"Jasper R. van der Veen, Silvia Hidalgo Martinez, Albert Wieland,\n  Matteo De Pellegrin, Rick Verweij, Yaroslav M. Blanter, Herre S.J. van der\n  Zant and Filip J.R. Meysman","title":"Quantum-assisted electron transport in microbial protein wires across\n  macroscopic distances","comments":"The manuscript contains 2967 words, 15 pages, 3 figures and 49\n  references","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multicellular cable bacteria display an exceptional form of biological\nconduction, channeling electrical currents across centimeter distances through\na regular network of protein fibers embedded in the cell envelope. The fiber\nconductivity is among the highest recorded for biomaterials, providing a\npromising outlook for new bio-electronic technologies, but the underlying\nmechanism of electron transport remains elusive. Here, we use detailed\nelectrical characterization down to cryogenic temperatures, which reveals that\nlong-range conduction in these bacterial protein wires is based on a unique\ntype of quantum-assisted multistep hopping. The conductance near room\ntemperature reveals thermally activated behavior, yet with a low activation\nenergy, suggesting that substantial delocalization across charge carrier sites\ncontributes to high conductivity. At cryogenic temperatures, the conductance\nbecomes virtually independent of temperature, thus indicating that quantum\nvibrations couple to the charge transport. Our results demonstrate that quantum\neffects can manifest themselves in biological systems over macroscopic length\nscales.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:50:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["van der Veen","Jasper R.",""],["Martinez","Silvia Hidalgo",""],["Wieland","Albert",""],["De Pellegrin","Matteo",""],["Verweij","Rick",""],["Blanter","Yaroslav M.",""],["van der Zant","Herre S. J.",""],["Meysman","Filip J. R.",""]]}
{"id":"2308.09561","submitter":"Hans-Peter Lehmann","authors":"Hans-Peter Lehmann, Peter Sanders, Stefan Walzer","title":"ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond\n  Brute-Force","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A minimal perfect hash function (MPHF) maps a set $S$ of $n$ keys to the\nfirst $n$ integers without collisions. There is a lower bound of\n$n\\log_2e-O(\\log n)$ bits of space needed to represent an MPHF. A matching\nupper bound is obtained using the brute-force algorithm that tries random hash\nfunctions until stumbling on an MPHF and stores that function's seed. In\nexpectation, $e^n\\textrm{poly}(n)$ seeds need to be tested. The most\nspace-efficient previous algorithms for constructing MPHFs all use such a\nbrute-force approach as a basic building block.\n  In this paper, we introduce ShockHash - Small, heavily overloaded cuckoo hash\ntables. ShockHash uses two hash functions $h_0$ and $h_1$, hoping for the\nexistence of a function $f : S \\rightarrow \\{0,1\\}$ such that $x \\mapsto\nh_{f(x)}(x)$ is an MPHF on $S$. In graph terminology, ShockHash generates\n$n$-edge random graphs until stumbling on a pseudoforest - a graph where each\ncomponent contains as many edges as nodes. Using cuckoo hashing, ShockHash then\nderives an MPHF from the pseudoforest in linear time. It uses a 1-bit retrieval\ndata structure to store $f$ using $n + o(n)$ bits.\n  By carefully analyzing the probability that a random graph is a pseudoforest,\nwe show that ShockHash needs to try only $(e/2)^n\\textrm{poly}(n)$ hash\nfunction seeds in expectation, reducing the space for storing the seed by\nroughly $n$ bits. This makes ShockHash almost a factor $2^n$ faster than\nbrute-force, while maintaining the asymptotically optimal space consumption. An\nimplementation within the RecSplit framework yields the currently most space\nefficient MPHFs, i.e., competing approaches need about two orders of magnitude\nmore work to achieve the same space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:51:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lehmann","Hans-Peter",""],["Sanders","Peter",""],["Walzer","Stefan",""]]}
{"id":"2308.09562","submitter":"Efthymios Costa","authors":"Efthymios Costa and Ioanna Papatsouma","title":"Outlier detection for mixed-type data: A novel approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Outlier detection can serve as an extremely important tool for researchers\nfrom a wide range of fields. From the sectors of banking and marketing to the\nsocial sciences and healthcare sectors, outlier detection techniques are very\nuseful for identifying subjects that exhibit different and sometimes peculiar\nbehaviours. When the data set available to the researcher consists of both\ndiscrete and continuous variables, outlier detection presents unprecedented\nchallenges. In this paper we propose a novel method that detects outlying\nobservations in settings of mixed-type data, while reducing the required user\ninteraction which can lead to misleading findings caused by subjectivity. The\nmethodology developed is being assessed through a series of simulations on data\nsets with varying characteristics and achieves very good performance levels.\nOur method demonstrates a high capacity for detecting the majority of outliers\nwhile minimising the number of falsely detected non-outlying observations. The\nideas and techniques outlined in the paper can be used either as a\npre-processing step or in tandem with other data mining and machine learning\nalgorithms for developing novel approaches to challenging research problems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:53:28 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 16:43:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Costa","Efthymios",""],["Papatsouma","Ioanna",""]]}
{"id":"2308.09563","submitter":"Zhihao Lu","authors":"Zhihao Lu","title":"Differential Harnack inequalities for semilinear parabolic equations on\n  Riemannian manifolds I: Bakry-\\'{E}mery curvature bounded below","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 a unified method for deriving differential Harnack\ninequalities for positive solutions of the semilinear parabolic equation\n\\begin{equation*}\n  \\partial_t u=\\Delta_V u+H(u) \\end{equation*} on complete Riemannian manifolds\nwith Bakry-\\'Emery curvature bounded below. This method transforms the problem\nof deriving differential Harnack inequalities into solving a related ODE\nsystem. As an application of this method, we obtain new and improved estimates\nfor logarithmic-type equations and Yamabe-type equations. Moreover, under the\nnon-negative Bakry-\\'Emery curvature condition, we obtain complete sharp\nestimates for these equations. As a natural consequence of these results, we\nalso establish sharp Harnack inequalities and Liouville-type theorems for these\nequations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:55:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lu","Zhihao",""]]}
{"id":"2308.09564","submitter":"Shuai Wang","authors":"Shuai Wang, Yao Teng, Limin Wang","title":"Deep Equilibrium Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Query-based object detectors directly decode image features into object\ninstances with a set of learnable queries. These query vectors are\nprogressively refined to stable meaningful representations through a sequence\nof decoder layers, and then used to directly predict object locations and\ncategories with simple FFN heads. In this paper, we present a new query-based\nobject detector (DEQDet) by designing a deep equilibrium decoder. Our DEQ\ndecoder models the query vector refinement as the fixed point solving of an\n{implicit} layer and is equivalent to applying {infinite} steps of refinement.\nTo be more specific to object decoding, we use a two-step unrolled equilibrium\nequation to explicitly capture the query vector refinement. Accordingly, we are\nable to incorporate refinement awareness into the DEQ training with the inexact\ngradient back-propagation (RAG). In addition, to stabilize the training of our\nDEQDet and improve its generalization ability, we devise the deep supervision\nscheme on the optimization path of DEQ with refinement-aware\nperturbation~(RAP). Our experiments demonstrate DEQDet converges faster,\nconsumes less memory, and achieves better results than the baseline counterpart\n(AdaMixer). In particular, our DEQDet with ResNet50 backbone and 300 queries\nachieves the $49.5$ mAP and $33.0$ AP$_s$ on the MS COCO benchmark under\n$2\\times$ training scheme (24 epochs).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:56:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Shuai",""],["Teng","Yao",""],["Wang","Limin",""]]}
{"id":"2308.09565","submitter":"Guojun Zhang","authors":"Guojun Zhang, Mahdi Beitollahi, Alex Bie, Xi Chen","title":"Normalization Is All You Need: Understanding Layer-Normalized Federated\n  Learning under Extreme Label Shift","comments":"23 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Layer normalization (LN) is a widely adopted deep learning technique\nespecially in the era of foundation models. Recently, LN has been shown to be\nsurprisingly effective in federated learning (FL) with non-i.i.d. data.\nHowever, exactly why and how it works remains mysterious. In this work, we\nreveal the profound connection between layer normalization and the label shift\nproblem in federated learning. To understand layer normalization better in FL,\nwe identify the key contributing mechanism of normalization methods in FL,\ncalled feature normalization (FN), which applies normalization to the latent\nfeature representation before the classifier head. Although LN and FN do not\nimprove expressive power, they control feature collapse and local overfitting\nto heavily skewed datasets, and thus accelerates global training. Empirically,\nwe show that normalization leads to drastic improvements on standard benchmarks\nunder extreme label shift. Moreover, we conduct extensive ablation studies to\nunderstand the critical factors of layer normalization in FL. Our results\nverify that FN is an essential ingredient inside LN to significantly improve\nthe convergence of FL while remaining robust to learning rate choices,\nespecially under extreme label shift where each client has access to few\nclasses.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:57:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Guojun",""],["Beitollahi","Mahdi",""],["Bie","Alex",""],["Chen","Xi",""]]}
{"id":"2308.09566","submitter":"Yanmei Jiao","authors":"Yanmei Jiao, Binxin Zhang, Peng Jiang, Rong Xiong, Yue Wang","title":"3D Model-free Visual localization System from Essential Matrix under\n  Local Planar Motion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Visual localization plays a critical role in the functionality of low-cost\nautonomous mobile robots. Current state-of-the-art approaches to accurate\nvisual localization are 3D scene-specific, requiring additional computational\nand storage resources to construct a 3D scene model when facing a new\nenvironment. An alternative approach of directly using a database of 2D images\nfor visual localization offers more flexibility. However, such methods\ncurrently suffer from limited localization accuracy. In this paper, we propose\na robust and accurate multiple checking-based 3D model-free visual localization\nsystem that addresses the aforementioned issues. The core idea is to model the\nlocal planar motion characteristic of general ground-moving robots into both\nessential matrix estimation and triangulation stages to obtain two minimal\nsolutions. By embedding the proposed minimal solutions into the multiple\nchecking scheme, the proposed 3D model-free visual localization framework\ndemonstrates high accuracy and robustness in both simulation and real-world\nexperiments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:57:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiao","Yanmei",""],["Zhang","Binxin",""],["Jiang","Peng",""],["Xiong","Rong",""],["Wang","Yue",""]]}
{"id":"2308.09567","submitter":"Sebastian Brandhofer","authors":"Sebastian Brandhofer, Ilia Polian, Kevin Krsulich","title":"Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A limited number of qubits, high error rates, and limited qubit connectivity\nare major challenges for effective near-term quantum computations. Quantum\ncircuit partitioning divides a quantum computation into a set of computations\nthat include smaller-scale quantum (sub)circuits and classical postprocessing\nsteps. These quantum subcircuits require fewer qubits, incur a smaller effort\nfor satisfying qubit connectivity requirements, and typically incur less error.\nThus, quantum circuit partitioning has the potential to enable quantum\ncomputations that would otherwise only be available on more matured hardware.\nHowever, partitioning quantum circuits generally incurs an exponential increase\nin quantum computing runtime by repeatedly executing quantum subcircuits.\nPrevious work results in non-optimal subcircuit executions hereby limiting the\nscope of quantum circuit partitioning.\n  In this work, we develop an optimal partitioning method based on recent\nadvances in quantum circuit knitting. By considering wire cuts and gate cuts in\nconjunction with ancilla qubit insertions and classical communication, the\ndeveloped method can determine a minimal cost quantum circuit partitioning.\nCompared to previous work, we demonstrate the developed method to reduce the\noverhead in quantum computing time by 73% on average for 56% of evaluated\nquantum circuits. Given a one hour runtime budget on a typical near-term\nquantum computer, the developed method could reduce the qubit requirement of\nthe evaluated quantum circuits by 40% on average. These results highlight the\nability of the developed method to extend the computational reach of near-term\nquantum computers by reducing the qubit requirement at a lower increase in\nquantum circuit executions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:59:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brandhofer","Sebastian",""],["Polian","Ilia",""],["Krsulich","Kevin",""]]}
{"id":"2308.09568","submitter":"Shuhui Wu","authors":"Shuhui Wu, Zengming Tang, Zongyi Guo, Weiwei Zhang, Baoliang Cui,\n  Haihong Tang, Weiming Lu","title":"PUMGPT: A Large Vision-Language Model for Product Understanding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent developments of multi-modal large language models have demonstrated\nits strong ability in solving vision-language tasks. In this paper, we focus on\nthe product understanding task, which plays an essential role in enhancing\nonline shopping experience. Product understanding task includes a variety of\nsub-tasks, which require models to respond diverse queries based on multi-modal\nproduct information. Traditional methods design distinct model architectures\nfor each sub-task. On the contrary, we present PUMGPT, a large vision-language\nmodel aims at unifying all product understanding tasks under a singular model\nstructure. To bridge the gap between vision and text representations, we\npropose Layer-wise Adapters (LA), an approach that provides enhanced alignment\nwith fewer visual tokens and enables parameter-efficient fine-tuning. Moreover,\nthe inherent parameter-efficient fine-tuning ability allows PUMGPT to be\nreadily adapted to new product understanding tasks and emerging products. We\ndesign instruction templates to generate diverse product instruction datasets.\nSimultaneously, we utilize open-domain datasets during training to improve the\nperformance of PUMGPT and its generalization ability. Through extensive\nevaluations, PUMGPT demonstrates its superior performance across multiple\nproduct understanding tasks, including product captioning, category\nquestion-answering, attribute extraction, attribute question-answering, and\neven free-form question-answering about products.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:01:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Shuhui",""],["Tang","Zengming",""],["Guo","Zongyi",""],["Zhang","Weiwei",""],["Cui","Baoliang",""],["Tang","Haihong",""],["Lu","Weiming",""]]}
{"id":"2308.09569","submitter":"Huanchen Zhang","authors":"Huanchen Zhang, Yihao Liu, Jiaqi Yan","title":"Cost-Intelligent Data Analytics in the Cloud","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For decades, database research has focused on optimizing performance under\nfixed resources. As more and more database applications move to the public\ncloud, we argue that it is time to make cost a first-class citizen when solving\ndatabase optimization problems. In this paper, we introduce the concept of cost\nintelligence and envision the architecture of a cloud data warehouse designed\nfor that. We investigate two critical challenges to achieving cost intelligence\nin an analytical system: automatic resource deployment and cost-oriented\nauto-tuning. We describe our system architecture with an emphasis on the\ncomponents that are missing in today's cloud data warehouses. Each of these new\ncomponents represents unique research opportunities in this much-needed\nresearch area.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:02:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Huanchen",""],["Liu","Yihao",""],["Yan","Jiaqi",""]]}
{"id":"2308.09570","submitter":"Daniele Castellana","authors":"Daniele Castellana, Federico Errica","title":"Investigating the Interplay between Features and Structures in Graph\n  Learning","comments":null,"journal-ref":"MLG Workshop at ECMLPKDD 2023","doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the past, the dichotomy between homophily and heterophily has inspired\nresearch contributions toward a better understanding of Deep Graph Networks'\ninductive bias. In particular, it was believed that homophily strongly\ncorrelates with better node classification predictions of message-passing\nmethods. More recently, however, researchers pointed out that such dichotomy is\ntoo simplistic as we can construct node classification tasks where graphs are\ncompletely heterophilic but the performances remain high. Most of these works\nhave also proposed new quantitative metrics to understand when a graph\nstructure is useful, which implicitly or explicitly assume the correlation\nbetween node features and target labels. Our work empirically investigates what\nhappens when this strong assumption does not hold, by formalising two\ngenerative processes for node classification tasks that allow us to build and\nstudy ad-hoc problems. To quantitatively measure the influence of the node\nfeatures on the target labels, we also use a metric we call Feature\nInformativeness. We construct six synthetic tasks and evaluate the performance\nof six models, including structure-agnostic ones. Our findings reveal that\npreviously defined metrics are not adequate when we relax the above assumption.\nOur contribution to the workshop aims at presenting novel research findings\nthat could help advance our understanding of the field.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:02:56 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Castellana","Daniele",""],["Errica","Federico",""]]}
{"id":"2308.09571","submitter":"Monika Nagy-Huber","authors":"Monika Nagy-Huber, Volker Roth","title":"Physics-Informed Boundary Integral Networks (PIBI-Nets): A Data-Driven\n  Approach for Solving Partial Differential Equations","comments":"Preprint. Submitted to Journal of Computational Science, Elsevier,\n  for special issue \"Machine Learning and Data Assimilation for Dynamical\n  Systems\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.DS math.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Partial differential equations (PDEs) can describe many relevant phenomena in\ndynamical systems. In real-world applications, we commonly need to combine\nformal PDE models with (potentially noisy) observations. This is especially\nrelevant in settings where we lack information about boundary or initial\nconditions, or where we need to identify unknown model parameters. In recent\nyears, Physics-informed neural networks (PINNs) have become a popular tool for\nproblems of this kind. In high-dimensional settings, however, PINNs often\nsuffer from computational problems because they usually require dense\ncollocation points over the entire computational domain. To address this\nproblem, we present Physics-Informed Boundary Integral Networks (PIBI-Nets) as\na data-driven approach for solving PDEs in one dimension less than the original\nproblem space. PIBI-Nets only need collocation points at the computational\ndomain boundary, while still achieving highly accurate results, and in several\npractical settings, they clearly outperform PINNs. Exploiting elementary\nproperties of fundamental solutions of linear differential operators, we\npresent a principled and simple way to handle point sources in inverse\nproblems. We demonstrate the excellent performance of PIBI-Nets for the Laplace\nand Poisson equations, both on artificial data sets and within a real-world\napplication concerning the reconstruction of groundwater flows.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:03:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nagy-Huber","Monika",""],["Roth","Volker",""]]}
{"id":"2308.09572","submitter":"Deyan Sun","authors":"B. Zhang, D. M. Zhang, D. Y. Sun and X. G. Gong","title":"Two Kinetically Different Supercooled Liquids -- Potential Energy\n  Landscape Perspective","comments":"7 figures 24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During the process of rapid cooling, two distinct types of supercooled\nliquids are found. One kind of supercooled liquids destines to crystallize (the\ncrystal-forming liquid (GFL)), and the other forms a glass (the glass-forming\nliquid (GFL)). Despite having no significant differences in conventional\nphysical quantities such as structure and energy, the distribution of the\npotential energy after short-time averaging reveals the emergence of\ndistinction. By analyzing the skewness of the potential energy distribution\nafter the short-time average, a new characteristic time ($\\Delta_{CTS)}$)\nemerges. For a given temperature, the skewness reaches an extremum when the\nduration of the short-time average equals this characteristic time.\nInterestingly, this characteristic time scale follows a Curie-like law\n($\\Delta_{CTS}\\sim 1/(T-T^{*})^{{\\gamma}}$) with an exponent $\\gamma$, which\neffectively distinguishes these two types of supercooled liquids. The value of\n$\\gamma$ undergoes a discontinuous transition at the critical cooling rate. The\nvalue of $\\gamma_{g}$, corresponding to GFL, is always greater than\n$\\gamma_{c}$ associated with CFL. Remarkably, $T^{*}$ precisely represents the\nglass transition temperature (Tg ) or the crystallization temperature (Tc ) for\nGFL and CFL, respectively. Theoretical analysis suggests that, the Curie-like\nlaw implies a kinetic phase transition. The essential difference between these\ntwo types of supercooled liquids lies in the different in local potential\nenergy landscapes. First, the atomic motion in GFL may have more strong\ncorrelation than that in CFL. Second, CFL may possess a lower configurational\nentropy than GFL. The current study not only delineates the differentiation\nbetween the two types of supercooled liquids, but also provides a new\nperspective for exploring the nature of glasses.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:03:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","B.",""],["Zhang","D. M.",""],["Sun","D. Y.",""],["Gong","X. G.",""]]}
{"id":"2308.09573","submitter":"Na Meng","authors":"Juntong Chen and Kulendra Kumar Kaushal and Rutwik Kulkarni and Na\n  Meng","title":"How Do Java Developers Reuse StackOverflow Answers in Their GitHub\n  Projects?","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  StackOverflow (SO) is a widely used question-and-answer (Q\\&A) website for\nsoftware developers and computer scientists. GitHub is an online development\nplatform used for storing, tracking, and collaborating on software projects.\nPrior work relates the information mined from both platforms to link user\naccounts or compare developers' activities across platforms. However, not much\nwork is done to characterize the SO answers reused by GitHub projects. For this\npaper, we did an empirical study by mining the SO answers reused by Java\nprojects available on GitHub. We created a hybrid approach of clone detection,\nkeyword-based search, and manual inspection, to identify the answer(s) actually\nleveraged by developers. Based on the identified answers, we further studied\ntopics of the discussion threads, answer characteristics (e.g., scores, ages,\ncode lengths, and text lengths), and developers' reuse practices.\n  We observed that most reused answers offer programs to implement specific\ncoding tasks. Among all analyzed SO discussion threads, the reused answers\noften have relatively higher scores, older ages, longer code, and longer text\nthan unused answers. In only 9% of scenarios (40/430), developers fully copied\nanswer code for reuse. In the remaining scenarios, they reused partial code or\ncreated brand new code from scratch. Our study characterized 130 SO discussion\nthreads referred to by Java developers in 357 GitHub projects. Our empirical\nfindings can guide SO answerers to provide better answers, and shed lights on\nfuture research related to SO and GitHub.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:04:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Juntong",""],["Kaushal","Kulendra Kumar",""],["Kulkarni","Rutwik",""],["Meng","Na",""]]}
{"id":"2308.09574","submitter":"Jeffrey Everts","authors":"Jeffrey C. Everts and Bogdan Cichocki","title":"Dissipative effects in odd viscous Stokes flow around a single sphere","comments":"6 pages, 2 figures, Supplemental Material can be found under\n  ancillary files","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Odd viscosity (OV) is a transport coefficient in, for example, fluids of\nself-spinning (active) particles or electrons in an external magnetic field.\nThe key feature of OV is that it does not contribute to dissipation in two\nspatial dimensions. In contrast, we explicitly show that in the\nthree-dimensional case, OV can contribute indirectly to dissipation by\nmodifying the fluid flow. We quantify the dissipation rate of a single\nspherical particle moving through a fluid with OV via an exact analytical\nsolution of the generalised stationary creeping flow equations. Our results\nprovide a novel way to quantify the effects of OV by measuring the solid-body\nmotion of a single spherical particle. Moreover, we explicitly demonstrate how\ncomplex fluids can be designed in terms of their rheological properties by\nmixing passive particles with self-spinning active particles.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:05:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Everts","Jeffrey C.",""],["Cichocki","Bogdan",""]]}
{"id":"2308.09575","submitter":"Jana Rieger","authors":"Waleed Esmail, Jana Rieger, Jenny Taylor, Malin Bohman, Karin\n  Sch\\\"onning","title":"KinFit -- A Kinematic Fitting Package for Hadron Physics Experiments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A kinematic fitting package, KinFit, based on the Lagrange multiplier\ntechnique has been implemented for generic hadron physics experiments. It is\nparticularly suitable for experiments where the interaction point is unknown,\nsuch as experiments with extended target volumes. The KinFit package includes\nvertex finding tools and fitting with kinematic constraints, such as mass\nhypothesis and four-momentum conservation, as well as combinations of these\nconstraints. The new package is distributed as an open source software via\nGitHub.\n  This paper presents a comprehensive description of the KinFit package and its\nfeatures, as well as a benchmark study using Monte Carlo simulations of the\n$pp\\rightarrow pK^+\\Lambda \\rightarrow pK^+p\\pi^-$ reaction. The results show\nthat KinFit improves the parameter resolution and provides an excellent basis\nfor event selection.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:05:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Esmail","Waleed",""],["Rieger","Jana",""],["Taylor","Jenny",""],["Bohman","Malin",""],["Sch\u00f6nning","Karin",""]]}
{"id":"2308.09576","submitter":"Calvin Pfeifer","authors":"Calvin Pfeifer","title":"Remarks on $\\tau$-tilted versions of the second Brauer-Thrall Conjecture","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this short note, we state a stable and a $\\tau$-reduced version of the\nsecond Brauer-Thrall Conjecture. The former is a slight strengthening of a\nbrick version of the second Brauer-Thrall Conjecture raised by Mousavand and\nSchroll-Treffinger-Valdivieso. The latter is stated in terms of\nGeiss-Leclerc-Schr\\\"oer's generically $\\tau$-reduced components and provides a\ngeometric interpretation of a question of Demonet. It follows that the stable\nsecond Brauer-Thrall Conjecture implies our $\\tau$-reduced second Brauer-Thrall\nConjecture. Finally, we prove the reversed implication for the class of E-tame\nalgebras recently introduced by Asai-Iyama.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:09:54 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pfeifer","Calvin",""]]}
{"id":"2308.09577","submitter":"Linda Hoyer","authors":"Linda Hoyer and Gabriele Nebe","title":"Orthogonal Determinants of SL3(q) and SU3(q)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We give a full list of the orthogonal determinants of the even degree\nindicator '+' ordinary irreducible characters of $\\mathrm{SL}_3(q)$ and\n$\\mathrm{SU}_3(q)$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:16:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hoyer","Linda",""],["Nebe","Gabriele",""]]}
{"id":"2308.09578","submitter":"Deepika Saxena","authors":"Deepika Saxena, Ishu Gupta, Rishabh Gupta, Ashutosh Kumar Singh, and\n  Xiaoqing Wen","title":"An AI-Driven VM Threat Prediction Model for Multi-Risks Analysis-Based\n  Cloud Cybersecurity","comments":null,"journal-ref":"IEEE Transactions on Systems, Man, and Cybernetics: Systems\n  Journal, 2023","doi":"10.1109/TSMC.2023.3288081","report-no":null,"categories":"cs.CR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cloud virtualization technology, ingrained with physical resource sharing,\nprompts cybersecurity threats on users' virtual machines (VM)s due to the\npresence of inevitable vulnerabilities on the offsite servers. Contrary to the\nexisting works which concentrated on reducing resource sharing and encryption\nand decryption of data before transfer for improving cybersecurity which raises\ncomputational cost overhead, the proposed model operates diversely for\nefficiently serving the same purpose. This paper proposes a novel Multiple\nRisks Analysis based VM Threat Prediction Model (MR-TPM) to secure\ncomputational data and minimize adversary breaches by proactively estimating\nthe VMs threats. It considers multiple cybersecurity risk factors associated\nwith the configuration and management of VMs, along with analysis of users'\nbehaviour. All these threat factors are quantified for the generation of\nrespective risk score values and fed as input into a machine learning based\nclassifier to estimate the probability of threat for each VM. The performance\nof MR-TPM is evaluated using benchmark Google Cluster and OpenNebula VM threat\ntraces. The experimental results demonstrate that the proposed model\nefficiently computes the cybersecurity risks and learns the VM threat patterns\nfrom historical and live data samples. The deployment of MR-TPM with existing\nVM allocation policies reduces cybersecurity threats up to 88.9%.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:18:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Saxena","Deepika",""],["Gupta","Ishu",""],["Gupta","Rishabh",""],["Singh","Ashutosh Kumar",""],["Wen","Xiaoqing",""]]}
{"id":"2308.09579","submitter":"Jon Carlson","authors":"David J. Benson and Jon F. Carlson","title":"Modules with finitely generated cohomology","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $G$ be a finite group and $\\mathsf{k}$ a field of characteristic $p$. It\nis conjectured in a paper of the first author and John Greenlees that the thick\nsubcategory of the stable module category StMod$(\\mathsf{k}G)$ consisting of\nmodules whose cohomology is finitely generated over\n$\\mathsf{H}^*(G,\\mathsf{k})$ is generated by finite dimensional modules and\nmodules with no cohomology. If the centraliser of every element of order $p$ in\n$G$ is $p$-nilpotent, this statement follows from previous work. Our purpose\nhere is to prove this conjecture in two cases with non $p$-nilpotent\ncentralisers. The groups involved are ${\\mathbb Z}/3^r\\times\\Sigma_3$ ($r> 0$)\nin characteristic three and ${\\mathbb Z}/2\\times A_4$ in characteristic two.\n  As a consequence, in these cases the bounded derived category of $C^*BG$\n(cochains on $BG$ with coefficients in $\\mathsf{k}$) is generated by $C^*BS$,\nwhere $S$ is a Sylow $p$-subgroup of $G$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:19:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Benson","David J.",""],["Carlson","Jon F.",""]]}
{"id":"2308.09580","submitter":"Sugata Adhya","authors":"Sugata Adhya and A. Deb Ray","title":"On a Generalization of Quasi-metric Space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We find an extension of the quasi-metric (to be called $g$-quasi metric) such\nthat the induced generalized topology may fail to form a topology. We show that\n$g$-quasi metrizability is a $g$-topologically invariant property of\ngeneralized topological spaces. Extending metric product and uniform continuity\nfor $g$-quasi metric spaces, we note that a $g$-quasi metric may fail to be\nuniformly continuous in the extended sense unlike usual metric. Finally, we\nextend the study of completeness, Lebesgue property and weak $G$-completeness\nfor $g$-quasi metric spaces.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:21:07 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Adhya","Sugata",""],["Ray","A. Deb",""]]}
{"id":"2308.09581","submitter":"Zhigang Bao","authors":"Zhigang Bao, Jaehun Lee, Xiaocong Xu","title":"Phase transition for the smallest eigenvalue of covariance matrices","comments":"preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the smallest non-zero eigenvalue of the sample\ncovariance matrices $\\mathcal{S}(Y)=YY^*$, where $Y=(y_{ij})$ is an $M\\times N$\nmatrix with iid mean $0$ variance $N^{-1}$ entries. We prove a phase transition\nfor its distribution, induced by the fatness of the tail of $y_{ij}$'s. More\nspecifically, we assume that $y_{ij}$ is symmetrically distributed with tail\nprobability $\\mathbb{P}(|\\sqrt{N}y_{ij}|\\geq x)\\sim x^{-\\alpha}$ when $x\\to\n\\infty$, for some $\\alpha\\in (2,4)$. We show the following conclusions: (i).\nWhen $\\alpha>\\frac83$, the smallest eigenvalue follows the Tracy-Widom law on\nscale $N^{-\\frac23}$; (ii). When $2<\\alpha<\\frac83$, the smallest eigenvalue\nfollows the Gaussian law on scale $N^{-\\frac{\\alpha}{4}}$; (iii). When\n$\\alpha=\\frac83$, the distribution is given by an interpolation between\nTracy-Widom and Gaussian; (iv). In case $\\alpha\\leq \\frac{10}{3}$, in addition\nto the left edge of the MP law, a deterministic shift of order\n$N^{1-\\frac{\\alpha}{2}}$ shall be subtracted from the smallest eigenvalue, in\nboth the Tracy-Widom law and the Gaussian law. Overall speaking, our proof\nstrategy is inspired by \\cite{ALY} which is originally done for the bulk regime\nof the L\\'{e}vy Wigner matrices. In addition to various technical complications\narising from the bulk-to-edge extension, two ingredients are needed for our\nderivation: an intermediate left edge local law based on a simple but effective\nmatrix minor argument, and a mesoscopic CLT for the linear spectral statistic\nwith asymptotic expansion for its expectation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:22:25 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 14:34:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bao","Zhigang",""],["Lee","Jaehun",""],["Xu","Xiaocong",""]]}
{"id":"2308.09582","submitter":"Yotam Dikstein","authors":"Yotam Dikstein, Irit Dinur","title":"Agreement theorems for high dimensional expanders in the small soundness\n  regime: the role of covers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a family $X$ of subsets of $[n]$ and an ensemble of local functions\n$\\{f_s:s\\to\\Sigma\\; | \\; s\\in X\\}$, an agreement test is a randomized property\ntester that is supposed to test whether there is some global function\n$G:[n]\\to\\Sigma$ such that $f_s=G|_s$ for many sets $s$. A \"classical\"\nsmall-soundness agreement theorem is a list-decoding $(LD)$ statement, saying\nthat \\[\\tag{$LD$} Agree(\\{f_s\\}) > \\varepsilon \\quad \\Longrightarrow \\quad\n\\exists G^1,\\dots, G^\\ell,\\quad P_s[f_s\\overset{0.99}{\\approx}G^i|_s]\\geq\npoly(\\varepsilon),\\;i=1,\\dots,\\ell. \\] Such a statement is motivated by PCP\nquestions and has been shown in the case where $X=\\binom{[n]}k$, or where $X$\nis a collection of low dimensional subspaces of a vector space.\n  In this work we study small the case of on high dimensional expanders $X$. It\nhas been an open challenge to analyze their small soundness behavior.\nSurprisingly, the small soundness behavior turns out to be governed by the\ntopological covers of $X$.We show that:\n  1. If $X$ has no connected covers, then $(LD)$ holds, provided that $X$\nsatisfies an additional expansion property.\n  2. If $X$ has a connected cover, then $(LD)$ necessarily fails.\n  3. If $X$ has a connected cover (and assuming the additional expansion\nproperty), we replace the $(LD)$ by a weaker statement we call lift-decoding:\n  \\[ \\tag{$LFD$}\n  Agree(\\{f_s\\})> \\varepsilon \\Longrightarrow \\quad \\exists\\text{ cover\n}\\rho:Y\\twoheadrightarrow X,\\text{ and }G:Y(0)\\to\\Sigma,\\text{ such that }\\]\n\\[P_{{\\tilde s\\twoheadrightarrow s}}[f_s \\overset{0.99}{\\approx} G|_{\\tilde s}]\n\\geq poly(\\varepsilon),\\] where ${\\tilde s\\twoheadrightarrow s}$ means that\n$\\rho(\\tilde s)=s$.\n  The additional expansion property is cosystolic expansion of a complex\nderived from $X$ holds for the spherical building and for quotients of the\nBruhat-Tits building.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:23:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dikstein","Yotam",""],["Dinur","Irit",""]]}
{"id":"2308.09583","submitter":"Qingfeng Sun","authors":"Haipeng Luo, Qingfeng Sun, Can Xu, Pu Zhao, Jianguang Lou, Chongyang\n  Tao, Xiubo Geng, Qingwei Lin, Shifeng Chen, Dongmei Zhang","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models\n  via Reinforced Evol-Instruct","comments":"LLM, Mathematical Reasoning","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs), such as GPT-4, have shown remarkable\nperformance in natural language processing (NLP) tasks, including challenging\nmathematical reasoning. However, most existing open-source models are only\npre-trained on large-scale internet data and without math-related optimization.\nIn this paper, we present WizardMath, which enhances the mathematical reasoning\nabilities of Llama-2, by applying our proposed Reinforcement Learning from\nEvol-Instruct Feedback (RLEIF) method to the domain of math. Through extensive\nexperiments on two mathematical reasoning benchmarks, namely GSM8k and MATH, we\nreveal the extraordinary capabilities of our model. WizardMath surpasses all\nother open-source LLMs by a substantial margin. Furthermore, our model even\noutperforms ChatGPT-3.5, Claude Instant-1, PaLM-2 and Minerva on GSM8k,\nsimultaneously surpasses Text-davinci-002, PaLM-1 and GPT-3 on MATH. More\ndetails and model weights are public at https://github.com/nlpxucan/WizardLM\nand https://huggingface.co/WizardLM.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:23:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","Haipeng",""],["Sun","Qingfeng",""],["Xu","Can",""],["Zhao","Pu",""],["Lou","Jianguang",""],["Tao","Chongyang",""],["Geng","Xiubo",""],["Lin","Qingwei",""],["Chen","Shifeng",""],["Zhang","Dongmei",""]]}
{"id":"2308.09584","submitter":"Pamela Freeman","authors":"P. Freeman, S. Bottinelli, R. Plume, E. Caux, C. Monaghan, B.\n  Mookerjea","title":"Parsec scales of carbon chain and complex organic molecules in AFGL 2591\n  and IRAS 20126","comments":"26 pages, 22 figures, 6 tables, accepted in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  (Abridged) There is a diverse chemical inventory in protostellar regions\nleading to the classification of extreme types of systems. Warm carbon chain\nchemistry sources, for one, are the warm and dense regions near a protostar\ncontaining unsaturated carbon chain molecules. Since the presentation of this\ndefinition in 2008, there is a growing field to detect and characterise these\nsources. The details are lesser known in relation to hot cores and in high-mass\nstar-forming regions -- regions of great importance in galactic evolution. To\ninvestigate the prevalence of carbon chain species and their environment in\nhigh-mass star-forming regions, we have conducted targeted spectral surveys of\ntwo sources in the direction of Cygnus X -- AFGL 2591 and IRAS 20126+4104 --\nwith the Green Bank Telescope and the IRAM 30m Telescope. We have constructed a\nLocal Thermodynamic Equilibrium (LTE) model using the observed molecular\nspectra to determine the physical environment in which these molecules\noriginate. We map both the observed spatial distribution and the physical\nparameters found from the LTE model. We also determine the formation routes of\nthese molecules in each source using the three-phase NAUTILUS chemical\nevolution code. We detect several lines of propyne, CH$_3$CCH, and\ncyclopropenylidene, $c$-C$_3$H$_2$ as tracers of carbon chain chemistry, as\nwell as several lines of formaldehyde, H$_2$CO, and methanol, CH$_3$OH, as a\nprecursor and a tracer of complex organic molecule chemistry, respectively. We\nfind excitation temperatures of 20-30 K for the carbon chains and 8-85 K for\nthe complex organics. The CH$_3$CCH abundances are reproduced by a warm-up\nmodel, consistent with warm carbon chain chemistry, while the observed CH$_3$OH\nabundances require a shock mechanism sputtering the molecules into the gas\nphase.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:23:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Freeman","P.",""],["Bottinelli","S.",""],["Plume","R.",""],["Caux","E.",""],["Monaghan","C.",""],["Mookerjea","B.",""]]}
{"id":"2308.09585","submitter":"Daniel Cranston","authors":"Daniel W. Cranston","title":"Bounding Clique Size in Squares of Planar Graphs","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Wegner conjectured that if $G$ is a planar graph with maximum degree\n$\\Delta\\ge 8$, then $\\chi(G^2)\\le \\left\\lfloor \\frac32\\Delta\\right\\rfloor +1$.\nThis problem has received much attention, but remains open for all $\\Delta\\ge\n8$. Here we prove an analogous bound on $\\omega(G^2)$: If $G$ is a plane graph\nwith $\\Delta(G)\\ge 36$, then $\\omega(G^2)\\le \\lfloor\\frac32\\Delta(G)\\rfloor+1$.\nIn fact, this is a corollary of the following lemma, which is our main result.\nIf $G$ is a plane graph with $\\Delta(G)\\ge 19$ and $S$ is a maximal clique in\n$G^2$ with $|S|\\ge \\Delta(G)+20$, then there exist $x,y,z\\in V(G)$ such that\n$S=\\{w:|N[w]\\cap\\{x,y,z\\}|\\ge 2\\}$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:23:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cranston","Daniel W.",""]]}
{"id":"2308.09586","submitter":"Michael Clemens","authors":"Michael Clemens","title":"Explaining the Arts: Toward a Framework for Matching Creative Tasks with\n  Appropriate Explanation Mediums","comments":"3 pages, 1 figure, XAIxArts2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although explainable computational creativity seeks to create and sustain\ncomputational models of creativity that foster a collaboratively creative\nprocess through explainability, there remains little to no work in supporting\ndesigners when exploring the explanation medium. While explainable artificial\nintelligence methods tend to support textual, visual, and numerical\nexplanations, within the arts, interaction mediums such as auditorial, tactile,\nand olfactoral may offer more salient communication within the creative process\nitself. Through this research, I propose a framework to assist designers of\nexplainable user interfaces in modeling the type of interaction they wish to\ncreate using explanations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:29:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Clemens","Michael",""]]}
{"id":"2308.09587","submitter":"Calvin Pfeifer","authors":"Calvin Pfeifer","title":"A generic classification of locally free representations of affine GLS\n  algebras","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Throughout, let $K$ be an algebraically closed field of characteristic $0$.\nWe provide a generic classification of locally free representations of\nGeiss-Leclerc-Schr\\\"oer's algebras $H_K(C,D,\\Omega)$ associated to affine\nCartan matrices $C$ with minimal symmetrizer $D$ and acyclic orientation\n$\\Omega$. Affine GLS algebras are \"smooth\" degenerations of tame hereditary\nalgebras and as such their representation theory is presumably still tractable.\nIndeed, we observe several \"tame\" phenomena of affine GLS algebras even though\nthey are in general representation wild. For the GLS algebras of type\n$\\tilde{BC}_1$, we achieve a classification of all stable representations. For\ngeneral GLS algebras of affine type, we construct a $1$-parameter family of\nrepresentations stable with respect to the defect. Our construction is based on\na generalized one-point extension technique. This confirms in particular\n$\\tau$-tilted versions of the second Brauer-Thrall Conjecture recently raised\nby Mousavand and Schroll-Treffinger-Valdivieso for the class of GLS algebras.\nFinally, we show that generically every locally free $H$-module is isomorphic\nto a direct sum of $\\tau$-rigid modules and modules from our $1$-parameter\nfamily. This generalizes Kac's canonical decomposition from the symmetric to\nthe symmetrizable case in affine types, and we obtain such a decomposition by\n\"folding\" the canonical decomposition of dimension vectors over path algebras.\nAs a corollary we obtain that affine GLS algebras are $E$-tame in the sense of\nDerksen-Fei and Asai-Iyama.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:29:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pfeifer","Calvin",""]]}
{"id":"2308.09588","submitter":"Mat\\'ias Cerioni","authors":"M. Cerioni (1), C. Beaug\\'e (1) ((1) Instituto de Astronom\\'ia\n  Te\\'orica y Experimental (IATE), Observatorio Astron\\'omico, Universidad\n  Nacional de C\\'ordoba, Argentina)","title":"A Six-Planet Resonance Chain in K2-138?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The K2-138 system hosts six planets and presents an interesting case study\ndue to its distinctive dynamical structure. Its five inner planets are near a\nchain of 3/2 two-body mean-motion resonances, while the outermost body (planet\n{\\it g}) is significantly detached, having a mean-motion ratio of $n_f/n_g \\sim\n3.3$ with its closest neighbor. We show that the orbit of $m_g$ is actually\nconsistent with the first-order three-planet resonance (3P-MMR) characterized\nby the relation $2n_e - 4n_f + 3n_g = 0$ and is the first time a pure\nfirst-order 3P-MMR is found in a multi-planet system and tied to its current\ndynamical structure. Adequate values for the masses allow to trace the\ndynamical history of the system from an initial capture in a 6-planet chain\n(with $n_f/n_g$ in a 3/1 resonance), up to its current configuration due to\ntidal interactions over the age of the star. The increase in resonance offset\nwith semi-major axis, as well as its large value for $n_f/n_g$ can be explained\nby the slopes of the pure three-planet resonances in the mean-motion ratio\nplane. The triplets slide outward over these curves when the innermost pair is\npulled apart by tidal effects, in a \\textit{pantograph-}like manner. The\ncapture into the 3P-MMR is found to be surprisingly robust given similar masses\nfor $m_g$ and $m_f$, and it is possible that the same effect may also be found\nin other compact planetary systems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:30:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cerioni","M.",""],["Beaug\u00e9","C.",""]]}
{"id":"2308.09589","submitter":"Federico Mazzola","authors":"Federico Mazzola, Stefan Enzner, Philipp Eck, Chiara Bigi, Matteo\n  Jugovac, Iulia Cojocariu, Vitaliy Feyer, Zhixue Shu, Gian Marco Pierantozzi,\n  Alessandro De Vita, Pietro Carrara, Jun Fujii, Phil D. C. King, Giovanni\n  Vinai, Pasquale Orgiani, Cephise Cacho, Matthew D. Watson, Giorgio Rossi,\n  Ivana Vobornik, Tai Kong, Domenico Di Sante, Giorgio Sangiovanni, Giancarlo\n  Panaccione","title":"Observation of termination-dependent topological connectivity in a\n  magnetic Weyl kagome-lattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Engineering surfaces and interfaces of materials promises great potential in\nthe field of heterostructures and quantum matter designer, with the opportunity\nof driving new many-body phases that are absent in the bulk compounds. Here, we\nfocus on the magnetic Weyl kagome system Co$_3$Sn$_2$S$_2$ and show how for\ndifferent sample's terminations the Weyl-points connect also differently, still\npreserving the bulk-boundary correspondence. Scanning-tunnelling microscopy has\nsuggested such a scenario indirectly. Here, we demonstrate this directly for\nthe fermiology of Co$_3$Sn$_2$S$_2$, by linking it to the system real space\nsurfaces distribution. By a combination of micro-ARPES and first-principles\ncalculations, we measure the energy-momentum spectra and the Fermi surfaces of\nCo$_3$Sn$_2$S$_2$ for different surface terminations and show the existence of\ntopological features directly depending on the top-layer electronic\nenvironment. Our work helps to define a route to control bulk-derived\ntopological properties by means of surface electrostatic potentials, creating a\nrealistic and reliable methodology to use Weyl kagome metals in responsive\nmagnetic spintronics.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:37:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mazzola","Federico",""],["Enzner","Stefan",""],["Eck","Philipp",""],["Bigi","Chiara",""],["Jugovac","Matteo",""],["Cojocariu","Iulia",""],["Feyer","Vitaliy",""],["Shu","Zhixue",""],["Pierantozzi","Gian Marco",""],["De Vita","Alessandro",""],["Carrara","Pietro",""],["Fujii","Jun",""],["King","Phil D. C.",""],["Vinai","Giovanni",""],["Orgiani","Pasquale",""],["Cacho","Cephise",""],["Watson","Matthew D.",""],["Rossi","Giorgio",""],["Vobornik","Ivana",""],["Kong","Tai",""],["Di Sante","Domenico",""],["Sangiovanni","Giorgio",""],["Panaccione","Giancarlo",""]]}
{"id":"2308.09590","submitter":"Bal\\'azs B\\'ar\\'any Dr.","authors":"Bal\\'azs B\\'ar\\'any and Antti K\\\"aenm\\\"aki","title":"Dimension of planar non-conformal attractors with triangular derivative\n  matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the dimension of the attractor and quasi-Bernoulli measures of\nparametrized families of iterated function systems of non-conformal and\nnon-affine maps. We introduce a transversality condition under which, relying\non a weak Ledrappier-Young formula, we show that the dimensions equal to the\nroot of the subadditive pressure and the Lyapunov dimension, respectively, for\nalmost every choice of parameters. We also exhibit concrete examples satisfying\nthe transversality condition with respect to the translation parameters.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:38:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["B\u00e1r\u00e1ny","Bal\u00e1zs",""],["K\u00e4enm\u00e4ki","Antti",""]]}
{"id":"2308.09591","submitter":"Yubin Hu","authors":"Yubin Hu, Sheng Ye, Wang Zhao, Matthieu Lin, Yuze He, Yu-Hui Wen, Ying\n  He, Yong-Jin Liu","title":"O^2-Recon: Completing 3D Reconstruction of Occluded Objects in the Scene\n  with a Pre-trained 2D Diffusion Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Occlusion is a common issue in 3D reconstruction from RGB-D videos, often\nblocking the complete reconstruction of objects and presenting an ongoing\nproblem. In this paper, we propose a novel framework, empowered by a 2D\ndiffusion-based in-painting model, to reconstruct complete surfaces for the\nhidden parts of objects. Specifically, we utilize a pre-trained diffusion model\nto fill in the hidden areas of 2D images. Then we use these in-painted images\nto optimize a neural implicit surface representation for each instance for 3D\nreconstruction. Since creating the in-painting masks needed for this process is\ntricky, we adopt a human-in-the-loop strategy that involves very little human\nengagement to generate high-quality masks. Moreover, some parts of objects can\nbe totally hidden because the videos are usually shot from limited\nperspectives. To ensure recovering these invisible areas, we develop a cascaded\nnetwork architecture for predicting signed distance field, making use of\ndifferent frequency bands of positional encoding and maintaining overall\nsmoothness. Besides the commonly used rendering loss, Eikonal loss, and\nsilhouette loss, we adopt a CLIP-based semantic consistency loss to guide the\nsurface from unseen camera angles. Experiments on ScanNet scenes show that our\nproposed framework achieves state-of-the-art accuracy and completeness in\nobject-level reconstruction from scene-level RGB-D videos.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:38:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hu","Yubin",""],["Ye","Sheng",""],["Zhao","Wang",""],["Lin","Matthieu",""],["He","Yuze",""],["Wen","Yu-Hui",""],["He","Ying",""],["Liu","Yong-Jin",""]]}
{"id":"2308.09592","submitter":"Wenhao Chai","authors":"Wenhao Chai, Xun Guo, Gaoang Wang, Yan Lu","title":"StableVideo: Text-driven Consistency-aware Diffusion Video Editing","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion-based methods can generate realistic images and videos, but they\nstruggle to edit existing objects in a video while preserving their appearance\nover time. This prevents diffusion models from being applied to natural video\nediting in practical scenarios. In this paper, we tackle this problem by\nintroducing temporal dependency to existing text-driven diffusion models, which\nallows them to generate consistent appearance for the edited objects.\nSpecifically, we develop a novel inter-frame propagation mechanism for\ndiffusion video editing, which leverages the concept of layered representations\nto propagate the appearance information from one frame to the next. We then\nbuild up a text-driven video editing framework based on this mechanism, namely\nStableVideo, which can achieve consistency-aware video editing. Extensive\nexperiments demonstrate the strong editing capability of our approach. Compared\nwith state-of-the-art video editing methods, our approach shows superior\nqualitative and quantitative results. Our code is available at\n\\href{https://github.com/rese1f/StableVideo}{this https URL}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:39:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chai","Wenhao",""],["Guo","Xun",""],["Wang","Gaoang",""],["Lu","Yan",""]]}
{"id":"2308.09593","submitter":"Yunhan Wang","authors":"Yunhan Wang, Xiangwei Shi, Shalini De Mello, Hyung Jin Chang, Xucong\n  Zhang","title":"Investigation of Architectures and Receptive Fields for Appearance-based\n  Gaze Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rapid development of deep learning technology in the past decade,\nappearance-based gaze estimation has attracted great attention from both\ncomputer vision and human-computer interaction research communities.\nFascinating methods were proposed with variant mechanisms including soft\nattention, hard attention, two-eye asymmetry, feature disentanglement, rotation\nconsistency, and contrastive learning. Most of these methods take the\nsingle-face or multi-region as input, yet the basic architecture of gaze\nestimation has not been fully explored. In this paper, we reveal the fact that\ntuning a few simple parameters of a ResNet architecture can outperform most of\nthe existing state-of-the-art methods for the gaze estimation task on three\npopular datasets. With our extensive experiments, we conclude that the stride\nnumber, input image resolution, and multi-region architecture are critical for\nthe gaze estimation performance while their effectiveness dependent on the\nquality of the input face image. We obtain the state-of-the-art performances on\nthree datasets with 3.64 on ETH-XGaze, 4.50 on MPIIFaceGaze, and 9.13 on\nGaze360 degrees gaze estimation error by taking ResNet-50 as the backbone.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:41:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Yunhan",""],["Shi","Xiangwei",""],["De Mello","Shalini",""],["Chang","Hyung Jin",""],["Zhang","Xucong",""]]}
{"id":"2308.09594","submitter":"Henrik Koch","authors":"Sara Angelico, Tor S. Haugland, Enrico Ronca, Henrik Koch","title":"Coupled cluster cavity Born-Oppenheimer approximation for electronic\n  strong coupling","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chemical and photochemical reactivity, as well as supramolecular organization\nand several other molecular properties, can be modified by strong interactions\nbetween light and matter. Theoretical studies of these phenomena require the\nseparation of the Schr\\\"odinger equation into different degrees of freedom as\nin the Born-Oppenheimer approximation. In this paper, we analyze the\nelectron-photon Hamiltonian within the cavity Born-Oppenheimer approximation\n(CBOA), where the electronic problem is solved for fixed nuclear positions and\nphotonic parameters. Specifically, we focus on intermolecular interactions in\nrepresentative dimer complexes. The CBOA potential energy surfaces are compared\nwith those obtained using a polaritonic approach, where the photonic and\nelectronic degrees of freedom are treated at the same level. This allows us to\nassess the role of electron-photon correlation and the accuracy of CBOA.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:43:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Angelico","Sara",""],["Haugland","Tor S.",""],["Ronca","Enrico",""],["Koch","Henrik",""]]}
{"id":"2308.09595","submitter":"Muhammad Arrasy Rahman","authors":"Arrasy Rahman, Jiaxun Cui, Peter Stone","title":"Minimum Coverage Sets for Training Robust Ad Hoc Teamwork Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robustly cooperating with unseen agents and human partners presents\nsignificant challenges due to the diverse cooperative conventions these\npartners may adopt. Existing Ad Hoc Teamwork (AHT) methods address this\nchallenge by training an agent with a population of diverse teammate policies\nobtained through maximizing specific diversity metrics. However, these\nheuristic diversity metrics do not always maximize the agent's robustness in\nall cooperative problems. In this work, we first propose that maximizing an AHT\nagent's robustness requires it to emulate policies in the minimum coverage set\n(MCS), the set of best-response policies to any partner policies in the\nenvironment. We then introduce the L-BRDiv algorithm that generates a set of\nteammate policies that, when used for AHT training, encourage agents to emulate\npolicies from the MCS. L-BRDiv works by solving a constrained optimization\nproblem to jointly train teammate policies for AHT training and approximating\nAHT agent policies that are members of the MCS. We empirically demonstrate that\nL-BRDiv produces more robust AHT agents than state-of-the-art methods in a\nbroader range of two-player cooperative problems without the need for extensive\nhyperparameter tuning for its objectives. Our study shows that L-BRDiv\noutperforms the baseline methods by prioritizing discovering distinct members\nof the MCS instead of repeatedly finding redundant policies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:45:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rahman","Arrasy",""],["Cui","Jiaxun",""],["Stone","Peter",""]]}
{"id":"2308.09596","submitter":"Arpit Merchant","authors":"Arpit Merchant, Carlos Castillo","title":"Disparity, Inequality, and Accuracy Tradeoffs in Graph Neural Networks\n  for Node Classification","comments":"Accepted to CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Graph neural networks (GNNs) are increasingly used in critical human\napplications for predicting node labels in attributed graphs. Their ability to\naggregate features from nodes' neighbors for accurate classification also has\nthe capacity to exacerbate existing biases in data or to introduce new ones\ntowards members from protected demographic groups. Thus, it is imperative to\nquantify how GNNs may be biased and to what extent their harmful effects may be\nmitigated. To this end, we propose two new GNN-agnostic interventions namely,\n(i) PFR-AX which decreases the separability between nodes in protected and\nnon-protected groups, and (ii) PostProcess which updates model predictions\nbased on a blackbox policy to minimize differences between error rates across\ndemographic groups. Through a large set of experiments on four datasets, we\nframe the efficacies of our approaches (and three variants) in terms of their\nalgorithmic fairness-accuracy tradeoff and benchmark our results against three\nstrong baseline interventions on three state-of-the-art GNN models. Our results\nshow that no single intervention offers a universally optimal tradeoff, but\nPFR-AX and PostProcess provide granular control and improve model confidence\nwhen correctly predicting positive outcomes for nodes in protected groups.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:45:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Merchant","Arpit",""],["Castillo","Carlos",""]]}
{"id":"2308.09597","submitter":"Cheng Li","authors":"Cheng Li, Ziang Leng, Chenxi Yan, Junyi Shen, Hao Wang, Weishi MI,\n  Yaying Fei, Xiaoyang Feng, Song Yan, HaoSheng Wang, Linkang Zhan, Yaokai Jia,\n  Pingyu Wu, Haozhen Sun","title":"ChatHaruhi: Reviving Anime Character in Reality via Large Language Model","comments":"v1 - First version of techique report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Role-playing chatbots built on large language models have drawn interest, but\nbetter techniques are needed to enable mimicking specific fictional characters.\nWe propose an algorithm that controls language models via an improved prompt\nand memories of the character extracted from scripts. We construct ChatHaruhi,\na dataset covering 32 Chinese / English TV / anime characters with over 54k\nsimulated dialogues. Both automatic and human evaluations show our approach\nimproves role-playing ability over baselines. Code and data are available at\nhttps://github.com/LC1332/Chat-Haruhi-Suzumiya .\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:50:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Cheng",""],["Leng","Ziang",""],["Yan","Chenxi",""],["Shen","Junyi",""],["Wang","Hao",""],["MI","Weishi",""],["Fei","Yaying",""],["Feng","Xiaoyang",""],["Yan","Song",""],["Wang","HaoSheng",""],["Zhan","Linkang",""],["Jia","Yaokai",""],["Wu","Pingyu",""],["Sun","Haozhen",""]]}
{"id":"2308.09598","submitter":"Silvia Noschese","authors":"Silvia Noschese and Lothar Reichel","title":"Enhancing multiplex global efficiency","comments":"18 pages, 1 figure, 5 tables","journal-ref":null,"doi":null,"report-no":"Roma01.Math.Na","categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modeling complex systems that consist of different types of objects leads to\nmultilayer networks, in which vertices are connected by both inter-layer and\nintra-layer edges. In this paper, we investigate multiplex networks, in which\nvertices in different layers are identified with each other, and the only\ninter-layer edges are those that connect a vertex with its copy in other\nlayers. Let the third-order adjacency tensor $\\mathcal{A}\\in\\R^{N\\times N\\times\nL}$ and the parameter $\\gamma\\geq 0$, which is associated with the ease of\ncommunication between layers, represent a multiplex network with $N$ vertices\nand $L$ layers. To measure the ease of communication in a multiplex network, we\nfocus on the average inverse geodesic length, which we refer to as the\nmultiplex global efficiency $e_\\mathcal{A}(\\gamma)$ by means of the multiplex\npath length matrix $P\\in\\R^{N\\times N}$. This paper generalizes the approach\nproposed in \\cite{NR23} for single-layer networks. We describe an algorithm\nbased on min-plus matrix multiplication to construct $P$, as well as variants\n$P^K$ that only take into account multiplex paths made up of at most $K$\nintra-layer edges. These matrices are applied to detect redundant edges and to\ndetermine non-decreasing lower bounds $e_\\mathcal{A}^K(\\gamma)$ for\n$e_\\mathcal{A}(\\gamma)$, for $K=1,2,\\dots,N-2$.\n  Finally, the sensitivity of $e_\\mathcal{A}^K(\\gamma)$ to changes of the\nentries of the adjacency tensor $\\mathcal{A}$ is investigated to determine\nedges that should be strengthened to enhance the multiplex global efficiency\nthe most.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:52:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Noschese","Silvia",""],["Reichel","Lothar",""]]}
{"id":"2308.09599","submitter":"Sijia Chen","authors":"Sijia Chen, Baochun Li","title":"Language-Guided Diffusion Model for Visual Grounding","comments":"20 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual grounding (VG) tasks involve explicit cross-modal alignment, as\nsemantically corresponding image regions are to be located for the language\nphrases provided. Existing approaches complete such visual-text reasoning in a\nsingle-step manner. Their performance causes high demands on large-scale\nanchors and over-designed multi-modal fusion modules based on human priors,\nleading to complicated frameworks that may be difficult to train and overfit to\nspecific scenarios. Even worse, such once-for-all reasoning mechanisms are\nincapable of refining boxes continuously to enhance query-region matching. In\ncontrast, in this paper, we formulate an iterative reasoning process by\ndenoising diffusion modeling. Specifically, we propose a language-guided\ndiffusion framework for visual grounding, LG-DVG, which trains the model to\nprogressively reason queried object boxes by denoising a set of noisy boxes\nwith the language guide. To achieve this, LG-DVG gradually perturbs\nquery-aligned ground truth boxes to noisy ones and reverses this process step\nby step, conditional on query semantics. Extensive experiments for our proposed\nframework on five widely used datasets validate the superior performance of\nsolving visual grounding, a cross-modal alignment task, in a generative way.\nThe source codes are available at\n\\url{https://github.com/iQua/vgbase/tree/DiffusionVG}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:54:13 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Sijia",""],["Li","Baochun",""]]}
{"id":"2308.09600","submitter":"Ryo Ishizuka","authors":"Dimitri Dine and Ryo Ishizuka","title":"Tilting and untilting for ideals in perfectoid rings","comments":"19 pages, comments are 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":"  For an (integral) perfectoid ring $R$ of characteristic $0$ with tilt\n$R^{\\flat}$, we introduce and study a tilting map $(-)^{\\flat}$ from the set of\n$p$-adically closed ideals of $R$ to the set of ideals of $R^{\\flat}$ and an\nuntilting map $(-)^{\\sharp}$ from the set of radical ideals of $R^{\\flat}$ to\nthe set of ideals of $R$. The untilting map $(-)^{\\sharp}$ is defined purely\nalgebraically and generalizes the analytically defined untilting map on closed\nradical ideals of a perfectoid Tate ring of characteristic $p$ introduced by\nthe first author. We prove that these two maps, $(-)^{\\flat}$ and\n$(-)^{\\sharp}$, define an inclusion-preserving bijection between the set of\nideals $J$ of $R$ such that the quotient $R/J$ is perfectoid and the set of\n$p^{\\flat}$-adically closed radical ideals of $R^{\\flat}$, where $p^{\\flat}\\in\nR^{\\flat}$ corresponds to a compatible system of $p$-power roots of a unit\nmultiple of $p$ in $R$. Furthermore, we prove that the maps send (closed) prime\nideals to prime ideals and thus define a homeomorphism between the subspace of\nthe spectrum of $R$ consisting of prime ideals $\\mathfrak{p}$ of $R$ such that\n$R/\\mathfrak{p}$ is perfectoid and the subspace of the spectrum of $R^{\\flat}$\nconsisting of $p^{\\flat}$-adically closed prime ideals of $R^{\\flat}$. In\nparticular, we obtain a generalization and a new proof of the main result of\nthe first author's previous research which concerned prime ideals in perfectoid\nTate rings.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:54:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dine","Dimitri",""],["Ishizuka","Ryo",""]]}
{"id":"2308.09601","submitter":"Yuqian Lv","authors":"Yuqian Lv, Bo Zhou, Jinhuan Wang, Shanqing Yu, Qi Xuan","title":"MONA: An Efficient and Scalable Strategy for Targeted k-Nodes Collapse","comments":"5 pages, 6 figures, 1 table, 5 algorithms","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of k-core plays an important role in measuring the cohesiveness\nand engagement of a network. And recent studies have shown the vulnerability of\nk-core under adversarial attacks. However, there are few researchers\nconcentrating on the vulnerability of individual nodes within k-core.\nTherefore, in this paper, we attempt to study Targeted k-Nodes Collapse Problem\n(TNsCP), which focuses on removing a minimal size set of edges to make multiple\ntarget k-nodes collapse. For this purpose, we first propose a novel algorithm\nnamed MOD for candidate reduction. Then we introduce an efficient strategy\nnamed MONA, based on MOD, to address TNsCP. Extensive experiments validate the\neffectiveness and scalability of MONA compared to several baselines. An\nopen-source implementation is available at https://github.com/Yocenly/MONA.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:55:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lv","Yuqian",""],["Zhou","Bo",""],["Wang","Jinhuan",""],["Yu","Shanqing",""],["Xuan","Qi",""]]}
{"id":"2308.09602","submitter":"Matthew Scott Robinson","authors":"Matthew S. Robinson, Jochen K\\\"upper","title":"Unraveling the ultrafast dynamics of thermal-energy chemical reactions","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.atm-clus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this perspective, we discuss how one can initiate, image, and disentangle\nthe ultrafast elementary steps of thermal-energy chemical dynamics, building\nupon advances in technology and scientific insight. We propose that\ncombinations of ultrashort mid-infrared laser pulses, controlled molecular\nspecies in the gas phase, and forefront imaging techniques allow to unravel the\nelementary steps of general-chemistry reaction processes in real time. We\ndetail, for prototypical first reaction systems, experimental methods enabling\nthese investigations, how to sufficiently prepare and promote gas-phase samples\nto thermal-energy reactive states with contemporary ultrashort mid-infrared\nlaser systems, and how to image the initiated ultrafast chemical dynamics. The\nresults of such experiments will clearly further our understanding of\ngeneral-chemistry reaction dynamics.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:55:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Robinson","Matthew S.",""],["K\u00fcpper","Jochen",""]]}
{"id":"2308.09603","submitter":"Parikshit Pareek","authors":"Parikshit Pareek, L. P. Mohasha Isuru Sampath, Hung D. Nguyen, and\n  Eddy Y. S. Foo","title":"A Convergence Predictor Model for Consensus-based Decentralised Energy\n  Markets","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 letter introduces a convergence prediction model (CPM) for decentralized\nmarket clearing mechanisms. The CPM serves as a tool to detect potential\ncyber-attacks that affect the convergence of the consensus mechanism during\nongoing market clearing operations. In this study, we propose a successively\nelongating Bayesian logistic regression approach to model the probability of\nconvergence of real-time market mechanisms. The CPM utilizes net-power balance\namong all the prosumers/market participants as a feature for convergence\nprediction, enabling a low-dimensional model to operate efficiently for all the\nprosumers concurrently. The results highlight that the proposed CPM has\nachieved a net false rate of less than 0.01% for a stressed dataset.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:56:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pareek","Parikshit",""],["Sampath","L. P. Mohasha Isuru",""],["Nguyen","Hung D.",""],["Foo","Eddy Y. S.",""]]}
{"id":"2308.09604","submitter":"Xiaokang Pan","authors":"Jin Liu, Xiaokang Pan, Junwen Duan, Hongdong Li, Youqi Li, Zhe Qu","title":"Breaking the Complexity Barrier in Compositional Minimax Optimization","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":"  Compositional minimax optimization is a pivotal yet under-explored challenge\nacross machine learning, including distributionally robust training and policy\nevaluation for reinforcement learning. Current techniques exhibit suboptimal\ncomplexity or rely heavily on large batch sizes. This paper proposes Nested\nSTOchastic Recursive Momentum (NSTORM), attaining the optimal sample complexity\nof $O(\\kappa^3/\\epsilon^3)$ for finding an $\\epsilon$-accurate solution.\nHowever, NSTORM requires low learning rates, potentially limiting\napplicability. Thus we introduce ADAptive NSTORM (ADA-NSTORM) with adaptive\nlearning rates, proving it achieves the same sample complexity while\nexperiments demonstrate greater effectiveness. Our methods match lower bounds\nfor minimax optimization without large batch requirements, validated through\nextensive experiments. This work significantly advances compositional minimax\noptimization, a crucial capability for distributional robustness and policy\nevaluation\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:57:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Jin",""],["Pan","Xiaokang",""],["Duan","Junwen",""],["Li","Hongdong",""],["Li","Youqi",""],["Qu","Zhe",""]]}
{"id":"2308.09605","submitter":"Guanhang Lei","authors":"Guanhang Lei, Zhen Lei, Lei Shi, Chenyu Zeng, Ding-Xuan Zhou","title":"Solving PDEs on Spheres with Physics-Informed Convolutional Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.LG cs.NA math.ST stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physics-informed neural networks (PINNs) have been demonstrated to be\nefficient in solving partial differential equations (PDEs) from a variety of\nexperimental perspectives. Some recent studies have also proposed PINN\nalgorithms for PDEs on surfaces, including spheres. However, theoretical\nunderstanding of the numerical performance of PINNs, especially PINNs on\nsurfaces or manifolds, is still lacking. In this paper, we establish rigorous\nanalysis of the physics-informed convolutional neural network (PICNN) for\nsolving PDEs on the sphere. By using and improving the latest approximation\nresults of deep convolutional neural networks and spherical harmonic analysis,\nwe prove an upper bound for the approximation error with respect to the Sobolev\nnorm. Subsequently, we integrate this with innovative localization complexity\nanalysis to establish fast convergence rates for PICNN. Our theoretical results\nare also confirmed and supplemented by our experiments. In light of these\nfindings, we explore potential strategies for circumventing the curse of\ndimensionality that arises when solving high-dimensional PDEs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:58:23 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lei","Guanhang",""],["Lei","Zhen",""],["Shi","Lei",""],["Zeng","Chenyu",""],["Zhou","Ding-Xuan",""]]}
{"id":"2308.09606","submitter":"Marius Beceanu","authors":"Marius Beceanu, Michael Goldberg","title":"Spectral Multipliers II: Elliptic and Parabolic Operators and\n  Bochner-Riesz Means","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish estimates for the Poisson kernel, the heat kernel, and\nBochner--Riesz means defined in terms of $H=-\\Delta+V$, where $V$ is a possibly\nlarge rough real-valued scalar potential and $H$ can have negative eigenvalues.\nAll results are in three space dimensions.\n  We eliminate several unnecessary conditions on $V$, leaving just $V \\in\n\\mathcal K_0$, meaning that $V$ is locally integrable and $(-\\Delta)^{-1}|V|$\nis bounded.\n  For the spectral multiplier bounds, we assume that $H$ has no zero energy\nbound states. For $V$ in a more general class than $\\mathcal K_0$, we prove\nthat $H$ has at most a finite number of negative bound states and no positive\nbound states.\n  All our previous estimates from [BeGo1] and [BeGo2] and more than half of\nthose in [BeCh] and [BeGo3] are then valid for $V \\in \\mathcal K_0$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:01:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beceanu","Marius",""],["Goldberg","Michael",""]]}
{"id":"2308.09607","submitter":"Nikolas Korzoun","authors":"Nikolas Korzoun (1), Wystan Benbow (2), Aaron Brown (3), Gregory Foote\n  (1), William F. Hanlon (2), Olivier Hervet (4), John Hoang (4 and 5), Jamie\n  Holder (1), Paul Horowitz (6), Wei Liu (5 and 7), J\\'er\\^ome Maire (3),\n  Nicolas Rault-Wang (5 and 7), Dan Werthimer (5 and 7), James Wiley (3 and 8),\n  David A. Williams (4) and Shelley A. Wright (3 and 8)","title":"PeV Gamma-ray Astronomy With Panoramic Optical SETI Telescopes","comments":"8 pages, 5 figures, Proceedings for the 38th International Cosmic Ray\n  Conference (ICRC2023) in Nagoya Japan, Jul 26 - Aug 3, 2023","journal-ref":"PoS(ICRC2023)787","doi":"10.22323/1.444.0787","report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Panoramic Search for Extraterrestrial Intelligence (PANOSETI) experiment\nis designed to detect pulsed optical signals on nanosecond timescales. PANOSETI\nis therefore sensitive to Cherenkov radiation generated by extensive air\nshowers, and can be used for gamma-ray astronomy. Each PANOSETI telescope uses\na 0.5 m Fresnel lens to focus light onto a 1024 pixel silicon photomultiplier\ncamera that images a 9.9$^\\circ\\times$9.9$^\\circ$ square field of view. Recent\ndetections of PeV gamma-rays from extended sources in the Galactic Plane\nmotivate constructing an array with effective area and angular resolution\nsurpassing current observatories. The PANOSETI telescopes are much smaller and\nfar more affordable than traditional imaging atmospheric Cherenkov telescopes\n(IACT), making them ideal instruments to construct such an array. We present\nthe results of coincident observations between two PANOSETI telescopes and the\ngamma-ray observatory VERITAS, along with simulations characterizing the\nperformance of a PANOSETI IACT array.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:03:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Korzoun","Nikolas","","4 and 5"],["Benbow","Wystan","","4 and 5"],["Brown","Aaron","","4 and 5"],["Foote","Gregory","","4 and 5"],["Hanlon","William F.","","4 and 5"],["Hervet","Olivier","","4 and 5"],["Hoang","John","","4 and 5"],["Holder","Jamie","","5 and 7"],["Horowitz","Paul","","5 and 7"],["Liu","Wei","","5 and 7"],["Maire","J\u00e9r\u00f4me","","5 and 7"],["Rault-Wang","Nicolas","","5 and 7"],["Werthimer","Dan","","5 and 7"],["Wiley","James","","3 and 8"],["Williams","David A.","","3 and 8"],["Wright","Shelley A.","","3 and 8"]]}
{"id":"2308.09608","submitter":"Masoud Rafiei-Ravandi","authors":"Masoud Rafiei-Ravandi, Kendrick M. Smith, D. Michilli, Ziggy Pleunis,\n  Mohit Bhardwaj, Matt Dobbs, Gwendolyn M. Eadie, Emmanuel Fonseca, B. M.\n  Gaensler, Jane Kaczmarek, Victoria M. Kaspi, Calvin Leung, Dongzi Li, Kiyoshi\n  W. Masui, Ayush Pandhi, Aaron B. Pearlman, Mubdi Rahman, Paul Scholz, David\n  C. Stenning","title":"Statistical association between the candidate repeating FRB 20200320A\n  and a galaxy group","comments":"13 pages, 4 figures, 3 tables","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":"  We present results from angular cross-correlations between select samples of\nCHIME/FRB repeaters and galaxies in three photometric galaxy surveys, which\nhave shown correlations with the first CHIME/FRB catalog containing repeating\nand nonrepeating sources: WISE$\\times$SCOS, DESI-BGS, and DESI-LRG. We find a\nstatistically significant correlation ($p$-value $<0.001$, after accounting for\nlook-elsewhere factors) between a sample of repeaters with extragalactic DM\n$>395$ pc cm$^{-3}$ and WISE$\\times$SCOS galaxies with redshift $z>0.275$. We\ndemonstrate that the correlation arises surprisingly because of a statistical\nassociation between FRB 20200320A (extragalactic DM $\\approx550$ pc cm$^{-3}$)\nand a galaxy group in the same dark matter halo at redshift $z\\approx0.32$.\nBased on our results, we suggest incorporating galaxy group and cluster\ncatalogs into direct host association pipelines for FRBs with $\\lesssim1'$\nlocalization precision, effectively utilizing the two-point information to\nconstrain FRB properties such as their redshift. In addition, we find marginal\nevidence for a negative correlation at 99.4% CL between a sample of repeating\nFRBs with baseband data (median extragalactic DM $=354$ pc cm$^{-3}$) and\nDESI-LRG galaxies with redshift $0.3\\le z<0.45$, suggesting that the repeaters\nmight be more prone than apparent nonrepeaters to propagation effects due to\nintervening free electrons over angular scales $\\sim0\\mbox{$.\\!\\!^\\circ$}5$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:07:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rafiei-Ravandi","Masoud",""],["Smith","Kendrick M.",""],["Michilli","D.",""],["Pleunis","Ziggy",""],["Bhardwaj","Mohit",""],["Dobbs","Matt",""],["Eadie","Gwendolyn M.",""],["Fonseca","Emmanuel",""],["Gaensler","B. M.",""],["Kaczmarek","Jane",""],["Kaspi","Victoria M.",""],["Leung","Calvin",""],["Li","Dongzi",""],["Masui","Kiyoshi W.",""],["Pandhi","Ayush",""],["Pearlman","Aaron B.",""],["Rahman","Mubdi",""],["Scholz","Paul",""],["Stenning","David C.",""]]}
{"id":"2308.09609","submitter":"Changhui Tan","authors":"Yatao Li, Qianyun Miao, Changhui Tan, Liutang Xue","title":"Global well-posedness and refined regularity criterion for the\n  uni-directional Euler-alignment system","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate global solutions to the Euler-alignment system in $d$\ndimensions with unidirectional flows and strongly singular communication\nprotocols $\\phi(x) = |x|^{-(d+\\alpha)}$ for $\\alpha \\in (0,2)$. Our paper\nestablishes global regularity results in both the subcritical regime\n$1<\\alpha<2$ and the critical regime $\\alpha=1$. Notably, when $\\alpha=1$, the\nsystem exhibits a critical scaling similar to the critical quasi-geostrophic\nequation. To achieve global well-posedness, we employ a novel method based on\npropagating the modulus of continuity. Our approach introduces the concept of\nsimultaneously propagating multiple moduli of continuity, which allows us to\neffectively handle the system of two equations with critical scaling.\nAdditionally, we improve the regularity criteria for solutions to this system\nin the supercritical regime $0<\\alpha<1$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:10:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Yatao",""],["Miao","Qianyun",""],["Tan","Changhui",""],["Xue","Liutang",""]]}
{"id":"2308.09610","submitter":"Thomas De Min","authors":"Thomas De Min, Massimiliano Mancini, Karteek Alahari, Xavier\n  Alameda-Pineda, Elisa Ricci","title":"On the Effectiveness of LayerNorm Tuning for Continual Learning in\n  Vision Transformers","comments":"In The First Workshop on Visual Continual Learning (ICCVW 2023); Oral","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 rehearsal-free continual learning methods exploit the\npeculiarities of Vision Transformers to learn task-specific prompts,\ndrastically reducing catastrophic forgetting. However, there is a tradeoff\nbetween the number of learned parameters and the performance, making such\nmodels computationally expensive. In this work, we aim to reduce this cost\nwhile maintaining competitive performance. We achieve this by revisiting and\nextending a simple transfer learning idea: learning task-specific normalization\nlayers. Specifically, we tune the scale and bias parameters of LayerNorm for\neach continual learning task, selecting them at inference time based on the\nsimilarity between task-specific keys and the output of the pre-trained model.\nTo make the classifier robust to incorrect selection of parameters during\ninference, we introduce a two-stage training procedure, where we first optimize\nthe task-specific parameters and then train the classifier with the same\nselection procedure of the inference time. Experiments on ImageNet-R and\nCIFAR-100 show that our method achieves results that are either superior or on\npar with {the state of the art} while being computationally cheaper.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:11:16 GMT"}],"update_date":"2023-08-21","authors_parsed":[["De Min","Thomas",""],["Mancini","Massimiliano",""],["Alahari","Karteek",""],["Alameda-Pineda","Xavier",""],["Ricci","Elisa",""]]}
{"id":"2308.09611","submitter":"Yuanhao Zhai","authors":"Yuanhao Zhai, Mingzhen Huang, Tianyu Luan, Lu Dong, Ifeoma Nwogu,\n  Siwei Lyu, David Doermann, Junsong Yuan","title":"Language-guided Human Motion Synthesis with Atomic Actions","comments":"Accepted to ACM MM 2023, code: https://github.com/yhZhai/ATOM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Language-guided human motion synthesis has been a challenging task due to the\ninherent complexity and diversity of human behaviors. Previous methods face\nlimitations in generalization to novel actions, often resulting in unrealistic\nor incoherent motion sequences. In this paper, we propose ATOM (ATomic mOtion\nModeling) to mitigate this problem, by decomposing actions into atomic actions,\nand employing a curriculum learning strategy to learn atomic action\ncomposition. First, we disentangle complex human motions into a set of atomic\nactions during learning, and then assemble novel actions using the learned\natomic actions, which offers better adaptability to new actions. Moreover, we\nintroduce a curriculum learning training strategy that leverages masked motion\nmodeling with a gradual increase in the mask ratio, and thus facilitates atomic\naction assembly. This approach mitigates the overfitting problem commonly\nencountered in previous methods while enforcing the model to learn better\nmotion representations. We demonstrate the effectiveness of ATOM through\nextensive experiments, including text-to-motion and action-to-motion synthesis\ntasks. We further illustrate its superiority in synthesizing plausible and\ncoherent text-guided human motion sequences.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:13:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhai","Yuanhao",""],["Huang","Mingzhen",""],["Luan","Tianyu",""],["Dong","Lu",""],["Nwogu","Ifeoma",""],["Lyu","Siwei",""],["Doermann","David",""],["Yuan","Junsong",""]]}
{"id":"2308.09612","submitter":"Ping-Ju Chuang","authors":"Ping-Ju Chuang, Ali Saadat, Sara Ghazvini, Hal Edwards, William G.\n  Vandenberghe","title":"Constrained Bayesian Optimization Using a Lagrange Multiplier Applied to\n  Power Transistor Design","comments":"7 pages, 5 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":"  We propose a novel constrained Bayesian Optimization (BO) algorithm\noptimizing the design process of Laterally-Diffused Metal-Oxide-Semiconductor\n(LDMOS) transistors while realizing a target Breakdown Voltage (BV). We convert\nthe constrained BO problem into a conventional BO problem using a Lagrange\nmultiplier. Instead of directly optimizing the traditional Figure-of-Merit\n(FOM), we set the Lagrangian as the objective function of BO. This adaptive\nobjective function with a changeable Lagrange multiplier can address\nconstrained BO problems which have constraints that require costly evaluations,\nwithout the need for additional surrogate models to approximate constraints.\nOur algorithm enables a device designer to set the target BV in the design\nspace, and obtain a device that satisfies the optimized FOM and the target BV\nconstraint automatically. Utilizing this algorithm, we have also explored the\nphysical limits of the FOM for our devices in 30 - 50 V range within the\ndefined design space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:14:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chuang","Ping-Ju",""],["Saadat","Ali",""],["Ghazvini","Sara",""],["Edwards","Hal",""],["Vandenberghe","William G.",""]]}
{"id":"2308.09613","submitter":"Leo Suchan","authors":"Leo Suchan, Housen Li and Axel Munk","title":"A scalable clustering algorithm to approximate graph cuts","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to its computational complexity, graph cuts for cluster detection and\nidentification are used mostly in the form of convex relaxations. We propose to\nutilize the original graph cuts such as Ratio, Normalized or Cheeger Cut in\norder to detect clusters in weighted undirected graphs by restricting the graph\ncut minimization to the subset of $st$-MinCut partitions. Incorporating a\nvertex selection technique and restricting optimization to tightly connected\nclusters, we therefore combine the efficient computability of $st$-MinCuts and\nthe intrinsic properties of Gomory-Hu trees with the cut quality of the\noriginal graph cuts, leading to linear runtime in the number of vertices and\nquadratic in the number of edges. Already in simple scenarios, the resulting\nalgorithm Xist is able to approximate graph cut values better empirically than\nspectral clustering or comparable algorithms, even for large network datasets.\nWe showcase its applicability by segmenting images from cell biology and\nprovide empirical studies of runtime and classification rate.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:14:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Suchan","Leo",""],["Li","Housen",""],["Munk","Axel",""]]}
{"id":"2308.09614","submitter":"Sam Mundy","authors":"Sam Mundy","title":"On the Bernstein-Zelevinsky classification and epsilon factors in\n  families","comments":"38 pages. Supersedes and contains the main content of\n  arXiv:2207.05629","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define a certain Hecke theoretic notion of family of smooth admissible\nrepresentations of $GL_n(F)$, or of products of such groups, where $F$ is a\nnonarchimedean local field of characteristic zero. While this notion of family\nis rather weak a priori, we show that it implies strong rigidity properties for\nthe Bernstein-Zelevinsky presentations of the members of such families, as well\nas for the variation of their epsilon factors. Examples of such families come\noften from the theory of eigenvarieties, and in this case our results imply\nanalyticity properties for the epsilon factors of the members of these\nfamilies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:16:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mundy","Sam",""]]}
{"id":"2308.09615","submitter":"Luca Ciotti","authors":"Luca Ciotti (University of Bologna, Italy)","title":"The face-on projection of the Miyamoto & Nagai disks","comments":"MNRAS accepted, 8 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The face-on projected density profile of the Miyamoto & Nagai disks of\narbitrary flattening is obtained analytically in terms of incomplete elliptic\nintegrals of first and second type, by using two complementary approaches, and\nthen checked against the results of numerical integration. As computer algebra\nsystems do not seem able to obtain the resulting formula in any straightforward\nway, the relevant mathematical steps are provided. During this study, three\nwrong identities in the Byrd & Friedman tables of elliptic integrals have been\nidentified, and their correct expression is given.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:16:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ciotti","Luca","","University of Bologna, Italy"]]}
{"id":"2308.09616","submitter":"Shuailin Li","authors":"Xiaohui Jiang, Shuailin Li, Yingfei Liu, Shihao Wang, Fan Jia, Tiancai\n  Wang, Lijin Han, Xiangyu Zhang","title":"Far3D: Expanding the Horizon for Surround-view 3D Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently 3D object detection from surround-view images has made notable\nadvancements with its low deployment cost. However, most works have primarily\nfocused on close perception range while leaving long-range detection less\nexplored. Expanding existing methods directly to cover long distances poses\nchallenges such as heavy computation costs and unstable convergence. To address\nthese limitations, this paper proposes a novel sparse query-based framework,\ndubbed Far3D. By utilizing high-quality 2D object priors, we generate 3D\nadaptive queries that complement the 3D global queries. To efficiently capture\ndiscriminative features across different views and scales for long-range\nobjects, we introduce a perspective-aware aggregation module. Additionally, we\npropose a range-modulated 3D denoising approach to address query error\npropagation and mitigate convergence issues in long-range tasks. Significantly,\nFar3D demonstrates SoTA performance on the challenging Argoverse 2 dataset,\ncovering a wide range of 150 meters, surpassing several LiDAR-based approaches.\nMeanwhile, Far3D exhibits superior performance compared to previous methods on\nthe nuScenes dataset. The code will be available soon.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:19:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jiang","Xiaohui",""],["Li","Shuailin",""],["Liu","Yingfei",""],["Wang","Shihao",""],["Jia","Fan",""],["Wang","Tiancai",""],["Han","Lijin",""],["Zhang","Xiangyu",""]]}
{"id":"2308.09617","submitter":"Ben Hord","authors":"Benjamin J. Hord, Eliza M.-R. Kempton, Thomas Mikal-Evans, David W.\n  Latham, David R. Ciardi, Diana Dragomir, Knicole D. Col\\'on, Gabrielle Ross,\n  Andrew Vanderburg, Zoe L. de Beurs, Karen A. Collins, Cristilyn N. Watkins,\n  Jacob Bean, Nicolas B. Cowan, Tansu Daylan, Caroline V. Morley, Jegug Ih,\n  David Baker, Khalid Barkaoui, Natalie M. Batalha, Aida Behmard, Alexander\n  Belinski, Zouhair Benkhaldoun, Paul Benni, Krzysztof Bernacki, Allyson\n  Bieryla, Avraham Binnenfeld, Pau Bosch-Cabot, Fran\\c{c}ois Bouchy, Valerio\n  Bozza, Rafael Brahm, Lars A. Buchhave, Michael Calkins, Ashley Chontos,\n  Catherine A. Clark, Ryan Cloutier, Marion Cointepas, Kevin I. Collins, Dennis\n  M. Conti, Ian J. M. Crossfield, Fei Dai, Jerome P. de Leon, Georgina\n  Dransfield, Courtney Dressing, Adam Dustor, Gilbert Esquerdo, Phil Evans,\n  Sergio B. Fajardo-Acosta, Jerzy Fio{\\l}ka, Raquel For\\'es-Toribio, Antonio\n  Frasca, Akihiko Fukui, Benjamin Fulton, Elise Furlan, Tianjun Gan, Davide\n  Gandolfi, Mourad Ghachoui, Steven Giacalone, Emily A. Gilbert, Micha\\\"el\n  Gillon, Eric Girardin, Erica Gonzales, Ferran Grau Horta, Joao Gregorio,\n  Michael Greklek-McKeon, Pere Guerra, J. D. Hartman, Coel Hellier, Krzysztof\n  G. He{\\l}miniak, Thomas Henning, Michelle L. Hill, Keith Horne, Andrew W.\n  Howard, Steve B. Howell, Daniel Huber, Howard Isaacson, Giovanni Isopi,\n  Emmanuel Jehin, Jon M. Jenkins, Eric L. N. Jensen, Marshall C. Johnson,\n  Andr\\'es Jord\\'an, Stephen R. Kane, John F. Kielkopf, Vadim Krushinsky,\n  S{\\l}awomir Lasota, Elena Lee, Pablo Lewin, John H. Livingston, Jack Lubin,\n  Michael B. Lund, Franco Mallia, Christopher R. Mann, Giuseppe Marino,\n  Nataliia Maslennikova, Bob Massey, Rachel Matson, Elisabeth Matthews, Andrew\n  W. Mayo, Tsevi Mazeh, Kim K. McLeod, Edward J. Michaels, Teo Mo\\v{c}nik,\n  Mayuko Mori, Georgia Mraz, Jose A. Mu\\~noz, Norio Narita, Louise Dyregaard\n  Nielsen, Hugh Osborn, Enric Palle, Aviad Panahi, Riccardo Papini, Alex S.\n  Polanski, Adam Popowicz, Francisco J. Pozuelos, Samuel N. Quinn, Don J.\n  Radford, Phillip A. Reed, Howard M. Relles, Malena Rice, Paul Robertson,\n  Joseph E. Rodriguez, Lee J. Rosenthal, Ryan A. Rubenzahl, Nicole Schanche,\n  Joshua Schlieder, Richard P. Schwarz, Ramotholo Sefako, Avi Shporer,\n  Alessandro Sozzetti, Gregor Srdoc, Chris Stockdale, Alexander Tarasenkov,\n  Thiam-Guan Tan, Mathilde Timmermans, Eric B. Ting, Judah Van Zandt, JP\n  Vignes, Ian Waite, Noriharu Watanabe, Lauren M. Weiss, Justin Wittrock,\n  George Zhou, Carl Ziegler, and Shay Zucker","title":"Identification of the Top TESS Objects of Interest for Atmospheric\n  Characterization of Transiting Exoplanets with JWST","comments":"Submitted to AJ. Machine-readable versions of Tables 2 and 3 are\n  included. 40 pages, 7 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  JWST has ushered in an era of unprecedented ability to characterize\nexoplanetary atmospheres. While there are over 5,000 confirmed planets, more\nthan 4,000 TESS planet candidates are still unconfirmed and many of the best\nplanets for atmospheric characterization may remain to be identified. We\npresent a sample of TESS planets and planet candidates that we identify as\n\"best-in-class\" for transmission and emission spectroscopy with JWST. These\ntargets are sorted into bins across equilibrium temperature $T_{\\mathrm{eq}}$\nand planetary radius $R{_\\mathrm{p}}$ and are ranked by transmission and\nemission spectroscopy metric (TSM and ESM, respectively) within each bin. In\nforming our target sample, we perform cuts for expected signal size and stellar\nbrightness, to remove sub-optimal targets for JWST. Of the 194 targets in the\nresulting sample, 103 are unconfirmed TESS planet candidates, also known as\nTESS Objects of Interest (TOIs). We perform vetting and statistical validation\nanalyses on these 103 targets to determine which are likely planets and which\nare likely false positives, incorporating ground-based follow-up from the TESS\nFollow-up Observation Program (TFOP) to aid the vetting and validation process.\nWe statistically validate 23 TOIs, marginally validate 33 TOIs to varying\nlevels of confidence, deem 29 TOIs likely false positives, and leave the\ndispositions for 4 TOIs as inconclusive. 14 of the 103 TOIs were confirmed\nindependently over the course of our analysis. We provide our final\nbest-in-class sample as a community resource for future JWST proposals and\nobservations. We intend for this work to motivate formal confirmation and mass\nmeasurements of each validated planet and encourage more detailed analysis of\nindividual targets by the community.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:20:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hord","Benjamin J.",""],["Kempton","Eliza M. -R.",""],["Mikal-Evans","Thomas",""],["Latham","David W.",""],["Ciardi","David R.",""],["Dragomir","Diana",""],["Col\u00f3n","Knicole D.",""],["Ross","Gabrielle",""],["Vanderburg","Andrew",""],["de Beurs","Zoe L.",""],["Collins","Karen A.",""],["Watkins","Cristilyn N.",""],["Bean","Jacob",""],["Cowan","Nicolas B.",""],["Daylan","Tansu",""],["Morley","Caroline V.",""],["Ih","Jegug",""],["Baker","David",""],["Barkaoui","Khalid",""],["Batalha","Natalie M.",""],["Behmard","Aida",""],["Belinski","Alexander",""],["Benkhaldoun","Zouhair",""],["Benni","Paul",""],["Bernacki","Krzysztof",""],["Bieryla","Allyson",""],["Binnenfeld","Avraham",""],["Bosch-Cabot","Pau",""],["Bouchy","Fran\u00e7ois",""],["Bozza","Valerio",""],["Brahm","Rafael",""],["Buchhave","Lars A.",""],["Calkins","Michael",""],["Chontos","Ashley",""],["Clark","Catherine A.",""],["Cloutier","Ryan",""],["Cointepas","Marion",""],["Collins","Kevin I.",""],["Conti","Dennis M.",""],["Crossfield","Ian J. M.",""],["Dai","Fei",""],["de Leon","Jerome P.",""],["Dransfield","Georgina",""],["Dressing","Courtney",""],["Dustor","Adam",""],["Esquerdo","Gilbert",""],["Evans","Phil",""],["Fajardo-Acosta","Sergio B.",""],["Fio\u0142ka","Jerzy",""],["For\u00e9s-Toribio","Raquel",""],["Frasca","Antonio",""],["Fukui","Akihiko",""],["Fulton","Benjamin",""],["Furlan","Elise",""],["Gan","Tianjun",""],["Gandolfi","Davide",""],["Ghachoui","Mourad",""],["Giacalone","Steven",""],["Gilbert","Emily A.",""],["Gillon","Micha\u00ebl",""],["Girardin","Eric",""],["Gonzales","Erica",""],["Horta","Ferran Grau",""],["Gregorio","Joao",""],["Greklek-McKeon","Michael",""],["Guerra","Pere",""],["Hartman","J. D.",""],["Hellier","Coel",""],["He\u0142miniak","Krzysztof G.",""],["Henning","Thomas",""],["Hill","Michelle L.",""],["Horne","Keith",""],["Howard","Andrew W.",""],["Howell","Steve B.",""],["Huber","Daniel",""],["Isaacson","Howard",""],["Isopi","Giovanni",""],["Jehin","Emmanuel",""],["Jenkins","Jon M.",""],["Jensen","Eric L. N.",""],["Johnson","Marshall C.",""],["Jord\u00e1n","Andr\u00e9s",""],["Kane","Stephen R.",""],["Kielkopf","John F.",""],["Krushinsky","Vadim",""],["Lasota","S\u0142awomir",""],["Lee","Elena",""],["Lewin","Pablo",""],["Livingston","John H.",""],["Lubin","Jack",""],["Lund","Michael B.",""],["Mallia","Franco",""],["Mann","Christopher R.",""],["Marino","Giuseppe",""],["Maslennikova","Nataliia",""],["Massey","Bob",""],["Matson","Rachel",""],["Matthews","Elisabeth",""],["Mayo","Andrew W.",""],["Mazeh","Tsevi",""],["McLeod","Kim K.",""],["Michaels","Edward J.",""],["Mo\u010dnik","Teo",""],["Mori","Mayuko",""],["Mraz","Georgia",""],["Mu\u00f1oz","Jose A.",""],["Narita","Norio",""],["Nielsen","Louise Dyregaard",""],["Osborn","Hugh",""],["Palle","Enric",""],["Panahi","Aviad",""],["Papini","Riccardo",""],["Polanski","Alex S.",""],["Popowicz","Adam",""],["Pozuelos","Francisco J.",""],["Quinn","Samuel N.",""],["Radford","Don J.",""],["Reed","Phillip A.",""],["Relles","Howard M.",""],["Rice","Malena",""],["Robertson","Paul",""],["Rodriguez","Joseph E.",""],["Rosenthal","Lee J.",""],["Rubenzahl","Ryan A.",""],["Schanche","Nicole",""],["Schlieder","Joshua",""],["Schwarz","Richard P.",""],["Sefako","Ramotholo",""],["Shporer","Avi",""],["Sozzetti","Alessandro",""],["Srdoc","Gregor",""],["Stockdale","Chris",""],["Tarasenkov","Alexander",""],["Tan","Thiam-Guan",""],["Timmermans","Mathilde",""],["Ting","Eric B.",""],["Van Zandt","Judah",""],["Vignes","JP",""],["Waite","Ian",""],["Watanabe","Noriharu",""],["Weiss","Lauren M.",""],["Wittrock","Justin",""],["Zhou","George",""],["Ziegler","Carl",""],["Zucker","Shay",""]]}
{"id":"2308.09618","submitter":"Lojze \\v{Z}ust","authors":"Lojze \\v{Z}ust, Janez Per\\v{s}, Matej Kristan","title":"LaRS: A Diverse Panoptic Maritime Obstacle Detection Dataset and\n  Benchmark","comments":"ICCV 2023, 9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The progress in maritime obstacle detection is hindered by the lack of a\ndiverse dataset that adequately captures the complexity of general maritime\nenvironments. We present the first maritime panoptic obstacle detection\nbenchmark LaRS, featuring scenes from Lakes, Rivers and Seas. Our major\ncontribution is the new dataset, which boasts the largest diversity in\nrecording locations, scene types, obstacle classes, and acquisition conditions\namong the related datasets. LaRS is composed of over 4000 per-pixel labeled key\nframes with nine preceding frames to allow utilization of the temporal texture,\namounting to over 40k frames. Each key frame is annotated with 8 thing, 3 stuff\nclasses and 19 global scene attributes. We report the results of 27 semantic\nand panoptic segmentation methods, along with several performance insights and\nfuture research directions. To enable objective evaluation, we have implemented\nan online evaluation server. The LaRS dataset, evaluation toolkit and benchmark\nare publicly available at: https://lojzezust.github.io/lars-dataset\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:21:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["\u017dust","Lojze",""],["Per\u0161","Janez",""],["Kristan","Matej",""]]}
{"id":"2308.09619","submitter":"Jean-Luc Boulnois","authors":"Jean-Luc Boulnois","title":"On the Leibnitz Rule for Differentiating Under the Integral Sign","comments":"8 pages (in PDF)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This Note revisits the Leibnitz integral calculus method based on\ndifferentiation under the integral sign with respect to a parameter either\nalready existing or introduced ad hoc. Through several cases exemplifying the\nmethod, it is shown that this approach, applicable to regular and, under\ncertain conditions, to improper integrals as well, results in a 1st order\ndifferential equation whose solution is usually straightforward.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 21:05:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Boulnois","Jean-Luc",""]]}
{"id":"2308.09620","submitter":"Daniel Gomez","authors":"Daniel Gomez and Juncheng Wei","title":"Existence and Stability of a Boundary Layer with an Interior Spike in\n  the Singularly Perturbed Shadow Gierer-Meinhardt System","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The singularly perturbed Gierer-Meinhardt (GM) system in a bounded\n$d$-dimensional domain ($d\\geq 2$) is known to exhibit boundary layer (BL)\nsolutions for a non-zero activator flux. It was previously shown that such BL\nsolutions can be destabilized by decreasing the activator flux below a\nstability threshold. Moreover, numerical simulations previously indicated that\nsolutions consisting of a boundary layer and interior spike emerge after the\ndestabilization of a BL solution. In this paper we use the method of matched\nasymptotic expansions to investigate the structure and stability of such\n\"boundary layer spike\" (BLS) solutions in the presence of an asymptotically\nsmall activator diffusivity $\\varepsilon^2\\ll 1$. We find that two types of BLS\nsolutions, one of which is unconditionally linearly stable and the other\nunstable, can be constructed provided that the activator flux is sufficiently\nsmall. In this way we determine that there is an asymptotically large range of\nactivator flux values for which both the BL solution and one of the BLS\nsolutions are linearly stable. Formal asymptotic calculations are further\nvalidated by numerically simulating the singularly perturbed GM system.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:23:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gomez","Daniel",""],["Wei","Juncheng",""]]}
{"id":"2308.09621","submitter":"Dmitry Filippov","authors":"Dmitry Filippov","title":"Canonicity and Computability in Homotopy Type Theory","comments":"Dissertation submitted in partial fulfillment of a requirement for\n  the degree of Master in Mathematics and Computer Science at University of\n  Oxford","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This dissertation gives an overview of Martin Lof's dependant type theory,\nfocusing on its computational content and addressing a question of possibility\nof fully canonical and computable semantic presentation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:23:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Filippov","Dmitry",""]]}
{"id":"2308.09622","submitter":"Ozge Mercanoglu Sincan","authors":"Ozge Mercanoglu Sincan, Necati Cihan Camgoz, Richard Bowden","title":"Is context all you need? Scaling Neural Sign Language Translation to\n  Large Domains of Discourse","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Sign Language Translation (SLT) is a challenging task that aims to generate\nspoken language sentences from sign language videos, both of which have\ndifferent grammar and word/gloss order. From a Neural Machine Translation (NMT)\nperspective, the straightforward way of training translation models is to use\nsign language phrase-spoken language sentence pairs. However, human\ninterpreters heavily rely on the context to understand the conveyed\ninformation, especially for sign language interpretation, where the vocabulary\nsize may be significantly smaller than their spoken language equivalent.\n  Taking direct inspiration from how humans translate, we propose a novel\nmulti-modal transformer architecture that tackles the translation task in a\ncontext-aware manner, as a human would. We use the context from previous\nsequences and confident predictions to disambiguate weaker visual cues. To\nachieve this we use complementary transformer encoders, namely: (1) A Video\nEncoder, that captures the low-level video features at the frame-level, (2) A\nSpotting Encoder, that models the recognized sign glosses in the video, and (3)\nA Context Encoder, which captures the context of the preceding sign sequences.\nWe combine the information coming from these encoders in a final transformer\ndecoder to generate spoken language translations.\n  We evaluate our approach on the recently published large-scale BOBSL dataset,\nwhich contains ~1.2M sequences, and on the SRF dataset, which was part of the\nWMT-SLT 2022 challenge. We report significant improvements on state-of-the-art\ntranslation performance using contextual information, nearly doubling the\nreported BLEU-4 scores of baseline approaches.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:27:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sincan","Ozge Mercanoglu",""],["Camgoz","Necati Cihan",""],["Bowden","Richard",""]]}
{"id":"2308.09623","submitter":"Hasmik Poghosyan Mrs","authors":"Hasmik Poghosyan and Rubik Poghossian","title":"A note on rank 5/2 Liouville irregular block, Painlev\\'e 1 and the\n  ${\\cal H}_0$ Argyres-Douglas theory","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study 4d type ${\\cal H}_0$ Argyres-Douglas theory in $\\Omega$-background\nby constructing Liouville irregular state of rank 5/2. The results are compared\nwith generalized Holomorphic anomaly approach, which provides order by order\nexpansion in $\\Omega$-background parameters $\\epsilon_{1,2}$. Another crucial\ntest of our results provides comparison with respect to Painlev\\'{e} 1\n$\\tau$-function, which was expected to be hold in self-dual case\n$\\epsilon_1=-\\epsilon_2$. We also discuss Nekrasov-Shatashvili limit\n$\\epsilon_1=0$, accessible either by means of deformed Seiberg-Witten curve, or\nWKB methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:29:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Poghosyan","Hasmik",""],["Poghossian","Rubik",""]]}
{"id":"2308.09624","submitter":"Xiaohan Zhang","authors":"Xiaohan Zhang, Xingyu Li, Waqas Sultani, Chen Chen, and Safwan Wshah","title":"GeoDTR+: Toward generic cross-view geolocalization via geometric\n  disentanglement","comments":"arXiv admin note: text overlap with arXiv:2212.04074","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-View Geo-Localization (CVGL) estimates the location of a ground image\nby matching it to a geo-tagged aerial image in a database. Recent works achieve\noutstanding progress on CVGL benchmarks. However, existing methods still suffer\nfrom poor performance in cross-area evaluation, in which the training and\ntesting data are captured from completely distinct areas. We attribute this\ndeficiency to the lack of ability to extract the geometric layout of visual\nfeatures and models' overfitting to low-level details. Our preliminary work\nintroduced a Geometric Layout Extractor (GLE) to capture the geometric layout\nfrom input features. However, the previous GLE does not fully exploit\ninformation in the input feature. In this work, we propose GeoDTR+ with an\nenhanced GLE module that better models the correlations among visual features.\nTo fully explore the LS techniques from our preliminary work, we further\npropose Contrastive Hard Samples Generation (CHSG) to facilitate model\ntraining. Extensive experiments show that GeoDTR+ achieves state-of-the-art\n(SOTA) results in cross-area evaluation on CVUSA, CVACT, and VIGOR by a large\nmargin ($16.44\\%$, $22.71\\%$, and $17.02\\%$ without polar transformation) while\nkeeping the same-area performance comparable to existing SOTA. Moreover, we\nprovide detailed analyses of GeoDTR+.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:32:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Xiaohan",""],["Li","Xingyu",""],["Sultani","Waqas",""],["Chen","Chen",""],["Wshah","Safwan",""]]}
{"id":"2308.09625","submitter":"Aline Goeminne","authors":"Thomas Brihaye and Aline Goeminne","title":"Multi-Weighted Reachability Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study two-player multi-weighted reachability games played on a finite\ndirected graph, where an agent, called P1, has several quantitative\nreachability objectives that he wants to optimize against an antagonistic\nenvironment, called P2. In this setting, we ask what cost profiles P1 can\nensure regardless of the opponent's behavior. Cost profiles are compared thanks\nto: (i) a lexicographic order that ensures the unicity of an upper value and\n(ii) a componentwise order for which we consider the Pareto frontier. We\nsynthesize (i) lexico-optimal strategies and (ii) Pareto-optimal strategies.\nThe strategies are obtained thanks to a fixpoint algorithm which also computes\nthe upper value in polynomial time and the Pareto frontier in exponential time.\nFinally, the constrained existence problem is proved in P for the lexicographic\norder and PSPACE-complete for the componentwise order.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:36:59 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brihaye","Thomas",""],["Goeminne","Aline",""]]}
{"id":"2308.09626","submitter":"Po Chih Hsu","authors":"Po Chih Hsu, Jun Yi Koay, Satoki Matsushita, Chorng-Yuan Hwang,\n  Talvikki Hovatta, Sebastian Kiehlmann, Anthony Readhead, Walter Max-Moerbeck\n  and Rodrigo Reeves","title":"Milliarcsecond Core Size Dependence of the Radio Variability of Blazars","comments":"17 pages, 12 figures","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":"  Studying the long-term radio variability (timescales of months to years) of\nblazars enables us to gain a better understanding of the physical structure of\nthese objects on sub-parsec scales, and the physics of super massive black\nholes. In this study, we focus on the radio variability of 1157 blazars\nobserved at 15 GHz through the Owens Valley Radio Observatory (OVRO) Blazar\nMonitoring Program. We investigate the dependence of the variability amplitudes\nand timescales, characterized based on model fitting to the structure\nfunctions, on the milliarcsecond core sizes measured by Very Long Baseline\nInterferometry. We find that the most compact sources at milliarcsecond scales\nexhibit larger variability amplitudes and shorter variability timescales than\nmore extended sources. Additionally, for sources with measured redshifts and\nDoppler boosting factors, the correlation between linear core sizes against\nvariability amplitudes and intrinsic timescales are also significant. The\nobserved relationship between variability timescales and core sizes is\nexpected, based on light travel-time arguments. This variability vs core size\nrelation extends beyond the core sizes measured at 15 GHz; we see significant\ncorrelation between the 15 GHz variability amplitudes (as well as timescales)\nand core sizes measured at other frequencies, which can be attributed to a\nfrequency-source size relationship arising from the intrinsic jet structure. At\nlow frequencies of 1 GHz where the core sizes are dominated by interstellar\nscattering, we find that the variability amplitudes have significant\ncorrelation with the 1 GHz intrinsic core angular sizes, once the scatter\nbroadening effects are deconvoluted from the intrinsic core sizes.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:39:31 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 02:17:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hsu","Po Chih",""],["Koay","Jun Yi",""],["Matsushita","Satoki",""],["Hwang","Chorng-Yuan",""],["Hovatta","Talvikki",""],["Kiehlmann","Sebastian",""],["Readhead","Anthony",""],["Max-Moerbeck","Walter",""],["Reeves","Rodrigo",""]]}
{"id":"2308.09627","submitter":"Timothy Hosgood","authors":"Timothy Hosgood and Mahmoud Zeinalian","title":"Simplicial presheaves of Green complexes and twisting cochains","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 construct three simplicial presheaves on the site of ringed spaces, and in\nparticular on that of complex manifolds. The descent objects for these\nsimplicial presheaves yield Toledo--Tong's twisting cochains, simplicial\ntwisting cochains, and complexes that appear in Green's thesis on Chern classes\nfor coherent analytic sheaves, respectively. We thus extend the aforementioned\nconstructions to the equivariant setting, and more generally to stacks. This is\nthe first step in achieving push-forwards in K-theory and Riemann--Roch\ntheorems for appropriate stacks, as was achieved by Toledo and Tong for\narbitrary complex manifolds, and further pursued by O'Brian and Green.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:41:17 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hosgood","Timothy",""],["Zeinalian","Mahmoud",""]]}
{"id":"2308.09628","submitter":"Pavel Utkin","authors":"Pavel Utkin, Petr Chuprov","title":"Numerical Simulation of Shock Wave Propagation Over a Dense Particle\n  Layer Using the Baer-Nunziato Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The present study examines the possibility of numerical simulation of a\nstrong shock wave propagating over the surface of a dense layer of particles\npoured onto an impermeable wall using the Baer-Nunizato two-phase flow model.\nThe setting of the problem follows the full-scale experiment. The mathematical\nmodel is based on a two-dimensional system of Baer-Nunziato equations and takes\ninto account intergranular stresses arising in the solid phase of particles.\nThe computational algorithm is based on the HLLC method with a pressure\nrelaxation procedure. The developed algorithm proved to be efficient for\ntwo-phase problems with explicit interfacial boundaries and strong shock waves.\nThese issues are typical of problems arising from the interaction of a shock\nwave with a bed or a layer of particles. A comparison with the simulations and\nfull-scale experiments of other authors is carried out. A reasonable agreement\nwith the experiment is obtained for the angles of the transmitted compaction\nwave and granular contact, including their dependency on the intensity of the\npropagating shock wave. The granular contact angle increases with the incident\nshock wave Mach number, while the transmitted compaction wave angle decreases.\nThe explanation of the phenomenon of the decrease in thickness of the compacted\nregion in the layer with the increase in intensity of the propagating shock\nwave is given. The main reason is that the maximal value of the particle volume\nfraction in the plug of compacted particles in the layer rises with the\nincrease in shock wave intensity.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:41:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Utkin","Pavel",""],["Chuprov","Petr",""]]}
{"id":"2308.09629","submitter":"Anthony Kobanda","authors":"Anthony Kobanda, Valliappan C.A., Joshua Romoff, Ludovic Denoyer","title":"Learning Computational Efficient Bots with Costly Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep reinforcement learning (DRL) techniques have become increasingly used in\nvarious fields for decision-making processes. However, a challenge that often\narises is the trade-off between both the computational efficiency of the\ndecision-making process and the ability of the learned agent to solve a\nparticular task. This is particularly critical in real-time settings such as\nvideo games where the agent needs to take relevant decisions at a very high\nfrequency, with a very limited inference time.\n  In this work, we propose a generic offline learning approach where the\ncomputation cost of the input features is taken into account. We derive the\nBudgeted Decision Transformer as an extension of the Decision Transformer that\nincorporates cost constraints to limit its cost at inference. As a result, the\nmodel can dynamically choose the best input features at each timestep. We\ndemonstrate the effectiveness of our method on several tasks, including D4RL\nbenchmarks and complex 3D environments similar to those found in video games,\nand show that it can achieve similar performance while using significantly\nfewer computational resources compared to classical approaches.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:43:31 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kobanda","Anthony",""],["A.","Valliappan C.",""],["Romoff","Joshua",""],["Denoyer","Ludovic",""]]}
{"id":"2308.09630","submitter":"Lord Dover","authors":"L. Dover, S. C. Lowry, A. Ro\\.zek, B. Rozitis, S. L. Jackson, T.\n  Zegmott, Yu. N. Krugly, I. N. Belskaya, A. Fitzsimmons, S. F. Green, C.\n  Snodgrass, P. R. Weissman, M. Brozovi\\'c, L. A. M. Benner, M. W. Busch, V. R.\n  Ayvazian, V. Chiorny, R. Ya. Inasaridze, M. Krugov, S. Mykhailova, I. Reva,\n  and J. Hibbert","title":"Physical modelling of near-Earth asteroid (23187) 2000 PN9 with\n  ground-based optical and radar observations","comments":"Accepted for publication in Monthly Notices of the Royal Astronomical\n  Society. Main paper: 15 pages, 12 figures. Appendix: 9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a physical model and spin-state analysis of the potentially\nhazardous asteroid (23187) 2000 PN9. As part of a long-term campaign to make\ndirect detections of the YORP effect, we collected optical lightcurves of the\nasteroid between 2006 and 2020. These observations were combined with planetary\nradar data to develop a detailed shape model which was used to search for YORP\nacceleration. We report that 2000 PN9 is a relatively large top-shaped body\nwith a sidereal rotation period of 2.53216$\\pm$0.00015 h. Although we find no\nevidence for rotational acceleration, YORP torques smaller than\n$\\sim$10$^{-8}$$\\,\\rm rad/day^{2}$ cannot be ruled out. It is likely that 2000\nPN9 is a YORP-evolved object, and may be an example of YORP equilibrium or self\nlimitation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:43:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dover","L.",""],["Lowry","S. C.",""],["Ro\u017cek","A.",""],["Rozitis","B.",""],["Jackson","S. L.",""],["Zegmott","T.",""],["Krugly","Yu. N.",""],["Belskaya","I. N.",""],["Fitzsimmons","A.",""],["Green","S. F.",""],["Snodgrass","C.",""],["Weissman","P. R.",""],["Brozovi\u0107","M.",""],["Benner","L. A. M.",""],["Busch","M. W.",""],["Ayvazian","V. R.",""],["Chiorny","V.",""],["Inasaridze","R. Ya.",""],["Krugov","M.",""],["Mykhailova","S.",""],["Reva","I.",""],["Hibbert","J.",""]]}
{"id":"2308.09631","submitter":"Giulio Sanzeni","authors":"Giulio Sanzeni","title":"Non existence of closed null geodesics in Kerr spacetimes","comments":"26 pages, 17 figures. Corrections: typo at p. 14 and explicit\n  non-vanishing Christoffel symbol in Prop. 5.6","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Kerr-star spacetime is the extension over the horizons and in the\nnegative radial region of the slowly rotating Kerr black hole. It is known that\nbelow the inner horizon, there exist both timelike and null (lightlike) closed\ncurves. Nevertheless, we prove that the null geodesics cannot be closed in the\nKerr-star spacetime.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:43:58 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 12:04:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sanzeni","Giulio",""]]}
{"id":"2308.09632","submitter":"Korbinian Hagn","authors":"Oliver Grau and Korbinian Hagn","title":"VALERIE22 -- A photorealistic, richly metadata annotated dataset of\n  urban environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The VALERIE tool pipeline is a synthetic data generator developed with the\ngoal to contribute to the understanding of domain-specific factors that\ninfluence perception performance of DNNs (deep neural networks). This work was\ncarried out under the German research project KI Absicherung in order to\ndevelop a methodology for the validation of DNNs in the context of pedestrian\ndetection in urban environments for automated driving. The VALERIE22 dataset\nwas generated with the VALERIE procedural tools pipeline providing a\nphotorealistic sensor simulation rendered from automatically synthesized\nscenes. The dataset provides a uniquely rich set of metadata, allowing\nextraction of specific scene and semantic features (like pixel-accurate\nocclusion rates, positions in the scene and distance + angle to the camera).\nThis enables a multitude of possible tests on the data and we hope to stimulate\nresearch on understanding performance of DNNs. Based on performance metric a\ncomparison with several other publicly available datasets is provided,\ndemonstrating that VALERIE22 is one of best performing synthetic datasets\ncurrently available in the open domain.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:44:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Grau","Oliver",""],["Hagn","Korbinian",""]]}
{"id":"2308.09633","submitter":"Aran Mohammad","authors":"Aran Mohammad, Moritz Schappler and Tobias Ortmaier","title":"Towards Human-Robot Collaboration with Parallel Robots by Kinetostatic\n  Analysis, Impedance Control and Contact Detection","comments":"Accepted for publication at IEEE International Conference on Robotics\n  and Automation (ICRA) 2023","journal-ref":null,"doi":"10.1109/ICRA48891.2023.10161217","report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Parallel robots provide the potential to be leveraged for human-robot\ncollaboration (HRC) due to low collision energies even at high speeds resulting\nfrom their reduced moving masses. However, the risk of unintended contact with\nthe leg chains increases compared to the structure of serial robots. As a first\nstep towards HRC, contact cases on the whole parallel robot structure are\ninvestigated and a disturbance observer based on generalized momenta and\nmeasurements of motor current is applied. In addition, a Kalman filter and a\nsecond-order sliding-mode observer based on generalized momenta are compared in\nterms of error and detection time. Gearless direct drives with low friction\nimprove external force estimation and enable low impedance. The experimental\nvalidation is performed with two force-torque sensors and a kinetostatic model.\nThis allows a new identification method of the motor torque constant of an\nassembled parallel robot to estimate external forces from the motor current and\nvia a dynamics model. A Cartesian impedance control scheme for compliant\nrobot-environmental dynamics with stiffness from 0.1-2N/mm and the force\nobservation for low forces over the entire structure are validated. The\nobservers are used for collisions and clamping at velocities of 0.4-0.9m/s for\ndetection within 9-58ms and a reaction in the form of a zero-g mode.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:45:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mohammad","Aran",""],["Schappler","Moritz",""],["Ortmaier","Tobias",""]]}
{"id":"2308.09634","submitter":"Michael Sch\\\"uler","authors":"Samuel Beaulieu and Shuo Dong and Viktor Christiansson and Philipp\n  Werner and Tommaso Pincelli and Jonas D. Ziegler and Takashi Taniguchi and\n  Kenji Watanabe and Alexey Chernikov and Martin Wolf and Laurenz Rettig and\n  Ralph Ernstorfer and Michael Sch\\\"uler","title":"Berry Curvature Signatures in Chiroptical Excitonic Transitions","comments":"11 pages, 4 figures + supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The topology of the electronic band structure of solids can be described by\nits Berry curvature distribution across the Brillouin zone. We theoretically\nintroduce and experimentally demonstrate a general methodology based on the\nmeasurement of energy- and momentum-resolved optical transition rates, allowing\nto reveal signatures of Berry curvature texture in reciprocal space. By\nperforming time- and angle-resolved photoemission spectroscopy of atomically\nthin WSe$_2$ using polarization-modulated excitations, we demonstrate that\nexcitons become an asset in extracting the quantum geometrical properties of\nsolids. We also investigate the resilience of our measurement protocol against\nultrafast scattering processes following direct chiroptical transitions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:51:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Beaulieu","Samuel",""],["Dong","Shuo",""],["Christiansson","Viktor",""],["Werner","Philipp",""],["Pincelli","Tommaso",""],["Ziegler","Jonas D.",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Chernikov","Alexey",""],["Wolf","Martin",""],["Rettig","Laurenz",""],["Ernstorfer","Ralph",""],["Sch\u00fcler","Michael",""]]}
{"id":"2308.09635","submitter":"Daniel Zhang","authors":"Daniel Zhang","title":"Development of a Neural Network-based Method for Improved Imputation of\n  Missing Values in Time Series Data by Repurposing DataWig","comments":"16 pages, 3 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Time series data are observations collected over time intervals. Successful\nanalysis of time series data captures patterns such as trends, cyclicity and\nirregularity, which are crucial for decision making in research, business, and\ngovernance. However, missing values in time series data occur often and present\nobstacles to successful analysis, thus they need to be filled with alternative\nvalues, a process called imputation. Although various approaches have been\nattempted for robust imputation of time series data, even the most advanced\nmethods still face challenges including limited scalability, poor capacity to\nhandle heterogeneous data types and inflexibility due to requiring strong\nassumptions of data missing mechanisms. Moreover, the imputation accuracy of\nthese methods still has room for improvement. In this study, I developed\ntsDataWig (time-series DataWig) by modifying DataWig, a neural network-based\nmethod that possesses the capacity to process large datasets and heterogeneous\ndata types but was designed for non-time series data imputation. Unlike the\noriginal DataWig, tsDataWig can directly handle values of time variables and\nimpute missing values in complex time series datasets. Using one simulated and\nthree different complex real-world time series datasets, I demonstrated that\ntsDataWig outperforms the original DataWig and the current state-of-the-art\nmethods for time series data imputation and potentially has broad application\ndue to not requiring strong assumptions of data missing mechanisms. This study\nprovides a valuable solution for robustly imputing missing values in\nchallenging time series datasets, which often contain millions of samples, high\ndimensional variables, and heterogeneous data types.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:53:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Zhang","Daniel",""]]}
{"id":"2308.09636","submitter":"Satoshi Okamoto","authors":"Satoshi Okamoto, Naoto Nagaosa","title":"Critical enhancement of the spin Hall effect by spin fluctuations","comments":"Main text 9 pages 7 figures, supplementary material 12 pages 2\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spin Hall (SH) effect, the conversion of the electric current to the spin\ncurrent along the transverse direction, relies on the relativistic spin-orbit\ncoupling (SOC). Here, we develop microscopic mechanisms of the SH effect in\nmagnetic metals, where itinerant electrons are coupled with localized magnetic\nmoments via the Hund exchange interaction and the SOC. Both antiferromagnetic\nmetals and ferromagnetic metals are considered. It is shown that the spin Hall\nconductivity can be significantly enhanced by the spin fluctuation when\napproaching the magnetic transition temperature of both cases. For\nantiferromagnetic metals, the pure SHE appears in entire temperature range,\nwhile for ferromagnetic metals, the pure SHE is expected to be replaced by the\nanomalous Hall effect below the transition temperature. We also discuss\npossible experimental realizations and the effect of the quantum criticality\nwhen the antiferromagnetic transition temperature is tuned to zero temperature.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:55:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Okamoto","Satoshi",""],["Nagaosa","Naoto",""]]}
{"id":"2308.09637","submitter":"Sebastian Baltes","authors":"Sebastian Baltes, Brian Pfitzmann, Thomas Kowark, Christoph Treude,\n  and Fabian Beck","title":"Visually Analyzing Company-wide Software Service Dependencies: An\n  Industrial Case Study","comments":"5 pages, 3 figures, 1 table, 11th IEEE Working Conference on Software\n  Visualization (VISSOFT 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Managing dependencies between software services is a crucial task for any\ncompany operating cloud applications. Visualizations can help to understand and\nmaintain these complex dependencies. In this paper, we present a force-directed\nservice dependency visualization and filtering tool that has been developed and\nused within SAP. The tool's use cases include guiding service retirement as\nwell as understanding service deployment landscapes and their relationship to\nthe company's organizational structure. We report how we built and adapted the\ntool under strict time constraints to address the requirements of our users. We\nfurther share insights on how we enabled internal adoption. For us, starting\nwith a minimal viable visualization and then quickly responding to user\nfeedback was essential for convincing users of the tool's value. The final\nversion of the tool enabled users to visually understand company-wide service\nconsumption, supporting data-driven decision making.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:57:57 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 09:17:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Baltes","Sebastian",""],["Pfitzmann","Brian",""],["Kowark","Thomas",""],["Treude","Christoph",""],["Beck","Fabian",""]]}
{"id":"2308.09638","submitter":"Andrea Auconi","authors":"Andrea Auconi","title":"Conjecture of an information-response inequality","comments":"3 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The invariant response was defined from a formulation of the\nfluctuation-response theorem in the space of probability distributions. An\ninequality is here conjectured which sets the mutual information as an upper\nbound to the invariant response, and its large information limit is proven.\nApplications to the thermodynamics of feedback control and to estimation theory\nare discussed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:58:52 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Auconi","Andrea",""]]}
{"id":"2308.09639","submitter":"Teresa Head-Gordon","authors":"Jie Li, Xingyi Guan, Oufan Zhang, Kunyang Sun, Yingze Wang, Dorian\n  Bagni, and Teresa Head-Gordon","title":"Leak Proof PDBBind: A Reorganized Dataset of Protein-Ligand Complexes\n  for More Generalizable Binding Affinity Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many physics-based and machine-learned scoring functions (SFs) used to\npredict protein-ligand binding free energies have been trained on the PDBBind\ndataset. However, it is controversial as to whether new SFs are actually\nimproving since the general, refined, and core datasets of PDBBind are\ncross-contaminated with proteins and ligands with high similarity, and hence\nthey may not perform comparably well in binding prediction of new\nprotein-ligand complexes. In this work we have carefully prepared a cleaned\nPDBBind data set of non-covalent binders that are split into training,\nvalidation, and test datasets to control for data leakage. The resulting\nleak-proof (LP)-PDBBind data is used to retrain four popular SFs: AutoDock\nvina, Random Forest (RF)-Score, InteractionGraphNet (IGN), and DeepDTA, to\nbetter test their capabilities when applied to new protein-ligand complexes. In\nparticular we have formulated a new independent data set, BDB2020+, by matching\nhigh quality binding free energies from BindingDB with co-crystalized\nligand-protein complexes from the PDB that have been deposited since 2020.\nBased on all the benchmark results, the retrained models using LP-PDBBind that\nrely on 3D information perform consistently among the best, with IGN especially\nbeing recommended for scoring and ranking applications for new protein-ligand\nsystems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:59:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Li","Jie",""],["Guan","Xingyi",""],["Zhang","Oufan",""],["Sun","Kunyang",""],["Wang","Yingze",""],["Bagni","Dorian",""],["Head-Gordon","Teresa",""]]}
{"id":"2308.09640","submitter":"Richard Osuala","authors":"Thorsten Kalb, Kaisar Kushibar, Celia Cintas, Karim Lekadir, Oliver\n  Diaz, Richard Osuala","title":"Revisiting Skin Tone Fairness in Dermatological Lesion Classification","comments":"Accepted at 2023 MICCAI FAIMI Workshop","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":"  Addressing fairness in lesion classification from dermatological images is\ncrucial due to variations in how skin diseases manifest across skin tones.\nHowever, the absence of skin tone labels in public datasets hinders building a\nfair classifier. To date, such skin tone labels have been estimated prior to\nfairness analysis in independent studies using the Individual Typology Angle\n(ITA). Briefly, ITA calculates an angle based on pixels extracted from skin\nimages taking into account the lightness and yellow-blue tints. These angles\nare then categorised into skin tones that are subsequently used to analyse\nfairness in skin cancer classification. In this work, we review and compare\nfour ITA-based approaches of skin tone classification on the ISIC18 dataset, a\ncommon benchmark for assessing skin cancer classification fairness in the\nliterature. Our analyses reveal a high disagreement among previously published\nstudies demonstrating the risks of ITA-based skin tone estimation methods.\nMoreover, we investigate the causes of such large discrepancy among these\napproaches and find that the lack of diversity in the ISIC18 dataset limits its\nuse as a testbed for fairness analysis. Finally, we recommend further research\non robust ITA estimation and diverse dataset acquisition with skin tone\nannotation to facilitate conclusive fairness assessments of artificial\nintelligence tools in dermatology. Our code is available at\nhttps://github.com/tkalbl/RevisitingSkinToneFairness.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 15:59:55 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kalb","Thorsten",""],["Kushibar","Kaisar",""],["Cintas","Celia",""],["Lekadir","Karim",""],["Diaz","Oliver",""],["Osuala","Richard",""]]}
{"id":"2308.09641","submitter":"Manuel Antonio Garc\\'ia-Bl\\'azquez","authors":"M. A. Garc\\'ia-Bl\\'azquez, J. J. Esteve-Paredes, A. J. Ur\\'ia, J. J.\n  Palacios","title":"Shift current with Gaussian basis sets $\\&$ general prescription for\n  maximally-symmetric summations in the irreducible Brillouin zone","comments":"54 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The bulk photovoltaic effect is an experimentally verified phenomenon by\nwhich a direct charge current is induced within a non-centrosymmetric material\nby light illumination. Calculations of its intrinsic contribution, the shift\ncurrent, are nowadays amenable from first-principles employing plane-waves\nbases. In this work we present a general method for evaluating the shift\nconductivity in the framework of localized Gaussian basis sets that can be\nemployed in both the length and velocity gauges, carrying the idiosyncrasies of\nthe quantum-chemistry approach. The (possibly magnetic) symmetry of the system\nis exploited in order to fold the reciprocal space summations to the\nrepresentation domain, allowing to reduce computation time and unveiling the\ncomplete symmetry properties of the conductivity tensor under general light\npolarization.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:00:02 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Garc\u00eda-Bl\u00e1zquez","M. A.",""],["Esteve-Paredes","J. J.",""],["Ur\u00eda","A. J.",""],["Palacios","J. J.",""]]}
{"id":"2308.09642","submitter":"Morten Warncke-Wang","authors":"Morten Warncke-Wang, Rita Ho, Marshall Miller, Isaac Johnson","title":"Increasing Participation in Peer Production Communities with the\n  Newcomer Homepage","comments":null,"journal-ref":null,"doi":"10.1145/3610071","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For peer production communities to be sustainable, they must attract and\nretain new contributors. Studies have identified social and technical barriers\nto entry and discovered some potential solutions, but these solutions have\ntypically focused on a single highly successful community, the English\nWikipedia, been tested in isolation, and rarely evaluated through controlled\nexperiments. We propose the Newcomer Homepage, a central place where newcomers\ncan learn how peer production works and find opportunities to contribute, as a\nsolution for attracting and retaining newcomers. The homepage was built upon\nexisting research and designed in collaboration with partner communities.\nThrough a large-scale controlled experiment spanning 27 non-English Wikipedia\nwikis, we evaluate the homepage and find modest gains, and that having a\npositive effect on the newcomer experience depends on the newcomer's context.\nWe discuss how this impacts interventions that aim to improve the newcomer\nexperience in peer production communities.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:00:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Warncke-Wang","Morten",""],["Ho","Rita",""],["Miller","Marshall",""],["Johnson","Isaac",""]]}
{"id":"2308.09643","submitter":"Vincent Lemaire","authors":"Pierre Nodet and Vincent Lemaire and Alexis Bondu and Antoine\n  Cornu\\'ejols","title":"biquality-learn: a Python library for Biquality Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The democratization of Data Mining has been widely successful thanks in part\nto powerful and easy-to-use Machine Learning libraries. These libraries have\nbeen particularly tailored to tackle Supervised Learning. However, strong\nsupervision signals are scarce in practice, and practitioners must resort to\nweak supervision. In addition to weaknesses of supervision, dataset shifts are\nanother kind of phenomenon that occurs when deploying machine learning models\nin the real world. That is why Biquality Learning has been proposed as a\nmachine learning framework to design algorithms capable of handling multiple\nweaknesses of supervision and dataset shifts without assumptions on their\nnature and level by relying on the availability of a small trusted dataset\ncomposed of cleanly labeled and representative samples. Thus we propose\nbiquality-learn: a Python library for Biquality Learning with an intuitive and\nconsistent API to learn machine learning models from biquality data, with\nwell-proven algorithms, accessible and easy to use for everyone, and enabling\nresearchers to experiment in a reproducible way on biquality data.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:01:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Nodet","Pierre",""],["Lemaire","Vincent",""],["Bondu","Alexis",""],["Cornu\u00e9jols","Antoine",""]]}
{"id":"2308.09644","submitter":"Co Tran","authors":"Co Tran, Mo Badawy, Tyler McDonnell","title":"A Potts model approach to unsupervised graph clustering with Graph\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Numerous approaches have been explored for graph clustering, including those\nwhich optimize a global criteria such as modularity. More recently, Graph\nNeural Networks (GNNs), which have produced state-of-the-art results in graph\nanalysis tasks such as node classification and link prediction, have been\napplied for unsupervised graph clustering using these modularity-based metrics.\nModularity, though robust for many practical applications, suffers from the\nresolution limit problem, in which optimization may fail to identify clusters\nsmaller than a scale that is dependent on properties of the network. In this\npaper, we propose a new GNN framework which draws from the Potts model in\nphysics to overcome this limitation. Experiments on a variety of real world\ndatasets show that this model achieves state-of-the-art clustering results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:02:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tran","Co",""],["Badawy","Mo",""],["McDonnell","Tyler",""]]}
{"id":"2308.09645","submitter":"Margaret-Ellen Messinger","authors":"Melissa A. Huggan, Margaret-Ellen Messinger, Amanda Porter","title":"The damage number of the Cartesian product of graphs","comments":"21 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a variation of Cops and Robber, introduced in [D. Cox and A.\nSanaei, The damage number of a graph, [Aust. J. of Comb. 75(1) (2019) 1-16]\nwhere vertices visited by a robber are considered damaged and a single cop aims\nto minimize the number of distinct vertices damaged by a robber. Motivated by\nthe interesting relationships that often emerge between input graphs and their\nCartesian product, we study the damage number of the Cartesian product of\ngraphs. We provide a general upper bound and consider the damage number of the\nproduct of two trees or cycles. We also consider graphs with small damage\nnumber.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:06:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huggan","Melissa A.",""],["Messinger","Margaret-Ellen",""],["Porter","Amanda",""]]}
{"id":"2308.09646","submitter":"\\'Oscar Carri\\'on-Gonz\\'alez","authors":"\\'Oscar Carri\\'on-Gonz\\'alez, Jens Kammerer, Daniel Angerhausen, Felix\n  Dannert, Antonio Garc\\'ia Mu\\~noz, Sascha P. Quanz, Olivier Absil, Charles A.\n  Beichman, Julien H. Girard, Bertrand Mennesson, Michael R. Meyer, Karl R.\n  Stapelfeldt, The LIFE Collaboration","title":"Large Interferometer For Exoplanets (LIFE). X. Detectability of\n  currently known exoplanets and synergies with future IR/O/UV\n  reflected-starlight imaging missions","comments":"Accepted for publication in A&A. 14 pages, 5 Tables, 5 Figures +\n  Appendix","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":"  The next generation of space-based observatories will characterize the\natmospheres of low-mass, temperate exoplanets with the direct-imaging\ntechnique. This will be a major step forward in our understanding of exoplanet\ndiversity and the prevalence of potentially habitable conditions beyond the\nEarth. We compute a list of currently known exoplanets detectable with the\nmid-infrared Large Interferometer For Exoplanets (LIFE) in thermal emission. We\nalso compute the list of known exoplanets accessible to a notional design of\nthe Habitable Worlds Observatory (HWO), observing in reflected starlight. With\na pre-existing method, we processed the NASA Exoplanet Archive and computed\norbital realizations for each known exoplanet. We derived their mass, radius,\nequilibrium temperature, and planet-star angular separation. We used the\nLIFEsim simulator to compute the integration time ($t_{int}$) required to\ndetect each planet with LIFE. A planet is considered detectable if a broadband\nsignal-to-noise ratio $S/N$=7 is achieved over the spectral range $4-18.5\\mu$m\nin $t_{int}\\leq$100 hours. We tested whether the planet is accessible to HWO in\nreflected starlight based on its notional inner and outer working angles, and\nminimum planet-to-star contrast. LIFE's reference configuration (four 2-m\ntelescopes with 5% throughput and a nulling baseline between 10-100 m) can\ndetect 212 known planets within 20 pc. Of these, 55 are also accessible to HWO\nin reflected starlight, offering a unique opportunity for synergies in\natmospheric characterization. LIFE can also detect 32 known transiting\nexoplanets. Furthermore, 38 LIFE-detectable planets orbit in the habitable\nzone, of which 13 with $M_p<5M_\\oplus$ and 8 with $5M_\\oplus<M_p<10M_\\oplus$.\nLIFE already has enough targets to perform ground-breaking analyses of\nlow-mass, habitable-zone exoplanets, a fraction of which will also be\naccessible to other instruments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:06:41 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Carri\u00f3n-Gonz\u00e1lez","\u00d3scar",""],["Kammerer","Jens",""],["Angerhausen","Daniel",""],["Dannert","Felix",""],["Mu\u00f1oz","Antonio Garc\u00eda",""],["Quanz","Sascha P.",""],["Absil","Olivier",""],["Beichman","Charles A.",""],["Girard","Julien H.",""],["Mennesson","Bertrand",""],["Meyer","Michael R.",""],["Stapelfeldt","Karl R.",""],["Collaboration","The LIFE",""]]}
{"id":"2308.09647","submitter":"Daniel Bethell","authors":"Daniel Bethell, Simos Gerasimou, Radu Calinescu","title":"Robust Uncertainty Quantification using Conformalised Monte Carlo\n  Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Deploying deep learning models in safety-critical applications remains a very\nchallenging task, mandating the provision of assurances for the dependable\noperation of these models. Uncertainty quantification (UQ) methods estimate the\nmodel's confidence per prediction, informing decision-making by considering the\neffect of randomness and model misspecification. Despite the advances of\nstate-of-the-art UQ methods, they are computationally expensive or produce\nconservative prediction sets/intervals. We introduce MC-CP, a novel hybrid UQ\nmethod that combines a new adaptive Monte Carlo (MC) dropout method with\nconformal prediction (CP). MC-CP adaptively modulates the traditional MC\ndropout at runtime to save memory and computation resources, enabling\npredictions to be consumed by CP, yielding robust prediction sets/intervals.\nThroughout comprehensive experiments, we show that MC-CP delivers significant\nimprovements over advanced UQ methods, like MC dropout, RAPS and CQR, both in\nclassification and regression benchmarks. MC-CP can be easily added to existing\nmodels, making its deployment simple.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:07:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bethell","Daniel",""],["Gerasimou","Simos",""],["Calinescu","Radu",""]]}
{"id":"2308.09648","submitter":"Chi-Heng Lo","authors":"Baiying Liu and Chi-Heng Lo","title":"On the weak local Arthur packets conjecture for split classical groups","comments":"24 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, motivated by the theory of real local Arthur packets, making use of\nthe wavefront sets of representations over non-Archimedean local fields $F$,\nCiubotaru, Mason-Brown, and Okada defined the weak local Arthur packets\nconsisting of certain unipotent representations and conjectured that they are\nunions of local Arthur packets. In this paper, we prove this conjecture for\nsplit classical groups with the assumption of the residue field characteristic\nof $F$ being large. In particular, this implies the unitarity of these\nunipotent representations. We also discuss the generalization of the weak local\nArthur packets beyond unipotent representations which reveals the implications\nof a conjecture of Jiang on the structure of wavefront sets for representations\nin local Arthur packets.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:10:03 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Baiying",""],["Lo","Chi-Heng",""]]}
{"id":"2308.09649","submitter":"Yunhak Oh","authors":"Yunhak Oh, Sukwon Yun, Dongmin Hyun, Sein Kim, Chanyoung Park","title":"MUSE: Music Recommender System with Shuffle Play Recommendation\n  Enhancement","comments":"CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3614976","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems have become indispensable in music streaming services,\nenhancing user experiences by personalizing playlists and facilitating the\nserendipitous discovery of new music. However, the existing recommender systems\noverlook the unique challenges inherent in the music domain, specifically\nshuffle play, which provides subsequent tracks in a random sequence. Based on\nour observation that the shuffle play sessions hinder the overall training\nprocess of music recommender systems mainly due to the high unique transition\nrates of shuffle play sessions, we propose a Music Recommender System with\nShuffle Play Recommendation Enhancement (MUSE). MUSE employs the\nself-supervised learning framework that maximizes the agreement between the\noriginal session and the augmented session, which is augmented by our novel\nsession augmentation method, called transition-based augmentation. To further\nfacilitate the alignment of the representations between the two views, we\ndevise two fine-grained matching strategies, i.e., item- and similarity-based\nmatching strategies. Through rigorous experiments conducted across diverse\nenvironments, we demonstrate MUSE's efficacy over 12 baseline models on a\nlarge-scale Music Streaming Sessions Dataset (MSSD) from Spotify. The source\ncode of MUSE is available at \\url{https://github.com/yunhak0/MUSE}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:10:13 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 07:24:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Oh","Yunhak",""],["Yun","Sukwon",""],["Hyun","Dongmin",""],["Kim","Sein",""],["Park","Chanyoung",""]]}
{"id":"2308.09650","submitter":"Aran Mohammad","authors":"Aran Mohammad, Moritz Schappler and Tobias Ortmaier","title":"Collision Isolation and Identification Using Proprioceptive Sensing for\n  Parallel Robots to Enable Human-Robot Collaboration","comments":"Accepted for publication at IEEE/RSJ International Conference on\n  Intelligent Robots (IROS) 2023","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":"  Parallel robots (PRs) allow for higher speeds in human-robot collaboration\ndue to their lower moving masses but are more prone to unintended contact. For\na safe reaction, knowledge of the location and force of a collision is useful.\nA novel algorithm for collision isolation and identification with\nproprioceptive information for a real PR is the scope of this work. To classify\nthe collided body, the effects of contact forces at the links and platform of\nthe PR are analyzed using a kinetostatic projection. This insight enables the\nderivation of features from the line of action of the estimated external force.\nThe significance of these features is confirmed in experiments for various load\ncases. A feedforward neural network (FNN) classifies the collided body based on\nthese physically modeled features. Generalization with the FNN to 300k load\ncases on the whole robot structure in other joint angle configurations is\nsuccessfully performed with a collision-body classification accuracy of 84% in\nthe experiments. Platform collisions are isolated and identified with an\nexplicit solution, while a particle filter estimates the location and force of\na contact on a kinematic chain. Updating the particle filter with estimated\nexternal joint torques leads to an isolation error of less than 3cm and an\nidentification error of 4N in a real-world experiment.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:11:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mohammad","Aran",""],["Schappler","Moritz",""],["Ortmaier","Tobias",""]]}
{"id":"2308.09651","submitter":"Goutam Dev Mukherjee Prof","authors":"Bidisha Mukherjee, Mrinmay Sahu, Debabrata Samanta, Bishnupada Ghosh,\n  Boby Joseph and Goutam Dev Mukherjee","title":"Pressure-induced softening in bulk modulus due to magneto-elastic\n  coupling in Nd$_2$CoFeO$_6$ double Perovskite","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":"  Double perovskite oxide materials have garnered tremendous interest due to\ntheir strong spin-lattice-charge coupling. Interesting in their own right,\nrare-earth-based DPOs have yet to be subjected to high-pressure studies. In\nthis paper, we have investigated the structural response of Nd$_2$CoFeO$_6$ to\npressure by XRD and Raman spectroscopic measurements. From XRD data, we have\nobserved pressure-induced structural transition from the orthorhombic phase to\nthe monoclinic phase at about 13.8~\\si{\\giga\\pascal}. An anomalous increase in\ncompressibility at a much lower pressure($\\sim$1.1~\\si{\\giga\\pascal}) is seen\nwhere no structural transition occurs. At about the same pressure, a sudden\ndrop in the slope of Raman modes is observed. Further investigation at low\ntemperatures reveals that the B$_g$ Raman mode is strongly affected by magnetic\ninteractions. Additional high-pressure Raman experiments with the application\nof a magnetic field indicated that the mentioned anomaly around\n1.1~\\si{\\giga\\pascal} can be explained by a high-spin to low-spin transition of\nCo$^{3+}$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:12:45 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 09:37:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mukherjee","Bidisha",""],["Sahu","Mrinmay",""],["Samanta","Debabrata",""],["Ghosh","Bishnupada",""],["Joseph","Boby",""],["Mukherjee","Goutam Dev",""]]}
{"id":"2308.09652","submitter":"Georg Oberdieck","authors":"Georg Oberdieck, Maximilian Schimpf","title":"Pandharipande-Thomas theory of elliptic threefolds, quasi-Jacobi forms\n  and holomorphic anomaly equations","comments":"34 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\pi : X \\to B$ be an elliptically fibered threefold satisfying $c_3(T_X\n\\otimes \\omega_X)=0$. We conjecture that the $\\pi$-relative generating series\nof Pandharipande-Thomas invariants of $X$ are quasi-Jacobi forms and satisfy\ntwo holomorphic anomaly equations. For elliptic Calabi-Yau threefolds our\nconjectures specialize to the Huang-Katz-Klemm conjecture. The proposed\nformulas constitute the first case of holomorphic anomaly equations in\nPandharipande-Thomas theory.\n  We prove our conjectures for the equivariant Pandharipande-Thomas theory of\n$\\mathbb{C}^2 \\times E$ when specialized to the anti-diagonal action. For $K3\n\\times \\mathbb{C}$ we state reduced versions of our conjectures. As a corollary\nwe find an explicit conjectural formula for the stationary theory generalizing\nthe Katz-Klemm-Vafa formula for K3 surfaces. Further evidence is available for\n$\\mathbb{P}^2 \\times E$ based on earlier work of the second author.\n  To deal with elliptic threefolds with $c_3(T_X \\otimes \\omega_X) \\neq 0$ we\nshow that the moduli space of $\\pi$-stable pairs is represented by a proper\nalgebraic space. We conjecture that the associated $\\pi$-stable pair invariants\nform quasi-Jacobi forms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:12:46 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Oberdieck","Georg",""],["Schimpf","Maximilian",""]]}
{"id":"2308.09653","submitter":"Julia Lindberg","authors":"Grigoriy Blekherman, Julia Lindberg, Kevin Shu","title":"Symmetric Hyperbolic Polynomials","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperbolic polynomials have been of recent interest due to applications in a\nwide variety of fields. We seek to better understand these polynomials in the\ncase when they are symmetric, i.e. invariant under all permutations of\nvariables. We give a complete characterization of the set of symmetric\nhyperbolic polynomials of degree 3, and a large class of symmetric hyperbolic\npolynomials of degree 4. For a class of polynomials, which we call hook-shaped,\nwe relate symmetric hyperbolic polynomials to a class of linear maps of\nunivariate polynomials preserving hyperbolicity, and give evidence toward a\nbeautiful characterization of all such hook-shaped symmetric hyperbolic\npolynomials. We show that hyperbolicity cones of a class of symmetric\nhyperbolic polynomials, including all symmetric hyperbolic cubics, are\nspectrahedral. Finally, we connect testing hyperbolicity of a symmetric\npolynomial to the degree principle for symmetric nonnegative polynomials.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:16:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Blekherman","Grigoriy",""],["Lindberg","Julia",""],["Shu","Kevin",""]]}
{"id":"2308.09654","submitter":"Yi-Hsuan Lin","authors":"Ching-Lung Lin, Yi-Hsuan Lin, Gunther Uhlmann","title":"The Calder\\'{o}n problem for nonlocal parabolic operators: A new\n  reduction from the nonlocal to the local","comments":"46 pages. All 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 article, we investigate the Calder\\'on problem for nonlocal parabolic\nequations, where we are interested to recover the leading coefficient of\nnonlocal parabolic operators. The main contribution is that we can relate both\n(anisotropic) variable coefficients local and nonlocal Calder\\'on problem for\nparabolic equations. More concretely, we show that the (partial)\nDirichlet-to-Neumann map for the nonlocal parabolic equation determines the\n(full) Dirichlet-to-Neumann map for the local parabolic equation. This article\nextends our earlier results [LLU22] by using completely different methods.\nMoreover, the results hold for any spatial dimension $n\\geq 2$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:17:32 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Lin","Ching-Lung",""],["Lin","Yi-Hsuan",""],["Uhlmann","Gunther",""]]}
{"id":"2308.09655","submitter":"Stephen Coombes","authors":"Stephen Coombes, Mustafa Sayli, R\\\"udiger Thul, Rachel Nicks, Mason A\n  Porter and Yi Ming Lai","title":"Oscillatory networks: Insights from piecewise-linear modeling","comments":"63 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.SY eess.SY nlin.AO physics.soc-ph q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is enormous interest -- both mathematically and in diverse applications\n-- in understanding the dynamics of coupled oscillator networks. The real-world\nmotivation of such networks arises from studies of the brain, the heart,\necology, and more. It is common to describe the rich emergent behavior in these\nsystems in terms of complex patterns of network activity that reflect both the\nconnectivity and the nonlinear dynamics of the network components. Such\nbehavior is often organized around phase-locked periodic states and their\ninstabilities. However, the explicit calculation of periodic orbits in\nnonlinear systems (even in low dimensions) is notoriously hard, so\nnetwork-level insights often require the numerical construction of some\nunderlying periodic component. In this paper, we review powerful techniques for\nstudying coupled oscillator networks. We discuss phase reductions,\nphase-amplitude reductions, and the master stability function for smooth\ndynamical systems. We then focus in particular on the augmentation of these\nmethods to analyze piecewise-linear systems, for which one can readily\nconstruct periodic orbits. This yields useful insights into network behavior,\nbut the cost is that one needs to study nonsmooth dynamical systems. The study\nof nonsmooth systems is well-developed when focusing on the interacting units\n(i.e., at the node level) of a system, and we give a detailed presentation of\nhow to use \\textit{saltation operators}, which can treat the propagation of\nperturbations through switching manifolds, to understand dynamics and\nbifurcations at the network level. We illustrate this merger of tools and\ntechniques from network science and nonsmooth dynamical systems with\napplications to neural systems, cardiac systems, networks of electro-mechanical\noscillators, and cooperation in cattle herds.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:18:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Coombes","Stephen",""],["Sayli","Mustafa",""],["Thul","R\u00fcdiger",""],["Nicks","Rachel",""],["Porter","Mason A",""],["Lai","Yi Ming",""]]}
{"id":"2308.09656","submitter":"Aran Mohammad","authors":"Aran Mohammad, Moritz Schappler, Tim-Lukas Habich and Tobias Ortmaier","title":"Safe Collision and Clamping Reaction for Parallel Robots During\n  Human-Robot Collaboration","comments":"Accepted for publication at IEEE/RSJ International Conference on\n  Intelligent Robots (IROS) 2023","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":"  Parallel robots (PRs) offer the potential for safe human-robot collaboration\nbecause of their low moving masses. Due to the in-parallel kinematic chains,\nthe risk of contact in the form of collisions and clamping at a chain\nincreases. Ensuring safety is investigated in this work through various contact\nreactions on a real planar PR. External forces are estimated based on\nproprioceptive information and a dynamics model, which allows contact\ndetection. Retraction along the direction of the estimated line of action\nprovides an instantaneous response to limit the occurring contact forces within\nthe experiment to 70N at a maximum velocity 0.4m/s. A reduction in the\nstiffness of a Cartesian impedance control is investigated as a further\nstrategy. For clamping, a feedforward neural network (FNN) is trained and\ntested in different joint angle configurations to classify whether a collision\nor clamping occurs with an accuracy of 80%. A second FNN classifies the\nclamping kinematic chain to enable a subsequent kinematic projection of the\nclamping joint angle onto the rotational platform coordinates. In this way, a\nstructure opening is performed in addition to the softer retraction movement.\nThe reaction strategies are compared in real-world experiments at different\nvelocities and controller stiffnesses to demonstrate their effectiveness. The\nresults show that in all collision and clamping experiments the PR terminates\nthe contact in less than 130ms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:18:48 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mohammad","Aran",""],["Schappler","Moritz",""],["Habich","Tim-Lukas",""],["Ortmaier","Tobias",""]]}
{"id":"2308.09657","submitter":"Victor Francisco Ksoll","authors":"Victor F. Ksoll, Stefan Reissl, Ralf S. Klessen, Ian W. Stephens,\n  Rowan J. Smith, Juan D. Soler, Alessio Traficante, Leonardo Testi, Patrick\n  Hennebelle, and Sergio Molinari","title":"A deep learning approach for the 3D reconstruction of dust density and\n  temperature in star-forming regions","comments":"32 pages, 18 figures, submitted to Astronomy & Astrophysics, comments\n  welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aims: We introduce a new deep learning approach for the reconstruction of 3D\ndust density and temperature distributions from multi-wavelength dust emission\nobservations on the scale of individual star-forming cloud cores (<0.2 pc).\n  Methods: We construct a training data set by processing cloud cores from the\nCloud Factory simulations with the POLARIS radiative transfer code to produce\nsynthetic dust emission observations at 23 wavelengths between 12 and 1300\n$\\mu$m. We simplify the task by reconstructing the cloud structure along\nindividual lines of sight and train a conditional invertible neural network\n(cINN) for this purpose. The cINN belongs to the group of normalising flow\nmethods and is able to predict full posterior distributions for the target dust\nproperties. We test different cINN setups, ranging from a scenario that\nincludes all 23 wavelengths down to a more realistically limited case with\nobservations at only seven wavelengths. We evaluate the predictive performance\nof these models on synthetic test data.\n  Results: We report an excellent reconstruction performance for the\n23-wavelengths cINN model, achieving median absolute relative errors of about\n1.8% in $\\log(n_{dust}/m^{-3})$ and 1% in $\\log(T_{dust}/K)$, respectively. We\nidentify trends towards overestimation at the low end of the density range and\ntowards underestimation at the high end of both density and temperature, which\nmay be related to a bias in the training data. Limiting coverage to a\ncombination of only seven wavelengths, we still find a satisfactory performance\nwith average absolute relative errors of about 3.3% and 2.5% in\n$\\log(n_{dust}/m^{-3})$ and $\\log(T_{dust}/K)$.\n  Conclusions: This proof of concept study shows that the cINN-based approach\nfor 3D reconstruction of dust density and temperature is very promising and\neven feasible under realistic observational constraints.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:19:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ksoll","Victor F.",""],["Reissl","Stefan",""],["Klessen","Ralf S.",""],["Stephens","Ian W.",""],["Smith","Rowan J.",""],["Soler","Juan D.",""],["Traficante","Alessio",""],["Testi","Leonardo",""],["Hennebelle","Patrick",""],["Molinari","Sergio",""]]}
{"id":"2308.09658","submitter":"Pengbo Hu","authors":"Pengbo Hu, Ji Qi, Xingyu Li, Hong Li, Xinqi Wang, Bing Quan, Ruiyu\n  Wang, Yi Zhou","title":"Tree-of-Mixed-Thought: Combining Fast and Slow Thinking for Multi-hop\n  Visual Reasoning","comments":"16 pages,1 figures, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There emerges a promising trend of using large language models (LLMs) to\ngenerate code-like plans for complex inference tasks such as visual reasoning.\nThis paradigm, known as LLM-based planning, provides flexibility in problem\nsolving and endows better interpretability. However, current research is mostly\nlimited to basic scenarios of simple questions that can be straightforward\nanswered in a few inference steps. Planning for the more challenging multi-hop\nvisual reasoning tasks remains under-explored. Specifically, under multi-hop\nreasoning situations, the trade-off between accuracy and the complexity of\nplan-searching becomes prominent. The prevailing algorithms either address the\nefficiency issue by employing the fast one-stop generation or adopt a complex\niterative generation method to improve accuracy. Both fail to balance the need\nfor efficiency and performance. Drawing inspiration from the dual system of\ncognition in the human brain, the fast and the slow think processes, we propose\na hierarchical plan-searching algorithm that integrates the one-stop reasoning\n(fast) and the Tree-of-thought (slow). Our approach succeeds in performance\nwhile significantly saving inference steps. Moreover, we repurpose the PTR and\nthe CLEVER datasets, developing a systematic framework for evaluating the\nperformance and efficiency of LLMs-based plan-search algorithms under reasoning\ntasks at different levels of difficulty. Extensive experiments demonstrate the\nsuperiority of our proposed algorithm in terms of performance and efficiency.\nThe dataset and code will be release soon.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:21:40 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 03:08:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Pengbo",""],["Qi","Ji",""],["Li","Xingyu",""],["Li","Hong",""],["Wang","Xinqi",""],["Quan","Bing",""],["Wang","Ruiyu",""],["Zhou","Yi",""]]}
{"id":"2308.09659","submitter":"Andre Sieverding","authors":"Andre Sieverding (1), Daniel Kresse (1,2), Hans-Thomas Janka (1) ((1)\n  MPI Astrophysik, (2) TUM Garching)","title":"Production of 44Ti and iron-group nuclei in the ejecta of 3D\n  neutrino-driven supernovae","comments":"12 pages, 7 Figures, submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The radioactive isotopes of 44Ti and 56Ni are important products of explosive\nnucleosynthesis, which play a key role for supernova (SN) diagnostics and were\ndetected in several nearby young SN remnants. However, most SN models based on\nnon-rotating single stars predict yields of 44Ti that are much lower than the\nvalues inferred from observations. We present, for the first time, the\nnucleosynthesis yields from a self-consistent three-dimensional (3D) SN\nsimulation of an approximately 19 Msun progenitor star that reaches an\nexplosion energy comparable to that of SN 1987A and that covers the evolution\nof the neutrino-driven explosion until more than 7 seconds after core bounce.\nWe find a significant enhancement of the Ti/Fe yield compared to recent\nspherically symmetric (1D) models and demonstrate that the long-time evolution\nis crucial to understand the efficient production of 44Ti due to the\nnon-monotonic temperature and density histories of ejected mass elements.\nAdditionally, we identify characteristic signatures of the nucleosynthesis in\nproton-rich ejecta, in particular high yields of 45Sc and 64Zn.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:22:35 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sieverding","Andre",""],["Kresse","Daniel",""],["Janka","Hans-Thomas",""]]}
{"id":"2308.09660","submitter":"Tamas Szabo","authors":"Tam\\'as Szab\\'o","title":"Incrementalizing Production CodeQL Analyses","comments":"16 pages, extended version of the paper with the same title published\n  at FSE'23","journal-ref":null,"doi":"10.1145/3611643.3613860","report-no":null,"categories":"cs.SE cs.PL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Instead of repeatedly re-analyzing from scratch, an incremental static\nanalysis only analyzes a codebase once completely, and then it updates the\nprevious results based on the code changes. While this sounds promising to\nachieve speed-ups, the reality is that sophisticated static analyses typically\nemploy features that can ruin incremental performance, such as\ninter-procedurality or context-sensitivity. In this study, we set out to\nexplore whether incrementalization can help to achieve speed-ups for production\nCodeQL analyses that provide automated feedback on pull requests on GitHub. We\nfirst empirically validate the idea by measuring the potential for reuse on\nreal-world codebases, and then we create a prototype incremental solver for\nCodeQL that exploits incrementality. We report on experimental results showing\nthat we can indeed achieve update times proportional to the size of the code\nchange, and we also discuss the limitations of our prototype.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:22:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Szab\u00f3","Tam\u00e1s",""]]}
{"id":"2308.09661","submitter":"Thomas P\\\"ahtz","authors":"Thomas P\\\"ahtz, Katharina Tholen","title":"General average balance equations for a mixture of rigid particles and a\n  continuous 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":"  The equations of motion of rigid particles and a continuous fluids are\naveraged to derive average balance equations. The averaging procedure is\ngeneric, requiring only linearity and commutation with the space and time\nderivatives. Except for no-slip boundary conditions, no assumptions about the\nrheology of the fluid and the shape and composition of the particles are made.\nIn this regard, the derivation unifies the famous works by Jackson and Zhang\nand Prosperetti, which were limited to identical homogeneous spheres and\nspecific averaging procedures, within a single mathematical formalism.\nCrucially, this formalism avoids the infinite Taylor series expansions in the\nparticle-to-flow-scale ratio that were heavily employed in these older\ncontributions. As a result, the derived expressions for the average fluid\nphase, solid phase, and mixture fields of interest, despite being general and\nmathematically exact, exhibit a simple mathematical structure that readily\nreveals the underlying physics. Most importantly, the average fields involve\nonly the zeroth and first surface and volume moments of non-averaged fields\nabout the particle centers, rather than all the moments as suggested by\nprevious works. We also provide a general, exact, and comparably simple\nexpression for the particle-fluid-particle stress, which plays a crucial role\nin suspension balance models. In future studies, the derived expressions can be\nused to extract the average fields of dispersed flow from coupled\nsub-particle-scale-resolving CFD-DEM simulations, even in situations where the\nmacroscopic flow changes rapidly over both the typical size of particles and\nthe typical distance separating them.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:26:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["P\u00e4htz","Thomas",""],["Tholen","Katharina",""]]}
{"id":"2308.09662","submitter":"Soujanya Poria","authors":"Rishabh Bhardwaj, Soujanya Poria","title":"Red-Teaming Large Language Models using Chain of Utterances for\n  Safety-Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Larger language models (LLMs) have taken the world by storm with their\nmassive multi-tasking capabilities simply by optimizing over a next-word\nprediction objective. With the emergence of their properties and encoded\nknowledge, the risk of LLMs producing harmful outputs increases, making them\nunfit for scalable deployment for the public. In this work, we propose a new\nsafety evaluation benchmark RED-EVAL that carries out red-teaming. We show that\neven widely deployed models are susceptible to the Chain of Utterances-based\n(CoU) prompting, jailbreaking closed source LLM-based systems such as GPT-4 and\nChatGPT to unethically respond to more than 65% and 73% of harmful queries. We\nalso demonstrate the consistency of the RED-EVAL across 8 open-source LLMs in\ngenerating harmful responses in more than 86% of the red-teaming attempts.\nNext, we propose RED-INSTRUCT--An approach for the safety alignment of LLMs. It\nconstitutes two phases: 1) HARMFULQA data collection: Leveraging CoU prompting,\nwe collect a dataset that consists of 1.9K harmful questions covering a wide\nrange of topics, 9.5K safe and 7.3K harmful conversations from ChatGPT; 2)\nSAFE-ALIGN: We demonstrate how the conversational dataset can be used for the\nsafety alignment of LLMs by minimizing the negative log-likelihood over helpful\nresponses and penalizing over harmful responses by gradient accent over sample\nloss. Our model STARLING, a fine-tuned Vicuna-7B, is observed to be more safely\naligned when evaluated on RED-EVAL and HHH benchmarks while preserving the\nutility of the baseline models (TruthfulQA, MMLU, and BBH).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:27:04 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 18:18:38 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 10:21:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bhardwaj","Rishabh",""],["Poria","Soujanya",""]]}
{"id":"2308.09663","submitter":"Yucheng Shi","authors":"Yucheng Shi, Yushun Dong, Qiaoyu Tan, Jundong Li, Ninghao Liu","title":"GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent\n  Space Reconstruction","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Self-supervised learning with masked autoencoders has recently gained\npopularity for its ability to produce effective image or textual\nrepresentations, which can be applied to various downstream tasks without\nretraining. However, we observe that the current masked autoencoder models lack\ngood generalization ability on graph data. To tackle this issue, we propose a\nnovel graph masked autoencoder framework called GiGaMAE. Different from\nexisting masked autoencoders that learn node presentations by explicitly\nreconstructing the original graph components (e.g., features or edges), in this\npaper, we propose to collaboratively reconstruct informative and integrated\nlatent embeddings. By considering embeddings encompassing graph topology and\nattribute information as reconstruction targets, our model could capture more\ngeneralized and comprehensive knowledge. Furthermore, we introduce a mutual\ninformation based reconstruction loss that enables the effective reconstruction\nof multiple targets. This learning objective allows us to differentiate between\nthe exclusive knowledge learned from a single target and common knowledge\nshared by multiple targets. We evaluate our method on three downstream tasks\nwith seven datasets as benchmarks. Extensive experiments demonstrate the\nsuperiority of GiGaMAE against state-of-the-art baselines. We hope our results\nwill shed light on the design of foundation models on graph-structured data.\nOur code is available at: https://github.com/sycny/GiGaMAE.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:30:51 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Shi","Yucheng",""],["Dong","Yushun",""],["Tan","Qiaoyu",""],["Li","Jundong",""],["Liu","Ninghao",""]]}
{"id":"2308.09664","submitter":"Rong-Qiang He","authors":"Jia-Qi Wang, Rong-Qiang He, and Zhong-Yi Lu","title":"Variational optimization of the amplitude of neural-network quantum\n  many-body ground states","comments":"7 pages, 2 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn cs.LG quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural-network quantum states (NQSs), variationally optimized by combining\ntraditional methods and deep learning techniques, is a new way to find quantum\nmany-body ground states and gradually becomes a competitor of traditional\nvariational methods. However, there are still some difficulties in the\noptimization of NQSs, such as local minima, slow convergence, and sign\nstructure optimization. Here, we split a quantum many-body variational wave\nfunction into a multiplication of a real-valued amplitude neural network and a\nsign structure, and focus on the optimization of the amplitude network while\nkeeping the sign structure fixed. The amplitude network is a convolutional\nneural network (CNN) with residual blocks, namely a ResNet. Our method is\ntested on three typical quantum many-body systems. The obtained ground state\nenergies are lower than or comparable to those from traditional variational\nMonte Carlo (VMC) methods and density matrix renormalization group (DMRG).\nSurprisingly, for the frustrated Heisenberg $J_1$-$J_2$ model, our results are\nbetter than those of the complex-valued CNN in the literature, implying that\nthe sign structure of the complex-valued NQS is difficult to be optimized. We\nwill study the optimization of the sign structure of NQSs in the future.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:30:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wang","Jia-Qi",""],["He","Rong-Qiang",""],["Lu","Zhong-Yi",""]]}
{"id":"2308.09665","submitter":"James Trussler","authors":"James A. A. Trussler, Christopher J. Conselice, Nathan Adams, Duncan\n  Austin, Leonardo Ferreira, Tom Harvey, Qiong Li, Aswin P. Vijayan, Stephen M.\n  Wilkins, Rogier A. Windhorst, Rachana Bhatawdekar, Cheng Cheng, Dan Coe, Seth\n  H. Cohen, Simon P. Driver, Brenda Frye, Norman A. Grogin, Nimish Hathi, Rolf\n  A. Jansen, Anton Koekemoer, Madeline A. Marshall, Mario Nonino, Rafael Ortiz,\n  Nor Pirzkal, Aaron Robotham, Russell E. Ryan Jr., Jordan C. J. D'Silva, Jake\n  Summers, Scott Tompkins, Christopher N. A. Willmer and Haojing Yan","title":"EPOCHS IX. When cosmic dawn breaks: Evidence for evolved stellar\n  populations in $7 < z < 12$ galaxies from PEARLS GTO and public NIRCam\n  imaging","comments":"23 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The presence of evolved stars in high-redshift galaxies can place valuable\nindirect constraints on the onset of star formation in the Universe. Thus we\nuse a combination of PEARLS GTO and public NIRCam photometric data to search\nfor Balmer break candidate galaxies at $7 < z < 12$. We find that our Balmer\nbreak candidates at $z \\sim 10.5$ tend to be older (115 Myr), have lower\ninferred [O III] + H$\\beta$ emission line equivalent widths (120 \\r{A}), have\nlower specific star formation rates (6 Gyr$^{-1}$) and redder UV slopes ($\\beta\n= -1.8$) than our control sample of galaxies. However, these trends all become\nless strong at $z \\sim 8$, where the F444W filter now probes the strong\nrest-frame optical emission lines, thus providing additional constraints on the\ncurrent star formation activity of these galaxies. These weaker trends likely\nreflect the bursty nature of these Epoch of Reionisation galaxies, which can\nlead to a disconnect between their current star formation activity and SED\nprofiles, and their more extended star formation history. We discuss how strong\nemission lines, the cumulative effect of weak emission lines, dusty continua\nand AGN can all contribute to the photometric excess seen in the rest-frame\noptical, thus mimicking the signature of a Balmer break. Additional medium-band\nimaging will thus be essential to more robustly identify Balmer break galaxies.\nHowever, the Balmer break alone cannot serve as a definitive proxy for the\nstellar age of galaxies, being complexly dependent on the star formation\nhistory. Ultimately, deep NIRSpec continuum spectroscopy and MIRI imaging will\nprovide the strongest indirect constraints on the formation era of the first\ngalaxies in the Universe, thereby revealing when cosmic dawn breaks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:35:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Trussler","James A. A.",""],["Conselice","Christopher J.",""],["Adams","Nathan",""],["Austin","Duncan",""],["Ferreira","Leonardo",""],["Harvey","Tom",""],["Li","Qiong",""],["Vijayan","Aswin P.",""],["Wilkins","Stephen M.",""],["Windhorst","Rogier A.",""],["Bhatawdekar","Rachana",""],["Cheng","Cheng",""],["Coe","Dan",""],["Cohen","Seth H.",""],["Driver","Simon P.",""],["Frye","Brenda",""],["Grogin","Norman A.",""],["Hathi","Nimish",""],["Jansen","Rolf A.",""],["Koekemoer","Anton",""],["Marshall","Madeline A.",""],["Nonino","Mario",""],["Ortiz","Rafael",""],["Pirzkal","Nor",""],["Robotham","Aaron",""],["Ryan","Russell E.","Jr."],["D'Silva","Jordan C. J.",""],["Summers","Jake",""],["Tompkins","Scott",""],["Willmer","Christopher N. A.",""],["Yan","Haojing",""]]}
{"id":"2308.09666","submitter":"Katharina Senkalla","authors":"Katharina Senkalla, Genko Genov, Mathias H. Metsch, Petr Siyushev, and\n  Fedor Jelezko","title":"Germanium Vacancy in Diamond Quantum Memory Exceeding 20 ms","comments":"Corrected typo in figure 2a","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Negatively charged group IV defects in diamond show great potential as\nquantum network nodes due to their efficient spin-photon interface. However,\nreaching sufficiently long coherence times remains a challenge. In this work,\nwe demonstrate coherent control of germanium-vacancy center (GeV) at\nmillikelvin temperatures and extend its coherence time by several orders of\nmagnitude to more than 20 ms. We model the magnetic and amplitude noise as an\nOrnstein-Uhlenbeck process, reproducing the experimental results well. The\nutilized method paves the way to optimized coherence times of group IV defects\nin various experimental conditions and their successful applications in quantum\ntechnologies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:37:14 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:54:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Senkalla","Katharina",""],["Genov","Genko",""],["Metsch","Mathias H.",""],["Siyushev","Petr",""],["Jelezko","Fedor",""]]}
{"id":"2308.09667","submitter":"Suprovat Ghoshal","authors":"Suprovat Ghoshal, Euiwoong Lee","title":"On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained\n  CSPs","comments":"73 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A $\\mu$-constrained Boolean Max-CSP$(\\psi)$ instance is a Boolean Max-CSP\ninstance on predicate $\\psi:\\{0,1\\}^r \\to \\{0,1\\}$ where the objective is to\nfind a labeling of relative weight exactly $\\mu$ that maximizes the fraction of\nsatisfied constraints. In this work, we study the approximability of\nconstrained Boolean Max-CSPs via SDP hierarchies by relating the integrality\ngap of Max-CSP $(\\psi)$ to its $\\mu$-dependent approximation curve.\n  Formally, assuming the Small-Set Expansion Hypothesis, we show that it is\nNP-hard to approximate $\\mu$-constrained instances of Max-CSP($\\psi$) up to\nfactor ${\\sf Gap}_{\\ell,\\mu}(\\psi)/\\log(1/\\mu)^2$ (ignoring factors depending\non $r$) for any $\\ell \\geq \\ell(\\mu,r)$. Here, ${\\sf Gap}_{\\ell,\\mu}(\\psi)$ is\nthe optimal integrality gap of $\\ell$-round Lasserre relaxation for\n$\\mu$-constrained Max-CSP($\\psi$) instances.\n  Our results are derived by combining the framework of Raghavendra [STOC 2008]\nalong with more recent advances in rounding Lasserre relaxations and reductions\nfrom the Small-Set Expansion (SSE) problem. A crucial component of our\nreduction is a novel way of composing generic bias-dependent dictatorship tests\nwith SSE, which could be of independent interest.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:38:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ghoshal","Suprovat",""],["Lee","Euiwoong",""]]}
{"id":"2308.09668","submitter":"Mitali Bafna","authors":"Mitali Bafna, Dor Minzer","title":"Characterizing Direct Product Testing via Coboundary Expansion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A $d$-dimensional simplicial complex $X$ is said to support a direct product\ntester if any locally consistent function defined on its $k$-faces (where $k\\ll\nd$) necessarily come from a function over its vertices. More precisely, a\ndirect product tester has a distribution $\\mu$ over pairs of $k$-faces\n$(A,A')$, and given query access to $F\\colon X(k)\\to\\{0,1\\}^k$ it samples\n$(A,A')\\sim \\mu$ and checks that $F[A]|_{A\\cap A'} = F[A']|_{A\\cap A'}$. The\ntester should have (1) the \"completeness property\", meaning that any assignment\n$F$ which is a direct product assignment passes the test with probability $1$,\nand (2) the \"soundness property\", meaning that if $F$ passes the test with\nprobability $s$, then $F$ must be correlated with a direct product function.\n  Dinur and Kaufman showed that a sufficiently good spectral expanding complex\n$X$ admits a direct product tester in the \"high soundness\" regime where $s$ is\nclose to $1$. They asked whether there are high dimensional expanders that\nsupport direct product tests in the \"low soundness\", when $s$ is close to $0$.\n  We give a characterization of high-dimensional expanders that support a\ndirect product tester in the low soundness regime. We show that spectral\nexpansion is insufficient, and the complex must additionally satisfy a variant\nof coboundary expansion, which we refer to as Unique-Games coboundary\nexpanders. This property can be seen as a high-dimensional generalization of\nthe standard notion of coboundary expansion over non-Abelian groups for\n2-dimensional complexes. It asserts that any locally consistent Unique-Games\ninstance obtained using the low-level faces of the complex, must admit a good\nglobal solution.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:40:28 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bafna","Mitali",""],["Minzer","Dor",""]]}
{"id":"2308.09669","submitter":"Matthew Kirk","authors":"Matthew Kirk","title":"Cabibbo angle anomalies and a global fit to vector-like quarks","comments":"Prepared for the FPCP 2023 proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The most recent determinations of $V_{ud}$ from superallowed beta decays lead\nto a discrepancy when compared to the value implied by mesonic CKM measurements\ncombined with CKM unitarity. On top of this, improved precision in lattice QCD\ncalculations have revealed another discrepancy between the $V_{us}$\ndeterminations from kaon and pion semi-leptonic decays. The combination of\nthese can be referred to as the Cabibbo angle anomaly, which we find has a\nsignificance of around $3\\,\\sigma$. After summarising the current state of\nthese issues, I will talk about new physics models that modify semi-leptonic\ndecays as potential explanations, and why vector-like quarks in particular\nappear the most promising candidates. I will then discuss the results of a\nglobal fit to various vector-like quark models, and how other constraints are\nimportant in determining the most likely explanation. Finally I will touch on\nfuture experiments that could shed further light on the situation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:41:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kirk","Matthew",""]]}
{"id":"2308.09670","submitter":"Xiao-Gang Wen","authors":"Siu-Hung Ng and Eric C. Rowell and Xiao-Gang Wen","title":"Classification of modular data up to rank 11","comments":"443 pages (main text 64 pages), 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the computer algebraic system GAP to classify modular data up to rank\n11, and integral modular data up to rank 12. This extends the previously\nobtained classification of modular data up to rank 6. Our classification\nincludes all the modular data from modular tensor categories up to rank 11. But\nour list also contains a few potential unitary modular data at ranks 9, 10 and\n11, which are not known to correspond to any unitary modular tensor categories\n(such as those from Kac-Moody algebra, twisted quantum doubles of finite group,\nas well as their Abelian anyon condensations). It remains to be shown if those\npotential modular data can be realized by modular tensor categories or not,\nalthough we provide some evidence that all but one may be constructed from\ncenters of near-group categories. The classification of modular data\ncorresponds to a classification of modular tensor categories (up to modular\nisotopes which are not expected to be present at low ranks). The classification\nof modular tensor categories leads to a classification of gapped quantum phases\nof matter in 2-dimensional space for bosonic lattice systems with no symmetry,\nas well as a classification of generalized symmetries in 1-dimensional space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:41:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ng","Siu-Hung",""],["Rowell","Eric C.",""],["Wen","Xiao-Gang",""]]}
{"id":"2308.09671","submitter":"Peter Garst","authors":"Peter Garst, Reeve Ingle, and Yasuhisa Fujii","title":"OCR Language Models with Custom Vocabularies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Language models are useful adjuncts to optical models for producing accurate\noptical character recognition (OCR) results. One factor which limits the power\nof language models in this context is the existence of many specialized domains\nwith language statistics very different from those implied by a general\nlanguage model - think of checks, medical prescriptions, and many other\nspecialized document classes. This paper introduces an algorithm for\nefficiently generating and attaching a domain specific word based language\nmodel at run time to a general language model in an OCR system. In order to\nbest use this model the paper also introduces a modified CTC beam search\ndecoder which effectively allows hypotheses to remain in contention based on\npossible future completion of vocabulary words. The result is a substantial\nreduction in word error rate in recognizing material from specialized domains.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:46:11 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Garst","Peter",""],["Ingle","Reeve",""],["Fujii","Yasuhisa",""]]}
{"id":"2308.09672","submitter":"Mark Sellke","authors":"Brice Huang, Mark Sellke","title":"Optimization Algorithms for Multi-Species Spherical Spin Glasses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.dis-nn math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper develops approximate message passing algorithms to optimize\nmulti-species spherical spin glasses. We first show how to efficiently achieve\nthe algorithmic threshold energy identified in our companion work, thus\nconfirming that the Lipschitz hardness result proved therein is tight. Next we\ngive two generalized algorithms which produce multiple outputs and show all of\nthem are approximate critical points. Namely, in an $r$-species model we\nconstruct $2^r$ approximate critical points when the external field is stronger\nthan a \"topological trivialization\" phase boundary, and exponentially many such\npoints in the complementary regime. We also compute the local behavior of the\nHamiltonian around each. These extensions are relevant for another companion\nwork on topological trivialization of the landscape.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:46:42 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Brice",""],["Sellke","Mark",""]]}
{"id":"2308.09673","submitter":"Rebecca Erbanni","authors":"Rebecca Erbanni, Antonios Varvitsiotis, Dario Poletti","title":"Competitive and imbalanced turn-based many-body quantum games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a class of games between two competing players that take turns\nacting on the same many-body quantum register. Each player can perform unitary\noperations on the register, and after each one of them acts on the register the\nenergy is measured. Player A aims to maximize the energy while player B to\nminimize it. This class of zero-sum games has a clear second mover advantage if\nboth players can entangle the same portion of the register. We show, however,\nthat if the first player can entangle a larger number of qubits than the second\nplayer (which we refer to as having quantum advantage), then the second mover\nadvantage can be significantly reduced. We study the game for different types\nof quantum advantage of player A versus player B and for different sizes of the\nregister, in particular, scenarios in which absolutely maximally entangled\nstates cannot be achieved. In this case, we also study the effectiveness of\nusing random unitaries. Last, we consider mixed initial preparations of the\nregister, in which case the player with a quantum advantage can rely on\nstrategies stemming from the theory of ergotropy of quantum batteries.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:49:34 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Erbanni","Rebecca",""],["Varvitsiotis","Antonios",""],["Poletti","Dario",""]]}
{"id":"2308.09674","submitter":"Jinyeop Lee","authors":"Riccardo Adami, Jinyeop Lee","title":"Microscopic derivation of a Schr\\\"odinger equation in dimension one with\n  a nonlinear point interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive an effective equation for the dynamics of many identical bosons in\ndimension one, in the presence of a tiny impurity. The interaction between\nevery pair of bosons is mediated by the impurity through a three-body\ninteraction. Assuming a simultaneous mean-field and short-range scaling, with\nthe short-range proceeding slower than the mean-field, and choosing an initial\nfully condensed state, we prove propagation of chaos and obtain an effective\none-particle Schr\\\"odinger equation with a nonlinearity concentrated at a\npoint. More precisely, we prove convergence of one-particle density operators\nin the trace-class topology, and estimate the fluctuations as superexponential.\nThis is the first derivation of the so-called nonlinear delta model, widely\ninvestigated in the last decades.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:52:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Adami","Riccardo",""],["Lee","Jinyeop",""]]}
{"id":"2308.09675","submitter":"Aran Mohammad","authors":"Aran Mohammad, Hendrik Muscheid, Moritz Schappler, Thomas Seel","title":"Quantifying Uncertainties of Contact Classifications in a Human-Robot\n  Collaboration with Parallel Robots","comments":"Accepted preprint for International Workshop on Human-Friendly\n  Robotics (HFR) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In human-robot collaboration, unintentional physical contacts occur in the\nform of collisions and clamping, which must be detected and classified\nseparately for a reaction. If certain collision or clamping situations are\nmisclassified, reactions might occur that make the true contact case more\ndangerous. This work analyzes data-driven modeling based on physically modeled\nfeatures like estimated external forces for clamping and collision\nclassification with a real parallel robot. The prediction reliability of a\nfeedforward neural network is investigated. Quantification of the\nclassification uncertainty enables the distinction between safe versus\nunreliable classifications and optimal reactions like a retraction movement for\ncollisions, structure opening for the clamping joint, and a fallback reaction\nin the form of a zero-g mode. This hypothesis is tested with experimental data\nof clamping and collision cases by analyzing dangerous misclassifications and\nthen reducing them by the proposed uncertainty quantification. Finally, it is\ninvestigated how the approach of this work influences correctly classified\nclamping and collision scenarios.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:53:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mohammad","Aran",""],["Muscheid","Hendrik",""],["Schappler","Moritz",""],["Seel","Thomas",""]]}
{"id":"2308.09676","submitter":"Brendon Madison","authors":"Brendon Madison","title":"Using the GP2X framework for center-of-mass energy precision studies at\n  $e^+e^-$ Higgs factories","comments":"16 pages, 8 figures, 2 tables, LCWS 2023 Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Two channels for measuring the absolute center-of-mass energy, $\\sqrt{s}$,\nand collision beam energies, $E_-$ and $E_+$, are investigated for future\n$e^+e^-$ Higgs factories. These two channels of DiMuons and Bhabhas are\nsimulated in event generators and a new fast Monte Carlo, GP2X, has been\ndeveloped to boost the events into the lab frame, and thus include luminosity\nspectrum effects from beamstrahlung and beam energy spread. GP2X also includes\ntracker and ECAL detector resolution effects. The performance of GP2X with\nWHIZARD, as GP2WHIZ, is found to be statistically consistent with iLCSoft while\nGP2X with KKMC, as GP2KKMC, is consistent within 3\\%. We use the design concept\nfor the ILC at $\\sqrt{s}=250$~GeV and ILD. Taking advantage of ILD's\nhigh-precision tracker we find precision near the 1-10 MeV level for all of\n$\\sqrt{s}$ , $E_{\\pm}$ for a 100~$\\text{fb}^{-1}$ dataset. This is done using a\nnew six parameter Beta distribution convolved with Gaussian fit. A Fourier\ntransform deconvolution method with Savitzky-Golay filtering is used to improve\nthe fitting of detector level data. Feasibility of these measurements will\ndepend on future studies and detector calibration.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:55:14 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Madison","Brendon",""]]}
{"id":"2308.09677","submitter":"Brice Huang","authors":"Brice Huang, Mark Sellke","title":"Strong Topological Trivialization of Multi-Species Spherical Spin\n  Glasses","comments":"57 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.dis-nn math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the landscapes of multi-species spherical spin glasses. Our results\ndetermine the phase boundary for annealed trivialization of the number of\ncritical points, and establish its equivalence with a quenched \\emph{strong\ntopological trivialization} property. Namely in the \"trivial\" regime, the\nnumber of critical points is constant, all are well-conditioned, and all\napproximate critical points are close to a true critical point. As a\nconsequence, we deduce that Langevin dynamics at sufficiently low temperature\nhas logarithmic mixing time.\n  Our approach begins with the Kac--Rice formula. We derive closed form\nexpressions for some asymptotic determinants studied in (Ben\nArous-Bourgade-McKenna 2023, McKenna 2021), and characterize the annealed\ntrivialization phase by explicitly solving a suitable multi-dimensional\nvariational problem. To obtain more precise quenched results, we develop\ngeneral purpose techniques to avoid sub-exponential correction factors and show\nnon-existence of \\emph{approximate} critical points. Many of the results are\nnew even in the $1$-species case.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:56:19 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Huang","Brice",""],["Sellke","Mark",""]]}
{"id":"2308.09678","submitter":"Zhi-Qi Cheng","authors":"Hanbing Liu, Jun-Yan He, Zhi-Qi Cheng, Wangmeng Xiang, Qize Yang,\n  Wenhao Chai, Gaoang Wang, Xu Bao, Bin Luo, Yifeng Geng, Xuansong Xie","title":"PoSynDA: Multi-Hypothesis Pose Synthesis Domain Adaptation for Robust 3D\n  Human Pose Estimation","comments":"Accepted to ACM Multimedia 2023; 10 pages, 4 figures, 8 tables; the\n  code is at https://github.com/hbing-l/PoSynDA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current 3D human pose estimators face challenges in adapting to new\ndatasets due to the scarcity of 2D-3D pose pairs in target domain training\nsets. We present the \\textit{Multi-Hypothesis \\textbf{P}ose \\textbf{Syn}thesis\n\\textbf{D}omain \\textbf{A}daptation} (\\textbf{PoSynDA}) framework to overcome\nthis issue without extensive target domain annotation. Utilizing a\ndiffusion-centric structure, PoSynDA simulates the 3D pose distribution in the\ntarget domain, filling the data diversity gap. By incorporating a\nmulti-hypothesis network, it creates diverse pose hypotheses and aligns them\nwith the target domain. Target-specific source augmentation obtains the target\ndomain distribution data from the source domain by decoupling the scale and\nposition parameters. The teacher-student paradigm and low-rank adaptation\nfurther refine the process. PoSynDA demonstrates competitive performance on\nbenchmarks, such as Human3.6M, MPI-INF-3DHP, and 3DPW, even comparable with the\ntarget-trained MixSTE model~\\cite{zhang2022mixste}. This work paves the way for\nthe practical application of 3D human pose estimation. The code is available at\nhttps://github.com/hbing-l/PoSynDA.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:57:25 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Liu","Hanbing",""],["He","Jun-Yan",""],["Cheng","Zhi-Qi",""],["Xiang","Wangmeng",""],["Yang","Qize",""],["Chai","Wenhao",""],["Wang","Gaoang",""],["Bao","Xu",""],["Luo","Bin",""],["Geng","Yifeng",""],["Xie","Xuansong",""]]}
{"id":"2308.09679","submitter":"Asher Roberts","authors":"Asher Roberts","title":"The Rate of Convergence for Selberg's Central Limit Theorem under the\n  Riemann Hypothesis","comments":"This paper is submitted to the the Proceedings of CANT 2023. 13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We assume the Riemann hypothesis to improve upon the rate of convergence of\n$(\\log\\log\\log T)^2/\\sqrt{\\log\\log T}$ in Selberg's central limit theorem for\n$\\log|\\zeta(1/2+it)|$ given by the author. We achieve a rate of convergence of\n$\\sqrt{\\log\\log\\log\\log T}/\\sqrt{\\log\\log T}$ in the Dudley distance. The proof\nis an adaptation of the techniques used by the author, based on the work of\nRadziwill and Soundararajan and Arguin et al., combined with a lemma of Selberg\nthat provides for a mollifier close to the critical line\n$\\operatorname{Re}(s)=1/2$ under the Riemann hypothesis.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:58:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Roberts","Asher",""]]}
{"id":"2308.09680","submitter":"Kacper Grzelakowski","authors":"Kacper Grzelakowski","title":"Number of triple points on complete intersection Calabi-Yau threefolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We discuss bounds for the number of ordinary triple points on complete\nintersection Calabi-Yau threefolds in projective spaces and for Calabi-Yau\nthreefolds in weighted projective spaces. In particular, we show that in P5 the\nintersection of a quadric and a quartic cannot have more than 10 ordinary\ntriple points. We provide examples of complete intersection Calabi-Yau\nthreefolds with multiple triple points. We obtain the exact bound for a sextic\nhypersurface in P[1 : 1 : 1 : 1 : 2], which is 10. We also discuss Calabi-Yau\nthreefolds that cannot admit triple points.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:04:58 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Grzelakowski","Kacper",""]]}
{"id":"2308.09681","submitter":"Deepak Pachattu","authors":"Deepak Pachattu","title":"Sequential decays of the triple strange process $\\bar{p} p \\rightarrow\n  \\bar{\\Omega}^{+} \\Omega^{-} \\rightarrow K^{+} \\bar{\\Lambda} K^{-} \\Lambda\n  \\rightarrow K^{+} \\bar{p} \\pi^{+} K^{-} p \\pi^{-}$: a model-independent\n  approach","comments":"12 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A model-independent irreducible tensor formalism is developed to analyse\n$\\bar{\\Omega}\\Omega$ production in $\\bar{p}p$ collisions and its subsequent\ndecay via the triple-strange decay process, $\\bar{\\Omega}^{+} \\Omega^{-}\n\\rightarrow K^{+} \\bar{\\Lambda} K^{-} \\Lambda \\rightarrow K^{+} \\bar{p} \\pi^{+}\nK^{-} p \\pi^{-}$. These processes are relevant for the upcoming experiments at\nPANDA. We not only provide expressions for the density matrix of the\n$\\Omega\\bar{\\Omega}$ system but also for the products at each stage of the\ndecay. The Fano statistical tensors so obtained not only completely\ncharacterize the relevant final systems but also provide expressions for joint\nangular distributions. Finally, we show which of the Fano statistical tensors\ncharacterizing the $\\bar{\\Omega}\\Omega$ system can be inferred from the Fano\nstatistical tensors characterizing the final $\\bar{p}p$ system, wherein we also\nobtain the relation between the production cross sections for\n$\\Omega\\bar{\\Omega}$ and the final $p\\bar{p}$ system.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:08:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Pachattu","Deepak",""]]}
{"id":"2308.09682","submitter":"Marco Seiz","authors":"Marco Seiz, Henrik Hierl, Britta Nestler, Wolfgang Rheinheimer","title":"Revealing process and material parameter effects on densification via\n  phase-field studies","comments":"24 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sintering is an important processing step in both ceramics and metals\nprocessing. The microstructure resulting from this process determines many\nmaterials properties of interest. Hence the accurate prediction of the\nmicrostructure, depending on processing and materials parameters, is of great\nimportance. The phase-field method offers a way of predicting this\nmicrostructural evolution on a mesoscopic scale. The present paper employs this\nmethod to investigate concurrent densification and grain growth and the\ninfluence of stress on densification. Furthermore, the method is applied to\nsimulate the entire freeze-casting process chain for the first time ever by\nsimulating the freezing and sintering processes separately and passing the\nfrozen microstructure to the present sintering model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:09:18 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Seiz","Marco",""],["Hierl","Henrik",""],["Nestler","Britta",""],["Rheinheimer","Wolfgang",""]]}
{"id":"2308.09683","submitter":"Xiaoyu Chen","authors":"Xiaoyu Chen, Xinyuan Zhang and Zongrui Zou","title":"Sampling from Network Reliability in Near-linear Time","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 give a $\\widetilde{O}(n)$ time sampler for independent sets of a matroid\nwith $n$ elements. As an application, there is a near-linear time sampler for\nthe all-terminal network reliability.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:10:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Chen","Xiaoyu",""],["Zhang","Xinyuan",""],["Zou","Zongrui",""]]}
{"id":"2308.09684","submitter":"Alex Takeda","authors":"Manuel Rivera, Alex Takeda and Zhengfang Wang","title":"Algebraic string topology from the neighborhood of infinity","comments":"49 pages + Appendix. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct and study an algebraic analogue of the loop coproduct in string\ntopology, also known as the Goresky-Hingston coproduct. Our algebraic setup,\nwhich under this analogy takes the place of the complex of chains on the free\nloop space of a possibly non-simply connected manifold, is the Hochschild chain\ncomplex of a smooth $A_{\\infty}$-category equipped with a pre-Calabi-Yau\nstructure and a trivialization of a version of the Chern character. Our\nalgebraic analogue of the loop coproduct is part of a more general mapping cone\nconstruction, which we describe in terms of Efimov's categorical formal\npunctured neighborhood of infinity. We use the graphical formalism developed by\nKontsevich, Takeda, and Vlassopoulos to describe explicit models for the\noperations and homotopies involved. We compute explicitly this algebraic\ncoproduct in the context of string topology of spheres.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:12:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Rivera","Manuel",""],["Takeda","Alex",""],["Wang","Zhengfang",""]]}
{"id":"2308.09685","submitter":"Michael Joannou","authors":"Michael Joannou, Pia Rotshtein, Uta Noppeney","title":"Audiovisual Moments in Time: A Large-Scale Annotated Dataset of\n  Audiovisual Actions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.MM cs.SD eess.AS","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present Audiovisual Moments in Time (AVMIT), a large-scale dataset of\naudiovisual action events. In an extensive annotation task 11 participants\nlabelled a subset of 3-second audiovisual videos from the Moments in Time\ndataset (MIT). For each trial, participants assessed whether the labelled\naudiovisual action event was present and whether it was the most prominent\nfeature of the video. The dataset includes the annotation of 57,177 audiovisual\nvideos, each independently evaluated by 3 of 11 trained participants. From this\ninitial collection, we created a curated test set of 16 distinct action\nclasses, with 60 videos each (960 videos). We also offer 2 sets of pre-computed\naudiovisual feature embeddings, using VGGish/YamNet for audio data and\nVGG16/EfficientNetB0 for visual data, thereby lowering the barrier to entry for\naudiovisual DNN research. We explored the advantages of AVMIT annotations and\nfeature embeddings to improve performance on audiovisual event recognition. A\nseries of 6 Recurrent Neural Networks (RNNs) were trained on either\nAVMIT-filtered audiovisual events or modality-agnostic events from MIT, and\nthen tested on our audiovisual test set. In all RNNs, top 1 accuracy was\nincreased by 2.71-5.94\\% by training exclusively on audiovisual events, even\noutweighing a three-fold increase in training data. We anticipate that the\nnewly annotated AVMIT dataset will serve as a valuable resource for research\nand comparative experiments involving computational models and human\nparticipants, specifically when addressing research questions where audiovisual\ncorrespondence is of critical importance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:13:45 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Joannou","Michael",""],["Rotshtein","Pia",""],["Noppeney","Uta",""]]}
{"id":"2308.09686","submitter":"Cem Murat Ayber","authors":"Cem Murat Ayber and Seyda Ipek","title":"A Hybrid Type I + III Inverse Seesaw Mechanism in $U(1)_{R-L}$-symmetric\n  MSSM","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that, in a $U(1)_{R-L}$-symmetric supersymmetric model, the\npseudo-Dirac bino and wino can give rise to three light neutrino masses through\neffective operators, generated at the messenger scale between a SUSY breaking\nhidden sector and the visible sector. The neutrino-bino/wino mixing follows a\nhybrid type I+III inverse seesaw pattern. The light neutrino masses are\ngoverned by the ratio of the $U(1)_{R-L}$-breaking gravitino mass, $m_{3/2}$,\nand the messenger scale $\\Lambda_M$. The charged component of the\n$SU(2)_L$-triplet, here the lightest charginos, mix with the charged leptons\nand generate flavor-changing neutral currents at tree level. We find that\nresulting lepton flavor violating observables yield a lower bound on the\nmessenger scale, $\\Lambda_M \\gtrsim (500-1000)~{\\rm TeV}$ for a simplified\nhybrid mixing scenario. We identify interesting mixing structures for certain\n$U(1)_{R-L}$-breaking singlino/tripletino Majorana masses. For example, in some\nparameter regimes, bino or wino has no mixing with the electron neutrino. We\nalso describe the rich collider phenomenology expected in this neutrino-mass\ngeneration mechanism.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:17:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Ayber","Cem Murat",""],["Ipek","Seyda",""]]}
{"id":"2308.09687","submitter":"Maciej Besta","authors":"Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Lukas\n  Gianinazzi, Joanna Gajda, Tomasz Lehmann, Michal Podstawski, Hubert\n  Niewiadomski, Piotr Nyczyk, Torsten Hoefler","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce Graph of Thoughts (GoT): a framework that advances prompting\ncapabilities in large language models (LLMs) beyond those offered by paradigms\nsuch as Chain-of-Thought or Tree of Thoughts (ToT). The key idea and primary\nadvantage of GoT is the ability to model the information generated by an LLM as\nan arbitrary graph, where units of information (\"LLM thoughts\") are vertices,\nand edges correspond to dependencies between these vertices. This approach\nenables combining arbitrary LLM thoughts into synergistic outcomes, distilling\nthe essence of whole networks of thoughts, or enhancing thoughts using feedback\nloops. We illustrate that GoT offers advantages over state of the art on\ndifferent tasks, for example increasing the quality of sorting by 62% over ToT,\nwhile simultaneously reducing costs by >31%. We ensure that GoT is extensible\nwith new thought transformations and thus can be used to spearhead new\nprompting schemes. This work brings the LLM reasoning closer to human thinking\nor brain mechanisms such as recurrence, both of which form complex networks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:29:23 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 10:51:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Besta","Maciej",""],["Blach","Nils",""],["Kubicek","Ales",""],["Gerstenberger","Robert",""],["Gianinazzi","Lukas",""],["Gajda","Joanna",""],["Lehmann","Tomasz",""],["Podstawski","Michal",""],["Niewiadomski","Hubert",""],["Nyczyk","Piotr",""],["Hoefler","Torsten",""]]}
{"id":"2308.09688","submitter":"Anlaug Amanda Djupvik","authors":"V.P. Grinin, L.V. Tambovtseva, A.A. Djupvik, G. Gahm, T. Grenman, H.\n  Weber, H. Bengtsson, H. De Angelis, G. Duszanowicz, D. Heinonen, G. Holmberg,\n  T. Karlsson, M. Larsson, J. Warell, T. Wikander","title":"Modelling UX Ori Star Eclipses based on Spectral Observations with the\n  Nordic Optical Telescope. I. RR Tau","comments":"16 pages, 17 figures","journal-ref":"MNRAS 2023, 524, 4047","doi":"10.1093/mnras/stad2108","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on observations obtained with the Nordic Optical Telescope we\ninvestigate the spectral variability of the Herbig Ae star RR Tau. This star\nbelongs to the UX Ori family, characterized by very deep fadings caused by the\nscreening of the star with opaque fragments (clouds) of the protoplanetary\ndiscs. At the moments of such minima one observes strong spectral variability\ndue to the fact that the dust cloud occults, for an observer, not only the star\nbut also a part of the region where the emission spectrum originates. We\ncalculated a series of obscuration models to interpret the observed variability\nof the H-alpha line parameters. We consider two main obscuration scenarios: (1)\nthe dust screen rises vertically above the circumstellar disc, and (2) the\nscreen intersects the line-of-sight moving azimuthally with the disc. In both\ncases the model of the emission region consists of a compact magnetosphere and\na magneto-centrifugal disc wind. Comparison with observations shows that the\nfirst scenario explains well the variability of the radiation flux, the\nequivalent width, as well as the asymmetry of the H-alpha line during eclipses,\nwhile the second scenario explains them only partly. This permits us to suggest\nthat in the case of RR Tau, the main causes of the eclipses are either a\nstructured disc wind, or the charged dust lifted along the field lines of the\npoloidal component of the magnetic field of the circumstellar disc.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:29:49 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Grinin","V. P.",""],["Tambovtseva","L. V.",""],["Djupvik","A. A.",""],["Gahm","G.",""],["Grenman","T.",""],["Weber","H.",""],["Bengtsson","H.",""],["De Angelis","H.",""],["Duszanowicz","G.",""],["Heinonen","D.",""],["Holmberg","G.",""],["Karlsson","T.",""],["Larsson","M.",""],["Warell","J.",""],["Wikander","T.",""]]}
{"id":"2308.09689","submitter":"Yair Augusto Gutierrez Fosado","authors":"Giorgia Palombo, Simon Weir, Davide Michieletto and Yair Augusto\n  Gutierrez Fosado","title":"Topological Elasticity in Physical Gels with Limited Valence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the connection between a material's microscopic network\ntopology and its macroscopic properties is a fundamental open challenge across\na wide range of physical systems. Here, we investigate the elasticity of DNA\nnanostar hydrogels - a model system for networks with limited valence - by\ncoupling rheology measurements, confocal imaging and molecular dynamics\nsimulations. We discover that these networks display a large degree of\ninterpenetration and that loops within the network are topologically linked,\nforming a percolating network-within-network structure. Strikingly, we discover\nthat the onset of topological links between shortest loops fully determines the\nelasticity of these physical gels. We thus argue that the elasticity of limited\nvalence gels is not dictated by their fractal microstructure, but by the\ntopology of looped motifs. Our findings highlight the emergence of \"topological\nelasticity\" as a previously overlooked mechanism in generic network-forming\nliquids and physical gels and will inspire the design of\ntopologically-controllable material behaviours.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:33:20 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Palombo","Giorgia",""],["Weir","Simon",""],["Michieletto","Davide",""],["Fosado","Yair Augusto Gutierrez",""]]}
{"id":"2308.09690","submitter":"Zhengchao Wan","authors":"Alexander Cloninger, Gal Mishne, Andreas Oslandsbotn, Sawyer Jack\n  Robertson, Zhengchao Wan, and Yusu Wang","title":"Random Walks, Conductance, and Resistance for the Connection Graph\n  Laplacian","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the concept of effective resistance in connection graphs,\nexpanding its traditional application from undirected graphs. We propose a\nrobust definition of effective resistance in connection graphs by focusing on\nthe duality of Dirichlet-type and Poisson-type problems on connection graphs.\nAdditionally, we delve into random walks, taking into account both node\ntransitions and vector rotations. This approach introduces novel concepts of\neffective conductance and resistance matrices for connection graphs, capturing\nmean rotation matrices corresponding to random walk transitions. Thereby, it\nprovides new theoretical insights for network analysis and optimization.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:37:39 GMT"},{"version":"v2","created":"Mon, 21 Aug 2023 01:24:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cloninger","Alexander",""],["Mishne","Gal",""],["Oslandsbotn","Andreas",""],["Robertson","Sawyer Jack",""],["Wan","Zhengchao",""],["Wang","Yusu",""]]}
{"id":"2308.09691","submitter":"Mahmoud Yaseen Mr.","authors":"Mahmoud Yaseen, Dewen Yushu, Peter German and Xu Wu","title":"Reduced Order Modeling of a MOOSE-based Advanced Manufacturing Model\n  with Operator Learning","comments":"10 Pages, 7 Figures, 2 Tables. arXiv admin note: text overlap with\n  arXiv:2308.02462","journal-ref":"In Proceedings of the 2023 International Conference on Mathematics\n  and Computational Methods Applied to Nuclear Science and Engineering (M&C\n  2023)","doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advanced Manufacturing (AM) has gained significant interest in the nuclear\ncommunity for its potential application on nuclear materials. One challenge is\nto obtain desired material properties via controlling the manufacturing process\nduring runtime. Intelligent AM based on deep reinforcement learning (DRL)\nrelies on an automated process-level control mechanism to generate optimal\ndesign variables and adaptive system settings for improved end-product\nproperties. A high-fidelity thermo-mechanical model for direct energy\ndeposition has recently been developed within the MOOSE framework at the Idaho\nNational Laboratory (INL). The goal of this work is to develop an accurate and\nfast-running reduced order model (ROM) for this MOOSE-based AM model that can\nbe used in a DRL-based process control and optimization method. Operator\nlearning (OL)-based methods will be employed due to their capability to learn a\nfamily of differential equations, in this work, produced by changing process\nvariables in the Gaussian point heat source for the laser. We will develop\nOL-based ROM using Fourier neural operator, and perform a benchmark comparison\nof its performance with a conventional deep neural network-based ROM.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:38:00 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yaseen","Mahmoud",""],["Yushu","Dewen",""],["German","Peter",""],["Wu","Xu",""]]}
{"id":"2308.09692","submitter":"Kazuo Yamazaki","authors":"Kazuo Yamazaki","title":"Remarks on the two-dimensional magnetohydrodynamics system forced by\n  space-time white noise","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":"  We study the two-dimensional magnetohydrodynamics system forced by space-time\nwhite noise. Due to a lack of an explicit invariant measure, the approach of Da\nPrato and Debussche (2002, J. Funct. Anal., \\textbf{196}, pp. 180--210) on the\nNavier-Stokes equations does not seem to fit. We follow instead the approach of\nHairer and Rosati (2023, arXiv:2301.11059 [math.PR]), take advantage of the\nstructure of Maxwell's equation, such as anti-symmetry, to find an appropriate\nparacontrolled ansatz and many crucial cancellations, and prove the\nglobal-in-time existence and uniqueness of its solution.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:38:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yamazaki","Kazuo",""]]}
{"id":"2308.09693","submitter":"Harry Dong","authors":"Harry Dong, Sean Donegan, Megna Shah, Yuejie Chi","title":"A Lightweight Transformer for Faster and Robust EBSD Data Collection","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":"  Three dimensional electron back-scattered diffraction (EBSD) microscopy is a\ncritical tool in many applications in materials science, yet its data quality\ncan fluctuate greatly during the arduous collection process, particularly via\nserial-sectioning. Fortunately, 3D EBSD data is inherently sequential, opening\nup the opportunity to use transformers, state-of-the-art deep learning\narchitectures that have made breakthroughs in a plethora of domains, for data\nprocessing and recovery. To be more robust to errors and accelerate this 3D\nEBSD data collection, we introduce a two step method that recovers missing\nslices in an 3D EBSD volume, using an efficient transformer model and a\nprojection algorithm to process the transformer's outputs. Overcoming the\ncomputational and practical hurdles of deep learning with scarce high\ndimensional data, we train this model using only synthetic 3D EBSD data with\nself-supervision and obtain superior recovery accuracy on real 3D EBSD data,\ncompared to existing methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:41:39 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dong","Harry",""],["Donegan","Sean",""],["Shah","Megna",""],["Chi","Yuejie",""]]}
{"id":"2308.09694","submitter":"Xuanyu Yi","authors":"Xuanyu Yi, Jiajun Deng, Qianru Sun, Xian-Sheng Hua, Joo-Hwee Lim,\n  Hanwang Zhang","title":"Invariant Training 2D-3D Joint Hard Samples for Few-Shot Point Cloud\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":"  We tackle the data scarcity challenge in few-shot point cloud recognition of\n3D objects by using a joint prediction from a conventional 3D model and a\nwell-trained 2D model. Surprisingly, such an ensemble, though seems trivial,\nhas hardly been shown effective in recent 2D-3D models. We find out the crux is\nthe less effective training for the ''joint hard samples'', which have high\nconfidence prediction on different wrong labels, implying that the 2D and 3D\nmodels do not collaborate well. To this end, our proposed invariant training\nstrategy, called InvJoint, does not only emphasize the training more on the\nhard samples, but also seeks the invariance between the conflicting 2D and 3D\nambiguous predictions. InvJoint can learn more collaborative 2D and 3D\nrepresentations for better ensemble. Extensive experiments on 3D shape\nclassification with widely adopted ModelNet10/40, ScanObjectNN and Toys4K, and\nshape retrieval with ShapeNet-Core validate the superiority of our InvJoint.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:43:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yi","Xuanyu",""],["Deng","Jiajun",""],["Sun","Qianru",""],["Hua","Xian-Sheng",""],["Lim","Joo-Hwee",""],["Zhang","Hanwang",""]]}
{"id":"2308.09695","submitter":"Mintu Mondal Dr","authors":"Satyabrata Bera, Sudipta Chatterjee, Subhadip Pradhan, Suman Kalyan\n  Pradhan, Sk Kalimuddin, Arnab Bera, Ashis K. Nandy, and Mintu Mondal","title":"Anomalous Hall effect induced by Berry curvature in topological\n  nodal-line van der Waals ferromagnet Fe$_4$GeTe$_2$","comments":"7 pages, 4 figures, supplementary","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exploration of nontrivial transport phenomena associated with the\ninterplay between magnetic order and spin-orbit coupling (SOC), particularly in\nvan der Waals (vdW) systems has gained a resurgence of interest due to their\neasy exfoliation, ideal for two-dimensional (2D) spintronics. We report the\nnear room temperature quasi-2D ferromagnet, Fe$_4$GeTe$_2$ from the iron-based\nvdW family (Fe$_n$GeTe$_2$, $n$=3,4,5), exhibiting a large anomalous Hall\nconductivity (AHC), $\\sigma^A_{xy}$ $\\sim$ 490 $\\Omega^{-1}\\textrm{cm}^{-1}$ at\n2 K. The near quadratic behavior of anomalous Hall resistivity\n($\\rho^{A}_{xy}$) with the longitudinal resistivity ($\\rho_{xx}$) suggests that\na dominant AHC contribution is coming from an intrinsic Berry curvature (BC)\nmechanism. Concomitantly, the electronic structure calculations reveal a large\nBC arising from SOC induced gaped nodal lines around the Fermi level, governing\nsuch large AHC property. Moreover, we also report an exceptionally large\nanomalous Hall angle ($\\simeq$ 10.6\\%) and Hall factor ($\\simeq$ 0.22 V$^{-1}$)\nvalues which so far, are the largest in compared to those for other members in\nthis vdW family.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:43:22 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Bera","Satyabrata",""],["Chatterjee","Sudipta",""],["Pradhan","Subhadip",""],["Pradhan","Suman Kalyan",""],["Kalimuddin","Sk",""],["Bera","Arnab",""],["Nandy","Ashis K.",""],["Mondal","Mintu",""]]}
{"id":"2308.09696","submitter":"Reza Nikandish","authors":"E. Dodongeh, A. Moussavi, R. Nikandish","title":"Metric and strong metric dimension in inclusion ideal graphs of\n  commutative rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inclusion ideal graph of a commutative unitary ring $R$ is the\n(undirected) graph $In(R)$ whose vertices all non-trivial ideals of $R$ and two\ndistinct vertices are adjacent if and only if one of them is a proper subset of\nthe other one. In this paper, the metric dimension of $In(R)$ is discussed.\nMoreover, the structure of the resolving graph of $In(R)$ is characterized and\nas an application, we compute the strong metric dimension of $In(R)$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:45:08 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Dodongeh","E.",""],["Moussavi","A.",""],["Nikandish","R.",""]]}
{"id":"2308.09697","submitter":"Yang Zhang","authors":"Cheng Xu, Jiangxu Li, Yong Xu, Zhen Bi, Yang Zhang","title":"Maximally Localized Wannier Orbitals, Interaction Models and Fractional\n  Quantum Anomalous Hall Effect in Twisted Bilayer MoTe2","comments":"12 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":"  We investigate the moir\\'e band structures and the strong correlation effects\nin twisted bilayer MoTe$_2$ for a wide range of twist angles, employing a\ncombination of various techniques. Using large-scale first principles\ncalculations, we pinpoint realistic continuum modeling parameters, subsequently\nderiving the maximally localized Wannier functions for the top three moir\\'e\nbands. Simplifying our model with reasonable assumptions, we obtain a minimal\ntwo-band model, encompassing Coulomb repulsion, correlated hopping, and spin\nexchange. Our minimal interaction models pave the way for further exploration\nof the rich many-body physics in twisted MoTe$_2$. Furthermore, we explore the\nphase diagrams of the system through Hartree-Fock approximation and exact\ndiagonalization. Our two-band exact diagonalization analysis underscores\nsignificant band-mixing effects in this system, which enlarge the optimal twist\nangle for fractional quantum anomalous Hall states.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:45:15 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xu","Cheng",""],["Li","Jiangxu",""],["Xu","Yong",""],["Bi","Zhen",""],["Zhang","Yang",""]]}
{"id":"2308.09698","submitter":"Rong-Qiang He","authors":"Yi-Heng Tian, Yin Chen, Jia-Ming Wang, Rong-Qiang He, and Zhong-Yi Lu","title":"Correlation Effects and Concomitant Two-Orbital $s_\\pm$-Wave\n  Superconductivity in La$_3$Ni$_2$O$_7$ under High Pressure","comments":"5 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":"  Possible high-$T_c$ superconductivity (SC) has been found experimentally in\nthe bilayer material La$_3$Ni$_2$O$_7$ under high pressure recently, in which\nthe Ni-$3d_{3z^2-r^2}$ and $3d_{x^2-y^2}$ orbitals are expected to play a key\nrole in the electronic structure and the SC. Here we study the two-orbital\nelectron correlations and the nature of the SC using the bilayer two-orbital\nHubbard model downfolded from the band structure of La3Ni2O7 in the framework\nof the dynamical mean-field theory. We find that each of the two orbitals forms\n$s_\\pm$-wave SC pairing. Because of the nonlocal inter-orbital hoppings, the\ntwo-orbital SCs are concomitant and they transition to Mott insulating states\nsimultaneously when tuning the system to half filling. The Hund's coupling\ninduced local inter-orbital spin coupling enhances the electron correlations\npronouncedly and is crucial to the SC.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:45:43 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Tian","Yi-Heng",""],["Chen","Yin",""],["Wang","Jia-Ming",""],["He","Rong-Qiang",""],["Lu","Zhong-Yi",""]]}
{"id":"2308.09699","submitter":"Sandra Brandstetter","authors":"Sandra Brandstetter, Philipp Lunt, Carl Heintze, Giuliano Giacalone,\n  Lars H. Heyen, Maciej Ga{\\l}ka, Keerthan Subramanian, Marvin Holten, Philipp\n  M. Preiss, Stefan Floerchinger, Selim Jochim","title":"Emergent hydrodynamic behaviour of few strongly interacting fermions","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas nucl-ex nucl-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hydrodynamics provides a successful framework to effectively describe the\ndynamics of complex many-body systems ranging from subnuclear to cosmological\nscales by introducing macroscopic quantities such as particle densities and\nfluid velocities. According to textbook knowledge, it requires coarse graining\nover microscopic constituents to define a macroscopic fluid cell, which is\nlarge compared to the interparticle spacing and the mean free path. In\naddition, the entire system must consist of many such fluid cells. The latter\nrequirement on the system size has been challenged by experiments on\nhigh-energy heavy-ion collisions, where collective particle emission, typically\nassociated with the formation of a hydrodynamic medium, has been observed with\nfew tens of final-state particles. Here, we demonstrate emergence of\nhydrodynamics in a system with significantly less constituents. Our observation\nchallenges the requirements for a hydrodynamic description, as in our system\nall relevant length scales, i.e. the system size, the inter-particle spacing,\nand the mean free path are comparable. The single particle resolution,\ndeterministic control over particle number and interaction strength in our\nexperiment allow us to explore the boundaries between a microscopic description\nand a hydrodynamic framework in unprecedented detail.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:46:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Brandstetter","Sandra",""],["Lunt","Philipp",""],["Heintze","Carl",""],["Giacalone","Giuliano",""],["Heyen","Lars H.",""],["Ga\u0142ka","Maciej",""],["Subramanian","Keerthan",""],["Holten","Marvin",""],["Preiss","Philipp M.",""],["Floerchinger","Stefan",""],["Jochim","Selim",""]]}
{"id":"2308.09700","submitter":"W. Callum Wareham","authors":"W. Callum Wareham, E. J. Nicol","title":"Optical conductivity of tilted higher pseudospin Dirac-Weyl cones","comments":"20 pages, 15 figures","journal-ref":"Phys. Rev. B 108, 085424 (2023)","doi":"10.1103/PhysRevB.108.085424","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the finite-frequency optical response of systems described at\nlow energies by Dirac-Weyl Hamiltonians with higher pseudospin $\\mathcal{S}$\nvalues. In particular, we examine the situation where a tilting term is applied\nin the Hamiltonian, which results in tilting of the Dirac electronic band\nstructure. We calculate and discuss the optical conductivity for the cases\n$\\mathcal{S}=1$, $3/2$, and $2$, in both two and three dimensions in order to\ndemonstrate the expected signatures in the optical response. We examine both\nundertilted (type I) and overtilted (type II) as well as the critically-tilted\ncase (type III). Along with the well-known case of $\\mathcal{S} =1/2$, a\npattern emerges for any $\\mathcal{S}$. We note that in situations with multiple\nnested cones, such as happens for $\\mathcal{S}>1$, the possibility of having\none cone being type I while the other is type II allows for more rich\nvariations in the optical signature, which we will label as type IV behavior.\nWe also comment on the presence of optical sum rules in the presence of\ntilting. Finally, we discuss tilting in the $\\alpha$-T$_3$ model in two\ndimensions, which is a hybrid of the $\\mathcal{S}=1/2$ (honeycomb lattice) and\n$\\mathcal{S}=1$ (dice or T$_3$ lattice) model with a variable Berry's phase. We\ncontrast this model's conductivity with that of $\\mathcal{S}=3/2$ and\n$\\mathcal{S}=2$ as the resultant optical response has some similarities,\nalthough there are clear distinguishing features between the these cases.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:48:29 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wareham","W. Callum",""],["Nicol","E. J.",""]]}
{"id":"2308.09701","submitter":"Jo\\~ao F. Doriguello","authors":"Jo\\~ao F. Doriguello, Alessandro Luongo, Ewin Tang","title":"Do you know what q-means?","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Clustering is one of the most important tools for analysis of large datasets,\nand perhaps the most popular clustering algorithm is Lloyd's iteration for\n$k$-means. This iteration takes $N$ vectors $v_1,\\dots,v_N\\in\\mathbb{R}^d$ and\noutputs $k$ centroids $c_1,\\dots,c_k\\in\\mathbb{R}^d$; these partition the\nvectors into clusters based on which centroid is closest to a particular\nvector. We present an overall improved version of the \"$q$-means\" algorithm,\nthe quantum algorithm originally proposed by Kerenidis, Landman, Luongo, and\nPrakash (2019) which performs $\\varepsilon$-$k$-means, an approximate version\nof $k$-means clustering. This algorithm does not rely on the quantum linear\nalgebra primitives of prior work, instead only using its QRAM to prepare and\nmeasure simple states based on the current iteration's clusters. The time\ncomplexity is $O\\big(\\frac{k^{2}}{\\varepsilon^2}(\\sqrt{k}d + \\log(Nd))\\big)$\nand maintains the polylogarithmic dependence on $N$ while improving the\ndependence on most of the other parameters. We also present a \"dequantized\"\nalgorithm for $\\varepsilon$-$k$-means which runs in\n$O\\big(\\frac{k^{2}}{\\varepsilon^2}(kd + \\log(Nd))\\big)$ time. Notably, this\nclassical algorithm matches the polylogarithmic dependence on $N$ attained by\nthe quantum algorithms.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:52:12 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Doriguello","Jo\u00e3o F.",""],["Luongo","Alessandro",""],["Tang","Ewin",""]]}
{"id":"2308.09702","submitter":"Xiao-Gang Wen","authors":"Abigail Timmel and Xiao-Gang Wen","title":"Non-Abelian quantum Hall states in multi-layer rhombohedral stacked\n  graphene","comments":"5 pages, 1 figure","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":"  It is known that $n$-degenerate Landau levels with the same spin-valley\nquantum number can be realized by $n$-layer graphene with rhombohedral stacking\nunder magnetic field $B$. We find that the wave functions of degenerate Landau\nlevels are concentrated at the surface layers of the multi-layer graphene if\nthe dimensionless ratio $\\eta = \\gamma_1/(v_F\\sqrt{2e\\hbar B/c}) \\approx 9/\n\\sqrt{B[\\text{Tesla}]} \\gg 1$, where $\\gamma_1$ is the interlayer hopping\nenergy and $v_F$ the Fermi velocity of single-layer graphene. This allows us to\nsuggest that: 1) filling fraction $\\nu=\\frac12$ (or $\\nu_n = 5\\frac12$)\nnon-Abelian state with Ising anyon can be realized in three-layer graphene for\nmagnetic field $ B \\lesssim 9$ Tesla; 2) filling fraction $\\nu=\\frac23$ (or\n$\\nu_n = 7\\frac13$) non-Abelian state with Fibonacci anyon can be realized in\nfour-layer graphene for magnetic field $ B \\sim 2 - 9 $ Tesla. Here, $\\nu$ is\nthe total filling fraction in the degenerate Landau levels, and $\\nu_n$ is the\nfilling fraction measured from charge neutrality point which determines the\nmeasured Hall conductance. We have assumed the following conditions to obtain\nthe above results: the exchange effective of Coulomb interaction polarizes the\n$SU(4)$ spin-valley quantum number and effective dielectric constant $\\epsilon\n\\gtrsim 10$ to reduce the Coulomb interaction. The high density of states of\nmulti-layer graphene helps to reduce the Coulomb interaction via screening.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:52:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Timmel","Abigail",""],["Wen","Xiao-Gang",""]]}
{"id":"2308.09703","submitter":"Ursula Hebert-Johnson","authors":"Ursula Hebert-Johnson, Daniel Lokshtanov, Eric Vigoda","title":"Counting and Sampling Labeled Chordal Graphs in Polynomial Time","comments":"Accepted for publication at ESA 2023 (European Symposium on\n  Algorithms); 36 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the first polynomial-time algorithm to exactly compute the number\nof labeled chordal graphs on n vertices. Our algorithm solves a more general\nproblem: given n and omega as input, it computes the number of omega-colorable\nlabeled chordal graphs on n vertices, using O(n^7) arithmetic operations. A\nstandard sampling-to-counting reduction then yields a polynomial-time exact\nsampler that generates an omega-colorable labeled chordal graph on n vertices\nuniformly at random. Our counting algorithm improves upon the previous best\nresult by Wormald (1985), which computes the number of labeled chordal graphs\non n vertices in time exponential in n.\n  An implementation of the polynomial-time counting algorithm gives the number\nof labeled chordal graphs on up to 30 vertices in less than three minutes on a\nstandard desktop computer. Previously, the number of labeled chordal graphs was\nonly known for graphs on up to 15 vertices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:54:09 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hebert-Johnson","Ursula",""],["Lokshtanov","Daniel",""],["Vigoda","Eric",""]]}
{"id":"2308.09704","submitter":"Salvatore Mandr\\`a","authors":"Salvatore Mandr\\`a, Gianni Mossi, Eleanor G. Rieffel","title":"Generating Hard Ising Instances With Planted Solutions Using\n  Post-Quantum Cryptographic Protocols","comments":null,"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":"  In this paper we present a novel method to generate hard instances with\nplanted solutions based on the public-private McEliece post-quantum\ncryptographic protocol. Unlike other planting methods rooted in the\ninfinite-size statistical analysis, our cryptographic protocol generates\ninstances which are all hard (in cryptographic terms), with the hardness tuned\nby the size of the private key, and with a guaranteed unique ground state. More\nimportantly, because of the private-public key protocol, planted solutions\ncannot be easily recovered by a direct inspection of the planted instances\nwithout the knowledge of the private key used to generate them, therefore\nmaking our protocol suitable to test and evaluate quantum devices without the\nrisk of \"backdoors\" being exploited.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:55:37 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mandr\u00e0","Salvatore",""],["Mossi","Gianni",""],["Rieffel","Eleanor G.",""]]}
{"id":"2308.09705","submitter":"Yukang Cao","authors":"Yukang Cao, Yan-Pei Cao, Kai Han, Ying Shan, Kwan-Yee K. Wong","title":"Guide3D: Create 3D Avatars from Text and Image Guidance","comments":"25 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, text-to-image generation has exhibited remarkable advancements,\nwith the ability to produce visually impressive results. In contrast,\ntext-to-3D generation has not yet reached a comparable level of quality.\nExisting methods primarily rely on text-guided score distillation sampling\n(SDS), and they encounter difficulties in transferring 2D attributes of the\ngenerated images to 3D content. In this work, we aim to develop an effective 3D\ngenerative model capable of synthesizing high-resolution textured meshes by\nleveraging both textual and image information. To this end, we introduce\nGuide3D, a zero-shot text-and-image-guided generative model for 3D avatar\ngeneration based on diffusion models. Our model involves (1) generating\nsparse-view images of a text-consistent character using diffusion models, and\n(2) jointly optimizing multi-resolution differentiable marching tetrahedral\ngrids with pixel-aligned image features. We further propose a similarity-aware\nfeature fusion strategy for efficiently integrating features from different\nviews. Moreover, we introduce two novel training objectives as an alternative\nto calculating SDS, significantly enhancing the optimization process. We\nthoroughly evaluate the performance and components of our framework, which\noutperforms the current state-of-the-art in producing topologically and\nstructurally correct geometry and high-resolution textures. Guide3D enables the\ndirect transfer of 2D-generated images to the 3D space. Our code will be made\npublicly available.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:55:47 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Cao","Yukang",""],["Cao","Yan-Pei",""],["Han","Kai",""],["Shan","Ying",""],["Wong","Kwan-Yee K.",""]]}
{"id":"2308.09706","submitter":"Yves Hon Kwan","authors":"Yves H. Kwan, Patrick J. Ledwith, Chiu Fan Bowen Lo, and Trithep\n  Devakul","title":"Strong-coupling topological states and phase transitions in helical\n  trilayer graphene","comments":"16+9 pages","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":"  Magic-angle helical trilayer graphene relaxes into commensurate moir\\'e\ndomains, whose topological and well-isolated set of narrow bands possess ideal\ncharacteristics for realizing robust correlated topological phases, compared\nwith other graphene-based moir\\'e heterostructures. Combining strong-coupling\nanalysis and Hartree-Fock calculations, we investigate the ground states at\ninteger fillings $\\nu$, and uncover a rich phase diagram of correlated\ninsulators tuned by an external displacement field $D$. For small $D$, the\nsystem realizes several competing families of symmetry-broken generalized\nflavor ferromagnets, which exhibit various anomalous Hall signatures and Chern\nnumbers as high as $|C|=6$. The interaction-induced dispersion renormalization\nis weak, so that the band flatness and the validity of strong-coupling theory\nare maintained at all integer fillings. For experimentally accessible\ndisplacement fields, the strong-coupling insulators at all $\\nu$ undergo\ntopological phase transitions, which appear continuous or weakly first-order.\nFor larger $D$, we also find translation symmetry-broken phases such as\nKekul\\'e spiral order. Our results demonstrate the robust capability of helical\ntrilayer graphene to host gate-tunable topological and symmetry-broken\ncorrelated phases, and lay the groundwork for future theoretical studies on\nother aspects such as fractional topological states.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:55:50 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kwan","Yves H.",""],["Ledwith","Patrick J.",""],["Lo","Chiu Fan Bowen",""],["Devakul","Trithep",""]]}
{"id":"2308.09707","submitter":"Xunjiang Luo","authors":"Xun-Jiang Luo, Wen-Xuan Qiu, and Fengcheng Wu","title":"Majorana zero modes in twisted transition metal dichalcogenides\n  homobilayers","comments":"6 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":"  Semiconductor moir\\'e superlattices provide a highly tunable platform to\nstudy the interplay between electron correlation and band topology. For\nexample, the generalized Kane-Mele-Hubbard model can be simulated by the\ntopological moir\\'e flat bands in twisted transition metal dichalcogenides\nhomobilayers. For this system, we obtain the filling factor, twist angle, and\nelectric field-dependent quantum phase diagrams with a plethora of phases,\nincluding the quantum spin Hall insulator, the in-plane antiferromagnetic\nstate, the out-of-plane antiferromagnetic Chern insulator, the spin-polarized\nChern insulator, the in-plane ferromagnetic state, and the 120$^\\circ$\nantiferromagnetic state. We predict that a gate-defined junction formed between\nthe quantum spin Hall insulator phase with proximitized superconductivity and\nmagnetic phases with in-plane magnetization (either ferromagnetic or\nantiferromagnetic) can realize one-dimensional topological superconductor with\nMajorana zero modes. Our proposal introduces semiconductor moir\\'e homobilayers\nas an electrically tunable Majorana platform with no need of an external\nmagnetic field.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:58:06 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luo","Xun-Jiang",""],["Qiu","Wen-Xuan",""],["Wu","Fengcheng",""]]}
{"id":"2308.09708","submitter":"Yue Yao","authors":"Yue Yao, Xinyu Tian, Zheng Tang, Sujit Biswas, Huan Lei, Tom Gedeon,\n  Liang Zheng","title":"Training with Product Digital Twins for AutoRetail Checkout","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automating the checkout process is important in smart retail, where users\neffortlessly pass products by hand through a camera, triggering automatic\nproduct detection, tracking, and counting. In this emerging area, due to the\nlack of annotated training data, we introduce a dataset comprised of product 3D\nmodels, which allows for fast, flexible, and large-scale training data\ngeneration through graphic engine rendering. Within this context, we discern an\nintriguing facet, because of the user \"hands-on\" approach, bias in user\nbehavior leads to distinct patterns in the real checkout process. The existence\nof such patterns would compromise training effectiveness if training data fail\nto reflect the same. To address this user bias problem, we propose a training\ndata optimization framework, i.e., training with digital twins (DtTrain).\nSpecifically, we leverage the product 3D models and optimize their rendering\nviewpoint and illumination to generate \"digital twins\" that visually resemble\nrepresentative user images. These digital twins, inherit product labels and,\nwhen augmented, form the Digital Twin training set (DT set). Because the\ndigital twins individually mimic user bias, the resulting DT training set\nbetter reflects the characteristics of the target scenario and allows us to\ntrain more effective product detection and tracking models. In our experiment,\nwe show that DT set outperforms training sets created by existing dataset\nsynthesis methods in terms of counting accuracy. Moreover, by combining DT set\nwith pseudo-labeled real checkout data, further improvement is observed. The\ncode is available at https://github.com/yorkeyao/Automated-Retail-Checkout.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:58:10 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Yao","Yue",""],["Tian","Xinyu",""],["Tang","Zheng",""],["Biswas","Sujit",""],["Lei","Huan",""],["Gedeon","Tom",""],["Zheng","Liang",""]]}
{"id":"2308.09709","submitter":"Dong-Hee Kim","authors":"Jicheol Kim, Dongkyu Kim, Dong-Hee Kim","title":"Neural-network quantum state study of the long-range antiferromagnetic\n  Ising chain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.quant-gas cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate quantum phase transitions in the transverse field Ising chain\nwith algebraically decaying long-range antiferromagnetic interactions by using\nthe variational Monte Carlo method with the restricted Boltzmann machine being\nemployed as a trial wave function ansatz. In the finite-size scaling analysis\nwith the order parameter and the second R\\'enyi entropy, we find that the\ncentral charge deviates from 1/2 at a small decay exponent $\\alpha_\\mathrm{LR}$\nin contrast to the critical exponents staying very close to the short-range\n(SR) Ising values regardless of $\\alpha_\\mathrm{LR}$ examined, supporting the\npreviously proposed scenario of conformal invariance breakdown. To identify the\nthreshold of the Ising universality and the conformal symmetry, we perform two\nadditional tests for the universal Binder ratio and the conformal field theory\n(CFT) description of the correlation function. It turns out that both indicate\na noticeable deviation from the SR Ising class at $\\alpha_\\mathrm{LR} < 2$.\nHowever, a closer look at the scaled correlation function for\n$\\alpha_\\mathrm{LR} \\ge 2$ shows a gradual change from the asymptotic line of\nthe CFT verified at $\\alpha_\\mathrm{LR} = 3$, providing a rough estimate of the\nthreshold being in the range of $2 \\lesssim \\alpha_\\mathrm{LR} < 3$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:58:36 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Kim","Jicheol",""],["Kim","Dongkyu",""],["Kim","Dong-Hee",""]]}
{"id":"2308.09710","submitter":"Zhen Xing","authors":"Zhen Xing, Qi Dai, Han Hu, Zuxuan Wu, Yu-Gang Jiang","title":"SimDA: Simple Diffusion Adapter for Efficient Video Generation","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 recent wave of AI-generated content has witnessed the great development\nand success of Text-to-Image (T2I) technologies. By contrast, Text-to-Video\n(T2V) still falls short of expectations though attracting increasing interests.\nExisting works either train from scratch or adapt large T2I model to videos,\nboth of which are computation and resource expensive. In this work, we propose\na Simple Diffusion Adapter (SimDA) that fine-tunes only 24M out of 1.1B\nparameters of a strong T2I model, adapting it to video generation in a\nparameter-efficient way. In particular, we turn the T2I model for T2V by\ndesigning light-weight spatial and temporal adapters for transfer learning.\nBesides, we change the original spatial attention to the proposed Latent-Shift\nAttention (LSA) for temporal consistency. With similar model architecture, we\nfurther train a video super-resolution model to generate high-definition\n(1024x1024) videos. In addition to T2V generation in the wild, SimDA could also\nbe utilized in one-shot video editing with only 2 minutes tuning. Doing so, our\nmethod could minimize the training effort with extremely few tunable parameters\nfor model adaptation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:58:44 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Xing","Zhen",""],["Dai","Qi",""],["Hu","Han",""],["Wu","Zuxuan",""],["Jiang","Yu-Gang",""]]}
{"id":"2308.09711","submitter":"Stefano Gasperini","authors":"Stefano Gasperini, Nils Morbitzer, HyunJun Jung, Nassir Navab,\n  Federico Tombari","title":"Robust Monocular Depth Estimation under Challenging Conditions","comments":"ICCV 2023. Source code and data: https://md4all.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While state-of-the-art monocular depth estimation approaches achieve\nimpressive results in ideal settings, they are highly unreliable under\nchallenging illumination and weather conditions, such as at nighttime or in the\npresence of rain. In this paper, we uncover these safety-critical issues and\ntackle them with md4all: a simple and effective solution that works reliably\nunder both adverse and ideal conditions, as well as for different types of\nlearning supervision. We achieve this by exploiting the efficacy of existing\nmethods under perfect settings. Therefore, we provide valid training signals\nindependently of what is in the input. First, we generate a set of complex\nsamples corresponding to the normal training ones. Then, we train the model by\nguiding its self- or full-supervision by feeding the generated samples and\ncomputing the standard losses on the corresponding original images. Doing so\nenables a single model to recover information across diverse conditions without\nmodifications at inference time. Extensive experiments on two challenging\npublic datasets, namely nuScenes and Oxford RobotCar, demonstrate the\neffectiveness of our techniques, outperforming prior works by a large margin in\nboth standard and challenging conditions. Source code and data are available\nat: https://md4all.github.io.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:01 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Gasperini","Stefano",""],["Morbitzer","Nils",""],["Jung","HyunJun",""],["Navab","Nassir",""],["Tombari","Federico",""]]}
{"id":"2308.09712","submitter":"Shoukang Hu","authors":"Shoukang Hu, Fangzhou Hong, Tao Hu, Liang Pan, Haiyi Mei, Weiye Xiao,\n  Lei Yang, Ziwei Liu","title":"HumanLiff: Layer-wise 3D Human Generation with Diffusion Model","comments":"Project page: https://skhu101.github.io/HumanLiff/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D human generation from 2D images has achieved remarkable progress through\nthe synergistic utilization of neural rendering and generative models. Existing\n3D human generative models mainly generate a clothed 3D human as an\nundetectable 3D model in a single pass, while rarely considering the layer-wise\nnature of a clothed human body, which often consists of the human body and\nvarious clothes such as underwear, outerwear, trousers, shoes, etc. In this\nwork, we propose HumanLiff, the first layer-wise 3D human generative model with\na unified diffusion process. Specifically, HumanLiff firstly generates\nminimal-clothed humans, represented by tri-plane features, in a canonical\nspace, and then progressively generates clothes in a layer-wise manner. In this\nway, the 3D human generation is thus formulated as a sequence of\ndiffusion-based 3D conditional generation. To reconstruct more fine-grained 3D\nhumans with tri-plane representation, we propose a tri-plane shift operation\nthat splits each tri-plane into three sub-planes and shifts these sub-planes to\nenable feature grid subdivision. To further enhance the controllability of 3D\ngeneration with 3D layered conditions, HumanLiff hierarchically fuses tri-plane\nfeatures and 3D layered conditions to facilitate the 3D diffusion model\nlearning. Extensive experiments on two layer-wise 3D human datasets, SynBody\n(synthetic) and TightCap (real-world), validate that HumanLiff significantly\noutperforms state-of-the-art methods in layer-wise 3D human generation. Our\ncode will be available at https://skhu101.github.io/HumanLiff.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:04 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Hu","Shoukang",""],["Hong","Fangzhou",""],["Hu","Tao",""],["Pan","Liang",""],["Mei","Haiyi",""],["Xiao","Weiye",""],["Yang","Lei",""],["Liu","Ziwei",""]]}
{"id":"2308.09713","submitter":"Jonathon Luiten","authors":"Jonathon Luiten and Georgios Kopanas and Bastian Leibe and Deva\n  Ramanan","title":"Dynamic 3D Gaussians: Tracking by Persistent Dynamic View 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 present a method that simultaneously addresses the tasks of dynamic scene\nnovel-view synthesis and six degree-of-freedom (6-DOF) tracking of all dense\nscene elements. We follow an analysis-by-synthesis framework, inspired by\nrecent work that models scenes as a collection of 3D Gaussians which are\noptimized to reconstruct input images via differentiable rendering. To model\ndynamic scenes, we allow Gaussians to move and rotate over time while enforcing\nthat they have persistent color, opacity, and size. By regularizing Gaussians'\nmotion and rotation with local-rigidity constraints, we show that our Dynamic\n3D Gaussians correctly model the same area of physical space over time,\nincluding the rotation of that space. Dense 6-DOF tracking and dynamic\nreconstruction emerges naturally from persistent dynamic view synthesis,\nwithout requiring any correspondence or flow as input. We demonstrate a large\nnumber of downstream applications enabled by our representation, including\nfirst-person view synthesis, dynamic compositional scene synthesis, and 4D\nvideo editing.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:21 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Luiten","Jonathon",""],["Kopanas","Georgios",""],["Leibe","Bastian",""],["Ramanan","Deva",""]]}
{"id":"2308.09714","submitter":"Divya Jaganathan","authors":"Divya Jaganathan, Rama Govindarajan, Vishal Vasan","title":"Explicit Runge-Kutta algorithm to solve non-local equations with memory\n  effects: case of the Maxey-Riley-Gatignol equation","comments":"26 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A standard approach to solve ordinary differential equations, when they\ndescribe dynamical systems, is to adopt a Runge-Kutta or related scheme. Such\nschemes, however, are not applicable to the large class of equations which do\nnot constitute dynamical systems. In several physical systems, we encounter\nintegro-differential equations with memory terms where the time derivative of a\nstate variable at a given time depends on all past states of the system.\nSecondly, there are equations whose solutions do not have well-defined Taylor\nseries expansion. The Maxey-Riley-Gatignol equation, which describes the\ndynamics of an inertial particle in nonuniform and unsteady flow, displays both\nchallenges. We use it as a test bed to address the questions we raise, but our\nmethod may be applied to all equations of this class. We show that the\nMaxey-Riley-Gatignol equation can be embedded into an extended Markovian system\nwhich is constructed by introducing a new dynamical co-evolving state variable\nthat encodes memory of past states. We develop a Runge-Kutta algorithm for the\nresultant Markovian system. The form of the kernels involved in deriving the\nRunge-Kutta scheme necessitates the use of an expansion in powers of $t^{1/2}$.\nOur approach naturally inherits the benefits of standard time-integrators,\nnamely a constant memory storage cost, a linear growth of operational effort\nwith simulation time, and the ability to restart a simulation with the final\nstate as the new initial condition.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:26 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Jaganathan","Divya",""],["Govindarajan","Rama",""],["Vasan","Vishal",""]]}
{"id":"2308.09715","submitter":"Karl Svozil","authors":"Karl Svozil","title":"(Re)Construction of Quantum Space-Time: Transcribing Hilbert Into\n  Configuration Space","comments":"5 pages, contribution to a Symposium on the Foundations of Quantum\n  Physics celebrating Danny Greenberger's 90th birthday","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Space-time in quantum mechanics is about bridging Hilbert and configuration\nspace. Thereby, an entirely new perspective is obtained by replacing the\nNewtonian space-time theater with the image of a presumably high-dimensional\nHilbert space, through which space-time becomes an epiphenomenon construed by\ninternal observers.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:33 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Svozil","Karl",""]]}
{"id":"2308.09716","submitter":"Soumik Mukhopadhyay","authors":"Soumik Mukhopadhyay, Saksham Suri, Ravi Teja Gadde, Abhinav\n  Shrivastava","title":"Diff2Lip: Audio Conditioned Diffusion Models for Lip-Synchronization","comments":"Website: see https://soumik-kanad.github.io/diff2lip . Submission\n  under review","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 task of lip synchronization (lip-sync) seeks to match the lips of human\nfaces with different audio. It has various applications in the film industry as\nwell as for creating virtual avatars and for video conferencing. This is a\nchallenging problem as one needs to simultaneously introduce detailed,\nrealistic lip movements while preserving the identity, pose, emotions, and\nimage quality. Many of the previous methods trying to solve this problem suffer\nfrom image quality degradation due to a lack of complete contextual\ninformation. In this paper, we present Diff2Lip, an audio-conditioned\ndiffusion-based model which is able to do lip synchronization in-the-wild while\npreserving these qualities. We train our model on Voxceleb2, a video dataset\ncontaining in-the-wild talking face videos. Extensive studies show that our\nmethod outperforms popular methods like Wav2Lip and PC-AVS in Fr\\'echet\ninception distance (FID) metric and Mean Opinion Scores (MOS) of the users. We\nshow results on both reconstruction (same audio-video inputs) as well as cross\n(different audio-video inputs) settings on Voxceleb2 and LRW datasets. Video\nresults and code can be accessed from our project page (\nhttps://soumik-kanad.github.io/diff2lip ).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:40 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Mukhopadhyay","Soumik",""],["Suri","Saksham",""],["Gadde","Ravi Teja",""],["Shrivastava","Abhinav",""]]}
{"id":"2308.09717","submitter":"Vadim Sushko","authors":"Vadim Sushko, Ruyu Wang, Juergen Gall","title":"Smoothness Similarity Regularization for Few-Shot GAN Adaptation","comments":"International Conference on Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The task of few-shot GAN adaptation aims to adapt a pre-trained GAN model to\na small dataset with very few training images. While existing methods perform\nwell when the dataset for pre-training is structurally similar to the target\ndataset, the approaches suffer from training instabilities or memorization\nissues when the objects in the two domains have a very different structure. To\nmitigate this limitation, we propose a new smoothness similarity regularization\nthat transfers the inherently learned smoothness of the pre-trained GAN to the\nfew-shot target domain even if the two domains are very different. We evaluate\nour approach by adapting an unconditional and a class-conditional GAN to\ndiverse few-shot target domains. Our proposed method significantly outperforms\nprior few-shot GAN adaptation methods in the challenging case of structurally\ndissimilar source-target domains, while performing on par with the state of the\nart for similar source-target domains.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:53 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Sushko","Vadim",""],["Wang","Ruyu",""],["Gall","Juergen",""]]}
{"id":"2308.09718","submitter":"Xiaoyang Wu","authors":"Xiaoyang Wu, Zhuotao Tian, Xin Wen, Bohao Peng, Xihui Liu, Kaicheng\n  Yu, Hengshuang Zhao","title":"Towards Large-scale 3D Representation Learning with Multi-dataset Point\n  Prompt Training","comments":"Code available at Pointcept (https://github.com/Pointcept/Pointcept)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid advancement of deep learning models often attributes to their\nability to leverage massive training data. In contrast, such privilege has not\nyet fully benefited 3D deep learning, mainly due to the limited availability of\nlarge-scale 3D datasets. Merging multiple available data sources and letting\nthem collaboratively train a single model is a potential solution. However, due\nto the large domain gap between 3D point cloud datasets, such mixed supervision\ncould adversely affect the model's performance and lead to degenerated\nperformance (i.e., negative transfer) compared to single-dataset training. In\nview of this challenge, we introduce Point Prompt Training (PPT), a novel\nframework for multi-dataset synergistic learning in the context of 3D\nrepresentation learning that supports multiple pre-training paradigms. Based on\nthis framework, we propose Prompt-driven Normalization, which adapts the model\nto different datasets with domain-specific prompts and Language-guided\nCategorical Alignment that decently unifies the multiple-dataset label spaces\nby leveraging the relationship between label text. Extensive experiments verify\nthat PPT can overcome the negative transfer associated with synergistic\nlearning and produce generalizable representations. Notably, it achieves\nstate-of-the-art performance on each dataset using a single weight-shared model\nwith supervised multi-dataset training. Moreover, when served as a pre-training\nframework, it outperforms other pre-training approaches regarding\nrepresentation quality and attains remarkable state-of-the-art performance\nacross over ten diverse downstream tasks spanning both indoor and outdoor 3D\nscenarios.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:59:57 GMT"}],"update_date":"2023-08-21","authors_parsed":[["Wu","Xiaoyang",""],["Tian","Zhuotao",""],["Wen","Xin",""],["Peng","Bohao",""],["Liu","Xihui",""],["Yu","Kaicheng",""],["Zhao","Hengshuang",""]]}
{"id":"2308.09719","submitter":"Shusaku Egami","authors":"Shusaku Egami, Yasunori Yamamoto, Ikki Ohmukai, Takashi Okumura","title":"CIRO: COVID-19 infection risk ontology","comments":"18 pages, 8 figures, and this paper has been accepted by PLOS ONE","journal-ref":"PLoS One, 18(3), e0282291, 2023","doi":"10.1371/journal.pone.0282291","report-no":null,"categories":"cs.AI cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Public health authorities perform contact tracing for highly contagious\nagents to identify close contacts with the infected cases. However, during the\npandemic caused by coronavirus disease 2019 (COVID-19), this operation was not\nemployed in countries with high patient volumes. Meanwhile, the Japanese\ngovernment conducted this operation, thereby contributing to the control of\ninfections, at the cost of arduous manual labor by public health officials. To\nease the burden of the officials, this study attempted to automate the\nassessment of each person's infection risk through an ontology, called COVID-19\nInfection Risk Ontology (CIRO). This ontology expresses infection risks of\nCOVID-19 formulated by the Japanese government, toward automated assessment of\ninfection risks of individuals, using Resource Description Framework (RDF) and\nSPARQL (SPARQL Protocol and RDF Query Language) queries. For evaluation, we\ndemonstrated that the knowledge graph built could infer the risks, formulated\nby the government. Moreover, we conducted reasoning experiments to analyze the\ncomputational efficiency. The experiments demonstrated usefulness of the\nknowledge processing, and identified issues left for deployment.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 11:12:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Egami","Shusaku",""],["Yamamoto","Yasunori",""],["Ohmukai","Ikki",""],["Okumura","Takashi",""]]}
{"id":"2308.09720","submitter":"Stefano Nolfi","authors":"Stefano Nolfi","title":"On the Unexpected Abilities of Large Language Models","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":"  Large language models are capable of displaying a wide range of abilities\nthat are not directly connected with the task for which they are trained:\npredicting the next words of human-written texts. In this article, I discuss\nthe nature of this indirect acquisition process and its relation to other known\nindirect processes. I argue that an important side effect of such indirect\nacquisition is the development of integrated abilities. I discuss the extent to\nwhich the abilities developed by large language models are predictable.\nFinally, I briefly discuss the relation between the cognitive skills acquired\nby these systems and human cognition.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:15:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nolfi","Stefano",""]]}
{"id":"2308.09721","submitter":"Ting Zeng","authors":"Yongcong Chen, Ting Zeng and Jun Zhang","title":"A new solution and concrete implementation steps for Artificial General\n  Intelligence","comments":"30 pages, 2 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At present, the mainstream artificial intelligence generally adopts the\ntechnical path of \"attention mechanism + deep learning\" + \"reinforcement\nlearning\". It has made great progress in the field of AIGC (Artificial\nIntelligence Generated Content), setting off the technical wave of big models[\n2][13 ]. But in areas that need to interact with the actual environment, such\nas elderly care, home nanny, agricultural production, and vehicle driving,\ntrial and error are expensive and a reinforcement learning process that\nrequires much trial and error is difficult to achieve. Therefore, in order to\nachieve Artificial General Intelligence(AGI) that can be applied to any field,\nwe need to use both existing technologies and solve the defects of existing\ntechnologies, so as to further develop the technological wave of artificial\nintelligence. In this paper, we analyze the limitations of the technical route\nof large models, and by addressing these limitations, we propose solutions,\nthus solving the inherent defects of large models. In this paper, we will\nreveal how to achieve true AGI step by step.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 13:31:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Yongcong",""],["Zeng","Ting",""],["Zhang","Jun",""]]}
{"id":"2308.09722","submitter":"Mst Akter","authors":"Mst Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea","title":"A Trustable LSTM-Autoencoder Network for Cyberbullying Detection on\n  Social Media Using Synthetic Data","comments":"arXiv admin note: text overlap with arXiv:2303.07484","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Social media cyberbullying has a detrimental effect on human life. As online\nsocial networking grows daily, the amount of hate speech also increases. Such\nterrible content can cause depression and actions related to suicide. This\npaper proposes a trustable LSTM-Autoencoder Network for cyberbullying detection\non social media using synthetic data. We have demonstrated a cutting-edge\nmethod to address data availability difficulties by producing\nmachine-translated data. However, several languages such as Hindi and Bangla\nstill lack adequate investigations due to a lack of datasets. We carried out\nexperimental identification of aggressive comments on Hindi, Bangla, and\nEnglish datasets using the proposed model and traditional models, including\nLong Short-Term Memory (LSTM), Bidirectional Long Short-Term Memory (BiLSTM),\nLSTM-Autoencoder, Word2vec, Bidirectional Encoder Representations from\nTransformers (BERT), and Generative Pre-trained Transformer 2 (GPT-2) models.\nWe employed evaluation metrics such as f1-score, accuracy, precision, and\nrecall to assess the models performance. Our proposed model outperformed all\nthe models on all datasets, achieving the highest accuracy of 95%. Our model\nachieves state-of-the-art results among all the previous works on the dataset\nwe used in this paper.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 17:20:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Akter","Mst Shapna",""],["Shahriar","Hossain",""],["Cuzzocrea","Alfredo",""]]}
{"id":"2308.09723","submitter":"Young Jin Kim","authors":"Young Jin Kim, Rawn Henry, Raffy Fahim, Hany Hassan Awadalla","title":"FineQuant: Unlocking Efficiency with Fine-Grained Weight-Only\n  Quantization for LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have achieved state-of-the-art performance\nacross various language tasks but pose challenges for practical deployment due\nto their substantial memory requirements. Furthermore, the latest generative\nmodels suffer from high inference costs caused by the memory bandwidth\nbottleneck in the auto-regressive decoding process. To address these issues, we\npropose an efficient weight-only quantization method that reduces memory\nconsumption and accelerates inference for LLMs. To ensure minimal quality\ndegradation, we introduce a simple and effective heuristic approach that\nutilizes only the model weights of a pre-trained model. This approach is\napplicable to both Mixture-of-Experts (MoE) and dense models without requiring\nadditional fine-tuning. To demonstrate the effectiveness of our proposed\nmethod, we first analyze the challenges and issues associated with LLM\nquantization. Subsequently, we present our heuristic approach, which adaptively\nfinds the granularity of quantization, effectively addressing these problems.\nFurthermore, we implement highly efficient GPU GEMMs that perform on-the-fly\nmatrix multiplication and dequantization, supporting the multiplication of fp16\nor bf16 activations with int8 or int4 weights. We evaluate our approach on\nlarge-scale open source models such as OPT-175B and internal MoE models,\nshowcasing minimal accuracy loss while achieving up to 3.65 times higher\nthroughput on the same number of GPUs.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 23:57:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","Young Jin",""],["Henry","Rawn",""],["Fahim","Raffy",""],["Awadalla","Hany Hassan",""]]}
{"id":"2308.09724","submitter":"Liyue Chen","authors":"Liyue Chen, Linian Wang, Jinyu Xu, Shuai Chen, Weiqiang Wang, Wenbiao\n  Zhao, Qiyu Li, Leye Wang","title":"Knowledge-inspired Subdomain Adaptation for Cross-Domain Knowledge\n  Transfer","comments":"accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most state-of-the-art deep domain adaptation techniques align source and\ntarget samples in a global fashion. That is, after alignment, each source\nsample is expected to become similar to any target sample. However, global\nalignment may not always be optimal or necessary in practice. For example,\nconsider cross-domain fraud detection, where there are two types of\ntransactions: credit and non-credit. Aligning credit and non-credit\ntransactions separately may yield better performance than global alignment, as\ncredit transactions are unlikely to exhibit patterns similar to non-credit\ntransactions. To enable such fine-grained domain adaption, we propose a novel\nKnowledge-Inspired Subdomain Adaptation (KISA) framework. In particular, (1) We\nprovide the theoretical insight that KISA minimizes the shared expected loss\nwhich is the premise for the success of domain adaptation methods. (2) We\npropose the knowledge-inspired subdomain division problem that plays a crucial\nrole in fine-grained domain adaption. (3) We design a knowledge fusion network\nto exploit diverse domain knowledge. Extensive experiments demonstrate that\nKISA achieves remarkable results on fraud detection and traffic demand\nprediction tasks.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:46:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Liyue",""],["Wang","Linian",""],["Xu","Jinyu",""],["Chen","Shuai",""],["Wang","Weiqiang",""],["Zhao","Wenbiao",""],["Li","Qiyu",""],["Wang","Leye",""]]}
{"id":"2308.09725","submitter":"Ziwei Yang","authors":"Ziwei Yang, Zheng Chen, Yasuko Matsubara, Yasushi Sakurai","title":"MoCLIM: Towards Accurate Cancer Subtyping via Multi-Omics Contrastive\n  Learning with Omics-Inference Modeling","comments":"CIKM'23 Long/Full Papers","journal-ref":null,"doi":"10.1145/3583780.3614970","report-no":null,"categories":"q-bio.GN cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precision medicine fundamentally aims to establish causality between\ndysregulated biochemical mechanisms and cancer subtypes. Omics-based cancer\nsubtyping has emerged as a revolutionary approach, as different level of omics\nrecords the biochemical products of multistep processes in cancers. This paper\nfocuses on fully exploiting the potential of multi-omics data to improve cancer\nsubtyping outcomes, and hence developed MoCLIM, a representation learning\nframework. MoCLIM independently extracts the informative features from distinct\nomics modalities. Using a unified representation informed by contrastive\nlearning of different omics modalities, we can well-cluster the subtypes, given\ncancer, into a lower latent space. This contrast can be interpreted as a\nprojection of inter-omics inference observed in biological networks.\nExperimental results on six cancer datasets demonstrate that our approach\nsignificantly improves data fit and subtyping performance in fewer\nhigh-dimensional cancer instances. Moreover, our framework incorporates various\nmedical evaluations as the final component, providing high interpretability in\nmedical analysis.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:49:48 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 04:38:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Ziwei",""],["Chen","Zheng",""],["Matsubara","Yasuko",""],["Sakurai","Yasushi",""]]}
{"id":"2308.09726","submitter":"Jackson Killian","authors":"Jackson A. Killian, Manish Jain, Yugang Jia, Jonathan Amar, Erich\n  Huang, Milind Tambe","title":"Equitable Restless Multi-Armed Bandits: A General Framework Inspired By\n  Digital Health","comments":"16 pages, 8 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CY cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Restless multi-armed bandits (RMABs) are a popular framework for algorithmic\ndecision making in sequential settings with limited resources. RMABs are\nincreasingly being used for sensitive decisions such as in public health,\ntreatment scheduling, anti-poaching, and -- the motivation for this work --\ndigital health. For such high stakes settings, decisions must both improve\noutcomes and prevent disparities between groups (e.g., ensure health equity).\nWe study equitable objectives for RMABs (ERMABs) for the first time. We\nconsider two equity-aligned objectives from the fairness literature, minimax\nreward and max Nash welfare. We develop efficient algorithms for solving each\n-- a water filling algorithm for the former, and a greedy algorithm with\ntheoretically motivated nuance to balance disparate group sizes for the latter.\nFinally, we demonstrate across three simulation domains, including a new\ndigital health model, that our approaches can be multiple times more equitable\nthan the current state of the art without drastic sacrifices to utility. Our\nfindings underscore our work's urgency as RMABs permeate into systems that\nimpact human and wildlife outcomes. Code is available at\nhttps://github.com/google-research/socialgood/tree/equitable-rmab\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:00:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Killian","Jackson A.",""],["Jain","Manish",""],["Jia","Yugang",""],["Amar","Jonathan",""],["Huang","Erich",""],["Tambe","Milind",""]]}
{"id":"2308.09727","submitter":"Zhanyu Liu","authors":"Zhanyu Liu, Guanjie Zheng, Yanwei Yu","title":"Cross-city Few-Shot Traffic Forecasting via Traffic Pattern Bank","comments":"Accepted by CIKM2023 (Long Paper)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic forecasting is a critical service in Intelligent Transportation\nSystems (ITS). Utilizing deep models to tackle this task relies heavily on data\nfrom traffic sensors or vehicle devices, while some cities might lack device\nsupport and thus have few available data. So, it is necessary to learn from\ndata-rich cities and transfer the knowledge to data-scarce cities in order to\nimprove the performance of traffic forecasting. To address this problem, we\npropose a cross-city few-shot traffic forecasting framework via Traffic Pattern\nBank (TPB) due to that the traffic patterns are similar across cities. TPB\nutilizes a pre-trained traffic patch encoder to project raw traffic data from\ndata-rich cities into high-dimensional space, from which a traffic pattern bank\nis generated through clustering. Then, the traffic data of the data-scarce city\ncould query the traffic pattern bank and explicit relations between them are\nconstructed. The metaknowledge is aggregated based on these relations and an\nadjacency matrix is constructed to guide a downstream spatial-temporal model in\nforecasting future traffic. The frequently used meta-training framework Reptile\nis adapted to find a better initial parameter for the learnable modules.\nExperiments on real-world traffic datasets show that TPB outperforms existing\nmethods and demonstrates the effectiveness of our approach in cross-city\nfew-shot traffic forecasting.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:29:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Zhanyu",""],["Zheng","Guanjie",""],["Yu","Yanwei",""]]}
{"id":"2308.09728","submitter":"Ryoungwoo Jang","authors":"Ryoungwoo Jang","title":"Learning representations by forward-propagating errors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Back-propagation (BP) is widely used learning algorithm for neural network\noptimization. However, BP requires enormous computation cost and is too slow to\ntrain in central processing unit (CPU). Therefore current neural network\noptimizaiton is performed in graphical processing unit (GPU) with compute\nunified device architecture (CUDA) programming. In this paper, we propose a\nlight, fast learning algorithm on CPU that is fast as CUDA acceleration on GPU.\nThis algorithm is based on forward-propagating method, using concept of dual\nnumber in algebraic geometry.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:56:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jang","Ryoungwoo",""]]}
{"id":"2308.09729","submitter":"Yilin Wen","authors":"Yilin Wen, Zifeng Wang, Jimeng Sun","title":"MindMap: Knowledge Graph Prompting Sparks Graph of Thoughts in Large\n  Language Models","comments":"7 pages, 8 figures, 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LLMs usually exhibit limitations in their ability to incorporate new\nknowledge, the generation of hallucinations, and the transparency of their\ndecision-making process. In this paper, we explore how to prompt LLMs with\nknowledge graphs (KG), working as a remedy to engage LLMs with up-to-date\nknowledge and elicit the reasoning pathways from LLMs. Specifically, we build a\nprompting pipeline that endows LLMs with the capability of comprehending KG\ninputs and inferring with a combined implicit knowledge and the retrieved\nexternal knowledge. In addition, we investigate eliciting the mind map on which\nLLMs perform the reasoning and generate the answers. It is identified that the\nproduced mind map exhibits the reasoning pathways of LLMs grounded on the\nontology of knowledge, hence bringing the prospects of probing and gauging LLM\ninference in production. The experiments on three question & answering datasets\nalso show that MindMap prompting leads to a striking empirical gain. For\ninstance, prompting a GPT-3.5 with MindMap yields an overwhelming performance\nover GPT-4 consistently. We also demonstrate that with structured facts\nretrieved from KG, MindMap can outperform a series of\nprompting-with-document-retrieval methods, benefiting from more accurate,\nconcise, and comprehensive knowledge from KGs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 16:59:50 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 17:32:16 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 07:37:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wen","Yilin",""],["Wang","Zifeng",""],["Sun","Jimeng",""]]}
{"id":"2308.09730","submitter":"Fakrul Islam Tushar","authors":"Fakrul Islam Tushar, Lavsen Dahal, Saman Sotoudeh-Paima, Ehsan Abadi,\n  W. Paul Segars, Ehsan Samei, Joseph Y. Lo","title":"Data diversity and virtual imaging in AI-based diagnosis: A case study\n  based on COVID-19","comments":"3 tables, 4 figures, 1 Supplement","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Many studies have investigated deep-learning-based artificial intelligence\n(AI) models for medical imaging diagnosis of the novel coronavirus (COVID-19),\nwith many reports of near-perfect performance. However, variability in\nperformance and underlying data biases raise concerns about clinical\ngeneralizability. This retrospective study involved the development and\nevaluation of artificial intelligence (AI) models for COVID-19 diagnosis using\nboth diverse clinical and virtually generated medical images. In addition, we\nconducted a virtual imaging trial to assess how AI performance is affected by\nseveral patient- and physics-based factors, including the extent of disease,\nradiation dose, and imaging modality of computed tomography (CT) and chest\nradiography (CXR). AI performance was strongly influenced by dataset\ncharacteristics including quantity, diversity, and prevalence, leading to poor\ngeneralization with up to 20% drop in receiver operating characteristic area\nunder the curve. Model performance on virtual CT and CXR images was comparable\nto overall results on clinical data. Imaging dose proved to have negligible\ninfluence on the results, but the extent of the disease had a marked affect. CT\nresults were consistently superior to those from CXR. Overall, the study\nhighlighted the significant impact of dataset characteristics and disease\nextent on COVID assessment, and the relevance and potential role of virtual\nimaging trial techniques on developing effective evaluation of AI algorithms\nand facilitating translation into diagnostic practice.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:12:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tushar","Fakrul Islam",""],["Dahal","Lavsen",""],["Sotoudeh-Paima","Saman",""],["Abadi","Ehsan",""],["Segars","W. Paul",""],["Samei","Ehsan",""],["Lo","Joseph Y.",""]]}
{"id":"2308.09731","submitter":"Yashar Deldjoo","authors":"Fatemeh Nazary, Yashar Deldjoo, and Tommaso Di Noia","title":"ChatGPT-HealthPrompt. Harnessing the Power of XAI in Prompt-Based\n  Healthcare Decision Support using ChatGPT","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 study presents an innovative approach to the application of large\nlanguage models (LLMs) in clinical decision-making, focusing on OpenAI's\nChatGPT. Our approach introduces the use of contextual prompts-strategically\ndesigned to include task description, feature description, and crucially,\nintegration of domain knowledge-for high-quality binary classification tasks\neven in data-scarce scenarios. The novelty of our work lies in the utilization\nof domain knowledge, obtained from high-performing interpretable ML models, and\nits seamless incorporation into prompt design. By viewing these ML models as\nmedical experts, we extract key insights on feature importance to aid in\ndecision-making processes. This interplay of domain knowledge and AI holds\nsignificant promise in creating a more insightful diagnostic tool.\n  Additionally, our research explores the dynamics of zero-shot and few-shot\nprompt learning based on LLMs. By comparing the performance of OpenAI's ChatGPT\nwith traditional supervised ML models in different data conditions, we aim to\nprovide insights into the effectiveness of prompt engineering strategies under\nvaried data availability. In essence, this paper bridges the gap between AI and\nhealthcare, proposing a novel methodology for LLMs application in clinical\ndecision support systems. It highlights the transformative potential of\neffective prompt design, domain knowledge integration, and flexible learning\napproaches in enhancing automated decision-making.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 20:50:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nazary","Fatemeh",""],["Deldjoo","Yashar",""],["Di Noia","Tommaso",""]]}
{"id":"2308.09732","submitter":"Yao Hengshuai","authors":"Hengshuai Yao","title":"Baird Counterexample Is Solved: with an example of How to Debug a\n  Two-time-scale Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Baird counterexample was proposed by Leemon Baird in 1995, first used to show\nthat the Temporal Difference (TD(0)) algorithm diverges on this example. Since\nthen, it is often used to test and compare off-policy learning algorithms.\nGradient TD algorithms solved the divergence issue of TD on Baird\ncounterexample. However, their convergence on this example is still very slow,\nand the nature of the slowness is not well understood, e.g., see (Sutton and\nBarto 2018).\n  This note is to understand in particular, why TDC is slow on this example,\nand provide debugging analysis to understand this behavior. Our debugging\ntechnique can be used to study the convergence behavior of two-time-scale\nstochastic approximation algorithms. We also provide empirical results of the\nrecent Impression GTD algorithm on this example, showing the convergence is\nvery fast, in fact, in a linear rate. We conclude that Baird counterexample is\nsolved, by an algorithm with convergence guarantee to the TD solution in\ngeneral and a fast convergence rate.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:46:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yao","Hengshuai",""]]}
{"id":"2308.09733","submitter":"Sherif Abdelfattah","authors":"Sherif Abdelfattah, Kathryn Merrick, Jiankun Hu","title":"Intrinsically Motivated Hierarchical Policy Learning in Multi-objective\n  Markov Decision Processes","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":"  Multi-objective Markov decision processes are sequential decision-making\nproblems that involve multiple conflicting reward functions that cannot be\noptimized simultaneously without a compromise. This type of problems cannot be\nsolved by a single optimal policy as in the conventional case. Alternatively,\nmulti-objective reinforcement learning methods evolve a coverage set of optimal\npolicies that can satisfy all possible preferences in solving the problem.\nHowever, many of these methods cannot generalize their coverage sets to work in\nnon-stationary environments. In these environments, the parameters of the state\ntransition and reward distribution vary over time. This limitation results in\nsignificant performance degradation for the evolved policy sets. In order to\novercome this limitation, there is a need to learn a generic skill set that can\nbootstrap the evolution of the policy coverage set for each shift in the\nenvironment dynamics therefore, it can facilitate a continuous learning\nprocess. In this work, intrinsically motivated reinforcement learning has been\nsuccessfully deployed to evolve generic skill sets for learning hierarchical\npolicies to solve multi-objective Markov decision processes. We propose a novel\ndual-phase intrinsically motivated reinforcement learning method to address\nthis limitation. In the first phase, a generic set of skills is learned. While\nin the second phase, this set is used to bootstrap policy coverage sets for\neach shift in the environment dynamics. We show experimentally that the\nproposed method significantly outperforms state-of-the-art multi-objective\nreinforcement methods in a dynamic robotics environment.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:10:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Abdelfattah","Sherif",""],["Merrick","Kathryn",""],["Hu","Jiankun",""]]}
{"id":"2308.09734","submitter":"Sherif Abdelfattah","authors":"Sherif Abdelfattah, Kathryn Kasmarik, Jiankun Hu","title":"A Robust Policy Bootstrapping Algorithm for Multi-objective\n  Reinforcement Learning in Non-stationary Environments","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":"  Multi-objective Markov decision processes are a special kind of\nmulti-objective optimization problem that involves sequential decision making\nwhile satisfying the Markov property of stochastic processes. Multi-objective\nreinforcement learning methods address this problem by fusing the reinforcement\nlearning paradigm with multi-objective optimization techniques. One major\ndrawback of these methods is the lack of adaptability to non-stationary\ndynamics in the environment. This is because they adopt optimization procedures\nthat assume stationarity to evolve a coverage set of policies that can solve\nthe problem. This paper introduces a developmental optimization approach that\ncan evolve the policy coverage set while exploring the preference space over\nthe defined objectives in an online manner. We propose a novel multi-objective\nreinforcement learning algorithm that can robustly evolve a convex coverage set\nof policies in an online manner in non-stationary environments. We compare the\nproposed algorithm with two state-of-the-art multi-objective reinforcement\nlearning algorithms in stationary and non-stationary environments. Results\nshowed that the proposed algorithm significantly outperforms the existing\nalgorithms in non-stationary environments while achieving comparable results in\nstationary environments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:15:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Abdelfattah","Sherif",""],["Kasmarik","Kathryn",""],["Hu","Jiankun",""]]}
{"id":"2308.09735","submitter":"Zhoujian Sun","authors":"Zhoujian Sun, Wenzhuo Zhang, Zhengxing Huang, Nai Ding","title":"Causal Interpretable Progression Trajectory Analysis of Chronic Disease","comments":"20 pages, 5 tables, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chronic disease is the leading cause of death, emphasizing the need for\naccurate prediction of disease progression trajectories and informed clinical\ndecision-making. Machine learning (ML) models have shown promise in this domain\nby capturing non-linear patterns within patient features. However, existing\nML-based models lack the ability to provide causal interpretable predictions\nand estimate treatment effects, limiting their decision-assisting perspective.\nIn this study, we propose a novel model called causal trajectory prediction\n(CTP) to tackle the limitation. The CTP model combines trajectory prediction\nand causal discovery to enable accurate prediction of disease progression\ntrajectories and uncovering causal relationships between features. By\nincorporating a causal graph into the prediction process, CTP ensures that\nancestor features are not influenced by treatment on descendant features,\nthereby enhancing the interpretability of the model. By estimating the bounds\nof treatment effects, even in the presence of unmeasured confounders, the CTP\nprovides valuable insights for clinical decision-making. We evaluate the\nperformance of the CTP using simulated and real medical datasets. Experimental\nresults demonstrate that our model achieves satisfactory performance,\nhighlighting its potential to assist clinical decisions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:58:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Zhoujian",""],["Zhang","Wenzhuo",""],["Huang","Zhengxing",""],["Ding","Nai",""]]}
{"id":"2308.09736","submitter":"Sam S. C. Wong","authors":"Justin Khoury and Sam S. C. Wong","title":"Directed Percolation Criticality in Eternal Inflation","comments":"41 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  False-vacuum eternal inflation can be described as a random walk on the\nnetwork of vacua of the string landscape. In this paper we show that the\nproblem can be mapped naturally to a problem of directed percolation. The\nmapping relies on two general and well-justified approximations for transition\nrates: 1.~the downward approximation, which neglects ``upward\" transitions, as\nthese are generally exponentially suppressed; 2. the dominant decay channel\napproximation, which capitalizes on the fact that tunneling rates are\nexponentially staggered. Lacking detailed knowledge of the string landscape, we\nmodel the network of vacua as random graphs with arbitrary degree distribution,\nincluding Erd\\\"os-R\\'enyi and scale-free graphs. As a complementary approach,\nwe also model regions of the landscape as regular lattices, specifically Bethe\nlattices. We find that the uniform-in-time probabilities proposed in our\nprevious work favor regions of the landscape poised at the directed percolation\nphase transition. This raises the tantalizing prospect of deriving universal\nstatistical distributions for physical observables, characterized by critical\nexponents that are insensitive to the details of the underlying landscape. We\nillustrate this with the cosmological constant, and show that the resulting\ndistribution peaks as a power-law for small positive vacuum energy, with a\ncritical exponent uniquely determined by the random graph universality class.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khoury","Justin",""],["Wong","Sam S. C.",""]]}
{"id":"2308.09737","submitter":"Peter Denton","authors":"Peter B. Denton and Julia Gehrlein","title":"A Survey of Neutrino Flavor Models and the Neutrinoless Double Beta\n  Decay Funnel","comments":"42 pages, 13 figures, 5 tables, Many models. Comments welcome!","journal-ref":null,"doi":null,"report-no":"CERN-TH-2023-160, CETUP-2023-006","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The neutrinoless double beta decay experimental effort continues to make\ntremendous progress with hopes of covering the inverted neutrino mass hierarchy\nin coming years and pushing from the quasi-degenerate hierarchy into the normal\nhierarchy. As neutrino oscillation data is starting to suggest that the mass\nordering may be normal, we may well be faced with staring down the funnel of\ndeath: a region of parameter space in the normal ordering where for a\nparticular cancellation among the absolute neutrino mass scale, the Majorana\nphases, and the oscillation parameters, the neutrinoless double beta decay rate\nmay be vanishingly small. To answer the question if this region of parameter\nspace is theoretically preferred, we survey five broad categories of flavor\nmodels which make various different predictions for parameters relevant for\nneutrinoless double beta decay to determine how likely it is that the rate may\nbe in this funnel region. We find that a non-negligible fraction of flavor\nmodels are at least partially in the funnel region. Our results can guide model\nbuilders and experimentalists alike in focusing their efforts on theoretically\nmotivated regions of parameter space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Denton","Peter B.",""],["Gehrlein","Julia",""]]}
{"id":"2308.09738","submitter":"Mario Martone","authors":"Arash Arabi Ardehali, Mario Martone and Mart\\'i Rossell\\'o","title":"High-temperature expansion of the Schur index and modularity","comments":"39 pages plus two appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-temperature ($q\\to1$) asymptotics of 4d superconformal indices of\nLagrangian theories have been recently analyzed up to exponentially suppressed\ncorrections. Here we use RG-inspired tools to extend the analysis to the\nexponentially suppressed terms in the context of Schur indices of $N=2$ SCFTs.\nIn particular, our approach explains the curious patterns of logarithms\n(polynomials in $1/\\log q$) found by Dedushenko and Fluder in their numerical\nstudy of the high-temperature expansion of rank-$1$ theories. We also\ndemonstrate compatibility of our results with the conjecture of Beem and\nRastelli that Schur indices satisfy finite-order, possibly twisted, modular\nlinear differential equations (MLDEs), and discuss the interplay between our\napproach and the MLDE approach to the high-temperature expansion. The\nexpansions for $q$ near roots of unity are also treated. A byproduct of our\nanalysis is a proof (for Lagrangian theories) of rationality of the conformal\ndimensions of all characters of the associated VOA, that mix with the Schur\nindex under modular transformations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ardehali","Arash Arabi",""],["Martone","Mario",""],["Rossell\u00f3","Mart\u00ed",""]]}
{"id":"2308.09739","submitter":"Gemma Zhang","authors":"Gemma Zhang, At{\\i}n\\c{c} \\c{C}a\\u{g}an \\c{S}eng\\\"ul, Cora Dvorkin","title":"Subhalo effective density slope measurements from HST strong lensing\n  data with neural likelihood-ratio estimation","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Examining the properties of subhalos with strong gravitational lensing images\ncan shed light on the nature of dark matter. From upcoming large-scale surveys,\nwe expect to discover orders of magnitude more strong lens systems that can be\nused for subhalo studies. To optimally extract information from a large number\nof strong lensing images, machine learning provides promising avenues for\nefficient analysis that is unachievable with traditional analysis methods, but\napplication of machine learning techniques to real observations is still\nlimited. We build upon previous work, which uses a neural likelihood-ratio\nestimator, to constrain the effective density slopes of subhalos and\ndemonstrate the feasibility of this method on real strong lensing observations.\nTo do this, we implement significant improvements to the forward simulation\npipeline and undertake careful model evaluation using simulated images.\nUltimately, we use our trained model to predict the effective subhalo density\nslope from combining a set of strong lensing images taken by the \\textit{Hubble\nSpace Telescope}. We found the subhalo slope measurement of this set of\nobservations to be steeper than the slope predictions of cold dark matter\nsubhalos. Our result adds to several previous works that also measured high\nsubhalo slopes in observations. Although a possible explanation for this is\nthat subhalos with steeper slopes are easier to detect due to selection effects\nand thus contribute to statistical bias, our result nevertheless points to the\nneed for careful analysis of more strong lensing observations from future\nsurveys.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Gemma",""],["\u015eeng\u00fcl","At\u0131n\u00e7 \u00c7a\u011fan",""],["Dvorkin","Cora",""]]}
{"id":"2308.09740","submitter":"Jacob Kennedy","authors":"Jacob Kennedy, Jonathan Cola\\c{c}o Carr, Samuel Gagnon-Hartman, Adrian\n  Liu, Jordan Mirocha, Yue Cui","title":"Machine-learning recovery of foreground wedge-removed 21-cm light cones\n  for high-$z$ galaxy mapping","comments":"15 pages, 15 figures, 1 table. Feedback is welcome!","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":"  Upcoming experiments will map the spatial distribution of the 21-cm signal\nover three-dimensional volumes of space during the Epoch of Reionization (EoR).\nSeveral methods have been proposed to mitigate the issue of astrophysical\nforeground contamination in tomographic images of the 21-cm signal, one of\nwhich involves the excision of a wedge-shaped region in cylindrical Fourier\nspace. While this removes the $k$-modes most readily contaminated by\nforegrounds, the concurrent removal of cosmological information located within\nthe wedge considerably distorts the structure of 21-cm images. In this study,\nwe build upon a U-Net based deep learning algorithm to reconstruct foreground\nwedge-removed maps of the 21-cm signal, newly incorporating light-cone effects.\nAdopting the Square Kilometre Array (SKA) as our fiducial instrument, we\nhighlight that our U-Net recovery framework is robust to instrumental\nlimitations and noise. We subsequently evaluate the efficacy of recovered maps\nin guiding high-redshift galaxy searches and providing context to existing\ngalaxy catalogues. This will allow for studies of how the high-redshift galaxy\nluminosity function varies across environments, and ultimately refine our\nunderstanding of the connection between the ionization state of the\nintergalactic medium (IGM) and galaxies during the EoR.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kennedy","Jacob",""],["Carr","Jonathan Cola\u00e7o",""],["Gagnon-Hartman","Samuel",""],["Liu","Adrian",""],["Mirocha","Jordan",""],["Cui","Yue",""]]}
{"id":"2308.09741","submitter":"Tomasz Taylor","authors":"Stephan Stieberger, Tomasz R. Taylor, Bin Zhu","title":"Yang-Mills as a Liouville Theory","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a description of the gluon scattering amplitudes as the inverse\nMellin transforms of the conformal correlators of light operators in\ntwo-dimensional Liouville theory tensored with WZW-like chiral currents on the\ncelestial sphere. The dimensions of operators are Mellin dual to gluon light\ncone energies while their positions are determined by the gluon momentum\ndirections. Tree-level approximation in Yang-Mills theory corresponds to the\nsemiclassical limit of Liouville theory. By comparing subleading corrections,\nwe find $b^2= (8\\pi^2)^{-1}\\beta_0 \\,g^2(M)$, where $b$ is the Liouville\ncoupling constant, $g(M)$ is the Yang Mills coupling at the renormalization\nscale $M$ and $\\beta_0$ is the one-loop coefficient of the Yang-Mills beta\nfunction.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Stieberger","Stephan",""],["Taylor","Tomasz R.",""],["Zhu","Bin",""]]}
{"id":"2308.09742","submitter":"Anna De Graaff","authors":"Anna de Graaff, Hans-Walter Rix, Stefano Carniani, Katherine A. Suess,\n  St\\'ephane Charlot, Emma Curtis-Lake, Santiago Arribas, William M. Baker,\n  Kristan Boyett, Andrew J. Bunker, Alex J. Cameron, Jacopo Chevallard, Mirko\n  Curti, Daniel J. Eisenstein, Marijn Franx, Kevin Hainline, Ryan Hausen,\n  Zhiyuan Ji, Benjamin D. Johnson, Gareth C. Jones, Roberto Maiolino, Michael\n  V. Maseda, Erica Nelson, Eleonora Parlanti, Tim Rawle, Brant Robertson,\n  Sandro Tacchella, Hannah \\\"Ubler, Christina C. Williams, Christopher N. A.\n  Willmer and Chris Willott","title":"Ionised gas kinematics and dynamical masses of $z\\gtrsim6$ galaxies from\n  JADES/NIRSpec high-resolution spectroscopy","comments":"Software for JWST/NIRSpec MSA modelling (slit losses, 1D LSFs and 2D\n  model fitting) publicly available at https://github.com/annadeg/jwst-msafit","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the kinematic gas properties of six $5.5<z<7.4$ galaxies in the\nJWST Advanced Deep Extragalactic Survey (JADES), using high-resolution\nJWST/NIRSpec multi-object spectroscopy of the rest-frame optical emission lines\n[OIII] and H$\\alpha$. The objects are small and of low stellar mass ($\\sim\n1\\,$kpc; $M_*\\sim10^{7-9}\\,{\\rm M_\\odot}$), less massive than any galaxy\nstudied kinematically at $z>1$ thus far. The cold gas masses implied by the\nobserved star formation rates are $\\sim 10\\times$ larger than the stellar\nmasses. We find that their ionised gas is spatially resolved by JWST, with\nevidence for broadened lines and spatial velocity gradients. Using a simple\nthin-disc model, we fit these data with a novel forward modelling software that\naccounts for the complex geometry, point spread function, and pixellation of\nthe NIRSpec instrument. We find the sample to include both rotation- and\ndispersion-dominated structures, as we detect velocity gradients of $v(r_{\\rm\ne})\\approx100-150\\,{\\rm km\\,s^{-1}}$, and find velocity dispersions of\n$\\sigma_0\\approx 30-70\\,{\\rm km\\,s^{-1}}$ that are comparable to those at\ncosmic noon. The dynamical masses implied by these models ($M_{\\rm\ndyn}\\sim10^{9-10}\\,{\\rm M_\\odot}$) are larger than the stellar masses by up to\na factor 40, and larger than the total baryonic mass (gas + stars) by a factor\nof $\\sim 3$. Qualitatively, this result is robust even if the observed velocity\ngradients reflect ongoing mergers rather than rotating discs. Unless the\nobserved emission line kinematics is dominated by outflows, this implies that\nthe centres of these galaxies are dark-matter dominated or that star formation\nis $3\\times$ less efficient, leading to higher inferred gas masses.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["de Graaff","Anna",""],["Rix","Hans-Walter",""],["Carniani","Stefano",""],["Suess","Katherine A.",""],["Charlot","St\u00e9phane",""],["Curtis-Lake","Emma",""],["Arribas","Santiago",""],["Baker","William M.",""],["Boyett","Kristan",""],["Bunker","Andrew J.",""],["Cameron","Alex J.",""],["Chevallard","Jacopo",""],["Curti","Mirko",""],["Eisenstein","Daniel J.",""],["Franx","Marijn",""],["Hainline","Kevin",""],["Hausen","Ryan",""],["Ji","Zhiyuan",""],["Johnson","Benjamin D.",""],["Jones","Gareth C.",""],["Maiolino","Roberto",""],["Maseda","Michael V.",""],["Nelson","Erica",""],["Parlanti","Eleonora",""],["Rawle","Tim",""],["Robertson","Brant",""],["Tacchella","Sandro",""],["\u00dcbler","Hannah",""],["Williams","Christina C.",""],["Willmer","Christopher N. A.",""],["Willott","Chris",""]]}
{"id":"2308.09743","submitter":"Tom\\'as Codina T.Codina","authors":"Tomas Codina, Olaf Hohm and Barton Zwiebach","title":"On black hole singularity resolution in $D=2$ via duality-invariant\n  $\\alpha'$ corrections","comments":"42 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Starting with the two-derivative limit of $D=2$ string theory, we explore the\nspace of T-duality invariant $\\alpha'$ corrections, a space that contains a\npoint representing the fully $\\alpha'$-corrected classical string theory. Using\na parametrization introduced by Gasperini and Veneziano we obtain black hole\nsolutions in this theory space. We prove that the dual of a solution with a\nregular horizon must have a curvature singularity. We find regions in the\ntheory space where the black hole is deformed while preserving the horizon and\nthe singularity, and regions where no black hole appears to exist. Furthermore,\nwe find subregions in this theory space, probably not containing string theory,\nin which the black hole geometry exhibits a horizon leading to an interior\nthat, having no singularity in the metric, curvature, or dilaton, is a regular\ncosmology.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Codina","Tomas",""],["Hohm","Olaf",""],["Zwiebach","Barton",""]]}
{"id":"2308.09744","submitter":"Janakee Raste","authors":"Janakee Raste, Girish Kulkarni, Catherine A. Watkinson, Laura C.\n  Keating, Martin G. Haehnelt","title":"The 21-cm bispectrum from neutral hydrogen islands at z < 6","comments":"12 pages, 12 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":"  Spatial variations in the Lyman-$\\alpha$ forest opacity at $z<6$ seem to\nrequire a late end to cosmic reionization. In this picture, the universe\ncontains neutral hydrogen 'islands' of up to 100 cMpc$/h$ in extent down to\nredshifts as low as $z\\sim 5.3$. This delayed end to reionization also seems to\nbe corroborated by various other observables. An implication of this scenario\nis that the power spectrum of the cosmological 21-cm signal at $z<6$ is\nenhanced relative to conventional reionization models by orders of magnitude.\nHowever, these neutral hydrogen islands are also predicted to be at the\nlocations of the deepest voids in the cosmological large-scale structure. As a\nresult, the distribution of the 21-cm signal from them is highly non-Gaussian.\nWe derive the 21-cm bispectrum signal from these regions using\nhigh-dynamic-range radiative transfer simulations of reionization. We find that\nrelative to conventional models in which reionization is complete at $z>6$, our\nmodel has a significantly larger value of the 21-cm bispectrum. The neutral\nislands also imprint a feature in the isosceles bispectrum at a characteristic\nscale of $\\sim 1$ cMpc$^{-1}$. We also study the 21-cm bispectrum for general\ntriangle configuration by defining a triangle index. It should be possible to\ndetect the 21-cm bispectrum signal at $\\nu\\gtrsim 200$ MHz using SKA1-LOW for\n1080 hours of observation, assuming optimistic foreground removal.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Raste","Janakee",""],["Kulkarni","Girish",""],["Watkinson","Catherine A.",""],["Keating","Laura C.",""],["Haehnelt","Martin G.",""]]}
{"id":"2308.09745","submitter":"Hyeongjin Kim","authors":"Hyeongjin Kim, Anatoli Polkovnikov","title":"Integrability is attractive","comments":"11 pages, 11 figures","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":"  The interplay between quantum chaos and integrability has been extensively\nstudied in the past decades. We approach this topic from the point of view of\ngeometry encoded in the quantum geometric tensor, which describes the\ncomplexity of adiabatic transformations. In particular, we consider two generic\nmodels of spin chains that are parameterized by two independent couplings. In\none, the integrability breaking perturbation is global while, in the other,\nintegrability is broken only at the boundary. In both cases, the shortest paths\nin the coupling space lead towards integrable regions and we argue that this\nbehavior is generic. These regions thus act as attractors of adiabatic flows\nsimilar to river basins in nature. Physically, the directions towards\nintegrable regions are characterized by faster relaxation dynamics than those\nparallel to integrability. The anisotropy between them diverges in the\nthermodynamic limit as the system approaches the integrable point. We argue\nthat these directions also serve as attractors of the couplings' time evolution\nif they are considered as dynamical degrees of freedom. Therefore, generic\nsystems are expected to dynamically self tune themselves to integrable or\nnearly integrable regimes. As a side result, we provide numerical evidence that\nthe model with local integrability breaking quickly becomes chaotic but avoids\nergodicity even in the thermodynamic limit.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","Hyeongjin",""],["Polkovnikov","Anatoli",""]]}
{"id":"2308.09746","submitter":"Sofie Nordahl Erner","authors":"Martin Bauer and Sofie Nordahl Erner","title":"How to measure the spin of invisible states in $e^+e^- \\to \\gamma + X$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We examine the production of an invisible state $X$ together with a photon\n$e^+e^- \\to \\gamma +X$ at electron positron colliders and present measurement\nstrategies that can detect the spin of the invisible state as well as the\nunderlying production mechanism, based on the angular distribution of the final\nstate photon, the cross sections for polarized initial states and the photon\npolarization. Our measurement strategy can be used to identify whether the\ninvisible state is a hidden photon or an axion. The results are compared with a\ndetailed analysis of the Standard Model background and we calculate the\nsensitivity reach for searches for axions and hidden photons at Belle II.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bauer","Martin",""],["Erner","Sofie Nordahl",""]]}
{"id":"2308.09747","submitter":"Philip Plaschke","authors":"Oscar Garcia-Montero, Aleksas Mazeliauskas, Philip Plaschke, S\\\"oren\n  Schlichting","title":"Pre-equilibrium photons from the early stages of heavy-ion collisions","comments":"18 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use QCD kinetic theory to compute photon production in the chemically\nequilibrating Quark-Gluon Plasma created in the early stages of high-energy\nheavy-ion collisions. We do a detailed comparison of pre-equilibrium photon\nrates to the thermal photon production. We show that the photon spectrum\nradiated from a hydrodynamic attractor evolution satisfies a simple scaling\nform in terms of the specific shear viscosity $\\eta/s$ and entropy density\n$dS/d\\zeta \\sim {\\scriptstyle \\left(T\\tau^{1/3}\\right)^{3/2}}_\\infty$. We\nconfirm the analytical predictions with numerical kinetic theory simulations.\nWe use the extracted scaling function to compute the pre-equilibrium photon\ncontribution in $\\sqrt{s_{NN}}=2.76\\,\\text{TeV}$ 0-20\\% PbPb collisions. We\ndemonstrate that our matching procedure allows for a smooth switching from\npre-equilibrium kinetic to thermal hydrodynamic photon production. Finally, our\npublicly available implementation can be straightforwardly added to existing\nheavy ion models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Garcia-Montero","Oscar",""],["Mazeliauskas","Aleksas",""],["Plaschke","Philip",""],["Schlichting","S\u00f6ren",""]]}
{"id":"2308.09748","submitter":"Vijay Balasubramanian","authors":"Vijay Balasubramanian, Yasunori Nomura, Tomonori Ugajin","title":"de Sitter space is sometimes not empty","comments":"50 pages, 13 figures","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple lines of evidence suggest that the Hilbert space of an isolated de\nSitter universe is one dimensional but can appear larger when probed by a\ngravitating observer. To test this idea, we compute the von Neumann entropy of\na field theory in a two-dimensional de Sitter universe which is entangled in a\nthermal-like state with the same field theory on a disjoint, asymptotically\nanti-de Sitter (AdS) black hole. Previously, it was shown that the replica\ntrick for computing the entropy of such entangled gravitating systems requires\nthe inclusion of a non-perturbative effect in quantum gravity -- novel\nwormholes connecting the two spaces. Here we show that: (a) the expected\nwormholes connecting de Sitter and AdS universes exist, avoiding a no-go\ntheorem via the presence of sources on the AdS boundary; (b) the entanglement\nentropy vanishes if the nominal entropy of the de Sitter cosmological horizon\n(S_dS = A_horizon^dS / 4G_N) is less than the entropy of the AdS black hole\nhorizon (S_BH = A_horizon^AdS / 4G_N), i.e., S_dS < S_BH; (c) the entanglement\nentropy is finite when S_dS > S_BH. Thus, the de Sitter Hilbert space is\neffectively nontrivial only when S_dS > S_BH. The AdS black hole we introduce\ncan be regarded as an ``observer'' for de Sitter space. In this sense, our\nresult is a non-perturbative generalization of the recent perturbative argument\nthat the algebra of observables on the de Sitter static patch becomes\nnontrivial in the presence of an observer.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Balasubramanian","Vijay",""],["Nomura","Yasunori",""],["Ugajin","Tomonori",""]]}
{"id":"2308.09749","submitter":"Grant Weldon","authors":"Grant C. Weldon (1), Tuan Do (1), Gunther Witzel (2), Andrea M. Ghez\n  (1), Abhimat K. Gautam (1), Eric E. Becklin (1), Mark R. Morris (1), Gregory\n  D. Martinez (1), Shoko Sakai (1), Jessica R. Lu (3), Keith Matthews (4),\n  Matthew W. Hosek Jr. (1), and Zo\\\"e Haggard (1) ((1) UCLA, (2) Max Planck\n  Institute for Radio Astronomy, (3) UC Berkeley, (4) Caltech)","title":"Near-Infrared Flux Distribution of Sgr A* from 2005-2022: Evidence for\n  an Enhanced Accretion Episode in 2019","comments":"Accepted to ApJ Letters, 26 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sgr A* is the variable electromagnetic source associated with accretion onto\nthe Galactic center supermassive black hole. While the near-infrared (NIR)\nvariability of Sgr A* was shown to be consistent over two decades,\nunprecedented activity in 2019 challenges existing statistical models. We\ninvestigate the origin of this activity by re-calibrating and re-analyzing all\nof our Keck Observatory Sgr A* imaging observations from 2005-2022. We present\nlight curves from 69 observation epochs using the NIRC2 imager at 2.12 $\\mu$m\nwith laser guide star adaptive optics. These observations reveal that the mean\nluminosity of Sgr A* increased by a factor of $\\sim$3 in 2019, and the 2019\nlight curves had higher variance than in all time periods we examined. We find\nthat the 2020-2022 flux distribution is statistically consistent with the\nhistorical sample and model predictions, but with fewer bright measurements\nabove 0.6 mJy at the $\\sim$2$\\sigma$ level. Since 2019, we have observed a\nmaximum $K_s$ (2.2 $\\mu$m) flux of 0.9 mJy, compared to the highest pre-2019\nflux of 2.0 mJy and highest 2019 flux of 5.6 mJy. Our results suggest that the\n2019 activity was caused by a temporary accretion increase onto Sgr A*,\npossibly due to delayed accretion of tidally-stripped gas from the gaseous\nobject G2 in 2014. We also examine faint Sgr A* fluxes over a long time\nbaseline to search for a quasi-steady quiescent state. We find that Sgr A*\ndisplays flux variations over a factor of $\\sim$500, with no evidence for a\nquiescent state in the NIR.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Weldon","Grant C.",""],["Do","Tuan",""],["Witzel","Gunther",""],["Ghez","Andrea M.",""],["Gautam","Abhimat K.",""],["Becklin","Eric E.",""],["Morris","Mark R.",""],["Martinez","Gregory D.",""],["Sakai","Shoko",""],["Lu","Jessica R.",""],["Matthews","Keith",""],["Hosek","Matthew W.","Jr."],["Haggard","Zo\u00eb",""]]}
{"id":"2308.09750","submitter":"Allison Kirkpatrick","authors":"Allison Kirkpatrick, Guang Yang, Aurelien Le Bail, Greg Troiani, Eric\n  F. Bell, Nikko J. Cleri, David Elbaz, Steven L. Finkelstein, Nimish P. Hathi,\n  Michaela Hirschmann, Benne W. Holwerda, Dale D. Kocevski, Ray A. Lucas, Jed\n  McKinney, Casey Papovich, Pablo G. Perez-Gonzalez, Alexander de la Vega,\n  Micaela B. Bagley, Emanuele Daddi, Mark Dickinson, Henry C. Ferguson, Adriano\n  Fontana, Andrea Grazian, Norman A. Grogin, Pablo Arrabal Haro, Jeyhan S.\n  Kartaltepe, Lisa J. Kewley, Anton M. Koekemoer, Jennifer M. Lotz, Laura\n  Pentericci, Nor Pirzkal, Swara Ravindranath, Rachel S. Somerville, Jonathan\n  R. Trump, Stephen M. Wilkins, L. Y. Aaron Yung","title":"CEERS Key Paper VII: JWST/MIRI Reveals a Faint Population of Galaxies at\n  Cosmic Noon Unseen by Spitzer","comments":"21 pages, 10 figures. Resubmitted to ApJS after revision","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Cosmic Evolution Early Release Science (CEERS) program observed the\nExtended Groth Strip with the Mid-Infrared Instrument (MIRI) on the James Webb\nSpace Telescope (JWST) in 2022. In this paper, we discuss the four MIRI\npointings that observed with longer wavelength filters, including F770W,\nF1000W, F1280W, F1500W, F1800W, and F2100W. We compare the MIRI galaxies with\nthe Spitzer/MIPS 24$\\mu$m population in the EGS field. We find that MIRI can\nobserve an order of magnitude deeper than MIPS in significantly shorter\nintegration times, attributable to JWST's much larger aperture and MIRI's\nimproved sensitivity. MIRI is exceptionally good at finding faint ($L_{\\rm\nIR}<10^{10} L_\\odot$) galaxies at $z\\sim1-2$. We find that a significant\nportion of MIRI galaxies are \"mid-IR weak\"--they have strong near-IR emission\nand relatively weaker mid-IR emission, and most of the star formation is\nunobscured. We present new IR templates that capture how the mid-IR to near-IR\nemission changes with increasing infrared luminosity. We present two\ncolor-color diagrams to separate mid-IR weak galaxies and active galactic\nnuclei (AGN) from dusty star-forming galaxies and find that these color\ndiagrams are most effective when used in conjunction with each other. We\npresent the first number counts of 10$\\mu$m sources and find that there are\n$\\lesssim10$ IR AGN per MIRI pointing, possibly due to the difficulty of\ndistinguishing AGN from intrinsically mid-IR weak galaxies (due to low\nmetallicities or low dust content). We conclude that MIRI is most effective at\nobserving moderate luminosity ($L_{\\rm IR}=10^9-10^{10}L_\\odot$) galaxies at\n$z=1-2$, and that photometry alone is not effective at identifying AGN within\nthis faint population.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kirkpatrick","Allison",""],["Yang","Guang",""],["Bail","Aurelien Le",""],["Troiani","Greg",""],["Bell","Eric F.",""],["Cleri","Nikko J.",""],["Elbaz","David",""],["Finkelstein","Steven L.",""],["Hathi","Nimish P.",""],["Hirschmann","Michaela",""],["Holwerda","Benne W.",""],["Kocevski","Dale D.",""],["Lucas","Ray A.",""],["McKinney","Jed",""],["Papovich","Casey",""],["Perez-Gonzalez","Pablo G.",""],["de la Vega","Alexander",""],["Bagley","Micaela B.",""],["Daddi","Emanuele",""],["Dickinson","Mark",""],["Ferguson","Henry C.",""],["Fontana","Adriano",""],["Grazian","Andrea",""],["Grogin","Norman A.",""],["Haro","Pablo Arrabal",""],["Kartaltepe","Jeyhan S.",""],["Kewley","Lisa J.",""],["Koekemoer","Anton M.",""],["Lotz","Jennifer M.",""],["Pentericci","Laura",""],["Pirzkal","Nor",""],["Ravindranath","Swara",""],["Somerville","Rachel S.",""],["Trump","Jonathan R.",""],["Wilkins","Stephen M.",""],["Yung","L. Y. Aaron",""]]}
{"id":"2308.09751","submitter":"Aizhan Akhmetzhanova","authors":"Aizhan Akhmetzhanova, Siddharth Mishra-Sharma, Cora Dvorkin","title":"Data Compression and Inference in Cosmology with Self-Supervised Machine\n  Learning","comments":"13 + 6 pages, 10 + 6 figures","journal-ref":null,"doi":null,"report-no":"MIT-CTP/5596","categories":"astro-ph.CO astro-ph.IM cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The influx of massive amounts of data from current and upcoming cosmological\nsurveys necessitates compression schemes that can efficiently summarize the\ndata with minimal loss of information. We introduce a method that leverages the\nparadigm of self-supervised machine learning in a novel manner to construct\nrepresentative summaries of massive datasets using simulation-based\naugmentations. Deploying the method on hydrodynamical cosmological simulations,\nwe show that it can deliver highly informative summaries, which can be used for\na variety of downstream tasks, including precise and accurate parameter\ninference. We demonstrate how this paradigm can be used to construct summary\nrepresentations that are insensitive to prescribed systematic effects, such as\nthe influence of baryonic physics. Our results indicate that self-supervised\nmachine learning techniques offer a promising new approach for compression of\ncosmological data as well its analysis.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Akhmetzhanova","Aizhan",""],["Mishra-Sharma","Siddharth",""],["Dvorkin","Cora",""]]}
{"id":"2308.09752","submitter":"Seth Kurfman","authors":"Seth W. Kurfman, Denis R. Candido, Brandi Wooten, Yuanhua Zheng,\n  Michael J. Newburger, Shuyu Cheng, Roland K. Kawakami, Joseph P. Heremans,\n  Michael E. Flatt\\'e, and Ezekiel Johnston-Halperin","title":"Magnon Diffusion Length and Longitudinal Spin Seebeck Effect in Vanadium\n  Tetracyanoethylene (V[TCNE]$_x$, $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":"  Spintronic, spin caloritronic, and magnonic phenomena arise from complex\ninteractions between charge, spin, and structural degrees of freedom that are\nchallenging to model and even more difficult to predict. This situation is\ncompounded by the relative scarcity of magnetically-ordered materials with\nrelevant functionality, leaving the field strongly constrained to work with a\nhandful of well-studied systems that do not encompass the full phase space of\nphenomenology predicted by fundamental theory. Here we present an important\nadvance in this coupled theory-experiment challenge, wherein we extend existing\ntheories of the spin Seebeck effect (SSE) to explicitly include the\ntemperature-dependence of magnon non-conserving processes. This expanded theory\nquantitatively describes the low-temperature behavior of SSE signals previously\nmeasured in the mainstay material yttrium iron garnet (YIG) and predicts a new\nregime for magnonic and spintronic materials that have low saturation\nmagnetization, $M_S$, and ultra-low damping. Finally, we validate this\nprediction by directly observing the spin Seebeck resistance (SSR) in the\nmolecule-based ferrimagnetic semiconductor vanadium tetracyanoethylene\n(V[TCNE]$_x$, $x \\sim 2$). These results validate the expanded theory, yielding\nSSR signals comparable in magnitude to YIG and extracted magnon diffusion\nlength ($\\lambda_m>1$ $\\mu$ m) and magnon lifetime for V[TCNE]$_x$\n($\\tau_{th}\\approx 1-10$ $\\mu$ s) exceeding YIG ($\\tau_{th}\\sim 10$ ns).\nSurprisingly, these properties persist to room temperature despite relatively\nlow spin wave stiffness (exchange). This identification of a new regime for\nhighly efficient SSE-active materials opens the door to a new class of magnetic\nmaterials for spintronic and magnonic applications.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kurfman","Seth W.",""],["Candido","Denis R.",""],["Wooten","Brandi",""],["Zheng","Yuanhua",""],["Newburger","Michael J.",""],["Cheng","Shuyu",""],["Kawakami","Roland K.",""],["Heremans","Joseph P.",""],["Flatt\u00e9","Michael E.",""],["Johnston-Halperin","Ezekiel",""]]}
{"id":"2308.09753","submitter":"William Thompson","authors":"William G. Thompson (for the TAMBO Collaboration)","title":"TAMBO: Searching for Tau Neutrinos in the Peruvian Andes","comments":"Presented at ICRC 2023; 10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The detection of high-energy astrophysical neutrinos by IceCube has opened a\nnew window on our Universe. While IceCube has measured the flux of these\nneutrinos at energies up to several PeV, much remains to be discovered\nregarding their origin and nature. Currently, measurements are limited by the\nsmall sample size of astrophysical neutrinos and by the difficulty of\ndiscriminating between electron and tau neutrinos. TAMBO is a next-generation\nneutrino observatory specifically designed to detect tau neutrinos in the 1-100\nPeV energy range, enabling tests of neutrino physics at high energies and the\ncharacterization of astrophysical neutrino sources. The observatory will\ncomprise an array of water Cherenkov and plastic scintillator detectors\ndeployed on the face of the Colca Canyon in the Peruvian Andes. This unique\ngeometry will facilitate a high-purity measurement of astrophysical tau\nneutrino properties. In this talk, I will present the prospects of TAMBO in the\ncontext of next-generation neutrino observatories and provide an overview of\nits current status.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:00:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Thompson","William G.","","for the TAMBO Collaboration"]]}
{"id":"2308.09754","submitter":"Juncheng Wei","authors":"Zaizheng Li, Qidi Zhang, Yifu Zhou, and Juncheng Wei","title":"Long-time dynamics for the energy critical heat equation in $R^5$","comments":"19 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the long-time behavior of global solutions to the energy\ncritical heat equation in $R^5$ \\begin{equation*}\n  \\begin{cases}\n  \\pp_t u=\\Delta u+|u|^{\\frac{4}{3}} u ~&\\mbox{ in }~ R^5 \\times (t_0,\\infty),\n  u(\\cdot,t_0)=u_0~&\\mbox{ in }~ R^5.\n  \\end{cases} \\end{equation*} For $t_0$ sufficiently large, we show the\nexistence of positive solutions for a class of initial value $u_0(x)\\sim\n|x|^{-\\gamma}$ as $|x|\\rightarrow \\infty$ with $\\gamma>\\frac32$ such that the\nglobal solutions behave asymptotically \\begin{equation*}\n  \\| u(\\cdot,t) \\|_{L^\\infty (\\R^5)} \\sim\n  \\begin{cases}\n  t^{-\\frac{3(2-\\gamma)}{2}} ~&\\mbox{ if }~ \\frac32<\\gamma<2\n  (\\ln t)^{-3} ~&\\mbox{ if }~ \\gamma=2\n  1 ~&\\mbox{ if }~ \\gamma>2\n  \\end{cases}\n  \\mbox{ \\ for \\ } t >t_0, \\end{equation*} which is slower than the\nself-similar time decay $t^{-\\frac{3}{4}}$. These rates are inspired by\nFila-King \\cite[Conjecture 1.1]{FilaKing12}.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:01:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Zaizheng",""],["Zhang","Qidi",""],["Zhou","Yifu",""],["Wei","Juncheng",""]]}
{"id":"2308.09755","submitter":"Amol Upadhye","authors":"Amol Upadhye, Juliana Kwan, Ian G. McCarthy, Jaime Salcido, John C.\n  Helly, Roi Kugel, Matthieu Schaller, Joop Schaye, Joey Braspenning, Willem\n  Elbers, Carlos S. Frenk, Marcel P. van Daalen, Bert Vandenbroucke, Jeger C.\n  Broxterman","title":"Non-linear CMB lensing with neutrinos and baryons: FLAMINGO simulations\n  vs. fast approximations","comments":"14 pages, 21 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weak lensing of the cosmic microwave background is rapidly emerging as a\npowerful probe of neutrinos, dark energy, and new physics. We present a fast\ncomputation of the non-linear CMB lensing power spectrum which combines\nnon-linear perturbation theory at early times with power spectrum emulation\nusing cosmological simulations at late times. Comparing our calculation with\nlightcones from the FLAMINGO 5.6 Gpc cube dark-matter-only simulation, we\nconfirm its accuracy to 1% (2%) up to multipoles L = 3000 (L = 5000) for a\nnuLambdaCDM cosmology consistent with current data. Clustering suppression due\nto small-scale baryonic phenomena such as feedback from active galactic nuclei\ncan reduce the lensing power by of order 10%. To our perturbation theory and\nemulator-based calculation we add SP(k), a new fitting function for this\nsuppression, and confirm its accuracy compared to the FLAMINGO hydrodynamic\nsimulations to 4% at L = 5000, with similar accuracy for massive neutrino\nmodels. We further demonstrate that scale-dependent suppression due to\nneutrinos and baryons approximately factorize, implying that a careful\ntreatment of baryonic feedback can limit biasing neutrino mass constraints.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:03:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Upadhye","Amol",""],["Kwan","Juliana",""],["McCarthy","Ian G.",""],["Salcido","Jaime",""],["Helly","John C.",""],["Kugel","Roi",""],["Schaller","Matthieu",""],["Schaye","Joop",""],["Braspenning","Joey",""],["Elbers","Willem",""],["Frenk","Carlos S.",""],["van Daalen","Marcel P.",""],["Vandenbroucke","Bert",""],["Broxterman","Jeger C.",""]]}
{"id":"2308.09756","submitter":"Mintu Mondal Dr","authors":"Sk Kalimuddin, Sudipta Chatterjee, Arnab Bera, Hasan Afzal, Satyabrata\n  Bera, Deep Singha Roy, Soham Das, Tuhin Debnath, Bhavtosh Bansal, and Mintu\n  Mondal","title":"Macroscopic Fluctuations Anticipate the Critical Singularity Far Away\n  from the Charge Density Wave Transition","comments":"7 pages, 4 figures, supplementary","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  $(TaSe_4)_2I$ is a quasi-one-dimensional compound long-known to have a\ncharge-density wave (CDW) transition at around 263 K. We experimentally\nestablish that this transition, unlike what is seen in other CDW compounds such\nas $TaS_2$, is a second-order critical transition. Critical fluctuations in the\nCDW condensate, which couple to the dissipative normal carriers, are slow\nenough to survive the thermodynamic limit and dominate the low-frequency\nresistance noise. Around the transition region, we find a rapid increase in\ntheir relaxation time, as well as a shift of the spectral weight of\nfluctuations to lower frequencies. These are direct signatures of the critical\nslowing down on account of the softening at the hydrodynamic amplitude modes.\nCritical opalescence on the account of diverging isothermal susceptibility is\nalso seen in the very sharp growth of the variance. The distribution of\nfluctuations in the transition region is skewed and strongly non-Gaussian. This\nis on account of the breakdown of the validity of the central limit theorem as\nthe diverging coherence volume becomes comparable to the macroscopic sample\nsize. The temperature window where the fluctuations manifest as slow and\nextended hydrodynamic modes is found to be very wide ($\\delta\\epsilon \\approx\n\\pm 0.1$, where $\\epsilon$ is the reduced critical temperature) but consistent\nwith the Ginzburg criterion.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:04:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kalimuddin","Sk",""],["Chatterjee","Sudipta",""],["Bera","Arnab",""],["Afzal","Hasan",""],["Bera","Satyabrata",""],["Roy","Deep Singha",""],["Das","Soham",""],["Debnath","Tuhin",""],["Bansal","Bhavtosh",""],["Mondal","Mintu",""]]}
{"id":"2308.09757","submitter":"Giorgio Leone","authors":"Giorgio Leone (Unito)","title":"Tachyons and Misaligned Supersymmetry in Orientifold Vacua","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the analysis of Misaligned Supersymmetry to orientifold vacua. The\nlack of modular invariance in the Klein bottle, annulus and M\\\"obius strip\namplitudes implies that the IR properties of the physical spectrum are related\nto the UV behaviour of closed strings freely propagating between D-branes and\nO-planes, and \\emph{vice versa}. We thus build sector averaged sums $\\langle d\n(n) \\rangle$ associated to both representations of each Riemann surface. We\nfind that the $\\langle d (n) \\rangle$'s associated to the loop channel control\nthe coupling of closed-string tachyons to D-branes and/or O-planes, and\ntherefore their vanishing is a necessary, but not sufficient, condition for\nstability in the closed sector. Similarly, the sector averaged sums associated\nto the tree-level amplitudes encode the presence of tachyons in the physical\nspectrum, and their vanishing is a sufficient, but not necessary, condition for\nclassical stability.\n  Using this technology, it is difficult, if not impossible, to formulate\nnecessary and sufficient criteria for the absence of tachyons since, in\norientifold vacua, they can be removed from the spectrum by the orientifold\nprojection. Although in these cases one would naively expect a cancellation\nbetween $\\langle d (n)\\rangle$'s associated to different amplitudes, this does\nnot occur in practice. We provide several examples in ten and lower dimensions\nsupporting our results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:04:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Leone","Giorgio","","Unito"]]}
{"id":"2308.09758","submitter":"Takato Mori Dr.","authors":"Takato Mori","title":"Entanglement structure in quantum many-body systems, field theories, and\n  holography","comments":"PhD Thesis submitted to SOKENDAI, contains previously published\n  papers and additional work, typos are corrected and a reference is added from\n  the published version available at https://ir.soken.ac.jp/records/6647, 254\n  pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this dissertation is to clarify the structure of entanglement, a\ntype of quantum correlations, in various quantum systems with a large number of\ndegrees of freedom for holography between generic quantum systems and\nspacetimes toward a quantum description of our universe. Previous examinations\nof entanglement and holography have focused on specific classes of quantum\nsystems due to the lack of computational techniques in field theory and the\ninherent limitation of holography. This dissertation informs various methods\nand formalisms to overcome these difficulties by extending the target quantum\nsystems with mass and interactions, boundaries, and geometric variational\nansatze. These approaches provide insights into the generalization of\nholography from the bottom up. This dissertation initiates a comprehensive\nstudy beyond conventional holography by establishing new techniques in quantum\nfield theory, holography, and tensor networks. Focusing on entanglement\nentropy, we found it is generally expressed in terms of renormalized two-point\ncorrelators of both fundamental and composite operators. Beyond entanglement\nentropy, we found the operational meaning of the entanglement structure in\ngeneric tensor networks. Furthermore, we established a correct prescription for\nthe AdS/BCFT correspondence with a local operator quench.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:04:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mori","Takato",""]]}
{"id":"2308.09759","submitter":"Banibrata Mukhopadhyay","authors":"Arghya Ranjan Das, Banibrata Mukhopadhyay","title":"QPOs in compact sources as a non-linear hydrodynamical resonance:\n  Determining spin of compact objects","comments":"14 pages including 4 figures (9 pdf figure files) and 2 tables;\n  accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Origin of wide varieties of quasi-periodic oscillation (QPO) observed in\ncompact sources is still not well established. Its frequencies range from mHz\nto kHz spanning all compact objects. Are different QPOs, with different\nfrequencies, originating from different Physics? We propose that the emergence\nof QPOs is the result of nonlinear resonance of fundamental modes present in\naccretion disks forced by external modes including that of the spin of the\nunderlying compact object. Depending on the properties of accreting flow, e.g.\nits velocity and gradient, resonances, and any mode locking, take place at\ndifferent frequencies, exhibiting low to high frequency QPOs. We explicitly\ndemonstrate the origin of higher frequency QPOs for black holes and neutron\nstars by a unified model and outline how the same physics could be responsible\nto produce lower frequency QPOs. The model also predicts the spin of black\nholes, and constrains the radius of neutron stars and the mass of both.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:05:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Das","Arghya Ranjan",""],["Mukhopadhyay","Banibrata",""]]}
{"id":"2308.09760","submitter":"Yves Revaz","authors":"Yves Revaz (EPFL)","title":"The compactness of ultra faint dwarf galaxies : a new challenge ?","comments":"12 pages, 6 figure, 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":"  So far, numerical simulations of ultra-faint dwarf galaxies (UFDs) failed to\nproperly reproduce the observed size-luminosity relation. In particular, no\nhydro-dynamical-run managed to form UFDs with a half light radius as small as\n30 pc as seen in several UFD candidates. We tackle this problem by developing a\nsimple but numerically clean and powerful method in which predictions of the\nstellar content of UFDs from LCDM cosmological hydro-dynamical-simulations is\ncombined with very high resolution dark matter only runs. This method allows to\ntrace the build-up history of UFDs and determine the impact of the merger of\nbuilding-block objects on their final size. We found that, while no UFDs more\ncompact than 20 pc can be formed, slightly larger system are reproduced only if\nall member stars are issued from the same initial mini-halo. However this\nimposes (i) the total virial mass to be smaller than 3x10^8Msol, (ii) the\nstellar content prior to the end of the re-ionisation epoch to be very compact\n(<15 pc) and strongly gravitationally bound, a challenge for current\nhydro-dynamical numerical simulations. If initial stellar building blocks are\nlarger than 35 pc the size of the UFD will extend to 80 pc. Finally, our study\nshows that UFDs keep strong imprints of their build-up history in the form of\nelongated or extended stellar halos. Those features can erroneously be\ninterpreted as tidal signatures.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:05:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Revaz","Yves","","EPFL"]]}
{"id":"2308.09761","submitter":"William Verreault","authors":"Jean-Marie De Koninck, William Verreault","title":"Sums of arithmetic functions running on factorials","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given an arithmetic function $f:\\mathbb{N} \\to \\mathbb{R}$, it is customary\nto investigate the behavior of the corresponding sum ${\\sum_{n\\le N} f(n)}$ for\nlarge $N$. Here, for various classical arithmetic functions $f$, including the\nnumber of distinct prime factors function $\\omega(n)$, Euler totient's function\n$\\phi(n)$, the number of divisors function $d(n)$, the sum of the divisors\nfunction $\\sigma(n)$, as well as the middle divisors functions $\\rho_1(n)$ and\n$\\rho_2(n)$, we investigate the behavior of $f(n!)$ and their corresponding\nsums ${\\sum_{n\\le N} f(n!)}$. Finally, if $\\lambda$ stands for the Liouville\nfunction, according to the Chowla conjecture, ${\\sum_{n\\le N}\n\\lambda(n)\\lambda(n+1)=o(N)}$ as $N\\to \\infty$; here, we show that the analogue\nof the Chowla conjecture for factorial arguments is true as we prove that, as\n$N\\to \\infty$, we have\n  ${\\sum_{n\\le N} \\lambda(n!)\\lambda((n+1)!)=o(N)}$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:07:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["De Koninck","Jean-Marie",""],["Verreault","William",""]]}
{"id":"2308.09762","submitter":"Anna Melnik","authors":"A. M. Melnik, E. N. Podzolkova, A. K. Dambis","title":"Periodic changes in the morphology of the Galactic resonance rings","comments":"21 pages, 12 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the periodic enhancement of either trailing or leading segments of\nthe resonance elliptical rings in the dynamical model of the Galaxy which\nreproduces distributions of observed velocities derived from Gaia DR3 (EDR3)\ndata along the Galactocentric distance. The model disc forms a nuclear ring, an\ninner combined ring and outer resonance rings R1 and R2. The backbone of the\ninner combined ring is banana-type orbits around the Lagrange equilibrium\npoints L4 and L5. Orbits associated with the unstable equilibrium points L1 and\nL2 also support the inner ring. We have found the changes of the morphology of\nthe inner ring with a period of P=0.57+/-0.02 Gyr, which is close to the period\nof revolution along the long-period orbits around the points L4 and L5. A\npossible explanation of these morphological changes is the formation of an\noverdensity which then begins circulating along the closed contour. In the\nregion of the Outer Lindblad Resonance (OLR), we have found the changes of the\nmorphology of the outer rings with a period of P=2.0+/-0.1 Gyr. Probably, the\nmorphological changes of the outer rings are due to the orbits trapped by the\nOLR. These orbits exhibit librations of the direction of orbital elongation\nwith respect to the minor axis of the bar as well as the long-term variations\nin the stellar angular momentum, energy, average radius of the orbit, and\neccentricity. Among many librating orbits, we discovered orbits with the\nlibration period of P=1.91+/-0.01 Gyr, which may cause the morphological\nchanges of the outer rings.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:09:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Melnik","A. M.",""],["Podzolkova","E. N.",""],["Dambis","A. K.",""]]}
{"id":"2308.09763","submitter":"Molly Kaplan","authors":"Molly Kaplan","title":"The Action of Geometric Entropy in Topologically Massive Gravity","comments":"28 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the presence of a gravitational anomaly in topologically massive\ngravity (TMG), the geometric entropy is no longer simply the\nHubeny-Rangamani-Takayanagi (HRT) area; instead, it is given by the HRT area\nplus an anomalous contribution. We study the action of this geometric entropy\non the covariant phase space of classical solutions for TMG with matter fields\nwhose action is algebraic in the metric. The result agrees precisely with the\naction of HRT area operators in Einstein-Hilbert gravity given in\narXiv:2203.04270, i.e., it is a boundary-condition-preserving kink\ntransformation. Furthermore, we show our result to be consistent with direct\ncomputations of semiclassical commutators of geometric entropies in pure TMG\nspacetimes asymptotic to planar AdS, as computed in arXiv:2206.00027.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:10:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaplan","Molly",""]]}
{"id":"2308.09764","submitter":"Vladimir Vlassov","authors":"Junhui Liang, Ying Liu, Vladimir Vlassov","title":"The Impact of Background Removal on Performance of Neural Networks for\n  Fashion Image Classification and Segmentation","comments":"9 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Fashion understanding is a hot topic in computer vision, with many\napplications having great business value in the market. Fashion understanding\nremains a difficult challenge for computer vision due to the immense diversity\nof garments and various scenes and backgrounds. In this work, we try removing\nthe background from fashion images to boost data quality and increase model\nperformance. Having fashion images of evident persons in fully visible\ngarments, we can utilize Salient Object Detection to achieve the background\nremoval of fashion data to our expectations. A fashion image with the\nbackground removed is claimed as the \"rembg\" image, contrasting with the\noriginal one in the fashion dataset. We conducted extensive comparative\nexperiments with these two types of images on multiple aspects of model\ntraining, including model architectures, model initialization, compatibility\nwith other training tricks and data augmentations, and target task types. Our\nexperiments show that background removal can effectively work for fashion data\nin simple and shallow networks that are not susceptible to overfitting. It can\nimprove model accuracy by up to 5% in the classification on the FashionStyle14\ndataset when training models from scratch. However, background removal does not\nperform well in deep neural networks due to incompatibility with other\nregularization techniques like batch normalization, pre-trained initialization,\nand data augmentations introducing randomness. The loss of background pixels\ninvalidates many existing training tricks in the model training, adding the\nrisk of overfitting for deep models.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:18:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liang","Junhui",""],["Liu","Ying",""],["Vlassov","Vladimir",""]]}
{"id":"2308.09765","submitter":"Mario Martone","authors":"Thomas C. Bachlechner, Mario Martone and Marjorie Schillo","title":"Taken by Surprise: Contrast effect for Similarity Scores","comments":"9 pages, 2 figures and 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately evaluating the similarity of object vector embeddings is of\ncritical importance for natural language processing, information retrieval and\nclassification tasks. Popular similarity scores (e.g cosine similarity) are\nbased on pairs of embedding vectors and disregard the distribution of the\nensemble from which objects are drawn. Human perception of object similarity\nsignificantly depends on the context in which the objects appear. In this work\nwe propose the $\\textit{surprise score}$, an ensemble-normalized similarity\nmetric that encapsulates the contrast effect of human perception and\nsignificantly improves the classification performance on zero- and few-shot\ndocument classification tasks. This score quantifies the surprise to find a\ngiven similarity between two elements relative to the pairwise ensemble\nsimilarities. We evaluate this metric on zero/few shot classification and\nclustering tasks and typically find 10-15 % better performance compared to raw\ncosine similarity. Our code is available at\nhttps://github.com/MeetElise/surprise-similarity.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:18:55 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 15:53:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bachlechner","Thomas C.",""],["Martone","Mario",""],["Schillo","Marjorie",""]]}
{"id":"2308.09766","submitter":"Jared Willard","authors":"Jared D. Willard, Charuleka Varadharajan, Xiaowei Jia, Vipin Kumar","title":"Time Series Predictions in Unmonitored Sites: A Survey of Machine\n  Learning Techniques in Water Resources","comments":"37 pages, 4 figures, 1 table, submitted to Environmental Data Science","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prediction of dynamic environmental variables in unmonitored sites remains a\nlong-standing challenge for water resources science. The majority of the\nworld's freshwater resources have inadequate monitoring of critical\nenvironmental variables needed for management. Yet, the need to have widespread\npredictions of hydrological variables such as river flow and water quality has\nbecome increasingly urgent due to climate and land use change over the past\ndecades, and their associated impacts on water resources. Modern machine\nlearning methods increasingly outperform their process-based and empirical\nmodel counterparts for hydrologic time series prediction with their ability to\nextract information from large, diverse data sets. We review relevant\nstate-of-the art applications of machine learning for streamflow, water\nquality, and other water resources prediction and discuss opportunities to\nimprove the use of machine learning with emerging methods for incorporating\nwatershed characteristics into deep learning models, transfer learning, and\nincorporating process knowledge into machine learning models. The analysis here\nsuggests most prior efforts have been focused on deep learning learning\nframeworks built on many sites for predictions at daily time scales in the\nUnited States, but that comparisons between different classes of machine\nlearning methods are few and inadequate. We identify several open questions for\ntime series predictions in unmonitored sites that include incorporating dynamic\ninputs and site characteristics, mechanistic understanding and spatial context,\nand explainable AI techniques in modern machine learning frameworks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:30:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Willard","Jared D.",""],["Varadharajan","Charuleka",""],["Jia","Xiaowei",""],["Kumar","Vipin",""]]}
{"id":"2308.09767","submitter":"Rajan Udwani","authors":"Rajan Udwani","title":"When Stochastic Rewards Reduce to Deterministic Rewards in Online\n  Bipartite Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of vertex-weighted online bipartite matching with\nstochastic rewards where matches may fail with some known probability and the\ndecision maker has to adapt to the sequential realization of these outcomes.\nRecent works have studied several special cases of this problem and it was\nknown that the (randomized) Perturbed Greedy algorithm due to Aggarwal et al.\n(SODA, 2011) achieves the best possible competitive ratio guarantee of\n$(1-1/e)$ in some cases. We give a simple proof of these results by reducing\n(special cases of) the stochastic rewards problem to the deterministic setting\nof online bipartite matching (Karp, Vazirani, Vazirani (STOC, 1990)). More\nbroadly, our approach gives conditions under which it suffices to analyze the\ncompetitive ratio of an algorithm for the simpler setting of deterministic\nrewards in order to obtain a competitive ratio guarantee for stochastic\nrewards. The simplicity of our approach reveals that the Perturbed Greedy\nalgorithm has a competitive ratio of $(1-1/e)$ even in certain settings with\ncorrelated rewards, where no results were previously known. Finally, we show\nthat without any special assumptions, the Perturbed Greedy algorithm has a\ncompetitive ratio strictly less than $(1-1/e)$ for vertex-weighted online\nmatching with stochastic rewards.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:31:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Udwani","Rajan",""]]}
{"id":"2308.09768","submitter":"Anuoluwapo Aremu","authors":"Anuoluwapo Aremu, Jesujoba O. Alabi, David Ifeoluwa Adelani","title":"YORC: Yoruba Reading Comprehension dataset","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 create YORC: a new multi-choice Yoruba Reading\nComprehension dataset that is based on Yoruba high-school reading comprehension\nexamination. We provide baseline results by performing cross-lingual transfer\nusing existing English RACE dataset based on a pre-trained encoder-only model.\nAdditionally, we provide results by prompting large language models (LLMs) like\nGPT-4.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:46:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aremu","Anuoluwapo",""],["Alabi","Jesujoba O.",""],["Adelani","David Ifeoluwa",""]]}
{"id":"2308.09769","submitter":"Nikola Surjanovic","authors":"Nikola Surjanovic, Miguel Biron-Lattes, Paul Tiede, Saifuddin Syed,\n  Trevor Campbell, Alexandre Bouchard-C\\^ot\\'e","title":"Pigeons.jl: Distributed Sampling From Intractable Distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a software package, Pigeons.jl, that provides a way to leverage\ndistributed computation to obtain samples from complicated probability\ndistributions, such as multimodal posteriors arising in Bayesian inference and\nhigh-dimensional distributions in statistical mechanics. Pigeons.jl provides\nsimple APIs to perform such computations single-threaded, multi-threaded,\nand/or distributed over thousands of MPI-communicating machines. In addition,\nPigeons.jl guarantees a property that we call strong parallelism invariance:\nthe output for a given seed is identical irrespective of the number of threads\nand processes, which is crucial for scientific reproducibility and software\nvalidation. We describe the key features of Pigeons.jl and the approach taken\nto implement a distributed and randomized algorithm that satisfies strong\nparallelism invariance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:47:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Surjanovic","Nikola",""],["Biron-Lattes","Miguel",""],["Tiede","Paul",""],["Syed","Saifuddin",""],["Campbell","Trevor",""],["Bouchard-C\u00f4t\u00e9","Alexandre",""]]}
{"id":"2308.09770","submitter":"Gregory Foote","authors":"Gregory Foote (for the VERITAS collaboration)","title":"Exploring the Potential of the Pulsed Laser onboard the CALIPSO\n  Satellite to Improve Calibration with VERITAS","comments":"9 pages, 2 figures, Proceedings for the 38th International Cosmic Ray\n  Conference (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.1496","report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Imaging Atmospheric Cherenkov Telescopes (IACTs) are used to detect bright\nnanosecond-duration flashes of optical light originating from interactions of\ncosmic/gamma-rays in the atmosphere. A natural calibration source with similar\ncharacteristics does not exist; however, satellite-based laser systems provide\na potential alternative. The CALIPSO satellite is one such facility which uses\na suite of instruments to gather information about the atmosphere. Of\nparticular interest is the CALIOP instrument, which emits 20-nanosecond laser\npulses at 1064 nm and 532 nm at a rate of 20 Hz towards the Earth. The\nTAIGA-HiSCORE collaboration announced a detection of CALIOP laser pulses at the\n37th ICRC in 2021, demonstrating that the laser footprint extends to at least\ntens of kilometers from the subsatellite point. We have used the VERITAS IACT\nto observe CALIPSO, and show here the results of using these observations to\nhelp to calibrate the array. We also discuss the potential of this technique\nfor cross-calibration between different IACT facilities and for relative\ncalibration between the telescopes of future large arrays.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:47:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Foote","Gregory","","for the VERITAS collaboration"]]}
{"id":"2308.09771","submitter":"Hua-Chieh Shao","authors":"Hua-Chieh Shao, Tielige Mengke, Jie Deng, and You Zhang","title":"3D cine-magnetic resonance imaging using spatial and temporal implicit\n  neural representation learning (STINR-MR)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The reconstruction of 3D cine-MRI is challenged by highly undersampled\nk-space data in each cine frame, due to the slow speed of MR signal\nacquisition. We proposed a machine learning-based framework, spatial and\ntemporal implicit neural representation learning (STINR-MR), for accurate 3D\ncine-MRI reconstruction from highly undersampled data. STINR-MR used a joint\nreconstruction and deformable registration approach to address the ill-posed\nspatiotemporal reconstruction problem, by solving a reference-frame 3D MR image\nand a corresponding motion model which deforms the reference frame to each cine\nframe. The reference-frame image was reconstructed as a spatial implicit neural\nrepresentation (INR) network, which learns the mapping from input 3D spatial\ncoordinates to corresponding MR values. The dynamic motion model was\nconstructed via a temporal INR, as well as basis deformation vector\nfields(DVFs) extracted from prior/onboard 4D-MRIs. The learned INR encodes\ninput time points and outputs corresponding weighting factors to combine the\nbasis DVFs into time-resolved motion fields. STINR-MR was evaluated using MR\ndata simulated from the 4D extended cardiac-torso (XCAT) digital phantom and MR\ndata acquired clinically from a healthy human subject. Its reconstruction\naccuracy was also compared with that of the model-based non-rigid motion\nestimation method (MR-MOTUS). STINR-MR can reconstruct 3D cine-MR images with\nhigh temporal (<100 ms) and spatial (3 mm) resolutions to accurately capture\ndifferent irregular motion patterns. Compared with MR-MOTUS, STINR-MR\nconsistently reconstructed images with better quality, fewer artifacts, and\nachieved superior tumor localization accuracy. STINR-MR provides a lightweight\nand efficient framework for accurate 3D cine-MRI reconstruction, and does not\nrequire external data for pre-training to avoid generalizability issues\nencountered in deep learning methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:48:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shao","Hua-Chieh",""],["Mengke","Tielige",""],["Deng","Jie",""],["Zhang","You",""]]}
{"id":"2308.09772","submitter":"Avimita Chatterjee","authors":"Subrata Das, Avimita Chatterjee and Swaroop Ghosh","title":"A First Order Survey of Quantum Supply Dynamics and Threat Landscapes","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Quantum computing, with its transformative computational potential, is\ngaining prominence in the technological landscape. As a new and exotic\ntechnology, quantum computers involve innumerable Intellectual Property (IP) in\nthe form of fabrication recipe, control electronics and software techniques, to\nname a few. Furthermore, complexity of quantum systems necessitates extensive\ninvolvement of third party tools, equipment and services which could risk the\nIPs and the Quality of Service and enable other attack surfaces. This paper is\na first attempt to explore the quantum computing ecosystem, from the\nfabrication of quantum processors to the development of specialized software\ntools and hardware components, from a security perspective. By investigating\nthe publicly disclosed information from industry front runners like IBM,\nGoogle, Honeywell and more, we piece together various components of quantum\ncomputing supply chain. We also uncover some potential vulnerabilities and\nattack models and suggest defenses. We highlight the need to scrutinize the\nquantum computing supply chain further through the lens of security.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:48:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Das","Subrata",""],["Chatterjee","Avimita",""],["Ghosh","Swaroop",""]]}
{"id":"2308.09773","submitter":"Jeff E. Sonier","authors":"N. Azari, M. Yakovlev, N. Rye, S. R. Dunsiger, S. Sundar, M. M.\n  Bordelon, S. M. Thomas, J. D. Thompson, P. F. S. Rosa, J. E. Sonier","title":"Absence of Spontaneous Magnetic Fields Due to Time-Reversal Symmetry\n  Breaking in Bulk Superconducting UTe2","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have investigated the low-temperature local magnetic properties in the\nbulk of molten salt-flux (MSF) grown single crystals of the candidate\nodd-parity superconductor UTe2 by zero-field muon spin relaxation (muSR). In\ncontrast to previous muSR studies of UTe2 single crystals grown by a chemical\nvapour transport (CVT) method, we find no evidence of magnetic clusters or\nelectronic moments fluctuating slow enough to cause a discernible relaxation of\nthe zero-field muSR asymmetry spectrum. Consequently, our measurements on\nMSF-grown single crystals rule out the generation of spontaneous magnetic\nfields in the bulk that would occur near impurities or lattice defects if the\nsuperconducting state of UTe2 breaks time-reversal symmetry. This result\nsuggests UTe2 is characterized by a single-component superconducting order\nparameter.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:52:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Azari","N.",""],["Yakovlev","M.",""],["Rye","N.",""],["Dunsiger","S. R.",""],["Sundar","S.",""],["Bordelon","M. M.",""],["Thomas","S. M.",""],["Thompson","J. D.",""],["Rosa","P. F. S.",""],["Sonier","J. E.",""]]}
{"id":"2308.09774","submitter":"Rajeev Kohli","authors":"Rajeev Kohli","title":"Rogers-Ramanujan continued fraction and approximations to\n  $\\mathbf{2\\pi}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We observe that certain famous evaluations of the Rogers-Ramanujan continued\nfraction $R(q)$ are close to $2\\pi-6$ and $(2\\pi-6)/2\\pi$, and that $2\\pi-6$\ncan be expressed by a Rogers-Ramanujan continued fraction in which $q$ is very\nnearly equal to $R^5(e^{-2\\pi})$. The value of $-{5\\over \\alpha}\\ln\nR(e^{-2\\alpha \\pi})$ converges to $2\\pi$ as $\\alpha$ increases. For\n$\\alpha=5^n$, a modular equation by Ramanujan provides recursive closed-form\nexpressions that approximate the value of $2\\pi$, the number of correct digits\nincreasing by a factor of five each time $n$ increases by one. If we forgo\nclosed-form expressions, a modular equation by Rogers allows numerical\niterations that converge still faster to $2\\pi$, each iteration increasing the\nnumber of correct digits by a multiple of eleven.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:52:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kohli","Rajeev",""]]}
{"id":"2308.09775","submitter":"Dawit Mureja Argaw","authors":"Dawit Mureja Argaw, Joon-Young Lee, Markus Woodson, In So Kweon,\n  Fabian Caba Heilbron","title":"Long-range Multimodal Pretraining for Movie Understanding","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning computer vision models from (and for) movies has a long-standing\nhistory. While great progress has been attained, there is still a need for a\npretrained multimodal model that can perform well in the ever-growing set of\nmovie understanding tasks the community has been establishing. In this work, we\nintroduce Long-range Multimodal Pretraining, a strategy, and a model that\nleverages movie data to train transferable multimodal and cross-modal encoders.\nOur key idea is to learn from all modalities in a movie by observing and\nextracting relationships over a long-range. After pretraining, we run ablation\nstudies on the LVU benchmark and validate our modeling choices and the\nimportance of learning from long-range time spans. Our model achieves\nstate-of-the-art on several LVU tasks while being much more data efficient than\nprevious works. Finally, we evaluate our model's transferability by setting a\nnew state-of-the-art in five different benchmarks.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:52:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Argaw","Dawit Mureja",""],["Lee","Joon-Young",""],["Woodson","Markus",""],["Kweon","In So",""],["Heilbron","Fabian Caba",""]]}
{"id":"2308.09776","submitter":"David B. Massey","authors":"David Massey","title":"A lower bound on the top Betti number of the Milnor fiber","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive a lower bound for the top possibly-non-zero Betti number of the\nMilnor fiber of an analytic function in terms of the zero-dimensional L\\^e\nnumber and the internal monodromy of the vanishing cycles restricted to the\ncomplex link of the critical locus of the function.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:52:59 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:05:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Massey","David",""]]}
{"id":"2308.09777","submitter":"Sukanta Nandi","authors":"Sukanta Nandi, Shany Z. Cohen, Danveer Singh, Michal Poplinger,\n  Pilkhaz Nanikashvili, Doron Naveh, Tomer Lewi","title":"High-Index Topological Insulator Resonant Nanostructures from Bismuth\n  Selenide","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Topological insulators (TIs) are a class of materials characterized by an\ninsulting bulk and high mobility topologically protected surface states, making\nthem promising candidates for future optoelectronic and quantum devices.\nAlthough their electronic and transport properties have been extensively\nstudied, their optical properties and prospective photonic capabilities have\nnot been fully uncovered. Here, we use a combination of far-field and\nnear-field nanoscale imaging and spectroscopy, to study CVD grown Bi2Se3\nnanobeams (NBs). We first extract the mid-infrared (MIR) optical constants of\nBi2Se3, revealing refractive index values as high as n ~6.4, and demonstrate\nthat the NBs support Mie-resonances across the MIR. Local near-field reflection\nphase mapping reveals domains of various phase shifts, providing information on\nthe local optical properties of the NBs. We experimentally measure up to 2{\\pi}\nphase-shift across the resonance, in excellent agreement with FDTD simulations.\nThis work highlights the potential of TI Bi2Se3 for quantum circuitry,\nnon-linear generation, high-Q metaphotonics, and IR photodetection.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:58:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nandi","Sukanta",""],["Cohen","Shany Z.",""],["Singh","Danveer",""],["Poplinger","Michal",""],["Nanikashvili","Pilkhaz",""],["Naveh","Doron",""],["Lewi","Tomer",""]]}
{"id":"2308.09778","submitter":"Navid Rajabi","authors":"Navid Rajabi, Jana Kosecka","title":"Towards Grounded Visual Spatial Reasoning in Multi-Modal Vision Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the advances in large scale vision-and-language models (VLMs) it is of\ninterest to assess their performance on various visual reasoning tasks such as\ncounting, referring expressions and general visual question answering. The\nfocus of this work is to study the ability of these models to understanding\nspatial relations. Previously, this has been tackled using image-text matching\n(Liu, Emerson, and Collier 2022) or visual question answering task, both\nshowing poor performance and a large gap compared to human performance. To\nbetter understand the gap, we present fine-grained compositional grounding of\nspatial relationships and propose a bottom up approach for ranking spatial\nclauses and evaluating the performance of spatial relationship reasoning task.\nWe propose to combine the evidence from grounding noun phrases corresponding to\nobjects and their locations to compute the final rank of the spatial clause. We\ndemonstrate the approach on representative vision-language models (Tan and\nBansal 2019; Gupta et al. 2022; Kamath et al. 2021) and compare and highlight\ntheir abilities to reason about spatial relationships.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:58:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rajabi","Navid",""],["Kosecka","Jana",""]]}
{"id":"2308.09779","submitter":"Yichen Yan","authors":"Yichen Yan, Xingjian He, Wenxuan Wang, Sihan Chen, Jing Liu","title":"EAVL: Explicitly Align Vision and Language for Referring Image\n  Segmentation","comments":"10 pages, 4 figures. arXiv admin note: text overlap with\n  arXiv:2305.14969","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Referring image segmentation aims to segment an object mentioned in natural\nlanguage from an image. A main challenge is language-related localization,\nwhich means locating the object with the relevant language. Previous approaches\nmainly focus on the fusion of vision and language features without fully\naddressing language-related localization. In previous approaches, fused\nvision-language features are directly fed into a decoder and pass through a\nconvolution with a fixed kernel to obtain the result, which follows a similar\npattern as traditional image segmentation. This approach does not explicitly\nalign language and vision features in the segmentation stage, resulting in a\nsuboptimal language-related localization. Different from previous methods, we\npropose Explicitly Align the Vision and Language for Referring Image\nSegmentation (EAVL). Instead of using a fixed convolution kernel, we propose an\nAligner which explicitly aligns the vision and language features in the\nsegmentation stage. Specifically, a series of unfixed convolution kernels are\ngenerated based on the input l, and then are use to explicitly align the vision\nand language features. To achieve this, We generate multiple queries that\nrepresent different emphases of the language expression. These queries are\ntransformed into a series of query-based convolution kernels. Then, we utilize\nthese kernels to do convolutions in the segmentation stage and obtain a series\nof segmentation masks. The final result is obtained through the aggregation of\nall masks. Our method can not only fuse vision and language features\neffectively but also exploit their potential in the segmentation stage. And\nmost importantly, we explicitly align language features of different emphases\nwith the image features to achieve language-related localization. Our method\nsurpasses previous state-of-the-art methods on RefCOCO, RefCOCO+, and G-Ref by\nlarge margins.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:59:27 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 00:27:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yan","Yichen",""],["He","Xingjian",""],["Wang","Wenxuan",""],["Chen","Sihan",""],["Liu","Jing",""]]}
{"id":"2308.09780","submitter":"Tao Zou","authors":"Tao Zou, Le Yu, Leilei Sun, Bowen Du, Deqing Wang, Fuzhen Zhuang","title":"Event-based Dynamic Graph Representation Learning for Patent Application\n  Trend Prediction","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate prediction of what types of patents that companies will apply for in\nthe next period of time can figure out their development strategies and help\nthem discover potential partners or competitors in advance. Although important,\nthis problem has been rarely studied in previous research due to the challenges\nin modelling companies' continuously evolving preferences and capturing the\nsemantic correlations of classification codes. To fill in this gap, we propose\nan event-based dynamic graph learning framework for patent application trend\nprediction. In particular, our method is founded on the memorable\nrepresentations of both companies and patent classification codes. When a new\npatent is observed, the representations of the related companies and\nclassification codes are updated according to the historical memories and the\ncurrently encoded messages. Moreover, a hierarchical message passing mechanism\nis provided to capture the semantic proximities of patent classification codes\nby updating their representations along the hierarchical taxonomy. Finally, the\npatent application trend is predicted by aggregating the representations of the\ntarget company and classification codes from static, dynamic, and hierarchical\nperspectives. Experiments on real-world data demonstrate the effectiveness of\nour approach under various experimental conditions, and also reveal the\nabilities of our method in learning semantics of classification codes and\ntracking technology developing trajectories of companies.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 05:43:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zou","Tao",""],["Yu","Le",""],["Sun","Leilei",""],["Du","Bowen",""],["Wang","Deqing",""],["Zhuang","Fuzhen",""]]}
{"id":"2308.09781","submitter":"Gray Reid","authors":"Gray D. Reid, Matthew W. Choptuik","title":"Stability of Non-Minimally Coupled Topological-Defect Boson Stars","comments":"19 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As shown by Marunovic and Murkovic, non-minimal d-stars, composite structures\nconsisting of a boson star and a global monopole non-minimally coupled to the\ngeneral relativistic field, can have extremely high gravitational compactness.\nIn a previous paper we demonstrated that these ground-state stationary\nsolutions are sometimes additionally characterized by shells of bosonic matter\nlocated far from the center of symmetry. In order to investigate the question\nof stability posed by Marunovic and Murkovic, we investigate the stability of\nseveral families of d-stars using both numerical simulations and linear\nperturbation theory. For all families investigated, we find that the most\nhighly compact solutions, along with those solutions exhibiting shells of\nbosonic matter, are unstable to radial perturbations and are therefore poor\ncandidates for astrophysically-relevant black hole mimickers or other highly\ncompact stable objects.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:05:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Reid","Gray D.",""],["Choptuik","Matthew W.",""]]}
{"id":"2308.09782","submitter":"Qiang Xu","authors":"Qiang Xu, Mauro Del Ben, Mahmut Sait Okyay, Min Choi, Khaled Z.\n  Ibrahim, Bryan M. Wong","title":"Velocity-gauge real-time time-dependent density functional tight-binding\n  for large-scale condensed matter systems","comments":"23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new velocity-gauge real-time, time-dependent density functional\ntight-binding (VG-rtTDDFTB) implementation in the open-source DFTB+ software\npackage (https://dftbplus.org) for probing electronic excitations in large,\ncondensed matter systems. Our VG-rtTDDFTB approach enables real-time electron\ndynamics simulations of large, periodic, condensed matter systems containing\nthousands of atoms with a favorable computational scaling as a function of\nsystem size. We provide computational details and benchmark calculations to\ndemonstrate its accuracy and computational parallelizability on a variety of\nlarge material systems. As a representative example, we calculate laser-induced\nelectron dynamics in a 512-atom amorphous silicon supercell to highlight the\nlarge periodic systems that can be examined with our implementation. Taken\ntogether, our VG-rtTDDFTB approach enables new electron dynamics simulations of\ncomplex systems that require large periodic supercells, such as crystal\ndefects, complex surfaces, nanowires, and amorphous materials.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:12:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Qiang",""],["Del Ben","Mauro",""],["Okyay","Mahmut Sait",""],["Choi","Min",""],["Ibrahim","Khaled Z.",""],["Wong","Bryan M.",""]]}
{"id":"2308.09783","submitter":"Rich Ryan","authors":"Rich Ryan","title":"Discretionary Extensions to Unemployment-Insurance Compensation and Some\n  Potential Costs for a McCall Worker","comments":"62 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unemployment insurance provides temporary cash benefits to eligible\nunemployed workers. Benefits are sometimes extended by discretion during\neconomic slumps. In a model that features temporary benefits and sequential job\nopportunities, a worker's reservation wages are studied when policymakers can\nmake discretionary extensions to benefits. A worker's optimal labor-supply\nchoice is characterized by a sequence of reservation wages that increases with\nweeks of remaining benefits. The possibility of an extension raises the entire\nsequence of reservation wages, meaning a worker is more selective when\naccepting job offers throughout their spell of unemployment. The welfare\nconsequences of misperceiving the probability and length of an extension are\ninvestigated. In a numerical example, the costs of misperception are small,\nwhich has implications for policymakers considering economic slumps, virus\npandemics, extreme heat, and natural disasters.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:16:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ryan","Rich",""]]}
{"id":"2308.09784","submitter":"Peyman Azodi","authors":"Peyman Azodi, Herschel A Rabitz","title":"Dynamics and Geometry of Entanglement in Many-Body Quantum Systems","comments":"arXiv admin note: text overlap with arXiv:2201.11223","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":"  A new framework is formulated to study entanglement dynamics in many-body\nquantum systems along with an associated geometric description. In this\nformulation, called the Quantum Correlation Transfer Function (QCTF), the\nsystem's wave function or density matrix is transformed into a new space of\ncomplex functions with isolated singularities. Accordingly, entanglement\ndynamics is encoded in specific residues of the QCTF, and importantly, the\nexplicit evaluation of the system's time dependence is avoided. Notably, the\nQCTF formulation allows for various algebraic simplifications and\napproximations to address the normally encountered complications due to the\nexponential growth of the many-body Hilbert space with the number of bodies.\nThese simplifications are facilitated through considering the patterns, in lieu\nof the elements, lying within the system's state. Consequently, a main finding\nof this paper is the exterior (Grassmannian) algebraic expression of many-body\nentanglement as the collective areas of regions in the Hilbert space spanned by\npairs of projections of the wave function onto an arbitrary basis. This latter\ngeometric measure is shown to be equivalent to the second-order Renyi entropy.\nAdditionally, the geometric description of the QCTF shows that characterizing\nfeatures of the reduced density matrix can be related to experimentally\nobservable quantities. The QCTF-based geometric description offers the prospect\nof theoretically revealing aspects of many-body entanglement, by drawing on the\nvast scope of methods from geometry.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:16:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Azodi","Peyman",""],["Rabitz","Herschel A",""]]}
{"id":"2308.09785","submitter":"Stanley P. Gudder","authors":"Stan Gudder","title":"Measurement Models with Separable Interaction Channels","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Measurement models (MMs) stand at the highest structural level of quantum\nmeasurement theory. MMs can be employed to construct instruments which stand at\nthe next level. An instrument is thought of as an apparatus that is used to\nmeasure observables and update states. Observables, which are still at the next\nlevel, are used to determine probabilities of quantum events. The main\ningredient of an MM is an interaction channel $\\nu$ between the system being\nmeasured and a probe system. For a general $\\nu$, the measured observable $A$\nneed not have an explicit useful form. In this work we introduce a condition\nfor $\\nu$ called separability and in this case $A$ has an explicit form. Under\nthe assumption that $\\nu$ is separable, we study product MMs and conditioned\nMMs. We also consider the statistics of MMs and their uncertainty principle.\nVarious concepts are illustrated using examples of L\\\"uders and Holevo\ninstruments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:17:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gudder","Stan",""]]}
{"id":"2308.09786","submitter":"Yuya Makino","authors":"Yuya Makino (for the IceCube-Gen2 Collaboration)","title":"Mechanical design of the optical modules intended for 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-979","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IceCube-Gen2 is an expansion of the IceCube neutrino observatory at the South\nPole that aims to increase the sensitivity to high-energy neutrinos by an order\nof magnitude. To this end, about 10,000 new optical modules will be installed,\ninstrumenting a fiducial volume of about 8 km^3. Two newly developed optical\nmodule types increase current sensitivity per module by a factor of three by\nintegrating 16 and 18 newly developed four-inch PMTs in specially designed\n12.5-inch diameter pressure vessels. Both designs use conical silicone gel pads\nto optically couple the PMTs to the pressure vessel to increase photon\ncollection efficiency. The outside portion of gel pads are pre-cast onto each\nPMT prior to integration, while the interiors are filled and cast after the PMT\nassemblies are installed in the pressure vessel via a pushing mechanism. This\npaper presents both the mechanical design, as well as the performance of\nprototype modules at high pressure (70 MPa) and low temperature (-40 degree\nCelsius), characteristic of the environment inside the South Pole ice.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:20:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Makino","Yuya","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.09787","submitter":"Satyaki Kundu","authors":"Satyaki Kundu, Ranjan Kumar Patel, Srimanta Middey and Bhavtosh Bansal","title":"Dynamic hysteresis at a noisy saddle-node shows power-law scaling but\n  nonuniversal exponent","comments":"13 pages, 13 figures","journal-ref":"Phys. Rev. E 108, 024101 (2023)","doi":"10.1103/PhysRevE.108.024101","report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic hysteresis, viz., delay in switching of a bistable system on account\nof the finite sweep rate of the drive has been extensively studied in dynamical\nand thermodynamic systems. Dynamic hysteresis results from slowing of the\nresponse around a saddle-node bifurcation. As a consequence, the hysteresis\narea increases with the sweep rate. Mean-field theory, relevant for noise-free\nsituations, predicts power law scaling with the area scaling exponent of 2/3.\nWe have experimentally investigated the dynamic hysteresis for a\nthermally-driven metal-insulator transition in a high quality NdNiO$_3$ thin\nfilm and found the scaling exponent to be about 1/3, far less than the mean\nfield value. To understand this, we have numerically studied Langevin dynamics\nof the order parameter and found that noise, which can be thought to parallel\nfinite temperature effects, influences the character of dynamic hysteresis by\nsystematically lowering the dynamical exponent to as small as 0.2. The power\nlaw scaling character, on the other hand, is unaffected in the range of chosen\nparameters. This work rationalizes the ubiquitous power law scaling of the\ndynamic hysteresis as well as the wide variation in the scaling exponent\nbetween 0.66 and 0.2 observed in different systems over the last 30 years.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:20:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kundu","Satyaki",""],["Patel","Ranjan Kumar",""],["Middey","Srimanta",""],["Bansal","Bhavtosh",""]]}
{"id":"2308.09788","submitter":"Ganesh Prasad","authors":"Jyotsna Rani and Deepak Mishra and Ganesh Prasad and Ashraf Hossain\n  and Swades De and Kuntal Deka","title":"Joint Optimization of IRS Deployment and Passive Beamforming to Enhance\n  the Received Power","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":"  Intelligent reflecting surface (IRS) has recently emerged as a promising\ntechnology for beyond fifth-generation (B5G) and 6G networks conceived from\nmetamaterials that smartly tunes the signal reflections via a large number of\nlow-cost passive reflecting elements. However, the IRS-assisted communication\nmodel and the optimization of available resources needs to be improved further\nfor more efficient communications. This paper investigates the enhancement of\nreceived power at the user end in an IRS assisted wireless communication by\njointly optimizing the phase shifts at the IRS elements and its location.\nEmploying the conventional Friss transmission model, the relationship between\nthe transmitted power and reflected power is established. The expression of\nreceived power incorporates the free space loss, reflection loss factor,\nphysical dimension of the IRS panel, and radiation pattern of the transmit\nsignal. Also, the expression of reflection coefficient of IRS panel is obtained\nby exploiting the existing data of radar communications. Initially exploring a\nsingle IRS element within a two-ray reflection model, we extend it to a more\ncomplex multi-ray reflection model with multiple IRS elements in 3D Cartesian\nspace. The received power expression is derived in a more tractable form, then,\nit is maximized by jointly optimizing the underlying underlying variables, the\nIRS location and the phase shifts. To realize the joint optimization of\nunderlying variables, first, the phase shifts of the IRS elements are optimized\nto achieve constructive interference of received signal components at the user.\nSubsequently, the location of the IRS is optimized at the obtained optimal\nphase shifts. Numerical insights and performance comparison reveal that joint\noptimization leads to a substantial 37% enhancement in received power compared\nto the closest competitive benchmark scheme.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:21:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rani","Jyotsna",""],["Mishra","Deepak",""],["Prasad","Ganesh",""],["Hossain","Ashraf",""],["De","Swades",""],["Deka","Kuntal",""]]}
{"id":"2308.09789","submitter":"Jeremy Bertomeu","authors":"Jeremy Bertomeu","title":"Managers' Choice of Disclosure Complexity","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":"  Aghamolla and Smith (2023) make a significant contribution to enhancing our\nunderstanding of how managers choose financial reporting complexity. I outline\nthe key assumptions and implications of the theory, and discuss two empirical\nimplications: (1) a U-shaped relationship between complexity and returns, and\n(2) a negative association between complexity and investor sophistication.\nHowever, the robust equilibrium also implies a counterfactual positive market\nresponse to complexity. I develop a simplified approach in which simple\ndisclosures indicate positive surprises, and show that this implies greater\ninvestor skepticism toward complexity and a positive association between\ninvestor sophistication and complexity. More work is needed to understand\ncomplexity as an interaction of reporting and economic transactions, rather\nthan solely as a reporting phenomenon.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:21:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bertomeu","Jeremy",""]]}
{"id":"2308.09790","submitter":"Yuan Yuan","authors":"Yuan Yuan, Kristen M. Altenburger","title":"A Two-Part Machine Learning Approach to Characterizing Network\n  Interference in A/B Testing","comments":"33 pages, 5 figures, and appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The reliability of controlled experiments, or \"A/B tests,\" can often be\ncompromised due to the phenomenon of network interference, wherein the outcome\nfor one unit is influenced by other units. To tackle this challenge, we propose\na machine learning-based method to identify and characterize heterogeneous\nnetwork interference. Our approach accounts for latent complex network\nstructures and automates the task of \"exposure mapping'' determination, which\naddresses the two major limitations in the existing literature. We introduce\n\"causal network motifs'' and employ transparent machine learning models to\nestablish the most suitable exposure mapping that reflects underlying network\ninterference patterns. Our method's efficacy has been validated through\nsimulations on two synthetic experiments and a real-world, large-scale test\ninvolving 1-2 million Instagram users, outperforming conventional methods such\nas design-based cluster randomization and analysis-based neighborhood exposure\nmapping. Overall, our approach not only offers a comprehensive, automated\nsolution for managing network interference and improving the precision of A/B\ntesting results, but it also sheds light on users' mutual influence and aids in\nthe refinement of marketing strategies.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:37:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yuan","Yuan",""],["Altenburger","Kristen M.",""]]}
{"id":"2308.09791","submitter":"Sayed Pedram Haeri Boroujeni","authors":"Niloufar Mehrabi, Sayed Pedram Haeri Boroujeni, Elnaz Pashaei","title":"An Efficient High-Dimensional Gene Selection Approach based on Binary\n  Horse Herd Optimization Algorithm for Biological Data Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Horse Herd Optimization Algorithm (HOA) is a new meta-heuristic algorithm\nbased on the behaviors of horses at different ages. The HOA was introduced\nrecently to solve complex and high-dimensional problems. This paper proposes a\nbinary version of the Horse Herd Optimization Algorithm (BHOA) in order to\nsolve discrete problems and select prominent feature subsets. Moreover, this\nstudy provides a novel hybrid feature selection framework based on the BHOA and\na minimum Redundancy Maximum Relevance (MRMR) filter method. This hybrid\nfeature selection, which is more computationally efficient, produces a\nbeneficial subset of relevant and informative features. Since feature selection\nis a binary problem, we have applied a new Transfer Function (TF), called\nX-shape TF, which transforms continuous problems into binary search spaces.\nFurthermore, the Support Vector Machine (SVM) is utilized to examine the\nefficiency of the proposed method on ten microarray datasets, namely Lymphoma,\nProstate, Brain-1, DLBCL, SRBCT, Leukemia, Ovarian, Colon, Lung, and MLL. In\ncomparison to other state-of-the-art, such as the Gray Wolf (GW), Particle\nSwarm Optimization (PSO), and Genetic Algorithm (GA), the proposed hybrid\nmethod (MRMR-BHOA) demonstrates superior performance in terms of accuracy and\nminimum selected features. Also, experimental results prove that the X-Shaped\nBHOA approach outperforms others methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:40:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mehrabi","Niloufar",""],["Boroujeni","Sayed Pedram Haeri",""],["Pashaei","Elnaz",""]]}
{"id":"2308.09792","submitter":"Lixin Ge","authors":"Lixin Ge (1), Zenghai Li (1), Cho-Kuen Ng (1), Liling Xiao (1),\n  Hiroyasu Ego (2), Yoshinori Enomoto (2), Hiroshi Iwase (2), Yu Morikawa (2),\n  Takashi Yoshimoto (2) ((1) SLAC Stanford, CA 94025, USA, (2) KEK, 1-1 Oho,\n  Tsukuba, Ibaraki, Japan )","title":"An Integrated Simulation Tool for Dark Current Radiation Effects Using\n  ACE3P and Geant4","comments":"10 pages, 8 figures. Talk presented at the International Workshop on\n  Future Linear Colliders (LCWS 2023), 15-19 May 2023. C23-05-15.3","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.acc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A simulation workflow is under development to interface particle data\ntransfer and matching of geometry between the electromagnetic (EM) cavity\nsimulation code ACE3P and radiation code Geant4. The target is to simulate dark\ncurrent (DC) radiation effects for the KEK 56-cell S-band accelerating\nstructure using ACE3P and Geant4, and benchmark against KEK experiment data. As\na first step, ACE3P DC simulations using a 7-cell structure have been performed\nby first calculating the operating mode in the structure and then tracking\nfield-emitted electrons under the influence of the EM fields of the mode. The\nACE3P simulation results agree well with the EM software CST for an\naccelerating gradient of 21.8 MV/m. The reader/writer I/O in ACE3P and the\ntransfer of particle data from Track3P to Geant4 for DC radiation effects\nstudies have been implemented. The simulation workflow between the two codes\nwill be demonstrated with the goal of performing large-scale simulations for\nthe KEK 56-cell structure. In addition to modeling DC effects in linacs, the\nintegrated simulation workflow will be applicable to studying positron source\nand capture structure for future lepton colliders.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:41:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ge","Lixin",""],["Li","Zenghai",""],["Ng","Cho-Kuen",""],["Xiao","Liling",""],["Ego","Hiroyasu",""],["Enomoto","Yoshinori",""],["Iwase","Hiroshi",""],["Morikawa","Yu",""],["Yoshimoto","Takashi",""]]}
{"id":"2308.09793","submitter":"Ben Blaiszik","authors":"Rafael Vescovi, Tobias Ginsburg, Kyle Hippe, Doga Ozgulbas, Casey\n  Stone, Abraham Stroka, Rory Butler, Ben Blaiszik, Tom Brettin, Kyle Chard,\n  Mark Hereld, Arvind Ramanathan, Rick Stevens, Aikaterini Vriza, Jie Xu,\n  Qingteng Zhang, Ian Foster","title":"Towards a Modular Architecture for Science Factories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advances in robotic automation, high-performance computing (HPC), and\nartificial intelligence (AI) encourage us to conceive of science factories:\nlarge, general-purpose computation- and AI-enabled self-driving laboratories\n(SDLs) with the generality and scale needed both to tackle large discovery\nproblems and to support thousands of scientists. Science factories require\nmodular hardware and software that can be replicated for scale and\n(re)configured to support many applications. To this end, we propose a\nprototype modular science factory architecture in which reconfigurable modules\nencapsulating scientific instruments are linked with manipulators to form\nworkcells, that can themselves be combined to form larger assemblages, and\nlinked with distributed computing for simulation, AI model training and\ninference, and related tasks. Workflows that perform sets of actions on modules\ncan be specified, and various applications, comprising workflows plus\nassociated computational and data manipulation steps, can be run concurrently.\nWe report on our experiences prototyping this architecture and applying it in\nexperiments involving 15 different robotic apparatus, five applications (one in\neducation, two in biology, two in materials), and a variety of workflows,\nacross four laboratories. We describe the reuse of modules, workcells, and\nworkflows in different applications, the migration of applications between\nworkcells, and the use of digital twins, and suggest directions for future work\naimed at yet more generality and scalability. Code and data are available at\nhttps://ad-sdl.github.io/wei2023 and in the Supplementary Information\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:47:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Vescovi","Rafael",""],["Ginsburg","Tobias",""],["Hippe","Kyle",""],["Ozgulbas","Doga",""],["Stone","Casey",""],["Stroka","Abraham",""],["Butler","Rory",""],["Blaiszik","Ben",""],["Brettin","Tom",""],["Chard","Kyle",""],["Hereld","Mark",""],["Ramanathan","Arvind",""],["Stevens","Rick",""],["Vriza","Aikaterini",""],["Xu","Jie",""],["Zhang","Qingteng",""],["Foster","Ian",""]]}
{"id":"2308.09794","submitter":"Stefano Biagi","authors":"Stefano Biagi and Eugenio Vecchi","title":"Multiplicity of positive solutions for mixed local-nonlocal singular\n  critical problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the existence of at least two positive weak solutions for mixed\nlocal-nonlocal singular and critical semilinear elliptic problems in the spirit\nof [Haitao, 2003], extending the recent results in [Garain, 2023] concerning\nsingular problems and, at the same time, the results in [Biagi, Dipierro,\nValdinoci, Vecchi, 2022] regarding critical problems.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:49:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Biagi","Stefano",""],["Vecchi","Eugenio",""]]}
{"id":"2308.09795","submitter":"Karl-Tasso Kn\\\"opfle","authors":"GERDA collaboration: M. Agostini, A. Alexander, G.R. Araujo, A.M.\n  Bakalyarov, M. Balata, I. Barabanov, L. Baudis, C. Bauer, S. Belogurov, A.\n  Bettini, L. Bezrukov, V. Biancacci, E. Bossio, V. Bothe, R. Brugnera, A.\n  Caldwell, S. Calgaro, C. Cattadori, A. Chernogorov, P.-J. Chiu, T. Comellato,\n  V. D'Andrea, E.V. Demidova, A. Di Giacinto, N. Di Marco, E. Doroshkevich, F.\n  Fischer, M. Fomina, A. Gangapshev, A. Garfagnini, C. Gooch, P. Grabmayr, V.\n  Gurentsov, K. Gusev, S. Hackenm\\\"uller, S. Hemmer, W. Hofmann, J. Huang, M.\n  Hult, L.V. Inzhechik, J. Janicsk\\'o Cs\\'athy, J. Jochum, M. Junker, V.\n  Kazalov, Y. Kerma\\\"idic, H. Khushbakht, T. Kihm, K. Kilgus, I.V.\n  Kirpichnikov, A. Klimenko, K.T. Kn\\\"opfle, O. Kochetov, V.N. Kornoukhov, P.\n  Krause, V.V. Kuzminov, M. Laubenstein, B. Lehnert, M. Lindner, I. Lippi, A.\n  Lubashevskiy, B. Lubsandorzhiev, G. Lutter, C. Macolino, B. Majorovits, W.\n  Maneschg, L. Manzanillas, G. Marshall, M. Miloradovic, R. Mingazheva, M.\n  Misiaszek, M. Morella, Y. M\\\"uller, I. Nemchenok, M. Neuberger, L. Pandola,\n  K. Pelczar, L. Pertoldi, P. Piseri, A. Pullia, C. Ransom, L. Rauscher, M.\n  Redchuk, S. Riboldi, N. Rumyantseva, C. Sada, S. Sailer, F. Salamida, S.\n  Sch\\\"onert, J. Schreiner, M. Sch\\\"utt, A.-K. Sch\\\"utz, O. Schulz, M. Schwarz,\n  B. Schwingenheuer, O. Selivanenko, E. Shevchik, M. Shirchenko, L. Shtembari,\n  H. Simgen, A. Smolnikov, D. Stukov, S. Sullivan, A.A. Vasenko, A.\n  Veresnikova, C. Vignoli, K. von Sturm, T. Wester, C. Wiesinger, M. Wojcik, E.\n  Yanovich, B. Zatschler, I. Zhitnikov, S.V. Zhukov, D. Zinatulina, A.\n  Zschocke, A.J. Zsigmond, K. Zuber, G. Zuzel","title":"Final Results of GERDA on the Two-Neutrino Double-$\\beta$ Decay\n  Half-Life of $^{76}$Ge","comments":"7 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the measurement of the two-neutrino double-$\\beta$ decay rate of\n$^{76}$Ge performed with the GERDA Phase II experiment. With a subset of the\nentire GERDA exposure, 11.8 kg$\\cdot$yr, the half-life of the process has been\ndetermined: $T^{2\\nu}_{1/2} = (2.022 \\pm 0.018_{stat} \\pm\n0.038_{sys})\\times10^{21}$ yr. This is the most precise determination of the\n$^{76}$Ge two-neutrino double-$\\beta$ decay half-life and one of the most\nprecise measurements of a double-$\\beta$ decay process. The relevant nuclear\nmatrix element can be extracted: $M^{2\\nu}_{\\text{eff}} = (0.101\\pm0.001).$\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:51:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["GERDA collaboration","",""],["Agostini","M.",""],["Alexander","A.",""],["Araujo","G. R.",""],["Bakalyarov","A. M.",""],["Balata","M.",""],["Barabanov","I.",""],["Baudis","L.",""],["Bauer","C.",""],["Belogurov","S.",""],["Bettini","A.",""],["Bezrukov","L.",""],["Biancacci","V.",""],["Bossio","E.",""],["Bothe","V.",""],["Brugnera","R.",""],["Caldwell","A.",""],["Calgaro","S.",""],["Cattadori","C.",""],["Chernogorov","A.",""],["Chiu","P. -J.",""],["Comellato","T.",""],["D'Andrea","V.",""],["Demidova","E. V.",""],["Di Giacinto","A.",""],["Di Marco","N.",""],["Doroshkevich","E.",""],["Fischer","F.",""],["Fomina","M.",""],["Gangapshev","A.",""],["Garfagnini","A.",""],["Gooch","C.",""],["Grabmayr","P.",""],["Gurentsov","V.",""],["Gusev","K.",""],["Hackenm\u00fcller","S.",""],["Hemmer","S.",""],["Hofmann","W.",""],["Huang","J.",""],["Hult","M.",""],["Inzhechik","L. V.",""],["Cs\u00e1thy","J. Janicsk\u00f3",""],["Jochum","J.",""],["Junker","M.",""],["Kazalov","V.",""],["Kerma\u00efdic","Y.",""],["Khushbakht","H.",""],["Kihm","T.",""],["Kilgus","K.",""],["Kirpichnikov","I. V.",""],["Klimenko","A.",""],["Kn\u00f6pfle","K. T.",""],["Kochetov","O.",""],["Kornoukhov","V. N.",""],["Krause","P.",""],["Kuzminov","V. V.",""],["Laubenstein","M.",""],["Lehnert","B.",""],["Lindner","M.",""],["Lippi","I.",""],["Lubashevskiy","A.",""],["Lubsandorzhiev","B.",""],["Lutter","G.",""],["Macolino","C.",""],["Majorovits","B.",""],["Maneschg","W.",""],["Manzanillas","L.",""],["Marshall","G.",""],["Miloradovic","M.",""],["Mingazheva","R.",""],["Misiaszek","M.",""],["Morella","M.",""],["M\u00fcller","Y.",""],["Nemchenok","I.",""],["Neuberger","M.",""],["Pandola","L.",""],["Pelczar","K.",""],["Pertoldi","L.",""],["Piseri","P.",""],["Pullia","A.",""],["Ransom","C.",""],["Rauscher","L.",""],["Redchuk","M.",""],["Riboldi","S.",""],["Rumyantseva","N.",""],["Sada","C.",""],["Sailer","S.",""],["Salamida","F.",""],["Sch\u00f6nert","S.",""],["Schreiner","J.",""],["Sch\u00fctt","M.",""],["Sch\u00fctz","A. -K.",""],["Schulz","O.",""],["Schwarz","M.",""],["Schwingenheuer","B.",""],["Selivanenko","O.",""],["Shevchik","E.",""],["Shirchenko","M.",""],["Shtembari","L.",""],["Simgen","H.",""],["Smolnikov","A.",""],["Stukov","D.",""],["Sullivan","S.",""],["Vasenko","A. A.",""],["Veresnikova","A.",""],["Vignoli","C.",""],["von Sturm","K.",""],["Wester","T.",""],["Wiesinger","C.",""],["Wojcik","M.",""],["Yanovich","E.",""],["Zatschler","B.",""],["Zhitnikov","I.",""],["Zhukov","S. V.",""],["Zinatulina","D.",""],["Zschocke","A.",""],["Zsigmond","A. J.",""],["Zuber","K.",""],["Zuzel","G.",""]]}
{"id":"2308.09796","submitter":"Daniel M. Dantchev","authors":"D. M. Dantchev, N. S. Tonchev and J. Rudnick","title":"Casimir versus Helmholtz forces: Exact results","comments":"33 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, attention has turned to the issue of the ensemble dependence of\nfluctuation induced forces. As a noteworthy example, in $O(n)$ systems the\nstatistical mechanics underlying such forces can be shown to differ in the\nconstant $\\vec{M}$ magnetic canonical ensemble (CE) from those in the\nwidely-studied constant $\\vec{h}$ grand canonical ensemble (GCE). Here, the\ncounterpart of the Casimir force in the GCE is the \\textit{Helmholtz} force in\nthe CE. Given the difference between the two ensembles for finite systems, it\nis reasonable to anticipate that these forces will have, in general, different\nbehavior for the same geometry and boundary conditions. Here we present some\nexact results for both the Casimir and the Helmholtz force in the case of the\none-dimensional Ising model subject to periodic and antiperiodic boundary\nconditions and compare their behavior. We note that the Ising model has\nrecently being solved in Phys.Rev. E {\\bf 106} L042103(2022), using a\ncombinatorial approach, for the case of fixed value $M$ of its order parameter.\nHere we derive exact result for the partition function of the one-dimensional\nIsing model of $N$ spins and fixed value $M$ using the transfer matrix method\n(TMM); earlier results obtained via the TMM were limited to $M=0$ and $N$ even.\nAs a byproduct, we derive several specific integral representations of the\nhypergeometric function of Gauss. Using those results, we rigorously derive\nthat the free energies of the CE and grand GCE are related to each other via\nLegendre transformation in the thermodynamic limit, and establish the leading\nfinite-size corrections for the canonical case, which turn out to be much more\npronounced than the corresponding ones in the case of the GCE.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:54:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dantchev","D. M.",""],["Tonchev","N. S.",""],["Rudnick","J.",""]]}
{"id":"2308.09797","submitter":"Alexander V. Karzanov","authors":"Alexander V. Karzanov","title":"On diversifying stable assignments","comments":"10 pages, 1 figure. At the end of updated version, a generalization\n  to hypergraphs is briefly discussed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the stable assignment problem on a graph with nonnegative real\ncapacities on the edges and quotas on the vertices, in which the preferences of\nagents are given via diversifying choice functions. We prove that for any input\nof the problem, there exists exactly one stable assignment, and propose a\npolynomial time algorithm to find it.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:56:09 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 10:58:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Karzanov","Alexander V.",""]]}
{"id":"2308.09798","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi, Motahareh Kamrani Shahri, Mehrdad Agha Mohammad Ali\n  Kermani, Rahim Khanizad","title":"Unveiling the Collaborative Patterns of Artificial Intelligence\n  Applications in Human Resource Management: A Social Network Analysis Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The integration of artificial intelligence (AI) into human resource\nmanagement (HRM) strategies has become increasingly common due to technological\nadvancements. This has spurred a new field of research focused on evaluating\nthe impact of AI adoption on business and individual outcomes, as well as how\nto evaluate AI-enabled HRM practices. However, there is limited\ncross-disciplinary research in this area, causing a fragmented body of\nknowledge. To address this issue, social network analysis has been recognized\nas a tool for analyzing and researching large-scale social phenomena in HRM.\nThe study of scientific co-authorship networks is one application of social\nnetwork analysis that can help identify the main components and trends in this\nfield. Using social network analysis indicators, the current study examined the\nAI&HRM co-authorship network, which consists of 43,789 members and 81,891\nscientific collaborations. The study analyzed articles related to AI&HRM\npublished between 2000 and 2023 extracted from the WOS citation database.\nThrough centrality measures, the most important members of the \"AI&HRM\"\nco-authorship network were identified using the TOPSIS method, which identified\ntwenty prominent researchers in this field. The study also examined the\nkeywords \"AI&HRM\" and the scientific cooperation network of nations,\nuniversities, and communities. Overall, this study highlights the importance of\ncross-disciplinary research and social network analysis in understanding the\nimplications of AI adoption in HRM.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:56:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maghsoudi","Mehrdad",""],["Shahri","Motahareh Kamrani",""],["Kermani","Mehrdad Agha Mohammad Ali",""],["Khanizad","Rahim",""]]}
{"id":"2308.09799","submitter":"Samuel Hokamp","authors":"Samuel A. Hokamp","title":"A Class of Homeomorphisms on Homogeneous Spaces of a Group Action","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a class of homeomorphisms on a compact homogeneous space of a\ntransitive group action and show how the class sheds new light on a\ndecomposition problem. We further use this class to show that every such\nhomogeneous space in a locally convex topological vector space which is also\nconvex must necessarily be trivial, ie. a singleton set. Additionally, this\nclass of homeomorphisms allows us to relate the induced group action on the\nspace of continuous functions to the action on the homogeneous space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 19:58:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hokamp","Samuel A.",""]]}
{"id":"2308.09800","submitter":"Ryan Gibara","authors":"Sylvester Eriksson-Bique, Ryan Gibara, Riikka Korte, Nageswari\n  Shanmugalingam","title":"Traces of Newton-Sobolev functions on the visible boundary of domains in\n  doubling metric measure spaces supporting a $p$-Poincar\\'e inequality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the question of whether a domain with uniformly thick boundary at\nall locations and at all scales has a large portion of its boundary visible\nfrom the interior; here, \"visibility\" indicates the existence of John curves\nconnecting the interior point to the points on the \"visible boundary\". In this\npaper, we provide an affirmative answer in the setting of a doubling metric\nmeasure space supporting a $p$-Poincar\\'e inequality for $1<p<\\infty$, thus\nextending the results of [20,2,9] to non-Ahlfors regular spaces. We show that\n$t$-codimensional thickness of the boundary for $0<t<p$ implies\n$p$-codimensional thickness of the visible boundary. For such domains we prove\nthat traces of Sobolev functions on the domain belong to the Besov class of the\nvisible boundary.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:02:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Eriksson-Bique","Sylvester",""],["Gibara","Ryan",""],["Korte","Riikka",""],["Shanmugalingam","Nageswari",""]]}
{"id":"2308.09801","submitter":"Disha Bhatia","authors":"Disha Bhatia","title":"A closer look at dark matter production in exponential growth scenarios","comments":"19 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, a new non-thermal mechanism for dark matter production has been\nproposed which results in its exponential growth with the expansion of the\nuniverse. This mechanism works provided a small but non-zero initial dark\nmatter ($\\chi$) number density exists in the early universe which scatters of\nthe bath particles ($\\phi$) to generate more dark matter particles ($\\chi \\phi\n\\to \\chi \\chi$). The process ends when the scattering rate becomes Boltzmann\nsuppressed. The analysis, in literature, is performed on the simplifying\nassumption of the dark matter phase space tracing the equilibrium distribution\nof either standard model or a hidden sector bath. Owing to the non-thermal\nnature of the production mechanism, this assumption may not hold. In this\npaper, we compute the distribution function of dark matter by solving the\nBoltzmann-equation at the operator level analytically and/or numerically. We\nfind that the obtained distribution exhibits different behavior from the\nequilibrium pattern and is sensitive to the mechanism populating the initial\ndensity of dark matter. We further show that the exponential growth results\nonly in the scenarios where dark matter phase space follows an equilibrium\ndistribution or in the case where only high momentum modes in the dark matter\nphase space distribution are populated. In general, the growth of dark matter\ncan be parameterised as an exponential factor i.e. $\\exp{[A(x)]}$ where $A(x)$\nis sensitive to the details of the model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:09:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bhatia","Disha",""]]}
{"id":"2308.09802","submitter":"Chen Chen","authors":"Chen Chen, Jane Hoffswell, Shunan Guo, Ryan Rossi, Yeuk-Yin Chan, Fan\n  Du, Eunyee Koh, Zhicheng Liu","title":"WHATSNEXT: Guidance-enriched Exploratory Data Analysis with Interactive,\n  Low-Code Notebooks","comments":"to appear in VL/HCC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computational notebooks such as Jupyter are popular for exploratory data\nanalysis and insight finding. Despite the module-based structure, notebooks\nvisually appear as a single thread of interleaved cells containing text, code,\nvisualizations, and tables, which can be unorganized and obscure users' data\nanalysis workflow. Furthermore, users with limited coding expertise may\nstruggle to quickly engage in the analysis process. In this work, we design and\nimplement an interactive notebook framework, WHATSNEXT, with the goal of\nsupporting low-code visual data exploration with insight-based user guidance.\nIn particular, we (1) re-design a standard notebook cell to include a\nrecommendation panel that suggests possible next-step exploration questions or\nanalysis actions to take, and (2) create an interactive, dynamic tree\nvisualization that reflects the analytic dependencies between notebook cells to\nmake it easy for users to see the structure of the data exploration threads and\ntrace back to previous steps.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:15:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Chen",""],["Hoffswell","Jane",""],["Guo","Shunan",""],["Rossi","Ryan",""],["Chan","Yeuk-Yin",""],["Du","Fan",""],["Koh","Eunyee",""],["Liu","Zhicheng",""]]}
{"id":"2308.09803","submitter":"Sylvester Aboagye","authors":"Sylvester Aboagye and Telex M. N. Ngatched and Alain R. Ndjiongue and\n  Octavia A. Dobre and Hyundong Shin","title":"Liquid Crystal-Based RIS for VLC Transmitters: Performance Analysis,\n  Challenges, and Opportunities","comments":"This paper has been accepted for publication in IEEE","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article presents a novel approach of using reconfigurable intelligent\nsurfaces (RISs) in the transmitter of indoor visible light communication (VLC)\nsystems to enhance data rate uniformity and maintain adequate illumination. In\nthis approach, a liquid crystal (LC)-based RIS is placed in front of the LED\narrays of the transmitter to form an LC-based RIS-enabled VLC transmitter. This\nRIS-enabled transmitter is able to perform new functions such as transmit light\nsteering and amplification and demonstrates very high data rate and\nillumination performance when compared with traditional VLC transmitters with\ncircular and distributed LED arrays and the more recent angle diversity\ntransmitter. Simulation results reveal the strong potential of LC-based\nRIS-aided transmitters in satisfying the joint illumination and communication\nneeds of indoor VLC systems and positions VLC as a critical essential block for\nnext generation communication networks. Several challenging and exciting issues\nrelated to the realization of such transmitters are discussed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:17:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aboagye","Sylvester",""],["Ngatched","Telex M. N.",""],["Ndjiongue","Alain R.",""],["Dobre","Octavia A.",""],["Shin","Hyundong",""]]}
{"id":"2308.09804","submitter":"Zi-Yuan Hu","authors":"Zi-Yuan Hu, Yanyang Li, Michael R. Lyu, Liwei Wang","title":"VL-PET: Vision-and-Language Parameter-Efficient Tuning via Granularity\n  Control","comments":"ICCV 2023 (17 pages, 6 figures, 22 tables)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the model size of pre-trained language models (PLMs) grows rapidly, full\nfine-tuning becomes prohibitively expensive for model training and storage. In\nvision-and-language (VL), parameter-efficient tuning (PET) techniques are\nproposed to integrate modular modifications (e.g., Adapter and LoRA) into\nencoder-decoder PLMs. By tuning a small set of trainable parameters, these\ntechniques perform on par with full fine-tuning. However, excessive modular\nmodifications and neglecting the functionality gap between the encoders and\ndecoders can lead to performance degradation, while existing PET techniques\n(e.g., VL-Adapter) overlook these critical issues. In this paper, we propose a\nVision-and-Language Parameter-Efficient Tuning (VL-PET) framework to impose\neffective control over modular modifications via a novel granularity-controlled\nmechanism. Considering different granularity-controlled matrices generated by\nthis mechanism, a variety of model-agnostic VL-PET modules can be instantiated\nfrom our framework for better efficiency and effectiveness trade-offs. We\nfurther propose lightweight PET module designs to enhance VL alignment and\nmodeling for the encoders and maintain text generation for the decoders.\nExtensive experiments conducted on four image-text tasks and four video-text\ntasks demonstrate the efficiency, effectiveness and transferability of our\nVL-PET framework. In particular, our VL-PET-large with lightweight PET module\ndesigns significantly outperforms VL-Adapter by 2.92% (3.41%) and LoRA by 3.37%\n(7.03%) with BART-base (T5-base) on image-text tasks. Furthermore, we validate\nthe enhanced effect of employing our VL-PET designs on existing PET techniques,\nenabling them to achieve significant performance improvements. Our code is\navailable at https://github.com/HenryHZY/VL-PET.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:18:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Zi-Yuan",""],["Li","Yanyang",""],["Lyu","Michael R.",""],["Wang","Liwei",""]]}
{"id":"2308.09805","submitter":"Chandan Kumar Sheemar","authors":"Chandan Kumar Sheemar, Jorge Querol, and Symeon Chatzinotas","title":"Signal Processing Based Antenna Pattern Characterization for MIMO\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Sophisticated antenna technologies are constantly evolving to meet the\nescalating data demands projected for 6G and future networks. The\ncharacterization of these emerging antenna systems poses challenges that\nnecessitate a reevaluation of conventional techniques, which rely solely on\nsimple measurements conducted in advanced anechoic chambers. In this study, our\nobjective is to introduce a novel endeavour for antenna pattern\ncharacterization (APC) in next-generation multiple-input-multiple-output (MIMO)\nsystems by utilizing the potential of signal processing tools. In contrast to\ntraditional methods that struggle with multi-path scenarios and require\nspecialized equipment for measurements, we endeavour to estimate the antenna\npattern by exploiting information from both line-of-sight (LoS) and non-LoS\ncontributions. This approach enables antenna pattern characterization in\ncomplex environments without the need for anechoic chambers, resulting in\nsubstantial cost savings. Furthermore, it grants a much wider research\ncommunity the ability to independently perform APC for emerging complex 6G\nantenna systems, without relying on anechoic chambers. Simulation results\ndemonstrate the efficacy of the proposed novel approach in accurately\nestimating the true antenna pattern.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:18:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sheemar","Chandan Kumar",""],["Querol","Jorge",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.09806","submitter":"Eugenia Cheng","authors":"Eugenia Cheng and Alexander S. Corner","title":"Weak vertical composition II: totalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We continue our study of semi-strict tricategories in which the only weakness\nis in vertical composition. We assemble the doubly-degenerate such\ntricategories into a 2-category, defining weak functors and transformations. We\nexhibit a biadjoint biequivalence between this 2-category and the 2-category of\nbraided (weakly) monoidal categories, braided (weakly) monoidal functors, and\nmonoidal transformations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:25:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cheng","Eugenia",""],["Corner","Alexander S.",""]]}
{"id":"2308.09807","submitter":"Davood Ghasemabadi","authors":"Davood Ghasemabadi and Hosein Zaki Dizaji and Masoud Abdollahzadeh","title":"Theoretical study of conventional semiconductors as transducers to\n  increase power and efficiency in betavoltaic batteries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semiconductor materials play an important role as transducers of electrical\nenergy in betavoltaic batteries. Optimal selection of effective factors will\nincrease the efficiency of these batteries. In this study, based on common\nsemiconductors and relying on increasing the maximum efficiency of betavoltaic\nbatteries and the possibility of using 3H, 63Ni, and 147Pm beta sources, the\nindicators and criteria for optimal selection of semiconductor materials are\ndetermined. Evaluation criteria include the backscattering coefficient of beta\nparticles from semiconductors, efficiency of electron-hole pairs generation,\nelectronic specifications and properties, radiation damage threshold, radiation\nyield, stopping power and penetration of beta particles in semiconductors,\nphysical characteristics, temperature tolerance, accessibility, and fabrication\nare considered. Conventional semiconductors have been quantitatively evaluated\nbased on these criteria and compared with silicon semiconductors. 10\nsemiconductors, , diamond, 2H-SiC, 3C-SiC, 4H-SiC, AlN, MgO, B4C with effective\natomic number less than 14 and bandgap energy above 1.12 eV at room temperature\n(300K) compared to Silicon semiconductors are evaluated. Finally, according to\nthe evaluation indicators, Diamond, c-BN, and 4H-SiC are more suitable\nsemiconductors in terms of efficiency have selected, respectively. The results\nindicate that for planar batteries, a betavoltaic semiconductor type junction\nfor Schottky diamond with 147pm radioisotope, and 4H-SiC semiconductors with\n63Ni or 3H radioisotopes, and for three-dimensional structures of betavoltaic\nbatteries, Si combination with 147pm or 63Ni radioisotopes is recommended.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:32:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghasemabadi","Davood",""],["Dizaji","Hosein Zaki",""],["Abdollahzadeh","Masoud",""]]}
{"id":"2308.09808","submitter":"Travis S. Metcalfe","authors":"Travis S. Metcalfe, Derek Buzasi, Daniel Huber, Marc H. Pinsonneault,\n  Jennifer L. van Saders, Thomas R. Ayres, Sarbani Basu, Jeremy J. Drake, Ricky\n  Egeland, Oleg Kochukhov, Pascal Petit, Steven H. Saar, Victor See, Keivan G.\n  Stassun, Yaguang Li, Timothy R. Bedding, Sylvain N. Breton, Adam J. Finley,\n  Rafael A. Garcia, Hans Kjeldsen, Martin B. Nielsen, J. M. Joel Ong, Jakob L.\n  Rorsted, Amalie Stokholm, Mark L. Winther, Catherine A. Clark, Diego\n  Godoy-Rivera, Ilya V. Ilyin, Klaus G. Strassmeier, Sandra V. Jeffers, Stephen\n  C. Marsden, Aline A. Vidotto, Sallie Baliunas, Willie Soon","title":"Asteroseismology and Spectropolarimetry of the Exoplanet Host Star\n  $\\lambda$ Serpentis","comments":"19 pages including 9 figures and 6 tables. Astronomical Journal,\n  accepted","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":"  The bright star $\\lambda$ Ser hosts a hot Neptune with a minimum mass of 13.6\n$M_\\oplus$ and a 15.5 day orbit. It also appears to be a solar analog, with a\nmean rotation period of 25.8 days and surface differential rotation very\nsimilar to the Sun. We aim to characterize the fundamental properties of this\nsystem, and to constrain the evolutionary pathway that led to its present\nconfiguration. We detect solar-like oscillations in time series photometry from\nthe Transiting Exoplanet Survey Satellite (TESS), and we derive precise\nasteroseismic properties from detailed modeling. We obtain new\nspectropolarimetric data, and we use them to reconstruct the large-scale\nmagnetic field morphology. We reanalyze the complete time series of\nchromospheric activity measurements from the Mount Wilson Observatory, and we\npresent new X-ray and ultraviolet observations from the Chandra and Hubble\nspace telescopes. Finally, we use the updated observational constraints to\nassess the rotational history of the star and to estimate the wind braking\ntorque. We conclude that the remaining uncertainty on stellar age currently\nprevents an unambiguous interpretation of the properties of $\\lambda$ Ser, and\nthat the rate of angular momentum loss appears to be higher than for other\nstars with similar Rossby number. Future asteroseismic observations may help to\nimprove the precision of the stellar age.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:32:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Metcalfe","Travis S.",""],["Buzasi","Derek",""],["Huber","Daniel",""],["Pinsonneault","Marc H.",""],["van Saders","Jennifer L.",""],["Ayres","Thomas R.",""],["Basu","Sarbani",""],["Drake","Jeremy J.",""],["Egeland","Ricky",""],["Kochukhov","Oleg",""],["Petit","Pascal",""],["Saar","Steven H.",""],["See","Victor",""],["Stassun","Keivan G.",""],["Li","Yaguang",""],["Bedding","Timothy R.",""],["Breton","Sylvain N.",""],["Finley","Adam J.",""],["Garcia","Rafael A.",""],["Kjeldsen","Hans",""],["Nielsen","Martin B.",""],["Ong","J. M. Joel",""],["Rorsted","Jakob L.",""],["Stokholm","Amalie",""],["Winther","Mark L.",""],["Clark","Catherine A.",""],["Godoy-Rivera","Diego",""],["Ilyin","Ilya V.",""],["Strassmeier","Klaus G.",""],["Jeffers","Sandra V.",""],["Marsden","Stephen C.",""],["Vidotto","Aline A.",""],["Baliunas","Sallie",""],["Soon","Willie",""]]}
{"id":"2308.09809","submitter":"Chandan Kumar Sheemar","authors":"Chandan Kumar Sheemar, Sumit Kumar, Jorge Querol, and Symeon\n  Chatzinotas","title":"Adaptive Timers and Buffer Optimization for Layer-2 Protocols in 5G\n  Non-Terrestrial Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interest in the integration of Terrestrial Networks (TN) and Non-Terrestrial\nNetworks (NTN); primarily satellites; has been rekindled due to the potential\nof NTN to provide ubiquitous coverage. Especially with the peculiar and\nflexible physical layer properties of 5G-NR, now direct access to 5G services\nthrough satellites could become possible. However, the large Round-Trip Delays\n(RTD) in NTNs require a re-evaluation of the design of RLC and PDCP layers\ntimers ( and associated buffers), in particular for the regenerative payload\nsatellites which have limited computational resources, and hence need to be\noptimally utilized. Our aim in this work is to initiate a new line of research\nfor emerging NTNs with limited resources from a higher-layer perspective. To\nthis end, we propose a novel and efficient method for optimally designing the\nRLC and PDCP layers' buffers and timers without the need for intensive\ncomputations. This approach is relevant for low-cost satellites, which have\nlimited computational and energy resources. The simulation results show that\nthe proposed methods can significantly improve the performance in terms of\nresource utilization and delays.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:32:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sheemar","Chandan Kumar",""],["Kumar","Sumit",""],["Querol","Jorge",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.09810","submitter":"Wenxuan Wang","authors":"Wenxuan Wang, Jingyuan Huang, Jen-tse Huang, Chang Chen, Jiazhen Gu,\n  Pinjia He, Michael R. Lyu","title":"An Image is Worth a Thousand Toxic Words: A Metamorphic Testing\n  Framework for Content Moderation Software","comments":"Accepted by ASE 2023. arXiv admin note: substantial text overlap with\n  arXiv:2302.05706","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exponential growth of social media platforms has brought about a\nrevolution in communication and content dissemination in human society.\nNevertheless, these platforms are being increasingly misused to spread toxic\ncontent, including hate speech, malicious advertising, and pornography, leading\nto severe negative consequences such as harm to teenagers' mental health.\nDespite tremendous efforts in developing and deploying textual and image\ncontent moderation methods, malicious users can evade moderation by embedding\ntexts into images, such as screenshots of the text, usually with some\ninterference. We find that modern content moderation software's performance\nagainst such malicious inputs remains underexplored. In this work, we propose\nOASIS, a metamorphic testing framework for content moderation software. OASIS\nemploys 21 transform rules summarized from our pilot study on 5,000 real-world\ntoxic contents collected from 4 popular social media applications, including\nTwitter, Instagram, Sina Weibo, and Baidu Tieba. Given toxic textual contents,\nOASIS can generate image test cases, which preserve the toxicity yet are likely\nto bypass moderation. In the evaluation, we employ OASIS to test five\ncommercial textual content moderation software from famous companies (i.e.,\nGoogle Cloud, Microsoft Azure, Baidu Cloud, Alibaba Cloud and Tencent Cloud),\nas well as a state-of-the-art moderation research model. The results show that\nOASIS achieves up to 100% error finding rates. Moreover, through retraining the\nmodels with the test cases generated by OASIS, the robustness of the moderation\nmodel can be improved without performance degradation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:33:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Wenxuan",""],["Huang","Jingyuan",""],["Huang","Jen-tse",""],["Chen","Chang",""],["Gu","Jiazhen",""],["He","Pinjia",""],["Lyu","Michael R.",""]]}
{"id":"2308.09811","submitter":"Ricardo Grando","authors":"Ricardo B. Grando, Junior C. de Jesus, Victor A. Kich, Alisson H.\n  Kolling, Rodrigo S. Guerra, Paulo L. J. Drews-Jr","title":"DoCRL: Double Critic Deep Reinforcement Learning for Mapless Navigation\n  of a Hybrid Aerial Underwater Vehicle with Medium Transition","comments":"Accepted to the Latin American Symposium 2023. arXiv admin note:\n  substantial text overlap with arXiv:2209.06332","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Reinforcement Learning (Deep-RL) techniques for motion control have been\ncontinuously used to deal with decision-making problems for a wide variety of\nrobots. Previous works showed that Deep-RL can be applied to perform mapless\nnavigation, including the medium transition of Hybrid Unmanned Aerial\nUnderwater Vehicles (HUAUVs). These are robots that can operate in both air and\nwater media, with future potential for rescue tasks in robotics. This paper\npresents new approaches based on the state-of-the-art Double Critic\nActor-Critic algorithms to address the navigation and medium transition\nproblems for a HUAUV. We show that double-critic Deep-RL with Recurrent Neural\nNetworks using range data and relative localization solely improves the\nnavigation performance of HUAUVs. Our DoCRL approaches achieved better\nnavigation and transitioning capability, outperforming previous approaches.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:34:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Grando","Ricardo B.",""],["de Jesus","Junior C.",""],["Kich","Victor A.",""],["Kolling","Alisson H.",""],["Guerra","Rodrigo S.",""],["Drews-Jr","Paulo L. J.",""]]}
{"id":"2308.09812","submitter":"Fateme Salehi","authors":"Fateme Salehi, Mustafa Ozger, Cicek Cavdar","title":"Reliability and Delay Analysis of 3-Dimensional Networks with\n  Multi-Connectivity: Satellite, HAPs, and Cellular Communications","comments":"13 pages, 10 figures, accepted to be published in IEEE TNSM journal.\n  arXiv admin note: text overlap with arXiv:2205.06046","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aerial vehicles (AVs) such as electric vertical take-off and landing (eVTOL)\naircraft make aerial passenger transportation a reality in urban environments.\nHowever, their communication connectivity is still under research to realize\ntheir safe and full-scale operation. This paper envisages a multi-connectivity\n(MC) enabled aerial network to provide ubiquitous and reliable service to AVs.\nVertical heterogeneous networks with direct air-to-ground (DA2G) and air-to-air\n(A2A) communication, high altitude platforms (HAPs), and low Earth orbit (LEO)\nsatellites are considered. We evaluate the end-to-end (E2E) multi-hop\nreliability and network availability of the downlink of AVs for remote piloting\nscenarios, and control/telemetry traffic. Command and control (C2) connectivity\nservice requires ultra-reliable and low-latency communication (URLLC),\ntherefore we analyse E2E reliability and latency under the finite blocklength\n(FBL) regime. We explore how different MC options satisfy the demanding E2E\nconnectivity requirements taking into account antenna radiation patterns and\nunreliable backhaul links. Since providing seamless connectivity to AVs is very\nchallenging due to the line-of-sight (LoS) interference and reduced gains of\ndowntilt ground base station (BS) antennas, we use coordinated multi-point\n(CoMP) among ground BSs to alleviate the inter-cell interference. Furthermore,\nwe solve an optimization problem to select the best MC path under the quality\nof service (QoS) constraints. We maximize spectral efficiency (SE) to specify\nthe optimum MC path with the minimum number of required links. Based on the\nsimulation results, we find out that even with very efficient interference\nmitigation, MC is the key enabler for safe remote piloting operations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:40:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Salehi","Fateme",""],["Ozger","Mustafa",""],["Cavdar","Cicek",""]]}
{"id":"2308.09813","submitter":"Oded Stein","authors":"Silvia Sell\\'an, Christopher Batty, Oded Stein","title":"Reach For the Spheres: Tangency-Aware Surface Reconstruction of SDFs","comments":"https://odedstein.com/projects/reach-for-the-spheres/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Signed distance fields (SDFs) are a widely used implicit surface\nrepresentation, with broad applications in computer graphics, computer vision,\nand applied mathematics. To reconstruct an explicit triangle mesh surface\ncorresponding to an SDF, traditional isosurfacing methods, such as Marching\nCubes and and its variants, are typically used. However, these methods overlook\nfundamental properties of SDFs, resulting in reconstructions that exhibit\nsevere oversmoothing and feature loss. To address this shortcoming, we propose\na novel method based on a key insight: each SDF sample corresponds to a\nspherical region that must lie fully inside or outside the surface, depending\non its sign, and that must be tangent to the surface at some point. Leveraging\nthis understanding, we formulate an energy that gauges the degree of violation\nof tangency constraints by a proposed surface. We then employ a gradient flow\nthat minimizes our energy, starting from an initial triangle mesh that\nencapsulates the surface. This algorithm yields superior reconstructions to\nprevious methods, even with sparsely sampled SDFs. Our approach provides a more\nnuanced understanding of SDFs and offers significant improvements in surface\nreconstruction.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:41:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sell\u00e1n","Silvia",""],["Batty","Christopher",""],["Stein","Oded",""]]}
{"id":"2308.09814","submitter":"Roel Botter","authors":"Roel Botter, Jasper van den Hoogen, Akhileshwar Mishra, Kaixuan Ye,\n  Albert van Rees, Marcel Hoekman, Klaus Boller and David Marpaung","title":"Observation of a Brillouin dynamic grating in silicon nitride waveguides","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":"  Brillouin enhanced four wave mixing in the form of a Brillouin dynamic\ngrating (BDG) enables a uniquely tunable filter, whose properties can be tuned\nby purely optical means. This makes the BDG a valuable tool in microwave\nphotonics (MWP). BDGs have been studied extensively in fibers, but the only\nobservation in an integrated platform required exotic materials. Unlocking BDG\nin a standard and mature platform will enable its integration into large-scale\ncircuits. Here we demonstrate the first observation of a BDG in a silicon\nnitride (Si$_3$N$_4$) waveguide. We also present a new, optimized design, which\nwill enhance the BDG response of the waveguide, unlocking a path to large-scale\nintegration into MWP circuits.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:46:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Botter","Roel",""],["Hoogen","Jasper van den",""],["Mishra","Akhileshwar",""],["Ye","Kaixuan",""],["van Rees","Albert",""],["Hoekman","Marcel",""],["Boller","Klaus",""],["Marpaung","David",""]]}
{"id":"2308.09815","submitter":"Galina Chikunova","authors":"Galina Chikunova, Tatiana Podladchikova, Karin Dissauer, Astrid M.\n  Veronig, Mateja Dumbovi\\'c, Manuela Temmer, Ewan C.M. Dickson","title":"On the three-dimensional relation between the coronal dimming, erupting\n  filament and CME. Case study of the 28 October 2021 X1.0 event","comments":"15 pages, 18 figures, accepted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the relation between the spatiotemporal evolution of the\ndimming region and the dominant direction of the filament eruption and CME\npropagation for the 28 October 2021 X1.0 flare/CME event observed from multiple\nviewpoints by Solar Orbiter, STEREO-A, SDO, and SOHO. We propose a method to\nestimate the dominant dimming direction by tracking its area evolution and\nemphasize its accurate estimation by calculating the surface area of a sphere\nfor each pixel. To determine the early flux rope propagation direction, we\nperform 3D reconstruction of the CME via graduated cylindrical shell modeling\n(GCS) and tie-pointing of the filament. The dimming initially expands radially\nand later shifts southeast. The orthogonal projections of the reconstructed\nheight evolution of the erupting filament onto the solar surface are located in\nthe sector of the dominant dimming growth, while the orthogonal projections of\nthe inner part of GCS reconstruction align with the total dimming area. The\nfilament reaches a maximum speed of $\\approx$250 km/s at a height of about\n$\\approx$180 Mm. The direction of its motion is strongly inclined from the\nradial (64$^\\circ$ to the East, 32$^\\circ$ to the South). The 50$^\\circ$\ndifference in the 3D direction between the CME and the filament leg closely\ncorresponds to the CME half-width determined from reconstruction, suggesting a\npotential relation of the reconstructed filament to the associated leg of the\nCME body. Our findings highlight that the dominant propagation of the dimming\ngrowth reflects the direction of the erupting magnetic structure (filament) low\nin the solar atmosphere, though the filament evolution is not related directly\nto the direction of the global CME expansion. The overall dimming morphology\nclosely resembles the inner part of the CME reconstruction, validating the use\nof dimming observations to obtain insight into the CME direction.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:47:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chikunova","Galina",""],["Podladchikova","Tatiana",""],["Dissauer","Karin",""],["Veronig","Astrid M.",""],["Dumbovi\u0107","Mateja",""],["Temmer","Manuela",""],["Dickson","Ewan C. M.",""]]}
{"id":"2308.09816","submitter":"Nicolas Mir\\'o Fortier","authors":"Nicolas Fortier, Sangyong Jeon and Charles Gale","title":"Comparisons and Predictions for Collisions of deformed $^{238}$U nuclei\n  at $\\sqrt{s_{NN}} = 193$ GeV","comments":"17 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present comparisons to experimental data along with predictions of\nobservables for U+U collisions at 193 GeV using a multistage theoretical and\ncomputational framework consisting of boost-invariant IP-Glasma initial state,\nMUSIC hydrodynamics, and a hadronic transport cascade generated by iS3D \\&\nSMASH. Our results show great agreement with existing anisotropic flow\nmeasurements from RHIC [ arXiv:1505.07812 ; arXiv:1901.08155 ] . We provide\npredictions for differential flow observables as well as multiparticle\ncorrelations and transverse-momentum-flow correlations. When possible, we\ncompare our predictions to results from Au+Au collisions at 200 GeV to properly\noutline the effects of deformation in the initial state on final state\nobservables.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:56:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fortier","Nicolas",""],["Jeon","Sangyong",""],["Gale","Charles",""]]}
{"id":"2308.09817","submitter":"Rasool Ahmad","authors":"Rasool Ahmad and Wei Cai","title":"Accelerating force calculation for dislocation dynamics simulations","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Discrete dislocation dynamics (DDD) simulations offer valuable insights into\nthe plastic deformation and work-hardening behavior of metals by explicitly\nmodeling the evolution of dislocation lines under stress. However, the\ncomputational cost associated with calculating forces due to the long-range\nelastic interactions between dislocation segment pairs is one of the main\ncauses that limit the achievable strain levels in DDD simulations. These\nelastic interaction forces can be obtained either from the integral of the\nstress field due to one segment over the other segment, or from the derivatives\nof the elastic interaction energy. In both cases, the results involve a\ndouble-integral over the two interacting segments. Currently, existing DDD\nsimulations employ the stress-based approach with both integrals evaluated\neither from analytical expressions or from numerical quadrature. In this study,\nwe systematically analyze the accuracy and computational cost of the\nstress-based and energy-based approaches with different ways of evaluating the\nintegrals. We find that the stress-based approach is more efficient than the\nenergy-based approach. Furthermore, the stress-based approach becomes most\ncost-effective when one integral is evaluated from analytic expression and the\nother integral from numerical quadrature. For well-separated segment pairs\nwhose center distances are more than three times their lengths, this\none-analytic-integral and one-numerical-integral approach is more than three\ntimes faster than the fully analytic approach, while the relative error in the\nforces is less than $10^{-3}$. Because the vast majority of segment pairs in a\ntypical simulation cell are well-separated, we expect the hybrid\nanalytic/numerical approach to significantly boost the numerical efficiency of\nDDD simulations of work hardening.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:59:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ahmad","Rasool",""],["Cai","Wei",""]]}
{"id":"2308.09818","submitter":"Patrick Warren","authors":"Darren L. Linvill and Patrick L. Warren","title":"Paths to Influence: How Coordinated Influence Operations Affect the\n  Prominence of Ideas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.SI q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents four examples of different ways that coordinated\ninfluence operations exert pressure on the prominence of ideas on social\nnetworks. We argue that these examples illustrate the four archetypical paths\nto influence: promotion by strengthening, promotion by weakening, demotion by\nstrengthening, and demotion by weakening. We formalize this idea in a stylized\neconomic model of the optimal behavior of the influence operator and derive\nsome predictions about when we should expect each path to be followed. Finally\nwe sketch out how one might go about quantitatively estimating the key\nparameters of (a variant of) this model and how it applies much more broadly\nthan in the international political influence examples that motivate it.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:59:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Linvill","Darren L.",""],["Warren","Patrick L.",""]]}
{"id":"2308.09819","submitter":"Lami Suleiman","authors":"Lami Suleiman, Micaela Oertel, Marco Mancini","title":"Modified Urca neutrino emissivity at finite temperature","comments":"17 pages, 8 figures, accepted for publication in PRC","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Charged current neutrino-nucleon reactions, generally called Urca processes,\nare crucial actors of a neutron star's thermal evolution. The so-called direct\nprocesses show a pronounced threshold under which the reaction is kinematically\nsuppressed. This suppression does not apply to \"modified\" Urca processes which\ninvolve interaction with an additional nucleon. Calculations of the modified\nUrca neutrino rates were established for cold neutron star matter and for\ndilute hot matter, in both cases under strong assumptions. In this paper, we\nrevise the calculations of the modified Urca neutrino rates for dense and hot\nmatter, and for different compositions. We study the influence of different\napproximations used in previous computations. We derive expressions for the\nrates of modified Urca neutrino emissivity within thermal field theory and\nperform the phase space integration numerically using mainly importance\nsampling Monte-Carlo techniques. The neutrino emissivity of modified and direct\nprocesses are established and compared. We find in particular that the modified\nUrca process is not necessarily suppressed with respect to the direct process\nabove the threshold of the latter at moderate densities and temperatures, in\ncontrast to what is generally assumed. Numerical results are confirmed by an\nestimation of the ratio of modified to direct Urca rates with a simple analytic\napproximation, thereby showing the regimes of suppression for the modified\nprocesses depending on temperature and density. These results show that\nmodified Urca rates have to be considered carefully upon evaluating neutrino\nopacities in dense and warm matter.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:00:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Suleiman","Lami",""],["Oertel","Micaela",""],["Mancini","Marco",""]]}
{"id":"2308.09820","submitter":"George Marinescu","authors":"Chin-Yu Hsiao and George Marinescu","title":"Semi-classical spectral asymptotics of Toeplitz operators on strictly\n  pseudodonvex domains","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  On a relatively compact strictly pseudoconvex domain with smooth boundary in\na complex manifold of dimension $n$ we consider a Toeplitz operator $T_R$ with\nsymbol a Reeb-like vector field $R$ near the boundary. We show that the kernel\nof a weighted spectral projection $\\chi(k^{-1}T_R)$, where $\\chi$ is a cut-off\nfunction with compact support in the positive real line, is a semi-classical\nFourier integral operator with complex phase, hence admits a full asymptotic\nexpansion as $k\\to+\\infty$. More precisely, the restriction to the diagonal\n$\\chi(k^{-1}T_R)(x,x)$ decays at the rate $O(k^{-\\infty})$ in the interior and\nhas an asymptotic expansion on the boundary with leading term of order\n$k^{n+1}$ expressed in terms of the Levi form and the pairing of the contact\nform with the vector field $R$.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:09:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hsiao","Chin-Yu",""],["Marinescu","George",""]]}
{"id":"2308.09821","submitter":"Anish Pradhan","authors":"Anish Pradhan, J. Kartheek Devineni, Andreas F. Molisch, and Harpreet\n  S. Dhillon","title":"Novel LoS $\\beta-\\gamma$ THz Channel Unifying Molecular Re-radiation\n  Manifestations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel line-of-sight (LoS) $\\beta-\\gamma$ terahertz\n(THz) channel model that closely mirrors physical reality by considering\nradiation trapping. Our channel model provides an exhaustive modeling of the\nphysical phenomena including the amount of re-radiation available at the\nreceiver, parametrized by $\\beta$, and the balance between scattering and noise\ncontributions, parametrized by $\\gamma$, respectively. Our findings indicate a\nnontrivial relationship between average limiting received signal-to-noise ratio\n(SNR) and distance emphasizing the significance of $\\gamma$ in THz system\ndesign. We further propose new maximum likelihood (ML) thresholds for pulse\namplitude modulation (PAM) and quadrature amplitude modulation (QAM) schemes,\nresulting in analytical symbol error rate (SER) expressions that account for\ndifferent noise variances across constellation points. The results confirm that\nthe analytical SER closely matches the true simulated SER when using an optimal\ndetector. As expected, under maximum molecular re-radiation, the true SER is\nshown to be lower than that produced by a suboptimal detector that assumes\nequal noise variances.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:12:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pradhan","Anish",""],["Devineni","J. Kartheek",""],["Molisch","Andreas F.",""],["Dhillon","Harpreet S.",""]]}
{"id":"2308.09822","submitter":"Blas Irigoyen","authors":"Ana M. Botti, Brenda A. Cervantes-Vergara, Claudio R. Chavez, Fernando\n  Chierchie, Alex Drlica-Wagner, Juan Estrada, Guillermo Fernandez Moroni,\n  Stephen E. Holland, Blas J. Irigoyen Gimenez, Agustin J. Lapi, Edgar Marrufo\n  Villalpando, Miguel Sofo Haro, Javier Tiffenberg, Sho Uemura","title":"Fast Single-Quantum Measurement with a Multi-Amplifier Sensing\n  Charge-Coupled Device","comments":null,"journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-425-PPD","categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A novel readout architecture that uses multiple non-destructive floating-gate\namplifiers to achieve sub-electron readout noise in a thick, fully-depleted\nsilicon detector is presented. This Multi-Amplifier Sensing Charge-Coupled\nDevice (MAS-CCD) can perform multiple independent charge measurements with each\namplifier; measurements with multiple amplifiers can then be combined to\nfurther reduce the readout noise. The readout speed of this detector scales\nroughly linearly with the number of amplifiers without requiring segmentation\nof the active area. The performance of this detector is demonstrated,\nemphasizing the ability to resolve individual quanta and the ability to combine\nmeasurements across amplifiers to reduce readout noise. The unprecedented low\nnoise and fast readout of the MAS-CCD make it a unique technology for\nastronomical observations, quantum imaging, and low-energy interacting\nparticles.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:14:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Botti","Ana M.",""],["Cervantes-Vergara","Brenda A.",""],["Chavez","Claudio R.",""],["Chierchie","Fernando",""],["Drlica-Wagner","Alex",""],["Estrada","Juan",""],["Moroni","Guillermo Fernandez",""],["Holland","Stephen E.",""],["Gimenez","Blas J. Irigoyen",""],["Lapi","Agustin J.",""],["Villalpando","Edgar Marrufo",""],["Haro","Miguel Sofo",""],["Tiffenberg","Javier",""],["Uemura","Sho",""]]}
{"id":"2308.09823","submitter":"Anish Pradhan","authors":"Anish Pradhan, Harpreet S. Dhillon, Fredrik Tufvesson, and Andreas F.\n  Molisch","title":"Stochastic Geometry Analysis of a New GSCM with Dual Visibility Regions","comments":"Accepted in PIMRC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The geometry-based stochastic channel models (GSCM), which can describe\nrealistic channel impulse responses, often rely on the existence of both {\\em\nlocal} and {\\em far} scatterers. However, their visibility from both the base\nstation (BS) and mobile station (MS) depends on their relative heights and\npositions. For example, the condition of visibility of a scatterer from the\nperspective of a BS is different from that of an MS and depends on the height\nof the scatterer. To capture this, we propose a novel GSCM where each scatterer\nhas dual disk visibility regions (VRs) centered on itself for both BS and MS,\nwith their radii being our model parameters. Our model consists of {\\em short}\nand {\\em tall} scatterers, which are both modeled using independent\ninhomogeneous Poisson point processes (IPPPs) having distinct dual VRs. We also\nintroduce a probability parameter to account for the varying visibility of tall\nscatterers from different MSs, effectively emulating their noncontiguous VRs.\nUsing stochastic geometry, we derive the probability mass function (PMF) of the\nnumber of multipath components (MPCs), the marginal and joint distance\ndistributions for an active scatterer, the mean time of arrival (ToA), and the\nmean received power through non-line-of-sight (NLoS) paths for our proposed\nmodel. By selecting appropriate model parameters, the propagation\ncharacteristics of our GSCM are demonstrated to closely emulate those of the\nCOST-259 model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:18:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pradhan","Anish",""],["Dhillon","Harpreet S.",""],["Tufvesson","Fredrik",""],["Molisch","Andreas F.",""]]}
{"id":"2308.09824","submitter":"John Voight","authors":"Eran Assaf, Watson Ladd, Gustavo Rama, Gonzalo Tornaria, and John\n  Voight","title":"A database of paramodular forms from quinary orthogonal modular forms","comments":"17 pages, to appear in the LuCaNT proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute tables of paramodular forms of degree two and cohomological weight\nvia a correspondence with orthogonal modular forms on quinary lattices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:27:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Assaf","Eran",""],["Ladd","Watson",""],["Rama","Gustavo",""],["Tornaria","Gonzalo",""],["Voight","John",""]]}
{"id":"2308.09825","submitter":"Toni Annala","authors":"Hermanni Rajam\\\"aki, Toni Annala, Mikko M\\\"ott\\\"onen","title":"Topologically Protected Vortex Knots in an Experimentally Realizable\n  System","comments":"28 pages, 27 figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.soft math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ordered media often support vortex structures with intriguing topological\nproperties. Here, we investigate non-Abelian vortices in tetrahedral order,\nwhich appear in the cyclic phase of spin-2 Bose--Einstein condensates and in\nthe tetrahedratic phase of bent-core nematic liquid crystals. Using these\nvortices, we construct topologically protected knots in the sense that they\ncannot decay into unlinked simple loop defects through vortex crossings and\nreconnections without destroying the phase. The discovered structures are the\nfirst examples of knots bearing such topological protection in a known\nexperimentally realizable system.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:30:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rajam\u00e4ki","Hermanni",""],["Annala","Toni",""],["M\u00f6tt\u00f6nen","Mikko",""]]}
{"id":"2308.09826","submitter":"John Friedman","authors":"John L. Friedman","title":"Notes on Gravitational Physics","comments":"328 pages, 117 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  These notes are self-contained, with the first six chapters used for a\none-semester course with recommended texts by Wald, Misner, Thorne, and Wheeler\n(MTW), and, particularly for gravitational waves, by Schutz and by Thorne and\nBlandford. In its treatment of topics covered in these standard texts, the\npresentation here typically includes steps between equations that are skipped\nin Wald or MTW. Treatments of gravitational waves, particle orbits in\nblack-hole backgrounds, the Teukolsky equation, and the initial value equations\nare motivated in part by the dramatic discoveries of gravitational waves from\nthe inspiral and coalescence of binary black holes and neutron stars, advances\nin numerical relativity, and the expected launch of the LISA space-based\nobservatory. Students are assumed to have encountered special relativity, but\nthese notes give a detailed presentation with a geometrical orientation,\nstarting with with time dilation and length contraction and including\nrelativistic particles, fluids, electromagnetism, and curvilinear coordinates.\nChaps. 2-5 cover curvature, the Einstein equation, relativistic stars, and\nblack holes. Chap. 6, on gravitational waves, includes a discussion of\ndetection and of noise in interferometric detectors.\n  Chap. 7, on the initial value problem, has a section on the form of the\nequations used in numerical relativity. Its notation is that used, for example,\nin Baumgarte and Shapiro and Shibata; the presentation here is taken in part\nfrom the text by Friedman and Stergioulas. The notes also have a chapter on the\nNewman-Penrose formalism and the Teukolsky equation. Following that is a\nchapter on black-hole thermodynamics and a final chapter on the gravitational\naction and on conserved quantities for asymptotically flat spacetimes, using\nNoether's theorem.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:31:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Friedman","John L.",""]]}
{"id":"2308.09827","submitter":"David Huk","authors":"David Huk, Rilwan A. Adewoyin and Ritabrata Dutta","title":"Probabilistic Rainfall Downscaling: Joint Generalized Neural Models with\n  Censored Spatial Gaussian Copula","comments":"28 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work introduces a novel approach for generating conditional\nprobabilistic rainfall forecasts with temporal and spatial dependence. A\ntwo-step procedure is employed. Firstly, marginal location-specific\ndistributions are jointly modelled. Secondly, a spatial dependency structure is\nlearned to ensure spatial coherence among these distributions. To learn\nmarginal distributions over rainfall values, we introduce joint generalised\nneural models which expand generalised linear models with a deep neural network\nto parameterise a distribution over the outcome space. To understand the\nspatial dependency structure of the data, a censored latent Gaussian copula\nmodel is presented and trained via scoring rules. Leveraging the underlying\nspatial structure, we construct a distance matrix between locations,\ntransformed into a covariance matrix by a Gaussian Process Kernel depending on\na small set of parameters. To estimate these parameters, we propose a general\nframework for the estimation of Gaussian copulas employing scoring rules as a\nmeasure of divergence between distributions. Uniting our two contributions,\nnamely the joint generalised neural model and the censored latent Gaussian\ncopulas into a single model, our probabilistic approach generates forecasts on\nshort to long-term durations, suitable for locations outside the training set.\nWe demonstrate its efficacy using a large UK rainfall data set, outperforming\nexisting methods.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:35:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huk","David",""],["Adewoyin","Rilwan A.",""],["Dutta","Ritabrata",""]]}
{"id":"2308.09828","submitter":"Kevin K. Lehmann","authors":"Kevin K. Lehmann","title":"Polarization-dependent Intensity Ratios in Double Resonance Spectroscopy","comments":"18 pages including 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Double Resonance is a powerful method spectroscopic method that provides an\nunambiguous assignment of the rigorous quantum numbers of one state of a\ntransition. However, there is often ambiguity as to the branch ($\\Delta J$) of\nthe transition. The dependence of the intensity of the double resonance signal\non the relative polarization of pump and probe radiation can be used to resolve\nthis ambiguity and has been used for this in the past. However, the published\ntheoretical predictions for this ratio are based upon a weak (i.e.\nnon-saturating) field approximation. In this paper, we present theoretical\npredictions for these intensity ratios for cases where the pump field is\nstrongly saturating, in the two limits of transitions dominated by homogeneous\nand inhomogeneous broadening. While saturation, as can be expected, reduces the\nmagnitude of the polarization effect (driving the intensity ratio closer to\nunity), polarization anisotropy remains even with a strongly saturating probe\nfield in most cases. For the case of an inhomogeneously broadened line, as when\nDoppler broadening linewidth dominates over even the power broadened\nhomogeneous line width, a large fraction of the low pump power anisotropy\nremains. Results are presented for both the case of linear and circular pump\nand probe field polarizations. The present predictions are compared with\nexperimental measurements on CH$_4$ ground state $\\rightarrow \\nu_3 \\rightarrow\n3\\nu_3$ transitions recently reported by de Oliveira et al and found to be in\nbetter agreement than the weak field predictions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:35:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lehmann","Kevin K.",""]]}
{"id":"2308.09829","submitter":"Yung-Fu Chen","authors":"Yung-Fu Chen, Sen Lin, Anish Arora","title":"Learning from A Single Graph is All You Need for Near-Shortest Path\n  Routing in Wireless Networks","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":"  We propose a learning algorithm for local routing policies that needs only a\nfew data samples obtained from a single graph while generalizing to all random\ngraphs in a standard model of wireless networks. We thus solve the all-pairs\nnear-shortest path problem by training deep neural networks (DNNs) that\nefficiently and scalably learn routing policies that are local, i.e., they only\nconsider node states and the states of neighboring nodes. Remarkably, one of\nthese DNNs we train learns a policy that exactly matches the performance of\ngreedy forwarding; another generally outperforms greedy forwarding. Our\nalgorithm design exploits network domain knowledge in several ways: First, in\nthe selection of input features and, second, in the selection of a ``seed\ngraph'' and subsamples from its shortest paths. The leverage of domain\nknowledge provides theoretical explainability of why the seed graph and node\nsubsampling suffice for learning that is efficient, scalable, and\ngeneralizable. Simulation-based results on uniform random graphs with diverse\nsizes and densities empirically corroborate that using samples generated from a\nfew routing paths in a modest-sized seed graph quickly learns a model that is\ngeneralizable across (almost) all random graphs in the wireless network model.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:35:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Yung-Fu",""],["Lin","Sen",""],["Arora","Anish",""]]}
{"id":"2308.09830","submitter":"Oscar J. Romero","authors":"Oscar J. Romero, John Zimmerman, Aaron Steinfeld, Anthony Tomasic","title":"Synergistic Integration of Large Language Models and Cognitive\n  Architectures for Robust AI: An Exploratory Analysis","comments":"AAAI 2023 Fall Symposium","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores alternatives for integrating two subdisciplines of AI in\nthe construction of artificial agents that exhibit intelligent behavior: Large\nLanguage Models (LLMs) and Cognitive Architectures (CAs). Guided by theoretical\nmodels and supported by preliminary empirical data, we hypothesize how diverse\nsynergistic approaches can mutually compensate for their respective weaknesses\nand limitations, ultimately fostering more robust and sophisticated artificial\nintelligence systems. Additionally, we discuss the tradeoffs and challenges\nassociated with each approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:42:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Romero","Oscar J.",""],["Zimmerman","John",""],["Steinfeld","Aaron",""],["Tomasic","Anthony",""]]}
{"id":"2308.09831","submitter":"Ruining Deng","authors":"Ruining Deng, Nazim Shaikh, Gareth Shannon, Yao Nie","title":"Cross-modality Attention-based Multimodal Fusion for Non-small Cell Lung\n  Cancer (NSCLC) Patient Survival Prediction","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":"  Cancer prognosis and survival outcome predictions are crucial for therapeutic\nresponse estimation and for stratifying patients into various treatment groups.\nMedical domains concerned with cancer prognosis are abundant with multiple\nmodalities, including pathological image data and non-image data such as\ngenomic information. To date, multimodal learning has shown potential to\nenhance clinical prediction model performance by extracting and aggregating\ninformation from different modalities of the same subject. This approach could\noutperform single modality learning, thus improving computer-aided diagnosis\nand prognosis in numerous medical applications. In this work, we propose a\ncross-modality attention-based multimodal fusion pipeline designed to integrate\nmodality-specific knowledge for patient survival prediction in non-small cell\nlung cancer (NSCLC). Instead of merely concatenating or summing up the features\nfrom different modalities, our method gauges the importance of each modality\nfor feature fusion with cross-modality relationship when infusing the\nmultimodal features. Compared with single modality, which achieved c-index of\n0.5772 and 0.5885 using solely tissue image data or RNA-seq data, respectively,\nthe proposed fusion approach achieved c-index 0.6587 in our experiment,\nshowcasing the capability of assimilating modality-specific knowledge from\nvaried modalities.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:42:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Deng","Ruining",""],["Shaikh","Nazim",""],["Shannon","Gareth",""],["Nie","Yao",""]]}
{"id":"2308.09832","submitter":"Barnaby Levin","authors":"Barnaby D.A. Levin, Diane Haiber, Qianlang Liu, Peter A. Crozier","title":"An Open-Cell Environmental Transmission Electron Microscopy Technique\n  for In Situ Characterization of Samples in Aqueous Liquid Solutions","comments":"20 pages, 4 figures","journal-ref":"Microscopy and Microanalysis 26 (2020) 134-138","doi":"10.1017/S1431927619015320","report-no":null,"categories":"physics.app-ph physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The desire to image specimens in liquids has led to the development of\nopen-cell and closed-cell techniques in transmission electron microscopy (TEM).\nThe closed-cell approach is currently more common in TEM and has yielded new\ninsights into a number of biological and materials processes in liquid\nenvironments. The open-cell approach, which requires an environmental TEM\n(ETEM), is technically challenging but may be advantageous in certain\ncircumstances due to fewer restrictions on specimen and detector geometry.\nHere, we demonstrate a novel approach to open-cell liquid TEM, in which we use\nsalt particles to facilitate the in situ formation of droplets of aqueous\nsolution that envelope specimen particles coloaded with the salt. This is\nachieved by controlling sample temperature between 1 and 10{\\deg}C and\nintroducing water vapor to the ETEM chamber above the critical pressure for the\nformation of liquid water on the salt particles. Our use of in situ hydration\nenables specimens to be loaded into a microscope in a dry state using standard\n3 mm TEM grids, allowing specimens to be prepared using trivial sample\npreparation techniques. Our future aim will be to combine this technique with\nan in situ light source to study photocorrosion in aqueous environments.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:45:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Levin","Barnaby D. A.",""],["Haiber","Diane",""],["Liu","Qianlang",""],["Crozier","Peter A.",""]]}
{"id":"2308.09833","submitter":"Abdallah Slaoui","authors":"Hanan Saidi, Hanane El Hadfi, Abdallah Slaoui and Rachid Ahl Laamara","title":"Achieving quantum metrological performance and exact Heisenberg limit\n  precision through superposition of $s$-spin coherent states","comments":"15 pages, 63 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In quantum phase estimation, the Heisenberg limit provides the ultimate\naccuracy over quasi-classical estimation procedures. However, realizing this\nlimit hinges upon both the detection strategy employed for output measurements\nand the characteristics of the input states. This study delves into quantum\nphase estimation using $s$-spin coherent states superposition. Initially, we\ndelve into the explicit formulation of spin coherent states for a spin $s=3/2$.\nBoth the quantum Fisher information and the quantum Cramer-Rao bound are\nmeticulously examined. We analytically show that the ultimate measurement\nprecision of spin cat states approaches the Heisenberg limit, where uncertainty\ndecreases inversely with the total particle number. Moreover, we investigate\nthe phase sensitivity introduced through operators $e^{i\\zeta{S}_{z}}$,\n$e^{i\\zeta{S}_{x}}$ and $e^{i\\zeta{S}_{y}}$, subsequently comparing the\nresultants findings. In closing, we provide a general analytical expression for\nthe quantum Cramer-Rao boundary applied to these three parameter-generating\noperators, utilizing general $s$-spin coherent states. We remarked that\nattaining Heisenberg-limit precision requires the careful adjustment of\ninsightful information about the geometry of $s$-spin cat states on the Bloch\nsphere. Additionally, as the number of $s$-spin increases, the Heisenberg limit\ndecreases, and this reduction is inversely proportional to the $s$-spin number.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:46:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saidi","Hanan",""],["Hadfi","Hanane El",""],["Slaoui","Abdallah",""],["Laamara","Rachid Ahl",""]]}
{"id":"2308.09834","submitter":"Yuhan Yao","authors":"Yuhan Yao, Wenbin Lu, Fiona Harrison, S. R. Kulkarni, Suvi Gezari,\n  Muryel Guolo, S. Bradley Cenko, Anna Y. Q. Ho","title":"The On-axis Jetted Tidal Disruption Event AT2022cmc: X-ray Observations\n  and Broadband Spectral Modeling","comments":"16 pages, 11 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  AT2022cmc was recently reported as the first on-axis jetted tidal disruption\nevent (TDE) discovered in the last decade, and the fourth on-axis jetted TDE\ncandidate known so far. In this work, we present NuSTAR hard X-ray (3--30 keV)\nobservations of AT2022cmc, as well as soft X-ray (0.3--6 keV) observations\nobtained by NICER, Swift, and XMM-Newton. Our analysis reveals that the\nbroadband X-ray spectra can be well described by a broken power-law with $f_\\nu\n\\propto \\nu^{-0.5}$ ($f_\\nu \\propto \\nu^{-1}$) below (above) the rest-frame\nbreak energy of $E_{\\rm bk}\\sim 10$ keV at observer-frame $t_{\\rm obs}=7.8$ and\n17.6 days since discovery. At $t_{\\rm obs} = 36.2$ days, the X-ray spectrum is\nconsistent with either a single power-law of $f_\\nu \\propto \\nu^{-0.8}$ or a\nbroken power-law with spectral slopes similar to the first two epochs. By\nmodeling the spectral energy distribution evolution from radio to hard X-ray\nacross the three NuSTAR observing epochs, we find that the sub-millimeter/radio\nemission originates from external shocks at large distances $\\gtrsim\\! 10^{17}$\ncm from the black hole, the UV/optical light comes from a thermal envelope with\nradius $\\sim\\!10^{15}$ cm, and the X-ray emission is consistent with\nsynchrotron radiation powered by energy dissipation at intermediate radii\nwithin the (likely magnetically dominated) jet. Our interpretation differs from\nthe model proposed by Pasham et al. (2023) where both the radio and X-rays come\nfrom the same emitting zone in a matter-dominated jet. Our model for the jet\nX-ray emission has broad implications on the nature and radiation mechanism of\nrelativistic jets in other sources such as gamma-ray bursts.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 21:49:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yao","Yuhan",""],["Lu","Wenbin",""],["Harrison","Fiona",""],["Kulkarni","S. R.",""],["Gezari","Suvi",""],["Guolo","Muryel",""],["Cenko","S. Bradley",""],["Ho","Anna Y. Q.",""]]}
{"id":"2308.09835","submitter":"Shijie Li","authors":"Shijie Li, Mengwei Ren, Thomas Ach, Guido Gerig","title":"Microscopy Image Segmentation via Point and Shape Regularized Data\n  Synthesis","comments":"Accepted by The 3rd MICCAI Workshop on Data Augmentation, Labeling,\n  and Imperfections","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Current deep learning-based approaches for the segmentation of microscopy\nimages heavily rely on large amount of training data with dense annotation,\nwhich is highly costly and laborious in practice. Compared to full annotation\nwhere the complete contour of objects is depicted, point annotations,\nspecifically object centroids, are much easier to acquire and still provide\ncrucial information about the objects for subsequent segmentation. In this\npaper, we assume access to point annotations only during training and develop a\nunified pipeline for microscopy image segmentation using synthetically\ngenerated training data. Our framework includes three stages: (1) it takes\npoint annotations and samples a pseudo dense segmentation mask constrained with\nshape priors; (2) with an image generative model trained in an unpaired manner,\nit translates the mask to a realistic microscopy image regularized by object\nlevel consistency; (3) the pseudo masks along with the synthetic images then\nconstitute a pairwise dataset for training an ad-hoc segmentation model. On the\npublic MoNuSeg dataset, our synthesis pipeline produces more diverse and\nrealistic images than baseline models while maintaining high coherence between\ninput masks and generated images. When using the identical segmentation\nbackbones, the models trained on our synthetic dataset significantly outperform\nthose trained with pseudo-labels or baseline-generated images. Moreover, our\nframework achieves comparable results to models trained on authentic microscopy\nimages with dense labels, demonstrating its potential as a reliable and highly\nefficient alternative to labor-intensive manual pixel-wise annotations in\nmicroscopy image segmentation. The code is available.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:00:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Shijie",""],["Ren","Mengwei",""],["Ach","Thomas",""],["Gerig","Guido",""]]}
{"id":"2308.09836","submitter":"Travis Gagie","authors":"Andrej Bal\\'az, Travis Gagie, Adri\\'an Goga, Simon Heumos, Gonzalo\n  Navarro, Alessia Petescia and Jouni Sir\\'en","title":"Wheeler maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by challenges in pangenomic read alignment, we propose a\ngeneralization of Wheeler graphs that we call Wheeler maps. A Wheeler map\nstores a text $T[1..n]$ and an assignment of tags to the characters of $T$ such\nthat we can preprocess a pattern $P[1..m]$ and then, given $i$ and $j$, quickly\nreturn all the distinct tags labeling the first characters of the occurrences\nof $P[i..j]$ in $T$. For the applications that most interest us, characters\nwith long common contexts are likely to have the same tag, so we consider the\nnumber $t$ of runs in the list of tags sorted by their characters' positions in\nthe Burrows-Wheeler Transform (BWT) of $T$. We show how, given a straight-line\nprogram with $g$ rules for $T$, we can build an $O(g + r + t)$-space Wheeler\nmap, where $r$ is the number of runs in the BWT of $T$, with which we can\npreprocess a pattern $P[1..m]$ in $O(m \\log n)$ time and then return the $k$\ndistinct tags for $P[i..j]$ in optimal $O(k)$ time for any given $i$ and $j$.\nWe show various further results related to prioritizing the most frequent tags.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:04:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bal\u00e1z","Andrej",""],["Gagie","Travis",""],["Goga","Adri\u00e1n",""],["Heumos","Simon",""],["Navarro","Gonzalo",""],["Petescia","Alessia",""],["Sir\u00e9n","Jouni",""]]}
{"id":"2308.09837","submitter":"Viktor T. Toth","authors":"Viktor T. Toth","title":"Field theory with the Maxima computer algebra system","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SC gr-qc physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Maxima computer algebra system, the open-source successor to MACSYMA, the\nfirst general-purpose computer algebra system that was initially developed at\nthe Massachusetts Institute of Technology in the late 1960s and later\ndistributed by the United States Department of Energy, has some remarkable\ncapabilities, some of which are implemented in the form of add-on, \"share\"\npackages that are distributed along with the core Maxima system. One such share\npackage is itensor, for indicial tensor manipulation. One of the more\nremarkable features of itensor is functional differentiation. Through this, it\nis possible to use itensor to develop a Lagrangian field theory and derive the\ncorresponding field equations. In the present note, we demonstrate this\ncapability by deriving Maxwell's equations from the Maxwell Lagrangian, and\nexploring the properties of the system, including current conservation.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:12:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Toth","Viktor T.",""]]}
{"id":"2308.09838","submitter":"Viktor T. Toth","authors":"John W. Moffat and Viktor T. Toth","title":"Scalar-tensor-vector-gravity and NGC-1277","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  NGC1277 is a compact but massive lenticular galaxy that shows no signs of the\npresence of dark matter. We find that this galaxy's behavior is consistent not\nonly with Newtonian dynamics, but also with the predictions of\nScalar--Tensor--Vector--Gravity, also known as MOG (MOdified Gravity). The\ncompact size of the galaxy, in combination with its large mass, ensures that\nthere are no observable deviations between the predictions of Newtonian and MOG\norbital velocities within the galaxy's visible radius.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:13:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Moffat","John W.",""],["Toth","Viktor T.",""]]}
{"id":"2308.09839","submitter":"Randolph Settgast","authors":"Randolph R. Settgast, Yohann Dudouit, Nicola Castelletto, William R.\n  Tobin, Benjamin C. Corbett, Sergey Klevtsov","title":"Performant low-order matrix-free finite element kernels on GPU\n  architectures","comments":null,"journal-ref":null,"doi":null,"report-no":"LLNL-CONF-847789","categories":"math.NA cs.MS cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Numerical methods such as the Finite Element Method (FEM) have been\nsuccessfully adapted to utilize the computational power of GPU accelerators.\nHowever, much of the effort around applying FEM to GPU's has been focused on\nhigh-order FEM due to higher arithmetic intensity and order of accuracy. For\napplications such as the simulation of subsurface processes, high levels of\nheterogeneity results in high-resolution grids characterized by highly\ndiscontinuous (cell-wise) material property fields. Moreover, due to the\nsignificant uncertainties in the characterization of the domain of interest,\ne.g. geologic reservoirs, the benefits of high order accuracy are reduced, and\nlow-order methods are typically employed. In this study, we present a strategy\nfor implementing highly performant low-order matrix-free FEM operator kernels\nin the context of the conjugate gradient (CG) method. Performance results of\nmatrix-free Laplace and isotropic elasticity operator kernels are presented and\nare shown to compare favorably to matrix-based SpMV operators on V100, A100,\nand MI250X GPUs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:21:54 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 19:52:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Settgast","Randolph R.",""],["Dudouit","Yohann",""],["Castelletto","Nicola",""],["Tobin","William R.",""],["Corbett","Benjamin C.",""],["Klevtsov","Sergey",""]]}
{"id":"2308.09840","submitter":"Daniel Drew","authors":"C. Luke Nelson, Daniel S. Drew","title":"High Aspect Ratio Multi-stage Ducted Electroaerodynamic Thrusters for\n  Micro Air Vehicle Propulsion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electroaerodynamic propulsion, where force is produced through collisions\nbetween electrostatically accelerated ions and neutral air molecules, is an\nattractive alternative to propeller- and flapping wing-based methods for micro\nair vehicle (MAV) flight due to its silent and solid-state nature. One major\nbarrier to adoption is its limited thrust efficiency at useful disk loading\nlevels. Ducted actuators comprising multiple serially-integrated acceleration\nstages are a potential solution, allowing individual stages to operate at\nhigher efficiency while maintaining a useful total thrust, and potentially\nimproving efficiency through various aerodynamic and fluid dynamic mechanisms.\nIn this work, we investigate the effects of duct and emitter electrode\ngeometries on actuator performance, then show how a combination of increasing\ncross-sectional aspect ratio and serial integration of multiple stages can be\nused to produce overall thrust densities comparable to commercial propulsors.\nAn optimized five-stage device attains a thrust density of about 18 N/m$^2$ at\na thrust efficiency of about 2 mN/W, among the highest values ever measured at\nthis scale. We further show how this type of thruster can be integrated under\nthe wings of a MAV-scale fixed wing platform, pointing towards future use as a\ndistributed propulsion system.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:22:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nelson","C. Luke",""],["Drew","Daniel S.",""]]}
{"id":"2308.09841","submitter":"Cheng Chen","authors":"Cheng Chen, Rebecca G. Martin and C. J. Nixon","title":"Can a binary star host three giant circumbinary planets?","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the orbital stability of a tilted circumbinary planetary\nsystem with three giant planets. The planets are spaced by a constant number\n($\\Delta$) of mutual Hill radii in the range $\\Delta=3.4-12.0$ such that the\nperiod ratio of the inner pair is the same as the outer pair. A tilted\ncircumbinary planetary system can be unstable even if the same system around a\ncoplanar binary is stable. For an equal mass binary, we find that the stability\nof a three-planet system is qualitatively similar to that of a two-planet\nsystem, but the three-planet system is more unstable in mean motion resonance\nregions. For an unequal mass binary, there is significantly more instability in\nthe three-planet system as the inner planets can undergo von-Zeipel-Kozai-Lidov\noscillations. Generally in unstable systems, the inner planets are more likely\nto be ejected than the outer planets. The most likely unstable outcome for\nclosely spaced systems, with $\\Delta \\lesssim 8$, is a single remaining stable\nplanet. For more widely separated systems, $\\Delta \\gtrsim 8$, the most likely\nunstable outcome is two stable planets, only one being ejected. An observed\ncircumbinary planet with significant eccentricity may suggest that it was\nformed from an unstable system. Consequently, a binary can host three tilted\ngiant planets if the binary stars are close to equal mass and provided that the\nplanets are well spaced and not close to a mean motion resonance.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:26:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Cheng",""],["Martin","Rebecca G.",""],["Nixon","C. J.",""]]}
{"id":"2308.09842","submitter":"Luca Marzari","authors":"Luca Marzari, Davide Corsi, Enrico Marchesini, Alessandro Farinelli\n  and Ferdinando Cicalese","title":"Enumerating Safe Regions in Deep Neural Networks with Provable\n  Probabilistic Guarantees","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":"  Identifying safe areas is a key point to guarantee trust for systems that are\nbased on Deep Neural Networks (DNNs). To this end, we introduce the\nAllDNN-Verification problem: given a safety property and a DNN, enumerate the\nset of all the regions of the property input domain which are safe, i.e., where\nthe property does hold. Due to the #P-hardness of the problem, we propose an\nefficient approximation method called epsilon-ProVe. Our approach exploits a\ncontrollable underestimation of the output reachable sets obtained via\nstatistical prediction of tolerance limits, and can provide a tight (with\nprovable probabilistic guarantees) lower estimate of the safe areas. Our\nempirical evaluation on different standard benchmarks shows the scalability and\neffectiveness of our method, offering valuable insights for this new type of\nverification of DNNs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:30:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Marzari","Luca",""],["Corsi","Davide",""],["Marchesini","Enrico",""],["Farinelli","Alessandro",""],["Cicalese","Ferdinando",""]]}
{"id":"2308.09843","submitter":"Amit Chanda","authors":"Amit Chanda, Deepika Rani, Derick DeTellem, Noha Alzahrani, Dario A.\n  Arena, Sarath Witanachchi, Ratnamala Chatterjee, Manh-Huong Phan and\n  Hariharan Srikanth","title":"Large thermo-spin effects in Heusler alloy based spin-gapless\n  semiconductor thin films","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Heusler alloys-based spin gapless semiconductors (SGSs) with high\nCurie temperature (TC) and sizeable spin polarization have emerged as potential\ncandidates for tunable spintronic applications. We report comprehensive\ninvestigation of the temperature dependent ANE and intrinsic longitudinal spin\nSeebeck effect (LSSE) in CoFeCrGa thin films grown on MgO substrates. Our\nfindings show the anomalous Nernst coefficient for the MgO/CoFeCrGa (95 nm)\nfilm is $\\cong 1.86$ micro V/K at room temperature which is nearly two orders\nof magnitude higher than that of the bulk polycrystalline sample of CoFeCrGa (=\n0.018 micro V/K) but comparable to that of the magnetic Weyl semimetal Co2MnGa\nthin film (2-3 micro V/K). Furthermore, the LSSE coefficient for our\nMgO/CoFeCrGa(95nm)/Pt(5nm) heterostructure is $\\cong 20.5$ $\\mu$V/K/$\\Omega$ at\nroom temperature which is twice larger than that of the half-metallic\nferromagnetic La$_{0.7}$Sr$_{0.3}$MnO$_3$ thin films ($\\cong$ 20.5\n$\\mu$V/K/$\\Omega$). We show that both ANE and LSSE coefficients follow\nidentical temperature dependences and exhibit a maximum at $\\cong$ 225 K which\nis understood as the combined effects of inelastic magnon scatterings and\nreduced magnon population at low temperatures. Our analyses not only indicate\nthat the extrinsic skew scattering is the dominating mechanism for ANE in these\nfilms but also provide critical insights into the functional form of the\nobserved temperature dependent LSSE at low temperatures. Furthermore, by\nemploying radio frequency transverse susceptibility and broadband ferromagnetic\nresonance in combination with the LSSE measurements, we establish a correlation\namong the observed LSSE signal, magnetic anisotropy and Gilbert damping of the\nCoFeCrGa thin films, which will be beneficial for fabricating tunable and\nhighly efficient Heusler alloys based spincaloritronic nanodevices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:33:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chanda","Amit",""],["Rani","Deepika",""],["DeTellem","Derick",""],["Alzahrani","Noha",""],["Arena","Dario A.",""],["Witanachchi","Sarath",""],["Chatterjee","Ratnamala",""],["Phan","Manh-Huong",""],["Srikanth","Hariharan",""]]}
{"id":"2308.09844","submitter":"Marcelo Disconzi","authors":"Marcelo M. Disconzi","title":"Recent developments in mathematical aspects of relativistic fluids","comments":"Minor typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP gr-qc math-ph math.MP nucl-th physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review some recent developments in mathematical aspects of relativistic\nfluids. The goal is to provide a quick entry point to some research topics of\ncurrent interest that is accessible to graduate students and researchers from\nadjacent fields, as well as to researches working on broader aspects of\nrelativistic fluid dynamics interested in its mathematical formalism. Instead\nof complete proofs, which can be found in the published literature, here we\nfocus on the proofs' main ideas and key concepts. After an introduction to the\nrelativistic Euler equations, we cover the following topics: a new\nwave-transport formulation of the relativistic Euler equations tailored to\napplications; the problem of shock formation for relativistic Euler; rough\n(i.e., low-regularity) solutions to the relativistic Euler equations; the\nrelativistic Euler equations with a physical vacuum boundary; relativistic\nfluids with viscosity. We finish with a discussion of open problems and future\ndirections of research.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:42:47 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 13:06:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Disconzi","Marcelo M.",""]]}
{"id":"2308.09845","submitter":"Sepideh K. Gharamaleki","authors":"Sepideh K. Gharamaleki, Brandon Helfield, Hassan Rivaz","title":"Deformable-Detection Transformer for Microbubble Localization in\n  Ultrasound Localization Microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To overcome the half a wavelength resolution limitations of ultrasound\nimaging, microbubbles (MBs) have been utilized widely in the field.\nConventional MB localization methods are limited whether by exhaustive\nparameter tuning or considering a fixed Point Spread Function (PSF) for MBs.\nThis questions their adaptability to different imaging settings or depths. As a\nresult, development of methods that don't rely on manually adjusted parameters\nis crucial. Previously, we used a transformer-based approach i.e. DEtection\nTRansformer (DETR) (arXiv:2005.12872v3 and arXiv:2209.11859v1) to address the\nabove mentioned issues. However, DETR suffers from long training times and\nlower precision for smaller objects. In this paper, we propose the application\nof DEformable DETR (DE-DETR) ( arXiv:2010.04159) for MB localization to\nmitigate DETR's above mentioned challenges. As opposed to DETR, where attention\nis casted upon all grid pixels, DE-DETR utilizes a multi-scale deformable\nattention to distribute attention within a limited budget. To evaluate the\nproposed strategy, pre-trained DE-DETR was fine-tuned on a subset of the\ndataset provided by the IEEE IUS Ultra-SR challenge organizers using transfer\nlearning principles and subsequently we tested the network on the rest of the\ndataset, excluding the highly correlated frames. The results manifest an\nimprovement both in precision and recall and the final super-resolution maps\ncompared to DETR.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:43:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gharamaleki","Sepideh K.",""],["Helfield","Brandon",""],["Rivaz","Hassan",""]]}
{"id":"2308.09846","submitter":"Pablo Shmerkin","authors":"Pablo Shmerkin","title":"Inverse theorems for discretized sums and $L^q$ norms of convolutions in\n  $\\mathbb{R}^d$","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove inverse theorems for the size of sumsets and the $L^q$ norms of\nconvolutions in the discretized setting, extending to arbitrary dimension an\nearlier result of the author in the line. These results have applications to\nthe dimensions of dynamical self-similar sets and measures, and to the higher\ndimensional fractal uncertainty principle. The proofs are based on a structure\ntheorem for the entropy of convolution powers due to M.~Hochman.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:46:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shmerkin","Pablo",""]]}
{"id":"2308.09847","submitter":"Lucas Aimaretto","authors":"Lucas Aimaretto, Diego Dujovne","title":"Enhancing End-to-End Determinism and Reliability in 6TiSCH networks with\n  disjoint leaf-based MPLS-like tunnels","comments":"This work has been submitted to Elsevier 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.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Industrial multi-hop Internet of Things (IIoT) have strict reliability\nrequirements and they are expected to have deterministic behavior. Reliability\nis associated with the network's ability to provide the best goodput possible\nto the destination from the source application, while deterministic behavior\nimplies that the packets must also arrive at the destination before the maximum\nallowable deadline defined by the application expires. Although a relevant\nnumber of proposals have arisen in recent years, none of them achieve both\nrestrictions simultaneously. In this work, we propose a cross-layer approach to\nsolve this problem, by combining three strategies: (i) the use of the preferred\nparents (PP) and alternative parents (AP) together with the PRE (Packet\nReplication and Elimination) technique at the routing level; (ii) the use of\nMPLS tunnels from the leafNode, improving the Data Plane, to control the energy\nconsumption and (iii) the use of the BDPC (Bounded Delay Packet Control)\nalgorithm. The combination of the former strategies show that the behavior of\nthe packet flows improves the end-to-end Packet Delivery Rate of the packets\narriving before the deadline by 2.04 times with respect to standard Minimum\nScheduling Function reference network while simultaneously increasing the\nminimum average network lifetime by 1.5 times, with respect to the hop by hop\nuncontrolled usage of PRE.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:49:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aimaretto","Lucas",""],["Dujovne","Diego",""]]}
{"id":"2308.09848","submitter":"Scott Scharlach","authors":"Matthew Shelby, Scott Scharlach, Petar Matejic, RJ Everett, Colton\n  Morgan","title":"An Optical Analysis of Sunspots as Predictors of Geomagnetic Storms","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although a variety of phenomena may create a geomagnetic storm on Earth, the\nmost severe geomagnetic storms arise from solar activity, and in particular,\ncoronal mass ejections (CMEs) and solar flares. CMEs and flares originate\nprimarily from sunspots. The \"aa index\" is a metric which ranks all of the\nstrongest geomagnetic storms between 1868 and 2010 based on a variety of\ncharacteristics taken from several sources. This paper examines correlations\nbetween the aa index of the most severe geomagnetic storms and the intrinsic\ncharacteristics of the sunspots from which they originated. We find a\ncorrelation between the total rank of the aa index of the storms and the \"total\nintensity\" of the sunspot, where total intensity is defined as the sunspot's\nmean intensity multiplied by its area. The correlation has an R-Squared = 0.690\nand R-Squared = 0.855 when a potentially corrupted data point is removed.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:49:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shelby","Matthew",""],["Scharlach","Scott",""],["Matejic","Petar",""],["Everett","RJ",""],["Morgan","Colton",""]]}
{"id":"2308.09849","submitter":"Luiz-Rafael Santos","authors":"Roger Behling and Yunier Bello-Cruz and Alfredo Iusem and Di Liu and\n  Luiz-Rafael Santos","title":"A finitely convergent circumcenter method for the Convex Feasibility\n  Problem","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 present a variant of the circumcenter method for the Convex\nFeasibility Problem (CFP), ensuring finite convergence under a Slater\nassumption. The method replaces exact projections onto the convex sets with\nprojections onto separating halfspaces, perturbed by positive exogenous\nparameters that decrease to zero along the iterations. If the perturbation\nparameters decrease slowly enough, such as the terms of a diverging series,\nfinite convergence is achieved. To the best of our knowledge, this is the first\ncircumcenter method for CFP that guarantees finite convergence.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:51:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Behling","Roger",""],["Bello-Cruz","Yunier",""],["Iusem","Alfredo",""],["Liu","Di",""],["Santos","Luiz-Rafael",""]]}
{"id":"2308.09850","submitter":"George Kesidis","authors":"Xi Li, Zhen Xiang, David J. Miller, George Kesidis","title":"Backdoor Mitigation by Correcting the Distribution of Neural Activations","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":"  Backdoor (Trojan) attacks are an important type of adversarial exploit\nagainst deep neural networks (DNNs), wherein a test instance is (mis)classified\nto the attacker's target class whenever the attacker's backdoor trigger is\npresent. In this paper, we reveal and analyze an important property of backdoor\nattacks: a successful attack causes an alteration in the distribution of\ninternal layer activations for backdoor-trigger instances, compared to that for\nclean instances. Even more importantly, we find that instances with the\nbackdoor trigger will be correctly classified to their original source classes\nif this distribution alteration is corrected. Based on our observations, we\npropose an efficient and effective method that achieves post-training backdoor\nmitigation by correcting the distribution alteration using reverse-engineered\ntriggers. Notably, our method does not change any trainable parameters of the\nDNN, but achieves generally better mitigation performance than existing methods\nthat do require intensive DNN parameter tuning. It also efficiently detects\ntest instances with the trigger, which may help to catch adversarial entities\nin the act of exploiting the backdoor.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:52:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Xi",""],["Xiang","Zhen",""],["Miller","David J.",""],["Kesidis","George",""]]}
{"id":"2308.09851","submitter":"Marcelo Disconzi","authors":"Marcelo M. Disconzi, Yuanzhen Shao","title":"Strongly hyperbolic quasilinear systems revisited, with applications to\n  relativistic fluid dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP gr-qc math-ph math.MP nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the theory of first-order quasilinear systems with diagonalizable\nprincipal part and only real eigenvalues, what is commonly referred to as\nstrongly hyperbolic systems. We provide a self-contained and simple proof of\nlocal well-posedness, in the Hadamard sense, of the Cauchy problem. Our\nregularity assumptions are very minimal. As an application, we apply our\nresults to systems of ideal and viscous relativistic fluids, where the theory\nof strongly hyperbolic equations has been systematically used to study several\nsystems of physical interest.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 22:55:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Disconzi","Marcelo M.",""],["Shao","Yuanzhen",""]]}
{"id":"2308.09852","submitter":"Joel Klipfel","authors":"Karleigh Pine and Razvan Veliche and Jared Bennett and Joel Klipfel","title":"SICO: Simulation for Infection Control Operations","comments":"32 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In response to the COVID-19 pandemic and the potential threat of future\nepidemics caused by novel viruses, we developed a flexible framework for\nmodeling disease intervention effects. This tool is intended to aid decision\nmakers at multiple levels as they compare possible responses to emerging\nepidemiological threats for optimal control and reduction of harm. The\nframework is specifically designed to be both scalable and modular, allowing it\nto model a variety of population levels, viruses, testing methods and\nstrategies--including pooled testing--and intervention strategies. In this\npaper, we provide an overview of this framework and examine the impact of\ndifferent intervention strategies and their impact on infection dynamics.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:06:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pine","Karleigh",""],["Veliche","Razvan",""],["Bennett","Jared",""],["Klipfel","Joel",""]]}
{"id":"2308.09853","submitter":"Amirreza Payandeh","authors":"Amirreza Payandeh, Dan Pluth, Jordan Hosier, Xuesu Xiao, Vijay K.\n  Gurbani","title":"How susceptible are LLMs to Logical Fallacies?","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 investigates the rational thinking capability of Large Language\nModels (LLMs) in multi-round argumentative debates by exploring the impact of\nfallacious arguments on their logical reasoning performance. More specifically,\nwe present Logic Competence Measurement Benchmark (LOGICOM), a diagnostic\nbenchmark to assess the robustness of LLMs against logical fallacies. LOGICOM\ninvolves two agents: a persuader and a debater engaging in a multi-round debate\non a controversial topic, where the persuader tries to convince the debater of\nthe correctness of its claim. First, LOGICOM assesses the potential of LLMs to\nchange their opinions through reasoning. Then, it evaluates the debater's\nperformance in logical reasoning by contrasting the scenario where the\npersuader employs logical fallacies against one where logical reasoning is\nused. We use this benchmark to evaluate the performance of GPT-3.5 and GPT-4\nusing a dataset containing controversial topics, claims, and reasons supporting\nthem. Our findings indicate that both GPT-3.5 and GPT-4 can adjust their\nopinion through reasoning. However, when presented with logical fallacies,\nGPT-3.5 and GPT-4 are erroneously convinced 41% and 69% more often,\nrespectively, compared to when logical reasoning is used. Finally, we introduce\na new dataset containing over 5k pairs of logical vs. fallacious arguments. The\nsource code and dataset of this work are made publicly available.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:07:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Payandeh","Amirreza",""],["Pluth","Dan",""],["Hosier","Jordan",""],["Xiao","Xuesu",""],["Gurbani","Vijay K.",""]]}
{"id":"2308.09854","submitter":"Joel Zinn","authors":"Joel C. Zinn, Marc H. Pinsonneault, Lars Bildsten, Dennis Stello","title":"The effect of the adiabatic assumption on asteroseismic scaling\n  relations for luminous red giants","comments":"Accepted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although stellar radii from asteroseismic scaling relations agree at the\npercent level with independent estimates for main sequence and most\nfirst-ascent red giant branch stars, the scaling relations over-predict radii\nat the tens of percent level for the most luminous stars ($R \\gtrsim 30\nR_{\\odot}$). These evolved stars have significantly superadiabatic envelopes,\nand the extent of these regions increase with increasing radius. However,\nadiabaticity is assumed in the theoretical derivation of the scaling relations\nas well as in corrections to the large frequency separation. Here, we show that\na part of the scaling relation radius inflation may arise from this assumption\nof adiabaticity. With a new reduction of Kepler asteroseismic data, we find\nthat scaling relation radii and Gaia radii agree to within at least $2\\%$ for\nstars with $R \\lesssim 30 R_{\\odot}$, when treated under the adiabatic\nassumption. The accuracy of scaling relation radii for stars with $50 R_{\\odot}\n\\lesssim R \\lesssim 100 R_{\\odot}$, however, is not better than $10\\%-15\\%$\nusing adiabatic large frequency separation corrections. We find that up to one\nthird of this disagreement for stars with $R \\approx 100 R_{\\odot}$ could be\ncaused by the adiabatic assumption, and that this adiabatic error increases\nwith radius to reach $10\\%$ at the tip of the red giant branch. We demonstrate\nthat, unlike the solar case, the superadiabatic gradient remains large very\ndeep in luminous stars. A large fraction of the acoustic cavity is also in the\noptically thin atmosphere. The observed discrepancies may therefore reflect the\nsimplified treatment of convection and atmospheres.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:35:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zinn","Joel C.",""],["Pinsonneault","Marc H.",""],["Bildsten","Lars",""],["Stello","Dennis",""]]}
{"id":"2308.09855","submitter":"Liming Yang","authors":"Liming Yang","title":"A Note on Spectral Mapping Theorems for Subnormal Operators","comments":"arXiv admin note: text overlap with arXiv:2301.06305","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a compact subset $K\\subset \\mathbb C$ and a positive finite Borel measure\n$\\mu$ supported on $K,$ let $\\text{Rat}(K)$ denote the space of rational\nfunctions with poles off $K,$ let $R^\\infty (K,\\mu)$ be the weak-star closure\nof $\\text{Rat}(K)$ in $L^\\infty (\\mu),$ and let $R^2 (K,\\mu)$ be the closure of\n$\\text{Rat}(K)$ in $L^2(\\mu).$ We show that there exists a compact subset\n$K\\subset \\mathbb C,$ a positive finite Borel measure $\\mu$ supported on $K,$\nand a function $f\\in R^\\infty (K,\\mu)$ such that $R^\\infty (K,\\mu)$ has no\nnon-trivial direct $L^\\infty$ summands, $f$ is invertible in $R^2 (K,\\mu)\\cap\nL^\\infty(\\mu),$ and $f$ is not invertible in $R^\\infty (K,\\mu).$ The result\nanswers an open question concerning spectral mapping theorems for subnormal\noperators raised by J. Dudziak in 1984.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:37:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Liming",""]]}
{"id":"2308.09856","submitter":"Evangelos Nikitopoulos","authors":"David A. Jekel and Todd A. Kemp and Evangelos A. Nikitopoulos","title":"A Martingale Approach to Noncommutative Stochastic Calculus","comments":"73 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a new approach to noncommutative stochastic calculus that is, like\nthe classical theory, based primarily on the martingale property. Using this\napproach, we introduce a general theory of stochastic integration and quadratic\n(co)variation for a certain class of noncommutative processes -- analogous to\nsemimartingales -- that includes both the $q$-Brownian motions and classical $n\n\\times n$ matrix-valued Brownian motions. As applications, we obtain\nBurkholder-Davis-Gundy inequalities (with $p \\geq 2$) for continuous-time\nnoncommutative martingales and a noncommutative It\\^{o} formula for \"adapted\n$C^2$ maps,\" including trace $\\ast$-polynomial maps and operator functions\nassociated to the noncommutative $C^2$ scalar functions $\\mathbb{R} \\to\n\\mathbb{C}$ introduced by Nikitopoulos, as well as the more general\nmultivariate tracial noncommutative $C^2$ functions introduced by\nJekel-Li-Shlyakhtenko.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:37:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jekel","David A.",""],["Kemp","Todd A.",""],["Nikitopoulos","Evangelos A.",""]]}
{"id":"2308.09857","submitter":"Yize Chen","authors":"Siyang Li, Hui Xiong, Yize Chen","title":"DiffCharge: Generating EV Charging Scenarios via a Denoising Diffusion\n  Model","comments":"10 pages, 14 figures, in submission; Code available at\n  https://github.com/LSY-Cython/DiffCharge","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent proliferation of electric vehicle (EV) charging events has brought\nprominent stress over power grid operation. Due to the stochastic and volatile\nEV charging behaviors, the induced charging loads are extremely uncertain,\nposing modeling and control challenges for grid operators and charging\nmanagement. Generating EV charging scenarios would aid via synthesizing a\nmyriad of realistic charging scenarios. To this end, we propose a novel\ndenoising Diffusion-based Charging scenario generation model DiffCharge, which\nis capable of generating a broad variety of realistic EV charging profiles with\ndistinctive temporal properties. It is able to progressively convert the simply\nknown Gaussian noise to genuine charging time-series data, by learning a\nparameterized reversal of a forward diffusion process. Besides, we leverage the\nmulti-head self-attention and prior conditions to capture the temporal\ncorrelations and unique information associated with EV or charging station\ntypes in real charging profiles. Moreover, We demonstrate the superiority of\nDiffCharge on extensive real-world charging datasets, as well as the efficacy\non EV integration in power distribution grids.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:52:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Siyang",""],["Xiong","Hui",""],["Chen","Yize",""]]}
{"id":"2308.09858","submitter":"Yequan Zhao","authors":"Yequan Zhao, Xinling Yu, Zhixiong Chen, Ziyue Liu, Sijia Liu and Zheng\n  Zhang","title":"Tensor-Compressed Back-Propagation-Free Training for (Physics-Informed)\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Backward propagation (BP) is widely used to compute the gradients in neural\nnetwork training. However, it is hard to implement BP on edge devices due to\nthe lack of hardware and software resources to support automatic\ndifferentiation. This has tremendously increased the design complexity and\ntime-to-market of on-device training accelerators. This paper presents a\ncompletely BP-free framework that only requires forward propagation to train\nrealistic neural networks. Our technical contributions are three-fold. Firstly,\nwe present a tensor-compressed variance reduction approach to greatly improve\nthe scalability of zeroth-order (ZO) optimization, making it feasible to handle\na network size that is beyond the capability of previous ZO approaches.\nSecondly, we present a hybrid gradient evaluation approach to improve the\nefficiency of ZO training. Finally, we extend our BP-free training framework to\nphysics-informed neural networks (PINNs) by proposing a sparse-grid approach to\nestimate the derivatives in the loss function without using BP. Our BP-free\ntraining only loses little accuracy on the MNIST dataset compared with standard\nfirst-order training. We also demonstrate successful results in training a PINN\nfor solving a 20-dim Hamiltonian-Jacobi-Bellman PDE. This memory-efficient and\nBP-free approach may serve as a foundation for the near-future on-device\ntraining on many resource-constraint platforms (e.g., FPGA, ASIC,\nmicro-controllers, and photonic chips).\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 23:56:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Yequan",""],["Yu","Xinling",""],["Chen","Zhixiong",""],["Liu","Ziyue",""],["Liu","Sijia",""],["Zhang","Zheng",""]]}
{"id":"2308.09859","submitter":"Bashu Khanal","authors":"N. K. Raut, B. D. Khanal, J. K. Tiskumara, S. De Silva, P. Dhakal, G.\n  Ciovati1 and J. R. Delayen","title":"Temperature, RF Field, and Frequency Dependence Performance Evaluation\n  of Superconducting Niobium Half-Wave Cavity","comments":"21st International Conference on Radio-Frequency Superconductivity\n  (SRF 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advancement in superconducting radio frequency cavity processing\ntechniques, with diffusion of impurities within the RF penetration depth,\nresulted in high quality factor with increase in quality factor with increasing\naccelerating gradient. The increase in quality factor is the result of a\ndecrease in the surface resistance as a result of nonmagnetic impurities doping\nand change in electronic density of states. The fundamental understanding of\nthe dependence of surface resistance on frequency and surface preparation is\nstill an active area of research. Here, we present the result of RF\nmeasurements of the TEM modes in a coaxial half wave niobium cavity resonating\nat frequencies between 0.3-1.3 GHz. The temperature dependence of the surface\nresistance was measured between 4.2 K and 1.6 K. The field dependence of the\nsurface resistance was measured at 2.0 K. The baseline measurements were made\nafter standard surface preparation by buffered chemical polishing.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:08:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Raut","N. K.",""],["Khanal","B. D.",""],["Tiskumara","J. K.",""],["De Silva","S.",""],["Dhakal","P.",""],["Ciovati1","G.",""],["Delayen","J. R.",""]]}
{"id":"2308.09860","submitter":"Chris Eppolito","authors":"Chris Eppolito","title":"Pythagorean Hyperplane Arrangements: Combinatorics of Gain Genericity","comments":"31 pages, 16 figures. Comments appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study Pythagorean hyperplane arrangements, originally defined by\nZaslavsky. In this first part of a series on such arrangements, we introduce a\nnew notion of genericity for such arrangements. Using this notion we construct\nan auxiliary hyperplane arrangement whose combinatorics determines the\ncombinatorics of all possible Pythagorean arrangements. We close with several\napplications and examples.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:09:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Eppolito","Chris",""]]}
{"id":"2308.09861","submitter":"Yu-An Liu","authors":"Yu-An Liu, Ruqing Zhang, Jiafeng Guo, Maarten de Rijke, Wei Chen,\n  Yixing Fan, Xueqi Cheng","title":"Black-box Adversarial Attacks against Dense Retrieval Models: A\n  Multi-view Contrastive Learning Method","comments":"Accept by CIKM2023, 10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural ranking models (NRMs) and dense retrieval (DR) models have given rise\nto substantial improvements in overall retrieval performance. In addition to\ntheir effectiveness, and motivated by the proven lack of robustness of deep\nlearning-based approaches in other areas, there is growing interest in the\nrobustness of deep learning-based approaches to the core retrieval problem.\nAdversarial attack methods that have so far been developed mainly focus on\nattacking NRMs, with very little attention being paid to the robustness of DR\nmodels. In this paper, we introduce the adversarial retrieval attack (AREA)\ntask. The AREA task is meant to trick DR models into retrieving a target\ndocument that is outside the initial set of candidate documents retrieved by\nthe DR model in response to a query. We consider the decision-based black-box\nadversarial setting, which is realistic in real-world search engines. To\naddress the AREA task, we first employ existing adversarial attack methods\ndesigned for NRMs. We find that the promising results that have previously been\nreported on attacking NRMs, do not generalize to DR models: these methods\nunderperform a simple term spamming method. We attribute the observed lack of\ngeneralizability to the interaction-focused architecture of NRMs, which\nemphasizes fine-grained relevance matching. DR models follow a different\nrepresentation-focused architecture that prioritizes coarse-grained\nrepresentations. We propose to formalize attacks on DR models as a contrastive\nlearning problem in a multi-view representation space. The core idea is to\nencourage the consistency between each view representation of the target\ndocument and its corresponding viewer via view-wise supervision signals.\nExperimental results demonstrate that the proposed method can significantly\noutperform existing attack strategies in misleading the DR model with small\nindiscernible text perturbations.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:24:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Yu-An",""],["Zhang","Ruqing",""],["Guo","Jiafeng",""],["de Rijke","Maarten",""],["Chen","Wei",""],["Fan","Yixing",""],["Cheng","Xueqi",""]]}
{"id":"2308.09862","submitter":"Maithili Sabane","authors":"Maithili Sabane and Onkar Litake and Aman Chadha","title":"Breaking Language Barriers: A Question Answering Dataset for Hindi and\n  Marathi","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent advances in deep-learning have led to the development of highly\nsophisticated systems with an unquenchable appetite for data. On the other\nhand, building good deep-learning models for low-resource languages remains a\nchallenging task. This paper focuses on developing a Question Answering dataset\nfor two such languages- Hindi and Marathi. Despite Hindi being the 3rd most\nspoken language worldwide, with 345 million speakers, and Marathi being the\n11th most spoken language globally, with 83.2 million speakers, both languages\nface limited resources for building efficient Question Answering systems. To\ntackle the challenge of data scarcity, we have developed a novel approach for\ntranslating the SQuAD 2.0 dataset into Hindi and Marathi. We release the\nlargest Question-Answering dataset available for these languages, with each\ndataset containing 28,000 samples. We evaluate the dataset on various\narchitectures and release the best-performing models for both Hindi and\nMarathi, which will facilitate further research in these languages. Leveraging\nsimilarity tools, our method holds the potential to create datasets in diverse\nlanguages, thereby enhancing the understanding of natural language across\nvaried linguistic contexts. Our fine-tuned models, code, and dataset will be\nmade publicly available.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:39:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sabane","Maithili",""],["Litake","Onkar",""],["Chadha","Aman",""]]}
{"id":"2308.09863","submitter":"Shaunak Mehta","authors":"Shaunak A. Mehta, Forrest Meng, Andrea Bajcsy, and Dylan P. Losey","title":"StROL: Stabilized and Robust Online Learning from Humans","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Today's robots can learn the human's reward function online, during the\ncurrent interaction. This real-time learning requires fast but approximate\nlearning rules; when the human's behavior is noisy or suboptimal, today's\napproximations can result in unstable robot learning. Accordingly, in this\npaper we seek to enhance the robustness and convergence properties of gradient\ndescent learning rules when inferring the human's reward parameters. We model\nthe robot's learning algorithm as a dynamical system over the human preference\nparameters, where the human's true (but unknown) preferences are the\nequilibrium point. This enables us to perform Lyapunov stability analysis to\nderive the conditions under which the robot's learning dynamics converge. Our\nproposed algorithm (StROL) takes advantage of these stability conditions\noffline to modify the original learning dynamics: we introduce a corrective\nterm that expands the basins of attraction around likely human rewards. In\npractice, our modified learning rule can correctly infer what the human is\ntrying to convey, even when the human is noisy, biased, and suboptimal. Across\nsimulations and a user study we find that StROL results in a more accurate\nestimate and less regret than state-of-the-art approaches for online reward\nlearning. See videos here: https://youtu.be/uDGpkvJnY8g\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:43:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mehta","Shaunak A.",""],["Meng","Forrest",""],["Bajcsy","Andrea",""],["Losey","Dylan P.",""]]}
{"id":"2308.09864","submitter":"Shuhao Li","authors":"Shuhao Li, Hu Wang, Jichao Yin, Xinchao Jiang and Yaya Zhang","title":"A novel reduced basis method for adjoint sensitivity analysis of dynamic\n  topology optimization","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 gradient-based time domain topology optimization, design sensitivity\nanalysis (DSA) of the dynamic response is essential, and requires high\ncomputational cost to directly differentiate, especially for high-order dynamic\nsystem. To address this issue, this study develops an efficient reduced basis\nmethod (RBM)-based discrete adjoint sensitivity analysis method, which on the\none hand significantly improves the efficiency of sensitivity analysis and on\nthe other hand avoids the consistency errors caused by the continuum method. In\nthis algorithm, the basis functions of the adjoint problem are constructed in\nthe offline phase based on the greedy-POD method, and a novel model-based\nestimation is developed to facilitate the acceleration of this process. Based\non these basis functions, a fast and reasonably accurate model is then built by\nGalerkin projection for sensitivity analysis in each dynamic topology\noptimization iteration. Finally, the effectiveness of the error measures, the\nefficiency and the accuracy of the presented reduced-order method are verified\nby 2D and 3D dynamic structure studies.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:48:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Shuhao",""],["Wang","Hu",""],["Yin","Jichao",""],["Jiang","Xinchao",""],["Zhang","Yaya",""]]}
{"id":"2308.09865","submitter":"Ishit Mehta","authors":"Ishit Mehta, Manmohan Chandraker, Ravi Ramamoorthi","title":"A Theory of Topological Derivatives for Inverse Rendering of Geometry","comments":"ICCV 23; Project Page at https://ishit.github.io/td/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a theoretical framework for differentiable surface evolution\nthat allows discrete topology changes through the use of topological\nderivatives for variational optimization of image functionals. While prior\nmethods for inverse rendering of geometry rely on silhouette gradients for\ntopology changes, such signals are sparse. In contrast, our theory derives\ntopological derivatives that relate the introduction of vanishing holes and\nphases to changes in image intensity. As a result, we enable differentiable\nshape perturbations in the form of hole or phase nucleation. We validate the\nproposed theory with optimization of closed curves in 2D and surfaces in 3D to\nlend insights into limitations of current methods and enable improved\napplications such as image vectorization, vector-graphics generation from text\nprompts, single-image reconstruction of shape ambigrams and multi-view 3D\nreconstruction.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:55:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mehta","Ishit",""],["Chandraker","Manmohan",""],["Ramamoorthi","Ravi",""]]}
{"id":"2308.09866","submitter":"Junyan Su","authors":"Junyan Su, Qiulin Lin, Minghua Chen, Haibo Zeng","title":"Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness\n  and Approximation Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Carbon footprint optimization (CFO) is important for sustainable heavy-duty\ne-truck transportation. We consider the CFO problem for timely transportation\nof e-trucks, where the truck travels from an origin to a destination across a\nnational highway network subject to a deadline. The goal is to minimize the\ncarbon footprint by orchestrating path planning, speed planning, and\nintermediary charging planning. We first show that it is NP-hard even just to\nfind a feasible CFO solution. We then develop a $(1+\\epsilon_F,\n1+\\epsilon_\\beta)$ bi-criteria approximation algorithm that achieves a carbon\nfootprint within a ratio of $(1+\\epsilon_F)$ to the minimum with no deadline\nviolation and at most a ratio of $(1+\\epsilon_\\beta)$ battery capacity\nviolation (for any positive $\\epsilon_F$ and $\\epsilon_\\beta$). Its time\ncomplexity is polynomial in the size of the highway network, $1/\\epsilon_F$,\nand $1/\\epsilon_\\beta$. Such algorithmic results are among the best possible\nunless P=NP. Simulation results based on real-world traces show that our scheme\nreduces up to 11\\% carbon footprint as compared to baseline alternatives\nconsidering only energy consumption but not carbon footprint.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 00:59:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Su","Junyan",""],["Lin","Qiulin",""],["Chen","Minghua",""],["Zeng","Haibo",""]]}
{"id":"2308.09867","submitter":"Shifeng Huang","authors":"Shifeng Huang, Ning Jiang, Zheyu Lin, Jiazheng Zhu and Tinggui Wang","title":"AT2018dyk Revisited: a Tidal Disruption Event Candidate with Prominent\n  Infrared Echo and Delayed X-ray Emission in a LINER Galaxy","comments":"9 pages, 6figures, 1 table. Accepted for publication in MNRAS","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":"  The multiwavelength data of nuclear transient AT2018dyk, initially discovered\nas a changing-look low-ionization nuclear emission-line region (LINER) galaxy,\nhas been revisited by us and found being in agreement with a tidal disruption\nevent (TDE) scenario. The optical light curve of AT2018dyk declines as a\npower-law form approximately with index -5/3 yet its X-ray emission lags behind\nthe optical peak by $\\sim140$ days, both of which are typical characteristics\nfor TDEs. The X-ray spectra are softer than normal active galactic nuclei\n(AGNs) although they show a slight trend of hardening. Interestingly, its\nrising time scale belongs to the longest among TDEs while it is nicely\nconsistent with the theoretical prediction from its relatively large\nsupermassive black hole (SMBH) mass ($\\sim10^{7.38} M_{\\odot}$). Moreover, a\nprominent infrared echo with peak luminosity\n$\\sim7.4\\times10^{42}~\\text{erg}~\\text{s}^{-1}$ has been also detected in\nAT2018dyk, implying an unusually dusty subparsec nuclear environment in\ncontrast with other TDEs. In our sample, LINERs share similar covering factors\nwith AGNs, which indicates the existence of the dusty torus in these objects.\nOur work suggests that the nature of nuclear transients in LINERs needs to be\ncarefully identified and their infrared echoes offer us a unique opportunity\nfor exploring the environment of SMBHs at low accretion rate, which has been so\nfar poorly explored but is crucial for understanding the SMBH activity.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:00:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Shifeng",""],["Jiang","Ning",""],["Lin","Zheyu",""],["Zhu","Jiazheng",""],["Wang","Tinggui",""]]}
{"id":"2308.09868","submitter":"Xiao Liu","authors":"Xiao Liu, Shuhei Ikemoto, Yuhei Yoshimitsu, and Heni Ben Amor","title":"Learning Soft Robot Dynamics using Differentiable Kalman Filters and\n  Spatio-Temporal Embeddings","comments":"8 pages, 9 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces a novel approach for modeling the dynamics of soft\nrobots, utilizing a differentiable filter architecture. The proposed approach\nenables end-to-end training to learn system dynamics, noise characteristics,\nand temporal behavior of the robot. A novel spatio-temporal embedding process\nis discussed to handle observations with varying sensor placements and sampling\nfrequencies. The efficacy of this approach is demonstrated on a tensegrity\nrobot arm by learning end-effector dynamics from demonstrations with complex\nbending motions. The model is proven to be robust against missing modalities,\ndiverse sensor placement, and varying sampling rates. Additionally, the\nproposed framework is shown to identify physical interactions with humans\nduring motion. The utilization of a differentiable filter presents a novel\nsolution to the difficulties of modeling soft robot dynamics. Our approach\nshows substantial improvement in accuracy compared to state-of-the-art\nfiltering methods, with at least a 24% reduction in mean absolute error (MAE)\nobserved. Furthermore, the predicted end-effector positions show an average MAE\nof 25.77mm from the ground truth, highlighting the advantage of our approach.\nThe code is available at https://github.com/ir-lab/soft_robot_DEnKF.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:05:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Xiao",""],["Ikemoto","Shuhei",""],["Yoshimitsu","Yuhei",""],["Amor","Heni Ben",""]]}
{"id":"2308.09869","submitter":"Felix Gnettner","authors":"Felix Gnettner, Claudia Kirch, Alicia Nieto-Reyes","title":"Variations of the depth based Liu-Singh two-sample test including\n  functional spaces","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":"  Statistical depth functions provide measures of the outlyingness, or\ncentrality, of the elements of a space with respect to a distribution. It is a\nnonparametric concept applicable to spaces of any dimension, for instance,\nmultivariate and functional. Liu and Singh (1993) presented a multivariate\ntwo-sample test based on depth-ranks. We dedicate this paper to improving the\npower of the associated test statistic and incorporating its applicability to\nfunctional data. In doing so, we obtain a more natural test statistic that is\nsymmetric in both samples. We derive the null asymptotic of the proposed test\nstatistic, also proving the validity of the testing procedure for functional\ndata. Finally, the finite sample performance of the test for functional data is\nillustrated by means of a simulation study and a real data analysis on annual\ntemperature curves of ocean drifters is executed.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:11:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gnettner","Felix",""],["Kirch","Claudia",""],["Nieto-Reyes","Alicia",""]]}
{"id":"2308.09870","submitter":"Xiao Liu","authors":"Xiao Liu, Geoffrey Clark, Joseph Campbell, Yifan Zhou, and Heni Ben\n  Amor","title":"Enhancing State Estimation in Robots: A Data-Driven Approach with\n  Differentiable Ensemble Kalman Filters","comments":"8 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":"  This paper introduces a novel state estimation framework for robots using\ndifferentiable ensemble Kalman filters (DEnKF). DEnKF is a reformulation of the\ntraditional ensemble Kalman filter that employs stochastic neural networks to\nmodel the process noise implicitly. Our work is an extension of previous\nresearch on differentiable filters, which has provided a strong foundation for\nour modular and end-to-end differentiable framework. This framework enables\neach component of the system to function independently, leading to improved\nflexibility and versatility in implementation. Through a series of experiments,\nwe demonstrate the flexibility of this model across a diverse set of real-world\ntracking tasks, including visual odometry and robot manipulation. Moreover, we\nshow that our model effectively handles noisy observations, is robust in the\nabsence of observations, and outperforms state-of-the-art differentiable\nfilters in terms of error metrics. Specifically, we observe a significant\nimprovement of at least 59% in translational error when using DEnKF with noisy\nobservations. Our results underscore the potential of DEnKF in advancing state\nestimation for robotics. Code for DEnKF is available at\nhttps://github.com/ir-lab/DEnKF\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:12:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Xiao",""],["Clark","Geoffrey",""],["Campbell","Joseph",""],["Zhou","Yifan",""],["Amor","Heni Ben",""]]}
{"id":"2308.09871","submitter":"Shubham Sonawani","authors":"Shubham Sonawani, Yifan Zhou and Heni Ben Amor","title":"Projecting Robot Intentions Through Visual Cues: Static vs. Dynamic\n  Signaling","comments":"8 pages, 5 figures, Conference: IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Augmented and mixed-reality techniques harbor a great potential for improving\nhuman-robot collaboration. Visual signals and cues may be projected to a human\npartner in order to explicitly communicate robot intentions and goals. However,\nit is unclear what type of signals support such a process and whether signals\ncan be combined without adding additional cognitive stress to the partner. This\npaper focuses on identifying the effective types of visual signals and quantify\ntheir impact through empirical evaluations. In particular, the study compares\nstatic and dynamic visual signals within a collaborative object sorting task\nand assesses their ability to shape human behavior. Furthermore, an\ninformation-theoretic analysis is performed to numerically quantify the degree\nof information transfer between visual signals and human behavior. The results\nof a human subject experiment show that there are significant advantages to\ncombining multiple visual signals within a single task, i.e., increased task\nefficiency and reduced cognitive load.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:18:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sonawani","Shubham",""],["Zhou","Yifan",""],["Amor","Heni Ben",""]]}
{"id":"2308.09872","submitter":"Hashim A. Hashim","authors":"Mohammed I. Abouheaf, Kyriakos G. Vamvoudakis, Mohammad A. Mayyas, and\n  Hashim A. Hashim","title":"An Observer-Based Reinforcement Learning Solution for Model-Following\n  Problems","comments":"62nd IEEE Conference on Decision and Control (CDC)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, a multi-objective model-following control problem is solved\nusing an observer-based adaptive learning scheme. The overall goal is to\nregulate the model-following error dynamics along with optimizing the dynamic\nvariables of a process in a model-free fashion. This solution employs an\nintegral reinforcement learning approach to adapt three strategies. The first\nstrategy observes the states of desired process dynamics, while the second one\nstabilizes and optimizes the closed-loop system. The third strategy allows the\nprocess to follow a desired reference-trajectory. The adaptive learning scheme\nis implemented using an approximate projection estimation approach under mild\nconditions about the learning parameters.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:33:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Abouheaf","Mohammed I.",""],["Vamvoudakis","Kyriakos G.",""],["Mayyas","Mohammad A.",""],["Hashim","Hashim A.",""]]}
{"id":"2308.09873","submitter":"Andrew Szot","authors":"Xiaoyu Huang, Dhruv Batra, Akshara Rai, Andrew Szot","title":"Skill Transformer: A Monolithic Policy for Mobile Manipulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Skill Transformer, an approach for solving long-horizon robotic\ntasks by combining conditional sequence modeling and skill modularity.\nConditioned on egocentric and proprioceptive observations of a robot, Skill\nTransformer is trained end-to-end to predict both a high-level skill (e.g.,\nnavigation, picking, placing), and a whole-body low-level action (e.g., base\nand arm motion), using a transformer architecture and demonstration\ntrajectories that solve the full task. It retains the composability and\nmodularity of the overall task through a skill predictor module while reasoning\nabout low-level actions and avoiding hand-off errors, common in modular\napproaches. We test Skill Transformer on an embodied rearrangement benchmark\nand find it performs robust task planning and low-level control in new\nscenarios, achieving a 2.5x higher success rate than baselines in hard\nrearrangement problems.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:37:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Xiaoyu",""],["Batra","Dhruv",""],["Rai","Akshara",""],["Szot","Andrew",""]]}
{"id":"2308.09874","submitter":"Hsien-Chung Kao","authors":"Iao-Fai Io, Cheng-Yuan Huang, Jhih-Shih You, Hao-Chun Chang, and\n  Hsien-chung Kao","title":"Quasi-Hermitian extended SSH models","comments":"21 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.other","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the quasi Hermitian limit of a non-Hermitian extended Su\nSchrieffer Heeger model, in which the hopping amplitudes obey a specific\nrelation so that the system may be mapped to a corresponding Hermitian one and\nits energy spectrum is completely real. Analogous to the Hermitian case, one\nmay use the modified winding number to determine the total number of edge\nstates on the boundaries to achieve a modified bulk-boundary correspondence.\nDue to the skin effect in nonHermitian systems, the spectral winding numbers\nmust be used to classify such systems further. It dictates how the edge states\nwould be distributed over the left and right boundaries. We then naively extend\nthe criteria to the cases that the quasi Hermitian condition is violated. For\nall the cases that we consider, no inconsistency has been found.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:38:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Io","Iao-Fai",""],["Huang","Cheng-Yuan",""],["You","Jhih-Shih",""],["Chang","Hao-Chun",""],["Kao","Hsien-chung",""]]}
{"id":"2308.09875","submitter":"Felipe Asenjo","authors":"Felipe A. Asenjo","title":"Electromagnetic plasma waves in dark energy cosmology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the electromagnetic wave modes that can exactly exist in a\ncosmological plasma dominated by dark energy due to a cosmological constant. It\nis found that, in the cold and hot plasma cases, electromagnetic plasma waves\ncan be found in an exact manner. The effect of this cosmology appears as a\ntime-dependent potential in the wave equation for the modes that effectivelly\nmodifies the frequency response of the plasma. This potential depends on the\nmetric of the spacetime and on the thermodynamical properties of the plasma.\nFor both cases, cold and hot, the solutions are found in terms of Airy and\nBessel functions, respectively, which satisfy some physical initial conditions.\nThese solutions impose discretization conditions on the wavelengths of the\nelectromagnetic plasma waves. Thus, only some specific wave modes can exist\nexactly on this dark energy cosmology. Relaxing those conditions, we obtain\nother solutions that approximate to plane waves only in the very hot plasma\nlimit.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:42:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Asenjo","Felipe A.",""]]}
{"id":"2308.09876","submitter":"Jinghui Cheng","authors":"Arghavan Sanei, Jinghui Cheng","title":"Characterizing Usability Issue Discussions in OSS Projects","comments":"26 pages, 2 figures, submitted to CSCW2024 Supplementary material\n  available at: https://github.com/HCDLab/UsabilityIssuesSupplementaryMaterial","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Usability is a crucial factor but one of the most neglected concerns in open\nsource software (OSS). While far from an ideal approach, a common practice that\nOSS communities adopt to collaboratively address usability is through\ndiscussions on issue tracking systems (ITSs). However, there is little\nknowledge about the extent to which OSS community members engage in usability\nissue discussions, the aspects of usability they frequently target, and the\ncharacteristics of their collaboration around usability issue discussions. This\nknowledge is important for providing practical recommendations and research\ndirections to better support OSS communities in addressing this important topic\nand improve OSS usability in general. To help achieve this goal, we performed\nan extensive empirical study on issues discussed in five popular OSS\napplications: three data science notebook projects (Jupyter Lab, Google Colab,\nand CoCalc) and two code editor projects (VSCode and Atom). Our results\nindicated that while usability issues are extensively discussed in the OSS\nprojects, their scope tended to be limited to efficiency and aesthetics.\nAdditionally, these issues are more frequently posted by experienced community\nmembers and display distinguishable characteristics, such as involving more\nvisual communication and more participants. Our results provide important\nimplications that can inform the OSS practitioners to better engage the\ncommunity in usability issue discussion and shed light on future research\nefforts toward collaboration techniques and tools for discussing niche topics\nin diverse communities, such as the usability issues in the OSS context.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:47:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sanei","Arghavan",""],["Cheng","Jinghui",""]]}
{"id":"2308.09877","submitter":"Hanjie Yu","authors":"Hanjie Yu, Yan Dong, Qiong Wu","title":"User-centric AIGC products: Explainable Artificial Intelligence and AIGC\n  products","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative AI tools, such as ChatGPT and Midjourney, are transforming\nartistic creation as AI-art integration advances. However, Artificial\nIntelligence Generated Content (AIGC) tools face user experience challenges,\nnecessitating a human-centric design approach. This paper offers a brief\noverview of research on explainable AI (XAI) and user experience, examining\nfactors leading to suboptimal experiences with AIGC tools. Our proposed\nsolution integrates interpretable AI methodologies into the input and\nadjustment feedback stages of AIGC products. We underscore XAI's potential to\nenhance the user experience for ordinary users and present a conceptual\nframework for improving AIGC user experience.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 01:53:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Hanjie",""],["Dong","Yan",""],["Wu","Qiong",""]]}
{"id":"2308.09878","submitter":"Shubham Shrivastava","authors":"Shubham Shrivastava, Xianling Zhang, Sushruth Nagesh, Armin Parchami","title":"DatasetEquity: Are All Samples Created Equal? In The Quest For Equity\n  Within Datasets","comments":"ICCV 2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data imbalance is a well-known issue in the field of machine learning,\nattributable to the cost of data collection, the difficulty of labeling, and\nthe geographical distribution of the data. In computer vision, bias in data\ndistribution caused by image appearance remains highly unexplored. Compared to\ncategorical distributions using class labels, image appearance reveals complex\nrelationships between objects beyond what class labels provide. Clustering deep\nperceptual features extracted from raw pixels gives a richer representation of\nthe data. This paper presents a novel method for addressing data imbalance in\nmachine learning. The method computes sample likelihoods based on image\nappearance using deep perceptual embeddings and clustering. It then uses these\nlikelihoods to weigh samples differently during training with a proposed\n$\\textbf{Generalized Focal Loss}$ function. This loss can be easily integrated\nwith deep learning algorithms. Experiments validate the method's effectiveness\nacross autonomous driving vision datasets including KITTI and nuScenes. The\nloss function improves state-of-the-art 3D object detection methods, achieving\nover $200\\%$ AP gains on under-represented classes (Cyclist) in the KITTI\ndataset. The results demonstrate the method is generalizable, complements\nexisting techniques, and is particularly beneficial for smaller datasets and\nrare classes. Code is available at:\nhttps://github.com/towardsautonomy/DatasetEquity\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:11:49 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:32:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shrivastava","Shubham",""],["Zhang","Xianling",""],["Nagesh","Sushruth",""],["Parchami","Armin",""]]}
{"id":"2308.09879","submitter":"Lidan Wang","authors":"Lidan Wang","title":"Solutions to discrete fractional Sch\\\"{o}dinger equations","comments":"20 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 study the discrete fractional Schr\\\"{o}dinger equation $$\n(-\\Delta)^\\alpha u+h(x) u=f(x,u),\\quad x\\in \\mathbb{Z}^d,$$\n  where $d\\in\\mathbb{N}^*,\\,\\alpha \\in(0, 1)$ and the nonlocal operator\n$(-\\Delta)^\\alpha $ is defined by discrete Fourier transform, which differs\nfrom the continuous case. Under suitable assumptions on $h$ and $f$, we prove\nthe existence and multiplicity of solutions to this equation by variational\nmethod.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:12:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Lidan",""]]}
{"id":"2308.09880","submitter":"Zhiyi Huang","authors":"Zhiyi Huang and Zahra Parsaeian and Zixuan Zhu","title":"Laminar Matroid Secretary: Greedy Strikes Back","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":"  We show that a simple greedy algorithm is $4.75$ probability-competitive for\nthe Laminar Matroid Secretary Problem, improving the $3\\sqrt{3} \\approx\n5.17$-competitive algorithm based on the forbidden sets technique (Soto,\nTurkieltaub, and Verdugo, 2018).\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:15:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Zhiyi",""],["Parsaeian","Zahra",""],["Zhu","Zixuan",""]]}
{"id":"2308.09881","submitter":"Hui Sun","authors":"Hui Sun, Tianqing Zhu, Wenhan Chang, and Wanlei Zhou","title":"Generative Adversarial Networks Unlearning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As machine learning continues to develop, and data misuse scandals become\nmore prevalent, individuals are becoming increasingly concerned about their\npersonal information and are advocating for the right to remove their data.\nMachine unlearning has emerged as a solution to erase training data from\ntrained machine learning models. Despite its success in classifiers, research\non Generative Adversarial Networks (GANs) is limited due to their unique\narchitecture, including a generator and a discriminator. One challenge pertains\nto generator unlearning, as the process could potentially disrupt the\ncontinuity and completeness of the latent space. This disruption might\nconsequently diminish the model's effectiveness after unlearning. Another\nchallenge is how to define a criterion that the discriminator should perform\nfor the unlearning images. In this paper, we introduce a substitution mechanism\nand define a fake label to effectively mitigate these challenges. Based on the\nsubstitution mechanism and fake label, we propose a cascaded unlearning\napproach for both item and class unlearning within GAN models, in which the\nunlearning and learning processes run in a cascaded manner. We conducted a\ncomprehensive evaluation of the cascaded unlearning technique using the MNIST\nand CIFAR-10 datasets. Experimental results demonstrate that this approach\nachieves significantly improved item and class unlearning efficiency, reducing\nthe required time by up to 185x and 284x for the MNIST and CIFAR-10 datasets,\nrespectively, in comparison to retraining from scratch. Notably, although the\nmodel's performance experiences minor degradation after unlearning, this\nreduction is negligible when dealing with a minimal number of images (e.g., 64)\nand has no adverse effects on downstream tasks such as classification.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:21:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Hui",""],["Zhu","Tianqing",""],["Chang","Wenhan",""],["Zhou","Wanlei",""]]}
{"id":"2308.09882","submitter":"Jie Cheng","authors":"Jie Cheng, Xiaodong Mei and Ming Liu","title":"Forecast-MAE: Self-supervised Pre-training for Motion Forecasting with\n  Masked Autoencoders","comments":"ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study explores the application of self-supervised learning (SSL) to the\ntask of motion forecasting, an area that has not yet been extensively\ninvestigated despite the widespread success of SSL in computer vision and\nnatural language processing. To address this gap, we introduce Forecast-MAE, an\nextension of the mask autoencoders framework that is specifically designed for\nself-supervised learning of the motion forecasting task. Our approach includes\na novel masking strategy that leverages the strong interconnections between\nagents' trajectories and road networks, involving complementary masking of\nagents' future or history trajectories and random masking of lane segments. Our\nexperiments on the challenging Argoverse 2 motion forecasting benchmark show\nthat Forecast-MAE, which utilizes standard Transformer blocks with minimal\ninductive bias, achieves competitive performance compared to state-of-the-art\nmethods that rely on supervised learning and sophisticated designs. Moreover,\nit outperforms the previous self-supervised learning method by a significant\nmargin. Code is available at https://github.com/jchengai/forecast-mae.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:27:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cheng","Jie",""],["Mei","Xiaodong",""],["Liu","Ming",""]]}
{"id":"2308.09883","submitter":"Yiping Ma","authors":"Yiping Ma, Jess Woods, Sebastian Angel, Antigoni Polychroniadou, Tal\n  Rabin","title":"Flamingo: Multi-Round Single-Server Secure Aggregation with Applications\n  to Private Federated Learning","comments":null,"journal-ref":null,"doi":"10.1109/SP46215.2023.10179434","report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces Flamingo, a system for secure aggregation of data\nacross a large set of clients. In secure aggregation, a server sums up the\nprivate inputs of clients and obtains the result without learning anything\nabout the individual inputs beyond what is implied by the final sum. Flamingo\nfocuses on the multi-round setting found in federated learning in which many\nconsecutive summations (averages) of model weights are performed to derive a\ngood model. Previous protocols, such as Bell et al. (CCS '20), have been\ndesigned for a single round and are adapted to the federated learning setting\nby repeating the protocol multiple times. Flamingo eliminates the need for the\nper-round setup of previous protocols, and has a new lightweight dropout\nresilience protocol to ensure that if clients leave in the middle of a sum the\nserver can still obtain a meaningful result. Furthermore, Flamingo introduces a\nnew way to locally choose the so-called client neighborhood introduced by Bell\net al. These techniques help Flamingo reduce the number of interactions between\nclients and the server, resulting in a significant reduction in the end-to-end\nruntime for a full training session over prior work. We implement and evaluate\nFlamingo and show that it can securely train a neural network on the (Extended)\nMNIST and CIFAR-100 datasets, and the model converges without a loss in\naccuracy, compared to a non-private federated learning system.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:28:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Yiping",""],["Woods","Jess",""],["Angel","Sebastian",""],["Polychroniadou","Antigoni",""],["Rabin","Tal",""]]}
{"id":"2308.09884","submitter":"Oluwaseyi Ogunfowora","authors":"Oluwaseyi Ogunfowora, Homayoun Najjaran","title":"A Transformer-based Framework For Multi-variate Time Series: A Remaining\n  Useful Life Prediction Use Case","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In recent times, Large Language Models (LLMs) have captured a global\nspotlight and revolutionized the field of Natural Language Processing. One of\nthe factors attributed to the effectiveness of LLMs is the model architecture\nused for training, transformers. Transformer models excel at capturing\ncontextual features in sequential data since time series data are sequential,\ntransformer models can be leveraged for more efficient time series data\nprediction. The field of prognostics is vital to system health management and\nproper maintenance planning. A reliable estimation of the remaining useful life\n(RUL) of machines holds the potential for substantial cost savings. This\nincludes avoiding abrupt machine failures, maximizing equipment usage, and\nserving as a decision support system (DSS). This work proposed an\nencoder-transformer architecture-based framework for multivariate time series\nprediction for a prognostics use case. We validated the effectiveness of the\nproposed framework on all four sets of the C-MAPPS benchmark dataset for the\nremaining useful life prediction task. To effectively transfer the knowledge\nand application of transformers from the natural language domain to time\nseries, three model-specific experiments were conducted. Also, to enable the\nmodel awareness of the initial stages of the machine life and its degradation\npath, a novel expanding window method was proposed for the first time in this\nwork, it was compared with the sliding window method, and it led to a large\nimprovement in the performance of the encoder transformer model. Finally, the\nperformance of the proposed encoder-transformer model was evaluated on the test\ndataset and compared with the results from 13 other state-of-the-art (SOTA)\nmodels in the literature and it outperformed them all with an average\nperformance increase of 137.65% over the next best model across all the\ndatasets.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:30:35 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 21:23:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ogunfowora","Oluwaseyi",""],["Najjaran","Homayoun",""]]}
{"id":"2308.09885","submitter":"Houshan Fu","authors":"Hang Cai, Houshan Fu, Suijie Wang","title":"One-element Extensions of Hyperplane Arrangements","comments":"19 pages,6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We classify one-element extensions of a hyperplane arrangement by the induced\nadjoint arrangement. Based on the classification, several kinds of\ncombinatorial invariants including Whitney polynomials, characteristic\npolynomials, Whitney numbers and face numbers, are constants on those strata\nassociated with the induced adjoint arrangement, and also order-preserving with\nrespect to the intersection lattice of the induced adjoint arrangement. As a\nbyproduct, we obtain a convolution formula on the characteristic polynomials\n$\\chi(\\mathcal{A}+H_{\\bm\\alpha,a},t)$ when $\\mathcal{A}$ is defined over a\nfinite field $\\mathbb{F}_q$ or a rational arrangement.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:33:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cai","Hang",""],["Fu","Houshan",""],["Wang","Suijie",""]]}
{"id":"2308.09886","submitter":"Amani Abusafia","authors":"Amani Abusafia, Abdallah Lakhdari, Athman Bouguettaya","title":"Flow-Based Energy Services Composition","comments":"14 pages, 19 Figures, This is an accepted paper in the IEEE\n  Transactions on Services Computing (IEEE TSC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel spatio-temporal service composition framework for\ncrowdsourcing multiple IoT energy services to cater to multiple energy\nrequests. We define a new energy service model to leverage the wearable-based\nenergy and wireless power transfer technologies. We reformulate the problem of\nspatio-temporal service composition to provision multiple energy requests as a\nmatching problem. We leverage the fragmented nature of energy to offer partial\nservices to maximize the utilization of energy services. We propose\nEnergyFlowComp, a modified Maximum Flow matching algorithm that efficiently\nprovisions IoT energy services to accommodate multiple energy requests.\nMoreover, we propose PartialFlowComp, an extension of the EnergyFlowComp\napproach that considers the partial-temporal overlap between services and\nrequests in provisioning. We conduct an extensive set of experiments to assess\nthe effectiveness and efficiency of the proposed framework.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:40:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Abusafia","Amani",""],["Lakhdari","Abdallah",""],["Bouguettaya","Athman",""]]}
{"id":"2308.09887","submitter":"Chen Li","authors":"Chen Li, Xiaoling Hu, Shahira Abousamra, Chao Chen","title":"Calibrating Uncertainty for Semi-Supervised Crowd Counting","comments":"Accepted by ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Semi-supervised crowd counting is an important yet challenging task. A\npopular approach is to iteratively generate pseudo-labels for unlabeled data\nand add them to the training set. The key is to use uncertainty to select\nreliable pseudo-labels. In this paper, we propose a novel method to calibrate\nmodel uncertainty for crowd counting. Our method takes a supervised uncertainty\nestimation strategy to train the model through a surrogate function. This\nensures the uncertainty is well controlled throughout the training. We propose\na matching-based patch-wise surrogate function to better approximate\nuncertainty for crowd counting tasks. The proposed method pays a sufficient\namount of attention to details, while maintaining a proper granularity.\nAltogether our method is able to generate reliable uncertainty estimation, high\nquality pseudolabels, and achieve state-of-the-art performance in\nsemisupervised crowd counting.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:44:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Chen",""],["Hu","Xiaoling",""],["Abousamra","Shahira",""],["Chen","Chao",""]]}
{"id":"2308.09888","submitter":"Ziqiao Ao","authors":"Ziqiao Ao, Jinglai Li","title":"On Estimating the Gradient of the Expected Information Gain in Bayesian\n  Experimental Design","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":"  Bayesian Experimental Design (BED), which aims to find the optimal\nexperimental conditions for Bayesian inference, is usually posed as to optimize\nthe expected information gain (EIG). The gradient information is often needed\nfor efficient EIG optimization, and as a result the ability to estimate the\ngradient of EIG is essential for BED problems. The primary goal of this work is\nto develop methods for estimating the gradient of EIG, which, combined with the\nstochastic gradient descent algorithms, result in efficient optimization of\nEIG. Specifically, we first introduce a posterior expected representation of\nthe EIG gradient with respect to the design variables. Based on this, we\npropose two methods for estimating the EIG gradient, UEEG-MCMC that leverages\nposterior samples generated through Markov Chain Monte Carlo (MCMC) to estimate\nthe EIG gradient, and BEEG-AP that focuses on achieving high simulation\nefficiency by repeatedly using parameter samples. Theoretical analysis and\nnumerical studies illustrate that UEEG-MCMC is robust agains the actual EIG\nvalue, while BEEG-AP is more efficient when the EIG value to be optimized is\nsmall. Moreover, both methods show superior performance compared to several\npopular benchmarks in our numerical experiments.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:48:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ao","Ziqiao",""],["Li","Jinglai",""]]}
{"id":"2308.09889","submitter":"Xiaoyu Ye","authors":"Xiaoyu Ye, Hao Huang, Jiaqi An, Yongtao Wang","title":"DUAW: Data-free Universal Adversarial Watermark against Stable Diffusion\n  Customization","comments":"12 pages, 11 figures","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":"  Stable Diffusion (SD) customization approaches enable users to personalize SD\nmodel outputs, greatly enhancing the flexibility and diversity of AI art.\nHowever, they also allow individuals to plagiarize specific styles or subjects\nfrom copyrighted images, which raises significant concerns about potential\ncopyright infringement. To address this issue, we propose an invisible\ndata-free universal adversarial watermark (DUAW), aiming to protect a myriad of\ncopyrighted images from different customization approaches across various\nversions of SD models. First, DUAW is designed to disrupt the variational\nautoencoder during SD customization. Second, DUAW operates in a data-free\ncontext, where it is trained on synthetic images produced by a Large Language\nModel (LLM) and a pretrained SD model. This approach circumvents the necessity\nof directly handling copyrighted images, thereby preserving their\nconfidentiality. Once crafted, DUAW can be imperceptibly integrated into\nmassive copyrighted images, serving as a protective measure by inducing\nsignificant distortions in the images generated by customized SD models.\nExperimental results demonstrate that DUAW can effectively distort the outputs\nof fine-tuned SD models, rendering them discernible to both human observers and\na simple classifier.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:51:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ye","Xiaoyu",""],["Huang","Hao",""],["An","Jiaqi",""],["Wang","Yongtao",""]]}
{"id":"2308.09890","submitter":"Tsukasa Yumibayashi","authors":"Toma Tanaka, Naofumi Emoto, and Tsukasa Yumibayashi","title":"Inductive-bias Learning: Generating Code Models with Large Language\n  Model","comments":"17 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models(LLMs) have been attracting attention due to a ability\ncalled in-context learning(ICL). ICL, without updating the parameters of a LLM,\nit is possible to achieve highly accurate inference based on rules ``in the\ncontext'' by merely inputting a training data into the prompt. Although ICL is\na developing field with many unanswered questions, LLMs themselves serves as a\ninference model, seemingly realizing inference without explicitly indicate\n``inductive bias''. On the other hand, a code generation is also a highlighted\napplication of LLMs. The accuracy of code generation has dramatically improved,\nenabling even non-engineers to generate code to perform the desired tasks by\ncrafting appropriate prompts. In this paper, we propose a novel ``learning''\nmethod called an ``Inductive-Bias Learning (IBL)'', which combines the\ntechniques of ICL and code generation. An idea of IBL is straightforward. Like\nICL, IBL inputs a training data into the prompt and outputs a code with a\nnecessary structure for inference (we referred to as ``Code Model'') from a\n``contextual understanding''. Despite being a seemingly simple approach, IBL\nencompasses both a ``property of inference without explicit inductive bias''\ninherent in ICL and a ``readability and explainability'' of the code\ngeneration. Surprisingly, generated Code Models have been found to achieve\npredictive accuracy comparable to, and in some cases surpassing, ICL and\nrepresentative machine learning models. Our IBL code is open source:\nhttps://github.com/fuyu-quant/IBLM\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:01:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tanaka","Toma",""],["Emoto","Naofumi",""],["Yumibayashi","Tsukasa",""]]}
{"id":"2308.09891","submitter":"Song Tang","authors":"Song Tang, Chuang Li, Pu Zhang, RongNian Tang","title":"SwinLSTM:Improving Spatiotemporal Prediction Accuracy using Swin\n  Transformer and LSTM","comments":"This paper has been accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Integrating CNNs and RNNs to capture spatiotemporal dependencies is a\nprevalent strategy for spatiotemporal prediction tasks. However, the property\nof CNNs to learn local spatial information decreases their efficiency in\ncapturing spatiotemporal dependencies, thereby limiting their prediction\naccuracy. In this paper, we propose a new recurrent cell, SwinLSTM, which\nintegrates Swin Transformer blocks and the simplified LSTM, an extension that\nreplaces the convolutional structure in ConvLSTM with the self-attention\nmechanism. Furthermore, we construct a network with SwinLSTM cell as the core\nfor spatiotemporal prediction. Without using unique tricks, SwinLSTM\noutperforms state-of-the-art methods on Moving MNIST, Human3.6m, TaxiBJ, and\nKTH datasets. In particular, it exhibits a significant improvement in\nprediction accuracy compared to ConvLSTM. Our competitive experimental results\ndemonstrate that learning global spatial dependencies is more advantageous for\nmodels to capture spatiotemporal dependencies. We hope that SwinLSTM can serve\nas a solid baseline to promote the advancement of spatiotemporal prediction\naccuracy. The codes are publicly available at\nhttps://github.com/SongTang-x/SwinLSTM.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:08:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tang","Song",""],["Li","Chuang",""],["Zhang","Pu",""],["Tang","RongNian",""]]}
{"id":"2308.09892","submitter":"Benjamin Warner","authors":"Benjamin C. Warner, Ziqi Xu, Simon Haroutounian, Thomas Kannampallil,\n  Chenyang Lu","title":"Utilizing Semantic Textual Similarity for Clinical Survey Data Feature\n  Selection","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":"  Survey data can contain a high number of features while having a\ncomparatively low quantity of examples. Machine learning models that attempt to\npredict outcomes from survey data under these conditions can overfit and result\nin poor generalizability. One remedy to this issue is feature selection, which\nattempts to select an optimal subset of features to learn upon. A relatively\nunexplored source of information in the feature selection process is the usage\nof textual names of features, which may be semantically indicative of which\nfeatures are relevant to a target outcome. The relationships between feature\nnames and target names can be evaluated using language models (LMs) to produce\nsemantic textual similarity (STS) scores, which can then be used to select\nfeatures. We examine the performance using STS to select features directly and\nin the minimal-redundancy-maximal-relevance (mRMR) algorithm. The performance\nof STS as a feature selection metric is evaluated against preliminary survey\ndata collected as a part of a clinical study on persistent post-surgical pain\n(PPSP). The results suggest that features selected with STS can result in\nhigher performance models compared to traditional feature selection algorithms.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:10:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Warner","Benjamin C.",""],["Xu","Ziqi",""],["Haroutounian","Simon",""],["Kannampallil","Thomas",""],["Lu","Chenyang",""]]}
{"id":"2308.09893","submitter":"Ying Qin","authors":"F. Lyu, L. Yuan, D. H. Wu, W. H. Guo, Y. Z. Wang, S. X. Yi, Q. W.\n  Tang, R.-C. Hu, J.-P. Zhu, X. W. Shu, Y. Qin and E. W. Liang","title":"Revisiting the Properties of GW190814 and Its Formation History","comments":"8 pages, 8 figures, accepted by MNRAS after minor revisions","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  GW190814 was reported during LIGO's and Virgo's third observing run with the\nmost asymmetric component masses (a $\\sim 23$ $M_{\\odot}$ black hole and a\n$\\sim2.6$ $M_{\\odot}$ compact object). Under the assumption that this event is\na binary black hole (BBH) merger formed through the isolated binary evolution\nchannel, we reanalyze the publicly released data of GW190814 with the modified\nastrophysical priors on the effective spin $\\chi_{\\rm eff}$, and further\nexplore its formation history using detailed binary modeling. We show that\nGW190814 is likely to have been formed through the classical common envelope\nchannel. Our findings show that the properties inferred using the modified\nastrophysical priors are consistent with those inferred by the uniform priors.\nWith the newly-inferred properties of GW190814, we perform detailed binary\nevolution of the immediate progenitor of the BBH (namely a close binary system\ncomposed of a BH and a helium star) in a large parameter space, taking into\naccount mass-loss, internal differential rotation, supernova kicks, and tidal\ninteractions between the helium star and the BH companion. Our findings show\nthat GW190814-like events could be formed in limited initial conditions just\nafter the common envelope phase: a $\\sim 23$ $M_{\\odot}$ BH and a helium star\nof $M_{\\rm ZamsHe}$ $\\sim$ 8.5 $M_{\\odot}$ at solar metallicity ($\\sim$ 7.5\n$M_{\\odot}$ at 10\\% solar metallicity) with an initial orbital period at around\n1.0 day. Additionally, the inferred low spin of the secondary indicates that\nthe required metallicity for reproducing GW190814-like events should not be too\nlow (e.g., Z $\\gtrsim$ 0.1 $Z_{\\odot}$).\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:11:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lyu","F.",""],["Yuan","L.",""],["Wu","D. H.",""],["Guo","W. H.",""],["Wang","Y. Z.",""],["Yi","S. X.",""],["Tang","Q. W.",""],["Hu","R. -C.",""],["Zhu","J. -P.",""],["Shu","X. W.",""],["Qin","Y.",""],["Liang","E. W.",""]]}
{"id":"2308.09894","submitter":"Zhang Jie","authors":"Jie Zhang, Pengcheng Shi, Zaiwang Gu, Yiyang Zhou, Zhi Wang","title":"Semantic-Human: Neural Rendering of Humans from Monocular Video with\n  Human Parsing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The neural rendering of humans is a topic of great research significance.\nHowever, previous works mostly focus on achieving photorealistic details,\nneglecting the exploration of human parsing. Additionally, classical semantic\nwork are all limited in their ability to efficiently represent fine results in\ncomplex motions. Human parsing is inherently related to radiance\nreconstruction, as similar appearance and geometry often correspond to similar\nsemantic part. Furthermore, previous works often design a motion field that\nmaps from the observation space to the canonical space, while it tends to\nexhibit either underfitting or overfitting, resulting in limited\ngeneralization. In this paper, we present Semantic-Human, a novel method that\nachieves both photorealistic details and viewpoint-consistent human parsing for\nthe neural rendering of humans. Specifically, we extend neural radiance fields\n(NeRF) to jointly encode semantics, appearance and geometry to achieve accurate\n2D semantic labels using noisy pseudo-label supervision. Leveraging the\ninherent consistency and smoothness properties of NeRF, Semantic-Human achieves\nconsistent human parsing in both continuous and novel views. We also introduce\nconstraints derived from the SMPL surface for the motion field and\nregularization for the recovered volumetric geometry. We have evaluated the\nmodel using the ZJU-MoCap dataset, and the obtained highly competitive results\ndemonstrate the effectiveness of our proposed Semantic-Human. We also showcase\nvarious compelling applications, including label denoising, label synthesis and\nimage editing, and empirically validate its advantageous properties.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:18:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Jie",""],["Shi","Pengcheng",""],["Gu","Zaiwang",""],["Zhou","Yiyang",""],["Wang","Zhi",""]]}
{"id":"2308.09895","submitter":"Federico Cassano","authors":"Federico Cassano, John Gouwar, Francesca Lucchetti, Claire\n  Schlesinger, Carolyn Jane Anderson, Michael Greenberg, Abhinav Jangda, Arjun\n  Guha","title":"Knowledge Transfer from High-Resource to Low-Resource Programming\n  Languages for Code LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the past few years, Large Language Models of Code (Code LLMs) have\nstarted to have a significant impact on programming practice. Code LLMs are\nalso emerging as a building block for research in programming languages and\nsoftware engineering. However, the quality of code produced by a Code LLM\nvaries significantly by programming languages. Code LLMs produce impressive\nresults on programming languages that are well represented in their training\ndata (e.g., Java, Python, or JavaScript), but struggle with low-resource\nlanguages, like OCaml and Racket.\n  This paper presents an effective approach for boosting the performance of\nCode LLMs on low-resource languages using semi-synthetic data. Our approach\ngenerates high-quality datasets for low-resource languages, which can then be\nused to fine-tune any pretrained Code LLM. Our approach, called MultiPL-T,\ntranslates training data from high-resource languages into training data for\nlow-resource languages. We apply our approach to generate tens of thousands of\nnew, validated training items for Racket, OCaml, and Lua from Python. Moreover,\nwe use an open dataset (The Stack) and model (StarCoderBase), which allow us to\ndecontaminate benchmarks and train models on this data without violating the\nmodel license.\n  With MultiPL-T generated data, we present fine-tuned versions of\nStarCoderBase that achieve state-of-the-art performance for Racket, OCaml, and\nLua on benchmark problems. For Lua, our fine-tuned model achieves the same\nperformance as StarCoderBase as Python -- a very high-resource language -- on\nthe MultiPL-E benchmarks. For Racket and OCaml, we double their performance on\nMultiPL-E, bringing their performance close to higher-resource languages such\nas Ruby and C#.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:19:01 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 01:51:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cassano","Federico",""],["Gouwar","John",""],["Lucchetti","Francesca",""],["Schlesinger","Claire",""],["Anderson","Carolyn Jane",""],["Greenberg","Michael",""],["Jangda","Abhinav",""],["Guha","Arjun",""]]}
{"id":"2308.09896","submitter":"Yuxi Liu","authors":"Yuxi Liu, Zhenhao Zhang, Shaowen Qin, Flora D. Salim, Antonio Jimeno\n  Yepes","title":"Contrastive Learning-based Imputation-Prediction Networks for\n  In-hospital Mortality Risk Modeling using EHRs","comments":"15 pages, 2 figures, accepted at ECML PKDD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting the risk of in-hospital mortality from electronic health records\n(EHRs) has received considerable attention. Such predictions will provide early\nwarning of a patient's health condition to healthcare professionals so that\ntimely interventions can be taken. This prediction task is challenging since\nEHR data are intrinsically irregular, with not only many missing values but\nalso varying time intervals between medical records. Existing approaches focus\non exploiting the variable correlations in patient medical records to impute\nmissing values and establishing time-decay mechanisms to deal with such\nirregularity. This paper presents a novel contrastive learning-based\nimputation-prediction network for predicting in-hospital mortality risks using\nEHR data. Our approach introduces graph analysis-based patient stratification\nmodeling in the imputation process to group similar patients. This allows\ninformation of similar patients only to be used, in addition to personal\ncontextual information, for missing value imputation. Moreover, our approach\ncan integrate contrastive learning into the proposed network architecture to\nenhance patient representation learning and predictive performance on the\nclassification task. Experiments on two real-world EHR datasets show that our\napproach outperforms the state-of-the-art approaches in both imputation and\nprediction tasks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:24:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Yuxi",""],["Zhang","Zhenhao",""],["Qin","Shaowen",""],["Salim","Flora D.",""],["Yepes","Antonio Jimeno",""]]}
{"id":"2308.09897","submitter":"Jinhui Ye","authors":"Jinhui Ye and Junwei Liang","title":"Spatial-Temporal Alignment Network for Action Recognition","comments":"Introducing viewpoint invariant feature representations in Action\n  Recognition. arXiv admin note: text overlap with arXiv:2012.02426","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies introducing viewpoint invariant feature representations in\nexisting action recognition architecture. Despite significant progress in\naction recognition, efficiently handling geometric variations in large-scale\ndatasets remains challenging. To tackle this problem, we propose a novel\nSpatial-Temporal Alignment Network (STAN), which explicitly learns geometric\ninvariant representations for action recognition. Notably, the STAN model is\nlight-weighted and generic, which could be plugged into existing action\nrecognition models (e.g., MViTv2) with a low extra computational cost. We test\nour STAN model on widely-used datasets like UCF101 and HMDB51. The experimental\nresults show that the STAN model can consistently improve the state-of-the-art\nmodels in action recognition tasks in trained-from-scratch settings.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:31:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ye","Jinhui",""],["Liang","Junwei",""]]}
{"id":"2308.09898","submitter":"Tarak Patra","authors":"Agrim Babbar, Sriram Ragunathan, Debirupa Mitra, Arnab Dutta, and\n  Tarak. K Patra","title":"Explainability and Transferability of Machine Learning Models for\n  Predicting the Glass Transition Temperature of Polymers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning offers promising tools to develop surrogate models for\npolymer structure-property relations. Surrogate models can be built upon\nexisting polymer data and are useful for rapidly predicting the properties of\nunknown polymers. The accuracy of such ML models appears to depend on the\nfeature space representation of polymers, the range of training data, and\nlearning algorithms. Here, we establish connections between these factors for\npredicting the glass transition temperature of polymers. Our analysis suggests\nlinear models with a smaller number of fitting parameters are as accurate as\nnonlinear models with a large number of hidden and unexplainable parameters.\nAlso, the performance of a monomer topology-based ML model is found to be\nqualitatively identical to that of a physicochemical descriptor-based ML model.\nWe find that the transferability of ML models enhances as the property range of\nthe training data increases. Moreover, we establish new Tg polymer chemistry\ncorrelations via ML. Our work illustrates how ML can advance the fundamental\nunderstanding of polymer structure-property correlations.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:47:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Babbar","Agrim",""],["Ragunathan","Sriram",""],["Mitra","Debirupa",""],["Dutta","Arnab",""],["Patra","Tarak. K",""]]}
{"id":"2308.09899","submitter":"Junyang Zhang","authors":"Junyang Zhang","title":"Towards a High-Performance Object Detector: Insights from Drone\n  Detection Using ViT and CNN-based Deep Learning Models","comments":"7 pages, 23 figures, IEEE Xplore, 2023 International Conference on\n  Computer Vision and Robotics Science","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate drone detection is strongly desired in drone collision avoidance,\ndrone defense and autonomous Unmanned Aerial Vehicle (UAV) self-landing. With\nthe recent emergence of the Vision Transformer (ViT), this critical task is\nreassessed in this paper using a UAV dataset composed of 1359 drone photos. We\nconstruct various CNN and ViT-based models, demonstrating that for single-drone\ndetection, a basic ViT can achieve performance 4.6 times more robust than our\nbest CNN-based transfer learning models. By implementing the state-of-the-art\nYou Only Look Once (YOLO v7, 200 epochs) and the experimental ViT-based You\nOnly Look At One Sequence (YOLOS, 20 epochs) in multi-drone detection, we\nattain impressive 98% and 96% mAP values, respectively. We find that ViT\noutperforms CNN at the same epoch, but also requires more training data,\ncomputational power, and sophisticated, performance-oriented designs to fully\nsurpass the capabilities of cutting-edge CNN detectors. We summarize the\ndistinct characteristics of ViT and CNN models to aid future researchers in\ndeveloping more efficient deep learning models.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:57:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Junyang",""]]}
{"id":"2308.09900","submitter":"Swagata Acharya","authors":"Dimitar Pashov, Swagata Acharya, Stephan Lany, Daniel S. Dessau, and\n  Mark van Schilfgaarde","title":"Multiple Slater determinants and strong spin-fluctuations as key\n  ingredients of the electronic structure of electron- and hole-doped\n  Pb$_{10-x}$Cu$_x$(PO4)$_6$O","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LK-99, with chemical formula Pb$_{10-x}$Cu$_x$(PO4)$_6$O, was recently\nreported to be a room-temperature superconductor. While this claim has met with\nlittle support in a flurry of ensuing work, a variety of calculations (mostly\nbased on density-functional theory) have demonstrated that the system possesses\nsome unusual characteristics in the electronic structure, in particular flat\nbands. We have established previously that within DFT, the system is insulating\nwith many characteristics resembling the classic cuprates, provided the\nstructure is not constrained to the $P$3(143) symmetry nominally assigned to\nit. Here we describe the basic electronic structure of LK-99 within\nself-consistent many-body perturbative approach, quasiparticle self-consistent\nGW (QSGW) approximation and their diagrammatic extensions. QSGW predicts that\npristine LK-99 is indeed a Mott/charge transfer insulator, with a bandgap gap\nin excess of 3eV, whether or not constrained to the $P$3(143) symmetry. The\nhighest valence bands occur as a pair, and look similar to DFT bands. The\nlowest conduction band is an almost dispersionless state of largely Cu $d$\ncharacter. When Pb$_9$Cu(PO$_4$)$_6$O} is hole-doped, the valence bands modify\nonly slightly, and a hole pocket appears. However, two solutions emerge: a\nhigh-moment solution with the Cu local moment aligned parallel to neighbors,\nand a low-moment solution with Cu aligned antiparallel to its environment. In\nthe electron-doped case the conduction band structure changes significantly:\nstates of mostly Pb character merge with the formerly dispersionless Cu $d$\nstate, and high-spin and low spin solutions once again appear. Thus we conclude\nthat with suitable doping, the ground state of the system is not adequately\ndescribed by a band picture, and that strong correlations are likely.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 03:58:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pashov","Dimitar",""],["Acharya","Swagata",""],["Lany","Stephan",""],["Dessau","Daniel S.",""],["van Schilfgaarde","Mark",""]]}
{"id":"2308.09901","submitter":"Peng Guo","authors":"Vladimir Gasparian, Peng Guo, Antonio P\\'erez-Garrido, and Esther\n  J\\'odar","title":"Tunneling time and Faraday/Kerr effects in $\\mathcal{PT}$-symmetric\n  systems","comments":"Invited EPL perspective review. arXiv admin note: text overlap with\n  arXiv:2208.13543","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.other physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the generalization of tunneling time and anomalous behaviour of\nFaraday and Kerr rotation angles in parity and time\n($\\mathcal{P}\\mathcal{T}$)-symmetric systems. Similarities of two phenomena are\ndiscussed, both exhibit a phase transition-like anomalous behaviour in certain\nrange of model parameters. Anomalous behaviour of tunneling time and\nFaraday/Kerr angles in $\\mathcal{P}\\mathcal{T}$-symmetric systems is caused by\nthe motion of poles of scattering amplitudes in energy/frequency complex plane.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:25:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gasparian","Vladimir",""],["Guo","Peng",""],["P\u00e9rez-Garrido","Antonio",""],["J\u00f3dar","Esther",""]]}
{"id":"2308.09902","submitter":"Canzhe Zhao","authors":"Canzhe Zhao, Yanjie Ze, Jing Dong, Baoxiang Wang and Shuai Li","title":"DPMAC: Differentially Private Communication for Cooperative Multi-Agent\n  Reinforcement Learning","comments":"Full version; Accepted in IJCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Communication lays the foundation for cooperation in human society and in\nmulti-agent reinforcement learning (MARL). Humans also desire to maintain their\nprivacy when communicating with others, yet such privacy concern has not been\nconsidered in existing works in MARL. To this end, we propose the\n\\textit{differentially private multi-agent communication} (DPMAC) algorithm,\nwhich protects the sensitive information of individual agents by equipping each\nagent with a local message sender with rigorous $(\\epsilon,\n\\delta)$-differential privacy (DP) guarantee. In contrast to directly\nperturbing the messages with predefined DP noise as commonly done in\nprivacy-preserving scenarios, we adopt a stochastic message sender for each\nagent respectively and incorporate the DP requirement into the sender, which\nautomatically adjusts the learned message distribution to alleviate the\ninstability caused by DP noise. Further, we prove the existence of a Nash\nequilibrium in cooperative MARL with privacy-preserving communication, which\nsuggests that this problem is game-theoretically learnable. Extensive\nexperiments demonstrate a clear advantage of DPMAC over baseline methods in\nprivacy-preserving scenarios.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:26:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Canzhe",""],["Ze","Yanjie",""],["Dong","Jing",""],["Wang","Baoxiang",""],["Li","Shuai",""]]}
{"id":"2308.09903","submitter":"Qiangqiang Wu","authors":"Qiangqiang Wu and Tianyu Yang and Wei WU and Antoni Chan","title":"Scalable Video Object Segmentation with Simplified Framework","comments":"ICCV-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current popular methods for video object segmentation (VOS) implement\nfeature matching through several hand-crafted modules that separately perform\nfeature extraction and matching. However, the above hand-crafted designs\nempirically cause insufficient target interaction, thus limiting the dynamic\ntarget-aware feature learning in VOS. To tackle these limitations, this paper\npresents a scalable Simplified VOS (SimVOS) framework to perform joint feature\nextraction and matching by leveraging a single transformer backbone.\nSpecifically, SimVOS employs a scalable ViT backbone for simultaneous feature\nextraction and matching between query and reference features. This design\nenables SimVOS to learn better target-ware features for accurate mask\nprediction. More importantly, SimVOS could directly apply well-pretrained ViT\nbackbones (e.g., MAE) for VOS, which bridges the gap between VOS and\nlarge-scale self-supervised pre-training. To achieve a better performance-speed\ntrade-off, we further explore within-frame attention and propose a new token\nrefinement module to improve the running speed and save computational cost.\nExperimentally, our SimVOS achieves state-of-the-art results on popular video\nobject segmentation benchmarks, i.e., DAVIS-2017 (88.0% J&F), DAVIS-2016 (92.9%\nJ&F) and YouTube-VOS 2019 (84.2% J&F), without applying any synthetic video or\nBL30K pre-training used in previous VOS approaches.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:30:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Qiangqiang",""],["Yang","Tianyu",""],["WU","Wei",""],["Chan","Antoni",""]]}
{"id":"2308.09904","submitter":"Yubo Shu","authors":"Yubo Shu, Hansu Gu, Peng Zhang, Haonan Zhang, Tun Lu, Dongsheng Li,\n  Ning Gu","title":"RAH! RecSys-Assistant-Human: A Human-Central Recommendation Framework\n  with Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recommendation ecosystem involves interactions between recommender\nsystems(Computer) and users(Human). Orthogonal to the perspective of\nrecommender systems, we attempt to utilize LLMs from the perspective of users\nand propose a more human-central recommendation framework named RAH, which\nconsists of Recommender system, Assistant and Human. The assistant is a\nLLM-based and personal proxy for a human to achieve user satisfaction. The\nassistant plays a non-invasion role and the RAH framework can adapt to\ndifferent recommender systems and user groups. Subsequently, we implement and\nevaluate the RAH framework for learning user personalities and proxy human\nfeedback. The experiment shows that (1) using learn-action-critic and\nreflection mechanisms can lead more aligned personality and (2) our assistant\ncan effectively proxy human feedback and help adjust recommender systems.\nFinally, we discuss further strategies in the RAH framework to address\nhuman-central concerns including user control, privacy and fairness.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:46:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shu","Yubo",""],["Gu","Hansu",""],["Zhang","Peng",""],["Zhang","Haonan",""],["Lu","Tun",""],["Li","Dongsheng",""],["Gu","Ning",""]]}
{"id":"2308.09905","submitter":"Run Luo","authors":"Run Luo, Zikai Song, Lintao Ma, Jinlin Wei, Wei Yang, Min Yang","title":"DiffusionTrack: Diffusion Model For Multi-Object Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-object tracking (MOT) is a challenging vision task that aims to detect\nindividual objects within a single frame and associate them across multiple\nframes. Recent MOT approaches can be categorized into two-stage\ntracking-by-detection (TBD) methods and one-stage joint detection and tracking\n(JDT) methods. Despite the success of these approaches, they also suffer from\ncommon problems, such as harmful global or local inconsistency, poor trade-off\nbetween robustness and model complexity, and lack of flexibility in different\nscenes within the same video. In this paper we propose a simple but robust\nframework that formulates object detection and association jointly as a\nconsistent denoising diffusion process from paired noise boxes to paired\nground-truth boxes. This novel progressive denoising diffusion strategy\nsubstantially augments the tracker's effectiveness, enabling it to discriminate\nbetween various objects. During the training stage, paired object boxes diffuse\nfrom paired ground-truth boxes to random distribution, and the model learns\ndetection and tracking simultaneously by reversing this noising process. In\ninference, the model refines a set of paired randomly generated boxes to the\ndetection and tracking results in a flexible one-step or multi-step denoising\ndiffusion process. Extensive experiments on three widely used MOT benchmarks,\nincluding MOT17, MOT20, and Dancetrack, demonstrate that our approach achieves\ncompetitive performance compared to the current state-of-the-art methods.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:48:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Run",""],["Song","Zikai",""],["Ma","Lintao",""],["Wei","Jinlin",""],["Yang","Wei",""],["Yang","Min",""]]}
{"id":"2308.09906","submitter":"Alexandros-Apostolos Boulogeorgos","authors":"Alexandros--Apostolos A. Boulogeorgos, Angeliki Alexiou, and Angelos\n  Michalas","title":"On the physical layer security capabilities of reconfigurable\n  intelligent surface empowered wireless systems","comments":"12 pages, 5 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 this paper, we investigate the physical layer security capabilities of\nreconfigurable intelligent surface (RIS) empowered wireless systems. In more\ndetail, we consider a general system model, in which the links between the\ntransmitter (TX) and the RIS as well as the links between the RIS and the\nlegitimate receiver are modeled as mixture Gamma (MG) random variables (RVs).\nMoreover, the link between the TX and eavesdropper is also modeled as a MG RV.\nBuilding upon this system model, we derive the probability of zero-secrecy\ncapacity as well as the probability of information leakage. Finally, we extract\nthe average secrecy rate for both cases of TX having full and partial channel\nstate information knowledge.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 04:55:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Boulogeorgos","Alexandros--Apostolos A.",""],["Alexiou","Angeliki",""],["Michalas","Angelos",""]]}
{"id":"2308.09907","submitter":"Yixin Wang","authors":"Yixin Wang, Wei Peng, Susan F. Tapert, Qingyu Zhao, Kilian M. Pohl","title":"Imputing Brain Measurements Across Data Sets via Graph Neural Networks","comments":"Accepted at the 6th workshop on PRedictive Intelligence in Medicine\n  (PRIME 2023) - MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Publicly available data sets of structural MRIs might not contain specific\nmeasurements of brain Regions of Interests (ROIs) that are important for\ntraining machine learning models. For example, the curvature scores computed by\nFreesurfer are not released by the Adolescent Brain Cognitive Development\n(ABCD) Study. One can address this issue by simply reapplying Freesurfer to the\ndata set. However, this approach is generally computationally and labor\nintensive (e.g., requiring quality control). An alternative is to impute the\nmissing measurements via a deep learning approach. However, the\nstate-of-the-art is designed to estimate randomly missing values rather than\nentire measurements. We therefore propose to re-frame the imputation problem as\na prediction task on another (public) data set that contains the missing\nmeasurements and shares some ROI measurements with the data sets of interest. A\ndeep learning model is then trained to predict the missing measurements from\nthe shared ones and afterwards is applied to the other data sets. Our proposed\nalgorithm models the dependencies between ROI measurements via a graph neural\nnetwork (GNN) and accounts for demographic differences in brain measurements\n(e.g. sex) by feeding the graph encoding into a parallel architecture. The\narchitecture simultaneously optimizes a graph decoder to impute values and a\nclassifier in predicting demographic factors. We test the approach, called\nDemographic Aware Graph-based Imputation (DAGI), on imputing those missing\nFreesurfer measurements of ABCD (N=3760) by training the predictor on those\npublicly released by the National Consortium on Alcohol and Neurodevelopment in\nAdolescence (NCANDA, N=540)...\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:03:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yixin",""],["Peng","Wei",""],["Tapert","Susan F.",""],["Zhao","Qingyu",""],["Pohl","Kilian M.",""]]}
{"id":"2308.09908","submitter":"Zhenrong Zhang","authors":"Zhenrong Zhang, Jianan Liu, Yuxuan Xia, Tao Huang, Qing-Long Han,\n  Hongbin Liu","title":"LEGO: Learning and Graph-Optimized Modular Tracker for Online\n  Multi-Object Tracking with Point Clouds","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":"  Online multi-object tracking (MOT) plays a pivotal role in autonomous\nsystems. The state-of-the-art approaches usually employ a tracking-by-detection\nmethod, and data association plays a critical role. This paper proposes a\nlearning and graph-optimized (LEGO) modular tracker to improve data association\nperformance in the existing literature. The proposed LEGO tracker integrates\ngraph optimization and self-attention mechanisms, which efficiently formulate\nthe association score map, facilitating the accurate and efficient matching of\nobjects across time frames. To further enhance the state update process, the\nKalman filter is added to ensure consistent tracking by incorporating temporal\ncoherence in the object states. Our proposed method utilizing LiDAR alone has\nshown exceptional performance compared to other online tracking approaches,\nincluding LiDAR-based and LiDAR-camera fusion-based methods. LEGO ranked 1st at\nthe time of submitting results to KITTI object tracking evaluation ranking\nboard and remains 2nd at the time of submitting this paper, among all online\ntrackers in the KITTI MOT benchmark for cars1\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:15:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Zhenrong",""],["Liu","Jianan",""],["Xia","Yuxuan",""],["Huang","Tao",""],["Han","Qing-Long",""],["Liu","Hongbin",""]]}
{"id":"2308.09909","submitter":"Chenghao Li","authors":"Chenghao Li, Tonghan Wang, Chongjie Zhang, Qianchuan Zhao","title":"Never Explore Repeatedly in Multi-Agent Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the realm of multi-agent reinforcement learning, intrinsic motivations\nhave emerged as a pivotal tool for exploration. While the computation of many\nintrinsic rewards relies on estimating variational posteriors using neural\nnetwork approximators, a notable challenge has surfaced due to the limited\nexpressive capability of these neural statistics approximators. We pinpoint\nthis challenge as the \"revisitation\" issue, where agents recurrently explore\nconfined areas of the task space. To combat this, we propose a dynamic reward\nscaling approach. This method is crafted to stabilize the significant\nfluctuations in intrinsic rewards in previously explored areas and promote\nbroader exploration, effectively curbing the revisitation phenomenon. Our\nexperimental findings underscore the efficacy of our approach, showcasing\nenhanced performance in demanding environments like Google Research Football\nand StarCraft II micromanagement tasks, especially in sparse reward settings.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:27:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Chenghao",""],["Wang","Tonghan",""],["Zhang","Chongjie",""],["Zhao","Qianchuan",""]]}
{"id":"2308.09910","submitter":"Jingyi Ju","authors":"Jingyi Ju, Buzhen Huang, Chen Zhu, Zhihao Li and Yangang Wang","title":"Physics-Guided Human Motion Capture with Pose Probability Modeling","comments":"accepted by IJCAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Incorporating physics in human motion capture to avoid artifacts like\nfloating, foot sliding, and ground penetration is a promising direction.\nExisting solutions always adopt kinematic results as reference motions, and the\nphysics is treated as a post-processing module. However, due to the depth\nambiguity, monocular motion capture inevitably suffers from noises, and the\nnoisy reference often leads to failure for physics-based tracking. To address\nthe obstacles, our key-idea is to employ physics as denoising guidance in the\nreverse diffusion process to reconstruct physically plausible human motion from\na modeled pose probability distribution. Specifically, we first train a latent\ngaussian model that encodes the uncertainty of 2D-to-3D lifting to facilitate\nreverse diffusion. Then, a physics module is constructed to track the motion\nsampled from the distribution. The discrepancies between the tracked motion and\nimage observation are used to provide explicit guidance for the reverse\ndiffusion model to refine the motion. With several iterations, the\nphysics-based tracking and kinematic denoising promote each other to generate a\nphysically plausible human motion. Experimental results show that our method\noutperforms previous physics-based methods in both joint accuracy and success\nrate. More information can be found at\n\\url{https://github.com/Me-Ditto/Physics-Guided-Mocap}.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:28:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ju","Jingyi",""],["Huang","Buzhen",""],["Zhu","Chen",""],["Li","Zhihao",""],["Wang","Yangang",""]]}
{"id":"2308.09911","submitter":"Yang Qin","authors":"Yang Qin, Yingke Chen, Dezhong Peng, Xi Peng, Joey Tianyi Zhou, and\n  Peng Hu","title":"Noisy-Correspondence Learning for Text-to-Image Person Re-identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-to-image person re-identification (TIReID) is a compelling topic in the\ncross-modal community, which aims to retrieve the target person based on a\ntextual query. Although numerous TIReID methods have been proposed and achieved\npromising performance, they implicitly assume the training image-text pairs are\ncorrectly aligned, which is not always the case in real-world scenarios. In\npractice, the image-text pairs inevitably exist under-correlated or even\nfalse-correlated, a.k.a noisy correspondence (NC), due to the low quality of\nthe images and annotation errors. To address this problem, we propose a novel\nRobust Dual Embedding method (RDE) that can learn robust visual-semantic\nassociations even with NC. Specifically, RDE consists of two main components:\n1) A Confident Consensus Division (CCD) module that leverages the dual-grained\ndecisions of dual embedding modules to obtain a consensus set of clean training\ndata, which enables the model to learn correct and reliable visual-semantic\nassociations. 2) A Triplet-Alignment Loss (TAL) relaxes the conventional\ntriplet-ranking loss with hardest negatives, which tends to rapidly overfit NC,\nto a log-exponential upper bound over all negatives, thus preventing the model\nfrom overemphasizing false image-text pairs. We conduct extensive experiments\non three public benchmarks, namely CUHK-PEDES, ICFG-PEDES, and RSTPReID, to\nevaluate the performance and robustness of our RDE. Our method achieves\nstate-of-the-art results both with and without synthetic noisy correspondences\non all three datasets.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:34:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qin","Yang",""],["Chen","Yingke",""],["Peng","Dezhong",""],["Peng","Xi",""],["Zhou","Joey Tianyi",""],["Hu","Peng",""]]}
{"id":"2308.09912","submitter":"Alexander Lim","authors":"Alexander Lim and Fred Roosta","title":"Complexity Guarantees for Nonconvex Newton-MR Under Inexact Hessian\n  Information","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 consider extensions of the Newton-MR algorithm for nonconvex optimization\nto the settings where Hessian information is approximated. Under additive noise\nmodel on the Hessian matrix, we investigate the iteration and operation\ncomplexities of these variants to achieve first and second-order sub-optimality\ncriteria. We show that, under certain conditions, the algorithms achieve\niteration and operation complexities that match those of the exact variant.\nFocusing on the particular nonconvex problems satisfying Polyak-\\L ojasiewicz\ncondition, we show that our algorithm achieves a linear convergence rate. We\nfinally compare the performance of our algorithms with several alternatives on\na few machine learning problems.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:36:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lim","Alexander",""],["Roosta","Fred",""]]}
{"id":"2308.09913","submitter":"Mouhssine Koussour","authors":"N. Myrzakulov, M. Koussour, Alnadhief H. A. Alfedeel, and E. I. Hassan","title":"Constraining the $f(R,T) = R + 2\\lambda T$ cosmological model using\n  recent observational data","comments":"CPC accepted version","journal-ref":"2023 Chinese Phys. C","doi":"10.1088/1674-1137/acf2fa","report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider a comprehensive investigation of the cosmological\nmodel described by $f(R,T) = R + 2\\lambda T$ (where $\\lambda$ represents a free\nparameter) in light of the most recent observational data. By constraining the\nmodel using $Hubble$ and $Pantheon$ datasets, we determine its compatibility\nwith the observed behavior of the Universe. For this purpose, we adopt a\nparametric form for the effective equation of state (EoS) parameter. This\nparametric form allows us to describe the evolution of the EoS parameter with\nrespect to redshift and investigate its behavior during different cosmic\nepochs. The analysis of the deceleration parameter reveals an accelerating\nUniverse with a present value of $q_0=-0.64^{+0.03}_{-0.03}$, indicating the\ncurrent phase of accelerated expansion. The transition redshift is found to be\n$z_{tr}=0.53^{+0.04}_{-0.03}$, marking the epoch of transition from\ndeceleration to acceleration. We also analyze the evolution of important\ncosmological parameters including density parameter, pressure, effective EoS,\nand stability. These findings collectively demonstrate the viability of the\n$f(R,T)$ cosmological model as a robust candidate capable of engendering the\nrequisite negative pressure, thereby efficiently propelling cosmic expansion.\nMoreover, the undertaken stability analysis underscores the model's stability\nwithin the broader cosmic landscape. By providing the best-fit values for the\ncoupling parameter $\\lambda$, this approach motivates and encourages further\nexplorations into the extensive landscape of this model and its potential\napplications across diverse realms of cosmology and astronomy.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:44:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Myrzakulov","N.",""],["Koussour","M.",""],["Alfedeel","Alnadhief H. A.",""],["Hassan","E. I.",""]]}
{"id":"2308.09914","submitter":"Rajeev Kapri","authors":"Ramu Kumar Yadav, M. Suman Kalyan, Rajeev Kapri and Abhishek Chaudhuri","title":"Stochastic resonance in a model of a periodically driven DNA : Multiple\n  transitions, scaling and sequence dependence","comments":"6 pages, 5 figures; Published version","journal-ref":"Phys. Rev. E 108, L022401 (2023)","doi":"10.1103/PhysRevE.108.L022401","report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We numerically study stochastic resonance in the unzipping of a model\ndouble-stranded DNA by a periodic force. We observe multiple peaks in\nstochastic resonance in the output signal as the driving force frequency is\nvaried for different force amplitudes, temperature, chain length, and chain\nheterogeneity. Multiple peaks point to the existence of multiple stable and\nmetastable states, which correspond to dynamical states of partially zipped and\nunzipped conformations and transitions between them. We quantify such\ntransitions by looking at the time evolution of the fraction of bound base\npairs. We obtain phase diagrams in the force amplitude-temperature plane both\nin the resonance frequency of the primary peak and the output signal at the\npeak value. We further obtain an excellent scaling behavior of the output\nsignal for changing lengths of the DNA. Resonance behavior is also affected by\nchain heterogeneity as it depends strongly on which base pair the periodic\nforcing is applied.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:44:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yadav","Ramu Kumar",""],["Kalyan","M. Suman",""],["Kapri","Rajeev",""],["Chaudhuri","Abhishek",""]]}
{"id":"2308.09915","submitter":"Shiming Chen","authors":"Shiming Chen and Shihuang Chen and Wenjin Hou and Weiping Ding and\n  Xinge You","title":"EGANS: Evolutionary Generative Adversarial Network Search for Zero-Shot\n  Learning","comments":"Accepted to TEVC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-shot learning (ZSL) aims to recognize the novel classes which cannot be\ncollected for training a prediction model. Accordingly, generative models\n(e.g., generative adversarial network (GAN)) are typically used to synthesize\nthe visual samples conditioned by the class semantic vectors and achieve\nremarkable progress for ZSL. However, existing GAN-based generative ZSL methods\nare based on hand-crafted models, which cannot adapt to various\ndatasets/scenarios and fails to model instability. To alleviate these\nchallenges, we propose evolutionary generative adversarial network search\n(termed EGANS) to automatically design the generative network with good\nadaptation and stability, enabling reliable visual feature sample synthesis for\nadvancing ZSL. Specifically, we adopt cooperative dual evolution to conduct a\nneural architecture search for both generator and discriminator under a unified\nevolutionary adversarial framework. EGANS is learned by two stages: evolution\ngenerator architecture search and evolution discriminator architecture search.\nDuring the evolution generator architecture search, we adopt a many-to-one\nadversarial training strategy to evolutionarily search for the optimal\ngenerator. Then the optimal generator is further applied to search for the\noptimal discriminator in the evolution discriminator architecture search with a\nsimilar evolution search algorithm. Once the optimal generator and\ndiscriminator are searched, we entail them into various generative ZSL\nbaselines for ZSL classification. Extensive experiments show that EGANS\nconsistently improve existing generative ZSL methods on the standard CUB, SUN,\nAWA2 and FLO datasets. The significant performance gains indicate that the\nevolutionary neural architecture search explores a virgin field in ZSL.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:47:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Shiming",""],["Chen","Shihuang",""],["Hou","Wenjin",""],["Ding","Weiping",""],["You","Xinge",""]]}
{"id":"2308.09916","submitter":"Jiehong Lin","authors":"Jiehong Lin and Zewei Wei and Yabin Zhang and Kui Jia","title":"VI-Net: Boosting Category-level 6D Object Pose Estimation via Learning\n  Decoupled Rotations on the Spherical Representations","comments":"Accepted by ICCV2023. Project Page:\n  https://github.com/JiehongLin/VI-Net","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rotation estimation of high precision from an RGB-D object observation is a\nhuge challenge in 6D object pose estimation, due to the difficulty of learning\nin the non-linear space of SO(3). In this paper, we propose a novel rotation\nestimation network, termed as VI-Net, to make the task easier by decoupling the\nrotation as the combination of a viewpoint rotation and an in-plane rotation.\nMore specifically, VI-Net bases the feature learning on the sphere with two\nindividual branches for the estimates of two factorized rotations, where a\nV-Branch is employed to learn the viewpoint rotation via binary classification\non the spherical signals, while another I-Branch is used to estimate the\nin-plane rotation by transforming the signals to view from the zenith\ndirection. To process the spherical signals, a Spherical Feature Pyramid\nNetwork is constructed based on a novel design of SPAtial Spherical Convolution\n(SPA-SConv), which settles the boundary problem of spherical signals via\nfeature padding and realizesviewpoint-equivariant feature extraction by\nsymmetric convolutional operations. We apply the proposed VI-Net to the\nchallenging task of category-level 6D object pose estimation for predicting the\nposes of unknown objects without available CAD models; experiments on the\nbenchmarking datasets confirm the efficacy of our method, which outperforms the\nexisting ones with a large margin in the regime of high precision.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:47:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Jiehong",""],["Wei","Zewei",""],["Zhang","Yabin",""],["Jia","Kui",""]]}
{"id":"2308.09917","submitter":"Yinda Chen","authors":"Yinda Chen, Wei Huang, Xiaoyu Liu, Qi Chen, Zhiwei Xiong","title":"Learning Multiscale Consistency for Self-supervised Electron Microscopy\n  Instance Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Instance segmentation in electron microscopy (EM) volumes poses a significant\nchallenge due to the complex morphology of instances and insufficient\nannotations. Self-supervised learning has recently emerged as a promising\nsolution, enabling the acquisition of prior knowledge of cellular tissue\nstructures that are essential for EM instance segmentation. However, existing\npretraining methods often lack the ability to capture complex visual patterns\nand relationships between voxels, which results in the acquired prior knowledge\nbeing insufficient for downstream EM analysis tasks. In this paper, we propose\na novel pretraining framework that leverages multiscale visual representations\nto capture both voxel-level and feature-level consistency in EM volumes.\nSpecifically, our framework enforces voxel-level consistency between the\noutputs of a Siamese network by a reconstruction function, and incorporates a\ncross-attention mechanism for soft feature matching to achieve fine-grained\nfeature-level consistency. Moreover, we propose a contrastive learning scheme\non the feature pyramid to extract discriminative features across multiple\nscales. We extensively pretrain our method on four large-scale EM datasets,\nachieving promising performance improvements in representative tasks of neuron\nand mitochondria instance segmentation.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:49:13 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 06:19:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Yinda",""],["Huang","Wei",""],["Liu","Xiaoyu",""],["Chen","Qi",""],["Xiong","Zhiwei",""]]}
{"id":"2308.09918","submitter":"Maria Luz Gamiz","authors":"Mar\\'ia Luz G\\'amiz, Enno Mammen, Mar\\'ia Dolores Mart\\'inez-Miranda,\n  Jens Perch Nielsen","title":"Low quality exposure and point processes with a view to the first phase\n  of a pandemic","comments":"5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the early days of development of a pandemic there is no time for\ncomplicated data collection. One needs a simple cross-country benchmark\napproach based on robust data that is easy to understand and easy to collect.\nThe recent pandemic has shown us what early available pandemic data might look\nlike, because statistical data was published every day in standard news outlets\nin many countries. This paper provides new methodology for the analysis data\nwhere exposure is only vaguely understood and where the very definition of\nexposure might change over time. The exposure of poor quality is used to\nanalyse and forecast events. Our example of such exposure is daily infections\nduring a pandemic and the events are number of new infected patients in\nhospitals every day. Examples are given with French Covid-19 data on\nhospitalized patients and numbers of infected.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:01:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["G\u00e1miz","Mar\u00eda Luz",""],["Mammen","Enno",""],["Mart\u00ednez-Miranda","Mar\u00eda Dolores",""],["Nielsen","Jens Perch",""]]}
{"id":"2308.09919","submitter":"Maria Luz Gamiz","authors":"Mar\\'ia Luz G\\'amiz, Enno Mammen, Mar\\'ia Dolores Mart\\'inez-Miranda,\n  Jens Perch Nielsen","title":"Monitoring a developing pandemic with available data","comments":"11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses pandemic statistics from a management perspective. Both\ninput and output are easy to understand. Focus is on operations and cross\nborder communication. To be able to work with simple available data some new\nmissing data issues have to be solved from a mathematical statistical point of\nview. We illustrate our approach with data from France collected during the\nrecent Covid-19 pandemic. Our new benchmark method also introduces a potential\nnew division of labour while working with pandemic statistics allowing crucial\ninput to be fed to the model via prior knowledge from external experts.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:06:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["G\u00e1miz","Mar\u00eda Luz",""],["Mammen","Enno",""],["Mart\u00ednez-Miranda","Mar\u00eda Dolores",""],["Nielsen","Jens Perch",""]]}
{"id":"2308.09920","submitter":"Cristian Frasinaru","authors":"Cristian Fr\\u{a}sinaru and Emanuel Florentin Olariu","title":"Graph4J -- A computationally efficient Java library for graph algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph algorithms play an important role in many computer science areas. In\norder to solve problems that can be modeled using graphs, it is necessary to\nuse a data structure that can represent those graphs in an efficient manner. On\ntop of this, an infrastructure should be build that will assist in implementing\ncommon algorithms or developing specialized ones. Here, a new Java library is\nintroduced, called Graph4J, that uses a different approach when compared to\nexisting, well-known Java libraries such as JGraphT, JUNG and Guava Graph.\nInstead of using object-oriented data structures for graph representation, a\nlower-level model based on arrays of primitive values is utilized, that\ndrastically reduces the required memory and the running times of the algorithm\nimplementations. The design of the library, the space complexity of the graph\nstructures and the time complexity of the most common graph operations are\npresented in detail, along with an experimental study that evaluates its\nperformance, when compared to the other libraries. Emphasis is given to\ninfrastructure related aspects, that is graph creation, inspection, alteration\nand traversal. The improvements obtained for other implemented algorithms are\nalso analyzed and it is shown that the proposed library significantly\noutperforms the existing ones.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:08:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fr\u0103sinaru","Cristian",""],["Olariu","Emanuel Florentin",""]]}
{"id":"2308.09921","submitter":"Juan Hu","authors":"Juan Hu, Xin Liao, Difei Gao, Satoshi Tsutsui, Qian Wang, Zheng Qin,\n  Mike Zheng Shou","title":"Recap: Detecting Deepfake Video with Unpredictable Tampered Traces via\n  Recovering Faces and Mapping Recovered Faces","comments":"arXiv admin note: substantial text overlap with arXiv:2305.05943","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The exploitation of Deepfake techniques for malicious intentions has driven\nsignificant research interest in Deepfake detection. Deepfake manipulations\nfrequently introduce random tampered traces, leading to unpredictable outcomes\nin different facial regions. However, existing detection methods heavily rely\non specific forgery indicators, and as the forgery mode improves, these traces\nbecome increasingly randomized, resulting in a decline in the detection\nperformance of methods reliant on specific forgery traces. To address the\nlimitation, we propose Recap, a novel Deepfake detection model that exposes\nunspecific facial part inconsistencies by recovering faces and enlarges the\ndifferences between real and fake by mapping recovered faces. In the recovering\nstage, the model focuses on randomly masking regions of interest (ROIs) and\nreconstructing real faces without unpredictable tampered traces, resulting in a\nrelatively good recovery effect for real faces while a poor recovery effect for\nfake faces. In the mapping stage, the output of the recovery phase serves as\nsupervision to guide the facial mapping process. This mapping process\nstrategically emphasizes the mapping of fake faces with poor recovery, leading\nto a further deterioration in their representation, while enhancing and\nrefining the mapping of real faces with good representation. As a result, this\napproach significantly amplifies the discrepancies between real and fake\nvideos. Our extensive experiments on standard benchmarks demonstrate that Recap\nis effective in multiple scenarios.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:18:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Juan",""],["Liao","Xin",""],["Gao","Difei",""],["Tsutsui","Satoshi",""],["Wang","Qian",""],["Qin","Zheng",""],["Shou","Mike Zheng",""]]}
{"id":"2308.09922","submitter":"Qihao Zhao","authors":"Qihao Zhao and Chen Jiang and Wei Hu and Fan Zhang and Jun Liu","title":"MDCS: More Diverse Experts with Consistency Self-distillation for\n  Long-tailed Recognition","comments":"ICCV2023 Accept. 13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, multi-expert methods have led to significant improvements in\nlong-tail recognition (LTR). We summarize two aspects that need further\nenhancement to contribute to LTR boosting: (1) More diverse experts; (2) Lower\nmodel variance. However, the previous methods didn't handle them well. To this\nend, we propose More Diverse experts with Consistency Self-distillation (MDCS)\nto bridge the gap left by earlier methods. Our MDCS approach consists of two\ncore components: Diversity Loss (DL) and Consistency Self-distillation (CS). In\ndetail, DL promotes diversity among experts by controlling their focus on\ndifferent categories. To reduce the model variance, we employ KL divergence to\ndistill the richer knowledge of weakly augmented instances for the experts'\nself-distillation. In particular, we design Confident Instance Sampling (CIS)\nto select the correctly classified instances for CS to avoid biased/noisy\nknowledge. In the analysis and ablation study, we demonstrate that our method\ncompared with previous work can effectively increase the diversity of experts,\nsignificantly reduce the variance of the model, and improve recognition\naccuracy. Moreover, the roles of our DL and CS are mutually reinforcing and\ncoupled: the diversity of experts benefits from the CS, and the CS cannot\nachieve remarkable results without the DL. Experiments show our MDCS\noutperforms the state-of-the-art by 1% $\\sim$ 2% on five popular long-tailed\nbenchmarks, including CIFAR10-LT, CIFAR100-LT, ImageNet-LT, Places-LT, and\niNaturalist 2018. The code is available at https://github.com/fistyee/MDCS.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:21:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Qihao",""],["Jiang","Chen",""],["Hu","Wei",""],["Zhang","Fan",""],["Liu","Jun",""]]}
{"id":"2308.09923","submitter":"Yuanchao Ding","authors":"Yuanchao Ding, Hua Guo, Yewei Guan, Weixin Liu, Jiarong Huo, Zhenyu\n  Guan, Xiyong Zhang","title":"East: Efficient and Accurate Secure Transformer Framework for Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer has been successfully used in practical applications, such as\nChatGPT, due to its powerful advantages. However, users' input is leaked to the\nmodel provider during the service. With people's attention to privacy,\nprivacy-preserving Transformer inference is on the demand of such services.\nSecure protocols for non-linear functions are crucial in privacy-preserving\nTransformer inference, which are not well studied. Thus, designing practical\nsecure protocols for non-linear functions is hard but significant to model\nperformance. In this work, we propose a framework \\emph{East} to enable\nefficient and accurate secure Transformer inference. Firstly, we propose a new\noblivious piecewise polynomial evaluation algorithm and apply it to the\nactivation functions, which reduces the runtime and communication of GELU by\nover 1.5$\\times$ and 2.5$\\times$, compared to prior arts. Secondly, the secure\nprotocols for softmax and layer normalization are carefully designed to\nfaithfully maintain the desired functionality. Thirdly, several optimizations\nare conducted in detail to enhance the overall efficiency. We applied\n\\emph{East} to BERT and the results show that the inference accuracy remains\nconsistent with the plaintext inference without fine-tuning. Compared to Iron,\nwe achieve about 1.8$\\times$ lower communication within 1.2$\\times$ lower\nruntime.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:26:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ding","Yuanchao",""],["Guo","Hua",""],["Guan","Yewei",""],["Liu","Weixin",""],["Huo","Jiarong",""],["Guan","Zhenyu",""],["Zhang","Xiyong",""]]}
{"id":"2308.09924","submitter":"Kate Glazko","authors":"Kate S Glazko, Momona Yamagami, Aashaka Desai, Kelly Avery Mack,\n  Venkatesh Potluri, Xuhai Xu, Jennifer Mankoff","title":"An Autoethnographic Case Study of Generative Artificial Intelligence's\n  Utility for Accessibility","comments":null,"journal-ref":null,"doi":"10.1145/3597638.3614548","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the recent rapid rise in Generative Artificial Intelligence (GAI) tools,\nit is imperative that we understand their impact on people with disabilities,\nboth positive and negative. However, although we know that AI in general poses\nboth risks and opportunities for people with disabilities, little is known\nspecifically about GAI in particular. To address this, we conducted a\nthree-month autoethnography of our use of GAI to meet personal and professional\nneeds as a team of researchers with and without disabilities. Our findings\ndemonstrate a wide variety of potential accessibility-related uses for GAI\nwhile also highlighting concerns around verifiability, training data, ableism,\nand false promises.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:33:29 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 20:43:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Glazko","Kate S",""],["Yamagami","Momona",""],["Desai","Aashaka",""],["Mack","Kelly Avery",""],["Potluri","Venkatesh",""],["Xu","Xuhai",""],["Mankoff","Jennifer",""]]}
{"id":"2308.09925","submitter":"Seung Hun Lee Mr.","authors":"Seung Hun Lee and Bohm-Jung Yang","title":"Fermi Surface Spin Texture and Topological Superconductivity in\n  Spin-Orbit Free Non-Collinear Antiferromagnets","comments":null,"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 explore the relationship among the magnetic ordering in real space, the\nresulting spin texture on the Fermi surface, and the related superconducting\ngap structure in non-collinear antiferromagnetic metals without spin-orbit\ncoupling. Via a perturbative approach, we show that a non-collinear magnetic\nordering in a metal can generate a momentum-dependent spin texture on its Fermi\nsurface, even in the absence of spin-orbit coupling, if the metal has more than\nthree sublattices in its magnetic unit cell. Thus, our theory naturally extends\nthe idea of altermagnetism to non-collinear spin structures. When\nsuperconductivity is developed in a magnetic metal, as the gap-opening\ncondition is strongly constrained by the spin texture, the nodal structure of\nthe superconducting state is also enforced by the magnetism-induced spin\ntexture. Taking the non-collinear antiferromagnet on the kagome lattice as a\nrepresentative example, we demonstrate how the Fermi surface spin texture\ninduced by noncollinear antiferromagnetism naturally leads to odd-parity\nspin-triplet superconductivity with nontrivial topological properties.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:38:24 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 06:11:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Seung Hun",""],["Yang","Bohm-Jung",""]]}
{"id":"2308.09926","submitter":"Yong Niu","authors":"Yunhan Ma, Yong Niu, Shiwen Mao, Zhu Han, Ruisi He, Zhangdui Zhong,\n  Ning Wang, Bo Ai","title":"Robust Train-to-Train Transmission Scheduling in mmWave Band for High\n  Speed Train Communication Systems","comments":"14 pages","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":"  Demands for data traffic in high-speed railway (HSR) has increased\ndrastically. The increasing entertainment needs of passengers, safety control\ninformation exchanges of trains, etc., make train-to-train (T2T) communications\nface the challenge of achieving high-capacity and high-quality data\ntransmissions. In order to greatly increase the communication capacity, it is\nurgent to introduce millimeter wave (mmWave) technology. Faced with the problem\nthat mmWave link is easy to be blocked, this paper leverages the existing\nequipment to assist relay, and proposes an effective transmission scheduling\nscheme to improve the robustness of T2T communication systems. First of all, we\nformulate a mixed integer nonlinear programming (MINLP) optimization problem\nthe transmission scheduling in T2T communication systems where mobile relays\n(MRs) are all working in the full-duplex (FD) mode. Then we propose a low\ncomplexity heuristic algorithm to solve the optimization problem, which\nconsists of three components: relay selection, transmission mode selection, and\ntransmission scheduling. The simulation results show that the proposed\nalgorithm can greatly improve the number of completed flows and system\nthroughput. Finally, we analyze the influence of different design parameters on\nthe system performance. The results show that the proposed algorithm can\nachieve more data flows and system throughput within a reasonable communication\ndistance threshold in T2T communication with obstacles in different orbits. It\ncan balance the computational complexity and system performance to achieve an\nefficient and robust data transmission.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:52:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Yunhan",""],["Niu","Yong",""],["Mao","Shiwen",""],["Han","Zhu",""],["He","Ruisi",""],["Zhong","Zhangdui",""],["Wang","Ning",""],["Ai","Bo",""]]}
{"id":"2308.09927","submitter":"Sachin Verma","authors":"Sachin Verma, B. S. Tewari, A. Dhyani and Ajay","title":"Revisiting thermoelectric transport across strongly correlated quantum\n  dot: A Green's function equation of motion theory perspective","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Using Green's function equation of motion within Lacroix decoupling scheme,\nwe examine the thermoelectric transport features of a strongly interacting\nquantum dot coupled between metallic leads. We demonstrate that a qualitative\ndescription of the thermoelectric transport in the Kondo regime requires a\ncomplete self-consistent treatment of Green's function. The linear\nthermoelectric properties, including electrical conductivity, thermal\nconductivity, thermopower, and figure of merit, are analyzed as a function of\ntemperature ranging from Kondo to Coulomb blockade regime. The results\npresented here are qualitatively consistent with existing results obtained\nusing different theoretical techniques.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:56:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Verma","Sachin",""],["Tewari","B. S.",""],["Dhyani","A.",""],["Ajay","",""]]}
{"id":"2308.09928","submitter":"Chaowei Jiang","authors":"Chaowei Jiang, Xueshang Feng, Xinkai Bian, Peng Zou, Aiying Duan,\n  Xiaoli Yan, Qiang Hu, Wen He, Xinyi Wang, Pingbing Zuo, and Yi Wang","title":"Magnetic Reconnection as the Key Mechanism in Sunspot Rotation Leading\n  to Solar Eruption","comments":"Submitted to ApJ. arXiv admin note: substantial text overlap with\n  arXiv:2308.06977","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rotation of sunspots around their umbral center has long been considered\nas an important process in leading to solar eruptions, but the underlying\nmechanism remains unclear. A prevailing physical picture on how sunspot\nrotation leads to eruption is that, by twisting the coronal magnetic field\nlines from their footpoints, the rotation can build up a magnetic flux rope and\ndrive it into some kinds of ideal magnetohydrodynamics (MHD) instabilities\nwhich initiate eruptions. Here with a data-inspired MHD simulation we studied\nthe rotation of a large sunspot in solar active region NOAA 12158 leading to a\nmajor eruption, and found that it is distinct from prevailing theories based on\nideal instabilities of twisted flux rope. The simulation suggests that, through\nsuccessive rotation of the sunspot, the coronal magnetic field is sheared with\na central current sheet created progressively within the sheared arcade before\nthe eruption, but without forming a flux rope. Then the eruption is instantly\ntriggered once fast reconnection sets in at the current sheet, while a highly\ntwisted flux rope is created during the eruption. Furthermore, the simulation\nreveals an intermediate evolution stage between the quasi-static energy-storage\nphase and the impulsive eruption-acceleration phase. This stage may corresponds\nto slow-rise phase in observation and it enhances building up of the current\nsheet.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:03:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Chaowei",""],["Feng","Xueshang",""],["Bian","Xinkai",""],["Zou","Peng",""],["Duan","Aiying",""],["Yan","Xiaoli",""],["Hu","Qiang",""],["He","Wen",""],["Wang","Xinyi",""],["Zuo","Pingbing",""],["Wang","Yi",""]]}
{"id":"2308.09929","submitter":"Yong Niu","authors":"Panpan Li, Yong Niu, Hao Wu, Zhu Han, Guiqi Sun, Ning Wang, and\n  Zhangdui Zhong, Bo Ai","title":"RIS-assisted High-Speed Railway Integrated Sensing and Communication\n  System","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One technology that has the potential to improve wireless communications in\nyears to come is integrated sensing and communication (ISAC). In this study, we\ntake advantage of reconfigurable intelligent surface's (RIS) potential\nadvantages to achieve ISAC while using the same frequency and resources.\nSpecifically, by using the reflecting elements, the RIS dynamically modifies\nthe radio waves' strength or phase in order to change the environment for radio\ntransmission and increase the ISAC systems' transmission rate. We investigate a\nsingle cell downlink communication situation with RIS assistance. Combining the\nISAC base station's (BS) beamforming with RIS's discrete phase shift\noptimization, while guaranteeing the sensing signal, The aim of optimizing the\nsum rate is specified. We take advantage of alternating maximization to find\npractical solutions with dividing the challenge into two minor issues. The\nfirst power allocation subproblem is non-convex that CVX solves by converting\nit to convex. A local search strategy is used to solve the second subproblem of\nphase shift optimization. According to the results of the simulation, using RIS\nwith adjusted phase shifts can significantly enhance the ISAC system's\nperformance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:06:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Panpan",""],["Niu","Yong",""],["Wu","Hao",""],["Han","Zhu",""],["Sun","Guiqi",""],["Wang","Ning",""],["Zhong","Zhangdui",""],["Ai","Bo",""]]}
{"id":"2308.09930","submitter":"Chen Li","authors":"Chen Li, Kai Wang","title":"Joint Projective Spectrum of $D_{\\infty h}$","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the joint spectrum of $D_{\\infty h}$ with respect to the left\nregular representation, and finds two generators of the De Rham cohomology\ngroup of joint resolvent set which is induced by different central linear\nfunctionals. Through action of $D_{\\infty h}$ on 4-ary trees, we get a\nself-similar realization of the group $C^*$ algebra of $D_{\\infty h}$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:11:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Chen",""],["Wang","Kai",""]]}
{"id":"2308.09931","submitter":"Geng Liu","authors":"Geng Liu and Yuxi Wang","title":"TDG: Text-guided Domain Generalization","comments":"8pages,3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain generalization (DG) attempts to generalize a model trained on single\nor multiple source domains to the unseen target domain. Benefiting from the\nsuccess of Visual-and-Language Pre-trained models in recent years, we argue\nthat it is crucial for domain generalization by introducing extra text\ninformation. In this paper, we develop a novel Text-guided Domain\nGeneralization (TDG) paradigm for domain generalization, which includes three\nfollowing aspects. Specifically, we first devise an automatic words generation\nmethod to extend the description of current domains with novel domain-relevant\nwords. Then, we embed the generated domain information into the text feature\nspace, by the proposed prompt learning-based text feature generation method,\nwhich shares a common representation space with the image feature. Finally, we\nutilize both input image features and generated text features to train a\nspecially designed classifier that generalizes well on unseen target domains,\nwhile the image encoder is also updated under the supervision of gradients back\npropagated from the classifier. Our experimental results show that the\ntechniques incorporated by TDG contribute to the performance in an easy\nimplementation manner. Experimental results on several domain generalization\nbenchmarks show that our proposed framework achieves superior performance by\neffectively leveraging generated text information in domain generalization.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:21:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Geng",""],["Wang","Yuxi",""]]}
{"id":"2308.09932","submitter":"Zhou Yang","authors":"Zhou Yang, Zhipeng Zhao, Chenyu Wang, Jieke Shi, Dongsun Kim, DongGyun\n  Han, David Lo","title":"What Do Code Models Memorize? An Empirical Study on Large Language\n  Models of Code","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The availability of large-scale datasets, advanced architectures, and\npowerful computational resources have led to effective code models that\nautomate diverse software engineering activities. The datasets usually consist\nof billions of lines of code from both open-source and private repositories. A\ncode model memorizes and produces source code verbatim, which potentially\ncontains vulnerabilities, sensitive information, or code with strict licenses,\nleading to potential security and privacy issues.\n  This paper investigates an important problem: to what extent do code models\nmemorize their training data? We conduct an empirical study to explore\nmemorization in large pre-trained code models. Our study highlights that simply\nextracting 20,000 outputs (each having 512 tokens) from a code model can\nproduce over 40,125 code snippets that are memorized from the training data. To\nprovide a better understanding, we build a taxonomy of memorized contents with\n3 categories and 14 subcategories. The results show that the prompts sent to\nthe code models affect the distribution of memorized contents. We identify\nseveral key factors of memorization. Specifically, given the same architecture,\nlarger models suffer more from memorization problems. A code model produces\nmore memorization when it is allowed to generate longer outputs. We also find a\nstrong positive correlation between the number of an output's occurrences in\nthe training data and that in the generated outputs, which indicates that a\npotential way to reduce memorization is to remove duplicates in the training\ndata. We then identify effective metrics that infer whether an output contains\nmemorization accurately. We also make some suggestions regarding dealing with\nmemorization in code models.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:25:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Zhou",""],["Zhao","Zhipeng",""],["Wang","Chenyu",""],["Shi","Jieke",""],["Kim","Dongsun",""],["Han","DongGyun",""],["Lo","David",""]]}
{"id":"2308.09933","submitter":"Kenji Nishiwaki","authors":"Kenzo Ishikawa, Osamu Jinnouchi, Kenji Nishiwaki, Kin-ya Oda","title":"Wave-Packet Effects: A Solution for Isospin Anomalies in Vector-Meson\n  Decay","comments":"50 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a long-standing anomaly in the ratio of the decay width for\n$\\psi(3770)\\to D^0\\overline{D^0}$ to that for $\\psi(3770)\\to D^+D^-$ at the\nlevel of $9.5\\,\\sigma$. A similar anomaly exists for the ratio of\n$\\phi(1020)\\to K_\\text{L}^0K_\\text{S}^0$ to $\\phi(1020)\\to K^+K^-$ at\n$2.1\\,\\sigma$. In this study, we reassess the anomaly through the lens of\nGaussian wave-packet formalism. Our comprehensive calculations include the\nlocalization of the overlap of the wave packets near the mass thresholds as\nwell as the composite nature of the initial-state vector mesons. The results\nalign within $\\sim 1 \\sigma$ confidence level with the Particle Data Group's\ncentral values for a physically reasonable value of the form-factor parameter,\nindicating a resolution to these anomalies. We also check the deviation of a\nwave-packet resonance from the Briet-Wigner shape and find that wide ranges of\nthe wave-packet size are consistent with the experimental data.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:27:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ishikawa","Kenzo",""],["Jinnouchi","Osamu",""],["Nishiwaki","Kenji",""],["Oda","Kin-ya",""]]}
{"id":"2308.09934","submitter":"Yong Niu","authors":"Lei Wang, Bo Ai, Yong Niu, Haiyan Jiang, Shiwen Mao, Zhangdui Zhong,\n  Ning Wang","title":"Joint User Association and Transmission Scheduling in Integrated mmWave\n  Access and Terahertz Backhaul Networks","comments":"11 pages","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":"  Terahertz wireless backhaul is expected to meet the high-speed backhaul\nrequirements of future ultra-dense networks using millimeter-wave (mmWave) base\nstations (BSs). In order to achieve higher network capacity with limited\nresources and meet the quality of service (QoS) requirements of more users in\nthe integrated mmWave access and terahertz backhaul network, this paper\nformulates a problem of maximizing the number of users successfully served in\nboth the access and backhaul links. Since the problem is a non-linear integer\noptimization problem, a minimum rate ratio user association and transmission\nscheduling algorithm is proposed to obtain a suboptimal solution. The proposed\nalgorithm takes the minimum rate ratio as the user association criterion and\nschedules first the users with fewer backhaul transmission slots. In addition,\nthe algorithm will update the number of access transmission slots allocated to\nusers and the access scheduling results after the backhaul scheduling phase.\nNumerical results show that the proposed algorithm outperforms several\nbenchmark algorithms in terms of the number of served users and system\nthroughput, and it can cope with a large number of bursty user requests.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:41:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Lei",""],["Ai","Bo",""],["Niu","Yong",""],["Jiang","Haiyan",""],["Mao","Shiwen",""],["Zhong","Zhangdui",""],["Wang","Ning",""]]}
{"id":"2308.09935","submitter":"Kei Noba","authors":"Kei Noba and Kosuke Yamato","title":"Analytic property of generalized scale functions for standard processes\n  with no negative jumps and its application to quasi-stationary distributions","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a generalized scale function of standard processes, we characterize it as\na unique solution to a Volterra type integral equation. This allows us to\nextend it to an entire function and to derive a useful identity that we call\nthe resolvent identity. We apply this result to study the existence of a\nquasi-stationary distribution for the processes killed at hitting boundaries. A\nnew classification of the boundary, which is a natural extension of Feller's\nfor one-dimensional diffusions, is introduced and plays a central role to\ncharacterize the existence.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:41:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Noba","Kei",""],["Yamato","Kosuke",""]]}
{"id":"2308.09936","submitter":"Wenbo Hu","authors":"Wenbo Hu, Yifan Xu, Yi Li, Weiyue Li, Zeyuan Chen, Zhuowen Tu","title":"BLIVA: A Simple Multimodal LLM for Better Handling of Text-Rich Visual\n  Questions","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":"  Vision Language Models (VLMs), which extend Large Language Models (LLM) by\nincorporating visual understanding capability, have demonstrated significant\nadvancements in addressing open-ended visual question-answering (VQA) tasks.\nHowever, these models cannot accurately interpret images infused with text, a\ncommon occurrence in real-world scenarios. Standard procedures for extracting\ninformation from images often involve learning a fixed set of query embeddings.\nThese embeddings are designed to encapsulate image contexts and are later used\nas soft prompt inputs in LLMs. Yet, this process is limited to the token count,\npotentially curtailing the recognition of scenes with text-rich context. To\nimprove upon them, the present study introduces BLIVA: an augmented version of\nInstructBLIP with Visual Assistant. BLIVA incorporates the query embeddings\nfrom InstructBLIP and also directly projects encoded patch embeddings into the\nLLM, a technique inspired by LLaVA. This approach assists the model to capture\nintricate details potentially missed during the query decoding process.\nEmpirical evidence demonstrates that our model, BLIVA, significantly enhances\nperformance in processing text-rich VQA benchmarks (up to 17.76\\% in OCR-VQA\nbenchmark) and in undertaking typical VQA benchmarks (up to 7.9\\% in Visual\nSpatial Reasoning benchmark), comparing to our baseline InstructBLIP. BLIVA\ndemonstrates significant capability in decoding real-world images, irrespective\nof text presence. To demonstrate the broad industry applications enabled by\nBLIVA, we evaluate the model using a new dataset comprising YouTube thumbnails\npaired with question-answer sets across 13 diverse categories. For researchers\ninterested in further exploration, our code and models are freely accessible at\nhttps://github.com/mlpc-ucsd/BLIVA.git\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:53:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hu","Wenbo",""],["Xu","Yifan",""],["Li","Yi",""],["Li","Weiyue",""],["Chen","Zeyuan",""],["Tu","Zhuowen",""]]}
{"id":"2308.09937","submitter":"Jinyang Liu","authors":"Jinyang Liu, Tianyi Yang, Zhuangbin Chen, Yuxin Su, Cong Feng, Zengyin\n  Yang, Michael R. Lyu","title":"Practical Anomaly Detection over Multivariate Monitoring Metrics for\n  Online Services","comments":"This paper has been accepted by the 34th IEEE International Symposium\n  on Software Reliability Engineering (ISSRE'2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As modern software systems continue to grow in terms of complexity and\nvolume, anomaly detection on multivariate monitoring metrics, which profile\nsystems' health status, becomes more and more critical and challenging. In\nparticular, the dependency between different metrics and their historical\npatterns plays a critical role in pursuing prompt and accurate anomaly\ndetection. Existing approaches fall short of industrial needs for being unable\nto capture such information efficiently. To fill this significant gap, in this\npaper, we propose CMAnomaly, an anomaly detection framework on multivariate\nmonitoring metrics based on collaborative machine. The proposed collaborative\nmachine is a mechanism to capture the pairwise interactions along with feature\nand temporal dimensions with linear time complexity. Cost-effective models can\nthen be employed to leverage both the dependency between monitoring metrics and\ntheir historical patterns for anomaly detection. The proposed framework is\nextensively evaluated with both public data and industrial data collected from\na large-scale online service system of Huawei Cloud. The experimental results\ndemonstrate that compared with state-of-the-art baseline models, CMAnomaly\nachieves an average F1 score of 0.9494, outperforming baselines by 6.77% to\n10.68%, and runs 10X to 20X faster. Furthermore, we also share our experience\nof deploying CMAnomaly in Huawei Cloud.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:08:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Jinyang",""],["Yang","Tianyi",""],["Chen","Zhuangbin",""],["Su","Yuxin",""],["Feng","Cong",""],["Yang","Zengyin",""],["Lyu","Michael R.",""]]}
{"id":"2308.09938","submitter":"Thanh-Nhan Nguyen","authors":"Thanh-Nhan Nguyen, Minh-Phuong Tran, Hong-Nhung Nguyen","title":"Regularity for the steady Stokes-type flow of incompressible Newtonian\n  fluids in some generalized function settings","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A study of regularity estimate for weak solution to generalized stationary\nStokes-type systems involving $p$-Laplacian is offered. The governing systems\nof equations are based on steady incompressible flow of a Newtonian fluids.\nThis paper also provides a relatively complete picture of our main results in\ntwo regards: problems with nonlinearity is regular with respect to the gradient\nvariable; and asymtotically regular problems, whose nonlinearity satisfies a\nparticular structure near infinity. For such Stokes-type systems, we derive\nregularity estimates for both velocity gradient and its associated pressure in\ntwo special classes of function spaces: the generalized Lorentz and\n$\\psi$-generalized Morrey spaces.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:14:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nguyen","Thanh-Nhan",""],["Tran","Minh-Phuong",""],["Nguyen","Hong-Nhung",""]]}
{"id":"2308.09939","submitter":"Zhongzhan Huang","authors":"Zhongzhan Huang, Mingfu Liang, Jinghui Qin, Shanshan Zhong, Liang Lin","title":"Understanding Self-attention Mechanism via Dynamical System Perspective","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The self-attention mechanism (SAM) is widely used in various fields of\nartificial intelligence and has successfully boosted the performance of\ndifferent models. However, current explanations of this mechanism are mainly\nbased on intuitions and experiences, while there still lacks direct modeling\nfor how the SAM helps performance. To mitigate this issue, in this paper, based\non the dynamical system perspective of the residual neural network, we first\nshow that the intrinsic stiffness phenomenon (SP) in the high-precision\nsolution of ordinary differential equations (ODEs) also widely exists in\nhigh-performance neural networks (NN). Thus the ability of NN to measure SP at\nthe feature level is necessary to obtain high performance and is an important\nfactor in the difficulty of training NN. Similar to the adaptive step-size\nmethod which is effective in solving stiff ODEs, we show that the SAM is also a\nstiffness-aware step size adaptor that can enhance the model's representational\nability to measure intrinsic SP by refining the estimation of stiffness\ninformation and generating adaptive attention values, which provides a new\nunderstanding about why and how the SAM can benefit the model performance. This\nnovel perspective can also explain the lottery ticket hypothesis in SAM, design\nnew quantitative metrics of representational ability, and inspire a new\ntheoretic-inspired approach, StepNet. Extensive experiments on several popular\nbenchmarks demonstrate that StepNet can extract fine-grained stiffness\ninformation and measure SP accurately, leading to significant improvements in\nvarious visual tasks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:17:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Zhongzhan",""],["Liang","Mingfu",""],["Qin","Jinghui",""],["Zhong","Shanshan",""],["Lin","Liang",""]]}
{"id":"2308.09940","submitter":"Haoyu Gao","authors":"Haoyu Gao, Christoph Treude and Mansooreh Zahedi","title":"Evaluating Transfer Learning for Simplifying GitHub READMEs","comments":"Accepted by ESEC/FSE 2023","journal-ref":null,"doi":"10.1145/3611643.3616291","report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software documentation captures detailed knowledge about a software product,\ne.g., code, technologies, and design. It plays an important role in the\ncoordination of development teams and in conveying ideas to various\nstakeholders. However, software documentation can be hard to comprehend if it\nis written with jargon and complicated sentence structure. In this study, we\nexplored the potential of text simplification techniques in the domain of\nsoftware engineering to automatically simplify GitHub README files. We\ncollected software-related pairs of GitHub README files consisting of 14,588\nentries, aligned difficult sentences with their simplified counterparts, and\ntrained a Transformer-based model to automatically simplify difficult versions.\nTo mitigate the sparse and noisy nature of the software-related simplification\ndataset, we applied general text simplification knowledge to this field. Since\nmany general-domain difficult-to-simple Wikipedia document pairs are already\npublicly available, we explored the potential of transfer learning by first\ntraining the model on the Wikipedia data and then fine-tuning it on the README\ndata. Using automated BLEU scores and human evaluation, we compared the\nperformance of different transfer learning schemes and the baseline models\nwithout transfer learning. The transfer learning model using the best\ncheckpoint trained on a general topic corpus achieved the best performance of\n34.68 BLEU score and statistically significantly higher human annotation scores\ncompared to the rest of the schemes and baselines. We conclude that using\ntransfer learning is a promising direction to circumvent the lack of data and\ndrift style problem in software README files simplification and achieved a\nbetter trade-off between simplification and preservation of meaning.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:20:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gao","Haoyu",""],["Treude","Christoph",""],["Zahedi","Mansooreh",""]]}
{"id":"2308.09941","submitter":"Tom Chou","authors":"Yue Wang, Blerta Shtylla, Tom Chou","title":"Order-of-mutation effects on cancer progression: models for\n  myeloproliferative neoplasm","comments":"22 pp, 7 figures. arXiv admin note: text overlap with\n  arXiv:2302.07955","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN q-bio.PE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We develop a modeling framework for cancer progression that distinguishes the\norder of two possible mutations. Recent observations and information on\nmyeloproliferative neoplasms are analyzed within our framework. In some\npatients with myeloproliferative neoplasms, two genetic mutations can be found,\nJAK2 V617F and TET2. Whether or not one mutation is present will influence how\nthe other subsequent mutation affects the regulation of gene expression. When\nboth mutations are present, the order of their occurrence has been shown to\ninfluence disease progression and prognosis. In this paper, we propose a\nnonlinear ordinary differential equation (ODE) and Markov chain models to\nexplain the non-additive and non-commutative clinical observations with respect\nto different orders of mutations: gene expression patterns, proportions of\ncells with different mutations, and ages at diagnosis. We also propose\npotential experiments measurements that can be used to verify our models.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:21:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yue",""],["Shtylla","Blerta",""],["Chou","Tom",""]]}
{"id":"2308.09942","submitter":"Yushu Li","authors":"Yushu Li, Xun Xu, Yongyi Su, Kui Jia","title":"On the Robustness of Open-World Test-Time Training: Self-Training with\n  Dynamic Prototype Expansion","comments":"Accepted at ICCV 2023 (Oral)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalizing deep learning models to unknown target domain distribution with\nlow latency has motivated research into test-time training/adaptation\n(TTT/TTA). Existing approaches often focus on improving test-time training\nperformance under well-curated target domain data. As figured out in this work,\nmany state-of-the-art methods fail to maintain the performance when the target\ndomain is contaminated with strong out-of-distribution (OOD) data, a.k.a.\nopen-world test-time training (OWTTT). The failure is mainly due to the\ninability to distinguish strong OOD samples from regular weak OOD samples. To\nimprove the robustness of OWTTT we first develop an adaptive strong OOD pruning\nwhich improves the efficacy of the self-training TTT method. We further propose\na way to dynamically expand the prototypes to represent strong OOD samples for\nan improved weak/strong OOD data separation. Finally, we regularize\nself-training with distribution alignment and the combination yields the\nstate-of-the-art performance on 5 OWTTT benchmarks. The code is available at\nhttps://github.com/Yushu-Li/OWTTT.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:27:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yushu",""],["Xu","Xun",""],["Su","Yongyi",""],["Jia","Kui",""]]}
{"id":"2308.09943","submitter":"Hao-Lun Lin","authors":"Hao-Lun Lin, Jyun-Yu Jiang, Ming-Hao Juan and Pu-Jen Cheng","title":"printf: Preference Modeling Based on User Reviews with Item Images and\n  Textual Information via Graph Learning","comments":"In Proceedings of The 32nd ACM International Conference on\n  Information and Knowledge Management (CIKM '23), ACM, 2023","journal-ref":null,"doi":"10.1145/3583780.3615012","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nowadays, modern recommender systems usually leverage textual and visual\ncontents as auxiliary information to predict user preference. For textual\ninformation, review texts are one of the most popular contents to model user\nbehaviors. Nevertheless, reviews usually lose their shine when it comes to\ntop-N recommender systems because those that solely utilize textual reviews as\nfeatures struggle to adequately capture the interaction relationships between\nusers and items. For visual one, it is usually modeled with naive convolutional\nnetworks and also hard to capture high-order relationships between users and\nitems. Moreover, previous works did not collaboratively use both texts and\nimages in a proper way. In this paper, we propose printf, preference modeling\nbased on user reviews with item images and textual information via graph\nlearning, to address the above challenges. Specifically, the dimension-based\nattention mechanism directs relations between user reviews and interacted\nitems, allowing each dimension to contribute different importance weights to\nderive user representations. Extensive experiments are conducted on three\npublicly available datasets. The experimental results demonstrate that our\nproposed printf consistently outperforms baseline methods with the relative\nimprovements for NDCG@5 of 26.80%, 48.65%, and 25.74% on Amazon-Grocery,\nAmazon-Tools, and Amazon-Electronics datasets, respectively. The in-depth\nanalysis also indicates the dimensions of review representations definitely\nhave different topics and aspects, assisting the validity of our model design.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:29:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Hao-Lun",""],["Jiang","Jyun-Yu",""],["Juan","Ming-Hao",""],["Cheng","Pu-Jen",""]]}
{"id":"2308.09944","submitter":"Jun Xue","authors":"Cunhang Fan, Jun Xue, Jianhua Tao, Jiangyan Yi, Chenglong Wang,\n  Chengshi Zheng, Zhao Lv","title":"Spatial Reconstructed Local Attention Res2Net with F0 Subband for Fake\n  Speech Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rhythm of synthetic speech is usually too smooth, which causes that the\nfundamental frequency (F0) of synthetic speech is significantly different from\nthat of real speech. It is expected that the F0 feature contains the\ndiscriminative information for the fake speech detection (FSD) task. In this\npaper, we propose a novel F0 subband for FSD. In addition, to effectively model\nthe F0 subband so as to improve the performance of FSD, the spatial\nreconstructed local attention Res2Net (SR-LA Res2Net) is proposed.\nSpecifically, Res2Net is used as a backbone network to obtain multiscale\ninformation, and enhanced with a spatial reconstruction mechanism to avoid\nlosing important information when the channel group is constantly superimposed.\nIn addition, local attention is designed to make the model focus on the local\ninformation of the F0 subband. Experimental results on the ASVspoof 2019 LA\ndataset show that our proposed method obtains an equal error rate (EER) of\n0.47% and a minimum tandem detection cost function (min t-DCF) of 0.0159,\nachieving the state-of-the-art performance among all of the single systems.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:31:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fan","Cunhang",""],["Xue","Jun",""],["Tao","Jianhua",""],["Yi","Jiangyan",""],["Wang","Chenglong",""],["Zheng","Chengshi",""],["Lv","Zhao",""]]}
{"id":"2308.09945","submitter":"Muharram Mansoorizaeh","authors":"Hossein Shakibania, Sina Raoufi, Behnam Pourafkham, Hassan Khotanlou,\n  and Muharram Mansoorizadeh","title":"Dual Branch Deep Learning Network for Detection and Stage Grading of\n  Diabetic Retinopathy","comments":"Submitted to Elsevier","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":"  Diabetic retinopathy is a severe complication of diabetes that can lead to\npermanent blindness if not treated promptly. Early and accurate diagnosis of\nthe disease is essential for successful treatment. This paper introduces a deep\nlearning method for the detection and stage grading of diabetic retinopathy,\nusing a single fundus retinal image. Our model utilizes transfer learning,\nemploying two state-of-the-art pre-trained models as feature extractors and\nfine-tuning them on a new dataset. The proposed model is trained on a large\nmulti-center dataset, including the APTOS 2019 dataset, obtained from publicly\navailable sources. It achieves remarkable performance in diabetic retinopathy\ndetection and stage classification on the APTOS 2019, outperforming the\nestablished literature. For binary classification, the proposed approach\nachieves an accuracy of 98.50%, a sensitivity of 99.46%, and a specificity of\n97.51%. In stage grading, it achieves a quadratic weighted kappa of 93.00%, an\naccuracy of 89.60%, a sensitivity of 89.60%, and a specificity of 97.72%. The\nproposed approach serves as a reliable screening and stage grading tool for\ndiabetic retinopathy, offering significant potential to enhance clinical\ndecision-making and patient care.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:41:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shakibania","Hossein",""],["Raoufi","Sina",""],["Pourafkham","Behnam",""],["Khotanlou","Hassan",""],["Mansoorizadeh","Muharram",""]]}
{"id":"2308.09946","submitter":"Guiqin Wang","authors":"Guiqin Wang and Peng Zhao and Cong Zhao and Shusen Yang and Jie Cheng\n  and Luziwei Leng and Jianxing Liao and Qinghai Guo","title":"Weakly-Supervised Action Localization by Hierarchically-structured\n  Latent Attention Modeling","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":"  Weakly-supervised action localization aims to recognize and localize action\ninstancese in untrimmed videos with only video-level labels. Most existing\nmodels rely on multiple instance learning(MIL), where the predictions of\nunlabeled instances are supervised by classifying labeled bags. The MIL-based\nmethods are relatively well studied with cogent performance achieved on\nclassification but not on localization. Generally, they locate temporal regions\nby the video-level classification but overlook the temporal variations of\nfeature semantics. To address this problem, we propose a novel attention-based\nhierarchically-structured latent model to learn the temporal variations of\nfeature semantics. Specifically, our model entails two components, the first is\nan unsupervised change-points detection module that detects change-points by\nlearning the latent representations of video features in a temporal hierarchy\nbased on their rates of change, and the second is an attention-based\nclassification model that selects the change-points of the foreground as the\nboundaries. To evaluate the effectiveness of our model, we conduct extensive\nexperiments on two benchmark datasets, THUMOS-14 and ActivityNet-v1.3. The\nexperiments show that our method outperforms current state-of-the-art methods,\nand even achieves comparable performance with fully-supervised methods.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:45:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Guiqin",""],["Zhao","Peng",""],["Zhao","Cong",""],["Yang","Shusen",""],["Cheng","Jie",""],["Leng","Luziwei",""],["Liao","Jianxing",""],["Guo","Qinghai",""]]}
{"id":"2308.09947","submitter":"Tatiana Afanasieva","authors":"T.V. Afanasieva and A.P. Kuzlyakin and A.V. Komolov","title":"Study on the effectiveness of AutoML in detecting cardiovascular disease","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cardiovascular diseases are widespread among patients with chronic\nnoncommunicable diseases and are one of the leading causes of death, including\nin the working age. The article presents the relevance of the development and\napplication of patient-oriented systems, in which machine learning (ML) is a\npromising technology that allows predicting cardiovascular diseases. Automated\nmachine learning (AutoML) makes it possible to simplify and speed up the\nprocess of developing AI/ML applications, which is key in the development of\npatient-oriented systems by application users, in particular medical\nspecialists. The authors propose a framework for the application of automatic\nmachine learning and three scenarios that allowed for data combining five data\nsets of cardiovascular disease indicators from the UCI Machine Learning\nRepository to investigate the effectiveness in detecting this class of\ndiseases. The study investigated one AutoML model that used and optimized the\nhyperparameters of thirteen basic ML models (KNeighborsUnif, KNeighborsDist,\nLightGBMXT, LightGBM, RandomForestGini, RandomForestEntr, CatBoost,\nExtraTreesGini, ExtraTreesEntr, NeuralNetFastA, XGBoost, NeuralNetTorch,\nLightGBMLarge) and included the most accurate models in the weighted ensemble.\nThe results of the study showed that the structure of the AutoML model for\ndetecting cardiovascular diseases depends not only on the efficiency and\naccuracy of the basic models used, but also on the scenarios for preprocessing\nthe initial data, in particular, on the technique of data normalization. The\ncomparative analysis showed that the accuracy of the AutoML model in detecting\ncardiovascular disease varied in the range from 87.41% to 92.3%, and the\nmaximum accuracy was obtained when normalizing the source data into binary\nvalues, and the minimum was obtained when using the built-in AutoML technique.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:46:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Afanasieva","T. V.",""],["Kuzlyakin","A. P.",""],["Komolov","A. V.",""]]}
{"id":"2308.09948","submitter":"Qianyuan Zheng","authors":"Qianyuan Zheng, Hao Chen, Zhan Ma","title":"Bamboo: Boosting Training Efficiency for Real-Time Video Streaming via\n  Online Grouped Federated Transfer Learning","comments":"This paper will be presented at Apnet 2023","journal-ref":null,"doi":"10.1145/3600061.3600069","report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most of the learning-based algorithms for bitrate adaptation are limited to\noffline learning, which inevitably suffers from the simulation-to-reality gap.\nOnline learning can better adapt to dynamic real-time communication scenes but\nstill face the challenge of lengthy training convergence time. In this paper,\nwe propose a novel online grouped federated transfer learning framework named\nBamboo to accelerate training efficiency. The preliminary experiments validate\nthat our method remarkably improves online training efficiency by up to 302%\ncompared to other reinforcement learning algorithms in various network\nconditions while ensuring the quality of experience (QoE) of real-time video\ncommunication.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:55:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zheng","Qianyuan",""],["Chen","Hao",""],["Ma","Zhan",""]]}
{"id":"2308.09949","submitter":"Xiaoyong Lu","authors":"Xiaoyong Lu, Yaping Yan, Tong Wei, Songlin Du","title":"Scene-Aware Feature Matching","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Current feature matching methods focus on point-level matching, pursuing\nbetter representation learning of individual features, but lacking further\nunderstanding of the scene. This results in significant performance degradation\nwhen handling challenging scenes such as scenes with large viewpoint and\nillumination changes. To tackle this problem, we propose a novel model named\nSAM, which applies attentional grouping to guide Scene-Aware feature Matching.\nSAM handles multi-level features, i.e., image tokens and group tokens, with\nattention layers, and groups the image tokens with the proposed token grouping\nmodule. Our model can be trained by ground-truth matches only and produce\nreasonable grouping results. With the sense-aware grouping guidance, SAM is not\nonly more accurate and robust but also more interpretable than conventional\nfeature matching models. Sufficient experiments on various applications,\nincluding homography estimation, pose estimation, and image matching,\ndemonstrate that our model achieves state-of-the-art performance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:56:35 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 01:21:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Xiaoyong",""],["Yan","Yaping",""],["Wei","Tong",""],["Du","Songlin",""]]}
{"id":"2308.09950","submitter":"Xinmin Hou","authors":"Xuejun Zhang, Xinmin Hou","title":"Multicolor Ramsey numbers on stars versus pat","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For given simple graphs $H_1,H_2,\\dots,H_c$, the multicolor Ramsey number\n$R(H_1,H_2,\\dots,H_c)$ is defined as the smallest positive integer $n$ such\nthat for an arbitrary edge-decomposition $\\{G_i\\}^c_{i=1}$ of the complete\ngraph $K_n$, at least one $G_i$ has a subgraph isomorphic to $H_i$. Let\n$m,n_1,n_2,\\dots,n_c$ be positive integers and $\\Sigma=\\sum_{i=1}^{c}(n_i-1)$.\nSome bounds and exact values of $R(K_{1,n_1},\\dots,K_{1,n_c},P_m)$ have been\nobtained in literature. Wang (Graphs Combin., 2020) conjectured that if\n$\\Sigma\\not\\equiv 0\\pmod{m-1}$ and $\\Sigma+1\\ge (m-3)^2$, then\n$R(K_{1,n_1},\\ldots, K_{1,n_c}, P_m)=\\Sigma+m-1.$ In this note, we give a new\nlower bound and some exact values of $R(K_{1,n_1},\\dots,K_{1,n_c},P_m)$ when\n$m\\leq\\Sigma$, $\\Sigma\\equiv k\\pmod{m-1}$, and $2\\leq k \\leq m-2$. These\nresults partially confirm Wang's conjecture.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:09:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Xuejun",""],["Hou","Xinmin",""]]}
{"id":"2308.09951","submitter":"Rui Qian","authors":"Rui Qian, Shuangrui Ding, Xian Liu and Dahua Lin","title":"Semantics Meets Temporal Correspondence: Self-supervised Object-centric\n  Learning in Videos","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised methods have shown remarkable progress in learning high-level\nsemantics and low-level temporal correspondence. Building on these results, we\ntake one step further and explore the possibility of integrating these two\nfeatures to enhance object-centric representations. Our preliminary experiments\nindicate that query slot attention can extract different semantic components\nfrom the RGB feature map, while random sampling based slot attention can\nexploit temporal correspondence cues between frames to assist instance\nidentification. Motivated by this, we propose a novel semantic-aware masked\nslot attention on top of the fused semantic features and correspondence maps.\nIt comprises two slot attention stages with a set of shared learnable Gaussian\ndistributions. In the first stage, we use the mean vectors as slot\ninitialization to decompose potential semantics and generate semantic\nsegmentation masks through iterative attention. In the second stage, for each\nsemantics, we randomly sample slots from the corresponding Gaussian\ndistribution and perform masked feature aggregation within the semantic area to\nexploit temporal correspondence patterns for instance identification. We adopt\nsemantic- and instance-level temporal consistency as self-supervision to\nencourage temporally coherent object-centric representations. Our model\neffectively identifies multiple object instances with semantic structure,\nreaching promising results on unsupervised video object discovery. Furthermore,\nwe achieve state-of-the-art performance on dense label propagation tasks,\ndemonstrating the potential for object-centric analysis. The code is released\nat https://github.com/shvdiwnkozbw/SMTC.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:12:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qian","Rui",""],["Ding","Shuangrui",""],["Liu","Xian",""],["Lin","Dahua",""]]}
{"id":"2308.09952","submitter":"Jiang Zhang","authors":"Mingzhe Yang, Zhipeng Wang, Kaiwei Liu, Yingqi Rong, Bing Yuan, Jiang\n  Zhang","title":"Finding emergence in data: causal emergence inspired dynamics learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modelling complex dynamical systems in a data-driven manner is challenging\ndue to the presence of emergent behaviors and properties that cannot be\ndirectly captured by micro-level observational data. Therefore, it is crucial\nto develop a model that can effectively capture emergent dynamics at the\nmacro-level and quantify emergence based on the available data. Drawing\ninspiration from the theory of causal emergence, this paper introduces a\nmachine learning framework aimed at learning macro-dynamics within an emergent\nlatent space. The framework achieves this by maximizing the effective\ninformation (EI) to obtain a macro-dynamics model with stronger causal effects.\nExperimental results on both simulated and real data demonstrate the\neffectiveness of the proposed framework. Not only does it successfully capture\nemergent patterns, but it also learns the coarse-graining strategy and\nquantifies the degree of causal emergence in the data. Furthermore, experiments\nconducted on environments different from the training dataset highlight the\nsuperior generalization ability of our model.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:12:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Mingzhe",""],["Wang","Zhipeng",""],["Liu","Kaiwei",""],["Rong","Yingqi",""],["Yuan","Bing",""],["Zhang","Jiang",""]]}
{"id":"2308.09953","submitter":"Wenhao Chai","authors":"Meiqi Sun, Zhonghan Zhao, Wenhao Chai, Hanjun Luo, Shidong Cao,\n  Yanting Zhang, Jenq-Neng Hwang, Gaoang Wang","title":"UniAP: Towards Universal Animal Perception in Vision via Few-shot\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":"  Animal visual perception is an important technique for automatically\nmonitoring animal health, understanding animal behaviors, and assisting\nanimal-related research. However, it is challenging to design a deep\nlearning-based perception model that can freely adapt to different animals\nacross various perception tasks, due to the varying poses of a large diversity\nof animals, lacking data on rare species, and the semantic inconsistency of\ndifferent tasks. We introduce UniAP, a novel Universal Animal Perception model\nthat leverages few-shot learning to enable cross-species perception among\nvarious visual tasks. Our proposed model takes support images and labels as\nprompt guidance for a query image. Images and labels are processed through a\nTransformer-based encoder and a lightweight label encoder, respectively. Then a\nmatching module is designed for aggregating information between prompt guidance\nand the query image, followed by a multi-head label decoder to generate outputs\nfor various tasks. By capitalizing on the shared visual characteristics among\ndifferent animals and tasks, UniAP enables the transfer of knowledge from\nwell-studied species to those with limited labeled data or even unseen species.\nWe demonstrate the effectiveness of UniAP through comprehensive experiments in\npose estimation, segmentation, and classification tasks on diverse animal\nspecies, showcasing its ability to generalize and adapt to new classes with\nminimal labeled examples.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:13:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Meiqi",""],["Zhao","Zhonghan",""],["Chai","Wenhao",""],["Luo","Hanjun",""],["Cao","Shidong",""],["Zhang","Yanting",""],["Hwang","Jenq-Neng",""],["Wang","Gaoang",""]]}
{"id":"2308.09954","submitter":"Suhang Wu","authors":"Suhang Wu, Minlong Peng, Yue Chen, Jinsong Su, Mingming Sun","title":"Eva-KELLM: A New Benchmark for Evaluating Knowledge Editing of LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) possess a wealth of knowledge encoded in their\nparameters. However, this knowledge may become outdated or unsuitable over\ntime. As a result, there has been a growing interest in knowledge editing for\nLLMs and evaluating its effectiveness. Existing studies primarily focus on\nknowledge editing using factual triplets, which not only incur high costs for\ncollection but also struggle to express complex facts. Furthermore, these\nstudies are often limited in their evaluation perspectives. In this paper, we\npropose Eva-KELLM, a new benchmark for evaluating knowledge editing of LLMs.\nThis benchmark includes an evaluation framework and a corresponding dataset.\nUnder our framework, we first ask the LLM to perform knowledge editing using\nraw documents, which provides a more convenient and universal approach compared\nto using factual triplets. We then evaluate the updated LLM from multiple\nperspectives. In addition to assessing the effectiveness of knowledge editing\nand the retention of unrelated knowledge from conventional studies, we further\ntest the LLM's ability in two aspects: 1) Reasoning with the altered knowledge,\naiming for the LLM to genuinely learn the altered knowledge instead of simply\nmemorizing it. 2) Cross-lingual knowledge transfer, where the LLM updated with\nraw documents in one language should be capable of handling queries from\nanother language. To facilitate further research, we construct and release the\ncorresponding dataset. Using this benchmark, we investigate the effectiveness\nof several commonly-used knowledge editing methods. Experimental results\nindicate that the current methods for knowledge editing using raw documents are\nnot effective in yielding satisfactory results, particularly when it comes to\nreasoning with altered knowledge and cross-lingual knowledge transfer.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:17:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Suhang",""],["Peng","Minlong",""],["Chen","Yue",""],["Su","Jinsong",""],["Sun","Mingming",""]]}
{"id":"2308.09955","submitter":"Snehanshu Saha","authors":"Rajan Sahu, Shivam Chadha, Nithin Nagaraj, Archana Mathur, Snehanshu\n  Saha","title":"To prune or not to prune : A chaos-causality approach to principled\n  pruning of dense neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reducing the size of a neural network (pruning) by removing weights without\nimpacting its performance is an important problem for resource-constrained\ndevices. In the past, pruning was typically accomplished by ranking or\npenalizing weights based on criteria like magnitude and removing low-ranked\nweights before retraining the remaining ones. Pruning strategies may also\ninvolve removing neurons from the network in order to achieve the desired\nreduction in network size. We formulate pruning as an optimization problem with\nthe objective of minimizing misclassifications by selecting specific weights.\nTo accomplish this, we have introduced the concept of chaos in learning\n(Lyapunov exponents) via weight updates and exploiting causality to identify\nthe causal weights responsible for misclassification. Such a pruned network\nmaintains the original performance and retains feature explainability.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:17:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sahu","Rajan",""],["Chadha","Shivam",""],["Nagaraj","Nithin",""],["Mathur","Archana",""],["Saha","Snehanshu",""]]}
{"id":"2308.09956","submitter":"Zhuojia Fu Prof.","authors":"Qiang Xi, Zhuojia Fu, Wenzhi Xu, Mi-An Xue, Jinhai Zheng","title":"FEM-PIKFNNs for underwater acoustic propagation induced by structural\n  vibrations in different ocean environments","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 paper, a novel hybrid method based on the finite element method (FEM)\nand physics-informed kernel function neural networks (PIKFNNs) is proposed and\napplied to the prediction of underwater acoustic propagation induced by\nstructural vibrations in the unbounded ocean, deep ocean and shallow ocean. In\nthe hybrid method, PIKFNNs are a class of improved shallow physics-informed\nneural networks (PINNs) that replace the activation functions in PINNs with the\nphysics-informed kernel functions (PIKFs), thereby integrating prior physical\ninformation into the neural network model. Moreover, this neural network\ncircumvents the step of embedding the governing equations into the loss\nfunction in PINNs, and requires only training on boundary data. By using the\nGreen's functions as the PIKFs and the structural-acoustic coupling response\ninformation obtained from the FEM as boundary training data, the PIKFNNs can\ninherently capture the Sommerfeld radiation condition at infinity, which is\nnaturally suitable for predicting ocean acoustic propagation. Numerical\nexperiments demonstrate the accuracy and feasibility of the FEM-PIKFNNs in\ncomparison with the true solutions and finite element results.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:18:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xi","Qiang",""],["Fu","Zhuojia",""],["Xu","Wenzhi",""],["Xue","Mi-An",""],["Zheng","Jinhai",""]]}
{"id":"2308.09957","submitter":"Michela Lorandi","authors":"Michela Lorandi and Anya Belz","title":"Data-to-text Generation for Severely Under-Resourced Languages with\n  GPT-3.5: A Bit of Help Needed from Google Translate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  LLMs like GPT are great at tasks involving English which dominates in their\ntraining data. In this paper, we look at how they cope with tasks involving\nlanguages that are severely under-represented in their training data, in the\ncontext of data-to-text generation for Irish, Maltese, Welsh and Breton. During\nthe prompt-engineering phase we tested a range of prompt types and formats on\nGPT-3.5 and~4 with a small sample of example input/output pairs. We then fully\nevaluated the two most promising prompts in two scenarios: (i) direct\ngeneration into the under-resourced language, and (ii) generation into English\nfollowed by translation into the under-resourced language. We find that\nfew-shot prompting works better for direct generation into under-resourced\nlanguages, but that the difference disappears when pivoting via English. The\nfew-shot + translation system variants were submitted to the WebNLG 2023 shared\ntask where they outperformed competitor systems by substantial margins in all\nlanguages on all metrics. We conclude that good performance on under-resourced\nlanguages can be achieved out-of-the box with state-of-the-art LLMs. However,\nour best results (for Welsh) remain well below the lowest ranked English system\nat WebNLG'20.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:19:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lorandi","Michela",""],["Belz","Anya",""]]}
{"id":"2308.09958","submitter":"Martin Jure\\v{c}ek","authors":"Pavla Louth\\'anov\\'a, Matou\\v{s} Koz\\'ak, Martin Jure\\v{c}ek, Mark\n  Stamp","title":"A Comparison of Adversarial Learning Techniques for Malware Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning has proven to be a useful tool for automated malware\ndetection, but machine learning models have also been shown to be vulnerable to\nadversarial attacks. This article addresses the problem of generating\nadversarial malware samples, specifically malicious Windows Portable Executable\nfiles. We summarize and compare work that has focused on adversarial machine\nlearning for malware detection. We use gradient-based, evolutionary\nalgorithm-based, and reinforcement-based methods to generate adversarial\nsamples, and then test the generated samples against selected antivirus\nproducts. We compare the selected methods in terms of accuracy and practical\napplicability. The results show that applying optimized modifications to\npreviously detected malware can lead to incorrect classification of the file as\nbenign. It is also known that generated malware samples can be successfully\nused against detection models other than those used to generate them and that\nusing combinations of generators can create new samples that evade detection.\nExperiments show that the Gym-malware generator, which uses a reinforcement\nlearning approach, has the greatest practical potential. This generator\nachieved an average sample generation time of 5.73 seconds and the highest\naverage evasion rate of 44.11%. Using the Gym-malware generator in combination\nwith itself improved the evasion rate to 58.35%.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:22:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Louth\u00e1nov\u00e1","Pavla",""],["Koz\u00e1k","Matou\u0161",""],["Jure\u010dek","Martin",""],["Stamp","Mark",""]]}
{"id":"2308.09959","submitter":"Karl W\\\"ust","authors":"Giacomo Giuliari, Markus Legner, Adrian Perrig, Jean-Pierre Smith,\n  Karl W\\\"ust","title":"Hummingbird: A Flexible and Lightweight Inter-Domain\n  Bandwidth-Reservation System","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current Internet lacks a bandwidth-reservation infrastructure that\nenables fine-grained inter-domain reservations for end hosts. This is hindering\nthe provisioning of quality-of-service guarantees for real-time applications\nlike video calls and gaming, cloud-based systems, financial transactions,\ntelesurgery, and other remote applications that benefit from reliable\ncommunication. This paper introduces Hummingbird, a novel lightweight\ninter-domain bandwidth-reservation system that addresses several shortcomings\nof previous designs.\n  Hummingbird supports flexible and composable reservations and enables\nend-to-end guarantees without requiring autonomous systems to manage\nreservations for their endhosts. Previous systems tied reservations to\nautonomous-system numbers or network addresses, which limits the flexibility of\nreservations. In contrast, our system decouples reservations from network\nidentities and, as a result, the control plane from the data plane. This design\nchoice facilitates multiple co-existing control-plane mechanisms and enables\ninnovative approaches, such as a control plane based on blockchain smart\ncontracts that offers tradeable bandwidth-reservation assets and end-to-end\nguarantees. The data-plane design ensures simplicity for efficient processing\non border routers, which streamlines implementation, deployment, and traffic\npolicing while maintaining robust security properties.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:27:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Giuliari","Giacomo",""],["Legner","Markus",""],["Perrig","Adrian",""],["Smith","Jean-Pierre",""],["W\u00fcst","Karl",""]]}
{"id":"2308.09960","submitter":"Shubham Kulkarni","authors":"Shubham Kulkarni, Arya Marda, Karthik Vaidhyanathan","title":"Towards Self-Adaptive Machine Learning-Enabled Systems Through QoS-Aware\n  Model Switching","comments":"Accepted in 38th IEEE/ACM International Conference on Automated\n  Software Engineering (ASE 2023) in New Ideas and Emerging Results (NIER)\n  track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning (ML), particularly deep learning, has seen vast\nadvancements, leading to the rise of Machine Learning-Enabled Systems (MLS).\nHowever, numerous software engineering challenges persist in propelling these\nMLS into production, largely due to various run-time uncertainties that impact\nthe overall Quality of Service (QoS). These uncertainties emanate from ML\nmodels, software components, and environmental factors. Self-adaptation\ntechniques present potential in managing run-time uncertainties, but their\napplication in MLS remains largely unexplored. As a solution, we propose the\nconcept of a Machine Learning Model Balancer, focusing on managing\nuncertainties related to ML models by using multiple models. Subsequently, we\nintroduce AdaMLS, a novel self-adaptation approach that leverages this concept\nand extends the traditional MAPE-K loop for continuous MLS adaptation. AdaMLS\nemploys lightweight unsupervised learning for dynamic model switching, thereby\nensuring consistent QoS. Through a self-adaptive object detection system\nprototype, we demonstrate AdaMLS's effectiveness in balancing system and model\nperformance. Preliminary results suggest AdaMLS surpasses naive and single\nstate-of-the-art models in QoS guarantees, heralding the advancement towards\nself-adaptive MLS with optimal QoS in dynamic environments.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:33:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kulkarni","Shubham",""],["Marda","Arya",""],["Vaidhyanathan","Karthik",""]]}
{"id":"2308.09961","submitter":"Lyonell Boulton","authors":"Lyonell Boulton, George Farmakis and Beatrice Pelloni","title":"The phenomenon of revivals on complex potential Schr\\\"odinger's equation","comments":"17 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mysterious phenomena of revivals in linear dispersive periodic equations\nwas discovered first experimentally in optics in the 19th century, then\nrediscovered several times by theoretical and experimental investigations.\nWhile the term has been used systematically and consistently by many authors,\nthere is no consensus on a rigorous definition. In this paper, we describe\nrevivals modulo a regularity condition in a large class of Schr\\\"odinger's\nequations with complex bounded potentials. As we show, at rational times the\nsolution is given explicitly by finite linear combinations of translations and\ndilations of the initial datum, plus an additional continuous term.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:35:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Boulton","Lyonell",""],["Farmakis","George",""],["Pelloni","Beatrice",""]]}
{"id":"2308.09962","submitter":"Raffaele Gratton","authors":"R. Gratton, V. Squicciarini, V. Nascimbeni, M. Janson, S. Reffert, M.\n  Meyer, P. Delorme, E. E. Mamajek, M. Bonavita, S. Desidera, D. Mesa, E.\n  Rigliaco, V. D'Orazi, C. Lazzoni, G. Chauvin, M. Langlois","title":"Multiples among B stars in the Scorpius-Centaurus association","comments":"Accepted on Astronomy and Astrophysics, 31 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the properties of companions to B stars in the Scorpius-Centaurus\nassociation (age ~15 Myr, 181 B-stars). We gathered available data combining\nhigh contrast imaging samples with evidence of companions from Gaia, from\neclipsing binaries, and from spectroscopy. We evaluated the completeness of the\nbinary search and estimated the mass and semi-major axis for all detected\ncompanions. These data provide a complete sample of stellar secondaries for\nseparation >3 au, and they are highly informative as to closer companions. We\nfound evidence for 200 companions around 181 stars. The fraction of single star\nis 15.2\\pm 4.1% for stars with M_A>3.5 Msun while it is 31.5\\pm 5.9% for\nlower-mass stars. The median semi-major axis of the orbits of the companions is\nsmaller for B than in A stars, confirming a turn-over previously found for OB\nstars. The mass distribution of the very wide (a>1000 au) and closer companions\nis different. Very few companions of massive stars M_A>5.0 Msun have a mass\nbelow solar and even fewer are M stars with a semi-major axis <1000 au. The\nscarcity of low-mass companions extends throughout the whole sample. Most early\nB stars are in compact systems with massive secondaries, while lower-mass stars\nare mainly in wider systems with a larger spread in mass ratios. We interpret\nour results as the formation of secondaries with a semi-major axis <1000 au\n(about 80% of the total) by fragmentation of the disk of the primary and\nselective mass accretion on the secondaries. The observed trends with primary\nmass may be explained by a more prolonged phase of accretion episodes on the\ndisk and by a more effective inward migration. We detected twelve new stellar\ncompanions from the BEAST survey and of a new BD companion at 9.6 arcsec from\nHIP74752 using Gaia data, and we discuss the cases of possible BD and low-mass\nstellar companions to HIP59173, HIP62058, and HIP64053.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:38:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gratton","R.",""],["Squicciarini","V.",""],["Nascimbeni","V.",""],["Janson","M.",""],["Reffert","S.",""],["Meyer","M.",""],["Delorme","P.",""],["Mamajek","E. E.",""],["Bonavita","M.",""],["Desidera","S.",""],["Mesa","D.",""],["Rigliaco","E.",""],["D'Orazi","V.",""],["Lazzoni","C.",""],["Chauvin","G.",""],["Langlois","M.",""]]}
{"id":"2308.09963","submitter":"Marcel Grimmer","authors":"Marcel Grimmer, Christian Rathgeb, Raymond Veldhuis, Christoph Busch","title":"NeutrEx: A 3D Quality Component Measure on Facial Expression Neutrality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Accurate face recognition systems are increasingly important in sensitive\napplications like border control or migration management. Therefore, it becomes\ncrucial to quantify the quality of facial images to ensure that low-quality\nimages are not affecting recognition accuracy. In this context, the current\ndraft of ISO/IEC 29794-5 introduces the concept of component quality to\nestimate how single factors of variation affect recognition outcomes. In this\nstudy, we propose a quality measure (NeutrEx) based on the accumulated\ndistances of a 3D face reconstruction to a neutral expression anchor. Our\nevaluations demonstrate the superiority of our proposed method compared to\nbaseline approaches obtained by training Support Vector Machines on face\nembeddings extracted from a pre-trained Convolutional Neural Network for facial\nexpression classification. Furthermore, we highlight the explainable nature of\nour NeutrEx measures by computing per-vertex distances to unveil the most\nimpactful face regions and allow operators to give actionable feedback to\nsubjects.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:38:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Grimmer","Marcel",""],["Rathgeb","Christian",""],["Veldhuis","Raymond",""],["Busch","Christoph",""]]}
{"id":"2308.09964","submitter":"Ariel Shaulker","authors":"Shahar Dobzinski and Ariel Shaulker","title":"Bilateral Trade with Correlated Values","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the bilateral trade problem where a seller owns a single indivisible\nitem, and a potential buyer seeks to purchase it. Previous mechanisms for this\nproblem only considered the case where the values of the buyer and the seller\nare drawn from independent distributions. In this paper, we study bilateral\ntrade mechanisms when the values are drawn from a joint distribution.\n  We prove that the buyer-offering mechanism guarantees an approximation ratio\nof $\\frac e {e-1} \\approx 1.582$ to the social welfare even if the values are\ndrawn from a joint distribution. The buyer-offering mechanism is Bayesian\nincentive compatible, but the seller has a dominant strategy. We prove the\nbuyer-offering mechanism is optimal in the sense that no Bayesian mechanism\nwhere one of the players has a dominant strategy can obtain an approximation\nratio better than $\\frac e {e-1}$. We also show that no mechanism in which both\nsides have a dominant strategy can provide any constant approximation to the\nsocial welfare when the values are drawn from a joint distribution.\n  Finally, we prove some impossibility results on the power of general Bayesian\nincentive compatible mechanisms. In particular, we show that no deterministic\nBayesian incentive-compatible mechanism can provide an approximation ratio\nbetter than $1+\\frac {\\ln 2} 2\\approx 1.346$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:44:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dobzinski","Shahar",""],["Shaulker","Ariel",""]]}
{"id":"2308.09965","submitter":"Yumeng Li","authors":"Dan Zhang, Kaspar Sakmann, William Beluch, Robin Hutmacher, Yumeng Li","title":"Anomaly-Aware Semantic Segmentation via Style-Aligned OoD Augmentation","comments":"Accepted at ICCV2023 Workshop on Robustness and Reliability of\n  Autonomous Vehicles in the Open-world (BRAVO)","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":"  Within the context of autonomous driving, encountering unknown objects\nbecomes inevitable during deployment in the open world. Therefore, it is\ncrucial to equip standard semantic segmentation models with anomaly awareness.\nMany previous approaches have utilized synthetic out-of-distribution (OoD) data\naugmentation to tackle this problem. In this work, we advance the OoD synthesis\nprocess by reducing the domain gap between the OoD data and driving scenes,\neffectively mitigating the style difference that might otherwise act as an\nobvious shortcut during training. Additionally, we propose a simple fine-tuning\nloss that effectively induces a pre-trained semantic segmentation model to\ngenerate a ``none of the given classes\" prediction, leveraging per-pixel OoD\nscores for anomaly segmentation. With minimal fine-tuning effort, our pipeline\nenables the use of pre-trained models for anomaly segmentation while\nmaintaining the performance on the original task.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:45:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Dan",""],["Sakmann","Kaspar",""],["Beluch","William",""],["Hutmacher","Robin",""],["Li","Yumeng",""]]}
{"id":"2308.09966","submitter":"Hengyu Zhang","authors":"Hengyu Zhang, Chang Meng, Wei Guo, Huifeng Guo, Jieming Zhu, Guangpeng\n  Zhao, Ruiming Tang, Xiu Li","title":"Time-aligned Exposure-enhanced Model for Click-Through Rate Prediction","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Click-Through Rate (CTR) prediction, crucial in applications like recommender\nsystems and online advertising, involves ranking items based on the likelihood\nof user clicks. User behavior sequence modeling has marked progress in CTR\nprediction, which extracts users' latent interests from their historical\nbehavior sequences to facilitate accurate CTR prediction. Recent research\nexplores using implicit feedback sequences, like unclicked records, to extract\ndiverse user interests. However, these methods encounter key challenges: 1)\ntemporal misalignment due to disparate sequence time ranges and 2) the lack of\nfine-grained interaction among feedback sequences. To address these challenges,\nwe propose a novel framework called TEM4CTR, which ensures temporal alignment\namong sequences while leveraging auxiliary feedback information to enhance\nclick behavior at the item level through a representation projection mechanism.\nMoreover, this projection-based information transfer module can effectively\nalleviate the negative impact of irrelevant or even potentially detrimental\ncomponents of the auxiliary feedback information on the learning process of\nclick behavior. Comprehensive experiments on public and industrial datasets\nconfirm the superiority and effectiveness of TEM4CTR, showcasing the\nsignificance of temporal alignment in multi-feedback modeling.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:47:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Hengyu",""],["Meng","Chang",""],["Guo","Wei",""],["Guo","Huifeng",""],["Zhu","Jieming",""],["Zhao","Guangpeng",""],["Tang","Ruiming",""],["Li","Xiu",""]]}
{"id":"2308.09967","submitter":"Thanh Vu","authors":"Nguyen Cong Minh, Tran Nam Trung, and Thanh Vu","title":"Stable value of depth of symbolic powers of edge ideals of graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a simple graph on $n$ vertices. We introduce the notion of\nbipartite connectivity of $G$, denoted by $\\operatorname{bc}(G)$ and prove that\n  $$\\lim_{s \\to \\infty} \\operatorname{depth} (S/I(G)^{(s)}) \\le\n\\operatorname{bc}(G),$$\n  where $I(G)$ denotes the edge ideal of $G$ and $S = \\mathrm{k}[x_1, \\ldots,\nx_n]$ is a standard graded polynomial ring over a field $\\mathrm{k}$. We\nfurther compute the depth of symbolic powers of edge ideals of several classes\nof graphs, including odd cycles and whisker graphs of complete graphs to\nillustrate the cases where the above inequality becomes equality.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:50:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Minh","Nguyen Cong",""],["Trung","Tran Nam",""],["Vu","Thanh",""]]}
{"id":"2308.09968","submitter":"Tim Matthies","authors":"Tim Matthies, Thomas L\\\"ohden, Stephan Leible, Jun-Patrick Raabe","title":"To the Moon: Analyzing Collective Trading Events on the Wings of\n  Sentiment Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research investigates the growing trend of retail investors\nparticipating in certain stocks by organizing themselves on social media\nplatforms, particularly Reddit. Previous studies have highlighted a notable\nassociation between Reddit activity and the volatility of affected stocks. This\nstudy seeks to expand the analysis to Twitter, which is among the most\nimpactful social media platforms. To achieve this, we collected relevant tweets\nand analyzed their sentiment to explore the correlation between Twitter\nactivity, sentiment, and stock volatility. The results reveal a significant\nrelationship between Twitter activity and stock volatility but a weak link\nbetween tweet sentiment and stock performance. In general, Twitter activity and\nsentiment appear to play a less critical role in these events than Reddit\nactivity. These findings offer new theoretical insights into the impact of\nsocial media platforms on stock market dynamics, and they may practically\nassist investors and regulators in comprehending these phenomena better.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:54:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Matthies","Tim",""],["L\u00f6hden","Thomas",""],["Leible","Stephan",""],["Raabe","Jun-Patrick",""]]}
{"id":"2308.09969","submitter":"Zhao Tian","authors":"Zhao Tian, Junjie Chen, Xiangyu Zhang","title":"On-the-fly Improving Performance of Deep Code Models via Input Denoising","comments":"Accepted by ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning has been widely adopted to tackle various code-based tasks by\nbuilding deep code models based on a large amount of code snippets. While these\ndeep code models have achieved great success, even state-of-the-art models\nsuffer from noise present in inputs leading to erroneous predictions. While it\nis possible to enhance models through retraining/fine-tuning, this is not a\nonce-and-for-all approach and incurs significant overhead. In particular, these\ntechniques cannot on-the-fly improve performance of (deployed) models. There\nare currently some techniques for input denoising in other domains (such as\nimage processing), but since code input is discrete and must strictly abide by\ncomplex syntactic and semantic constraints, input denoising techniques in other\nfields are almost not applicable. In this work, we propose the first input\ndenoising technique (i.e., CodeDenoise) for deep code models. Its key idea is\nto localize noisy identifiers in (likely) mispredicted inputs, and denoise such\ninputs by cleansing the located identifiers. It does not need to retrain or\nreconstruct the model, but only needs to cleanse inputs on-the-fly to improve\nperformance. Our experiments on 18 deep code models (i.e., three pre-trained\nmodels with six code-based datasets) demonstrate the effectiveness and\nefficiency of CodeDenoise. For example, on average, CodeDenoise successfully\ndenoises 21.91% of mispredicted inputs and improves the original models by\n2.04% in terms of the model accuracy across all the subjects in an average of\n0.48 second spent on each input, substantially outperforming the widely-used\nfine-tuning strategy.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:55:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tian","Zhao",""],["Chen","Junjie",""],["Zhang","Xiangyu",""]]}
{"id":"2308.09970","submitter":"Diji Yang","authors":"Diji Yang, Kezhen Chen, Jinmeng Rao, Xiaoyuan Guo, Yawen Zhang, Jie\n  Yang, Yi Zhang","title":"Tackling Vision Language Tasks Through Learning Inner Monologues","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":"  Visual language tasks require AI models to comprehend and reason with both\nvisual and textual content. Driven by the power of Large Language Models\n(LLMs), two prominent methods have emerged: (1) the hybrid integration between\nLLMs and Vision-Language Models (VLMs), where visual inputs are firstly\nconverted into language descriptions by VLMs, serving as inputs for LLMs to\ngenerate final answer(s); (2) visual feature alignment in language space, where\nvisual inputs are encoded as embeddings and projected to LLMs' language space\nvia further supervised fine-tuning. The first approach provides light training\ncosts and interpretability but is hard to be optimized in an end-to-end\nfashion. The second approach presents decent performance, but feature alignment\nusually requires large amounts of training data and lacks interpretability. To\ntackle this dilemma, we propose a novel approach, Inner Monologue Multi-Modal\nOptimization (IMMO), to solve complex vision language problems by simulating\ninner monologue processes, a cognitive process in which an individual engages\nin silent verbal communication with themselves. We enable LLMs and VLMs to\ninteract through natural language conversation and propose to use a two-stage\ntraining process to learn how to do the inner monologue (self-asking questions\nand answering questions). IMMO is evaluated on two popular tasks and the\nresults suggest by emulating the cognitive phenomenon of internal dialogue, our\napproach can enhance reasoning and explanation abilities, contributing to the\nmore effective fusion of vision and language models. More importantly, instead\nof using predefined human-crafted monologues, IMMO learns this process within\nthe deep learning models, promising wider applicability to many different AI\nproblems beyond vision language tasks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:10:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Diji",""],["Chen","Kezhen",""],["Rao","Jinmeng",""],["Guo","Xiaoyuan",""],["Zhang","Yawen",""],["Yang","Jie",""],["Zhang","Yi",""]]}
{"id":"2308.09971","submitter":"Seunghee Koh","authors":"Seunghee Koh, Hyounguk Shon, Janghyeon Lee, Hyeong Gwon Hong, Junmo\n  Kim","title":"Disposable Transfer Learning for Selective Source Task Unlearning","comments":"Accepted to ICCV 2023","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":"  Transfer learning is widely used for training deep neural networks (DNN) for\nbuilding a powerful representation. Even after the pre-trained model is adapted\nfor the target task, the representation performance of the feature extractor is\nretained to some extent. As the performance of the pre-trained model can be\nconsidered the private property of the owner, it is natural to seek the\nexclusive right of the generalized performance of the pre-trained weight. To\naddress this issue, we suggest a new paradigm of transfer learning called\ndisposable transfer learning (DTL), which disposes of only the source task\nwithout degrading the performance of the target task. To achieve knowledge\ndisposal, we propose a novel loss named Gradient Collision loss (GC loss). GC\nloss selectively unlearns the source knowledge by leading the gradient vectors\nof mini-batches in different directions. Whether the model successfully\nunlearns the source task is measured by piggyback learning accuracy (PL\naccuracy). PL accuracy estimates the vulnerability of knowledge leakage by\nretraining the scrubbed model on a subset of source data or new downstream\ndata. We demonstrate that GC loss is an effective approach to the DTL problem\nby showing that the model trained with GC loss retains the performance on the\ntarget task with a significantly reduced PL accuracy.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:13:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Koh","Seunghee",""],["Shon","Hyounguk",""],["Lee","Janghyeon",""],["Hong","Hyeong Gwon",""],["Kim","Junmo",""]]}
{"id":"2308.09972","submitter":"Li Niu","authors":"Qingyang Liu, Jianting Wang, Li Niu","title":"DESOBAv2: Towards Large-scale Real-world Dataset for Shadow Generation","comments":"arXiv admin note: text overlap with arXiv:2306.17358","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image composition refers to inserting a foreground object into a background\nimage to obtain a composite image. In this work, we focus on generating\nplausible shadow for the inserted foreground object to make the composite image\nmore realistic. To supplement the existing small-scale dataset DESOBA, we\ncreate a large-scale dataset called DESOBAv2 by using object-shadow detection\nand inpainting techniques. Specifically, we collect a large number of outdoor\nscene images with object-shadow pairs. Then, we use pretrained inpainting model\nto inpaint the shadow region, resulting in the deshadowed images. Based on real\nimages and deshadowed images, we can construct pairs of synthetic composite\nimages and ground-truth target images. Dataset is available at\nhttps://github.com/bcmi/Object-Shadow-Generation-Dataset-DESOBAv2.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:21:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Qingyang",""],["Wang","Jianting",""],["Niu","Li",""]]}
{"id":"2308.09973","submitter":"Radhika Gupta","authors":"Radhika Gupta","title":"Combinatorial isoperimetric inequality for the free factor complex","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the free factor complex of the free group of rank at least 3\ndoes not satisfy a combinatorial isoperimetric inequality: that is, for every N\ngreater than or equal to 3, there is a loop of length 4 in the free factor\ncomplex that only bounds discs containing at least O(N) triangles. To prove the\nresult, we construct a coarsely Lipschitz function from the `upward link' of a\nfree factor to the set of integers.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:24:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gupta","Radhika",""]]}
{"id":"2308.09974","submitter":"Jose Luis Flores","authors":"Ivan P. Costa e Silva, Jos\\'e L. Flores, Benjam\\'in Olea","title":"On the existence of sections with constant surface gravity on null\n  hypersurfaces","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We identify, in spacetimes satisfying the null convergence condition, a\ncertain natural class of null hypersurfaces that admit null sections with\nconstant surface gravity. Our work is meant to offer complementary results to\nprevious work on null hypersurfaces of zero expansion arising from the study of\nCauchy and black hole horizons in general relativity.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:37:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Silva","Ivan P. Costa e",""],["Flores","Jos\u00e9 L.",""],["Olea","Benjam\u00edn",""]]}
{"id":"2308.09975","submitter":"Liwen Zhang","authors":"Liwen Zhang, Weige Cai, Zhaowei Liu, Zhi Yang, Wei Dai, Yujie Liao,\n  Qianru Qin, Yifei Li, Xingyu Liu, Zhiqiang Liu, Zhoufan Zhu, Anbo Wu, Xin Guo\n  and Yun Chen","title":"FinEval: A Chinese Financial Domain Knowledge Evaluation Benchmark for\n  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":"  Large language models (LLMs) have demonstrated exceptional performance in\nvarious natural language processing tasks, yet their efficacy in more\nchallenging and domain-specific tasks remains largely unexplored. This paper\npresents FinEval, a benchmark specifically designed for the financial domain\nknowledge in the LLMs. FinEval is a collection of high-quality multiple-choice\nquestions covering Finance, Economy, Accounting, and Certificate. It includes\n4,661 questions spanning 34 different academic subjects. To ensure a\ncomprehensive model performance evaluation, FinEval employs a range of prompt\ntypes, including zero-shot and few-shot prompts, as well as answer-only and\nchain-of-thought prompts. Evaluating state-of-the-art Chinese and English LLMs\non FinEval, the results show that only GPT-4 achieved an accuracy close to 70%\nin different prompt settings, indicating significant growth potential for LLMs\nin the financial domain knowledge. Our work offers a more comprehensive\nfinancial knowledge evaluation benchmark, utilizing data of mock exams and\ncovering a wide range of evaluated LLMs.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:38:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Liwen",""],["Cai","Weige",""],["Liu","Zhaowei",""],["Yang","Zhi",""],["Dai","Wei",""],["Liao","Yujie",""],["Qin","Qianru",""],["Li","Yifei",""],["Liu","Xingyu",""],["Liu","Zhiqiang",""],["Zhu","Zhoufan",""],["Wu","Anbo",""],["Guo","Xin",""],["Chen","Yun",""]]}
{"id":"2308.09976","submitter":"Jingya Zhou","authors":"Xigang Sun, Jingya Zhou, Ling Liu, Wenqi Wei","title":"Explicit Time Embedding Based Cascade Attention Network for Information\n  Popularity Prediction","comments":null,"journal-ref":"Inf. Process. Manag. 60(3): 103278 (2023)","doi":"10.1016/j.ipm.2023.103278","report-no":null,"categories":"cs.SI cs.AI cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Predicting information cascade popularity is a fundamental problem in social\nnetworks. Capturing temporal attributes and cascade role information (e.g.,\ncascade graphs and cascade sequences) is necessary for understanding the\ninformation cascade. Current methods rarely focus on unifying this information\nfor popularity predictions, which prevents them from effectively modeling the\nfull properties of cascades to achieve satisfactory prediction performances. In\nthis paper, we propose an explicit Time embedding based Cascade Attention\nNetwork (TCAN) as a novel popularity prediction architecture for large-scale\ninformation networks. TCAN integrates temporal attributes (i.e., periodicity,\nlinearity, and non-linear scaling) into node features via a general time\nembedding approach (TE), and then employs a cascade graph attention encoder\n(CGAT) and a cascade sequence attention encoder (CSAT) to fully learn the\nrepresentation of cascade graphs and cascade sequences. We use two real-world\ndatasets (i.e., Weibo and APS) with tens of thousands of cascade samples to\nvalidate our methods. Experimental results show that TCAN obtains mean\nlogarithm squared errors of 2.007 and 1.201 and running times of 1.76 hours and\n0.15 hours on both datasets, respectively. Furthermore, TCAN outperforms other\nrepresentative baselines by 10.4%, 3.8%, and 10.4% in terms of MSLE, MAE, and\nR-squared on average while maintaining good interpretability.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:43:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Xigang",""],["Zhou","Jingya",""],["Liu","Ling",""],["Wei","Wenqi",""]]}
{"id":"2308.09977","submitter":"FuLong Ye","authors":"Fulong Ye, Yuxing Long, Fangxiang Feng, Xiaojie Wang","title":"Whether you can locate or not? Interactive Referring Expression\n  Generation","comments":"10 papges, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Referring Expression Generation (REG) aims to generate unambiguous Referring\nExpressions (REs) for objects in a visual scene, with a dual task of Referring\nExpression Comprehension (REC) to locate the referred object. Existing methods\nconstruct REG models independently by using only the REs as ground truth for\nmodel training, without considering the potential interaction between REG and\nREC models. In this paper, we propose an Interactive REG (IREG) model that can\ninteract with a real REC model, utilizing signals indicating whether the object\nis located and the visual region located by the REC model to gradually modify\nREs. Our experimental results on three RE benchmark datasets, RefCOCO,\nRefCOCO+, and RefCOCOg show that IREG outperforms previous state-of-the-art\nmethods on popular evaluation metrics. Furthermore, a human evaluation shows\nthat IREG generates better REs with the capability of interaction.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:53:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ye","Fulong",""],["Long","Yuxing",""],["Feng","Fangxiang",""],["Wang","Xiaojie",""]]}
{"id":"2308.09978","submitter":"Zhiyuan Wan","authors":"Zhiyuan Wan, Yun Zhang, Xin Xia, Yi Jiang, David Lo","title":"Software Architecture in Practice: Challenges and Opportunities","comments":"Preprint of Full Research Paper, the 31st ACM Joint European Software\n  Engineering Conference and Symposium on the Foundations of Software\n  Engineering (ESEC/FSE '23)","journal-ref":null,"doi":"10.1145/3611643.3616367","report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software architecture has been an active research field for nearly four\ndecades, in which previous studies make significant progress such as creating\nmethods and techniques and building tools to support software architecture\npractice. Despite past efforts, we have little understanding of how\npractitioners perform software architecture related activities, and what\nchallenges they face. Through interviews with 32 practitioners from 21\norganizations across three continents, we identified challenges that\npractitioners face in software architecture practice during software\ndevelopment and maintenance. We reported on common software architecture\nactivities at software requirements, design, construction and testing, and\nmaintenance stages, as well as corresponding challenges. Our study uncovers\nthat most of these challenges center around management, documentation, tooling\nand process, and collects recommendations to address these challenges.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:58:47 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 03:01:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wan","Zhiyuan",""],["Zhang","Yun",""],["Xia","Xin",""],["Jiang","Yi",""],["Lo","David",""]]}
{"id":"2308.09979","submitter":"Teresa Scantamburlo","authors":"Teresa Scantamburlo, Atia Cort\\'es, Francesca Foffano, Cristian\n  Barru\\'e, Veronica Distefano, Long Pham, Alessandro Fabris","title":"Artificial Intelligence across Europe: A Study on Awareness, Attitude\n  and Trust","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents the results of an extensive study investigating the\nopinions on Artificial Intelligence (AI) of a sample of 4,006 European citizens\nfrom eight distinct countries (France, Germany, Italy, Netherlands, Poland,\nRomania, Spain, and Sweden). The aim of the study is to gain a better\nunderstanding of people's views and perceptions within the European context,\nwhich is already marked by important policy actions and regulatory processes.\nTo survey the perceptions of the citizens of Europe we design and validate a\nnew questionnaire (PAICE) structured around three dimensions: people's\nawareness, attitude, and trust. We observe that while awareness is\ncharacterized by a low level of self-assessed competency, the attitude toward\nAI is very positive for more than half of the population. Reflecting upon the\ncollected results, we highlight implicit contradictions and identify trends\nthat may interfere with the creation of an ecosystem of trust and the\ndevelopment of inclusive AI policies. The introduction of rules that ensure\nlegal and ethical standards, along with the activity of high-level educational\nentities, and the promotion of AI literacy are identified as key factors in\nsupporting a trustworthy AI ecosystem. We make some recommendations for AI\ngovernance focused on the European context and conclude with suggestions for\nfuture work.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:00:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Scantamburlo","Teresa",""],["Cort\u00e9s","Atia",""],["Foffano","Francesca",""],["Barru\u00e9","Cristian",""],["Distefano","Veronica",""],["Pham","Long",""],["Fabris","Alessandro",""]]}
{"id":"2308.09980","submitter":"Hongyu Hu","authors":"Yunwen Huang, Hongyu Hu, Ying Zhu, Yi Xu","title":"Breast Lesion Diagnosis Using Static Images and Dynamic Video","comments":"Accepted by ISBI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning based Computer Aided Diagnosis (CAD) systems have been\ndeveloped to treat breast ultrasound. Most of them focus on a single ultrasound\nimaging modality, either using representative static images or the dynamic\nvideo of a real-time scan. In fact, these two image modalities are\ncomplementary for lesion diagnosis. Dynamic videos provide detailed\nthree-dimensional information about the lesion, while static images capture the\ntypical sections of the lesion. In this work, we propose a multi-modality\nbreast tumor diagnosis model to imitate the diagnosing process of radiologists,\nwhich learns the features of both static images and dynamic video and explores\nthe potential relationship between the two modalities. Considering that static\nimages are carefully selected by professional radiologists, we propose to\naggregate dynamic video features under the guidance of domain knowledge from\nstatic images before fusing multi-modality features. Our work is validated on a\nbreast ultrasound dataset composed of 897 sets of ultrasound images and videos.\nExperimental results show that our model boosts the performance of\nBenign/Malignant classification, achieving 90.0% in AUC and 81.7% in accuracy.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:09:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Yunwen",""],["Hu","Hongyu",""],["Zhu","Ying",""],["Xu","Yi",""]]}
{"id":"2308.09981","submitter":"Sunil Kumar Prajapati","authors":"Ram Karan Choudhary and Sunil Kumar Prajapati","title":"Rational Representations and Rational Group Algebra of VZ p-groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we study rational matrix representations of VZ $p$-groups\n($p$ is any prime). Utilizing our findings on VZ $p$-groups, we explicitly\nobtain all inequivalent irreducible rational matrix representations of all\n$p$-groups of order $\\leq p^4$. Furthermore, we establish combinatorial\nformulas to determine the Wedderburn decompositions of rational group algebras\nfor VZ $p$-groups and all $p$-groups of order $\\leq p^4$, ensuring simplicity\nin the process.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:14:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Choudhary","Ram Karan",""],["Prajapati","Sunil Kumar",""]]}
{"id":"2308.09982","submitter":"Xin Zhang","authors":"Jincheng Tang and Xin Zhang","title":"Super approximation for $\\text{SL}_2(\\mathbb Z/q\\mathbb Z)\\times\n  \\text{SL}_2(\\mathbb Z/q\\mathbb Z)$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO math.DS math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $S\\subset \\text{SL}_2(\\mathbb Z)\\times \\text{SL}_2(\\mathbb Z)$ be finite\nsymmetric and assume $S$ generates a group $G$ which is Zariski-dense in\n$\\text{SL}_2\\times \\text{SL}_2$. We prove that the Cayley graphs $$\\{\\mathcal\nCay(G (\\text{mod }q), S (\\text{mod }q))\\}_{q\\in \\mathbb Z_+}$$ form a family of\nexpanders.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:24:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tang","Jincheng",""],["Zhang","Xin",""]]}
{"id":"2308.09983","submitter":"Yichen Zhang","authors":"Yichen Zhang, Yifang Yin, Ying Zhang, Zhenguang Liu, Zheng Wang, Roger\n  Zimmermann","title":"Prototypical Cross-domain Knowledge Transfer for Cervical Dysplasia\n  Visual Inspection","comments":"accepted in ACM Multimedia 2023","journal-ref":null,"doi":"10.1145/3581783.3612000","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Early detection of dysplasia of the cervix is critical for cervical cancer\ntreatment. However, automatic cervical dysplasia diagnosis via visual\ninspection, which is more appropriate in low-resource settings, remains a\nchallenging problem. Though promising results have been obtained by recent deep\nlearning models, their performance is significantly hindered by the limited\nscale of the available cervix datasets. Distinct from previous methods that\nlearn from a single dataset, we propose to leverage cross-domain cervical\nimages that were collected in different but related clinical studies to improve\nthe model's performance on the targeted cervix dataset. To robustly learn the\ntransferable information across datasets, we propose a novel prototype-based\nknowledge filtering method to estimate the transferability of cross-domain\nsamples. We further optimize the shared feature space by aligning the\ncross-domain image representations simultaneously on domain level with early\nalignment and class level with supervised contrastive learning, which endows\nmodel training and knowledge transfer with stronger robustness. The empirical\nresults on three real-world benchmark cervical image datasets show that our\nproposed method outperforms the state-of-the-art cervical dysplasia visual\ninspection by an absolute improvement of 4.7% in top-1 accuracy, 7.0% in\nprecision, 1.4% in recall, 4.6% in F1 score, and 0.05 in ROC-AUC.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:25:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yichen",""],["Yin","Yifang",""],["Zhang","Ying",""],["Liu","Zhenguang",""],["Wang","Zheng",""],["Zimmermann","Roger",""]]}
{"id":"2308.09984","submitter":"Jerome Sauer","authors":"Jerome Sauer, Francesco Ragone, Fran\\c{c}ois Massonnet, Giuseppe Zappa\n  and Jonathan Demaeyer","title":"Rare event algorithm study of extremes of summer Arctic sea ice\n  reduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Various studies have identified possible drivers of extremes of Arctic sea\nice reduction, such as observed in the summers of 2007 and 2012, including\npreconditioning, local feedback mechanisms and the oceanic and atmospheric\ncirculations. However, a quantitative statistical analysis of extremes of\nArctic sea ice reduction is hindered by the small number of events that can be\nsampled in observations and numerical simulations with computationally\nexpensive climate models. Recently, studies tackled this problem by using rare\nevent algorithms, computational techniques developed in statistical physics to\nreduce the computational cost required to sample rare events in numerical\nsimulations. In this work, we apply a rare event algorithm to ensemble\nsimulations with the intermediate complexity coupled climate model PlaSim to\ninvestigate extreme negative summer pan-Arctic sea ice area anomalies under\npre-industrial greenhouse gas conditions. Owing to the algorithm, we estimate\nreturn times of extremes orders of magnitude larger than feasbile with direct\nsampling, and we compute statistically significant composite maps of dynamical\nquantities conditional on the occurrence of the extremes. We find that\nextremely low sea ice summers in PlaSim are associated with preconditioning\nthrough the winter sea ice-ocean state, with enhanced downward longwave\nradiation due to an anomalously moist and warm Arctic atmosphere in spring and\nwith enhanced downward sensible heat fluxes during the spring-summer\ntransition. As a consequence of these three processes, the sea ice-albedo\nfeedback becomes active in spring and leads to an amplification of pre-existing\nsea ice area anomalies during summer.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:31:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sauer","Jerome",""],["Ragone","Francesco",""],["Massonnet","Fran\u00e7ois",""],["Zappa","Giuseppe",""],["Demaeyer","Jonathan",""]]}
{"id":"2308.09985","submitter":"Hanzhuo Tan","authors":"Hanzhuo Tan, Chunpu Xu, Jing Li, Yuqun Zhang, Zeyang Fang, Zeyu Chen,\n  Baohua Lai","title":"HICL: Hashtag-Driven In-Context Learning for Social Media Natural\n  Language Understanding","comments":"https://github.com/albertan017/HICL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Natural language understanding (NLU) is integral to various social media\napplications. However, existing NLU models rely heavily on context for semantic\nlearning, resulting in compromised performance when faced with short and noisy\nsocial media content. To address this issue, we leverage in-context learning\n(ICL), wherein language models learn to make inferences by conditioning on a\nhandful of demonstrations to enrich the context and propose a novel\nhashtag-driven in-context learning (HICL) framework. Concretely, we pre-train a\nmodel #Encoder, which employs #hashtags (user-annotated topic labels) to drive\nBERT-based pre-training through contrastive learning. Our objective here is to\nenable #Encoder to gain the ability to incorporate topic-related semantic\ninformation, which allows it to retrieve topic-related posts to enrich contexts\nand enhance social media NLU with noisy contexts. To further integrate the\nretrieved context with the source text, we employ a gradient-based method to\nidentify trigger terms useful in fusing information from both sources. For\nempirical studies, we collected 45M tweets to set up an in-context NLU\nbenchmark, and the experimental results on seven downstream tasks show that\nHICL substantially advances the previous state-of-the-art results. Furthermore,\nwe conducted extensive analyzes and found that: (1) combining source input with\na top-retrieved post from #Encoder is more effective than using semantically\nsimilar posts; (2) trigger words can largely benefit in merging context from\nthe source and retrieved posts.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:31:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tan","Hanzhuo",""],["Xu","Chunpu",""],["Li","Jing",""],["Zhang","Yuqun",""],["Fang","Zeyang",""],["Chen","Zeyu",""],["Lai","Baohua",""]]}
{"id":"2308.09986","submitter":"Piotr Niemiec","authors":"Piotr Niemiec","title":"Extensive approach to absolute homogeneity","comments":"70 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main aim of the paper is to study in greater detail absolutely\nhomogeneous structures (that is, objects with the property that each partial\nisomorphism extends to a global automorphism), with special emphasis on metric\nspaces and (possibly infinite, full) graphs with edge-coloring. Besides, a\ngeneral categorical approach to this concept is presented. The main achievement\nof the paper is the discovery of one-to-one correspondence between absolutely\nhomogeneous objects and certain classes (that become sets when isomorphic\nobjects are identified) of \"finite\" objects that satisfy a few quite general\naxioms (such as amalgamation and heredity). It is also introduced and discussed\nin detail the concept of products for graphs with edge-coloring (that produces\nan absolutely homogeneous graph provided all factors are so). Among the most\nsignificant results of the paper, it is worth mentioning a full classification\n(up to isometry) of all absolutely homogeneous ultrametric spaces as well as of\nall absolutely homogeneous graphs with edge-coloring in which all triangles are\nisosceles or in which all triangles are (precisely) tricolored.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:34:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Niemiec","Piotr",""]]}
{"id":"2308.09987","submitter":"Lin Shao","authors":"Bingyang Zhou, Haoyu Zhou, Tianhai Liang, Qiaojun Yu, Siheng Zhao,\n  Yuwei Zeng, Jun Lv, Siyuan Luo, Qiancai Wang, Xinyuan Yu, Haonan Chen, Cewu\n  Lu, and Lin Shao","title":"ClothesNet: An Information-Rich 3D Garment Model Repository with\n  Simulated Clothes Environment","comments":"IEEE/CVF International Conference on Computer Vision (ICCV) 2023","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":"  We present ClothesNet: a large-scale dataset of 3D clothes objects with\ninformation-rich annotations. Our dataset consists of around 4400 models\ncovering 11 categories annotated with clothes features, boundary lines, and\nkeypoints. ClothesNet can be used to facilitate a variety of computer vision\nand robot interaction tasks. Using our dataset, we establish benchmark tasks\nfor clothes perception, including classification, boundary line segmentation,\nand keypoint detection, and develop simulated clothes environments for robotic\ninteraction tasks, including rearranging, folding, hanging, and dressing. We\nalso demonstrate the efficacy of our ClothesNet in real-world experiments.\nSupplemental materials and dataset are available on our project webpage.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:34:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Bingyang",""],["Zhou","Haoyu",""],["Liang","Tianhai",""],["Yu","Qiaojun",""],["Zhao","Siheng",""],["Zeng","Yuwei",""],["Lv","Jun",""],["Luo","Siyuan",""],["Wang","Qiancai",""],["Yu","Xinyuan",""],["Chen","Haonan",""],["Lu","Cewu",""],["Shao","Lin",""]]}
{"id":"2308.09988","submitter":"Du\\v{s}an D. Repov\\v{s}","authors":"Shujie Bai, Yueqiang Song, Du\\v{s}an D. Repov\\v{s}","title":"On $p$-Laplacian Kirchhoff-Schr\\\"{o}dinger-Poisson type systems with\n  critical growth on the Heisenberg group","comments":null,"journal-ref":"Electron. Res. Arch. 31:9 (2023), 5749-5765","doi":"10.3934/era.2023292","report-no":null,"categories":"math.AP math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we investigate the Kirchhoff-Schr\\\"{o}dinger-Poisson type\nsystems on the Heisenberg group of the following form: \\begin{equation*}\n\\left\\{ \\begin{array}{lll} {-(a+b\\int_{\\Omega}|\\nabla_{H}\nu|^{p}d\\xi)\\Delta_{H,p}u-\\mu\\phi |u|^{p-2}u}=\\lambda\n|u|^{q-2}u+|u|^{Q^{\\ast}-2}u &\\mbox{in}\\ \\Omega, \\\\ -\\Delta_{H}\\phi=|u|^{p}\n&\\mbox{in}\\ \\Omega, \\\\ u=\\phi=0 &\\mbox{on}\\ \\partial\\Omega, \\end{array} \\right.\n\\end{equation*} where $a,b$ are positive real numbers, $\\Omega\\subset\n\\mathbb{H}^N$ is a bounded region with smooth boundary, $1<p<Q$, $Q = 2N + 2$\nis the homogeneous dimension of the Heisenberg group $\\mathbb{H}^N$,\n$Q^{\\ast}=\\frac{pQ}{Q-p}$, $q\\in(2p, Q^{\\ast})$, and\n$\\Delta_{H,p}u=\\mbox{div}(|\\nabla_{H} u|^{p-2}\\nabla_{H} u)$ is the\n$p$-horizontal Laplacian. Under some appropriate conditions for the parameters\n$\\mu$ and $\\lambda$, we establish existence and multiplicity results for the\nsystem above. To some extent, we generalize the results of An and Liu (Israel\nJ. Math., 2020) and Liu et al. (Adv. Nonlinear Anal., 2022).\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:35:32 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bai","Shujie",""],["Song","Yueqiang",""],["Repov\u0161","Du\u0161an D.",""]]}
{"id":"2308.09989","submitter":"Pierre Touchard","authors":"Martin Hils, Martina Liccardo and Pierre Touchard","title":"Stably Embedded Pairs of Ordered Abelian Groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate when an ordered abelian group $G$ is stably embedded in a\ngiven elementary extension $H$. We focus on a large class of ordered groups\nwhich includes maximal ordered groups with interpretable archimedean valuation.\nWe give a complete answer for groups in this class which takes the form of a\ntransfer principle for valued groups. It follows in particular that all types\nin the lexicographic product $\\prod_{i\\in \\omega} \\mathbb{Z}$ are definable.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:38:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hils","Martin",""],["Liccardo","Martina",""],["Touchard","Pierre",""]]}
{"id":"2308.09990","submitter":"Zhenlong Yuan","authors":"Zhenlong Yuan, Jiakai Cao, Hao Jiang, Zhaoqi Wang and Zhaoxin Li","title":"TSAR-MVS: Textureless-aware Segmentation and Correlative Refinement\n  Guided Multi-View Stereo","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The reconstruction of textureless areas has long been a challenging problem\nin MVS due to lack of reliable pixel correspondences between images. In this\npaper, we propose the Textureless-aware Segmentation And Correlative Refinement\nguided Multi-View Stereo (TSAR-MVS), a novel method that effectively tackles\nchallenges posed by textureless areas in 3D reconstruction through filtering,\nrefinement and segmentation. First, we implement joint hypothesis filtering, a\ntechnique that merges a confidence estimator with a disparity discontinuity\ndetector to eliminate incorrect depth estimations. Second, to spread the pixels\nwith confident depth, we introduce a iterative correlation refinement strategy\nthat leverages RANSAC to generate superpixels, succeeded by a median filter for\nbroadening the influence of accurately determined pixels.Finally, we present a\ntextureless-aware segmentation method that leverages edge detection and line\ndetection for accurately identify large textureless regions to be fitted using\n3D planes. Experiments on extensive datasets demonstrate that our method\nsignificantly outperforms most non-learning methods and exhibits robustness to\ntextureless areas while preserving fine details.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:40:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yuan","Zhenlong",""],["Cao","Jiakai",""],["Jiang","Hao",""],["Wang","Zhaoqi",""],["Li","Zhaoxin",""]]}
{"id":"2308.09991","submitter":"FuLong Ye","authors":"Fulong Ye, Guang Liu, Xinya Wu, Ledell Wu","title":"AltDiffusion: A Multilingual Text-to-Image Diffusion Model","comments":"15 pages; 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Text-to-Image(T2I) diffusion models have shown a remarkable capability\nto produce photorealistic and diverse images based on text inputs. However,\nexisting works only support limited language input, e.g., English, Chinese, and\nJapanese, leaving users beyond these languages underserved and blocking the\nglobal expansion of T2I models. Therefore, this paper presents AltDiffusion, a\nnovel multilingual T2I diffusion model that supports eighteen different\nlanguages. Specifically, we first train a multilingual text encoder based on\nthe knowledge distillation. Then we plug it into a pretrained English-only\ndiffusion model and train the model with a two-stage schema to enhance the\nmultilingual capability, including concept alignment and quality improvement\nstage on a large-scale multilingual dataset. Furthermore, we introduce a new\nbenchmark, which includes Multilingual-General-18(MG-18) and\nMultilingual-Cultural-18(MC-18) datasets, to evaluate the capabilities of T2I\ndiffusion models for generating high-quality images and capturing\nculture-specific concepts in different languages. Experimental results on both\nMG-18 and MC-18 demonstrate that AltDiffusion outperforms current\nstate-of-the-art T2I models, e.g., Stable Diffusion in multilingual\nunderstanding, especially with respect to culture-specific concepts, while\nstill having comparable capability for generating high-quality images. All\nsource code and checkpoints could be found in\nhttps://github.com/superhero-7/AltDiffuson.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:52:12 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 05:19:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ye","Fulong",""],["Liu","Guang",""],["Wu","Xinya",""],["Wu","Ledell",""]]}
{"id":"2308.09992","submitter":"Solenn Riedel","authors":"Solenn Riedel, Ludwig A. Hoffmann, Luca Giomi and Daniela J. Kraft","title":"Designing highly efficient lock-and-key interactions in anisotropic\n  active particles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cluster formation of microscopic swimmers is key to the formation of biofilms\nand colonies, efficient motion and nutrient uptake, but, in the absence of\nother interactions, requires high swimmer concentrations to occur. Here we\nexperimentally and numerically show that cluster formation can be dramatically\nenhanced by an anisotropic swimmer shape. We analyze a class of model\nmicroswimmers with a shape that can be continuously tuned from spherical to\nbent and straight rods. In all cases, clustering can be described by\nMichaelis-Menten kinetics governed by a single scaling parameter that depends\non particle density and shape only. We rationalize these shape-dependent\ndynamics from the interplay between interlocking probability and cluster\nstability. The bent rod shape promotes assembly even at vanishingly low\nparticle densities and we identify the most efficient shape to be a semicircle.\nOur work provides key insights into how shape can be used to rationally design\nout-of-equilibrium self-organization, key to creating active functional\nmaterials and designing targeted two-component drug delivery.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:53:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Riedel","Solenn",""],["Hoffmann","Ludwig A.",""],["Giomi","Luca",""],["Kraft","Daniela J.",""]]}
{"id":"2308.09993","submitter":"Hongwei Ren","authors":"Hongwei Ren, Yue Zhou, Haotian Fu, Yulong Huang, Renjing Xu, Bojun\n  Cheng","title":"TTPOINT: A Tensorized Point Cloud Network for Lightweight Action\n  Recognition with Event Cameras","comments":null,"journal-ref":null,"doi":"10.1145/3581783.3612258","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Event cameras have gained popularity in computer vision due to their data\nsparsity, high dynamic range, and low latency. As a bio-inspired sensor, event\ncameras generate sparse and asynchronous data, which is inherently incompatible\nwith the traditional frame-based method. Alternatively, the point-based method\ncan avoid additional modality transformation and naturally adapt to the\nsparsity of events. Still, it typically cannot reach a comparable accuracy as\nthe frame-based method. We propose a lightweight and generalized point cloud\nnetwork called TTPOINT which achieves competitive results even compared to the\nstate-of-the-art (SOTA) frame-based method in action recognition tasks while\nonly using 1.5 % of the computational resources. The model is adept at\nabstracting local and global geometry by hierarchy structure. By leveraging\ntensor-train compressed feature extractors, TTPOINT can be designed with\nminimal parameters and computational complexity. Additionally, we developed a\nstraightforward downsampling algorithm to maintain the spatio-temporal feature.\nIn the experiment, TTPOINT emerged as the SOTA method on three datasets while\nalso attaining SOTA among point cloud methods on all five datasets. Moreover,\nby using the tensor-train decomposition method, the accuracy of the proposed\nTTPOINT is almost unaffected while compressing the parameter size by 55 % in\nall five datasets.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:58:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ren","Hongwei",""],["Zhou","Yue",""],["Fu","Haotian",""],["Huang","Yulong",""],["Xu","Renjing",""],["Cheng","Bojun",""]]}
{"id":"2308.09994","submitter":"Haoyuan Ma","authors":"Haoyuan Ma","title":"The extension of Weyl-type relative perturbation bounds","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend several relative perturbation bounds to Hermitian matrices that are\npossibly singular, and also develop a general class of relative bounds for\nHermitian matrices. As a result, corresponding relative bounds for singular\nvalues of rank-deficient $m\\times n$ matrices are also obtained using the\nJordan-Wielandt matrices. We also present that the main relative bound derived\nwould be invariant with respect to congruence transformation under certain\nconditions, and compare its sharpness with the Weyl's absolute perturbation\nbound.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:09:21 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 10:16:39 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 15:06:45 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Ma","Haoyuan",""]]}
{"id":"2308.09995","submitter":"Igor A Golovchanskiy","authors":"Dmitrii S. Kalashnikov, Vsevolod I. Ruzhitskiy, Andrey G. Shishkin,\n  Igor A. Golovchanskiy, Mikhail Yu. Kupriyanov, Igor I. Soloviev, Dimitri\n  Roditchev, and Vasily S. Stolyarov","title":"Josephson vortex-based memory","comments":"12 pages, 4 figures, 72 reference","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Josephson junctions are currently used as base elements of superconducting\nlogic systems. Long enough junctions subject to magnetic field host quantum\nphase 2{\\pi}-singularities - Josephson vortices. Here we report the realization\nof the superconducting memory whose state is encoded by the number of present\nJosephson vortices. By integrating the junction into a coplanar resonator and\nby applying a microwave excitation well below the critical current, we were\nable to control the state of the memory in an energy-efficent and\nnon-destructive manner. The performance of the device is evaluated, and the\nroutes for creating scalable cryogenic memories directly compatible with\nsuperconducting microwave technologies are discussed.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:11:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kalashnikov","Dmitrii S.",""],["Ruzhitskiy","Vsevolod I.",""],["Shishkin","Andrey G.",""],["Golovchanskiy","Igor A.",""],["Kupriyanov","Mikhail Yu.",""],["Soloviev","Igor I.",""],["Roditchev","Dimitri",""],["Stolyarov","Vasily S.",""]]}
{"id":"2308.09996","submitter":"Kamalesh Saha","authors":"Kamalesh Saha","title":"The $\\mathrm{v}$-number and Castelnuovo-Mumford regularity of cover\n  ideals of graphs","comments":"12 pages, 1 figure. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $\\mathrm{v}$-number of a graded ideal $I\\subseteq R$, denoted by\n$\\mathrm{v}(I)$, is the minimum degree of a polynomial $f$ for which $I:f$ is a\nprime ideal. Jaramillo and Villarreal (J Combin Theory Ser A 177:105310, 2021)\nstudied the $\\mathrm{v}$-number of edge ideals. In this paper, we study the\n$\\mathrm{v}$-number of the cover ideal $J(G)$ of a graph $G$. The main result\nshows that $\\mathrm{v}(J(G))\\leq \\mathrm{reg}(R/J(G))$ for any simple graph\n$G$, which is quite surprising because, for the case of edge ideals, this\ninequality does not hold. Our main result relates $\\mathrm{v}(J(G))$ with the\nCohen-Macaulay property of $R/I(G)$. We provide an infinite class of connected\ngraphs, which satisfy $\\mathrm{v}(J(G))=\\mathrm{reg}(R/J(G))$. Also, we show\nthat for every positive integer $k$, there exists a connected graph $G_k$ such\nthat $\\mathrm{reg}(R/J(G_k))-\\mathrm{v}(J(G_k))=k$. Also, we explicitly compute\nthe $\\mathrm{v}$-number of cover ideals of cycles.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:15:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saha","Kamalesh",""]]}
{"id":"2308.09997","submitter":"Jongho Park","authors":"Jongho Park","title":"Additive Schwarz methods for semilinear elliptic problems with convex\n  energy functionals: Convergence rate independent of nonlinearity","comments":"19 pages, 1 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 investigate additive Schwarz methods for semilinear elliptic problems with\nconvex energy functionals, which have wide scientific applications. A key\nobservation is that the convergence rates of both one- and two-level additive\nSchwarz methods have bounds independent of the nonlinear term in the problem.\nThat is, the convergence rates do not deteriorate by the presence of\nnonlinearity, so that solving a semilinear problem requires no more iterations\nthan a linear problem. Moreover, the two-level method is scalable in the sense\nthat the convergence rate of the method depends on $H/h$ and $H/\\delta$ only,\nwhere $h$ and $H$ are the typical diameters of an element and a subdomain,\nrespectively, and $\\delta$ measures the overlap among the subdomains. Numerical\nresults are provided to support our theoretical findings.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:24:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Park","Jongho",""]]}
{"id":"2308.09998","submitter":"Surjit Wadhwa","authors":"Surjit S. Wadhwa, Bojan Arbutina, Jelena Petrovic, Miroslav D.\n  Filipovic, Ain Y. De Horta, Nick F. H. Tothill and Gojko Djuravsevic","title":"A Study of Six Extreme Low Mass Ratio Contact Binary Systems","comments":"10 Pages. 5 Tables. 4 Figures. Accepted Publications of the\n  Astronomical Society of the Pacific","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-band (B, V and R) photometric and spectroscopic observations of six\npoorly studied contact binaries carried out at the Western Sydney University\nand Las Cumbres Observatory were analysed using a recent version of the\nWilson-Devenney code. All six were found to be of extreme low mass ratio\nranging from 0.073 to 0.149. All are of F spectral class with the mass of the\nprimary component ranging from 1.05Msun to 1.48Msun. None show light curve\nfeatures of enhanced choromospheric activity (O'Connell Effect) however five of\nthe six do have significant ultraviolet excess indicating presence of increased\nmagnetic and chromospheric activity. Period analysis based on available survey\ndata suggests two systems have a slowly increasing period suggesting mass\ntransfer from the secondary to the primary, two have a slow declining period\nwith likely mass transfer from primary to the secondary while one shows a\nsteady period and one undergoing transition from a declining to increasing\nperiod suggesting possible mass transfer reversal. We also compare light curve\nsolutions against theoretical markers of orbital stability and show that three\nof six systems have mass ratios within the theoretical instability limit and\nmaybe regarded as potential merger candidates.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:31:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wadhwa","Surjit S.",""],["Arbutina","Bojan",""],["Petrovic","Jelena",""],["Filipovic","Miroslav D.",""],["De Horta","Ain Y.",""],["Tothill","Nick F. H.",""],["Djuravsevic","Gojko",""]]}
{"id":"2308.09999","submitter":"James Sellers","authors":"James A. Sellers","title":"Elementary Proofs of Congruences for POND and PEND Partitions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Ballantine and Welch considered various generalizations and\nrefinements of POD and PED partitions. These are integer partitions wherein the\nodd parts must be distinct (in the case of POD partitions) or the even parts\nmust be distinct (in the case of PED partitions). In the process, they were led\nto consider two classes of integer partitions which are, in some sense, the\n``opposite'' of POD and PED partitions. They labeled these POND and PEND\npartitions, which are integer partitions wherein the odd parts cannot be\ndistinct (in the case of POND partitions) or the even parts cannot be distinct\n(in the case of PEND partitions). In this work, we study these two types of\npartitions from an arithmetic perspective. Along the way, we are led to prove\nthe following two infinite families of Ramanujan--like congruences: For all\n$\\alpha \\geq 1$ and all $n\\geq 0,$ \\begin{align*} pond\\left(3^{2\\alpha\n+1}n+\\frac{23\\cdot 3^{2\\alpha}+1}{8}\\right) &\\equiv 0 \\pmod{3}, \\textrm{\\ \\ \\\nand} \\\\ pend\\left(3^{2\\alpha +1}n+\\frac{17\\cdot 3^{2\\alpha}-1}{8}\\right)\n&\\equiv 0 \\pmod{3} \\end{align*} where $pond(n)$ counts the number of POND\npartitions of weight $n$ and $pend(n)$ counts the number of PEND partitions of\nweight $n$.\n  All of the proof techniques used herein are elementary, relying on classical\n$q$-series identities and generating function manipulations, along with\nmathematical induction.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:32:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sellers","James A.",""]]}
{"id":"2308.10000","submitter":"Jang-Ho Park","authors":"Jang-Ho Park, Jae Woo Lee, and Kyeongsoo Hong","title":"Photometric and Spectroscopic Properties of the Eclipsing System V864\n  Monocerotis","comments":"20 pages, including 6 figures and 4 tables, accepted for publication\n  in PASJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the orbital period variability and evolutionary status of the W\nUMa-type binary system V864 Mon from accurately measured fundamental\nparameters. New $BV$ photometric observations of this system were performed in\n2019 January and 2022 January, and the first high-resolution spectroscopic\nobservations were carried out on three nights between 2019 January and March. A\ntotal of 29 times of minimum light were collected to examine the behavior of\nthe orbital period. Our analysis of these timings indicates a continuous period\nincrease at a rate of $+$2.62$\\times$10$^{-7}$ d yr$^{-1}$ over the past 20\nyears, which can be interpreted as a mass transfer from the less massive\nprimary to the secondary component with a rate of 1.22$\\times$10$^{-7}$\nM$_\\odot$ yr$^{-1}$. We measured the radial velocities (RVs) for both\ncomponents, and determined the effective temperature and projected rotational\nvelocity of the more massive secondary star to be $T_{\\rm eff,2}$ = 5450 $\\pm$\n94 K and $v_2 \\sin i$ = 192 $\\pm$ 40 km s$^{-1}$, respectively, from the\ncomparison of the observed spectrum at the primary minimum and the theoretical\nmodels. The individual masses and radii of both components were determined from\na simultaneous analysis of the light and RV curves, which are $M_1$ = 0.34\n$\\pm$ 0.02 M$_\\odot$, $R_1$ = 0.69 $\\pm$ 0.01 R$_\\odot$, and $M_2$ = 1.06 $\\pm$\n0.04 M$_\\odot$, $R_2$ = 1.16 $\\pm$ 0.02 R$_\\odot$, respectively. Our results\nindicate that V864 Mon is a W-subtype of W UMa stars with time-varying spot\nactivity. The positions in the mass-luminosity and mass-radius diagrams\nindicate that the secondary star belongs to the main sequence region, while the\nhotter primary is located beyond the terminal-age main sequence.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:37:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Park","Jang-Ho",""],["Lee","Jae Woo",""],["Hong","Kyeongsoo",""]]}
{"id":"2308.10001","submitter":"Kun Wang","authors":"Kun Wang, Zhiqiang Yan, Huang Tian, Zhenyu Zhang, Xiang Li, Jun Li and\n  Jian Yang","title":"AltNeRF: Learning Robust Neural Radiance Field via Alternating\n  Depth-Pose Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Neural Radiance Fields (NeRF) have shown promise in generating realistic\nnovel views from sparse scene images. However, existing NeRF approaches often\nencounter challenges due to the lack of explicit 3D supervision and imprecise\ncamera poses, resulting in suboptimal outcomes. To tackle these issues, we\npropose AltNeRF -- a novel framework designed to create resilient NeRF\nrepresentations using self-supervised monocular depth estimation (SMDE) from\nmonocular videos, without relying on known camera poses. SMDE in AltNeRF\nmasterfully learns depth and pose priors to regulate NeRF training. The depth\nprior enriches NeRF's capacity for precise scene geometry depiction, while the\npose prior provides a robust starting point for subsequent pose refinement.\nMoreover, we introduce an alternating algorithm that harmoniously melds NeRF\noutputs into SMDE through a consistence-driven mechanism, thus enhancing the\nintegrity of depth priors. This alternation empowers AltNeRF to progressively\nrefine NeRF representations, yielding the synthesis of realistic novel views.\nAdditionally, we curate a distinctive dataset comprising indoor videos captured\nvia mobile devices. Extensive experiments showcase the compelling capabilities\nof AltNeRF in generating high-fidelity and robust novel views that closely\nresemble reality.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:41:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Kun",""],["Yan","Zhiqiang",""],["Tian","Huang",""],["Zhang","Zhenyu",""],["Li","Xiang",""],["Li","Jun",""],["Yang","Jian",""]]}
{"id":"2308.10002","submitter":"Qianwei Zhang","authors":"Yi Li and Qianwei Zhang","title":"Existence of Solutions to a Class of Kazdan-Warner Equations on Finite\n  Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G=(V, E)$ be a connected finite graph, $h$ be a positive function on $V$\nand $\\lambda _{1}(V)$ be the first non-zero eigenvalue of $-\\Delta$. For any\ngiven finite measure $\\mu$ on $V$, define functionals \\begin{eqnarray*}\n  J_{ \\beta }(u)&=&\\frac{1}{2}\\int_{V}|\\nabla u|^{2}d \\mu -\\beta\n\\log\\int_{V}he^{u}d \\mu,\n  J_{ \\alpha ,\\beta }(u)&=&\\frac{1}{2}\\int_{V}\\left(|\\nabla u|^{2}- \\alpha\nu^{2}\\right) d \\mu -\\beta \\log\\int_{V}he^{u}d \\mu \\end{eqnarray*} on the\nfunctional space $$ {\\bf H}= \\left\\{ u\\in{\\bf W}^{1,2}(V) \\Bigg| \\int_{V}u\\!\\\nd\\mu =0 \\right\\}. $$\n  For any $\\beta \\in \\mathbb{R}$, we show that $J_{ \\beta }(u)$ has a minimizer\n$u\\in{\\bf H}$, and then, based on variational principle, the Kazdan-Warner\nequation $$ \\Delta u=-\\frac{\\beta he^{u}}{\\displaystyle{\\int_{V}he^{u}d \\mu\n}}+\\frac{\\beta }{\\text{Vol}(V)} $$ has a solution in ${\\bf H}$.\n  If $\\alpha < \\lambda _{1}(V)$, then for any $\\beta \\in \\mathbb{R} , J_{\n\\alpha ,\\beta }(u)$ has a minimizer in ${\\bf H}$, thus the Kazdan-Warner\nequation $$ \\Delta u+\\alpha\\!\\ u=-\\frac{\\beta\nhe^{u}}{\\displaystyle{\\int_{V}he^{u}d \\mu }}+\\frac{\\beta }{\\text{Vol}(V)} $$\nhas a solution in ${\\bf H}$. If $\\alpha > \\lambda _{1}(V)$, then for any $\\beta\n\\in \\mathbb{R}$, $\\displaystyle{\\inf_{u\\in{\\bf H}} J_{ \\alpha ,\\beta }(u) =-\n\\infty}$. When $\\alpha=\\lambda_{1}(V)$, the situation becomes complicated: if\n$\\beta=0$, the corresponding equation is $-\\Delta u=\\lambda_{1}(V)u$ which has\na solution in ${\\bf H}$ obviously; if $\\beta>0$, then $\\displaystyle{\\inf_{u\\in\n{\\bf H}} J_{\\alpha,\\beta }(u) =- \\infty}$; if $\\beta<0$, $J_{ \\alpha ,\\beta\n}(u)$ has a minimizer in some subspace of ${\\bf H}$.\n  Moreover, we consider the same problem where higher eigenvalues are involved.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:43:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yi",""],["Zhang","Qianwei",""]]}
{"id":"2308.10003","submitter":"Zhu Xiangyang","authors":"Xiangyang Zhu, Yiling Pan, Bailin Deng and Bin Wang","title":"Efficient Multi-View Inverse Rendering Using a Hybrid Differentiable\n  Rendering Method","comments":"IJCAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recovering the shape and appearance of real-world objects from natural 2D\nimages is a long-standing and challenging inverse rendering problem. In this\npaper, we introduce a novel hybrid differentiable rendering method to\nefficiently reconstruct the 3D geometry and reflectance of a scene from\nmulti-view images captured by conventional hand-held cameras. Our method\nfollows an analysis-by-synthesis approach and consists of two phases. In the\ninitialization phase, we use traditional SfM and MVS methods to reconstruct a\nvirtual scene roughly matching the real scene. Then in the optimization phase,\nwe adopt a hybrid approach to refine the geometry and reflectance, where the\ngeometry is first optimized using an approximate differentiable rendering\nmethod, and the reflectance is optimized afterward using a physically-based\ndifferentiable rendering method. Our hybrid approach combines the efficiency of\napproximate methods with the high-quality results of physically-based methods.\nExtensive experiments on synthetic and real data demonstrate that our method\ncan produce reconstructions with similar or higher quality than\nstate-of-the-art methods while being more efficient.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:48:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhu","Xiangyang",""],["Pan","Yiling",""],["Deng","Bailin",""],["Wang","Bin",""]]}
{"id":"2308.10004","submitter":"Jingpeng Wu","authors":"Jingpeng Wu","title":"On the non-uniqueness of transport equation: the quantitative\n  relationship between temporal and spatial regularity","comments":"arXiv admin note: text overlap with arXiv:2308.01506","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 non-uniqueness of transport equation on the\ntorus $\\mathbb{T}^d$, with density $\\rho\\in L^{s}_tL_x^{p}$ and divergence-free\nvector field $\\boldsymbol{u}\\in L^{s'}_tL_x^{p'}\\cap\nL^{\\tilde{s}}_tW_x^{1,\\tilde{p}}$. We prove that the non-uniqueness holds for\n$\\frac{1}{p}+\\frac{\\tilde{s}'}{s\\tilde{p}}>1+\\frac{1}{d-1}$, with $d\\ge 2$ and\n$s,p,\\tilde{p}\\in[1,\\infty)$, $1\\le\\tilde{s}<s'$. The result can be extended to\nthe transport-diffusion equation with diffusion operator of order $k$ in the\nclass $\\rho\\in L^{s}_tL_x^{p}\\cap L_t^{\\bar{s}}C_x^{\\bar{m}}$,\n$\\boldsymbol{u}\\in L^{s'}_tL_x^{p'}\\cap L^{\\tilde{s}}_tW_x^{1,\\tilde{p}}$,\nunder some conditions on $\\bar{s},\\bar{m},k$. In particular, when\n$\\tilde{s}=1$, the additional condition is $\\bar{m}<\\frac{s}{\\bar{s}}-1$,\n$k<\\frac{s}{s'}+1$. These results can be considered as quantitative versions of\nCheskidov and Luo's [Ann. PDE, 2021]. The main tool is the convex integration\ndeveloped by Modena-Sattig-Sz\\'ekelyhidi [Ann. PDE, 2018; Calc. Var. Partial\nDiffer. Equ., 2019; Annales de l'Institut Henri Poincar\\'e C, Analyse non\nlin\\`eaire, 2020] and Cheskidov-Luo [Ann. PDE, 2021; arXiv, 2022 (forthcoming\nin Anal. PDE, 2023)].\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 12:50:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Jingpeng",""]]}
{"id":"2308.10005","submitter":"Jiaxuan Li","authors":"Jiaxuan Li, Duc Minh Vo, Hideki Nakayama","title":"Partition-and-Debias: Agnostic Biases Mitigation via A Mixture of\n  Biases-Specific Experts","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bias mitigation in image classification has been widely researched, and\nexisting methods have yielded notable results. However, most of these methods\nimplicitly assume that a given image contains only one type of known or unknown\nbias, failing to consider the complexities of real-world biases. We introduce a\nmore challenging scenario, agnostic biases mitigation, aiming at bias removal\nregardless of whether the type of bias or the number of types is unknown in the\ndatasets. To address this difficult task, we present the Partition-and-Debias\n(PnD) method that uses a mixture of biases-specific experts to implicitly\ndivide the bias space into multiple subspaces and a gating module to find a\nconsensus among experts to achieve debiased classification. Experiments on both\npublic and constructed benchmarks demonstrated the efficacy of the PnD. Code is\navailable at: https://github.com/Jiaxuan-Li/PnD.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:11:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Jiaxuan",""],["Vo","Duc Minh",""],["Nakayama","Hideki",""]]}
{"id":"2308.10006","submitter":"Saulius Vaitiek\\.enas","authors":"D. Razmadze, R. Seoane Souto, E. C. T. O'Farrell, P. Krogstrup, M.\n  Leijnse, C. M. Marcus, and S. Vaitiek\\.enas","title":"Supercurrent transport through 1$e$-periodic full-shell Coulomb islands","comments":"11 pages, 5+5 figures","journal-ref":null,"doi":null,"report-no":"NBI QDEV 2023","categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We experimentally investigate supercurrent through Coulomb islands, where\nisland and leads are fabricated from semiconducting nanowires with fully\nsurrounding superconducting shells. Applying flux along the wire yields a\nseries of destructive Little-Parks lobes with reentrant supercurrent. We find\nCoulomb blockade with 2$e$ peak spacing in the zeroth lobe and 1$e$ average\nspacing, with regions of significant even-odd modulation, in the first lobe.\nEvolution of Coulomb-peak amplitude through the first lobe is consistent with a\ntheoretical model of supercurrent carried predominantly by zero-energy states\nin the leads and the island.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:16:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Razmadze","D.",""],["Souto","R. Seoane",""],["O'Farrell","E. C. T.",""],["Krogstrup","P.",""],["Leijnse","M.",""],["Marcus","C. M.",""],["Vaitiek\u0117nas","S.",""]]}
{"id":"2308.10007","submitter":"Francesco Di Cosmo","authors":"Francesco Di Cosmo","title":"Verification of Sometimes Termination of Lazy-Bounded Declarative\n  Distributed Systems","comments":"Published in the online proceedings of the ESSLLI 2021 Student\n  Session","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Declarative Distributed Systems (DDSs) are distributed systems grounded in\nlogic programming. Although DDS model-checking is undecidable in general, we\ndetect decidable cases by tweaking the data-source bounds, the message\nexpressiveness, and the channel type.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:18:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Di Cosmo","Francesco",""]]}
{"id":"2308.10008","submitter":"SiQi Zhou","authors":"Siqi Zhou, Lukas Brunke, Allen Tao, Adam W. Hall, Federico Pizarro\n  Bejarano, Jacopo Panerati, and Angela P. Schoellig","title":"What is the Impact of Releasing Code with Publications? Statistics from\n  the Machine Learning, Robotics, and Control Communities","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":"  Open-sourcing research publications is a key enabler for the reproducibility\nof studies and the collective scientific progress of a research community. As\nall fields of science develop more advanced algorithms, we become more\ndependent on complex computational toolboxes -- sharing research ideas solely\nthrough equations and proofs is no longer sufficient to communicate scientific\ndevelopments. Over the past years, several efforts have highlighted the\nimportance and challenges of transparent and reproducible research; code\nsharing is one of the key necessities in such efforts. In this article, we\nstudy the impact of code release on scientific research and present statistics\nfrom three research communities: machine learning, robotics, and control. We\nfound that, over a six-year period (2016-2021), the percentages of papers with\ncode at major machine learning, robotics, and control conferences have at least\ndoubled. Moreover, high-impact papers were generally supported by open-source\ncodes. As an example, the top 1% of most cited papers at the Conference on\nNeural Information Processing Systems (NeurIPS) consistently included\nopen-source codes. In addition, our analysis shows that popular code\nrepositories generally come with high paper citations, which further highlights\nthe coupling between code sharing and the impact of scientific research. While\nthe trends are encouraging, we would like to continue to promote and increase\nour efforts toward transparent, reproducible research that accelerates\ninnovation -- releasing code with our papers is a clear first step.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:19:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Siqi",""],["Brunke","Lukas",""],["Tao","Allen",""],["Hall","Adam W.",""],["Bejarano","Federico Pizarro",""],["Panerati","Jacopo",""],["Schoellig","Angela P.",""]]}
{"id":"2308.10009","submitter":"Qunsong Zeng","authors":"Qunsong Zeng, Jiawei Liu, Mingrui Jiang, Jun Lan, Yi Gong, Zhongrui\n  Wang, Yida Li, Can Li, Jim Ignowski, Kaibin Huang","title":"Realizing In-Memory Baseband Processing for Ultra-Fast and\n  Energy-Efficient 6G","comments":"arXiv admin note: text overlap with arXiv:2205.03561","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To support emerging applications ranging from holographic communications to\nextended reality, next-generation mobile wireless communication systems require\nultra-fast and energy-efficient baseband processors. Traditional complementary\nmetal-oxide-semiconductor (CMOS)-based baseband processors face two challenges\nin transistor scaling and the von Neumann bottleneck. To address these\nchallenges, in-memory computing-based baseband processors using resistive\nrandom-access memory (RRAM) present an attractive solution. In this paper, we\npropose and demonstrate RRAM-implemented in-memory baseband processing for the\nwidely adopted multiple-input-multiple-output orthogonal frequency division\nmultiplexing (MIMO-OFDM) air interface. Its key feature is to execute the key\noperations, including discrete Fourier transform (DFT) and MIMO detection using\nlinear minimum mean square error (L-MMSE) and zero forcing (ZF), in one-step.\nIn addition, RRAM-based channel estimation module is proposed and discussed. By\nprototyping and simulations, we demonstrate the feasibility of RRAM-based\nfull-fledged communication system in hardware, and reveal it can outperform\nstate-of-the-art baseband processors with a gain of 91.2$\\times$ in latency and\n671$\\times$ in energy efficiency by large-scale simulations. Our results pave a\npotential pathway for RRAM-based in-memory computing to be implemented in the\nera of the sixth generation (6G) mobile communications.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:21:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zeng","Qunsong",""],["Liu","Jiawei",""],["Jiang","Mingrui",""],["Lan","Jun",""],["Gong","Yi",""],["Wang","Zhongrui",""],["Li","Yida",""],["Li","Can",""],["Ignowski","Jim",""],["Huang","Kaibin",""]]}
{"id":"2308.10010","submitter":"Jae-Hyuk Oh","authors":"Jun Hyeok Lee and Jae-Hyuk Oh","title":"Stochastic quantization and holographic Wilsonian renormalization group\n  of conformally coupled scalar in AdS$_{4}$","comments":"17+1 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 explore the relationship between holographic Wilsonian\nrenormalization groups and stochastic quantization in conformally coupled\nscalar theory in AdS$_{4}$. The relationship between these two different\nframeworks is firstly proposed in arXiv:1209.2242 and tested in various free\ntheories. However, research on the theory with interactions has recently begun.\nIn this paper, we show that the stochastic four-point function obtained by the\nLangevin equation is completely captured by the holographic quadruple trace\ndeformation when the Euclidean action $S_{E}$ is given by $S_{E}=-2I_{os}$\nwhere $I_{os}$ is the holographic on-shell action in the conformally coupled\nscalar theory in AdS$_{4}$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:26:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lee","Jun Hyeok",""],["Oh","Jae-Hyuk",""]]}
{"id":"2308.10011","submitter":"Marina Burlak","authors":"N.A. Maslennikova, A.M. Tatarnikov, A.A. Tatarnikova, A.V. Dodin, V.I.\n  Shenavrin, M.A. Burlak, S.G. Zheltoukhov, I.A. Strakhov","title":"Recurrent Symbiotic Nova T Coronae Borealis Before Outburst","comments":"15 pages, 3 tables, 8 figures, submitted to Astronomy Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The results of photometric and spectral observations of T CrB obtained in a\nwide range of wavelengths in 2011-2023 are presented. We use the near-IR light\ncurves to determine a new ephemeris $JD_{min} = 2455828.9 + 227.55 \\cdot E$ for\nthe times of light minima when the red giant is located between the observer\nand the hot component. The flux ratio H$\\alpha$/H$\\beta$ varied from ~3 to ~8\nin 2020-2023, which may be due to a change in the flux ratio between the X-ray\nand optical ranges. It is shown that the value of H$\\alpha$/H$\\beta$ depends on\nthe rate of accretion onto the hot component of the system. Based on high-speed\nfollow-up observations obtained on June 8, 2023, we detected a variability of\nthe HeII $\\lambda 4686$ line with a characteristic time-scale of ~25 min, the\namplitude of variability in the $B$ band was ~0.07$^m$. Simulations of the\nnear-IR light curves accounting for the ellipsoidal effect allowed us to obtain\nthe parameters of the binary system: the Roche lobe filling factor of the cool\ncomponent $\\mu=1.0$, the mass ratio $q=M_{cool}/M_{hot}=0.65\\pm0.2$, the orbit\ninclination $i=56^\\circ\\pm4^\\circ$. A comparison of the light curve obtained in\n2005-2023 with the 1946 outburst template made it possible to predict the date\nof the upcoming outburst - January 2024.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:29:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maslennikova","N. A.",""],["Tatarnikov","A. M.",""],["Tatarnikova","A. A.",""],["Dodin","A. V.",""],["Shenavrin","V. I.",""],["Burlak","M. A.",""],["Zheltoukhov","S. G.",""],["Strakhov","I. A.",""]]}
{"id":"2308.10012","submitter":"Weijia Wu","authors":"Yuanhang Liu, Hongli Sun, Weijia Wu, Donghui Yang","title":"Some controllability results of a class of N-dimensional parabolic\n  equations with internal single-point degeneracy","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 investigates the controllability of a class of $N$-dimensional\ndegenerate parabolic equations with interior single-point degeneracy. We employ\nthe Galerkin method to prove the existence of solutions for the equations. The\nanalysis is then divided into two cases based on whether the degenerate point\n$x=0$ lies within the control region $\\omega_0$ or not. For each case, we\nestablish specific Carleman estimates. As a result, we achieve null\ncontrollability in the first case $0\\in\\omega_0$ and unique continuation and\napproximate controllability in the second case $0\\notin\\omega_0$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:30:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Yuanhang",""],["Sun","Hongli",""],["Wu","Weijia",""],["Yang","Donghui",""]]}
{"id":"2308.10013","submitter":"Evgeniia Cherotchenko Dr","authors":"Ivan I. Vrubel, Evgeniia D. Cherotchenko, Dmitry A. Mikhailov, Dmitry\n  V. Chistyakov, Vladislav V. Dudelev, and Grigorii S. Sokolovskii","title":"QCL active region overheat in pulsed mode: effects of non-equilibrium\n  heat dissipation on laser performance","comments":null,"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":"  Quantum cascade lasers are of high interest in the scientific community due\nto unique applications utilizing the emission in mid-IR range. The possible\ndesigns of QCL are quite limited and require careful engineering to overcome\nsome crucial disadvantages. One of them is an active region (ARn) overheat,\nthat significantly affects the laser characteristics in the pulsed operation\nmode. In this work we consider the effects related to the non-equilibrium\ntemperature distribution, when thermal resistance formalism is irrelevant. We\nemploy the heat equation and discuss the possible limitations and structural\nfeatures stemming from the chemical composition of the AR. We show that the\npresence of alloys in the ARn structure fundamentally limits the heat\ndissipation in pulsed and CW regimes due to their low thermal conductivity.\nAlso the QCL post-growths affects the thermal properties of a device only in\n(near)CW mode while it is absolutely invaluable in the pulsed mode\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:32:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Vrubel","Ivan I.",""],["Cherotchenko","Evgeniia D.",""],["Mikhailov","Dmitry A.",""],["Chistyakov","Dmitry V.",""],["Dudelev","Vladislav V.",""],["Sokolovskii","Grigorii S.",""]]}
{"id":"2308.10014","submitter":"Longlin Yu","authors":"Longlin Yu, Cheng Zhang","title":"Semi-Implicit Variational Inference via Score Matching","comments":"17 pages, 8 figures; ICLR 2023","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":"  Semi-implicit variational inference (SIVI) greatly enriches the\nexpressiveness of variational families by considering implicit variational\ndistributions defined in a hierarchical manner. However, due to the intractable\ndensities of variational distributions, current SIVI approaches often use\nsurrogate evidence lower bounds (ELBOs) or employ expensive inner-loop MCMC\nruns for unbiased ELBOs for training. In this paper, we propose SIVI-SM, a new\nmethod for SIVI based on an alternative training objective via score matching.\nLeveraging the hierarchical structure of semi-implicit variational families,\nthe score matching objective allows a minimax formulation where the intractable\nvariational densities can be naturally handled with denoising score matching.\nWe show that SIVI-SM closely matches the accuracy of MCMC and outperforms\nELBO-based SIVI methods in a variety of Bayesian inference tasks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:32:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Longlin",""],["Zhang","Cheng",""]]}
{"id":"2308.10015","submitter":"Anuj Rai","authors":"Anuj Rai, Parsheel Kumar Tiwari, Jyotishna Baishya, Ram Prakash\n  Sharma, Somnath Dey","title":"DyFFPAD: Dynamic Fusion of Convolutional and Handcrafted Features for\n  Fingerprint Presentation Attack Detection","comments":"arXiv admin note: text overlap with arXiv:2305.09397","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic fingerprint recognition systems suffer from the threat of\npresentation attacks due to their wide range of applications in areas including\nnational borders and commercial applications. Presentation attacks can be\nperformed by fabricating the fake fingerprint of a user with or without the\nintention of the subject. This paper presents a dynamic ensemble of deep\nlearning and handcrafted features to detect presentation attacks in\nknown-material and unknown-material protocols. The proposed model is a dynamic\nensemble of deep CNN and handcrafted features empowered deep neural networks\nboth of which learn their parameters together. The proposed presentation attack\ndetection model, in this way, utilizes the capabilities of both classification\ntechniques and exhibits better performance than their individual results. The\nproposed model's performance is validated using benchmark LivDet 2015, 2017,\nand 2019 databases, with an overall accuracy of 96.10\\%, 96.49\\%, and 95.99\\%\nattained on them, respectively. The proposed model outperforms state-of-the-art\nmethods in benchmark protocols of presentation attack detection in terms of\nclassification accuracy.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:46:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rai","Anuj",""],["Tiwari","Parsheel Kumar",""],["Baishya","Jyotishna",""],["Sharma","Ram Prakash",""],["Dey","Somnath",""]]}
{"id":"2308.10016","submitter":"Yang Hai","authors":"Yang Hai, Rui Song, Jiaojiao Li, David Ferstl, Yinlin Hu","title":"Pseudo Flow Consistency for Self-Supervised 6D Object Pose Estimation","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":"  Most self-supervised 6D object pose estimation methods can only work with\nadditional depth information or rely on the accurate annotation of 2D\nsegmentation masks, limiting their application range. In this paper, we propose\na 6D object pose estimation method that can be trained with pure RGB images\nwithout any auxiliary information. We first obtain a rough pose initialization\nfrom networks trained on synthetic images rendered from the target's 3D mesh.\nThen, we introduce a refinement strategy leveraging the geometry constraint in\nsynthetic-to-real image pairs from multiple different views. We formulate this\ngeometry constraint as pixel-level flow consistency between the training images\nwith dynamically generated pseudo labels. We evaluate our method on three\nchallenging datasets and demonstrate that it outperforms state-of-the-art\nself-supervised methods significantly, with neither 2D annotations nor\nadditional depth images.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:52:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hai","Yang",""],["Song","Rui",""],["Li","Jiaojiao",""],["Ferstl","David",""],["Hu","Yinlin",""]]}
{"id":"2308.10017","submitter":"Hicham Zoubeir","authors":"Nadia Assila, Samir Kabbaj and Hicham Zoubeir","title":"On *-fusion frames for Hilbert C*-modules","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our main goal in this paper, is to generalize to Hilbert C*-modules the\nconcept of fusion frames. Indeed we introduce the notion of *\\~nfusion frames\nassociated to weighted sequences of orthogonally complemented submodules of a\nHilbert C*-module, and prove for such a *-fusion frames some fundamental\nresults.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:54:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Assila","Nadia",""],["Kabbaj","Samir",""],["Zoubeir","Hicham",""]]}
{"id":"2308.10018","submitter":"Arturo Ramos","authors":"Miguel Puente-Ajov\\'in, Arturo Ramos, Fernando Sanz-Gracia","title":"Is there a universal parametric city size distribution? Empirical\n  evidence for 70 countries","comments":null,"journal-ref":"The Annals of Regional Science 65, 727-741 (2020)","doi":"10.1007/s00168-020-01001-6","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the parametric description of the city size distribution (CSD) of 70\ndifferent countries (developed and developing) using seven models, as follows:\nthe lognormal (LN), the loglogistic (LL), the double Pareto lognormal (dPLN),\nthe two-lognormal (2LN), the two-loglogistic (2LL), the three-lognormal (3LN)\nand the three-loglogistic (3LL). Our results show that 3LN and 3LL are the best\ndensities in terms of non-rejections out of standard statistical tests.\nMeanwhile, according to the information criteria AIC and BIC, there is no\nsystematically dominant distribution.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:00:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Puente-Ajov\u00edn","Miguel",""],["Ramos","Arturo",""],["Sanz-Gracia","Fernando",""]]}
{"id":"2308.10019","submitter":"Haoran Zhou","authors":"Hao Chen, Haoran Zhou, Yongjian Deng","title":"Interpretation on Multi-modal Visual Fusion","comments":"This version was under review since 2023/3/9","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present an analytical framework and a novel metric to shed\nlight on the interpretation of the multimodal vision community. Our approach\ninvolves measuring the proposed semantic variance and feature similarity across\nmodalities and levels, and conducting semantic and quantitative analyses\nthrough comprehensive experiments. Specifically, we investigate the consistency\nand speciality of representations across modalities, evolution rules within\neach modality, and the collaboration logic used when optimizing a\nmulti-modality model. Our studies reveal several important findings, such as\nthe discrepancy in cross-modal features and the hybrid multi-modal cooperation\nrule, which highlights consistency and speciality simultaneously for\ncomplementary inference. Through our dissection and findings on multi-modal\nfusion, we facilitate a rethinking of the reasonability and necessity of\npopular multi-modal vision fusion strategies. Furthermore, our work lays the\nfoundation for designing a trustworthy and universal multi-modal fusion model\nfor a variety of tasks in the future.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:01:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Hao",""],["Zhou","Haoran",""],["Deng","Yongjian",""]]}
{"id":"2308.10020","submitter":"Hao Yang","authors":"Hao Yang, Jie Fu, Zhili Cheng, Haifeng Qian","title":"Enhancing SCF with Privacy-Preserving and Splitting-Enabled E-Bills on\n  Blockchain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electronic Bill (E-Bill) is a rucial negotiable instrument in the form of\ndata messages, relying on the Electronic Bill System (EB System). Blockchain\ntechnology offers inherent data sharing capabilities, so it is increasingly\nbeing adopted by small and medium-sized enterprises (SMEs) in the supply chain\nto build EB systems. However, the blockchain-based E-Bill still face\nsignificant challenges: the E-Bill is difficult to split, like non-fungible\ntokens (NFTs), and sensitive information such as amounts always be exposed on\nthe blockchain. Therefore, to address these issues, we propose a novel data\nstructure called Reverse-HashTree for Re-storing transactions in blockchain. In\naddition, we employ a variant of the Paillier public-key cryptosystem to ensure\ntransaction validity without decryption, thus preserving privacy. Building upon\nthese innovations, we designed BillChain, an EB system that enhances supply\nchain finance by providing privacy-preserving and splitting-enabled E-Bills on\nthe blockchain. This work offers a comprehensive and innovative solution to the\nchallenges faced by E-Bills applied in blockchain in the context of supply\nchain finance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:05:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Hao",""],["Fu","Jie",""],["Cheng","Zhili",""],["Qian","Haifeng",""]]}
{"id":"2308.10021","submitter":"Yung-Chuan Chang","authors":"Tung-Cheng Su, Yung-Chuan Chang, Yi-Wen Liu","title":"Effects of Convolutional Autoencoder Bottleneck Width on StarGAN-based\n  Singing Technique Conversion","comments":"The original edition of this paper will be published in the CMMR 2023\n  Proceedings. This ArXiv publication is a copy","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Singing technique conversion (STC) refers to the task of converting from one\nvoice technique to another while leaving the original singer identity, melody,\nand linguistic components intact. Previous STC studies, as well as singing\nvoice conversion research in general, have utilized convolutional autoencoders\n(CAEs) for conversion, but how the bottleneck width of the CAE affects the\nsynthesis quality has not been thoroughly evaluated. To this end, we\nconstructed a GAN-based multi-domain STC system which took advantage of the\nWORLD vocoder representation and the CAE architecture. We varied the bottleneck\nwidth of the CAE, and evaluated the conversion results subjectively. The model\nwas trained on a Mandarin dataset which features four singers and four singing\ntechniques: the chest voice, the falsetto, the raspy voice, and the whistle\nvoice. The results show that a wider bottleneck corresponds to better\narticulation clarity but does not necessarily lead to higher likeness to the\ntarget technique. Among the four techniques, we also found that the whistle\nvoice is the easiest target for conversion, while the other three techniques as\na source produce more convincing conversion results than the whistle.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:13:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Su","Tung-Cheng",""],["Chang","Yung-Chuan",""],["Liu","Yi-Wen",""]]}
{"id":"2308.10022","submitter":"Ting Zhang","authors":"Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, David Lo","title":"Cupid: Leveraging ChatGPT for More Accurate Duplicate Bug Report\n  Detection","comments":"Recently submitted to TOSEM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Duplicate bug report detection (DBRD) is a long-standing challenge in both\nacademia and industry. Over the past decades, researchers have proposed various\napproaches to detect duplicate bug reports more accurately. With the recent\nadvancement of deep learning, researchers have also proposed several approaches\nthat leverage deep learning models to detect duplicate bug reports. A recent\nbenchmarking study on DBRD also reveals that the performance of deep\nlearning-based approaches is not always better than the traditional approaches.\nHowever, traditional approaches have limitations, e.g., they are usually based\non the bag-of-words model, which cannot capture the semantics of bug reports.\nTo address these aforementioned challenges, we seek to leverage\nstate-of-the-art large language model to improve the performance of the\ntraditional DBRD approach.\n  In this paper, we propose an approach called Cupid, which combines the\nbest-performing traditional DBRD approach REP with the state-of-the-art large\nlanguage model ChatGPT. Specifically, we first leverage ChatGPT under the\nzero-shot setting to get essential information on bug reports. We then use the\nessential information as the input of REP to detect duplicate bug reports. We\nconducted an evaluation on comparing Cupid with three existing approaches on\nthree datasets. The experimental results show that Cupid achieves new\nstate-of-the-art results, reaching Recall Rate@10 scores ranging from 0.59 to\n0.67 across all the datasets analyzed. Our work highlights the potential of\ncombining large language models to improve the performance of software\nengineering tasks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:16:30 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 13:58:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Ting",""],["Irsan","Ivana Clairine",""],["Thung","Ferdian",""],["Lo","David",""]]}
{"id":"2308.10023","submitter":"Arturo Ramos","authors":"Till Massing, Arturo Ramos","title":"Student't mixture models for stock indices. A comparative study","comments":null,"journal-ref":"Physica A: Statistical Mechanics and its Applications, 580, 126143\n  (2021)","doi":"10.1016/j.physa.2021.126143","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We perform a comparative study for multiple equity indices of different\ncountries using different models to determine the best fit using the\nKolmogorov-Smirnov statistic, the Anderson-Darling statistic, the Akaike\ninformation criterion and the Bayesian information criteria as goodness-of-fit\nmeasures. We fit models both to daily and to hourly log-returns. The main\nresult is the excellent performance of a mixture of three Student's $t$\ndistributions with the numbers of degrees of freedom fixed a priori (3St). In\naddition, we find that the different components of the 3St mixture with\nsmall/moderate/high degree of freedom parameter describe the\nextreme/moderate/small log-returns of the studied equity indices.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:16:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Massing","Till",""],["Ramos","Arturo",""]]}
{"id":"2308.10024","submitter":"Zicheng Ye","authors":"Zicheng Ye, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan and Zhiming Ma","title":"On the Weight Distribution of Weights Less than $2w_{\\min}$ in Polar\n  Codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The number of low-weight codewords is critical to the performance of\nerror-correcting codes. In 1970, Kasami and Tokura characterized the codewords\nof Reed-Muller (RM) codes whose weights are less than $2w_{\\min}$, where\n$w_{\\min}$ represents the minimum weight. In this paper, we extend their\nresults to decreasing polar codes. We present the closed-form expressions for\nthe number of codewords in decreasing polar codes with weights less than\n$2w_{\\min}$. Moreover, the proposed enumeration algorithm runs in polynomial\ntime with respect to the code length.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:17:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ye","Zicheng",""],["Li","Yuan",""],["Zhang","Huazi",""],["Wang","Jun",""],["Yan","Guiying",""],["Ma","Zhiming",""]]}
{"id":"2308.10025","submitter":"Kaihang Pan","authors":"Kaihang Pan, Juncheng Li, Hongye Song, Hao Fei, Wei Ji, Shuo Zhang,\n  Jun Lin, Xiaozhong Liu, Siliang Tang","title":"ControlRetriever: Harnessing the Power of Instructions for Controllable\n  Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies have shown that dense retrieval models, lacking dedicated\ntraining data, struggle to perform well across diverse retrieval tasks, as\ndifferent retrieval tasks often entail distinct search intents. To address this\nchallenge, in this work we introduce ControlRetriever, a generic and efficient\napproach with a parameter isolated architecture, capable of controlling dense\nretrieval models to directly perform varied retrieval tasks, harnessing the\npower of instructions that explicitly describe retrieval intents in natural\nlanguage. Leveraging the foundation of ControlNet, which has proven powerful in\ntext-to-image generation, ControlRetriever imbues different retrieval models\nwith the new capacity of controllable retrieval, all while being guided by\ntask-specific instructions. Furthermore, we propose a novel LLM guided\nInstruction Synthesizing and Iterative Training strategy, which iteratively\ntunes ControlRetriever based on extensive automatically-generated retrieval\ndata with diverse instructions by capitalizing the advancement of large\nlanguage models. Extensive experiments show that in the BEIR benchmark, with\nonly natural language descriptions of specific retrieval intent for each task,\nControlRetriever, as a unified multi-task retrieval system without\ntask-specific tuning, significantly outperforms baseline methods designed with\ntask-specific retrievers and also achieves state-of-the-art zero-shot\nperformance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:17:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pan","Kaihang",""],["Li","Juncheng",""],["Song","Hongye",""],["Fei","Hao",""],["Ji","Wei",""],["Zhang","Shuo",""],["Lin","Jun",""],["Liu","Xiaozhong",""],["Tang","Siliang",""]]}
{"id":"2308.10026","submitter":"Parviz Gulshani","authors":"Parviz Gulshani, Alaaddine Lahbas","title":"Microscopic triaxial cranking model: preliminary predictions for\n  oscillator potential and light nuclei","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The conventional cranking model for uniaxial and triaxial rotation (CCRM3) is\nfrequently used to study rotational features in deformed nuclei. However, CCRM3\nis semi-classical and phenomenological because it uses a constant angular\nvelocity, resulting in a number of Hamiltonian symmetry breakings. To\ninvestigate the effect of a dynamic angular velocity, a quantal, microscopic,\nD2, signature, and time-reversal invariant cranking model for triaxial rotation\n(MSCRM3) is derived exactly from a unitary rigid-flow-velocity-field rotation\ntransformation of the nuclear Schrodinger equation and Hartree-Fock method.\nExcept for a microscopically-determined angular velocity and normally-small\nresidual terms, the MSCRM3 and CCRM3 Schrodinger equations are identical in\nform. The microscopic angular velocity emerges from the HF variation, and the\nresidual terms may become significant for triaxial rotation at high spins and\nin back-bending regions where and undergo large changes. A preliminary\napplication of MSCRM3 and CCRM3 to the light nuclei 20Ne, 24Mg, and 28Si using\nthe simple self-consistent deformed harmonic oscillator potential predicts some\ninteresting differences between the rotational features and phenomena predicted\nby the two models. These differences are attributable to the impact of the\ndynamic angular velocity. It is important to investigate and understand these\ndifferences for the simple and realistic nuclear interactions.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:23:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gulshani","Parviz",""],["Lahbas","Alaaddine",""]]}
{"id":"2308.10027","submitter":"Qiming Hu","authors":"Qiming Hu, Xiaojie Guo","title":"Single Image Reflection Separation via Component Synergy","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":"  The reflection superposition phenomenon is complex and widely distributed in\nthe real world, which derives various simplified linear and nonlinear\nformulations of the problem. In this paper, based on the investigation of the\nweaknesses of existing models, we propose a more general form of the\nsuperposition model by introducing a learnable residue term, which can\neffectively capture residual information during decomposition, guiding the\nseparated layers to be complete. In order to fully capitalize on its\nadvantages, we further design the network structure elaborately, including a\nnovel dual-stream interaction mechanism and a powerful decomposition network\nwith a semantic pyramid encoder. Extensive experiments and ablation studies are\nconducted to verify our superiority over state-of-the-art approaches on\nmultiple real-world benchmark datasets. Our code is publicly available at\nhttps://github.com/mingcv/DSRNet.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:25:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Qiming",""],["Guo","Xiaojie",""]]}
{"id":"2308.10028","submitter":"Zhihao Wen","authors":"Zhihao Wen, Yuan Fang, Yihan Liu, Yang Guo, Shuji Hao","title":"Voucher Abuse Detection with Prompt-based Fine-tuning on Graph Neural\n  Networks","comments":"7 pages, Accepted by CIKM23 Applied Research Track","journal-ref":null,"doi":"10.1145/3583780.3615505","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Voucher abuse detection is an important anomaly detection problem in\nE-commerce. While many GNN-based solutions have emerged, the supervised\nparadigm depends on a large quantity of labeled data. A popular alternative is\nto adopt self-supervised pre-training using label-free data, and further\nfine-tune on a downstream task with limited labels. Nevertheless, the\n\"pre-train, fine-tune\" paradigm is often plagued by the objective gap between\npre-training and downstream tasks. Hence, we propose VPGNN, a prompt-based\nfine-tuning framework on GNNs for voucher abuse detection. We design a novel\ngraph prompting function to reformulate the downstream task into a similar\ntemplate as the pretext task in pre-training, thereby narrowing the objective\ngap. Extensive experiments on both proprietary and public datasets demonstrate\nthe strength of VPGNN in both few-shot and semi-supervised scenarios. Moreover,\nan online deployment of VPGNN in a production environment shows a 23.4%\nimprovement over two existing deployed models.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:25:59 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 06:33:32 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wen","Zhihao",""],["Fang","Yuan",""],["Liu","Yihan",""],["Guo","Yang",""],["Hao","Shuji",""]]}
{"id":"2308.10029","submitter":"Elena Fantino Dr","authors":"David Canales, Kathleen C. Howell, Elena Fantino, Annika J. Gilliam","title":"Transfers between moons with escape and capture patterns via Lyapunov\n  exponent maps","comments":null,"journal-ref":"Journal of Guidance, Control, and Dynamics (2023)","doi":"10.2514/1.G007195","report-no":null,"categories":"nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This contribution focuses on the design of low-energy transfers between\nplanetary moons and presents an efficient technique to compute trajectories\ncharacterized by desirable behaviors in the vicinities of the departure and\ndestination bodies. The method utilizes finite-time Lyapunov exponent maps in\ncombination with the Moon-to-Moon Analytical Transfer (MMAT) method previously\nproposed by the authors. The integration of these two components facilitates\nthe design of direct transfers between moons within the context of the circular\nrestricted three-body problem, and allows the inclusion of a variety of\ntrajectory patterns, such as captures, landings, transits and takeoffs, at the\ntwo ends of a transfer. The foundations and properties of the technique are\nillustrated through an application based on impulsive direct transfers between\nGanymede and Europa. However, the methodology can be employed to assist in the\ndesign of more complex mission scenarios, such as moon tours.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:29:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Canales","David",""],["Howell","Kathleen C.",""],["Fantino","Elena",""],["Gilliam","Annika J.",""]]}
{"id":"2308.10030","submitter":"Arturo Ramos","authors":"Michele Campolieti, Arturo Ramos","title":"The Distribution of Strike Size:Empirical Evidence from Europe and North\n  America in the 19th and 20th Centuries","comments":null,"journal-ref":"Physica A: Statistical Mechanics and its Applications, 563, 125424\n  (2021)","doi":"10.1016/j.physa.2020.125424","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the distribution of strike size, which we measure as lost person\ndays, for a long period in several countries of Europe and America. When we\nconsider the full samples, the mixtures of two or three lognormals arise as\nvery convenient models. When restricting to the upper tails, the Pareto power\nlaw becomes almost indistinguishable of the truncated lognormal.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:29:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Campolieti","Michele",""],["Ramos","Arturo",""]]}
{"id":"2308.10031","submitter":"Pritam Goswami","authors":"Pritam Goswami, Manash Kumar Kundu, Satakshi Ghosh and Buddhadeb Sau","title":"Circle Formation by Asynchronous Opaque Fat Robots on an Infinite Grid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study addresses the problem of \"Circle Formation on an Infinite Grid by\nFat Robots\" ($CF\\_FAT\\_GRID$). Unlike prior work focused solely on point robots\nin discrete domain, it introduces fat robots to circle formation on an infinite\ngrid, aligning with practicality as even small robots inherently possess\ndimensions. The algorithm, named $CIRCLE\\_FG$, resolves the $CF\\_FAT\\_GRID$\nproblem using a swarm of fat luminous robots. Operating under an asynchronous\nscheduler, it achieves this with five distinct colors and by leveraging\none-axis agreement among the robots.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:32:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Goswami","Pritam",""],["Kundu","Manash Kumar",""],["Ghosh","Satakshi",""],["Sau","Buddhadeb",""]]}
{"id":"2308.10032","submitter":"Chenfei Wu","authors":"Dan Qiao, Chenfei Wu, Yaobo Liang, Juntao Li, Nan Duan","title":"GameEval: Evaluating LLMs on Conversational Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid advancements in large language models (LLMs) have presented\nchallenges in evaluating those models. Existing evaluation methods are either\nreference-based or preference based, which inevitably need human intervention\nor introduce test bias caused by evaluator models. In this paper, we propose\nGameEval, a novel approach to evaluating LLMs through goal-driven\nconversational games, overcoming the limitations of previous methods. GameEval\ntreats LLMs as game players and assigns them distinct roles with specific goals\nachieved by launching conversations of various forms, including discussion,\nquestion answering, and voting. We design three unique games with cooperative\nor adversarial objectives, accompanied by corresponding evaluation metrics, to\nshow how this new paradigm comprehensively evaluates model performance.Through\nextensive experiments, we show that GameEval can effectively differentiate the\ncapabilities of various LLMs, providing a comprehensive assessment of their\nintegrated abilities to solve complex problems. Our public anonymous code is\navailable at https://github.com/GameEval/GameEval.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:33:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qiao","Dan",""],["Wu","Chenfei",""],["Liang","Yaobo",""],["Li","Juntao",""],["Duan","Nan",""]]}
{"id":"2308.10033","submitter":"Hamidreza Bolhasani","authors":"Zahra Mokhtari, Elham Amjadi, Hamidreza Bolhasani, Zahra Faghih,\n  AmirReza Dehghanian, Marzieh Rezaei","title":"CRC-ICM: Colorectal Cancer Immune Cell Markers Pattern Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Colorectal Cancer (CRC) is the second most common cause of cancer death in\nthe world, ad can be identified by the location of the primary tumor in the\nlarge intestine: right and left colon, and rectum. Based on the location, CRC\nshows differences in chromosomal and molecular characteristics, microbiomes\nincidence, pathogenesis, and outcome. It has been shown that tumors on left and\nright sides also have different immune landscape, so the prognosis may be\ndifferent based on the primary tumor locations. It is widely accepted that\nimmune components of the tumor microenvironment (TME) plays a critical role in\ntumor development. One of the critical regulatory molecules in the TME is\nimmune checkpoints that as the gatekeepers of immune responses regulate the\ninfiltrated immune cell functions. Inhibitory immune checkpoints such as PD-1,\nTim3, and LAG3, as the main mechanism of immune suppression in TME\noverexpressed and result in further development of the tumor. The images of\nthis dataset have been taken from colon tissues of patients with CRC, stained\nwith specific antibodies for CD3, CD8, CD45RO, PD-1, LAG3 and Tim3. The name of\nthis dataset is CRC-ICM and contains 1756 images related to 136 patients. The\ninitial version of CRC-ICM is published on Elsevier Mendeley dataset portal,\nand the latest version is accessible via: https://databiox.com\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:39:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mokhtari","Zahra",""],["Amjadi","Elham",""],["Bolhasani","Hamidreza",""],["Faghih","Zahra",""],["Dehghanian","AmirReza",""],["Rezaei","Marzieh",""]]}
{"id":"2308.10034","submitter":"Arturo Ramos","authors":"Till Massing, Miguel Puente-Ajov\\'in, Arturo Ramos","title":"On the parametric description of log-growth rates of cities' sizes of\n  four European countries and the USA","comments":null,"journal-ref":"Physica A: Statistical Mechanics and Its Applications, 551, 124587\n  (2020)","doi":"10.1016/j.physa.2020.124587","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have studied the parametric description of the distribution of the\nlog-growth rates of the sizes of cities of France, Germany, Italy, Spain and\nthe USA. We have considered several parametric distributions well known in the\nliterature as well as some others recently introduced. There are some models\nthat provide similar excellent performance, for all studied samples. The normal\ndistribution is not the one observed empirically.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:41:52 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Massing","Till",""],["Puente-Ajov\u00edn","Miguel",""],["Ramos","Arturo",""]]}
{"id":"2308.10035","submitter":"Yi-Lun Du","authors":"Yi-Lun Du","title":"Overview: Jet quenching with machine learning","comments":"11 pages, 11th International Conference on Hard and Electromagnetic\n  Probes of High-Energy Nuclear Collisions (Hard Probes 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":"  Jets are suppressed and modified in heavy ion collisions, which serve as\npowerful probes to the properties of the quark-gluon plasma (QGP). Attributed\nto the abundant information carried by the jet constituents and reconstructed\nsubstructures, plenty of interesting applications of machine learning\ntechniques have been made on a jet-by-jet basis to study the jet quenching\nphenomena. Here we review recent proceedings on this topic including the tasks\nof reconstructing jet momentum in heavy ion collisions, classifying quenched\njets and unquenched jets, identifying jet energy loss, locating the jet\ncreation points as well as distinguishing between quark- and gluon-initiated\njets in the QGP. Such jet-by-jet analyses will allow us to have a better handle\non the jet reconstruction and selections to investigate the effects of jet\nmodifications and push forward the long-standing goal of jet tomographic probes\nof the QGP.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:43:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Du","Yi-Lun",""]]}
{"id":"2308.10036","submitter":"Taahir Patel","authors":"Taahir Aiyoob Patel and Clement N. Nyirenda","title":"Semi-Supervised Anomaly Detection for the Determination of Vehicle\n  Hijacking Tweets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In South Africa, there is an ever-growing issue of vehicle hijackings. This\nleads to travellers constantly being in fear of becoming a victim to such an\nincident. This work presents a new semi-supervised approach to using tweets to\nidentify hijacking incidents by using unsupervised anomaly detection\nalgorithms. Tweets consisting of the keyword \"hijacking\" are obtained, stored,\nand processed using the term frequency-inverse document frequency (TF-IDF) and\nfurther analyzed by using two anomaly detection algorithms: 1) K-Nearest\nNeighbour (KNN); 2) Cluster Based Outlier Factor (CBLOF). The comparative\nevaluation showed that the KNN method produced an accuracy of 89%, whereas the\nCBLOF produced an accuracy of 90%. The CBLOF method was also able to obtain a\nF1-Score of 0.8, whereas the KNN produced a 0.78. Therefore, there is a slight\ndifference between the two approaches, in favour of CBLOF, which has been\nselected as a preferred unsupervised method for the determination of relevant\nhijacking tweets. In future, a comparison will be done between supervised\nlearning methods and the unsupervised methods presented in this work on larger\ndataset. Optimisation mechanisms will also be employed in order to increase the\noverall performance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:46:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Patel","Taahir Aiyoob",""],["Nyirenda","Clement N.",""]]}
{"id":"2308.10037","submitter":"Mohammed Nechba","authors":"Nechba Mohammed, Mouhajir Mohamed, Sedjari Yassine","title":"High Performance Computing Applied to Logistic Regression: A CPU and GPU\n  Implementation Comparison","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 versatile GPU-based parallel version of Logistic Regression\n(LR), aiming to address the increasing demand for faster algorithms in binary\nclassification due to large data sets. Our implementation is a direct\ntranslation of the parallel Gradient Descent Logistic Regression algorithm\nproposed by X. Zou et al. [12]. Our experiments demonstrate that our GPU-based\nLR outperforms existing CPU-based implementations in terms of execution time\nwhile maintaining comparable f1 score. The significant acceleration of\nprocessing large datasets makes our method particularly advantageous for\nreal-time prediction applications like image recognition, spam detection, and\nfraud detection. Our algorithm is implemented in a ready-to-use Python library\navailable at : https://github.com/NechbaMohammed/SwiftLogisticReg\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:49:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mohammed","Nechba",""],["Mohamed","Mouhajir",""],["Yassine","Sedjari",""]]}
{"id":"2308.10038","submitter":"Kazuo Yonekura","authors":"Kazunari Wada, Katsuyuki Suzuki, Kazuo Yonekura","title":"Physics-guided training of GAN to improve accuracy in airfoil design\n  synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative adversarial networks (GAN) have recently been used for a design\nsynthesis of mechanical shapes. A GAN sometimes outputs physically unreasonable\nshapes. For example, when a GAN model is trained to output airfoil shapes that\nindicate required aerodynamic performance, significant errors occur in the\nperformance values. This is because the GAN model only considers data but does\nnot consider the aerodynamic equations that lie under the data. This paper\nproposes the physics-guided training of the GAN model to guide the model to\nlearn physical validity. Physical validity is computed using general-purpose\nsoftware located outside the neural network model. Such general-purpose\nsoftware cannot be used in physics-informed neural network frameworks, because\nphysical equations must be implemented inside the neural network models.\nAdditionally, a limitation of generative models is that the output data are\nsimilar to the training data and cannot generate completely new shapes.\nHowever, because the proposed model is guided by a physical model and does not\nuse a training dataset, it can generate completely new shapes. Numerical\nexperiments show that the proposed model drastically improves the accuracy.\nMoreover, the output shapes differ from those of the training dataset but still\nsatisfy the physical validity, overcoming the limitations of existing GAN\nmodels.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:52:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wada","Kazunari",""],["Suzuki","Katsuyuki",""],["Yonekura","Kazuo",""]]}
{"id":"2308.10039","submitter":"HyeonJun Kim","authors":"HyeonJun Kim","title":"Do We Price Happiness? Evidence from Korean Stock Market","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC q-fin.PM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study explores the potential of internet search volume data,\nspecifically Google Trends, as an indicator for cross-sectional stock returns.\nUnlike previous studies, our research specifically investigates the search\nvolume of the topic 'happiness' and its impact on stock returns in the aspect\nof risk pricing rather than as sentiment measurement. Empirical results\nindicate that this 'happiness' search exposure (HSE) can explain future\nreturns, particularly for big and value firms. This suggests that HSE might be\na reflection of a firm's ability to produce goods or services that meet\nsocietal utility needs. Our findings have significant implications for\ninstitutional investors seeking to leverage HSE-based strategies for\noutperformance. Additionally, our research suggests that, when selected\njudiciously, some search topics on Google Trends can be related to risks that\nimpact stock prices.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:55:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","HyeonJun",""]]}
{"id":"2308.10040","submitter":"Bo Zhang","authors":"Bo Zhang, Yuxuan Duan, Jun Lan, Yan Hong, Huijia Zhu, Weiqiang Wang,\n  Li Niu","title":"ControlCom: Controllable Image Composition using Diffusion Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image composition targets at synthesizing a realistic composite image from a\npair of foreground and background images. Recently, generative composition\nmethods are built on large pretrained diffusion models to generate composite\nimages, considering their great potential in image generation. However, they\nsuffer from lack of controllability on foreground attributes and poor\npreservation of foreground identity. To address these challenges, we propose a\ncontrollable image composition method that unifies four tasks in one diffusion\nmodel: image blending, image harmonization, view synthesis, and generative\ncomposition. Meanwhile, we design a self-supervised training framework coupled\nwith a tailored pipeline of training data preparation. Moreover, we propose a\nlocal enhancement module to enhance the foreground details in the diffusion\nmodel, improving the foreground fidelity of composite images. The proposed\nmethod is evaluated on both public benchmark and real-world data, which\ndemonstrates that our method can generate more faithful and controllable\ncomposite images than existing approaches. The code and model will be available\nat https://github.com/bcmi/ControlCom-Image-Composition.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:56:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Bo",""],["Duan","Yuxuan",""],["Lan","Jun",""],["Hong","Yan",""],["Zhu","Huijia",""],["Wang","Weiqiang",""],["Niu","Li",""]]}
{"id":"2308.10041","submitter":"Mohammed Nechba","authors":"Mohammed Nechba, Mouhajir Mohamed, Sedjari Yassine","title":"Computing the Vapnik Chervonenkis Dimension for Non-Discrete Settings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 1984, Valiant [ 7 ] introduced the Probably Approximately Correct (PAC)\nlearning framework for boolean function classes. Blumer et al. [ 2] extended\nthis model in 1989 by introducing the VC dimension as a tool to characterize\nthe learnability of PAC. The VC dimension was based on the work of Vapnik and\nChervonenkis in 1971 [8 ], who introduced a tool called the growth function to\ncharacterize the shattering property. Researchers have since determined the VC\ndimension for specific classes, and efforts have been made to develop an\nalgorithm that can calculate the VC dimension for any concept class. In 1991,\nLinial, Mansour, and Rivest [4] presented an algorithm for computing the VC\ndimension in the discrete setting, assuming that both the concept class and\ndomain set were finite. However, no attempts had been made to design an\nalgorithm that could compute the VC dimension in the general setting.Therefore,\nour work focuses on developing a method to approximately compute the VC\ndimension without constraints on the concept classes or their domain set. Our\napproach is based on our finding that the Empirical Risk Minimization (ERM)\nlearning paradigm can be used as a new tool to characterize the shattering\nproperty of a concept class.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:57:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nechba","Mohammed",""],["Mohamed","Mouhajir",""],["Yassine","Sedjari",""]]}
{"id":"2308.10042","submitter":"Felipe Braga-Ribas","authors":"Felipe Braga-Ribas, C. L. Pereira, B. Sicardy, J. L. Ortiz, J.\n  Desmars, A. Sickafoose, M. Emilio, B. Morgado, G. Margoti, F. L. Rommel, J.\n  I. B. Camargo, M. Assafin, R. Vieira-Martins, A. R. Gomes-J\\'unior, P.\n  Santos-Sanz, N. Morales, M. Kretlow, J. Lecacheux, F. Colas, R. Boninsegna,\n  O. Schreurs, J. L. Dauvergne, E. Fernandez, H. J. van Heerden, H. Gonz\\'alez,\n  D. Bihel, F. Jankowsky","title":"Constraints on (2060) Chiron's size, shape, and surrounding material\n  from the November 2018 and September 2019 stellar occultations","comments":null,"journal-ref":"A&A 676, A72 (2023)","doi":"10.1051/0004-6361/202346749","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  After the discovery of rings around the largest known Centaur object, (10199)\nChariklo, we carried out observation campaigns of stellar occultations produced\nby the second-largest known Centaur object, (2060) Chiron, to better\ncharacterize its physical properties and presence of material on its\nsurroundings. We predicted and successfully observed two stellar occultations\nby Chiron. These observations were used to constrain its size and shape by\nfitting elliptical limbs with equivalent surface radii in agreement with\nradiometric measurements. Constraints on the (2060) Chiron shape are reported\nfor the first time. Assuming an equivalent radius of R$_{equiv}$ =\n105$^{+6}_{-7}$ km, we obtained a semi-major axis of a = 126 $\\pm$ 22 km.\nConsidering Chiron's true rotational light curve amplitude and assuming it has\na Jacobi equilibrium shape, we were able to derive a 3D shape with a semi-axis\nof a = 126 $\\pm$ 22 km, b = 109 $\\pm$ 19 km, and c = 68 $\\pm$ 13 km, implying\nin a volume-equivalent radius of R$_{vol}$ = 98 $\\pm$ 17 km, implying a density\nof 1119 $\\pm$ 4 kg m$^{-3}$. We determined the physical properties of the 2011\nsecondary events around Chiron, which may then be directly compared with those\nof Chariklo rings, as the same method was used. Data obtained from SAAO in 2018\ndo not show unambiguous evidence of the proposed rings, mainly due to the large\nsampling time. Meanwhile, we discarded the possible presence of a permanent\nring similar to (10199) Chariklo's C1R in optical depth and extension. Using\nthe first multi-chord stellar occultation by (2060) Chiron and considering it\nto have a Jacobi equilibrium shape, we derived its 3D shape. New observations\nof a stellar occultation by (2060) Chiron are needed to further investigate the\nmaterial's properties around Chiron, such as the occultation predicted for\nSeptember 10, 2023.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 14:59:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Braga-Ribas","Felipe",""],["Pereira","C. L.",""],["Sicardy","B.",""],["Ortiz","J. L.",""],["Desmars","J.",""],["Sickafoose","A.",""],["Emilio","M.",""],["Morgado","B.",""],["Margoti","G.",""],["Rommel","F. L.",""],["Camargo","J. I. B.",""],["Assafin","M.",""],["Vieira-Martins","R.",""],["Gomes-J\u00fanior","A. R.",""],["Santos-Sanz","P.",""],["Morales","N.",""],["Kretlow","M.",""],["Lecacheux","J.",""],["Colas","F.",""],["Boninsegna","R.",""],["Schreurs","O.",""],["Dauvergne","J. L.",""],["Fernandez","E.",""],["van Heerden","H. J.",""],["Gonz\u00e1lez","H.",""],["Bihel","D.",""],["Jankowsky","F.",""]]}
{"id":"2308.10043","submitter":"Anderson Porto","authors":"A. L. P. Porto, M. Buosi, G. S. Ferreira","title":"On the exponential Diophantine equation ${\\displaystyle p\\cdot\n  3^{x}+p^{y}=z^2}$ with $p$ a prime number","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 find non-negative integer solutions for exponential\nDiophantine equations of the type $p \\cdot 3^x+ p^y=z^2,$ where $p$ is a prime\nnumber. We prove that such equation has a unique solution\n$\\displaystyle{(x,y,z)=\\left(\\log_3(p-2), 0, p-1\\right)}$ if $2 \\neq p \\equiv 2\n\\pmod 3$ and $(x,y,z)=(0,1,2)$ if $p=2$. We also display the infinite solution\nset of that equation in the case $p=3$. Finally, a brief discussion of the case\n$p \\equiv 1 \\pmod 3$ is made, where we display an equation that does not have a\nnon-negative integer solution and leave some open questions. The proofs are\nbased on the use of the properties of the modular arithmetic.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:02:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Porto","A. L. P.",""],["Buosi","M.",""],["Ferreira","G. S.",""]]}
{"id":"2308.10044","submitter":"Dai Akita","authors":"Dai Akita and Daniel Thorsten Schenz","title":"A branch connection rule of one-way rail network","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":"  We deal with network inspired by toy train, which is constructed by\nconnecting Y-shaped branches. A train passes a branch through either of\nsplitted rails and not allowed to go backward. Under these assumptions, we\nconsider unidirectionality of a rail network, that is, there is a orientation\nof the rail network such that any trail of a train starting with the direction\ndoes not contradict to the orientation. We find that a rail network is one-way\nif and only if a digraph derived from the rail network is disconnected, which\nis also equal to no existence of cycle which contains odd number of tracks\nconnecting the same side of branches.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:05:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Akita","Dai",""],["Schenz","Daniel Thorsten",""]]}
{"id":"2308.10045","submitter":"Yang Bai","authors":"Min Cao, Yang Bai, Ziyin Zeng, Mang Ye, Min Zhang","title":"An Empirical Study of CLIP for Text-based Person Search","comments":"13 pages, 5 fiugres and 17 tables. Code is available at\n  https://github.com/Flame-Chasers/TBPS-CLIP","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Text-based Person Search (TBPS) aims to retrieve the person images using\nnatural language descriptions. Recently, Contrastive Language Image Pretraining\n(CLIP), a universal large cross-modal vision-language pre-training model, has\nremarkably performed over various cross-modal downstream tasks due to its\npowerful cross-modal semantic learning capacity. TPBS, as a fine-grained\ncross-modal retrieval task, is also facing the rise of research on the\nCLIP-based TBPS. In order to explore the potential of the visual-language\npre-training model for downstream TBPS tasks, this paper makes the first\nattempt to conduct a comprehensive empirical study of CLIP for TBPS and thus\ncontribute a straightforward, incremental, yet strong TBPS-CLIP baseline to the\nTBPS community. We revisit critical design considerations under CLIP, including\ndata augmentation and loss function. The model, with the aforementioned designs\nand practical training tricks, can attain satisfactory performance without any\nsophisticated modules. Also, we conduct the probing experiments of TBPS-CLIP in\nmodel generalization and model compression, demonstrating the effectiveness of\nTBPS-CLIP from various aspects. This work is expected to provide empirical\ninsights and highlight future CLIP-based TBPS research.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:08:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Min",""],["Bai","Yang",""],["Zeng","Ziyin",""],["Ye","Mang",""],["Zhang","Min",""]]}
{"id":"2308.10046","submitter":"Igor Letina","authors":"Jean-Michel Benkert, Igor Letina and Shuo Liu","title":"Startup Acquisitions: Acquihires and Talent Hoarding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a model of startup acquisitions, which may give rise to\ninefficient \"talent hoarding.\" We develop a model with two competing firms that\ncan acquire and integrate (or \"acquihire\") a startup operating in an orthogonal\nmarket. Such an acquihire improves the competitiveness of the acquiring firm.\nWe show that even absent the classical competition effects, acquihires need not\nbe benign but can be the result of oligopolistic behavior, leading to an\ninefficient allocation of talent. Further, we show that such talent hoarding\nmay reduce consumer surplus and lead to more job volatility for acquihired\nemployees.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:10:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Benkert","Jean-Michel",""],["Letina","Igor",""],["Liu","Shuo",""]]}
{"id":"2308.10047","submitter":"Rhys Howard","authors":"Ricardo Cannizzaro, Rhys Howard, Paulina Lewinska, Lars Kunze","title":"Towards Probabilistic Causal Discovery, Inference & Explanations for\n  Autonomous Drones in Mine Surveying Tasks","comments":"3 Pages, 1 Figure, To be published in the Proceedings of the\n  \"Causality for Robotics: Answering the Question of Why\" workshop at the 2023\n  IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS),\n  Adjusted initial submission version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Causal modelling offers great potential to provide autonomous agents the\nability to understand the data-generation process that governs their\ninteractions with the world. Such models capture formal knowledge as well as\nprobabilistic representations of noise and uncertainty typically encountered by\nautonomous robots in real-world environments. Thus, causality can aid\nautonomous agents in making decisions and explaining outcomes, but deploying\ncausality in such a manner introduces new challenges. Here we identify\nchallenges relating to causality in the context of a drone system operating in\na salt mine. Such environments are challenging for autonomous agents because of\nthe presence of confounders, non-stationarity, and a difficulty in building\ncomplete causal models ahead of time. To address these issues, we propose a\nprobabilistic causal framework consisting of: causally-informed POMDP planning,\nonline SCM adaptation, and post-hoc counterfactual explanations. Further, we\noutline planned experimentation to evaluate the framework integrated with a\ndrone system in simulated mine environments and on a real-world mine dataset.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:12:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cannizzaro","Ricardo",""],["Howard","Rhys",""],["Lewinska","Paulina",""],["Kunze","Lars",""]]}
{"id":"2308.10048","submitter":"Valentin Calisti","authors":"Valentin Calisti, \\v{S}\\'arka Ne\\v{c}asov\\'a","title":"Shape Optimization of hemolysis for shear thinning flows in moving\n  domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the $3$D problem of hemolysis minimization in blood flows, namely\nthe minimization of red blood cells damage, through the shape optimization of\nmoving domains. Such a geometry is adopted to take into account the modeling of\nrotating systems and blood pumps. The blood flow is described by generalized\nNavier-Stokes equations, in the particular case of shear thinning flows. The\nvelocity and stress fields are then used as data for a transport equation\ngoverning the hemolysis index, aimed to measure the red blood cells damage\nrate. For a sequence of converging moving domains, we show that a sequence of\nassociated solutions to blood equations converges to a solution of the problem\nwritten on the limit moving domain. Thus, we extended the result given in\n(Soko\\l{}owski, Stebel, 2014, in \\textit{Evol. Eq. Control Theory}) for $q \\geq\n11/5$, to the range $6/5< q < 11/5$, where $q$ is the exponent of the\nrheological law. We then show that the sequence of hemolysis index solutions\nalso converges to the limit solution. This shape continuity properties allows\nus to show the existence of minimal shapes for a class of functionals depending\non the hemolysis index.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:14:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Calisti","Valentin",""],["Ne\u010dasov\u00e1","\u0160\u00e1rka",""]]}
{"id":"2308.10049","submitter":"Lin Pengfei","authors":"Pengfei Lin, Ehsan Javanmardi, Manabu Tsukada","title":"Clothoid Curve-based Emergency-Stopping Path Planning with Adaptive\n  Potential Field for Autonomous Vehicles","comments":"14 pages, 20 figures, journal paper in submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Potential Field (PF)-based path planning method is widely adopted for\nautonomous vehicles (AVs) due to its real-time efficiency and simplicity. PF\noften creates a rigid road boundary, and while this ensures that the ego\nvehicle consistently operates within the confines of the road, it also brings a\nlurking peril in emergency scenarios. If nearby vehicles suddenly switch lanes,\nthe AV has to veer off and brake to evade a collision, leading to the \"blind\nalley\" effect. In such a situation, the vehicle can become trapped or confused\nby the conflicting forces from the obstacle vehicle PF and road boundary PF,\noften resulting in indecision or erratic behavior, even crashes. To address the\nabove-mentioned challenges, this research introduces an Emergency-Stopping Path\nPlanning (ESPP) that incorporates an adaptive PF (APF) and a clothoid curve for\nurgent evasion. First, we design an emergency triggering estimation to detect\nthe \"blind alley\" problem by analyzing the PF distribution. Second, we\nregionalize the driving scene to search the optimal breach point on the road PF\nand the final stopping point for the vehicle by considering the possible motion\nrange of the obstacle. Finally, we use the optimized clothoid curve to fit\nthese calculated points under vehicle dynamics constraints to generate a smooth\nemergency avoidance path. The proposed ESPP-based APF method was evaluated by\nconducting the co-simulation between MATLAB/Simulink and CarSim Simulator in a\nfreeway scene. The simulation results reveal that the proposed method shows\nincreased performance in emergency collision avoidance and renders the vehicle\nsafer, in which the duration of wheel slip is 61.9% shorter, and the maximum\nsteering angle amplitude is 76.9% lower than other potential field-based\nmethods.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:14:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Pengfei",""],["Javanmardi","Ehsan",""],["Tsukada","Manabu",""]]}
{"id":"2308.10050","submitter":"Zhenghe Bai","authors":"Zhiliang Ren, Zhenghe Bai, Penghui Yang, Lin Wang, and Hongliang Xu","title":"Complex unit lattice cell for low-emittance storage ring light source","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To achieve the true diffraction-limited emittance of a storage ring light\nsource, such as ~10 pm.rad for medium-energy electron beams, within a limited\ncircumference, it is generally necessary to increase the number of bending\nmagnets in a multi-bend achromat (MBA) lattice, as in the future upgrade plan\nof MAX IV with a 19BA replacing the current 7BA. However, this comes with\nextremely strong quadrupole and sextupole magnets and very limited space. The\nformer can result in very small vacuum chambers, increasing the coupling\nimpedance and thus enhancing the beam instabilities, and the latter can pose\nsignificant challenges in accommodating the necessary diagnostics and vacuum\ncomponents. Inspired by the hybrid MBA lattice concept, in this paper we\npropose a new unit lattice concept called the complex unit lattice cell, which\ncan reduce the magnet strengths and also save space. The complex unit cell is\nnumerically studied using a simplified model. Then as an example, a 17BA\nlattice based on the complex unit cell concept is designed for a 3 GeV storage\nring light source with a circumference of 537.6 m, which has a natural\nemittance of 19.3 pm.rad. This 17BA lattice is also compared with the 17BA\nlattice designed with conventional unit cells to showcase the benefits of the\ncomplex unit cell concept. This 17BA lattice also suggests a new type of MBA\nlattice, which we call the MBA lattice with semi-distributed chromatic\ncorrection.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:19:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ren","Zhiliang",""],["Bai","Zhenghe",""],["Yang","Penghui",""],["Wang","Lin",""],["Xu","Hongliang",""]]}
{"id":"2308.10051","submitter":"Yuxuan Liang","authors":"Kun Wang, Guohao Li, Shilong Wang, Guibin Zhang, Kai Wang, Yang You,\n  Xiaojiang Peng, Yuxuan Liang, Yang Wang","title":"The Snowflake Hypothesis: Training Deep GNN with One Node One Receptive\n  field","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":"  Despite Graph Neural Networks demonstrating considerable promise in graph\nrepresentation learning tasks, GNNs predominantly face significant issues with\nover-fitting and over-smoothing as they go deeper as models of computer vision\nrealm. In this work, we conduct a systematic study of deeper GNN research\ntrajectories. Our findings indicate that the current success of deep GNNs\nprimarily stems from (I) the adoption of innovations from CNNs, such as\nresidual/skip connections, or (II) the tailor-made aggregation algorithms like\nDropEdge. However, these algorithms often lack intrinsic interpretability and\nindiscriminately treat all nodes within a given layer in a similar manner,\nthereby failing to capture the nuanced differences among various nodes. To this\nend, we introduce the Snowflake Hypothesis -- a novel paradigm underpinning the\nconcept of ``one node, one receptive field''. The hypothesis draws inspiration\nfrom the unique and individualistic patterns of each snowflake, proposing a\ncorresponding uniqueness in the receptive fields of nodes in the GNNs.\n  We employ the simplest gradient and node-level cosine distance as guiding\nprinciples to regulate the aggregation depth for each node, and conduct\ncomprehensive experiments including: (1) different training schemes; (2)\nvarious shallow and deep GNN backbones, and (3) various numbers of layers (8,\n16, 32, 64) on multiple benchmarks (six graphs including dense graphs with\nmillions of nodes); (4) compare with different aggregation strategies. The\nobservational results demonstrate that our hypothesis can serve as a universal\noperator for a range of tasks, and it displays tremendous potential on deep\nGNNs. It can be applied to various GNN frameworks, enhancing its effectiveness\nwhen operating in-depth, and guiding the selection of the optimal network depth\nin an explainable and generalizable way.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:21:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Kun",""],["Li","Guohao",""],["Wang","Shilong",""],["Zhang","Guibin",""],["Wang","Kai",""],["You","Yang",""],["Peng","Xiaojiang",""],["Liang","Yuxuan",""],["Wang","Yang",""]]}
{"id":"2308.10052","submitter":"I. V. Kanatchikov","authors":"I.V. Kanatchikov","title":"The De Donder-Weyl Hamiltonian formulation of TEGR and its quantization","comments":"19pp","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The De Donder-Weyl (DW) Hamiltonian theory of fields treats space and time\nvariables on equal footing. Its quantization, called precanonical quantization,\nleads to a hypercomplex generalization of quantum formalism to field theory as\nit follows from the quantization of Poisson-Gerstenhaber brackets defined on\ndifferential forms. Our recent work on precanonical quantization of general\nrelativity is extended to the teleparallel equivalent of general relativity\n(TEGR) in tetrad Palatini formulation. The covariant precanonical Schr\\\"odinger\nequation for quantum TEGR and the relevant operators are constructed from the\nquantization of generalized Dirac brackets calculated using the constraints\nanalysis generalized to the DW Hamiltonian theory. Our analysis of the ordering\nambiguities in the precanonical Schr\\\"odinger equation allows us to estimate\nthe contribution to the cosmological constant from the quantum TEGR and argue\nits consistency with the observed value, albeit with the current error of\nestimation of 13 orders of magnitude due to the theoretical uncertainties in\nthe relation between the scale $\\varkappa$ introduced by precanonical\nquantization and the mass gap in the pure gauge sector of QCD.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:27:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kanatchikov","I. V.",""]]}
{"id":"2308.10053","submitter":"Zhankui He","authors":"Zhankui He, Zhouhang Xie, Rahul Jha, Harald Steck, Dawen Liang, Yesu\n  Feng, Bodhisattwa Prasad Majumder, Nathan Kallus, Julian McAuley","title":"Large Language Models as Zero-Shot Conversational Recommenders","comments":"Accepted as CIKM 2023 long paper. Longer version is coming soon\n  (e.g., more details about dataset)","journal-ref":null,"doi":"10.1145/3583780.3614949","report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present empirical studies on conversational recommendation\ntasks using representative large language models in a zero-shot setting with\nthree primary contributions. (1) Data: To gain insights into model behavior in\n\"in-the-wild\" conversational recommendation scenarios, we construct a new\ndataset of recommendation-related conversations by scraping a popular\ndiscussion website. This is the largest public real-world conversational\nrecommendation dataset to date. (2) Evaluation: On the new dataset and two\nexisting conversational recommendation datasets, we observe that even without\nfine-tuning, large language models can outperform existing fine-tuned\nconversational recommendation models. (3) Analysis: We propose various probing\ntasks to investigate the mechanisms behind the remarkable performance of large\nlanguage models in conversational recommendation. We analyze both the large\nlanguage models' behaviors and the characteristics of the datasets, providing a\nholistic understanding of the models' effectiveness, limitations and suggesting\ndirections for the design of future conversational recommenders\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:29:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["He","Zhankui",""],["Xie","Zhouhang",""],["Jha","Rahul",""],["Steck","Harald",""],["Liang","Dawen",""],["Feng","Yesu",""],["Majumder","Bodhisattwa Prasad",""],["Kallus","Nathan",""],["McAuley","Julian",""]]}
{"id":"2308.10054","submitter":"Andreas Athenodorou Apostolou","authors":"Andreas Athenodorou, Jacob Finkenrath, Adam Lantos and Michael Teper","title":"Glueball Spectrum with four light dynamical fermions","comments":"22 pages, 11 Figures. arXiv admin note: substantial text overlap with\n  arXiv:2212.02080","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We performed an evaluation of the glueball spectrum for $N_f=4$ dynamical\nfermions with masses corresponding to light pions. We did so by making use of\nensembles produced within the framework of maximally twisted fermions by the\nExtended Twisted Mass Collaboration (ETMC). We obtained masses of states that\nfall into the irreducible representations of the octahedral group of rotations\nin combination with the quantum numbers of charge conjugation $C$ and parity\n$P$; the above quantum numbers result in 20 distinct irreducible\nrepresentations. We implemented the Generalized Eigenvalue Problem (GEVP) using\nas a basis consisting only with gluonic operators. The purpose of this work is\nto investigate the effect of light dynamical quarks on the glueball spectrum\nand how this compares to the statistically more accurate spectrum of $SU(3)$\npure gauge theory. Given that glueball states may have broad widths and thus\nneed to be disentangled from all the relevant mixings, we used large ensembles\nof the order of ${\\sim {~\\cal O}}(20 {\\rm K})$ configurations. Despite the\nlarge ensembles, the statistical uncertainties restricted the extraction of the\nmasses to only a few irreducible representations; namely $A_1^{++}$,\n$A_1^{-+}$, $E^{++}$ as well as $T_2^{++}$. The results for the scalar\n$A_1^{++}$ representation suggest that an additional state appears in the\nscalar $A_1^{++}$ channel of the glueball spectrum. To further elucidate the\nnature of this state we performed a calculation for $N_f=2+1+1$ configurations\nand this demonstrates that it possesses a large quark content. Finally, the\nground states of the tensor channels $E^{++}$ and $T_2^{++}$ as well as of the\npseudoscalar channel $A_1^{-+}$ show minor effects due to the inclusion of\ndynamical quarks.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:32:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Athenodorou","Andreas",""],["Finkenrath","Jacob",""],["Lantos","Adam",""],["Teper","Michael",""]]}
{"id":"2308.10055","submitter":"Vinay M.S.","authors":"Vinay M.S., Shuhan Yuan, Xintao Wu","title":"Robust Fraud Detection via Supervised Contrastive Learning","comments":"16 pages, 5 figures, and 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning models have recently become popular for detecting malicious\nuser activity sessions in computing platforms. In many real-world scenarios,\nonly a few labeled malicious and a large amount of normal sessions are\navailable. These few labeled malicious sessions usually do not cover the entire\ndiversity of all possible malicious sessions. In many scenarios, possible\nmalicious sessions can be highly diverse. As a consequence, learned session\nrepresentations of deep learning models can become ineffective in achieving a\ngood generalization performance for unseen malicious sessions. To tackle this\nopen-set fraud detection challenge, we propose a robust supervised contrastive\nlearning based framework called ConRo, which specifically operates in the\nscenario where only a few malicious sessions having limited diversity is\navailable. ConRo applies an effective data augmentation strategy to generate\ndiverse potential malicious sessions. By employing these generated and\navailable training set sessions, ConRo derives separable representations w.r.t\nopen-set fraud detection task by leveraging supervised contrastive learning. We\nempirically evaluate our ConRo framework and other state-of-the-art baselines\non benchmark datasets. Our ConRo framework demonstrates noticeable performance\nimprovement over state-of-the-art baselines.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:33:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["S.","Vinay M.",""],["Yuan","Shuhan",""],["Wu","Xintao",""]]}
{"id":"2308.10056","submitter":"Awadhesh Narayan","authors":"Soumadeep Saha, Awadhesh Narayan","title":"Nonlinear Hall effect in Rashba systems with hexagonal warping","comments":"24 pages, 8 figures. To appear in J. Phys.: Condens. Matter","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rashba spin-orbit coupled systems are an important class of materials noted\nfor diverse fundamental and applied phenomena. Recently, the emergence of\nnon-linear Hall effect under conditions of time-reversal symmetry has been\ndiscovered in materials with broken inversion symmetry. In this work, we study\nthe second- and third-order Hall response in Rashba systems with hexagonal\nwarping. Starting with a low-energy model, we obtain the analytic expressions\nand discover the unique dipole profile in Rashba systems with hexagonal\nwarping. Furthermore, we extend the analysis using a realistic tight-binding\nmodel. Next, we predict the existence of a third-order Hall effect in these\nsystems, and calculate the Berry connection polarizability tensor analytically.\nWe also show how the model parameters affect the third-order conductivity. Our\npredictions can help in the experimental realization of Berry curvature\nmultipole physics in Rashba materials with hexagonal warping, and provide a new\nplatform for engineering the non-linear Hall effects.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:37:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saha","Soumadeep",""],["Narayan","Awadhesh",""]]}
{"id":"2308.10057","submitter":"Tomer Shushi","authors":"Yakir Aharonov and Tomer Shushi","title":"Improving the proof of the Born rule using a physical requirement on the\n  dynamics of quantum particles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a complete proof of the Born rule using an additional postulate\nstating that for a short enough time {\\Delta}t between two measurements, a\nproperty of a particle will keep its values fixed. This dynamical postulate\nallows us to produce the Born rule in its explicit form by improving the result\ngiven in [1]. While the proposed postulate is still not part of the quantum\nmechanics postulates, every experiment obeys it, and it can not be deduced\nusing the standard postulates of quantum mechanics.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:39:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aharonov","Yakir",""],["Shushi","Tomer",""]]}
{"id":"2308.10058","submitter":"M A Muktadir","authors":"MA Muktadir, Sydney Parker, Sun Yi","title":"R-C-P Method: An Autonomous Volume Calculation Method Using Image\n  Processing and Machine Vision","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine vision and image processing are often used with sensors for situation\nawareness in autonomous systems, from industrial robots to self-driving cars.\nThe 3D depth sensors, such as LiDAR (Light Detection and Ranging), Radar, are\ngreat invention for autonomous systems. Due to the complexity of the setup,\nLiDAR may not be suitable for some operational environments, for example, a\nspace environment. This study was motivated by a desire to get real-time\nvolumetric and change information with multiple 2D cameras instead of a depth\ncamera. Two cameras were used to measure the dimensions of a rectangular object\nin real-time. The R-C-P (row-column-pixel) method is developed using image\nprocessing and edge detection. In addition to the surface areas, the R-C-P\nmethod also detects discontinuous edges or volumes. Lastly, experimental work\nis presented for illustration of the R-C-P method, which provides the equations\nfor calculating surface area dimensions. Using the equations with given\ndistance information between the object and the camera, the vision system\nprovides the dimensions of actual objects.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:39:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Muktadir","MA",""],["Parker","Sydney",""],["Yi","Sun",""]]}
{"id":"2308.10059","submitter":"Yue Ma","authors":"Yue Ma, Xinmin Hou, Zhi Yin","title":"The degree threshold for covering with all the connected $3$-graphs with\n  $3$ edges","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given two $r$-uniform hypergraphs $F$ and $H$, we say that $H$ has an\n$F$-covering if every vertex in $H$ is contained in a copy of $F$. Let\n$c_{i}(n,F)$ be the least integer such that every $n$-vertex $r$-graph $H$ with\n$\\delta_{i}(H)>c_i(n,F)$ has an $F$-covering. Falgas-Ravry, Markst\\\"om and Zhao\n(Combin. Probab. Comput., 2021) asymptotically determined\n$c_1(n,K_{4}^{(3)-})$, where $K_{4}^{(3)-}$ is obtained by deleting an edge\nfrom the complete $3$-graph on $4$ vertices. Later, Tang, Ma and Hou (arXiv,\n2022) asymptotically determined $c_1(n,C_{6}^{(3)})$, where $C_{6}^{(3)}$ is\nthe linear triangle, i.e. $C_{6}^{(3)}=([6],\\{123,345,561\\})$. In this paper,\nwe determine $c_1(n,F_5)$ asymptotically, where $F_5$ is the generalized\ntriangle, i.e. $F_5=([5],\\{123,124,345\\})$. We also determine the exact values\nof $c_1(n,F)$, where $F$ is any connected $3$-graphs with $3$ edges and\n$F\\notin\\{K_4^{(3)-}, C_{6}^{(3)}, F_5\\}$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:44:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Yue",""],["Hou","Xinmin",""],["Yin","Zhi",""]]}
{"id":"2308.10060","submitter":"Orlando Luongo","authors":"Roberto Giamb\\`o, Orlando Luongo","title":"De Sitter-like configurations with asymptotic quintessence environment","comments":"14 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We examine a spherically-symmetric class of spacetimes carrying vacuum\nenergy, while considering the influence of an external dark energy environment\nrepresented by a non-dynamical quintessence field. Our investigation focuses on\na specific set of solutions affected by this field, leading to distinct kinds\nof spacetime deformations, resulting in regular, singular, and wormhole\nsolutions. We thoroughly discuss the underlying physics associated with each\ncase and demonstrate that more complex deformations are prone to instability.\nUltimately, we find that our results lead to an \\emph{isotropic de Sitter-like\nsolution} that behaves as a quintessence fluid. To achieve this, we investigate\nthe nature of the corresponding fluid, showing that it cannot provide the sound\nspeed equal to a constant equation of state near the center. Consequently, we\nreinterpret the fluid as a slow-roll quintessence by investigating its behavior\nin asymptotic regimes. Further, we explore the potential implications of\nviolating the isotropy condition on the pressures and we finally compare our\nfindings with the de Sitter and Hayward solutions, highlighting both the\nadvantages and disadvantages of our scenarios.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:46:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Giamb\u00f2","Roberto",""],["Luongo","Orlando",""]]}
{"id":"2308.10061","submitter":"Chen Xu","authors":"Chen Xu, Yuhan Zhu, Guozhen Zhang, Haocheng Shen, Yixuan Liao, Xiaoxin\n  Chen, Gangshan Wu, Limin Wang","title":"DPL: Decoupled Prompt Learning for Vision-Language Models","comments":"11 pages, 5 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Prompt learning has emerged as an efficient and effective approach for\ntransferring foundational Vision-Language Models (e.g., CLIP) to downstream\ntasks. However, current methods tend to overfit to seen categories, thereby\nlimiting their generalization ability for unseen classes. In this paper, we\npropose a new method, Decoupled Prompt Learning (DPL), which reformulates the\nattention in prompt learning to alleviate this problem. Specifically, we\ntheoretically investigate the collaborative process between prompts and\ninstances (i.e., image patches/text tokens) by reformulating the original\nself-attention into four separate sub-processes. Through detailed analysis, we\nobserve that certain sub-processes can be strengthened to bolster robustness\nand generalizability by some approximation techniques. Furthermore, we\nintroduce language-conditioned textual prompting based on decoupled attention\nto naturally preserve the generalization of text input. Our approach is\nflexible for both visual and textual modalities, making it easily extendable to\nmulti-modal prompt learning. By combining the proposed techniques, our approach\nachieves state-of-the-art performance on three representative benchmarks\nencompassing 15 image recognition datasets, while maintaining\nparameter-efficient. Moreover, our DPL does not rely on any auxiliary\nregularization task or extra training data, further demonstrating its\nremarkable generalization ability.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:48:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Chen",""],["Zhu","Yuhan",""],["Zhang","Guozhen",""],["Shen","Haocheng",""],["Liao","Yixuan",""],["Chen","Xiaoxin",""],["Wu","Gangshan",""],["Wang","Limin",""]]}
{"id":"2308.10062","submitter":"Supriya Manna","authors":"Supriya Manna and Krishna Siva Prasad Mudigonda","title":"Revitalising the Single Batch Environment: A 'Quest' to Achieve Fairness\n  and Efficiency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.OS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the realm of computer systems, efficient utilisation of the CPU (Central\nProcessing Unit) has always been a paramount concern. Researchers and engineers\nhave long sought ways to optimise process execution on the CPU, leading to the\nemergence of CPU scheduling as a field of study. This research proposes a novel\nalgorithm for batch processing that operates on a preemptive model, dynamically\nassigning priorities based on a robust ratio, employing a dynamic time slice,\nand utilising periodic sorting technique to achieve fairness. By engineering\nthis responsive and fair model, the proposed algorithm strikes a delicate\nbalance between efficiency and fairness, providing an optimised solution for\nbatch scheduling while ensuring system responsiveness.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:55:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Manna","Supriya",""],["Mudigonda","Krishna Siva Prasad",""]]}
{"id":"2308.10063","submitter":"Murod Bahovadinov","authors":"M. S. Bahovadinov, R. O. Sharipov, B. L. Altshuler, and G. V.\n  Shlyapnikov","title":"Tomonaga-Luttinger liquid-Bose glass phase transition in a system of 1D\n  disordered fermions with pair hoppings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a one-dimensional system of spinless fermions with single\nparticle and pair hoppings in a potential on-site disorder. The pair hopping\nterm violates integrability of the model and enhances superconducting\nfluctuations in the bulk of the liquid. By means of the Abelian bosonization\nand extensive numerical DMRG calculations we provide evidence that sufficiently\nlarge pair hopping amplitude guarantees the survival of the Tomonaga-Luttinger\nliquid phase at weak disorder. Large disorder drives the system to the Bose\nglass phase, realising the Giamarchi-Schulz scenario in such a system.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:56:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bahovadinov","M. S.",""],["Sharipov","R. O.",""],["Altshuler","B. L.",""],["Shlyapnikov","G. V.",""]]}
{"id":"2308.10064","submitter":"Pranav Singh","authors":"Pranav Singh and Jacopo Cirrone","title":"Efficient Representation Learning for Healthcare with\n  Cross-Architectural Self-Supervision","comments":"Accepted at MLHC 2023. Extended conference version of\n  arXiv:2206.04170","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 healthcare and biomedical applications, extreme computational requirements\npose a significant barrier to adopting representation learning. Representation\nlearning can enhance the performance of deep learning architectures by learning\nuseful priors from limited medical data. However, state-of-the-art\nself-supervised techniques suffer from reduced performance when using smaller\nbatch sizes or shorter pretraining epochs, which are more practical in clinical\nsettings. We present Cross Architectural - Self Supervision (CASS) in response\nto this challenge. This novel siamese self-supervised learning approach\nsynergistically leverages Transformer and Convolutional Neural Networks (CNN)\nfor efficient learning. Our empirical evaluation demonstrates that CASS-trained\nCNNs and Transformers outperform existing self-supervised learning methods\nacross four diverse healthcare datasets. With only 1% labeled data for\nfinetuning, CASS achieves a 3.8% average improvement; with 10% labeled data, it\ngains 5.9%; and with 100% labeled data, it reaches a remarkable 10.13%\nenhancement. Notably, CASS reduces pretraining time by 69% compared to\nstate-of-the-art methods, making it more amenable to clinical implementation.\nWe also demonstrate that CASS is considerably more robust to variations in\nbatch size and pretraining epochs, making it a suitable candidate for machine\nlearning in healthcare applications.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:57:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singh","Pranav",""],["Cirrone","Jacopo",""]]}
{"id":"2308.10065","submitter":"Chih-Chun Chien","authors":"Yan He and Chih-Chun Chien","title":"Vortex structure and spectrum of atomic Fermi superfluid in a spherical\n  bubble trap","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.supr-con quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The structures of multiply quantized vortices (MQVs) of equal-population\natomic Fermi superfluid in a rotating spherical bubble trap are analyzed by\nsolving the Bogoliubov-de Gennes (BdG) equation throughout the BCS-Bose\nEinstein condensation (BEC) crossover. Consistent with the Poincare-Hopf\ntheorem, a pair of vortices emerge at the poles of the rotation axis in the\npresence of azimuthal symmetry, and the compact geometry provides confinement\nfor the MQVs. While the single-vorticity vortex structure is similar to that in\na planar geometry, higher-vorticity vortices exhibit interesting phenomena at\nthe vortex center, such as a density peak due to accumulation of normal Fermi\ngas and reversed circulation of current due to in-gap states carrying angular\nmomentum, in the BCS regime but not the BEC regime because of the subtle\nrelations between the order parameter and density. The energy spectrum shows\nthe number of the in-gap state branches corresponds to the vorticity of a\nvortex, and an explanation based on topological correspondence is provided.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:03:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["He","Yan",""],["Chien","Chih-Chun",""]]}
{"id":"2308.10066","submitter":"Tomasz Raducha","authors":"Tomasz Raducha, Jaros{\\l}aw Klamut, Roger Cremades, Paul Bouman,\n  Mateusz Wili\\'nski","title":"Vulnerability of democratic electoral systems","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":"  The two most common types of electoral systems (ES) used in electing national\nlegislatures are proportional representation and plurality voting. When they\nare evaluated, most often the arguments come from social choice theory and\npolitical sciences. The former overall uses an axiomatic approach including a\nlist of mathematical criteria a system should fulfill. The latter predominantly\nfocuses on the trade-off between proportionality of apportionment and\ngovernability. However, there is no consensus on the best ES, nor on the set of\nindexes and measures that would be the most important in such assessment.\nMoreover, the ongoing debate about the fairness of national elections neglects\nthe study of their vulnerabilities. Here we address this research gap with a\nframework that can measure electoral systems' vulnerability to different means\nof influence. Using in silico analysis we show that plurality voting systems\nare less stable than proportional representation. They are also more\nsusceptible to political agitators and media propaganda. A review of real-world\nES reveals possible improvements in their design leading to lower\nsusceptibility. Additionally, our simulation framework allows computation of\npopular indexes, as the Gallagher index or the effective number of parties, in\ndifferent scenarios. Our work provides a new tool for dealing with modern\nthreats to democracy that could destabilize voting processes. Furthermore, our\nresults add an important argument in a long-standing discussion on evaluation\nof ES.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:16:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Raducha","Tomasz",""],["Klamut","Jaros\u0142aw",""],["Cremades","Roger",""],["Bouman","Paul",""],["Wili\u0144ski","Mateusz",""]]}
{"id":"2308.10067","submitter":"Ayman Shehata","authors":"Ayman Shehata, Ghazi S. Khammsh, Ajay K. Shukla and Shimaa I. Moustafa","title":"On incomplete exponential $\\;_{r}R_{s}(P,Q,z)$ matrix function","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The recurrence matrix relations, differentiation formulas, and analytical and\nfractional integral properties of incomplete gamma matrix functions $\\gamma(Q,\nx)$ and $\\Gamma(Q, x)$ are all covered in this article. The generalized\nincomplete exponential matrix functions with their integral representations\nfunctions have been examined, along with some relevant characteristics of these\nfunctions such as integral representations functions . Additionally, the\ninfinite summation relations and formulas for two sequences are shown, along\nwith the generalized incomplete exponential matrix functions with the integral\nrepresentation, addition formula for addition of two arguments, multiplication\nformula for multiplication of two arguments, and recurrence matrix relation.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:20:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shehata","Ayman",""],["Khammsh","Ghazi S.",""],["Shukla","Ajay K.",""],["Moustafa","Shimaa I.",""]]}
{"id":"2308.10068","submitter":"Duo Wu","authors":"Duo Wu, Dayou Zhang, Miao Zhang, Ruoyu Zhang, Fangxin Wang, Shuguang\n  Cui","title":"ILCAS: Imitation Learning-Based Configuration-Adaptive Streaming for\n  Live Video Analytics with Cross-Camera Collaboration","comments":"This work has been submitted to the IEEE Transactions on Mobile\n  Computing 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":"cs.NI cs.LG cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The high-accuracy and resource-intensive deep neural networks (DNNs) have\nbeen widely adopted by live video analytics (VA), where camera videos are\nstreamed over the network to resource-rich edge/cloud servers for DNN\ninference. Common video encoding configurations (e.g., resolution and frame\nrate) have been identified with significant impacts on striking the balance\nbetween bandwidth consumption and inference accuracy and therefore their\nadaption scheme has been a focus of optimization. However, previous\nprofiling-based solutions suffer from high profiling cost, while existing deep\nreinforcement learning (DRL) based solutions may achieve poor performance due\nto the usage of fixed reward function for training the agent, which fails to\ncraft the application goals in various scenarios. In this paper, we propose\nILCAS, the first imitation learning (IL) based configuration-adaptive VA\nstreaming system. Unlike DRL-based solutions, ILCAS trains the agent with\ndemonstrations collected from the expert which is designed as an offline\noptimal policy that solves the configuration adaption problem through dynamic\nprogramming. To tackle the challenge of video content dynamics, ILCAS derives\nmotion feature maps based on motion vectors which allow ILCAS to visually\n``perceive'' video content changes. Moreover, ILCAS incorporates a cross-camera\ncollaboration scheme to exploit the spatio-temporal correlations of cameras for\nmore proper configuration selection. Extensive experiments confirm the\nsuperiority of ILCAS compared with state-of-the-art solutions, with 2-20.9%\nimprovement of mean accuracy and 19.9-85.3% reduction of chunk upload lag.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:20:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Duo",""],["Zhang","Dayou",""],["Zhang","Miao",""],["Zhang","Ruoyu",""],["Wang","Fangxin",""],["Cui","Shuguang",""]]}
{"id":"2308.10069","submitter":"Rien Quirynen","authors":"Rien Quirynen, Sleiman Safaoui, Stefano Di Cairano","title":"Real-time Mixed-Integer Quadratic Programming for Vehicle Decision\n  Making and Motion Planning","comments":"14 pages, 11 figures, 3 tables, submitted to IEEE Transactions on\n  Control Systems Technology","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":"  We develop a real-time feasible mixed-integer programming-based decision\nmaking (MIP-DM) system for automated driving. Using a linear vehicle model in a\nroad-aligned coordinate frame, the lane change constraints, collision avoidance\nand traffic rules can be formulated as mixed-integer inequalities, resulting in\na mixed-integer quadratic program (MIQP). The proposed MIP-DM simultaneously\nperforms maneuver selection and trajectory generation by solving the MIQP at\neach sampling time instant. While solving MIQPs in real time has been\nconsidered intractable in the past, we show that our recently developed solver\nBB-ASIPM is capable of solving MIP-DM problems on embedded hardware in real\ntime. The performance of this approach is illustrated in simulations in various\nscenarios including merging points and traffic intersections, and\nhardware-in-the-loop simulations on dSPACE Scalexio and MicroAutoBox-III.\nFinally, we present results from hardware experiments on small-scale automated\nvehicles.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:30:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Quirynen","Rien",""],["Safaoui","Sleiman",""],["Di Cairano","Stefano",""]]}
{"id":"2308.10070","submitter":"Shintaro Suzuki","authors":"Shintaro Suzuki, Azusa Motouri, Kazuhiko Deguchi, Tsunetomo Yamada,\n  Asuka Ishikawa, Takenori Fujii, Kazuhiro Nawa, Taku J. Sato, Ryuji Tamura","title":"Atomic structure and magnetism of the Au-Ga-Ce 1/1 approximant crystal","comments":"8 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 a new Au-Ga-Ce 1/1 approximant crystal (AC) which possesses a\nsignificantly wide single-phase region of 53 - 70 at% Au and 13.6 - 15.1 at%\nCe. Single crystal X-ray structural analyses reveal the existence of two types\nof structural degrees of freedom, i.e., the Au/Ga mixing sites and the\nfractional Ce occupancy site: the former enables a large variation in the\nelectron concentration and the latter allows a variation in the occupancy of a\nmagnetic impurity atom at the center of the Tsai-type cluster. Following these\nfindings, the influences of two types of structural modifications on the\nmagnetism are thoroughly investigated by means of magnetic susceptibility and\nspecific heat measurements on the Au-Ga-Ce 1/1 AC. The spin-glass (SG) state is\nfound to be the ground state over the entire single-phase region, showing a\nrobust nature of the SG state against both structural modifications. In\naddition, a gigantic specific heat (C/T) is commonly observed at low\ntemperatures for all the compositions, which is consistently explained as a\nconsequence of the spin-freezing phenomenon, not of a heavy Fermion behavior as\nreported elsewhere. Moreover, the origin of the SG state in the 1/1 Au-Ga-Ce AC\nis attributed to the existence of non-magnetic atom disorder in the Au/Ga\nmixing sites. Furthermore, a Kondo behavior is observed in the electrical\nresistivity at low temperatures, which is enhanced by increasing the Ce\nconcentration, verifying that a Ce atom introduced at the cluster center\nbehaves as a Kondo impurity for the first time.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:30:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Suzuki","Shintaro",""],["Motouri","Azusa",""],["Deguchi","Kazuhiko",""],["Yamada","Tsunetomo",""],["Ishikawa","Asuka",""],["Fujii","Takenori",""],["Nawa","Kazuhiro",""],["Sato","Taku J.",""],["Tamura","Ryuji",""]]}
{"id":"2308.10071","submitter":"Juan P. Madrid","authors":"F. Massaro (UniTO, INAF-OATo, INFN-To, CIFS), S. V. White (Rhodes\n  University), A. Garcia-Perez (UniTO, INAOE), A. Jimenez-Gallardo (UniTO,\n  INAF-OATo, UniBologna), A. Capetti (INAF-OATo), C.C. Cheung (NRL), W. R.\n  Forman (CfA Harvard & Smithsonian), C. Mazzucchelli (ESO, Univ. Diego\n  Portales), A. Paggi (UniTO, INAF-OATo, INFN-To), N. P. H. Nesvadba\n  (Universite de la Cote d'Azur, CNRS), J. P. Madrid (UTexas-RGV), I. Andruchow\n  (IAR, CONICET-CICPBA-UNLP), S. Cellone (Univ. Nacional de La Plata,\n  CONICET-UNLP-UNC-UNSJ), H. A. Pena-Herazo (East Asian Observatory), R.\n  Grossova (Masaryk University, Czech Academy of Sciences), B. Balmaverde\n  (INAF-OATo) E. Sani (ESO), V. Chavushyan (INAOE CfA Harvard & Smithsonian),\n  R. P. Kraft (CfA Harvard & Smithsonian) V. Reynaldi (Univ. Nacional de La\n  Plata, CCT La Plata-CONICET-UNLP), C. Leto (Agenzia Spaziale Italiana)","title":"Powerful Radio Sources in the Southern Sky. I. Optical Identifications","comments":"72 pages, 35 figures, 5 Tables","journal-ref":"The Astrophysical Journal Supplement Series, 265, 32 (2023)","doi":"10.3847/1538-4365/acaf05","report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the early sixties, our view of radio galaxies and quasars has been\ndrastically shaped by discoveries made thanks to observations of radio sources\nlisted in the Third Cambridge catalog and its revised version (3CR). However,\nthe largest fraction of data collected to date on 3CR sources was performed\nwith relatively old instruments, rarely repeated and/or updated. Importantly,\nthe 3CR contains only objects located in the Northern Hemisphere thus having\nlimited access to new and innovative astronomical facilities. To mitigate these\nlimitations we present a new catalog of powerful radio sources visible from the\nSouthern Hemisphere, extracted from the GLEAM 4-Jy (G4Jy) catalog and based on\nequivalent selection criteria as the 3CR. This new catalog, named G4Jy- 3CRE,\nwhere the E stands for \"equivalent\", lists a total of 264 sources at\ndeclination below -5 degrees and with 9 Jy limiting sensitivity at ~178 MHz. We\nexplored archival radio maps obtained with different surveys and compared then\nwith optical images available in the Pan-STARRS, DES and DSS databases to\nsearch for optical counterparts of their radio cores. We compared mid-infrared\ncounterparts, originally associated in the G4Jy, with the optical ones\nidentified here and we present results of a vast literature search carried out\nto collect redshift estimates for all G4Jy-3CRE sources resulting in a total of\n145 reliable z measurements.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:32:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Massaro","F.","","UniTO, INAF-OATo, INFN-To, CIFS"],["White","S. V.","","Rhodes\n  University"],["Garcia-Perez","A.","","UniTO, INAOE"],["Jimenez-Gallardo","A.","","UniTO,\n  INAF-OATo, UniBologna"],["Capetti","A.","","INAF-OATo"],["Cheung","C. C.","","NRL"],["Forman","W. R.","","CfA Harvard & Smithsonian"],["Mazzucchelli","C.","","ESO, Univ. Diego\n  Portales"],["Paggi","A.","","UniTO, INAF-OATo, INFN-To"],["Nesvadba","N. P. H.","","Universite de la Cote d'Azur, CNRS"],["Madrid","J. P.","","UTexas-RGV"],["Andruchow","I.","","IAR, CONICET-CICPBA-UNLP"],["Cellone","S.","","Univ. Nacional de La Plata,\n  CONICET-UNLP-UNC-UNSJ"],["Pena-Herazo","H. A.","","East Asian Observatory"],["Grossova","R.","","Masaryk University, Czech Academy of Sciences"],["Balmaverde","B.","","INAF-OATo"],["Sani","E.","","ESO"],["Chavushyan","V.","","INAOE CfA Harvard & Smithsonian"],["Kraft","R. P.","","CfA Harvard & Smithsonian"],["Reynaldi","V.","","Univ. Nacional de La\n  Plata, CCT La Plata-CONICET-UNLP"],["Leto","C.","","Agenzia Spaziale Italiana"]]}
{"id":"2308.10072","submitter":"Prerona Dutta","authors":"Prerona Dutta","title":"Well-posedness of the two-component Fornberg-Whitham system in Besov\n  spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The present paper establishes well-posedness for the two-component\nFornberg-Whitham system in Besov spaces. First the existence and uniqueness of\nits solution is proved, then it is shown that the corresponding\ndata-to-solution map is continuous, provided the initial data belong to Besov\nspaces.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:47:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dutta","Prerona",""]]}
{"id":"2308.10073","submitter":"V. Arvind","authors":"V. Arvind and Samir Datta and Asif Khan and Shivdutt Sharma and Yadu\n  Vasudev and Shankar Ram Vasudevan","title":"The Parallel Dynamic Complexity of the Abelian Cayley Group Membership\n  Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a finite group given as input by its multiplication table. For a\nsubset $S$ of $G$ and an element $g\\in G$ the Cayley Group Membership Problem\n(denoted CGM) is to check if $g$ belongs to the subgroup generated by $S$.\nWhile this problem is easily seen to be in polynomial time, pinpointing its\nparallel complexity has been of research interest over the years. In this paper\nwe further explore the parallel complexity of the abelian CGM problem, with\nfocus on the dynamic setting: the generating set $S$ changes with insertions\nand deletions and the goal is to maintain a data structure that supports\nefficient membership queries to the subgroup $\\angle{S}$. We obtain the\nfollowing results:\n  1. We first consider the more general problem of Monoid Membership. When $G$\nis a commutative monoid we give a deterministic dynamic algorithm\n  constant time parallel algorithm for membership testing that supports $O(1)$\ninsertions and deletions in each step.\n  2. Building on the previous result we show that there is a dynamic randomized\nconstant-time parallel algorithm for abelian CGM that supports\npolylogarithmically many insertions/deletions to $S$ in each step.\n  3. If the number of insertions/deletions is at most $O(\\log n/\\log\\log n)$\nthen we obtain a deterministic dynamic constant-time parallel algorithm for the\nproblem.\n  4. We obtain analogous results for the dynamic abelian Group Isomorphism.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:47:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Arvind","V.",""],["Datta","Samir",""],["Khan","Asif",""],["Sharma","Shivdutt",""],["Vasudev","Yadu",""],["Vasudevan","Shankar Ram",""]]}
{"id":"2308.10074","submitter":"Ashwin Gopal","authors":"Ashwin Gopal, Massimiliano Esposito and Nahuel Freitas","title":"Thermodynamic cost of precise timekeeping in an electronic underdamped\n  clock","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Clocks are inherently out-of-equilibrium because, due to friction, they\nconstantly consume free energy to keep track of time. The Thermodynamic\nUncertainty Relation (TUR) quantifies the trade-off between the precision of\nany time-antisymmetric observable and entropy production. In the context of\nclocks, the TUR implies that a minimum entropy production is needed in order to\nachieve a certain level of precision in timekeeping. But the TUR has only been\nproven for overdamped systems. Recently, a toy model of a classical underdamped\npendulum clock was proposed that violated these relations (Phys. Rev. Lett.\n128, 130606), thus demonstrating that the TUR do not hold for underdamped\ndynamics. We propose an electronic implementation of such a clock, using a\nresistor-inductor-capacitor (RLC) circuit and a biased CMOS inverter (NOT\ngate), which can work at different scales. We find that in the nanoscopic\nsingle-electron regime of the circuit, we essentially recover the toy model\nviolating the TUR bound. However, in different macroscopic regimes of the\ncircuit, we show that the TUR bound is restored and analyze the thermodynamic\nefficiency of timekeeping.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 16:54:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gopal","Ashwin",""],["Esposito","Massimiliano",""],["Freitas","Nahuel",""]]}
{"id":"2308.10075","submitter":"N. A. Carella","authors":"N. A. Carella","title":"Largest Prime Factors of Quadratic Polynomials","comments":"Seven Pages. Keywords: Prime number; Distribution of prime;\n  Polynomial prime value","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p\\equiv 1 \\bmod 4$ be a prime number and let $x>1$ be a large number.\nThis note shows that the largest prime factor of the finite product\n$\\prod_{x\\leq n\\leq 2x}\\left(n^2+1 \\right)$ satisfies the relation $p \\geq\nx^{4/3}$ as $x$ tends to infinity. This improves the current estimate $p \\geq\nx^{1.279}$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:08:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Carella","N. A.",""]]}
{"id":"2308.10076","submitter":"Elena Bunina","authors":"Elena Bunina and Boris Kunyavskii","title":"Sha-rigidity of Chevalley groups over local rings","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that every locally inner endomorphism of a Chevalley group (or its\nelementary subgroup) over a local ring with an irreducible root system of rank\n>1 (with 1/2 for the systems A_2, F_4, B_l, C_l and with 1/3 for the system\nG_2) is inner, so that all these groups are Sha-rigid.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:40:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bunina","Elena",""],["Kunyavskii","Boris",""]]}
{"id":"2308.10077","submitter":"Asif Khan","authors":"Asif Khan, Amos Storkey","title":"Contrastive Learning for Non-Local Graphs with Multi-Resolution\n  Structural Views","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning node-level representations of heterophilic graphs is crucial for\nvarious applications, including fraudster detection and protein function\nprediction. In such graphs, nodes share structural similarity identified by the\nequivalence of their connectivity which is implicitly encoded in the form of\nhigher-order hierarchical information in the graphs. The contrastive methods\nare popular choices for learning the representation of nodes in a graph.\nHowever, existing contrastive methods struggle to capture higher-order graph\nstructures. To address this limitation, we propose a novel multiview\ncontrastive learning approach that integrates diffusion filters on graphs. By\nincorporating multiple graph views as augmentations, our method captures the\nstructural equivalence in heterophilic graphs, enabling the discovery of hidden\nrelationships and similarities not apparent in traditional node\nrepresentations. Our approach outperforms baselines on synthetic and real\nstructural datasets, surpassing the best baseline by $16.06\\%$ on Cornell,\n$3.27\\%$ on Texas, and $8.04\\%$ on Wisconsin. Additionally, it consistently\nachieves superior performance on proximal tasks, demonstrating its\neffectiveness in uncovering structural information and improving downstream\napplications.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:42:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khan","Asif",""],["Storkey","Amos",""]]}
{"id":"2308.10078","submitter":"Rungroj Maipradit","authors":"Rungroj Maipradit, Dong Wang, Patanamon Thongtanunam, Raula Gaikovina\n  Kula, Yasutaka Kamei, Shane McIntosh","title":"Repeated Builds During Code Review: An Empirical Study of the OpenStack\n  Community","comments":"conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Code review is a popular practice where developers critique each others'\nchanges. Since automated builds can identify low-level issues (e.g., syntactic\nerrors, regression bugs), it is not uncommon for software organizations to\nincorporate automated builds in the code review process. In such code review\ndeployment scenarios, submitted change sets must be approved for integration by\nboth peer code reviewers and automated build bots. Since automated builds may\nproduce an unreliable signal of the status of a change set (e.g., due to\n``flaky'' or non-deterministic execution behaviour), code review tools, such as\nGerrit, allow developers to request a ``recheck'', which repeats the build\nprocess without updating the change set. We conjecture that an unconstrained\nrecheck command will waste time and resources if it is not applied judiciously.\nTo explore how the recheck command is applied in a practical setting, in this\npaper, we conduct an empirical study of 66,932 code reviews from the OpenStack\ncommunity.\n  We quantitatively analyze (i) how often build failures are rechecked; (ii)\nthe extent to which invoking recheck changes build failure outcomes; and (iii)\nhow much waste is generated by invoking recheck. We observe that (i) 55% of\ncode reviews invoke the recheck command after a failing build is reported; (ii)\ninvoking the recheck command only changes the outcome of a failing build in 42%\nof the cases; and (iii) invoking the recheck command increases review waiting\ntime by an average of 2,200% and equates to 187.4 compute years of waste --\nenough compute resources to compete with the oldest land living animal on\nearth.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:45:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maipradit","Rungroj",""],["Wang","Dong",""],["Thongtanunam","Patanamon",""],["Kula","Raula Gaikovina",""],["Kamei","Yasutaka",""],["McIntosh","Shane",""]]}
{"id":"2308.10079","submitter":"Ernie Chu","authors":"Ernie Chu, Tzuhsuan Huang, Shuo-Yen Lin, Jun-Cheng Chen","title":"MeDM: Mediating Image Diffusion Models for Video-to-Video Translation\n  with Temporal Correspondence Guidance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study introduces an efficient and effective method, MeDM, that utilizes\npre-trained image Diffusion Models for video-to-video translation with\nconsistent temporal flow. The proposed framework can render videos from scene\nposition information, such as a normal G-buffer, or perform text-guided editing\non videos captured in real-world scenarios. We employ explicit optical flows to\nconstruct a practical coding that enforces physical constraints on generated\nframes and mediates independent frame-wise scores. By leveraging this coding,\nmaintaining temporal consistency in the generated videos can be framed as an\noptimization problem with a closed-form solution. To ensure compatibility with\nStable Diffusion, we also suggest a workaround for modifying observed-space\nscores in latent-space Diffusion Models. Notably, MeDM does not require\nfine-tuning or test-time optimization of the Diffusion Models. Through\nextensive qualitative, quantitative, and subjective experiments on various\nbenchmarks, the study demonstrates the effectiveness and superiority of the\nproposed approach.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:59:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chu","Ernie",""],["Huang","Tzuhsuan",""],["Lin","Shuo-Yen",""],["Chen","Jun-Cheng",""]]}
{"id":"2308.10080","submitter":"Yulia Petrova","authors":"Alexander Nazarov and Yulia Petrova","title":"$L_2$-small ball asymptotics for some demeaned Gaussian processes","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 discuss the centering operation for the Green Gaussian processes and\ncalculate $L_2$-small ball asymptotics for some centered (demeaned) processes.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:02:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nazarov","Alexander",""],["Petrova","Yulia",""]]}
{"id":"2308.10081","submitter":"Tim Sullivan","authors":"Ilja Klebanov and T. J. Sullivan","title":"Transporting Higher-Order Quadrature Rules: Quasi-Monte Carlo Points and\n  Sparse Grids for Mixture Distributions","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Integration against, and hence sampling from, high-dimensional probability\ndistributions is of essential importance in many application areas and has been\nan active research area for decades. One approach that has drawn increasing\nattention in recent years has been the generation of samples from a target\ndistribution $\\mathbb{P}_{\\mathrm{tar}}$ using transport maps: if\n$\\mathbb{P}_{\\mathrm{tar}} = T_\\# \\mathbb{P}_{\\mathrm{ref}}$ is the pushforward\nof an easily-sampled probability distribution $\\mathbb{P}_{\\mathrm{ref}}$ under\nthe transport map $T$, then the application of $T$ to\n$\\mathbb{P}_{\\mathrm{ref}}$-distributed samples yields\n$\\mathbb{P}_{\\mathrm{tar}}$-distributed samples. This paper proposes the\napplication of transport maps not just to random samples, but also to\nquasi-Monte Carlo points, higher-order nets, and sparse grids in order for the\ntransformed samples to inherit the original convergence rates that are often\nbetter than $N^{-1/2}$, $N$ being the number of samples/quadrature nodes. Our\nmain result is the derivation of an explicit transport map for the case that\n$\\mathbb{P}_{\\mathrm{tar}}$ is a mixture of simple distributions, e.g.\\ a\nGaussian mixture, in which case application of the transport map $T$ requires\nthe solution of an \\emph{explicit} ODE with \\emph{closed-form} right-hand side.\nMixture distributions are of particular applicability and interest since many\nmethods proceed by first approximating $\\mathbb{P}_{\\mathrm{tar}}$ by a mixture\nand then sampling from that mixture (often using importance reweighting).\nHence, this paper allows for the sampling step to provide a better convergence\nrate than $N^{-1/2}$ for all such methods.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:09:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Klebanov","Ilja",""],["Sullivan","T. J.",""]]}
{"id":"2308.10082","submitter":"Thomas Vandermeulen","authors":"Thomas Vandermeulen","title":"Mixed Symmetries of SPT Phases","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Symmetry Protected Topological (SPT) phases describe trivially-acting\nsymmetries. We argue that a symmetry-based description of SPT phases ought to\ninclude the topological twist fields associated to the symmetry. Doing so\nallows us to predict the results of gauging part or all of the symmetries of\nthese theories.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:09:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Vandermeulen","Thomas",""]]}
{"id":"2308.10083","submitter":"Qian Huang","authors":"Yihong Chen, Qian Huang, Wen-An Yong, Ruixi Zhang","title":"Poisson quadrature method of moments for 2D kinetic equations with\n  velocity of constant magnitude","comments":"26 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.soft cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work is concerned with kinetic equations with velocity of constant\nmagnitude. We propose a quadrature method of moments based on the Poisson\nkernel, called Poisson-EQMOM. The derived moment closure systems are well\ndefined for all physically relevant moments and the resultant approximations of\nthe distribution function converge as the number of moments goes to infinity.\nThe convergence makes our method stand out from most existing moment methods.\nMoreover, we devise a delicate moment inversion algorithm. As an application,\nthe Vicsek model is studied for overdamped active particles. Then the\nPoisson-EQMOM is validated with a series of numerical tests including spatially\nhomogeneous, one-dimensional and two-dimensional problems.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:13:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Yihong",""],["Huang","Qian",""],["Yong","Wen-An",""],["Zhang","Ruixi",""]]}
{"id":"2308.10084","submitter":"Florian Daval","authors":"Florian Daval","title":"Conversions explicites des nombres premiers vers la fonction de M\\\"obius","comments":"11 pages, In French","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We prove that $|\\sum_{n \\leq x} \\mu(n) | \\leq x/160\\,383$ for all $x\\geq 8.4\n\\times 10^9$ thus improving the record for this type of estimates which was\n$|\\sum_{n \\leq x} \\mu(n) | \\leq x/4345$ for all $x\\geq 2\\,160\\,535$ and was due\nto Cohen, Dress and El Marraki. We also prove that $|\\sum_{n \\leq x} \\mu(n) |\n\\leq x/180\\,194$ for all $x\\geq 10^{19}$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:30:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Daval","Florian",""]]}
{"id":"2308.10085","submitter":"Emile Medvedev Dr","authors":"V.G. Ushakov, S.A. Balashev, E.S. Medvedev","title":"Analysis of the calculated X-X ro-vibrational transition intensities in\n  molecular hydrogen","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The potential-energy and quadrupole-moment functions of the H$_2$ ground\nelectronic state are well known in literature (Komasa et al., 2019; Wolniewicz\net al., 1998), and the line list of the vibrational-rotational transitions was\ncalculated (Roueff et al., 2019). In this paper, we analyze the calculated\nintensities in order to learn how the intensities will change when analytic\nquadrupole-moment functions fitted to the ab initio and experimental data are\nused instead of spline-interpolated functions. We found that the use of splines\ndoes not deteriorate the intensities and does not lead to nonphysical\nsaturation, as in heavier molecules, owing to the high precision of the ab\ninitio data and the high density of the grid. The accuracy of the calculated\nintensities is estimated up to high overtones. Extraction of new spectroscopic\ninformation from the observational data that supplements the laboratory\nmeasurements is performed. The laboratory and observational data do not help\nincrease the quality of the analytic functions. Numerous anomalies resulting\nfrom the destructive interference are identified in the calculated line lists,\nsome of them being situated within the recently observed spectral regions,\n1.5-2.5 $\\mu$m. The intensities of these anomalies can be sensitive to the form\nof the molecular functions as well as to the proton-to-electron mass ratio. In\nthis connection, the similar Le Roy anomalies (Brown and LeRoy, 1973; Le Roy\nand Vrscay, 1975) also arising due to the destructive interference in the Lyman\nand Werner systems are discussed.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:33:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ushakov","V. G.",""],["Balashev","S. A.",""],["Medvedev","E. S.",""]]}
{"id":"2308.10086","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi, Saeid Aliakbar, Sajjad HabibiPour","title":"Connecting the Dots: Leveraging Social Network Analysis to Understand\n  and Optimize Collaborative Dynamics Within the Global Film Production Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Global film production is witnessing a surge in international cooperation and\ncross-border investment. However, the dynamics and structure underlying these\ncollaborative ventures remain underexplored. This study employs social network\nanalysis (SNA) to investigate joint investments within the cinema industry. A\nnetwork of 150 countries is constructed based on 7800 links representing shared\ncreative themes in film productions. Centrality measures identify pivotal nodes\nlike the United States, China, and England as influential countries with strong\nleadership potential to steer industry growth through collaboration. Community\ndetection further uncovers distinct thematic clusters centered around common\ncreative endeavors such as action films or social issues. Each community\nreveals opportunities for targeted cooperation and investment. For instance,\nthe Global Thrill Seekers community produces mainstream blockbusters, whereas\nthe Cultural-Social Cinema Group tackles worldwide issues. Overall, this SNA\nenhances understanding of the global film network and highlights pathways to\noptimize data-driven decision-making regarding collaborative initiatives. The\nresearch underscores SNA's value in predicting outcomes and paving the way for\nstrategic unity in the creative industries.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:40:27 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 14:22:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maghsoudi","Mehrdad",""],["Aliakbar","Saeid",""],["HabibiPour","Sajjad",""]]}
{"id":"2308.10087","submitter":"Jingji Chen","authors":"Jingji Chen, Zhuoming Chen, Xuehai Qian","title":"GNNPipe: Accelerating Distributed Full-Graph GNN Training with Pipelined\n  Model Parallelism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current distributed full-graph GNN training methods adopt a variant of data\nparallelism, namely graph parallelism, in which the whole graph is divided into\nmultiple partitions (subgraphs) and each GPU processes one of them. This incurs\nhigh communication overhead because of the inter-partition message passing at\neach layer. To this end, we proposed a new training method named GNNPipe that\nadopts model parallelism instead, which has a lower worst-case asymptotic\ncommunication complexity than graph parallelism. To ensure high GPU\nutilization, we proposed to combine model parallelism with a chunk-based\npipelined training method, in which each GPU processes a different chunk of\ngraph data at different layers concurrently. We further proposed hybrid\nparallelism that combines model and graph parallelism when the model-level\nparallelism is insufficient. We also introduced several tricks to ensure\nconvergence speed and model accuracies to accommodate embedding staleness\nintroduced by pipelining. Extensive experiments show that our method reduces\nthe per-epoch training time by up to 2.45x (on average 2.03x) and reduces the\ncommunication volume and overhead by up to 22.51x and 27.21x (on average 10.27x\nand 14.96x), respectively, while achieving a comparable level of model accuracy\nand convergence speed compared to graph parallelism.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:44:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Jingji",""],["Chen","Zhuoming",""],["Qian","Xuehai",""]]}
{"id":"2308.10088","submitter":"Yihong Dong","authors":"Yihong Dong, Kangcheng Luo, Xue Jiang, Zhi Jin, and Ge Li","title":"PACE: Improving Prompt with Actor-Critic Editing for Large Language\n  Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have showcased remarkable potential across\nvarious tasks by conditioning on prompts. However, the quality of different\nhuman-written prompts leads to substantial discrepancies in LLMs' performance,\nand improving prompts usually necessitates considerable human effort and\nexpertise. To this end, this paper proposes Prompt with Actor-Critic Editing\n(PACE) for LLMs to enable automatic prompt editing. Drawing inspiration from\nthe actor-critic algorithm in reinforcement learning, PACE leverages LLMs as\nthe dual roles of actors and critics, conceptualizing prompt as a type of\npolicy. PACE refines prompt, taking into account the feedback from both actors\nperforming prompt and critics criticizing response. This process helps LLMs\nbetter align prompt to a specific task, thanks to real responses and thinking\nfrom LLMs. We conduct extensive experiments on 24 instruction induction tasks\nand 21 big-bench tasks. Experimental results indicate that PACE elevates the\nrelative performance of medium/low-quality human-written prompts by up to 98\\%,\nwhich has comparable performance to high-quality human-written prompts.\nMoreover, PACE also exhibits notable efficacy for prompt generation.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:47:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dong","Yihong",""],["Luo","Kangcheng",""],["Jiang","Xue",""],["Jin","Zhi",""],["Li","Ge",""]]}
{"id":"2308.10089","submitter":"Yikai Wang","authors":"Yikai Wang, Yinpeng Dong, Fuchun Sun, Xiao Yang","title":"Root Pose Decomposition Towards Generic Non-rigid 3D Reconstruction with\n  Monocular Videos","comments":"ICCV 2023. Project Page: https://rpd-share.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work focuses on the 3D reconstruction of non-rigid objects based on\nmonocular RGB video sequences. Concretely, we aim at building high-fidelity\nmodels for generic object categories and casually captured scenes. To this end,\nwe do not assume known root poses of objects, and do not utilize\ncategory-specific templates or dense pose priors. The key idea of our method,\nRoot Pose Decomposition (RPD), is to maintain a per-frame root pose\ntransformation, meanwhile building a dense field with local transformations to\nrectify the root pose. The optimization of local transformations is performed\nby point registration to the canonical space. We also adapt RPD to multi-object\nscenarios with object occlusions and individual differences. As a result, RPD\nallows non-rigid 3D reconstruction for complicated scenarios containing objects\nwith large deformations, complex motion patterns, occlusions, and scale\ndiversities of different individuals. Such a pipeline potentially scales to\ndiverse sets of objects in the wild. We experimentally show that RPD surpasses\nstate-of-the-art methods on the challenging DAVIS, OVIS, and AMA datasets.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:48:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yikai",""],["Dong","Yinpeng",""],["Sun","Fuchun",""],["Yang","Xiao",""]]}
{"id":"2308.10090","submitter":"Sara Moshtaghi","authors":"Hamid Hoorfar, Sara Moshtaghi Largani, Reza Rahimi, and Alireza\n  Bagheri","title":"Minimizing Turns in Watchman Robot Navigation: Strategies and Solutions","comments":"6 pages, 3 figures","journal-ref":"The 21st International Conference on Scientific Computing in The\n  2023 World Congress in Computer Science, Computer Engineering, & Applied\n  Computing (CSCE'23)","doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Orthogonal Watchman Route Problem (OWRP) entails the search for the\nshortest path, known as the watchman route, that a robot must follow within a\npolygonal environment. The primary objective is to ensure that every point in\nthe environment remains visible from at least one point on the route, allowing\nthe robot to survey the entire area in a single, continuous sweep. This\nresearch places particular emphasis on reducing the number of turns in the\nroute, as it is crucial for optimizing navigation in watchman routes within the\nfield of robotics. The cost associated with changing direction is of\nsignificant importance, especially for specific types of robots. This paper\nintroduces an efficient linear-time algorithm for solving the OWRP under the\nassumption that the environment is monotone. The findings of this study\ncontribute to the progress of robotic systems by enabling the design of more\nstreamlined patrol robots. These robots are capable of efficiently navigating\ncomplex environments while minimizing the number of turns. This advancement\nenhances their coverage and surveillance capabilities, making them highly\neffective in various real-world applications.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:53:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hoorfar","Hamid",""],["Largani","Sara Moshtaghi",""],["Rahimi","Reza",""],["Bagheri","Alireza",""]]}
{"id":"2308.10091","submitter":"Shaoyang Ning","authors":"Shaoyang Ning, Ahmed Hussain, Qing Wang","title":"Incorporating Connectivity among Internet Search Data for Enhanced\n  Influenza-like Illness Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Big data collected from the Internet possess great potential to reveal the\never-changing trends in society. In particular, accurate infectious disease\ntracking with Internet data has grown in popularity, providing invaluable\ninformation for public health decision makers and the general public. However,\nmuch of the complex connectivity among the Internet search data is not\neffectively addressed among existing disease tracking frameworks. To this end,\nwe propose ARGO-C (Augmented Regression with Clustered GOogle data), an\nintegrative, statistically principled approach that incorporates the clustering\nstructure of Internet search data to enhance the accuracy and interpretability\nof disease tracking. Focusing on multi-resolution %ILI (influenza-like illness)\ntracking, we demonstrate the improved performance and robustness of ARGO-C over\nbenchmark methods at various geographical resolutions. We also highlight the\nadaptability of ARGO-C to track various diseases in addition to influenza, and\nto track other social or economic trends.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:56:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ning","Shaoyang",""],["Hussain","Ahmed",""],["Wang","Qing",""]]}
{"id":"2308.10092","submitter":"Zachary Yang","authors":"Hao Yu, Zachary Yang, Kellin Pelrine, Jean Francois Godbout, Reihaneh\n  Rabbany","title":"Open, Closed, or Small Language Models for Text Classification?","comments":"14 pages, 15 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":"  Recent advancements in large language models have demonstrated remarkable\ncapabilities across various NLP tasks. But many questions remain, including\nwhether open-source models match closed ones, why these models excel or\nstruggle with certain tasks, and what types of practical procedures can improve\nperformance. We address these questions in the context of classification by\nevaluating three classes of models using eight datasets across three distinct\ntasks: named entity recognition, political party prediction, and misinformation\ndetection. While larger LLMs often lead to improved performance, open-source\nmodels can rival their closed-source counterparts by fine-tuning. Moreover,\nsupervised smaller models, like RoBERTa, can achieve similar or even greater\nperformance in many datasets compared to generative LLMs. On the other hand,\nclosed models maintain an advantage in hard tasks that demand the most\ngeneralizability. This study underscores the importance of model selection\nbased on task requirements\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:58:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Hao",""],["Yang","Zachary",""],["Pelrine","Kellin",""],["Godbout","Jean Francois",""],["Rabbany","Reihaneh",""]]}
{"id":"2308.10093","submitter":"Sara Moshtaghi Largani","authors":"Hamid Hoorfar, Faraneh Fathi, Sara Moshtaghi Largani, and Alireza\n  Bagheri","title":"Securing Pathways with Orthogonal Robots","comments":"8 pages, 5 figures","journal-ref":"The 21st International Conference on Scientific Computing in The\n  2023 World Congress in Computer Science, Computer Engineering, & Applied\n  Computing (CSCE'23)","doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The protection of pathways holds immense significance across various domains,\nincluding urban planning, transportation, surveillance, and security. This\narticle introduces a groundbreaking approach to safeguarding pathways by\nemploying orthogonal robots. The study specifically addresses the challenge of\nefficiently guarding orthogonal areas with the minimum number of orthogonal\nrobots. The primary focus is on orthogonal pathways, characterized by a\npath-like dual graph of vertical decomposition. It is demonstrated that\ndetermining the minimum number of orthogonal robots for pathways can be\nachieved in linear time. However, it is essential to note that the general\nproblem of finding the minimum number of robots for simple polygons with\ngeneral visibility, even in the orthogonal case, is known to be NP-hard.\nEmphasis is placed on the flexibility of placing robots anywhere within the\npolygon, whether on the boundary or in the interior.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:05:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hoorfar","Hamid",""],["Fathi","Faraneh",""],["Largani","Sara Moshtaghi",""],["Bagheri","Alireza",""]]}
{"id":"2308.10094","submitter":"Md Kamran Chowdhury Shisher","authors":"Md Kamran Chowdhury Shisher, Bo Ji, I-Hong Hou, Yin Sun","title":"Learning and Communications Co-Design for Remote Inference Systems:\n  Feature Length Selection and Transmission Scheduling","comments":"41 pages, 8 figures. The manuscript has been submitted to IEEE\n  Journal on Selected Areas in Information Theory","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider a remote inference system, where a neural network\nis used to infer a time-varying target (e.g., robot movement), based on\nfeatures (e.g., video clips) that are progressively received from a sensing\nnode (e.g., a camera). Each feature is a temporal sequence of sensory data. The\nlearning performance of the system is determined by (i) the timeliness and (ii)\nthe temporal sequence length of the features, where we use Age of Information\n(AoI) as a metric for timeliness. While a longer feature can typically provide\nbetter learning performance, it often requires more channel resources for\nsending the feature. To minimize the time-averaged inference error, we study a\nlearning and communication co-design problem that jointly optimizes feature\nlength selection and transmission scheduling. When there is a single\nsensor-predictor pair and a single channel, we develop low-complexity optimal\nco-designs for both the cases of time-invariant and time-variant feature\nlength. When there are multiple sensor-predictor pairs and multiple channels,\nthe co-design problem becomes a restless multi-arm multi-action bandit problem\nthat is PSPACE-hard. For this setting, we design a low-complexity algorithm to\nsolve the problem. Trace-driven evaluations suggest that the proposed\nco-designs can significantly reduce the time-averaged inference error of remote\ninference systems.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:12:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shisher","Md Kamran Chowdhury",""],["Ji","Bo",""],["Hou","I-Hong",""],["Sun","Yin",""]]}
{"id":"2308.10095","submitter":"Tomer Dollberg","authors":"Tomer Dollberg and Moshe Schechter","title":"LiHoF4 as a spin-half non-standard quantum Ising system","comments":"7+12 pages, 2+4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  $\\mathrm{LiHoF_{4}}$ is a magnetic material known for its Ising-type\nanisotropy, making it a model system for studying quantum magnetism. However,\nthe theoretical description of $\\mathrm{LiHoF_{4}}$ using the quantum Ising\nmodel has shown discrepancies in its phase diagram, particularly in the regime\ndominated by thermal fluctuations. In this study, we investigate the role of\noff-diagonal dipolar terms in $\\mathrm{LiHoF_{4}}$, previously neglected, in\ndetermining its properties. We analytically derive the low-energy effective\nHamiltonian of $\\mathrm{LiHoF_{4}}$, including the off-diagonal dipolar terms\nperturbatively, both in the absence and presence of a transverse field. Our\nresults encompass the full $B_{x}-T$ phase diagram, confirming the significance\nof the off-diagonal dipolar terms in reducing the zero-field critical\ntemperature and determining the critical temperature's dependence on the\ntransverse field. We also highlight the sensitivity of this mechanism to the\ncrystal structure by comparing our calculations with the $\\mathrm{Fe_{8}}$\nsystem.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:30:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dollberg","Tomer",""],["Schechter","Moshe",""]]}
{"id":"2308.10096","submitter":"Zinovy Reichstein","authors":"Oakley Edens and Zinovy Reichstein","title":"Essential dimension of symmetric groups in prime characteristic","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The essential dimension $\\operatorname{ed}_k({\\rm S}_n)$ of the symmetric\ngroup ${\\rm S}_n$ is the minimal integer $d$ such that the general polynomial\n$x^n + a_1 x^{n-1} + \\ldots + a_n$ can be reduced to a $d$-parameter form by a\nTschirnhaus transformation. Finding this number is a long-standing open\nproblem, originating in the work of Felix Klein, long before essential\ndimension was formally defined. We now know that $\\operatorname{ed}_k({\\rm\nS}_n)$ lies between $\\lfloor n/2 \\rfloor$ and $n-3$ for every $n \\geqslant 5$\nand every field $k$ of characteristic different from $2$. Moreover, if\n$\\operatorname{char}(k) = 0$, then $\\operatorname{ed}_k({\\rm S}_n) \\geqslant\n\\lfloor (n+1)/2 \\rfloor$ for any $n \\geqslant 6$. The value of\n$\\operatorname{ed}_k({\\rm S}_n)$ is not known for any $n \\geqslant 8$ and any\nfield $k$, though it is widely believed that $\\operatorname{ed}_k({\\rm S}_n)$\nshould be $n-3$ for every $n \\geqslant 5$, at least in characteristic $0$. In\nthis paper we show that for every odd prime $p$ there are infinitely many\npositive integers $n$ such that $\\operatorname{ed}_{\\mathbb F_p}(\\rm{S}_n)\n\\leqslant n-4$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:48:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Edens","Oakley",""],["Reichstein","Zinovy",""]]}
{"id":"2308.10097","submitter":"Abbas Tariverdi","authors":"Abbas Tariverdi, Jim Torresen","title":"Rafting Towards Consensus: Formation Control of Distributed Dynamical\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we introduce a novel adaptation of the Raft consensus\nalgorithm for achieving emergent formation control in multi-agent systems with\na single integrator dynamics. This strategy, dubbed \"Rafting,\" enables robust\ncooperation between distributed nodes, thereby facilitating the achievement of\ndesired geometric configurations. Our framework takes advantage of the Raft\nalgorithm's inherent fault tolerance and strong consistency guarantees to\nextend its applicability to distributed formation control tasks. Following the\nintroduction of a decentralized mechanism for aggregating agent states, a\nsynchronization protocol for information exchange and consensus formation is\nproposed. The Raft consensus algorithm combines leader election, log\nreplication, and state machine application to steer agents toward a common,\ncollaborative goal. A series of detailed simulations validate the efficacy and\nrobustness of our method under various conditions, including partial network\nfailures and disturbances. The outcomes demonstrate the algorithm's potential\nand open up new possibilities in swarm robotics, autonomous transportation, and\ndistributed computation. The implementation of the algorithms presented in this\npaper is available at https://github.com/abbas-tari/raft.git.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:53:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tariverdi","Abbas",""],["Torresen","Jim",""]]}
{"id":"2308.10098","submitter":"Mohammad Sadegh Salehi","authors":"Mohammad Sadegh Salehi, Subhadip Mukherjee, Lindon Roberts, Matthias\n  J. Ehrhardt","title":"Dynamic Bilevel Learning with Inexact Line Search","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":"  In various domains within imaging and data science, particularly when\naddressing tasks modeled utilizing the variational regularization approach,\nmanually configuring regularization parameters presents a formidable challenge.\nThe difficulty intensifies when employing regularizers involving a large number\nof hyperparameters. To overcome this challenge, bilevel learning is employed to\nlearn suitable hyperparameters. However, due to the use of numerical solvers,\nthe exact gradient with respect to the hyperparameters is unattainable,\nnecessitating the use of methods relying on approximate gradients.\nState-of-the-art inexact methods a priori select a decreasing summable sequence\nof the required accuracy and only assure convergence given a sufficiently small\nfixed step size. Despite this, challenges persist in determining the Lipschitz\nconstant of the hypergradient and identifying an appropriate fixed step size.\nConversely, computing exact function values is not feasible, impeding the use\nof line search. In this work, we introduce a provably convergent inexact\nbacktracking line search involving inexact function evaluations and\nhypergradients. We show convergence to a stationary point of the loss with\nrespect to hyperparameters. Additionally, we propose an algorithm to determine\nthe required accuracy dynamically. Our numerical experiments demonstrate the\nefficiency and feasibility of our approach for hyperparameter estimation in\nvariational regularization problems, alongside its robustness in terms of the\ninitial accuracy and step size choices.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:58:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Salehi","Mohammad Sadegh",""],["Mukherjee","Subhadip",""],["Roberts","Lindon",""],["Ehrhardt","Matthias J.",""]]}
{"id":"2308.10099","submitter":"Borun Shi","authors":"Emily Morris, Haotian Shen, Weiling Du, Muhammad Hamza Sajjad, Borun\n  Shi","title":"Geometric instability of graph neural networks on large graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse the geometric instability of embeddings produced by graph neural\nnetworks (GNNs). Existing methods are only applicable for small graphs and lack\ncontext in the graph domain. We propose a simple, efficient and graph-native\nGraph Gram Index (GGI) to measure such instability which is invariant to\npermutation, orthogonal transformation, translation and order of evaluation.\nThis allows us to study the varying instability behaviour of GNN embeddings on\nlarge graphs for both node classification and link prediction.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:10:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Morris","Emily",""],["Shen","Haotian",""],["Du","Weiling",""],["Sajjad","Muhammad Hamza",""],["Shi","Borun",""]]}
{"id":"2308.10100","submitter":"Sadek Al Harbat","authors":"Sadek Al Harbat","title":"Catalan numbers: from FC elements to classical diagram algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $W^c(A_n)$ be the set of fully commutative elements in the $A_n$-type\nCoxeter group. Using only the settings of their canonical form, we recount\n$W^c(A_n)$ by the definition of the Catalan numbers $C_{n+1}$ and find the\nNarayana numbers as well as the Catalan triangle. We determine the unique\nbijection between $W^c(A_n)$ and the set of non crossing diagrams that respects\nthe monomial diagrammatical multiplication in the $A_n$-type Temperley-Lieb\nalgebra.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:13:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Harbat","Sadek Al",""]]}
{"id":"2308.10101","submitter":"Emilio Ruiz-Moreno","authors":"Emilio Ruiz-Moreno and Baltasar Beferull-Lozano","title":"An Online Multiple Kernel Parallelizable Learning Scheme","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of reproducing kernel Hilbert space-based methods is known to\nbe sensitive to the choice of the reproducing kernel. Choosing an adequate\nreproducing kernel can be challenging and computationally demanding, especially\nin data-rich tasks without prior information about the solution domain. In this\npaper, we propose a learning scheme that scalably combines several single\nkernel-based online methods to reduce the kernel-selection bias. The proposed\nlearning scheme applies to any task formulated as a regularized empirical risk\nminimization convex problem. More specifically, our learning scheme is based on\na multi-kernel learning formulation that can be applied to widen any\nsingle-kernel solution space, thus increasing the possibility of finding\nhigher-performance solutions. In addition, it is parallelizable, allowing for\nthe distribution of the computational load across different computing units. We\nshow experimentally that the proposed learning scheme outperforms the combined\nsingle-kernel online methods separately in terms of the cumulative regularized\nleast squares cost metric.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:15:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ruiz-Moreno","Emilio",""],["Beferull-Lozano","Baltasar",""]]}
{"id":"2308.10102","submitter":"Imre Barany","authors":"Imre Barany","title":"A matrix version of the Steinitz lemma","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Steinitz lemma, a classic from 1913, states that $a_1,\\ldots,a_n$, a\nsequence of vectors in $\\R^d$ with $\\sum_1^n a_i=0$, can be rearranged so that\nevery partial sum of the rearranged sequence has norm at most $2d\\max \\|a_i\\|$.\nIn the matrix version $A$ is a $k\\times n$ matrix with entries $a_i^j \\in \\R^d$\nwith $\\sum_{j=1}^k\\sum_{i=1}^na_i^j=0$. It is proved in \\cite{OPW} that there\nis a rearrangement of row $j$ of $A$ (for every $j$) such that the sum of the\nentries in the first $m$ columns of the rearranged matrix has norm at most\n$40d^5\\max \\|a_i^j\\|$ (for every $m$). We improve this bound to $(4d-2)\\max\n\\|a_i^j\\|$.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:15:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Barany","Imre",""]]}
{"id":"2308.10103","submitter":"Sreyan Ghosh","authors":"Sreyan Ghosh, Chandra Kiran Reddy Evuru, Sonal Kumar, Utkarsh Tyagi,\n  Sakshi Singh, Sanjoy Chowdhury and Dinesh Manocha","title":"ASPIRE: Language-Guided Augmentation for Robust Image Classification","comments":"Pre-print Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural image classifiers can often learn to make predictions by overly\nrelying on non-predictive features that are spuriously correlated with the\nclass labels in the training data. This leads to poor performance in real-world\natypical scenarios where such features are absent. Supplementing the training\ndataset with images without such spurious features can aid robust learning\nagainst spurious correlations via better generalization. This paper presents\nASPIRE (Language-guided data Augmentation for SPurIous correlation REmoval), a\nsimple yet effective solution for expanding the training dataset with synthetic\nimages without spurious features. ASPIRE, guided by language, generates these\nimages without requiring any form of additional supervision or existing\nexamples. Precisely, we employ LLMs to first extract foreground and background\nfeatures from textual descriptions of an image, followed by advanced\nlanguage-guided image editing to discover the features that are spuriously\ncorrelated with the class label. Finally, we personalize a text-to-image\ngeneration model to generate diverse in-domain images without spurious\nfeatures. We demonstrate the effectiveness of ASPIRE on 4 datasets, including\nthe very challenging Hard ImageNet dataset, and 9 baselines and show that\nASPIRE improves the classification accuracy of prior methods by 1% - 38%. Code\nsoon at: https://github.com/Sreyan88/ASPIRE.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:18:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghosh","Sreyan",""],["Evuru","Chandra Kiran Reddy",""],["Kumar","Sonal",""],["Tyagi","Utkarsh",""],["Singh","Sakshi",""],["Chowdhury","Sanjoy",""],["Manocha","Dinesh",""]]}
{"id":"2308.10104","submitter":"Fabian Scheller","authors":"Fabian Scheller, Karyn Morrissey, Karsten Neuhoff, Dogan Keles","title":"Green or greedy: the relationship between perceived benefits and\n  homeowners' intention to adopt residential low-carbon technologies","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":"  Transitioning to a net-zero economy requires a nuanced understanding of\nhomeowners decision-making pathways when considering the adoption of Low Carbon\nTechnologies (LCTs). These LCTs present both personal and collective benefits,\nwith positive perceptions critically influencing attitudes and intentions. Our\nstudy analyses the relationship between two primary benefits: the\nhousehold-level financial gain and the broader environmental advantage.\nFocusing on the intention to adopt Rooftop Photovoltaic Systems, Energy\nEfficient Appliances, and Green Electricity Tariffs, we employ Partial Least\nSquares Structural Equation Modeling to demonstrate that the adoption intention\nof the LCTs is underpinned by the Theory of Planned Behaviour. Attitudes toward\nthe LCTs are more strongly related to product-specific benefits than affective\nconstructs. In terms of evaluative benefits, environmental benefits exhibit a\nhigher positive association with attitude formation compared to financial\nbenefits. However, this relationship switches as homeowners move through the\ndecision process with the financial benefits of selected LCTs having a\nconsistently higher association with adoption intention. At the same time,\nfinancial benefits also positively affect attitudes. Observing this trend\nacross both low- and high-cost LCTs, we recommend that policymakers amplify\nhomeowners' recognition of the individual benefits intrinsic to LCTs and enact\nmeasures that ensure these financial benefits.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:26:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Scheller","Fabian",""],["Morrissey","Karyn",""],["Neuhoff","Karsten",""],["Keles","Dogan",""]]}
{"id":"2308.10105","submitter":"Imre Barany","authors":"Imre Barany","title":"Tverberg's theorem, a new proof","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":"  We give a new proof Tverberg's famous theorem: For every set $X \\subset \\R^d$\nwith $|X|=(r-1)(d+1)+1$, there is a partition of $X$ into $r$ sets\n$X_1,\\ldots,X_r$ such that $\\bigcap_{p=1}^r \\conv X_p\\ne \\emptyset$. The new\nproof uses linear algebra, specially structured matrices, the theory of linear\nequations, and Tverberg's original ``moving the points\" method.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:33:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Barany","Imre",""]]}
{"id":"2308.10106","submitter":"Imre Barany","authors":"Imre Barany","title":"Positive bases, cones, Helly type theorems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assume that $k \\le d$ is a positive integer and $\\C$ is a finite collection\nof convex bodies in $\\R^d$. We prove a Helly type theorem: If for every\nsubfamily $\\C^*\\subset \\C$ of size at most $\\max \\{d+1,2(d-k+1)\\}$ the set\n$\\bigcap \\C^*$ contains a $k$-dimensional cone, then so does $\\bigcap \\C.$ One\ningredient in the proof is another Helly type theorem about the dimension of\nlineality spaces of convex cones.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:41:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Barany","Imre",""]]}
{"id":"2308.10107","submitter":"Jinchuan Tian","authors":"Jinchuan Tian, Jianwei Yu, Hangting Chen, Brian Yan, Chao Weng, Dong\n  Yu, Shinji Watanabe","title":"Bayes Risk Transducer: Transducer with Controllable Alignment Prediction","comments":null,"journal-ref":"Interspeech 2023","doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Automatic speech recognition (ASR) based on transducers is widely used. In\ntraining, a transducer maximizes the summed posteriors of all paths. The path\nwith the highest posterior is commonly defined as the predicted alignment\nbetween the speech and the transcription. While the vanilla transducer does not\nhave a prior preference for any of the valid paths, this work intends to\nenforce the preferred paths and achieve controllable alignment prediction.\nSpecifically, this work proposes Bayes Risk Transducer (BRT), which uses a\nBayes risk function to set lower risk values to the preferred paths so that the\npredicted alignment is more likely to satisfy specific desired properties. We\nfurther demonstrate that these predicted alignments with intentionally designed\nproperties can provide practical advantages over the vanilla transducer.\nExperimentally, the proposed BRT saves inference cost by up to 46% for\nnon-streaming ASR and reduces overall system latency by 41% for streaming ASR.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:48:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tian","Jinchuan",""],["Yu","Jianwei",""],["Chen","Hangting",""],["Yan","Brian",""],["Weng","Chao",""],["Yu","Dong",""],["Watanabe","Shinji",""]]}
{"id":"2308.10108","submitter":"Dezs\\H{o} Varga","authors":"Dezso Varga, Hiroyuki K. M. Tanaka","title":"Developments of a centimeter-level precise muometric wireless navigation\n  system (MuWNS-V) and its first demonstration using directional information\n  from tracking detectors","comments":"11 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Various positioning techniques such as Wi-Fi positioning system have been\nproposed to use in situations where satellite navigation is unavailable. One\nsuch system, the muometric positioning system (muPS), was invented for\nnavigation which operates in locations where even radio waves cannot reach such\nas underwater or underground. muPS takes advantage of a key feature of its\nprobe, cosmic-ray muons, which travel straightforwardly at almost a speed of\nlight in vacuum regardless of the matter they traverse. Similar to other\npositioning techniques, muPS is a technique to determine the position of a\nclient's muPS receiver within the coordinate defined by reference detectors.\nThis can be achieved either by using time-of-flight (ToF) or angle of arrival\n(AoA) measurements. The latter configuration (AoA), called the Vector-muPS has\nrecently been invented and the present paper describes the developments of the\nfirst prototype of a vector muometric wireless navigation system (MuWNS-V) with\nthis new vector-muPS concept and its demonstration. With MuWNS-V, the reference\ntracker and the receiver ran wirelessly with fully independent readout systems,\nand a positioning accuracy of 3.9 cm (RMS) has been achieved. We also evaluated\nthe outcome of measuring continuous indoor localization of a moving receiver\nwith this prototype. Our results indicated that further improvements in\npositioning accuracy will be attainable by acquiring higher angular resolution\nof the reference trackers. It is anticipated that \"sub-cm level\" navigation\nwill be possible for muPS which could be applied to many situations such as\nfuture autonomous mobile robot operations.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:54:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Varga","Dezso",""],["Tanaka","Hiroyuki K. M.",""]]}
{"id":"2308.10109","submitter":"Tamas David-Barrett","authors":"Tamas David-Barrett","title":"Unbiased Library of k-regular, n-sized, Connected, Small Graphs","comments":"49 pages,1 table, 11 figures in the main papers (and further panels\n  of figures in the SM at the end of the paper)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The past decade highlighted the usefulness of social network simulations that\nrun on k-regular, n-size, connected graphs. These can be seen as small-scale\nmodels of human social networks of large societies. By narrowing down onto\nk-regular graphs, the degree variation can be eliminated from the research\nquestion, which allows a focus on the isolated impact by other variables, for\ninstance, by the clustering coefficient or the size of the network. This paper\ndescribes the generation of a random graph library that uses a random walk\ngraph creation algorithm that starts from the \"chain of caves\", which is the\nstructure in which the clustering coefficient is at its maximum. This method\nfinds mid and high clustering coefficient graphs, while Wolfram`s RandomGraph\nwas useful for finding low ones. The merge of the two samples proved to be\nsomewhat biased. After eliminating a host of network measures, the paper\nfocused on mean graph distance as a further variable and created an unbiased\nsubsample for each size and clustering coefficient bin.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:57:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["David-Barrett","Tamas",""]]}
{"id":"2308.10110","submitter":"Yihua Zhang","authors":"Yihua Zhang, Ruisi Cai, Tianlong Chen, Guanhua Zhang, Huan Zhang,\n  Pin-Yu Chen, Shiyu Chang, Zhangyang Wang, Sijia Liu","title":"Robust Mixture-of-Expert Training for Convolutional Neural Networks","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sparsely-gated Mixture of Expert (MoE), an emerging deep model architecture,\nhas demonstrated a great promise to enable high-accuracy and ultra-efficient\nmodel inference. Despite the growing popularity of MoE, little work\ninvestigated its potential to advance convolutional neural networks (CNNs),\nespecially in the plane of adversarial robustness. Since the lack of robustness\nhas become one of the main hurdles for CNNs, in this paper we ask: How to\nadversarially robustify a CNN-based MoE model? Can we robustly train it like an\nordinary CNN model? Our pilot study shows that the conventional adversarial\ntraining (AT) mechanism (developed for vanilla CNNs) no longer remains\neffective to robustify an MoE-CNN. To better understand this phenomenon, we\ndissect the robustness of an MoE-CNN into two dimensions: Robustness of routers\n(i.e., gating functions to select data-specific experts) and robustness of\nexperts (i.e., the router-guided pathways defined by the subnetworks of the\nbackbone CNN). Our analyses show that routers and experts are hard to adapt to\neach other in the vanilla AT. Thus, we propose a new router-expert alternating\nAdversarial training framework for MoE, termed AdvMoE. The effectiveness of our\nproposal is justified across 4 commonly-used CNN model architectures over 4\nbenchmark datasets. We find that AdvMoE achieves 1% ~ 4% adversarial robustness\nimprovement over the original dense CNN, and enjoys the efficiency merit of\nsparsity-gated MoE, leading to more than 50% inference cost reduction. Codes\nare available at https://github.com/OPTML-Group/Robust-MoE-CNN.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 20:58:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yihua",""],["Cai","Ruisi",""],["Chen","Tianlong",""],["Zhang","Guanhua",""],["Zhang","Huan",""],["Chen","Pin-Yu",""],["Chang","Shiyu",""],["Wang","Zhangyang",""],["Liu","Sijia",""]]}
{"id":"2308.10111","submitter":"Yuantian Huang","authors":"Yuantian Huang, Satoshi Iizuka, Edgar Simo-Serra, and Kazuhiro Fukui","title":"Controllable Multi-domain Semantic Artwork Synthesis","comments":"15 pages, accepted by CVMJ, to appear","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel framework for multi-domain synthesis of artwork from\nsemantic layouts. One of the main limitations of this challenging task is the\nlack of publicly available segmentation datasets for art synthesis. To address\nthis problem, we propose a dataset, which we call ArtSem, that contains 40,000\nimages of artwork from 4 different domains with their corresponding semantic\nlabel maps. We generate the dataset by first extracting semantic maps from\nlandscape photography and then propose a conditional Generative Adversarial\nNetwork (GAN)-based approach to generate high-quality artwork from the semantic\nmaps without necessitating paired training data. Furthermore, we propose an\nartwork synthesis model that uses domain-dependent variational encoders for\nhigh-quality multi-domain synthesis. The model is improved and complemented\nwith a simple but effective normalization method, based on normalizing both the\nsemantic and style jointly, which we call Spatially STyle-Adaptive\nNormalization (SSTAN). In contrast to previous methods that only take semantic\nlayout as input, our model is able to learn a joint representation of both\nstyle and semantic information, which leads to better generation quality for\nsynthesizing artistic images. Results indicate that our model learns to\nseparate the domains in the latent space, and thus, by identifying the\nhyperplanes that separate the different domains, we can also perform\nfine-grained control of the synthesized artwork. By combining our proposed\ndataset and approach, we are able to generate user-controllable artwork that is\nof higher quality than existing\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:16:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Yuantian",""],["Iizuka","Satoshi",""],["Simo-Serra","Edgar",""],["Fukui","Kazuhiro",""]]}
{"id":"2308.10112","submitter":"Wenhui Zhu","authors":"Wenhui Zhu, Peijie Qiu, Oana M. Dumitrascu and Yalin Wang","title":"PDL: Regularizing Multiple Instance Learning with Progressive Dropout\n  Layers","comments":"The code is available in https://github.com/ChongQingNoSubway/PDL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multiple instance learning (MIL) was a weakly supervised learning approach\nthat sought to assign binary class labels to collections of instances known as\nbags. However, due to their weak supervision nature, the MIL methods were\nsusceptible to overfitting and required assistance in developing comprehensive\nrepresentations of target instances. While regularization typically effectively\ncombated overfitting, its integration with the MIL model has been frequently\noverlooked in prior studies. Meanwhile, current regularization methods for MIL\nhave shown limitations in their capacity to uncover a diverse array of\nrepresentations. In this study, we delve into the realm of regularization\nwithin the MIL model, presenting a novel approach in the form of a Progressive\nDropout Layer (PDL). We aim to not only address overfitting but also empower\nthe MIL model in uncovering intricate and impactful feature representations.\nThe proposed method was orthogonal to existing MIL methods and could be easily\nintegrated into them to boost performance. Our extensive evaluation across a\nrange of MIL benchmark datasets demonstrated that the incorporation of the PDL\ninto multiple MIL methods not only elevated their classification performance\nbut also augmented their potential for weakly-supervised feature localizations.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:20:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhu","Wenhui",""],["Qiu","Peijie",""],["Dumitrascu","Oana M.",""],["Wang","Yalin",""]]}
{"id":"2308.10113","submitter":"Daniel Cirkovic","authors":"Daniel Cirkovic, Tiandong Wang","title":"Modeling Random Networks with Heterogeneous Reciprocity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG cs.SI stat.AP stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reciprocity, or the tendency of individuals to mirror behavior, is a key\nmeasure that describes information exchange in a social network. Users in\nsocial networks tend to engage in different levels of reciprocal behavior.\nDifferences in such behavior may indicate the existence of communities that\nreciprocate links at varying rates. In this paper, we develop methodology to\nmodel the diverse reciprocal behavior in growing social networks. In\nparticular, we present a preferential attachment model with heterogeneous\nreciprocity that imitates the attraction users have for popular users, plus the\nheterogeneous nature by which they reciprocate links. We compare Bayesian and\nfrequentist model fitting techniques for large networks, as well as\ncomputationally efficient variational alternatives. Cases where the number of\ncommunities are known and unknown are both considered. We apply the presented\nmethods to the analysis of a Facebook wallpost network where users have\nnon-uniform reciprocal behavior patterns. The fitted model captures the\nheavy-tailed nature of the empirical degree distributions in the Facebook data\nand identifies multiple groups of users that differ in their tendency to reply\nto and receive responses to wallposts.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:21:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cirkovic","Daniel",""],["Wang","Tiandong",""]]}
{"id":"2308.10114","submitter":"Michael Damron","authors":"Michael Damron, Jack Hanson, David Harper, Wai-Kit Lam","title":"Exceptional behavior in critical first-passage percolation and random\n  sums","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study first-passage percolation (FPP) on the square lattice. The model is\ndefined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the\nnearest neighbor edges of $\\mathbb{Z}^2$. The passage time between vertices $x$\nand $y$, $T(x,y)$, is the minimal total weight of any lattice path from $x$ to\n$y$. The growth rate of $T(x,y)$ depends on the value of $F(0) =\n\\mathbb{P}(t_e=0)$: if $F(0) < 1/2$ then $T(x,y)$ grows linearly in $|x-y|$,\nbut if $F(0) > 1/2$ then it is stochastically bounded. In the critical case,\nwhere $F(0) = 1/2$, $T(x,y)$ can be bounded or unbounded depending on the\nbehavior of the distribution function $F$ of $t_e$ near 0. In this paper, we\nconsider the critical case in which $T(x,y)$ is unbounded and prove the\nexistence of an incipient infinite cluster (IIC) type measure, constructed by\nconditioning the environment on the event that the passage time from $0$ to a\nfar distance remains bounded. This IIC measure is a natural candidate for the\ndistribution of the weights at a typical exceptional time in dynamical FPP. A\nmajor part of the analysis involves characterizing the limiting behavior of\nindependent nonnegative random variables conditioned to have small sum. We give\nconditions on random variables that ensure that such limits are trivial, and\nseveral examples that exhibit nontrivial limits.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:43:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Damron","Michael",""],["Hanson","Jack",""],["Harper","David",""],["Lam","Wai-Kit",""]]}
{"id":"2308.10115","submitter":"Shahram Ghandeharizadeh","authors":"Trung Phan, Hamed Alimohammadzadeh, Heather Culbertson, Shahram\n  Ghandeharizadeh","title":"An Evaluation of Three Distance Measurement Technologies for Flying\n  Light Specks","comments":"In International Conference on Intelligent Metaverse Technologies and\n  Applications (iMETA2023), Tartu, Estonia, September 18-20, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.GR cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study evaluates the accuracy of three different types of time-of-flight\nsensors to measure distance. We envision the possible use of these sensors to\nlocalize swarms of flying light specks (FLSs) to illuminate objects and avatars\nof a metaverse. An FLS is a miniature-sized drone configured with RGB light\nsources. It is unable to illuminate a point cloud by itself. However, the\ninter-FLS relationship effect of an organizational framework will compensate\nfor the simplicity of each individual FLS, enabling a swarm of cooperating FLSs\nto illuminate complex shapes and render haptic interactions. Distance between\nFLSs is an important criterion of the inter-FLS relationship. We consider\nsensors that use radio frequency (UWB), infrared light (IR), and sound\n(ultrasonic) to quantify this metric. Obtained results show only one sensor is\nable to measure distances as small as 1 cm with a high accuracy. A sensor may\nrequire a calibration process that impacts its accuracy in measuring distance.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:53:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Phan","Trung",""],["Alimohammadzadeh","Hamed",""],["Culbertson","Heather",""],["Ghandeharizadeh","Shahram",""]]}
{"id":"2308.10116","submitter":"Nikola Mutavdzic","authors":"Miodrag Mateljevi\\'c, Nikola Mutavdzi\\'c, Adel Khalfallah","title":"Lipschitz continuity for harmonic functions and solutions of the\n  $\\bar{\\alpha}$-Poisson equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study Lipschitz continuity for solutions of the $\\bar{\\alpha}$-Poisson\nequation in planar cases. We also review some recently obtained results. As\ncorolary we can restate results for harmonic and gradient harmonic functions.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 21:57:15 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 16:17:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mateljevi\u0107","Miodrag",""],["Mutavdzi\u0107","Nikola",""],["Khalfallah","Adel",""]]}
{"id":"2308.10117","submitter":"Seigo Souma","authors":"T. Osumi, S. Souma, T. Aoyama, K. Yamauchi, A. Honma, K. Nakayama, T.\n  Takahashi, K. Ohgushi, and T. Sato","title":"Observation of Giant Band Splitting in Altermagnetic MnTe","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We performed angle-resolved photoemission spectroscopy (ARPES) on hexagonal\nMnTe, a candidate for an altermagnet with a high critical temperature\n(TN=307K). By utilizing photon-energy-tunable ARPES in combination with\nfirst-principles calculations, we found that the band structure in the\nantiferromagnetic phase exhibits a strongly anisotropic band-splitting\nassociated with the time-reversal-symmetry breaking, providing the first direct\nexperimental evidence for the altermagnetic band-splitting. The magnitude of\nthe splitting reaches 0.8 eV at non-high-symmetry momentum points, which is\nmuch larger than the spin-orbit gap of ~0.3 eV along the GammaK high-symmetry\ncut. The present result paves the pathway toward realizing exotic physical\nproperties associated with the altermagnetic spin-splitting.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:08:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Osumi","T.",""],["Souma","S.",""],["Aoyama","T.",""],["Yamauchi","K.",""],["Honma","A.",""],["Nakayama","K.",""],["Takahashi","T.",""],["Ohgushi","K.",""],["Sato","T.",""]]}
{"id":"2308.10118","submitter":"Riano Giribaldi Dr.","authors":"Riano E. Giribaldi, Sophie Van Eck, Thibault Merle, Alain Jorissen,\n  Pawel Krynski, Lea Planquart, Marica Valentini, Cristina Chiappini, Hans Van\n  Winckel","title":"Titans metal-poor reference stars II. Red giants and CEMP stars","comments":"Accepted in 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":"  Representative samples of F-, G-, K-type stars located out of the Solar\nNeighbourhood has started to be available in spectroscopic surveys. The\nfraction of metal-poor ([Fe/H]~$\\lesssim -0.8$~dex) giants becomes increasingly\nrelevant to far distances. In metal-poor stars, effective temperatures\n($T_{\\mathrm{eff}}$) based on LTE spectroscopy and on former\ncolour-$T_{\\mathrm{eff}}$ relations of still wide use have been reported to be\ninaccurate. It is necessary to re-calibrate chemical abundances based on these\n$T_{\\mathrm{eff}}$ scales in the multiple available surveys to bring them to\nthe same standard scale for their simultaneous use. For that, a complete sample\nof standards is required, which so far, is restricted to a few stars with\nquasi-direct $T_{\\mathrm{eff}}$ measurements. We aim at providing a legacy\nsample of metal-poor standards with proven accurate atmospheric parameters. We\nadd 47 giants to the sample of metal-poor dwarfs of Giribaldi et al. 2021,\nthereby constituting the Titans metal-poor reference stars. $T_{\\mathrm{eff}}$\nwas derived by 3D non-LTE H$\\alpha$ modelling, whose accuracy was tested\nagainst interferometry and InfraRed Flux Method (IRFM). Surface gravity (log\n$g$) was derived by fitting Mg~I~b triplet lines, whose accuracy was tested\nagainst asteroseismology. Metallicity was derived using Fe II lines, which was\nverified to be identical to the [Fe/H] derived from non-LTE spectral synthesis.\n$T_{\\mathrm{eff}}$ from 3D non-LTE H$\\alpha$ is equivalent to interferometric\nand IRFM temperatures within a $\\pm$46~K uncertainty. We achieved precision of\n$\\sim$50~K for 34 stars with spectra with the highest S/N. For log $g$, we\nachieved a total uncertainty of $\\pm$0.15~dex. For [Fe/H], we obtained a total\nuncertainty of $\\pm$0.09~dex. We find that the ionization equilibrium of Fe\nlines under LTE is not valid in metal-poor giants.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:09:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Giribaldi","Riano E.",""],["Van Eck","Sophie",""],["Merle","Thibault",""],["Jorissen","Alain",""],["Krynski","Pawel",""],["Planquart","Lea",""],["Valentini","Marica",""],["Chiappini","Cristina",""],["Van Winckel","Hans",""]]}
{"id":"2308.10119","submitter":"Austin Goddard","authors":"Austin Goddard, Yu Xiang and Ilya Soloveychik","title":"Error Probability Bounds for Invariant Causal Prediction via Multiple\n  Access Channels","comments":"Accepted to the 2023 Asilomar Conference on Signals, Systems, and\n  Computers","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of lower bounding the error probability under the\ninvariant causal prediction (ICP) framework. To this end, we examine and draw\nconnections between ICP and the zero-rate Gaussian multiple access channel by\nfirst proposing a variant of the original invariant prediction assumption, and\nthen considering a special case of the Gaussian multiple access channel where a\ncodebook is shared between an unknown number of senders. This connection allows\nus to develop three types of lower bounds on the error probability, each with\ndifferent assumptions and constraints, leveraging techniques for multiple\naccess channels. The proposed bounds are evaluated with respect to existing\ncausal discovery methods as well as a proposed heuristic method based on\nminimum distance decoding.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:17:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Goddard","Austin",""],["Xiang","Yu",""],["Soloveychik","Ilya",""]]}
{"id":"2308.10120","submitter":"Xu Wu","authors":"Farah Alsafadi, Xu Wu","title":"Deep Generative Modeling-based Data Augmentation with Demonstration\n  using the BFBT Benchmark Void Fraction Datasets","comments":"27 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning (DL) has achieved remarkable successes in many disciplines such\nas computer vision and natural language processing due to the availability of\n``big data''. However, such success cannot be easily replicated in many nuclear\nengineering problems because of the limited amount of training data, especially\nwhen the data comes from high-cost experiments. To overcome such a data\nscarcity issue, this paper explores the applications of deep generative models\n(DGMs) that have been widely used for image data generation to scientific data\naugmentation. DGMs, such as generative adversarial networks (GANs), normalizing\nflows (NFs), variational autoencoders (VAEs), and conditional VAEs (CVAEs), can\nbe trained to learn the underlying probabilistic distribution of the training\ndataset. Once trained, they can be used to generate synthetic data that are\nsimilar to the training data and significantly expand the dataset size. By\nemploying DGMs to augment TRACE simulated data of the steady-state void\nfractions based on the NUPEC Boiling Water Reactor Full-size Fine-mesh Bundle\nTest (BFBT) benchmark, this study demonstrates that VAEs, CVAEs, and GANs have\ncomparable generative performance with similar errors in the synthetic data,\nwith CVAEs achieving the smallest errors. The findings shows that DGMs have a\ngreat potential to augment scientific data in nuclear engineering, which proves\neffective for expanding the training dataset and enabling other DL models to be\ntrained more accurately.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:19:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alsafadi","Farah",""],["Wu","Xu",""]]}
{"id":"2308.10121","submitter":"Shahram Ghandeharizadeh","authors":"Hamed Alimohammadzadeh, Rohit Bernard, Yang Chen, Trung Phan, Prashant\n  Singh, Shuqin Zhu, Heather Culbertson, Shahram Ghandeharizadeh","title":"Dronevision: An Experimental 3D Testbed for Flying Light Specks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.GR cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Today's robotic laboratories for drones are housed in a large room. At times,\nthey are the size of a warehouse. These spaces are typically equipped with\npermanent devices to localize the drones, e.g., Vicon Infrared cameras.\nSignificant time is invested to fine-tune the localization apparatus to compute\nand control the position of the drones. One may use these laboratories to\ndevelop a 3D multimedia system with miniature sized drones configured with\nlight sources. As an alternative, this brave new idea paper envisions shrinking\nthese room-sized laboratories to the size of a cube or cuboid that sits on a\ndesk and costs less than 10K dollars. The resulting Dronevision (DV) will be\nthe size of a 1990s Television. In addition to light sources, its Flying Light\nSpecks (FLSs) will be network-enabled drones with storage and processing\ncapability to implement decentralized algorithms. The DV will include a\nlocalization technique to expedite development of 3D displays. It will act as a\nhaptic interface for a user to interact with and manipulate the 3D virtual\nilluminations. It will empower an experimenter to design, implement, test,\ndebug, and maintain software and hardware that realize novel algorithms in the\ncomfort of their office without having to reserve a laboratory. In addition to\nenhancing productivity, it will improve safety of the experimenter by\nminimizing the likelihood of accidents. This paper introduces the concept of a\nDV, the research agenda one may pursue using this device, and our plans to\nrealize one.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:24:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alimohammadzadeh","Hamed",""],["Bernard","Rohit",""],["Chen","Yang",""],["Phan","Trung",""],["Singh","Prashant",""],["Zhu","Shuqin",""],["Culbertson","Heather",""],["Ghandeharizadeh","Shahram",""]]}
{"id":"2308.10122","submitter":"Xiufeng Xie","authors":"Xiufeng Xie, Riccardo Gherardi, Zhihong Pan, Stephen Huang","title":"HollowNeRF: Pruning Hashgrid-Based NeRFs with Trainable Collision\n  Mitigation","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Neural radiance fields (NeRF) have garnered significant attention, with\nrecent works such as Instant-NGP accelerating NeRF training and evaluation\nthrough a combination of hashgrid-based positional encoding and neural\nnetworks. However, effectively leveraging the spatial sparsity of 3D scenes\nremains a challenge. To cull away unnecessary regions of the feature grid,\nexisting solutions rely on prior knowledge of object shape or periodically\nestimate object shape during training by repeated model evaluations, which are\ncostly and wasteful.\n  To address this issue, we propose HollowNeRF, a novel compression solution\nfor hashgrid-based NeRF which automatically sparsifies the feature grid during\nthe training phase. Instead of directly compressing dense features, HollowNeRF\ntrains a coarse 3D saliency mask that guides efficient feature pruning, and\nemploys an alternating direction method of multipliers (ADMM) pruner to\nsparsify the 3D saliency mask during training. By exploiting the sparsity in\nthe 3D scene to redistribute hash collisions, HollowNeRF improves rendering\nquality while using a fraction of the parameters of comparable state-of-the-art\nsolutions, leading to a better cost-accuracy trade-off. Our method delivers\ncomparable rendering quality to Instant-NGP, while utilizing just 31% of the\nparameters. In addition, our solution can achieve a PSNR accuracy gain of up to\n1dB using only 56% of the parameters.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:28:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xie","Xiufeng",""],["Gherardi","Riccardo",""],["Pan","Zhihong",""],["Huang","Stephen",""]]}
{"id":"2308.10123","submitter":"Yi Zhang","authors":"Yi Zhang, Pengliang Ji, Angtian Wang, Jieru Mei, Adam Kortylewski,\n  Alan Yuille","title":"3D-Aware Neural Body Fitting for Occlusion Robust 3D Human Pose\n  Estimation","comments":"ICCV 2023, project page: https://3dnbf.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Regression-based methods for 3D human pose estimation directly predict the 3D\npose parameters from a 2D image using deep networks. While achieving\nstate-of-the-art performance on standard benchmarks, their performance degrades\nunder occlusion. In contrast, optimization-based methods fit a parametric body\nmodel to 2D features in an iterative manner. The localized reconstruction loss\ncan potentially make them robust to occlusion, but they suffer from the 2D-3D\nambiguity.\n  Motivated by the recent success of generative models in rigid object pose\nestimation, we propose 3D-aware Neural Body Fitting (3DNBF) - an approximate\nanalysis-by-synthesis approach to 3D human pose estimation with SOTA\nperformance and occlusion robustness. In particular, we propose a generative\nmodel of deep features based on a volumetric human representation with Gaussian\nellipsoidal kernels emitting 3D pose-dependent feature vectors. The neural\nfeatures are trained with contrastive learning to become 3D-aware and hence to\novercome the 2D-3D ambiguity.\n  Experiments show that 3DNBF outperforms other approaches on both occluded and\nstandard benchmarks. Code is available at https://github.com/edz-o/3DNBF\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:41:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yi",""],["Ji","Pengliang",""],["Wang","Angtian",""],["Mei","Jieru",""],["Kortylewski","Adam",""],["Yuille","Alan",""]]}
{"id":"2308.10124","submitter":"Yi Hu","authors":"Yi Hu, Jinhang Zuo, Bob Iannucci and Carlee Joe-Wong","title":"Intelligent Communication Planning for Constrained Environmental IoT\n  Sensing with Reinforcement Learning","comments":"To be published in the 20th Annual IEEE International Conference on\n  Sensing, Communication, and Networking (SECON 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Internet of Things (IoT) technologies have enabled numerous data-driven\nmobile applications and have the potential to significantly improve\nenvironmental monitoring and hazard warnings through the deployment of a\nnetwork of IoT sensors. However, these IoT devices are often power-constrained\nand utilize wireless communication schemes with limited bandwidth. Such power\nconstraints limit the amount of information each device can share across the\nnetwork, while bandwidth limitations hinder sensors' coordination of their\ntransmissions. In this work, we formulate the communication planning problem of\nIoT sensors that track the state of the environment. We seek to optimize\nsensors' decisions in collecting environmental data under stringent resource\nconstraints. We propose a multi-agent reinforcement learning (MARL) method to\nfind the optimal communication policies for each sensor that maximize the\ntracking accuracy subject to the power and bandwidth limitations. MARL learns\nand exploits the spatial-temporal correlation of the environmental data at each\nsensor's location to reduce the redundant reports from the sensors. Experiments\non wildfire spread with LoRA wireless network simulators show that our MARL\nmethod can learn to balance the need to collect enough data to predict wildfire\nspread with unknown bandwidth limitations.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 22:59:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Yi",""],["Zuo","Jinhang",""],["Iannucci","Bob",""],["Joe-Wong","Carlee",""]]}
{"id":"2308.10125","submitter":"Thomas A. Ivey","authors":"Annalisa Calini, Thomas Ivey, Emilio Musso","title":"mKdV-Related Flows for Legendrian Curves in the Pseudohermitian 3-Sphere","comments":"28 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate geometric evolution equations for Legendrian curves in the\n3-sphere which are invariant under the action of the unitary group U(2). We\ndefine a natural symplectic structure on the space of Legendrian loops, and\nshow that the modified Korteweg-deVries equation, along with its associated\nhierarchy, are realized as curvature evolutions induced by a sequence of\nHamiltonian flows. For the flow among these that induces the mKdV equation, we\ninvestigate the geometry of solutions which evolve by rigid motions in U(2).\nGeneralizations of our results to higher-order evolutions and curves in similar\ngeometries are also discussed.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 23:18:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Calini","Annalisa",""],["Ivey","Thomas",""],["Musso","Emilio",""]]}
{"id":"2308.10126","submitter":"Zelong Li","authors":"Michael Huang, Zelong Li, Rahi Tanaz, Chengyi Zhang","title":"Positive 2-bridge knots and chirally cosmetic surgeries","comments":"25 pages, 22 figures, code developed can be found at\n  https://github.com/zl830/chiral_cosmetic_surgery_for_pos_2_bridge_knots","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we verify that with the exception of the $(2, 2n+1)$ torus\nknots, positive 2-bridge knots up to 31 crossings do not admit chirally\ncosmetic surgeries. A knot $K$ admits chirally cosmetic surgeries if there\nexist surgeries $S^3_r$ and $S^3_{r'}$ with distinct slopes $r$ and $r'$ such\nthat $S^3_r(K) \\cong -S^3_{r'}(K)$, where the negative represents an\norientation reversal. To verify this, we use the obstruction formula from\narXiv:2112.03144 which relates classical knot invariants to the existence of\nchirally cosmetic surgeries. To check the formula, we develop a Python program\nthat computes the classical knot invariants $a_2$, $a_4$, $v_3$, $\\det$, and\n$g$ of a positive 2-bridge knot.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 23:24:07 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 21:04:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Michael",""],["Li","Zelong",""],["Tanaz","Rahi",""],["Zhang","Chengyi",""]]}
{"id":"2308.10127","submitter":"Youping Chen","authors":"Youping Chen","title":"Unifying temperature definition in atomistic and field representations\n  of conservation laws","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":"  This work presents a formalism to derive field quantities and conservation\nlaws from the atomistic using the theory of distributions as the mathematical\ntool. By defining temperature as a derived quantity, as that in molecular\nkinetic theory and atomistic simulations, a field representation of the\nconservation law of linear momentum is precisely derived and expressed in terms\nof temperature field, leading to a unified atomistic and continuum description\nof temperature and a new conservation equation of linear momentum that,\nsupplemented by an interatomic potential, completely governs thermal and\nmechanical processes across multiple scales from the atomic to the continuum\nand can solve for atomistic trajectories for systems at finite temperatures, as\nwell as the evolution of local field quantities in space and time with atomic\nor multiscale resolution. Four sets of numerical examples are presented to\ndemonstrate the efficacy of the formulation in capturing the effect of\ntemperature or thermal fluctuations, including phonon density of states,\nthermally activated dislocation motion, dislocation formation during\nheteroepitaxy, and attenuation of longitudinal acoustic waves as a result of\ntheir interaction with thermal phonons.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:05:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Youping",""]]}
{"id":"2308.10128","submitter":"Adriano Festa","authors":"Adriano Festa, Simone Gottlich and Michele Ricciardi","title":"Forward-Forward Mean Field Games in mathematical modeling with\n  application to opinion formation and voting models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While the general theory for the terminal-initial value problem in mean-field\ngames is widely used in many models of applied mathematics, the modeling\npotential of the corresponding forward-forward version is still\nunder-considered. In this work, we study the well-posedness of the problem in a\nquite general setting and explain how it is appropriate to model a system of\nplayers that have a complete knowledge of the past states of the system and are\nadapting to new information without any knowledge about the future. Then we\nshow how forward-forward mean field games can be effectively used in\nmathematical models for opinion formation and other social phenomena.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:24:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Festa","Adriano",""],["Gottlich","Simone",""],["Ricciardi","Michele",""]]}
{"id":"2308.10129","submitter":"Shiyan Li","authors":"J. Y. Nie, X. F. Yang, X. Zhang, X. Q. Liu, W. Xia, D. Z. Dai, C. C.\n  Zhao, C. P. Tu, X. M. Kong, X. B. Jin, Y. F. Guo, S. Y. Li","title":"Pressure-induced double-dome superconductivity in kagome metal CsTi3Bi5","comments":"7 pages, 5 figures","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 present high-pressure resistance measurements up to 40 GPa on recently\ndiscovered titanium-based kagome metal CsTi$_3$Bi$_5$. At ambient pressure,\nCsTi$_3$Bi$_5$ shows no evidence of superconductivity in resistivity and\nspecific heat. By applying pressure, superconductivity emerges and the\nsuperconducting transition temperature ${\\it T}_{\\rm c}$ reaches its first\nmaximum of 1.2 K at $\\sim$5 GPa. Then the ${\\it T}_{\\rm c}$ is suppressed by\npressure and cannot be detected around 10 GPa, manifesting as a superconducting\ndome. Remarkably, upon further increasing pressure above $\\sim$13 GPa, another\nsuperconducting dome shows up, with the maximum ${\\it T}_{\\rm c}$ of 0.6 K and\nending pressure at $\\sim$36 GPa. The variation of ${\\it T}_{\\rm c}$ displays a\nclear double-dome shape in the superconducting phase diagram. Our work\ndemonstrates the similarity between CsTi$_3$Bi$_5$ and CsV$_3$Sb$_5$, providing\nvaluable insights into the rich physics of these novel kagome metals.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:31:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nie","J. Y.",""],["Yang","X. F.",""],["Zhang","X.",""],["Liu","X. Q.",""],["Xia","W.",""],["Dai","D. Z.",""],["Zhao","C. C.",""],["Tu","C. P.",""],["Kong","X. M.",""],["Jin","X. B.",""],["Guo","Y. F.",""],["Li","S. Y.",""]]}
{"id":"2308.10130","submitter":"James Cheung","authors":"James Cheung","title":"On the Approximation of Operator-Valued Riccati Equations in Hilbert\n  Spaces","comments":"Initial Release","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we present an abstract theory for the approximation of\noperator-valued Riccati equations posed on Hilbert spaces. It is demonstrated\nhere, under the assumption of compactness in the coefficient operators, that\nthe error of the approximate solution to the operator-valued Riccati equation\nis bounded above by the approximation error of the governing semigroup. One\nsignificant outcome of this result is the correct prediction of optimal\nconvergence for finite element approximations of the operator-valued Riccati\nequations for when the governing semigroup involves parabolic, as well as\nhyperbolic processes. We derive the abstract theory for the time-dependent and\ntime-independent operator-valued Riccati equations in the first part of this\nwork. In the second part, we prove optimal convergence rates for the finite\nelement approximation of the functional gain associated with model\none-dimensional weakly damped wave and thermal LQR control systems. These\ntheoretical claims are then corroborated with computational evidence.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:34:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cheung","James",""]]}
{"id":"2308.10131","submitter":"Zichao Yang","authors":"Kwok Ping Tsang and Zichao Yang","title":"Agree to Disagree: Measuring Hidden Dissents in FOMC Meetings","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":"  Based on a record of dissents on FOMC votes and transcripts of the meetings\nfrom 1976 to 2017, we develop a deep learning model based on self-attention\nmodules to create a measure of disagreement for each member in each meeting.\nWhile dissents are rare, we find that members often have reservations with the\npolicy decision. The level of disagreement is mostly driven by current or\npredicted macroeconomic data at both the individual and meeting levels, while\npersonal characteristics of the members matter only at the individual level. We\nalso use our model to evaluate speeches made by members between meetings, and\nwe find a weak correlation between the level of disagreement revealed in them\nand that of the following meeting. Finally, we find that the level of\ndisagreement increases whenever monetary policy action is more aggressive.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:48:27 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 23:59:38 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tsang","Kwok Ping",""],["Yang","Zichao",""]]}
{"id":"2308.10132","submitter":"Kaiyuan Chen","authors":"Kaiyuan Chen, Zhicheng Hu","title":"Thermal analysis of dual-phase-lag model in a two-dimensional plate\n  subjected to a heat source moving along elliptical trajectories","comments":"15 pages, 41 figures","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 focus on the study of heat transfer behavior for the\ndual-phase-lag heat conduction model, which describes the evolution of\ntemperature in a two-dimensional rectangular plate caused by the activity of a\npoint heat source moving along elliptical trajectories. At first, Green's\nfunction approach is applied to derive the analytical solution of temperature\nfor the given model. Based on the series representation of this analytical\nsolution, the thermal responses for the underlying heat transfer problem,\nincluding the relations between the moving heat source and the concomitant\ntemperature peak, the influences of the pair of phase lags and the angular\nvelocity of heat source on temperature, are then investigated, analyzed and\ndiscussed in detail for three different movement trajectories. Compared with\nthe results revealed for the common situation that the heat source moves in a\nstraight line with a constant speed, the present results show quite distinctive\nthermal behaviors for all cases, which subsequently can help us to better\nunderstand the internal mechanism of the dual-phase-lag heat transfer subjected\nto a moving heat source with curved trajectory.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 01:52:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Kaiyuan",""],["Hu","Zhicheng",""]]}
{"id":"2308.10133","submitter":"Jun Dan","authors":"Jun Dan, Yang Liu, Haoyu Xie, Jiankang Deng, Haoran Xie, Xuansong Xie\n  and Baigui Sun","title":"TransFace: Calibrating Transformer Training for Face Recognition from a\n  Data-Centric Perspective","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision Transformers (ViTs) have demonstrated powerful representation ability\nin various visual tasks thanks to their intrinsic data-hungry nature. However,\nwe unexpectedly find that ViTs perform vulnerably when applied to face\nrecognition (FR) scenarios with extremely large datasets. We investigate the\nreasons for this phenomenon and discover that the existing data augmentation\napproach and hard sample mining strategy are incompatible with ViTs-based FR\nbackbone due to the lack of tailored consideration on preserving face\nstructural information and leveraging each local token information. To remedy\nthese problems, this paper proposes a superior FR model called TransFace, which\nemploys a patch-level data augmentation strategy named DPAP and a hard sample\nmining strategy named EHSM. Specially, DPAP randomly perturbs the amplitude\ninformation of dominant patches to expand sample diversity, which effectively\nalleviates the overfitting problem in ViTs. EHSM utilizes the information\nentropy in the local tokens to dynamically adjust the importance weight of easy\nand hard samples during training, leading to a more stable prediction.\nExperiments on several benchmarks demonstrate the superiority of our TransFace.\nCode and models are available at https://github.com/DanJun6737/TransFace.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:02:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dan","Jun",""],["Liu","Yang",""],["Xie","Haoyu",""],["Deng","Jiankang",""],["Xie","Haoran",""],["Xie","Xuansong",""],["Sun","Baigui",""]]}
{"id":"2308.10134","submitter":"Hongwu Peng","authors":"Hongwu Peng, Shaoyi Huang, Tong Zhou, Yukui Luo, Chenghong Wang,\n  Zigeng Wang, Jiahui Zhao, Xi Xie, Ang Li, Tony Geng, Kaleel Mahmood, Wujie\n  Wen, Xiaolin Xu, Caiwen Ding","title":"AutoReP: Automatic ReLU Replacement for Fast Private Network Inference","comments":"ICCV 2023 accepeted publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growth of the Machine-Learning-As-A-Service (MLaaS) market has\nhighlighted clients' data privacy and security issues. Private inference (PI)\ntechniques using cryptographic primitives offer a solution but often have high\ncomputation and communication costs, particularly with non-linear operators\nlike ReLU. Many attempts to reduce ReLU operations exist, but they may need\nheuristic threshold selection or cause substantial accuracy loss. This work\nintroduces AutoReP, a gradient-based approach to lessen non-linear operators\nand alleviate these issues. It automates the selection of ReLU and polynomial\nfunctions to speed up PI applications and introduces distribution-aware\npolynomial approximation (DaPa) to maintain model expressivity while accurately\napproximating ReLUs. Our experimental results demonstrate significant accuracy\nimprovements of 6.12% (94.31%, 12.9K ReLU budget, CIFAR-10), 8.39% (74.92%,\n12.9K ReLU budget, CIFAR-100), and 9.45% (63.69%, 55K ReLU budget,\nTiny-ImageNet) over current state-of-the-art methods, e.g., SNL. Morever,\nAutoReP is applied to EfficientNet-B2 on ImageNet dataset, and achieved 75.55%\naccuracy with 176.1 times ReLU budget reduction.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:03:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Peng","Hongwu",""],["Huang","Shaoyi",""],["Zhou","Tong",""],["Luo","Yukui",""],["Wang","Chenghong",""],["Wang","Zigeng",""],["Zhao","Jiahui",""],["Xie","Xi",""],["Li","Ang",""],["Geng","Tony",""],["Mahmood","Kaleel",""],["Wen","Wujie",""],["Xu","Xiaolin",""],["Ding","Caiwen",""]]}
{"id":"2308.10135","submitter":"Apoorv Singh","authors":"Apoorv Singh","title":"A Review on Objective-Driven Artificial Intelligence","comments":"5 pages, 5 figures, workshop submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While advancing rapidly, Artificial Intelligence still falls short of human\nintelligence in several key aspects due to inherent limitations in current AI\ntechnologies and our understanding of cognition. Humans have an innate ability\nto understand context, nuances, and subtle cues in communication, which allows\nus to comprehend jokes, sarcasm, and metaphors. Machines struggle to interpret\nsuch contextual information accurately. Humans possess a vast repository of\ncommon-sense knowledge that helps us make logical inferences and predictions\nabout the world. Machines lack this innate understanding and often struggle\nwith making sense of situations that humans find trivial. In this article, we\nreview the prospective Machine Intelligence candidates, a review from Prof.\nYann LeCun, and other work that can help close this gap between human and\nmachine intelligence. Specifically, we talk about what's lacking with the\ncurrent AI techniques such as supervised learning, reinforcement learning,\nself-supervised learning, etc. Then we show how Hierarchical planning-based\napproaches can help us close that gap and deep-dive into energy-based,\nlatent-variable methods and Joint embedding predictive architecture methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:07:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singh","Apoorv",""]]}
{"id":"2308.10136","submitter":"Wenchang Xiang","authors":"Wenchang Xiang, Yanbing Cai, and Daicui Zhou","title":"Imaging constituent quark shape of proton with exclusive vector meson\n  production at HERA","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show within proton hot spot picture that the exclusive vector meson\nproduction in electron-proton deeply inelastic scattering is sensitive to the\nindividual width of the constituent quarks of the proton. For comparison, we\ncalculate the exclusive $J/\\Psi$ production cross-sections in three cases,\n$\\mathrm{B_u} \\geq \\mathrm{B_d}$, $\\mathrm{B_u} < \\mathrm{B_d}$ and\n$\\mathrm{B_u}\\neq\\mathrm{B^{\\prime}_u}\\neq\\mathrm{B_d}$, where the\n$\\mathrm{B_u}$, $\\mathrm{B^{\\prime}_u}$ and $\\mathrm{B_d}$ denote the widths of\ntwo up quarks and down quark. We find that only results calculated with\n$\\mathrm{B_u} \\geq \\mathrm{B_d}$ can give a reasonable description of the\nexclusive $J/\\Psi$ production cross-section data at HERA. To test that our\nresults are independent of the details of the model, we retain the average\nwidth of the three constituent quarks unchanged and compute the exclusive\n$J/\\Psi$ production cross-sections with contribution weight by setting\ndifferent proportional coefficients ($\\mathrm{W_u}$ and $\\mathrm{W_d}$) for the\nup and down quarks, respectively. It shows that the results calculated with\n$\\mathrm{W_u}\\geq\\mathrm{W_d}$ can well reproduce the exclusive $J/\\Psi$\nproduction data at HERA, while the opposite case cannot describe the HERA data.\nThese interesting findings seem to indicate that the up quark has more gluons\naround it than the down quark at high energy although the spatial distribution\nof gluons fluctuates event-by-event . To ensure the relevant results\nindependent of the species of the vector meson, we also calculate the $\\rho$\nproduction cross-sections with the same group of parameters used in the\nexclusive $J/\\Psi$ production and compare the predictions with the HERA data.\nIt shows that all the results computed in the exclusive $\\rho$ productions are\nconsistent with the findings obtained in the exclusive $J/\\Psi$ productions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:26:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xiang","Wenchang",""],["Cai","Yanbing",""],["Zhou","Daicui",""]]}
{"id":"2308.10137","submitter":"Feng Yan","authors":"Feng Yan, Estela Moreton Alfons\\'in, Peter Ngene, Sytze de Graaf,\n  Oreste De Luca, Huatang Cao, Konstantinos Spyrou, Liqiang Lu, Eleni Thomou,\n  Yutao Pei, Bart J. Kooi, Dimitrios P. Gournis, Petra E. de Jongh, and Petra\n  Rudolf","title":"MgH2 nanoparticles confined in reduced graphene oxide pillared with\n  organosilica: a novel type of hydrogen storage material","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 promising energy carrier that can push forward the energy\ntransition because of its high energy density (142 MJ kg-1), variety of\npotential sources, low weight and low environmental impact, but its storage for\nautomotive applications remains a formidable challenge. MgH2, with its high\ngravimetric and volumetric density, presents a compelling platform for hydrogen\nstorage; however, its utilization is hindered by the sluggish kinetics of\nhydrogen uptake/release and high temperature operation. Herein we show that a\nnovel layered heterostructure of reduced graphene oxide and organosilica with\nhigh specific surface area and narrow pore size distribution can serve as a\nscaffold to host MgH2 nanoparticles with a narrow diameter distribution around\n~2.5 nm and superior hydrogen storage properties to bulk MgH2. Desorption\nstudies showed that hydrogen release starts at 50 {\\deg}C, with a maximum at\n348 {\\deg}C and kinetics dependent on particle size. Reversibility tests\ndemonstrated that the dehydrogenation kinetics and re-hydrogenation capacity of\nthe system remains stable at 1.62 wt.% over four cycles at 200 {\\deg}C. Our\nresults prove that MgH2 confinement in a nanoporous scaffold is an efficient\nway to constrain the size of the hydride particles, avoid aggregation and\nimprove kinetics for hydrogen release and recharging.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:34:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yan","Feng",""],["Alfons\u00edn","Estela Moreton",""],["Ngene","Peter",""],["de Graaf","Sytze",""],["De Luca","Oreste",""],["Cao","Huatang",""],["Spyrou","Konstantinos",""],["Lu","Liqiang",""],["Thomou","Eleni",""],["Pei","Yutao",""],["Kooi","Bart J.",""],["Gournis","Dimitrios P.",""],["de Jongh","Petra E.",""],["Rudolf","Petra",""]]}
{"id":"2308.10138","submitter":"Harold Chiang","authors":"Harold D. Chiang and Yuya Sasaki and Yulong Wang","title":"Cluster-Robust Inference Robust to Large Clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent literature Sasaki and Wang (2022) points out that the conventional\ncluster-robust standard errors fail in the presence of large clusters. We\npropose a novel method of cluster-robust inference that is valid even in the\npresence of large clusters. Specifically, we derive the asymptotic distribution\nfor the t-statistics based on the common cluster-robust variance estimators\nwhen the distribution of cluster sizes follows a power law with an exponent\nless than two. We then propose an inference procedure based on subsampling and\nshow its validity. Our proposed method does not require tail index estimation\nand remains valid under the usual thin-tailed scenarios as well.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:35:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chiang","Harold D.",""],["Sasaki","Yuya",""],["Wang","Yulong",""]]}
{"id":"2308.10139","submitter":"Feng Yan","authors":"Feng Yan, Liqiang Lu, Chongan Ye, Qi Chen, Sumit Kumar, Wenjian Li,\n  Hamoon Hemmatpour, Konstantinos Spyrou, Sytze de Graaf, Marc C. A. Stuart,\n  Bart J. Kooi, Dimitrios P. Gournis, Katja Loos, Yutao Pei, and Petra Rudolf","title":"Nitrogen-Doped Ti$_3$C$_2$T$_x$ Coated with a Molecularly Imprinted\n  Polymer as Efficient Cathode Material for Lithium-Sulfur Batteries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to their high energy density (2600 Wh/kg), low cost, and low\nenvironmental impact, lithium-sulfur batteries are considered a promising\nalternative to lithium-ion batteries. However, their commercial viability\nremains a formidable scientific challenge mainly because of the sluggish\nreaction kinetics at the cathode and the so-called \"shuttling effect\" of\nsoluble polysulfides, which results in capacity decay and a shortened lifespan.\nHerein, molecular imprinting with Li$_2$S$_8$ as a target molecule in\ncombination with a two-dimensional material, MXene, is proposed to overcome\nthese issues. Molecularly imprinted polymer-coated nitrogen-doped Ti-based\nMXene was successfully synthesized and demonstrated to exhibit an appealing\nelectrochemical performance, namely a high specific capacity of 1095 mAh/g at\n0.1 C and an extended cycling stability (300 mAh/g at 1.0 C after 300 cycles).\nX-ray photoelectron spectroscopy was applied to elucidate the underlying\nmechanisms and proved that Li$_2$S$_8$-imprinted polymer polyacrylamide serves\nas a polysulfide trap through strong chemical affinity towards the long-chain\nlithium polysulfides, while N-doped Ti-based MXene promotes the redox kinetics\nby accelerating the conversion of lithium polysulfides. This distinct\ninterfacial strategy is expected to result in more effective and stable Li-S\nbatteries.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:38:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yan","Feng",""],["Lu","Liqiang",""],["Ye","Chongan",""],["Chen","Qi",""],["Kumar","Sumit",""],["Li","Wenjian",""],["Hemmatpour","Hamoon",""],["Spyrou","Konstantinos",""],["de Graaf","Sytze",""],["Stuart","Marc C. A.",""],["Kooi","Bart J.",""],["Gournis","Dimitrios P.",""],["Loos","Katja",""],["Pei","Yutao",""],["Rudolf","Petra",""]]}
{"id":"2308.10140","submitter":"Jian Chen","authors":"Jian Chen and Xiaoxue Jiang and Liping Tang and Xinmin Yang","title":"On the Convergence of Newton-type Proximal Gradient Method for\n  Multiobjective Optimization Problems","comments":"arXiv admin note: text overlap with arXiv:2306.09797","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent study, Ansary (Optim Methods Softw 38(3):570-590,2023) proposed a\nNewton-type proximal gradient method for nonlinear multiobjective optimization\nproblems (NPGMO). However, the favorable convergence properties typically\nassociated with Newton-type methods were not established for NPGMO in Ansary's\nwork. In response to this gap, we develop a straightforward framework for\nanalyzing the convergence behavior of the NPGMO. Specifically, under the\nassumption of strong convexity, we demonstrate that the NPGMO enjoys quadratic\ntermination, superlinear convergence, and quadratic convergence for problems\nthat are quadratic, twice continuously differentiable and twice Lipschitz\ncontinuously differentiable, respectively.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 02:44:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Jian",""],["Jiang","Xiaoxue",""],["Tang","Liping",""],["Yang","Xinmin",""]]}
{"id":"2308.10141","submitter":"Yanyuan Qiao","authors":"Yanyuan Qiao, Yuankai Qi, Zheng Yu, Jing Liu, Qi Wu","title":"March in Chat: Interactive Prompting for Remote Embodied Referring\n  Expression","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":"  Many Vision-and-Language Navigation (VLN) tasks have been proposed in recent\nyears, from room-based to object-based and indoor to outdoor. The REVERIE\n(Remote Embodied Referring Expression) is interesting since it only provides\nhigh-level instructions to the agent, which are closer to human commands in\npractice. Nevertheless, this poses more challenges than other VLN tasks since\nit requires agents to infer a navigation plan only based on a short\ninstruction. Large Language Models (LLMs) show great potential in robot action\nplanning by providing proper prompts. Still, this strategy has not been\nexplored under the REVERIE settings. There are several new challenges. For\nexample, the LLM should be environment-aware so that the navigation plan can be\nadjusted based on the current visual observation. Moreover, the LLM planned\nactions should be adaptable to the much larger and more complex REVERIE\nenvironment. This paper proposes a March-in-Chat (MiC) model that can talk to\nthe LLM on the fly and plan dynamically based on a newly proposed\nRoom-and-Object Aware Scene Perceiver (ROASP). Our MiC model outperforms the\nprevious state-of-the-art by large margins by SPL and RGSPL metrics on the\nREVERIE benchmark.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:00:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qiao","Yanyuan",""],["Qi","Yuankai",""],["Yu","Zheng",""],["Liu","Jing",""],["Wu","Qi",""]]}
{"id":"2308.10142","submitter":"Zeyu Han","authors":"Jie Zeng, Zeyu Han, Xingchen Peng, Jianghong Xiao, Peng Wang, Yan Wang","title":"Polymerized Feature-based Domain Adaptation for Cervical Cancer Dose Map\n  Prediction","comments":"Accepted and presented in ISBI 2023. To be published in Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Recently, deep learning (DL) has automated and accelerated the clinical\nradiation therapy (RT) planning significantly by predicting accurate dose maps.\nHowever, most DL-based dose map prediction methods are data-driven and not\napplicable for cervical cancer where only a small amount of data is available.\nTo address this problem, this paper proposes to transfer the rich knowledge\nlearned from another cancer, i.e., rectum cancer, which has the same scanning\narea and more clinically available data, to improve the dose map prediction\nperformance for cervical cancer through domain adaptation. In order to close\nthe congenital domain gap between the source (i.e., rectum cancer) and the\ntarget (i.e., cervical cancer) domains, we develop an effective\nTransformer-based polymerized feature module (PFM), which can generate an\noptimal polymerized feature distribution to smoothly align the two input\ndistributions. Experimental results on two in-house clinical datasets\ndemonstrate the superiority of the proposed method compared with\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:00:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zeng","Jie",""],["Han","Zeyu",""],["Peng","Xingchen",""],["Xiao","Jianghong",""],["Wang","Peng",""],["Wang","Yan",""]]}
{"id":"2308.10143","submitter":"Takefumi Nosaka","authors":"Takefumi Nosaka, Koki Yanagida, Naoko Wakijo","title":"Nonacyclic Reidemeister torsions of manifolds of odd dimension","comments":"We welcome any comments. 23 pages. No figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given an oriented closed manifold $M$ of odd dimension and a unitary\nrepresentation $\\rho : \\pi_1(M) \\ra \\GL_n(\\F)$, we define a Reidemeister\ntorsion, even if the cohomology associated with $\\rho$ is not acyclic. As\ncorollaries, we introduce some topological invariants of $M$, which include the\nnonacyclic extensions of abelian torsions and the Alexander polynomials of\nlinks. Further, we propose a volume form of the $\\SU(n)$-character varieties of\n$M$. Moreover, we compute the Reidemeister torsions of some representations of\n3-manifolds and compare the works of Farber--Turaev.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:00:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nosaka","Takefumi",""],["Yanagida","Koki",""],["Wakijo","Naoko",""]]}
{"id":"2308.10144","submitter":"Andrew Zhao","authors":"Andrew Zhao, Daniel Huang, Quentin Xu, Matthieu Lin, Yong-Jin Liu, Gao\n  Huang","title":"ExpeL: LLM Agents Are Experiential Learners","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 recent surge in research interest in applying large language models\n(LLMs) to decision-making tasks has flourished by leveraging the extensive\nworld knowledge embedded in LLMs. While there is a growing demand to tailor\nLLMs for custom decision-making tasks, finetuning them for specific tasks is\nresource-intensive and may diminish the model's generalization capabilities.\nMoreover, state-of-the-art language models like GPT-4 and Claude are primarily\naccessible through API calls, with their parametric weights remaining\nproprietary and unavailable to the public. This scenario emphasizes the growing\nneed for new methodologies that allow learning from agent experiences without\nrequiring parametric updates. To address these problems, we introduce the\nExperiential Learning (ExpeL) agent. Our agent autonomously gathers experiences\nand extracts knowledge using natural language from a collection of training\ntasks. At inference, the agent recalls its extracted insights and past\nexperiences to make informed decisions. Our empirical results highlight the\nrobust learning efficacy of the ExpeL agent, indicating a consistent\nenhancement in its performance as it accumulates experiences. We further\nexplore the emerging capabilities and transfer learning potential of the ExpeL\nagent through qualitative observations and additional experiments.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:03:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Andrew",""],["Huang","Daniel",""],["Xu","Quentin",""],["Lin","Matthieu",""],["Liu","Yong-Jin",""],["Huang","Gao",""]]}
{"id":"2308.10145","submitter":"Younggeun Kim","authors":"Young-geun Kim, Kyungbok Lee, Youngwon Choi, Joong-Ho Won, Myunghee\n  Cho Paik","title":"Wasserstein Geodesic Generator for Conditional Distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generating samples given a specific label requires estimating conditional\ndistributions. We derive a tractable upper bound of the Wasserstein distance\nbetween conditional distributions to lay the theoretical groundwork to learn\nconditional distributions. Based on this result, we propose a novel conditional\ngeneration algorithm where conditional distributions are fully characterized by\na metric space defined by a statistical distance. We employ optimal transport\ntheory to propose the Wasserstein geodesic generator, a new conditional\ngenerator that learns the Wasserstein geodesic. The proposed method learns both\nconditional distributions for observed domains and optimal transport maps\nbetween them. The conditional distributions given unobserved intermediate\ndomains are on the Wasserstein geodesic between conditional distributions given\ntwo observed domain labels. Experiments on face images with light conditions as\ndomain labels demonstrate the efficacy of the proposed method.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:12:10 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 21:21:20 GMT"},{"version":"v3","created":"Mon, 28 Aug 2023 16:13:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Young-geun",""],["Lee","Kyungbok",""],["Choi","Youngwon",""],["Won","Joong-Ho",""],["Paik","Myunghee Cho",""]]}
{"id":"2308.10146","submitter":"Shujie Zhang","authors":"Shujie Zhang, Tianyue Zheng, Zhe Chen, Jingzhi Hu, Abdelwahed Khamis,\n  Jiajun Liu and Jun Luo","title":"OCHID-Fi: Occlusion-Robust Hand Pose Estimation in 3D via RF-Vision","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Hand Pose Estimation (HPE) is crucial to many applications, but conventional\ncameras-based CM-HPE methods are completely subject to Line-of-Sight (LoS), as\ncameras cannot capture occluded objects. In this paper, we propose to exploit\nRadio-Frequency-Vision (RF-vision) capable of bypassing obstacles for achieving\noccluded HPE, and we introduce OCHID-Fi as the first RF-HPE method with 3D pose\nestimation capability. OCHID-Fi employs wideband RF sensors widely available on\nsmart devices (e.g., iPhones) to probe 3D human hand pose and extract their\nskeletons behind obstacles. To overcome the challenge in labeling RF imaging\ngiven its human incomprehensible nature, OCHID-Fi employs a cross-modality and\ncross-domain training process. It uses a pre-trained CM-HPE network and a\nsynchronized CM/RF dataset, to guide the training of its complex-valued RF-HPE\nnetwork under LoS conditions. It further transfers knowledge learned from\nlabeled LoS domain to unlabeled occluded domain via adversarial learning,\nenabling OCHID-Fi to generalize to unseen occluded scenarios. Experimental\nresults demonstrate the superiority of OCHID-Fi: it achieves comparable\naccuracy to CM-HPE under normal conditions while maintaining such accuracy even\nin occluded scenarios, with empirical evidence for its generalizability to new\ndomains.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:13:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Shujie",""],["Zheng","Tianyue",""],["Chen","Zhe",""],["Hu","Jingzhi",""],["Khamis","Abdelwahed",""],["Liu","Jiajun",""],["Luo","Jun",""]]}
{"id":"2308.10147","submitter":"Mingxin Huang","authors":"Mingxin Huang, Jiaxin Zhang, Dezhi Peng, Hao Lu, Can Huang, Yuliang\n  Liu, Xiang Bai, Lianwen Jin","title":"ESTextSpotter: Towards Better Scene Text Spotting with Explicit Synergy\n  in Transformer","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":"  In recent years, end-to-end scene text spotting approaches are evolving to\nthe Transformer-based framework. While previous studies have shown the crucial\nimportance of the intrinsic synergy between text detection and recognition,\nrecent advances in Transformer-based methods usually adopt an implicit synergy\nstrategy with shared query, which can not fully realize the potential of these\ntwo interactive tasks. In this paper, we argue that the explicit synergy\nconsidering distinct characteristics of text detection and recognition can\nsignificantly improve the performance text spotting. To this end, we introduce\na new model named Explicit Synergy-based Text Spotting Transformer framework\n(ESTextSpotter), which achieves explicit synergy by modeling discriminative and\ninteractive features for text detection and recognition within a single\ndecoder. Specifically, we decompose the conventional shared query into\ntask-aware queries for text polygon and content, respectively. Through the\ndecoder with the proposed vision-language communication module, the queries\ninteract with each other in an explicit manner while preserving discriminative\npatterns of text detection and recognition, thus improving performance\nsignificantly. Additionally, we propose a task-aware query initialization\nscheme to ensure stable training. Experimental results demonstrate that our\nmodel significantly outperforms previous state-of-the-art methods. Code is\navailable at https://github.com/mxin262/ESTextSpotter.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:22:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Mingxin",""],["Zhang","Jiaxin",""],["Peng","Dezhi",""],["Lu","Hao",""],["Huang","Can",""],["Liu","Yuliang",""],["Bai","Xiang",""],["Jin","Lianwen",""]]}
{"id":"2308.10148","submitter":"Eman Alashwali","authors":"Eman Alashwali and Lorrie Faith Cranor","title":"Privacy Perceptions and Behaviors of Google Personal Account Holders in\n  Saudi Arabia","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.CR cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While privacy perceptions and behaviors have been investigated in Western\nsocieties, little is known about these issues in non-Western societies. To\nbridge this gap, we interviewed 30 Google personal account holders in Saudi\nArabia about their privacy perceptions (awareness, attitudes, preferences, and\nconcerns) regarding the activity data that Google saves about them, as well as\nany steps they take to control Google's collection or use of this data. Our\nstudy focuses on Google's Activity Controls, which enable users to control\nwhether, and how, Google saves their Web & App Activity, Location History, and\nYouTube History. Our results show that although most participants have some\nlevel of awareness about Google's data practices and the Activity Controls,\nmany have only vague awareness, and the majority have not used the available\ncontrols. When participants viewed their saved activity data, many were\nsurprised by what had been saved. While many participants find Google's use of\ntheir data to improve the services provided to them acceptable, the majority\nfind the use of their data for ad purposes unacceptable. We observe that our\nSaudi participants exhibit similar trends and patterns in privacy awareness,\nattitudes, preferences, concerns, and behaviors to what has been found in\nstudies in the US. However, our study is not a replication of any of the US\nstudies, and further research is needed to directly compare US and Saudi\nparticipants. Our results emphasize the need for: (1) improved techniques to\ninform users about privacy settings during account sign-up, to remind users\nabout their settings, and to raise awareness about privacy settings; (2)\nimproved privacy setting interfaces to reduce the costs that deter many users\nfrom changing the settings; and (3) further research to explore privacy\nconcerns in non-Western cultures.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:25:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alashwali","Eman",""],["Cranor","Lorrie Faith",""]]}
{"id":"2308.10149","submitter":"Yingji Li","authors":"Yingji Li, Mengnan Du, Rui Song, Xin Wang, Ying Wang","title":"A Survey on Fairness in Large Language Models","comments":"12 pages, 2 figures, 101 references","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 powerful performance and development\nprospect and are widely deployed in the real world. However, LLMs can capture\nsocial biases from unprocessed training data and propagate the biases to\ndownstream tasks. Unfair LLM systems have undesirable social impacts and\npotential harms. In this paper, we provide a comprehensive review of related\nresearch on fairness in LLMs. First, for medium-scale LLMs, we introduce\nevaluation metrics and debiasing methods from the perspectives of intrinsic\nbias and extrinsic bias, respectively. Then, for large-scale LLMs, we introduce\nrecent fairness research, including fairness evaluation, reasons for bias, and\ndebiasing methods. Finally, we discuss and provide insight on the challenges\nand future directions for the development of fairness in LLMs.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:30:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yingji",""],["Du","Mengnan",""],["Song","Rui",""],["Wang","Xin",""],["Wang","Ying",""]]}
{"id":"2308.10150","submitter":"Min Wang","authors":"Chanseok Park and Min Wang","title":"A goodness-of-fit test for the Birnbaum-Saunders distribution based on\n  the probability plot","comments":"17 pages, 4 figures, and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the present paper, we develop a new goodness-of-fit test for the Birnbaum-\nSaunders distribution based on the probability plot. We utilize the sample\ncorrelation coefficient from the Birnbaum-Saunders probability plot as a\nmeasure of goodness of fit. Unfortunately, it is impossible or extremely\ndifficult to obtain an explicit distribution of this sample correlation\ncoefficient. To address this challenge, we employ extensive Monte Carlo\nsimulations to obtain the empirical distribution of the sample correlation\ncoefficient from the Birnbaum-Saunders probability plot. This empirical\ndistribution allows us to determine the critical values alongside their\ncorresponding significance levels, thus facilitating the computation of the\np-value when the sample correlation coefficient is obtained. Finally, two\nreal-data examples are provided for illustrative purposes.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:34:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Park","Chanseok",""],["Wang","Min",""]]}
{"id":"2308.10151","submitter":"Rafael Pereira","authors":"Bernardo Carvalho and Rafael da Costa Pereira","title":"Box dimension of stable sub-slices of fractal graphs over Anosov\n  diffeomorphisms","comments":"17 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider fractal graphs invariant by a skew product $F:\\mathbb{T}^k\\times\n\\mathbb{R}\\rightarrow \\mathbb{T}^k\\times \\mathbb{R}$ of the form $F(x,y)=(Ax,\n\\lambda y+p(x))$ where $0<\\lambda<1$, $p\\colon\\mathbb{T}^k\\to\\mathbb{R}$ is a\n$C^{k+1}$ function, and $A$ is an Anosov diffeomorphism of $\\mathbb{T}^k$\nadmitting $k$ distinct eigenvalues with respective eigenvectors forming a basis\nof $\\mathbb{R}^k$. We note that the stable sub-slices can give information of\nthe fractal structure of the graph that is not captured by the box dimension of\nthe graph. Using the results of Kaplan,Mallet-Paret, and York [6], we exhibit\nconditions on the skew product that ensure the box dimension of the graph is\nsmaller than the sum of the box dimensions of its stable/unstable sub-slices.\nWe prove that these conditions hold for generic functions $p\\in C^{k+1}$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:47:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Carvalho","Bernardo",""],["Pereira","Rafael da Costa",""]]}
{"id":"2308.10152","submitter":"Kuang Gao","authors":"Gao Kuang Hong, Lin Tie, Ma Xiao Rong, Li Qiu Lin, Li Zhi Qing","title":"Disorder-induced linear magnetoresistance in Al$_2$O$_3$/SrTiO$_3$\n  heterostructures","comments":"22 Pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The unsaturated linear magnetoresistance (LMR) has attracted widely attention\nbecause of potential applications and fundamental interest. By controlling the\ngrowth temperature, we realized the metal-to-insulator transition in\nAl$_2$O$_3$/SrTiO$_3$ heterostructures. The LMR is observed in metallic samples\nwith the electron mobility varying over three orders of magnitude. The observed\nLMR cannot be explained by the guiding center diffusion model even in samples\nwith very high mobility. The slope of the observed LMR is proportional to the\nHall mobility, and the crossover field, indicating a transition from quadratic\n(at low fields) to linear (at high fields) field dependence, is proportional to\nthe inverse Hall mobility. This signifies that the classical model is valid to\nexplain the observed LMR. More importantly, we develop an analytical expression\naccording to the effective-medium theory that is equivalent to the classical\nmodel. And the analytical expression describes the LMR data very well,\nconfirming the validity of the classical model.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:51:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hong","Gao Kuang",""],["Tie","Lin",""],["Rong","Ma Xiao",""],["Lin","Li Qiu",""],["Qing","Li Zhi",""]]}
{"id":"2308.10153","submitter":"Ethan Hansen","authors":"Daniel T. Chen and Ethan H. Hansen and Xinpeng Li and Aaron Orenstein\n  and Vinooth Kulkarni and Vipin Chaudhary and Qiang Guan and Ji Liu and Yang\n  Zhang and Shuai Xu","title":"Online Detection of Golden Circuit Cutting Points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum circuit cutting has emerged as a promising method for simulating\nlarge quantum circuits using a collection of small quantum machines. Running\nlow-qubit \"circuit fragments\" not only overcomes the size limitation of\nnear-term hardware, but it also increases the fidelity of the simulation.\nHowever, reconstructing measurement statistics requires computational resources\n- both classical and quantum - that grow exponentially with the number of cuts.\nIn this manuscript, we introduce the concept of a golden cutting point, which\nidentifies unnecessary basis components during reconstruction and avoids\nrelated down-stream computation. We propose a hypothesis-testing scheme for\nidentifying golden cutting points, and provide robustness results in the case\nof the test failing with low probability. Lastly, we demonstrate the\napplicability of our method on Qiskit's Aer simulator and observe a reduced\nwall time from identifying and avoiding obsolete measurements.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:56:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Daniel T.",""],["Hansen","Ethan H.",""],["Li","Xinpeng",""],["Orenstein","Aaron",""],["Kulkarni","Vinooth",""],["Chaudhary","Vipin",""],["Guan","Qiang",""],["Liu","Ji",""],["Zhang","Yang",""],["Xu","Shuai",""]]}
{"id":"2308.10154","submitter":"Shuzhen Chen","authors":"Shuzhen Chen, Yuan Yuan, Youming Tao, Zhipeng Cai and Dongxiao Yu","title":"Resource-Adaptive Newton's Method for Distributed Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Distributed stochastic optimization methods based on Newton's method offer\nsignificant advantages over first-order methods by leveraging curvature\ninformation for improved performance. However, the practical applicability of\nNewton's method is hindered in large-scale and heterogeneous learning\nenvironments due to challenges such as high computation and communication costs\nassociated with the Hessian matrix, sub-model diversity, staleness in training,\nand data heterogeneity. To address these challenges, this paper introduces a\nnovel and efficient algorithm called RANL, which overcomes the limitations of\nNewton's method by employing a simple Hessian initialization and adaptive\nassignments of training regions. The algorithm demonstrates impressive\nconvergence properties, which are rigorously analyzed under standard\nassumptions in stochastic optimization. The theoretical analysis establishes\nthat RANL achieves a linear convergence rate while effectively adapting to\navailable resources and maintaining high efficiency. Unlike traditional\nfirst-order methods, RANL exhibits remarkable independence from the condition\nnumber of the problem and eliminates the need for complex parameter tuning.\nThese advantages make RANL a promising approach for distributed stochastic\noptimization in practical scenarios.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:01:30 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 14:48:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Shuzhen",""],["Yuan","Yuan",""],["Tao","Youming",""],["Cai","Zhipeng",""],["Yu","Dongxiao",""]]}
{"id":"2308.10155","submitter":"Guodong Wang","authors":"Guodong Wang, Yunhong Wang, Jie Qin, Dongming Zhang, Xiuguo Bao, Di\n  Huang","title":"Unilaterally Aggregated Contrastive Learning with Hierarchical\n  Augmentation for Anomaly Detection","comments":"Accepted by ICCV'2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Anomaly detection (AD), aiming to find samples that deviate from the training\ndistribution, is essential in safety-critical applications. Though recent\nself-supervised learning based attempts achieve promising results by creating\nvirtual outliers, their training objectives are less faithful to AD which\nrequires a concentrated inlier distribution as well as a dispersive outlier\ndistribution. In this paper, we propose Unilaterally Aggregated Contrastive\nLearning with Hierarchical Augmentation (UniCon-HA), taking into account both\nthe requirements above. Specifically, we explicitly encourage the concentration\nof inliers and the dispersion of virtual outliers via supervised and\nunsupervised contrastive losses, respectively. Considering that standard\ncontrastive data augmentation for generating positive views may induce\noutliers, we additionally introduce a soft mechanism to re-weight each\naugmented inlier according to its deviation from the inlier distribution, to\nensure a purified concentration. Moreover, to prompt a higher concentration,\ninspired by curriculum learning, we adopt an easy-to-hard hierarchical\naugmentation strategy and perform contrastive aggregation at different depths\nof the network based on the strengths of data augmentation. Our method is\nevaluated under three AD settings including unlabeled one-class, unlabeled\nmulti-class, and labeled multi-class, demonstrating its consistent superiority\nover other competitors.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:01:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Guodong",""],["Wang","Yunhong",""],["Qin","Jie",""],["Zhang","Dongming",""],["Bao","Xiuguo",""],["Huang","Di",""]]}
{"id":"2308.10156","submitter":"Chengyou Jia","authors":"Chengyou Jia, Minnan Luo, Zhuohang Dang, Guang Dai, Xiaojun Chang,\n  Mengmeng Wang, Jingdong Wang","title":"SSMG: Spatial-Semantic Map Guided Diffusion Model for Free-form\n  Layout-to-Image Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Despite significant progress in Text-to-Image (T2I) generative models, even\nlengthy and complex text descriptions still struggle to convey detailed\ncontrols. In contrast, Layout-to-Image (L2I) generation, aiming to generate\nrealistic and complex scene images from user-specified layouts, has risen to\nprominence. However, existing methods transform layout information into tokens\nor RGB images for conditional control in the generative process, leading to\ninsufficient spatial and semantic controllability of individual instances. To\naddress these limitations, we propose a novel Spatial-Semantic Map Guided\n(SSMG) diffusion model that adopts the feature map, derived from the layout, as\nguidance. Owing to rich spatial and semantic information encapsulated in\nwell-designed feature maps, SSMG achieves superior generation quality with\nsufficient spatial and semantic controllability compared to previous works.\nAdditionally, we propose the Relation-Sensitive Attention (RSA) and\nLocation-Sensitive Attention (LSA) mechanisms. The former aims to model the\nrelationships among multiple objects within scenes while the latter is designed\nto heighten the model's sensitivity to the spatial information embedded in the\nguidance. Extensive experiments demonstrate that SSMG achieves highly promising\nresults, setting a new state-of-the-art across a range of metrics encompassing\nfidelity, diversity, and controllability.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:09:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jia","Chengyou",""],["Luo","Minnan",""],["Dang","Zhuohang",""],["Dai","Guang",""],["Chang","Xiaojun",""],["Wang","Mengmeng",""],["Wang","Jingdong",""]]}
{"id":"2308.10157","submitter":"Zeyu Han","authors":"Zeyu Han, Yuhan Wang, Luping Zhou, Peng Wang, Binyu Yan, Jiliu Zhou,\n  Yan Wang, Dinggang Shen","title":"Contrastive Diffusion Model with Auxiliary Guidance for Coarse-to-Fine\n  PET Reconstruction","comments":"Accepted and presented in MICCAI 2023. To be published in Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  To obtain high-quality positron emission tomography (PET) scans while\nreducing radiation exposure to the human body, various approaches have been\nproposed to reconstruct standard-dose PET (SPET) images from low-dose PET\n(LPET) images. One widely adopted technique is the generative adversarial\nnetworks (GANs), yet recently, diffusion probabilistic models (DPMs) have\nemerged as a compelling alternative due to their improved sample quality and\nhigher log-likelihood scores compared to GANs. Despite this, DPMs suffer from\ntwo major drawbacks in real clinical settings, i.e., the computationally\nexpensive sampling process and the insufficient preservation of correspondence\nbetween the conditioning LPET image and the reconstructed PET (RPET) image. To\naddress the above limitations, this paper presents a coarse-to-fine PET\nreconstruction framework that consists of a coarse prediction module (CPM) and\nan iterative refinement module (IRM). The CPM generates a coarse PET image via\na deterministic process, and the IRM samples the residual iteratively. By\ndelegating most of the computational overhead to the CPM, the overall sampling\nspeed of our method can be significantly improved. Furthermore, two additional\nstrategies, i.e., an auxiliary guidance strategy and a contrastive diffusion\nstrategy, are proposed and integrated into the reconstruction process, which\ncan enhance the correspondence between the LPET image and the RPET image,\nfurther improving clinical reliability. Extensive experiments on two human\nbrain PET datasets demonstrate that our method outperforms the state-of-the-art\nPET reconstruction methods. The source code is available at\n\\url{https://github.com/Show-han/PET-Reconstruction}.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:10:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Han","Zeyu",""],["Wang","Yuhan",""],["Zhou","Luping",""],["Wang","Peng",""],["Yan","Binyu",""],["Zhou","Jiliu",""],["Wang","Yan",""],["Shen","Dinggang",""]]}
{"id":"2308.10158","submitter":"Shuman Fang","authors":"Shuman Fang, Zhiwen Lin, Ke Yan, Jie Li, Xianming Lin, Rongrong Ji","title":"HODN: Disentangling Human-Object Feature for HOI Detection","comments":"Accepted by TMM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The task of Human-Object Interaction (HOI) detection is to detect humans and\ntheir interactions with surrounding objects, where transformer-based methods\nshow dominant advances currently. However, these methods ignore the\nrelationship among humans, objects, and interactions: 1) human features are\nmore contributive than object ones to interaction prediction; 2) interactive\ninformation disturbs the detection of objects but helps human detection. In\nthis paper, we propose a Human and Object Disentangling Network (HODN) to model\nthe HOI relationships explicitly, where humans and objects are first detected\nby two disentangling decoders independently and then processed by an\ninteraction decoder. Considering that human features are more contributive to\ninteraction, we propose a Human-Guide Linking method to make sure the\ninteraction decoder focuses on the human-centric regions with human features as\nthe positional embeddings. To handle the opposite influences of interactions on\nhumans and objects, we propose a Stop-Gradient Mechanism to stop interaction\ngradients from optimizing the object detection but to allow them to optimize\nthe human detection. Our proposed method achieves competitive performance on\nboth the V-COCO and the HICO-Det datasets. It can be combined with existing\nmethods easily for state-of-the-art results.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:12:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fang","Shuman",""],["Lin","Zhiwen",""],["Yan","Ke",""],["Li","Jie",""],["Lin","Xianming",""],["Ji","Rongrong",""]]}
{"id":"2308.10159","submitter":"Andrey Baydin","authors":"T. Elijah Kritzell, Andrey Baydin, Fuyang Tay, Rodolfo Rodriguez,\n  Hiroyuki Nojiri, Henry O. Everitt, Igor Barsukov, and Junichiro Kono","title":"Terahertz cavity magnon polaritons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hybrid light-matter coupled states, or polaritons, in magnetic materials have\nattracted significant attention due to their potential for enabling novel\napplications in spintronics and quantum information processing. However, most\nstudies to date have been carried out for ferromagnetic materials with magnon\nexcitations at gigahertz frequencies. Here, we have investigated strong\nresonant photon-magnon coupling at frequencies above 1 terahertz for the first\ntime in a prototypical room-temperature antiferromagnetic insulator, NiO,\ninside a Fabry-P\\'erot cavity. The cavity was formed by the crystal itself when\nit was thinned down to an optimized thickness. By using terahertz time-domain\nspectroscopy in high magnetic fields up to 25 T, we swept the magnon frequency\nthrough Fabry-P\\'erot cavity modes and observed photon-magnon anticrossing\nbehavior, demonstrating clear vacuum Rabi splittings exceeding the polariton\nlinewidths. These results show that NiO is a promising platform for exploring\nantiferromagnetic spintronics and cavity magnonics in the terahertz frequency\nrange.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:31:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kritzell","T. Elijah",""],["Baydin","Andrey",""],["Tay","Fuyang",""],["Rodriguez","Rodolfo",""],["Nojiri","Hiroyuki",""],["Everitt","Henry O.",""],["Barsukov","Igor",""],["Kono","Junichiro",""]]}
{"id":"2308.10160","submitter":"Liren Shan","authors":"Konstantin Makarychev, Yury Makarychev, Liren Shan, Aravindan\n  Vijayaraghavan","title":"Higher-Order Cheeger Inequality for Partitioning with Buffers","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We prove a new generalization of the higher-order Cheeger inequality for\npartitioning with buffers. Consider a graph $G=(V,E)$. The buffered expansion\nof a set $S \\subseteq V$ with a buffer $B \\subseteq V \\setminus S$ is the edge\nexpansion of $S$ after removing all the edges from set $S$ to its buffer $B$.\nAn $\\varepsilon$-buffered $k$-partitioning is a partitioning of a graph into\ndisjoint components $P_i$ and buffers $B_i$, in which the size of buffer $B_i$\nfor $P_i$ is small relative to the size of $P_i$: $|B_i| \\le \\varepsilon\n|P_i|$. The buffered expansion of a buffered partition is the maximum of\nbuffered expansions of the $k$ sets $P_i$ with buffers $B_i$. Let\n$h^{k,\\varepsilon}_G$ be the buffered expansion of the optimal\n$\\varepsilon$-buffered $k$-partitioning, then for every $\\delta>0$,\n$$h_G^{k,\\varepsilon} \\le O_\\delta(1) \\cdot \\Big( \\frac{\\log k}{\n\\varepsilon}\\Big) \\cdot \\lambda_{\\lfloor (1+\\delta) k\\rfloor},$$ where\n$\\lambda_{\\lfloor (1+\\delta)k\\rfloor}$ is the $\\lfloor (1+\\delta)k\\rfloor$-th\nsmallest eigenvalue of the normalized Laplacian of $G$.\n  Our inequality is constructive and avoids the ``square-root loss'' that is\npresent in the standard Cheeger inequalities (even for $k=2$). We also provide\na complementary lower bound, and a novel generalization to the setting with\narbitrary vertex weights and edge costs. Moreover our result implies and\ngeneralizes the standard higher-order Cheeger inequalities and another recent\nCheeger-type inequality by Kwok, Lau, and Lee (2017) involving robust vertex\nexpansion.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:31:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Makarychev","Konstantin",""],["Makarychev","Yury",""],["Shan","Liren",""],["Vijayaraghavan","Aravindan",""]]}
{"id":"2308.10161","submitter":"Qiao Yan","authors":"Qiao Yan, Yihan Wang","title":"ThermRad: A Multi-modal Dataset for Robust 3D Object Detection under\n  Challenging Conditions","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robust 3D object detection in extreme weather and illumination conditions is\na challenging task. While radars and thermal cameras are known for their\nresilience to these conditions, few studies have been conducted on\nradar-thermal fusion due to the lack of corresponding datasets. To address this\ngap, we first present a new multi-modal dataset called ThermRad, which includes\na 3D LiDAR, a 4D radar, an RGB camera and a thermal camera. This dataset is\nunique because it includes data from all four sensors in extreme weather\nconditions, providing a valuable resource for future research in this area. To\nvalidate the robustness of 4D radars and thermal cameras for 3D object\ndetection in challenging weather conditions, we propose a new multi-modal\nfusion method called RTDF-RCNN, which leverages the complementary strengths of\n4D radars and thermal cameras to boost object detection performance. To further\nprove the effectiveness of our proposed framework, we re-implement\nstate-of-the-art (SOTA) 3D detectors on our dataset as benchmarks for\nevaluation. Our method achieves significant enhancements in detecting cars,\npedestrians, and cyclists, with improvements of over 7.98%, 24.27%, and 27.15%,\nrespectively, while achieving comparable results to LiDAR-based approaches. Our\ncontributions in both the ThermRad dataset and the new multi-modal fusion\nmethod provide a new approach to robust 3D object detection in adverse weather\nand illumination conditions. The ThermRad dataset will be released.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:34:30 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:38:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yan","Qiao",""],["Wang","Yihan",""]]}
{"id":"2308.10162","submitter":"Yunlu Yan","authors":"Yunlu Yan, Chun-Mei Feng, Mang Ye, Wangmeng Zuo, Ping Li, Rick Siow\n  Mong Goh, Lei Zhu, C. L. Philip Chen","title":"Rethinking Client Drift in Federated Learning: A Logit Perspective","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated Learning (FL) enables multiple clients to collaboratively learn in\na distributed way, allowing for privacy protection. However, the real-world\nnon-IID data will lead to client drift which degrades the performance of FL.\nInterestingly, we find that the difference in logits between the local and\nglobal models increases as the model is continuously updated, thus seriously\ndeteriorating FL performance. This is mainly due to catastrophic forgetting\ncaused by data heterogeneity between clients. To alleviate this problem, we\npropose a new algorithm, named FedCSD, a Class prototype Similarity\nDistillation in a federated framework to align the local and global models.\nFedCSD does not simply transfer global knowledge to local clients, as an\nundertrained global model cannot provide reliable knowledge, i.e., class\nsimilarity information, and its wrong soft labels will mislead the optimization\nof local models. Concretely, FedCSD introduces a class prototype similarity\ndistillation to align the local logits with the refined global logits that are\nweighted by the similarity between local logits and the global prototype. To\nenhance the quality of global logits, FedCSD adopts an adaptive mask to filter\nout the terrible soft labels of the global models, thereby preventing them to\nmislead local optimization. Extensive experiments demonstrate the superiority\nof our method over the state-of-the-art federated learning approaches in\nvarious heterogeneous settings. The source code will be released.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 04:41:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yan","Yunlu",""],["Feng","Chun-Mei",""],["Ye","Mang",""],["Zuo","Wangmeng",""],["Li","Ping",""],["Goh","Rick Siow Mong",""],["Zhu","Lei",""],["Chen","C. L. Philip",""]]}
{"id":"2308.10163","submitter":"Avadh Saxena","authors":"Avinash Khare and Avadh Saxena","title":"New Solutions of Coupled Nonlocal NLS and Coupled Nonlocal mKdV\n  Equations","comments":"39 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math-ph math.MP nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide several novel solutions of the coupled Ablowitz-Musslimani (AM)\nversion of the nonlocal nonlinear Schr\\\"odinger (NLS) equation and the coupled\nnonlocal modified Korteweg-de Vries (mKdV) equations. In each case we compare\nand contrast the corresponding solutions of the relevant coupled local\nequations. Further, we provide new solutions of the coupled local NLS and the\ncoupled local mKdV equations which are not the solutions of the corresponding\nnonlocal equations.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:12:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khare","Avinash",""],["Saxena","Avadh",""]]}
{"id":"2308.10164","submitter":"Enrico Tapavicza","authors":"Patrick Allen, Adam C. Smith, Vernon Benedicto, Abbas Abdulhassan,\n  Vasanthy Narayanaswami, Enrico Tapavicza","title":"Molecular Dynamics Simulation of Apolipoprotein E3 Lipid Nanodiscs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nanodiscs are binary discoidal complexes of a phospholipid bilayer\ncircumscribed by belt-like helical scaffold proteins. Using coarse-grained and\nall-atom molecular dynamics simulations, we explore the stability, size, and\nstructure of nanodiscs formed between the N-terminal domain of apolipoprotein\nE3 (apoE3-NT) and variable number of\n1,2-dimyristoyl-sn-glycero-3-phosphocholine (DMPC) molecules. We study both\nparallel and antiparallel double-belt configurations, consisting of four\nproteins per nanodisc. Our simulations predict nanodiscs containing between 240\nand 420 DMPC molecules to be stable. The antiparallel configurations exhibit an\naverage of 1.6 times more amino acid interactions between protein chains and 2\ntimes more ionic contacts, compared to the parallel configuration. With one\nexception, DMPC order parameters are consistently larger in the antiparallel\nconfiguration than in the parallel one. In most cases, the root mean square\ndeviation of the positions of the protein backbone atoms is smaller in the\nantiparallel configuration. We further report nanodisc size, thickness, radius\nof gyration, and solvent accessible surface area. Combining all investigated\nparameters, we hypothesize the antiparallel protein configuration leading to\nmore stable and more rigid nanodiscs than the parallel one.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:14:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Allen","Patrick",""],["Smith","Adam C.",""],["Benedicto","Vernon",""],["Abdulhassan","Abbas",""],["Narayanaswami","Vasanthy",""],["Tapavicza","Enrico",""]]}
{"id":"2308.10165","submitter":"Wei-Wei Pan","authors":"Wei-Wei Pan, Xiao Liu, Xiao-Ye Xu, Qin-Qin Wang, Ze-Di Cheng, Jian\n  Wang, Zhao-Di Liu, Geng Chen, Zong-Quan Zhou, Chuan-Feng Li, Guang-Can Guo,\n  Justin Dressel and Lev Vaidman","title":"Counterfactual communication without a trace in the transmission channel","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report an experimental realization of a modified counterfactual\ncommunication protocol that eliminates the dominant environmental trace left by\nphotons passing through the transmission channel. Compared to Wheeler's\ncriterion for inferring past particle paths, as used in prior protocols, our\ntrace criterion provide stronger support for the claim of the counterfactuality\nof the communication. We verify the lack of trace left by transmitted photons\nvia tagging the propagation arms of an interferometric device by distinct\nfrequency-shifts and finding that the collected photons have no frequency shift\nwhich corresponds to the transmission channel. As a proof of principle, we\ncounterfactually transfer a quick response code image with sufficient fidelity\nto be scanned with a cell phone.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:25:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pan","Wei-Wei",""],["Liu","Xiao",""],["Xu","Xiao-Ye",""],["Wang","Qin-Qin",""],["Cheng","Ze-Di",""],["Wang","Jian",""],["Liu","Zhao-Di",""],["Chen","Geng",""],["Zhou","Zong-Quan",""],["Li","Chuan-Feng",""],["Guo","Guang-Can",""],["Dressel","Justin",""],["Vaidman","Lev",""]]}
{"id":"2308.10166","submitter":"Shunxing Bao","authors":"Shunxing Bao, Sichen Zhu, Vasantha L Kolachala, Lucas W. Remedios,\n  Yeonjoo Hwang, Yutong Sun, Ruining Deng, Can Cui, Yike Li, Jia Li, Joseph T.\n  Roland, Qi Liu, Ken S. Lau, Subra Kugathasan, Peng Qiu, Keith T. Wilson, Lori\n  A. Coburn, Bennett A. Landman, Yuankai Huo","title":"Cell Spatial Analysis in Crohn's Disease: Unveiling Local Cell\n  Arrangement Pattern with Graph-based Signatures","comments":"Submitted to SPIE Medical Imaging. San Diego, CA. February 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Crohn's disease (CD) is a chronic and relapsing inflammatory condition that\naffects segments of the gastrointestinal tract. CD activity is determined by\nhistological findings, particularly the density of neutrophils observed on\nHematoxylin and Eosin stains (H&E) imaging. However, understanding the broader\nmorphometry and local cell arrangement beyond cell counting and tissue\nmorphology remains challenging. To address this, we characterize six distinct\ncell types from H&E images and develop a novel approach for the local spatial\nsignature of each cell. Specifically, we create a 10-cell neighborhood matrix,\nrepresenting neighboring cell arrangements for each individual cell. Utilizing\nt-SNE for non-linear spatial projection in scatter-plot and Kernel Density\nEstimation contour-plot formats, our study examines patterns of differences in\nthe cellular environment associated with the odds ratio of spatial patterns\nbetween active CD and control groups. This analysis is based on data collected\nat the two research institutes. The findings reveal heterogeneous\nnearest-neighbor patterns, signifying distinct tendencies of cell clustering,\nwith a particular focus on the rectum region. These variations underscore the\nimpact of data heterogeneity on cell spatial arrangements in CD patients.\nMoreover, the spatial distribution disparities between the two research sites\nhighlight the significance of collaborative efforts among healthcare\norganizations. All research analysis pipeline tools are available at\nhttps://github.com/MASILab/cellNN.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:26:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bao","Shunxing",""],["Zhu","Sichen",""],["Kolachala","Vasantha L",""],["Remedios","Lucas W.",""],["Hwang","Yeonjoo",""],["Sun","Yutong",""],["Deng","Ruining",""],["Cui","Can",""],["Li","Yike",""],["Li","Jia",""],["Roland","Joseph T.",""],["Liu","Qi",""],["Lau","Ken S.",""],["Kugathasan","Subra",""],["Qiu","Peng",""],["Wilson","Keith T.",""],["Coburn","Lori A.",""],["Landman","Bennett A.",""],["Huo","Yuankai",""]]}
{"id":"2308.10167","submitter":"Terufumi Yokota","authors":"Terufumi Yokota","title":"Ordered States in Heisenberg Pyrochlore Antiferromagnets with\n  Dipole-Dipole Interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classical Heisenberg model with both a nearest-neighbor antiferromagnetic\ninteraction and long-range dipole-dipole interactions is investigated by\nnumerically solving the Landau-Lifshitz (LL) equation. The ground state of the\nmodel without the dipole-dipole interactions is known to be a classical spin\nliquid and the system does not order at all temperature because of strong\nfrustration. On the other hand, the ordered state of the model with weak\ndipolar interactions is known to be the so-called Palmer-Chalker (PC) state, in\nwhich a pair of spins and another pair of spins are antiparallel and the former\nis perpendicular to the latter for each tetrahedron of the lattice. Here\nordered states of the model are obtained for various values of the relative\nstrength of the two kinds of the interactions. Besides the spin liquid state\nand the PC-like state, states that might be considered as glassy state, states\nof period 8, states of period 4, and states of period of 4 on one sublattice\nand 8 on other three sublattices are realized. Among the states with period 4\nor (and) 8, multi-{\\bf K} structures are observed.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:26:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yokota","Terufumi",""]]}
{"id":"2308.10168","submitter":"Kai Sun","authors":"Kai Sun, Yifan Ethan Xu, Hanwen Zha, Yue Liu, Xin Luna Dong","title":"Head-to-Tail: How Knowledgeable are Large Language Models (LLM)? A.K.A.\n  Will LLMs Replace Knowledge Graphs?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the recent prosperity of Large Language Models (LLMs), there have been\ninterleaved discussions regarding how to reduce hallucinations from LLM\nresponses, how to increase the factuality of LLMs, and whether Knowledge Graphs\n(KGs), which store the world knowledge in a symbolic form, will be replaced\nwith LLMs. In this paper, we try to answer these questions from a new angle:\nHow knowledgeable are LLMs?\n  To answer this question, we constructed Head-to-Tail, a benchmark that\nconsists of 18K question-answer (QA) pairs regarding head, torso, and tail\nfacts in terms of popularity. We designed an automated evaluation method and a\nset of metrics that closely approximate the knowledge an LLM confidently\ninternalizes. Through a comprehensive evaluation of 14 publicly available LLMs,\nwe show that existing LLMs are still far from being perfect in terms of their\ngrasp of factual knowledge, especially for facts of torso-to-tail entities.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:31:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Kai",""],["Xu","Yifan Ethan",""],["Zha","Hanwen",""],["Liu","Yue",""],["Dong","Xin Luna",""]]}
{"id":"2308.10169","submitter":"Jinghao Xin","authors":"Jinghao Xin, Zhi Li, Yang Zhang, and Ning Li","title":"Efficient Real-time Path Planning with Self-evolving Particle Swarm\n  Optimization in Dynamic Scenarios","comments":"10 pages, 7 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Particle Swarm Optimization (PSO) has demonstrated efficacy in addressing\nstatic path planning problems. Nevertheless, such application on dynamic\nscenarios has been severely precluded by PSO's low computational efficiency and\npremature convergence downsides. To address these limitations, we proposed a\nTensor Operation Form (TOF) that converts particle-wise manipulations to tensor\noperations, thereby enhancing computational efficiency. Harnessing the\ncomputational advantage of TOF, a variant of PSO, designated as Self-Evolving\nParticle Swarm Optimization (SEPSO) was developed. The SEPSO is underpinned by\na novel Hierarchical Self-Evolving Framework (HSEF) that enables autonomous\noptimization of its own hyper-parameters to evade premature convergence.\nAdditionally, a Priori Initialization (PI) mechanism and an Auto Truncation\n(AT) mechanism that substantially elevates the real-time performance of SEPSO\non dynamic path planning problems were introduced. Comprehensive experiments on\nfour widely used benchmark optimization functions have been initially conducted\nto corroborate the validity of SEPSO. Following this, a dynamic simulation\nenvironment that encompasses moving start/target points and dynamic/static\nobstacles was employed to assess the effectiveness of SEPSO on the dynamic path\nplanning problem. Simulation results exhibit that the proposed SEPSO is capable\nof generating superior paths with considerably better real-time performance (67\npath planning computations per second in a regular desktop computer) in\ncontrast to alternative methods. The code of this paper can be accessed here.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:31:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xin","Jinghao",""],["Li","Zhi",""],["Zhang","Yang",""],["Li","Ning",""]]}
{"id":"2308.10170","submitter":"Anwesan Pal","authors":"Anwesan Pal, Sahil Wadhwa, Ayush Jaiswal, Xu Zhang, Yue Wu, Rakesh\n  Chada, Pradeep Natarajan, and Henrik I. Christensen","title":"FashionNTM: Multi-turn Fashion Image Retrieval via Cascaded Memory","comments":"Paper accepted at ICCV-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-turn textual feedback-based fashion image retrieval focuses on a\nreal-world setting, where users can iteratively provide information to refine\nretrieval results until they find an item that fits all their requirements. In\nthis work, we present a novel memory-based method, called FashionNTM, for such\na multi-turn system. Our framework incorporates a new Cascaded Memory Neural\nTuring Machine (CM-NTM) approach for implicit state management, thereby\nlearning to integrate information across all past turns to retrieve new images,\nfor a given turn. Unlike vanilla Neural Turing Machine (NTM), our CM-NTM\noperates on multiple inputs, which interact with their respective memories via\nindividual read and write heads, to learn complex relationships. Extensive\nevaluation results show that our proposed method outperforms the previous\nstate-of-the-art algorithm by 50.5%, on Multi-turn FashionIQ -- the only\nexisting multi-turn fashion dataset currently, in addition to having a relative\nimprovement of 12.6% on Multi-turn Shoes -- an extension of the single-turn\nShoes dataset that we created in this work. Further analysis of the model in a\nreal-world interactive setting demonstrates two important capabilities of our\nmodel -- memory retention across turns, and agnosticity to turn order for\nnon-contradictory feedback. Finally, user study results show that images\nretrieved by FashionNTM were favored by 83.1% over other multi-turn models.\nProject page: https://sites.google.com/eng.ucsd.edu/fashionntm\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:44:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pal","Anwesan",""],["Wadhwa","Sahil",""],["Jaiswal","Ayush",""],["Zhang","Xu",""],["Wu","Yue",""],["Chada","Rakesh",""],["Natarajan","Pradeep",""],["Christensen","Henrik I.",""]]}
{"id":"2308.10171","submitter":"Hao Zhou","authors":"Hao Zhou, Zhi-Ping Jin, Stefano Covino, Yi-Zhong Fan and Da-Ming Wei","title":"A Method to Measure Photometries of Moderately-Saturated UVOT Sources","comments":"27 pages, 19 figures, 3 tables, accepted to ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  For bright transients such as Gamma-Ray Bursts (GRBs), the\nUltra-Violet/Optical Telescope (UVOT) operates under event mode at early\nphases, which records incident positions and arrival time for each photon. The\nevent file is able to be screened into many exposures to study the early light\ncurve of GRBs with a high time resolution, including in particular the rapid\nbrightening of the UV/Optical emission. Such a goal, however, is hampered for\nsome extremely bright GRBs by the saturation in UVOT event images. For\nmoderately saturated UVOT sources, in this work we develop the method proposed\nin Jin et al. (2023) to recover their photometries. The basic idea is to assume\na stable point spread function (PSF) of UVOT images, for which the counts in\nthe core region (i.e., an aperture of a radius of 5 arcsec) and the wing region\n(i.e., an annulus ranging from 15 arcsec to 25 arcsec) should be a constant and\nthe intrinsic flux can be reliably inferred with data in the ring. We\ndemonstrate that in a given band, a tight correlation does hold among the\nbackground-removed count rates in the core and the wing. With the new method,\nthe bright limit of measuring range for UVOT V and B bands increases ~ 1.7 mag,\nwhile only ~ 0.7 mag for U band due to the lack of bright calibration sources.\nSystematic uncertainties are ~ 0.2 mag for V, B and U bands.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:48:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Hao",""],["Jin","Zhi-Ping",""],["Covino","Stefano",""],["Fan","Yi-Zhong",""],["Wei","Da-Ming",""]]}
{"id":"2308.10172","submitter":"Yanyuan Qiao","authors":"Yanyuan Qiao, Zheng Yu, Qi Wu","title":"VLN-PETL: Parameter-Efficient Transfer Learning for Vision-and-Language\n  Navigation","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 performance of the Vision-and-Language Navigation~(VLN) tasks has\nwitnessed rapid progress recently thanks to the use of large pre-trained\nvision-and-language models. However, full fine-tuning the pre-trained model for\nevery downstream VLN task is becoming costly due to the considerable model\nsize. Recent research hotspot of Parameter-Efficient Transfer Learning (PETL)\nshows great potential in efficiently tuning large pre-trained models for the\ncommon CV and NLP tasks, which exploits the most of the representation\nknowledge implied in the pre-trained model while only tunes a minimal set of\nparameters. However, simply utilizing existing PETL methods for the more\nchallenging VLN tasks may bring non-trivial degeneration to the performance.\nTherefore, we present the first study to explore PETL methods for VLN tasks and\npropose a VLN-specific PETL method named VLN-PETL. Specifically, we design two\nPETL modules: Historical Interaction Booster (HIB) and Cross-modal Interaction\nBooster (CIB). Then we combine these two modules with several existing PETL\nmethods as the integrated VLN-PETL. Extensive experimental results on four\nmainstream VLN tasks (R2R, REVERIE, NDH, RxR) demonstrate the effectiveness of\nour proposed VLN-PETL, where VLN-PETL achieves comparable or even better\nperformance to full fine-tuning and outperforms other PETL methods with\npromising margins.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:55:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qiao","Yanyuan",""],["Yu","Zheng",""],["Wu","Qi",""]]}
{"id":"2308.10173","submitter":"Zhixiao Qi","authors":"Zhixiao Qi, Yijiong Yu, Meiqi Tu, Junyi Tan, Yongfeng Huang","title":"FoodGPT: A Large Language Model in Food Testing Domain with Incremental\n  Pre-training and Knowledge Graph Prompt","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Currently, the construction of large language models in specific domains is\ndone by fine-tuning on a base model. Some models also incorporate knowledge\nbases without the need for pre-training. This is because the base model already\ncontains domain-specific knowledge during the pre-training process. We build a\nlarge language model for food testing. Unlike the above approach, a significant\namount of data in this domain exists in Scanning format for domain standard\ndocuments. In addition, there is a large amount of untrained structured\nknowledge. Therefore, we introduce an incremental pre-training step to inject\nthis knowledge into a large language model. In this paper, we propose a method\nfor handling structured knowledge and scanned documents in incremental\npre-training. To overcome the problem of machine hallucination, we constructe a\nknowledge graph to serve as an external knowledge base for supporting retrieval\nin the large language model. It is worth mentioning that this paper is a\ntechnical report of our pre-release version, and we will report our specific\nexperimental data in future versions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:58:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qi","Zhixiao",""],["Yu","Yijiong",""],["Tu","Meiqi",""],["Tan","Junyi",""],["Huang","Yongfeng",""]]}
{"id":"2308.10174","submitter":"Jie Yang","authors":"Jie Yang, Ailing Zeng, Feng Li, Shilong Liu, Ruimao Zhang, Lei Zhang","title":"Neural Interactive Keypoint Detection","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":"  This work proposes an end-to-end neural interactive keypoint detection\nframework named Click-Pose, which can significantly reduce more than 10 times\nlabeling costs of 2D keypoint annotation compared with manual-only annotation.\nClick-Pose explores how user feedback can cooperate with a neural keypoint\ndetector to correct the predicted keypoints in an interactive way for a faster\nand more effective annotation process. Specifically, we design the pose error\nmodeling strategy that inputs the ground truth pose combined with four typical\npose errors into the decoder and trains the model to reconstruct the correct\nposes, which enhances the self-correction ability of the model. Then, we attach\nan interactive human-feedback loop that allows receiving users' clicks to\ncorrect one or several predicted keypoints and iteratively utilizes the decoder\nto update all other keypoints with a minimum number of clicks (NoC) for\nefficient annotation. We validate Click-Pose in in-domain, out-of-domain\nscenes, and a new task of keypoint adaptation. For annotation, Click-Pose only\nneeds 1.97 and 6.45 NoC@95 (at precision 95%) on COCO and Human-Art, reducing\n31.4% and 36.3% efforts than the SOTA model (ViTPose) with manual correction,\nrespectively. Besides, without user clicks, Click-Pose surpasses the previous\nend-to-end model by 1.4 AP on COCO and 3.0 AP on Human-Art. The code is\navailable at https://github.com/IDEA-Research/Click-Pose.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 06:36:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Jie",""],["Zeng","Ailing",""],["Li","Feng",""],["Liu","Shilong",""],["Zhang","Ruimao",""],["Zhang","Lei",""]]}
{"id":"2308.10175","submitter":"Chen Liu","authors":"Chen Liu, Peike Li, Hu Zhang, Lincheng Li, Zi Huang, Dadong Wang, and\n  Xin Yu","title":"BAVS: Bootstrapping Audio-Visual Segmentation by Integrating Foundation\n  Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Given an audio-visual pair, audio-visual segmentation (AVS) aims to locate\nsounding sources by predicting pixel-wise maps. Previous methods assume that\neach sound component in an audio signal always has a visual counterpart in the\nimage. However, this assumption overlooks that off-screen sounds and background\nnoise often contaminate the audio recordings in real-world scenarios. They\nimpose significant challenges on building a consistent semantic mapping between\naudio and visual signals for AVS models and thus impede precise sound\nlocalization. In this work, we propose a two-stage bootstrapping audio-visual\nsegmentation framework by incorporating multi-modal foundation knowledge. In a\nnutshell, our BAVS is designed to eliminate the interference of background\nnoise or off-screen sounds in segmentation by establishing the audio-visual\ncorrespondences in an explicit manner. In the first stage, we employ a\nsegmentation model to localize potential sounding objects from visual data\nwithout being affected by contaminated audio signals. Meanwhile, we also\nutilize a foundation audio classification model to discern audio semantics.\nConsidering the audio tags provided by the audio foundation model are noisy,\nassociating object masks with audio tags is not trivial. Thus, in the second\nstage, we develop an audio-visual semantic integration strategy (AVIS) to\nlocalize the authentic-sounding objects. Here, we construct an audio-visual\ntree based on the hierarchical correspondence between sounds and object\ncategories. We then examine the label concurrency between the localized objects\nand classified audio tags by tracing the audio-visual tree. With AVIS, we can\neffectively segment real-sounding objects. Extensive experiments demonstrate\nthe superiority of our method on AVS datasets, particularly in scenarios\ninvolving background noise. Our project website is\nhttps://yenanliu.github.io/AVSS.github.io/.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 06:48:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Chen",""],["Li","Peike",""],["Zhang","Hu",""],["Li","Lincheng",""],["Huang","Zi",""],["Wang","Dadong",""],["Yu","Xin",""]]}
{"id":"2308.10176","submitter":"Omar Mustafa","authors":"Omar Mustafa","title":"Schr\\\"{o}dinger oscillators in a deformed point-like global monopole\n  spacetime and a Wu-Yang magnetic monopole: position-dependent mass\n  correspondence and isospectrality","comments":"15 pages, 6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that a specific transformation/deformation in a point-like global\nmonopole (PGM) spacetime background would yield an effective position-dependent\nmass (PDM) Schr\\\"{o}dinger equation (i.e., a von Roos PDM Schr\\\"{o}dinger\nequation). We discuss PDM Schr\\\"{o}dinger oscillators in a PGM spacetime in the\npresence of a Wu-Yang magnetic monopole. Within our transformed/deformed global\nmonopole spacetime, we show that all PDM Schr\\\"{o}dinger oscillators admit\nisospectrality and invariance with the constant mass Schr\\\"{o}dinger\noscillators in the regular global monopole spacetime in the presence of a\nWu-Yang magnetic monopole. The exclusive dependence of the thermodynamical\npartition function on the energy eigenvalues manifestly suggests that the\nSchr\\\"{o}dinger oscillators and the PDM Schr\\\"{o}dinger oscillators share the\nsame thermodynamical properties as mandated by their isospectrality. Moreover,\nwe discuss the hard-wall effect on the energy levels of the PDM Schr\\\"{o}dinger\noscillators in a PGM spacetime without and with a Wu-Yang magnetic monopole.\nDrastic energy levels' shift-ups are observed as a consequence of such\nhard-wall effect.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 06:51:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mustafa","Omar",""]]}
{"id":"2308.10177","submitter":"Charlotte Aten","authors":"Charlotte Aten","title":"A partition formula from idempotents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A formula which only involves a partition number and elementary functions is\nderived by applying Burnside's Lemma to the set of idempotent maps from a set\nto itself. One side involves a summation over a set closely related to the\npartition number, however. Some speculation is made as to how to eliminate this\nsummation.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 06:51:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aten","Charlotte",""]]}
{"id":"2308.10178","submitter":"Meghana Thiyyakat","authors":"Meghana Thiyyakat, Subramaniam Kalambur, Rishit Chaudhary, Saurav G\n  Nayak, Adarsh Shetty, Dinkar Sitaram","title":"Eventually-Consistent Federated Scheduling for Data Center Workloads","comments":"26 pages. Submitted to Elsevier's Ad Hoc Networks Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data center schedulers operate at unprecedented scales today to accommodate\nthe growing demand for computing and storage power. The challenge that\nschedulers face is meeting the requirements of scheduling speeds despite the\nscale. To do so, most scheduler architectures use parallelism. However, these\narchitectures consist of multiple parallel scheduling entities that can only\nutilize partial knowledge of the data center's state, as maintaining consistent\nglobal knowledge or state would involve considerable communication overhead.\nThe disadvantage of scheduling without global knowledge is sub-optimal\nplacements-tasks may be made to wait in queues even though there are resources\navailable in zones outside the scope of the scheduling entity's state. This\nleads to unnecessary queuing overheads and lower resource utilization of the\ndata center. In this paper, extend our previous work on Megha, a federated\ndecentralized data center scheduling architecture that uses eventual\nconsistency. The architecture utilizes both parallelism and an\neventually-consistent global state in each of its scheduling entities to make\nfast decisions in a scalable manner. In our work, we compare Megha with 3\nscheduling architectures: Sparrow, Eagle, and Pigeon, using simulation. We also\nevaluate Megha's prototype on a 123-node cluster and compare its performance\nwith Pigeon's prototype using cluster traces. The results of our experiments\nshow that Megha consistently reduces delays in job completion time when\ncompared to other architectures.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 06:56:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Thiyyakat","Meghana",""],["Kalambur","Subramaniam",""],["Chaudhary","Rishit",""],["Nayak","Saurav G",""],["Shetty","Adarsh",""],["Sitaram","Dinkar",""]]}
{"id":"2308.10179","submitter":"Qiming Wu","authors":"Qiming Wu, Yue Shi and Jiehang Zhang","title":"Qubits on programmable geometries with a trapped-ion quantum processor","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Geometry and dimensionality have played crucial roles in our understanding of\nthe fundamental laws of nature, with examples ranging from curved space-time in\ngeneral relativity to modern theories of quantum gravity. In quantum many-body\nsystems, the entanglement structure can change if the constituents are\nconnected differently, leading to altered bounds for correlation growth and\ndifficulties for classical computers to simulate large systems. While a\nuniversal quantum computer can perform digital simulations, an analog-digital\nhybrid quantum processor offers advantages such as parallelism. Here, we\nengineer a class of high-dimensional Ising interactions using a linear\none-dimensional (1D) ion chain with up to 8 qubits through stroboscopic\nsequences of commuting Hamiltonians. %with a thorough understanding of the\nerror sources and deviation from the target Hamiltonian. In addition, we extend\nthis method to non-commuting circuits and demonstrate the quantum XY and\nHeisenberg models using Floquet periodic drives with tunable symmetries. The\nrealization of higher dimensional spin models offers new opportunities ranging\nfrom studying topological phases of matter or quantum spin glasses to future\nfault-tolerant quantum computation.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:01:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Qiming",""],["Shi","Yue",""],["Zhang","Jiehang",""]]}
{"id":"2308.10180","submitter":"Khaled Alanezi","authors":"Khaled Alanezi and Shivakant Mishra","title":"An IoT Architecture Leveraging Digital Twins: Compromised Node Detection\n  Scenario","comments":"This work has been submitted to the IEEE for possible publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern IoT (Internet of Things) environments with thousands of low-end and\ndiverse IoT nodes with complex interactions among them and often deployed in\nremote and/or wild locations present some unique challenges that make\ntraditional node compromise detection services less effective. This paper\npresents the design, implementation and evaluation of a fog-based architecture\nthat utilizes the concept of a digital-twin to detect compromised IoT nodes\nexhibiting malicious behaviors by either producing erroneous data and/or being\nused to launch network intrusion attacks to hijack other nodes eventually\ncausing service disruption. By defining a digital twin of an IoT infrastructure\nat a fog server, the architecture is focused on monitoring relevant information\nto save energy and storage space. The paper presents a prototype implementation\nfor the architecture utilizing malicious behavior datasets to perform\nmisbehaving node classification. An extensive accuracy and system performance\nevaluation was conducted based on this prototype. Results show good accuracy\nand negligible overhead especially when employing deep learning techniques such\nas MLP (multilayer perceptron).\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:03:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alanezi","Khaled",""],["Mishra","Shivakant",""]]}
{"id":"2308.10181","submitter":"Han Wang","authors":"Han Wang, Xiaoyuan Xu, Yue Chen, Zheng Yan, Mohammad Shahidehpour,\n  Jiaqi Li, Shaolun Xu","title":"Stochastic Optimization of Coupled Power Distribution-Urban\n  Transportation Network Operations with Autonomous Mobility on Demand Systems","comments":"10 pages, 13 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":"  Autonomous mobility on demand systems (AMoDS) will significantly affect the\noperation of coupled power distribution-urban transportation networks (PTNs) by\nthe optimal dispatch of electric vehicles (EVs). This paper proposes an\nuncertainty method to analyze the operational states of PTNs with AMoDS. First,\na PTN operation framework is designed considering the controllable EVs\ndispatched by AMoDS as well as the uncontrollable driving behaviors of other\nvehicle users. Then, a bi-level power-traffic flow (PTF) model is proposed to\ncharacterize the interaction of power distribution networks (PDNs) and urban\ntransportation networks (UTNs). In the upper level, a social optimum model is\nestablished to minimize the operating cost of PDNs and UTNs embedded with\ncontrollable EVs. In the lower level, a stochastic user equilibrium (SUE) model\nis established to minimize the operating cost of uncontrollable EVs and\ngasoline vehicles (GVs) in UTNs. Finally, a probabilistic PTF analysis method\nis developed to evaluate PTN operations under environmental and human\nuncertainties. A regional sensitivity analysis method is proposed to identify\nthe critical uncertainties and quantify the impacts of their distribution\nranges on PTN operations. The effectiveness of the proposed method is verified\nby the PTN consisting of a 21-bus PDN and a 20-node UTN.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:05:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Han",""],["Xu","Xiaoyuan",""],["Chen","Yue",""],["Yan","Zheng",""],["Shahidehpour","Mohammad",""],["Li","Jiaqi",""],["Xu","Shaolun",""]]}
{"id":"2308.10182","submitter":"Eric Ling","authors":"Eric Ling","title":"A lower semicontinuous time separation function for $C^0$ spacetimes","comments":"18 pages","journal-ref":null,"doi":null,"report-no":"CPH-GEOTOP-DNRF151; CF21-0680","categories":"gr-qc math-ph math.DG math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The time separation function (or Lorentzian distance function) is a\nfundamental object used in Lorentzian geometry. For smooth spacetimes it is\nknown to be lower semicontinuous, and in fact, continuous for globally\nhyperbolic spacetimes. Moreover, an axiom for Lorentzian length spaces - a\nsynthetic approach to Lorentzian geometry - is the existence of a lower\nsemicontinuous time separation function. Nevertheless, the usual time\nseparation function is $\\textit{not}$ necessarily lower semicontinuous for\n$C^0$ spacetimes due to bubbling phenomena. In this paper, we introduce a class\nof curves called \"nearly timelike\" and show that the time separation function\nfor $C^0$ spacetimes is lower semicontinuous when defined with respect to\nnearly timelike curves. Moreover, this time separation function agrees with the\nusual one when the metric is smooth. Lastly, sufficient conditions are found\nguaranteeing the existence of a nearly timelike maximizer between two points in\na $C^0$ spacetime.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:07:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ling","Eric",""]]}
{"id":"2308.10183","submitter":"Keye Zhang","authors":"Jia-Xin Peng, Baiqiang Zhu, Weiping Zhang, and Keye Zhang","title":"Dissipative quantum Fisher information for a general Liouvillian\n  parameterized process","comments":"22 pages, 4 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dissipative quantum Fisher information (DQFI) for a dynamic map with a\ngeneral parameter in an open quantum system is investigated, which can be\nregarded as an analog of the quantum Fisher information (QFI) in the Liouville\nspace. We first derive a general dissipative generator in the Liouville space,\nand based on its decomposition form, find the DQFI stems from two parts. One is\nthe dependence of eigenvalues of the Liouvillian supermatrix on the estimated\nparameter, which shows a linear dependence on time. The other is the variation\nof the eigenvectors with the estimated parameter. The relationship between this\npart and time presents rich characteristics, including harmonic oscillation,\npure exponential gain and attenuation, as well as exponential gain and\nattenuation of oscillatory type, which depend specifically on the properties of\nthe Liouville spectrum. This is in contrast to that of the conventional\ngenerator, where only oscillatory dependencies are seen. Further, we illustrate\nthe theory through a toy model: a two-level system with spin-flip noise.\nEspecially, by using the DQFI, we demonstrated that the exceptional estimation\nprecision cannot be obtained at the Liouvillian exceptional point.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:12:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Peng","Jia-Xin",""],["Zhu","Baiqiang",""],["Zhang","Weiping",""],["Zhang","Keye",""]]}
{"id":"2308.10184","submitter":"Xiangdong Zhang","authors":"Xiangdong Zhang","title":"Loop quantum black hole","comments":"A mini review, 15 pages","journal-ref":"Universe 2023, 9(7), 313","doi":"10.3390/universe9070313","report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the last decades, progress on the quantization of black holes using\ntechniques developed in loop quantum cosmology has received increasing\nattention. Due to the quantum geometry effect, the resulting quantum corrected\nblack hole is free of singularity. The quantization scheme can be roughly\ndivided into four types, that is 1. $\\mu_0$-scheme, 2. $\\bar{\\mu}$-scheme, 3.\ngeneralized $\\mu_0$-scheme, 4. quantum collapsing model. This paper provides an\nintroduction of the loop quantum black hole models and a summary of the\nprogress made in this field, as well as the quantum effective dynamics and\nphysical applications of these models.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:24:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Xiangdong",""]]}
{"id":"2308.10185","submitter":"Weixian Lei","authors":"Weixian Lei, Yixiao Ge, Jianfeng Zhang, Dylan Sun, Kun Yi, Ying Shan,\n  Mike Zheng Shou","title":"ViT-Lens: Towards Omni-modal Representations","comments":"19 pages, 4 figures and 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Though the success of CLIP-based training recipes in vision-language models,\ntheir scalability to more modalities (e.g., 3D, audio, etc.) is limited to\nlarge-scale data, which is expensive or even inapplicable for rare modalities.\nIn this paper, we present ViT-Lens that facilitates efficient omni-modal\nrepresentation learning by perceiving novel modalities with a pretrained ViT\nand aligning to a pre-defined space. Specifically, the modality-specific lens\nis tuned to project multimodal signals to the shared embedding space, which are\nthen processed by a strong ViT that carries pre-trained image knowledge. The\nencoded multimodal representations are optimized toward aligning with the\nmodal-independent space, pre-defined by off-the-shelf foundation models. A\nwell-trained lens with a ViT backbone has the potential to serve as one of\nthese foundation models, supervising the learning of subsequent modalities.\nViT-Lens provides a unified solution for representation learning of increasing\nmodalities with two appealing benefits: (i) Exploiting the pretrained ViT\nacross tasks and domains effectively with efficient data regime; (ii) Emergent\ndownstream capabilities of novel modalities are demonstrated due to the\nmodality alignment space. We evaluate ViT-Lens in the context of 3D as an\ninitial verification. In zero-shot 3D classification, ViT-Lens achieves\nsubstantial improvements over previous state-of-the-art, showing 52.0% accuracy\non Objaverse-LVIS, 87.4% on ModelNet40, and 60.6% on ScanObjectNN. Furthermore,\nwe enable zero-shot 3D question-answering by simply integrating the trained 3D\nlens into the InstructBLIP model without any adaptation. We will release the\nresults of ViT-Lens on more modalities in the near future.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:26:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lei","Weixian",""],["Ge","Yixiao",""],["Zhang","Jianfeng",""],["Sun","Dylan",""],["Yi","Kun",""],["Shan","Ying",""],["Shou","Mike Zheng",""]]}
{"id":"2308.10186","submitter":"Yong Niu","authors":"Xiangfei Zhang, Yong Niu, Tao Yang, Xian Xiao, Jianwen Ding, Sheng\n  Chen, Bo Ai, Zhangdui Zhong, Ning Wang","title":"QoS-aware User Association and Transmission Scheduling for\n  Millimeter-Wave Train-ground Communications","comments":"14 pages","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":"  With the development of wireless communication, people have put forward\nhigher requirements for train-ground communications in the high-speed railway\n(HSR) scenarios. With the help of mobile relays (MRs) installed on the roof of\nthe train, the application of Millimeter-Wave (mm-wave) communication which has\nrich spectrum resources to the train-ground communication system can realize\nhigh data rate, so as to meet users' increasing demand for broad-band\nmultimedia access. Also, full-duplex (FD) technology can theoretically double\nthe spectral efficiency. In this paper, we formulate the user association and\ntransmission scheduling problem in the mm-wave train-ground communication\nsystem with MR operating in the FD mode as a nonlinear programming problem. In\norder to maximize the system throughput and the number of users meeting quality\nof service (QoS) requirements, we propose an algorithm based on coalition game\nto solve the challenging NP-hard problem, and also prove the convergence and\nNash-stable structure of the proposed algorithm. Extensive simulation results\ndemonstrate that the proposed coalition game based algorithm can effectively\nimprove the system throughput and meet the QoS requirements of as many users as\npossible, so that the communication system has a certain QoS awareness.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:27:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Xiangfei",""],["Niu","Yong",""],["Yang","Tao",""],["Xiao","Xian",""],["Ding","Jianwen",""],["Chen","Sheng",""],["Ai","Bo",""],["Zhong","Zhangdui",""],["Wang","Ning",""]]}
{"id":"2308.10187","submitter":"Mingxuan Liu","authors":"Mingxuan Liu, Rui Wen, and Hong Chen","title":"Spiking-Diffusion: Vector Quantized Discrete Diffusion Model with\n  Spiking Neural Networks","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spiking neural networks (SNNs) have tremendous potential for energy-efficient\nneuromorphic chips due to their binary and event-driven architecture. SNNs have\nbeen primarily used in classification tasks, but limited exploration on image\ngeneration tasks. To fill the gap, we propose a Spiking-Diffusion model, which\nis based on the vector quantized discrete diffusion model. First, we develop a\nvector quantized variational autoencoder with SNNs (VQ-SVAE) to learn a\ndiscrete latent space for images. In VQ-SVAE, image features are encoded using\nboth the spike firing rate and postsynaptic potential, and an adaptive spike\ngenerator is designed to restore embedding features in the form of spike\ntrains. Next, we perform absorbing state diffusion in the discrete latent space\nand construct a spiking diffusion image decoder (SDID) with SNNs to denoise the\nimage. Our work is the first to build the diffusion model entirely from SNN\nlayers. Experimental results on MNIST, FMNIST, KMNIST, Letters, and Cifar10\ndemonstrate that Spiking-Diffusion outperforms the existing SNN-based\ngeneration model. We achieve FIDs of 37.50, 91.98, 59.23, 67.41, and 120.5 on\nthe above datasets respectively, with reductions of 58.60\\%, 18.75\\%, 64.51\\%,\n29.75\\%, and 44.88\\% in FIDs compared with the state-of-art work. Our code will\nbe available at \\url{https://github.com/Arktis2022/Spiking-Diffusion}.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:29:03 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 17:31:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Mingxuan",""],["Wen","Rui",""],["Chen","Hong",""]]}
{"id":"2308.10188","submitter":"Tien Mai","authors":"The Viet Bui and Tien Mai and Thanh Hong Nguyen","title":"Mimicking To Dominate: Imitation Learning Strategies for Success in\n  Multiagent Competitive Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Training agents in multi-agent competitive games presents significant\nchallenges due to their intricate nature. These challenges are exacerbated by\ndynamics influenced not only by the environment but also by opponents'\nstrategies. Existing methods often struggle with slow convergence and\ninstability. To address this, we harness the potential of imitation learning to\ncomprehend and anticipate opponents' behavior, aiming to mitigate uncertainties\nwith respect to the game dynamics. Our key contributions include: (i) a new\nmulti-agent imitation learning model for predicting next moves of the opponents\n-- our model works with hidden opponents' actions and local observations; (ii)\na new multi-agent reinforcement learning algorithm that combines our imitation\nlearning model and policy training into one single training process; and (iii)\nextensive experiments in three challenging game environments, including an\nadvanced version of the Star-Craft multi-agent challenge (i.e., SMACv2).\nExperimental results show that our approach achieves superior performance\ncompared to existing state-of-the-art multi-agent RL algorithms.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:30:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bui","The Viet",""],["Mai","Tien",""],["Nguyen","Thanh Hong",""]]}
{"id":"2308.10189","submitter":"Sam Safran","authors":"Samuel Safran and Philip Pincus","title":"Scaling Perspectives of Underscreening in Concentrated Electrolyte\n  Solutions","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 present a scaling view of underscreening observed in salt solutions in the\nrange of concentrations greater than about 1M, in which the screening length\nincreases with concentration. The system consists of hydrated clusters of\npositive and negative ions with a single unpaired ion as suggested by recent\nsimulations. The environment of this ion is more hydrated than average which\nleads to a self-similar situation in which the size of this environment scales\nwith the screening length. The prefactor involves the local dielectric constant\nand the cluster density. The scaling arguments as well as the cluster model\nlead to scaling of the screening length with the ion concentration, in\nagreement with observations.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:33:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Safran","Samuel",""],["Pincus","Philip",""]]}
{"id":"2308.10190","submitter":"Zhaoyu Han","authors":"Zhaoyu Han, Kyung-Su Kim, Steven A. Kivelson, and Thors Hans Hansson","title":"Two-fluid theory of composite bosons and fermions and the quantum Hall\n  proximity effect","comments":"17 pages, 6 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":"  We propose a two-fluid description of fractional quantum Hall systems, in\nwhich one component is a condensate of composite bosons and the other a Fermi\nliquid formed by composite fermions (or simply electrons). We employ the theory\nto model the interface between a fractional quantum Hall liquid and a\n(composite) Fermi liquid metal, where we find a penetration of quantum Hall\ncondensate into the metallic region reminiscent of the proximity effect in\nsuperconductor-metal interfaces. We also find a novel and physically reasonable\nset of gapped quasielectron and neutral modes in fractional quantum Hall\nliquids.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:36:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Han","Zhaoyu",""],["Kim","Kyung-Su",""],["Kivelson","Steven A.",""],["Hansson","Thors Hans",""]]}
{"id":"2308.10191","submitter":"Xueru Wen","authors":"Xueru Wen and Xiaoyang Chen and Xuanang Chen and Ben He and Le Sun","title":"Offline Pseudo Relevance Feedback for Efficient and Effective\n  Single-pass Dense Retrieval","comments":"Accepted at SIGIR2023","journal-ref":null,"doi":"10.1145/3539618.3592028","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dense retrieval has made significant advancements in information retrieval\n(IR) by achieving high levels of effectiveness while maintaining online\nefficiency during a single-pass retrieval process. However, the application of\npseudo relevance feedback (PRF) to further enhance retrieval effectiveness\nresults in a doubling of online latency. To address this challenge, this paper\npresents a single-pass dense retrieval framework that shifts the PRF process\noffline through the utilization of pre-generated pseudo-queries. As a result,\nonline retrieval is reduced to a single matching with the pseudo-queries, hence\nproviding faster online retrieval. The effectiveness of the proposed approach\nis evaluated on the standard TREC DL and HARD datasets, and the results\ndemonstrate its promise. Our code is openly available at\nhttps://github.com/Rosenberg37/OPRF.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:42:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wen","Xueru",""],["Chen","Xiaoyang",""],["Chen","Xuanang",""],["He","Ben",""],["Sun","Le",""]]}
{"id":"2308.10192","submitter":"Syed Saud Naqvi","authors":"Mehwish Mehmood, Khuram Naveed, Haroon Ahmed Khan, Syed S. Naqvi","title":"EDDense-Net: Fully Dense Encoder Decoder Network for Joint Segmentation\n  of Optic Cup and Disc","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Glaucoma is an eye disease that causes damage to the optic nerve, which can\nlead to visual loss and permanent blindness. Early glaucoma detection is\ntherefore critical in order to avoid permanent blindness. The estimation of the\ncup-to-disc ratio (CDR) during an examination of the optical disc (OD) is used\nfor the diagnosis of glaucoma. In this paper, we present the EDDense-Net\nsegmentation network for the joint segmentation of OC and OD. The encoder and\ndecoder in this network are made up of dense blocks with a grouped\nconvolutional layer in each block, allowing the network to acquire and convey\nspatial information from the image while simultaneously reducing the network's\ncomplexity. To reduce spatial information loss, the optimal number of filters\nin all convolution layers were utilised. In semantic segmentation, dice pixel\nclassification is employed in the decoder to alleviate the problem of class\nimbalance. The proposed network was evaluated on two publicly available\ndatasets where it outperformed existing state-of-the-art methods in terms of\naccuracy and efficiency. For the diagnosis and analysis of glaucoma, this\nmethod can be used as a second opinion system to assist medical\nophthalmologists.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:45:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mehmood","Mehwish",""],["Naveed","Khuram",""],["Khan","Haroon Ahmed",""],["Naqvi","Syed S.",""]]}
{"id":"2308.10193","submitter":"Shamik Sarkar","authors":"Shamik Sarkar, Dongning Guo, Danijela Cabric","title":"ProSpire: Proactive Spatial Prediction of Radio Environment Using Deep\n  Learning","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatial prediction of the radio propagation environment of a transmitter can\nassist and improve various aspects of wireless networks. The majority of\nresearch in this domain can be categorized as 'reactive' spatial prediction,\nwhere the predictions are made based on a small set of measurements from an\nactive transmitter whose radio environment is to be predicted. Emerging\nspectrum-sharing paradigms would benefit from 'proactive' spatial prediction of\nthe radio environment, where the spatial predictions must be done for a\ntransmitter for which no measurement has been collected.\n  This paper proposes a novel, supervised deep learning-based framework,\nProSpire, that enables spectrum sharing by leveraging the idea of proactive\nspatial prediction. We carefully address several challenges in ProSpire, such\nas designing a framework that conveniently collects training data for learning,\nperforming the predictions in a fast manner, enabling operations without an\narea map, and ensuring that the predictions do not lead to undesired\ninterference. ProSpire relies on the crowdsourcing of transmitters and\nreceivers during their normal operations to address some of the aforementioned\nchallenges. The core component of ProSpire is a deep learning-based\nimage-to-image translation method, which we call RSSu-net. We generate several\ndiverse datasets using ray tracing software and numerically evaluate ProSpire.\nOur evaluations show that RSSu-net performs reasonably well in terms of signal\nstrength prediction, 5 dB mean absolute error, which is comparable to the\naverage error of other relevant methods. Importantly, due to the merits of\nRSSu-net, ProSpire creates proactive boundaries around transmitters such that\nthey can be activated with 97% probability of not causing interference. In this\nregard, the performance of RSSu-net is 19% better than that of other comparable\nmethods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:48:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sarkar","Shamik",""],["Guo","Dongning",""],["Cabric","Danijela",""]]}
{"id":"2308.10194","submitter":"David Steinberg","authors":"Ori Becher, Mira Marcus-Kalish and David M. Steinberg","title":"Federated Statistical Analysis: Non-parametric Testing and Quantile\n  Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The age of big data has fueled expectations for accelerating learning. The\navailability of large data sets enables researchers to achieve more powerful\nstatistical analyses and enhances the reliability of conclusions, which can be\nbased on a broad collection of subjects. Often such data sets can be assembled\nonly with access to diverse sources; for example, medical research that\ncombines data from multiple centers in a federated analysis. However these\nhopes must be balanced against data privacy concerns, which hinder sharing raw\ndata among centers. Consequently, federated analyses typically resort to\nsharing data summaries from each center. The limitation to summaries carries\nthe risk that it will impair the efficiency of statistical analysis procedures.\n  In this work we take a close look at the effects of federated analysis on two\nvery basic problems, nonparametric comparison of two groups and quantile\nestimation to describe the corresponding distributions. We also propose a\nspecific privacy-preserving data release policy for federated analysis with the\n$K$-anonymity criterion, which has been adopted by the Medical Informatics\nPlatform of the European Human Brain Project. Our results show that, for our\ntasks, there is only a modest loss of statistical efficiency.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:52:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Becher","Ori",""],["Marcus-Kalish","Mira",""],["Steinberg","David M.",""]]}
{"id":"2308.10195","submitter":"Zehong Zhang","authors":"Dongjian Huo, Zehong Zhang, Hanjing Su, Guanbin Li, Chaowei Fang,\n  Qingyao Wu","title":"WMFormer++: Nested Transformer for Visible Watermark Removal via Implict\n  Joint Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CL cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Watermarking serves as a widely adopted approach to safeguard media\ncopyright. In parallel, the research focus has extended to watermark removal\ntechniques, offering an adversarial means to enhance watermark robustness and\nfoster advancements in the watermarking field. Existing watermark removal\nmethods mainly rely on UNet with task-specific decoder branches--one for\nwatermark localization and the other for background image restoration. However,\nwatermark localization and background restoration are not isolated tasks;\nprecise watermark localization inherently implies regions necessitating\nrestoration, and the background restoration process contributes to more\naccurate watermark localization. To holistically integrate information from\nboth branches, we introduce an implicit joint learning paradigm. This empowers\nthe network to autonomously navigate the flow of information between implicit\nbranches through a gate mechanism. Furthermore, we employ cross-channel\nattention to facilitate local detail restoration and holistic structural\ncomprehension, while harnessing nested structures to integrate multi-scale\ninformation. Extensive experiments are conducted on various challenging\nbenchmarks to validate the effectiveness of our proposed method. The results\ndemonstrate our approach's remarkable superiority, surpassing existing\nstate-of-the-art methods by a large margin.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 07:56:34 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:55:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Huo","Dongjian",""],["Zhang","Zehong",""],["Su","Hanjing",""],["Li","Guanbin",""],["Fang","Chaowei",""],["Wu","Qingyao",""]]}
{"id":"2308.10196","submitter":"Jingfan Tan","authors":"Jingfan Tan, Xiaoxu Chen, Tao Wang, Kaihao Zhang, Wenhan Luo, Xiaocun\n  Cao","title":"Blind Face Restoration for Under-Display Camera via Dictionary Guided\n  Transformer","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":"  By hiding the front-facing camera below the display panel, Under-Display\nCamera (UDC) provides users with a full-screen experience. However, due to the\ncharacteristics of the display, images taken by UDC suffer from significant\nquality degradation. Methods have been proposed to tackle UDC image restoration\nand advances have been achieved. There are still no specialized methods and\ndatasets for restoring UDC face images, which may be the most common problem in\nthe UDC scene. To this end, considering color filtering, brightness\nattenuation, and diffraction in the imaging process of UDC, we propose a\ntwo-stage network UDC Degradation Model Network named UDC-DMNet to synthesize\nUDC images by modeling the processes of UDC imaging. Then we use UDC-DMNet and\nhigh-quality face images from FFHQ and CelebA-Test to create UDC face training\ndatasets FFHQ-P/T and testing datasets CelebA-Test-P/T for UDC face\nrestoration. We propose a novel dictionary-guided transformer network named\nDGFormer. Introducing the facial component dictionary and the characteristics\nof the UDC image in the restoration makes DGFormer capable of addressing blind\nface restoration in UDC scenarios. Experiments show that our DGFormer and\nUDC-DMNet achieve state-of-the-art performance.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:02:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tan","Jingfan",""],["Chen","Xiaoxu",""],["Wang","Tao",""],["Zhang","Kaihao",""],["Luo","Wenhan",""],["Cao","Xiaocun",""]]}
{"id":"2308.10197","submitter":"Somya Singh","authors":"Somya Singh and Fady Alajaji and Bahman Gharesifard","title":"Generating Preferential Attachment Graphs via a P\\'olya Urn with\n  Expanding Colors","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel preferential attachment model using the draw variables\nof a modified P\\'olya urn with an expanding number of colors, notably capable\nof modeling influential opinions (in terms of vertices of high degree) as the\ngraph evolves. Similar to the Barab\\'asi-Albert model, the generated graph\ngrows in size by one vertex at each time instance; in contrast however, each\nvertex of the graph is uniquely characterized by a color, which is represented\nby a ball color in the P\\'olya urn. More specifically at each time step, we\ndraw a ball from the urn and return it to the urn along with a number\n(potentially time-varying and non-integer) of reinforcing balls of the same\ncolor; we also add another ball of a new color to the urn. We then construct an\nedge between the new vertex (corresponding to the new color) and the existing\nvertex whose color ball is drawn. Using color-coded vertices in conjunction\nwith the time-varying reinforcing parameter allows for vertices added (born)\nlater in the process to potentially attain a high degree in a way that is not\ncaptured in the Barab\\'asi-Albert model. We study the degree count of the\nvertices by analyzing the draw vectors of the underlying stochastic process. In\nparticular, we establish the probability distribution of the random variable\ncounting the number of draws of a given color which determines the degree of\nthe vertex corresponding to that color in the graph. We further provide\nsimulation results presenting a comparison between our model and the\nBarab\\'asi-Albert network.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:06:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singh","Somya",""],["Alajaji","Fady",""],["Gharesifard","Bahman",""]]}
{"id":"2308.10198","submitter":"Ilkka T\\\"orm\\\"a","authors":"Ville Salo and Ilkka T\\\"orm\\\"a","title":"Computing backwards with Game of Life, part 1: wires and circuits","comments":"28 pages, 10 figures in main text. 11 pages, 20 figures in appendix.\n  Accompanied by two GitHub repositories containing programs and auxiliary data","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL cs.DM math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conway's Game of Life is a two-dimensional cellular automaton. As a dynamical\nsystem, it is well-known to be computationally universal, i.e.\\ capable of\nsimulating an arbitrary Turing machine. We show that in a sense taking a single\nbackwards step of Game of Life is a computationally universal process, by\nconstructing patterns whose preimage computation encodes an arbitrary\ncircuit-satisfaction problem, or (equivalently) any tiling problem. As a\ncorollary, we obtain for example that the set of orphans is coNP-complete,\nexhibit a $6210 \\times 37800$-periodic configuration that admits a preimage but\nno periodic one, and prove that the existence of a preimage for a periodic\npoint is undecidable. Our constructions were obtained by a combination of\ncomputer searches and manual design.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:09:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Salo","Ville",""],["T\u00f6rm\u00e4","Ilkka",""]]}
{"id":"2308.10199","submitter":"Yiyuan Zhang","authors":"Yiyuan Zhang, Wei Fan","title":"Deep Reinforcement Learning for Artificial Upwelling Energy Management","comments":"31 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The potential of artificial upwelling (AU) as a means of lifting\nnutrient-rich bottom water to the surface, stimulating seaweed growth, and\nconsequently enhancing ocean carbon sequestration, has been gaining increasing\nattention in recent years. This has led to the development of the first\nsolar-powered and air-lifted AU system (AUS) in China. However, efficient\nscheduling of air injection systems in complex marine environments remains a\ncrucial challenge in operating AUS, as it holds the potential to significantly\nimprove energy efficiency. To tackle this challenge, we propose a novel energy\nmanagement approach that utilizes deep reinforcement learning (DRL) algorithm\nto develop efficient strategies for operating AUS. Specifically, we formulate\nthe problem of maximizing the energy efficiency of AUS as a Markov decision\nprocess and integrate the quantile network in distributional reinforcement\nlearning (QR-DQN) with the deep dueling network to solve it. Through extensive\nsimulations, we evaluate the performance of our algorithm and demonstrate its\nsuperior effectiveness over traditional rule-based approaches and other DRL\nalgorithms in reducing energy wastage while ensuring the stable and efficient\noperation of AUS. Our findings suggest that a DRL-based approach offers a\npromising way to improve the energy efficiency of AUS and enhance the\nsustainability of seaweed cultivation and carbon sequestration in the ocean.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:16:36 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 08:25:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Yiyuan",""],["Fan","Wei",""]]}
{"id":"2308.10200","submitter":"Rui Xue","authors":"Ze-Rui Wang, Rui Xue, Dingrong Xiong, Hai-Qin Wang, Lu-Ming Sun, and\n  Fang-Kun Peng","title":"Broadband multi-wavelength study of LHAASO detected AGN","comments":"22 pages, 10 figures, submitted to ApJS. Suggestions, comments or\n  feedback will be appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, the Large High Altitude Air Shower Observatory (LHAASO)\ncollaboration presents the first catalog of $\\gamma$-ray sources using 508 days\nLHAASO data from March 2021 to September 2022. This catalog contains five\nactive galactic nuclei (AGNs), of which four are blazars and one is a\nliner-type AGN. In this work, we establish averaged multi-wavelength SEDs by\ncombining data from $Fermi$-Large Area Telescope, $Swift$, $ZTF$, and $WISE$\nwith the same period as the LHAASO detection. In general, these five AGNs are\nfound in low states at all wavelengths. To study the multi-wavelength\nproperties of these AGNs, several jet emission models, including the one-zone\nleptonic model, the one-zone leptonic and hadronuclear ($pp$) model, the\none-zone proton-synchrotron model, and the spine-layer model are applied to\nreproduce their averaged SEDs, respectively. We find that the one-zone leptonic\nmodel can reproduce most of the SEDs, except for the high-energy tail of LHAASO\nspectra. To improve the fitting, emission from $pp$ interactions is favoured in\nthe framework of one-zone model. The spine-layer model, which can be treated as\na multi-zone scenario, also can provide good spectra fits. The influence of\ndifferent extragalactic background light models on fitting LHAASO energy\nspectrum is also discussed.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:18:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Ze-Rui",""],["Xue","Rui",""],["Xiong","Dingrong",""],["Wang","Hai-Qin",""],["Sun","Lu-Ming",""],["Peng","Fang-Kun",""]]}
{"id":"2308.10201","submitter":"Elizaveta Kovtun","authors":"Elizaveta Kovtun, Alina Ermilova, Dmitry Berestnev, and Alexey Zaytsev","title":"Hiding Backdoors within Event Sequence Data via Poisoning Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The financial industry relies on deep learning models for making important\ndecisions. This adoption brings new danger, as deep black-box models are known\nto be vulnerable to adversarial attacks. In computer vision, one can shape the\noutput during inference by performing an adversarial attack called poisoning\nvia introducing a backdoor into the model during training. For sequences of\nfinancial transactions of a customer, insertion of a backdoor is harder to\nperform, as models operate over a more complex discrete space of sequences, and\nsystematic checks for insecurities occur. We provide a method to introduce\nconcealed backdoors, creating vulnerabilities without altering their\nfunctionality for uncontaminated data. To achieve this, we replace a clean\nmodel with a poisoned one that is aware of the availability of a backdoor and\nutilize this knowledge. Our most difficult for uncovering attacks include\neither additional supervised detection step of poisoned data activated during\nthe test or well-hidden model weight modifications. The experimental study\nprovides insights into how these effects vary across different datasets,\narchitectures, and model components. Alternative methods and baselines, such as\ndistillation-type regularization, are also explored but found to be less\nefficient. Conducted on three open transaction datasets and architectures,\nincluding LSTM, CNN, and Transformer, our findings not only illuminate the\nvulnerabilities in contemporary models but also can drive the construction of\nmore robust systems.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:27:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kovtun","Elizaveta",""],["Ermilova","Alina",""],["Berestnev","Dmitry",""],["Zaytsev","Alexey",""]]}
{"id":"2308.10202","submitter":"Andrea Rossi","authors":"Andrea Rossi","title":"Hadronization mechanisms (via heavy-flavour hadrons): Experiment","comments":"Proceedings of Hard Probes 2023 conference, see\n  https://wwuindico.uni-muenster.de/event/1409/overview","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The formation of hadrons is a fundamental process in nature that can be\ninvestigated at particle colliders. Given their large mass, heavy quarks (charm\nand beauty) are produced only in initial hard-scatterings, prior to\nhadronisation, which determines instead the relative abundances and the\nkinematics of the various heavy-flavour hadron species. As several recent\nfindings demonstrate, with \\ee collisions as a \"vacuum-like\" reference at one\nextreme, and central AA as a dense, extended-size system characterised by flow\nand local equilibrium at the opposite extreme, different collision systems\noffer a lever arm that can be exploited to probe with a range of heavy-flavour\nhadron species the onset of various hadronisation processes. In these\nproceedings, a selection of the experimental results related to heavy-flavour\nhadronisation shown for the first time at the Hard Probes 2023 conference is\npresented together with some of the most important ones of the last years. The\nfocus is on open-heavy flavour measurements. The comparison with model\npredictions and connections among the results in \\ee, proton--proton,\nproton--nucleus, nucleus--nucleus collisions are discussed.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:31:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rossi","Andrea",""]]}
{"id":"2308.10203","submitter":"YeChen Zhang","authors":"Yechen Zhang, Jian Sun, Gang Wang, Zhuo Li, Wei Chen","title":"Soft Decomposed Policy-Critic: Bridging the Gap for Effective Continuous\n  Control with Discrete RL","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":"  Discrete reinforcement learning (RL) algorithms have demonstrated exceptional\nperformance in solving sequential decision tasks with discrete action spaces,\nsuch as Atari games. However, their effectiveness is hindered when applied to\ncontinuous control problems due to the challenge of dimensional explosion. In\nthis paper, we present the Soft Decomposed Policy-Critic (SDPC) architecture,\nwhich combines soft RL and actor-critic techniques with discrete RL methods to\novercome this limitation. SDPC discretizes each action dimension independently\nand employs a shared critic network to maximize the soft $Q$-function. This\nnovel approach enables SDPC to support two types of policies: decomposed actors\nthat lead to the Soft Decomposed Actor-Critic (SDAC) algorithm, and decomposed\n$Q$-networks that generate Boltzmann soft exploration policies, resulting in\nthe Soft Decomposed-Critic Q (SDCQ) algorithm. Through extensive experiments,\nwe demonstrate that our proposed approach outperforms state-of-the-art\ncontinuous RL algorithms in a variety of continuous control tasks, including\nMujoco's Humanoid and Box2d's BipedalWalker. These empirical results validate\nthe effectiveness of the SDPC architecture in addressing the challenges\nassociated with continuous control.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:32:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yechen",""],["Sun","Jian",""],["Wang","Gang",""],["Li","Zhuo",""],["Chen","Wei",""]]}
{"id":"2308.10204","submitter":"Haoyuan Wu","authors":"Zhuolun He, Haoyuan Wu, Xinyun Zhang, Xufeng Yao, Su Zheng, Haisheng\n  Zheng, Bei Yu","title":"ChatEDA: A Large Language Model Powered Autonomous Agent for EDA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The integration of a complex set of Electronic Design Automation (EDA) tools\nto enhance interoperability is a critical concern for circuit designers. Recent\nadvancements in large language models (LLMs) have showcased their exceptional\ncapabilities in natural language processing and comprehension, offering a novel\napproach to interfacing with EDA tools. This research paper introduces ChatEDA,\nan autonomous agent for EDA empowered by a large language model, AutoMage,\ncomplemented by EDA tools serving as executors. ChatEDA streamlines the design\nflow from the Register-Transfer Level (RTL) to the Graphic Data System Version\nII (GDSII) by effectively managing task planning, script generation, and task\nexecution. Through comprehensive experimental evaluations, ChatEDA has\ndemonstrated its proficiency in handling diverse requirements, and our\nfine-tuned AutoMage model has exhibited superior performance compared to GPT-4\nand other similar LLMs.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:32:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["He","Zhuolun",""],["Wu","Haoyuan",""],["Zhang","Xinyun",""],["Yao","Xufeng",""],["Zheng","Su",""],["Zheng","Haisheng",""],["Yu","Bei",""]]}
{"id":"2308.10205","submitter":"Can Zhang","authors":"Can Zhang and Gim Hee Lee","title":"GeT: Generative Target Structure Debiasing for Domain Adaptation","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":"  Domain adaptation (DA) aims to transfer knowledge from a fully labeled source\nto a scarcely labeled or totally unlabeled target under domain shift. Recently,\nsemi-supervised learning-based (SSL) techniques that leverage pseudo labeling\nhave been increasingly used in DA. Despite the competitive performance, these\npseudo labeling methods rely heavily on the source domain to generate pseudo\nlabels for the target domain and therefore still suffer considerably from\nsource data bias. Moreover, class distribution bias in the target domain is\nalso often ignored in the pseudo label generation and thus leading to further\ndeterioration of performance. In this paper, we propose GeT that learns a\nnon-bias target embedding distribution with high quality pseudo labels.\nSpecifically, we formulate an online target generative classifier to induce the\ntarget distribution into distinctive Gaussian components weighted by their\nclass priors to mitigate source data bias and enhance target class\ndiscriminability. We further propose a structure similarity regularization\nframework to alleviate target class distribution bias and further improve\ntarget class discriminability. Experimental results show that our proposed GeT\nis effective and achieves consistent improvements under various DA settings\nwith and without class distribution bias. Our code is available at:\nhttps://lulusindazc.github.io/getproject/.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 08:52:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Can",""],["Lee","Gim Hee",""]]}
{"id":"2308.10206","submitter":"Yucong Huang PhD","authors":"Yucong Huang and Shinya Nishibata","title":"Large-time behaviour of the spherically symmetric solution to an outflow\n  problem for isentropic model of compressible viscous fluid","comments":"42 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study the large time behaviour of a spherically symmetric motion of\nout-flowing isentropic and compressible viscous gas. The fluid occupies an\nunbounded exterior domain in $\\mathbb{R}^n \\; (n \\ge 2)$, and it flows out from\nan inner sphere centred at the origin of radius $r=1$. The unique existence of\na stationary solution satisfying the outflow boundary condition has been\nobtained by I. Hashimoto and A. Matsumura in 2021. The main aim of present\npaper is to show that this stationary solution becomes a time asymptotic state\nto the initial boundary value problem with the same boundary and spatial\nasymptotic conditions. Here, the initial data is chosen arbitrarily large if it\nbelongs to the suitable weighted Sobolev space. The main strategy is to\napproximate the unbounded exterior problem by solving a sequence of\noutflow-inflow initial boundary value problems posed in finite annular domain.\nThen the solution is obtained as a limit of these approximate solutions. The\nkey argument for the stability theorem is based on the derivation of a-priori\nestimates in the weighted Sobolev space, executed under the Lagrangian\ncoordinate. The essential step of the proof is to obtain the point-wise upper\nand lower bound for the density. It is derived through employing a\nrepresentation formula of the density with the aid of the weighted energy\nmethod.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:08:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Yucong",""],["Nishibata","Shinya",""]]}
{"id":"2308.10207","submitter":"Bo Liu","authors":"Feng Lu, Bo Liu","title":"Affective Digital Twins for Digital Human: Bridging the Gap in\n  Human-Machine Affective Interaction","comments":"7 pages, in Chinese language, 6 figures","journal-ref":"Journal of Chinese Association for Artificial Intelligence, 13(3),\n  11-16 (2023)","doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, metaverse and digital humans have become important research\nand industry areas of focus. However, existing digital humans still lack\nrealistic affective traits, making emotional interaction with humans difficult.\nGrounded in the developments of artificial intelligence, human-computer\ninteraction, virtual reality, and affective computing, this paper proposes the\nconcept and technical framework of \"Affective Digital Twins for Digital Human\"\nbased on the philosophy of digital twin technology. The paper discusses several\nkey technical issues including affective modeling, affective perception,\naffective encoding, and affective expression. Based on this, the paper conducts\na preliminary imagination of the future application prospects of affective\ndigital twins for digital human, while considering potential problems that may\nneed to be addressed.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:15:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lu","Feng",""],["Liu","Bo",""]]}
{"id":"2308.10208","submitter":"Alexandra Bernadotte Dr","authors":"Alexandra Bernadotte","title":"Real-time Regular Expression Matching","comments":"17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL cs.CC cs.CV cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper is devoted to finite state automata, regular expression matching,\npattern recognition, and the exponential blow-up problem, which is the growing\ncomplexity of automata exponentially depending on regular expression length.\nThis paper presents a theoretical and hardware solution to the exponential\nblow-up problem for some complicated classes of regular languages, which caused\nsevere limitations in Network Intrusion Detection Systems work. The article\nsupports the solution with theorems on correctness and complexity.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:25:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bernadotte","Alexandra",""]]}
{"id":"2308.10209","submitter":"Jingya Zhou","authors":"Congcong Zhang, Jingya Zhou, Jin Wang, Jianxi Fan, Yingdan Shi","title":"Fairness-aware Competitive Bidding Influence Maximization in Social\n  Networks","comments":"IEEE Transactions on Computational Social Systems (TCSS), 2023, early\n  access","journal-ref":null,"doi":"10.1109/TCSS.2023.3285605","report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Competitive Influence Maximization (CIM) has been studied for years due to\nits wide application in many domains. Most current studies primarily focus on\nthe micro-level optimization by designing policies for one competitor to defeat\nits opponents. Furthermore, current studies ignore the fact that many\ninfluential nodes have their own starting prices, which may lead to inefficient\nbudget allocation. In this paper, we propose a novel Competitive Bidding\nInfluence Maximization (CBIM) problem, where the competitors allocate budgets\nto bid for the seeds attributed to the platform during multiple bidding rounds.\nTo solve the CBIM problem, we propose a Fairness-aware Multi-agent Competitive\nBidding Influence Maximization (FMCBIM) framework. In this framework, we\npresent a Multi-agent Bidding Particle Environment (MBE) to model the\ncompetitors' interactions, and design a starting price adjustment mechanism to\nmodel the dynamic bidding environment. Moreover, we put forward a novel\nMulti-agent Competitive Bidding Influence Maximization (MCBIM) algorithm to\noptimize competitors' bidding policies. Extensive experiments on five datasets\nshow that our work has good efficiency and effectiveness.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:26:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Congcong",""],["Zhou","Jingya",""],["Wang","Jin",""],["Fan","Jianxi",""],["Shi","Yingdan",""]]}
{"id":"2308.10210","submitter":"Samrat Sen","authors":"Samrat Sen, Jack Jenkins, and Rony Keppens","title":"3D coupled tearing-thermal evolution in solar current sheets","comments":"Accepted for publication in Astronomy and Astrophysics journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Combined tearing-thermal evolution plays an important role in the disruption\nof current sheets, and formation of cool condensations within the solar\natmosphere. However, this has received limited attention to date. We\nnumerically explore a combined tearing and thermal instability that causes the\nbreak up of an idealized current sheet in the solar atmosphere. The thermal\ncomponent leads to the formation of localized, cool condensations within an\notherwise 3D reconnecting magnetic topology. We construct a 3D resistive\nmagnetohydrodynamic simulation of a force-free current sheet under solar\natmospheric conditions that incorporate the non-adiabatic influence of\nbackground heating, optically thin radiative energy loss, and magnetic field\naligned thermal conduction with the open source code MPI-AMRVAC. Multiple\nlevels of adaptive mesh refinement reveal the self-consistent development of\nfiner-scale condensation structures within the evolving system. The instability\nin the current sheet is triggered by magnetic field perturbations concentrated\naround the current sheet plane, and subsequent tearing modes develop. This in\nturn drives thermal runaway associated with the thermal instability of the\nsystem. We find subsequent, localized cool plasma condensations that form under\nthe prevailing low plasma-$\\beta$ conditions, and demonstrate that the density\nand temperature of these condensed structures are similar to more quiescent\ncoronal condensations. Synthetic counterparts at Extreme-UltraViolet (EUV) and\noptical wavelengths show the formation of plasmoids (in EUV), and coronal\ncondensations similar to prominences and coronal rain blobs in the vicinity of\nthe reconnecting sheet. Our simulations imply that 3D reconnection in solar\ncurrent sheets may well present an almost unavoidable multi-thermal aspect,\nthat forms during their coupled tearing-thermal evolution.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:28:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sen","Samrat",""],["Jenkins","Jack",""],["Keppens","Rony",""]]}
{"id":"2308.10211","submitter":"Ankan Das","authors":"Bratati Bhat, Rumela Kar, Suman Kumar Mondal, Rana Ghosh, Prasanta\n  Gorai, Takashi Shimonishi, Kei E. I. Tanaka, Kenji Furuya, and Ankan Das","title":"Chemical evolution of some selected complex organic molecules in\n  low-mass star-forming regions","comments":"44 pages, 25 figures, and 12 tables. Accepted for the publication in\n  the Astrophysical Journal","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 destiny of complex organic molecules (COMs) in star-forming regions is\ninterlinked with various evolutionary phases. Therefore, identifying these\nspecies in diversified environments of identical star-forming regions would\nhelp to comprehend their physical and chemical heritage. We identified multiple\nCOMs utilizing the Large Program `Astrochemical Surveys At IRAM' (ASAI) data,\ndedicated to chemical surveys in Sun-like star-forming regions with the IRAM 30\nm telescope. It was an unbiased survey in the millimetre regime, covering the\nprestellar core, protostar, outflow region, and protoplanetary disk phase.\nHere, we have reported some transitions of seven COMs, namely, methanol\n(CH3OH), acetaldehyde (CH3CHO), methyl formate (CH3OCHO), ethanol (C2H5OH),\npropynal (HCCCHO), dimethyl ether (CH3OCH3), and methyl cyanide (CH3CN) in some\nsources L1544, B1-b, IRAS4A, and SVS13A. We found a trend among these species\nfrom the derived abundances using the rotational diagram method and MCMC fit.\nWe have found that the abundances of all of the COMs, except for HCCCHO,\nincrease from the L1544 (prestellar core) and peaks at IRAS16293-2422 (class 0\nphase). It is noticed that the abundance of these molecules correlate with the\nluminosity of the sources. The obtained trend is also visible from the previous\ninterferometric observations and considering the beam dilution effect.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:33:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bhat","Bratati",""],["Kar","Rumela",""],["Mondal","Suman Kumar",""],["Ghosh","Rana",""],["Gorai","Prasanta",""],["Shimonishi","Takashi",""],["Tanaka","Kei E. I.",""],["Furuya","Kenji",""],["Das","Ankan",""]]}
{"id":"2308.10212","submitter":"\\\"Ozg\\\"ur \\\"Okc\\\"u","authors":"Zeynep \\c{C}oker, \\\"Ozg\\\"ur \\\"Okc\\\"u, Ekrem Aydiner","title":"Modified Friedmann equations from fractional entropy","comments":"16 pages, 2 figures. Accepted for publication in EPL","journal-ref":null,"doi":"10.1209/0295-5075/acf158","report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on the fractional black hole entropy [Eur. Phys. J. C (2021) 81:632],\nwe derive the modified Friedmann equations from two different frameworks.\nFirst, we consider the modifications of Friedmann equations from the first law\nof thermodynamics at the apparent horizon. We show that the generalized second\nlaw (GSL) of thermodynamics always holds in a region bounded by the apparent\nhorizon. Then, we obtain Friedmann equations from Verlinde's entropic gravity\nframework. We also compute the fractional corrections to deceleration parameter\n$q$ in flat case $k=0$ for both frameworks. Furthermore, we consider the time\nto reach the initial singularity for the two frameworks. The results indicate\nthat the initial singularity is accessible for both frameworks. However,\nfractional effects may provide a constraint on the equation of state parameter\nin the entropic gravity scenario since the time is imaginary for\n$-2/3\\alpha<\\omega<-1/3$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:45:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["\u00c7oker","Zeynep",""],["\u00d6kc\u00fc","\u00d6zg\u00fcr",""],["Aydiner","Ekrem",""]]}
{"id":"2308.10213","submitter":"Hyosang Kang","authors":"Woojin Choi, Hyosang Kang, Jeonghoon Rhee, and Youchan Oh","title":"The boundary of Rauzy fractal and discrete tilings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Rauzy fractal is a domain in the two-dimensional plane constructed by the\nRauzy substitution, a substitution rule on three letters. The Rauzy fractal has\na fractal-like boundary, and the currently known its constructions is not only\nfor its boundary but also for the entire domain. In this paper, we show that\nall points in the Rauzy fractal have a layered structure. We propose two\nmethods of constructing the Rauzy fractal using layered structures. We show how\nsuch layered structures can be used to construct the boundary of the Rauzy\nfractal with less computation than conventional methods. There is a\nself-replicating pattern in one of the layered structure in the Rauzy fractal.\nWe introduce a notion of self-replicating word and visualize how some\nself-replicating words on three letters creates discrete tiling of the two\ndimensional plane.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:45:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Choi","Woojin",""],["Kang","Hyosang",""],["Rhee","Jeonghoon",""],["Oh","Youchan",""]]}
{"id":"2308.10214","submitter":"Swee Hong Chan","authors":"Swee Hong Chan and Igor Pak","title":"Computational complexity of counting coincidences","comments":"23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.CC cs.CG cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Can you decide if there is a coincidence in the numbers counting two\ndifferent combinatorial objects? For example, can you decide if two regions in\n$\\mathbb{R}^3$ have the same number of domino tilings? There are two versions\nof the problem, with $2\\times 1 \\times 1$ and $2\\times 2 \\times 1$ boxes. We\nprove that in both cases the coincidence problem is not in the polynomial\nhierarchy unless the polynomial hierarchy collapses to a finite level. While\nthe conclusions are the same, the proofs are notably different and generalize\nin different directions.\n  We proceed to explore the coincidence problem for counting independent sets\nand matchings in graphs, matroid bases, order ideals and linear extensions in\nposets, permutation patterns, and the Kronecker coefficients. We also make a\nnumber of conjectures for counting other combinatorial objects such as plane\ntriangulations, contingency tables, standard Young tableaux, reduced\nfactorizations and the Littlewood--Richardson coefficients.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:48:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chan","Swee Hong",""],["Pak","Igor",""]]}
{"id":"2308.10215","submitter":"Dan Dalacu","authors":"Edith Yeung, David B. Northeast, Jeongwan Jin, Patrick Laferri\\`ere,\n  Marek Korkusinski, Philip J. Poole, Robin L. Williams, Dan Dalacu","title":"On-chip indistinguishable photons using III-V nanowire/SiN hybrid\n  integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We demonstrate on-chip generation of indistinguishable photons based on a\nnanowire quantum dot. From a growth substrate containing arrays of\npositioned-controlled single dot nanowires, we select a single nanowire which\nis placed on a SiN waveguide fabricated on a Si-based chip. Coupling of the\nquantum dot emission to the SiN waveguide is via the evanescent mode in the\ntapered nanowire. Post-selected two-photon interference visibilities using\ncontinuous wave excitation above-band and into a p-shell of the dot were 100%,\nconsistent with a single photon source having negligible multi-photon emission\nprobability. Visibilities over the entire photon wavepacket, measured using\npulsed excitation, were reduced by a factor of 5 when exciting quasi-resonantly\nand by a factor of 10 for above-band excitation. The role of excitation timing\njitter, spectral diffusion and pure dephasing in limiting visibilities over the\ntemporal extent of the photon is investigated using additional measurements of\nthe coherence and linewidth of the emitted photons.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:51:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yeung","Edith",""],["Northeast","David B.",""],["Jin","Jeongwan",""],["Laferri\u00e8re","Patrick",""],["Korkusinski","Marek",""],["Poole","Philip J.",""],["Williams","Robin L.",""],["Dalacu","Dan",""]]}
{"id":"2308.10216","submitter":"Nadir Murru","authors":"Gessica Alecci, Piotr Miska, Nadir Murru, Giuliano Romeo","title":"On alternative definition of Lucas atoms and their $p$-adic valuations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lucas atoms are irreducible factors of Lucas polynomials and they were\nintroduced in \\cite{ST}. The main aim of the authors was to investigate, from\nan innovatory point of view, when some combinatorial rational functions are\nactually polynomials. In this paper, we see that the Lucas atoms can be\nintroduced in a more natural and powerful way than the original definition,\nproviding straightforward proofs for their main properties. Moreover, we fully\ncharacterize the $p$-adic valuations of Lucas atoms for any prime $p$,\nanswering to a problem left open in \\cite{ST}, where the authors treated only\nsome specific cases for $p \\in \\{2, 3\\}$. Finally, we prove that the sequence\nof Lucas atoms is not holonomic, contrarily to the Lucas sequence that is a\nlinear recurrent sequence of order two.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:55:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alecci","Gessica",""],["Miska","Piotr",""],["Murru","Nadir",""],["Romeo","Giuliano",""]]}
{"id":"2308.10217","submitter":"Zhou Sicheng","authors":"Sicheng Zhou, Meng Wang, Jindou Jia, Kexin Guo, Xiang Yu, Youmin\n  Zhang, Lei Guo","title":"Fault Separation Based on An Excitation Operator with Application to a\n  Quadrotor UAV","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 an excitation operator based fault separation\narchitecture for a quadrotor unmanned aerial vehicle (UAV) subject to loss of\neffectiveness (LoE) faults, actuator aging, and load uncertainty. The actuator\nfault dynamics is deeply excavated, containing the deep coupling information\namong the actuator faults, the system states, and control inputs. By explicitly\nconsidering the physical constraints and tracking performance, an excitation\noperator and corresponding integrated state observer are designed to estimate\nseparately actuator fault and load uncertainty. Moreover, a fault separation\nmaneuver and a safety controller are proposed to ensure the tracking\nperformance when the excitation operator is injected. Both comparative\nsimulation and flight experiments have demonstrated the effectiveness of the\nproposed scheme while maintaining high levels of tracking performance.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:00:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Sicheng",""],["Wang","Meng",""],["Jia","Jindou",""],["Guo","Kexin",""],["Yu","Xiang",""],["Zhang","Youmin",""],["Guo","Lei",""]]}
{"id":"2308.10218","submitter":"Tarek Khalil","authors":"Tarek Khalil and Daniel Grucker","title":"Reformulating the NMR Quantum Mechanics Fundamental Aspects: Spin 1/2\n  Evolution in Magnetic Field Gradients","comments":"27 pages. arXiv admin note: text overlap with arXiv:1504.04882","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetization of a spin1/2 set is determined by means of their individual\nwave function. The theoretical treatment based on the fundamental axioms of\nquantum mechanics and solving explicitly Schr\\\"odinger equation gives the\nevolution of spin1/2 system driven by magnetic fields. In this work we consider\nthe energy of the spin system interacting with magnetic fields and all the\nother parts of the energy as a constant reservoir. Solving this complete\nHamiltonian can explain the measured sign change of nuclear spin noise spectra\ncompared to conventional NMR experiments and the possibility to make NMR images\nwithout radio frequency magnetic fields. The possibility to make NMR images\nwithout RF magnetic fields is an indication that entangled spin1/2 states can\nbe manipulated by magnetic field gradients, opening a new way to perform\nquantum computation by NMR.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:06:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khalil","Tarek",""],["Grucker","Daniel",""]]}
{"id":"2308.10219","submitter":"Kang Xian-Wei","authors":"Shuo-Ying Yu, Xian-Wei Kang","title":"Nature of $X(3872)$ from its radiative decay","comments":"12 pages, 1 figure","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":"  We study the radiative decay of $X(3872)$ based on the assumption that\n$X(3872)$ is regarded as a $c\\overline{c}$ charmonium with quantum number\n$J^{PC}=1^{++}$ ($J,\\,P,\\,C$ stand for spin, parity and charge conjugation,\nrespectively) in accordance with the Particle Data Group assignment. The form\nfactors of $X(3872)$ transitions to $J/\\psi\\gamma$ and $\\psi'\\gamma$ ($\\psi'$\ndenotes $\\psi(2S)$ throughout the paper) are calculated in the framework of the\ncovariant light-front quark model. The phenomenological wave function of a\nmeson depends on the parameter $\\beta$ which inverse essentially describes the\nconfinement scale. In the present work, the parameters $\\beta$ for the vector\n$J/\\psi$ and $\\psi'$ mesons will be determined through their decay constants\nwhich are from the experimental values of their partial decay widths to\nelectron-positron pair. As for $X(3872)$ we determine the value of $\\beta$ by\nthe decay width of $X(3872)\\rightarrow \\psi'\\gamma$. Then we examine the width\nof $X(3872)\\to J/\\psi\\gamma$ in a manner of parameter-free prediction and\nconfront it with the experimental value. Both of the hypothesises that\n$X(3872)$ is the $1P$ state or $2P$ state are considered, although the\npredicted $1P$ charmonium mass is significantly lower than the mass of\n$X(3872)$. It is found that one will encounter the inconsistency or\ncontradiction between the widths of $X(3872)\\to J/\\psi\\gamma$ and $X(3872)\\to\n\\psi'\\gamma$ if interpreting $X(3872)$ as a pure charmonium. We thus conclude\nthat $X(3872)$ can not be a pure $c\\overline c$ resonance and other components\nare necessary in its wave function.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:08:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Shuo-Ying",""],["Kang","Xian-Wei",""]]}
{"id":"2308.10220","submitter":"Danula Hettiachchi","authors":"Danula Hettiachchi, Kaixin Ji, Jenny Kennedy, Anthony McCosker, Flora\n  Dylis Salim, Mark Sanderson, Falk Scholer, Damiano Spina","title":"Designing and Evaluating Presentation Strategies for Fact-Checked\n  Content","comments":"Accepted to the 32nd ACM International Conference on Information and\n  Knowledge Management (CIKM '23)","journal-ref":null,"doi":"10.1145/3583780.3614841","report-no":null,"categories":"cs.IR cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid growth of online misinformation, it is crucial to have\nreliable fact-checking methods. Recent research on finding check-worthy claims\nand automated fact-checking have made significant advancements. However,\nlimited guidance exists regarding the presentation of fact-checked content to\neffectively convey verified information to users. We address this research gap\nby exploring the critical design elements in fact-checking reports and\ninvestigating whether credibility and presentation-based design improvements\ncan enhance users' ability to interpret the report accurately. We co-developed\npotential content presentation strategies through a workshop involving\nfact-checking professionals, communication experts, and researchers. The\nworkshop examined the significance and utility of elements such as veracity\nindicators and explored the feasibility of incorporating interactive components\nfor enhanced information disclosure. Building on the workshop outcomes, we\nconducted an online experiment involving 76 crowd workers to assess the\nefficacy of different design strategies. The results indicate that proposed\nstrategies significantly improve users' ability to accurately interpret the\nverdict of fact-checking articles. Our findings underscore the critical role of\neffective presentation of fact reports in addressing the spread of\nmisinformation. By adopting appropriate design enhancements, the effectiveness\nof fact-checking reports can be maximized, enabling users to make informed\njudgments.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:08:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hettiachchi","Danula",""],["Ji","Kaixin",""],["Kennedy","Jenny",""],["McCosker","Anthony",""],["Salim","Flora Dylis",""],["Sanderson","Mark",""],["Scholer","Falk",""],["Spina","Damiano",""]]}
{"id":"2308.10221","submitter":"Kin Ming Hui","authors":"Kin Ming Hui","title":"Existence and uniqueness of the singular self-similar solutions of the\n  fast diffusion equation and logarithmic diffusion equation","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $n\\ge 3$, $0<m<\\frac{n-2}{n}$, $\\rho_1>0$, $\\eta>0$,\n$\\beta>\\frac{m\\rho_1}{n-2-nm}$, $\\alpha=\\alpha_m=\\frac{2\\beta+\\rho_1}{1-m}$,\n$\\beta_0>0$ and $\\alpha_0=2\\beta_0+1$. We use fixed point argument to give a\nnew proof for the existence and uniqueness of radially symmetric singular\nsolution $f=f^{(m)}$ of the elliptic equation $\\Delta (f^m/m)+\\alpha f+\\beta\nx\\cdot\\nabla f=0$, $f>0$, in $\\mathbb{R}^n\\setminus\\{0\\}$, satisfying\n$\\displaystyle\\lim_{|x|\\to 0}|x|^{\\alpha/\\beta}f(x)=\\eta$. We also prove the\nexistence and uniqueness of radially symmetric singular solution $g$ of the\nequation $\\Delta\\log g+\\alpha_0 g+\\beta_0x\\cdot\\nabla g=0$, $g>0$, in\n$\\mathbb{R}^n\\setminus\\{0\\}$, satisfying $\\displaystyle\\lim_{|x|\\to\n0}|x|^{\\alpha_0/\\beta_0}g(x)=\\eta$. Such equations arises from the study of\nbackward singular self-similar solution of the fast diffusion equation\n$u_t=\\Delta u^m$ and the logarithmic diffusion equation $u_t=\\Delta\\log u$\nrespectively. We will also prove that $f$ satisfies\n$\\underset{\\substack{|x|\\to\\infty}}{\\lim}|x|^2f(x)^{1-m}=\\frac{2(n-2-nm)}{(1-m)\\rho_1}$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:10:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hui","Kin Ming",""]]}
{"id":"2308.10222","submitter":"Cristiana De Filippis","authors":"Cristiana De Filippis, Giuseppe Mingione","title":"Regularity for double phase problems at nearly linear growth","comments":"50 pages","journal-ref":"Arch. Ration. Mech. Anal. 247:85, (2023)","doi":"10.1007/s00205-023-01907-3","report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Minima of functionals of the type $$ w\\mapsto\n\\int_{\\Omega}\\left[\\snr{Dw}\\log(1+\\snr{Dw})+a(x)\\snr{Dw}^{q}\\right] \\dx\\,,\n\\quad 0\\leq a(\\cdot) \\in C^{0, \\alpha}\\,,$$ with $\\Omega \\subset \\er^n$, have\nlocally H\\\"older continuous gradient provided $1 < q < 1+\\alpha/n$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:11:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["De Filippis","Cristiana",""],["Mingione","Giuseppe",""]]}
{"id":"2308.10223","submitter":"Javier Arg\\\"uello-Luengo","authors":"Javier Arg\\\"uello-Luengo, Javier Rivera-Dean, Philipp Stammer, Andrew\n  S. Maxwell, David M. Weld, Marcelo F. Ciappina and Maciej Lewenstein","title":"Analog simulation of high harmonic generation in atoms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The demanding experimental access to the ultrafast dynamics of materials\nchallenges our understanding of their electronic response to applied strong\nlaser fields. In this work, we show that trapped ultracold atoms with highly\ncontrollable potentials can become an enabling tool to describe phenomena in a\nscenario where some effects are more easily accessible and twelve orders of\nmagnitude slower. For this purpose, we characterize the mapping between the\nattoscience platform and atomic simulators, and propose an experimental\nprotocol to simulate the emission yield of High Harmonic Generation, a regime\nthat has so far been elusive to cold atom simulation. As we illustrate, the\nbenchmark offered by these simulators can provide new insights on the\nconversion efficiency of extended and short nuclear potentials, as well as the\nresponse to applied elliptical polarized fields or ultrashort few-cycle pulses.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:22:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Arg\u00fcello-Luengo","Javier",""],["Rivera-Dean","Javier",""],["Stammer","Philipp",""],["Maxwell","Andrew S.",""],["Weld","David M.",""],["Ciappina","Marcelo F.",""],["Lewenstein","Maciej",""]]}
{"id":"2308.10224","submitter":"Annah Ondieki","authors":"Annah M. Ondieki, Zephania Birech, Kenneth A. Kaduki, Peter W. Mwangi,\n  Moses Juma","title":"Label-free assaying of testosterone and growth hormones in blood using\n  surface-enhanced raman spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.optics","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This work reports the potential use of surface enhanced Raman spectroscopy\n(SERS) in rapid, label-free assaying of testosterone (TE) and growth hormone\n(GH) in whole blood. Biomarker SERS spectral bands from the two hormones (TE\nand GH) in intentionally spiked water for injection and in male Sprague-Dawley\n(SD) rat blood are reported. Abuse of the two hormones (TE and GH) singly or\nsimultaneously is widespread and not only has prolonged side effects such as\nhypertension and liver failure, but their illegal use by athletes is against\nclean competition. Currently used highly label-dependent doping detection\nmethods involve complex and time-consuming procedures, rendering them\nunsuitable for rapid analysis. In blood, the most concentration-sensitive bands\n(in both TE and GH), as deduced through Principal Component Analysis (PCA) and\nAnalysis of Variance (ANOVA), were around 684 cm-1 (assigned to C-C stretching)\nand 1614 cm-1 (assigned to C-C stretching) in GH; and 786 cm-1 (assigned to N-H\nwagging), 856 cm-1 (assigned to C-C stretching), and 1490 cm-1 (assigned to CH2\nbending) in TE. In addition, a characteristic variance was noted in the bands\naround 1510 cm-1 (attributable to CH2 stretching) in GH and 1636 cm-1 (C-C\nstretching) in TE, which could be used as biomarker bands for the respective\nhormones in the blood. This work has shown the capability of SERS for potential\nhormone concentration level determination when concentration-sensitive or\nbiomarker bands are employed. This discovery opens new possibilities for the\nuse of SERS in fields such as sports science, clinical diagnostics, and\nbiomedical research.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:22:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ondieki","Annah M.",""],["Birech","Zephania",""],["Kaduki","Kenneth A.",""],["Mwangi","Peter W.",""],["Juma","Moses",""]]}
{"id":"2308.10225","submitter":"Cyril Closset","authors":"Cyril Closset and Horia Magureanu","title":"Reading between the rational sections: Global structures of 4d\n  $\\mathcal{N}=2$ KK theories","comments":"60 pages plus appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study how the global structure of rank-one 4d $\\mathcal{N}=2$\nsupersymmetric field theories is encoded into global aspects of the\nSeiberg-Witten elliptic fibration. Starting with the prototypical example of\nthe $\\mathfrak{su}(2)$ gauge theory, we distinguish between relative and\nabsolute Seiberg-Witten curves. For instance, we discuss in detail the three\ndistinct absolute curves for the $SU(2)$ and $SO(3)_\\pm$ 4d $\\mathcal{N}=2$\ngauge theories. We propose that the $1$-form symmetry of an absolute theory is\nisomorphic to a torsion subgroup of the Mordell-Weil group of sections of the\nabsolute curve, while the full defect group of the theory is encoded in the\ntorsion sections of a so-called relative curve. We explicitly show that the\nrelative and absolute curves are related by isogenies (that is, homomorphisms\nof elliptic curves) generated by torsion sections -- hence, gauging a one-form\nsymmetry corresponds to composing isogenies between Seiberg-Witten curves. We\napply this approach to Kaluza-Klein (KK) 4d $\\mathcal{N}=2$ theories that arise\nfrom toroidal compactifications of 5d and 6d SCFTs to four dimensions,\nuncovering an intricate pattern of 4d global structures obtained by gauging\ndiscrete $0$-form and/or $1$-form symmetries. Incidentally, we propose a 6d BPS\nquiver for the 6d M-string theory on $\\mathbb{R}^4\\times T^2$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:35:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Closset","Cyril",""],["Magureanu","Horia",""]]}
{"id":"2308.10226","submitter":"Jakob Weissteiner","authors":"Ermis Soumalias, Jakob Weissteiner, Jakob Heiss, Sven Seuken","title":"Machine Learning-powered Combinatorial Clock Auction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the design of iterative combinatorial auctions (ICAs). The main\nchallenge in this domain is that the bundle space grows exponentially in the\nnumber of items. To address this, several papers have recently proposed machine\nlearning (ML)-based preference elicitation algorithms that aim to elicit only\nthe most important information from bidders. However, from a practical point of\nview, the main shortcoming of this prior work is that those designs elicit\nbidders' preferences via value queries (i.e., ``What is your value for the\nbundle $\\{A,B\\}$?''). In most real-world ICA domains, value queries are\nconsidered impractical, since they impose an unrealistically high cognitive\nburden on bidders, which is why they are not used in practice. In this paper,\nwe address this shortcoming by designing an ML-powered combinatorial clock\nauction that elicits information from the bidders only via demand queries\n(i.e., ``At prices $p$, what is your most preferred bundle of items?''). We\nmake two key technical contributions: First, we present a novel method for\ntraining an ML model on demand queries. Second, based on those trained ML\nmodels, we introduce an efficient method for determining the demand query with\nthe highest clearing potential, for which we also provide a theoretical\nfoundation. We experimentally evaluate our ML-based demand query mechanism in\nseveral spectrum auction domains and compare it against the most established\nreal-world ICA: the combinatorial clock auction (CCA). Our mechanism\nsignificantly outperforms the CCA in terms of efficiency in all domains, it\nachieves higher efficiency in a significantly reduced number of rounds, and,\nusing linear prices, it exhibits vastly higher clearing potential. Thus, with\nthis paper we bridge the gap between research and practice and propose the\nfirst practical ML-powered ICA.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:43:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Soumalias","Ermis",""],["Weissteiner","Jakob",""],["Heiss","Jakob",""],["Seuken","Sven",""]]}
{"id":"2308.10227","submitter":"Mingyuan Huang","authors":"Jiachi Chen, Mingyuan Huang, Zewei Lin, Peilin Zheng and Zibin Zheng","title":"To Healthier Ethereum: A Comprehensive and Iterative Smart Contract\n  Weakness Enumeration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increasing popularity of cryptocurrencies and blockchain technology,\nsmart contracts have become a prominent feature in developing decentralized\napplications. However, these smart contracts are susceptible to vulnerabilities\nthat hackers can exploit, resulting in significant financial losses. In\nresponse to this growing concern, various initiatives have emerged. Notably,\nthe SWC vulnerability list played an important role in raising awareness and\nunderstanding of smart contract weaknesses. However, the SWC list lacks\nmaintenance and has not been updated with new vulnerabilities since 2020. To\naddress this gap, this paper introduces the Smart Contract Weakness Enumeration\n(SWE), a comprehensive and practical vulnerability list up until 2023. We\ncollect 273 vulnerability descriptions from 86 top conference papers and\njournal papers, employing open card sorting techniques to deduplicate and\ncategorize these descriptions. This process results in the identification of 40\ncommon contract weaknesses, which are further classified into 20 sub-research\nfields through thorough discussion and analysis. SWE provides a systematic and\ncomprehensive list of smart contract vulnerabilities, covering existing and\nemerging vulnerabilities in the last few years. Moreover, SWE is a scalable,\ncontinuously iterative program. We propose two update mechanisms for the\nmaintenance of SWE. Regular updates involve the inclusion of new\nvulnerabilities from future top papers, while irregular updates enable\nindividuals to report new weaknesses for review and potential addition to SWE.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:46:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Jiachi",""],["Huang","Mingyuan",""],["Lin","Zewei",""],["Zheng","Peilin",""],["Zheng","Zibin",""]]}
{"id":"2308.10228","submitter":"Xiangyu Zhang","authors":"Xiangyu Zhang, Lingling Fan, Sen Chen, Yucheng Su, Boyuan Li","title":"Scene-Driven Exploration and GUI Modeling for Android Apps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CR cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to the competitive environment, mobile apps are usually produced under\npressure with lots of complicated functionality and UI pages. Therefore, it is\nchallenging for various roles to design, understand, test, and maintain these\napps. The extracted transition graphs for apps such as ATG, WTG, and STG have a\nlow transition coverage and coarse-grained granularity, which limits the\nexisting methods of graphical user interface (GUI) modeling by UI exploration.\nTo solve these problems, in this paper, we propose SceneDroid, a scene-driven\nexploration approach to extracting the GUI scenes dynamically by integrating a\nseries of novel techniques including smart exploration, state fuzzing, and\nindirect launching strategies. We present the GUI scenes as a scene transition\ngraph (SceneTG) to model the GUI of apps with high transition coverage and\nfine? grained granularity. Compared with the existing GUI modeling tools,\nSceneDroid has improved by 168.74% in the coverage of transition pairs and\n162.42% in scene extraction. Apart from the effectiveness evaluation of\nSceneDroid, we also illustrate the future potential of SceneDroid as a\nfundamental capability to support app development, reverse engineering, and GUI\nregression testing.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 10:54:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Xiangyu",""],["Fan","Lingling",""],["Chen","Sen",""],["Su","Yucheng",""],["Li","Boyuan",""]]}
{"id":"2308.10229","submitter":"Filippo Spaggiari","authors":"Filippo Spaggiari","title":"Coloring Torus Knots by Conjugation Quandles","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the first part of this paper, we present general results concerning the\ncolorability of torus knots using conjugation quandles over any abstract group.\nSubsequently, we offer a numerical characterization for the colorability of\ntorus knots using conjugation quandles over some particular groups, such as the\nmatrix groups $GL(2,q)$ and $SL(2,q)$, the dihedral group, and the symmetric\ngroup.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:09:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Spaggiari","Filippo",""]]}
{"id":"2308.10230","submitter":"Bowe Xu","authors":"Bowei Xu, Hao Chen and Zhan Ma","title":"Karma: Adaptive Video Streaming via Causal Sequence Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optimal adaptive bitrate (ABR) decision depends on a comprehensive\ncharacterization of state transitions that involve interrelated modalities over\ntime including environmental observations, returns, and actions. However,\nstate-of-the-art learning-based ABR algorithms solely rely on past observations\nto decide the next action. This paradigm tends to cause a chain of deviations\nfrom optimal action when encountering unfamiliar observations, which\nconsequently undermines the model generalization. This paper presents Karma, an\nABR algorithm that utilizes causal sequence modeling to improve generalization\nby comprehending the interrelated causality among past observations, returns,\nand actions and timely refining action when deviation occurs. Unlike direct\nobservation-to-action mapping, Karma recurrently maintains a multi-dimensional\ntime series of observations, returns, and actions as input and employs causal\nsequence modeling via a decision transformer to determine the next action. In\nthe input sequence, Karma uses the maximum cumulative future quality of\nexperience (QoE) (a.k.a, QoE-to-go) as an extended return signal, which is\nperiodically estimated based on current network conditions and playback status.\nWe evaluate Karma through trace-driven simulations and real-world field tests,\ndemonstrating superior performance compared to existing state-of-the-art ABR\nalgorithms, with an average QoE improvement ranging from 10.8% to 18.7% across\ndiverse network conditions. Furthermore, Karma exhibits strong generalization\ncapabilities, showing leading performance under unseen networks in both\nsimulations and real-world tests.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:25:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Bowei",""],["Chen","Hao",""],["Ma","Zhan",""]]}
{"id":"2308.10231","submitter":"Luca Rossini","authors":"Matteo Iacopini and Eoghan O'Neill and Luca Rossini","title":"Static and Dynamic BART for Rank-Order Data","comments":"The Supplementary Material is available upon request to the authors","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.CO stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ranking lists are often provided at regular time intervals by one or multiple\nrankers in a range of applications, including sports, marketing, and politics.\nMost popular methods for rank-order data postulate a linear specification for\nthe latent scores, which determine the observed ranks, and ignore the temporal\ndependence of the ranking lists. To address these issues, novel nonparametric\nstatic (ROBART) and autoregressive (ARROBART) models are introduced, with\nlatent scores defined as nonlinear Bayesian additive regression tree functions\nof covariates. To make inferences in the dynamic ARROBART model, closed-form\nfiltering, predictive, and smoothing distributions for the latent time-varying\nscores are derived. These results are applied in a Gibbs sampler with data\naugmentation for posterior inference. The proposed methods are shown to\noutperform existing competitors in simulation studies, and the advantages of\nthe dynamic model are demonstrated by forecasts of weekly pollster rankings of\nNCAA football teams.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:26:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Iacopini","Matteo",""],["O'Neill","Eoghan",""],["Rossini","Luca",""]]}
{"id":"2308.10232","submitter":"Tejas Iyer","authors":"Luisa Andreis, Tejas Iyer, Elena Magnanini","title":"Gelation, hydrodynamic limits and uniqueness in cluster coagulation\n  processes","comments":"43 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.AP math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of gelation in the cluster coagulation model\nintroduced by Norris [$\\textit{Comm. Math. Phys.}$, 209(2):407-435 (2000)],\nwhere clusters take values in a measure space $E$, and merge to form a new\nparticle $z$ according to a transition kernel $K(x,y, \\mathrm{d} z)$. This\nmodel is general enough to incorporate various inhomogenieties in the evolution\nof clusters, for example, their shape, or their location in space. We derive\ngeneral, sufficient criteria for stochastic gelation in this model, and for\ntrajectories associated with this process to concentrate among solutions of a\ngeneralisation of the Flory equation; thus providing sufficient criteria for\nthe equation to have gelling solutions. As particular cases, we extend results\nrelated to the classical Marcus-Lushnikov coagulation process and Smoluchowski\ncoagulation equation, showing that reasonable `homogenous' coagulation\nprocesses with exponent $\\gamma>1$ yield gelation; and also, coagulation\nprocesses with kernel $\\alpha(m,n)~\\geq~(m \\wedge n) \\log{(m \\wedge n)}^{3\n+\\varepsilon}$ for $\\varepsilon>0$. In another special case, we prove a law of\nlarge numbers for the trajectory of the empirical measure of the stochastic\ncluster coagulation process, by means of a uniqueness result for the solution\nof the aforementioned generalised Flory equation. Finally, we use coupling\narguments with inhomogeneous random graphs to deduce sufficient criterion for\nstrong gelation (the emergence of a particle of size $O(N)$).\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:37:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Andreis","Luisa",""],["Iyer","Tejas",""],["Magnanini","Elena",""]]}
{"id":"2308.10233","submitter":"Xiang Yu","authors":"Xiang Yu and Yibin Fu","title":"On the incremental equations in surface elasticity","comments":"26 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive the incremental equations for a hyperelastic solid that incorporate\nsurface tension effect by assuming that the surface energy is a general\nfunction of the surface deformation gradient. The incremental equations take\nthe same simple form as their purely mechanical counterparts and are valid for\nany geometry. In particular, for isotropic materials, the extra surface elastic\nmoduli are expressed in terms of the surface energy function and the two\nsurface principal stretches. The effectiveness of the resulting incremental\ntheory is illustrated by applying it to study the Plateau--Rayleigh and Wilkes\ninstabilities in a solid cylinder.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:38:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Xiang",""],["Fu","Yibin",""]]}
{"id":"2308.10234","submitter":"Tianyue Zheng","authors":"Jingzhi Hu, Tianyue Zheng, Zhe Chen, Hongbo Wang, Jun Luo","title":"MUSE-Fi: Contactless MUti-person SEnsing Exploiting Near-field Wi-Fi\n  Channel Variation","comments":"15 pages. Accepted by ACM MobiCom 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Having been studied for more than a decade, Wi-Fi human sensing still faces a\nmajor challenge in the presence of multiple persons, simply because the limited\nbandwidth of Wi-Fi fails to provide a sufficient range resolution to physically\nseparate multiple subjects. Existing solutions mostly avoid this challenge by\nswitching to radars with GHz bandwidth, at the cost of cumbersome deployments.\nTherefore, could Wi-Fi human sensing handle multiple subjects remains an open\nquestion. This paper presents MUSE-Fi, the first Wi-Fi multi-person sensing\nsystem with physical separability. The principle behind MUSE-Fi is that, given\na Wi-Fi device (e.g., smartphone) very close to a subject, the near-field\nchannel variation caused by the subject significantly overwhelms variations\ncaused by other distant subjects. Consequently, focusing on the channel state\ninformation (CSI) carried by the traffic in and out of this device naturally\nallows for physically separating multiple subjects. Based on this principle, we\npropose three sensing strategies for MUSE-Fi: i) uplink CSI, ii) downlink CSI,\nand iii) downlink beamforming feedback, where we specifically tackle signal\nrecovery from sparse (per-user) traffic under realistic multi-user\ncommunication scenarios. Our extensive evaluations clearly demonstrate that\nMUSE-Fi is able to successfully handle multi-person sensing with respect to\nthree typical applications: respiration monitoring, gesture detection, and\nactivity recognition.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:39:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Jingzhi",""],["Zheng","Tianyue",""],["Chen","Zhe",""],["Wang","Hongbo",""],["Luo","Jun",""]]}
{"id":"2308.10235","submitter":"Xiao Jin","authors":"Xiao Jin, Yichi Shen, Loo Hay Lee, Christine A. Shoemaker","title":"Contextual Optimizer through Neighborhood Estimation for prescriptive\n  analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the challenges posed by heteroscedastic noise in contextual\ndecision-making. We propose a consistent Shrinking Neighborhood Estimation\n(SNE) technique that successfully estimates contextual performance under\nunpredictable variances. Furthermore, we propose a Rate-Efficient Sampling rule\ndesigned to enhance the performance of the SNE. The effectiveness of the\ncombined solution ``Contextual Optimizer through Neighborhood Estimation\"(CONE)\nis validated through theorems and numerical benchmarking. The methodologies\nhave been further deployed to address a staffing challenge in a hospital call\ncenter, exemplifying their substantial impact and practical utility in\nreal-world scenarios.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:43:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jin","Xiao",""],["Shen","Yichi",""],["Lee","Loo Hay",""],["Shoemaker","Christine A.",""]]}
{"id":"2308.10236","submitter":"Faris Almalik","authors":"Naif Alkhunaizi, Koushik Srivatsan, Faris Almalik, Ibrahim Almakky,\n  Karthik Nandakumar","title":"FedSIS: Federated Split Learning with Intermediate Representation\n  Sampling for Privacy-preserving Generalized Face Presentation Attack\n  Detection","comments":"Accepted to the IEEE International Joint Conference on Biometrics\n  (IJCB), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lack of generalization to unseen domains/attacks is the Achilles heel of most\nface presentation attack detection (FacePAD) algorithms. Existing attempts to\nenhance the generalizability of FacePAD solutions assume that data from\nmultiple source domains are available with a single entity to enable\ncentralized training. In practice, data from different source domains may be\ncollected by diverse entities, who are often unable to share their data due to\nlegal and privacy constraints. While collaborative learning paradigms such as\nfederated learning (FL) can overcome this problem, standard FL methods are\nill-suited for domain generalization because they struggle to surmount the twin\nchallenges of handling non-iid client data distributions during training and\ngeneralizing to unseen domains during inference. In this work, a novel\nframework called Federated Split learning with Intermediate representation\nSampling (FedSIS) is introduced for privacy-preserving domain generalization.\nIn FedSIS, a hybrid Vision Transformer (ViT) architecture is learned using a\ncombination of FL and split learning to achieve robustness against statistical\nheterogeneity in the client data distributions without any sharing of raw data\n(thereby preserving privacy). To further improve generalization to unseen\ndomains, a novel feature augmentation strategy called intermediate\nrepresentation sampling is employed, and discriminative information from\nintermediate blocks of a ViT is distilled using a shared adapter network. The\nFedSIS approach has been evaluated on two well-known benchmarks for\ncross-domain FacePAD to demonstrate that it is possible to achieve\nstate-of-the-art generalization performance without data sharing. Code:\nhttps://github.com/Naiftt/FedSIS\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:49:12 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 16:09:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Alkhunaizi","Naif",""],["Srivatsan","Koushik",""],["Almalik","Faris",""],["Almakky","Ibrahim",""],["Nandakumar","Karthik",""]]}
{"id":"2308.10237","submitter":"Emre Tuna","authors":"S. Emre Tuna","title":"Synchronization via impulsive deadbeat coupling","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For linear networks, where the coupling between the agents takes place\nthrough periodic impulses, a simple method is proposed for synchronization. It\nis shown that closing the loop by (normalized) deadbeat feedback gain produces\nsynchronous behavior if the coupling strength $\\mu$ is large enough. With such\nchoice of control law, in the limiting case ($\\mu\\to\\infty$) exact\nsynchronization is achieved after $n$ periods, where $n$ is the order of\nindividual agent dynamics.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:52:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tuna","S. Emre",""]]}
{"id":"2308.10238","submitter":"Shintaro Nakamura","authors":"Shintaro Nakamura, Masashi Sugiyama","title":"Thompson Sampling for Real-Valued Combinatorial Pure Exploration of\n  Multi-Armed Bandit","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 study the real-valued combinatorial pure exploration of the multi-armed\nbandit (R-CPE-MAB) problem. In R-CPE-MAB, a player is given $d$ stochastic\narms, and the reward of each arm $s\\in\\{1, \\ldots, d\\}$ follows an unknown\ndistribution with mean $\\mu_s$. In each time step, a player pulls a single arm\nand observes its reward. The player's goal is to identify the optimal\n\\emph{action} $\\boldsymbol{\\pi}^{*} = \\argmax_{\\boldsymbol{\\pi} \\in\n\\mathcal{A}} \\boldsymbol{\\mu}^{\\top}\\boldsymbol{\\pi}$ from a finite-sized\nreal-valued \\emph{action set} $\\mathcal{A}\\subset \\mathbb{R}^{d}$ with as few\narm pulls as possible. Previous methods in the R-CPE-MAB assume that the size\nof the action set $\\mathcal{A}$ is polynomial in $d$. We introduce an algorithm\nnamed the Generalized Thompson Sampling Explore (GenTS-Explore) algorithm,\nwhich is the first algorithm that can work even when the size of the action set\nis exponentially large in $d$. We also introduce a novel problem-dependent\nsample complexity lower bound of the R-CPE-MAB problem, and show that the\nGenTS-Explore algorithm achieves the optimal sample complexity up to a\nproblem-dependent constant factor.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:56:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nakamura","Shintaro",""],["Sugiyama","Masashi",""]]}
{"id":"2308.10239","submitter":"Ji Zhang","authors":"Ji Zhang, Lianli Gao, Bingguang Hao, Hao Huang, Jingkuan Song, Hengtao\n  Shen","title":"From Global to Local: Multi-scale Out-of-distribution Detection","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Out-of-distribution (OOD) detection aims to detect \"unknown\" data whose\nlabels have not been seen during the in-distribution (ID) training process.\nRecent progress in representation learning gives rise to distance-based OOD\ndetection that recognizes inputs as ID/OOD according to their relative\ndistances to the training data of ID classes. Previous approaches calculate\npairwise distances relying only on global image representations, which can be\nsub-optimal as the inevitable background clutter and intra-class variation may\ndrive image-level representations from the same ID class far apart in a given\nrepresentation space. In this work, we overcome this challenge by proposing\nMulti-scale OOD DEtection (MODE), a first framework leveraging both global\nvisual information and local region details of images to maximally benefit OOD\ndetection. Specifically, we first find that existing models pretrained by\noff-the-shelf cross-entropy or contrastive losses are incompetent to capture\nvaluable local representations for MODE, due to the scale-discrepancy between\nthe ID training and OOD detection processes. To mitigate this issue and\nencourage locally discriminative representations in ID training, we propose\nAttention-based Local PropAgation (ALPA), a trainable objective that exploits a\ncross-attention mechanism to align and highlight the local regions of the\ntarget objects for pairwise examples. During test-time OOD detection, a\nCross-Scale Decision (CSD) function is further devised on the most\ndiscriminative multi-scale representations to distinguish ID/OOD data more\nfaithfully. We demonstrate the effectiveness and flexibility of MODE on several\nbenchmarks -- on average, MODE outperforms the previous state-of-the-art by up\nto 19.24% in FPR, 2.77% in AUROC. Code is available at\nhttps://github.com/JimZAI/MODE-OOD.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 11:56:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Ji",""],["Gao","Lianli",""],["Hao","Bingguang",""],["Huang","Hao",""],["Song","Jingkuan",""],["Shen","Hengtao",""]]}
{"id":"2308.10240","submitter":"Jiawei Zhang","authors":"Yiming Huang, Aozhe Jia, Xiaodan Zhang, Jiawei Zhang","title":"Generic Attention-model Explainability by Weighted Relevance\n  Accumulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Attention-based transformer models have achieved remarkable progress in\nmulti-modal tasks, such as visual question answering. The explainability of\nattention-based methods has recently attracted wide interest as it can explain\nthe inner changes of attention tokens by accumulating relevancy across\nattention layers. Current methods simply update relevancy by equally\naccumulating the token relevancy before and after the attention processes.\nHowever, the importance of token values is usually different during relevance\naccumulation. In this paper, we propose a weighted relevancy strategy, which\ntakes the importance of token values into consideration, to reduce distortion\nwhen equally accumulating relevance. To evaluate our method, we propose a\nunified CLIP-based two-stage model, named CLIPmapper, to process\nVision-and-Language tasks through CLIP encoder and a following mapper.\nCLIPmapper consists of self-attention, cross-attention, single-modality, and\ncross-modality attention, thus it is more suitable for evaluating our generic\nexplainability method. Extensive perturbation tests on visual question\nanswering and image captioning validate that our explainability method\noutperforms existing methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:02:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Yiming",""],["Jia","Aozhe",""],["Zhang","Xiaodan",""],["Zhang","Jiawei",""]]}
{"id":"2308.10241","submitter":"Art Waeterschoot","authors":"Enis Kaya, Micha\\\"el Maex and Art Waeterschoot","title":"Jumps of Jacobians via orthogonal canonical forms","comments":"11 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a smooth, proper curve $C$ over a discretely valued field $k$, we equip\nthe $k$-vector space $H^{0}(C,\\omega_{C/k})$ with a canonical discrete\nvaluation $v_{\\mathrm{can}}$ which measures how canonical forms degenerate on\nregular integral models of $C$. More precisely, $v_{\\mathrm{can}}$ maps a\ncanonical form to the minimal value of its associated weight function, as\nintroduced by Musta\\c{t}\\u{a}--Nicaise. Our main result states that\n$v_{\\mathrm{can}}$ computes Edixhoven's jumps of the Jacobian of $C$ when\nevaluated in an orthogonal basis. As a byproduct, we deduce a short proof for\nthe rationality of the jumps of Jacobians. We also show how $v_{\\mathrm{can}}$\nand the jumps can be computed efficiently for the class of $\\Delta_v$-regular\ncurves.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:02:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaya","Enis",""],["Maex","Micha\u00ebl",""],["Waeterschoot","Art",""]]}
{"id":"2308.10242","submitter":"Xiaoji Zhou","authors":"Guoling Yin, Lingchii Kong, Zhongcheng Yu, Jinyuan Tian, Xuzong Chen,\n  and Xiaoji Zhou","title":"Time bound of atomic adiabatic evolution in the accelerated optical\n  lattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accelerated optical lattice has emerged as a valuable technique for the\ninvestigation of quantum transport physics and has found widespread application\nin quantum sensing, including atomic gravimeters and atomic gyroscopes. In our\nstudy, we focus on the adiabatic evolution of ultra-cold atoms within an\naccelerated optical lattice. Specifically, we derive a time bound that delimits\nthe duration of atomic adiabatic evolution in the oscillating system under\nconsideration. To experimentally substantiate the theoretical predictions,\nprecise measurements to instantaneous band populations were conducted within a\none-dimensional accelerated optical lattice, encompassing systematic variations\nin both lattice's depths and accelerations. The obtained experimental results\ndemonstrate a quantitatively consistent correspondence with the anticipated\ntheoretical expressions. Afterwards, the atomic velocity distributions are also\nmeasured to compare with the time bound. This research offers a quantitative\nframework for the selection of parameters that ensure atom trapped throughout\nthe acceleration process. Moreover, it contributes an experimental criterion by\nwhich to assess the adequacy of adiabatic conditions in an oscillating system,\nthereby augmenting the current understanding of these systems from a\ntheoretical perspective.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:05:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yin","Guoling",""],["Kong","Lingchii",""],["Yu","Zhongcheng",""],["Tian","Jinyuan",""],["Chen","Xuzong",""],["Zhou","Xiaoji",""]]}
{"id":"2308.10243","submitter":"Chenwei Wang","authors":"Chenwei Wang, Siyi Luo, Yulin Huang, Jifang Pei, Yin Zhang and Jianyu\n  Yang","title":"SAR ATR Method with Limited Training Data via an Embedded Feature\n  Augmenter and Dynamic Hierarchical-Feature Refiner","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Without sufficient data, the quantity of information available for supervised\ntraining is constrained, as obtaining sufficient synthetic aperture radar (SAR)\ntraining data in practice is frequently challenging. Therefore, current SAR\nautomatic target recognition (ATR) algorithms perform poorly with limited\ntraining data availability, resulting in a critical need to increase SAR ATR\nperformance. In this study, a new method to improve SAR ATR when training data\nare limited is proposed. First, an embedded feature augmenter is designed to\nenhance the extracted virtual features located far away from the class center.\nBased on the relative distribution of the features, the algorithm pulls the\ncorresponding virtual features with different strengths toward the\ncorresponding class center. The designed augmenter increases the amount of\ninformation available for supervised training and improves the separability of\nthe extracted features. Second, a dynamic hierarchical-feature refiner is\nproposed to capture the discriminative local features of the samples. Through\ndynamically generated kernels, the proposed refiner integrates the\ndiscriminative local features of different dimensions into the global features,\nfurther enhancing the inner-class compactness and inter-class separability of\nthe extracted features. The proposed method not only increases the amount of\ninformation available for supervised training but also extracts the\ndiscriminative features from the samples, resulting in superior ATR performance\nin problems with limited SAR training data. Experimental results on the moving\nand stationary target acquisition and recognition (MSTAR), OpenSARShip, and\nFUSAR-Ship benchmark datasets demonstrate the robustness and outstanding ATR\nperformance of the proposed method in response to limited SAR training data.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:13:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chenwei",""],["Luo","Siyi",""],["Huang","Yulin",""],["Pei","Jifang",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.10244","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi, Navid Nezafati","title":"Navigating the acceptance of implementing business intelligence in\n  organizations: A system dynamics approach","comments":null,"journal-ref":"Telematics and Informatics Reports, Volume 11, 2023, 100070","doi":"10.1016/j.teler.2023.100070","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rise of information technology has transformed the business landscape,\nwith organizations increasingly relying on information systems to collect and\nstore vast amounts of data. To stay competitive, businesses must harness this\ndata to make informed decisions that optimize their actions in response to the\nmarket. Business intelligence (BI) is an approach that enables organizations to\nleverage data-driven insights for better decision-making, but implementing BI\ncomes with its own set of challenges. Accordingly, understanding the key\nfactors that contribute to successful implementation is crucial.\n  This study examines the factors affecting the implementation of BI projects\nby analyzing the interactions between these factors using system dynamics\nmodeling. The research draws on interviews with five BI experts and a review of\nthe background literature to identify effective implementation strategies.\nSpecifically, the study compares traditional and self-service implementation\napproaches and simulates their respective impacts on organizational acceptance\nof BI. The results show that the two approaches were equally effective in\ngenerating organizational acceptance until the twenty-fifth month of\nimplementation, after which the self-service strategy generated significantly\nhigher levels of acceptance than the traditional strategy. In fact, after 60\nmonths, the self-service approach was associated with a 30% increase in\norganizational acceptance over the traditional approach. The paper also\nprovides recommendations for increasing the acceptance of BI in both\nimplementation strategies. Overall, this study underscores the importance of\nidentifying and addressing key factors that impact BI implementation success,\noffering practical guidance to organizations seeking to leverage the power of\nBI in today's competitive business environment.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:14:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maghsoudi","Mehrdad",""],["Nezafati","Navid",""]]}
{"id":"2308.10245","submitter":"Christian Reiher","authors":"Christian Reiher and Tomasz Schoen","title":"Note on the Theorem of Balog, Szemer\\'edi, and Gowers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that every additive set $A$ with energy $E(A)\\ge |A|^3/K$ has a\nsubset $A'\\subseteq A$ of size $|A'|\\ge (1-\\varepsilon)K^{-1/2}|A|$ such that\n$|A'-A'|\\le O_\\varepsilon(K^{4}|A'|)$. This is, essentially, the largest\nstructured set one can get in the Balog-Szemer\\'edi-Gowers theorem.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:17:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Reiher","Christian",""],["Schoen","Tomasz",""]]}
{"id":"2308.10246","submitter":"Arindam Jana","authors":"Eknath Ghate and Arindam Jana","title":"Modular induced representations of $\\mathrm{GL}_2(\\mathbb F_q)$ as\n  cokernels of symmetric power representations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that induced representations of $\\mathrm{GL}_2({\\mathbb F}_q)$ of\nhigher dimensional representations can be written as cokernels of operators\nacting on symmetric power representations of $\\mathrm{GL}_2({\\mathbb F}_q)$.\nWhen the induction is from the Borel subgroup, respectively the anisotropic\ntorus, the operators involve multiplication by newly defined twisted Dickson\npolynomials, respectively, twisted Serre operators. Our isomorphisms are\nexplicitly defined using differential operators. As a corollary, we improve\nsome periodicity results for quotients in the theta filtration.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:19:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghate","Eknath",""],["Jana","Arindam",""]]}
{"id":"2308.10247","submitter":"Chenwei Wang","authors":"Chenwei Wang, Jifang Pei, Siyi Luo, Weibo Huo, Yulin Huang, Yin Zhang\n  and Jianyu Yang","title":"SAR Ship Target Recognition Via Multi-Scale Feature Attention and\n  Adaptive-Weighed Classifier","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Maritime surveillance is indispensable for civilian fields, including\nnational maritime safeguarding, channel monitoring, and so on, in which\nsynthetic aperture radar (SAR) ship target recognition is a crucial research\nfield. The core problem to realizing accurate SAR ship target recognition is\nthe large inner-class variance and inter-class overlap of SAR ship features,\nwhich limits the recognition performance. Most existing methods plainly extract\nmulti-scale features of the network and utilize equally each feature scale in\nthe classification stage. However, the shallow multi-scale features are not\ndiscriminative enough, and each scale feature is not equally effective for\nrecognition. These factors lead to the limitation of recognition performance.\nTherefore, we proposed a SAR ship recognition method via multi-scale feature\nattention and adaptive-weighted classifier to enhance features in each scale,\nand adaptively choose the effective feature scale for accurate recognition. We\nfirst construct an in-network feature pyramid to extract multi-scale features\nfrom SAR ship images. Then, the multi-scale feature attention can extract and\nenhance the principal components from the multi-scale features with more\ninner-class compactness and inter-class separability. Finally, the adaptive\nweighted classifier chooses the effective feature scales in the feature pyramid\nto achieve the final precise recognition. Through experiments and comparisons\nunder OpenSARship data set, the proposed method is validated to achieve\nstate-of-the-art performance for SAR ship recognition.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:20:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chenwei",""],["Pei","Jifang",""],["Luo","Siyi",""],["Huo","Weibo",""],["Huang","Yulin",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.10248","submitter":"Gavin Leech","authors":"Alex Turner, Lisa Thiergart, David Udell, Gavin Leech, Ulisse Mini,\n  Monte MacDiarmid","title":"Activation Addition: Steering Language Models Without Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reliably controlling the behavior of large language models (LLMs) is a\npressing open problem. Existing methods include supervised finetuning,\nreinforcement learning from human feedback (RLHF), prompt engineering and\nguided decoding. We instead investigate activation engineering: modifying\nactivations at inference time to predictably alter model behavior. In\nparticular, we bias the forward pass with an added 'steering vector' implicitly\nspecified through natural language.\n  Unlike past work which learned these steering vectors (Subramani, Suresh, and\nPeters 2022; Hernandez, Li, and Andreas 2023), our Activation Addition (ActAdd)\nmethod computes them by taking the activation differences that result from\npairs of prompts. We demonstrate ActAdd on GPT-2 on OpenWebText and ConceptNet.\nOur inference-time approach yields control over high-level properties of output\nand preserves off-target model performance. It involves far less compute and\nimplementation effort compared to finetuning or RLHF, allows users to provide\nnatural language specifications, and its overhead scales naturally with model\nsize.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:21:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Turner","Alex",""],["Thiergart","Lisa",""],["Udell","David",""],["Leech","Gavin",""],["Mini","Ulisse",""],["MacDiarmid","Monte",""]]}
{"id":"2308.10249","submitter":"Wojciech Ozga","authors":"Wojciech Ozga, Guerney D. H. Hunt, Michael V. Le, Elaine R. Palmer,\n  Avraham Shinnar","title":"Towards a Formally Verified Security Monitor for VM-based Confidential\n  Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Confidential computing is a key technology for isolating high-assurance\napplications from the large amounts of untrusted code typical in modern\nsystems. Existing confidential computing systems cannot be certified for use in\ncritical applications, like systems controlling critical infrastructure,\nhardware security modules, or aircraft, as they lack formal verification.\n  This paper presents an approach to formally modeling and proving a security\nmonitor. It introduces a canonical architecture for virtual machine (VM)-based\nconfidential computing systems. It abstracts processor-specific components and\nidentifies a minimal set of hardware primitives required by a trusted security\nmonitor to enforce security guarantees. We demonstrate our methodology and\nproposed approach with an example from our Rust implementation of the security\nmonitor for RISC-V.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:26:57 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 09:00:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ozga","Wojciech",""],["Hunt","Guerney D. H.",""],["Le","Michael V.",""],["Palmer","Elaine R.",""],["Shinnar","Avraham",""]]}
{"id":"2308.10250","submitter":"Chenwei Wang","authors":"Chenwei Wang, Siyi Luo, Jifang Pei, Yulin Huang, Yin Zhang and Jianyu\n  Yang","title":"SAR Ship Target Recognition via Selective Feature Discrimination and\n  Multifeature Center Classifier","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Maritime surveillance is not only necessary for every country, such as in\nmaritime safeguarding and fishing controls, but also plays an essential role in\ninternational fields, such as in rescue support and illegal immigration\ncontrol. Most of the existing automatic target recognition (ATR) methods\ndirectly send the extracted whole features of SAR ships into one classifier.\nThe classifiers of most methods only assign one feature center to each class.\nHowever, the characteristics of SAR ship images, large inner-class variance,\nand small interclass difference lead to the whole features containing useless\npartial features and a single feature center for each class in the classifier\nfailing with large inner-class variance. We proposes a SAR ship target\nrecognition method via selective feature discrimination and multifeature center\nclassifier. The selective feature discrimination automatically finds the\nsimilar partial features from the most similar interclass image pairs and the\ndissimilar partial features from the most dissimilar inner-class image pairs.\nIt then provides a loss to enhance these partial features with more interclass\nseparability. Motivated by divide and conquer, the multifeature center\nclassifier assigns multiple learnable feature centers for each ship class. In\nthis way, the multifeature centers divide the large inner-class variance into\nseveral smaller variances and conquered by combining all feature centers of one\nship class. Finally, the probability distribution over all feature centers is\nconsidered comprehensively to achieve an accurate recognition of SAR ship\nimages. The ablation experiments and experimental results on OpenSARShip and\nFUSAR-Ship datasets show that our method has achieved superior recognition\nperformance under decreasing training SAR ship samples.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:27:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chenwei",""],["Luo","Siyi",""],["Pei","Jifang",""],["Huang","Yulin",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.10251","submitter":"Chenwei Wang","authors":"Chenwei Wang, Siyi Luo, Jifang Pei, Xiaoyu Liu, Yulin Huang, Yin\n  Zhang, and Jianyu Yang","title":"An Entropy-Awareness Meta-Learning Method for SAR Open-Set ATR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing synthetic aperture radar automatic target recognition (SAR ATR)\nmethods have been effective for the classification of seen target classes.\nHowever, it is more meaningful and challenging to distinguish the unseen target\nclasses, i.e., open set recognition (OSR) problem, which is an urgent problem\nfor the practical SAR ATR. The key solution of OSR is to effectively establish\nthe exclusiveness of feature distribution of known classes. In this letter, we\npropose an entropy-awareness meta-learning method that improves the\nexclusiveness of feature distribution of known classes which means our method\nis effective for not only classifying the seen classes but also encountering\nthe unseen other classes. Through meta-learning tasks, the proposed method\nlearns to construct a feature space of the dynamic-assigned known classes. This\nfeature space is required by the tasks to reject all other classes not\nbelonging to the known classes. At the same time, the proposed\nentropy-awareness loss helps the model to enhance the feature space with\neffective and robust discrimination between the known and unknown classes.\nTherefore, our method can construct a dynamic feature space with discrimination\nbetween the known and unknown classes to simultaneously classify the\ndynamic-assigned known classes and reject the unknown classes. Experiments\nconducted on the moving and stationary target acquisition and recognition\n(MSTAR) dataset have shown the effectiveness of our method for SAR OSR.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:33:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chenwei",""],["Luo","Siyi",""],["Pei","Jifang",""],["Liu","Xiaoyu",""],["Huang","Yulin",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.10252","submitter":"Yixuan Weng","authors":"Yixuan Weng, Zhiqi Wang, Huanxuan Liao, Shizhu He, Shengping Liu, Kang\n  Liu, Jun Zhao","title":"LMTuner: An user-friendly and highly-integrable Training Framework for\n  fine-tuning Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the burgeoning development in the realm of large language models (LLMs),\nthe demand for efficient incremental training tailored to specific industries\nand domains continues to increase. Currently, the predominantly employed\nframeworks lack modular design, it often takes a lot of coding work to\nkickstart the training of LLM. To address this, we present \"LMTuner\", a highly\nusable, integrable, and scalable system for training LLMs expeditiously and\nwith minimal user-input. LMTuner comprises three main modules - the\nInteraction, Training, and Inference Modules. We advocate that LMTuner's\nusability and integrality alleviate the complexities in training large language\nmodels. Remarkably, even a novice user could commence training large language\nmodels within five minutes. Furthermore, it integrates DeepSpeed frameworks and\nsupports Efficient Fine-Tuning methodologies like Low Rank Adaptation (LoRA),\nQuantized LoRA (QLoRA), etc., enabling the training of language models scaling\nfrom 300M to a whopping 130B parameters using a single server. The LMTuner's\nhomepage (https://wengsyx.github.io/LMTuner/)and screencast video\n(https://youtu.be/nsXmWOmN3rE) are now publicly available.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:42:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Weng","Yixuan",""],["Wang","Zhiqi",""],["Liao","Huanxuan",""],["He","Shizhu",""],["Liu","Shengping",""],["Liu","Kang",""],["Zhao","Jun",""]]}
{"id":"2308.10253","submitter":"Chi Zhang","authors":"Yanda Li, Chi Zhang, Gang Yu, Zhibin Wang, Bin Fu, Guosheng Lin,\n  Chunhua Shen, Ling Chen, Yunchao Wei","title":"StableLLaVA: Enhanced Visual Instruction Tuning with Synthesized\n  Image-Dialogue Data","comments":"Project page: https://github.com/icoz69/StableLLAVA","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":"  The remarkable multimodal capabilities demonstrated by OpenAI's GPT-4 have\nsparked significant interest in the development of multimodal Large Language\nModels (LLMs). A primary research objective of such models is to align visual\nand textual modalities effectively while comprehending human instructions.\nCurrent methodologies often rely on annotations derived from benchmark datasets\nto construct image-dialogue datasets for training purposes, akin to instruction\ntuning in LLMs. However, these datasets often exhibit domain bias, potentially\nconstraining the generative capabilities of the models. In an effort to\nmitigate these limitations, we propose a novel data collection methodology that\nsynchronously synthesizes images and dialogues for visual instruction tuning.\nThis approach harnesses the power of generative models, marrying the abilities\nof ChatGPT and text-to-image generative models to yield a diverse and\ncontrollable dataset with varied image content. This not only provides greater\nflexibility compared to existing methodologies but also significantly enhances\nseveral model capabilities. Our research includes comprehensive experiments\nconducted on various datasets using the open-source LLAVA model as a testbed\nfor our proposed pipeline. Our results underscore marked enhancements across\nmore than ten commonly assessed capabilities,\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:43:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yanda",""],["Zhang","Chi",""],["Yu","Gang",""],["Wang","Zhibin",""],["Fu","Bin",""],["Lin","Guosheng",""],["Shen","Chunhua",""],["Chen","Ling",""],["Wei","Yunchao",""]]}
{"id":"2308.10254","submitter":"Shinichi Kinoshita","authors":"Shinichi. W. Kinoshita, Fumitaka Nakamura","title":"Unveiling the Dynamics of Dense Cores in Cluster-Forming Clumps: A 3D\n  MHD Simulation Study of Angular Momentum and Magnetic Field Properties","comments":"28 pages, 25 figures, 3 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":"  We conducted isothermal MHD simulations with self-gravity to investigate the\nproperties of dense cores in cluster-forming clumps. Two different setups were\nexplored: a single rotating clump and colliding clumps. We focused on\ndetermining the extent to which the formed dense cores inherit the rotation and\nmagnetic field of the parental clump. Our statistical analysis revealed that\nthe alignment between the angular momentum of dense cores, $\\bf{L}_{\\rm core}$,\nand the rotational axis of the clump is influenced by the strength of\nturbulence and the simulation setup. In single rotating clumps, we found that\n$\\bf{L}_{\\rm core}$ tends to align with the clump's rotational axis if the\ninitial turbulence is weak. However, in colliding clumps, this alignment does\nnot occur, regardless of the initial turbulence strength. This misalignment in\ncolliding clumps is due to the induced turbulence from the collision and the\nisotropic gas inflow into dense cores. Our analysis of colliding clumps also\nrevealed that the magnetic field globally bends along the shock-compressed\nlayer, and the mean magnetic field of dense cores, $\\bf{B}_{\\rm core}$, aligns\nwith it. Both in single rotating clumps and colliding clumps, we found that the\nangle between $\\bf{B}_{\\rm core}$ and $\\bf{L}_{\\rm core}$ is generally random,\nregardless of the clump properties. We also analyzed the dynamical states of\nthe formed cores and found a higher proportion of unbound cores in colliding\nclumps. In addition, the contribution of rotational energy was only\napproximately 5% of the gravitational energy, regardless of the model\nparameters for both single and colliding cases.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:44:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kinoshita","Shinichi. W.",""],["Nakamura","Fumitaka",""]]}
{"id":"2308.10255","submitter":"Do\\u{g}analp Ergen\\c{c}","authors":"Do\\u{g}analp Ergen\\c{c}, Nuref\\c{s}an Sertba\\c{s} B\\\"ulb\\\"ul, Lisa\n  Maile, Anna Arestova, Mathias Fischer","title":"Towards Synthesizing Datasets for IEEE 802.1 Time-sensitive Networking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  IEEE 802.1 Time-sensitive Networking (TSN) protocols have recently been\nproposed to replace legacy networking technologies across different\nmission-critical systems (MCSs). Design, configuration, and maintenance of TSN\nwithin MCSs require advanced methods to tackle the highly complex and\ninterconnected nature of those systems. Accordingly, artificial intelligence\n(AI) and machine learning (ML) models are the most prominent enablers to\ndevelop such methods. However, they usually require a significant amount of\ndata for model training, which is not easily accessible. This short paper aims\nto recapitulate the need for TSN datasets to flourish research on AI/ML-based\ntechniques for TSN systems. Moreover, it analyzes the main requirements and\nalternative designs to build a TSN platform to synthesize realistic datasets.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:47:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ergen\u00e7","Do\u011fanalp",""],["B\u00fclb\u00fcl","Nuref\u015fan Sertba\u015f",""],["Maile","Lisa",""],["Arestova","Anna",""],["Fischer","Mathias",""]]}
{"id":"2308.10256","submitter":"Jiuqing Liang","authors":"Jun-Li Xin, Jiu-Qing Liang","title":"Exact solutions of a spin-orbit coupling model in two-dimensional\n  central-potentials and quantum-classical correspondence","comments":"16 pages, 4 figures","journal-ref":"Sci China-Phys Mech Astron August, 2014, 57(8),1504-1510","doi":"10.1007/s11433-014-5531-0","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we present both the classical and quantum periodic-orbits of a\nneutral spinning particle constrained in two-dimensional central-potentials\nwith a cylindrically symmetric electric-field in addition which leads to an\neffective non-Abelian gauge field generated by the spin-orbit coupling.\nCoherent superposition of orbital angular-eigenfunctions obtained explicitly at\nthe condition of zero-energy exhibits the quantum-classical correspondence in\nthe meaning of exact coincidence between classical orbits and spatial patterns\nof quantum wave-functions, which as a consequence results in the fractional\nquantization of orbital angular-momentum by the requirement of the same\nrotational symmetry of quantum and classical orbits. A non-Abelian anyon-model\nemerges in a natural way.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:49:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xin","Jun-Li",""],["Liang","Jiu-Qing",""]]}
{"id":"2308.10257","submitter":"Liao Shen","authors":"Liao Shen, Xingyi Li, Huiqiang Sun, Juewen Peng, Ke Xian, Zhiguo Cao,\n  Guosheng Lin","title":"Make-It-4D: Synthesizing a Consistent Long-Term Dynamic Scene Video from\n  a Single Image","comments":"accepted by ACM MM'23","journal-ref":null,"doi":"10.1145/3581783.3612033","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of synthesizing a long-term dynamic video from only a\nsingle image. This is challenging since it requires consistent visual content\nmovements given large camera motions. Existing methods either hallucinate\ninconsistent perpetual views or struggle with long camera trajectories. To\naddress these issues, it is essential to estimate the underlying 4D (including\n3D geometry and scene motion) and fill in the occluded regions. To this end, we\npresent Make-It-4D, a novel method that can generate a consistent long-term\ndynamic video from a single image. On the one hand, we utilize layered depth\nimages (LDIs) to represent a scene, and they are then unprojected to form a\nfeature point cloud. To animate the visual content, the feature point cloud is\ndisplaced based on the scene flow derived from motion estimation and the\ncorresponding camera pose. Such 4D representation enables our method to\nmaintain the global consistency of the generated dynamic video. On the other\nhand, we fill in the occluded regions by using a pretrained diffusion model to\ninpaint and outpaint the input image. This enables our method to work under\nlarge camera motions. Benefiting from our design, our method can be\ntraining-free which saves a significant amount of training time. Experimental\nresults demonstrate the effectiveness of our approach, which showcases\ncompelling rendering results.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:53:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shen","Liao",""],["Li","Xingyi",""],["Sun","Huiqiang",""],["Peng","Juewen",""],["Xian","Ke",""],["Cao","Zhiguo",""],["Lin","Guosheng",""]]}
{"id":"2308.10258","submitter":"Xianghan Cui","authors":"Xiang-han Cui, Zheng-wu Wang, Cheng-min Zhang, Chen-hui Niu, Di Li,\n  Jian-wei Zhang, and De-hua Wang","title":"Fast radio bursts generated by coherent curvature radiation from\n  compressed bunches for FRB 20190520B","comments":"16 pages, 9 figures, and 1 table. Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The radiation mechanism of fast radio bursts (FRBs) has been extensively\nstudied but still remains elusive. Coherent radiation is identified as a\ncrucial component in the FRB mechanism, with charged bunches also playing a\nsignificant role under specific circumstances. In the present research, we\npropose a phenomenological model that draws upon the coherent curvature\nradiation framework and the magnetized neutron star, taking into account the\nkinetic energy losses of outflow particles due to inverse Compton scattering\n(ICS) induced by soft photons within the magnetosphere. By integrating the ICS\ndeceleration mechanism for particles, we hypothesize a potential compression\neffect on the particle number density within a magnetic tube/family, which\ncould facilitate achieving the necessary size for coherent radiation in the\nradial direction. This mechanism might potentially enable the dynamic formation\nof bunches capable of emitting coherent curvature radiation along the curved\nmagnetic field. Moreover, we examine the formation of bunches from an energy\nperspective. Our discussion suggests that within the given parameter space the\nformation of bunches is feasible. Finally, we apply this model to FRB\n20190520B, one of the most active repeating FRBs discovered and monitored by\nFAST. Several observed phenomena are explained, including basic\ncharacteristics, frequency downward drifting, and bright spots within certain\ndynamic spectral ranges.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:02:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cui","Xiang-han",""],["Wang","Zheng-wu",""],["Zhang","Cheng-min",""],["Niu","Chen-hui",""],["Li","Di",""],["Zhang","Jian-wei",""],["Wang","De-hua",""]]}
{"id":"2308.10259","submitter":"Steve Kirkland","authors":"Stephen Kirkland","title":"Completion Problems and Sparsity for Kemeny's Constant","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a partially specified stochastic matrix, we consider the problem of\ncompleting it so as to minimize Kemeny's constant. We prove that for any\npartially specified stochastic matrix for which the problem is well-defined,\nthere is a minimizing completion that is as sparse as possible. We also find\nthe minimum value of Kemeny's constant in two special cases: when the diagonal\nhas been specified, and when all specified entries lie in a common row.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:02:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kirkland","Stephen",""]]}
{"id":"2308.10260","submitter":"Umit Sen","authors":"Ayoade Adeyemi, Umit Sen, Samet Mert Ercan, Mine Sarac","title":"Hand Dominance and Congruence for Wrist-worn Haptics using Custom\n  Voice-Coil Actuation","comments":"6 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During virtual interactions, rendering haptic feedback on a remote location\n(like the wrist) instead of the fingertips freeing users' hands from mechanical\ndevices. This allows for real interactions while still providing information\nregarding the mechanical properties of virtual objects. In this paper, we\npresent CoWrHap -- a novel wrist-worn haptic device with custom-made voice coil\nactuation to render force feedback. Then, we investigate the impact of asking\nparticipants to use their dominant or non-dominant hand for virtual\ninteractions and the best mapping between the active hand and the wrist\nreceiving the haptic feedback, which can be defined as hand-wrist congruence\nthrough a user experiment based on a stiffness discrimination task. Our results\nshow that participants performed the tasks (i) better with non-congruent\nmapping but reported better experiences with congruent mapping, and (ii) with\nno statistical difference in terms of hand dominance but reported better user\nexperience and enjoyment using their dominant hands. This study indicates that\nparticipants can perceive mechanical properties via haptic feedback provided\nthrough CoWrHap.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:08:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Adeyemi","Ayoade",""],["Sen","Umit",""],["Ercan","Samet Mert",""],["Sarac","Mine",""]]}
{"id":"2308.10261","submitter":"Bo Liu","authors":"Bo Liu, Liming Zhan, Zexin Lu, Yujie Feng, Lei Xue, Xiao-Ming Wu","title":"How Good Are Large Language Models at Out-of-Distribution Detection?","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":"  Out-of-distribution (OOD) detection plays a vital role in enhancing the\nreliability of machine learning (ML) models. The emergence of large language\nmodels (LLMs) has catalyzed a paradigm shift within the ML community,\nshowcasing their exceptional capabilities across diverse natural language\nprocessing tasks. While existing research has probed OOD detection with\nrelative small-scale Transformers like BERT, RoBERTa and GPT-2, the stark\ndifferences in scales, pre-training objectives, and inference paradigms call\ninto question the applicability of these findings to LLMs. This paper embarks\non a pioneering empirical investigation of OOD detection in the domain of LLMs,\nfocusing on LLaMA series ranging from 7B to 65B in size. We thoroughly evaluate\ncommonly-used OOD detectors, scrutinizing their performance in both zero-grad\nand fine-tuning scenarios. Notably, we alter previous discriminative\nin-distribution fine-tuning into generative fine-tuning, aligning the\npre-training objective of LLMs with downstream tasks. Our findings unveil that\na simple cosine distance OOD detector demonstrates superior efficacy,\noutperforming other OOD detectors. We provide an intriguing explanation for\nthis phenomenon by highlighting the isotropic nature of the embedding spaces of\nLLMs, which distinctly contrasts with the anisotropic property observed in\nsmaller BERT family models. The new insight enhances our understanding of how\nLLMs detect OOD data, thereby enhancing their adaptability and reliability in\ndynamic environments.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:15:18 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 16:49:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Bo",""],["Zhan","Liming",""],["Lu","Zexin",""],["Feng","Yujie",""],["Xue","Lei",""],["Wu","Xiao-Ming",""]]}
{"id":"2308.10262","submitter":"Xucheng Wang","authors":"Xucheng Wang, Xiangyang Yang, Hengzhou Ye, Shuiwang Li","title":"Learning Disentangled Representation with Mutual Information\n  Maximization for Real-Time UAV Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficiency has been a critical problem in UAV tracking due to limitations in\ncomputation resources, battery capacity, and unmanned aerial vehicle maximum\nload. Although discriminative correlation filters (DCF)-based trackers prevail\nin this field for their favorable efficiency, some recently proposed\nlightweight deep learning (DL)-based trackers using model compression\ndemonstrated quite remarkable CPU efficiency as well as precision.\nUnfortunately, the model compression methods utilized by these works, though\nsimple, are still unable to achieve satisfying tracking precision with higher\ncompression rates. This paper aims to exploit disentangled representation\nlearning with mutual information maximization (DR-MIM) to further improve\nDL-based trackers' precision and efficiency for UAV tracking. The proposed\ndisentangled representation separates the feature into an identity-related and\nan identity-unrelated features. Only the latter is used, which enhances the\neffectiveness of the feature representation for subsequent classification and\nregression tasks. Extensive experiments on four UAV benchmarks, including\nUAV123@10fps, DTB70, UAVDT and VisDrone2018, show that our DR-MIM tracker\nsignificantly outperforms state-of-the-art UAV tracking methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:16:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Xucheng",""],["Yang","Xiangyang",""],["Ye","Hengzhou",""],["Li","Shuiwang",""]]}
{"id":"2308.10263","submitter":"Majd Hawasly","authors":"Majd Hawasly, Fahim Dalvi and Nadir Durrani","title":"Scaled-up Discovery of Latent Concepts in Deep NLP 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":"  Pre-trained language models (pLMs) learn intricate patterns and contextual\ndependencies via unsupervised learning on vast text data, driving breakthroughs\nacross NLP tasks. Despite these achievements, these models remain black boxes,\nnecessitating research into understanding their decision-making processes.\nRecent studies explore representation analysis by clustering latent spaces\nwithin pre-trained models. However, these approaches are limited in terms of\nscalability and the scope of interpretation because of high computation costs\nof clustering algorithms. This study focuses on comparing clustering algorithms\nfor the purpose of scaling encoded concept discovery of representations from\npLMs. Specifically, we compare three algorithms in their capacity to unveil the\nencoded concepts through their alignment to human-defined ontologies:\nAgglomerative Hierarchical Clustering, Leaders Algorithm, and K-Means\nClustering. Our results show that K-Means has the potential to scale to very\nlarge datasets, allowing rich latent concept discovery, both on the word and\nphrase level.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:20:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hawasly","Majd",""],["Dalvi","Fahim",""],["Durrani","Nadir",""]]}
{"id":"2308.10264","submitter":"Matthew Hastings","authors":"M. B. Hastings","title":"Quantum Codes on Graphs","comments":"25 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider some questions related to codes constructed using various graphs,\nin particular focusing on graphs which are not lattices in two or three\ndimensions. We begin by considering Floquet codes which can be constructed\nusing ``emergent fermions\". Here, we are considering codes that in some sense\ngeneralize the honeycomb code[1] to more general, non-planar graphs. We then\nconsider a class of these codes that is related to (generalized) toric codes on\n$2$-complexes. For (generalized) toric codes on $2$-complexes, the following\nquestion arises: can the distance of these codes grow faster than square-root?\nWe answer the question negatively, and remark on recent systolic\ninequalities[2]. We then turn to the case that of planar codes with vacancies,\nor ``dead qubits\", and consider the statistical mechanics of decoding in this\nsetting. Although we do not prove a threshold, our results should be\nasymptotically correct for low error probability and high degree decoding\ngraphs (high degree taken before low error probability). In an appendix, we\ndiscuss a toy model of vacancies in planar quantum codes, giving a\nphenomenological discussion of how errors occur when ``super-stabilizers\" are\nnot measured, and in a separate appendix we discuss a relation between Floquet\ncodes and chain maps.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:22:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hastings","M. B.",""]]}
{"id":"2308.10265","submitter":"Tianci Zhang","authors":"Tianci Zhang and Zhengchuan Chen","title":"Age of Information in a Multisource Ber/Geo/1/1 Preemptive Queueing\n  System","comments":null,"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":"  This work studies the information freshness of the vehicle-to-infrastructure\nstatus updating in Internet of vehicles, which is modeled as a multi-source\nBer/Geo/1/1 preemptive queueing system with heterogeneous service time. We pay\nattention to both the distribution and average of AoI. To fully track the\nper-source AoI evolution, a Markov two-dimensional (2D) age process is\nintroduced. The first element of the 2D age process stands for the\ninstantaneous per-source AoI, while the second represents whether an update of\nthe concerned source is being served and its current age. A complete framework\nand detailed analyses on the per-source AoI are presented based on the\nMarkovity of the 2D age process. By studying the state transition\nprobabilities, stationary equations, and stationary distribution of the 2D age\nprocess, analytical expressions of the probability mass function and average of\nper-source AoI are derived. Numerical results validate the accuracy of the\ntheoretical analyses.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:39:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Tianci",""],["Chen","Zhengchuan",""]]}
{"id":"2308.10266","submitter":"Pavel Minaev","authors":"P. Yu. Minaev, A. S. Pozanenko","title":"Calibrating SPI-ACS/INTEGRAL for gamma-ray bursts and re-estimating\n  energetics of GRB/GW 190425 in gamma-ray range","comments":"11 pages, 11 figures, Accepted to MNRAS 2023 August 3, in original\n  form 2023 June 23","journal-ref":null,"doi":"10.1093/mnras/stad2416","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  SPI-ACS/INTEGRAL is one of the most sensitive orbital gamma-ray detectors in\nenergy range above 80 keV. Since 2002 it registered several thousands of\ngamma-ray bursts, including the bursts associated with LIGO-Virgo gravitational\nwave events GW 170817 and GW 190425. No dedicated in-flight calibrations were\nperformed for SPI-ACS/INTEGRAL, complicating estimation of spectral and\nenergetic characteristics of an event. Using data of GBM/Fermi we perform\ncross-calibration of SPI-ACS/INTEGRAL, based on 1032 bright GRBs registered by\nboth experiments. We find the conversion factor between instrumental counts\nfrom SPI-ACS and energy units from GBM to be dependent on hardness of GRB\nspectrum (defined as the characteristic energy value, $E_{p}$) and on location\nof a source in spacecraft based coordinate system. We determine the\ncorresponding analytical model to calculate the conversion factor and estimate\nits accuracy empirically. Sensitivity of SPI-ACS/INTEGRAL to detect gamma-ray\ntransients is also investigated. Using the calibration we re-estimate\nenergetics of GRB/GW 190425, detected by SPI-ACS/INTEGRAL alone. We constrain\npossible range of the characteristic energy $E_{p}$ and isotropic equivalent of\ntotal energy, emitted in gamma-rays $E_{iso}$ for GRB 190425, using the $\nE_{p,i} $ -- $ E_{iso} $ (Amati) correlation. The calibration model could be\napplied to any transients with energy spectrum, analogous to gamma-ray bursts.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:41:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Minaev","P. Yu.",""],["Pozanenko","A. S.",""]]}
{"id":"2308.10267","submitter":"Sahar Diskin","authors":"Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich","title":"Percolation through Isoperimetry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We determine necessary and sufficient conditions on the isoperimetric\nproperties of a regular graph $G$ of growing degree $d$, under which the random\nsubgraph $G_p$ typically undergoes a phase transition around $p=\\frac{1}{d}$\nwhich resembles the emergence of a giant component in the binomial random graph\nmodel $G(n,p)$.\n  More precisely, let $d=\\omega(1)$, let $\\epsilon>0$ be a small enough\nconstant, and let $p \\cdot d=1+\\epsilon$. We show that if $C$ is sufficiently\nlarge and $G$ is a $d$-regular $n$-vertex graph where every subset $S\\subseteq\nV(G)$ of order at most $\\frac{n}{2}$ has edge-boundary of size at least $C|S|$,\nthen $G_p$ typically has a unique component of linear order, whose order is\nasymptotically $y(\\epsilon)n$, where $y(\\epsilon)$ is the survival probability\nof a Galton-Watson tree with offspring distribution Po$(1+\\epsilon)$. We\nfurther give examples to show that this result is tight both in terms of its\ndependence on $C$, and with respect to the order of the second-largest\ncomponent, which is in contrast to the case of constant $d$.\n  We also consider a more general setting, where we only control the expansion\nof sets up to size $k$. In this case, we show that if $G$ is such that every\nsubset $S\\subseteq V(G)$ of order at most $k$ has edge-boundary of size at\nleast $d|S|$ and $p$ is such that $p\\cdot d \\geq 1 + \\epsilon$, then $G_p$\ntypically contains a component of order $\\Omega(k)$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:44:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Diskin","Sahar",""],["Erde","Joshua",""],["Kang","Mihyun",""],["Krivelevich","Michael",""]]}
{"id":"2308.10268","submitter":"Muhammad Irfan","authors":"Muhammad Irfan, Alireza Sadighian, Adeen Tanveer, Shaikha J. Al-Naimi,\n  Gabriele Oligeri","title":"False Data Injection Attacks in Smart Grids: State of the Art and Way\n  Forward","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the recent years cyberattacks to smart grids are becoming more frequent\nAmong the many malicious activities that can be launched against smart grids\nFalse Data Injection FDI attacks have raised significant concerns from both\nacademia and industry FDI attacks can affect the internal state estimation\nprocesscritical for smart grid monitoring and controlthus being able to bypass\nconventional Bad Data Detection BDD methods Hence prompt detection and precise\nlocalization of FDI attacks is becomming of paramount importance to ensure\nsmart grids security and safety Several papers recently started to study and\nanalyze this topic from different perspectives and address existing challenges\nDatadriven techniques and mathematical modelings are the major ingredients of\nthe proposed approaches The primary objective of this work is to provide a\nsystematic review and insights into FDI attacks joint detection and\nlocalization approaches considering that other surveys mainly concentrated on\nthe detection aspects without detailed coverage of localization aspects For\nthis purpose we select and inspect more than forty major research contributions\nwhile conducting a detailed analysis of their methodology and objectives in\nrelation to the FDI attacks detection and localization We provide our key\nfindings of the identified papers according to different criteria such as\nemployed FDI attacks localization techniques utilized evaluation scenarios\ninvestigated FDI attack types application scenarios adopted methodologies and\nthe use of additional data Finally we discuss open issues and future research\ndirections\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 13:46:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Irfan","Muhammad",""],["Sadighian","Alireza",""],["Tanveer","Adeen",""],["Al-Naimi","Shaikha J.",""],["Oligeri","Gabriele",""]]}
{"id":"2308.10269","submitter":"Hyunbo Shim","authors":"Hyunbo Shim, In Cho, Daekyu Kwon, Seon Joo Kim","title":"Domain Reduction Strategy for Non Line of Sight Imaging","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":"  This paper presents a novel optimization-based method for non-line-of-sight\n(NLOS) imaging that aims to reconstruct hidden scenes under various setups. Our\nmethod is built upon the observation that photons returning from each point in\nhidden volumes can be independently computed if the interactions between hidden\nsurfaces are trivially ignored. We model the generalized light propagation\nfunction to accurately represent the transients as a linear combination of\nthese functions. Moreover, our proposed method includes a domain reduction\nprocedure to exclude empty areas of the hidden volumes from the set of\npropagation functions, thereby improving computational efficiency of the\noptimization. We demonstrate the effectiveness of the method in various NLOS\nscenarios, including non-planar relay wall, sparse scanning patterns, confocal\nand non-confocal, and surface geometry reconstruction. Experiments conducted on\nboth synthetic and real-world data clearly support the superiority and the\nefficiency of the proposed method in general NLOS scenarios.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:00:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shim","Hyunbo",""],["Cho","In",""],["Kwon","Daekyu",""],["Kim","Seon Joo",""]]}
{"id":"2308.10270","submitter":"Ao Zhang","authors":"Ao Zhang, Yanjie Zhang, Xiao Wang, Zibo Wang, Jinqiao Duan","title":"Global solution and blow-up for the stochastic fractional Schr\\\"odinger\n  equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish the stochastic Strichartz estimate for the fractional\nSchr\\\"odinger equation with multiplicative noise. With the help of the\ndeterministic Strichartz estimates, we prove the existence and uniqueness of a\nglobal solution to the stochastic fractional nonlinear Schr\\\"odinger equation\nin $L_2(\\mathbb{R}^n)$ and $H^{1}(\\mathbb{R}^n)$, respectively. In addition, we\nalso prove a general blow up result by deriving a localized virial estimate and\nthe generalized Strauss inequality with $E[u_0]<0$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:01:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Ao",""],["Zhang","Yanjie",""],["Wang","Xiao",""],["Wang","Zibo",""],["Duan","Jinqiao",""]]}
{"id":"2308.10271","submitter":"Hugo Parlier","authors":"Hugo Parlier","title":"Smoothing curves carefully","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proves an elementary and topological fact about closed curves on\nsurfaces, namely that by carefully smoothing an intersection point, one can\nreduce self-intersection by exactly $1$. This immediately implies a positive\nanswer to a problem first raised by Basmajian in 1993: among all closed\ngeodesics of a hyperbolic surface that self-intersect at least $k$ times, does\nthe shortest one self-intersect exactly $k$ times? The answer is also shown to\nbe positive for arbitrary Riemannian metrics.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:03:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Parlier","Hugo",""]]}
{"id":"2308.10272","submitter":"Jonathan Weber","authors":"Jonathan T. Weber and Sascha Sch\\\"afer","title":"Electron Imaging of Nanoscale Charge Distributions Induced by\n  Femtosecond Light Pulses","comments":"26 pages; Manuscript with 3 figures and Supporting Information with 1\n  additional figure","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":"  Surface charging is a phenomenon ubiquitously observable in in-situ\ntransmission electron microscopy of non-conducting specimens as a result of\nelectron-beam/sample interactions or optical stimuli and often limits the\nachievable image stability and spatial or spectral resolution. Here, we report\non the electron-optical imaging of surface charging on a nanostructured surface\nfollowing femtosecond-multiphoton photoemission. By quantitatively extracting\nthe light-induced electrostatic potential and studying the charging dynamics on\nthe relevant timescales, we gain insights into the details of the multi-photon\nphotoemission process in the presence of a background field. We study the\ninteraction of the charge distribution with the high-energy electron beam and\nsecondary electrons and propose a simple model to describe the interplay of\nelectron- and light-induced processes.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:05:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Weber","Jonathan T.",""],["Sch\u00e4fer","Sascha",""]]}
{"id":"2308.10273","submitter":"Xin Ding Dr.","authors":"Xin Ding and Yongwei Wang and Zuheng Xu","title":"Turning Waste into Wealth: Leveraging Low-Quality Samples for Enhancing\n  Continuous Conditional Generative Adversarial Networks","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":"  Continuous Conditional Generative Adversarial Networks (CcGANs) enable\ngenerative modeling conditional on continuous scalar variables (termed\nregression labels). However, they can produce subpar fake images due to limited\ntraining data. Although Negative Data Augmentation (NDA) effectively enhances\nunconditional and class-conditional GANs by introducing anomalies into real\ntraining images, guiding the GANs away from low-quality outputs, its impact on\nCcGANs is limited, as it fails to replicate negative samples that may occur\nduring the CcGAN sampling. We present a novel NDA approach called Dual-NDA\nspecifically tailored for CcGANs to address this problem. Dual-NDA employs two\ntypes of negative samples: visually unrealistic images generated from a\npre-trained CcGAN and label-inconsistent images created by manipulating real\nimages' labels. Leveraging these negative samples, we introduce a novel\ndiscriminator objective alongside a modified CcGAN training algorithm.\nEmpirical analysis on UTKFace and Steering Angle reveals that Dual-NDA\nconsistently enhances the visual fidelity and label consistency of fake images\ngenerated by CcGANs, exhibiting a substantial performance gain over the vanilla\nNDA. Moreover, by applying Dual-NDA, CcGANs demonstrate a remarkable\nadvancement beyond the capabilities of state-of-the-art conditional GANs and\ndiffusion models, establishing a new pinnacle of performance.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:06:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ding","Xin",""],["Wang","Yongwei",""],["Xu","Zuheng",""]]}
{"id":"2308.10274","submitter":"Fang Yan","authors":"Fang Yan, Xiaorong Hou, Tingting Tian, Xiaojie Chen","title":"Nonlinear model reference adaptive control approach for governance of\n  the commons in a feedback-evolving game","comments":"27 pages with 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The governance of common-pool resources has vital importance for\nsustainability. However, in the realistic management systems of common-pool\nresources, the institutions do not necessarily execute the management policies\ncompletely, which will induce that the real implementation intensity is\nuncertain. In this paper, we consider a feedback-evolving game model with the\ninspection for investigating the management of renewable resource and assume\nthat there exists the implementation uncertainty of inspection. Furthermore, we\nuse the nonlinear model reference adaptive control approach to handle this\nuncertainty. We accordingly design a protocol, which is an update law of\nadjusting the institutional inspection intensity. We obtain a sufficient\ncondition under which the update law can drive the actual system to reach the\nexpected outcome. In addition, we provide several numerical examples, which can\nconfirm our theoretical results. Our work presents a novel approach to address\nthe implementation uncertainty in the feedback-evolving games and thus our\nresults can be helpful for effectively managing the common-pool resources in\nthe human social systems.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:09:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yan","Fang",""],["Hou","Xiaorong",""],["Tian","Tingting",""],["Chen","Xiaojie",""]]}
{"id":"2308.10275","submitter":"Yizheng Wang","authors":"Yizheng Wang, Yixiao Zhai, Yijie Ding, Quan Zou","title":"SBSM-Pro: Support Bio-sequence Machine for Proteins","comments":"38 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Proteins play a pivotal role in biological systems. The use of machine\nlearning algorithms for protein classification can assist and even guide\nbiological experiments, offering crucial insights for biotechnological\napplications. We propose a support bio-sequence machine for proteins, a model\nspecifically designed for biological sequence classification. This model starts\nwith raw sequences and groups amino acids based on their physicochemical\nproperties. It incorporates sequence alignment to measure the similarities\nbetween proteins and uses a novel MKL approach to integrate various types of\ninformation, utilizing support vector machines for classification prediction.\nThe results indicate that our model demonstrates commendable performance across\n10 datasets in terms of the identification of protein function and\nposttranslational modification. This research not only showcases\nstate-of-the-art work in protein classification but also paves the way for new\ndirections in this domain, representing a beneficial endeavour in the\ndevelopment of platforms tailored for biological sequence classification.\nSBSM-Pro is available for access at http://lab.malab.cn/soft/SBSM-Pro/.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:10:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yizheng",""],["Zhai","Yixiao",""],["Ding","Yijie",""],["Zou","Quan",""]]}
{"id":"2308.10276","submitter":"Wenying Duan","authors":"Wenying Duan, Hong Rao, Wei Huang, Xiaoxi He","title":"Minimalist Traffic Prediction: Linear Layer Is All You Need","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic prediction is essential for the progression of Intelligent\nTransportation Systems (ITS) and the vision of smart cities. While\nSpatial-Temporal Graph Neural Networks (STGNNs) have shown promise in this\ndomain by leveraging Graph Neural Networks (GNNs) integrated with either RNNs\nor Transformers, they present challenges such as computational complexity,\ngradient issues, and resource-intensiveness. This paper addresses these\nchallenges, advocating for three main solutions: a node-embedding approach,\ntime series decomposition, and periodicity learning. We introduce STLinear, a\nminimalist model architecture designed for optimized efficiency and\nperformance. Unlike traditional STGNNs, STlinear operates fully locally,\navoiding inter-node data exchanges, and relies exclusively on linear layers,\ndrastically cutting computational demands. Our empirical studies on real-world\ndatasets confirm STLinear's prowess, matching or exceeding the accuracy of\nleading STGNNs, but with significantly reduced complexity and computation\noverhead (more than 95% reduction in MACs per epoch compared to\nstate-of-the-art STGNN baseline published in 2023). In summary, STLinear\nemerges as a potent, efficient alternative to conventional STGNNs, with\nprofound implications for the future of ITS and smart city initiatives.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:12:11 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 10:10:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Duan","Wenying",""],["Rao","Hong",""],["Huang","Wei",""],["He","Xiaoxi",""]]}
{"id":"2308.10277","submitter":"Gabriel Montoya-Vega","authors":"Gabriel Montoya-Vega","title":"Una Mirada Inicial a la Teor\\'ia de Nudos y a la Homolog\\'ia de Khovanov","comments":"22 pages, in Spanish language, 13 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.GT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The mathematical theory of knots studies the embeddings of circles into the\nspace $\\mathbb{R}^3$, being the classification one of the fundamental problems.\nThe introduction of homology theories results in complex mathematical\nstructures that generate new research opportunities. On occasion of the\nEncuentro Internacional de Matem\\'aticas (EIMAT) (International Meeting of\nMathematics) to be celebrated at the Universidad del Atl\\'antico in\nBarranquilla, Colombia in November 2023, in this article, in an expository way,\nwe offer a first look into Khovanov homology and the long exact sequence of\nKhovanov homology. Moreover, we present a summary of the historical origins of\nthe theory which can take us as early as the year 2600 BCE, passing through\nItaly of the XV century, Scotland of the XIX century, and we give references\nfor further and more detailed discussions. Additionally to showing the\nconstruction of Khovanov homology from the Kauffman bracket polynomial, the\nmain objective in publishing this article is to attack the language barrier and\npopularize knot theory and Khovanov homology in Colombia and Latin-America in\ngeneral.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:19:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Montoya-Vega","Gabriel",""]]}
{"id":"2308.10278","submitter":"Tu Quan","authors":"Quan Tu, Chuanqi Chen, Jinpeng Li, Yanran Li, Shuo Shang, Dongyan\n  Zhao, Ran Wang, Rui Yan","title":"CharacterChat: Learning towards Conversational AI with Personalized\n  Social Support","comments":"10 pages, 6 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In our modern, fast-paced, and interconnected world, the importance of mental\nwell-being has grown into a matter of great urgency. However, traditional\nmethods such as Emotional Support Conversations (ESC) face challenges in\neffectively addressing a diverse range of individual personalities. In\nresponse, we introduce the Social Support Conversation (S2Conv) framework. It\ncomprises a series of support agents and the interpersonal matching mechanism,\nlinking individuals with persona-compatible virtual supporters. Utilizing\npersona decomposition based on the MBTI (Myers-Briggs Type Indicator), we have\ncreated the MBTI-1024 Bank, a group that of virtual characters with distinct\nprofiles. Through improved role-playing prompts with behavior preset and\ndynamic memory, we facilitate the development of the MBTI-S2Conv dataset, which\ncontains conversations between the characters in the MBTI-1024 Bank. Building\nupon these foundations, we present CharacterChat, a comprehensive S2Conv\nsystem, which includes a conversational model driven by personas and memories,\nalong with an interpersonal matching plugin model that dispatches the optimal\nsupporters from the MBTI-1024 Bank for individuals with specific personas.\nEmpirical results indicate the remarkable efficacy of CharacterChat in\nproviding personalized social support and highlight the substantial advantages\nderived from interpersonal matching. The source code is available in\n\\url{https://github.com/morecry/CharacterChat}.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:24:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tu","Quan",""],["Chen","Chuanqi",""],["Li","Jinpeng",""],["Li","Yanran",""],["Shang","Shuo",""],["Zhao","Dongyan",""],["Wang","Ran",""],["Yan","Rui",""]]}
{"id":"2308.10279","submitter":"Tsing Zhang","authors":"Jianqing Zhang, Yang Hua, Hao Wang, Tao Song, Zhengui Xue, Ruhui Ma,\n  Jian Cao, Haibing Guan","title":"GPFL: Simultaneously Learning Global and Personalized Feature\n  Information for Personalized Federated Learning","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Federated Learning (FL) is popular for its privacy-preserving and\ncollaborative learning capabilities. Recently, personalized FL (pFL) has\nreceived attention for its ability to address statistical heterogeneity and\nachieve personalization in FL. However, from the perspective of feature\nextraction, most existing pFL methods only focus on extracting global or\npersonalized feature information during local training, which fails to meet the\ncollaborative learning and personalization goals of pFL. To address this, we\npropose a new pFL method, named GPFL, to simultaneously learn global and\npersonalized feature information on each client. We conduct extensive\nexperiments on six datasets in three statistically heterogeneous settings and\nshow the superiority of GPFL over ten state-of-the-art methods regarding\neffectiveness, scalability, fairness, stability, and privacy. Besides, GPFL\nmitigates overfitting and outperforms the baselines by up to 8.99% in accuracy.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:25:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Jianqing",""],["Hua","Yang",""],["Wang","Hao",""],["Song","Tao",""],["Xue","Zhengui",""],["Ma","Ruhui",""],["Cao","Jian",""],["Guan","Haibing",""]]}
{"id":"2308.10280","submitter":"Chen Feng","authors":"Chen Feng, Hangning Zhou, Huadong Lin, Zhigang Zhang, Ziyao Xu, Chi\n  Zhang, Boyu Zhou, Shaojie Shen","title":"MacFormer: Map-Agent Coupled Transformer for Real-time and Robust\n  Trajectory Prediction","comments":"Accepted by IEEE Robotics and Automation Letters. 8 Pages, 9 Figures,\n  9 Tables. Video: https://www.youtube.com/watch?v=XY388iI6sPQ","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting the future behavior of agents is a fundamental task in autonomous\nvehicle domains. Accurate prediction relies on comprehending the surrounding\nmap, which significantly regularizes agent behaviors. However, existing methods\nhave limitations in exploiting the map and exhibit a strong dependence on\nhistorical trajectories, which yield unsatisfactory prediction performance and\nrobustness. Additionally, their heavy network architectures impede real-time\napplications. To tackle these problems, we propose Map-Agent Coupled\nTransformer (MacFormer) for real-time and robust trajectory prediction. Our\nframework explicitly incorporates map constraints into the network via two\ncarefully designed modules named coupled map and reference extractor. A novel\nmulti-task optimization strategy (MTOS) is presented to enhance learning of\ntopology and rule constraints. We also devise bilateral query scheme in context\nfusion for a more efficient and lightweight network. We evaluated our approach\non Argoverse 1, Argoverse 2, and nuScenes real-world benchmarks, where it all\nachieved state-of-the-art performance with the lowest inference latency and\nsmallest model size. Experiments also demonstrate that our framework is\nresilient to imperfect tracklet inputs. Furthermore, we show that by combining\nwith our proposed strategies, classical models outperform their baselines,\nfurther validating the versatility of our framework.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:27:28 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:23:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Feng","Chen",""],["Zhou","Hangning",""],["Lin","Huadong",""],["Zhang","Zhigang",""],["Xu","Ziyao",""],["Zhang","Chi",""],["Zhou","Boyu",""],["Shen","Shaojie",""]]}
{"id":"2308.10281","submitter":"Zexin Cai","authors":"Zexin Cai, Weiqing Wang, Yikang Wang, Ming Li","title":"The DKU-DUKEECE System for the Manipulation Region Location Task of ADD\n  2023","comments":"The DKU-DukeECE system description to Task 2 of Audio Deepfake\n  Detection Challenge (ADD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces our system designed for Track 2, which focuses on\nlocating manipulated regions, in the second Audio Deepfake Detection Challenge\n(ADD 2023). Our approach involves the utilization of multiple detection systems\nto identify splicing regions and determine their authenticity. Specifically, we\ntrain and integrate two frame-level systems: one for boundary detection and the\nother for deepfake detection. Additionally, we employ a third VAE model trained\nexclusively on genuine data to determine the authenticity of a given audio\nclip. Through the fusion of these three systems, our top-performing solution\nfor the ADD challenge achieves an impressive 82.23% sentence accuracy and an F1\nscore of 60.66%. This results in a final ADD score of 0.6713, securing the\nfirst rank in Track 2 of ADD 2023.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:29:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cai","Zexin",""],["Wang","Weiqing",""],["Wang","Yikang",""],["Li","Ming",""]]}
{"id":"2308.10282","submitter":"Sumin Han","authors":"Sumin Han and Youngjun Park and Minji Lee and Jisun An and Dongman Lee","title":"Enhancing Spatiotemporal Traffic Prediction through Urban Human Activity\n  Analysis","comments":"CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3614867","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Traffic prediction is one of the key elements to ensure the safety and\nconvenience of citizens. Existing traffic prediction models primarily focus on\ndeep learning architectures to capture spatial and temporal correlation. They\noften overlook the underlying nature of traffic. Specifically, the sensor\nnetworks in most traffic datasets do not accurately represent the actual road\nnetwork exploited by vehicles, failing to provide insights into the traffic\npatterns in urban activities. To overcome these limitations, we propose an\nimproved traffic prediction method based on graph convolution deep learning\nalgorithms. We leverage human activity frequency data from National Household\nTravel Survey to enhance the inference capability of a causal relationship\nbetween activity and traffic patterns. Despite making minimal modifications to\nthe conventional graph convolutional recurrent networks and graph convolutional\ntransformer architectures, our approach achieves state-of-the-art performance\nwithout introducing excessive computational overhead.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:31:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Han","Sumin",""],["Park","Youngjun",""],["Lee","Minji",""],["An","Jisun",""],["Lee","Dongman",""]]}
{"id":"2308.10283","submitter":"Pongpisit Thanasutives","authors":"Pongpisit Thanasutives, Takashi Morita, Masayuki Numao, Ken-ichi Fukui","title":"Adaptive Uncertainty-Guided Model Selection for Data-Driven PDE\n  Discovery","comments":"17 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new parameter-adaptive uncertainty-penalized Bayesian\ninformation criterion (UBIC) to prioritize the parsimonious partial\ndifferential equation (PDE) that sufficiently governs noisy spatial-temporal\nobserved data with few reliable terms. Since the naive use of the BIC for model\nselection has been known to yield an undesirable overfitted PDE, the UBIC\npenalizes the found PDE not only by its complexity but also the quantified\nuncertainty, derived from the model supports' coefficient of variation in a\nprobabilistic view. We also introduce physics-informed neural network learning\nas a simulation-based approach to further validate the selected PDE flexibly\nagainst the other discovered PDE. Numerical results affirm the successful\napplication of the UBIC in identifying the true governing PDE. Additionally, we\nreveal an interesting effect of denoising the observed data on improving the\ntrade-off between the BIC score and model complexity. Code is available at\nhttps://github.com/Pongpisit-Thanasutives/UBIC.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:36:45 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 13:47:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Thanasutives","Pongpisit",""],["Morita","Takashi",""],["Numao","Masayuki",""],["Fukui","Ken-ichi",""]]}
{"id":"2308.10284","submitter":"Hadi Nekoei","authors":"Hadi Nekoei, Xutong Zhao, Janarthanan Rajendran, Miao Liu, Sarath\n  Chandar","title":"Towards Few-shot Coordination: Revisiting Ad-hoc Teamplay Challenge In\n  the Game of Hanabi","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Cooperative Multi-agent Reinforcement Learning (MARL) algorithms with\nZero-Shot Coordination (ZSC) have gained significant attention in recent years.\nZSC refers to the ability of agents to coordinate zero-shot (without additional\ninteraction experience) with independently trained agents. While ZSC is crucial\nfor cooperative MARL agents, it might not be possible for complex tasks and\nchanging environments. Agents also need to adapt and improve their performance\nwith minimal interaction with other agents. In this work, we show empirically\nthat state-of-the-art ZSC algorithms have poor performance when paired with\nagents trained with different learning methods, and they require millions of\ninteraction samples to adapt to these new partners. To investigate this issue,\nwe formally defined a framework based on a popular cooperative multi-agent game\ncalled Hanabi to evaluate the adaptability of MARL methods. In particular, we\ncreated a diverse set of pre-trained agents and defined a new metric called\nadaptation regret that measures the agent's ability to efficiently adapt and\nimprove its coordination performance when paired with some held-out pool of\npartners on top of its ZSC performance. After evaluating several SOTA\nalgorithms using our framework, our experiments reveal that naive Independent\nQ-Learning (IQL) agents in most cases adapt as quickly as the SOTA ZSC\nalgorithm Off-Belief Learning (OBL). This finding raises an interesting\nresearch question: How to design MARL algorithms with high ZSC performance and\ncapability of fast adaptation to unseen partners. As a first step, we studied\nthe role of different hyper-parameters and design choices on the adaptability\nof current MARL algorithms. Our experiments show that two categories of\nhyper-parameters controlling the training data diversity and optimization\nprocess have a significant impact on the adaptability of Hanabi agents.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:44:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nekoei","Hadi",""],["Zhao","Xutong",""],["Rajendran","Janarthanan",""],["Liu","Miao",""],["Chandar","Sarath",""]]}
{"id":"2308.10285","submitter":"Jintao Guo","authors":"Jintao Guo, Lei Qi and Yinghuan Shi","title":"DomainDrop: Suppressing Domain-Sensitive Channels for Domain\n  Generalization","comments":"Accepted by ICCV2023. The code is available at\n  https://github.com/lingeringlight/DomainDrop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Neural Networks have exhibited considerable success in various visual\ntasks. However, when applied to unseen test datasets, state-of-the-art models\noften suffer performance degradation due to domain shifts. In this paper, we\nintroduce a novel approach for domain generalization from a novel perspective\nof enhancing the robustness of channels in feature maps to domain shifts. We\nobserve that models trained on source domains contain a substantial number of\nchannels that exhibit unstable activations across different domains, which are\ninclined to capture domain-specific features and behave abnormally when exposed\nto unseen target domains. To address the issue, we propose a DomainDrop\nframework to continuously enhance the channel robustness to domain shifts,\nwhere a domain discriminator is used to identify and drop unstable channels in\nfeature maps of each network layer during forward propagation. We theoretically\nprove that our framework could effectively lower the generalization bound.\nExtensive experiments on several benchmarks indicate that our framework\nachieves state-of-the-art performance compared to other competing methods. Our\ncode is available at https://github.com/lingeringlight/DomainDrop.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:48:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Guo","Jintao",""],["Qi","Lei",""],["Shi","Yinghuan",""]]}
{"id":"2308.10286","submitter":"Jia-Lai Kang","authors":"Jia-Lai Kang, Jun-Xian Wang, Shu-Qi Fu","title":"What can be learnt from a highly informative X-ray occultation event in\n  NGC 6814? A marvellous absorber","comments":"13 pages, 9 figures, accepted by MNRAS. For the video of the\n  eclipsing cloud, see\n  https://drive.google.com/file/d/1CEsPEWE-b5W8PfZINyI5K1sE6klHaYMa/view?usp=sharing\n  . Comments are welcome!","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":"  A unique X-ray occultation event in NGC 6814 during an XMM-Newton observation\nin 2016 has been reported, providing useful information of the absorber and the\ncorona. We revisit the event with the aid of the hardness ratio (HR) - count\nrate (CR) plot and comparison with two other absorption-free XMM exposures in\n2009 and 2021. NGC 6814 exhibits a clear \"softer-when-brighter\" variation\npattern during the exposures, but the 2016 exposure significantly deviates from\nthe other two in the HR - CR plot. While spectral fitting does yield transient\nCompton-thin absorption corresponding to the eclipse event in 2016, rather than\neasing the tension between exposures in the HR - CR plot, correcting the\ntransient Compton-thin absorption results in new and severe deviation within\nthe 2016 exposure. We show that the eclipsing absorber shall be clumpy (instead\nof a single Compton-thin cloud), with an inner denser region composed of both\nCompton-thin and Compton-thick clouds responsible for the previously identified\noccultation event, and an outer sparser region with Compton-thin clouds which\neclipses the whole 2016 exposure. With this model, all the tension in the HR -\nCR plots could be naturally erased, with the observed spectral variability\nduring the 2016 exposure dominated by the variation of absorption. Furthermore,\nthe two warm absorbers (with different ionization and column densities but\nsimilar outflowing velocities) detected in the 2016 exposure shall also\nassociate with the transient absorber, likely due to ablated or tidal\nstretched/disrupted fragments. This work highlights the unique usefulness of\nthe HR - CR plot while analysing rare occultation events.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:52:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kang","Jia-Lai",""],["Wang","Jun-Xian",""],["Fu","Shu-Qi",""]]}
{"id":"2308.10287","submitter":"Runwei Guan","authors":"Runwei Guan, Shanliang Yao, Xiaohui Zhu, Ka Lok Man, Yong Yue, Jeremy\n  Smith, Eng Gee Lim, Yutao Yue","title":"Efficient-VRNet: An Exquisite Fusion Network for Riverway Panoptic\n  Perception based on Asymmetric Fair Fusion of Vision and 4D mmWave Radar","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":"  Panoptic perception is essential to unmanned surface vehicles (USVs) for\nautonomous navigation. The current panoptic perception scheme is mainly based\non vision only, that is, object detection and semantic segmentation are\nperformed simultaneously based on camera sensors. Nevertheless, the fusion of\ncamera and radar sensors is regarded as a promising method which could\nsubstitute pure vision methods, but almost all works focus on object detection\nonly. Therefore, how to maximize and subtly fuse the features of vision and\nradar to improve both detection and segmentation is a challenge. In this paper,\nwe focus on riverway panoptic perception based on USVs, which is a considerably\nunexplored field compared with road panoptic perception. We propose\nEfficient-VRNet, a model based on Contextual Clustering (CoC) and the\nasymmetric fusion of vision and 4D mmWave radar, which treats both vision and\nradar modalities fairly. Efficient-VRNet can simultaneously perform detection\nand segmentation of riverway objects and drivable area segmentation.\nFurthermore, we adopt an uncertainty-based panoptic perception training\nstrategy to train Efficient-VRNet. In the experiments, our Efficient-VRNet\nachieves better performances on our collected dataset than other uni-modal\nmodels, especially in adverse weather and environment with poor lighting\nconditions. Our code and models are available at\n\\url{https://github.com/GuanRunwei/Efficient-VRNet}.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:53:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Guan","Runwei",""],["Yao","Shanliang",""],["Zhu","Xiaohui",""],["Man","Ka Lok",""],["Yue","Yong",""],["Smith","Jeremy",""],["Lim","Eng Gee",""],["Yue","Yutao",""]]}
{"id":"2308.10288","submitter":"Am\\'elie Loher","authors":"William Golding and Am\\'elie Loher","title":"Local-in-time strong solutions of the homogeneous Landau-Coulomb with\n  $L^p$ initial datum","comments":"19 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 article, we show local-in-time existence of strong solutions to the\nhomogeneous Landau equation with Coulomb potential for general initial datum\n$f_{in} \\in L^p$ for $p$ arbitrarily close to $3/2$. The constraint $p > 3/2$\nhas appeared in several related works and appears to be the minimal\nintegrability assumption achievable with current techniques. We adapt recent\nODE methods and conditional regularity results appearing in [arXiv:2303.02281]\nto produce new short time a priori smoothing estimates for large $L^p$ data,\nprovided $p > 3/2$. These estimates enable us to construct local-in-time strong\nsolutions for the corresponding initial data, but also enable us to show\ndirectly a large number of unweighted Prodi-Serrin type results, providing a\nform of weak-strong uniqueness for our solutions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:55:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Golding","William",""],["Loher","Am\u00e9lie",""]]}
{"id":"2308.10289","submitter":"Anton Glushchenko","authors":"Anton Glushchenko and Konstantin Lastochkin","title":"Parameter Estimation-Based States Reconstruction of Uncertain Linear\n  Systems with Overparameterization and Unknown Additive Perturbations","comments":"7 pages, 3 figures. arXiv admin note: text overlap with\n  arXiv:2302.13705","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of state reconstruction is considered for uncertain linear\ntime-invariant systems with overparametrization, arbitrary state-space matrices\nand unknown additive perturbation described by an exosystem. A novel adaptive\nobserver is proposed to solve it, which, unlike known solutions,\nsimultaneously: (i) reconstructs the physical state of the original system\nrather than the virtual state of its observer canonical form, (ii) ensures\nexponential convergence of the reconstruction error to zero when the condition\nof finite excitation is satisfied, (iii) is applicable to systems, in which\nmentioned perturbation is generated by an exosystem with fully uncertain\nconstant parameters. The proposed solution uses a recently published\nparametrization of uncertain linear systems with unknown additive\nperturbations, the dynamic regressor extension and mixing procedure, as well as\na method of physical states reconstruction developed by the authors. Detailed\nanalysis for stability and convergence has been provided along with simulation\nresults to validate the results of the theoretical analysis.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:57:31 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 06:06:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Glushchenko","Anton",""],["Lastochkin","Konstantin",""]]}
{"id":"2308.10290","submitter":"Jindiao Huang","authors":"Jindiao Huang, Yuyao Wu, Haifan Yin, Yuhao Zhang and Ruikun Zhang","title":"Channel sensing for holographic MIMO surfaces based on interference\n  principle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Holographic Multiple-Input and Multiple-Output (HMIMO) provides a new\nparadigm for building a more cost-effective wireless communication\narchitecture. In this paper, we derive the principles of holographic\ninterference theory for electromagnetic wave reception and transmission,\nwhereby the optical holography is extended to communication holography and a\nchannel sensing architecture for holographic MIMO surfaces is established.\nUnlike the traditional pilot-based MIMO channel estimation approaches, the\nproposed architecture circumvents the complicated processes like filtering,\nanalog to digital conversion (ADC), down conversion. Instead, it relies on\ninterfering the object waves with a pre-designed reference wave, and therefore\nreduces the hardware complexity and requires less time-frequency resources for\nchannel estimation. To address the self-interference problem in the holographic\nrecording process, we propose a phase shifting-based interference suppression\n(PSIS) method according to the structural characteristics of communication\nhologram and interference composition. We then propose a Prony-based multi-user\nchannel segmentation (PMCS) algorithm to acquire the channel state information\n(CSI). Our theoretical analysis shows that the estimation error of the PMCS\nalgorithm converges to zero when the number of HMIMO surface antennas is large\nenough. Simulation results show that under the holographic architecture, our\nproposed algorithm can accurately estimate the CSI in multi-user scenarios.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:08:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Jindiao",""],["Wu","Yuyao",""],["Yin","Haifan",""],["Zhang","Yuhao",""],["Zhang","Ruikun",""]]}
{"id":"2308.10291","submitter":"Barry Simon","authors":"Barry Simon","title":"Fritz and Me-Perspectives in Inverse Spectral Theory","comments":"For Gesztesy 70th birthday Feschrift to appear in the journal Pure\n  and Applied Functional Analysis","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a pedagogic introduction to certain aspects of inverse spectral\ntheory for Schr\\\"{o}dinger operators and Jacobi matrices that revolves around\nmy joint work with Fritz Gesztesy whose $70^{th}$ birthday we are honoring.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:17:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Simon","Barry",""]]}
{"id":"2308.10292","submitter":"Hao Lu","authors":"Hao Lu, Austin M. Bray, Chao Hu, Andrew T. Zimmerman, Hongyi Xu","title":"An interpretable deep learning method for bearing fault diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning (DL) has gained popularity in recent years as an effective tool\nfor classifying the current health and predicting the future of industrial\nequipment. However, most DL models have black-box components with an underlying\nstructure that is too complex to be interpreted and explained to human users.\nThis presents significant challenges when deploying these models for\nsafety-critical maintenance tasks, where non-technical personnel often need to\nhave complete trust in the recommendations these models give. To address these\nchallenges, we utilize a convolutional neural network (CNN) with\nGradient-weighted Class Activation Mapping (Grad-CAM) activation map\nvisualizations to form an interpretable DL method for classifying bearing\nfaults. After the model training process, we apply Grad-CAM to identify a\ntraining sample's feature importance and to form a library of diagnosis\nknowledge (or health library) containing training samples with annotated\nfeature maps. During the model evaluation process, the proposed approach\nretrieves prediction basis samples from the health library according to the\nsimilarity of the feature importance. The proposed method can be easily applied\nto any CNN model without modifying the model architecture, and our experimental\nresults show that this method can select prediction basis samples that are\nintuitively and physically meaningful, improving the model's trustworthiness\nfor human users.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:22:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lu","Hao",""],["Bray","Austin M.",""],["Hu","Chao",""],["Zimmerman","Andrew T.",""],["Xu","Hongyi",""]]}
{"id":"2308.10293","submitter":"Qi Li","authors":"Qi Li, Ziyi Shen, Qian Li, Dean C. Barratt, Thomas Dowrick, Matthew J.\n  Clarkson, Tom Vercauteren and Yipeng Hu","title":"Privileged Anatomical and Protocol Discrimination in Trackerless 3D\n  Ultrasound Reconstruction","comments":"Accepted to Advances in Simplifying Medical UltraSound (ASMUS)\n  workshop at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Three-dimensional (3D) freehand ultrasound (US) reconstruction without using\nany additional external tracking device has seen recent advances with deep\nneural networks (DNNs). In this paper, we first investigated two identified\ncontributing factors of the learned inter-frame correlation that enable the\nDNN-based reconstruction: anatomy and protocol. We propose to incorporate the\nability to represent these two factors - readily available during training - as\nthe privileged information to improve existing DNN-based methods. This is\nimplemented in a new multi-task method, where the anatomical and protocol\ndiscrimination are used as auxiliary tasks. We further develop a differentiable\nnetwork architecture to optimise the branching location of these auxiliary\ntasks, which controls the ratio between shared and task-specific network\nparameters, for maximising the benefits from the two auxiliary tasks.\nExperimental results, on a dataset with 38 forearms of 19 volunteers acquired\nwith 6 different scanning protocols, show that 1) both anatomical and protocol\nvariances are enabling factors for DNN-based US reconstruction; 2) learning how\nto discriminate different subjects (anatomical variance) and predefined types\nof scanning paths (protocol variance) both significantly improve frame\nprediction accuracy, volume reconstruction overlap, accumulated tracking error\nand final drift, using the proposed algorithm.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:30:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Qi",""],["Shen","Ziyi",""],["Li","Qian",""],["Barratt","Dean C.",""],["Dowrick","Thomas",""],["Clarkson","Matthew J.",""],["Vercauteren","Tom",""],["Hu","Yipeng",""]]}
{"id":"2308.10294","submitter":"Antigoni Kruti","authors":"Antigoni Kruti, Usman Butt, Rejwan Sulaiman","title":"A review of SolarWinds attack on Orion platform using persistent threat\n  agents anf techniques for gaining unauthorized access","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper of work examines the SolarWinds attack, designed on Orion Platform\nsecurity incident. It analyses the persistent threats agents and potential\ntechnical attack techniques to gain unauthorized access. In 2020 SolarWinds\nattack indicates an initial breach disclosure on Orion Platform software by\nmalware distribution on IT and government organizations such as Homeland\nSecurity, Microsoft and Intel associated with supply chains leaks consequences\nfrom small loopholes in security systems. Hackers increased the number of\ninfected company and businesses networks during the supply-chain attack,\nhackers were capable to propagate the attack by using a VMware exploit. On the\nspecial way they started to target command injections, privilege escalations,\nand use after free platforms of VMware. In this way, they gained access to\nVirtual Machines and in the east way pivot other servers. This literature\nreview aim to analyze the security gap regarding to SolarWinds incident on\nOrion Platform, the impact on industry and financial sectors involving the\nelements of incident response plan. Therefore, this research paper ensures\nspecifications of proper solutions for possible defense security systems by\nanalyzing a SolarWinds attack case study via system evaluation and monitoring.\nIt concludes with necessary remediation actions on cyber hygiene\ncountermeasures, common vulnerabilities and exposure analysis and solutions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:32:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kruti","Antigoni",""],["Butt","Usman",""],["Sulaiman","Rejwan",""]]}
{"id":"2308.10295","submitter":"Bhaskar Sen Gupta","authors":"Daniya Davis and Bhaskar Sen Gupta","title":"Kinetics Of Vapor-Liquid Phase Separation Under Gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the kinetics of vapor-liquid phase separation of a hydrodynamics\npreserving three-dimensional one component Lennard Jones system in the presence\nof external gravitational field using extensive molecular dynamic simulation. A\nbicontinuous domain structure is formed when the homogeneous system near the\ncritical density is quenched inside the coexistence region. In the absence of\ngravity, the domain morphology is statistically self-similar and the length\nscale grows linearly with time. However, the presence of gravity destroys the\nisotropy of the system and affects the scaling laws. We observe an accelerated\ndomain growth in the direction of the field at late time which resembles\nsedimentation process. Consequently, a new length scale emerges which strongly\ndepends on the field strength. Similar behavior is observed in the direction\nperpendicular to the applied field, with a different growth rate. Finally, the\nvalidity of Porod's law and Superuniversality in such anisotropic systems is\nverified in terms of two-point equal time order parameter correlation function\nand static structure factor.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:32:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Davis","Daniya",""],["Gupta","Bhaskar Sen",""]]}
{"id":"2308.10296","submitter":"Henri Lombardi","authors":"Henri Lombardi","title":"Dimension de Krull, Nullstellens\\\"atze et \\'Evaluation Dynamique","comments":"in French language","journal-ref":"Mathematische Zeitschrift, 242, 23--46 (2002)","doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove constructively a Nullstellensatz giving an equivalence between the\nexistence of a certain kind of algebraic identity on one hand, and the\nimpossibility of finding an increasing sequence of irreducible varieties\nobeying certain constraints on the other hand. The ususal Nullstellensatz\ncorresponds to the case of varieties that are reduced to a point. We settle\nalso a similar formal Nullstellensatz related to increasing sequences of\nprimes. An important particular case is given by the notion of pseudo regular\nsequence. This allows a new characterisation of the Krull dimension of a ring.\nThis characterisation via pseudo regular sequences is elementary and\nconstructive. Our method uses dynamical algebraic structures which were\nintroduced in previous papers.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:35:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lombardi","Henri",""]]}
{"id":"2308.10297","submitter":"Jian Zhang","authors":"Jian Zhang, Lei Qi, Yinghuan Shi, Yang Gao","title":"DomainAdaptor: A Novel Approach to Test-time Adaptation","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":"  To deal with the domain shift between training and test samples, current\nmethods have primarily focused on learning generalizable features during\ntraining and ignore the specificity of unseen samples that are also critical\nduring the test. In this paper, we investigate a more challenging task that\naims to adapt a trained CNN model to unseen domains during the test. To\nmaximumly mine the information in the test data, we propose a unified method\ncalled DomainAdaptor for the test-time adaptation, which consists of an\nAdaMixBN module and a Generalized Entropy Minimization (GEM) loss.\nSpecifically, AdaMixBN addresses the domain shift by adaptively fusing training\nand test statistics in the normalization layer via a dynamic mixture\ncoefficient and a statistic transformation operation. To further enhance the\nadaptation ability of AdaMixBN, we design a GEM loss that extends the Entropy\nMinimization loss to better exploit the information in the test data. Extensive\nexperiments show that DomainAdaptor consistently outperforms the\nstate-of-the-art methods on four benchmarks. Furthermore, our method brings\nmore remarkable improvement against existing methods on the few-data unseen\ndomain. The code is available at https://github.com/koncle/DomainAdaptor.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:37:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Jian",""],["Qi","Lei",""],["Shi","Yinghuan",""],["Gao","Yang",""]]}
{"id":"2308.10298","submitter":"Yufeng Zhan","authors":"Tianyu Qi and Yufeng Zhan and Peng Li and Jingcai Guo and Yuanqing Xia","title":"Arena: A Learning-based Synchronization Scheme for Hierarchical\n  Federated Learning--Technical Report","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Federated learning (FL) enables collaborative model training among\ndistributed devices without data sharing, but existing FL suffers from poor\nscalability because of global model synchronization. To address this issue,\nhierarchical federated learning (HFL) has been recently proposed to let edge\nservers aggregate models of devices in proximity, while synchronizing via the\ncloud periodically. However, a critical open challenge about how to make a good\nsynchronization scheme (when devices and edges should be synchronized) is still\nunsolved. Devices are heterogeneous in computing and communication capability,\nand their data could be non-IID. No existing work can well synchronize various\nroles (\\textit{e.g.}, devices and edges) in HFL to guarantee high learning\nefficiency and accuracy. In this paper, we propose a learning-based\nsynchronization scheme for HFL systems. By collecting data such as edge models,\nCPU usage, communication time, \\textit{etc}., we design a deep reinforcement\nlearning-based approach to decide the frequencies of cloud aggregation and edge\naggregation, respectively. The proposed scheme well considers device\nheterogeneity, non-IID data and device mobility, to maximize the training model\naccuracy while minimizing the energy overhead. Meanwhile, the convergence bound\nof the proposed synchronization scheme has been analyzed. And we build an HFL\ntestbed and conduct the experiments with real data obtained from Raspberry Pi\nand Alibaba Cloud. Extensive experiments under various settings are conducted\nto confirm the effectiveness of \\textit{Arena}.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:37:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qi","Tianyu",""],["Zhan","Yufeng",""],["Li","Peng",""],["Guo","Jingcai",""],["Xia","Yuanqing",""]]}
{"id":"2308.10299","submitter":"Kunyu Wang","authors":"Kunyu Wang, Xuanran He, Wenxuan Wang and Xiaosen Wang","title":"Boosting Adversarial Transferability by Block Shuffle and Rotation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adversarial examples mislead deep neural networks with imperceptible\nperturbations and have brought significant threats to deep learning. An\nimportant aspect is their transferability, which refers to their ability to\ndeceive other models, thus enabling attacks in the black-box setting. Though\nvarious methods have been proposed to boost transferability, the performance\nstill falls short compared with white-box attacks. In this work, we observe\nthat existing input transformation based attacks, one of the mainstream\ntransfer-based attacks, result in different attention heatmaps on various\nmodels, which might limit the transferability. We also find that breaking the\nintrinsic relation of the image can disrupt the attention heatmap of the\noriginal image. Based on this finding, we propose a novel input transformation\nbased attack called block shuffle and rotation (BSR). Specifically, BSR splits\nthe input image into several blocks, then randomly shuffles and rotates these\nblocks to construct a set of new images for gradient calculation. Empirical\nevaluations on the ImageNet dataset demonstrate that BSR could achieve\nsignificantly better transferability than the existing input transformation\nbased methods under single-model and ensemble-model settings. Combining BSR\nwith the current input transformation method can further improve the\ntransferability, which significantly outperforms the state-of-the-art methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:38:40 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 04:25:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Kunyu",""],["He","Xuanran",""],["Wang","Wenxuan",""],["Wang","Xiaosen",""]]}
{"id":"2308.10300","submitter":"Shahin Atashbar Tehrani","authors":"Fatemeh Arbabifar, Shahin Atashbar Tehrani, Hamzeh Khanpour","title":"Effect of symmetry breaking of polarized light sea quarks on the nucleon\n  and nuclear structure functions, and sum rules","comments":"13 pages, 12 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 study, we performed calculations and analyses of the structure\nfunctions of polarized nucleons and light nuclei, specifically $^3$He and\n$^3$H, using second-order Feynman diagrams. Our investigation focused on two\nmain aspects: Firstly, we examined the symmetry properties of polarized light\nsea quarks. Secondly, we conducted a detailed investigation into the impacts of\nsymmetry breaking on the structure functions of both nucleons and nuclei. To\nachieve this, we utilized the existing polarized Parton Distribution Functions\n(polarized PDFs) available in the literature. These PDFs were used to calculate\nand compare the polarized structure functions $g_1$ and $g_2$ of the nuclei.\nAdditionally, we examined and analyzed the Bjorken and Efremov-Leader-Teryaev\nsum rules by utilizing the moments of the polarized structure functions. The\nLorentz color force components, namely $F_E^{y,n}$ and $F_B^{y,n}$, are\ndetermined using the twist-2, twist-3, and twist-4 matrix elements. When\nsymmetry breaking is applied, it is observed that they have similar magnitudes\nbut opposite signs. Our theoretical predictions for the polarized structure\nfunctions of nucleons and light nuclei, taking into account the symmetry\nbreaking of light sea quarks, exhibit better agreement with experimental data.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:48:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Arbabifar","Fatemeh",""],["Tehrani","Shahin Atashbar",""],["Khanpour","Hamzeh",""]]}
{"id":"2308.10301","submitter":"Qizheng He","authors":"Qizheng He","title":"Improved Algorithms for Integer Complexity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integer complexity $f(n)$ of a positive integer $n$ is defined as the\nminimum number of 1's needed to represent $n$, using additions, multiplications\nand parentheses. We present two simple and faster algorithms for computing the\ninteger complexity:\n  1) A near-optimal $O(N\\mathop{\\mathrm{polylog}} N)$-time algorithm for\ncomputing the integer complexity of all $n\\leq N$, improving the previous\n$O(N^{1.223})$ one [Cordwell et al., 2017].\n  2) The first sublinear-time algorithm for computing the integer complexity of\na single $n$, with running time $O(n^{0.6154})$. The previous algorithms for\ncomputing a single $f(n)$ require computing all $f(1),\\dots,f(n)$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:52:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Qizheng",""]]}
{"id":"2308.10302","submitter":"Qianqian Wang","authors":"Junhao Zhang, Qianqian Wang, Xiaochuan Wang, Lishan Qiao, Mingxia Liu","title":"Preserving Specificity in Federated Graph Learning for fMRI-based\n  Neurological Disorder Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Resting-state functional magnetic resonance imaging (rs-fMRI) offers a\nnon-invasive approach to examining abnormal brain connectivity associated with\nbrain disorders. Graph neural network (GNN) gains popularity in fMRI\nrepresentation learning and brain disorder analysis with powerful graph\nrepresentation capabilities. Training a general GNN often necessitates a\nlarge-scale dataset from multiple imaging centers/sites, but centralizing\nmulti-site data generally faces inherent challenges related to data privacy,\nsecurity, and storage burden. Federated Learning (FL) enables collaborative\nmodel training without centralized multi-site fMRI data. Unfortunately,\nprevious FL approaches for fMRI analysis often ignore site-specificity,\nincluding demographic factors such as age, gender, and education level. To this\nend, we propose a specificity-aware federated graph learning (SFGL) framework\nfor rs-fMRI analysis and automated brain disorder identification, with a server\nand multiple clients/sites for federated model aggregation and prediction. At\neach client, our model consists of a shared and a personalized branch, where\nparameters of the shared branch are sent to the server while those of the\npersonalized branch remain local. This can facilitate knowledge sharing among\nsites and also helps preserve site specificity. In the shared branch, we employ\na spatio-temporal attention graph isomorphism network to learn dynamic fMRI\nrepresentations. In the personalized branch, we integrate vectorized\ndemographic information (i.e., age, gender, and education years) and functional\nconnectivity networks to preserve site-specific characteristics.\nRepresentations generated by the two branches are then fused for\nclassification. Experimental results on two fMRI datasets with a total of 1,218\nsubjects suggest that SFGL outperforms several state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:55:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Junhao",""],["Wang","Qianqian",""],["Wang","Xiaochuan",""],["Qiao","Lishan",""],["Liu","Mingxia",""]]}
{"id":"2308.10303","submitter":"Kaushik Mohanta","authors":"Kaushik Mohanta and Jagmohan Tyagi","title":"Improved Hardy inequalities on Riemannian Manifolds","comments":"Accepted for publication in Complex Variables and Elliptic Equations","journal-ref":null,"doi":"10.1080/17476933.2023.2247998","report-no":null,"categories":"math.AP math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the following version of Hardy-type inequality on a domain $\\Omega$\nin a Riemannian manifold $(M,g)$:\n  $$\n  \\int{\\Omega}|\\nabla u|_g^p\\rho^\\alpha dV_g\n  \\geq \\left(\\frac{|p-1+\\beta|}{p}\\right)^p\\int{\\Omega}\\frac{|u|^p|\\nabla\n\\rho|_g^p}{|\\rho|^p}\\rho^\\alpha dV_g\n  +\\int{\\Omega} V|u|^p\\rho^\\alpha dV_g,\n  \\quad \\forall\\ u\\in C_c^\\infty (\\Omega).\n  $$\n  We provide sufficient conditions on $p, \\alpha, \\beta,\\rho$ and $V$ for which\nthe above inequality holds. This generalizes earlier well-known works on Hardy\ninequalities on Riemannian manifolds. The functional setup covers a wide\nvariety of particular cases, which are discussed briefly: for example,\n$\\mathbb{R}^N$ with $p<N$, $\\mathbb{R}^N\\setminus \\{0\\}$ with $p\\geq N$,\n$\\mathbb{H}^N$, etc.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 15:59:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mohanta","Kaushik",""],["Tyagi","Jagmohan",""]]}
{"id":"2308.10304","submitter":"Fatemeh Kaveh-Yazdy","authors":"Fatemeh Kaveh-Yazdy, Sajjad Zarifzadeh","title":"Economic Policy Uncertainty: A Review on Applications and Measurement\n  Methods with Focus on Text Mining Methods","comments":"JEL Classification: C53, C38, A13, O38, H50","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Economic Policy Uncertainty (EPU) represents the uncertainty realized by the\ninvestors during economic policy alterations. EPU is a critical indicator in\neconomic studies to predict future investments, the unemployment rate, and\nrecessions. EPU values can be estimated based on financial parameters directly\nor implied uncertainty indirectly using the text mining methods. Although EPU\nis a well-studied topic within the economy, the methods utilized to measure it\nare understudied. In this article, we define the EPU briefly and review the\nmethods used to measure the EPU, and survey the areas influenced by the changes\nin EPU level. We divide the EPU measurement methods into three major groups\nwith respect to their input data. Examples of each group of methods are\nenlisted, and the pros and cons of the groups are discussed. Among the EPU\nmeasures, text mining-based ones are dominantly studied. These methods measure\nthe realized uncertainty by taking into account the uncertainty represented in\nthe news and publicly available sources of financial information. Finally, we\nsurvey the research areas that rely on measuring the EPU index with the hope\nthat studying the impacts of uncertainty would attract further attention of\nresearchers from various research fields. In addition, we propose a list of\nfuture research approaches focusing on measuring EPU using textual material.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:00:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaveh-Yazdy","Fatemeh",""],["Zarifzadeh","Sajjad",""]]}
{"id":"2308.10305","submitter":"Yingxuan You","authors":"Yingxuan You, Hong Liu, Ti Wang, Wenhao Li, Runwei Ding, Xia Li","title":"Co-Evolution of Pose and Mesh for 3D Human Body Estimation from Video","comments":"Accepted by ICCV 2023. Project page: https://kasvii.github.io/PMCE","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":"  Despite significant progress in single image-based 3D human mesh recovery,\naccurately and smoothly recovering 3D human motion from a video remains\nchallenging. Existing video-based methods generally recover human mesh by\nestimating the complex pose and shape parameters from coupled image features,\nwhose high complexity and low representation ability often result in\ninconsistent pose motion and limited shape patterns. To alleviate this issue,\nwe introduce 3D pose as the intermediary and propose a Pose and Mesh\nCo-Evolution network (PMCE) that decouples this task into two parts: 1)\nvideo-based 3D human pose estimation and 2) mesh vertices regression from the\nestimated 3D pose and temporal image feature. Specifically, we propose a\ntwo-stream encoder that estimates mid-frame 3D pose and extracts a temporal\nimage feature from the input image sequence. In addition, we design a\nco-evolution decoder that performs pose and mesh interactions with the\nimage-guided Adaptive Layer Normalization (AdaLN) to make pose and mesh fit the\nhuman body shape. Extensive experiments demonstrate that the proposed PMCE\noutperforms previous state-of-the-art methods in terms of both per-frame\naccuracy and temporal consistency on three benchmark datasets: 3DPW, Human3.6M,\nand MPI-INF-3DHP. Our code is available at https://github.com/kasvii/PMCE.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:03:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["You","Yingxuan",""],["Liu","Hong",""],["Wang","Ti",""],["Li","Wenhao",""],["Ding","Runwei",""],["Li","Xia",""]]}
{"id":"2308.10306","submitter":"Jinyu Chen","authors":"Jinyu Chen, Wenguan Wang, Si Liu, Hongsheng Li, Yi Yang","title":"Omnidirectional Information Gathering for Knowledge Transfer-based\n  Audio-Visual Navigation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Audio-visual navigation is an audio-targeted wayfinding task where a robot\nagent is entailed to travel a never-before-seen 3D environment towards the\nsounding source. In this article, we present ORAN, an omnidirectional\naudio-visual navigator based on cross-task navigation skill transfer. In\nparticular, ORAN sharpens its two basic abilities for a such challenging task,\nnamely wayfinding and audio-visual information gathering. First, ORAN is\ntrained with a confidence-aware cross-task policy distillation (CCPD) strategy.\nCCPD transfers the fundamental, point-to-point wayfinding skill that is well\ntrained on the large-scale PointGoal task to ORAN, so as to help ORAN to better\nmaster audio-visual navigation with far fewer training samples. To improve the\nefficiency of knowledge transfer and address the domain gap, CCPD is made to be\nadaptive to the decision confidence of the teacher policy. Second, ORAN is\nequipped with an omnidirectional information gathering (OIG) mechanism, i.e.,\ngleaning visual-acoustic observations from different directions before\ndecision-making. As a result, ORAN yields more robust navigation behaviour.\nTaking CCPD and OIG together, ORAN significantly outperforms previous\ncompetitors. After the model ensemble, we got 1st in Soundspaces Challenge\n2022, improving SPL and SR by 53% and 35% relatively.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:03:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Jinyu",""],["Wang","Wenguan",""],["Liu","Si",""],["Li","Hongsheng",""],["Yang","Yi",""]]}
{"id":"2308.10307","submitter":"Hao Yang","authors":"Yougang Xiao, Hao Yang, Huan Liu, Keyu Wu, Guohua Wu","title":"UAV 3-D path planning based on MOEA/D with adaptive areal weight\n  adjustment","comments":"23 pages,11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unmanned aerial vehicles (UAVs) are desirable platforms for time-efficient\nand cost-effective task execution. 3-D path planning is a key challenge for\ntask decision-making. This paper proposes an improved multi-objective\nevolutionary algorithm based on decomposition (MOEA/D) with an adaptive areal\nweight adjustment (AAWA) strategy to make a tradeoff between the total flight\npath length and the terrain threat. AAWA is designed to improve the diversity\nof the solutions. More specifically, AAWA first removes a crowded individual\nand its weight vector from the current population and then adds a sparse\nindividual from the external elite population to the current population. To\nenable the newly-added individual to evolve towards the sparser area of the\npopulation in the objective space, its weight vector is constructed by the\nobjective function value of its neighbors. The effectiveness of MOEA/D-AAWA is\nvalidated in twenty synthetic scenarios with different number of obstacles and\nfour realistic scenarios in comparison with other three classical methods.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:05:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xiao","Yougang",""],["Yang","Hao",""],["Liu","Huan",""],["Wu","Keyu",""],["Wu","Guohua",""]]}
{"id":"2308.10308","submitter":"Yanjing Li","authors":"Yanjing Li, Sheng Xu, Mingbao Lin, Jihao Yin, Baochang Zhang, Xianbin\n  Cao","title":"Representation Disparity-aware Distillation for 3D Object Detection","comments":"Accepted by ICCV2023. arXiv admin note: text overlap with\n  arXiv:2205.15156 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we focus on developing knowledge distillation (KD) for compact\n3D detectors. We observe that off-the-shelf KD methods manifest their efficacy\nonly when the teacher model and student counterpart share similar intermediate\nfeature representations. This might explain why they are less effective in\nbuilding extreme-compact 3D detectors where significant representation\ndisparity arises due primarily to the intrinsic sparsity and irregularity in 3D\npoint clouds. This paper presents a novel representation disparity-aware\ndistillation (RDD) method to address the representation disparity issue and\nreduce performance gap between compact students and over-parameterized\nteachers. This is accomplished by building our RDD from an innovative\nperspective of information bottleneck (IB), which can effectively minimize the\ndisparity of proposal region pairs from student and teacher in features and\nlogits. Extensive experiments are performed to demonstrate the superiority of\nour RDD over existing KD methods. For example, our RDD increases mAP of\nCP-Voxel-S to 57.1% on nuScenes dataset, which even surpasses teacher\nperformance while taking up only 42% FLOPs.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:06:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yanjing",""],["Xu","Sheng",""],["Lin","Mingbao",""],["Yin","Jihao",""],["Zhang","Baochang",""],["Cao","Xianbin",""]]}
{"id":"2308.10309","submitter":"Aman Saggu","authors":"Lennart Ante, Friedrich-Philipp Wazinski, Aman Saggu","title":"Digital Real Estate in the Metaverse: An Empirical Analysis of Retail\n  Investor Motivations","comments":"27 pages, 1 figure, 4 tables, 1 appendix table","journal-ref":"Finance Research Letters, Volume 58, Part A, 104299 (2023)","doi":"10.1016/j.frl.2023.104299","report-no":null,"categories":"q-fin.GN","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper investigates retail investor motivations for digital real estate\nownership in the crypto-metaverse. Utilizing a detailed financial behavior\nsurvey of metaverse landowners' intrinsic and extrinsic motivations, we apply\nprincipal components analysis to uncover four distinct motivational groups: (1)\nAesthetics and Identity, (2) Social and Community, (3) Speculation and\nInvestment, and (4) Innovation and Technology. Our findings reveal that age,\neducation, investment knowledge, risk-taking, and impulsivity significantly\ninfluence investor group membership. This research provides valuable insights\nto investors and developers, underscoring the potential of a platform to\nattract retail investors with speculative intentions, engagement longevity, and\npassive or active trading characteristics, contingent on unique\ncrypto-metaverse attributes.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:08:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ante","Lennart",""],["Wazinski","Friedrich-Philipp",""],["Saggu","Aman",""]]}
{"id":"2308.10310","submitter":"Yihua Cheng","authors":"Yihua Cheng and Feng Lu","title":"DVGaze: Dual-View Gaze Estimation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gaze estimation methods estimate gaze from facial appearance with a single\ncamera. However, due to the limited view of a single camera, the captured\nfacial appearance cannot provide complete facial information and thus\ncomplicate the gaze estimation problem. Recently, camera devices are rapidly\nupdated. Dual cameras are affordable for users and have been integrated in many\ndevices. This development suggests that we can further improve gaze estimation\nperformance with dual-view gaze estimation. In this paper, we propose a\ndual-view gaze estimation network (DV-Gaze). DV-Gaze estimates dual-view gaze\ndirections from a pair of images. We first propose a dual-view interactive\nconvolution (DIC) block in DV-Gaze. DIC blocks exchange dual-view information\nduring convolution in multiple feature scales. It fuses dual-view features\nalong epipolar lines and compensates for the original feature with the fused\nfeature. We further propose a dual-view transformer to estimate gaze from\ndual-view features. Camera poses are encoded to indicate the position\ninformation in the transformer. We also consider the geometric relation between\ndual-view gaze directions and propose a dual-view gaze consistency loss for\nDV-Gaze. DV-Gaze achieves state-of-the-art performance on ETH-XGaze and EVE\ndatasets. Our experiments also prove the potential of dual-view gaze\nestimation. We release codes in https://github.com/yihuacheng/DVGaze.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:14:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cheng","Yihua",""],["Lu","Feng",""]]}
{"id":"2308.10311","submitter":"Ehsan Saeediade","authors":"Ehsan Saeedizade, Roya Taheri, Engin Arslan","title":"I/O Burst Prediction for HPC Clusters using Darshan Logs","comments":"10 pages, 11 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding cluster-wide I/O patterns of large-scale HPC clusters is\nessential to minimize the occurrence and impact of I/O interference. Yet, most\nprevious work in this area focused on monitoring and predicting task and\nnode-level I/O burst events. This paper analyzes Darshan reports from three\nsupercomputers to extract system-level read and write I/O rates in five minutes\nintervals. We observe significant (over 100x) fluctuations in read and write\nI/O rates in all three clusters. We then train machine learning models to\nestimate the occurrence of system-level I/O bursts 5 - 120 minutes ahead.\nEvaluation results show that we can predict I/O bursts with more than 90%\naccuracy (F-1 score) five minutes ahead and more than 87% accuracy two hours\nahead. We also show that the ML models attain more than 70% accuracy when\nestimating the degree of the I/O burst. We believe that high-accuracy\npredictions of I/O bursts can be used in multiple ways, such as postponing\ndelay-tolerant I/O operations (e.g., checkpointing), pausing nonessential\napplications (e.g., file system scrubbers), and devising I/O-aware job\nscheduling methods. To validate this claim, we simulated a burst-aware job\nscheduler that can postpone the start time of applications to avoid I/O bursts.\nWe show that the burst-aware job scheduling can lead to an up to 5x decrease in\napplication runtime.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:16:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saeedizade","Ehsan",""],["Taheri","Roya",""],["Arslan","Engin",""]]}
{"id":"2308.10312","submitter":"Ehsan Saeediade","authors":"Ehsan Saeedizade, Bing Zhang, Engin Arslan","title":"Demystifying the Performance of Data Transfers in High-Performance\n  Research Networks","comments":"11 pages, 7 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.DC cs.LG cs.NI cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-speed research networks are built to meet the ever-increasing needs of\ndata-intensive distributed workflows. However, data transfers in these networks\noften fail to attain the promised transfer rates for several reasons, including\nI/O and network interference, server misconfigurations, and network anomalies.\nAlthough understanding the root causes of performance issues is critical to\nmitigating them and increasing the utilization of expensive network\ninfrastructures, there is currently no available mechanism to monitor data\ntransfers in these networks. In this paper, we present a scalable, end-to-end\nmonitoring framework to gather and store key performance metrics for file\ntransfers to shed light on the performance of transfers. The evaluation results\nshow that the proposed framework can monitor up to 400 transfers per host and\nmore than 40, 000 transfers in total while collecting performance statistics at\none-second precision. We also introduce a heuristic method to automatically\nprocess the gathered performance metrics and identify the root causes of\nperformance anomalies with an F-score of 87 - 98%.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:17:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saeedizade","Ehsan",""],["Zhang","Bing",""],["Arslan","Engin",""]]}
{"id":"2308.10313","submitter":"Fatemeh Nazari","authors":"Fatemeh Nazari, Abolfazl Mohammadian, Thomas Stephens","title":"Exploring the Role of Perceived Range Anxiety in Adoption Behavior of\n  Plug-in Electric Vehicles","comments":"27 pages, 3 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A sustainable solution to negative externalities imposed by road\ntransportation is replacing internal combustion vehicles with electric vehicles\n(EVs), especially plug-in EV (PEV) encompassing plug-in hybrid EV (PHEV) and\nbattery EV (BEV). However, EV market share is still low and is forecast to\nremain low and uncertain. This shows a research need for an in-depth\nunderstanding of EV adoption behavior with a focus on one of the main barriers\nto the mass EV adoption, which is the limited electric driving range. The\npresent study extends the existing literature in two directions; First, the\ninfluence of the psychological aspect of driving range, which is referred to as\nrange anxiety, is explored on EV adoption behavior by presenting a nested logit\n(NL) model with a latent construct. Second, the two-level NL model captures\nindividuals' decision on EV adoption behavior distinguished by vehicle\ntransaction type and EV type, where the upper level yields the vehicle\ntransaction type selected from the set of alternatives including\nno-transaction, sell, trade, and add. The fuel type of the vehicles decided to\nbe acquired, either as traded-for or added vehicles, is simultaneously\ndetermined at the lower level from a set including conventional vehicle, hybrid\nEV, PHEV, and BEV. The model is empirically estimated using a stated\npreferences dataset collected in the State of California. A notable finding is\nthat anxiety about driving range influences the preference for BEV, especially\nas an added than traded-for vehicle, but not the decision on PHEV adoption.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:24:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nazari","Fatemeh",""],["Mohammadian","Abolfazl",""],["Stephens","Thomas",""]]}
{"id":"2308.10314","submitter":"Rafiqul Rahaman","authors":"Tathagata Ghosh, Rafiqul Rahaman, and Santosh Kumar Rai","title":"Search for a leptophobic doubly charged Higgs in same-sign four-lepton\n  and six-lepton signatures in a left-right symmetric model","comments":"32 pages, 8 figures, and 4 tables","journal-ref":null,"doi":null,"report-no":"HRI-RECAPP-2023-04","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the possibility of multi-lepton (four and six) signatures,\nincluding an exotic signature of same-sign four-lepton (SS4L) as signals of\npair production of a doubly charged Higgs in the minimal left-right symmetric\nmodel, extended with two doublet scalars. The right-handed neutrino masses are\ngenerated in this model through a dimension-$5$ lepton-number violating\noperator allowing the triplet scalar interactions with leptons to become\nnegligibly small. This leads to interesting six-lepton and SS4L signatures that\ncan be observed at the high-luminosity phase of the Large Hadron Collider\n(HL-LHC) with almost no background for doubly charged Higgs with mass below 500\nGeV.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:24:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghosh","Tathagata",""],["Rahaman","Rafiqul",""],["Rai","Santosh Kumar",""]]}
{"id":"2308.10315","submitter":"Qidong Huang","authors":"Qidong Huang, Xiaoyi Dong, Dongdong Chen, Yinpeng Chen, Lu Yuan, Gang\n  Hua, Weiming Zhang, Nenghai Yu","title":"Improving Adversarial Robustness of Masked Autoencoders via Test-time\n  Frequency-domain Prompting","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the adversarial robustness of vision\ntransformers that are equipped with BERT pretraining (e.g., BEiT, MAE). A\nsurprising observation is that MAE has significantly worse adversarial\nrobustness than other BERT pretraining methods. This observation drives us to\nrethink the basic differences between these BERT pretraining methods and how\nthese differences affect the robustness against adversarial perturbations. Our\nempirical analysis reveals that the adversarial robustness of BERT pretraining\nis highly related to the reconstruction target, i.e., predicting the raw pixels\nof masked image patches will degrade more adversarial robustness of the model\nthan predicting the semantic context, since it guides the model to concentrate\nmore on medium-/high-frequency components of images. Based on our analysis, we\nprovide a simple yet effective way to boost the adversarial robustness of MAE.\nThe basic idea is using the dataset-extracted domain knowledge to occupy the\nmedium-/high-frequency of images, thus narrowing the optimization space of\nadversarial perturbations. Specifically, we group the distribution of\npretraining data and optimize a set of cluster-specific visual prompts on\nfrequency domain. These prompts are incorporated with input images through\nprototype-based prompt selection during test period. Extensive evaluation shows\nthat our method clearly boost MAE's adversarial robustness while maintaining\nits clean performance on ImageNet-1k classification. Our code is available at:\nhttps://github.com/shikiw/RobustMAE.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:27:17 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 07:20:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Huang","Qidong",""],["Dong","Xiaoyi",""],["Chen","Dongdong",""],["Chen","Yinpeng",""],["Yuan","Lu",""],["Hua","Gang",""],["Zhang","Weiming",""],["Yu","Nenghai",""]]}
{"id":"2308.10316","submitter":"Michael Dinitz","authors":"Michael Dinitz and Satyen Kale and Silvio Lattanzi and Sergei\n  Vassilvitskii","title":"Improved Differentially Private Densest Subgraph: Local and Purely\n  Additive","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the Densest Subgraph problem under the additional constraint of\ndifferential privacy. In the LEDP (local edge differential privacy) model,\nintroduced recently by Dhulipala et al. [FOCS 2022], we give an $(\\epsilon,\n\\delta)$-differentially private algorithm with no multiplicative loss: the loss\nis purely additive. This is in contrast to every previous private algorithm for\ndensest subgraph (local or centralized), all of which incur some multiplicative\nloss as well as some additive loss. Moreover, our additive loss matches the\nbest-known previous additive loss (in any version of differential privacy) when\n$1/\\delta$ is at least polynomial in $n$, and in the centralized setting we can\nstrengthen our result to provide better than the best-known additive loss.\nAdditionally, we give a different algorithm that is $\\epsilon$-differentially\nprivate in the LEDP model which achieves a multiplicative ratio arbitrarily\nclose to $2$, along with an additional additive factor. This improves over the\nprevious multiplicative $4$-approximation in the LEDP model. Finally, we\nconclude with extensions of our techniques to both the node-weighted and the\ndirected versions of the problem.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:34:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dinitz","Michael",""],["Kale","Satyen",""],["Lattanzi","Silvio",""],["Vassilvitskii","Sergei",""]]}
{"id":"2308.10317","submitter":"Anirudh Mazumder","authors":"Anirudh Mazumder, Sarthak Engala, Aditya Nallaparaju","title":"Towards Sustainable Development: A Novel Integrated Machine Learning\n  Model for Holistic Environmental Health Monitoring","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Urbanization enables economic growth but also harms the environment through\ndegradation. Traditional methods of detecting environmental issues have proven\ninefficient. Machine learning has emerged as a promising tool for tracking\nenvironmental deterioration by identifying key predictive features. Recent\nresearch focused on developing a predictive model using pollutant levels and\nparticulate matter as indicators of environmental state in order to outline\nchallenges. Machine learning was employed to identify patterns linking areas\nwith worse conditions. This research aims to assist governments in identifying\nintervention points, improving planning and conservation efforts, and\nultimately contributing to sustainable development.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:35:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mazumder","Anirudh",""],["Engala","Sarthak",""],["Nallaparaju","Aditya",""]]}
{"id":"2308.10318","submitter":"Daniel Mar\\'in Pina","authors":"Daniel Mar\\'in Pina and Mark Gieles","title":"Dynamical binaries in star clusters","comments":"12 pages, 16 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To explain both the dynamics of a globular cluster and its production of\ngravitational waves from coalescing binary black holes, it is necessary to\nunderstand its population of dynamically-formed binaries. We provide a\ntheoretical understanding of this population, benchmarked by direct $N$-body\nmodels. We find that clusters on average have only one dynamically-assembled\nbinary at any given time. This is different from theoretical expectations and\nmodels of binary populations, which predict a larger number of binaries ($\\sim\n5$), especially for low-$N$ clusters ($\\sim 100$), or in the case of two-mass\nmodels, low number of black holes. We argue that the presence of multiple\nbinaries is suppressed by a high rate of binary-binary interactions, which\nefficiently ionise one of the binaries involved. These also lead to triple\nformation and potentially gravitational wave (GW) captures, which may provide\nan explanation for the recently reported efficiency of binary black hole\nmergers with non-zero ($\\gtrsim 0.01$) eccentricity in low-mass clusters.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:41:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pina","Daniel Mar\u00edn",""],["Gieles","Mark",""]]}
{"id":"2308.10319","submitter":"Wolfgang Gatterbauer","authors":"Wolfgang Gatterbauer","title":"A Tutorial on Visual Representations of Relational Queries","comments":"4 page tutorial paper at VLDB 2023, tutorial web page with slides to\n  be posted in time:\n  https://northeastern-datalab.github.io/visual-query-representation-tutorial/.\n  arXiv admin note: text overlap with arXiv:2208.01613","journal-ref":null,"doi":"10.14778/3611540.3611578","report-no":null,"categories":"cs.DB cs.HC cs.LO cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Query formulation is increasingly performed by systems that need to guess a\nuser's intent (e.g. via spoken word interfaces). But how can a user know that\nthe computational agent is returning answers to the \"right\" query? More\ngenerally, given that relational queries can become pretty complicated, how can\nwe help users understand existing relational queries, whether human-generated\nor automatically generated? Now seems the right moment to revisit a topic that\npredates the birth of the relational model: developing visual metaphors that\nhelp users understand relational queries.\n  This lecture-style tutorial surveys the key visual metaphors developed for\nvisual representations of relational expressions. We will survey the history\nand state-of-the art of relationally-complete diagrammatic representations of\nrelational queries, discuss the key visual metaphors developed in over a\ncentury of investigating diagrammatic languages, and organize the landscape by\nmapping their used visual alphabets to the syntax and semantics of Relational\nAlgebra (RA) and Relational Calculus (RC).\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:58:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gatterbauer","Wolfgang",""]]}
{"id":"2308.10320","submitter":"Weihua Zhou","authors":"Chen Zhao, Michele Esposito, Zhihui Xu, Weihua Zhou","title":"Hyper Association Graph Matching with Uncertainty Quantification for\n  Coronary Artery Semantic Labeling","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Coronary artery disease (CAD) is one of the primary causes leading to death\nworldwide. Accurate extraction of individual arterial branches on invasive\ncoronary angiograms (ICA) is important for stenosis detection and CAD\ndiagnosis. However, deep learning-based models face challenges in generating\nsemantic segmentation for coronary arteries due to the morphological similarity\namong different types of coronary arteries. To address this challenge, we\npropose an innovative approach using the hyper association graph-matching\nneural network with uncertainty quantification (HAGMN-UQ) for coronary artery\nsemantic labeling on ICAs. The graph-matching procedure maps the arterial\nbranches between two individual graphs, so that the unlabeled arterial segments\nare classified by the labeled segments, and the coronary artery semantic\nlabeling is achieved. By incorporating the anatomical structural loss and\nuncertainty, our model achieved an accuracy of 0.9345 for coronary artery\nsemantic labeling with a fast inference speed, leading to an effective and\nefficient prediction in real-time clinical decision-making scenarios.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 16:59:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Chen",""],["Esposito","Michele",""],["Xu","Zhihui",""],["Zhou","Weihua",""]]}
{"id":"2308.10321","submitter":"Mathias Sonnleitner","authors":"Mathias Sonnleitner","title":"Unlocking Your Bike the Easy Way","comments":"17 pages, 3 figures; accepted for publication in Amer. Math. Monthly","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Combination locks are widely used to secure bicycles. We consider a\ncombination lock consisting of adjacent rotating dials with the first\nnonnegative integers printed on each of them. Assuming that we know the correct\ncombination and we start from an incorrect combination, what is the minimal\nnumber of steps to arrive at the correct combination if in each step we are\nallowed to turn an arbitrary number of adjacent dials once in a common\ndirection? We answer this question using elementary methods and show how this\nis related to a variation of (multivariate) functions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:15:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sonnleitner","Mathias",""]]}
{"id":"2308.10322","submitter":"Subhamoy Chatterjee","authors":"Subhamoy Chatterjee, Andr\\'es Mu\\~noz-Jaramillo, Maher Dayeh, Hazel M.\n  Bain, Kimberly Moreland","title":"Homogenising SoHO/EIT and SDO/AIA 171\\AA$~$ Images: A Deep Learning\n  Approach","comments":"20 pages, 8 figures, accepted for publication in ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extreme Ultraviolet images of the Sun are becoming an integral part of space\nweather prediction tasks. However, having different surveys requires the\ndevelopment of instrument-specific prediction algorithms. As an alternative, it\nis possible to combine multiple surveys to create a homogeneous dataset. In\nthis study, we utilize the temporal overlap of SoHO/EIT and SDO/AIA 171~\\AA\n~surveys to train an ensemble of deep learning models for creating a single\nhomogeneous survey of EUV images for 2 solar cycles. Prior applications of deep\nlearning have focused on validating the homogeneity of the output while\noverlooking the systematic estimation of uncertainty. We use an approach called\n`Approximate Bayesian Ensembling' to generate an ensemble of models whose\nuncertainty mimics that of a fully Bayesian neural network at a fraction of the\ncost. We find that ensemble uncertainty goes down as the training set size\nincreases. Additionally, we show that the model ensemble adds immense value to\nthe prediction by showing higher uncertainty in test data that are not well\nrepresented in the training data.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:17:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chatterjee","Subhamoy",""],["Mu\u00f1oz-Jaramillo","Andr\u00e9s",""],["Dayeh","Maher",""],["Bain","Hazel M.",""],["Moreland","Kimberly",""]]}
{"id":"2308.10323","submitter":"Pavel Antonenko","authors":"Pavel V. Antonenko, Pavel A. Valinevich","title":"Boltzmann weights and fusion procedure for the rational seven-vertex SOS\n  model","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider seven-vertex two-dimensional integrable statistical model. With\nthe help of intertwining vector method we construct its counterpart integrable\nmodel of SOS type. More general models of both types are constructed by means\nof fusion procedure. For SOS models we calculate the Boltzmann weights in terms\nof terminating hypergeometric series ${}_{9} F_8.$ Then using the similarity\ntransformation for $R$-operators we construct a new family of vertex models\ncontaining the 11-vertex model as the simplest representative. For this new set\nof models the vertex-SOS correspondence is constructed: we find the\nintertwining vectors, show that they do not depend on spectral parameter and\nthe SOS statistical weights are similar to those obtained from the 7-vertex\nmodel.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:20:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Antonenko","Pavel V.",""],["Valinevich","Pavel A.",""]]}
{"id":"2308.10324","submitter":"Cheng Tan Dr.","authors":"Cheng Tan, Ji-Hai Liao, Guolin Zheng, Meri Algarni, Jia-Yi Lin, Xiang\n  Ma, Edwin L. H. Mayes, Matthew R. Field, Sultan Albarakati, Majid\n  Panahandeh-Fard, Saleh Alzahrani, Guopeng Wang, Yuanjun Yang, Dimitrie\n  Culcer, James Partridge, Mingliang Tian, Bin Xiang, Yu-Jun Zhao and Lan Wang","title":"Room temperature magnetic phase transition in an electrically-tuned van\n  der Waals ferromagnet","comments":"18 pages, 4 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":"  Finding tunable van der Waals (vdW) ferromagnets that operate at above room\ntemperature is an important research focus in physics and materials science.\nMost vdW magnets are only intrinsically magnetic far below room temperature and\nmagnetism with square-shaped hysteresis at room-temperature has yet to be\nobserved. Here, we report magnetism in a quasi-2D magnet Cr1.2Te2 observed at\nroom temperature (290 K). This magnetism was tuned via a protonic gate with an\nelectron doping concentration up to 3.8 * 10^21 cm^-3. We observed\nnon-monotonic evolutions in both coercivity and anomalous Hall resistivity.\nUnder increased electron doping, the coercivities and anomalous Hall effects\n(AHEs) vanished, indicating a doping-induced magnetic phase transition. This\noccurred up to room temperature. DFT calculations showed the formation of an\nantiferromagnetic (AFM) phase caused by the intercalation of protons which\ninduced significant electron doping in the Cr1.2Te2. The tunability of the\nmagnetic properties and phase in room temperature magnetic vdW Cr1.2Te2 is a\nsignificant step towards practical spintronic devices.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:28:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tan","Cheng",""],["Liao","Ji-Hai",""],["Zheng","Guolin",""],["Algarni","Meri",""],["Lin","Jia-Yi",""],["Ma","Xiang",""],["Mayes","Edwin L. H.",""],["Field","Matthew R.",""],["Albarakati","Sultan",""],["Panahandeh-Fard","Majid",""],["Alzahrani","Saleh",""],["Wang","Guopeng",""],["Yang","Yuanjun",""],["Culcer","Dimitrie",""],["Partridge","James",""],["Tian","Mingliang",""],["Xiang","Bin",""],["Zhao","Yu-Jun",""],["Wang","Lan",""]]}
{"id":"2308.10325","submitter":"Victor Krivenkov","authors":"Adam Olejniczak, Zuzanna Lawera, Mario Zapata-Herrera, Andrey\n  Chuvilin, Pavel Samokhvalov, Igor Nabiev, Marek Grzelczak, Yury Rakovich,\n  Victor Krivenkov","title":"On-demand reversible switching of the emission mode of individual\n  semiconductor quantum emitters using plasmonic metasurfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The field of quantum technology has been rapidly expanding in the past\ndecades, yielding numerous applications as quantum information, quantum\ncommunication and quantum cybersecurity. The central building block for these\napplications is a quantum emitter (QE), a controllable source of single photons\nor photon pairs. Semiconductor QEs such as perovskite nanocrystals (PNCs) and\nsemiconductor quantum dots (QDs) have been demonstrated to be a promising\nmaterial for pure single-photon emission, and their hybrids with plasmonic\nnanocavities may serve as sources of photon pairs. Here we have designed a\nsystem in which individual quantum emitters and their ensembles can be traced\nbefore, during, and after the interaction with the external plasmonic\nmetasurface in controllable way. Upon coupling the external plasmonic\nmetasurface to the array of QEs, the individual QEs switch from single-photon\nto photon-pair emission mode. Remarkably, this method does not affect the\nchemical structure and composition of the QEs, allowing them to return to their\ninitial state after decoupling from the plasmonic metasurface. By employing\nthis approach, we have successfully demonstrated the reversible switching of\nthe ensemble of individual semiconductor QEs between single-photon and photon\npair emission modes. This significantly broadens the potential applications of\nsemiconductor QEs in quantum technologies.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:29:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Olejniczak","Adam",""],["Lawera","Zuzanna",""],["Zapata-Herrera","Mario",""],["Chuvilin","Andrey",""],["Samokhvalov","Pavel",""],["Nabiev","Igor",""],["Grzelczak","Marek",""],["Rakovich","Yury",""],["Krivenkov","Victor",""]]}
{"id":"2308.10326","submitter":"Laetitia Rodet","authors":"Laetitia Rodet and Dong Lai","title":"Planet-Driven Scatterings of Planetesimals Into a Star: Probability,\n  Timescale and Applications","comments":"Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A planetary system can undergo multiple episodes of intense dynamical\nactivities throughout its life, resulting in the production of star-grazing\nplanetesimals (or exocomets) and pollution of the host star. Such activity is\nespecially pronounced when giant planets interact with other small bodies\nduring the system's evolution. However, due to the chaotic nature of the\ndynamics, it is difficult to determine the properties of the perturbing\nplanet(s) from the observed planetesimal-disruption activities. In this study,\nwe examine the outcomes of planetesimal-planet scatterings in a general\nsetting, with the goal of determining the likelihood and timescale of\nplanetesimal disruption by the host star as a function of the planet\nproperties. We obtain a new analytical expression for the minimum distance a\nscattering body can reach, extending previous results by considering finite\nplanet eccentricity and non-zero planetesimal mass. Through N-body simulations,\nwe derive the distribution of minimum distances and the likelihood and\ntimescales of three possible outcomes of planetesimal-planet scatterings:\ncollision with the planet, ejection, and disruption by the star. We identify\nfour defining dimensionless parameters (the planet eccentricity, planet-to-star\nmass ratio, planet radius to semi-major axis ratio, and the stellar disruption\nradius to planet semi-major axis ratio) that enable us to scale the problem and\ngeneralize our findings to a wide range of orbital configurations. Using these\nresults, we explore three applications: falling evaporating bodies in the Beta\nPictoris system, white dwarf pollution due to planetesimal disruption and\nplanet engulfment by main-sequence stars.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:51:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rodet","Laetitia",""],["Lai","Dong",""]]}
{"id":"2308.10327","submitter":"Nouhaila Innan","authors":"Nouhaila Innan, Owais Ishtiaq Siddiqui, Shivang Arora, Tamojit Ghosh,\n  Yasemin Poyraz Ko\\c{c}ak, Dominic Paragas, Abdullah Al Omar Galib, Muhammad\n  Al-Zafar Khan and Mohamed Bennai","title":"Quantum State Tomography using Quantum Machine Learning","comments":"18 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG physics.comp-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum State Tomography (QST) is a fundamental technique in Quantum\nInformation Processing (QIP) for reconstructing unknown quantum states.\nHowever, the conventional QST methods are limited by the number of measurements\nrequired, which makes them impractical for large-scale quantum systems. To\novercome this challenge, we propose the integration of Quantum Machine Learning\n(QML) techniques to enhance the efficiency of QST. In this paper, we conduct a\ncomprehensive investigation into various approaches for QST, encompassing both\nclassical and quantum methodologies; We also implement different QML approaches\nfor QST and demonstrate their effectiveness on various simulated and\nexperimental quantum systems, including multi-qubit networks. Our results show\nthat our QML-based QST approach can achieve high fidelity (98%) with\nsignificantly fewer measurements than conventional methods, making it a\npromising tool for practical QIP applications.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:51:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Innan","Nouhaila",""],["Siddiqui","Owais Ishtiaq",""],["Arora","Shivang",""],["Ghosh","Tamojit",""],["Ko\u00e7ak","Yasemin Poyraz",""],["Paragas","Dominic",""],["Galib","Abdullah Al Omar",""],["Khan","Muhammad Al-Zafar",""],["Bennai","Mohamed",""]]}
{"id":"2308.10328","submitter":"Albin Soutif--Cormerais","authors":"Albin Soutif--Cormerais, Antonio Carta, Andrea Cossu, Julio Hurtado,\n  Vincenzo Lomonaco, Joost Van de Weijer, Hamed Hemati","title":"A Comprehensive Empirical Evaluation on Online Continual Learning","comments":"ICCV Visual Continual Learning Workshop 2023 accepted paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Online continual learning aims to get closer to a live learning experience by\nlearning directly on a stream of data with temporally shifting distribution and\nby storing a minimum amount of data from that stream. In this empirical\nevaluation, we evaluate various methods from the literature that tackle online\ncontinual learning. More specifically, we focus on the class-incremental\nsetting in the context of image classification, where the learner must learn\nnew classes incrementally from a stream of data. We compare these methods on\nthe Split-CIFAR100 and Split-TinyImagenet benchmarks, and measure their average\naccuracy, forgetting, stability, and quality of the representations, to\nevaluate various aspects of the algorithm at the end but also during the whole\ntraining period. We find that most methods suffer from stability and\nunderfitting issues. However, the learned representations are comparable to\ni.i.d. training under the same computational budget. No clear winner emerges\nfrom the results and basic experience replay, when properly tuned and\nimplemented, is a very strong baseline. We release our modular and extensible\ncodebase at https://github.com/AlbinSou/ocl_survey based on the avalanche\nframework to reproduce our results and encourage future research.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:52:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Soutif--Cormerais","Albin",""],["Carta","Antonio",""],["Cossu","Andrea",""],["Hurtado","Julio",""],["Lomonaco","Vincenzo",""],["Van de Weijer","Joost",""],["Hemati","Hamed",""]]}
{"id":"2308.10329","submitter":"Juan Jose Ramos Cabezas","authors":"Vladimir Belavin, Doron Gepner, J. Ramos Cabezas, Boris Runov","title":"On different approaches to integrable lattice models","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":"  Interaction-Round the Face (IRF) models are two-dimensional lattice models of\nstatistical mechanics defined by an affine Lie algebra and admissibility\nconditions depending on a choice of representation of that affine Lie algebra.\nIntegrable IRF models, i.e., the models the Boltzmann weights of which satisfy\nthe quantum Yang-Baxter equation, are of particular interest. In this paper, we\ninvestigate trigonometric Boltzmann weights of integrable IRF models. By using\nan ansatz proposed by one of the authors in some previous works, the Boltzmann\nweights of the restricted IRF models based on the affine Lie algebras\n$\\mathfrak{su}(2)_k$ and $\\mathfrak{su}(3)_k$ are computed for fundamental and\nadjoint representations for some fixed levels $k$. New solutions for the\nBoltzmann weights are obtained. We also study the vertex-IRF correspondence in\nthe context of an unrestricted IRF model based on $\\mathfrak {su}(3)_k$ (for\ngeneral $k$) and discuss how it can be used to find Boltzmann weights in terms\nof the quantum $\\hat{R}$ matrix when the adjoint representation defines the\nadmissibility conditions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:54:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Belavin","Vladimir",""],["Gepner","Doron",""],["Cabezas","J. Ramos",""],["Runov","Boris",""]]}
{"id":"2308.10330","submitter":"Ziang Cao","authors":"Ziang Cao, Ziyuan Huang, Liang Pan, Shiwei Zhang, Ziwei Liu, Changhong\n  Fu","title":"Towards Real-World Visual Tracking with Temporal Contexts","comments":"Accepted by IEEE TPAMI, Code:\n  https://github.com/vision4robotics/TCTrack","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual tracking has made significant improvements in the past few decades.\nMost existing state-of-the-art trackers 1) merely aim for performance in ideal\nconditions while overlooking the real-world conditions; 2) adopt the\ntracking-by-detection paradigm, neglecting rich temporal contexts; 3) only\nintegrate the temporal information into the template, where temporal contexts\namong consecutive frames are far from being fully utilized. To handle those\nproblems, we propose a two-level framework (TCTrack) that can exploit temporal\ncontexts efficiently. Based on it, we propose a stronger version for real-world\nvisual tracking, i.e., TCTrack++. It boils down to two levels: features and\nsimilarity maps. Specifically, for feature extraction, we propose an\nattention-based temporally adaptive convolution to enhance the spatial features\nusing temporal information, which is achieved by dynamically calibrating the\nconvolution weights. For similarity map refinement, we introduce an adaptive\ntemporal transformer to encode the temporal knowledge efficiently and decode it\nfor the accurate refinement of the similarity map. To further improve the\nperformance, we additionally introduce a curriculum learning strategy. Also, we\nadopt online evaluation to measure performance in real-world conditions.\nExhaustive experiments on 8 wellknown benchmarks demonstrate the superiority of\nTCTrack++. Real-world tests directly verify that TCTrack++ can be readily used\nin real-world applications.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 17:59:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Ziang",""],["Huang","Ziyuan",""],["Pan","Liang",""],["Zhang","Shiwei",""],["Liu","Ziwei",""],["Fu","Changhong",""]]}
{"id":"2308.10331","submitter":"Nicola Piovella","authors":"Nicola Piovella","title":"Mean-Field Description of Cooperative Scattering by Atomic Clouds","comments":"14 pages, 9 figures","journal-ref":"Atoms 2023, 11, 101","doi":"10.3390/atoms11070101","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present analytic expressions for the scattering of light by an extended\natomic cloud. We obtain the solution for the mean-field excitation of different\natomic spherical distributions driven by an uniform laser, including the\ninitial build-up, the steady-state and the decay after the laser is switched\noff. We show that the mean-field model does not describe subradiant scattering,\ndue to negative interference of the photons scattered by $N$ discrete atoms.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:12:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Piovella","Nicola",""]]}
{"id":"2308.10332","submitter":"Robert Maier","authors":"Robert S. Maier","title":"Boson Operator Ordering Identities from Generalized Stirling and\n  Eulerian Numbers","comments":"36 pages (preprint format)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ordering identities in the Weyl-Heisenberg algebra generated by single-mode\nboson operators are investigated. A boson string composed of creation and\nannihilation operators can be expanded as a linear combination of other such\nstrings, the simplest example being a normal ordering. The case when each\nstring contains only one annihilation operator is already combinatorially\nnontrivial. Two kinds of expansion are derived: (i) that of a power of a string\n$\\Omega$ in lower powers of another string $\\Omega'$, and (ii) that of a power\nof $\\Omega$ in twisted versions of the same power of $\\Omega'$. The expansion\ncoefficients are shown to be, respectively, the generalized Stirling numbers of\nHsu and Shiue, and certain generalized Eulerian numbers. Many examples are\ngiven. These combinatorial numbers are binomial transforms of each other, and\ntheir theory is developed, emphasizing schemes for computing them: summation\nformulas, Graham-Knuth-Patashnik (GKP) triangular recurrences, terminating\nhypergeometric series, and closed-form expressions. The results on the first\ntype of expansion subsume a number of previous results on the normal ordering\nof boson strings.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:14:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maier","Robert S.",""]]}
{"id":"2308.10333","submitter":"Erik Lundberg","authors":"Erik Lundberg and Andrew Thomack","title":"On the average number of zeros of random harmonic polynomials with\n  i.i.d. coefficients: precise asymptotics","comments":"27 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Addressing a problem posed by W. Li and A. Wei (2009), we investigate the\naverage number of (complex) zeros of a random harmonic polynomial $p(z) +\n\\overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients\nare independent identically distributed centered complex Gaussian random\nvariables. We establish a precise asymptotic, showing that when $\\text{deg} p =\n\\text{deg} q = n$ tends to infinity the average number of zeros is asymptotic\nto $\\frac{1}{2} n \\log n$. We further consider the average number of zeros\nrestricted to various regions in the complex plane leading to interesting\ncomparisons with the classically studied case of analytic Kac polynomials. We\nalso consider deterministic extremal problems for harmonic polynomials with\ncoefficient constraints; using an indirect probabilistic method we show the\nexistence of harmonic polynomials with unimodular coefficients having at least\n$\\frac{2}{\\pi} n \\log n + O(n)$ zeros. We conclude with a list of open\nproblems.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:17:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lundberg","Erik",""],["Thomack","Andrew",""]]}
{"id":"2308.10334","submitter":"Haoyuan Li","authors":"Haoyuan Li, Haoye Dong, Hanchao Jia, Dong Huang, Michael C.\n  Kampffmeyer, Liang Lin, Xiaodan Liang","title":"Coordinate Transformer: Achieving Single-stage Multi-person Mesh\n  Recovery from Videos","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-person 3D mesh recovery from videos is a critical first step towards\nautomatic perception of group behavior in virtual reality, physical therapy and\nbeyond. However, existing approaches rely on multi-stage paradigms, where the\nperson detection and tracking stages are performed in a multi-person setting,\nwhile temporal dynamics are only modeled for one person at a time.\nConsequently, their performance is severely limited by the lack of inter-person\ninteractions in the spatial-temporal mesh recovery, as well as by detection and\ntracking defects. To address these challenges, we propose the Coordinate\ntransFormer (CoordFormer) that directly models multi-person spatial-temporal\nrelations and simultaneously performs multi-mesh recovery in an end-to-end\nmanner. Instead of partitioning the feature map into coarse-scale patch-wise\ntokens, CoordFormer leverages a novel Coordinate-Aware Attention to preserve\npixel-level spatial-temporal coordinate information. Additionally, we propose a\nsimple, yet effective Body Center Attention mechanism to fuse position\ninformation. Extensive experiments on the 3DPW dataset demonstrate that\nCoordFormer significantly improves the state-of-the-art, outperforming the\npreviously best results by 4.2%, 8.8% and 4.7% according to the MPJPE, PAMPJPE,\nand PVE metrics, respectively, while being 40% faster than recent video-based\napproaches. The released code can be found at\nhttps://github.com/Li-Hao-yuan/CoordFormer.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:23:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Haoyuan",""],["Dong","Haoye",""],["Jia","Hanchao",""],["Huang","Dong",""],["Kampffmeyer","Michael C.",""],["Lin","Liang",""],["Liang","Xiaodan",""]]}
{"id":"2308.10335","submitter":"Li Zhong","authors":"Li Zhong, Zilong Wang","title":"A Study on Robustness and Reliability of Large Language Model Code\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the large language models (LLMs) have shown extraordinary ability\nin understanding natural language and generating programming code. It has been\na common practice of software engineers to consult LLMs when encountering\ncoding questions. Although efforts have been made to avoid syntax errors and\nalign the code with the intended semantics, the reliability and robustness of\nthe code generationfrom LLMs have not yet been thoroughly studied. The\nexecutable code is not equivalent to the reliable and robust code, especially\nin the context of real-world software development. The misuse of APIs in the\ngenerated code could lead to severe problem, such as resource leaks, program\ncrashes. To make things worse, the users of LLM code generation services are\nactually the developers that are most vulnerable to these code that seems right\n-- They are always novice developers that are not familiar with the APIs that\nLLMs generate code for them. Therefore, they could hardly tell the misuse in\nthe code generated by LLMs, which further facilitates the incorrect code\napplied in real-world software. Existing code evaluation benchmark and datasets\nfocus on crafting small tasks such as programming questions in coding\ninterviews, which however deviates from the problem that developers would ask\nLLM for real-world coding help. To fill the missing piece, in this work, we\npropose a dataset RobustAPI for evaluating the reliability and robustness of\ncode generated by LLMs. We collect 1208 coding questions from StackOverflow on\n24 representative Java APIs. We summarize thecommon misuse patterns of these\nAPIs and evaluate them oncurrent popular LLMs. The evaluation results show that\nevenfor GPT-4, 62% of the generated code contains API misuses,which would cause\nunexpected consequences if the code isintroduced into real-world software.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:36:28 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 23:06:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Li",""],["Wang","Zilong",""]]}
{"id":"2308.10336","submitter":"O\\u{g}ul Esen","authors":"Beg\\\"um Ate\\c{s}li and O\\u{g}ul Esen and Manuel de Le\\'on and Cristina\n  Sard\\'on","title":"On Non-autonomous Hamiltonian Dynamics, Dual Spaces, and Kinetic Lifts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Vlasov kinetic theory is the dynamics of a bunch of particles flowing\naccording to symplectic Hamiltonian dynamics. More recently, this geometry has\nbeen extended to contact Hamiltonian dynamics. In this paper, we introduce\ngeometric kinetic theories within the framework of cosymplectic and cocontact\nmanifolds to extend the present literature to time-dependent dynamics. The\ncosymplectic and the cocontact kinetic theories are obtained in terms of both\nmomentum variables and density functions. These alternative realizations are\nlinked via Poisson/momentum maps. Furthermore, in cocontact geometry, we\nintroduce a hierarchical analysis of nine distinct dynamical motions as various\nmanifestations of Hamiltonian, evolution, and gradient flows.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:40:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ate\u015fli","Beg\u00fcm",""],["Esen","O\u011ful",""],["de Le\u00f3n","Manuel",""],["Sard\u00f3n","Cristina",""]]}
{"id":"2308.10337","submitter":"Ankit Dhiman","authors":"Ankit Dhiman, Srinath R, Harsh Rangwani, Rishubh Parihar, Lokesh R\n  Boregowda, Srinath Sridhar and R Venkatesh Babu","title":"Strata-NeRF : Neural Radiance Fields for Stratified Scenes","comments":"ICCV 2023, Project Page: https://ankitatiisc.github.io/Strata-NeRF/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural Radiance Field (NeRF) approaches learn the underlying 3D\nrepresentation of a scene and generate photo-realistic novel views with high\nfidelity. However, most proposed settings concentrate on modelling a single\nobject or a single level of a scene. However, in the real world, we may capture\na scene at multiple levels, resulting in a layered capture. For example,\ntourists usually capture a monument's exterior structure before capturing the\ninner structure. Modelling such scenes in 3D with seamless switching between\nlevels can drastically improve immersive experiences. However, most existing\ntechniques struggle in modelling such scenes. We propose Strata-NeRF, a single\nneural radiance field that implicitly captures a scene with multiple levels.\nStrata-NeRF achieves this by conditioning the NeRFs on Vector Quantized (VQ)\nlatent representations which allow sudden changes in scene structure. We\nevaluate the effectiveness of our approach in multi-layered synthetic dataset\ncomprising diverse scenes and then further validate its generalization on the\nreal-world RealEstate10K dataset. We find that Strata-NeRF effectively captures\nstratified scenes, minimizes artifacts, and synthesizes high-fidelity views\ncompared to existing approaches.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:45:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dhiman","Ankit",""],["R","Srinath",""],["Rangwani","Harsh",""],["Parihar","Rishubh",""],["Boregowda","Lokesh R",""],["Sridhar","Srinath",""],["Babu","R Venkatesh",""]]}
{"id":"2308.10338","submitter":"Giuseppe Sanfilippo","authors":"Lydia Castronovo and Giuseppe Sanfilippo","title":"A probabilistic analysis of selected notions of iterated conditioning\n  under coherence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.AI math.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It is well know that basic conditionals satisfy some desirable basic logical\nand probabilistic properties, such as the compound probability theorem, but\nchecking the validity of these becomes trickier when we switch to compound and\niterated conditionals. We consider de Finetti's notion of conditional as a\nthree-valued object and as a conditional random quantity in the betting\nframework. We recall the notions of conjunction and disjunction among\nconditionals in selected trivalent logics. First, in the framework of specific\nthree-valued logics we analyze the notions of iterated conditioning introduced\nby Cooper-Calabrese, de Finetti and Farrell, respectively. We show that the\ncompound probability theorem and other basic properties are not preserved by\nthese objects, by also computing some probability propagation rules. Then, for\neach trivalent logic we introduce an iterated conditional as a suitable random\nquantity which satisfies the compound prevision theorem and some of the\ndesirable properties. We also check the validity of two generalized versions of\nBayes' Rule for iterated conditionals. We study the p-validity of generalized\nversions of Modus Ponens and two-premise centering for iterated conditionals.\nFinally, we observe that all the basic properties are satisfied only by the\niterated conditional mainly developed in recent papers by Gilio and Sanfilippo\nin the setting of conditional random quantities.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:48:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Castronovo","Lydia",""],["Sanfilippo","Giuseppe",""]]}
{"id":"2308.10339","submitter":"Iryna Timchenko","authors":"I.S. Timchenko, O.S. Deiev, S.N. Olejnik, S.M. Potin, L.P. Korda, V.A.\n  Kushnir, V.V. Mytrochenko, S.A. Perezhogin, A. Herz\\'a\\v{n}","title":"Production of ${^{180\\rm{m}}}$Hf in photoproton reaction\n  ${^{181}}$Ta$(\\gamma,p)$ at energy $E_{\\rm{\\gamma max}}$ = 35-95 MeV","comments":"9 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The production of the $^{180\\rm{m}}\\rm{Hf}$ nuclei in the photoproton\nreaction ${^{181}\\rm{Ta}}(\\gamma,p)$ was studied at end-point bremsstrahlung\nenergies $E_{\\rm{\\gamma max}}$ = 35-95 MeV. The experiment was performed at the\nelectron linear accelerator LUE-40 NSC KIPT with the use of the $\\gamma$\nactivation and off-line $\\gamma$-ray spectroscopy.\n  The experimental values of the bremsstrahlung flux-averaged cross-sections\n$\\langle{\\sigma(E_{\\rm{\\gamma max}})}\\rangle_{\\rm{m}}$ for the\n${^{181}\\rm{Ta}}(\\gamma,p)^{180\\rm{m}}\\rm{Hf}$ reaction were determined, and at\n$E_{\\rm{\\gamma max}} > 55$ MeV obtained for the first time.\n  The measured values, also as the literature data, are significantly exceed\nthe theoretical flux-averaged cross-sections $\\langle{\\sigma(E_{\\rm{\\gamma\nmax}})}\\rangle_{\\rm{th}}$. The $\\langle{\\sigma(E_{\\rm{\\gamma\nmax}})}\\rangle_{\\rm{th}}$ values were calculated using the cross-section\n$\\sigma(E)$ computed with the TALYS1.95 code for six different level density\nmodels.\n  A comparative analysis of the calculated total cross-sections for the\nreactions ${^{181}\\rm{Ta}}(\\gamma,p)^{180}\\rm{Hf}$ and\n${^{181}\\rm{Ta}}(\\gamma,n)^{180}\\rm{Ta}$ was performed. It was shown that the\nphotoproton $(\\gamma,p)$ to photoneutron $(\\gamma,n)$ strength ratio is\nconsistent with the estimates based on the isospin selection rules and the\nvalue from the $(e,e'p)$ experiment.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:54:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Timchenko","I. S.",""],["Deiev","O. S.",""],["Olejnik","S. N.",""],["Potin","S. M.",""],["Korda","L. P.",""],["Kushnir","V. A.",""],["Mytrochenko","V. V.",""],["Perezhogin","S. A.",""],["Herz\u00e1\u0148","A.",""]]}
{"id":"2308.10340","submitter":"Dasa Kusnirakova","authors":"Dasa Kusnirakova and Barbora Buhnova","title":"Future Vision of Dynamic Certification Schemes for Autonomous Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As software becomes increasingly pervasive in critical domains like\nautonomous driving, new challenges arise, necessitating rethinking of system\nengineering approaches. The gradual takeover of all critical driving functions\nby autonomous driving adds to the complexity of certifying these systems.\nNamely, certification procedures do not fully keep pace with the dynamism and\nunpredictability of future autonomous systems, and they may not fully guarantee\ncompliance with the requirements imposed on these systems.\n  In this paper, we have identified several issues with the current\ncertification strategies that could pose serious safety risks. As an example,\nwe highlight the inadequate reflection of software changes in constantly\nevolving systems and the lack of support for systems' cooperation necessary for\nmanaging coordinated movements. Other shortcomings include the narrow focus of\nawarded certification, neglecting aspects such as the ethical behavior of\nautonomous software systems. The contribution of this paper is threefold.\nFirst, we analyze the existing international standards used in certification\nprocesses in relation to the requirements derived from dynamic software\necosystems and autonomous systems themselves, and identify their shortcomings.\nSecond, we outline six suggestions for rethinking certification to foster\ncomprehensive solutions to the identified problems. Third, a conceptual\nMulti-Layer Trust Governance Framework is introduced to establish a robust\ngovernance structure for autonomous ecosystems and associated processes,\nincluding envisioned future certification schemes. The framework comprises\nthree layers, which together support safe and ethical operation of autonomous\nsystems.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:06:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kusnirakova","Dasa",""],["Buhnova","Barbora",""]]}
{"id":"2308.10341","submitter":"Yanlin Qu","authors":"Yanlin Qu, Jose Blanchet, Peter Glynn","title":"Computable Bounds on Convergence of Markov Chains in Wasserstein\n  Distance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a unified framework to estimate the convergence of Markov chains\nto equilibrium using Wasserstein distance. The framework provides convergence\nbounds with various rates, ranging from polynomial to exponential, all derived\nfrom a single contractive drift condition. This approach removes the need for\nfinding a specific set with drift outside and contraction inside. The\nconvergence bounds are explicit, as they can be estimated based on one-step\nexpectations and do not rely on equilibrium-related quantities. To enhance the\napplicability of the framework, we introduce the large M technique and the\nboundary removal technique. We illustrate these methods in queueing models and\nalgorithms in stochastic optimization.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:08:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qu","Yanlin",""],["Blanchet","Jose",""],["Glynn","Peter",""]]}
{"id":"2308.10342","submitter":"Turan Birol","authors":"Amartyajyoti Saha, Turan Birol","title":"Tetrahedral rotations in alkaline-earth metal orthovanadates","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 alkaline-earth orthovanadate Sr$_3$V$_2$O$_8$ with the palmierite\nstructure is reported to host a dielectric anomaly as well as a structural\nphase transition above the room temperature. With V$^{5+}$ ions and tetrahedral\noxygen coordination, the crystal structure of this compound is not studied in\ndetail from first principles yet. In this work, we perform a detailed analysis\nof the crystal structure and instabilities of M$_3$V$_2$O$_8$ ($\\text{M} =\n\\text{Ca, Sr, Ba}$) orthovanadates with the palmierite structure using first\nprinciples density functional theory. We find that as the M$^{2+}$ cation size\ndecreases, a significant structural distortion that changes the symmetry from\n$R\\bar{3}m$ to $C2/c$ emerges. This change is accompanied with a rotation of\nthe oxygen tetrahedra. Our calculations also indicate that the polar\ninstability in these compounds are suppressed by these tetrahedral rotations.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:15:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Saha","Amartyajyoti",""],["Birol","Turan",""]]}
{"id":"2308.10343","submitter":"Lina Pu","authors":"Yu Luo, Lina Pu, Jun Wang, Isaac Howard","title":"Enhancing In-Situ Structural Health Monitoring through RF Energy-Powered\n  Sensor Nodes and Mobile Platform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.NI cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research contributes to long-term structural health monitoring (SHM) by\nexploring radio frequency energy-powered sensor nodes (RF-SNs) embedded in\nconcrete. Unlike traditional in-situ monitoring systems relying on batteries or\nwire-connected power sources, the RF-SN captures radio energy from a mobile\nradio transmitter for sensing and communication. This offers a cost-effective\nsolution for consistent in-situ perception. To optimize the system performance\nacross various situations, we've explored both active and passive communication\nmethods. For the active RF-SN, we implement a specialized control circuit\nenabling the node to transmit data through ZigBee protocol at low incident\npower. For the passive RF-SN, radio energy is not only for power but also as a\ncarrier signal, with data conveyed by modulating the amplitude of the\nbackscattered radio wave. To address the challenge of significant attenuation\nof the backscattering signal in concrete, we utilize a square chirp-based\nmodulation scheme for passive communication. This scheme allows the receiver to\nsuccessfully decode the data even under a negative signal-to-noise ratio (SNR)\ncondition. The experimental results indicate that an active RF-SN embedded in\nconcrete at a depth of 13.5 cm can be effectively powered by a 915MHz mobile\nradio transmitter with an effective isotropic radiated power (EIRP) of 32.5dBm.\nThis setup allows the RF-SN to send over 1 kilobyte of data within 10 seconds,\nwith an additional 1.7 kilobytes every 1.6 seconds of extra charging. For the\npassive RF-SN buried at the same depth, continuous data transmission at a rate\nof 224 bps with a 3% bit error rate (BER) is achieved when the EIRP of the\ntransmitter is 23.6 dBm.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:18:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Yu",""],["Pu","Lina",""],["Wang","Jun",""],["Howard","Isaac",""]]}
{"id":"2308.10344","submitter":"Anousha Greiveldinger","authors":"A. Greiveldinger, P. Garnavich, C. Littlefield, M. R. Kennedy, J. P.\n  Halpern, J. R. Thorstensen, P. Szkody, A. Oksanen, R. S. Boyle","title":"A Surprising Periodicity Detected During a Super-outburst of V844\n  Herculis by TESS","comments":"13 pages, 10 figures, accepted for publication in the Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We identify a previously undetected periodicity at a frequency of\n49.08$\\pm$0.01 d$^{-1}$ (period of 29.34$\\pm$0.01 minutes) during a\nsuper-outburst of V844 Her observed by TESS. V844 Her is an SU UMa type\ncataclysmic variable with an orbital period of 78.69 minutes, near the period\nminimum. The frequency of this new signal is constant in contrast to the\nsuperhump oscillations commonly seen in SU UMa outbursts. We searched without\nsuccess for oscillations during quiescence using MDM, TESS, and XMM-Newton\ndata. The lack of a periodic signal in the XMM light curve and the relatively\nlow X-ray luminosity of V844 Her suggests that it is not a typical IP. We\nconsider the possibility that the 29 min signal is the result of super-Nyquist\nsampling of a Dwarf Nova Oscillation with a period near the 2-minute cadence of\nthe TESS data. Our analysis of archival AAVSO photometry from a 2006\nsuper-outburst supports the existence of a 29 min oscillation, although a\npublished study of an earlier superoutburst did not detect the signal. We\ncompare the X-ray properties of V844 Her with short orbital period intermediate\npolars (IP), V1025 Cen and DW Cnc. We conclude that the new signal is a real\nphotometric oscillation coming from the V844 Her system and that it is unlikely\nto be an aliased high-frequency oscillation. The steady frequency of the new\nsignal suggests that its origin is related to an asynchronously rotating white\ndwarf in V844 Her, although the precise mechanism producing the flux variations\nremains unclear.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:30:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Greiveldinger","A.",""],["Garnavich","P.",""],["Littlefield","C.",""],["Kennedy","M. R.",""],["Halpern","J. P.",""],["Thorstensen","J. R.",""],["Szkody","P.",""],["Oksanen","A.",""],["Boyle","R. S.",""]]}
{"id":"2308.10345","submitter":"David Noever","authors":"David Noever","title":"Can Large Language Models Find And Fix Vulnerable Software?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we evaluated the capability of Large Language Models (LLMs),\nparticularly OpenAI's GPT-4, in detecting software vulnerabilities, comparing\ntheir performance against traditional static code analyzers like Snyk and\nFortify. Our analysis covered numerous repositories, including those from NASA\nand the Department of Defense. GPT-4 identified approximately four times the\nvulnerabilities than its counterparts. Furthermore, it provided viable fixes\nfor each vulnerability, demonstrating a low rate of false positives. Our tests\nencompassed 129 code samples across eight programming languages, revealing the\nhighest vulnerabilities in PHP and JavaScript. GPT-4's code corrections led to\na 90% reduction in vulnerabilities, requiring only an 11% increase in code\nlines. A critical insight was LLMs' ability to self-audit, suggesting fixes for\ntheir identified vulnerabilities and underscoring their precision. Future\nresearch should explore system-level vulnerabilities and integrate multiple\nstatic code analyzers for a holistic perspective on LLMs' potential.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:33:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Noever","David",""]]}
{"id":"2308.10346","submitter":"Sifan Liu","authors":"Sifan Liu","title":"An Exact Sampler for Inference after Polyhedral Model Selection","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":"  Inference after model selection presents computational challenges when\ndealing with intractable conditional distributions. Markov chain Monte Carlo\n(MCMC) is a common method for sampling from these distributions, but its slow\nconvergence often limits its practicality. In this work, we introduce a method\ntailored for selective inference in cases where the selection event can be\ncharacterized by a polyhedron. The method transforms the variables constrained\nby a polyhedron into variables within a unit cube, allowing for efficient\nsampling using conventional numerical integration techniques. Compared to MCMC,\nthe proposed sampling method is highly accurate and equipped with an error\nestimate. Additionally, we introduce an approach to use a single batch of\nsamples for hypothesis testing and confidence interval construction across\nmultiple parameters, reducing the need for repetitive sampling. Furthermore,\nour method facilitates fast and precise computation of the maximum likelihood\nestimator based on the selection-adjusted likelihood, enhancing the reliability\nof MLE-based inference. Numerical results demonstrate the superior performance\nof the proposed method compared to alternative approaches for selective\ninference.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:39:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Sifan",""]]}
{"id":"2308.10347","submitter":"Huiyuan Chen","authors":"Vivian Lai, Huiyuan Chen, Chin-Chia Michael Yeh, Minghua Xu, Yiwei\n  Cai, Hao Yang","title":"Enhancing Transformers without Self-supervised Learning: A Loss\n  Landscape Perspective in Sequential Recommendation","comments":null,"journal-ref":null,"doi":"10.1145/3604915.3608831","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transformer and its variants are a powerful class of architectures for\nsequential recommendation, owing to their ability of capturing a user's dynamic\ninterests from their past interactions. Despite their success,\nTransformer-based models often require the optimization of a large number of\nparameters, making them difficult to train from sparse data in sequential\nrecommendation. To address the problem of data sparsity, previous studies have\nutilized self-supervised learning to enhance Transformers, such as pre-training\nembeddings from item attributes or contrastive data augmentations. However,\nthese approaches encounter several training issues, including initialization\nsensitivity, manual data augmentations, and large batch-size memory\nbottlenecks.\n  In this work, we investigate Transformers from the perspective of loss\ngeometry, aiming to enhance the models' data efficiency and generalization in\nsequential recommendation. We observe that Transformers (e.g., SASRec) can\nconverge to extremely sharp local minima if not adequately regularized.\nInspired by the recent Sharpness-Aware Minimization (SAM), we propose SAMRec,\nwhich significantly improves the accuracy and robustness of sequential\nrecommendation. SAMRec performs comparably to state-of-the-art self-supervised\nTransformers, such as S$^3$Rec and CL4SRec, without the need for pre-training\nor strong data augmentations.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:45:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lai","Vivian",""],["Chen","Huiyuan",""],["Yeh","Chin-Chia Michael",""],["Xu","Minghua",""],["Cai","Yiwei",""],["Yang","Hao",""]]}
{"id":"2308.10348","submitter":"Jonas T. Doumate","authors":"Jonas T. Doumat\\`e, Tahir B. Issa, and Rachidi B. Salako","title":"Competition-exclusion and coexistence in a two-strain SIS epidemic model\n  in patchy environments","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work examines the dynamics of solutions of a two-strain SIS epidemic\nmodel in patchy environments. The basic reproduction number $\\mathcal{R}_0$ is\nintroduced, and sufficient conditions are provided to guarantee the global\nstability of the disease-free equilibrium (DFE). In particular, the DFE is\nglobally stable when either: (i) $\\mathcal{R}_0\\le \\frac{1}{k}$, where $k\\ge 2$\nis the total number of patches, or (ii) $\\mathcal{R}_0<1$ and the dispersal\nrate of the susceptible population is large. Moreover, the questions of\ncompetition-exclusion and coexistence of the strains are investigated when the\nsingle-strain reproduction numbers are greater than one. In this direction,\nunder some appropriate hypotheses, it is shown that the strain whose basic\nreproduction number and local reproduction function are the largest always\ndrives the other strain to extinction in the long run. Furthermore, the\nasymptotic dynamics of the solutions are presented when either both strain's\nlocal reproduction functions are spatially homogeneous or the population\ndispersal rate is uniform. In the latter case, the invasion numbers are\nintroduced and the existence of coexistence endemic equilibrium (EE) is proved\nwhen these invasion numbers are greater than one. Numerical simulations are\nprovided to complement the theoretical results.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:51:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Doumat\u00e8","Jonas T.",""],["Issa","Tahir B.",""],["Salako","Rachidi B.",""]]}
{"id":"2308.10349","submitter":"Kirill Tuchin","authors":"Matteo Buzzegoli, Kirill Tuchin","title":"Electromagnetic radiation at extreme angular velocity","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph gr-qc hep-th nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a system rotating at extremely high angular velocity, so that its\nmatter is found mostly at the light-cylinder. We posit that it can be described\nby quantum fields confined to the two-dimensional cylindrical surface rotating\nabout its symmetry axis. We apply this model to study the electromagnetic\nradiation. In particular, we compute the prompt photon spectrum emitted by the\nquark-gluon plasma.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:53:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Buzzegoli","Matteo",""],["Tuchin","Kirill",""]]}
{"id":"2308.10350","submitter":"Alexander Magner Grygory","authors":"A.G. Magner, A.I. Sanzhur, S.N. Fedotkin, A.I. Levon, U.V. Grygoriev,\n  S. Shlomo","title":"Nuclear level density in the statistical semiclassical micro-macroscopic\n  approach","comments":"31 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Level density $\\rho$ is derived for a finite system with strongly interacting\nnucleons at a given energy E, neutron N and proton Z particle numbers,\nprojection of the angular momentum M, and other integrals of motion, within the\nsemiclassical periodic-orbit theory (POT) beyond the standard Fermi-gas\nsaddle-point method. For large particle numbers, one obtains an analytical\nexpression for the level density which is extended to low excitation energies U\nin the statistical micro-macroscopic approach (MMA).The interparticle\ninteraction averaged over particle numbers is taken into account in terms of\nthe extended Thomas-Fermi component of the POT. The shell structure of\nspherical and deformed nuclei is taken into account in the level density. The\nMMA expressions for the level density $\\rho$ reaches the well-known macroscopic\nFermi-gas asymptote for large excitation energies U and the finite combinatoric\npower-expansion limit for low energies U. We compare our MMA results for the\naveraged level density with the experimental data obtained from the known\nexcitation energy spectra by using the sample method under statistical and\nplateau conditions. Fitting the MMA $\\rho$ to these experimental data on the\naveraged level density by using only one free physical parameter - inverse\nlevel density parameter K - for several nuclei and their long isotope chain at\nlow excitation energies U, one obtains the results for K. These values of K\nmight be much larger than those deduced from neutron resonances. The shell,\nisotopic asymmetry, and pairing effects are significant for low excitation\nenergies.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:56:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Magner","A. G.",""],["Sanzhur","A. I.",""],["Fedotkin","S. N.",""],["Levon","A. I.",""],["Grygoriev","U. V.",""],["Shlomo","S.",""]]}
{"id":"2308.10351","submitter":"Amin Faraji Astaneh","authors":"Amin Faraji Astaneh, Sergey N. Solodukhin","title":"Fermions, boundaries and conformal and chiral anomalies in $d=3,\\ 4$ and\n  $5$ dimensions","comments":"33 pages, typos fixed, added additional discussion about chiral\n  boundary conditions in 4 dimensions","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech gr-qc math.DG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the presence of boundaries, the quantum anomalies acquire additional\nboundary terms. In odd dimensions the integrated conformal anomaly, for which\nthe bulk contribution is known to be absent, is non-trivial due to the boundary\nterms. These terms became a subject of active study in the recent years. In the\npresent paper we continue our previous study [1], [2] and compute explicitly\nthe anomaly for fermions in dimensions $d=3, \\ 4 \\ $ and $5$. The calculation\nin dimension $5$ is new. It contains both contributions of the gravitational\nfield and the gauge fields to the anomaly. In dimensions $d=3$ and $4$ we\nreproduce and clarify the derivation of the results available in the\nliterature. Imposing the conformal invariant mixed boundary conditions for\nfermions in odd dimension $d$ we particularly pay attention to the necessity of\nchoosing the doubling representation for gamma matrices. In this representation\nthere exists a possibility to define chirality and thus address the question of\nthe chiral anomaly. The anomaly is entirely due to terms defined on the\nboundary. They are calculated in the present paper in dimensions $d=3$ and $5$\ndue to both gravitational and gauge fields. To complete the picture we\nre-evaluate the chiral anomaly in $d=4$ dimensions and find a new boundary term\nthat is supplementary to the well-known Pontryagin term.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:04:46 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 17:56:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Astaneh","Amin Faraji",""],["Solodukhin","Sergey N.",""]]}
{"id":"2308.10352","submitter":"Neptali Romero","authors":"Maira Aranguren, Jorge Campos, Neptal\\'i Romero and Ram\\'on Vivas","title":"Shift spaces, Languages and Transfinite Induction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This note deal with an extension of the classical notion of shift space:\nshift-invariant closed subsets of a Cartesian product of finite sets endowed\nwith the prodiscrete topology. In such a framework it is introduced the\nlanguage of this type of shift space and a characterization is shown, which\nrequires transfinite induction because the universe of those shift spaces are\nnot necessarily countable.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:06:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aranguren","Maira",""],["Campos","Jorge",""],["Romero","Neptal\u00ed",""],["Vivas","Ram\u00f3n",""]]}
{"id":"2308.10353","submitter":"Nageswari Shanmugalingam","authors":"Ivan Caamano, Josh Kline, Nageswari Shanmugalingam","title":"Fine properties of metric space-valued mappings of bounded variation in\n  metric measure spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Here we consider two notions of mappings of bounded variation (BV) from the\nmetric measure space into the metric space; one based on relaxations of\nNewton-Sobolev functions, and the other based on a notion of AM-upper\ngradients. We show that when the target metric space is a Banach space, these\ntwo notions coincide with comparable energies, but for more general target\nmetric spaces, the two notions can give different function-classes. We then\nconsider the fine properties of BV mappings (based on the AM-upper gradient\nproperty), and show that when the target space is a proper metric space, then\nfor a BV mapping into the target space, co-dimension $1$-almost every point in\nthe jump set of a BV mapping into the proper space has at least two, and at\nmost $k_0$, number of jump values associated with it, and that the preimage of\nballs around these jump values have lower density at least $\\gamma$ at that\npoint. Here $k_0$ and $\\gamma$ depend solely on the structural constants\nassociated with the metric measure space, and jump points are points at which\nthe map is not approximately continuous.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:07:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Caamano","Ivan",""],["Kline","Josh",""],["Shanmugalingam","Nageswari",""]]}
{"id":"2308.10354","submitter":"Zeinab Sadat Taghavi","authors":"Zeinab Sadat Taghavi, Soroush Gooran, Seyed Arshan Dalili, Hamidreza\n  Amirzadeh, Mohammad Jalal Nematbakhsh, Hossein Sameti","title":"Imaginations of WALL-E : Reconstructing Experiences with an\n  Imagination-Inspired Module for Advanced AI Systems","comments":"18 pages,","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we introduce a novel Artificial Intelligence (AI) system\ninspired by the philosophical and psychoanalytical concept of imagination as a\n``Re-construction of Experiences\". Our AI system is equipped with an\nimagination-inspired module that bridges the gap between textual inputs and\nother modalities, enriching the derived information based on previously learned\nexperiences. A unique feature of our system is its ability to formulate\nindependent perceptions of inputs. This leads to unique interpretations of a\nconcept that may differ from human interpretations but are equally valid, a\nphenomenon we term as ``Interpretable Misunderstanding\". We employ large-scale\nmodels, specifically a Multimodal Large Language Model (MLLM), enabling our\nproposed system to extract meaningful information across modalities while\nprimarily remaining unimodal. We evaluated our system against other large\nlanguage models across multiple tasks, including emotion recognition and\nquestion-answering, using a zero-shot methodology to ensure an unbiased\nscenario that may happen by fine-tuning. Significantly, our system outperformed\nthe best Large Language Models (LLM) on the MELD, IEMOCAP, and CoQA datasets,\nachieving Weighted F1 (WF1) scores of 46.74%, 25.23%, and Overall F1 (OF1)\nscore of 17%, respectively, compared to 22.89%, 12.28%, and 7% from the\nwell-performing LLM. The goal is to go beyond the statistical view of language\nprocessing and tie it to human concepts such as philosophy and psychoanalysis.\nThis work represents a significant advancement in the development of\nimagination-inspired AI systems, opening new possibilities for AI to generate\ndeep and interpretable information across modalities, thereby enhancing\nhuman-AI interaction.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:10:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Taghavi","Zeinab Sadat",""],["Gooran","Soroush",""],["Dalili","Seyed Arshan",""],["Amirzadeh","Hamidreza",""],["Nematbakhsh","Mohammad Jalal",""],["Sameti","Hossein",""]]}
{"id":"2308.10355","submitter":"Ching-Yu Chiu","authors":"Ching-Yu Chiu, Meinard M\\\"uller, Matthew E. P. Davies, Alvin Wen-Yu\n  Su, and Yi-Hsuan Yang","title":"Local Periodicity-Based Beat Tracking for Expressive Classical Piano\n  Music","comments":"Accepted to IEEE/ACM Transactions on Audio, Speech, and Language\n  Processing (July 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To model the periodicity of beats, state-of-the-art beat tracking systems use\n\"post-processing trackers\" (PPTs) that rely on several empirically determined\nglobal assumptions for tempo transition, which work well for music with a\nsteady tempo. For expressive classical music, however, these assumptions can be\ntoo rigid. With two large datasets of Western classical piano music, namely the\nAligned Scores and Performances (ASAP) dataset and a dataset of Chopin's\nMazurkas (Maz-5), we report on experiments showing the failure of existing PPTs\nto cope with local tempo changes, thus calling for new methods. In this paper,\nwe propose a new local periodicity-based PPT, called predominant local\npulse-based dynamic programming (PLPDP) tracking, that allows for more flexible\ntempo transitions. Specifically, the new PPT incorporates a method called\n\"predominant local pulses\" (PLP) in combination with a dynamic programming (DP)\ncomponent to jointly consider the locally detected periodicity and beat\nactivation strength at each time instant. Accordingly, PLPDP accounts for the\nlocal periodicity, rather than relying on a global tempo assumption. Compared\nto existing PPTs, PLPDP particularly enhances the recall values at the cost of\na lower precision, resulting in an overall improvement of F1-score for beat\ntracking in ASAP (from 0.473 to 0.493) and Maz-5 (from 0.595 to 0.838).\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:12:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chiu","Ching-Yu",""],["M\u00fcller","Meinard",""],["Davies","Matthew E. P.",""],["Su","Alvin Wen-Yu",""],["Yang","Yi-Hsuan",""]]}
{"id":"2308.10356","submitter":"Bruce Hoeneisen","authors":"Bruce Hoeneisen","title":"Comparing measurements and limits on the warm dark matter\n  temperature-to-mass ratio","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Limits on the \"thermal relic\" warm dark matter mass are apparently\ninconsistent with measurements of the warm dark matter temperature-to-mass\nratio. We try to understand this problem.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:13:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hoeneisen","Bruce",""]]}
{"id":"2308.10357","submitter":"Xianyi Zeng","authors":"Xianyi Zeng","title":"An Explicit Fourth-Order Hybrid-Variable Method for Euler Equations with\n  A Residual-Consistent Viscosity","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we present a formally fourth-order accurate hybrid-variable\nmethod for the Euler equations in the context of method of lines. The\nhybrid-variable (HV) method seeks numerical approximations to both\ncell-averages and nodal solutions and evolves them in time simultaneously; and\nit is proved in previous work that these methods are inherent superconvergent.\nTaking advantage of the superconvergence, the method is built on a third-order\ndiscrete differential operator, which approximates the first spatial derivative\nat each grid point, only using the information in the two neighboring cells.\nStability and accuracy analyses are conducted in the one-dimensional case for\nthe linear advection equation; whereas extension to nonlinear systems including\nthe Euler equations is achieved using characteristic decomposition and the\nincorporation of a residual-consistent viscosity to capture strong\ndiscontinuities. Extensive numerical tests are presented to assess the\nnumerical performance of the method for both 1D and 2D problems.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:14:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zeng","Xianyi",""]]}
{"id":"2308.10358","submitter":"Leonid E. Golub","authors":"L. E. Golub, E. L. Ivchenko, and B. Spivak","title":"Electrical Magnetochiral current in Tellurium","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have studied theoretically the effect of Electrical Magneto-Chiral\nAnisotropy (eMChA) in $p$-type tellurium crystals. It is shown that the terms\n$k_i B_j$ in the hole Hamiltonian, linear both in the wave vector ${\\mathbf k}$\nand the magnetic field ${\\mathbf B}$, do not lead to the eMChA and one needs to\ninclude the higher-order terms like $k_i^3 B_j$. Two microscopic mechanisms of\nthe effect are considered. In the first one only elastic scattering of holes by\nimpurities or imperfections are taken into consideration only. In the second\nmechanism, besides the elastic scattering processes the hole gas heating and\nits energy relaxation are taken into account. It is demonstrated that he both\ncontributions to the magneto-induced rectification are comparable in magnitude.\nThe calculation is performed by using two independent approaches, namely, in\nthe time relaxation approximation and in the limit of of small chiral band\nparameter $\\beta$. A bridge is thrown between the eMChA and magneto-induced\nphotogalvanic effects.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:17:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Golub","L. E.",""],["Ivchenko","E. L.",""],["Spivak","B.",""]]}
{"id":"2308.10359","submitter":"Maria Elena Filippin","authors":"Hanfeng Chen, Maria Elena Filippin","title":"Unveiling the Interplay between Central Bank Digital Currency and Bank\n  Deposits","comments":"41 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend the Real Business Cycle model in Niepelt (2022) to analyze the risk\nto financial stability following the introduction of a central bank digital\ncurrency (CBDC). CBDC competes with commercial bank deposits as households'\nsource of liquidity. We consider different degrees of substitutability between\npayment instruments and review the equivalence result in Niepelt (2022) by\nintroducing a collateral constraint banks must respect when borrowing from the\ncentral bank. When CBDC and deposits are perfect substitutes, the central bank\ncan offer loans to banks that render the introduction of CBDC neutral to the\nreal economy. We show that the optimal level of the central bank's lending rate\ndepends on the restrictiveness of the collateral constraint: the tighter it is,\nthe lower the loan rate the central bank needs to post. However, when CBDC and\ndeposits are imperfect substitutes, the central bank cannot make banks\nindifferent to the competition from CBDC. It follows that the introduction of\nCBDC has real effects on the economy.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:24:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Hanfeng",""],["Filippin","Maria Elena",""]]}
{"id":"2308.10360","submitter":"Paulo de Souza Mendes","authors":"Paulo R. de Souza Mendes","title":"A note on the Moody diagram","comments":"5 pages, 2 figures","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 propose an alternate scaling for the head loss in the steady\nflow of Newtonian fluids through tubes. The characteristics of the proposed\nscaling render more clear the role of inertia in this flow and ensure that the\ntrends of the relationship between dimensionless quantities are the same ones\nobserved in the dimensional problem.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:25:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mendes","Paulo R. de Souza",""]]}
{"id":"2308.10361","submitter":"Sizheng Ma","authors":"Sizheng Ma, Jordan Moxon, Mark A. Scheel, Kyle C. Nelli, Nils Deppe,\n  Marceline S. Bonilla, Lawrence E. Kidder, Prayush Kumar, Geoffrey Lovelace,\n  William Throwe, Nils L. Vu","title":"Fully relativistic three-dimensional Cauchy-characteristic matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A fully relativistic three-dimensional Cauchy-characteristic matching (CCM)\nalgorithm is implemented in a numerical relativity code SpECTRE. The method is\nfree of approximations and can be applied to any physical system. We test the\nalgorithm with various scenarios, including the propagation of Teukolsky waves\nwithin a flat background, the perturbation of a Kerr black hole with a\nTeukolsky wave, and the injection of a gravitational-wave pulse from the\ncharacteristic grid. Our investigations reveal no numerical instabilities in\nthe simulations. In addition, the tests indicate that the CCM algorithm\neffectively directs characteristic information into the inner Cauchy system,\nyielding higher precision in waveforms and smaller violations of Bondi-gauge\nconstraints, especially when the outer boundary of the Cauchy evolution is at a\nsmaller radius.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:31:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Sizheng",""],["Moxon","Jordan",""],["Scheel","Mark A.",""],["Nelli","Kyle C.",""],["Deppe","Nils",""],["Bonilla","Marceline S.",""],["Kidder","Lawrence E.",""],["Kumar","Prayush",""],["Lovelace","Geoffrey",""],["Throwe","William",""],["Vu","Nils L.",""]]}
{"id":"2308.10362","submitter":"Ahmed Alkhateeb","authors":"Tawfik Osman, Gouranga Charan, and Ahmed Alkhateeb","title":"Vehicle Cameras Guide mmWave Beams: Approach and Real-World V2V\n  Demonstration","comments":"Dataset and code files are available on the DeepSense 6G website\n  https://deepsense6g.net/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CV eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurately aligning millimeter-wave (mmWave) and terahertz (THz) narrow beams\nis essential to satisfy reliability and high data rates of 5G and beyond\nwireless communication systems. However, achieving this objective is difficult,\nespecially in vehicle-to-vehicle (V2V) communication scenarios, where both\ntransmitter and receiver are constantly mobile. Recently, additional sensing\nmodalities, such as visual sensors, have attracted significant interest due to\ntheir capability to provide accurate information about the wireless\nenvironment. To that end, in this paper, we develop a deep learning solution\nfor V2V scenarios to predict future beams using images from a 360 camera\nattached to the vehicle. The developed solution is evaluated on a real-world\nmulti-modal mmWave V2V communication dataset comprising co-existing 360 camera\nand mmWave beam training data. The proposed vision-aided solution achieves\n$\\approx 85\\%$ top-5 beam prediction accuracy while significantly reducing the\nbeam training overhead. This highlights the potential of utilizing vision for\nenabling highly-mobile V2V communications.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:43:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Osman","Tawfik",""],["Charan","Gouranga",""],["Alkhateeb","Ahmed",""]]}
{"id":"2308.10363","submitter":"Thiago Dias","authors":"Thiago Dias, Sebasti\\'an Gon\\c{c}alves","title":"Effectiveness of wealth-based vs exchange-based tax systems in reducing\n  inequality","comments":"9 pages, 7 figures, original paper","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the so-called ``fair'' models of peer-to-peer wealth exchanges, economic\ninequality tends to reach its maximum value asymptotically. This global trend\nis evident as the richest continuously accumulate a larger share of wealth at\nthe expense of others. To address the mounting issue of inequality, different\nstrategies of taxes and redistribution are commonly employed. Our study delves\ninto the interplay between wealth and trade (consumption) tax bases, probing\ntheir impact on wealth distribution within wealth-conservative economies. The\nultimate aim is to unearth an optimal framework that adeptly curbs\ninequality.Through a meticulous analysis of varying tax rates and the\nallocation of the collected tax to the most economically vulnerable strata, we\nunveil a compelling pattern resembling two distinct phases. These phases\ndelineate the most effective systems for inequality mitigation. Our findings\nunderscore the synergistic potential of amalgamating these tax systems,\nsurpassing the individual efficacy of each. This synthesis beckons policymakers\nto weave together tax rates and precision-targeted redistribution, crafting tax\nsystems that wield the potential for tangible and substantial reductions in\neconomic disparity.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:44:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dias","Thiago",""],["Gon\u00e7alves","Sebasti\u00e1n",""]]}
{"id":"2308.10364","submitter":"Laurence Illing Midgley","authors":"Laurence I. Midgley and Vincent Stimper and Javier Antor\\'an and Emile\n  Mathieu and Bernhard Sch\\\"olkopf and Jos\\'e Miguel Hern\\'andez-Lobato","title":"SE(3) Equivariant Augmented Coupling Flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Coupling normalizing flows allow for fast sampling and density evaluation,\nmaking them the tool of choice for probabilistic modeling of physical systems.\nHowever, the standard coupling architecture precludes endowing flows that\noperate on the Cartesian coordinates of atoms with the SE(3) and permutation\ninvariances of physical systems. This work proposes a coupling flow that\npreserves SE(3) and permutation equivariance by performing coordinate splits\nalong additional augmented dimensions. At each layer, the flow maps atoms'\npositions into learned SE(3) invariant bases, where we apply standard flow\ntransformations, such as monotonic rational-quadratic splines, before returning\nto the original basis. Crucially, our flow preserves fast sampling and density\nevaluation, and may be used to produce unbiased estimates of expectations with\nrespect to the target distribution via importance sampling. When trained on the\nDW4, LJ13 and QM9-positional datasets, our flow is competitive with equivariant\ncontinuous normalizing flows, while allowing sampling two orders of magnitude\nfaster. Moreover, to the best of our knowledge, we are the first to learn the\nfull Boltzmann distribution of alanine dipeptide by only modeling the Cartesian\npositions of its atoms. Lastly, we demonstrate that our flow can be trained to\napproximately sample from the Boltzmann distribution of the DW4 and LJ13\nparticle systems using only their energy functions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:49:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Midgley","Laurence I.",""],["Stimper","Vincent",""],["Antor\u00e1n","Javier",""],["Mathieu","Emile",""],["Sch\u00f6lkopf","Bernhard",""],["Hern\u00e1ndez-Lobato","Jos\u00e9 Miguel",""]]}
{"id":"2308.10365","submitter":"Clovis Eberhart","authors":"Clovis Eberhart, J\\'er\\'emy Dubut, James Haydon, Ichiro Hasuo","title":"Formal Verification of Safety Architectures for Automated Driving","comments":"In proceedings of 2023 IEEE Intelligent Vehicles Symposium (IV), 8\n  pages, 5 figures","journal-ref":"In 2023 IEEE Intelligent Vehicles Symposium (IV), pp. 1-8 (2023)","doi":"10.1109/IV55152.2023.10186763","report-no":null,"categories":"cs.RO cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Safety architectures play a crucial role in the safety assurance of automated\ndriving vehicles (ADVs). They can be used as safety envelopes of black-box ADV\ncontrollers, and for graceful degradation from one ODD to another. Building on\nour previous work on the formalization of responsibility-sensitive safety\n(RSS), we introduce a novel program logic that accommodates assume-guarantee\nreasoning and fallback-like constructs. This allows us to formally define and\nprove the safety of existing and novel safety architectures. We apply the logic\nto a pull over scenario and experimentally evaluate the resulting safety\narchitecture.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:07:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Eberhart","Clovis",""],["Dubut","J\u00e9r\u00e9my",""],["Haydon","James",""],["Hasuo","Ichiro",""]]}
{"id":"2308.10366","submitter":"Monica Lewis","authors":"Monica Lewis","title":"F-Holonomic F-Modules","comments":"38 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $R=\\mathbb{F}_p[x_1,\\ldots,x_n]$ and let $\\mathbf{F}$ be the ring of\nFrobenius operators over $R$. We introduce a notion of Bernstein dimension and\nmultiplicity for the class of finitely generated $\\mathbf{F}$-modules whose\nstructure morphism has a finite length kernel. We show that an\n$\\mathbf{F}$-module belongs to this class if and only if it admits a great\nfiltration with respect to the Bernstein filtration on $\\mathbf{F}$. We\ndescribe the Hilbert series of these great filtrations, and prove that the\ndimension and multiplicity defined in terms of this Hilbert series are\nindependent of the choice of filtration. We refer to the $\\mathbf{F}$-modules\nof Bernstein dimension $0$ as $F$-holonomic. We show that $F$-holonomic\n$\\mathbf{F}$-modules are a full abelian subcategory of\n$\\text{Mod}_{\\mathbf{F}}$, closed under taking extensions, on which\nmultiplicity is an additive function. We show that Lyubeznik's finitely\ngenerated unit $\\mathbf{F}$-modules are $F$-holonomic.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:10:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lewis","Monica",""]]}
{"id":"2308.10367","submitter":"Ahmad Farzaneh Kord Dr","authors":"M. Karimabadi, A.F. Kord, B. Azadegan","title":"Transverse and non-boost longitudinal expansion of (2+1)dimensional\n  relativistic ideal-hydrodynamics flow in heavy ion collisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study investigates the evolution of quark gluon plasma (QGP) within a\ngeneralized Bjorken flow framework. The medium under consideration is assumed\nto possess a finite transverse size and to expand both radially and along the\nbeam axis. However, we assume that the boost invariance of longitudinal\nexpansion is broken.\n  To be more specific, we generalize the Bjorken solution to include the\nacceleration and transverse expansion of the fluid. We analytically study the\n(2 + 1) dimensional longitudinal acceleration expansion of hot and dense quark\nmatter, applying a perturbation approach to solve the relativistic\nhydrodynamics equations. This procedure enables us to obtain exact algebraic\nexpressions for fluid velocities and energy densities in both transverse and\nlongitudinal directions.\n  To simplify our calculations, we assume that the fluid is produced in central\ncollisions, and therefore, we consider azimuthal symmetry. We compare the\nradial velocity and correction energy density with those obtained from the\nGubser model.\n  Furthermore, we determine the fluid's acceleration parameter and longitudinal\ncorrection energy density, which exhibits a Gaussian distribution.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:24:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Karimabadi","M.",""],["Kord","A. F.",""],["Azadegan","B.",""]]}
{"id":"2308.10368","submitter":"Md Sabbirul Haque","authors":"M. S. Haque, M. S. Taluckder, S. B. Shawkat, M. A. Shahriyar, M. A.\n  Sayed, C. Modak","title":"Prediction of Pneumonia and COVID-19 Using Deep Neural Networks","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":"  Pneumonia, caused by bacteria and viruses, is a rapidly spreading viral\ninfection with global implications. Prompt identification of infected\nindividuals is crucial for containing its transmission. This study explores the\npotential of medical image analysis to address this challenge. We propose\nmachine-learning techniques for predicting Pneumonia from chest X-ray images.\nChest X-ray imaging is vital for Pneumonia diagnosis due to its accessibility\nand cost-effectiveness. However, interpreting X-rays for Pneumonia detection\ncan be complex, as radiographic features can overlap with other respiratory\nconditions. We evaluate the performance of different machine learning models,\nincluding DenseNet121, Inception Resnet-v2, Inception Resnet-v3, Resnet50, and\nXception, using chest X-ray images of pneumonia patients. Performance measures\nand confusion matrices are employed to assess and compare the models. The\nfindings reveal that DenseNet121 outperforms other models, achieving an\naccuracy rate of 99.58%. This study underscores the significance of machine\nlearning in the accurate detection of Pneumonia, leveraging chest X-ray images.\nOur study offers insights into the potential of technology to mitigate the\nspread of pneumonia through precise diagnostics.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:26:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Haque","M. S.",""],["Taluckder","M. S.",""],["Shawkat","S. B.",""],["Shahriyar","M. A.",""],["Sayed","M. A.",""],["Modak","C.",""]]}
{"id":"2308.10369","submitter":"Joseph Thalakkottor","authors":"Joseph Thalakkottor and Kamran Mohseni","title":"Capturing the kinematics and dynamics of fluid fronts","comments":"31 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gibbs was the first person to represent a phase interface by a dividing\nsurface. He defined the dividing surface as a mathematical surface that has its\nown material properties and internal dynamics. In this paper, an alternative\nderivation to this mathematical surface is provided that generalizes the\nconcept of dividing surface to fluid fronts beyond that of just a phase or\nmaterial interface. Other fluid fronts being a vortex sheet, shock front,\nmoving contact line, and gravity wavefront, to name a few. Here, this extended\ndefinition of dividing surface is referred to as the extended dividing\nhypersurface (EDH), as it is not just applicable to a surface front but also to\na line and a point front. This hypersurface is a continuum approximation of a\ndiffused region with fluid properties and flow parameters varying sharply but\ncontinuously across it. This paper shows that the properties and equations\ndescribing an EDH can be derived from the equations describing the diffused\nregion by integrating it in the directions normal to the hypersurface. This is\nequivalent to collapsing the diffused region in the normal direction. Hence,\nensuring that the EDH is both kinematically and dynamically equivalent to that\nof the diffused region. Various canonical problems are examined to demonstrate\nthe ability of the EDH to accurately represent different types of fluid and\nflow fronts, including static and dynamic interfaces, shock fronts, and vortex\nsheets. These examples emphasize the EDH's capability to represent various\nfunctionalities within a front, the relationship between the flux of quantities\nand hypersurface quantities, and the importance of considering the mass of\nfront and associated dynamics.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:29:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Thalakkottor","Joseph",""],["Mohseni","Kamran",""]]}
{"id":"2308.10370","submitter":"Sidney Wong","authors":"Sidney G.-J. Wong, Matthew Durward, Benjamin Adams and Jonathan Dunn","title":"cantnlp@LT-EDI-2023: Homophobia/Transphobia Detection in Social Media\n  Comments using Spatio-Temporally Retrained Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes our multiclass classification system developed as part\nof the LTEDI@RANLP-2023 shared task. We used a BERT-based language model to\ndetect homophobic and transphobic content in social media comments across five\nlanguage conditions: English, Spanish, Hindi, Malayalam, and Tamil. We\nretrained a transformer-based crosslanguage pretrained language model,\nXLMRoBERTa, with spatially and temporally relevant social media language data.\nWe also retrained a subset of models with simulated script-mixed social media\nlanguage data with varied performance. We developed the best performing\nseven-label classification system for Malayalam based on weighted macro\naveraged F1 score (ranked first out of six) with variable performance for other\nlanguage and class-label conditions. We found the inclusion of this\nspatio-temporal data improved the classification performance for all language\nand task conditions when compared with the baseline. The results suggests that\ntransformer-based language classification systems are sensitive to\nregister-specific and language-specific retraining.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:30:34 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 01:41:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wong","Sidney G. -J.",""],["Durward","Matthew",""],["Adams","Benjamin",""],["Dunn","Jonathan",""]]}
{"id":"2308.10371","submitter":"Jonas Bley","authors":"Simon Goorney, Jonas Bley, Stefan Heusler and Jacob Sherson","title":"The Quantum Curriculum Transformation Framework for the development of\n  Quantum Information Science and Technology Education","comments":"19+12 pages, 10 figures. S. Goorney and J. Bley contributed equally\n  to this work","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The field of Quantum Information Science and Technology (QIST) is booming.\nDue to this, many new educational courses and programs are needed in order to\nprepare a workforce for the developing industry. Owing to its specialist\nnature, teaching approaches in this field can suffer from being disconnected to\nthe substantial degree of science education research which aims to support the\nbest approaches to teaching in STEM fields. In order to connect these two\ncommunities with a pragmatic and repeatable methodology, we have generated an\ninnovative approach, the Quantum Curriculum Transformation Framework (QCTF),\nintended to provide a didactical perspective on the creation and transformation\nof quantum technologies curricula. For this, we propose a decision tree\nconsisting of four steps: 1. choose a topic, 2. choose one or more targeted\nskills, 3. choose a learning goal and 4. choose a teaching approach that\nachieves this goal. We show how this can be done using an example curriculum\nand more specifically quantum teleportation as a basic concept of quantum\ncommunication within this curriculum. By approaching curriculum creation and\ntransformation in this way, educational goals and outcomes are more clearly\ndefined which is in the interest of the individual and the industry alike. The\nframework is intended to structure the narrative of QIST teaching, and will\nform a basis for further research in the didactics of QIST, as the need for\nhigh quality education in this field continues to grow.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:44:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Goorney","Simon",""],["Bley","Jonas",""],["Heusler","Stefan",""],["Sherson","Jacob",""]]}
{"id":"2308.10372","submitter":"Timothy Kline","authors":"Darryl E. Wright, Adriana V. Gregory, Deema Anaam, Sepideh Yadollahi,\n  Sumana Ramanathan, Kafayat A. Oyemade, Reem Alsibai, Heather Holmes, Harrison\n  Gottlich, Cherie-Akilah G. Browne, Sarah L. Cohen Rassier, Isabel Green,\n  Elizabeth A. Stewart, Hiroaki Takahashi, Bohyun Kim, Shannon\n  Laughlin-Tommaso, Timothy L. Kline","title":"Developing a Machine Learning-Based Clinical Decision Support Tool for\n  Uterine Tumor Imaging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Uterine leiomyosarcoma (LMS) is a rare but aggressive malignancy. On imaging,\nit is difficult to differentiate LMS from, for example, degenerated leiomyoma\n(LM), a prevalent but benign condition. We curated a data set of 115 axial\nT2-weighted MRI images from 110 patients (mean [range] age=45 [17-81] years)\nwith UTs that included five different tumor types. These data were randomly\nsplit stratifying on tumor volume into training (n=85) and test sets (n=30). An\nindependent second reader (reader 2) provided manual segmentations for all test\nset images. To automate segmentation, we applied nnU-Net and explored the\neffect of training set size on performance by randomly generating subsets with\n25, 45, 65 and 85 training set images. We evaluated the ability of radiomic\nfeatures to distinguish between types of UT individually and when combined\nthrough feature selection and machine learning. Using the entire training set\nthe mean [95% CI] fibroid DSC was measured as 0.87 [0.59-1.00] and the\nagreement between the two readers was 0.89 [0.77-1.0] on the test set. When\nclassifying degenerated LM from LMS we achieve a test set F1-score of 0.80.\nClassifying UTs based on radiomic features we identify classifiers achieving\nF1-scores of 0.53 [0.45, 0.61] and 0.80 [0.80, 0.80] on the test set for the\nbenign versus malignant, and degenerated LM versus LMS tasks. We show that it\nis possible to develop an automated method for 3D segmentation of the uterus\nand UT that is close to human-level performance with fewer than 150 annotated\nimages. For distinguishing UT types, while we train models that merit further\ninvestigation with additional data, reliable automatic differentiation of UTs\nremains a challenge.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:46:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wright","Darryl E.",""],["Gregory","Adriana V.",""],["Anaam","Deema",""],["Yadollahi","Sepideh",""],["Ramanathan","Sumana",""],["Oyemade","Kafayat A.",""],["Alsibai","Reem",""],["Holmes","Heather",""],["Gottlich","Harrison",""],["Browne","Cherie-Akilah G.",""],["Rassier","Sarah L. Cohen",""],["Green","Isabel",""],["Stewart","Elizabeth A.",""],["Takahashi","Hiroaki",""],["Kim","Bohyun",""],["Laughlin-Tommaso","Shannon",""],["Kline","Timothy L.",""]]}
{"id":"2308.10373","submitter":"Hejia Geng","authors":"Hejia Geng, Peng Li","title":"HoSNN: Adversarially-Robust Homeostatic Spiking Neural Networks with\n  Adaptive Firing Thresholds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.CR cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spiking neural networks (SNNs) offer promise for efficient and powerful\nneurally inspired computation. Common to other types of neural networks,\nhowever, SNNs face the severe issue of vulnerability to adversarial attacks. We\npresent the first study that draws inspiration from neural homeostasis to\ndevelop a bio-inspired solution that counters the susceptibilities of SNNs to\nadversarial onslaughts. At the heart of our approach is a novel\nthreshold-adapting leaky integrate-and-fire (TA-LIF) neuron model, which we\nadopt to construct the proposed adversarially robust homeostatic SNN (HoSNN).\nDistinct from traditional LIF models, our TA-LIF model incorporates a\nself-stabilizing dynamic thresholding mechanism, curtailing adversarial noise\npropagation and safeguarding the robustness of HoSNNs in an unsupervised\nmanner. Theoretical analysis is presented to shed light on the stability and\nconvergence properties of the TA-LIF neurons, underscoring their superior\ndynamic robustness under input distributional shifts over traditional LIF\nneurons. Remarkably, without explicit adversarial training, our HoSNNs\ndemonstrate inherent robustness on CIFAR-10, with accuracy improvements to\n72.6% and 54.19% against FGSM and PGD attacks, up from 20.97% and 0.6%,\nrespectively. Furthermore, with minimal FGSM adversarial training, our HoSNNs\nsurpass previous models by 29.99% under FGSM and 47.83% under PGD attacks on\nCIFAR-10. Our findings offer a new perspective on harnessing biological\nprinciples for bolstering SNNs adversarial robustness and defense, paving the\nway to more resilient neuromorphic computing.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:47:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Geng","Hejia",""],["Li","Peng",""]]}
{"id":"2308.10374","submitter":"Christian Fonseca-Mora","authors":"Santiago Cambronero, David Campos, C. A. Fonseca-Mora, Dar\\'io Mena","title":"Quadratic Variation for Cylindrical Martingale-Valued Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article focuses in the definition of a quadratic variation for\ncylindrical orthogonal martingale-valued measures defined on Banach spaces.\nSufficient and necessary conditions for the existence of such a quadratic\nvariation are provided. Moreover, several properties of the quadratic variation\nare explored, as the existence of a quadratic variation operator. Our results\nare illustrated with numerous examples and in the case of a separable Hilbert\nspace, we delve into the relationship between our definition of quadratic\nvariation and the intensity measures defined by Walsh (1986) for orthogonal\nmartingale measures with values in separable Hilbert spaces. We finalize with a\nconstruction of a quadratic covariation and we explore some of its properties.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:06:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cambronero","Santiago",""],["Campos","David",""],["Fonseca-Mora","C. A.",""],["Mena","Dar\u00edo",""]]}
{"id":"2308.10375","submitter":"Armeen Taeb","authors":"Armeen Taeb, Peter B\\\"uhlmann and Venkat Chandrasekaran","title":"Model Selection over Partially Ordered Sets","comments":"added an acknowledgement section that was missing in v1","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In problems such as variable selection and graph estimation, models are\ncharacterized by Boolean logical structure such as presence or absence of a\nvariable or an edge. Consequently, false positive and false negative errors can\nbe specified as the number of variables or edges that are incorrectly\nincluded/excluded in an estimated model. However, there are several other\nproblems such as ranking, clustering, and causal inference in which the\nassociated model classes do not admit transparent notions of false positive and\nfalse negative errors due to the lack of an underlying Boolean logical\nstructure. In this paper, we present a generic approach to endow a collection\nof models with partial order structure, which leads to a hierarchical\norganization of model classes as well as natural analogs of false positive and\nfalse negative errors. We describe model selection procedures that provide\nfalse positive error control in our general setting and we illustrate their\nutility with numerical experiments.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:08:44 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 17:04:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Taeb","Armeen",""],["B\u00fchlmann","Peter",""],["Chandrasekaran","Venkat",""]]}
{"id":"2308.10376","submitter":"Nikita Olekhno","authors":"Oleg I. Burmistrov, Nikita V. Mikhailov, Dmitriy S. Dashkevich, Pavel\n  S. Seregin, Nikita A. Olekhno","title":"Wireless power transfer in magnetic resonance imaging at a higher-order\n  mode of a birdcage coil","comments":"6 pages, 5 figures + Supplementary Material 10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic resonance imaging (MRI) is a crucial tool for medical visualization.\nIn many cases, performing a scanning procedure requires the use of additional\nequipment, which can be powered by wires as well as via wireless power transfer\n(WPT) or wireless energy harvesting. In this Letter, we propose a novel scheme\nfor WPT that uses a higher-order mode of the MRI scanner's birdcage coil for\nenergy transmission. In contrast to the existing WPT solutions, our approach\ndoes not require additional transmitting coils. Compared to the energy\nharvesting, the proposed method allows supplying significantly more power. We\nperform numerical simulations demonstrating that one can use the fundamental\nmode of the birdcage coil to perform a scanning procedure while transmitting\nthe energy to the receiver at a higher-order mode without any interference with\nthe scanning signal or violation of safety constraints, as guaranteed by the\nmode structure of the birdcage. Also, we evaluate the specific absorption rate\nalong with the energy transfer efficiency and verify our numerical model by a\ndirect comparison with an experimental setup featuring a birdcage coil of a\n1.5T MRI scanner.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:14:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Burmistrov","Oleg I.",""],["Mikhailov","Nikita V.",""],["Dashkevich","Dmitriy S.",""],["Seregin","Pavel S.",""],["Olekhno","Nikita A.",""]]}
{"id":"2308.10377","submitter":"Marc Distel","authors":"Marc Distel","title":"Proper Minor-Closed Classes of Graphs have Assouad-Nagata Dimension 2","comments":"v2: Acknowledges an independent proof of the main result by Chun-Hung\n  Liu, available at arXiv:2308.12273","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Asymptotic dimension and Assouad-Nagata dimension are measures of the\nlarge-scale shape of a class of graphs. Bonamy et al. [J. Eur. Math. Society]\nshowed that any proper minor-closed class has asymptotic dimension 2, dropping\nto 1 only if the treewidth is bounded. We improve this result by showing it\nalso holds for the stricter Assouad-Nagata dimension. We also characterise when\nsubdivision-closed classes of graphs have bounded Assouad-Nagata dimension.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:15:40 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 07:59:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Distel","Marc",""]]}
{"id":"2308.10378","submitter":"Miles Currie","authors":"Kaitlin C. Rasmussen, Miles H. Currie, Celeste Hagee, Christiaan van\n  Buchem, Matej Malik, Arjun B. Savel, Matteo Brogi, Emily Rauscher, Victoria\n  Meadows, Megan Mansfield, Eliza M.R. Kempton, Jean-Michel Desert, Joost P.\n  Wardenier, Lorenzo Pino, Michael Line, Vivien Parmentier, Andreas Seifahrt,\n  David Kasper, Madison Brady, and Jacob L. Bean","title":"A Non-Detection of Iron in the First High-Resolution Emission Study of\n  the Lava Planet 55 Cnc e","comments":"Accepted to the AJ. 7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Close-in lava planets represent an extreme example of terrestrial worlds, but\ntheir high temperatures may allow us to probe a diversity of crustal\ncompositions. The brightest and most well-studied of these objects is 55 Cancri\ne, a nearby super-Earth with a remarkably short 17-hour orbit. However, despite\nnumerous studies, debate remains about the existence and composition of its\natmosphere. We present upper limits on the atmospheric pressure of 55 Cnc e\nderived from high-resolution time-series spectra taken with Gemini-N/MAROON-X.\nOur results are consistent with current crustal evaporation models for this\nplanet which predict a thin $\\sim$ 100 mbar atmosphere. We conclude that, if a\nmineral atmosphere is present on 55 Cnc e, the atmospheric pressure is below\n100 mbar.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:30:58 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 21:13:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rasmussen","Kaitlin C.",""],["Currie","Miles H.",""],["Hagee","Celeste",""],["van Buchem","Christiaan",""],["Malik","Matej",""],["Savel","Arjun B.",""],["Brogi","Matteo",""],["Rauscher","Emily",""],["Meadows","Victoria",""],["Mansfield","Megan",""],["Kempton","Eliza M. R.",""],["Desert","Jean-Michel",""],["Wardenier","Joost P.",""],["Pino","Lorenzo",""],["Line","Michael",""],["Parmentier","Vivien",""],["Seifahrt","Andreas",""],["Kasper","David",""],["Brady","Madison",""],["Bean","Jacob L.",""]]}
{"id":"2308.10379","submitter":"Bilgehan Sel","authors":"Bilgehan Sel, Ahmad Al-Tawaha, Vanshaj Khattar, Lu Wang, Ruoxi Jia,\n  Ming Jin","title":"Algorithm of Thoughts: Enhancing Exploration of Ideas in Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current literature, aiming to surpass the \"Chain-of-Thought\" approach, often\nresorts to an external modus operandi involving halting, modifying, and then\nresuming the generation process to boost Large Language Models' (LLMs)\nreasoning capacities. This mode escalates the number of query requests, leading\nto increased costs, memory, and computational overheads. Addressing this, we\npropose the Algorithm of Thoughts -- a novel strategy that propels LLMs through\nalgorithmic reasoning pathways, pioneering a new mode of in-context learning.\nBy employing algorithmic examples, we exploit the innate recurrence dynamics of\nLLMs, expanding their idea exploration with merely one or a few queries. Our\ntechnique outperforms earlier single-query methods and stands on par with a\nrecent multi-query strategy that employs an extensive tree search algorithm.\nIntriguingly, our results suggest that instructing an LLM using an algorithm\ncan lead to performance surpassing that of the algorithm itself, hinting at\nLLM's inherent ability to weave its intuition into optimized searches. We probe\ninto the underpinnings of our method's efficacy and its nuances in application.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:36:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sel","Bilgehan",""],["Al-Tawaha","Ahmad",""],["Khattar","Vanshaj",""],["Wang","Lu",""],["Jia","Ruoxi",""],["Jin","Ming",""]]}
{"id":"2308.10380","submitter":"Bilgehan Sel","authors":"Ming Jin, Bilgehan Sel, Fnu Hardeep, Wotao Yin","title":"A Human-on-the-Loop Optimization Autoformalism Approach for\n  Sustainability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper outlines a natural conversational approach to solving personalized\nenergy-related problems using large language models (LLMs). We focus on\ncustomizable optimization problems that necessitate repeated solving with\nslight variations in modeling and are user-specific, hence posing a challenge\nto devising a one-size-fits-all model. We put forward a strategy that augments\nan LLM with an optimization solver, enhancing its proficiency in understanding\nand responding to user specifications and preferences while providing nonlinear\nreasoning capabilities. Our approach pioneers the novel concept of human-guided\noptimization autoformalism, translating a natural language task specification\nautomatically into an optimization instance. This enables LLMs to analyze,\nexplain, and tackle a variety of instance-specific energy-related problems,\npushing beyond the limits of current prompt-based techniques.\n  Our research encompasses various commonplace tasks in the energy sector, from\nelectric vehicle charging and Heating, Ventilation, and Air Conditioning (HVAC)\ncontrol to long-term planning problems such as cost-benefit evaluations for\ninstalling rooftop solar photovoltaics (PVs) or heat pumps. This pilot study\nmarks an essential stride towards the context-based formulation of optimization\nusing LLMs, with the potential to democratize optimization processes. As a\nresult, stakeholders are empowered to optimize their energy consumption,\npromoting sustainable energy practices customized to personal needs and\npreferences.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:42:04 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 00:52:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jin","Ming",""],["Sel","Bilgehan",""],["Hardeep","Fnu",""],["Yin","Wotao",""]]}
{"id":"2308.10381","submitter":"Jose Socorro Garcia","authors":"J. Socorro, J. Juan Rosales and L. Toledo Sesma","title":"Anisotropic fractional cosmology: K-essence theory","comments":"21 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the particular configuration of the scalar field K-essence in the\nWheeler-DeWitt quantum equation, for some age in the Bianchi type I anisotropic\ncosmological model, a fractional differential equation for the scalar field\narises naturally. The order of the fractional differential equation is\n$\\alpha=\\frac{1+\\omega_X}{2\\omega_X}$. This fractional equation belongs to\ndifferent intervals, depending on the value of the barotropic parameter; when\n$\\rm \\omega_X \\in [0,1]$, the order belongs to the interval $1\\leq \\alpha \\leq\n2$, and when$\\rm \\omega_X \\in [-1,0)$, the order belongs to the interval\n$0<\\alpha \\leq 1$. In the quantum scheme, we introduce the factor ordering\nproblem in the variables $(\\Omega,\\phi)$ and its corresponding momenta\n$(\\Pi_\\Omega, \\Pi_\\phi)$, obtaining a linear fractional differential equation\nwith variable coefficients in the scalar field equation and the solution is\nfound using a fractional series expansion. The corresponding quantum solutions\nare also given. We found the classical solution in the usual gauge N obtained\nin the Hamiltonian formalism and without a gauge, in the last case, the general\nsolution is presented in a transformed time $T(\\tau)$, however in the dust era\nwe found a closed solution in the gauge time $\\tau$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:51:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Socorro","J.",""],["Rosales","J. Juan",""],["Sesma","L. Toledo",""]]}
{"id":"2308.10382","submitter":"Xing Yao","authors":"Xing Yao, Han Liu, Dewei Hu, Daiwei Lu, Ange Lou, Hao Li, Ruining\n  Deng, Gabriel Arenas, Baris Oguz, Nadav Schwartz, Brett C Byram, Ipek Oguz","title":"False Negative/Positive Control for SAM on Noisy Medical Images","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 Segment Anything Model (SAM) is a recently developed all-range foundation\nmodel for image segmentation. It can use sparse manual prompts such as bounding\nboxes to generate pixel-level segmentation in natural images but struggles in\nmedical images such as low-contrast, noisy ultrasound images. We propose a\nrefined test-phase prompt augmentation technique designed to improve SAM's\nperformance in medical image segmentation. The method couples multi-box prompt\naugmentation and an aleatoric uncertainty-based false-negative (FN) and\nfalse-positive (FP) correction (FNPC) strategy. We evaluate the method on two\nultrasound datasets and show improvement in SAM's performance and robustness to\ninaccurate prompts, without the necessity for further training or tuning.\nMoreover, we present the Single-Slice-to-Volume (SS2V) method, enabling 3D\npixel-level segmentation using only the bounding box annotation from a single\n2D slice. Our results allow efficient use of SAM in even noisy, low-contrast\nmedical images. The source code will be released soon.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:01:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yao","Xing",""],["Liu","Han",""],["Hu","Dewei",""],["Lu","Daiwei",""],["Lou","Ange",""],["Li","Hao",""],["Deng","Ruining",""],["Arenas","Gabriel",""],["Oguz","Baris",""],["Schwartz","Nadav",""],["Byram","Brett C",""],["Oguz","Ipek",""]]}
{"id":"2308.10383","submitter":"Adi Makmal","authors":"Yovav Tene-Cohen, Tomer Kelman, Ohad Lev, and Adi Makmal","title":"A Variational Qubit-Efficient MaxCut Heuristic Algorithm","comments":"16 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The resolution of hard combinatorial problems is essential in a wide range of\nindustrial applications and theoretical fields. Quantum computers offer a\nunique platform for addressing such problems, with the Quantum Approximate\nOptimization Algorithm (QAOA) being a state-of-the-art example. However, due to\nhigh levels of noise and limited numbers of qubits in current quantum devices,\nonly very small problem instances can be addressed on actual quantum hardware.\nHere we present a new variational Qubit-Efficient MaxCut (QEMC) algorithm that\nis specifically designed to find heuristic solutions for the MaxCut problem, a\nwell-studied NP-hard combinatorial problem. The QEMC method introduces a unique\ninformation encoding scheme that requires $\\log{N}$ qubits to address graphs\nwith $N$ nodes, an exponential reduction in comparison to QAOA. Each node of\nthe graph is assigned to a unique computational quantum state, and its logical\nstate is depicted by the measurement probability of the corresponding state,\nusing a probability-threshold encoding scheme. Consequently, each partition of\nthe graph is associated with a volume of states, rather than with just a single\nstate. We present noiseless QEMC simulations on regular graphs with up to 2048\nnodes (11 qubits). These simulations achieved cut solutions that outperform\nthose obtained by the best-known classical approximation algorithm of Goemans\nand Williamson (GW), by several percent. Moreover, executing the QEMC algorithm\non actual IBM quantum devices achieved leading-edge results for graphs with up\nto 32 nodes (5 qubits), providing a challenging benchmark for the QAOA\nalgorithm. We analyze the computational complexity of the QEMC algorithm and\nshow that it can be simulated efficiently using classical methods, thereby\nconstituting a new quantum-inspired classical MaxCut heuristic.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:06:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tene-Cohen","Yovav",""],["Kelman","Tomer",""],["Lev","Ohad",""],["Makmal","Adi",""]]}
{"id":"2308.10384","submitter":"Athul Pradeepkumar Girija","authors":"Athul Pradeepkumar Girija","title":"Aerocapture Design Reference Missions for Solar System Exploration: from\n  Venus to Neptune","comments":"12 pages, 7 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":"  Aerocapture is the technique of using planetary atmospheres to decelerate a\nspacecraft in a single pass to achieve nearly fuel-free orbit insertion.\nAerocapture has been extensively studied since the 1980s but has never been\nflown yet. The entry conditions encountered during aerocapture are strongly\ndestination dependent, and performance benefit offered by aerocapture is also\ndestination dependent. Aerocapture is applicable to all atmosphere-bearing\ndestinations with the exception of Jupiter and Saturn, whose extreme entry\nconditions make aerocapture infeasible. A recent study by the NASA Science\nMission Directorate highlighted the need for baseline design reference\nmissions, as a starting point for system level architecture studies. The\npresent study uses the Aerocapture Mission Analysis Tool (AMAT) to compile a\nlist of design reference missions at Venus, Earth, Mars, Titan, Uranus, and\nNeptune. These reference missions can provide an initial assessment of the\nfeasibility of aerocapture for a proposed mission, and provide intial baseline\nvalues for more detailed system studies. The reference mission set provides a\nquick estimate of the entry conditions, control requirements, and aero-thermal\nloads for architectural level studies.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:07:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Girija","Athul Pradeepkumar",""]]}
{"id":"2308.10385","submitter":"Hanseob Kim","authors":"Hanseob Kim, Bin Han, Jieun Kim, Muhammad Firdaus Syawaludin, Gerard\n  Jounghyun Kim, Jae-In Hwang","title":"The Effects of Engaging and Affective Behaviors of Virtual Agents in\n  Group Decision-Making","comments":"Under Review. This work has been submitted to the IEEE 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.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Virtual agents (VAs) need to exhibit engaged and affective behavior in order\nto become more effective social actors in our daily lives. However, such\nbehaviors need to conform to social norms, especially in organizational\nsettings. This study examines how different VA behaviors influence subjects'\nperceptions and actions in group decision-making processes. Participants\nexposed to VAs demonstrated varying levels of engagement and affective behavior\nduring the group discussions. Engagement refers to the VA's focus on the group\ntask, while affective behavior represents the VA's emotional state. The\nfindings indicate that VA engagement positively influences user behavior,\nparticularly in attention allocation. However, it has minimal impact on\nsubjective perception. Conversely, affective expressions of VAs have a negative\nimpact on subjective perceptions, such as social presence, social influence,\nand trustworthiness. Interestingly, in 64 discussions for tasks, only seven\nshowed a decline in group scores compared to individual scores, and in six of\nthese cases, the VA exhibited a non-engaged and affective state. We discuss the\nresults and the potential implications for future research on using VAs in\ngroup meetings. It provides valuable insights for improving VA behavior as a\nteam member in group decision-making scenarios and guides VA design in\norganizational contexts.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:09:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","Hanseob",""],["Han","Bin",""],["Kim","Jieun",""],["Syawaludin","Muhammad Firdaus",""],["Kim","Gerard Jounghyun",""],["Hwang","Jae-In",""]]}
{"id":"2308.10386","submitter":"Noyan Sevuktekin","authors":"Noyan C. Sevuktekin and Andrew C. Singer","title":"Unsupervised Opinion Aggregation -- A Statistical Perspective","comments":"This research was conducted during Noyan Sevuktekin's time at\n  University of Illinois at Urbana-Champaign and the results were first\n  presented in Chapter 3 of his dissertation, entitled \"Learning From\n  Opinions\". Permalink: https://hdl.handle.net/2142/110814","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Complex decision-making systems rarely have direct access to the current\nstate of the world and they instead rely on opinions to form an understanding\nof what the ground truth could be. Even in problems where experts provide\nopinions without any intention to manipulate the decision maker, it is\nchallenging to decide which expert's opinion is more reliable -- a challenge\nthat is further amplified when decision-maker has limited, delayed, or no\naccess to the ground truth after the fact. This paper explores a statistical\napproach to infer the competence of each expert based on their opinions without\nany need for the ground truth. Echoing the logic behind what is commonly\nreferred to as \\textit{the wisdom of crowds}, we propose measuring the\ncompetence of each expert by their likeliness to agree with their peers. We\nfurther show that the more reliable an expert is the more likely it is that\nthey agree with their peers. We leverage this fact to propose a completely\nunsupervised version of the na\\\"{i}ve Bayes classifier and show that the\nproposed technique is asymptotically optimal for a large class of problems. In\naddition to aggregating a large block of opinions, we further apply our\ntechnique for online opinion aggregation and for decision-making based on a\nlimited the number of opinions.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:14:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sevuktekin","Noyan C.",""],["Singer","Andrew C.",""]]}
{"id":"2308.10387","submitter":"Myungho Kim","authors":"Myungho Kim and SungSoon Kim","title":"Modified Ariki-Koike algebra and Yokounuma-Hecke like relations","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We find new presentations of the modified Ariki-Koike algebra (known also as\nShoji's algebra) $\\mathcal H_{n,r}$ over an integral domain $R$ associated with\na set of parameters $q,u_1,\\ldots,u_r$ in $R$. It turns out that the algebra\n$\\mathcal H_{n,r}$ has a set of generators $t_1,\\ldots,t_n$ and $g_1,\\ldots\ng_{n-1}$ subject to a set of defining relations similar to the relations of\nYokonuma-Hecke algebra. We also obtain a presentation of $\\mathcal H_{n,r}$\nwhich is independent to the choice of $u_1,\\ldots u_r$. Hence the algebras\nassociated with the parameters $q, u_1,\\ldots u_r$ and $q, u'_1,\\ldots u'_r$\nare isomorphic even in the case that $(u_1,\\ldots u_r)$ and $(u'_1,\\ldots\nu'_r)$ are different. As applications of the presentations, we find an explicit\ntrace form on the algebra $\\mathcal H_{n,r}$ which is symmetrising provided the\nparameters $u_1,\\ldots, u_r$ are invertible in $R$. We also show that the\nsymmetric group $\\mathfrak S(r)$ acts on the algebra $\\mathcal H_{n,r}$, and\nfind a basis and a set of generators of the fixed subalgebra $\\mathcal\nH_{n,r}^{\\mathfrak S(r)}$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:20:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","Myungho",""],["Kim","SungSoon",""]]}
{"id":"2308.10388","submitter":"Prateek Verma","authors":"Prateek Verma","title":"Neural Architectures Learning Fourier Transforms, Signal Processing and\n  Much More....","comments":"12 pages, 6 figures. Technical Report at Stanford University;\n  Presented on 14th August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.MM eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report will explore and answer fundamental questions about taking\nFourier Transforms and tying it with recent advances in AI and neural\narchitecture. One interpretation of the Fourier Transform is decomposing a\nsignal into its constituent components by projecting them onto complex\nexponentials. Variants exist, such as discrete cosine transform that does not\noperate on the complex domain and projects an input signal to only cosine\nfunctions oscillating at different frequencies. However, this is a fundamental\nlimitation, and it needs to be more suboptimal. The first one is that all\nkernels are sinusoidal: What if we could have some kernels adapted or learned\naccording to the problem? What if we can use neural architectures for this? We\nshow how one can learn these kernels from scratch for audio signal processing\napplications. We find that the neural architecture not only learns sinusoidal\nkernel shapes but discovers all kinds of incredible signal-processing\nproperties. E.g., windowing functions, onset detectors, high pass filters, low\npass filters, modulations, etc. Further, upon analysis of the filters, we find\nthat the neural architecture has a comb filter-like structure on top of the\nlearned kernels. Comb filters that allow harmonic frequencies to pass through\nare one of the core building blocks/types of filters similar to high-pass,\nlow-pass, and band-pass filters of various traditional signal processing\nalgorithms. Further, we can also use the convolution operation with a signal to\nbe learned from scratch, and we will explore papers in the literature that uses\nthis with that robust Transformer architectures. Further, we would also explore\nmaking the learned kernel's content adaptive, i.e., learning different kernels\nfor different inputs.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:30:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Verma","Prateek",""]]}
{"id":"2308.10389","submitter":"Romain Meyrand Dr.","authors":"Romain Meyrand, Jonathan Squire, Alfred Mallet, Benjamin D. G.\n  Chandran","title":"Reflection-driven turbulence in the super-Alfv\\'enic solar wind","comments":null,"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":"  In magnetized, stratified astrophysical environments such as the Sun's corona\nand solar wind, Alfv\\'enic fluctuations ''reflect'' from background gradients,\nenabling nonlinear interactions and thus dissipation of their energy into heat.\nThis process, termed ''reflection-driven turbulence,'' is thought to play a\ncrucial role in coronal heating and solar-wind acceleration, explaining a range\nof observational correlations and constraints. Building on previous works\nfocused on the inner heliosphere, here we study the basic physics of\nreflection-driven turbulence using reduced magnetohydrodynamics in an expanding\nbox -- the simplest model that can capture the local turbulent plasma dynamics\nin the super-Alfv\\'enic solar wind. Although idealized, our high-resolution\nsimulations and simple theory reveal a rich phenomenology that is consistent\nwith a diverse range of observations. Outwards-propagating fluctuations, which\ninitially have high imbalance, decay nonlinearly to heat the plasma, becoming\nmore balanced and magnetically dominated. Despite the high imbalance, the\nturbulence is strong because Els\\\"asser collisions are suppressed by\nreflection, leading to ''anomalous coherence'' between the two Els\\\"asser\nfields. This coherence, together with linear effects, causes the turbulence to\nanomalously grow the ''anastrophy'' (squared magnetic potential) as it decays,\nforcing the energy to rush to larger scales and forming a ''$1/f$-range''\nenergy spectrum as it does so. At late times, the expansion overcomes the\nnonlinear and Alfv\\'enic physics, forming isolated, magnetically dominated\n''Alfv\\'en vortex'' structures that minimize their nonlinear dissipation. These\nresults can plausibly explain the observed radial and wind-speed dependence of\nturbulence imbalance, residual energy, plasma heating, and fluctuation spectra,\nas well as making testable predictions for future observations.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:45:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Meyrand","Romain",""],["Squire","Jonathan",""],["Mallet","Alfred",""],["Chandran","Benjamin D. G.",""]]}
{"id":"2308.10390","submitter":"Zihan Zhao","authors":"Zihan Zhao, Yiyang Jiang, Heyang Liu, Yanfeng Wang, Yu Wang","title":"LibriSQA: Advancing Free-form and Open-ended Spoken Question Answering\n  with a Novel Dataset and Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While Large Language Models (LLMs) have demonstrated commendable performance\nacross a myriad of domains and tasks, existing LLMs still exhibit a palpable\ndeficit in handling multimodal functionalities, especially for the Spoken\nQuestion Answering (SQA) task which necessitates precise alignment and deep\ninteraction between speech and text features. To address the SQA challenge on\nLLMs, we initially curated the free-form and open-ended LibriSQA dataset from\nLibrispeech, comprising Part I with natural conversational formats and Part II\nencompassing multiple-choice questions followed by answers and analytical\nsegments. Both parts collectively include 107k SQA pairs that cover various\ntopics. Given the evident paucity of existing speech-text LLMs, we propose a\nlightweight, end-to-end framework to execute the SQA task on the LibriSQA,\nwitnessing significant results. By reforming ASR into the SQA format, we\nfurther substantiate our framework's capability in handling ASR tasks. Our\nempirical findings bolster the LLMs' aptitude for aligning and comprehending\nmultimodal information, paving the way for the development of universal\nmultimodal LLMs. The dataset and demo can be found at\nhttps://github.com/ZihanZhaoSJTU/LibriSQA.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:47:23 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 10:52:41 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 14:55:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhao","Zihan",""],["Jiang","Yiyang",""],["Liu","Heyang",""],["Wang","Yanfeng",""],["Wang","Yu",""]]}
{"id":"2308.10391","submitter":"Thomas Alexander Stuber","authors":"T. A. Stuber (1), F. Kirchschlager (2), T. D. Pearce (3), S. Ertel (4\n  and 5), A. V. Krivov (3), S. Wolf (1) ((1) Institut f\\\"ur Theoretische Physik\n  und Astrophysik, Christian-Albrechts-Universit\\\"at zu Kiel, (2) Sterrenkundig\n  Observatorium, Ghent University, (3) Astrophysikalisches Institut und\n  Universit\\\"atssternwarte, Friedrich-Schiller-Universit\\\"at Jena, (4)\n  Department of Astronomy and Steward Observatory, The University of Arizona,\n  (5) Large Binocular Telescope Observatory, The University of Arizona)","title":"How much large dust could be present in hot exozodiacal dust systems?","comments":"Accepted for publication in Astronomy & Astrophysics. 18 pages, 7\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An infrared excess over the stellar photospheric emission of main-sequence\nstars has been found in interferometric surveys, commonly attributed to the\npresence of hot exozodiacal dust (HEZD). While submicrometer-sized grains in\nclose vicinity to their host star have been inferred to be responsible for the\nfound near-infrared excesses, the presence and amount of larger grains as part\nof the dust distributions are weakly constrained. We quantify how many larger\ngrains (above-micrometer-sized) could be present in addition to\nsubmicrometer-sized grains, while being consistent with observational\nconstraints. This is important in order to distinguish between various\nscenarios for the origin of HEZD and to better estimate its observational\nappearance when observed with future instruments. We extended a model suitable\nto reproduce current observations of HEZD to investigate a bimodal size\ndistribution. By deriving the characteristics of dust distributions whose\nobservables are consistent with observational limits from interferometric\nmeasurements in the $K$ and $N$ bands we constrained the radii of sub- and\nabove-micrometer-sized grains as well as their mass, number, and flux density\nratios. In the most extreme cases of some of the investigated systems, large\ngrains $\\gtrsim 10\\,\\mu$m might dominate the mass budget of HEZD while\ncontributing up to 25$\\,$% of the total flux density originating from the dust\nat a wavelength of 2.13$\\,\\mu$m and up to 50$\\,$% at a wavelength of\n4.1$\\,\\mu$m; at a wavelength of 11.1$\\,\\mu$m their emission might clearly\ndominate over the emission of small grains. While it is not possible to detect\nsuch hot-dust distributions using ALMA, the ngVLA might allow us to detect HEZD\nat millimeter wavelengths. Large dust grains might have a more important impact\non the observational appearance of HEZD than previously assumed, especially at\nlonger wavelengths.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:47:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Stuber","T. A.","","4\n  and 5"],["Kirchschlager","F.","","4\n  and 5"],["Pearce","T. D.","","4\n  and 5"],["Ertel","S.","","4\n  and 5"],["Krivov","A. V.",""],["Wolf","S.",""]]}
{"id":"2308.10392","submitter":"Hossein Kashiani","authors":"Hossein Kashiani, Niloufar Alipour Talemi, Mohammad Saeed Ebrahimi\n  Saadabadi, Nasser M. Nasrabadi","title":"Towards Generalizable Morph Attack Detection with Consistency\n  Regularization","comments":"Accepted to the IEEE International Joint Conference on Biometrics\n  (IJCB), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Though recent studies have made significant progress in morph attack\ndetection by virtue of deep neural networks, they often fail to generalize well\nto unseen morph attacks. With numerous morph attacks emerging frequently,\ngeneralizable morph attack detection has gained significant attention. This\npaper focuses on enhancing the generalization capability of morph attack\ndetection from the perspective of consistency regularization. Consistency\nregularization operates under the premise that generalizable morph attack\ndetection should output consistent predictions irrespective of the possible\nvariations that may occur in the input space. In this work, to reach this\nobjective, two simple yet effective morph-wise augmentations are proposed to\nexplore a wide space of realistic morph transformations in our consistency\nregularization. Then, the model is regularized to learn consistently at the\nlogit as well as embedding levels across a wide range of morph-wise augmented\nimages. The proposed consistency regularization aligns the abstraction in the\nhidden layers of our model across the morph attack images which are generated\nfrom diverse domains in the wild. Experimental results demonstrate the superior\ngeneralization and robustness performance of our proposed method compared to\nthe state-of-the-art studies.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:50:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kashiani","Hossein",""],["Talemi","Niloufar Alipour",""],["Saadabadi","Mohammad Saeed Ebrahimi",""],["Nasrabadi","Nasser M.",""]]}
{"id":"2308.10393","submitter":"Xusheng Luo","authors":"Xusheng Luo, Shaojun Xu, Ruixuan Liu, Changliu Liu","title":"Robotic Planning under Hierarchical Temporal Logic Specifications","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Past research into robotic planning with temporal logic specifications,\nnotably Linear Temporal Logic (LTL), was largely based on singular formulas for\nindividual or groups of robots. But with increasing task complexity, LTL\nformulas unavoidably grow lengthy, complicating interpretation and\nspecification generation, and straining the computational capacities of the\nplanners. In order to maximize the potential of LTL specifications, we\ncapitalized on the intrinsic structure of tasks and introduced a hierarchical\nstructure to LTL specifications. In contrast to the \"flat\" structure, our\nhierarchical model has multiple levels of compositional specifications and\noffers benefits such as greater syntactic brevity, improved interpretability,\nand more efficient planning. To address tasks under this hierarchical temporal\nlogic structure, we formulated a decomposition-based method. Each specification\nis first broken down into a range of temporally interrelated sub-tasks. We\nfurther mine the temporal relations among the sub-tasks of different\nspecifications within the hierarchy. Subsequently, a Mixed Integer Linear\nProgram is utilized to generate a spatio-temporal plan for each robot. Our\nhierarchical LTL specifications were experimentally applied to domains of\nrobotic navigation and manipulation. Results from extensive simulation studies\nillustrated both the enhanced expressive potential of the hierarchical form and\nthe efficacy of the proposed method.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:53:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Luo","Xusheng",""],["Xu","Shaojun",""],["Liu","Ruixuan",""],["Liu","Changliu",""]]}
{"id":"2308.10394","submitter":"Bernd Schr\\\"oder","authors":"Bernd Schr\\\"oder","title":"Small Representations of Permutation Groups by Embedding the Domain in\n  an Ordered Set","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a representation for permutation groups as the automorphism group\nof an ordered set $U$ such that the automorphism group's action on a subset\n$T\\subseteq U$ is the permutation group itself. For many imprimitive\npermutation groups, the representation uses fewer points than the smallest\nrepresentations to date.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:56:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Schr\u00f6der","Bernd",""]]}
{"id":"2308.10395","submitter":"Garreth Ruane","authors":"Garreth Ruane and J. Kent Wallace and A J Eldorado Riggs and Tobias\n  Wenger and Mahmood Bagheri and Jeffrey Jewell and Nasrat Raouf and Gregory\n  Allan and Camilo Mejia Prada and Matthew Noyes and Alex B. Walter","title":"Dual Purpose Lyot Coronagraph Masks for Simultaneous High-Contrast\n  Imaging and High-Resolution Wavefront Sensing","comments":"To appear in the Proceedings of the SPIE, Techniques and\n  Instrumentation for Detection of Exoplanets XI","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Directly imaging Earth-sized exoplanets with a visible-light coronagraph\ninstrument on a space telescope will require a system that can achieve\n$\\sim10^{-10}$ raw contrast and maintain it for the duration of observations\n(on the order of hours or more). We are designing, manufacturing, and testing\nDual Purpose Lyot coronagraph (DPLC) masks that allow for simultaneous\nwavefront sensing and control using out-of-band light to maintain high contrast\nin the science focal plane. Our initial design uses a tiered metallic focal\nplane occulter to suppress starlight in the transmitted coronagraph channel and\na dichroic-coated substrate to reflect out-of-band light to a wavefront sensing\ncamera. The occulter design introduces a phase shift such that the reflected\nchannel is a Zernike wavefront sensor. The dichroic coating allows higher-order\nwavefront errors to be detected which is especially critical for compensating\nfor residual drifts from an actively-controlled segmented primary mirror. A\nsecond-generation design concept includes a metasurface to create\npolarization-dependent phase shifts in the reflected beam, which has several\nadvantages including an extended dynamic range. We will present the focal plane\nmask designs, characterization, and initial testing at NASA's High Contrast\nImaging Testbed (HCIT) facility.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:08:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ruane","Garreth",""],["Wallace","J. Kent",""],["Riggs","A J Eldorado",""],["Wenger","Tobias",""],["Bagheri","Mahmood",""],["Jewell","Jeffrey",""],["Raouf","Nasrat",""],["Allan","Gregory",""],["Prada","Camilo Mejia",""],["Noyes","Matthew",""],["Walter","Alex B.",""]]}
{"id":"2308.10396","submitter":"Kosuke Yoshimura","authors":"Kosuke Yoshimura and Hisashi Kashima","title":"Label Selection Approach to Learning from Crowds","comments":"15 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Supervised learning, especially supervised deep learning, requires large\namounts of labeled data. One approach to collect large amounts of labeled data\nis by using a crowdsourcing platform where numerous workers perform the\nannotation tasks. However, the annotation results often contain label noise, as\nthe annotation skills vary depending on the crowd workers and their ability to\ncomplete the task correctly. Learning from Crowds is a framework which directly\ntrains the models using noisy labeled data from crowd workers. In this study,\nwe propose a novel Learning from Crowds model, inspired by SelectiveNet\nproposed for the selective prediction problem. The proposed method called Label\nSelection Layer trains a prediction model by automatically determining whether\nto use a worker's label for training using a selector network. A major\nadvantage of the proposed method is that it can be applied to almost all\nvariants of supervised learning problems by simply adding a selector network\nand changing the objective function for existing models, without explicitly\nassuming a model of the noise in crowd annotations. The experimental results\nshow that the performance of the proposed method is almost equivalent to or\nbetter than the Crowd Layer, which is one of the state-of-the-art methods for\nDeep Learning from Crowds, except for the regression problem case.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:22:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yoshimura","Kosuke",""],["Kashima","Hisashi",""]]}
{"id":"2308.10397","submitter":"Yanhong Bai","authors":"Yanhong Bai and Jiabao Zhao and Jinxin Shi and Tingjiang Wei and\n  Xingjiao Wu and Liang He","title":"FairBench: A Four-Stage Automatic Framework for Detecting Stereotypes\n  and Biases in Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Detecting stereotypes and biases in Large Language Models (LLMs) can enhance\nfairness and reduce adverse impacts on individuals or groups when these LLMs\nare applied. However, the majority of existing methods focus on measuring the\nmodel's preference towards sentences containing biases and stereotypes within\ndatasets, which lacks interpretability and cannot detect implicit biases and\nstereotypes in the real world. To address this gap, this paper introduces a\nfour-stage framework to directly evaluate stereotypes and biases in the\ngenerated content of LLMs, including direct inquiry testing, serial or adapted\nstory testing, implicit association testing, and unknown situation testing.\nAdditionally, the paper proposes multi-dimensional evaluation metrics and\nexplainable zero-shot prompts for automated evaluation. Using the education\nsector as a case study, we constructed the Edu-FairBench based on the\nfour-stage framework, which encompasses 12,632 open-ended questions covering\nnine sensitive factors and 26 educational scenarios. Experimental results\nreveal varying degrees of stereotypes and biases in five LLMs evaluated on\nEdu-FairBench. Moreover, the results of our proposed automated evaluation\nmethod have shown a high correlation with human annotations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:25:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bai","Yanhong",""],["Zhao","Jiabao",""],["Shi","Jinxin",""],["Wei","Tingjiang",""],["Wu","Xingjiao",""],["He","Liang",""]]}
{"id":"2308.10398","submitter":"Homa Hosseinmardi","authors":"Homa Hosseinmardi, Amir Ghasemian, Miguel Rivera-Lanas, Manoel Horta\n  Ribeiro, Robert West, Duncan J. Watts","title":"Causally estimating the effect of YouTube's recommender system using\n  counterfactual bots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, critics of online platforms have raised concerns about the\nability of recommendation algorithms to amplify problematic content, with\npotentially radicalizing consequences. However, attempts to evaluate the effect\nof recommenders have suffered from a lack of appropriate counterfactuals --\nwhat a user would have viewed in the absence of algorithmic recommendations --\nand hence cannot disentangle the effects of the algorithm from a user's\nintentions. Here we propose a method that we call \"counterfactual bots\" to\ncausally estimate the role of algorithmic recommendations on the consumption of\nhighly partisan content. By comparing bots that replicate real users'\nconsumption patterns with \"counterfactual\" bots that follow rule-based\ntrajectories, we show that, on average, relying exclusively on the recommender\nresults in less partisan consumption, where the effect is most pronounced for\nheavy partisan consumers. Following a similar method, we also show that if\npartisan consumers switch to moderate content, YouTube's sidebar recommender\n\"forgets\" their partisan preference within roughly 30 videos regardless of\ntheir prior history, while homepage recommendations shift more gradually\ntowards moderate content. Overall, our findings indicate that, at least on\nYouTube, individual consumption patterns mostly reflect individual preferences,\nwhere algorithmic recommendations play, if anything, a moderating role.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:25:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hosseinmardi","Homa",""],["Ghasemian","Amir",""],["Rivera-Lanas","Miguel",""],["Ribeiro","Manoel Horta",""],["West","Robert",""],["Watts","Duncan J.",""]]}
{"id":"2308.10399","submitter":"Robert Nesbet","authors":"R. K. Nesbet","title":"Conformal theory of gravitation and cosmic expansion","comments":"8 pages. arXiv admin note: text overlap with arXiv:2112.10770","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The postulate of universal Weyl conformal symmetry for all elementary\nphysical fields introduces nonclassical gravitational effects in both conformal\ngravitation(CG) and the conformal Higgs model (CHM). The resulting theory is\nfound to explain major observed phenomena including excessive galactic rotation\nvelocities and accelerating Hubble expansion, without invoking dark matter\n(DM). The recent history of this development is surveyed here. Implications of\nthe theory include galactic baryonic Tully-Fisher relations and dark galactic\nhaloes of definite large radius. Cosmological CHM parameters exclude a massive\nHiggs boson but are consistent with a novel alternative particle of the\nobserved mass.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:25:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nesbet","R. K.",""]]}
{"id":"2308.10400","submitter":"Shiyuan Hu","authors":"Shiyuan Hu, Fanlong Meng, Masao Doi","title":"Effect of viscoelastic fluid on the lift force in lubricated contacts","comments":null,"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":"  We consider a cylinder immersed in viscous fluid moving near a flat substrate\ncovered by an incompressible viscoelastic fluid layer, and study the effect of\nthe fluid viscoelasticity on the lift force exerted on the cylinder. The lift\nforce is zero when the viscoelastic layer is not deformed, but becomes non-zero\nwhen it is deformed. We calculate the lift force by considering both the\ntangential stress and the normal stress applied at the surface of the\nviscoelastic layer. Our analysis indicates that as the layer changes from the\nelastic limit to the viscous limit, the lift force decreases with the decrease\nof the Deborah number (De). For small De, the effect of the layer elasticity is\ntaken over by the surface tension and the lift force can become negative. We\nalso show that the tangential stress and the interface slip velocity (the\nsurface velocity relative to the substrate), which have been ignored in the\nprevious analysis, give important contributions to the lift force. Especially\nfor thin elastic layer, they give dominant contributions to the lift force.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:28:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Shiyuan",""],["Meng","Fanlong",""],["Doi","Masao",""]]}
{"id":"2308.10401","submitter":"Shengzhi Wang","authors":"Xiangyu Chu+, Shengzhi Wang+, Minjian Feng, Jiaxi Zheng, Yuxuan Zhao,\n  Jing Huang, and K. W. Samuel Au","title":"Model-Free Large-Scale Cloth Spreading With Mobile Manipulation: Initial\n  Feasibility Study","comments":"6 pages, 6 figures, submit to CASE2023","journal-ref":"2023 IEEE International Conference on Automation Science and\n  Engineering (CASE)","doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloth manipulation is common in domestic and service tasks, and most studies\nuse fixed-base manipulators to manipulate objects whose sizes are relatively\nsmall with respect to the manipulators' workspace, such as towels, shirts, and\nrags. In contrast, manipulation of large-scale cloth, such as bed making and\ntablecloth spreading, poses additional challenges of reachability and\nmanipulation control. To address them, this paper presents a novel framework to\nspread large-scale cloth, with a single-arm mobile manipulator that can solve\nthe reachability issue, for an initial feasibility study. On the manipulation\ncontrol side, without modeling highly deformable cloth, a vision-based\nmanipulation control scheme is applied and based on an online-update Jacobian\nmatrix mapping from selected feature points to the end-effector motion. To\ncoordinate the control of the manipulator and mobile platform, Behavior Trees\n(BTs) are used because of their modularity. Finally, experiments are conducted,\nincluding validation of the model-free manipulation control for cloth spreading\nin different conditions and the large-scale cloth spreading framework. The\nexperimental results demonstrate the large-scale cloth spreading task\nfeasibility with a single-arm mobile manipulator and the model-free deformation\ncontroller.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:30:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chu+","Xiangyu",""],["Wang+","Shengzhi",""],["Feng","Minjian",""],["Zheng","Jiaxi",""],["Zhao","Yuxuan",""],["Huang","Jing",""],["Au","K. W. Samuel",""]]}
{"id":"2308.10402","submitter":"Kaiqu Liang","authors":"Kaiqu Liang, Samuel Albanie","title":"Simple Baselines for Interactive Video Retrieval with Questions and\n  Answers","comments":"ICCV 2023, project page:\n  https://github.com/kevinliang888/IVR-QA-baselines","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To date, the majority of video retrieval systems have been optimized for a\n\"single-shot\" scenario in which the user submits a query in isolation, ignoring\nprevious interactions with the system. Recently, there has been renewed\ninterest in interactive systems to enhance retrieval, but existing approaches\nare complex and deliver limited gains in performance. In this work, we revisit\nthis topic and propose several simple yet effective baselines for interactive\nvideo retrieval via question-answering. We employ a VideoQA model to simulate\nuser interactions and show that this enables the productive study of the\ninteractive retrieval task without access to ground truth dialogue data.\nExperiments on MSR-VTT, MSVD, and AVSD show that our framework using\nquestion-based interaction significantly improves the performance of text-based\nvideo retrieval systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:32:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liang","Kaiqu",""],["Albanie","Samuel",""]]}
{"id":"2308.10403","submitter":"Isao Kishimoto","authors":"Isao Kishimoto","title":"On the spectrum around numerical solutions in Siegel gauge in open\n  string field theory","comments":"24 pages, 71 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In bosonic open string field theory, the spectrum around the numerical\ntachyon vacuum solution in Siegel gauge was investigated by Giusto and Imbimbo.\nUsing their numerical method, we study the mass spectrum around two other\nsolutions, which are ``double brane'' and ``single brane\" solutions in Siegel\ngauge constructed by the level truncation approximation. The ``double brane''\nsolution was constructed by Kudrna and Schnabl and its energy might correspond\nto a double brane. On the other hand, the ``single brane'' solution was\nconstructed by Takahashi and the author in the theory around the identity-based\nsolution for the tachyon vacuum and its energy corresponds to the perturbative\nvacuum, namely, a single brane. From the eigenvalues of the matrix for the\nkinetic term in Siegel gauge, we find a tachyon state and a massless vector\nstate in the ghost number one sector around the ``single brane'' solution,\nwhich is consistent with the perturbative vacuum, although the mass spectrum\naround the ``double brane'' solution is obscure up to the truncation level ten\nand within scalar and vector states.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:41:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kishimoto","Isao",""]]}
{"id":"2308.10404","submitter":"Zhiqiang Wang","authors":"Derong Kong and Zhiqiang Wang","title":"Sumset Fractal Properties","comments":"11 pages, correct some typographical errors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper we introduce two notions of fractal sumset properties. A set\n$K\\subset\\mathbb{R}^d$ is said to have the Hausdorff sumset property (HSP) if\nfor any $\\ell\\in\\mathbb{N}_{\\ge 2}$ there exist sets $K_1, K_2,\\ldots, K_\\ell$\nsuch that $K_1+K_2+\\cdots+K_\\ell\\subset K$ and $\\dim_H K_i=\\dim_H K$ for all\n$1\\le i\\le \\ell$. Analogously, if we replace the Hausdorff dimension by the\npacking dimension in the definition of HSP, then the set $K\\subset\\mathbb{R}^d$\nis said to have the packing sumset property (PSP). We show that the HSP and the\nPSP hold for a large class of sets in $\\mathbb{R}^d$ with any given dimension\n$\\alpha\\in(0, d)$. On the other hand, the HSP fails for certain homogeneous\nself-similar sets satisfying the strong separation condition, while the PSP\nholds for all homogeneous self-similar sets in $\\mathbb{R}^d$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:44:48 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 13:39:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kong","Derong",""],["Wang","Zhiqiang",""]]}
{"id":"2308.10405","submitter":"Ngoc-Cuong Nguyen","authors":"Slawomir Kolodziej and Ngoc Cuong Nguyen","title":"Complex Hessian measures with respect to a background Hermitian form","comments":"44 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.AP math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop potential theory for $m$-subharmonic functions with respect to a\nHermitian metric on a Hermitian manifold. First, we show that the complex\nHessian operator is well-defined for bounded functions in this class. This\nallows to define the $m$-capacity and then showing the quasi-continuity of\n$m$-subharmonic functions. Thanks to this we derive other results parallel to\nthose in pluripotential theory such as the equivalence between polar sets and\nnegligible sets. The theory is then used to study the complex Hessian equation\non compact Hermitian manifold with boundary, with the right hand side of the\nequation admitting a bounded subsolution. This is an extension of a recent\nresult of Collins and Picard dealing with classical solutions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:47:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kolodziej","Slawomir",""],["Nguyen","Ngoc Cuong",""]]}
{"id":"2308.10406","submitter":"Aidan Reddy","authors":"Aidan P. Reddy and Liang Fu","title":"Toward a global phase diagram of the fractional quantum anomalous Hall\n  effect","comments":"8 pages, 5 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":"  Recent experiments on the twisted semiconductor bilayer system $t$MoTe$_2$\nhave observed integer and fractionally quantized anomalous Hall effects, which\noccur in topological moir\\'e bands at zero magnetic field. Here, we present a\nglobal phase diagram of $t$MoTe$_2$ throughout the filling range $0\\leq n\\leq\n1$, substantiated by exact diagonalization calculations. At a magic angle, we\nfind that the system resembles the lowest Landau level (LLL) to a remarkable\ndegree, exhibiting an abundance of incompressible fractional quantum anomalous\nHall states and compressible anomalous composite Fermi liquid states. Away from\nthe magic angle, particle-hole symmetry is strongly broken. Some LLL-like\nfeatures remain robust near half filling, while others are replaced,\npredominantly by charge density waves near $n=0$ and anomalous Hall Fermi\nliquids near $n=1$. Among LLL-like phases, we find the anomalous composite\nFermi liquid at $n=\\frac{1}{2}$ to be most robust against deviations from the\nmagic angle. Within the band-projected model, we show that strong particle-hole\nasymmetry above the magic angle results from interaction enhanced quasiparticle\ndispersion near $n=1$. Our work sets the stage for future exploration of\nLLL-like and beyond-LLL phases in fractional quantum anomalous Hall systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:06:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Reddy","Aidan P.",""],["Fu","Liang",""]]}
{"id":"2308.10407","submitter":"Liangqi Yuan","authors":"Vishnu Pandi Chellapandi and Liangqi Yuan and Christopher G. Brinton\n  and Stanislaw H Zak and Ziran Wang","title":"Federated Learning for Connected and Automated Vehicles: A Survey of\n  Existing Approaches and Challenges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.DC cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) is widely used for key tasks in Connected and Automated\nVehicles (CAV), including perception, planning, and control. However, its\nreliance on vehicular data for model training presents significant challenges\nrelated to in-vehicle user privacy and communication overhead generated by\nmassive data volumes. Federated learning (FL) is a decentralized ML approach\nthat enables multiple vehicles to collaboratively develop models, broadening\nlearning from various driving environments, enhancing overall performance, and\nsimultaneously securing local vehicle data privacy and security. This survey\npaper presents a review of the advancements made in the application of FL for\nCAV (FL4CAV). First, centralized and decentralized frameworks of FL are\nanalyzed, highlighting their key characteristics and methodologies. Second,\ndiverse data sources, models, and data security techniques relevant to FL in\nCAVs are reviewed, emphasizing their significance in ensuring privacy and\nconfidentiality. Third, specific and important applications of FL are explored,\nproviding insight into the base models and datasets employed for each\napplication. Finally, existing challenges for FL4CAV are listed and potential\ndirections for future work are discussed to further enhance the effectiveness\nand efficiency of FL in the context of CAV.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:21:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chellapandi","Vishnu Pandi",""],["Yuan","Liangqi",""],["Brinton","Christopher G.",""],["Zak","Stanislaw H",""],["Wang","Ziran",""]]}
{"id":"2308.10408","submitter":"Yuliang Liu","authors":"Wenwen Yu, Yuliang Liu, Xingkui Zhu, Haoyu Cao, Xing Sun, Xiang Bai","title":"Turning a CLIP Model into a Scene Text Spotter","comments":"arXiv admin note: text overlap with arXiv:2302.14338","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We exploit the potential of the large-scale Contrastive Language-Image\nPretraining (CLIP) model to enhance scene text detection and spotting tasks,\ntransforming it into a robust backbone, FastTCM-CR50. This backbone utilizes\nvisual prompt learning and cross-attention in CLIP to extract image and\ntext-based prior knowledge. Using predefined and learnable prompts,\nFastTCM-CR50 introduces an instance-language matching process to enhance the\nsynergy between image and text embeddings, thereby refining text regions. Our\nBimodal Similarity Matching (BSM) module facilitates dynamic language prompt\ngeneration, enabling offline computations and improving performance.\nFastTCM-CR50 offers several advantages: 1) It can enhance existing text\ndetectors and spotters, improving performance by an average of 1.7% and 1.5%,\nrespectively. 2) It outperforms the previous TCM-CR50 backbone, yielding an\naverage improvement of 0.2% and 0.56% in text detection and spotting tasks,\nalong with a 48.5% increase in inference speed. 3) It showcases robust few-shot\ntraining capabilities. Utilizing only 10% of the supervised data, FastTCM-CR50\nimproves performance by an average of 26.5% and 5.5% for text detection and\nspotting tasks, respectively. 4) It consistently enhances performance on\nout-of-distribution text detection and spotting datasets, particularly the\nNightTime-ArT subset from ICDAR2019-ArT and the DOTA dataset for oriented\nobject detection. The code is available at https://github.com/wenwenyu/TCM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:25:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Wenwen",""],["Liu","Yuliang",""],["Zhu","Xingkui",""],["Cao","Haoyu",""],["Sun","Xing",""],["Bai","Xiang",""]]}
{"id":"2308.10409","submitter":"Jay Best","authors":"Jay Best","title":"Development of a Novel Impedance-Controlled Quasi-Direct-Drive Robot\n  Hand","comments":"75 pages, A Thesis in Partial Fulfillment of the Requirements for the\n  Degree of Master of Science in Mechanical Engineering at Stony Brook\n  University","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most robotic hands and grippers rely on actuators with large gearboxes and\nforce sensors for controlling gripping force. However, this might not be ideal\nfor tasks which require the robot to interact with an unstructured and/or\nunknown environment. We propose a novel quasi-direct-drive two-fingered robotic\nhand with variable impedance control in the joint space and Cartesian space.\nThe hand has a total of four degrees of freedom, a backdrivable gear train, and\nfour brushless direct current (BLDC) motors. Field-Oriented Control (FOC) with\ncurrent sensing is used to control motor torques. Variable impedance control\nallows the hand to perform dexterous manipulation tasks while being safe during\nhuman-robot interaction. The quasi-direct-drive actuators enable the fingers to\nhandle contact with the environment without the need for complicated tactile or\nforce sensors. A majority 3D printed assembly makes this a low-cost research\nplatform built with affordable off-the-shelf components. The hand demonstrates\ngrasping with force-closure and form-closure, stable grasps in response to\ndisturbances, tasks exploiting contact with the environment, simple in-hand\nmanipulation, and a light touch for handling fragile objects.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:27:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Best","Jay",""]]}
{"id":"2308.10410","submitter":"Irene Li","authors":"Fan Gao, Hang Jiang, Moritz Blum, Jinghui Lu, Yuang Jiang, Irene Li","title":"Large Language Models on Wikipedia-Style Survey Generation: an\n  Evaluation in NLP Concepts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Large Language Models (LLMs) have achieved significant success across various\nnatural language processing (NLP) tasks, encompassing question-answering,\nsummarization, and machine translation, among others. While LLMs excel in\ngeneral tasks, their efficacy in domain-specific applications remains under\nexploration. Additionally, LLM-generated text sometimes exhibits issues like\nhallucination and disinformation. In this study, we assess LLMs' capability of\nproducing concise survey articles within the computer science-NLP domain,\nfocusing on 20 chosen topics. Automated evaluations indicate that GPT-4\noutperforms GPT-3.5 when benchmarked against the ground truth. Furthermore,\nfour human evaluators provide insights from six perspectives across four model\nconfigurations. Through case studies, we demonstrate that while GPT often\nyields commendable results, there are instances of shortcomings, such as\nincomplete information and the exhibition of lapses in factual accuracy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:32:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gao","Fan",""],["Jiang","Hang",""],["Blum","Moritz",""],["Lu","Jinghui",""],["Jiang","Yuang",""],["Li","Irene",""]]}
{"id":"2308.10411","submitter":"Hao Chen","authors":"Hao Chen, Weiwei Wan, Masaki Matsushita, Takeyuki Kotaka, Kensuke\n  Harada","title":"In-Rack Test Tube Pose Estimation Using RGB-D Data","comments":"Submit to IEEE ROBIO 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate robotic manipulation of test tubes in biology and medical industries\nis becoming increasingly important to address workforce shortages and improve\nworker safety. The detection and localization of test tubes are essential for\nthe robots to successfully manipulate test tubes. In this paper, we present a\nframework to detect and estimate poses for the in-rack test tubes using color\nand depth data. The methodology involves the utilization of a YOLO object\ndetector to effectively classify and localize both the test tubes and the tube\nracks within the provided image data. Subsequently, the pose of the tube rack\nis estimated through point cloud registration techniques. During the process of\nestimating the poses of the test tubes, we capitalize on constraints derived\nfrom the arrangement of rack slots. By employing an optimization-based\nalgorithm, we effectively evaluate and refine the pose of the test tubes. This\nstrategic approach ensures the robustness of pose estimation, even when\nconfronted with noisy and incomplete point cloud data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:35:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Hao",""],["Wan","Weiwei",""],["Matsushita","Masaki",""],["Kotaka","Takeyuki",""],["Harada","Kensuke",""]]}
{"id":"2308.10412","submitter":"Zainab Malik","authors":"Zainab Malik","title":"Quasinormal modes of the bumblebee black holes with a global monopole","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We engage in the computation of quasinormal modes associated with scalar and\nDirac fields around spherically symmetric black holes with a global monopole in\nbumblebee gravity. The frequency of oscillation and the damping rate exhibit\nsignificant decreasing as the global monopole parameter is increased. An\nintriguing observation arises in the extreme limit, where the quasinormal modes\nmanifest a form of universal behavior: the actual oscillation frequency remains\nunaltered despite variations in the Lorentz symmetry breaking (LSB) parameter.\nOur calculations are conducted through two distinct methods, both of which\nyield results that align remarkably well. Furthermore, we derive an analytical\nformula for quasinormal modes within the eikonal approximation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:38:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Malik","Zainab",""]]}
{"id":"2308.10413","submitter":"Toby Walsh","authors":"Toby Walsh","title":"Mechanisms that play a game, not toss a coin","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Randomized mechanisms can have good normative properties compared to their\ndeterministic counterparts. However, randomized mechanisms are problematic in\nseveral ways such as in their verifiability. We propose here to derandomize\nsuch mechanisms by having agents play a game instead of tossing a coin. The\ngame is designed so an agent's best action is to play randomly, and this play\nthen injects ``randomness'' into the mechanism. This derandomization retains\nmany of the good normative properties of the original randomized mechanism but\ngives a mechanism that is deterministic and easy, for instance, to audit. We\nconsider three related methods to derandomize randomized mechanism in six\ndifferent domains: voting, facility location, task allocation, school choice,\npeer selection, and resource allocation. We propose a number of novel\nderandomized mechanisms for these six domains with good normative properties.\nEach mechanism has a mixed Nash equilibrium in which agents play a modular\narithmetic game with an uniform mixed strategy. In all but one mixed Nash\nequilibrium, agents report their preferences over the original problem\nsincerely. The derandomized methods are thus ``quasi-strategy proof''. In one\ndomain, we additionally show that a new and desirable normative property\nemerges as a result of derandomization.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:43:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Walsh","Toby",""]]}
{"id":"2308.10414","submitter":"Graham Wallace Wilson","authors":"Graham W. Wilson","title":"Further investigation of dilepton-based center-of-mass energy\n  measurements at e$^{+}$e$^{-}$ colliders","comments":"22 pages, 10 figures, LCWS 2023 Proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph physics.acc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Methods for measuring the absolute center-of-mass energy using dileptons from\ne$^{+}$e$^{-}$ collision events are further developed with an emphasis on\naccelerator, detector, and physics limitations. We discuss two main estimators,\nthe lepton momentum-based center-of-mass energy estimator, $\\sqrt{s}_{p}$,\ndiscussed previously, and new estimators for the electron and positron\ncolliding beam energies, denoted $E^{\\text{C}}_{-}$ and $E^{\\text{C}}_{+}$. In\nthis work we focus on the underlying limitations from beam energy spread,\ndetector resolution, and the modeling of higher-order QED radiative corrections\nassociated with photon emissions originating from initial-state-radiation\n(ISR), final-state-radiation (FSR), and their interference. We study the\nconsequent implications for the potential of these methods at center-of-mass\nenergies ranging from 90 GeV to 1 TeV relevant to a number of potential\naccelerator realizations in the context of measurements of masses of the Z, W,\nH, top quark, and new particles. The statistical importance of the Bhabha\nchannel for Higgs factories is noted. Additional extensive work on improving\nthe modeling of the luminosity spectrum including the use of copulas is also\nreported.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:48:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wilson","Graham W.",""]]}
{"id":"2308.10415","submitter":"Scott Wisdom","authors":"Hakan Erdogan, Scott Wisdom, Xuankai Chang, Zal\\'an Borsos, Marco\n  Tagliasacchi, Neil Zeghidour, John R. Hershey","title":"TokenSplit: Using Discrete Speech Representations for Direct, Refined,\n  and Transcript-Conditioned Speech Separation and Recognition","comments":"INTERSPEECH 2023, project webpage with audio demos at\n  https://google-research.github.io/sound-separation/papers/tokensplit","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":"  We present TokenSplit, a speech separation model that acts on discrete token\nsequences. The model is trained on multiple tasks simultaneously: separate and\ntranscribe each speech source, and generate speech from text. The model\noperates on transcripts and audio token sequences and achieves multiple tasks\nthrough masking of inputs. The model is a sequence-to-sequence encoder-decoder\nmodel that uses the Transformer architecture. We also present a \"refinement\"\nversion of the model that predicts enhanced audio tokens from the audio tokens\nof speech separated by a conventional separation model. Using both objective\nmetrics and subjective MUSHRA listening tests, we show that our model achieves\nexcellent performance in terms of separation, both with or without transcript\nconditioning. We also measure the automatic speech recognition (ASR)\nperformance and provide audio samples of speech synthesis to demonstrate the\nadditional utility of our model.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:52:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Erdogan","Hakan",""],["Wisdom","Scott",""],["Chang","Xuankai",""],["Borsos","Zal\u00e1n",""],["Tagliasacchi","Marco",""],["Zeghidour","Neil",""],["Hershey","John R.",""]]}
{"id":"2308.10416","submitter":"Yuki Minowa","authors":"Daisuke Kishimoto, Yuki Minowa","title":"A short elementary proof of Beben and Theriault's theorem on homotopy\n  fibers","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beben and Theriault proved a theorem on the homotopy fiber of an extension of\na map with respect to a cone attachment, which has produced several\napplications. We give a short and elementary proof of this theorem.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:54:28 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 04:31:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kishimoto","Daisuke",""],["Minowa","Yuki",""]]}
{"id":"2308.10417","submitter":"Ragav Sachdeva","authors":"Ragav Sachdeva, Andrew Zisserman","title":"The Change You Want to See (Now in 3D)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of this paper is to detect what has changed, if anything, between\ntwo \"in the wild\" images of the same 3D scene acquired from different camera\npositions and at different temporal instances. The open-set nature of this\nproblem, occlusions/dis-occlusions due to the shift in viewpoint, and the lack\nof suitable training datasets, presents substantial challenges in devising a\nsolution.\n  To address this problem, we contribute a change detection model that is\ntrained entirely on synthetic data and is class-agnostic, yet it is performant\nout-of-the-box on real world images without requiring fine-tuning. Our solution\nentails a \"register and difference\" approach that leverages self-supervised\nfrozen embeddings and feature differences, which allows the model to generalise\nto a wide variety of scenes and domains. The model is able to operate directly\non two RGB images, without requiring access to ground truth camera intrinsics,\nextrinsics, depth maps, point clouds, or additional before-after images.\nFinally, we collect and release a new evaluation dataset consisting of\nreal-world image pairs with human-annotated differences and demonstrate the\nefficacy of our method. The code, datasets and pre-trained model can be found\nat: https://github.com/ragavsachdeva/CYWS-3D\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 01:59:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sachdeva","Ragav",""],["Zisserman","Andrew",""]]}
{"id":"2308.10418","submitter":"Akinori Kawachi","authors":"Akinori Kawachi and Yuki Naito","title":"Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour\n  Cipher","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Even-Mansour (EM) cipher is one of the famous constructions for a block\ncipher. Kuwakado and Morii demonstrated that a quantum adversary can recover\nits $n$-bit secret keys only with $O(n)$ nonadaptive quantum queries. While the\nsecurity of the EM cipher and its variants is well-understood for classical\nadversaries, very little is currently known of their quantum security. Towards\na better understanding of the quantum security, or the limits of quantum\nadversaries for the EM cipher, we study the quantum query complexity for the\nkey recovery of the EM cipher and prove every quantum algorithm requires\n$\\Omega(n)$ quantum queries for the key recovery even if it is allowed to make\nadaptive queries. Therefore, the quantum attack of Kuwakado and Morii has the\noptimal query complexity up to a constant factor, and we cannot asymptotically\nimprove it even with adaptive quantum queries.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:01:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kawachi","Akinori",""],["Naito","Yuki",""]]}
{"id":"2308.10419","submitter":"Ryo Kato","authors":"Ryo Kato, Keitaro Takahashi","title":"Precision of localization of single gravitational-wave source with\n  pulsar timing array","comments":"11 pages, 5 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":"  Pulsar Timing Arrays (PTAs) are expected to be able to detect gravitational\nwaves (GWs) from individual supermassive black hole binaries in the near\nfuture. In order to identify the host galaxy of a gravitational wave source,\nthe angular resolution of PTAs should be much better than that expected from\nthe conventional methodology of PTAs. We study the potential usefulness of\nprecise pulsar-distance measurements in the determination of the sky location\nof a single GW source. Precise distance information from external observations\nsuch as astrometry by Very Long Baseline Interferometry is incorporated as\npriors in the PTA analysis and we evaluate the precision of the sky location of\na GW source by simulating PTA data of 12 milli-second pulsars with only the GW\nsignal and the Gaussian white noise in the timing residuals. We show that only\na few pulsars with a distance precision of 1 pc will improve the precision of\nthe source location by more than 1 order in the presence of white noise of 10\nns.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:07:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kato","Ryo",""],["Takahashi","Keitaro",""]]}
{"id":"2308.10420","submitter":"Jinqiu Zhao","authors":"Jinqiu Zhao, Jia Ye Shuaishuai Guo, Zhiquan Bai, Di Zhou, and Abeer\n  Mohamed","title":"Reconfigurable Intelligent Surface Enabled Joint Backscattering and\n  Communication","comments":"11 pages, 8 figures, published to IEEE TVT","journal-ref":"IEEE Transactions on Vehicular Technology, 2023","doi":"10.1109/TVT.2023.3305330","report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconfigurable intelligent surface (RIS) as an essential topic in the\nsixth-generation (6G) communications aims to enhance communication performance\nor mitigate undesired transmission. However, the controllability of each\nreflecting element on RIS also enables it to act as a passive backscatter\ndevice (BD) and transmit its information to reader devices. In this paper, we\npropose a RIS-enabled joint backscattering and communication (JBAC) system,\nwhere the backscatter communication coexists with the primary communication and\noccupies no extra spectrum. Specifically, the RIS modifies its reflecting\npattern to act as a passive BD and reflect its own information back to the base\nstation (BS) in the backscatter communication, while helping the primary\ncommunication from the BS to the users simultaneously. We further present an\niterative active beamforming and reflecting pattern design to maximize the user\naverage transmission rate of the primary communication and the goodput of the\nbackscatter communication by solving the formulated multi-objective\noptimization problem (MOOP). Numerical results fully uncover the impacts of the\nnumber of reflecting elements and the reflecting patterns on the system\nperformance, and demonstrate the effectiveness of the proposed scheme.\nImportant practical implementation remarks have also been discussed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:09:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Jinqiu",""],["Guo","Jia Ye Shuaishuai",""],["Bai","Zhiquan",""],["Zhou","Di",""],["Mohamed","Abeer",""]]}
{"id":"2308.10421","submitter":"Guanglei Yang","authors":"Jian Zou, Tianyu Huang, Guanglei Yang, Zhenhua Guo, Wangmeng Zuo","title":"UniM$^2$AE: Multi-modal Masked Autoencoders with Unified 3D\n  Representation for 3D Perception in Autonomous Driving","comments":"Code available at https://github.com/hollow-503/UniM2AE","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Masked Autoencoders (MAE) play a pivotal role in learning potent\nrepresentations, delivering outstanding results across various 3D perception\ntasks essential for autonomous driving. In real-world driving scenarios, it's\ncommonplace to deploy multiple sensors for comprehensive environment\nperception. While integrating multi-modal features from these sensors can\nproduce rich and powerful features, there is a noticeable gap in MAE methods\naddressing this integration. This research delves into multi-modal Masked\nAutoencoders tailored for a unified representation space in autonomous driving,\naiming to pioneer a more efficient fusion of two distinct modalities. To\nintricately marry the semantics inherent in images with the geometric\nintricacies of LiDAR point clouds, the UniM$^2$AE is proposed. This model\nstands as a potent yet straightforward, multi-modal self-supervised\npre-training framework, mainly consisting of two designs. First, it projects\nthe features from both modalities into a cohesive 3D volume space, ingeniously\nexpanded from the bird's eye view (BEV) to include the height dimension. The\nextension makes it possible to back-project the informative features, obtained\nby fusing features from both modalities, into their native modalities to\nreconstruct the multiple masked inputs. Second, the Multi-modal 3D Interactive\nModule (MMIM) is invoked to facilitate the efficient inter-modal interaction\nduring the interaction process. Extensive experiments conducted on the nuScenes\nDataset attest to the efficacy of UniM$^2$AE, indicating enhancements in 3D\nobject detection and BEV map segmentation by 1.2\\%(NDS) and 6.5\\% (mIoU),\nrespectively. Code is available at https://github.com/hollow-503/UniM2AE.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:13:40 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 02:32:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zou","Jian",""],["Huang","Tianyu",""],["Yang","Guanglei",""],["Guo","Zhenhua",""],["Zuo","Wangmeng",""]]}
{"id":"2308.10422","submitter":"Guangsheng Yu","authors":"Guangsheng Yu and Xu Wang and Caijun Sun and Qin Wang","title":"Split Unlearning","comments":"An earlier edition, with extensive experiments being conducted for\n  the forthcoming full version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Split learning is emerging as a powerful approach to decentralized machine\nlearning, but the urgent task of unlearning to address privacy issues presents\nsignificant challenges. Conventional methods of retraining from scratch or\ngradient ascending require all clients' involvement, incurring high\ncomputational and communication overhead, particularly in public networks where\nclients lack resources and may be reluctant to participate in unlearning\nprocesses they have no interest. In this short article, we propose\n\\textsc{SplitWiper}, a new framework that integrates the concept of SISA to\nreduce retraining costs and ensures no interference between the unlearning\nclient and others in public networks. Recognizing the inherent sharding in\nsplit learning, we first establish the SISA-based design of\n\\textsc{SplitWiper}. This forms the premise for conceptualizing two unlearning\nstrategies for label-sharing and non-label-sharing scenarios. This article\nrepresents an earlier edition, with extensive experiments being conducted for\nthe forthcoming full version.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:16:29 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 08:10:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yu","Guangsheng",""],["Wang","Xu",""],["Sun","Caijun",""],["Wang","Qin",""]]}
{"id":"2308.10423","submitter":"Hyeon Seok Rou","authors":"Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, David Gonz\\'alez G.,\n  Osvaldo Gonsa","title":"Integrated Sensing and Communications for 3D Object Imaging via Bilinear\n  Inference","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":"  We consider an uplink integrated sensing and communications (ISAC) scenario\nwhere the detection of data symbols from multiple user equipment (UEs) occurs\nsimultaneously with a three-dimensional (3D) estimation of the environment,\nextracted from the scattering features present in the channel state information\n(CSI) and utilizing the same physical layer communications air interface, as\nopposed to radar technologies. By exploiting a discrete (voxelated)\nrepresentation of the environment, two novel ISAC schemes are derived with\npurpose-built message passing (MP) rules for the joint estimation of data\nsymbols and status (filled/empty) of the discretized environment. The first\nrelies on a modular feedback structure in which the data symbols and the\nenvironment are estimated alternately, whereas the second leverages a bilinear\ninference framework to estimate both variables concurrently. Both contributed\nmethods are shown via simulations to outperform the state-of-the-art (SotA) in\naccurately recovering the transmitted data as well as the 3D image of the\nenvironment. An analysis of the computational complexities of the proposed\nmethods reveals distinct advantages of each scheme, namely, that the bilinear\nsolution exhibits a superior robustness to short pilots and channel blockages,\nwhile the alternating solution offers lower complexity with large number of UEs\nand superior performance in ideal conditions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:17:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rou","Hyeon Seok",""],["de Abreu","Giuseppe Thadeu Freitas",""],["G.","David Gonz\u00e1lez",""],["Gonsa","Osvaldo",""]]}
{"id":"2308.10424","submitter":"Weijun Gao","authors":"Weijun Gao, Chong Han, and Zhi Chen","title":"Attenuation and Loss of Spatial Coherence Modeling for Atmospheric\n  Turbulence in Terahertz UAV MIMO Channels","comments":"arXiv admin note: substantial text overlap with arXiv:2305.08820","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Terahertz (THz) wireless communications have the potential to realize\nultra-high-speed and secure data transfer with miniaturized devices for\nunmanned aerial vehicle (UAV) communications. The atmospheric turbulence due to\nrandom airflow leads to spatial inhomogeneity of the communication medium,\nwhich is yet missing in most existing studies, leading to additional\npropagation loss and even loss of spatial coherence (LoSC) in MIMO systems. In\nthis paper, the attenuation and loss of spatial coherence for atmospheric\nturbulence are modeled in THz UAV MIMO channels. Specifically, the frequency-\nand altitude-dependency of the refractive index structure constant (RISC), as a\ncritical statistical parameter characterizing the intensity of turbulence, is\nfirst investigated. Then, the LoSC, fading, and attenuation caused by\natmospheric turbulence are modeled, where the turbulence-induced fading is\nmodeled by a Gamma-Gamma distribution, and the turbulence attenuation as a\nfunction of altitude and frequency is derived. Numerical results show that the\nturbulence leads to at most 10 dB attenuation with frequency less than 1 THz\nand distance less than 10 km. Furthermore, when the distance is 10 km and the\nRISC is 10^-9m^(-2/3), the loss of spatial coherence effect leads to 10 dB\nadditional loss for a 1024*1024 ultra-massive MIMO system.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:22:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gao","Weijun",""],["Han","Chong",""],["Chen","Zhi",""]]}
{"id":"2308.10425","submitter":"Hangchen Liu","authors":"Hangchen Liu, Zheng Dong, Renhe Jiang, Jiewen Deng, Jinliang Deng,\n  Quanjun Chen and Xuan Song","title":"STAEformer: Spatio-Temporal Adaptive Embedding Makes Vanilla Transformer\n  SOTA for Traffic Forecasting","comments":"Accepted as CIKM2023 Short Paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid development of the Intelligent Transportation System (ITS),\naccurate traffic forecasting has emerged as a critical challenge. The key\nbottleneck lies in capturing the intricate spatio-temporal traffic patterns. In\nrecent years, numerous neural networks with complicated architectures have been\nproposed to address this issue. However, the advancements in network\narchitectures have encountered diminishing performance gains. In this study, we\npresent a novel component called spatio-temporal adaptive embedding that can\nyield outstanding results with vanilla transformers. Our proposed\nSpatio-Temporal Adaptive Embedding transformer (STAEformer) achieves\nstate-of-the-art performance on five real-world traffic forecasting datasets.\nFurther experiments demonstrate that spatio-temporal adaptive embedding plays a\ncrucial role in traffic forecasting by effectively capturing intrinsic\nspatio-temporal relations and chronological information in traffic time series.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:27:13 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 16:36:44 GMT"},{"version":"v3","created":"Sat, 26 Aug 2023 02:18:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Hangchen",""],["Dong","Zheng",""],["Jiang","Renhe",""],["Deng","Jiewen",""],["Deng","Jinliang",""],["Chen","Quanjun",""],["Song","Xuan",""]]}
{"id":"2308.10426","submitter":"Mark Hertzberg","authors":"Jessie Yang, Mark P. Hertzberg","title":"Constraints on Inflaton-Higgs Couplings","comments":"12 pages in double column format, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  According to the best-fit parameters of the Standard Model, the Higgs field's\npotential reaches a maximum at a field value $h \\sim 10^{10-11}$ GeV and then\nturns over to negative values. During reheating after inflation, resonance\nbetween the inflaton and the Higgs can cause the Higgs to fluctuate past this\nmaximum and run down the dangerous side of the potential if these fields couple\ntoo strongly. In this paper, we place constraints on the inflaton-Higgs\ncouplings such that the probability of the Higgs entering the unstable regime\nduring reheating is small. To do so, the equations of motion are approximately\nsolved semi-analytically, then solved fully numerically. Next the growth in\nvariance is used to determine the parameter space for $\\kappa$ and $\\alpha$,\nthe coupling coefficients for inflaton-Higgs cubic and quartic interactions,\nrespectively. We find the upper bounds of $\\kappa < 1.6 \\times 10^{-5} m_\\phi\n\\sim 2.2 \\times 10^8$ GeV and $\\alpha < 10^{-8}$ to allow the Higgs to remain\nstable in most Hubble patches during reheating, and we also find the full two\nparameter joint constraints. We find a corresponding bound on the reheat\ntemperature of $T_\\text{reh} \\lesssim 9.2 \\times 10^9$ GeV. Additionally, de\nSitter temperature fluctuations during inflation put a lower bound on\ninflaton-Higgs coupling by providing an effective mass for the Higgs, pushing\nback its hilltop during inflation. These additional constraints provide a lower\nbound on $\\alpha$, while $\\kappa$ must also be non-zero for the inflaton to\ndecay efficiently.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:29:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Jessie",""],["Hertzberg","Mark P.",""]]}
{"id":"2308.10427","submitter":"Rongfei Fan","authors":"Shiyuan Zuo, Rongfei Fan, Han Hu, Ning Zhang, and Shimin Gong","title":"Federated Learning Robust to Byzantine Attacks: Achieving Zero\n  Optimality Gap","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 this paper, we propose a robust aggregation method for federated learning\n(FL) that can effectively tackle malicious Byzantine attacks. At each user,\nmodel parameter is firstly updated by multiple steps, which is adjustable over\niterations, and then pushed to the aggregation center directly. This decreases\nthe number of interactions between the aggregation center and users, allows\neach user to set training parameter in a flexible way, and reduces computation\nburden compared with existing works that need to combine multiple historical\nmodel parameters. At the aggregation center, geometric median is leveraged to\ncombine the received model parameters from each user. Rigorous proof shows that\nzero optimality gap is achieved by our proposed method with linear convergence,\nas long as the fraction of Byzantine attackers is below half. Numerical results\nverify the effectiveness of our proposed method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:43:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zuo","Shiyuan",""],["Fan","Rongfei",""],["Hu","Han",""],["Zhang","Ning",""],["Gong","Shimin",""]]}
{"id":"2308.10428","submitter":"Heyang Xue","authors":"Heyang Xue, Shuai Guo, Pengcheng Zhu, Mengxiao Bi","title":"Multi-GradSpeech: Towards Diffusion-based Multi-Speaker Text-to-speech\n  Using Consistent Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite imperfect score-matching causing drift in training and sampling\ndistributions of diffusion models, recent advances in diffusion-based acoustic\nmodels have revolutionized data-sufficient single-speaker Text-to-Speech (TTS)\napproaches, with Grad-TTS being a prime example. However, the sampling drift\nproblem leads to these approaches struggling in multi-speaker scenarios in\npractice due to more complex target data distribution compared to\nsingle-speaker scenarios. In this paper, we present Multi-GradSpeech, a\nmulti-speaker diffusion-based acoustic models which introduces the Consistent\nDiffusion Model (CDM) as a generative modeling approach. We enforce the\nconsistency property of CDM during the training process to alleviate the\nsampling drift problem in the inference stage, resulting in significant\nimprovements in multi-speaker TTS performance. Our experimental results\ncorroborate that our proposed approach can improve the performance of different\nspeakers involved in multi-speaker TTS compared to Grad-TTS, even outperforming\nthe fine-tuning approach. Audio samples are available at\nhttps://welkinyang.github.io/multi-gradspeech/\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:47:03 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:37:39 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Xue","Heyang",""],["Guo","Shuai",""],["Zhu","Pengcheng",""],["Bi","Mengxiao",""]]}
{"id":"2308.10429","submitter":"Mattie Ji","authors":"Lev Borisov, Mattie Ji, Yanxin Li, Sargam Mondal","title":"On the Geometry of a Fake Projective Plane with $21$ Automorphisms","comments":"8 pages. The relevant Mathematica, Magma, Macaulay2 codes and\n  equations produced can be found in the ancillary folder and links in the\n  bibliography","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A fake projective plane is a complex surface with the same Betti numbers as\n$\\mathbb{C} P^2$ but not biholomorphic to it. We study the fake projective\nplane $\\mathbb{P}_{\\operatorname{fake}}^2 = (a = 7, p = 2, \\emptyset, D_3 2_7)$\nin the Cartwright-Steger classification. In this paper, we exploit the large\nsymmetries given by $\\operatorname{Aut}(\\mathbb{P}_{\\operatorname{fake}}^2) =\nC_7 \\rtimes C_3$ to construct an embedding of this surface into $\\mathbb{C}\nP^5$ as a system of $56$ sextics with coefficients in $\\mathbb{Q}(\\sqrt{-7})$.\nFor each torsion line bundle $T \\in\n\\operatorname{Pic}(\\mathbb{P}_{\\operatorname{fake}}^2)$, we also compute and\nstudy the linear systems $|nH + T|$ with small $n$, where $H$ is an ample\ngenerator of the N\\'eron-Severi group.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:47:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Borisov","Lev",""],["Ji","Mattie",""],["Li","Yanxin",""],["Mondal","Sargam",""]]}
{"id":"2308.10430","submitter":"Alexander B. Watson","authors":"Tianyu Kong, Diyi Liu, Mitchell Luskin, Alexander B. Watson","title":"Modeling of electronic dynamics in twisted bilayer graphene","comments":"27 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.mes-hall cs.NA math.AP math.MP math.NA quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of numerically computing the quantum dynamics of an\nelectron in twisted bilayer graphene. The challenge is that atomic-scale models\nof the dynamics are aperiodic for generic twist angles because of the\nincommensurability of the layers. The Bistritzer-MacDonald PDE model, which is\nperiodic with respect to the bilayer's moir\\'e pattern, has recently been shown\nto rigorously describe these dynamics in a parameter regime. In this work, we\nfirst prove that the dynamics of the tight-binding model of incommensurate\ntwisted bilayer graphene can be approximated by computations on finite domains.\nThe main ingredient of this proof is a speed of propagation estimate proved\nusing Combes-Thomas estimates. We then provide extensive numerical computations\nwhich clarify the range of validity of the Bistritzer-MacDonald model.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:50:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kong","Tianyu",""],["Liu","Diyi",""],["Luskin","Mitchell",""],["Watson","Alexander B.",""]]}
{"id":"2308.10431","submitter":"Rolf Binder","authors":"N.H. Kwong, M.Em. Spotnitz, R. Binder","title":"Gapless fluctuations and exceptional points in semiconductor lasers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze the spectrum of spatially uniform, single-particle fluctuation\nmodes in the linear electromagnetic response of a semiconductor laser. We show\nthat if the decay rate of the interband polarization, $\\gamma_p$, and the\nrelaxation rate of the occupation distribution, $\\gamma_f$, are different, a\ngapless regime exists in which the order parameter $\\Delta^{(0)} (k)$ (linear\nin the coherent photon field amplitude and the interband polarization) is\nfinite but there is no gap in the real part of the single-particle fluctuation\nspectrum. The laser being a pumped-dissipative system, this regime may be\nconsidered a non-equilibrium analog of gapless superconductivity. We analyze\nthe fluctuation spectrum in both the photon laser limit, where the interactions\namong the charged particles are ignored, and the more general model with\ninteracting particles. In the photon laser model, the order parameter is\nreduced to a momentum-independent quantity, which we denote by $\\Delta$. We\nfind that, immediately above the lasing threshold, the real part of the\nfluctuation spectrum remains gapless when $0 < | \\Delta | < \\sqrt{2 / 27} \\, |\n\\gamma_f - \\gamma_p |$ and becomes gapped when $| \\Delta |$ exceeds the upper\nbound of this range. Viewed as a complex function of $|\\Delta|$ and the\nelectron-hole energy, the eigenvalue set displays some interesting exceptional\npoint (EP) structure around the gapless-gapped transition. The transition point\nis a third-order EP, where three eigenvalues (and eigenvectors) coincide.\nSwitching on the particle interactions in the full model modifies the spectrum\nof the photon laser model and, in particular, leads to a more elaborate EP\nstructure. However, the overall spectral behavior of the continuous\n(non-collective) modes of the full model can be understood on the basis of the\nrelevant results of the photon laser model.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:50:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kwong","N. H.",""],["Spotnitz","M. Em.",""],["Binder","R.",""]]}
{"id":"2308.10432","submitter":"Matsuno Satsuki","authors":"Satsuki Matsuno, Fumihiro Ueno","title":"On Sasakian quasi-Killing spinors in three-dimensions","comments":"18 pages","journal-ref":null,"doi":null,"report-no":"OCU-PHYS-584, AP-GR-193","categories":"math.DG hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Sasakian quasi-Killing spinor (SqK-spinor), which is a generalization of a\nKilling spinor on Sasakian manifolds, was defined by Kim and Friedrich. The\npurpose of this paper is to study in detail SqK-spinors on three-dimensional\npseudo-Riemannian Sasakian space-form. We briefly review some results on\nSqK-spinors and then investigate some geometric properties. First, we\ndemonstrate that the Reeb vector field is described by a specific SqK-spinor.\nThen we establish that the movement of charged particles in the presence of a\ncontact Maxwell field can be depicted using an SqK-spinor. Furthermore, we find\nthat almost all SqK-spinors provide solutions to the Einstein-Dirac system with\na non-zero cosmological constant. Additionally, we reveal that a particular\nSqK-spinor in conjunction with a contact Maxwell field satisfies the\nEinstein-Dirac-Maxwell systems. Finally, we show explicit formulae of\nSqK-spinors in terms of elementary functions with respect to a certain frame.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:56:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Matsuno","Satsuki",""],["Ueno","Fumihiro",""]]}
{"id":"2308.10433","submitter":"Shen Li","authors":"Shen Li","title":"Higher Auslander algebras of finite representation type","comments":"comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Lambda$ be an $n$-Auslander algebra with global dimension $n+1$. In\nthis paper, we prove that $\\Lambda$ is representation-finite if and only if the\nnumber of non-isomorphic indecomposable $\\Lambda$-modules with projective\ndimension $n+1$ is finite. As an application, we classify the\nrepresentation-finite higher Auslander algebras of linearly oriented type\n$\\mathbb{A}$ in the sense of Iyama and calculate the number of non-isomorphic\nindecomposable modules over these algebras.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:02:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Shen",""]]}
{"id":"2308.10434","submitter":"Yawei Wei","authors":"Yiming Jiang, Jingchuang Ren, Yawei Wei and Jie Xue","title":"Degenerate Mean Field Games with H\\\"ormander diffusion","comments":"We deeply appreciate your consideration of the manuscript. Thank you\n  very much","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study a class of degenerate mean field game systems arising\nfrom the mean field games with H\\\"ormander diffusion, where the generic player\nmay have a ``forbidden'' direction at some point. Here we prove the existence\nand uniqueness of the classical solutions in weighted H\\\"older spaces for the\nPDE systems, which describe the Nash equilibria in the games. The degeneracy\ncauses the lack of commutation of vector fields and the fundamental solution\nwhich are the main difficulties in the proof of the global Schauder estimate\nand the weak maximum principle. Based on the idea of the localizing technique\nand the local homogeneity of degenerate operators, we extend the maximum\nregularity result and obtain the global Schauder estimates. For the weak\nmaximum principle, we construct a subsolution instead of the fundamental\nsolution of the degenerate operators.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:06:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Yiming",""],["Ren","Jingchuang",""],["Wei","Yawei",""],["Xue","Jie",""]]}
{"id":"2308.10435","submitter":"Nathalia Nascimento","authors":"Nathalia Nascimento and Paulo Alencar and Donald Cowan","title":"GPT-in-the-Loop: Adaptive Decision-Making for Multiagent Systems","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI cs.NE cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces the \"GPT-in-the-loop\" approach, a novel method\ncombining the advanced reasoning capabilities of Large Language Models (LLMs)\nlike Generative Pre-trained Transformers (GPT) with multiagent (MAS) systems.\nVenturing beyond traditional adaptive approaches that generally require long\ntraining processes, our framework employs GPT-4 for enhanced problem-solving\nand explanation skills. Our experimental backdrop is the smart streetlight\nInternet of Things (IoT) application. Here, agents use sensors, actuators, and\nneural networks to create an energy-efficient lighting system. By integrating\nGPT-4, these agents achieve superior decision-making and adaptability without\nthe need for extensive training. We compare this approach with both traditional\nneuroevolutionary methods and solutions provided by software engineers,\nunderlining the potential of GPT-driven multiagent systems in IoT.\nStructurally, the paper outlines the incorporation of GPT into the agent-driven\nFramework for the Internet of Things (FIoT), introduces our proposed\nGPT-in-the-loop approach, presents comparative results in the IoT context, and\nconcludes with insights and future directions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:08:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nascimento","Nathalia",""],["Alencar","Paulo",""],["Cowan","Donald",""]]}
{"id":"2308.10436","submitter":"Ningyuan Huang","authors":"Ningyuan Huang, Ron Levie, Soledad Villar","title":"Approximately Equivariant Graph Networks","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":"  Graph neural networks (GNNs) are commonly described as being permutation\nequivariant with respect to node relabeling in the graph. This symmetry of GNNs\nis often compared to the translation equivariance symmetry of Euclidean\nconvolution neural networks (CNNs). However, these two symmetries are\nfundamentally different: The translation equivariance of CNNs corresponds to\nsymmetries of the fixed domain acting on the image signal (sometimes known as\nactive symmetries), whereas in GNNs any permutation acts on both the graph\nsignals and the graph domain (sometimes described as passive symmetries). In\nthis work, we focus on the active symmetries of GNNs, by considering a learning\nsetting where signals are supported on a fixed graph. In this case, the natural\nsymmetries of GNNs are the automorphisms of the graph. Since real-world graphs\ntend to be asymmetric, we relax the notion of symmetries by formalizing\napproximate symmetries via graph coarsening. We present a bias-variance formula\nthat quantifies the tradeoff between the loss in expressivity and the gain in\nthe regularity of the learned estimator, depending on the chosen symmetry\ngroup. To illustrate our approach, we conduct extensive experiments on image\ninpainting, traffic flow prediction, and human pose estimation with different\nchoices of symmetries. We show theoretically and empirically that the best\ngeneralization performance can be achieved by choosing a suitably larger group\nthan the graph automorphism group, but smaller than the full permutation group.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:13:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Ningyuan",""],["Levie","Ron",""],["Villar","Soledad",""]]}
{"id":"2308.10437","submitter":"Jeong Shim","authors":"Santosh Ghimire and Seong-Joo Lee and Sangwon Oh and Jeong Hyun Shim","title":"Frequency limits of sequential readout for sensing AC magnetic fields\n  using nitrogen-vacancy centers in diamond","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nitrogen-vacancy (NV) centers in diamond have ability to sense\nalternating-current (AC) magnetic fields with high spatial resolution. However,\nthe frequency range of AC sensing protocols based on dynamical decoupling (DD)\nsequences has not been thoroughly explored experimentally. In this work, we\naimed to determine the sensitivity of ac magnetic field as a function of\nfrequency using sequential readout method. The upper limit at high frequency is\nclearly determined by Rabi frequency, in line with the expected effect of\nfinite DD-pulse width. In contrast, the lower frequency limit is primarily\ngoverned by the duration of optical repolarization rather than the decoherence\ntime (T$_2$) of NV spins. This becomes particularly crucial when the repetition\n(dwell) time of the sequential readout is fixed to maintain the acquisition\nbandwidth. The equation we provide successfully describes the tendency in the\nfrequency dependence. In addition, at the near-optimal frequency of 1 MHz, we\nreached a maximum sensitivity of 229 pT/$\\sqrt{\\mathrm{Hz}}$ by employing the\nXY4-(4) DD sequence.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:17:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghimire","Santosh",""],["Lee","Seong-Joo",""],["Oh","Sangwon",""],["Shim","Jeong Hyun",""]]}
{"id":"2308.10438","submitter":"Kaixin Xu","authors":"Kaixin Xu, Zhe Wang, Xue Geng, Jie Lin, Min Wu, Xiaoli Li, Weisi Lin","title":"Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a novel layer-adaptive weight-pruning approach for\nDeep Neural Networks (DNNs) that addresses the challenge of optimizing the\noutput distortion minimization while adhering to a target pruning ratio\nconstraint. Our approach takes into account the collective influence of all\nlayers to design a layer-adaptive pruning scheme. We discover and utilize a\nvery important additivity property of output distortion caused by pruning\nweights on multiple layers. This property enables us to formulate the pruning\nas a combinatorial optimization problem and efficiently solve it through\ndynamic programming. By decomposing the problem into sub-problems, we achieve\nlinear time complexity, making our optimization algorithm fast and feasible to\nrun on CPUs. Our extensive experiments demonstrate the superiority of our\napproach over existing methods on the ImageNet and CIFAR-10 datasets. On\nCIFAR-10, our method achieves remarkable improvements, outperforming others by\nup to 1.0% for ResNet-32, 0.5% for VGG-16, and 0.7% for DenseNet-121 in terms\nof top-1 accuracy. On ImageNet, we achieve up to 4.7% and 4.6% higher top-1\naccuracy compared to other methods for VGG-16 and ResNet-50, respectively.\nThese results highlight the effectiveness and practicality of our approach for\nenhancing DNN performance through layer-adaptive weight pruning. Code will be\navailable on https://github.com/Akimoto-Cris/RD_VIT_PRUNE.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:22:47 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 07:43:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xu","Kaixin",""],["Wang","Zhe",""],["Geng","Xue",""],["Lin","Jie",""],["Wu","Min",""],["Li","Xiaoli",""],["Lin","Weisi",""]]}
{"id":"2308.10439","submitter":"Mohan Zhao","authors":"Mohan Zhao, Kirill Serkh","title":"On the Approximation of Singular Functions by Series of Non-integer\n  Powers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we describe an algorithm for approximating functions of the\nform $f(x)=\\int_{a}^{b} x^{\\mu} \\sigma(\\mu) \\, d \\mu$ over $[0,1] \\subset\n\\mathbb{R}$, where $0<a<b<\\infty$ and $\\sigma(\\mu)$ is some signed Radon\nmeasure over $[a,b]$ or some distribution supported on $[a,b]$. Given the\ndesired accuracy $\\epsilon$ and the values of $a$ and $b$, our method\ndetermines a priori a collection of non-integer powers $\\{t_j\\}_{j=1}^N$, so\nthat the functions are approximated by series of the form $f(x)\\approx\n\\sum_{j=1}^N c_j x^{t_j}$, where the expansion coefficients can be found by\nsolving a square, low-dimensional Vandermonde-like linear system using the\ncollocation points $\\{x_j\\}_{j=1}^N$, also determined a priori by $\\epsilon$\nand the values of $a$ and $b$. We prove that our method has a small uniform\napproximation error which is proportional to $\\epsilon$ multiplied by some\nsmall constants. We demonstrate the performance of our algorithm with several\nnumerical experiments, and show that the number of singular powers and\ncollocation points grows as $N=O(\\log{\\frac{1}{\\epsilon}})$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:23:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhao","Mohan",""],["Serkh","Kirill",""]]}
{"id":"2308.10440","submitter":"Jie Liu","authors":"Haidong Liu, Jie Liu","title":"Kawamata--Miyaoka type inequality for canonical $\\mathbb{Q}$-Fano\n  varieties","comments":"18 pages. Any comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A $\\mathbb Q$-Fano variety is a normal $\\mathbb Q$-factorial projective\nvariety with Picard number one whose anti-canonical divisor is ample. In this\npaper, we prove a Kawamata--Miyaoka type inequality \\[ c_1(X)^n< 4\nc_2(X)c_1(X)^{n-2} \\] for any canonical $\\mathbb Q$-Fano variety $X$ of\ndimension $n$ which is smooth in codimension two. We also prove a stronger\ninequality for terminal $\\mathbb{Q}$-Fano threefolds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:24:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Haidong",""],["Liu","Jie",""]]}
{"id":"2308.10441","submitter":"Bo Dai","authors":"Bo Dai, Linge Wang, Baoxiong Jia, Zeyu Zhang, Song-Chun Zhu, Chi\n  Zhang, Yixin Zhu","title":"X-VoE: Measuring eXplanatory Violation of Expectation in Physical Events","comments":"19 pages, 16 figures, selected for an Oral presentation at ICCV 2023.\n  Project link: https://pku.ai/publication/intuitive2023iccv/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intuitive physics is pivotal for human understanding of the physical world,\nenabling prediction and interpretation of events even in infancy. Nonetheless,\nreplicating this level of intuitive physics in artificial intelligence (AI)\nremains a formidable challenge. This study introduces X-VoE, a comprehensive\nbenchmark dataset, to assess AI agents' grasp of intuitive physics. Built on\nthe developmental psychology-rooted Violation of Expectation (VoE) paradigm,\nX-VoE establishes a higher bar for the explanatory capacities of intuitive\nphysics models. Each VoE scenario within X-VoE encompasses three distinct\nsettings, probing models' comprehension of events and their underlying\nexplanations. Beyond model evaluation, we present an explanation-based learning\nsystem that captures physics dynamics and infers occluded object states solely\nfrom visual sequences, without explicit occlusion labels. Experimental outcomes\nhighlight our model's alignment with human commonsense when tested against\nX-VoE. A remarkable feature is our model's ability to visually expound VoE\nevents by reconstructing concealed scenes. Concluding, we discuss the findings'\nimplications and outline future research directions. Through X-VoE, we catalyze\nthe advancement of AI endowed with human-like intuitive physics capabilities.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:28:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dai","Bo",""],["Wang","Linge",""],["Jia","Baoxiong",""],["Zhang","Zeyu",""],["Zhu","Song-Chun",""],["Zhang","Chi",""],["Zhu","Yixin",""]]}
{"id":"2308.10442","submitter":"Jingya Zhou","authors":"Yingdan Shi, Jingya Zhou, Congcong Zhang","title":"DySuse: Susceptibility Estimation in Dynamic Social Networks","comments":"This paper has been published in Expert Systems With Applications","journal-ref":"Expert Systems With Applications (ESWA), 2023, 234:121042","doi":"10.1016/j.eswa.2023.121042","report-no":null,"categories":"cs.SI cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Influence estimation aims to predict the total influence spread in social\nnetworks and has received surged attention in recent years. Most current\nstudies focus on estimating the total number of influenced users in a social\nnetwork, and neglect susceptibility estimation that aims to predict the\nprobability of each user being influenced from the individual perspective. As a\nmore fine-grained estimation task, susceptibility estimation is full of\nattractiveness and practical value. Based on the significance of susceptibility\nestimation and dynamic properties of social networks, we propose a task, called\nsusceptibility estimation in dynamic social networks, which is even more\nrealistic and valuable in real-world applications. Susceptibility estimation in\ndynamic networks has yet to be explored so far and is computationally\nintractable to naively adopt Monte Carlo simulation to obtain the results. To\nthis end, we propose a novel end-to-end framework DySuse based on dynamic graph\nembedding technology. Specifically, we leverage a structural feature module to\nindependently capture the structural information of influence diffusion on each\nsingle graph snapshot. Besides, {we propose the progressive mechanism according\nto the property of influence diffusion,} to couple the structural and temporal\ninformation during diffusion tightly. Moreover, a self-attention block {is\ndesigned to} further capture temporal dependency by flexibly weighting\nhistorical timestamps. Experimental results show that our framework is superior\nto the existing dynamic graph embedding models and has satisfactory prediction\nperformance in multiple influence diffusion models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:28:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shi","Yingdan",""],["Zhou","Jingya",""],["Zhang","Congcong",""]]}
{"id":"2308.10443","submitter":"Wesley Joon-Wie Tann","authors":"Wesley Tann, Yuancheng Liu, Jun Heng Sim, Choon Meng Seah, Ee-Chien\n  Chang","title":"Using Large Language Models for Cybersecurity Capture-The-Flag\n  Challenges and Certification Questions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.CY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The assessment of cybersecurity Capture-The-Flag (CTF) exercises involves\nparticipants finding text strings or ``flags'' by exploiting system\nvulnerabilities. Large Language Models (LLMs) are natural-language models\ntrained on vast amounts of words to understand and generate text; they can\nperform well on many CTF challenges. Such LLMs are freely available to\nstudents. In the context of CTF exercises in the classroom, this raises\nconcerns about academic integrity. Educators must understand LLMs' capabilities\nto modify their teaching to accommodate generative AI assistance. This research\ninvestigates the effectiveness of LLMs, particularly in the realm of CTF\nchallenges and questions. Here we evaluate three popular LLMs, OpenAI ChatGPT,\nGoogle Bard, and Microsoft Bing. First, we assess the LLMs' question-answering\nperformance on five Cisco certifications with varying difficulty levels. Next,\nwe qualitatively study the LLMs' abilities in solving CTF challenges to\nunderstand their limitations. We report on the experience of using the LLMs for\nseven test cases in all five types of CTF challenges. In addition, we\ndemonstrate how jailbreak prompts can bypass and break LLMs' ethical\nsafeguards. The paper concludes by discussing LLM's impact on CTF exercises and\nits implications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:30:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tann","Wesley",""],["Liu","Yuancheng",""],["Sim","Jun Heng",""],["Seah","Choon Meng",""],["Chang","Ee-Chien",""]]}
{"id":"2308.10444","submitter":"Qi Chen","authors":"Qi Chen, Dexi Liu","title":"Dynamic Strategy Chain: Dynamic Zero-Shot CoT for Long Mental Health\n  Support Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Long counseling Text Generation for Mental health support (LTGM), an\ninnovative and challenging task, aims to provide help-seekers with mental\nhealth support through a comprehensive and more acceptable response. The\ncombination of chain-of-thought (CoT) prompting and Large Language Models\n(LLMs) is employed and get the SOTA performance on various NLP tasks,\nespecially on text generation tasks. Zero-shot CoT prompting is one of the most\ncommon methods in CoT prompting. However, in the LTGM task, Zero-shot CoT\nprompting can not simulate a counselor or provide personalized strategies\nwithout effective mental health counseling strategy prompts. To tackle this\nchallenge, we propose a zero-shot Dynamic Strategy Chain (DSC) prompting\nmethod. Firstly, we utilize GPT2 to learn the responses written by mental\nhealth counselors and dynamically generate mental health counseling strategies\ntailored to the help-seekers' needs. Secondly, the Zero-shot DSC prompting is\nconstructed according to mental health counseling strategies and the\nhelp-seekers' post. Finally, the Zero-shot DSC prompting is employed to guide\nLLMs in generating more human-like responses for the help-seekers. Both\nautomatic and manual evaluations demonstrate that Zero-shot DSC prompting can\ndeliver more human-like responses than CoT prompting methods on LTGM tasks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:31:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Qi",""],["Liu","Dexi",""]]}
{"id":"2308.10445","submitter":"Yu-Ming Tang","authors":"Yu-Ming Tang, Yi-Xing Peng, Wei-Shi Zheng","title":"When Prompt-based Incremental Learning Does Not Meet Strong Pretraining","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":"  Incremental learning aims to overcome catastrophic forgetting when learning\ndeep networks from sequential tasks. With impressive learning efficiency and\nperformance, prompt-based methods adopt a fixed backbone to sequential tasks by\nlearning task-specific prompts. However, existing prompt-based methods heavily\nrely on strong pretraining (typically trained on ImageNet-21k), and we find\nthat their models could be trapped if the potential gap between the pretraining\ntask and unknown future tasks is large. In this work, we develop a learnable\nAdaptive Prompt Generator (APG). The key is to unify the prompt retrieval and\nprompt learning processes into a learnable prompt generator. Hence, the whole\nprompting process can be optimized to reduce the negative effects of the gap\nbetween tasks effectively. To make our APG avoid learning ineffective\nknowledge, we maintain a knowledge pool to regularize APG with the feature\ndistribution of each class. Extensive experiments show that our method\nsignificantly outperforms advanced methods in exemplar-free incremental\nlearning without (strong) pretraining. Besides, under strong retraining, our\nmethod also has comparable performance to existing prompt-based models, showing\nthat our method can still benefit from pretraining. Codes can be found at\nhttps://github.com/TOM-tym/APG\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:33:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tang","Yu-Ming",""],["Peng","Yi-Xing",""],["Zheng","Wei-Shi",""]]}
{"id":"2308.10446","submitter":"Liangrui Pan","authors":"Liangrui Pan, Yutao Dou, Zhichao Feng, Liwen Xu, Shaoliang Peng","title":"LDCSF: Local depth convolution-based Swim framework for classifying\n  multi-label histopathology images","comments":"Submitted to BIBM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Histopathological images are the gold standard for diagnosing liver cancer.\nHowever, the accuracy of fully digital diagnosis in computational pathology\nneeds to be improved. In this paper, in order to solve the problem of\nmulti-label and low classification accuracy of histopathology images, we\npropose a locally deep convolutional Swim framework (LDCSF) to classify\nmulti-label histopathology images. In order to be able to provide local field\nof view diagnostic results, we propose the LDCSF model, which consists of a\nSwin transformer module, a local depth convolution (LDC) module, a feature\nreconstruction (FR) module, and a ResNet module. The Swin transformer module\nreduces the amount of computation generated by the attention mechanism by\nlimiting the attention to each window. The LDC then reconstructs the attention\nmap and performs convolution operations in multiple channels, passing the\nresulting feature map to the next layer. The FR module uses the corresponding\nweight coefficient vectors obtained from the channels to dot product with the\noriginal feature map vector matrix to generate representative feature maps.\nFinally, the residual network undertakes the final classification task. As a\nresult, the classification accuracy of LDCSF for interstitial area, necrosis,\nnon-tumor and tumor reached 0.9460, 0.9960, 0.9808, 0.9847, respectively.\nFinally, we use the results of multi-label pathological image classification to\ncalculate the tumor-to-stromal ratio, which lays the foundation for the\nanalysis of the microenvironment of liver cancer histopathological images.\nSecond, we released a multilabel histopathology image of liver cancer, our code\nand data are available at https://github.com/panliangrui/LSF.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:44:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pan","Liangrui",""],["Dou","Yutao",""],["Feng","Zhichao",""],["Xu","Liwen",""],["Peng","Shaoliang",""]]}
{"id":"2308.10447","submitter":"Anwen Hu","authors":"Anwen Hu, Shizhe Chen, Liang Zhang, Qin Jin","title":"Explore and Tell: Embodied Visual Captioning in 3D Environments","comments":"12 pages; 10 figures; ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While current visual captioning models have achieved impressive performance,\nthey often assume that the image is well-captured and provides a complete view\nof the scene. In real-world scenarios, however, a single image may not offer a\ngood viewpoint, hindering fine-grained scene understanding. To overcome this\nlimitation, we propose a novel task called Embodied Captioning, which equips\nvisual captioning models with navigation capabilities, enabling them to\nactively explore the scene and reduce visual ambiguity from suboptimal\nviewpoints. Specifically, starting at a random viewpoint, an agent must\nnavigate the environment to gather information from different viewpoints and\ngenerate a comprehensive paragraph describing all objects in the scene. To\nsupport this task, we build the ET-Cap dataset with Kubric simulator,\nconsisting of 10K 3D scenes with cluttered objects and three annotated\nparagraphs per scene. We propose a Cascade Embodied Captioning model (CaBOT),\nwhich comprises of a navigator and a captioner, to tackle this task. The\nnavigator predicts which actions to take in the environment, while the\ncaptioner generates a paragraph description based on the whole navigation\ntrajectory. Extensive experiments demonstrate that our model outperforms other\ncarefully designed baselines. Our dataset, codes and models are available at\nhttps://aim3-ruc.github.io/ExploreAndTell.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:46:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Anwen",""],["Chen","Shizhe",""],["Zhang","Liang",""],["Jin","Qin",""]]}
{"id":"2308.10448","submitter":"James W. Swift Ph.D.","authors":"John M. Neuberger, N\\'andor Sieben and James W. Swift","title":"A Bifurcation Lemma for Invariant Subspaces","comments":"22 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Bifurcation from a Simple Eigenvalue (BSE) Theorem is the foundation of\nsteady-state bifurcation theory for one-parameter families of functions. When\neigenvalues of multiplicity greater than one are caused by symmetry, the\nEquivariant Branching Lemma (EBL) can often be applied to predict the branching\nof solutions. The EBL can be interpreted as the application of the BSE Theorem\nto a fixed point subspace. There are functions which have invariant linear\nsubspaces that are not caused by symmetry. For example, networks of identical\ncoupled cells often have such invariant subspaces. We present a generalization\nof the EBL, where the BSE Theorem is applied to nested invariant subspaces. We\ncall this the Bifurcation Lemma for Invariant Subspaces (BLIS). We give several\nexamples of bifurcations and determine if BSE, EBL, or BLIS apply. We extend\nour previous automated bifurcation analysis algorithms to use the BLIS to\nsimplify and improve the detection of branches created at bifurcations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:46:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Neuberger","John M.",""],["Sieben","N\u00e1ndor",""],["Swift","James W.",""]]}
{"id":"2308.10449","submitter":"Liangrui Pan","authors":"Liangrui Pan, Lian Wang, Zhichao Feng, Liwen Xu, Shaoliang Peng","title":"CVFC: Attention-Based Cross-View Feature Consistency for Weakly\n  Supervised Semantic Segmentation of Pathology Images","comments":"Submitted to BIBM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Histopathology image segmentation is the gold standard for diagnosing cancer,\nand can indicate cancer prognosis. However, histopathology image segmentation\nrequires high-quality masks, so many studies now use imagelevel labels to\nachieve pixel-level segmentation to reduce the need for fine-grained\nannotation. To solve this problem, we propose an attention-based cross-view\nfeature consistency end-to-end pseudo-mask generation framework named CVFC\nbased on the attention mechanism. Specifically, CVFC is a three-branch joint\nframework composed of two Resnet38 and one Resnet50, and the independent branch\nmulti-scale integrated feature map to generate a class activation map (CAM); in\neach branch, through down-sampling and The expansion method adjusts the size of\nthe CAM; the middle branch projects the feature matrix to the query and key\nfeature spaces, and generates a feature space perception matrix through the\nconnection layer and inner product to adjust and refine the CAM of each branch;\nfinally, through the feature consistency loss and feature cross loss to\noptimize the parameters of CVFC in co-training mode. After a large number of\nexperiments, An IoU of 0.7122 and a fwIoU of 0.7018 are obtained on the\nWSSS4LUAD dataset, which outperforms HistoSegNet, SEAM, C-CAM, WSSS-Tissue, and\nOEEM, respectively.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:50:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pan","Liangrui",""],["Wang","Lian",""],["Feng","Zhichao",""],["Xu","Liwen",""],["Peng","Shaoliang",""]]}
{"id":"2308.10450","submitter":"Xinghong Liu","authors":"Xinghong Liu, Yi Zhou, Tao Zhou, Chun-Mei Feng, Ling Shao","title":"COCA: Classifier-Oriented Calibration for Source-Free Universal Domain\n  Adaptation via Textual Prototype","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Universal Domain Adaptation (UniDA) aims to distinguish common and private\nclasses between the source and target domains where domain shift exists.\nRecently, due to more stringent data restrictions, researchers have introduced\nSource-Free UniDA (SF-UniDA) in more realistic scenarios. SF-UniDA methods\neliminate the need for direct access to source samples when performing\nadaptation to the target domain. However, existing SF-UniDA methods still\nrequire an extensive quantity of labeled source samples to train a source\nmodel, resulting in significant labeling costs. To tackle this issue, we\npresent a novel Classifier-Oriented Calibration (COCA) method. This method,\nwhich leverages textual prototypes, is formulated for the source model based on\nfew-shot learning. Specifically, we propose studying few-shot learning, usually\nexplored for closed-set scenarios, to identify common and domain-private\nclasses despite a significant domain shift between source and target domains.\nEssentially, we present a novel paradigm based on the vision-language model to\nlearn SF-UniDA and hugely reduce the labeling costs on the source domain.\nExperimental results demonstrate that our approach outperforms state-of-the-art\nUniDA and SF-UniDA models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:50:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Xinghong",""],["Zhou","Yi",""],["Zhou","Tao",""],["Feng","Chun-Mei",""],["Shao","Ling",""]]}
{"id":"2308.10451","submitter":"Xiaojie Chen","authors":"Chunxia Liu, Kaihong Lu, Xiaojie Chen, and Attila Szolnoki","title":"Game-theoretical approach for task allocation problems with constraints","comments":null,"journal-ref":"Applied Mathematics and Computation 458 (2023) 128251","doi":null,"report-no":null,"categories":"cs.GT math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The distributed task allocation problem, as one of the most interesting\ndistributed optimization challenges, has received considerable research\nattention recently. Previous works mainly focused on the task allocation\nproblem in a population of individuals, where there are no constraints for\naffording task amounts. The latter condition, however, cannot always be hold.\nIn this paper, we study the task allocation problem with constraints of task\nallocation in a game-theoretical framework. We assume that each individual can\nafford different amounts of task and the cost function is convex. To\ninvestigate the problem in the framework of population games, we construct a\npotential game and calculate the fitness function for each individual. We prove\nthat when the Nash equilibrium point in the potential game is in the feasible\nsolutions for the limited task allocation problem, the Nash equilibrium point\nis the unique globally optimal solution. Otherwise, we also derive analytically\nthe unique globally optimal solution. In addition, in order to confirm our\ntheoretical results, we consider the exponential and quadratic forms of cost\nfunction for each agent. Two algorithms with the mentioned representative cost\nfunctions are proposed to numerically seek the optimal solution to the limited\ntask problems. We further perform Monte Carlo simulations which provide\nagreeing results with our analytical calculations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:51:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Chunxia",""],["Lu","Kaihong",""],["Chen","Xiaojie",""],["Szolnoki","Attila",""]]}
{"id":"2308.10452","submitter":"Sidney Wong","authors":"Sidney G.-J. Wong, Jonathan Dunn and Benjamin Adams","title":"Comparing Measures of Linguistic Diversity Across Social Media Language\n  Data and Census Data at Subnational Geographic Areas","comments":null,"journal-ref":null,"doi":"10.6084/m9.figshare.20686324.v1","report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes a preliminary study on the comparative linguistic\necology of online spaces (i.e., social media language data) and real-world\nspaces in Aotearoa New Zealand (i.e., subnational administrative areas). We\ncompare measures of linguistic diversity between these different spaces and\ndiscuss how social media users align with real-world populations. The results\nfrom the current study suggests that there is potential to use online social\nmedia language data to observe spatial and temporal changes in linguistic\ndiversity at subnational geographic areas; however, further work is required to\nunderstand how well social media represents real-world behaviour.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:54:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wong","Sidney G. -J.",""],["Dunn","Jonathan",""],["Adams","Benjamin",""]]}
{"id":"2308.10453","submitter":"Skylar Stolte","authors":"Skylar E. Stolte, Kyle Volle, Aprinda Indahlastari, Alejandro Albizu,\n  Adam J. Woods, Kevin Brink, Matthew Hale, and Ruogu Fang","title":"DOMINO++: Domain-aware Loss Regularization for Deep Learning\n  Generalizability","comments":"12 pages, 5 figures, 5 tables, Accepted by the International\n  Conference on Medical Image Computing and Computer Assisted Intervention\n  (MICCAI) 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":"  Out-of-distribution (OOD) generalization poses a serious challenge for modern\ndeep learning (DL). OOD data consists of test data that is significantly\ndifferent from the model's training data. DL models that perform well on\nin-domain test data could struggle on OOD data. Overcoming this discrepancy is\nessential to the reliable deployment of DL. Proper model calibration decreases\nthe number of spurious connections that are made between model features and\nclass outputs. Hence, calibrated DL can improve OOD generalization by only\nlearning features that are truly indicative of the respective classes. Previous\nwork proposed domain-aware model calibration (DOMINO) to improve DL\ncalibration, but it lacks designs for model generalizability to OOD data. In\nthis work, we propose DOMINO++, a dual-guidance and dynamic domain-aware loss\nregularization focused on OOD generalizability. DOMINO++ integrates\nexpert-guided and data-guided knowledge in its regularization. Unlike DOMINO\nwhich imposed a fixed scaling and regularization rate, DOMINO++ designs a\ndynamic scaling factor and an adaptive regularization rate. Comprehensive\nevaluations compare DOMINO++ with DOMINO and the baseline model for head tissue\nsegmentation from magnetic resonance images (MRIs) on OOD data. The OOD data\nconsists of synthetic noisy and rotated datasets, as well as real data using a\ndifferent MRI scanner from a separate site. DOMINO++'s superior performance\ndemonstrates its potential to improve the trustworthy deployment of DL on real\nclinical data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:58:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Stolte","Skylar E.",""],["Volle","Kyle",""],["Indahlastari","Aprinda",""],["Albizu","Alejandro",""],["Woods","Adam J.",""],["Brink","Kevin",""],["Hale","Matthew",""],["Fang","Ruogu",""]]}
{"id":"2308.10454","submitter":"Chen Cao","authors":"Chen Cao, Zijian Ding, Gyeong-Geon Lee, Jiajun Jiao, Jionghao Lin,\n  Xiaoming Zhai","title":"Elucidating STEM Concepts through Generative AI: A Multi-modal\n  Exploration of Analogical Reasoning","comments":null,"journal-ref":"IJCAI2023 Symposium on Multimodal Reasoning with LLM","doi":null,"report-no":null,"categories":"cs.AI cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study explores the integration of generative artificial intelligence\n(AI), specifically large language models, with multi-modal analogical reasoning\nas an innovative approach to enhance science, technology, engineering, and\nmathematics (STEM) education. We have developed a novel system that utilizes\nthe capacities of generative AI to transform intricate principles in\nmathematics, physics, and programming into comprehensible metaphors. To further\naugment the educational experience, these metaphors are subsequently converted\ninto visual form. Our study aims to enhance the learners' understanding of STEM\nconcepts and their learning engagement by using the visual metaphors. We\nexamine the efficacy of our system via a randomized A/B/C test, assessing\nlearning gains and motivation shifts among the learners. Our study demonstrates\nthe potential of applying large language models to educational practice on STEM\nsubjects. The results will shed light on the design of educational system in\nterms of harnessing AI's potential to empower educational stakeholders.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:00:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Chen",""],["Ding","Zijian",""],["Lee","Gyeong-Geon",""],["Jiao","Jiajun",""],["Lin","Jionghao",""],["Zhai","Xiaoming",""]]}
{"id":"2308.10455","submitter":"Philipp di Dio","authors":"Philipp J. di Dio","title":"On Positivity Preservers and their Generators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study $K$-positivity preserves\n$T:\\mathbb{R}[x_1,\\dots,x_n]\\to\\mathbb{R}[x_1,\\dots,x_n]$ with constant\ncoefficients and $K\\subseteq\\mathbb{R}^n$; especially their generators $A$,\ni.e., $T = e^A$. We completely describe the set of generators $A$ such that\n$e^{tA}$ is a positivity preserver for all $t\\geq 0$ (Theorem 4.8). We solve\nthe long standing open problem of describing the $K$-positivity preservers with\nconstant coefficients when $K\\subsetneq\\mathbb{R}^n$ (Theorem 3.4). The\ncomplete description of generators of $[0,\\infty)$-positivity preservers is\ngiven in Theorem 6.4. We give an example of a strange positivity action which\non $[0,\\infty)$ maps odd non-negative polynomials to odd non-negative\npolynomials but even non-negative polynomials are mapped to non-negative\nfunctions which are not polynomials. We introduce the concept of a convolution\nof (moment) sequences. The techniques we use come from (infinite dimensional\nmatrix) Lie group theory, measure theory (infinitely divisible measures and the\nL\\'evy--Khinchin formula), and of course the theory of moments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:06:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["di Dio","Philipp J.",""]]}
{"id":"2308.10456","submitter":"Seung-Il Choi","authors":"Seung-Il Choi, Young-Hun Kim, Young-Tak Oh","title":"Poset modules of the $0$-Hecke algebras and related quasisymmetric power\n  sum expansions","comments":"42 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Duchamp--Hivert--Thibon introduced the construction of a right\n$H_n(0)$-module, denoted as $M_P$, for any partial order $P$ on the set $[n]$.\nThis module is defined by specifying a suitable action of $H_n(0)$ on the set\nof linear extensions of $P$. In this paper, we refer to this module as the\nposet module associated with $P$. Firstly, we show that $\\bigoplus_{n \\ge 0}\nG_0(\\mathscr{P}(n))$ has a Hopf algebra structure that is isomorphic to the\nHopf algebra of quasisymmetric functions, where $\\mathscr{P}(n)$ is the full\nsubcategory of $\\textbf{mod-}H_n(0)$ whose objects are direct sums of finitely\nmany isomorphic copies of poset modules and $G_0(\\mathscr{P}(n))$ is the\nGrothendieck group of $\\mathscr{P}(n)$. We also demonstrate how\n(anti-)automorphism twists interact with these modules, the induction product\nand restrictions. Secondly, we investigate the (type 1) quasisymmetric power\nsum expansion of some quasi-analogues $Y_\\alpha$ of Schur functions, where\n$\\alpha$ is a composition. We show that they can be expressed as the sum of the\n$P$-partition generating functions of specific posets, which allows us to\nutilize the result established by Liu--Weselcouch. Additionally, we provide a\nnew algorithm for obtaining these posets. Using these findings, for the dual\nimmaculate function and the extended Schur function, we express the\ncoefficients appearing in the quasisymmetric power sum expansions in terms of\nborder strip tableaux.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:09:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Choi","Seung-Il",""],["Kim","Young-Hun",""],["Oh","Young-Tak",""]]}
{"id":"2308.10457","submitter":"Xinpeng Ling","authors":"Xinpeng Ling, Jie Fu, Zhili Chen","title":"Adaptive Local Steps Federated Learning with Differential Privacy Driven\n  by Convergence Analysis","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":"  Federated Learning (FL) is a distributed machine learning technique that\nallows model training among multiple devices or organizations without sharing\ndata. However, while FL ensures that the raw data is not directly accessible to\nexternal adversaries, adversaries can still obtain some statistical information\nabout the data through differential attacks. Differential Privacy (DP) has been\nproposed, which adds noise to the model or gradients to prevent adversaries\nfrom inferring private information from the transmitted parameters. We\nreconsider the framework of differential privacy federated learning in\nresource-constrained scenarios (privacy budget and communication resources). We\nanalyze the convergence of federated learning with differential privacy (DPFL)\non resource-constrained scenarios and propose an Adaptive Local Steps\nDifferential Privacy Federated Learning (ALS-DPFL) algorithm. We experiment our\nalgorithm on the FashionMNIST and Cifar-10 datasets and achieve quite good\nperformance relative to previous work.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:09:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ling","Xinpeng",""],["Fu","Jie",""],["Chen","Zhili",""]]}
{"id":"2308.10458","submitter":"Rui Luo","authors":"Rui Luo","title":"Unraveling Low-Dimensional Network Dynamics: A Fusion of Sparse\n  Identification and Proper Orthogonal Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study addresses the challenge of predicting network dynamics, such as\nforecasting disease spread in social networks or estimating species populations\nin predator-prey networks. Accurate predictions in large networks are difficult\ndue to the increasing number of network dynamics parameters that grow with the\nsize of the network population (e.g., each individual having its own contact\nand recovery rates in an epidemic process), and because the network topology is\nunknown or cannot be observed accurately.\n  Inspired by the low-dimensionality inherent in network dynamics, we propose a\ntwo-step method. First, we decompose the network dynamics into a composite of\nprincipal components, each weighted by time-dependent coefficients.\nSubsequently, we learn the governing differential equations for these\ntime-dependent coefficients using sparse regression over a function library\ncapable of describing the dynamics. We illustrate the effectiveness of our\nproposed approach using simulated network dynamics datasets. The results\nprovide compelling evidence of our method's potential to enhance predictions in\ncomplex networks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:14:08 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 08:40:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Luo","Rui",""]]}
{"id":"2308.10459","submitter":"Jia-Ming Lu","authors":"Jia-Ming Lu","title":"Variational Bonded Discrete Element Method with Manifold Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel approach that combines variational integration\nwith the bonded discrete element method (BDEM) to achieve faster and more\naccurate fracture simulations. The approach leverages the efficiency of\nimplicit integration and the accuracy of BDEM in modeling fracture phenomena.\nWe introduce a variational integrator and a manifold optimization approach\nutilizing a nullspace operator to speed up the solving of\nquaternion-constrained systems. Additionally, the paper presents an element\npacking and surface reconstruction method specifically designed for bonded\ndiscrete element methods. Results from the experiments prove that the proposed\nmethod offers 2.8 to 12 times faster state-of-the-art methods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:18:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lu","Jia-Ming",""]]}
{"id":"2308.10460","submitter":"Andronikos Paliathanasis","authors":"Andronikos Paliathanasis","title":"Unified dark energy from Chiral-Quintom model with a mixed potential in\n  Friedmann--Lema\\^{\\i}tre--Robertson--Walker cosmology","comments":"26 pages, 5 figures, to appear in Eur. Phys. J. C","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a spatially Friedmann-Lema\\^{\\i}tre-Robertson-Walker cosmology, we\npropose a multi-scalar field gravitational model. Specifically, we consider a\ntwo-scalar field cosmological model in which the kinetic components of the\nscalar fields establish a two-dimensional sphere of Lorentzian signature. For\nour Chiral-Quintom model we choose a mixed potential term $V( \\phi ,\\psi)\n=V_{0}e^{\\lambda\\phi}+U_{0}e^{\\kappa\\phi}\\psi^{\\frac{1}{\\sigma}}$ and we\ninvestigate the asymptotic limits of the cosmological parameters. This model\nfor $U_{0}=0$, provides a generalization of the hyperbolic inflation where the\nequation of the state parameter can cross the phantom divide line. When\n$U_{0}\\neq0$ we observe that this cosmological model exhibits asymptotic\nsolutions that encompass accelerated universes, big rip singularities, and\ndust-like solutions. Hence, this multi-scalar field model it can be regarded as\nas a dark energy unify model which describes a variety of asymptotic\ncosmological scenarios.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:27:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Paliathanasis","Andronikos",""]]}
{"id":"2308.10461","submitter":"Yuxi Mi","authors":"Yuxi Mi, Yuge Huang, Jiazhen Ji, Minyi Zhao, Jiaxiang Wu, Xingkun Xu,\n  Shouhong Ding, Shuigeng Zhou","title":"Privacy-Preserving Face Recognition Using Random Frequency Components","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ubiquitous use of face recognition has sparked increasing privacy\nconcerns, as unauthorized access to sensitive face images could compromise the\ninformation of individuals. This paper presents an in-depth study of the\nprivacy protection of face images' visual information and against recovery.\nDrawing on the perceptual disparity between humans and models, we propose to\nconceal visual information by pruning human-perceivable low-frequency\ncomponents. For impeding recovery, we first elucidate the seeming paradox\nbetween reducing model-exploitable information and retaining high recognition\naccuracy. Based on recent theoretical insights and our observation on model\nattention, we propose a solution to the dilemma, by advocating for the training\nand inference of recognition models on randomly selected frequency components.\nWe distill our findings into a novel privacy-preserving face recognition\nmethod, PartialFace. Extensive experiments demonstrate that PartialFace\neffectively balances privacy protection goals and recognition accuracy. Code is\navailable at: https://github.com/Tencent/TFace.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:31:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mi","Yuxi",""],["Huang","Yuge",""],["Ji","Jiazhen",""],["Zhao","Minyi",""],["Wu","Jiaxiang",""],["Xu","Xingkun",""],["Ding","Shouhong",""],["Zhou","Shuigeng",""]]}
{"id":"2308.10462","submitter":"Martin Weyssow","authors":"Martin Weyssow, Xin Zhou, Kisub Kim, David Lo and Houari Sahraoui","title":"Exploring Parameter-Efficient Fine-Tuning Techniques for Code Generation\n  with Large Language Models","comments":"10+2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) possess impressive capabilities to generate\nmeaningful code snippets given natural language intents in zero-shot, i.e.,\nwithout the need for specific fine-tuning. In the perspective of unleashing\ntheir full potential, prior work has demonstrated the benefits of fine-tuning\nthe models to task-specific data. However, fine-tuning process demands heavy\ncomputational costs and is intractable when resources are scarce, especially\nfor models with billions of parameters. In light of these challenges, previous\nstudies explored In-Context Learning (ICL) as an effective strategy to generate\ncontextually appropriate code without fine-tuning. However, it operates at\ninference time and does not involve learning task-specific parameters,\npotentially limiting the model's performance on downstream tasks. In this\ncontext, we foresee that Parameter-Efficient Fine-Tuning (PEFT) techniques\ncarry a high potential for efficiently specializing LLMs to task-specific data.\nIn this paper, we deliver a comprehensive study of LLMs with the impact of PEFT\ntechniques under the automated code generation scenario. Our experimental\nresults reveal the superiority and potential of such techniques over ICL on a\nwide range of LLMs in reducing the computational burden and improving\nperformance. Therefore, the study opens opportunities for broader applications\nof PEFT in software engineering scenarios.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:31:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Weyssow","Martin",""],["Zhou","Xin",""],["Kim","Kisub",""],["Lo","David",""],["Sahraoui","Houari",""]]}
{"id":"2308.10463","submitter":"Seyed Amin Seyed Fakhari","authors":"Seyed Amin Seyed Fakhari, Siamak Yassemi","title":"On the index of depth stability of symbolic powers of cover ideals of\n  graphs","comments":"arXiv admin note: substantial text overlap with arXiv:1709.03882","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a graph with $n$ vertices and let $S=\\mathbb{K}[x_1,\\dots,x_n]$ be\nthe polynomial ring in $n$ variables over a field $\\mathbb{K}$. Assume that\n$I(G)$ and $J(G)$ denote the edge ideal and the cover ideal of $G$,\nrespectively. We provide a combinatorial upper bound for the index of depth\nstability of symbolic powers of $J(G)$. As a consequence, we compute the depth\nof symbolic powers of cover ideals of fully clique-whiskered graphs. Meanwhile,\nwe determine a class of graphs $G$ with the property that the\nCastelnuovo--Mumford regularity of $S/I(G)$ is equal to the induced matching\nnumber of $G$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:35:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fakhari","Seyed Amin Seyed",""],["Yassemi","Siamak",""]]}
{"id":"2308.10464","submitter":"Seongmin Park","authors":"Seongmin Park, Jinkyu Seo, Jihwa Lee","title":"Unsupervised Dialogue Topic Segmentation in Hyperdimensional Space","comments":"Interspeech 2023","journal-ref":null,"doi":"10.21437/Interspeech.2023-1859","report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present HyperSeg, a hyperdimensional computing (HDC) approach to\nunsupervised dialogue topic segmentation. HDC is a class of vector symbolic\narchitectures that leverages the probabilistic orthogonality of randomly drawn\nvectors at extremely high dimensions (typically over 10,000). HDC generates\nrich token representations through its low-cost initialization of many\nunrelated vectors. This is especially beneficial in topic segmentation, which\noften operates as a resource-constrained pre-processing step for downstream\ntranscript understanding tasks. HyperSeg outperforms the current\nstate-of-the-art in 4 out of 5 segmentation benchmarks -- even when baselines\nare given partial access to the ground truth -- and is 10 times faster on\naverage. We show that HyperSeg also improves downstream summarization accuracy.\nWith HyperSeg, we demonstrate the viability of HDC in a major language task. We\nopen-source HyperSeg to provide a strong baseline for unsupervised topic\nsegmentation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:42:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Park","Seongmin",""],["Seo","Jinkyu",""],["Lee","Jihwa",""]]}
{"id":"2308.10465","submitter":"Yuping Chen","authors":"Xueyi Wang, Tingge Yuan, Jiangwei Wu, Yuping Chen, Xianfeng Chen","title":"Enhanced temperature sensing by multi-mode coupling in an on-chip\n  microcavity system","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":"  The micro-cavity is a promising sensor platform, any perturbation would\ndisturb its linewidth, cause resonance shift or splitting. However, such\nsensing resolution is limited by the cavity's optical quality factor and mode\nvolume. Here we propose and demonstrate in an on-chip integrated microcavity\nsystem that resolution of a self referenced sensor could be enhanced with multi\nmode coupling.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 04:52:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Xueyi",""],["Yuan","Tingge",""],["Wu","Jiangwei",""],["Chen","Yuping",""],["Chen","Xianfeng",""]]}
{"id":"2308.10466","submitter":"Ye Wang","authors":"Ye Wang, Erik Weyer, Chris Manzie, Angus R. Simpson, Lisa Blinco","title":"Stochastic Co-design of Storage and Control for Water Distribution\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Water distribution systems (WDSs) are typically designed with a conservative\nestimate of the ability of a control system to utilize the available\ninfrastructure. The controller is subsequently designed and tuned based on the\ndesigned water distribution system. This sequential approach may lead to\nconservativeness in both design and control steps, impacting both operational\nefficiency and economic costs. In this work, we consider simultaneously\ndesigning infrastructure and developing a control strategy, the co-design\nproblem, to improve the overall system efficiency. However, implementing a\nco-design problem for water distribution systems is a challenging task given\nthe presence of stochastic variables (e.g. water demands and electricity\nprices). In this work, we propose a tractable stochastic co-design method to\ndesign the best tank size and optimal control parameters for WDS, where the\nexpected operating costs are established based on Markov chain theory. We also\ngive a theoretical result that investigates the average long-run co-design cost\nconverging to the expected cost with probability 1. Furthermore, the method can\nalso be applied to an existing WDS to improve operation of the system. We\ndemonstrate the proposed co-design method on three examples and a real-world\ncase study in South Australia.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:05:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Ye",""],["Weyer","Erik",""],["Manzie","Chris",""],["Simpson","Angus R.",""],["Blinco","Lisa",""]]}
{"id":"2308.10467","submitter":"Chengzhi Huang","authors":"Chengzhi Huang and Hui Li","title":"Single-User Injection for Invisible Shilling Attack against Recommender\n  Systems","comments":"CIKM 2023. 10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommendation systems (RS) are crucial for alleviating the information\noverload problem. Due to its pivotal role in guiding users to make decisions,\nunscrupulous parties are lured to launch attacks against RS to affect the\ndecisions of normal users and gain illegal profits. Among various types of\nattacks, shilling attack is one of the most subsistent and profitable attacks.\nIn shilling attack, an adversarial party injects a number of well-designed fake\nuser profiles into the system to mislead RS so that the attack goal can be\nachieved. Although existing shilling attack methods have achieved promising\nresults, they all adopt the attack paradigm of multi-user injection, where some\nfake user profiles are required. This paper provides the first study of\nshilling attack in an extremely limited scenario: only one fake user profile is\ninjected into the victim RS to launch shilling attacks (i.e., single-user\ninjection). We propose a novel single-user injection method SUI-Attack for\ninvisible shilling attack. SUI-Attack is a graph based attack method that\nmodels shilling attack as a node generation task over the user-item bipartite\ngraph of the victim RS, and it constructs the fake user profile by generating\nuser features and edges that link the fake user to items. Extensive experiments\ndemonstrate that SUI-Attack can achieve promising attack results in single-user\ninjection. In addition to its attack power, SUI-Attack increases the\nstealthiness of shilling attack and reduces the risk of being detected. We\nprovide our implementation at: https://github.com/KDEGroup/SUI-Attack.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:08:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Chengzhi",""],["Li","Hui",""]]}
{"id":"2308.10468","submitter":"Tao Han","authors":"Tao Han, Lei Bai, Lingbo Liu, Wanli Ouyang","title":"STEERER: Resolving Scale Variations for Counting and Localization via\n  Selective Inheritance Learning","comments":"Accepted by ICCV2023, 9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scale variation is a deep-rooted problem in object counting, which has not\nbeen effectively addressed by existing scale-aware algorithms. An important\nfactor is that they typically involve cooperative learning across\nmulti-resolutions, which could be suboptimal for learning the most\ndiscriminative features from each scale. In this paper, we propose a novel\nmethod termed STEERER (\\textbf{S}elec\\textbf{T}iv\\textbf{E}\ninh\\textbf{ER}itance l\\textbf{E}a\\textbf{R}ning) that addresses the issue of\nscale variations in object counting. STEERER selects the most suitable scale\nfor patch objects to boost feature extraction and only inherits discriminative\nfeatures from lower to higher resolution progressively. The main insights of\nSTEERER are a dedicated Feature Selection and Inheritance Adaptor (FSIA), which\nselectively forwards scale-customized features at each scale, and a Masked\nSelection and Inheritance Loss (MSIL) that helps to achieve high-quality\ndensity maps across all scales. Our experimental results on nine datasets with\ncounting and localization tasks demonstrate the unprecedented scale\ngeneralization ability of STEERER. Code is available at\n\\url{https://github.com/taohan10200/STEERER}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:09:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Han","Tao",""],["Bai","Lei",""],["Liu","Lingbo",""],["Ouyang","Wanli",""]]}